Checkpoint Reclaim Method and Apparatus in Copy-On-Write File System

Abstract

A checkpoint reclaim method in a copy-on-write (COW) file system includes: obtaining, according to a checkpoint reclaim instruction, M data blocks allocated by the file system between a moment of a previous checkpoint reclaim and a moment of a current checkpoint reclaim, and the M data blocks are data blocks allocated for at least one of a checkpoint or a snapshot generated between the moment of the previous checkpoint reclaim and the moment of the current checkpoint reclaim; performing an addition operation with a fixed step on a reference count of a data block that needs to be reserved in the M data blocks, and determining, in the M data blocks, a first data block for reclaiming; determining, in N data blocks allocated for at least one of a checkpoint or a snapshot reserved at the moment of the previous checkpoint reclaim, a second data block for reclaiming.

Description

TECHNICAL FIELD

The present disclosure relates to the field of data processing, and in particular, to a checkpoint reclaim method and apparatus in a copy-on-write (COW) file system.

BACKGROUND

COW means that when data in a file system is to be altered, the original data is not really altered, and instead, the to-be-altered data is copied to a blank area of a magnetic disk. It can be seen that, because the original data is not damaged during a write process, data consistency can be guaranteed without write-twice penalty, and a problem of a small amount of written data brought by the write-twice penalty is avoided. Therefore, an application field of a COW file system is increasingly wide.

In a COW file system, every time when a checkpoint or a snapshot is generated, traversal is performed downwards from a root of the checkpoint or the snapshot to perform reference count addition. Traversal continues to be performed downwards if a reference count of a data block is not greater than 1 after being added by 1, or traversal is no longer performed downwards if a reference count of a data block is greater than 1 after being added by 1. In the COW file system, an uppermost layer including a reference tree is a super block (sb), and what is referenced by a sb may be a checkpoint, a snapshot, a root area, an index node, or the like.

Referring to FIG. 1A, FIG. 1A is a schematic reference diagram of a COW file system with a checkpoint 1. As shown in FIG. 1A, the checkpoint 1 includes eight data blocks numbered A to H. After a reference count addition traversal operation is performed on the checkpoint 1, it can be known that reference counts of the data blocks are:

Data Block Number Reference Count
A                 1
B                 1
C                 1
C                 1
D                 1
E                 1
F                 1
G                 1
H                 1

Referring to FIG. 1B, FIG. 1B is a schematic diagram of generating a checkpoint 2 on the basis of the checkpoint 1. As shown in FIG. 1B, the COW file system modifies a sub-block on the right of an index node 2 (that is, H is modified as L), and generates the checkpoint 2. After a reference count addition traversal operation is performed from a root of the checkpoint 2, it can be known that reference counts of data blocks are:

Data Block Number Reference Count
I                 1
J                 1
K                 1
L                 1
C                 2
G                 2

When a checkpoint or a snapshot is to be deleted, traversal needs to be performed downwards from a root of the checkpoint or the snapshot to perform a reference count subtraction operation. Traversal continues to be performed downwards if a reference count of a data block is 0 after being subtracted by 1, or traversal is no longer performed downwards if a reference count of a data block is greater than 0 after being subtracted by 1, where the data block whose reference count is 0 is a data block that needs to be reclaimed.

Deleting the checkpoint 1 shown in FIG. 1B is used as an example. Referring to FIG. 1C, FIG. 1C is a schematic diagram of deleting the checkpoint 1. As shown in FIG. 1C, after a reference count subtraction traversal operation is performed on the checkpoint 1, it can be known that reference counts of data blocks are:

Data Block Number Reference Count
A                 0
B                 0
C                 1
D                 0
E                 1
F                 1
G                 1
H                 0

After a reference count subtraction traversal operation is performed on the checkpoint 1, it can be known that, after the checkpoint 1 is deleted, data blocks with numbers A, B, D, and H respectively have a reference count of 0 and need to be reclaimed. In this way, space occupied by these data blocks can be released.

It can be seen that, in a COW file system, a reference count addition traversal operation needs to be performed on each generated checkpoint and each generated snapshot, and a reference count subtraction traversal operation needs to be performed on each deleted checkpoint and each deleted snapshot. As a result, a traversing scale and an amount of data that is calculated during traversal are both relatively large.

SUMMARY

Embodiments of the present disclosure provide a checkpoint reclaim method and apparatus in a copy-on-write file system, which are used to resolve a technical problem in the prior art that a traversing scale and an amount of data that is calculated during traversal are both relatively large in a COW file system.

A first aspect of the embodiments of the present disclosure provides a checkpoint reclaim method in a COW file system, including obtaining, according to a checkpoint reclaim instruction, M data blocks allocated by the file system between a moment of a previous checkpoint reclaim and a moment of a current checkpoint reclaim, where M is an integer not less than 1, and the M data blocks are data blocks allocated for at least one of a checkpoint or a snapshot generated between the moment of the previous checkpoint reclaim and the moment of the current checkpoint reclaim, performing an addition operation with a fixed step on a reference count of a data block that needs to be reserved in the M data blocks, and determining, in the M data blocks, a first data block that needs to be reclaimed, determining, in N data blocks allocated for at least one of a checkpoint or a snapshot reserved at the moment of the previous checkpoint reclaim, a second data block that needs to be reclaimed, where N is an integer not less than 1, and reclaiming the first data block and the second data block.

With reference to the first aspect, in a first possible implementation manner of the first aspect, performing an addition operation with a fixed step on a reference count of a data block that needs to be reserved in the M data blocks, and determining, in the M data blocks, a first data block that needs to be reclaimed further includes performing the addition operation with the fixed step on reference counts of K data blocks allocated for a latest currently generated checkpoint, to obtain first reference counts of the K data blocks, and determining the first data block in data blocks of the M data blocks except the K data blocks when only a checkpoint is generated between the moment of the previous checkpoint reclaim and the moment of the current checkpoint reclaim, or performing the addition operation with the fixed step on reference counts of K data blocks allocated for the snapshot generated between the moment of the previous checkpoint reclaim and the moment of the current checkpoint reclaim and for a latest currently generated checkpoint, to obtain first reference counts of the K data blocks, and determining the first data block in data blocks of the M data blocks except the K data blocks when both a checkpoint and a snapshot are generated between the moment of the previous checkpoint reclaim and the moment of the current checkpoint reclaim.

With reference to the first possible implementation manner of the first aspect, in a second possible implementation manner of the first aspect, determining, in N data blocks allocated for at least one of a checkpoint or a snapshot reserved at the moment of the previous checkpoint reclaim, a second data block that needs to be reclaimed further includes performing a subtraction operation with the fixed step on reference counts of L data blocks, in the N data blocks, allocated for a checkpoint reserved at the moment of the previous checkpoint reclaim, and determining second reference counts of the L data blocks, where before the obtaining first reference counts of the K data blocks, reference counts of the N data blocks are first referential reference counts, and determining the second data block in the N data blocks according to the first reference counts, the second reference counts, and the first referential reference counts.

With reference to the second possible implementation manner of the first aspect, in a third possible implementation manner of the first aspect, the method further includes determining a reference count of a data block that needs to be reserved for the current checkpoint reclaim as a current first referential reference count according to the first reference counts of the K data blocks, the first referential reference counts of the N data blocks, and second reference counts of the L data blocks.

