path: root/ctree.h
diff options
authorChris Mason <>2008-12-08 17:00:31 -0500
committerChris Mason <>2008-12-08 17:00:31 -0500
commitd79f499eae6671a04e80b5a3081fae8e2a311b54 (patch)
treeccbb2e97d422513ec38455eafcebfa926c277491 /ctree.h
parentd45ee76e4f32157b6aec7de701e825f8ad5b45eb (diff)
Btrfs: move data checksumming into a dedicated tree
Btrfs stores checksums for each data block. Until now, they have been stored in the subvolume trees, indexed by the inode that is referencing the data block. This means that when we read the inode, we've probably read in at least some checksums as well. But, this has a few problems: * The checksums are indexed by logical offset in the file. When compression is on, this means we have to do the expensive checksumming on the uncompressed data. It would be faster if we could checksum the compressed data instead. * If we implement encryption, we'll be checksumming the plain text and storing that on disk. This is significantly less secure. * For either compression or encryption, we have to get the plain text back before we can verify the checksum as correct. This makes the raid layer balancing and extent moving much more expensive. * It makes the front end caching code more complex, as we have touch the subvolume and inodes as we cache extents. * There is potentitally one copy of the checksum in each subvolume referencing an extent. The solution used here is to store the extent checksums in a dedicated tree. This allows us to index the checksums by phyiscal extent start and length. It means: * The checksum is against the data stored on disk, after any compression or encryption is done. * The checksum is stored in a central location, and can be verified without following back references, or reading inodes. This makes compression significantly faster by reducing the amount of data that needs to be checksummed. It will also allow much faster raid management code in general. The checksums are indexed by a key with a fixed objectid (a magic value in ctree.h) and offset set to the starting byte of the extent. This allows us to copy the checksum items into the fsync log tree directly (or any other tree), without having to invent a second format for them. Signed-off-by: Chris Mason <>
Diffstat (limited to 'ctree.h')
1 files changed, 16 insertions, 0 deletions
diff --git a/ctree.h b/ctree.h
index df2d722a..c640a69a 100644
--- a/ctree.h
+++ b/ctree.h
@@ -54,6 +54,9 @@ struct btrfs_trans_handle;
/* directory objectid inside the root tree */
+/* holds checksums of all the data extents */
/* oprhan objectid for tracking unlinked/truncated files */
@@ -66,6 +69,13 @@ struct btrfs_trans_handle;
+ * extent checksums all have this objectid
+ * this allows them to share the logging tree
+ * for fsyncs
+ */
/* dummy objectid represents multiple objectids */
@@ -583,6 +593,7 @@ struct btrfs_fs_info {
struct btrfs_root *tree_root;
struct btrfs_root *chunk_root;
struct btrfs_root *dev_root;
+ struct btrfs_root *csum_root;
/* the log root tree is a directory of all the other log roots */
struct btrfs_root *log_root_tree;
@@ -688,6 +699,11 @@ struct btrfs_root {
* csum items have the checksums for data in the extents
+ * extent csums are stored in a separate tree and hold csums for
+ * an entire extent on disk.
+ */
* root items point to tree roots. There are typically in the root