diff options
| author | Chris Mason <chris.mason@oracle.com> | 2008-07-24 15:41:53 +0200 |
|---|---|---|
| committer | Chris Mason <chris.mason@oracle.com> | 2008-09-25 17:04:05 +0200 |
| commit | 89642229a582a5c2b6d2ed8ec16986387d9a9047 (patch) | |
| tree | 6ece7a9b7d92159096229e27b4862c3685f198f6 /fs/btrfs/locking.c | |
| parent | Btrfs: Fix 32 bit compiles by using an unsigned long byte count in the ordere... (diff) | |
| download | linux-89642229a582a5c2b6d2ed8ec16986387d9a9047.tar.xz linux-89642229a582a5c2b6d2ed8ec16986387d9a9047.zip | |
Btrfs: Search data ordered extents first for checksums on read
Checksum items are not inserted into the tree until all of the io from a
given extent is complete. This means one dirty page from an extent may
be written, freed, and then read again before the entire extent is on disk
and the checksum item is inserted.
The checksums themselves are stored in the ordered extent so they can
be inserted in bulk when IO is complete. On read, if a checksum item isn't
found, the ordered extents were being searched for a checksum record.
This all worked most of the time, but the checksum insertion code tries
to reduce the number of tree operations by pre-inserting checksum items
based on i_size and a few other factors. This means the read code might
find a checksum item that hasn't yet really been filled in.
This commit changes things to check the ordered extents first and only
dive into the btree if nothing was found. This removes the need for
extra locking and is more reliable.
Signed-off-by: Chris Mason <chris.mason@oracle.com>
Diffstat (limited to 'fs/btrfs/locking.c')
0 files changed, 0 insertions, 0 deletions