With reference to the second possible implementation manner of the first aspect, in a fourth possible implementation manner of the first aspect, when the file system includes a cut-off root area of the previous checkpoint reclaim, a cut-off root area of the current checkpoint reclaim, and a real-time root area, the cut-off root area of the previous checkpoint reclaim is a root area in which the N data blocks are indexed, the real-time root area is a root area in which the K data blocks are indexed, and the cut-off root area of the current checkpoint reclaim is a root area in which the file system copies, when obtaining the checkpoint reclaim instruction, an indexing relationship that is in the real-time root area.

With reference to the fourth possible implementation manner of the first aspect, in a fifth possible implementation manner of the first aspect, after reclaiming the first data block and the second data block, the method further includes deleting data in the cut-off root area of the previous checkpoint reclaim, and copying data in the cut-off root area of the current checkpoint reclaim to the cut-off root area of the previous checkpoint reclaim.

A second aspect of the embodiments of the present disclosure provides a checkpoint reclaim apparatus in a COW file system, including an obtaining unit configured to obtain, according to a checkpoint reclaim instruction, M data blocks allocated by the file system between a moment of a previous checkpoint reclaim and a moment of a current checkpoint reclaim, where M is an integer not less than 1, and the M data blocks are data blocks allocated for at least one of a checkpoint or a snapshot generated between the moment of the previous checkpoint reclaim and the moment of the current checkpoint reclaim, a first determining unit configured to perform an addition operation with a fixed step on a reference count of a data block that needs to be reserved in the M data blocks, and determine, in the M data blocks, a first data block that needs to be reclaimed, a second determining unit configured to determine, in N data blocks allocated for at least one of a checkpoint or a snapshot reserved at the moment of the previous checkpoint reclaim, a second data block that needs to be reclaimed, where N is an integer not less than 1, and a reclaim unit configured to reclaim the first data block and the second data block.

With reference to the second aspect, in a first possible implementation manner of the second aspect, the first determining unit is further configured to perform the addition operation with the fixed step on reference counts of K data blocks allocated for a latest currently generated checkpoint, to obtain first reference counts of the K data blocks, and determine the first data block in data blocks of the M data blocks except the K data blocks when only a checkpoint is generated between the moment of the previous checkpoint reclaim and the moment of the current checkpoint reclaim, or perform the addition operation with the fixed step on reference counts of K data blocks allocated for the snapshot generated between the moment of the previous checkpoint reclaim and the moment of the current checkpoint reclaim and for a latest currently generated checkpoint, to obtain first reference counts of the K data blocks, and determine the first data block in data blocks of the M data blocks except the K data blocks when both a checkpoint and a snapshot are generated between the moment of the previous checkpoint reclaim and the moment of the current checkpoint reclaim.

With reference to the first possible implementation manner of the second aspect, in a second possible implementation manner of the second aspect, the second determining unit is further configured to perform a subtraction operation with the fixed step on reference counts of L data blocks, in the N data blocks, allocated for a checkpoint reserved at the moment of the previous checkpoint reclaim, and determine second reference counts of the L data blocks, where before obtaining first reference counts of the K data blocks, reference counts of the N data blocks are first referential reference counts, and determine the second data block in the N data blocks according to the first reference counts, the second reference counts, and the first referential reference counts.

With reference to the second possible implementation manner of the second aspect, in a third possible implementation manner of the second aspect, the apparatus further includes a third determining unit, where the third determining unit is configured to determine a reference count of a data block that needs to be reserved for the current checkpoint reclaim as a current first referential reference count according to the first reference counts, the second reference counts, and the first referential reference counts.

With reference to the second possible implementation manner of the second aspect, in a fourth possible implementation manner of the second aspect, when the file system includes a cut-off root area of the previous checkpoint reclaim, a cut-off root area of the current checkpoint reclaim, and a real-time root area, the cut-off root area of the previous checkpoint reclaim is a root area in which the N data blocks are indexed, the real-time root area is a root area in which the K data blocks are indexed, and the cut-off root area of the current checkpoint reclaim is a root area in which the file system copies, when obtaining the checkpoint reclaim instruction, an indexing relationship that is in the real-time root area.

With reference to the fourth possible implementation manner of the second aspect, in a fifth possible implementation manner of the second aspect, the reclaim unit is further configured to delete data in the cut-off root area of the previous checkpoint reclaim, and copy data in the cut-off root area of the current checkpoint reclaim to the cut-off root area of the previous checkpoint reclaim after the first data block and the second data block are reclaimed.

A third aspect of the embodiments of the present disclosure further provides a device, where the device includes any apparatus according to the second aspect.

One or more technical solutions provided by the embodiments of the present disclosure have at least the following technical effects or advantages.

Because the use of technical solution of obtaining, according to a checkpoint reclaim instruction, M data blocks allocated by the file system between a moment of a previous checkpoint reclaim and a moment of a current checkpoint reclaim, where M is an integer not less than 1, and the M data blocks are data blocks allocated for at least one of a checkpoint or a snapshot generated between the moment of the previous checkpoint reclaim and the moment of the current checkpoint reclaim, performing an addition operation with a fixed step on a reference count of a data block that needs to be reserved in the M data blocks, determining, in the M data blocks, a first data block that needs to be reclaimed, determining, in N data blocks allocated for at least one of a checkpoint or a snapshot reserved at the moment of the previous checkpoint reclaim, a second data block that needs to be reclaimed, where N is an integer not less than 1, and reclaiming the first data block and the second data block, no traversal operation needs to be performed on a data block that needs to be reclaimed in data blocks generated between the moment of the previous checkpoint reclaim and the moment of the current checkpoint reclaim in the COW file system, instead, a traversal operation needs to be performed only on a data block that needs to be reserved. Therefore, the following technical effects are achieved. A corresponding data amount is reduced when a traversal operation is performed on the data block that needs to be reclaimed in the data blocks generated between the moment of the previous checkpoint reclaim and the moment of the current checkpoint reclaim in the COW file system, and a traversing scale is reduced when the COW file system reclaims space.

BRIEF DESCRIPTION OF DRAWINGS

FIG. 1A is a schematic reference diagram of a COW file system with a checkpoint 1;

FIG. 1B is a schematic diagram of generating a checkpoint 2 on the basis of a checkpoint 1;

FIG. 1C is a schematic diagram of deleting a checkpoint 1;

FIG. 2 is a flowchart of a checkpoint reclaim method according to an embodiment of the present disclosure;

FIG. 3 is a schematic diagram of data blocks reserved at a moment of a previous checkpoint reclaim in a COW file system according to an embodiment of the present disclosure;

FIG. 4 is a schematic diagram of a first-time modification of data blocks reserved at a moment of a previous checkpoint reclaim in a COW file system according to an embodiment of the present disclosure;

FIG. 5 is a schematic diagram of a second-time modification of data blocks reserved at a moment of a previous checkpoint reclaim in a COW file system according to an embodiment of the present disclosure;

FIG. 6 is a schematic diagram of a third-time modification of data blocks reserved at a moment of a previous checkpoint reclaim in a COW file system according to an embodiment of the present disclosure;

