# US 2010/0145919 A1 · Method and system for pruned resilvering using a dirty time log

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2010/0145919 A1
- Document ID: US20100145919A1
- Status: Published application
- Kind: A1
- Application number: 12/707,290
- Filed: 2010-02-17
- Published: 2010-06-10
- Earliest claimed: 2005-11-04
- Assignees: Oracle International Corporation
- Inventors: William H. Moore; Jeffrey S. Bonwick; Matthew A. Ahrens
- Web page: https://patentgrep.com/patent/US20100145919A1

## CPC

- G06F 11/1435: {using file system or storage system metadata}
- G06F 11/2082: {Data synchronisation}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## 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.

## Claims

### Claim 1

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.

### Claim 2

(canceled)

### Claim 3 (depends on 1)

The computer readable medium of claim 1, wherein the birth time of the parent block corresponds to a transaction group associated with an input/output (I/O) request to store the parent block.

### Claim 4 (depends on 1)

The computer readable medium of claim 1, wherein the birth time of the child data block corresponds to a transaction group associated with an input/output (I/O) request to store the child data block.

### Claim 5 (depends on 1)

The computer readable medium of claim 1, wherein the DTL is associated with a first disk in the storage pool, and wherein resilvering the child data block comprises updating the child block using data from a second disk in the storage pool.

### Claim 6 (depends on 1)

The computer readable medium of claim 1, wherein the traversing comprises performing a depth-first traversal of the branch.

### Claim 7 (depends on 1)

The computer readable medium of claim 1, further comprising executable instructions for resilvering a hierarchical block tree in a storage pool by:
resilvering the parent block only if the DTL comprises the birth time of the parent block.

### Claim 8

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.

### Claim 9

(canceled)

### Claim 10 (depends on 8)

The computer readable medium of claim 8, wherein the birth time of each child block corresponds to a transaction group associated with an input/output (I/O) request to store the child block.

### Claim 11

(canceled)

### Claim 12 (depends on 8)

The computer readable medium of claim 8, wherein the DTL is associated with a first disk in the storage pool, and wherein resilvering the child block comprises updating the child block using data from a second disk in the storage pool.

### Claim 13 (depends on 8)

The computer readable medium of claim 8, wherein the birth time of each child block is obtained when the birth time of the parent block is greater than or equal to the lowest birth time on the DTL.

### Claim 14 (depends on 8)

The computer readable medium of claim 8, wherein the hierarchical block tree corresponds to a file in a file system.

### Claim 15

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.

### Claim 16

(canceled)

### Claim 17 (depends on 15)

The computer system of claim 15, wherein the birth time of the parent block corresponds to a transaction group associated with an input/output (I/O) request to store the parent block.

### Claim 18 (depends on 15)

The computer system of claim 15, wherein the birth time of the child data block corresponds to a transaction group associated with an input/output (I/O) request to store the child data block.

### Claim 19 (depends on 15)

The computer system of claim 15, wherein the DTL is associated with a first disk in the storage pool, and wherein resilvering the child data block comprises updating the child data block using data from a second disk in the storage pool.

### Claim 20 (depends on 15)

The computer system of claim 15, wherein the file system is configured to traverse the branch by performing a depth-first traversal of the branch.

### Claim 21 (depends on 1)

The computer readable medium of claim 1, wherein the checksum is used to determine that the data stored in the referenced block is not corrupted.

### Claim 22 (depends on 8)

The computer readable medium of claim 8, wherein the checksum is used to determine that the data stored in each grandchild block is not corrupted.

### Claim 23 (depends on 8)

The computer readable medium of claim 8, wherein the birth time of each of the plurality of child blocks is less than or equal to a birth time of the parent block.

### Claim 24 (depends on 15)

The computer system of claim 15, wherein the checksum is used to determine that the data stored in the referenced block is not corrupted.
