mirror of
https://github.com/FEX-Emu/linux.git
synced 2024-12-15 13:22:55 +00:00
89642229a5
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> |
||
|---|---|---|
| .. | ||
| acl.c | ||
| async-thread.c | ||
| async-thread.h | ||
| bit-radix.c | ||
| bit-radix.h | ||
| btrfs_inode.h | ||
| compat.h | ||
| COPYING | ||
| crc32c.h | ||
| ctree.c | ||
| ctree.h | ||
| dir-item.c | ||
| disk-io.c | ||
| disk-io.h | ||
| extent_io.c | ||
| extent_io.h | ||
| extent_map.c | ||
| extent_map.h | ||
| extent-tree.c | ||
| file-item.c | ||
| file.c | ||
| hash.c | ||
| hash.h | ||
| inode-item.c | ||
| inode-map.c | ||
| inode.c | ||
| INSTALL | ||
| ioctl.c | ||
| ioctl.h | ||
| locking.c | ||
| locking.h | ||
| Makefile | ||
| ordered-data.c | ||
| ordered-data.h | ||
| print-tree.c | ||
| print-tree.h | ||
| root-tree.c | ||
| struct-funcs.c | ||
| super.c | ||
| sysfs.c | ||
| TODO | ||
| transaction.c | ||
| transaction.h | ||
| tree-defrag.c | ||
| volumes.c | ||
| volumes.h | ||
| xattr.c | ||
| xattr.h | ||