FIG. 7 is a schematic diagram of a COW file system that includes a cut-off root area at a moment of a previous checkpoint reclaim, a cut-off root area and a real-time root area at a moment of a current checkpoint reclaim according to an embodiment of the present disclosure;

FIG. 8 is a schematic diagram of a COW file system at a moment of a current checkpoint reclaim according to an embodiment of the present disclosure;

FIG. 9 is a schematic diagram of a COW file system after receiving a checkpoint reclaim instruction according to an embodiment of the present disclosure;

FIG. 10 is a schematic diagram of copying content in a cut-off root area at a moment of a current checkpoint reclaim to a cut-off root area at a moment of a previous checkpoint reclaim according to an embodiment of the present disclosure; and

FIG. 11 is a structural diagram of a checkpoint reclaim apparatus according to an embodiment of the present disclosure.

DESCRIPTION OF EMBODIMENTS

Embodiments of the present disclosure provide a checkpoint reclaim method and apparatus in a COW file system, which are used to resolve a technical problem in the prior art that a traversing scale and an amount of data that is calculated during traversal are both relatively large in the COW file system.

Technical solutions in the embodiments of the present disclosure are used to resolve the foregoing technical problem, and a general idea is disclosed below.

The embodiments of the present disclosure provide a checkpoint reclaim method in a COW file system. The method includes obtaining, according to a checkpoint reclaim instruction, M data blocks allocated by the file system between a moment of a previous checkpoint reclaim and a moment of a current checkpoint reclaim, where M is an integer not less than 1, and the M data blocks are data blocks allocated for at least one of a checkpoint or a snapshot generated between the moment of the previous checkpoint reclaim and the moment of the current checkpoint reclaim, performing an addition operation with a fixed step on a reference count of a data block that needs to be reserved in the M data blocks, and determining, in the M data blocks, a first data block that needs to be reclaimed, determining, in N data blocks allocated for at least one of a checkpoint or a snapshot reserved at the moment of the previous checkpoint reclaim, a second data block that needs to be reclaimed, where N is an integer not less than 1, and reclaiming the first data block and the second data block.

It can be seen from the foregoing part that, because the use of technical solution of obtaining, according to a checkpoint reclaim instruction, M data blocks allocated by the file system between a moment of a previous checkpoint reclaim and a moment of a current checkpoint reclaim, where M is an integer not less than 1, and the M data blocks are data blocks allocated for at least one of a checkpoint or a snapshot generated between the moment of the previous checkpoint reclaim and the moment of the current checkpoint reclaim, performing an addition operation with a fixed step on a reference count of a data block that needs to be reserved in the M data blocks, determining, in the M data blocks, a first data block that needs to be reclaimed, determining, in N data blocks allocated for at least one of a checkpoint or a snapshot reserved at the moment of the previous checkpoint reclaim, a second data block that needs to be reclaimed, where N is an integer not less than 1, and reclaiming the first data block and the second data block, no traversal operation needs to be performed on a data block that needs to be reclaimed in data blocks generated between the moment of the previous checkpoint reclaim and the moment of the current checkpoint reclaim in the COW file system, instead, a traversal operation needs to be performed only on a data block that needs to be reserved. Therefore, the following technical effects are achieved. A corresponding data amount is reduced when a traversal operation is performed on the data block that needs to be reclaimed in the data blocks generated between the moment of the previous checkpoint reclaim and the moment of the current checkpoint reclaim in the COW file system, and a traversing scale is reduced when the COW file system reclaims space.

For a better understanding of the foregoing technical solution, the following describes the foregoing technical solution in detail with reference to the accompanying drawings in the specification and specific implementation manners.

Referring to FIG. 2, FIG. 2 is a flowchart of a checkpoint reclaim method according to an embodiment of the present disclosure. As shown in FIG. 2, the method includes the following steps.

Step S1: Obtain, according to a checkpoint reclaim instruction, M data blocks allocated by a file system between a moment of a previous checkpoint reclaim and a moment of a current checkpoint reclaim, where M is an integer not less than 1, and the M data blocks are data blocks allocated for at least one of a checkpoint or a snapshot generated between the moment of the previous checkpoint reclaim and the moment of the current checkpoint reclaim.

Step S2: Perform an addition operation with a fixed step on a reference count of a data block that needs to be reserved in the M data blocks, and determine, in the M data blocks, a first data block that needs to be reclaimed.

Step S3: Determine, in N data blocks allocated for at least one of a checkpoint or a snapshot reserved at the moment of the previous checkpoint reclaim, a second data block that needs to be reclaimed, where N is an integer not less than 1.

Step S4: Reclaim the first data block and the second data block.

In a specific implementation process, the checkpoint reclaim method provided by this embodiment of the present disclosure is implemented in multiple implementation manners. In the following parts, two implementation manners are described in detail.

Embodiment 1

Referring to FIG. 3, FIG. 3 is a schematic diagram of data blocks reserved at a moment of a previous checkpoint reclaim in a COW file system according to an embodiment of the present disclosure. As shown in FIG. 3, the COW file system reserves a snapshot 1 and a checkpoint 1 at the moment of the previous checkpoint reclaim. The snapshot 1 includes four data blocks numbered A, B, C, and D. In other words, data blocks numbered A, B, C, and D are referenced by the snapshot 1. The checkpoint 1 includes four data blocks numbered E, F, C, and G. In other words, four data blocks numbered E, F, C, and G are referenced by the checkpoint 1. An addition operation with a fixed step is performed separately on the data blocks referenced by the snapshot 1 and the checkpoint 1. Here, a reference count addition traversal operation is performed and first referential reference counts at the moment of the previous checkpoint reclaim may be obtained. In this embodiment of the present disclosure, a reference count is added by 1, that is, the fixed step is 1 if a data block is referenced by the snapshot 1 or the checkpoint 1 once. In this embodiment, all reference counts are presented in a table form, and the first referential reference counts are as follows:

TABLE 1
Data Block Number Reference Count
A                 1
B                 1
C                 2
D                 1
E                 1
F                 1
G                 1

Referring to FIG. 4, FIG. 4 is a schematic diagram of a first-time modification of the data blocks reserved at the moment of the previous checkpoint reclaim in the COW file system according to this embodiment of the present disclosure. As shown in FIG. 4, the data block C is modified to J. In this case, a checkpoint 2 is generated. A snapshot is taken for the checkpoint 2, and then, a snapshot 2 shown in FIG. 4 may be generated.

Referring to FIG. 5, FIG. 5 is a schematic diagram of a second-time modification of the data blocks reserved at the moment of the previous checkpoint reclaim in the COW file system according to this embodiment of the present disclosure. As shown in FIG. 5, the data block J is modified to M. In this case, a checkpoint 3 is generated.

Referring to FIG. 6, FIG. 6 is a schematic diagram of a third-time modification of the data blocks reserved at the moment of the previous checkpoint reclaim in the COW file system according to this embodiment of the present disclosure. As shown in FIG. 6, the data block numbered G is modified to a data block numbered P. In this case, a checkpoint 4 is generated.

It is assumed that the COW file system receives a checkpoint reclaim instruction at this time. In a specific implementation process, generation of the checkpoint reclaim instruction may be manually triggered by a user, or may be triggered by a reclaim policy of the COW file system, which is not limited herein.

