US 7,072,916 B1Grant
Instant snapshot
Issue Date:2006-07-04
•27 Claims
•4 Drawing Sheets
Abstract
An improved method and apparatus for creating a snapshot of a file system. A record of which blocks are being used by a snapshot is included in the snapshot itself, allowing effectively instantaneous snapshot creation and deletion. The state of the active file system is described by a set of metafiles; in particular, a bitmap (henceforth the “active map”) describes which blocks are free and which are in use. The inode file describes which blocks are used by each file, including the metafiles. The inode file itself is described by a special root inode, also known as the “fsinfo block”. The system begins creating a new snapshot by making a copy of the root inode. This copy of the root inode becomes the root of the snapshot.
Metadata
Assignee
- Network Appliance, Inc.
Inventors
- Blake Lewis
- John K. Edwards
- Srinivasan Viswanathan
Application Information
Application Number:US 09/642,061
Filing Date:2000-08-18
Priority Date:2000-08-18
Art Unit:2167
Classifications
IPC:
G06F12/00
Patent Drawings (4 sheets)
Description
Background of the Invention
[0001] 1. Field of Invention
[0002] This invention relates to data storage systems.
[0003] 2. Related Art
[0004] Snapshots of a file system capture the contents of the files and directories in a file system at a particular point in time. Such snapshots have several uses. They allow the users of the file system to recover earlier versions of a file following an unintended deletion or modification. The contents of the snapshot can be copied to tape to provide a backup copy of the file system, and it can be copied to another file server and used as a replica. File systems, including the WAFL (Write Anywhere File Layout) file system, include a copy-on-write snapshot mechanism. Snapshot block ownership is recorded by updating the block's entry in the block map file, a bitmap associated with the vacancy of blocks.
[0005] One problem with the prior art of creating snapshots is that the requirement for additional file system metadata in the active filesystem to keep track of which blocks snapshots occupy. This metadata requires 4 bytes per 4-KB file system block, i.e., 1/1024th of the file system. These methods are inefficient both in their use of storage space and in the time needed to create the snapshots.
[0006] A second problem with earlier snapshot implementations, was the time consuming steps of writing out a description of the snapshot state on creation and removing it on deletion.
[0007] A third problem with earlier copy-on-write mechanisms, was the required steps consumed a considerable amount of time and file system space. For example, some systems, such as those supplied with DCE/DFS include a copy-on-write mechanism for creating snapshots (called “clones”). The copy-on-write mechanism was used to record which blocks each clone occupied. Such systems require a new copy of the inode file and the indirect blocks for all files and directories are created when updating all of the original inodes.
[0008] Accordingly, it would be advantageous to provide an improved technique for more quickly and efficiently capturing the contents of the files and directories in the file system at a particular point in time. This is achieved in an embodiment of the invention that is not subject to the drawbacks of the related art.
Summary of the Invention
[0009] The invention provides an improved method and apparatus for creating a snapshot of a file system.
[0010] In a first aspect of the invention, a “copy-on-write” mechanism is used. An effective snapshot mechanism must be efficient both in its use of storage space and in the time needed to create it because file systems are often large. The snapshot uses the same blocks as the active file system until the active file system is modified. Whenever a modification occurs, the modified data is copied to a new block and the old data is saved (henceforth called “copy-on-write”). In this way, the snapshot only uses space where it differs from the active file system, and the amount of work required to create the snapshot initially is small.
[0011] In a second aspect of the invention, a record of which blocks are being used by the snapshot is included in the snapshot itself, allowing effectively instantaneous snapshot creation and deletion.
[0012] In a third aspect of the invention, the state of the active file system is described by a set of metafiles; in particular, a bitmap (henceforth the “active map”) describes which blocks are free and which are in use by the active file system. The inode file describes which blocks are used by each file, including the metafiles. The inode file itself is described by a special root inode, also known as the “fsinfo block.” This copy of the root inode becomes the root of the snapshot. The root inode captures all required states for creating the snapshot such as the location of all files and directories in the file system. During subsequent updates of the active file system, the system consults the bitmap included in the snapshot (the “snapmap”) to determine whether a block is free for reuse or belongs to a snapshot. This mechanism allows the active file system to keep track of which blocks each snapshot uses without recording any additional bookkeeping information in the file system.
[0013] In a fourth aspect of the invention, a snapshot can also be deleted instantaneously simply by discarding its root inode. Further bookkeeping is not required, because the snapshot includes it's own description.
[0014] In a fifth aspect of the invention, the performance overhead associated with the search for free blocks is reduced by the inclusion of a summary file. The summary file identifies blocks that are used by at least one snapshot; it is the logical OR of all the snapmap files. The write allocation code decides whether a block is free by examining the active map and the summary file. The active map indicates whether the block is currently in use in the active file system. The summary file indicates whether the block is used by any snapshot.
[0015] In a sixth aspect of the invention, the summary file is updated in the background after the creation or deletion of a snapshot. This occurs concurrently with other file system operations. Two bits are stored in the file system “fsinfo block” for each snapshot. These two bits indicate whether the summary file needs to be updated using the snapshot's snapmap information as a consequence of its creation or deletion. When a block is freed in the active file system, the corresponding block of the summary file is updated with the snapmap from the most recently created snapshot, if this has not already been done. An in-core bit map records the completed updates to avoid repeating them unnecessarily. This ensures that the combination of the active bitmap and the summary file will consistently identify all blocks that are currently in use. Additionally, the summary file is updated to reflect the effect of any recent snapshot deletions when freeing a block in the active file system. This allows reuse of blocks that are now entirely free. After updating the summary file following a snapshot creation or deletion, the corresponding bit in the fsinfo block is adjusted.
[0016] In a seventh aspect of the invention, the algorithm for deleting a snapshot involves examining the snapmaps of the deleted snapshot and the snapmaps of the next oldest and next youngest snapshot. A block that was used by the deleted snapshot but is not used by its neighbors can be marked free in the summary file, as no remaining snapshot is using it. However, these freed blocks cannot be reused immediately, as the snapmap of the deleted snapshot must be preserved until summary updating is complete. During a snapdelete free blocks are found by using the logical OR of the active bitmap, the summary file, and the snapmaps of all snapshots for which post-deletion updating is in progress. In other words, the snapmap of the deleted snapshot protects the snapshot from reuse until it is no longer needed for updating.
[0017] In the preferred embodiment, the invention is operative on WAFL file system. However, it is still possible for the invention to be applied to any computer data storage system such as a database system or a store and forward system such as cache or RAM if the data is kept for a limited period of time.
Brief Description of the Drawings
[0018] FIG. 1 shows a block diagram of a system for an instant snapshot.
[0019] FIG. 2 shows a block diagram of an instant snapshot.
[0020] FIG. 3 shows a flow diagram of a method for creating a snapshot.
Incorporated Disclosures
[0021] The inventions described herein can be used in conjunction with inventions described in the following applications:
-
- [0022] U.S. patent application Ser. No. 09/642,063, Express Mail Mailing No. EL 524781089US, filed Aug. 18, 2000, in the name of Blake LEWIS, titled “Reserving File System Blocks”
- [0023] U.S. patent application Ser. No. 09/642,062, Express Mail Mailing No. EL524780242US, filed Aug. 18, 2000, in the name of Rajesh SUNDARAM, titled “Dynamic Data Storage”
- [0024] U.S. patent application Ser. No. 09/642,066, Express Mail Mailing No. EL524780256US, filed Aug. 18, 2000, in the name of Ray CHEN, titled “manipulation of Zombie Files and Evil-Twin Files”
- [0025] U.S. patent application Ser. No. 09/642,064, in the names of Scott SCHOENTHAL, Express Mailing Number EL524781075US, titled “Persistent and Reliable Delivery of Event Messages”, assigned to the same assignee, and all pending cases claiming the priority thereof.
and - [0026] U.S. patent application Ser. No. 09/642,065, in the names of Douglas P. DOUCETTE, Express Mailing Number EL524781092US, titled “Improved Space Allocation in a Write Anywhere File System”, assigned to the same assignee, and all pending cases claiming the priority thereof.
Detailed Description of the Preferred Embodiment
[0027] In the following description, a preferred embodiment of the invention is described with regard to preferred process steps and data structures. However, those skilled in the art would recognize, after perusal of this application, that embodiments of the invention might be implemented using a variety of other techniques without undue experimentation or further invention, and that such other techniques would be within the scope and spirit of the invention.
Lexicography
[0028] As used herein, use of the following terms refer or relate to aspects of the invention as described below. The general meaning of these terms is intended to be illustory and in no way limiting.
-
- [0029] Inode—In general, the term “inode” refers to data structures that include information about files in Unix and other file systems. Each file has an inode and is identified by an inode number (i-number) in the file system where it resides. Inodes provide important information on files such as user and group ownership, access mode (read, write, execute permissions) and type. An inode points to the file blocks or indirect blocks of the file it represents.
- [0030] Sector—In general, the term “sector” refers to a physical section of a disk drive including a collection of bytes, such as 512 bytes.
- [0031] Data Storage Block—In general, the phrase “data storage block” refers to specific allocation areas on a hard disk. The allocation area is a collection of sectors, such as 8 sectors or 4,096 bytes, commonly called 4 K bytes or 4-KB.
- [0032] File Block—In general, the phrase “file block” refers to a standard size block of data including some or all of the data in a file. In the preferred embodiment, the file block is the same size as a data storage block.
- [0033] fsinfo (File System Information Block)—In general, the phrase “file system information block” refers to one or more copies of a block known as the “fsinfo block”. These blocks are located at fixed locations on the disks. The fsinfo block includes data about the volume including the size of the volume, volume level options, language and more.
- [0034] WAFL (Write Anywhere File Layout)—In general, the term “WAFL” refers to a high level structure for a file system. Pointers are used for locating data. All the data is included in files. These files can be written anywhere on the disk in chunks of file blocks placed in data storage blocks.
- [0035] Volume In general, the term “volume” refers to a single file system. The file system may be composed of a collection of disk drives.
- [0036] Consistency Point (CP)—In general, the term “CP” refers to a time that a file system reaches a consistent state. When this state is reached, all the files have been written to all the blocks and are safely on disk and the one or more copies of redundant fsinfo blocks get written out. If the system crashes before the fsinfo blocks go out, all other changes are lost and the system reverts back to the last CP. The file system advances atomically from one CP to the next.
- [0037] Consistent State—In general, the phrase “consistent state” refers to the system configuration of files in blocks after the CP is reached.
- [0038] Range—In general, the term “range” refers to a group of blocks, such as 1,024 blocks.
- [0039] Active file system—In general, the phrase “active file system” refers to the current file system arrived at with the most recent CP. In the preferred embodiment, the active file system includes the active map, the summary map and points to all snapshots and other data storage blocks through a hierarchy of inodes, indirect data storage blocks and more.
- [0040] Active map—In general, the phrase “active map” refers to a to a file including a bitmap associated with the vacancy of blocks of the active file system.
- [0041] Snapshot—In general, the term “snapshot” refers to a copy of the file system. The snapshot diverges from the active file system over time as the active file system is modified. A snapshot can be used to return the file system to a particular CP (consistency point).
- [0042] Snapmap—In general, the term “snapmap” refers to a file including a bitmap associated with the vacancy of blocks of a snapshot. The active map diverges from a snapmap over time as the blocks used by the active file system change during consistency points.
- [0043] Summary map—In general, the term “summary map” refers to a file including an IOR (inclusive OR) bitmap of all the snapmaps.
- [0044] Space map—In general, the term “space map” refers to a file including an array of numbers which describe the number of storage blocks used in an allocation area.
- [0045] Blockmap—In general, the term “blockmap” refers to a map describing the status of the blocks in the file system.
- [0046] Snapdelete—In general, the term “snapdelete” refers to an operation that removes a particular snapshot from the file system. This command can allow a storage block to be freed for reallocation provided no other snapshot or the active file system uses the storage block.
- [0047] Snapcreate—In general, the term “snapcreate” refers to the operation of retaining a consistency point and preserving it as a snapshot.
[0048] As described herein, the scope and spirit of the invention is not limited to any of the definitions or specific examples shown therein, but is intended to include the most general concepts embodied by these and other terms.
System Elements
[0049] FIG. 1 shows a block diagram of a system for an instant snapshot.
[0050] The root block 100 includes the inode of the inode file 105 plus other information regarding the active file system 110, the active map 115, previous active file systems known as snapshots 120, 125, 130 and 135 and their respective snapmaps 140, 145, 150 and 155.
[0051] The active map 115 of the active file system 110 is a bitmap associated with the vacancy of blocks for the active file system 110. The respective snapmaps 140, 145, 150 and 155 are active maps that can be associated with particular snapshots 120, 125, 130 and 135. A summary map 160 is an inclusive OR of the snapmaps 140, 145, 150 and 155. Also shown are other blocks 117 including double indirect blocks 130 and 132, indirect blocks 165, 166 and 167 and data blocks 170, 171, 172 and 173. Finally, FIG. 1 shows the spacemap 180 including a collection of spacemap blocks of numbers 182, 184, 186, 188 and 190.
[0052] The root block 100 includes a collection of pointers that are written to the file system when the system has reached a new CP (consistency point). The pointers are aimed at a set of indirect (or triple indirect, or double indirect) inode blocks (not shown) or directly to the inode file 105 consisting of a set of blocks known as inode blocks 191, 192, 193, 194 and 195.
[0053] The number of total blocks determines the number of indirect layers of blocks in the file system. The root block 100 includes a standard quantity of data, such as 128 bytes. 64 of these 128 bytes describe file size and other properties; the remaining 64 bytes are a collection of pointers to the inode blocks 191, 192, 193, 194 and 195 in the inode file 105. Each pointer in the preferred embodiment is made of 4 bytes. Thus, there are approximately 16 pointer entries in the root block 100 aimed at 16 corresponding inode blocks of the inode file 105 each including 4 K bytes. If there are more than 16 inode blocks, indirect inode blocks are used.
[0054] In a preferred embodiment, file blocks are 4096 bytes and inodes are 128 bytes. It follows that each block of the inode file contains 32 (i.e. 4,096/128) separate inodes that point to other blocks 117 in the active file system.
[0055] Inode block 193 in the inode file 105 points to a set of blocks (1, 2, 3, . . . , P) called the active map 115. Each block in the active map 115 is a bitmap where each bit corresponds to a block in the entire volume. A “1” in a particular position in the bitmap correlates with a particular allocated block in the active file system 110. Conversely, a “0” correlates to the particular block being unused by the active file system 110. Since each block in the active map 115 can describe up to 32 K blocks or 128 MB, 8 blocks are required per GB, 8 K blocks per TB.
[0056] Another inode block in the inode file 105 is inode block N 195. This block includes a set of pointers to a collection of snapshots 120, 125, 130 and 135 of the volume. Each snapshot includes all the information of a root block and is equivalent to an older root block from a previous active file system. The snapshot 120 may be created at any past CP. Regardless when the snapshot is created, the snapshot is an exact copy of the active file system at that time.
[0057] The newest snapshot 120 includes a collection of pointers that are aimed directly or indirectly to the same inode file 105 as the root block 100 of the active file system 110. As the active file system 110 changes (generally from writing files, deleting files, changing attributes of files, renaming file, modifying their contents and related activities), the active file system and snapshot will diverge over time. Given the slow rate of divergence of an active file system from a snapshot, any two snapshots will share many of the same blocks.
[0058] The newest snapshot 120 is associated with snapmap 140. Snapmap 140 is a bit map that is initially identical to the active map 115. The older snapshots 125, 130 and 135 have a corresponding collection of snapmaps 145, 150 and 155. Like the active map 115, these snapmaps 145, 150 and 155 include a set of blocks including bitmaps that correspond to allocated and free blocks for the particular CP when the particular snapmaps 145, 150 and 155 were created.
[0059] Any active file system may have a structure that includes pointers to one or more snapshots. Snapshots are identical to the active file system when they are created. It follows that snapshots contain pointers to older snapshots. There can be a large number of previous snapshots in any active file system or snapshot. In the event that there are no snapshot, there will be no pointers in the active file system.
[0060] Blocks not used in the active file system 110 are not necessarily available for allocation or reallocation because the blocks may be used by snapshots. Blocks used by snapshots are freed by removing a snapshot using the snapdelete command. When a snapshot is deleted any block used only by that snapshot and not by other snapshots nor by the active file system becomes free for reuse by WAFL. If no other snapshot or active files uses the block, then the block can be freed and written over during the next copy on-wrote-execution by WAFL. The system can relatively efficiently determine whether a block can be removed using the “nearest neighbor rule”. If the previous and next snapshot do not allocate a particular block in their respective snapmaps, then the block can be freed for reuse by WAFL. For WAFL to find free space to write new data or metadata, it could search the active map 115 and the snapmaps (140, 145, 150 and 155) of the snapshots (120, 125, 130 and 135) to find blocks that are totally unused. This would be very inefficient; thus it is preferable to use the active map and the summary map as described below
[0061] A summary map 160 is created by using an IOR (inclusive OR) operation 139 on the snapmaps 140, 145, 150 and 155. Like the active map 115 and the snapmaps 140, 145, 150 and 155, the summary map 160 is a file whose data blocks (1, 2, 3, . . . Q) contained a bit map. Each bit in each block of the summary map describes the allocation status of one block in the system with “1” being allocated and “0” being free. The summary map 160 describes the allocated and free blocks of the entire volume from all the snapshots 120, 125, 130 and 135 combined. The use of the summary file 160 is to avoid overwriting blocks in use by snapshots.
[0062] An IOR operation on sets of blocks (such as 1,024 blocks) of the active map 115 and the summary map 160 produces a spacemap 180. Unlike the active map 115 and the summary map 160, which are a set of blocks containing bitmaps, the spacemap 180 is a set of blocks including 182, 184, 186, 188 and 190 containing arrays of binary numbers. The binary numbers in the array represent the addition of all the vacant blocks in a region containing a fixed number of blocks, such as 1,024 blocks. The array of binary numbers in the single spacemap block 181 represents the allocation of all blocks for all snapshots and the active file system in one range of 1,024 blocks. Each of the binary numbers 182, 184, 186, 188 and 190 in the array are a fixed length. In a preferred embodiment, the binary numbers are 16 bit numbers, although only 10 bits are used.
[0063] In a preferred embodiment, the large spacemap array binary number 182 (0000001111111110=1,021 in decimal units) tells the file system that the corresponding range is relatively full. In such embodiments, the largest binary number 00001111111111 (1,023 in decimal) represents a range containing at most one empty block. The small binary number 184 (0000000000001110=13 in decimal units) instructs the file system that the related range is relatively empty. The spacemap 180 is thus a representation in a very compact form of the allocation of all the blocks in the volume broken into 1,024 block sections. Each 16 bit number in the array of the spacemap 180 corresponds to the allocations of blocks in the range containing 1,024 blocks or about 4 MB. Each spacemap block 180 has about 2,000 binary numbers in the array and they describe the allocation status for 8 GB. Unlike the summary map 120, the spacemap block 180 needs to be determined whenever a file needs to be written.
[0064] FIG. 2 shows a block diagram of an instant snapshot.
[0065] The old root block 200 of snapshot #1 201 includes the inode of the inode file 202 plus other information regarding the previous active file system known as snapshot #1 201, the snap map 205, earlier active file systems known as snapshot #2 210, snapshot #3 215 and snapshot #4 220, and their respective snapmaps 225, 230 and 235.
[0066] The snapmap 205 of the previous active file system, snapshot #1 201, is a bitmap associated with the vacancy of blocks for snapshot #1 201. The respective snapmaps 225, 230 and 235 are earlier active maps that can be associated with particular snapshots 210, 215 and 220. A summary map 245 is an inclusive OR of the snapmaps 225, 230 and 235. Also shown are other blocks 211 including double indirect blocks 240 and 241, indirect blocks 250, 251 and 252, and data blocks 260, 261, 262, and 263. Finally, FIG. 2 shows the spacemap 270 of snapshot #1 201 including a collection of spacemap blocks of binary numbers.
[0067] The old root block 200 includes a collection of pointers that were written to the previous active file system when the system had reached the previous CP. The pointers are aimed at a set of indirect (or triple indirect, or double indirect) inode blocks (not shown) or directly to the inode file 202 consisting of a set of blocks known as inode blocks 281, 282, 283, 284 and 285.
[0068] An inode block 281 in the inode file 202 points to other blocks 211 in the old root block 200 starting with double indirect blocks 240 and 241 (there could also be triple indirect blocks). The double indirect blocks 240 and 241 include pointers to indirect blocks 250, 251 and 252. The indirect blocks 250, 251 and 252 include pointers that are directed to data leaf blocks 260, 261, 262, and 263 of the snapshot #1 201.
[0069] Inode block 283 in the inode file 202 points to a set of blocks (1, 2, 3, . . . , P) called the snap map 205. Each block in the snap map 205 is a bitmap where each bit corresponds to a block in the entire volume. A “1”in a particular position in the bitmap correlates with a particular allocated block in the snapshot #1 201. Conversely, a “0” correlates to the particular block being free for allocation in the old root block 200. Each block in the snap map 205 can describe up to 32 K blocks or 128 MB.
[0070] Inode file 202 also includes inode block N 285. This block includes a set of pointers to a collection of earlier snapshots, snapshot #2 210, shapshot #3 215 and snapshot #4 220 of the volume. Each snapshot includes all the information of a root block and is equivalent to an older root block from a previous active file system.
[0071] Snapshot #1 201 also includes an old summary map 245 and old spacemap blocks 270. Although these blocks of data are included in snapshot #1 201 and previous snapshots, in a preferred embodiment, this data is not used by the active file system.
Method of Use
[0072] FIG. 3 shows a flow diagram of a method for using a system as shown in FIG. 1 .
[0073] A method 300 is performed by the file system 110. Although the method 300 is described serially, the steps of the method 300 can be performed by separate elements in conjunction or in parallel, whether asynchronously, in a pipelined manner, or otherwise. There is no particular requirement that the method 300 be performed in the same order in which this description lists the steps, except where so indicated.
[0074] At a flow point 305, the file system 110 is ready to perform a method 300.
[0075] At a step 310, a user will request a snapshot of the file system 110.
[0076] At a step 315, a timer associated with the file system 110 initiates the creation of a new snapshot.
[0077] At a step 320, the file system 110 receives a request to make a snapshot.
[0078] At a step 325, the file system 110 creates a new file.
[0079] At a step 335, the file system 110 makes the file read only.
[0080] At a step 340, the file system 110 updates the new summary map by using an inclusive OR of the most recent snapmap and the existing summary file. This step must be done before any blocks are freed in the corresponding active map block. If multiple snapshots are created such that the processing overlaps in time, the update in step 340 need only be done for the most recently created snapshot.
[0081] At a flow point 345, the snapshot create and the summary file update is completed and the snapshot creation is done.
[0082] An analogous method may be performed for snapshot delete.
Alternative Embodiments
[0083] Although preferred embodiments are disclosed herein, many variations are possible which remain within the concept, scope, and spirit of the invention, and these variations would become clear to those skilled in the art after perusal of this application.
Claims
The invention claimed is:
1. A method of capturing the contents of files and directories in a file system, said file system comprising a set of storage blocks for plural files in a mass storage system including steps of
recording an active map in said file system of said storage blocks used by said plural files in said active file system;
recording a consistency point in said file system including a consistent version of said plural files in said file system at a previous time, said consistency point including a copy of said active map at said previous time;
refraining from writing data to storage blocks in response to said active map and at least one said copy of said active map included in said consistency point; and
generating a summary map by performing a logical OR operation with at least one said copy of said active map included in said consistency point.
2. A method as in claim 1, wherein said step of refraining includes determining a logical union of said storage blocks used by one or more of said copies of said active map included in said consistency point.
3. A method as in claim 1, wherein said step of refraining includes determining a subset of said storage blocks used by one or more of said copies of said active map included in said consistency point.
4. A method as in claim 1, wherein said file system is a WAFL file system.
5. A method as in claim 1, wherein said active map included in said consistency point is a snapmap.
6. A method as in claim 5, further including the step of removing a root inode of said snapmap using a snap delete.
7. A method as in claim 6, further including steps of determining not to write to a block after said step of removing, provided a previous or next snapmap uses said block.
8. A method as in claim 1, further including steps of copying modified data to a new block and saving old data in a current data block so as to implement a copy-on-write mechanism.
9. A method as in claim 1, wherein said step of refraining from writing data to said storage blocks is accomplished by being responsive to said summary map.
10. A file system comprising:
a set of storage blocks for plural files in a mass storage system;
an active map in said file system of said storage blocks used by said plural files in said active file system; and
a consistency point recorded in said file system, said consistency point including a consistent version of said plural files in said file system at a previous time and a copy of said active map at said previous time;
wherein said file system refrains from writing data to storage blocks in response to said active map and at least one said copy of said active map included in said consistency point; and
wherein said file system generates a summary map by performing a logical OR operation with at least one said copy of said active map included in said consistency point.
11. A file system as in claim 10, wherein in order to determine to refrain from writing said data, said file system determines a logical union of said storage blocks used by one or more of said copies of said active map included in said consistency point.
12. A file system as in claim 10, wherein in order to determine to refrain from writing said data, said file system determines a subset of said storage blocks used by one or more of said copies of said active map included in said consistency point.
13. A file system as in claim 10, wherein said file system is a WAFL file system.
14. A file system as in claim 10, wherein said active map included in said consistency point is a snapmap.
15. A file system as in claim 14, wherein said file system removes a root inode of said snapmap using a snap delete.
16. A file system as in claim 15, wherein after said file system removes said root inode of said snapmap, said file system determines not to write to a block provided a previous or next snapmap uses said block.
17. A file system as in claim 10, wherein said file system further includes a copy-on-write mechanism that copies modified data to a new block and saves old data in a current data block.
18. A file system as in claim 10, wherein said file system refrains from writing data to said storage blocks responsive to said summary map.
19. A memory storing information including instructions, the instructions executable by a processor to capture the contents of files and directories in a file system, said file system comprising a set of storage blocks for plural files in a mass storage system, the instructions comprising the steps of: (a) recording an active map in said file system of said storage blocks used by said plural files in said active file system, (b) recording a consistency point in said file system including a consistent version of said plural files in said file system at a previous time, said consistency point including a copy of said active map at said previous time, (c) refraining from writing data to storage blocks in response to said active map and at least one said copy of said active map included in said consistency point, and (d) generating a summary map by performing a logical OR operation with at least one said copy of said active map included in said consistency point.
20. A memory as in claim 19, wherein said step of refraining includes determining a logical union of said storage blocks used by one or more of said copies of said active map included in said consistency point.
21. A memory as in claim 19, wherein said step of refraining includes determining a subset of said storage blocks used by one or more of said copies of said active map included in said consistency point.
22. A memory as in claim 19, wherein said file system is a WAFL file system.
23. A memory as in claim 19, wherein said active map included in said consistency point is a snapmap.
24. A memory as in claim 23, wherein the instructions further include the step of removing a root inode of said snapmap using a snap delete.
25. A memory as in claim 24, wherein the instructions further include steps of determining not to write to a block after said step of removing, provided a previous or next snapmap uses said block.
26. A memory as in claim 19, wherein the instructions further include steps of copying modified data to a new block and saving old data in a current data block so as to implement a copy-on-write mechanism.
27. A memory as in claim 19, wherein said step of refraining from writing data to said storage blocks is accomplished by being responsive to said summary map.
Patent Citations (89)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4527232(A) | 1985-07-01 | Bechtolsheim | Applicant |
| US4742447(A) | 1988-05-01 | Duvall et al. | Applicant |
| US4742450(A) | 1988-05-01 | Duvall et al. | Applicant |
| US4761785(A) | 1988-08-01 | Clark et al. | Applicant |
| US4875159(A) | 1989-10-01 | Cary et al. | Applicant |
| US4937763(A) | 1990-06-01 | Mott | Applicant |
| US5008786(A) | 1991-04-01 | Thatte | Applicant |
| US5043876(A) | 1991-08-01 | Terry | Applicant |
| US5067099(A) | 1991-11-01 | McCown et al. | Applicant |
| US5088081(A) | 1992-02-01 | Farr | Applicant |
| US5144659(A) | 1992-09-01 | Jones | Applicant |
| US5146588(A) | 1992-09-01 | Crater et al. | Applicant |
| US5155835(A) | 1992-10-01 | Belsan | Applicant |
| US5163131(A) | 1992-11-01 | Row et al. | Applicant |
| US5163148(A) | 1992-11-01 | Walls | Applicant |
| US5195100(A) | 1993-03-01 | Katz et al. | Applicant |
| US5218695(A) | 1993-06-01 | Noveck et al. | Applicant |
| US5218696(A) | 1993-06-01 | Baird et al. | Applicant |
| US5222217(A) | 1993-06-01 | Blount et al. | Applicant |
| US5235601(A) | 1993-08-01 | Stallmo et al. | Applicant |
| US5274799(A) | 1993-12-01 | Brant et al. | Applicant |
| US5274807(A) | 1993-12-01 | Hoshen et al. | Applicant |
| US5297265(A) | 1994-03-01 | Frank et al. | Applicant |
| US5305326(A) | 1994-04-01 | Solomon et al. | Applicant |
| US5315602(A) | 1994-05-01 | Noya et al. | Applicant |
| US5317731(A) | 1994-05-01 | Dias et al. | Examiner |
| US5333305(A) | 1994-07-01 | Neufeld | Applicant |
| US5335235(A) | 1994-08-01 | Arnott | Applicant |
| US5357509(A) | 1994-10-01 | Ohizumi | Applicant |
| US5379417(A) | 1995-01-01 | Lui et al. | Applicant |
| US5490248(A) | 1996-02-01 | Dan et al. | Applicant |
| US5502836(A) | 1996-03-01 | Hale et al. | Applicant |
| US5649152(A) | 1997-07-01 | Ohran et al. | Applicant |
| US5668943(A) | 1997-09-01 | Attanasio et al. | Applicant |
| US5668958(A) | 1997-09-01 | Bendert et al. | Applicant |
| US5675726(A) | 1997-10-01 | Hohenstein et al. | Applicant |
| US5678006(A) | 1997-10-01 | Valizadeh et al. | Applicant |
| US5737744(A) | 1998-04-01 | Callison et al. | Applicant |
| US5742752(A) | 1998-04-01 | DeKoning | Applicant |
| US5819292(A) | 1998-10-01 | Hitz et al. | Examiner |
| US5819310(A) | 1998-10-01 | Vishlitzky et al. | Applicant |
| US5828876(A) | 1998-10-01 | Fish et al. | Applicant |
| US5835953(A) | 1998-11-01 | Ohran | Applicant |
| US5907672(A) | 1999-05-01 | Matze et al. | Applicant |
| US5948110(A) | 1999-09-01 | Hitz et al. | Applicant |
| US5950225(A) | 1999-09-01 | Kleiman | Applicant |
| US5956745(A) | 1999-09-01 | Bradford et al. | Examiner |
| US5963962(A) | 1999-10-01 | Hitz et al. | Applicant |
| US5987477(A) | 1999-11-01 | Schmuck et al. | Examiner |
| US6000039(A) | 1999-12-01 | Tanaka et al. | Applicant |
| US6038570(A) | 2000-03-01 | Hitz et al. | Examiner |
| US6038639(A) | 2000-03-01 | O'Brien | Examiner |
| US6061770(A) | 2000-05-01 | Franklin | Examiner |
| US6076148(A) | 2000-06-01 | Kedem | Applicant |
| US6101585(A) | 2000-08-01 | Brown et al. | Applicant |
| US6119244(A) | 2000-09-01 | Schoenthal et al. | Applicant |
| US6138126(A) | 2000-10-01 | Hitz et al. | Applicant |
| US6173293(B1) | 2001-01-01 | Thekkath et al. | Examiner |
| US6175900(B1) | 2001-01-01 | Forin et al. | Examiner |
| US6202136(B1) | 2001-03-01 | Wikle et al. | Examiner |
| US6205450(B1) | 2001-03-01 | Kanome | Examiner |
| US6289356(B1) | 2001-09-01 | Hitz et al. | Applicant |
| US6311193(B1) | 2001-10-01 | Sekido | Examiner |
| US6317844(B1) | 2001-11-01 | Kleiman | Examiner |
| US6374268(B1) | 2002-04-01 | Testardi | Examiner |
| US6418449(B1) | 2002-07-01 | Chen et al. | Examiner |
| US6434681(B1) | 2002-08-01 | Armangau | Applicant |
| US6460054(B1) | 2002-10-01 | Grummon | Examiner |
| US6473775(B1) | 2002-10-01 | Kusters et al. | Examiner |
| US6484186(B1) | 2002-11-01 | Rungta | Examiner |
| US6529995(B1) | 2003-03-01 | Shepherd | Examiner |
| US6604118(B1) | 2003-08-01 | Kleiman et al. | Examiner |
| US6721764(B1) | 2004-04-01 | Hitz et al. | Applicant |
| US6748504(B1) | 2004-06-01 | Sawdon et al. | Applicant |
| EP462917(A2) | 1991-12-01 | Applicant | |
| EP492808(A2) | 1992-07-01 | Applicant | |
| EP497067(A1) | 1992-08-01 | Applicant | |
| EP537098 | 1993-04-01 | Applicant | |
| EP552580(A2) | 1993-07-01 | Applicant | |
| EP569313(A2) | 1993-11-01 | Applicant | |
| WO91/13404(A1) | 1991-09-01 | Applicant | |
| WO93/13475(A1) | 1993-07-01 | Applicant | |
| WO94/29796(A1) | 1994-12-01 | Applicant | |
| WO98/21656(A1) | 1998-05-01 | Applicant | |
| WO98/38576(A1) | 1998-09-01 | Applicant | |
| WO/07104(A1) | 2000-02-01 | Applicant | |
| WO1/31446(A1) | 2001-05-01 | Applicant | |
| WO2/29573(A2) | 2002-04-01 | Applicant | |
| WO3/105026(A1) | 2003-12-01 | Applicant |
Non-Patent Literature (14)
- David Hitz, James Lau, Michael Malcolm, File System Design for an NFS File Server Appliance, Technical Report 3002, Jan. 19, 1994.Examiner
- David Hitz, An NFS File Server Appliance, Technical Report TR01, Aug. 1993.Examiner
- Chia Chao et al., “Mime: a High Performance Storage Device with Strong Recovery Guarantees”, Concurrent Systems Project Hewlett-Packard Laboratories, Mar. 18, 1992.Applicant
- Wiebren De Jonge, “The Logical Disk: A new Approach to Improving File Systems”, Dept. of Mathematics and Computer Science, Vrije Universiteit, Amsterdam.Applicant
- Jim Gray et al., “Parity Striping of Disc Arrays: Low-Cost Reliable Storage with Acceptable Throughput”, Proceedings of the 16th VLDB Conference, Brisbane, Australia 1990. Tandem Computers Inc., 19333 Vallco Parkway, Cupertino, California. XP000522459.Applicant
- John H. Hartman, “The Zebra Striped Network File System”, Computer Science Division, Electrical Engineering and Computer Sciences, University of California, Berkeley, California.Applicant
- David Hitz, “File System Design for an NFS File Server Appliance”, Technical Report 3002, Presented Jan. 19, 1994. USENIX Winter 1994, San Francisco, California.Applicant
- David Hitz, “An NFS File Server Appliance”, Technical Report TRO1, Rev. A Aug. 1993.Applicant
- IBM Technical Disclosure Bulletin, vol. 36, No. 03, Mar. 1993. XP000354845.Applicant
- Steven R. Kleiman et al., “Using NUMA Interconnects for Highly Available Filers”, 1999 IEEE.Applicant
- Jai Menon et al., “The Architecture of a Fault-Tolerant Cached RAID Controller”, IEEE Computer Society, Los Alamitos, California, May 16-19, 1993. XP000398988.Applicant
- David Patterson et al., “A Case for Redundant Arrays of Inexpensive Disks (RAID)”, Computer Science Division, Dept. of Electrical Engineering and Computer Sciences, University of California, Berkeley.Applicant
- Slashdot, TUX 2: “The File System that Would Be King”.Applicant
- David Tweeten, “Hiding Mass Storage Under UNIX: Nasa's MSS-II Architecture”, NAS System Division, NASA Ames Research Center, Moffett Filed, California, 1990 IEEEE.Applicant