Method and system for pruned resilvering using a dirty time log
AssigneeOracle International Corporation
InventorsWilliam H. Moore, Jeffrey S. Bonwick, Matthew A. Ahrens
Life of this patent
Estimating the term…
Abstract
A computer readable medium includes executable instructions for resilvering a hierarchical block tree in a storage pool by traversing a branch of the hierarchical block tree only if a birth time of a parent block of the branch is greater than or equal to a lowest birth time on a dirty time log (DTL), and resilvering a child block in the branch only if the DTL comprises a birth time of the child block.
Claims24
A computer readable medium comprising executable instructions for resilvering a hierarchical block tree in a storage pool by:
- determining that a birth time of a parent block of a branch of the hierarchical block tree is greater than or equal to a lowest birth time on a dirty time log (DTL);
- selectively traversing a plurality of child indirect blocks in the branch to obtain a child data block, wherein each of the plurality of child indirect blocks comprises a block pointer to a referenced block, a checksum for data stored in the referenced block, and a birth time for the referenced block, wherein the birth time of each of the plurality of child indirect blocks is less than or equal to the birth time of the parent block;
- and
- resilvering the child data block in the branch when the DTL comprises a birth time of the child data block, wherein one of the plurality of child indirect blocks comprises the birth time of the child data block.
(canceled)
A computer readable medium comprising executable instructions for resilvering a hierarchical block tree in a storage pool by:
- obtaining a birth time of each child block of a plurality of child blocks referenced by a parent block in the hierarchical block tree;
- and
- for each child block:
- a) resilvering the child block when the child block is a data block and a dirty time log (DTL) comprises the birth time of the data block;
- and
- b) when the child block is an indirect block and the birth time of the indirect block is greater than or equal to a lowest birth time on the DTL:
- selectively traversing the hierarchical block tree to obtain a birth time of each grandchild block referenced by the indirect block, wherein the indirect block comprises a checksum for data stored in each grandchild block;
- and
- repeating a) and b) for each grandchild block
- wherein the indirect block comprises the birth time of the data block.
(canceled)
(canceled)
A computer system comprising:
- a processor;
- a memory;
- a hierarchical block tree in a storage pool, comprising:
- a parent block of a branch of the hierarchical block tree;
- a plurality of child indirect blocks in the branch;
- and
- a child data block in the branch;
- a dirty time log (DTL);
- and
- a file system, wherein at least a portion of the file system is resident in the memory and operating under control of the processor, configured to:
- determine that a birth time of the parent block is greater than or equal to a lowest birth time on the DTL;
- selectively traverse the plurality of child indirect blocks to obtain the child data block, wherein each of the plurality of child indirect blocks comprises a block pointer to a referenced block, a checksum for data stored in the referenced block, and a birth time for the referenced block, wherein the birth time of each of the plurality of child indirect blocks is less than or equal to the birth time of the parent block;
- and
- resilver the child data block when the DTL comprises a birth time of the child data block, wherein one of the plurality of child indirect blocks comprises the birth time of the child data block.
(canceled)
Dependencies are inferred from the claim text.