Certainly, it should be noted that, in this embodiment, from the moment of the previous checkpoint reclaim in the COW file system to a moment at which the COW file system receives the checkpoint reclaim instruction, neither a traversal operation nor a reference count update operation is performed on the data blocks.

In step S1 of obtaining, according to a checkpoint reclaim instruction, M data blocks allocated by the file system between a moment of a previous checkpoint reclaim and a moment of a current checkpoint reclaim, where M is an integer not less than 1, and the M data blocks are data blocks allocated for at least one of a checkpoint or a snapshot generated between the moment of the previous checkpoint reclaim and the moment of the current checkpoint reclaim, further, the M data blocks allocated by the COW file system between the moment of the previous checkpoint reclaim and the moment of the current checkpoint reclaim may be obtained using a data block allocation module in the COW file system. The data block allocation module in the COW file system allocates corresponding numbers to data blocks that are corresponding to the at least one of the checkpoint or the snapshot when the at least one of the checkpoint or the snapshot is generated between the moment of the previous checkpoint reclaim and the moment of the current checkpoint reclaim. It can be known from FIG. 3 to FIG. 6 that, one checkpoint or snapshot corresponds to multiple data blocks. Therefore, M is an integer not less than 1.

It should be noted that, “allocate” in this embodiment means that, when the COW file system generates a checkpoint or a snapshot and when the checkpoint or the snapshot references data blocks corresponding to an existing checkpoint or snapshot, the data blocks are also data blocks allocated for the newly generated checkpoint or snapshot.

In this embodiment, referring to FIG. 3, FIG. 4, FIG. 5, and FIG. 6, information that numbers of data blocks already allocated between the moment of the previous checkpoint reclaim and the moment of the current checkpoint reclaim are G to P can be obtained from the data block allocation module in the COW file system. Because consecutive data block numbers are allocated by the data block allocation module in the COW file system, the data block allocation module may record only the first data block number and the last data block number that are allocated by the COW file system between the moment of the previous checkpoint reclaim and the moment of the current checkpoint reclaim, and such record manner occupies small space.

In step S2 of performing an addition operation with a fixed step on a reference count of a data block that needs to be reserved in the M data blocks, and determining, in the M data blocks, a first data block that needs to be reclaimed, further, the addition operation with the fixed step is performed on reference counts of K data blocks allocated for a latest currently generated checkpoint when only a checkpoint is generated between the moment of the previous checkpoint reclaim and the moment of the current checkpoint reclaim, where the step is 1 herein, to obtain first reference counts of the K data blocks, and the first data block is determined in data blocks of the M data blocks except the K data blocks, or the addition operation with the fixed step is performed on reference counts of K data blocks allocated for the snapshot generated between the moment of the previous checkpoint reclaim and the moment of the current checkpoint reclaim and for a latest currently generated checkpoint when both a checkpoint and a snapshot are generated between the moment of the previous checkpoint reclaim and the moment of the current checkpoint reclaim, where the fixed step is 1 herein, to obtain first reference counts of the K data blocks, and the first data block is determined in data blocks of the M data blocks except the K data blocks.

Because the COW file system generally reserves all snapshots and also reserves only a last generated checkpoint, in this embodiment, referring to FIG. 3, FIG. 4, FIG. 5, and FIG. 6, the snapshot 2 and the checkpoint 4 need to be reserved. Therefore, the addition operation with the fixed step needs to be performed on reference counts of K data blocks corresponding to the snapshot 2 and the checkpoint 4, to obtain first reference counts of the K data blocks.

Further, a reference count addition traversal operation is performed on the K data blocks corresponding to the snapshot 2 and the checkpoint 4 in order to obtain the first reference counts of the data blocks corresponding to the snapshot number and the checkpoint number. In this embodiment of the present disclosure, numbers of the data blocks allocated for the snapshot 2 and the checkpoint 4 are G, H, I, J, M, N, O, and P. After the reference count addition traversal operation is performed on the data blocks corresponding to the snapshot 2 and the checkpoint 4, the first reference counts of the data blocks referenced by the snapshot 2 and the checkpoint 4 can be obtained:

TABLE 2
Data Block Number Reference Count
G                 1
H                 1
I                 1
J                 1
M                 1
N                 1
O                 1
P                 1

The numbers of the data blocks that are already allocated by the COW file system between the moment of the previous checkpoint reclaim and the moment of the current checkpoint reclaim and that are obtained in step S1 are G to P. Therefore, with reference to the first reference counts, it can be determined that numbers, of data blocks that can be reclaimed, in the numbers of the data blocks already allocated by the COW file system between the moment of the previous checkpoint reclaim and the moment of the current checkpoint reclaim are K and L (because they are referenced by neither the checkpoint 4 nor the snapshot 2 that needs to be reserved), that is, numbers of first data blocks are K and L.

Certainly, as introduced in the foregoing part, in this embodiment, both the checkpoint and the snapshot are generated between the moment of the previous checkpoint reclaim and the moment of the current checkpoint reclaim. Therefore, according to the steps introduced in the foregoing part, the numbers of the data blocks allocated for the snapshot 2 and the checkpoint 4 are G, H, I, J, M, N, O, and P such that the first data block that needs to be reclaimed can be determined in the data blocks of the M data blocks except the K data blocks. In this embodiment of the present disclosure, because the checkpoint 3 needs to be reclaimed, it is determined from data blocks numbered K and L that, numbers of data blocks that need to be reclaimed are K and L. In another embodiment, an addition operation with a fixed step is performed only on reference counts of K data blocks allocated for a latest currently generated checkpoint when only a checkpoint is generated between the moment of the previous checkpoint reclaim and the moment of the current checkpoint reclaim, where the fixed step is 1 in order to obtain first reference counts of the K data blocks. Therefore, a first data block may be determined in data blocks of M data blocks except the K data blocks. Details are not described herein again.

After step S2 of determining, in the M data blocks, a first data block that needs to be reclaimed, in this embodiment of the present disclosure, step S3 is performed, which is determining, in N data blocks allocated for at least one of a checkpoint or a snapshot reserved at the moment of the previous checkpoint reclaim, a second data block that needs to be reclaimed, where N is an integer not less than 1.

Further, step S3 may include, performing a subtraction operation with the fixed step on reference counts of L data blocks, in the N data blocks, allocated for a checkpoint reserved at the moment of the previous checkpoint reclaim, and determining current reference counts of the L data blocks, where the fixed step is 1 herein, before the first reference counts of data blocks referenced by the snapshot 2 and the checkpoint 4 are obtained, reference counts of the N data blocks are first referential reference counts, and determining the second data block in the N data blocks according to the first reference counts, the current reference counts of the L data blocks, and the first referential reference counts.

