File system over thinly provisioned volume file in mapped mode

• US 9,329,803 B1
• Filed: 06/28/2013
• Issued: 05/03/2016
• Est. Priority Date: 06/28/2013
• Status: Active Grant

• Current Assignee: Emc IP Holding Company LLC (Dell Technologies Inc.)
• Original Assignee: EMC Corporation (Dell Technologies Inc.)
• Inventors: Bono, Jean-Pierre, Davenport, William C., de Forest, Miles A., Forrester, Walter C., Marko, Michal, Zhang, Ye, Armangau, Philippe
• Primary Examiner(s): Verbrugge, Kevin
• Assistant Examiner(s): Goldschmidt, Craig
• Application Number:
  US13/931,769
• Time in Patent Office: 1,040 Days
• Field of Search: None
• US Class Current: 1/1
• CPC Class Codes: G06F 3/0608 Saving storage space on storage systems
• CPC Class Codes: G06F 3/0611 in relation to response time
• CPC Class Codes: G06F 3/0641 De-duplication techniques
• CPC Class Codes: G06F 3/0643 Management of files
• CPC Class Codes: G06F 3/0665 at area level, e.g. provisioning of virtual or logical volumes
• CPC Class Codes: G06F 3/0688 Non-volatile semiconductor memory arrays

Abstract

A data storage system includes storage devices and a processing subsystem executing software forming a lower-deck file system and an upper-deck file system. The lower-deck file system presents a volume file from which storage is provided to the upper-deck file system, and units of storage of the storage devices are allocable to the upper-deck file system but are not reserved to it. The volume file is thinly provisioned, and additional units of storage are added dynamically to increase its allocated size in response to demand from the upper-deck file system. The lower-deck file system operates in a mapped mode in which a block address in the lower-deck file system is obtained by a generally arbitrary mapping (e.g., an Inode/IB tree) of a block address in the volume file.

Claims

1. A data storage system for use by a file system consumer according to a file system interface, comprising:

one or more physical nonvolatile storage devices; and

a processing subsystem executing software to form a multi-level stack of functional components including a lower-deck file system and an upper-deck file system, the upper-deck file system providing the file system interface to the file system consumer, the lower-deck file system presenting a volume file from which storage is provided to the upper-deck file system, units of storage of the storage devices being allocable to the upper-deck file system as well as to other uses in the data storage system, the volume file being thinly provisioned so that its allocated size at any given time is less than its configured size, additional units of storage being added dynamically to the volume file to increase its allocated size in response to demand from the upper-deck file system, the lower-deck file system operating in a mapped mode in which a block address of a data block in the lower-deck file system is obtained by a mapping of a corresponding block address of a data block in the volume file,

wherein the lower-deck file system is operative to transition between the mapped mode and the direct mode of operating by (i) during operation in the mapped mode, reorganizing the locations and ordering of the data blocks in a transitional location so that their block addresses can be obtained by the predetermined mathematical calculation with addition of an offset value representing an offset between the transitional location and a final location, and (ii) in an atomic action, moving the data blocks to the final location and beginning the direct mode of operating with use of the predetermined mathematical calculation.

2. A data storage system according to claim 1, wherein the mapping includes traversal of pointers and indirect blocks of an inode structure identifying locations of data blocks in the lower-deck file system based on block addresses of the data blocks in the volume file.

3. A data storage system according to claim 1, wherein the volume file has a maximum size, and wherein, upon the allocated size of the volume file becoming equal to the maximum size, an out-of-space response is returned to the file system consumer.

4. A data storage system according to claim 1, wherein the volume file is a sparse volume for which the allocated size is less than one-half its configured size.

5. A data storage system according to claim 1, wherein the units of storage are slices having a slice size at least ten times a block size of the data blocks.

6. A data storage system according to claim 5, wherein the slices are pool slices and the slice size is a pool slice size, and wherein the volume file is consumed by the upper-deck file system in upper slices having an upper slice size.

7. A data storage system according to claim 6, wherein the upper slice size is equal to the pool slice size and the upper slices are aligned with the pool slices.

8. A data storage system according to claim 6, wherein the upper slice size is not equal to the pool slice size.

9. A data storage system according to claim 1, wherein the mapped mode of operation of the lower-deck file system includes deduplication functionality by which duplicate blocks in a deduplication domain including the upper-deck file system are stored as a single shared block and corresponding block pointers in the lower-deck file system.

10. A data storage system according to claim 1, wherein the lower-deck file system can also be operated in a direct mode in which a block address of a data block in the lower-deck file system is obtained by a predetermined mathematical calculation from a corresponding block address of the data block in the volume file.

11. A data storage system according to claim 1, wherein the transition between the mapped mode and the direct mode occurs as part of a defragmentation operation.

12. A method of operating a data storage system to provide file system functionality to a file system consumer according to a file system interface, the data storage system including one or more physical nonvolatile storage devices and a processing subsystem, comprising:

instantiating, in the processing subsystem, software to form a multi-level stack of functional components including a lower-deck file system and an upper-deck file system, the upper-deck file system providing the file system interface to the file system consumer; and

by the lower-deck file system, (i) presenting a volume file from which storage is provided to the upper-deck file system, units of storage of the storage devices being allocable to the upper-deck file system as well as to other uses in the data storage system, the volume file being thinly provisioned so that its allocated size at any given time is less than its configured size, (ii) dynamically adding additional units of storage to the volume file to increase its allocated size in response to demand from the upper-deck file system, and (iii) utilizing a mapped operating mode in which a block address of a data block in the lower-deck file system is obtained by a mapping of a corresponding block address of a data block in the volume file,

wherein the lower-deck file system is operative to transition between the mapped mode and the direct mode of operating by (i) during operation in the mapped mode, reorganizing the locations and ordering of the data blocks in a transitional location so that their block addresses can be obtained by the predetermined mathematical calculation with addition of an offset value representing an offset between the transitional location and a final location, and (ii) in an atomic action, moving the data blocks to the final location and beginning the direct mode of operating with use of the predetermined mathematical calculation.

13. A method according to claim 12, wherein the mapping includes traversal of pointers and indirect blocks of an inode structure identifying locations of data blocks in the lower-deck file system based on block addresses of the data blocks in the volume file.

14. A method according to claim 12, wherein the volume file has a maximum size, and wherein, upon the allocated size of the volume file becoming equal to the maximum size, an out-of-space response is returned to the file system consumer.

15. A method according to claim 12, wherein the volume file is a sparse volume for which the allocated size is less than one-half its configured size.

16. A method according to claim 12, wherein the units of storage are slices having a slice size at least ten times a block size of the data blocks.

17. A method according to claim 16, wherein the slices are pool slices and the slice size is a pool slice size, and wherein the volume file is consumed by the upper-deck file system in upper slices having an upper slice size.

18. A method according to claim 17, wherein the upper slice size is equal to the pool slice size and the upper slices are aligned with the pool slices.

19. A method according to claim 17, wherein the upper slice size is not equal to the pool slice size.

20. A method according to claim 12, wherein the mapped mode of operation of the lower-deck file system includes deduplication functionality by which duplicate blocks in a deduplication domain including the upper-deck file system are stored as a single shared block and corresponding block pointers in the lower deck file system.

21. A method according to claim 12, wherein the lower-deck file system can also be operated in a direct mode in which a block address of a data block in the lower-deck file system is obtained by a predetermined mathematical calculation from a corresponding block address of the data block in the volume file.

22. A method according to claim 12, wherein the transition between the mapped mode and the direct mode occurs as part of a defragmentation operation.