File deletion and truncation using a zombie file space

• US 6,751,635 B1
• Filed: 08/18/2000
• Issued: 06/15/2004
• Est. Priority Date: 08/18/2000
• Status: Expired due to Term

• Current Assignee: NetApp, Inc.
• Original Assignee: Network Appliance Incorporated (NetApp, Inc.)
• Inventors: Patel, Kayuri, Chen, Ray, Edwards, John K.
• Primary Examiner(s): Homere, Jean R.
• Assistant Examiner(s): Wong, Leslie
• Application Number:
  US09/642,066
• Time in Patent Office: 1,397 Days
• Field of Search: 707/10, 707/201, 707/203, 707/206, 707/204, 707/205, 707/200, 707/202, 711/113, 711/114, 709/203, 709/219, 709/229
• US Class Current: 1/1
• CPC Class Codes: G06F 11/1435 using file system or storage system metadata
• CPC Class Codes: G06F 16/162 Delete operations erasing in storage systems G06F3/0652
• CPC Class Codes: G06F 2201/82 Solving problems relating to consistency ensuring consistency in mirrored systems G06F11/2064
• CPC Class Codes: Y10S 707/99931 Database or file accessing
• CPC Class Codes: Y10S 707/99953 Recoverability
• CPC Class Codes: Y10S 707/99956 File allocation

Abstract

A method and system for reliably performing extra-long operations in a reliable state-full system (such as a file system). The file system includes a separate portion of the file system reserved for files having extra-long operations in progress, including file deletion and file truncation. This separate portion of the file system is called the zombie file space; it includes a separate name space from the regular (“live”) file system that is accessible to users, and is maintained as part of the file system when recording a consistency point.

Claims

1. A method of operating a file server, comprising the steps of:

identifying a file for deletion or truncation;

making said file unavailable to system users in a first file space;

linking said file to a second file space used for longer file operations than those performed in said first file space;

freeing blocks of said file while maintaining file consistency between check-pointed intervals; and

delinking said file from said second file space and making said file available to system users in said first file space if said file was identified for truncation.

2. The method of claim 1, wherein said file is a composite file.

3. The method of claim 1, wherein each element of said composite file is deleted or truncated separately.

4. The method of claim 1, wherein deleting or truncating said file is performed in atomic units.

5. The method of claim 1, wherein said second file space is a zombie file space.

25. The method of claim 1, further comprising the steps of delinking said file from said second file space and making said file available to system users in said first file space if said file was identified for deletion.

6. A method of operating a file server, comprising the steps of:

identifying a file for truncation;

making said file unavailable to system users in a first file space;

moving a portion of said file to a second file;

linking said second file to a second file space used for longer file operations than those performed in said first file space;

making said file available to system users in said first file space; and

deleting said second file while maintaining file consistency between check-pointed intervals.

7. The method of claim 6, wherein deleting said second file is performed in atomic units.

8. The method of claim 6, wherein said second file space is a zombie file space.

9. A file server, comprising:

a processor;

memory;

a network interface; and

mass storage;

wherein said processor operates under program control in said memory to control access to said mass storage, said program control including the steps of;

(a) identifying a file for deletion or truncation;

(b) making said file unavailable to system users in a first file space;

(c) linking said file to a second file space used for longer file operations than those performed in said first file space;

(d) freeing blocks of said file while maintaining file consistency between check-pointed intervals; and

(e) delinking said file from said second file space and making said file available to system users in said first file space if said file was identified for truncation.

10. The file server of claim 9, wherein said file is a composite file.

11. The file server of claim 9, wherein each element of said composite file is deleted or truncated separately.

12. The file server of claim 9, wherein deleting or truncating said file is performed in atomic units.

13. The file server of claim 9, wherein said second file space is a zombie file space.

26. The file server of claim 9, wherein said program control further includes the steps of (f) delinking said file from said second file space and making said file available to system users in said first file space if said file was identified for deletion.

14. A file server, comprising:

a processor;

memory;

a network interface; and

mass storage;

wherein said processor operates under program control in said memory to control access to said mass storage, said program control including the steps of;

(a) identifying a file in said mass storage for truncation;

(b) making said file unavailable to system users in a first file space;

(c) moving a portion of said file to a second file;

(d) linking said second file to a second file space used for longer file operations than those performed in said first file space;

(e) making said file available to system users in said first file space; and

(f) deleting said second file while maintaining file consistency between check-pointed intervals.

15. The file server of claim 14, wherein deleting said second file is performed in atomic units.

16. The file server of claim 14, wherein said second file space is a zombie file space.

17. A memory storing a program, said program comprising the steps of:

identifying a file for deletion or truncation;

making said file unavailable to system users in a first file space;

linking said file to a second file space used for longer file operations than those performed in said first file space;

freeing blocks of said file while maintaining file consistency between check-pointed intervals; and

delinking said file from said second file space and making said file available to system users in said first file space if said file was identified for truncation.

18. The memory of claim 17, wherein said file is a composite file.

19. The memory of claim 17, wherein each element of said composite file is deleted or truncated separately.

20. The memory of claim 17, wherein deleting or truncating said file is performed in atomic units.

21. The memory of claim 17, wherein said second file space is a zombie file space.

27. The memory of claim 17, wherein said program further comprises the steps of delinking said file from said second file space and making said file available to system users in said first file space if said file was identified for deletion.

22. A memory storing a program, said program comprising the steps of:

identifying a file for truncation;

making said file unavailable to system users in a first file space;

moving a portion of said file to a second file used for longer file operations than those performed in said first file space;

linking said second file to a second file space;

making said file available to system users in said first file space; and

deleting said second file while maintaining file consistency between check-pointed intervals.

23. The memory of claim 22, wherein deleting said second file is performed in atomic units.

24. The memory of claim 22, wherein said second file space is a zombie file space.