In this embodiment, as introduced in the foregoing part, Table 1 lists the first referential reference counts at the moment of the previous checkpoint reclaim in the COW file system. After the first referential reference counts are obtained, the subtraction operation with the fixed step may be performed on the reference counts of the L data blocks, in the N data blocks, allocated for the checkpoint reserved at the moment of the previous checkpoint reclaim, where the fixed step is 1 herein. That is, a reference count subtraction traversal operation is performed on the L data blocks corresponding to the checkpoint. For example, referring to FIG. 6, the subtraction operation with the fixed step is performed on the data blocks, corresponding to the checkpoint 1, in the data blocks reserved at the moment of the previous checkpoint reclaim, that is, the reference count subtraction traversal operation is performed, to obtain second reference counts of the four data blocks, allocated for the checkpoint 1, in the N data blocks, as shown in the following table:

TABLE 3
Data Block Number Reference Count
C                 −1
E                 −1
F                 −1
G                 −1

After the second reference counts are obtained, the second data block can be determined in the N data blocks according to the first referential reference counts (Table 1), the first reference counts (Table 2), and the second reference counts (Table 3). Further, the first referential reference counts, the first reference counts, and the second reference counts may be merged. In this embodiment, “merging the first referential reference counts, the first reference counts, and the second counts” means merging reference counts, of a same data block, in the first referential reference counts, the first reference counts, and the second reference counts, and reserving reference counts of a different data block. Results are shown in the following table:

TABLE 4
Data Block Number Reference Count
A                 1
B                 1
C                 1
D                 1
E                 0
F                 0
G                 1
H                 1
I                 1
J                 1
M                 1
N                 1
O                 1
P                 1

It can be determined from Table 4 that, data blocks numbered E and F in the data blocks reserved at the moment of the previous checkpoint reclaim are data blocks that need to be reclaimed, that is, second data blocks are E and F.

It can be seen from the foregoing part that, compared with a traversing scale in a COW file system in the prior art, in the checkpoint reclaim method provided by this embodiment of the present disclosure, no traversal operation needs to be performed on a data block that needs to be reclaimed in data blocks generated between a moment of a previous checkpoint reclaim and a moment of a current checkpoint reclaim in a COW file system, instead, a traversal operation needs to be performed only on a data block that needs to be reserved. Therefore, the following technical effects are achieved. A corresponding data amount is reduced when a traversal operation is performed on the data block that needs to be reclaimed in the data blocks generated between the moment of the previous checkpoint reclaim and the moment of the current checkpoint reclaim in the COW file system, and a traversing scale is reduced when the COW file system reclaims space.

After the second data block is determined, the checkpoint reclaim method provided by this embodiment of the present disclosure further includes determining a reference count of a data block that needs to be reserved for the current checkpoint reclaim as a current first referential reference count according to the first reference counts of the K data blocks, the first referential reference counts of the N data blocks, and the current reference counts of the L data blocks. That is, after the COW file system determines the first data block and the second data block that need to be reclaimed, the reference count of the data block that needs to be reserved for the current checkpoint reclaim can be determined as the current first referential reference count (that is, content shown in Table 4) according to the first reference counts, the second reference counts, and the first referential reference counts in order to be used by the COW file system for a next checkpoint reclaim. Details are not described herein again.

After a number of the first data block that needs to be reclaimed is determined in step S2 and a number of the second data block that needs to be reclaimed is determined in step S3, in the checkpoint reclaim method provided by this embodiment of the present disclosure, step S4 is performed, which is reclaiming the first data block and the second data block.

That is, in step S4, the data blocks numbered E and F are reclaimed and the data blocks numbered K and L are reclaimed, details are not described herein again.

The foregoing technical solution in this embodiment of the present disclosure has at least the following technical effects or advantages.

Because the use of technical solution of obtaining, according to a checkpoint reclaim instruction, M data blocks allocated by the file system between a moment of a previous checkpoint reclaim and a moment of a current checkpoint reclaim, where M is an integer not less than 1, and the M data blocks are data blocks allocated for at least one of a checkpoint or a snapshot generated between the moment of the previous checkpoint reclaim and the moment of the current checkpoint reclaim, performing an addition operation with a fixed step on a reference count of a data block that needs to be reserved in the M data blocks, determining, in the M data blocks, a first data block that needs to be reclaimed, determining, in N data blocks allocated for at least one of a checkpoint or a snapshot reserved at the moment of the previous checkpoint reclaim, a second data block that needs to be reclaimed, where N is an integer not less than 1, and reclaiming the first data block and the second data block, no traversal operation needs to be performed on a data block that needs to be reclaimed in data blocks generated between the moment of the previous checkpoint reclaim and the moment of the current checkpoint reclaim in the COW file system, instead, a traversal operation needs to be performed only on a data block that needs to be reserved. Therefore, the following technical effects are achieved. A corresponding data amount is reduced when a traversal operation is performed on the data block that needs to be reclaimed in the data blocks generated between the moment of the previous checkpoint reclaim and the moment of the current checkpoint reclaim in the COW file system, and a traversing scale is reduced when the COW file system reclaims space.

Embodiment 2

Referring to FIG. 7, FIG. 7 is a schematic diagram of a COW file system that includes a cut-off root area at a moment of a previous checkpoint reclaim, a cut-off root area at a moment of a current checkpoint reclaim, and a real-time root area according to an embodiment of the present disclosure. As shown in FIG. 7, the cut-off root area at the moment of the previous checkpoint reclaim is a root area in which N data blocks are indexed, the real-time root area is a root area in which K data blocks are indexed, and the cut-off root area at the moment of the current checkpoint reclaim is a root area in which the file system copies, when obtaining the checkpoint reclaim instruction, an indexing relationship that is in the real-time root area. Certainly, it should be noted that, in this embodiment, generation and deletion of a snapshot or a checkpoint in the COW file system are implemented by means of insertion and deletion of a tree of the COW file system, where the snapshot or the checkpoint mounts a root area of the COW file system in order to ensure that no missing occurs when space corresponding to a data block that needs to be reclaimed is reclaimed according to the tree of the COW file system.

As shown in FIG. 7, data in the cut-off root area at the moment of the previous checkpoint reclaim is indexes for data blocks reserved at a moment of the previous checkpoint reclaim in the COW file system. Because there is only a checkpoint at the moment of the previous checkpoint reclaim in the COW file system, numbers of data blocks referenced by the reserved checkpoint include A, B, C, D, E, F, and G. In this embodiment, that data in the real-time root area is indexes for data blocks allocated for a newly generated checkpoint by the COW file system after the moment of the previous checkpoint reclaim is used as an example. Numbers of the data blocks allocated for the newly generated checkpoint after the moment of the previous checkpoint reclaim are B, C, D, F, G, and H, and numbers of data blocks directly or indirectly referenced by a data block numbered H are B, C, D, E, F, and G.

Referring to FIG. 8, FIG. 8 is a schematic diagram of the COW file system at a moment of the current checkpoint reclaim according to this embodiment of the present disclosure. As shown in FIG. 8, compared with the moment of the previous checkpoint reclaim, the COW file system undergoes some transactions and generates another checkpoint at the moment of the current checkpoint reclaim, where numbers of data blocks allocated for the newly generated checkpoint are B, C, D, F, G, and I, and an index for the data block numbered I is in the real-time root area.

Referring to FIG. 9, FIG. 9 is a schematic diagram of the COW file system after receiving a checkpoint reclaim instruction according to this embodiment of the present disclosure. As shown in FIG. 9, after receiving the checkpoint reclaim instruction, the COW file system copies data in the real-time root area shown in FIG. 8 to the cut-off root area of the current checkpoint reclaim. The data in the real-time root area refers to the index for the data block numbered I and indexes for data blocks directly or indirectly referenced by the data block numbered I shown in FIG. 8, that is, indexes for the data blocks numbered B, C, D, F, G, and I. Certainly, as shown in FIG. 9, after receiving the checkpoint reclaim instruction, the COW file system continues to index, in the real-time root area according to a running status of the COW file system, a data block newly added after the moment of the current checkpoint reclaim, for example, a data block numbered J shown in FIG. 9. Details are not described herein again.

As shown in FIG. 9, after the data in the real-time root area is copied to the cut-off root area at the moment of the current checkpoint reclaim, a reference count addition traversal operation can be performed on the data blocks in the cut-off root area at the moment of the current checkpoint reclaim (it should be noted that, impact of the real-time root area does not need to be considered at this time, that is, a reference relationship of the data block numbered J is not counted). Obtained reference counts of the data blocks are as follows:

TABLE 5
Data Block Number Reference Count
I                 1
B                 2
C                 2
D                 1
E                 1
F                 1
G                 1

In step S1, M data blocks already allocated by the COW file system between the moment of the previous checkpoint reclaim and the moment of the current checkpoint reclaim are obtained. Further, similar to the process in Embodiment 1, the M data blocks may also be obtained using a data block allocation module of the COW file system. A detailed process is already introduced in Embodiment 1, and details are not described herein again for conciseness of the specification.

In this embodiment, it can be known from the data block allocation module of the COW file system that, numbers of the M data blocks already allocated by the COW file system between the moment of the previous checkpoint reclaim and the moment of the current checkpoint reclaim are B to I respectively.

After the data blocks already allocated by the COW file system between the moment of the previous checkpoint reclaim and the moment of the current checkpoint reclaim are obtained in step S1, in a checkpoint reclaim method provided by this embodiment of the present disclosure, step S2 is performed, which is performing an addition operation with a fixed step on a reference count of a data block that needs to be reserved in the M data blocks, and determining, in the M data blocks, a first data block that needs to be reclaimed. As shown in FIG. 9, because only the checkpoint is generated, only a latest checkpoint needs to be reserved. In a cut-off root area, numbers of data blocks referenced by the latest checkpoint are B, C, D, F, G, and I. Therefore, in the M data blocks, data blocks numbered B, C, D, F, G, and I need to be reserved, and a data block numbered H is a data block that can be reclaimed.

In this embodiment, because the numbers of the data blocks already allocated by the COW file system between the moment of the previous checkpoint reclaim and the moment of the current checkpoint reclaim are B to I, with reference to Table 5, it can be known that the data block numbered H is a first data block that needs to be reclaimed. The data block numbered H does not need to be reserved when the reference count addition traversal operation is performed on data blocks indexed in the cut-off root area at the moment of the current checkpoint reclaim, because not being referenced. In addition, the reference count addition traversal operation does not need to be performed on the data block numbered H, and a reference count subtraction traversal operation does not need to be performed on the data block numbered H during the reclaim either. Nevertheless, in the prior art, the reference count addition traversal operation and the reference count subtraction traversal operation are separately performed on the data block numbered H.

After a number of the first data block that needs to be reclaimed is determined in step S2, in the checkpoint reclaim method provided by this embodiment of the present disclosure, step S3 is performed, which is determining, in N data blocks allocated for at least one of a checkpoint or a snapshot reserved at the moment of the previous checkpoint reclaim, a second data block that needs to be reclaimed, where N is an integer not less than 1.

Further, in this embodiment, because there is only a checkpoint, the reference count subtraction traversal operation may be performed on data blocks referenced by a checkpoint indexed in the cut-off root area of the previous checkpoint reclaim, and results are as follows:

TABLE 6
Data Block Number Reference Count
A                 0
B                 1
C                 1
D                 1
E                 1
F                 1
G                 1

It can be seen from Table 6 that, a data block numbered A is a data block that is no longer referenced, and the data block numbered A is a data block that needs to be reclaimed, that is, A is a number of the second data block.

After the first data block that needs to be reclaimed is determined in step S2 and the second data block that needs to be reclaimed is determined in step S3, in the checkpoint reclaim method provided by this embodiment of the present disclosure, step S4 is performed, which is reclaiming the first data block and the second data block.

Similar to Embodiment 1, in this embodiment, reclaiming first space corresponding to the number of the first data block is reclaiming space corresponding to the data block numbered H, and reclaiming second space corresponding to the number of the second data block is reclaiming space corresponding to the data block numbered A. For conciseness of the specification, details are not described herein again.

In a specific implementation process, after the first space corresponding to the number of the first data block and the second space corresponding to the number of the second data block are reclaimed, the method further includes deleting data in the cut-off root area at the moment of the previous checkpoint reclaim, and copying data in the cut-off root area at the moment of the current checkpoint reclaim to the cut-off root area at the moment of the previous checkpoint reclaim.

Further, still referring to FIG. 9, as shown in FIG. 9, after the COW file system completes the checkpoint reclaim, the cut-off root area at the moment of the previous checkpoint reclaim is cleared, for example, indexes in the cut-off root area at the moment of the previous checkpoint reclaim are deleted, and the data in the cut-off root area at the moment of the current checkpoint reclaim such as index information of a data block is copied to the cut-off root area at the moment of the previous checkpoint reclaim in order to be used by the COW file system during a next space reclaim. Referring to FIG. 10, FIG. 10 is a schematic diagram of copying the data in the cut-off root area at the moment of the current checkpoint reclaim to the cut-off root area at the moment of the previous checkpoint reclaim according to this embodiment of the present disclosure, and details are not described herein again.

In a specific implementation process, if a checkpoint or a snapshot is already deleted, its index no longer exists in the cut-off root area at the moment of the current checkpoint reclaim (for example, after a new checkpoint is generated, an old checkpoint is no longer indexed). It is found that a reference count of the checkpoint or the snapshot is 0 when a reference count subtraction traversal operation is performed downwards from the cut-off root area at the moment of the previous checkpoint reclaim, and subtraction continues to be performed downwards. Besides, if a checkpoint or a snapshot is currently reserved (for example, if a snapshot is not deleted after being generated, an index for the snapshot always exists in the real-time root area), its index exists in the cut-off root area at the moment of the current checkpoint reclaim. It is found that a reference count of the checkpoint or the snapshot is not 0 when the reference count subtraction traversal operation is performed downwards from the cut-off root area at the moment of the previous checkpoint reclaim, and subtraction is no longer performed downwards. Therefore, after receiving the checkpoint reclaim instruction, the COW file system can reclaim complete space reclaim according to an index status in the real-time root area without knowing which checkpoint or snapshot needs to be reclaimed.

The foregoing technical solution in this embodiment of the present disclosure has at least the following technical effects or advantages.

Because the use of technical solution of obtaining, according to a checkpoint reclaim instruction, M data blocks allocated by a file system between a moment of a previous checkpoint reclaim and a moment of a current checkpoint reclaim, where M is an integer not less than 1, and the M data blocks are data blocks allocated for at least one of a checkpoint or a snapshot generated between the moment of the previous checkpoint reclaim and the moment of the current checkpoint reclaim, performing an addition operation with a fixed step on a reference count of a data block that needs to be reserved in the M data blocks, determining, in the M data blocks, a first data block that needs to be reclaimed, determining, in N data blocks allocated for at least one of a checkpoint or a snapshot reserved at the moment of the previous checkpoint reclaim, a second data block that needs to be reclaimed, where N is an integer not less than 1, and reclaiming the first data block and the second data block, no traversal operation needs to be performed on a data block that needs to be reclaimed in data blocks generated between the moment of the previous checkpoint reclaim and the moment of the current checkpoint reclaim in the COW file system, instead, a traversal operation needs to be performed only on a data block that needs to be reserved. Therefore, the following technical effects are achieved. A corresponding data amount is reduced when a traversal operation is performed on the data block that needs to be reclaimed in the data blocks generated between the moment of the previous checkpoint reclaim and the moment of the current checkpoint reclaim in the COW file system, and a traversing scale is reduced when the COW file system reclaims space.

Based on the same disclosure idea, an embodiment of the present disclosure further provides a checkpoint reclaim apparatus in a COW file system. Referring to FIG. 11, FIG. 11 is a module diagram of the apparatus according to this embodiment of the present disclosure. As shown in FIG. 11, the apparatus includes an obtaining unit 101 configured to obtain, according to a checkpoint reclaim instruction, M data blocks allocated by the file system between a moment of a previous checkpoint reclaim and a moment of a current checkpoint reclaim, where M is an integer not less than 1, and the M data blocks are data blocks allocated for at least one of a checkpoint or a snapshot generated between the moment of the previous checkpoint reclaim and the moment of the current checkpoint reclaim, a first determining unit 102 configured to perform an addition operation with a fixed step on a reference count of a data block that needs to be reserved in the M data blocks, and determine, in the M data blocks, a first data block that needs to be reclaimed, a second determining unit 103 configured to determine, in N data blocks allocated for at least one of a checkpoint or a snapshot reserved at the moment of the previous checkpoint reclaim, a second data block that needs to be reclaimed, where N is an integer not less than 1, and a reclaim unit 104 configured to reclaim the first data block and the second data block.

In a specific implementation process, the first determining unit 102 is further configured to perform the addition operation with the fixed step on reference counts of K data blocks allocated for a latest currently generated checkpoint, to obtain first reference counts of the K data blocks, and determine the first data block in data blocks of the M data blocks except the K data blocks when only a checkpoint is generated between the moment of the previous checkpoint reclaim and the moment of the current checkpoint reclaim, or perform the addition operation with the fixed step on reference counts of K data blocks allocated for the snapshot generated between the moment of the previous checkpoint reclaim and the moment of the current checkpoint reclaim and for a latest currently generated checkpoint, to obtain first reference counts of the K data blocks, and determine the first data block in data blocks of the M data blocks except the K data blocks when both a checkpoint and a snapshot are generated between the moment of the previous checkpoint reclaim and the moment of the current checkpoint reclaim.

In a specific implementation process, the second determining unit 103 is further configured to perform a subtraction operation with the fixed step on reference counts of L data blocks, in the N data blocks, allocated for a checkpoint reserved at the moment of the previous checkpoint reclaim, and determine current second counts of the L data blocks, where before the obtaining first reference counts of the K data blocks, reference counts of the N data blocks are first referential reference counts, and determine the second data block in the N data blocks according to the first reference counts, the second reference counts, and the first referential reference counts.

In a specific implementation process, the apparatus further includes a third determining unit 105, where the third determining unit 105 is configured to determine a reference count of a data block that needs to be reserved for the current checkpoint reclaim as a current first referential reference count according to the first reference counts, the second reference counts, and the first referential reference counts.

In a specific implementation process, when the file system includes a cut-off root area of the previous checkpoint reclaim, a cut-off root area of the current checkpoint reclaim, and a real-time root area, the cut-off root area of the previous checkpoint reclaim is a root area in which the N data blocks are indexed, the real-time root area is a root area in which the K data blocks are indexed, and the cut-off root area of the current checkpoint reclaim is a root area in which the file system copies, when obtaining the checkpoint reclaim instruction, an indexing relationship that is in the real-time root area.

In a specific implementation process, the reclaim unit 104 is further configured to delete data in the cut-off root area of the previous checkpoint reclaim, and copy data in the cut-off root area of the current checkpoint reclaim to the cut-off root area of the previous checkpoint reclaim.

It should be noted that, the apparatus in this embodiment and the method in the foregoing embodiments are two aspects based on the same disclosure idea. An implementation process of the method has been described in detail above. Therefore, a person skilled in the art can clearly understand a structure and an implementation process of the apparatus in this embodiment according to the foregoing description. For conciseness of the specification, details are not described herein again.

In this embodiment of the present disclosure, a symbol representing a quantity of data blocks is the same as a symbol representing a number of a data block, but each has an independent meaning. The symbol representing a quantity of data blocks is used to represent a quantity of data blocks, while the symbol representing a number of a data block is only used to distinguish different data blocks. A number of a data block may also be represented in another form, for example, a digit or a character string. Besides, for the addition operation with the fixed step and the subtraction operation with the fixed step, performed on the data block, mentioned in this embodiment of the present disclosure, the step may be 1. A meaning of performing the addition operation with the fixed step on the data block is the same as a meaning of performing a reference count addition operation on the data block, and a meaning of performing the subtraction operation with the fixed step on the data block is the same as a meaning of performing a reference count subtraction operation on the data block. Further, a reference count is added by 1, and the data block is a data block allocated for the snapshot or checkpoint when the reference count addition operation is performed on a data block referenced by a snapshot and/or a checkpoint that needs to be reserved, that is, when the data block is referenced by the snapshot or the checkpoint once.

A person skilled in the art should understand that the embodiments of the present disclosure may be provided as a method, a system, or a computer program product. Therefore, the present disclosure may use a form of hardware only embodiments, software only embodiments, or embodiments with a combination of software and hardware. Moreover, the present disclosure may use a form of a computer program product that is implemented on one or more computer-usable storage media (including but not limited to a disk memory, a compact disc read-only memory (CD-ROM), an optical memory, and the like) that include computer-usable program code.

The present disclosure is described with reference to the flowcharts and/or block diagrams of the method, the device (system), and the computer program product according to the embodiments of the present disclosure. It should be understood that computer program instructions may be used to implement each process and/or each block in the flowcharts and/or the block diagrams and a combination of a process and/or a block in the flowcharts and/or the block diagrams. These computer program instructions may be provided for a general-purpose computer, a dedicated computer, an embedded processor, or a processor of any other programmable data processing device to generate a machine such that the instructions executed by a computer or a processor of any other programmable data processing device generate an apparatus for implementing a specific function in one or more processes in the flowcharts and/or in one or more blocks in the block diagrams.

These computer program instructions may also be stored in a computer readable memory that can instruct the computer or any other programmable data processing device to work in a specific manner such that the instructions stored in the computer readable memory generate an artifact that includes an instruction apparatus. The instruction apparatus implements a specific function in one or more processes in the flowcharts and/or in one or more blocks in the block diagrams.

These computer program instructions may also be loaded onto a computer or another programmable data processing device such that a series of operations and steps are performed on the computer or the other programmable device, thereby generating computer-implemented processing. Therefore, the instructions executed on the computer or the other programmable device provide steps for implementing a specific function in one or more processes in the flowcharts and/or in one or more blocks in the block diagrams.

Claims

1. A checkpoint reclaim method in a copy-on-write file system, the method comprising: obtaining, according to a checkpoint reclaim instruction, M data blocks allocated by the file system between a moment of a previous checkpoint reclaim and a moment of a current checkpoint reclaim, wherein M is an integer not less than 1, and wherein the M data blocks are data blocks allocated for at least one of a checkpoint or a snapshot generated between the moment of the previous checkpoint reclaim and the moment of the current checkpoint reclaim;performing an addition operation with a fixed step on a reference count of a data block that needs to be reserved in the M data blocks;determining a first data block that needs to be reclaimed in the M data blocks and a second data block that needs to be reclaimed in N data blocks allocated for at least one of a checkpoint or a snapshot reserved at the moment of the previous checkpoint reclaim, wherein N is an integer not less than 1; andreclaiming the first data block and the second data block.

2. The method according to claim 1, wherein the method further comprises: when only a checkpoint is generated between the moment of the previous checkpoint reclaim and the moment of the current checkpoint reclaim, performing the addition operation with the fixed step on reference counts of K data blocks allocated for a latest currently generated checkpoint, to obtain first reference counts of the K data blocks;when only the checkpoint is generated between the moment of the previous checkpoint reclaim and the moment of the current checkpoint reclaim, determining the first data block in data blocks of the M data blocks except the K data blocks;when both the checkpoint and a snapshot are generated between the moment of the previous checkpoint reclaim and the moment of the current checkpoint reclaim, performing the addition operation with the fixed step on reference counts of K data blocks allocated for the snapshot generated between the moment of the previous checkpoint reclaim and the moment of the current checkpoint reclaim and for a latest currently generated checkpoint, to obtain first reference counts of the K data blocks; andwhen both the checkpoint and the snapshot are generated between the moment of the previous checkpoint reclaim and the moment of the current checkpoint reclaim, determining the first data block in data blocks of the M data blocks except the K data blocks.

3. The method according to claim 2, wherein the method further comprises: performing a subtraction operation with the fixed step on reference counts of L data blocks, in the N data blocks, allocated for a checkpoint reserved at the moment of the previous checkpoint reclaim;determining second reference counts of the L data blocks, wherein before the obtaining first reference counts of the K data blocks, reference counts of the N data blocks are first referential reference counts; anddetermining the second data block in the N data blocks according to the first reference counts, the second reference counts, and the first referential reference counts.

4. The method according to claim 3, wherein the method further comprises determining a reference count of a data block that needs to be reserved for the current checkpoint reclaim as a current first referential reference count according to the first reference counts, the second reference counts, and the first referential reference counts.

5. The method according to claim 3, wherein when the file system comprises a cut-off root area of the previous checkpoint reclaim, a cut-off root area of the current checkpoint reclaim, and a real-time root area, wherein the cut-off root area of the previous checkpoint reclaim is a root area in which the N data blocks are indexed, wherein the real-time root area is a root area in which the K data blocks are indexed, and wherein the cut-off root area of the current checkpoint reclaim is a root area in which the file system copies, when obtaining the checkpoint reclaim instruction, an indexing relationship that is in the real-time root area.

6. The method according to claim 5, wherein the method further comprises: deleting data in the cut-off root area of the previous checkpoint reclaim; andcopying data in the cut-off root area of the current checkpoint reclaim to the cut-off root area of the previous checkpoint reclaim.

7. A checkpoint reclaim apparatus in a copy-on-write file system, the apparatus comprising: a memory configured to store instructions; anda processor coupled to the memory and configured to execute the instructions to perform steps of:obtaining, according to a checkpoint reclaim instruction, M data blocks allocated by the file system between a moment of a previous checkpoint reclaim and a moment of a current checkpoint reclaim, wherein M is an integer not less than 1, and the M data blocks are data blocks allocated for at least one of a checkpoint or a snapshot generated between the moment of the previous checkpoint reclaim and the moment of the current checkpoint reclaim;performing an addition operation with a fixed step on a reference count of a data block that needs to be reserved in the M data blocks;determining, in the M data blocks, a first data block that needs to be reclaimed;determining, in N data blocks allocated for at least one of a checkpoint or a snapshot reserved at the moment of the previous checkpoint reclaim, a second data block that needs to be reclaimed, wherein N is an integer not less than 1; andreclaiming the first data block and the second data block.

8. The apparatus according to claim 7, wherein the processor is further configured to perform steps of: when only a checkpoint is generated between the moment of the previous checkpoint reclaim and the moment of the current checkpoint reclaim, performing the addition operation with the fixed step on reference counts of K data blocks allocated for a latest currently generated checkpoint, to obtain first reference counts of the K data blocks;when only the checkpoint is generated between the moment of the previous checkpoint reclaim and the moment of the current checkpoint reclaim, determining the first data block in data blocks of the M data blocks except the K data blocks;when both the checkpoint and a snapshot are generated between the moment of the previous checkpoint reclaim and the moment of the current checkpoint reclaim, performing the addition operation with the fixed step on reference counts of K data blocks allocated for the snapshot generated between the moment of the previous checkpoint reclaim and the moment of the current checkpoint reclaim and for a latest currently generated checkpoint, to obtain first reference counts of the K data blocks; andwhen both the checkpoint and the snapshot are generated between the moment of the previous checkpoint reclaim and the moment of the current checkpoint reclaim, determining the first data block in data blocks of the M data blocks except the K data blocks.

9. The apparatus according to claim 8, wherein the processor is further configured to perform steps of: performing a subtraction operation with the fixed step on reference counts of L data blocks, in the N data blocks, allocated for a checkpoint reserved at the moment of the previous checkpoint reclaim;determining second reference counts of the L data blocks, wherein before the obtaining first reference counts of the K data blocks, reference counts of the N data blocks are first referential reference counts; anddetermine the second data block in the N data blocks according to the first reference counts, the second reference counts, and the first referential reference counts.

10. The apparatus according to claim 9, wherein the processor is further configured to perform step of determining a reference count of a data block that needs to be reserved for the current checkpoint reclaim as a current first referential reference count according to the first reference counts, the second reference counts, and the first referential reference counts.

11. The apparatus according to claim 9, wherein the file system further comprises a cut-off root area of the previous checkpoint reclaim, a cut-off root area of the current checkpoint reclaim, and a real-time root area, wherein the cut-off root area of the previous checkpoint reclaim is a root area in which the N data blocks are indexed, wherein the real-time root area is a root area in which the K data blocks are indexed, and wherein the cut-off root area of the current checkpoint reclaim is a root area in which the file system copying, when obtaining the checkpoint reclaim instruction, an indexing relationship that is in the real-time root area.

12. The apparatus according to claim 11, wherein the processor is further configured to perform steps of: deleting data in the cut-off root area of the previous checkpoint reclaim; andcopying data in the cut-off root area of the current checkpoint reclaim to the cut-off root area of the previous checkpoint reclaim.