btrfs-progs: extent tree v2 support, global roots
v2 cover btrfs-progs: extent tree v2 support, global roots
v1->v2:
- These depend on the v3 of the prep patches (it's marked as v2 because I'm stupid, but the second v2 posting I sent.)
- I've moved the global root rb tree patches into this series to differentiate them from the actual fixes in the prep series.
--- Original email ---
Hello,
These patches are the first chunk of the extent tree v2 format changes. This includes the separate block group root which will hold all of the block group items. This also includes the global root support, which is the work to allow us to have multiple extent, csum, and free space trees in the same file system.
The goal of these two changes are straightforward. For the block group root, on very large file systems the block group items are very widely separated, which means it takes a very long time to mount the file system on large, slow disks. Putting the block group items in their own root will allow us to densely populate the tree and dramatically increase mount times in these cases.
The global roots change is motivated by lock contention on the root nodes of these global roots. I've had to make many changes to how we run delayed refs to speed up things like the transaction commit because of all the delayed refs going into one tree and contending on the root node of the extent tree. In the same token you can have heavy lock contention on the csum roots when writing to many files. Allowing for multiple roots will let us spread the lock contention load around.
I have disabled a few key features, namely balance and qgroups. There will be more to come as I make more and more invasive changes, and then they will slowly be re-enabled as the work is added. These are disabled to avoid a bunch of work that would be thrown away by future changes.
These patches have passed xfstests without panicing, but clearly failing a lot of tests because of the disabled features. I've also run it through fsperf to validate that there are no major performance regressions.
WARNING: there are many more format changes planned, this is just the first batch. If you want to test then please feel free, but know that the format is still in flux. Thanks,
Josef
Josef Bacik (30):
btrfs-progs: stop accessing ->extent_root directly
btrfs-progs: stop accessing ->free_space_root directly
btrfs-progs: track csum, extent, and free space trees in a rb tree
btrfs-progs: check: make reinit work per found root item
btrfs-progs: check: check the global roots for uptodate root nodes
btrfs-progs: check: check all of the csum roots
btrfs-progs: check: fill csum root from all extent roots
btrfs-progs: common: search all extent roots for marking used space
btrfs-progs: common: allow users to select extent-tree-v2 option
btrfs-progs: add definitions for the block group tree
btrfs-progs: add on disk pointers to global tree ids
btrfs-progs: add support for loading the block group root
btrfs-progs: add print support for the block group tree
btrfs-progs: mkfs: use the btrfs_block_group_root helper
btrfs-progs: check-lowmem: use the btrfs_block_group_root helper
btrfs-progs: handle no bg item in extent tree for free space tree
btrfs-progs: mkfs: add support for the block group tree
btrfs-progs: check: add block group tree support
btrfs-progs: qgroup-verify: scan extents based on block groups
btrfs-progs: check: make free space tree validation extent tree v2
aware
btrfs-progs: check: add helper to reinit the root based on a key
btrfs-progs: check: handle the block group tree properly
btrfs-progs: load the number of global roots into the fs_info
btrfs-progs: handle the per-block group global root id
btrfs-progs: add a btrfs_delete_and_free_root helper
btrfs-progs: make btrfs_clear_free_space_tree extent tree v2 aware
btrfs-progs: make btrfs_create_tree take a key for the root key
btrfs-progs: mkfs: set chunk_item_objectid properly for extent tree v2
btrfs-progs: mkfs: create the global root's
btrfs-progs: check: don't do the root item check for extent tree v2
btrfs-corrupt-block.c | 13 +- btrfs-map-logical.c | 9 +- btrfstune.c | 2 +- check/main.c | 429 ++++++++++++++++--------- check/mode-common.c | 8 +- check/mode-lowmem.c | 76 +++-- check/qgroup-verify.c | 34 +- cmds/inspect-dump-tree.c | 37 ++- cmds/rescue-chunk-recover.c | 18 +- common/fsfeatures.c | 11 + common/repair.c | 146 ++++++--- common/repair.h | 2 + convert/main.c | 4 +- image/main.c | 2 +- kernel-shared/backref.c | 10 +- kernel-shared/ctree.h | 70 +++- kernel-shared/disk-io.c | 553 ++++++++++++++++++++++++++------ kernel-shared/disk-io.h | 19 +- kernel-shared/extent-tree.c | 66 ++-- kernel-shared/free-space-tree.c | 124 ++++--- kernel-shared/print-tree.c | 26 +- kernel-shared/transaction.c | 2 + kernel-shared/volumes.c | 3 +- kernel-shared/zoned.c | 2 +- libbtrfsutil/btrfs_tree.h | 3 + mkfs/common.c | 93 ++++-- mkfs/common.h | 12 + mkfs/main.c | 122 ++++++- 28 files changed, 1411 insertions(+), 485 deletions(-)
Signature · 1 line
2.26.3
PATCH v2 1/30 btrfs-progs: stop accessing ->extent_root directly
When we switch to multiple global trees we'll need to access the appropriate extent root depending on the block group or possibly root. To handle this, use a helper in most places and then the actual root in places where it is required. We will whittle down the direct accessors with future patches, but this does the bulk of the preparatory work.
--- btrfs-corrupt-block.c | 13 +++--- btrfs-map-logical.c | 9 ++-- btrfstune.c | 2 +- check/main.c | 78 +++++++++++++++++++-------------- check/mode-common.c | 8 ++-- check/mode-lowmem.c | 72 +++++++++++++++++------------- check/qgroup-verify.c | 2 +- cmds/rescue-chunk-recover.c | 18 ++++---- common/repair.c | 5 +-- convert/main.c | 4 +- image/main.c | 2 +- kernel-shared/backref.c | 10 +++-- kernel-shared/ctree.h | 2 +- kernel-shared/disk-io.c | 30 ++++++++----- kernel-shared/disk-io.h | 1 + kernel-shared/extent-tree.c | 42 ++++++++++-------- kernel-shared/free-space-tree.c | 8 +++- kernel-shared/volumes.c | 3 +- kernel-shared/zoned.c | 2 +- mkfs/main.c | 4 +- 20 files changed, 179 insertions(+), 136 deletions(-)
btrfs-corrupt-block.c +8 -5
@@ -183,6 +183,7 @@ static int corrupt_keys_in_block(struct btrfs_fs_info *fs_info, u64 bytenr)static int corrupt_extent (struct btrfs_trans_handle *trans,struct btrfs_root *root,u64 bytenr) { +struct btrfs_root *extent_root;struct btrfs_key key;struct extent_buffer *leaf;u32 item_size;
@@ -200,9 +201,9 @@ static int corrupt_extent(struct btrfs_trans_handle *trans, key.type = (u8)-1 ; key.offset = (u64)-1 ; + extent_root =btrfs_extent_root (trans->fs_info, bytenr);while (1 ) { - ret =btrfs_search_slot (trans, root->fs_info->extent_root, - &key, path,-1 ,1 ); + ret =btrfs_search_slot (trans, extent_root, &key, path,-1 ,1 );if (ret <0 )break ;
@@ -472,7 +473,7 @@ static int corrupt_block_group(struct btrfs_root *root, u64 bg, char *field)u64 orig, bogus;int ret =0 ; - root = root->fs_info->extent_root; + root =btrfs_extent_root (root->fs_info,0 ); corrupt_field =convert_block_group_field (field);if (corrupt_field ==BTRFS_BLOCK_GROUP_ITEM_BAD ) {
@@ -1382,11 +1383,13 @@ int main(int argc, char **argv) }if (extent_tree) {struct btrfs_trans_handle *trans; +struct btrfs_root *extent_root; + extent_root =btrfs_extent_root (root->fs_info,0 ); trans =btrfs_start_transaction (root,1 );BUG_ON (IS_ERR (trans)); -btrfs_corrupt_extent_tree (trans, root->fs_info->extent_root, - root->fs_info->extent_root->node); +btrfs_corrupt_extent_tree (trans, extent_root, + extent_root->node);btrfs_commit_transaction (trans, root); goto out_close; }
btrfs-map-logical.c +5 -4
@@ -42,6 +42,7 @@ static FILE *info_file;static int map_one_extent (struct btrfs_fs_info *fs_info,u64 *logical_ret,u64 *len_ret,int search_forward) { +struct btrfs_root *extent_root;struct btrfs_path *path;struct btrfs_key key;u64 logical;
@@ -59,8 +60,8 @@ static int map_one_extent(struct btrfs_fs_info *fs_info, key.type =0 ; key.offset =0 ; - ret =btrfs_search_slot (NULL , fs_info->extent_root, &key, path, -0 ,0 ); + extent_root =btrfs_extent_root (fs_info, logical); + ret =btrfs_search_slot (NULL , extent_root, &key, path,0 ,0 );if (ret <0 ) goto out;BUG_ON (ret ==0 );
@@ -73,10 +74,10 @@ again: (key.type != BTRFS_EXTENT_ITEM_KEY && key.type != BTRFS_METADATA_ITEM_KEY)) {if (!search_forward) - ret =btrfs_previous_extent_item (fs_info->extent_root, + ret =btrfs_previous_extent_item (extent_root, path,0 );else - ret =btrfs_next_extent_item (fs_info->extent_root, + ret =btrfs_next_extent_item (extent_root, path,0 );if (ret) goto out;
btrfstune.c +1 -1
@@ -233,7 +233,7 @@ static int change_buffer_header_uuid(struct extent_buffer *eb, uuid_t new_fsid)static int change_extents_uuid (struct btrfs_fs_info *fs_info,uuid_t new_fsid) { -struct btrfs_root *root = fs_info->extent_root; +struct btrfs_root *root =btrfs_extent_root (fs_info,0 );struct btrfs_path path;struct btrfs_key key = {0 ,0 ,0 };int ret =0 ;
check/main.c +44 -34
307 lines not on this page · raw message
check/mode-common.c +5 -3
@@ -176,6 +176,8 @@ static int check_prealloc_shared_data_ref(u64 parent, u64 disk_bytenr)*/ int check_prealloc_extent_written (u64 disk_bytenr,u64 num_bytes) { +struct btrfs_root *extent_root =btrfs_extent_root (gfs_info, + disk_bytenr);struct btrfs_path path;struct btrfs_key key;int ret;
@@ -189,7 +191,7 @@ int check_prealloc_extent_written(u64 disk_bytenr, u64 num_bytes) key.offset = num_bytes;btrfs_init_path (&path); - ret =btrfs_search_slot (NULL , gfs_info->extent_root, &key, &path,0 ,0 ); + ret =btrfs_search_slot (NULL , extent_root, &key, &path,0 ,0 );if (ret >0 ) { fprintf(stderr, "Missing extent item in extent tree for disk_bytenr %llu, num_bytes %llu\n",
@@ -240,7 +242,7 @@ int check_prealloc_extent_written(u64 disk_bytenr, u64 num_bytes) path.slots[0 ]++;while (true) {if (path.slots[0 ] >=btrfs_header_nritems (path.nodes[0 ])) { - ret =btrfs_next_leaf (gfs_info->extent_root, &path); + ret =btrfs_next_leaf (extent_root, &path);if (ret <0 ) goto out;if (ret >0 ) {
@@ -1083,7 +1085,7 @@ int recow_extent_buffer(struct btrfs_root *root, struct extent_buffer *eb)*/ int get_extent_item_generation (u64 bytenr,u64 *gen_ret) { -struct btrfs_root *root = gfs_info->extent_root; +struct btrfs_root *root =btrfs_extent_root (gfs_info, bytenr);struct btrfs_extent_item *ei;struct btrfs_path path;struct btrfs_key key;
check/mode-lowmem.c +42 -30
271 lines not on this page · raw message
check/qgroup-verify.c +1 -1
@@ -1157,7 +1157,7 @@ static int scan_extents(struct btrfs_fs_info *info, u64 start, u64 end) { int ret, i, nr, level; -struct btrfs_root *root = info->extent_root; +struct btrfs_root *root =btrfs_extent_root (info, start);struct btrfs_key key;struct btrfs_path path;struct btrfs_disk_key disk_key;
cmds/rescue-chunk-recover.c +9 -9
@@ -555,6 +555,7 @@ static int check_chunk_by_metadata(struct recover_control *rc,struct btrfs_root *root, struct chunk_record *chunk, int bg_only) { + struct btrfs_fs_info *fs_info = root->fs_info;int ret;int i;int slot;
@@ -616,7 +617,8 @@ bg_check: key.type =BTRFS_BLOCK_GROUP_ITEM_KEY ; key.offset = chunk->length; - ret =btrfs_search_slot (NULL , root->fs_info->extent_root, &key, &path, + root =btrfs_extent_root (fs_info, key.objectid); + ret =btrfs_search_slot (NULL , root, &key, &path,0 ,0 );if (ret <0 ) {fprintf (stderr,"Search block group failed(%d)\n" , ret);
@@ -997,7 +999,7 @@ static int block_group_remove_all_extent_items(struct btrfs_trans_handle *trans,int del_s, del_nr;btrfs_init_path (&path); - root = root->fs_info->extent_root; + root =btrfs_extent_root (fs_info, start); key.objectid = start; key.offset =0 ;
@@ -1382,6 +1384,7 @@ static int rebuild_block_group(struct btrfs_trans_handle *trans,struct recover_control *rc, struct btrfs_root *root) { + struct btrfs_fs_info *fs_info = root->fs_info;struct chunk_record *chunk_rec;struct btrfs_key search_key;struct btrfs_path path;
@@ -1396,12 +1399,11 @@ static int rebuild_block_group(struct btrfs_trans_handle *trans, search_key.objectid = chunk_rec->offset; search_key.type =BTRFS_EXTENT_ITEM_KEY ; search_key.offset =0 ; - ret =btrfs_search_slot (NULL , root->fs_info->extent_root, - &search_key, &path,0 ,0 ); + root =btrfs_extent_root (fs_info, chunk_rec->offset); + ret =btrfs_search_slot (NULL , root, &search_key, &path,0 ,0 );if (ret <0 ) goto out; - ret =calculate_bg_used (root->fs_info->extent_root, - chunk_rec, &path, &used); + ret =calculate_bg_used (root, chunk_rec, &path, &used);/* * Extent tree is damaged, better to rebuild the whole extent * tree. Currently, change the used to chunk's len to prevent
@@ -1417,9 +1419,7 @@ static int rebuild_block_group(struct btrfs_trans_handle *trans, used = chunk_rec->length; }btrfs_release_path (&path); - ret =__insert_block_group (trans, chunk_rec, - root->fs_info->extent_root, - used); + ret =__insert_block_group (trans, chunk_rec, root, used);if (ret <0 ) goto out; }
common/repair.c +2 -3
@@ -167,7 +167,7 @@ int btrfs_fix_block_accounting(struct btrfs_trans_handle *trans)struct extent_buffer *leaf;struct btrfs_block_group *cache;struct btrfs_fs_info *fs_info = trans->fs_info; -struct btrfs_root *root = fs_info->extent_root; +struct btrfs_root *root =btrfs_extent_root (fs_info,0 ); ret =btrfs_run_delayed_refs (trans,-1 );if (ret)
@@ -189,8 +189,7 @@ int btrfs_fix_block_accounting(struct btrfs_trans_handle *trans) key.offset =0 ; key.objectid =0 ; key.type =BTRFS_EXTENT_ITEM_KEY ; - ret =btrfs_search_slot (trans, root->fs_info->extent_root, - &key, &path,0 ,0 ); + ret =btrfs_search_slot (trans, root, &key, &path,0 ,0 );if (ret <0 )return ret;while (1 ) {
convert/main.c +1 -3
@@ -945,7 +945,6 @@ static int make_convert_data_block_groups(struct btrfs_trans_handle *trans,struct btrfs_mkfs_config *cfg, struct btrfs_convert_context *cctx) { - struct btrfs_root *extent_root = fs_info->extent_root; struct cache_tree *data_chunks = &cctx->data_chunks;struct cache_extent *cache;u64 max_chunk_size;
@@ -957,8 +956,7 @@ static int make_convert_data_block_groups(struct btrfs_trans_handle *trans,*/ max_chunk_size = cfg->num_bytes /10 ; max_chunk_size =min ((u64)(SZ_1G ), max_chunk_size); - max_chunk_size =round_down (max_chunk_size, - extent_root->fs_info->sectorsize); + max_chunk_size =round_down (max_chunk_size, fs_info->sectorsize);for (cache =first_cache_extent (data_chunks); cache; cache =next_cache_extent (cache)) {
image/main.c +1 -1
@@ -922,7 +922,7 @@ static int copy_from_extent_tree(struct metadump_struct *metadump,u64 num_bytes;int ret; - extent_root = metadump->root->fs_info->extent_root; + extent_root =btrfs_extent_root (metadump->root->fs_info,0 ); bytenr =BTRFS_SUPER_INFO_OFFSET +BTRFS_SUPER_INFO_SIZE ; key.objectid = bytenr; key.type =BTRFS_EXTENT_ITEM_KEY ;
kernel-shared/backref.c +6 -4
@@ -645,7 +645,7 @@ static int __add_keyed_refs(struct btrfs_fs_info *fs_info, struct btrfs_path *path, u64 bytenr, int info_level) { - struct btrfs_root *extent_root = fs_info->extent_root; + struct btrfs_root *extent_root = btrfs_extent_root(fs_info, bytenr);int ret;int slot;struct extent_buffer *leaf;
@@ -734,6 +734,7 @@ static int find_parent_nodes(struct btrfs_trans_handle *trans, u64 time_seq, struct ulist *refs, struct ulist *roots, const u64 *extent_item_pos) { + struct btrfs_root *extent_root = btrfs_extent_root(fs_info, bytenr);struct btrfs_key key;struct btrfs_path *path;int info_level =0 ;
@@ -756,7 +757,7 @@ static int find_parent_nodes(struct btrfs_trans_handle *trans,if (!path)return -ENOMEM ; - ret =btrfs_search_slot (trans, fs_info->extent_root, &key, path,0 ,0 ); + ret =btrfs_search_slot (trans, extent_root, &key, path,0 ,0 );if (ret <0 ) goto out;BUG_ON (ret ==0 );
@@ -1136,6 +1137,7 @@ int extent_from_logical(struct btrfs_fs_info *fs_info, u64 logical, struct btrfs_path *path, struct btrfs_key *found_key, u64 *flags_ret) { + struct btrfs_root *extent_root = btrfs_extent_root(fs_info, logical);int ret;u64 flags;u64 size =0 ;
@@ -1151,11 +1153,11 @@ int extent_from_logical(struct btrfs_fs_info *fs_info, u64 logical, key.objectid = logical; key.offset = (u64)-1 ; - ret =btrfs_search_slot (NULL , fs_info->extent_root, &key, path,0 ,0 ); + ret =btrfs_search_slot (NULL , extent_root, &key, path,0 ,0 );if (ret <0 )return ret; - ret =btrfs_previous_extent_item (fs_info->extent_root, path,0 ); + ret =btrfs_previous_extent_item (extent_root, path,0 );if (ret) {if (ret >0 ) ret = -ENOENT ;
kernel-shared/ctree.h +1 -1
@@ -1157,7 +1157,7 @@ struct btrfs_fs_info {u8 chunk_tree_uuid[BTRFS_UUID_SIZE ];u8 *new_chunk_tree_uuid;struct btrfs_root *fs_root; -struct btrfs_root *extent_root; +struct btrfs_root *_extent_root;struct btrfs_root *tree_root;struct btrfs_root *chunk_root;struct btrfs_root *dev_root;
kernel-shared/disk-io.c +18 -12
@@ -761,6 +761,12 @@ struct btrfs_root *btrfs_csum_root(struct btrfs_fs_info *fs_info,return fs_info->_csum_root; } +struct btrfs_root *btrfs_extent_root (struct btrfs_fs_info *fs_info, +u64 bytenr) +{ +return fs_info->_extent_root; +} +struct btrfs_root *btrfs_read_fs_root (struct btrfs_fs_info *fs_info,struct btrfs_key *location) {
@@ -772,7 +778,7 @@ struct btrfs_root *btrfs_read_fs_root(struct btrfs_fs_info *fs_info,if (location->objectid ==BTRFS_ROOT_TREE_OBJECTID )return fs_info->tree_root;if (location->objectid ==BTRFS_EXTENT_TREE_OBJECTID ) -return fs_info->extent_root; +return fs_info->_extent_root;if (location->objectid ==BTRFS_CHUNK_TREE_OBJECTID )return fs_info->chunk_root;if (location->objectid ==BTRFS_DEV_TREE_OBJECTID )
@@ -811,7 +817,7 @@ void btrfs_free_fs_info(struct btrfs_fs_info *fs_info)free (fs_info->quota_root);free (fs_info->tree_root); -free (fs_info->extent_root); +free (fs_info->_extent_root);free (fs_info->chunk_root);free (fs_info->dev_root);free (fs_info->_csum_root);
@@ -831,7 +837,7 @@ struct btrfs_fs_info *btrfs_new_fs_info(int writable, u64 sb_bytenr)return NULL ; fs_info->tree_root =calloc (1 ,sizeof (struct btrfs_root )); - fs_info->extent_root =calloc (1 ,sizeof (struct btrfs_root )); + fs_info->_extent_root =calloc (1 ,sizeof (struct btrfs_root )); fs_info->chunk_root =calloc (1 ,sizeof (struct btrfs_root )); fs_info->dev_root =calloc (1 ,sizeof (struct btrfs_root )); fs_info->_csum_root =calloc (1 ,sizeof (struct btrfs_root ));
@@ -840,7 +846,7 @@ struct btrfs_fs_info *btrfs_new_fs_info(int writable, u64 sb_bytenr) fs_info->uuid_root =calloc (1 ,sizeof (struct btrfs_root )); fs_info->super_copy =calloc (1 ,BTRFS_SUPER_INFO_SIZE ); - if (!fs_info->tree_root || !fs_info->extent_root || + if (!fs_info->tree_root || !fs_info->_extent_root || !fs_info->chunk_root || !fs_info->dev_root || !fs_info->_csum_root || !fs_info->quota_root || !fs_info->free_space_root || !fs_info->uuid_root ||
@@ -1000,11 +1006,11 @@ int btrfs_setup_all_roots(struct btrfs_fs_info *fs_info, u64 root_tree_bytenr,return -EIO ; } - ret =setup_root_or_create_block (fs_info, flags, fs_info->extent_root, + ret =setup_root_or_create_block (fs_info, flags, fs_info->_extent_root,BTRFS_EXTENT_TREE_OBJECTID ,"extent" );if (ret)return ret; - fs_info->extent_root->track_dirty =1 ; + fs_info->_extent_root->track_dirty =1 ; ret =find_and_setup_root (root, fs_info,BTRFS_DEV_TREE_OBJECTID , fs_info->dev_root);
@@ -1062,7 +1068,7 @@ int btrfs_setup_all_roots(struct btrfs_fs_info *fs_info, u64 root_tree_bytenr, fs_info->generation = generation; fs_info->last_trans_committed = generation; -if (extent_buffer_uptodate (fs_info->extent_root->node) && +if (extent_buffer_uptodate (fs_info->_extent_root->node) && !(flags &OPEN_CTREE_NO_BLOCK_GROUPS )) { ret =btrfs_read_block_groups (fs_info);/*
@@ -1097,8 +1103,8 @@ void btrfs_release_all_roots(struct btrfs_fs_info *fs_info)free_extent_buffer (fs_info->_csum_root->node);if (fs_info->dev_root)free_extent_buffer (fs_info->dev_root->node); -if (fs_info->extent_root) -free_extent_buffer (fs_info->extent_root->node); +if (fs_info->_extent_root) +free_extent_buffer (fs_info->_extent_root->node);if (fs_info->tree_root)free_extent_buffer (fs_info->tree_root->node);if (fs_info->log_root_tree)
@@ -1851,11 +1857,11 @@ static void backup_super_roots(struct btrfs_fs_info *info)btrfs_set_backup_chunk_root_level (root_backup,btrfs_header_level (info->chunk_root->node)); -btrfs_set_backup_extent_root (root_backup, info->extent_root->node->start); +btrfs_set_backup_extent_root (root_backup, info->_extent_root->node->start);btrfs_set_backup_extent_root_gen (root_backup, -btrfs_header_generation (info->extent_root->node)); +btrfs_header_generation (info->_extent_root->node));btrfs_set_backup_extent_root_level (root_backup, -btrfs_header_level (info->extent_root->node)); +btrfs_header_level (info->_extent_root->node));/* * we might commit during log recovery, which happens before we set * the fs_root. Make sure it is valid before we fill it in.
kernel-shared/disk-io.h +1 -0
@@ -218,4 +218,5 @@ struct btrfs_root *btrfs_create_tree(struct btrfs_trans_handle *trans,struct btrfs_fs_info *fs_info, u64 objectid);struct btrfs_root *btrfs_csum_root (struct btrfs_fs_info *fs_info,u64 bytenr); +struct btrfs_root *btrfs_extent_root (struct btrfs_fs_info *fs_inf,u64 bytenr);#endif
kernel-shared/extent-tree.c +23 -19
152 lines not on this page · raw message
kernel-shared/free-space-tree.c +7 -1
@@ -1014,12 +1014,18 @@ out:int populate_free_space_tree (struct btrfs_trans_handle *trans,struct btrfs_block_group *block_group) { -struct btrfs_root *extent_root = trans->fs_info->extent_root; +struct btrfs_fs_info *fs_info = trans->fs_info; +struct btrfs_root *extent_root;struct btrfs_path *path, *path2;struct btrfs_key key;u64 start, end;int ret; +if (btrfs_fs_incompat (fs_info,EXTENT_TREE_V2 )) +return -EINVAL ; + + extent_root =btrfs_extent_root (fs_info,0 ); + path =btrfs_alloc_path ();if (!path)return -ENOMEM ;
kernel-shared/volumes.c +1 -2
@@ -1348,7 +1348,6 @@ static int create_chunk(struct btrfs_trans_handle *trans, struct btrfs_fs_info *info, struct alloc_chunk_ctl *ctl, struct list_head *private_devs) { - struct btrfs_root *extent_root = info->extent_root; struct btrfs_root *chunk_root = info->chunk_root;struct btrfs_stripe *stripes;struct btrfs_device *device =NULL ;
@@ -1432,7 +1431,7 @@ static int create_chunk(struct btrfs_trans_handle *trans,/* key was set above */ btrfs_set_stack_chunk_length (chunk, ctl->num_bytes); -btrfs_set_stack_chunk_owner (chunk, extent_root->root_key.objectid); +btrfs_set_stack_chunk_owner (chunk,BTRFS_EXTENT_TREE_OBJECTID );btrfs_set_stack_chunk_stripe_len (chunk,BTRFS_STRIPE_LEN );btrfs_set_stack_chunk_type (chunk, ctl->type);btrfs_set_stack_chunk_num_stripes (chunk, ctl->num_stripes);
kernel-shared/zoned.c +1 -1
@@ -757,7 +757,7 @@ static int calculate_alloc_pointer(struct btrfs_fs_info *fs_info,struct btrfs_block_group *cache, u64 *offset_ret) { - struct btrfs_root *root = fs_info->extent_root; + struct btrfs_root *root = btrfs_extent_root(fs_info, cache->start);struct btrfs_path *path;struct btrfs_key key;struct btrfs_key found_key;
mkfs/main.c +2 -2
@@ -277,7 +277,7 @@ static int recow_roots(struct btrfs_trans_handle *trans, ret =__recow_root (trans, info->tree_root);if (ret)return ret; - ret =__recow_root (trans, info->extent_root); + ret =__recow_root (trans, info->_extent_root);if (ret)return ret; ret =__recow_root (trans, info->chunk_root);
@@ -588,7 +588,7 @@ static int cleanup_temp_chunks(struct btrfs_fs_info *fs_info, {struct btrfs_trans_handle *trans =NULL ;struct btrfs_block_group_item *bgi; -struct btrfs_root *root = fs_info->extent_root; +struct btrfs_root *root =btrfs_extent_root (fs_info,0 );struct btrfs_key key;struct btrfs_key found_key;struct btrfs_path path;
Signature · 1 line
2.26.3
PATCH v2 2/30 btrfs-progs: stop accessing ->free_space_root directly
In reply to Josef BacikWe're going to have multiple free space roots in the future, so access it via a helper in most cases. We will address the remaining direct accesses in future patches.
--- kernel-shared/ctree.h | 2 +- kernel-shared/disk-io.c | 24 ++++++++++----------- kernel-shared/free-space-tree.c | 37 +++++++++++++++++++++------------ mkfs/main.c | 4 ++-- 4 files changed, 39 insertions(+), 28 deletions(-)
kernel-shared/ctree.h +1 -1
@@ -1163,7 +1163,7 @@ struct btrfs_fs_info {struct btrfs_root *dev_root;struct btrfs_root *_csum_root;struct btrfs_root *quota_root; -struct btrfs_root *free_space_root; +struct btrfs_root *_free_space_root;struct btrfs_root *uuid_root;struct rb_root fs_root_tree;
kernel-shared/disk-io.c +12 -12
@@ -791,7 +791,7 @@ struct btrfs_root *btrfs_read_fs_root(struct btrfs_fs_info *fs_info,return fs_info->quota_enabled ? fs_info->quota_root :ERR_PTR (-ENOENT );if (location->objectid ==BTRFS_FREE_SPACE_TREE_OBJECTID ) -return fs_info->free_space_root ? fs_info->free_space_root : +return fs_info->_free_space_root ? fs_info->_free_space_root :ERR_PTR (-ENOENT );BUG_ON (location->objectid ==BTRFS_TREE_RELOC_OBJECTID );
@@ -821,7 +821,7 @@ void btrfs_free_fs_info(struct btrfs_fs_info *fs_info)free (fs_info->chunk_root);free (fs_info->dev_root);free (fs_info->_csum_root); -free (fs_info->free_space_root); +free (fs_info->_free_space_root);free (fs_info->uuid_root);free (fs_info->super_copy);free (fs_info->log_root_tree);
@@ -842,14 +842,14 @@ struct btrfs_fs_info *btrfs_new_fs_info(int writable, u64 sb_bytenr) fs_info->dev_root =calloc (1 ,sizeof (struct btrfs_root )); fs_info->_csum_root =calloc (1 ,sizeof (struct btrfs_root )); fs_info->quota_root =calloc (1 ,sizeof (struct btrfs_root )); - fs_info->free_space_root =calloc (1 ,sizeof (struct btrfs_root )); + fs_info->_free_space_root =calloc (1 ,sizeof (struct btrfs_root )); fs_info->uuid_root =calloc (1 ,sizeof (struct btrfs_root )); fs_info->super_copy =calloc (1 ,BTRFS_SUPER_INFO_SIZE );if (!fs_info->tree_root || !fs_info->_extent_root || !fs_info->chunk_root || !fs_info->dev_root || !fs_info->_csum_root || !fs_info->quota_root || - !fs_info->free_space_root || !fs_info->uuid_root || + !fs_info->_free_space_root || !fs_info->uuid_root || !fs_info->super_copy) goto free_all;
@@ -1046,17 +1046,17 @@ int btrfs_setup_all_roots(struct btrfs_fs_info *fs_info, u64 root_tree_bytenr,if (btrfs_fs_compat_ro (fs_info,FREE_SPACE_TREE )) { ret =find_and_setup_root (root, fs_info,BTRFS_FREE_SPACE_TREE_OBJECTID , - fs_info->free_space_root); + fs_info->_free_space_root);if (ret) { -free (fs_info->free_space_root); - fs_info->free_space_root =NULL ; +free (fs_info->_free_space_root); + fs_info->_free_space_root =NULL ;printk ("Couldn't read free space tree\n" );return -EIO ; } - fs_info->free_space_root->track_dirty =1 ; + fs_info->_free_space_root->track_dirty =1 ; }else { -free (fs_info->free_space_root); - fs_info->free_space_root =NULL ; +free (fs_info->_free_space_root); + fs_info->_free_space_root =NULL ; } ret =find_and_setup_log_root (root, fs_info, sb);
@@ -1095,8 +1095,8 @@ int btrfs_setup_all_roots(struct btrfs_fs_info *fs_info, u64 root_tree_bytenr,void btrfs_release_all_roots (struct btrfs_fs_info *fs_info) { -if (fs_info->free_space_root) -free_extent_buffer (fs_info->free_space_root->node); +if (fs_info->_free_space_root) +free_extent_buffer (fs_info->_free_space_root->node);if (fs_info->quota_root)free_extent_buffer (fs_info->quota_root->node);if (fs_info->_csum_root)
kernel-shared/free-space-tree.c +24 -13
@@ -25,13 +25,19 @@#include "kernel-lib/bitops.h" #include "common/internal.h" +static struct btrfs_root *btrfs_free_space_root (struct btrfs_fs_info *fs_info, +struct btrfs_block_group *block_group) +{ +return fs_info->_free_space_root; +} +static struct btrfs_free_space_info *search_free_space_info (struct btrfs_trans_handle *trans,struct btrfs_fs_info *fs_info,struct btrfs_block_group *block_group,struct btrfs_path *path,int cow) { -struct btrfs_root *root = fs_info->free_space_root; +struct btrfs_root *root =btrfs_free_space_root (fs_info, block_group);struct btrfs_key key;int ret;
@@ -103,7 +109,8 @@ static int add_new_free_space_info(struct btrfs_trans_handle *trans,struct btrfs_block_group *block_group, struct btrfs_path *path) { - struct btrfs_root *root = trans->fs_info->free_space_root; + struct btrfs_fs_info *fs_info = trans->fs_info; +struct btrfs_root *root =btrfs_free_space_root (fs_info, block_group);struct btrfs_free_space_info *info;struct btrfs_key key;struct extent_buffer *leaf;
@@ -179,7 +186,7 @@ static int convert_free_space_to_bitmaps(struct btrfs_trans_handle *trans, struct btrfs_path *path) {struct btrfs_fs_info *fs_info = trans->fs_info; -struct btrfs_root *root = fs_info->free_space_root; +struct btrfs_root *root =btrfs_free_space_root (fs_info, block_group);struct btrfs_free_space_info *info;struct btrfs_key key, found_key;struct extent_buffer *leaf;
@@ -318,7 +325,7 @@ static int convert_free_space_to_extents(struct btrfs_trans_handle *trans, struct btrfs_path *path) {struct btrfs_fs_info *fs_info = trans->fs_info; -struct btrfs_root *root = fs_info->free_space_root; +struct btrfs_root *root =btrfs_free_space_root (fs_info, block_group);struct btrfs_free_space_info *info;struct btrfs_key key, found_key;struct extent_buffer *leaf;
@@ -558,7 +565,8 @@ static int modify_free_space_bitmap(struct btrfs_trans_handle *trans,struct btrfs_path *path, u64 start, u64 size, int remove) { - struct btrfs_root *root = trans->fs_info->free_space_root; + struct btrfs_fs_info *fs_info = trans->fs_info; +struct btrfs_root *root =btrfs_free_space_root (fs_info, block_group);struct btrfs_key key;u64 end = start + size;u64 cur_start, cur_size;
@@ -671,7 +679,8 @@ static int remove_free_space_extent(struct btrfs_trans_handle *trans,struct btrfs_path *path, u64 start, u64 size) { - struct btrfs_root *root = trans->fs_info->free_space_root; + struct btrfs_fs_info *fs_info = trans->fs_info; +struct btrfs_root *root =btrfs_free_space_root (fs_info, block_group);struct btrfs_key key;u64 found_start, found_end;u64 end = start + size;
@@ -811,7 +820,8 @@ static int add_free_space_extent(struct btrfs_trans_handle *trans,struct btrfs_path *path, u64 start, u64 size) { - struct btrfs_root *root = trans->fs_info->free_space_root; + struct btrfs_fs_info *fs_info = trans->fs_info; +struct btrfs_root *root =btrfs_free_space_root (fs_info, block_group);struct btrfs_key key, new_key;u64 found_start, found_end;u64 end = start + size;
@@ -1107,7 +1117,8 @@ out:int remove_block_group_free_space (struct btrfs_trans_handle *trans,struct btrfs_block_group *block_group) { -struct btrfs_root *root = trans->fs_info->free_space_root; +struct btrfs_fs_info *fs_info = trans->fs_info; +struct btrfs_root *root =btrfs_free_space_root (fs_info, block_group);struct btrfs_path *path;struct btrfs_key key, found_key;struct extent_buffer *leaf;
@@ -1215,7 +1226,7 @@ int btrfs_clear_free_space_tree(struct btrfs_fs_info *fs_info) {struct btrfs_trans_handle *trans;struct btrfs_root *tree_root = fs_info->tree_root; -struct btrfs_root *free_space_root = fs_info->free_space_root; +struct btrfs_root *free_space_root =btrfs_free_space_root (fs_info,NULL );int ret;u64 features;
@@ -1227,7 +1238,7 @@ int btrfs_clear_free_space_tree(struct btrfs_fs_info *fs_info) features &= ~(BTRFS_FEATURE_COMPAT_RO_FREE_SPACE_TREE_VALID |BTRFS_FEATURE_COMPAT_RO_FREE_SPACE_TREE );btrfs_set_super_compat_ro_flags (fs_info->super_copy, features); - fs_info->free_space_root =NULL ; + fs_info->_free_space_root =NULL ; ret =clear_free_space_tree (trans, free_space_root);if (ret)
@@ -1263,7 +1274,7 @@ static int load_free_space_bitmaps(struct btrfs_fs_info *fs_info,u32 expected_extent_count, int *errors) { - struct btrfs_root *root = fs_info->free_space_root; + struct btrfs_root *root = btrfs_free_space_root(fs_info, block_group);struct btrfs_key key;int prev_bit =0 , bit;u64 extent_start =0 ;
@@ -1343,7 +1354,7 @@ static int load_free_space_extents(struct btrfs_fs_info *fs_info,u32 expected_extent_count, int *errors) { - struct btrfs_root *root = fs_info->free_space_root; + struct btrfs_root *root = btrfs_free_space_root(fs_info, block_group);struct btrfs_key key, prev_key;int have_prev =0 ;u64 start, end;
@@ -1463,7 +1474,7 @@ int btrfs_create_free_space_tree(struct btrfs_fs_info *fs_info) ret =PTR_ERR (free_space_root); goto abort; } - fs_info->free_space_root = free_space_root; + fs_info->_free_space_root = free_space_root;add_root_to_dirty_list (free_space_root); do {
mkfs/main.c +2 -2
@@ -289,8 +289,8 @@ static int recow_roots(struct btrfs_trans_handle *trans, ret =__recow_root (trans, csum_root);if (ret)return ret; -if (info->free_space_root) { - ret =__recow_root (trans, info->free_space_root); +if (info->_free_space_root) { + ret =__recow_root (trans, info->_free_space_root);if (ret)return ret; }
Signature · 1 line
2.26.3
PATCH v2 3/30 btrfs-progs: track csum, extent, and free space trees in a rb tree
In reply to Josef BacikWe are going to have multiples of these trees with extent tree v2, so add a rb tree to track them based on their root key value. This works for both v1 and v2, so we can remove the direct pointers to these roots in our fs_info.
--- kernel-shared/ctree.h | 4 +- kernel-shared/disk-io.c | 292 ++++++++++++++++++++++++-------- kernel-shared/disk-io.h | 5 + kernel-shared/free-space-tree.c | 15 +- mkfs/main.c | 28 +-- 5 files changed, 261 insertions(+), 83 deletions(-)
kernel-shared/ctree.h +1 -3
@@ -1157,15 +1157,13 @@ struct btrfs_fs_info {u8 chunk_tree_uuid[BTRFS_UUID_SIZE ];u8 *new_chunk_tree_uuid;struct btrfs_root *fs_root; -struct btrfs_root *_extent_root;struct btrfs_root *tree_root;struct btrfs_root *chunk_root;struct btrfs_root *dev_root; -struct btrfs_root *_csum_root;struct btrfs_root *quota_root; -struct btrfs_root *_free_space_root;struct btrfs_root *uuid_root; +struct rb_root global_roots_tree;struct rb_root fs_root_tree;/* the log root tree is a directory of all the other log roots */
kernel-shared/disk-io.c +225 -67
441 lines not on this page · raw message
kernel-shared/disk-io.h +5 -0
@@ -219,4 +219,9 @@ struct btrfs_root *btrfs_create_tree(struct btrfs_trans_handle *trans, u64 objectid);struct btrfs_root *btrfs_csum_root (struct btrfs_fs_info *fs_info,u64 bytenr);struct btrfs_root *btrfs_extent_root (struct btrfs_fs_info *fs_inf,u64 bytenr); +struct btrfs_root *btrfs_block_group_root (struct btrfs_fs_info *fs_info); +struct btrfs_root *btrfs_global_root (struct btrfs_fs_info *fs_info, +struct btrfs_key *key); +int btrfs_global_root_insert (struct btrfs_fs_info *fs_info, +struct btrfs_root *root);#endif
kernel-shared/free-space-tree.c +12 -3
@@ -28,7 +28,13 @@static struct btrfs_root *btrfs_free_space_root (struct btrfs_fs_info *fs_info,struct btrfs_block_group *block_group) { -return fs_info->_free_space_root; +struct btrfs_key key = { + .objectid =BTRFS_FREE_SPACE_TREE_OBJECTID , + .type =BTRFS_ROOT_ITEM_KEY , + .offset =0 , + }; + +return btrfs_global_root (fs_info, &key); } static struct btrfs_free_space_info *
@@ -1238,7 +1244,6 @@ int btrfs_clear_free_space_tree(struct btrfs_fs_info *fs_info) features &= ~(BTRFS_FEATURE_COMPAT_RO_FREE_SPACE_TREE_VALID |BTRFS_FEATURE_COMPAT_RO_FREE_SPACE_TREE );btrfs_set_super_compat_ro_flags (fs_info->super_copy, features); - fs_info->_free_space_root =NULL ; ret =clear_free_space_tree (trans, free_space_root);if (ret)
@@ -1258,6 +1263,7 @@ int btrfs_clear_free_space_tree(struct btrfs_fs_info *fs_info)if (ret) goto abort; +rb_erase (&free_space_root->rb_node, &fs_info->global_roots_tree);free_extent_buffer (free_space_root->node);free_extent_buffer (free_space_root->commit_root);kfree (free_space_root);
@@ -1474,7 +1480,10 @@ int btrfs_create_free_space_tree(struct btrfs_fs_info *fs_info) ret =PTR_ERR (free_space_root); goto abort; } - fs_info->_free_space_root = free_space_root; + + ret =btrfs_global_root_insert (fs_info, free_space_root); +if (ret) + goto abort;add_root_to_dirty_list (free_space_root); do {
mkfs/main.c +18 -10
@@ -264,20 +264,33 @@ out:return ret; } +static int recow_global_roots (struct btrfs_trans_handle *trans) +{ +struct btrfs_fs_info *fs_info = trans->fs_info; +struct btrfs_root *root; +struct rb_node *n; +int ret =0 ; + +for (n =rb_first (&fs_info->global_roots_tree); n; n =rb_next (n)) { + root = rb_entry(n, struct btrfs_root, rb_node); + ret =__recow_root (trans, root); +if (ret) +return ret; + } + +return ret; +} +static int recow_roots (struct btrfs_trans_handle *trans,struct btrfs_root *root) {struct btrfs_fs_info *info = root->fs_info; -struct btrfs_root *csum_root =btrfs_csum_root (info,0 );int ret; ret =__recow_root (trans, info->fs_root);if (ret)return ret; ret =__recow_root (trans, info->tree_root); -if (ret) -return ret; - ret =__recow_root (trans, info->_extent_root);if (ret)return ret; ret =__recow_root (trans, info->chunk_root);
@@ -286,14 +299,9 @@ static int recow_roots(struct btrfs_trans_handle *trans, ret =__recow_root (trans, info->dev_root);if (ret)return ret; - ret =__recow_root (trans, csum_root); + ret =recow_global_roots (trans);if (ret)return ret; -if (info->_free_space_root) { - ret =__recow_root (trans, info->_free_space_root); -if (ret) -return ret; - }return 0 ; }
Signature · 1 line
2.26.3
PATCH v2 4/30 btrfs-progs: check: make reinit work per found root item
In reply to Josef BacikInstead of looking for the first extent root or csum root in memory, scan through the tree root and re-init any root items that match the given objectid. This will allow reinit to work with both extent tree v1 and extent tree v2 global roots when using the --reinit option.
--- check/main.c | 52 +++++++++++++++++++++++++++++++++++++++++++++++++--- 1 file changed, 49 insertions(+), 3 deletions(-)
check/main.c +49 -3
@@ -9319,6 +9319,52 @@ out:return ret; } +static int reinit_global_roots (struct btrfs_trans_handle *trans,u64 objectid) +{ +struct btrfs_key key = { + .objectid = objectid, + .type =BTRFS_ROOT_ITEM_KEY , + .offset =0 , + }; +struct btrfs_path path; +struct btrfs_root *tree_root = gfs_info->tree_root; +struct btrfs_root *root; +int ret; + +btrfs_init_path (&path); +while (1 ) { + ret =btrfs_search_slot (NULL , tree_root, &key, &path,0 ,0 ); +if (ret) { +if (ret ==1 ) { +/* We should at least find the first one. */ +if (key.offset ==0 ) + ret = -ENOENT ; +else + ret =0 ; + } +break ; + } + +btrfs_item_key_to_cpu (path.nodes[0 ], &key, path.slots[0 ]); +if (key.objectid != objectid) +break ; +btrfs_release_path (&path); + root =btrfs_read_fs_root (gfs_info, &key); +if (IS_ERR (root)) { +error ("Error reading global root [%llu %llu]" , + key.objectid, key.offset); + ret =PTR_ERR (root); +break ; + } + ret =btrfs_fsck_reinit_root (trans, root); +if (ret) +break ; + key.offset++; + } +btrfs_release_path (&path); +return ret; +} +static int reinit_extent_tree (struct btrfs_trans_handle *trans,bool pin) {u64 start =0 ;
@@ -9375,7 +9421,7 @@ again: }/* Ok we can allocate now, reinit the extent root */ - ret =btrfs_fsck_reinit_root (trans,btrfs_extent_root (gfs_info,0 )); + ret =reinit_global_roots (trans,BTRFS_EXTENT_TREE_OBJECTID );if (ret) {fprintf (stderr,"extent root initialization failed\n" );/*
@@ -10699,8 +10745,8 @@ static int cmd_check(const struct cmd_struct *cmd, int argc, char **argv)if (init_csum_tree) {printf ("Reinitialize checksum tree\n" ); - ret =btrfs_fsck_reinit_root (trans, -btrfs_csum_root (gfs_info,0 )); + ret =reinit_global_roots (trans, +BTRFS_CSUM_TREE_OBJECTID );if (ret) {error ("checksum tree initialization failed: %d" , ret);
Signature · 1 line
2.26.3
PATCH v2 5/30 btrfs-progs: check: check the global roots for uptodate root nodes
In reply to Josef BacikInstead of checking the csum and extent tree individually, walk through the global roots and validate them all. This will work properly if we have extent tree v1 or extent tree v2.
--- check/main.c | 30 +++++++++++++++++++----------- 1 file changed, 19 insertions(+), 11 deletions(-)
check/main.c +19 -11
@@ -10379,6 +10379,23 @@ out:return ret; } +static int check_global_roots_uptodate (void ) +{ +struct btrfs_root *root; +struct rb_node *n; + +for (n =rb_first (&gfs_info->global_roots_tree); n; n =rb_next (n)) { + root = rb_entry(n, struct btrfs_root, rb_node); +if (!extent_buffer_uptodate (root->node)) { +error ("chritical: global root [%llu %llu] not uptodate, unable to check the file system" , + root->root_key.objectid, root->root_key.offset); +return -EIO ; + } + } + +return 0 ; +} +static const char *const cmd_check_usage[] = {"btrfs check [options] <device>" ,"Check structural integrity of a filesystem (unmounted)." ,
@@ -10771,18 +10788,9 @@ static int cmd_check(const struct cmd_struct *cmd, int argc, char **argv)if (ret) goto close_out; } - root =btrfs_extent_root (gfs_info,0 ); -if (!extent_buffer_uptodate (root->node)) { -error ("critical: extent_root, unable to check the filesystem" ); - ret = -EIO ; - err |= !!ret; - goto close_out; - } - root =btrfs_csum_root (gfs_info,0 ); -if (!extent_buffer_uptodate (root->node)) { -error ("critical: csum_root, unable to check the filesystem" ); - ret = -EIO ; + ret =check_global_roots_uptodate (); +if (ret) { err |= !!ret; goto close_out; }
Signature · 1 line
2.26.3
PATCH v2 6/30 btrfs-progs: check: check all of the csum roots
In reply to Josef BacikUse the global roots tree to find all of the csum roots in the system and check all of them as appropriate.
--- check/main.c | 26 +++++++++++++++++++++++--- 1 file changed, 23 insertions(+), 3 deletions(-)
check/main.c +23 -3
@@ -5977,7 +5977,7 @@ out:return ret; } -static int check_csums (struct btrfs_root *root) +static int check_csum_root (struct btrfs_root *root) {struct btrfs_path path;struct extent_buffer *leaf;
@@ -5991,7 +5991,6 @@ static int check_csums(struct btrfs_root *root)unsigned long leaf_offset;bool verify_csum = !!check_data_csum; - root =btrfs_csum_root (gfs_info,0 );if (!extent_buffer_uptodate (root->node)) {fprintf (stderr,"No valid csum tree found\n" );return -ENOENT ;
@@ -6087,6 +6086,27 @@ skip_csum_check:return errors; } +static int check_csums (void ) +{ +struct rb_node *n; +struct btrfs_root *root; +int ret; + + root =btrfs_csum_root (gfs_info,0 ); +while (1 ) { + ret =check_csum_root (root); +if (ret) +break ; + n =rb_next (&root->rb_node); +if (!n) +break ; + root = rb_entry(n, struct btrfs_root, rb_node); +if (root->root_key.objectid !=BTRFS_CSUM_TREE_OBJECTID ) +break ; + } +return ret; +} +static int is_dropped_key (struct btrfs_key *key,struct btrfs_key *drop_key) {
@@ -10899,7 +10919,7 @@ static int cmd_check(const struct cmd_struct *cmd, int argc, char **argv)task_start (ctx.info, &ctx.start_time, &ctx.item_count); } - ret =check_csums (root); + ret =check_csums ();task_stop (ctx.info);/* * Data csum error is not fatal, and it may indicate more serious
Signature · 1 line
2.26.3
PATCH v2 7/30 btrfs-progs: check: fill csum root from all extent roots
In reply to Josef BacikWe may have multiple extent roots, so cycle through all of the extent roots and populate the csum tree based on the content of every extent root we have in the file system.
--- check/main.c | 24 ++++++++++++++++++++---- 1 file changed, 20 insertions(+), 4 deletions(-)
check/main.c +20 -4
@@ -9690,9 +9690,9 @@ out:return ret; } -static int fill_csum_tree_from_extent (struct btrfs_trans_handle *trans) +static int fill_csum_tree_from_extent (struct btrfs_trans_handle *trans, +struct btrfs_root *extent_root) { -struct btrfs_root *extent_root =btrfs_extent_root (gfs_info,0 );struct btrfs_root *csum_root;struct btrfs_path path;struct btrfs_extent_item *ei;
@@ -9766,10 +9766,26 @@ static int fill_csum_tree_from_extent(struct btrfs_trans_handle *trans)static int fill_csum_tree (struct btrfs_trans_handle *trans,int search_fs_tree) { +struct btrfs_root *root; +struct rb_node *n; +int ret; +if (search_fs_tree)return fill_csum_tree_from_fs (trans); -else -return fill_csum_tree_from_extent (trans); + + root =btrfs_extent_root (gfs_info,0 ); +while (1 ) { + ret =fill_csum_tree_from_extent (trans, root); +if (ret) +break ; + n =rb_next (&root->rb_node); +if (!n) +break ; + root = rb_entry(n, struct btrfs_root, rb_node); +if (root->root_key.objectid !=BTRFS_EXTENT_TREE_OBJECTID ) +break ; + } +return ret; }static void free_roots_info_cache (void )
Signature · 1 line
2.26.3
PATCH v2 8/30 btrfs-progs: common: search all extent roots for marking used space
In reply to Josef BacikWe could have multiple extent roots, so add a helper to mark all the used space in the FS based on any extent roots we find, and then use this extent io tree to fixup the block group accounting.
--- common/repair.c | 142 +++++++++++++++++++++++++++++++++--------------- common/repair.h | 2 + 2 files changed, 100 insertions(+), 44 deletions(-)
common/repair.c +98 -44
@@ -152,47 +152,27 @@ int btrfs_mark_used_tree_blocks(struct btrfs_fs_info *fs_info,return ret; } -/* -* Fixup block accounting. The initial block accounting created by -* make_block_groups isn't accuracy in this case. -*/ -int btrfs_fix_block_accounting (struct btrfs_trans_handle *trans) +static int populate_used_from_extent_root (struct btrfs_root *root, +struct extent_io_tree *io_tree) { -int ret =0 ; -int slot; -u64 start =0 ; -u64 bytes_used =0 ; +struct btrfs_fs_info *fs_info = root->fs_info; +struct extent_buffer *leaf;struct btrfs_path path;struct btrfs_key key; -struct extent_buffer *leaf; -struct btrfs_block_group *cache; -struct btrfs_fs_info *fs_info = trans->fs_info; -struct btrfs_root *root =btrfs_extent_root (fs_info,0 ); - - ret =btrfs_run_delayed_refs (trans,-1 ); -if (ret) -return ret; - -while (1 ) { - cache =btrfs_lookup_first_block_group (fs_info, start); -if (!cache) -break ; - - start = cache->start + cache->length; - cache->used =0 ; - cache->space_info->bytes_used =0 ; -if (list_empty (&cache->dirty_list)) -list_add_tail (&cache->dirty_list, &trans->dirty_bgs); - } +int slot; +int ret;btrfs_init_path (&path); key.offset =0 ; key.objectid =0 ; key.type =BTRFS_EXTENT_ITEM_KEY ; - ret =btrfs_search_slot (trans, root, &key, &path,0 ,0 ); + ret =btrfs_search_slot (NULL , root, &key, &path,0 ,0 );if (ret <0 )return ret; +while (1 ) { +u64 start, end; + leaf = path.nodes[0 ]; slot = path.slots[0 ];if (slot >=btrfs_header_nritems (leaf)) {
@@ -205,23 +185,97 @@ int btrfs_fix_block_accounting(struct btrfs_trans_handle *trans) slot = path.slots[0 ]; }btrfs_item_key_to_cpu (leaf, &key, slot); -if (key.type ==BTRFS_EXTENT_ITEM_KEY ) { - bytes_used += key.offset; - ret =btrfs_update_block_group (trans, - key.objectid, key.offset,1 ,0 ); -BUG_ON (ret); - }else if (key.type ==BTRFS_METADATA_ITEM_KEY ) { - bytes_used += fs_info->nodesize; - ret =btrfs_update_block_group (trans, - key.objectid, fs_info->nodesize,1 ,0 ); -if (ret) - goto out; - } + start = end = key.objectid; +if (key.type ==BTRFS_EXTENT_ITEM_KEY ) + end = start + key.offset -1 ; +else if (key.type ==BTRFS_METADATA_ITEM_KEY ) + end = start + fs_info->nodesize -1 ; + +if (start != end) +set_extent_dirty (io_tree, start, end); + path.slots[0 ]++; } -btrfs_set_super_bytes_used (root->fs_info->super_copy, bytes_used); +btrfs_release_path (&path); +return 0 ; +} + +int btrfs_mark_used_blocks (struct btrfs_fs_info *fs_info, +struct extent_io_tree *tree) +{ +struct btrfs_root *root; +struct rb_node *n; +int ret; + + root =btrfs_extent_root (fs_info,0 ); +while (1 ) { + ret =populate_used_from_extent_root (root, tree); +if (ret) +break ; + n =rb_next (&root->rb_node); +if (!n) +break ; + root = rb_entry(n, struct btrfs_root, rb_node); +if (root->root_key.objectid !=BTRFS_EXTENT_TREE_OBJECTID ) +break ; + } + +return ret; +} + +/* +* Fixup block accounting. The initial block accounting created by +* make_block_groups isn't accuracy in this case. +*/ +int btrfs_fix_block_accounting (struct btrfs_trans_handle *trans) +{ +struct extent_io_tree used; +struct btrfs_fs_info *fs_info = trans->fs_info; +struct btrfs_block_group *cache; +u64 start, end; +u64 bytes_used =0 ; +int ret =0 ; + + ret =btrfs_run_delayed_refs (trans,-1 ); +if (ret) +return ret; + +extent_io_tree_init (&used); + + ret =btrfs_mark_used_blocks (fs_info, &used); +if (ret) + goto out; + + start =0 ; +while (1 ) { + cache =btrfs_lookup_first_block_group (fs_info, start); +if (!cache) +break ; + + start = cache->start + cache->length; + cache->used =0 ; + cache->space_info->bytes_used =0 ; +if (list_empty (&cache->dirty_list)) +list_add_tail (&cache->dirty_list, &trans->dirty_bgs); + } + + start =0 ; +while (1 ) { + ret =find_first_extent_bit (&used,0 , &start, &end, +EXTENT_DIRTY ); +if (ret) +break ; + + bytes_used += end - start +1 ; + ret =btrfs_update_block_group (trans, start, end - start +1 , +1 ,0 ); +if (ret) + goto out; +clear_extent_dirty (&used, start, end); + } +btrfs_set_super_bytes_used (fs_info->super_copy, bytes_used); ret =0 ; out: -btrfs_release_path (&path); +extent_io_tree_cleanup (&used);return ret; }
common/repair.h +2 -0
@@ -35,5 +35,7 @@ int btrfs_add_corrupt_extent_record(struct btrfs_fs_info *info,int btrfs_fix_block_accounting (struct btrfs_trans_handle *trans);int btrfs_mark_used_tree_blocks (struct btrfs_fs_info *fs_info,struct extent_io_tree *tree); +int btrfs_mark_used_blocks (struct btrfs_fs_info *fs_info, +struct extent_io_tree *tree);#endif
Signature · 1 line
2.26.3
PATCH v2 9/30 btrfs-progs: common: allow users to select extent-tree-v2 option
In reply to Josef BacikWe want to enable developers to test the extent tree v2 features as they are added, add the ability to mkfs an extent tree v2 fs if we have experimental enabled.
--- common/fsfeatures.c | 11 +++++++++++ kernel-shared/ctree.h | 18 ++++++++++++++++++ mkfs/main.c | 6 ++++++ 3 files changed, 35 insertions(+)
common/fsfeatures.c +11 -0
@@ -131,6 +131,17 @@ static const struct btrfs_feature mkfs_features[] = { VERSION_NULL(default), .desc = "support zoned devices" }, +#endif +#if EXPERIMENTAL + { + .name = "extent-tree-v2", + .flag = BTRFS_FEATURE_INCOMPAT_EXTENT_TREE_V2, + .sysfs_name ="extent_tree_v2" , +VERSION_TO_STRING2 (compat,5 ,15 ), +VERSION_NULL (safe), +VERSION_NULL (default), + .desc = "new extent tree format" + }, #endif /* Keep this one last */ {
kernel-shared/ctree.h +18 -0
@@ -507,6 +507,23 @@ struct btrfs_super_block { (BTRFS_FEATURE_COMPAT_RO_FREE_SPACE_TREE | \ BTRFS_FEATURE_COMPAT_RO_FREE_SPACE_TREE_VALID) +#if EXPERIMENTAL +#define BTRFS_FEATURE_INCOMPAT_SUPP \ + (BTRFS_FEATURE_INCOMPAT_MIXED_BACKREF | \ + BTRFS_FEATURE_INCOMPAT_DEFAULT_SUBVOL | \ + BTRFS_FEATURE_INCOMPAT_COMPRESS_LZO | \ + BTRFS_FEATURE_INCOMPAT_COMPRESS_ZSTD | \ + BTRFS_FEATURE_INCOMPAT_BIG_METADATA | \ + BTRFS_FEATURE_INCOMPAT_EXTENDED_IREF | \ + BTRFS_FEATURE_INCOMPAT_RAID56 | \ + BTRFS_FEATURE_INCOMPAT_MIXED_GROUPS | \ + BTRFS_FEATURE_INCOMPAT_SKINNY_METADATA | \ + BTRFS_FEATURE_INCOMPAT_NO_HOLES | \ + BTRFS_FEATURE_INCOMPAT_RAID1C34 | \ + BTRFS_FEATURE_INCOMPAT_METADATA_UUID | \ + BTRFS_FEATURE_INCOMPAT_ZONED | \ + BTRFS_FEATURE_INCOMPAT_EXTENT_TREE_V2) +#else #define BTRFS_FEATURE_INCOMPAT_SUPP \ (BTRFS_FEATURE_INCOMPAT_MIXED_BACKREF | \ BTRFS_FEATURE_INCOMPAT_DEFAULT_SUBVOL | \
@@ -521,6 +538,7 @@ struct btrfs_super_block { BTRFS_FEATURE_INCOMPAT_RAID1C34 | \ BTRFS_FEATURE_INCOMPAT_METADATA_UUID | \ BTRFS_FEATURE_INCOMPAT_ZONED) +#endif /* * A leaf is full of items. offset and size tell us where to find
mkfs/main.c +6 -0
@@ -1223,6 +1223,12 @@ int BOX_MAIN(mkfs)(int argc, char **argv) features |=BTRFS_FEATURE_INCOMPAT_RAID1C34 ; } +/* Extent tree v2 comes with a set of mandatory features. */ +if (features &BTRFS_FEATURE_INCOMPAT_EXTENT_TREE_V2 ) { + features |=BTRFS_FEATURE_INCOMPAT_NO_HOLES ; + runtime_features |=BTRFS_RUNTIME_FEATURE_FREE_SPACE_TREE ; + } +if (zoned) {if (source_dir_set) {error ("the option -r and zoned mode are incompatible" );
Signature · 1 line
2.26.3
PATCH v2 10/30 btrfs-progs: add definitions for the block group tree
In reply to Josef BacikAdd the on disk definitions for the block group tree. This will be part of the super block so we need to add the appropriate helpers to the super block, as well as adding it to the backup roots.
--- cmds/inspect-dump-tree.c | 7 ++++++- kernel-shared/ctree.h | 29 ++++++++++++++++++++++++++++- kernel-shared/disk-io.c | 14 ++++++++++++++ kernel-shared/print-tree.c | 3 +++ libbtrfsutil/btrfs_tree.h | 3 +++ 5 files changed, 54 insertions(+), 2 deletions(-)
cmds/inspect-dump-tree.c +6 -1
@@ -155,7 +155,8 @@ static u64 treeid_from_string(const char *str, const char **end) { "TREE_LOG_FIXUP", BTRFS_TREE_LOG_FIXUP_OBJECTID }, { "TREE_LOG", BTRFS_TREE_LOG_OBJECTID }, { "TREE_RELOC", BTRFS_TREE_RELOC_OBJECTID }, - { "DATA_RELOC", BTRFS_DATA_RELOC_TREE_OBJECTID } + { "DATA_RELOC", BTRFS_DATA_RELOC_TREE_OBJECTID }, + { "BLOCK_GROUP_TREE", BTRFS_BLOCK_GROUP_TREE_OBJECTID }, };if (strncasecmp ("BTRFS_" , str,strlen ("BTRFS_" )) ==0 )
@@ -695,6 +696,10 @@ again:printf ("multiple" ); }break ; +case BTRFS_BLOCK_GROUP_TREE_OBJECTID : +if (!skip) +printf ("block group" ); +break ;default :if (!skip) {printf ("file" );
kernel-shared/ctree.h +28 -1
@@ -85,6 +85,9 @@ struct btrfs_free_space_ctl;/* tracks free space in block groups. */ #define BTRFS_FREE_SPACE_TREE_OBJECTID 10ULL +/* hold the block group items. */ +#define BTRFS_BLOCK_GROUP_TREE_OBJECTID 11ULL +/* device stats in the device tree */ #define BTRFS_DEV_STATS_OBJECTID 0ULL
@@ -456,8 +459,14 @@ struct btrfs_super_block {__le64 uuid_tree_generation;u8 metadata_uuid[BTRFS_FSID_SIZE ]; + +__le64 block_group_root; +__le64 block_group_root_generation; +u8 block_group_root_level; +/* future expansion */ -__le64 reserved[28 ]; +u8 reserved8[7 ]; +__le64 reserved[25 ];u8 sys_chunk_array[BTRFS_SYSTEM_CHUNK_ARRAY_SIZE ];struct btrfs_root_backup super_roots[BTRFS_NUM_BACKUP_ROOTS ]; } __attribute__ ((__packed__));
@@ -2281,6 +2290,17 @@ BTRFS_SETGET_STACK_FUNCS(backup_bytes_used, struct btrfs_root_backup, BTRFS_SETGET_STACK_FUNCS(backup_num_devices, struct btrfs_root_backup, num_devices,64 ); +/* +* Extent tree v2 doesn't have a global csum or extent root, so we use the +* extent root slot for the block group root. +*/ +BTRFS_SETGET_STACK_FUNCS(backup_block_group_root, struct btrfs_root_backup, + extent_root,64 ); +BTRFS_SETGET_STACK_FUNCS(backup_block_group_root_gen, struct btrfs_root_backup, + extent_root_gen,64 ); +BTRFS_SETGET_STACK_FUNCS(backup_block_group_root_level, struct btrfs_root_backup, + extent_root_level,8 ); +/* struct btrfs_super_block */ BTRFS_SETGET_STACK_FUNCS(super_bytenr, struct btrfs_super_block, bytenr, 64);
@@ -2331,6 +2351,13 @@ BTRFS_SETGET_STACK_FUNCS(super_cache_generation, struct btrfs_super_block, BTRFS_SETGET_STACK_FUNCS(super_uuid_tree_generation, struct btrfs_super_block, uuid_tree_generation,64 ); BTRFS_SETGET_STACK_FUNCS(super_magic, struct btrfs_super_block, magic, 64); +BTRFS_SETGET_STACK_FUNCS(super_block_group_root, struct btrfs_super_block, + block_group_root,64 ); +BTRFS_SETGET_STACK_FUNCS (super_block_group_root_generation, + struct btrfs_super_block, + block_group_root_generation,64 ); +BTRFS_SETGET_STACK_FUNCS (super_block_group_root_level, + struct btrfs_super_block, block_group_root_level, 8);static inline unsigned long btrfs_leaf_data (struct extent_buffer *l) {
kernel-shared/disk-io.c +14 -0
@@ -1721,6 +1721,20 @@ int btrfs_check_super(struct btrfs_super_block *sb, unsigned sbflags) goto error_out; } +if (btrfs_super_incompat_flags (sb) &BTRFS_FEATURE_INCOMPAT_EXTENT_TREE_V2 ) { +if (btrfs_super_block_group_root_level (sb) >=BTRFS_MAX_LEVEL ) { +error ("block_group_root level too big: %d >= %d" , +btrfs_super_block_group_root_level (sb), +BTRFS_MAX_LEVEL ); + goto error_out; + } +if (!IS_ALIGNED (btrfs_super_block_group_root (sb),4096 )) { +error ("block_group_root block unaligned: %llu" , +btrfs_super_block_group_root (sb)); + goto error_out; + } + } +if (btrfs_super_incompat_flags (sb) &BTRFS_FEATURE_INCOMPAT_METADATA_UUID ) metadata_uuid = sb->metadata_uuid;else
kernel-shared/print-tree.c +3 -0
@@ -787,6 +787,9 @@ void print_objectid(FILE *stream, u64 objectid, u8 type)case BTRFS_MULTIPLE_OBJECTIDS :fprintf (stream,"MULTIPLE" );break ; +case BTRFS_BLOCK_GROUP_TREE_OBJECTID : +fprintf (stream,"BLOCK_GROUP_TREE" ); +break ;case (u64)-1 :fprintf (stream,"-1" );break ;
libbtrfsutil/btrfs_tree.h +3 -0
@@ -48,6 +48,9 @@/* tracks free space in block groups. */ #define BTRFS_FREE_SPACE_TREE_OBJECTID 10ULL +/* hold the block group items. */ +#define BTRFS_BLOCK_GROUP_TREE_OBJECTID 11ULL +/* device stats in the device tree */ #define BTRFS_DEV_STATS_OBJECTID 0ULL
Signature · 1 line
2.26.3
PATCH v2 11/30 btrfs-progs: add on disk pointers to global tree ids
In reply to Josef BacikWe are going to start creating multiple sets of global trees, which at the moment are the free space tree, csum tree, and extent tree. Generally we will assign these at block group creation time, but Dave would like to be able to have them per-subvolume at some point, so reserve a slot for that as well.
--- kernel-shared/ctree.h | 14 +++++++++++++- 1 file changed, 13 insertions(+), 1 deletion(-)
kernel-shared/ctree.h +13 -1
@@ -824,7 +824,13 @@ struct btrfs_root_item {struct btrfs_timespec otime;struct btrfs_timespec stime;struct btrfs_timespec rtime; -__le64 reserved[8 ];/* for future */ + +/* +* If we want to use a specific set of fst/checksum/extent roots for +* this root. +*/ +__le64 global_tree_id; +__le64 reserved[7 ];/* for future */ } __attribute__ ((__packed__));/*
@@ -1709,6 +1715,12 @@ BTRFS_SETGET_FUNCS(block_group_flags,BTRFS_SETGET_STACK_FUNCS (stack_block_group_flags, struct btrfs_block_group_item, flags, 64); +/* extent tree v2 uses chunk_objectid for the global tree id. */ +BTRFS_SETGET_STACK_FUNCS (stack_block_group_global_tree_id, + struct btrfs_block_group_item, chunk_objectid, 64); +BTRFS_SETGET_FUNCS(block_group_global_tree_id, struct btrfs_block_group_item, + chunk_objectid,64 ); +/* struct btrfs_free_space_info */ BTRFS_SETGET_FUNCS(free_space_extent_count, struct btrfs_free_space_info, extent_count,32 );
Signature · 1 line
2.26.3
PATCH v2 12/30 btrfs-progs: add support for loading the block group root
In reply to Josef BacikThis adds the ability to load the block group root, as well as make sure the various backup super block and super block updates are made appropriately.
--- kernel-shared/ctree.h | 1 + kernel-shared/disk-io.c | 161 +++++++++++++++++++++++++++--------- kernel-shared/disk-io.h | 10 ++- kernel-shared/extent-tree.c | 8 +- kernel-shared/transaction.c | 2 + 5 files changed, 138 insertions(+), 44 deletions(-)
kernel-shared/ctree.h +1 -0
@@ -1195,6 +1195,7 @@ struct btrfs_fs_info {struct btrfs_root *dev_root;struct btrfs_root *quota_root;struct btrfs_root *uuid_root; +struct btrfs_root *block_group_root;struct rb_root global_roots_tree;struct rb_root fs_root_tree;
kernel-shared/disk-io.c +122 -39
266 lines not on this page · raw message
kernel-shared/disk-io.h +9 -1
@@ -219,9 +219,17 @@ struct btrfs_root *btrfs_create_tree(struct btrfs_trans_handle *trans, u64 objectid);struct btrfs_root *btrfs_csum_root (struct btrfs_fs_info *fs_info,u64 bytenr);struct btrfs_root *btrfs_extent_root (struct btrfs_fs_info *fs_inf,u64 bytenr); -struct btrfs_root *btrfs_block_group_root (struct btrfs_fs_info *fs_info);struct btrfs_root *btrfs_global_root (struct btrfs_fs_info *fs_info,struct btrfs_key *key);int btrfs_global_root_insert (struct btrfs_fs_info *fs_info,struct btrfs_root *root); + +static inline struct btrfs_root *btrfs_block_group_root ( +struct btrfs_fs_info *fs_info) +{ +if (btrfs_fs_incompat (fs_info,EXTENT_TREE_V2 )) +return fs_info->block_group_root; +return btrfs_extent_root (fs_info,0 ); +} +#endif
kernel-shared/extent-tree.c +4 -4
@@ -1540,7 +1540,7 @@ static int update_block_group_item(struct btrfs_trans_handle *trans, {int ret;struct btrfs_fs_info *fs_info = trans->fs_info; -struct btrfs_root *root =btrfs_extent_root (fs_info,0 ); +struct btrfs_root *root =btrfs_block_group_root (fs_info);unsigned long bi;struct btrfs_block_group_item bgi;struct extent_buffer *leaf;
@@ -2731,7 +2731,7 @@ int btrfs_read_block_groups(struct btrfs_fs_info *fs_info)int ret;struct btrfs_key key; - root =btrfs_extent_root (fs_info,0 ); + root =btrfs_block_group_root (fs_info); key.objectid =0 ; key.offset =0 ; key.type =BTRFS_BLOCK_GROUP_ITEM_KEY ;
@@ -2812,7 +2812,7 @@ static int insert_block_group_item(struct btrfs_trans_handle *trans, key.type =BTRFS_BLOCK_GROUP_ITEM_KEY ; key.offset = block_group->length; - root =btrfs_extent_root (fs_info,0 ); + root =btrfs_block_group_root (fs_info);return btrfs_insert_item (trans, root, &key, &bgi,sizeof (bgi)); }
@@ -2929,7 +2929,7 @@ static int remove_block_group_item(struct btrfs_trans_handle *trans, {struct btrfs_fs_info *fs_info = trans->fs_info;struct btrfs_key key; -struct btrfs_root *root =btrfs_extent_root (fs_info,0 ); +struct btrfs_root *root =btrfs_block_group_root (fs_info);int ret =0 ; key.objectid = block_group->start;
kernel-shared/transaction.c +2 -0
@@ -185,6 +185,8 @@ int btrfs_commit_transaction(struct btrfs_trans_handle *trans, goto commit_tree;if (root == root->fs_info->chunk_root) goto commit_tree; +if (root == root->fs_info->block_group_root) + goto commit_tree;free_extent_buffer (root->commit_root); root->commit_root =NULL ;
Signature · 1 line
2.26.3
PATCH v2 13/30 btrfs-progs: add print support for the block group tree
In reply to Josef BacikAdd the appropriate support to the print tree and dump tree code to spit out the block group tree.
--- cmds/inspect-dump-tree.c | 30 +++++++++++++++++++++++++++++- kernel-shared/print-tree.c | 23 +++++++++++++++++++---- 2 files changed, 48 insertions(+), 5 deletions(-)
cmds/inspect-dump-tree.c +29 -1
@@ -83,8 +83,14 @@ out:static void print_old_roots (struct btrfs_super_block *super) { +const char *extent_tree_str ="extent root" ;struct btrfs_root_backup *backup;int i; +bool extent_tree_v2 = (btrfs_super_incompat_flags (super) & +BTRFS_FEATURE_INCOMPAT_EXTENT_TREE_V2 ); + +if (extent_tree_v2) + extent_tree_str ="block group root" ;for (i =0 ; i <BTRFS_NUM_BACKUP_ROOTS ; i++) { backup = super->super_roots + i;
@@ -93,7 +99,7 @@ static void print_old_roots(struct btrfs_super_block *super) (unsigned long long )btrfs_backup_tree_root_gen (backup), (unsigned long long)btrfs_backup_tree_root(backup)); -printf ("\t\textent root gen %llu block %llu\n" , +printf ("\t\t%s gen %llu block %llu\n" , extent_tree_str, (unsigned long long )btrfs_backup_extent_root_gen (backup), (unsigned long long )btrfs_backup_extent_root (backup));
@@ -510,6 +516,11 @@ static int cmd_inspect_dump_tree(const struct cmd_struct *cmd, info->log_root_tree->node->start,btrfs_header_level ( info->log_root_tree->node)); +if (info->block_group_root) +printf ("block group tree: %llu level %d\n" , + info->block_group_root->node->start, +btrfs_header_level ( + info->block_group_root->node)); }else {if (info->tree_root->node) {printf ("root tree\n" );
@@ -528,6 +539,12 @@ static int cmd_inspect_dump_tree(const struct cmd_struct *cmd,btrfs_print_tree (info->log_root_tree->node,BTRFS_PRINT_TREE_FOLLOW | print_mode); } + +if (info->block_group_root) { +printf ("block group tree\n" ); +btrfs_print_tree (info->block_group_root->node, +BTRFS_PRINT_TREE_FOLLOW | print_mode); + } } } tree_root_scan = info->tree_root;
@@ -573,6 +590,17 @@ again: goto close_root; } +if (tree_id && tree_id ==BTRFS_BLOCK_GROUP_TREE_OBJECTID ) { +if (!info->block_group_root) { +error ("cannot print block group tree, invalid pointer" ); + goto close_root; + } +printf ("block group tree\n" ); +btrfs_print_tree (info->block_group_root->node, +BTRFS_PRINT_TREE_FOLLOW | print_mode); + goto close_root; + } + key.offset =0 ; key.objectid =0 ; key.type =BTRFS_ROOT_ITEM_KEY ;
kernel-shared/print-tree.c +19 -4
@@ -1860,8 +1860,14 @@ static int empty_backup(struct btrfs_root_backup *backup)return 0 ; } -static void print_root_backup (struct btrfs_root_backup *backup) +static void print_root_backup (struct btrfs_root_backup *backup, +bool extent_tree_v2) { +const char *extent_tree_str ="backup_extent_root" ; + +if (extent_tree_v2) + extent_tree_str ="backup_block_group_root" ; + printf("\t\tbackup_tree_root:\t%llu\tgen: %llu\tlevel: %d\n", btrfs_backup_tree_root(backup), btrfs_backup_tree_root_gen(backup),
@@ -1870,7 +1876,8 @@ static void print_root_backup(struct btrfs_root_backup *backup)btrfs_backup_chunk_root (backup),btrfs_backup_chunk_root_gen (backup), btrfs_backup_chunk_root_level(backup)); -printf ("\t\tbackup_extent_root:\t%llu\tgen: %llu\tlevel: %d\n" , +printf ("\t\t%s:\t%llu\tgen: %llu\tlevel: %d\n" , + extent_tree_str,btrfs_backup_extent_root (backup),btrfs_backup_extent_root_gen (backup),btrfs_backup_extent_root_level (backup));
@@ -1882,7 +1889,7 @@ static void print_root_backup(struct btrfs_root_backup *backup)btrfs_backup_dev_root (backup),btrfs_backup_dev_root_gen (backup), btrfs_backup_dev_root_level(backup)); -printf ("\t\tbackup_csum_root:\t%llu\tgen: %llu\tlevel: %d\n" , +printf ("\t\tcsum_root:\t%llu\tgen: %llu\tlevel: %d\n" ,btrfs_backup_csum_root (backup),btrfs_backup_csum_root_gen (backup),btrfs_backup_csum_root_level (backup));
@@ -1900,12 +1907,14 @@ static void print_backup_roots(struct btrfs_super_block *sb) {struct btrfs_root_backup *backup;int i; +bool extent_tree_v2 = (btrfs_super_incompat_flags (sb) & +BTRFS_FEATURE_INCOMPAT_EXTENT_TREE_V2 );for (i =0 ; i <BTRFS_NUM_BACKUP_ROOTS ; i++) { backup = sb->super_roots + i;if (!empty_backup (backup)) {printf ("\tbackup %d:\n" , i); -print_root_backup (backup); +print_root_backup (backup, extent_tree_v2); } } }
@@ -2022,6 +2031,12 @@ void btrfs_print_superblock(struct btrfs_super_block *sb, int full) (unsigned long long)btrfs_super_cache_generation(sb));printf ("uuid_tree_generation\t%llu\n" , (unsigned long long )btrfs_super_uuid_tree_generation (sb)); +printf ("block_group_root\t%llu\n" , + (unsigned long long )btrfs_super_block_group_root (sb)); +printf ("block_group_root_generation\t%llu\n" , + (unsigned long long )btrfs_super_block_group_root_generation (sb)); +printf ("block_group_root_level\t%llu\n" , + (unsigned long long )btrfs_super_block_group_root_level (sb));uuid_unparse (sb->dev_item.uuid, buf);printf ("dev_item.uuid\t\t%s\n" , buf);
Signature · 1 line
2.26.3
PATCH v2 14/30 btrfs-progs: mkfs: use the btrfs_block_group_root helper
In reply to Josef BacikInstead of accessing the extent root directory for modifying block groups, use the helper which will do the correct thing based on the flags of the file system.
--- check/main.c | 4 ++-- mkfs/main.c | 2 +- 2 files changed, 3 insertions(+), 3 deletions(-)
check/main.c +2 -2
@@ -9387,6 +9387,7 @@ static int reinit_global_roots(struct btrfs_trans_handle *trans, u64 objectid)static int reinit_extent_tree (struct btrfs_trans_handle *trans,bool pin) { +struct btrfs_root *bg_root =btrfs_block_group_root (trans->fs_info);u64 start =0 ;int ret;
@@ -9460,7 +9461,6 @@ again:while (1 ) {struct btrfs_block_group_item bgi;struct btrfs_block_group *cache; -struct btrfs_root *extent_root =btrfs_extent_root (gfs_info,0 );struct btrfs_key key; cache =btrfs_lookup_first_block_group (gfs_info, start);
@@ -9474,7 +9474,7 @@ again: key.objectid = cache->start; key.type =BTRFS_BLOCK_GROUP_ITEM_KEY ; key.offset = cache->length; - ret =btrfs_insert_item (trans, extent_root, &key, &bgi, + ret =btrfs_insert_item (trans, bg_root, &key, &bgi,sizeof (bgi));if (ret) {fprintf (stderr,"Error adding block group\n" );
mkfs/main.c +1 -1
@@ -596,7 +596,7 @@ static int cleanup_temp_chunks(struct btrfs_fs_info *fs_info, {struct btrfs_trans_handle *trans =NULL ;struct btrfs_block_group_item *bgi; -struct btrfs_root *root =btrfs_extent_root (fs_info,0 ); +struct btrfs_root *root =btrfs_block_group_root (fs_info);struct btrfs_key key;struct btrfs_key found_key;struct btrfs_path path;
Signature · 1 line
2.26.3
PATCH v2 15/30 btrfs-progs: check-lowmem: use the btrfs_block_group_root helper
In reply to Josef BacikWhen we're messing with block group items use the btrfs_block_group_root() helper to get the correct root to search, and this will do the right thing based on the file system flags.
--- check/mode-lowmem.c | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-)
check/mode-lowmem.c +4 -4
@@ -266,7 +266,7 @@ static int modify_block_group_cache(struct btrfs_block_group *block_group, int c*/ static int modify_block_groups_cache (u64 flags,int cache) { -struct btrfs_root *root =btrfs_extent_root (gfs_info,0 ); +struct btrfs_root *root =btrfs_block_group_root (gfs_info);struct btrfs_key key;struct btrfs_path path;struct btrfs_block_group *bg_cache;
@@ -331,7 +331,7 @@ static int clear_block_groups_full(u64 flags)static int create_chunk_and_block_group (u64 flags,u64 *start,u64 *nbytes) {struct btrfs_trans_handle *trans; -struct btrfs_root *root =btrfs_extent_root (gfs_info,0 ); +struct btrfs_root *root =btrfs_block_group_root (gfs_info);int ret;if ((flags &BTRFS_BLOCK_GROUP_TYPE_MASK ) ==0 )
@@ -419,7 +419,7 @@ static int is_chunk_almost_full(u64 start) {struct btrfs_path path;struct btrfs_key key; -struct btrfs_root *root =btrfs_extent_root (gfs_info,0 ); +struct btrfs_root *root =btrfs_block_group_root (gfs_info);struct btrfs_block_group_item *bi;struct btrfs_block_group_item bg_item;struct extent_buffer *eb;
@@ -4591,7 +4591,7 @@ next:static int find_block_group_item (struct btrfs_path *path,u64 bytenr,u64 len,u64 type) { -struct btrfs_root *root =btrfs_extent_root (gfs_info,0 ); +struct btrfs_root *root =btrfs_block_group_root (gfs_info);struct btrfs_block_group_item bgi;struct btrfs_key key;int ret;
Signature · 1 line
2.26.3
PATCH v2 16/30 btrfs-progs: handle no bg item in extent tree for free space tree
In reply to Josef BacikWe have an ASSERT(ret == 0) when populating the free space tree as we should at least find the block group item with extent tree v1. However with v2 we no longer have the block group item in the extent tree, so fix the population logic to handle an empty block group (which occurs during mkfs) and only assert if ret != 0 and we don't have extent tree v2 turned on.
--- kernel-shared/free-space-tree.c | 11 ++++++++--- 1 file changed, 8 insertions(+), 3 deletions(-)
kernel-shared/free-space-tree.c +8 -3
@@ -1057,6 +1057,9 @@ int populate_free_space_tree(struct btrfs_trans_handle *trans,if (ret) goto out; + start = block_group->start; + end = block_group->start + block_group->length; +/* * Iterate through all of the extent and metadata items in this block * group, adding the free space between them and the free space at the
@@ -1071,10 +1074,11 @@ int populate_free_space_tree(struct btrfs_trans_handle *trans, ret =btrfs_search_slot_for_read (extent_root, &key, path,1 ,0 );if (ret <0 ) goto out; -ASSERT (ret ==0 ); +if (ret >0 ) { +ASSERT (btrfs_fs_incompat (trans->fs_info,EXTENT_TREE_V2 )); + goto done; + } - start = block_group->start; - end = block_group->start + block_group->length;while (1 ) {btrfs_item_key_to_cpu (path->nodes[0 ], &key, path->slots[0 ]);
@@ -1106,6 +1110,7 @@ int populate_free_space_tree(struct btrfs_trans_handle *trans,if (ret)break ; } +done:if (start < end) { ret =__add_to_free_space_tree (trans, block_group, path2, start, end - start);
Signature · 1 line
2.26.3
PATCH v2 17/30 btrfs-progs: mkfs: add support for the block group tree
In reply to Josef BacikAdd the extent tree v2 table with the block group tree as a root, and then create the empty root and use the proper root for cleanup up the temporary block groups.
--- mkfs/common.c | 93 ++++++++++++++++++++++++++++++++++++++++----------- mkfs/common.h | 12 +++++++ mkfs/main.c | 5 +++ 3 files changed, 91 insertions(+), 19 deletions(-)
mkfs/common.c +74 -19
@@ -39,6 +39,7 @@ static u64 reference_root_table[] = { [MKFS_FS_TREE] = BTRFS_FS_TREE_OBJECTID, [MKFS_CSUM_TREE] = BTRFS_CSUM_TREE_OBJECTID, [MKFS_FREE_SPACE_TREE] = BTRFS_FREE_SPACE_TREE_OBJECTID, + [MKFS_BLOCK_GROUP_TREE] = BTRFS_BLOCK_GROUP_TREE_OBJECTID, }; static int btrfs_write_empty_tree(int fd, struct btrfs_mkfs_config *cfg,
@@ -97,7 +98,8 @@ static int btrfs_create_tree_root(int fd, struct btrfs_mkfs_config *cfg,for (i =0 ; i < blocks_nr; i++) { blk = blocks[i]; -if (blk ==MKFS_ROOT_TREE || blk ==MKFS_CHUNK_TREE ) +if (blk ==MKFS_ROOT_TREE || blk ==MKFS_CHUNK_TREE || + blk ==MKFS_BLOCK_GROUP_TREE )continue ;btrfs_set_root_bytenr (&root_item, cfg->blocks[blk]);
@@ -188,6 +190,50 @@ static int create_free_space_tree(int fd, struct btrfs_mkfs_config *cfg,return 0 ; } +static void write_block_group_item (struct extent_buffer *buf,u32 nr, +u64 objectid,u64 offset,u64 used, +u32 itemoff) +{ +struct btrfs_block_group_item *bg_item; +struct btrfs_disk_key disk_key; + +btrfs_set_disk_key_objectid (&disk_key, objectid); +btrfs_set_disk_key_offset (&disk_key, offset); +btrfs_set_disk_key_type (&disk_key,BTRFS_BLOCK_GROUP_ITEM_KEY ); +btrfs_set_item_key (buf, &disk_key, nr); +btrfs_set_item_offset (buf,btrfs_item_nr (nr), itemoff); +btrfs_set_item_size (buf,btrfs_item_nr (nr),sizeof (*bg_item)); + + bg_item = btrfs_item_ptr(buf, nr, struct btrfs_block_group_item); +btrfs_set_block_group_used (buf, bg_item, used); +btrfs_set_block_group_flags (buf, bg_item,BTRFS_BLOCK_GROUP_SYSTEM ); +btrfs_set_block_group_chunk_objectid (buf, bg_item, +BTRFS_FIRST_CHUNK_TREE_OBJECTID ); +} + +static int create_block_group_tree (int fd,struct btrfs_mkfs_config *cfg, +struct extent_buffer *buf, +u64 bg_offset,u64 bg_size,u64 bg_used) +{ +int ret; + +memset (buf->data +sizeof (struct btrfs_header ),0 , + cfg->nodesize -sizeof (struct btrfs_header )); +write_block_group_item (buf,0 , bg_offset, bg_size, bg_used, +__BTRFS_LEAF_DATA_SIZE (cfg->nodesize) - +sizeof (struct btrfs_block_group_item )); +btrfs_set_header_bytenr (buf, cfg->blocks[MKFS_BLOCK_GROUP_TREE ]); +btrfs_set_header_owner (buf,BTRFS_BLOCK_GROUP_TREE_OBJECTID ); +btrfs_set_header_nritems (buf,1 ); +csum_tree_block_size (buf,btrfs_csum_type_size (cfg->csum_type),0 , + cfg->csum_type); + ret =pwrite (fd, buf->data, cfg->nodesize, + cfg->blocks[MKFS_BLOCK_GROUP_TREE ]); +if (ret != cfg->nodesize) +return ret <0 ? -errno : -EIO ; +return 0 ; +} +/* * @fs_uuid - if NULL, generates a UUID, returns back the new filesystem UUID *
@@ -240,11 +286,19 @@ int make_btrfs(int fd, struct btrfs_mkfs_config *cfg)bool add_block_group = true;bool free_space_tree = !!(cfg->runtime_features &BTRFS_RUNTIME_FEATURE_FREE_SPACE_TREE ); +bool extent_tree_v2 = !!(cfg->features & +BTRFS_FEATURE_INCOMPAT_EXTENT_TREE_V2 );/* Don't include the free space tree in the blocks to process. */ if (!free_space_tree) blocks_nr--; +if (extent_tree_v2) { + blocks = extent_tree_v2_blocks; + blocks_nr =ARRAY_SIZE (extent_tree_v2_blocks); + add_block_group = false; + } +if ((cfg->features &BTRFS_FEATURE_INCOMPAT_ZONED )) { system_group_offset = cfg->zone_size *BTRFS_NR_SB_LOG_ZONES ; system_group_size = cfg->zone_size;
@@ -309,6 +363,12 @@ int make_btrfs(int fd, struct btrfs_mkfs_config *cfg)btrfs_set_super_compat_ro_flags (&super, ro_flags); } +if (extent_tree_v2) { +btrfs_set_super_block_group_root (&super, + cfg->blocks[MKFS_BLOCK_GROUP_TREE ]); +btrfs_set_super_block_group_root_generation (&super,1 ); +btrfs_set_super_block_group_root_level (&super,0 ); + }if (cfg->label)__strncpy_null (super.label, cfg->label,BTRFS_LABEL_SIZE -1 );
@@ -340,25 +400,12 @@ int make_btrfs(int fd, struct btrfs_mkfs_config *cfg)/* Add the block group item for our temporary chunk. */ if (cfg->blocks[blk] > system_group_offset && add_block_group) { -struct btrfs_block_group_item *bg_item; - + itemoff -=sizeof (struct btrfs_block_group_item ); +write_block_group_item (buf, nritems, + system_group_offset, + system_group_size, total_used, + itemoff); add_block_group = false; - - itemoff -=sizeof (*bg_item); -btrfs_set_disk_key_objectid (&disk_key, system_group_offset); -btrfs_set_disk_key_offset (&disk_key, system_group_size); -btrfs_set_disk_key_type (&disk_key,BTRFS_BLOCK_GROUP_ITEM_KEY ); -btrfs_set_item_key (buf, &disk_key, nritems); -btrfs_set_item_offset (buf,btrfs_item_nr (nritems), itemoff); -btrfs_set_item_size (buf,btrfs_item_nr (nritems),sizeof (*bg_item)); - - bg_item =btrfs_item_ptr (buf, nritems, - struct btrfs_block_group_item); -btrfs_set_block_group_used (buf, bg_item, total_used); -btrfs_set_block_group_flags (buf, bg_item, -BTRFS_BLOCK_GROUP_SYSTEM ); -btrfs_set_block_group_chunk_objectid (buf, bg_item, -BTRFS_FIRST_CHUNK_TREE_OBJECTID ); nritems++; }
@@ -579,6 +626,14 @@ int make_btrfs(int fd, struct btrfs_mkfs_config *cfg) goto out; } +if (extent_tree_v2) { + ret =create_block_group_tree (fd, cfg, buf, + system_group_offset, + system_group_size, total_used); +if (ret) + goto out; + } +/* and write out the super block */ memset (buf->data,0 ,BTRFS_SUPER_INFO_SIZE );memcpy (buf->data, &super,sizeof (super));
mkfs/common.h +12 -0
@@ -51,6 +51,7 @@ enum btrfs_mkfs_block {MKFS_FS_TREE ,MKFS_CSUM_TREE ,MKFS_FREE_SPACE_TREE , +MKFS_BLOCK_GROUP_TREE , MKFS_BLOCK_COUNT };
@@ -69,6 +70,17 @@ static const enum btrfs_mkfs_block extent_tree_v1_blocks[] = { MKFS_FREE_SPACE_TREE, }; +static const enum btrfs_mkfs_block extent_tree_v2_blocks[] = { +MKFS_ROOT_TREE , +MKFS_EXTENT_TREE , +MKFS_CHUNK_TREE , +MKFS_DEV_TREE , +MKFS_FS_TREE , +MKFS_CSUM_TREE , +MKFS_FREE_SPACE_TREE , +MKFS_BLOCK_GROUP_TREE , +}; +struct btrfs_mkfs_config {/* Label of the new filesystem */ const char *label;
mkfs/main.c +5 -0
@@ -299,6 +299,11 @@ static int recow_roots(struct btrfs_trans_handle *trans, ret =__recow_root (trans, info->dev_root);if (ret)return ret; +if (btrfs_fs_incompat (info,EXTENT_TREE_V2 )) { + ret =__recow_root (trans, info->block_group_root); +if (ret) +return ret; + } ret =recow_global_roots (trans);if (ret)return ret;
Signature · 1 line
2.26.3
PATCH v2 18/30 btrfs-progs: check: add block group tree support
In reply to Josef BacikThis makes the appropriate changes to enable the block group tree checking for both lowmem and normal check modes. This is relatively straightforward, simply need to use the helper to get the right root for dealing with block groups.
--- check/main.c | 21 ++++++++++++++++++++- check/mode-lowmem.c | 4 ++-- 2 files changed, 22 insertions(+), 3 deletions(-)
check/main.c +20 -1
@@ -6229,10 +6229,17 @@ static int check_type_with_root(u64 rootid, u8 key_type)break ;case BTRFS_EXTENT_ITEM_KEY :case BTRFS_METADATA_ITEM_KEY : -case BTRFS_BLOCK_GROUP_ITEM_KEY :if (rootid !=BTRFS_EXTENT_TREE_OBJECTID ) goto err;break ; +case BTRFS_BLOCK_GROUP_ITEM_KEY : +if (btrfs_fs_incompat (gfs_info,EXTENT_TREE_V2 )) { +if (rootid !=BTRFS_BLOCK_GROUP_TREE_OBJECTID ) + goto err; + }else if (rootid !=BTRFS_EXTENT_TREE_OBJECTID ) { + goto err; + } +break ;case BTRFS_ROOT_ITEM_KEY :if (rootid !=BTRFS_ROOT_TREE_OBJECTID ) goto err;
@@ -9453,6 +9460,18 @@ again:return ret; } +/* +* If we are extent tree v2 then we can reint the block group root as +* well. +*/ +if (btrfs_fs_incompat (gfs_info,EXTENT_TREE_V2 )) { + ret =btrfs_fsck_reinit_root (trans, gfs_info->block_group_root); +if (ret) { +fprintf (stderr,"block group initialization failed\n" ); +return ret; + } + } +/* * Now we have all the in-memory block groups setup so we can make * allocations properly, and the metadata we care about is safe since we
check/mode-lowmem.c +2 -2
@@ -5530,7 +5530,7 @@ int check_chunks_and_extents_lowmem(void) key.offset =0 ; key.type =BTRFS_ROOT_ITEM_KEY ; - ret =btrfs_search_slot (NULL , root, &key, &path,0 ,0 ); + ret =btrfs_search_slot (NULL , gfs_info->tree_root, &key, &path,0 ,0 );if (ret) {error ("cannot find extent tree in tree_root" ); goto out;
@@ -5565,7 +5565,7 @@ int check_chunks_and_extents_lowmem(void)if (ret) goto out; next: - ret =btrfs_next_item (root, &path); + ret =btrfs_next_item (gfs_info->tree_root, &path);if (ret) goto out; }
Signature · 1 line
2.26.3
PATCH v2 19/30 btrfs-progs: qgroup-verify: scan extents based on block groups
In reply to Josef BacikWhen we switch to per-block group extent roots we'll need to scan each individual extent root. To make this easier in the future go ahead and use the range of the block groups to scan the extents.
--- check/qgroup-verify.c | 32 ++++++++++++++++++++++++-------- 1 file changed, 24 insertions(+), 8 deletions(-)
check/qgroup-verify.c +24 -8
@@ -1400,6 +1400,7 @@ static bool is_bad_qgroup(struct qgroup_count *count)*/ int qgroup_verify_all (struct btrfs_fs_info *info) { +struct rb_node *n;int ret;bool found_err = false;bool skip_err = false;
@@ -1430,10 +1431,17 @@ int qgroup_verify_all(struct btrfs_fs_info *info)/* * Put all extent refs into our rbtree */ - ret =scan_extents (info,0 , ~0ULL ); -if (ret) { -fprintf (stderr,"ERROR: while scanning extent tree: %d\n" , ret); - goto out; +for (n =rb_first (&info->block_group_cache_tree); n; n =rb_next (n)) { +struct btrfs_block_group *bg; + + bg = rb_entry(n, struct btrfs_block_group, cache_node); + ret =scan_extents (info, bg->start, + bg->start + bg->length -1 ); +if (ret) { +fprintf (stderr,"ERROR: while scanning extent tree: %d\n" , + ret); + goto out; + } } ret =map_implied_refs (info);
@@ -1507,6 +1515,7 @@ static void print_subvol_info(u64 subvolid, u64 bytenr, u64 num_bytes,int print_extent_state (struct btrfs_fs_info *info,u64 subvol) { +struct rb_node *n;int ret; tree_blocks =ulist_alloc (0 );
@@ -1519,10 +1528,17 @@ int print_extent_state(struct btrfs_fs_info *info, u64 subvol)/* * Put all extent refs into our rbtree */ - ret =scan_extents (info,0 , ~0ULL ); -if (ret) { -fprintf (stderr,"ERROR: while scanning extent tree: %d\n" , ret); - goto out; +for (n =rb_first (&info->block_group_cache_tree); n; n =rb_next (n)) { +struct btrfs_block_group *bg; + + bg = rb_entry(n, struct btrfs_block_group, cache_node); + ret =scan_extents (info, bg->start, + bg->start + bg->length -1 ); +if (ret) { +fprintf (stderr,"ERROR: while scanning extent tree: %d\n" , + ret); + goto out; + } } ret =map_implied_refs (info);
Signature · 1 line
2.26.3
PATCH v2 20/30 btrfs-progs: check: make free space tree validation extent tree v2 aware
In reply to Josef BacikThe free space tree needs to be validated against all referenced blocks in the file system, so use the btrfs_mark_used_blocks() helper to check the free space tree and free space cache against. This will do the right thing for both extent tree v1 and extent tree v2.
--- check/main.c | 90 ++++++++++++++++++---------------------------------- 1 file changed, 31 insertions(+), 59 deletions(-)
check/main.c +31 -59
@@ -5611,72 +5611,38 @@ static int check_cache_range(struct btrfs_root *root, }static int verify_space_cache (struct btrfs_root *root, -struct btrfs_block_group *cache) +struct btrfs_block_group *cache, +struct extent_io_tree *used) { -struct btrfs_path path; -struct extent_buffer *leaf; -struct btrfs_key key; -u64 last; +u64 start, end, last_end, bg_end;int ret =0 ; - root =btrfs_extent_root (root->fs_info, cache->start); + start = cache->start; + bg_end = cache->start + cache->length; + last_end = start; - last =max_t (u64, cache->start,BTRFS_SUPER_INFO_OFFSET ); - -btrfs_init_path (&path); - key.objectid = last; - key.offset =0 ; - key.type =BTRFS_EXTENT_ITEM_KEY ; - ret =btrfs_search_slot (NULL , root, &key, &path,0 ,0 ); -if (ret <0 ) - goto out; - ret =0 ; -while (1 ) { -if (path.slots[0 ] >=btrfs_header_nritems (path.nodes[0 ])) { - ret =btrfs_next_leaf (root, &path); -if (ret <0 ) - goto out; -if (ret >0 ) { - ret =0 ; -break ; - } - } - leaf = path.nodes[0 ]; -btrfs_item_key_to_cpu (leaf, &key, path.slots[0 ]); -if (key.objectid >= cache->start + cache->length) +while (start < bg_end) { + ret =find_first_extent_bit (used, cache->start, &start, &end, +EXTENT_DIRTY ); +if (ret || start >= bg_end) { + ret =0 ;break ; -if (key.type !=BTRFS_EXTENT_ITEM_KEY && - key.type !=BTRFS_METADATA_ITEM_KEY ) { - path.slots[0 ]++; -continue ; } - -if (last == key.objectid) { -if (key.type ==BTRFS_EXTENT_ITEM_KEY ) - last = key.objectid + key.offset; -else - last = key.objectid + gfs_info->nodesize; - path.slots[0 ]++; -continue ; +if (last_end < start) { + ret =check_cache_range (root, cache, last_end, + start - last_end); +if (ret) +return ret; } - - ret =check_cache_range (root, cache, last, - key.objectid - last); -if (ret) -break ; -if (key.type ==BTRFS_EXTENT_ITEM_KEY ) - last = key.objectid + key.offset; -else - last = key.objectid + gfs_info->nodesize; - path.slots[0 ]++; + end =min (end, bg_end -1 ); +clear_extent_dirty (used, start, end); + start = end +1 ; + last_end = start; } -if (last < cache->start + cache->length) - ret =check_cache_range (root, cache, last, - cache->start + cache->length - last); - -out: -btrfs_release_path (&path); +if (last_end < bg_end) + ret =check_cache_range (root, cache, last_end, + bg_end - last_end);if (!ret && !RB_EMPTY_ROOT (&cache->free_space_ctl->free_space_offset)) {
@@ -5690,11 +5656,17 @@ out:static int check_space_cache (struct btrfs_root *root) { +struct extent_io_tree used;struct btrfs_block_group *cache;u64 start =BTRFS_SUPER_INFO_OFFSET +BTRFS_SUPER_INFO_SIZE ;int ret;int error =0 ; +extent_io_tree_init (&used); + ret =btrfs_mark_used_blocks (gfs_info, &used); +if (ret) +return ret; +while (1 ) { ctx.item_count++; cache =btrfs_lookup_first_block_group (gfs_info, start);
@@ -5739,14 +5711,14 @@ static int check_space_cache(struct btrfs_root *root)continue ; } - ret =verify_space_cache (root, cache); + ret =verify_space_cache (root, cache, &used);if (ret) {fprintf (stderr,"cache appears valid but isn't %llu\n" , cache->start); error++; } } - +extent_io_tree_cleanup (&used);return error ? -EINVAL :0 ; }
Signature · 1 line
2.26.3
PATCH v2 21/30 btrfs-progs: check: add helper to reinit the root based on a key
In reply to Josef BacikIn the case of per-bg roots we may be missing the root items. To re-initialize them we want to add the root item as well as allocate the empty block. To achieve this extract out the reinit root logic to a helper that just takes the root key and then does the appropriate work to allocate an empty root and update the root item. Fix the normal reinit root helper to use this new helper.
--- check/main.c | 88 ++++++++++++++++++++++++++++++++++------------------ 1 file changed, 58 insertions(+), 30 deletions(-)
check/main.c +58 -30
@@ -9090,29 +9090,34 @@ static int do_check_chunks_and_extents(void)return ret; } -static int btrfs_fsck_reinit_root (struct btrfs_trans_handle *trans, -struct btrfs_root *root) +static struct extent_buffer *btrfs_fsck_clear_root ( +struct btrfs_trans_handle *trans, +struct btrfs_key *key) { +struct btrfs_root_item ri = {}; +struct btrfs_path *path;struct extent_buffer *c; -struct extent_buffer *old = root->node; -int level; +struct btrfs_disk_key disk_key = {};int ret; -struct btrfs_disk_key disk_key = {0 ,0 ,0 }; - level =0 ; + path =btrfs_alloc_path (); +if (!path) +return ERR_PTR (-ENOMEM ); - c =btrfs_alloc_free_block (trans, root, gfs_info->nodesize, - root->root_key.objectid, - &disk_key, level,0 ,0 ); -if (IS_ERR (c)) -return PTR_ERR (c); + c =btrfs_alloc_free_block (trans, gfs_info->tree_root, + gfs_info->nodesize, key->objectid, + &disk_key,0 ,0 ,0 ); +if (IS_ERR (c)) { +btrfs_free_path (path); +return c; + }memset_extent_buffer (c,0 ,0 ,sizeof (struct btrfs_header )); -btrfs_set_header_level (c, level); +btrfs_set_header_level (c,0 );btrfs_set_header_bytenr (c, c->start);btrfs_set_header_generation (c, trans->transid);btrfs_set_header_backref_rev (c,BTRFS_MIXED_BACKREF_REV ); -btrfs_set_header_owner (c, root->root_key.objectid); +btrfs_set_header_owner (c, key->objectid);write_extent_buffer (c, gfs_info->fs_devices->metadata_uuid,btrfs_header_fsid (),BTRFS_FSID_SIZE );
@@ -9122,25 +9127,48 @@ static int btrfs_fsck_reinit_root(struct btrfs_trans_handle *trans, BTRFS_UUID_SIZE);btrfs_mark_buffer_dirty (c); +/* -* this case can happen in the following case: -* -* reinit reloc data root, this is because we skip pin -* down reloc data tree before which means we can allocate -* same block bytenr here. +* The root item may not exist, try to insert an empty one so it exists, +* otherwise simply update the existing one with the correct settings. */ -if (old->start == c->start) { -btrfs_set_root_generation (&root->root_item, - trans->transid); - root->root_item.level =btrfs_header_level (root->node); - ret =btrfs_update_root (trans, gfs_info->tree_root, - &root->root_key, &root->root_item); -if (ret) { -free_extent_buffer (c); -return ret; - } - } -free_extent_buffer (old); + ret =btrfs_insert_empty_item (trans, gfs_info->tree_root, path, key, +sizeof (ri)); +if (ret == -EEXIST ) { +read_extent_buffer (path->nodes[0 ], &ri, +btrfs_item_ptr_offset (path->nodes[0 ], + path->slots[0 ]), +sizeof (ri)); + }else if (ret) { +btrfs_free_path (path); +free_extent_buffer (c); +return ERR_PTR (ret); + } +btrfs_set_root_bytenr (&ri, c->start); +btrfs_set_root_generation (&ri, trans->transid); +btrfs_set_root_refs (&ri,1 ); +btrfs_set_root_used (&ri, c->len); +btrfs_set_root_generation_v2 (&ri, trans->transid); + +write_extent_buffer (path->nodes[0 ], &ri, +btrfs_item_ptr_offset (path->nodes[0 ], + path->slots[0 ]), +sizeof (ri)); +btrfs_mark_buffer_dirty (path->nodes[0 ]); +btrfs_free_path (path); +return c; +} + +static int btrfs_fsck_reinit_root (struct btrfs_trans_handle *trans, +struct btrfs_root *root) +{ +struct extent_buffer *c; + + c =btrfs_fsck_clear_root (trans, &root->root_key); +if (IS_ERR (c)) +return PTR_ERR (c); + +free_extent_buffer (root->node); root->node = c;add_root_to_dirty_list (root);return 0 ;
Signature · 1 line
2.26.3
PATCH v2 22/30 btrfs-progs: check: handle the block group tree properly
In reply to Josef BacikWe need to make sure we process the block group root, and mark its blocks as used for the free space tree checking.
--- check/main.c | 27 +++++++++++++++++---------- common/repair.c | 3 +++ 2 files changed, 20 insertions(+), 10 deletions(-)
check/main.c +17 -10
@@ -8908,6 +8908,18 @@ out:return ret; } +static int load_super_root (struct list_head *head,struct btrfs_root *root) +{ +u8 level; + +if (!root) +return 0 ; + + level =btrfs_header_level (root->node); +return add_root_item_to_list (head, root->root_key.objectid, + root->node->start,0 , level,0 ,NULL ); +} +static int check_chunks_and_extents (void ) {struct rb_root dev_cache;
@@ -8926,9 +8938,7 @@ static int check_chunks_and_extents(void)int bits_nr;struct list_head dropping_trees;struct list_head normal_trees; -struct btrfs_root *root1;struct btrfs_root *root; -u8 level; root = gfs_info->fs_root; dev_cache =RB_ROOT ;
@@ -8961,16 +8971,13 @@ static int check_chunks_and_extents(void) } again: - root1 = gfs_info->tree_root; - level =btrfs_header_level (root1->node); - ret =add_root_item_to_list (&normal_trees, root1->root_key.objectid, - root1->node->start,0 , level,0 ,NULL ); + ret =load_super_root (&normal_trees, gfs_info->tree_root); +if (ret <0 ) + goto out; + ret =load_super_root (&normal_trees, gfs_info->chunk_root);if (ret <0 ) goto out; - root1 = gfs_info->chunk_root; - level =btrfs_header_level (root1->node); - ret =add_root_item_to_list (&normal_trees, root1->root_key.objectid, - root1->node->start,0 , level,0 ,NULL ); + ret =load_super_root (&normal_trees, gfs_info->block_group_root);if (ret <0 ) goto out;
common/repair.c +3 -0
@@ -149,6 +149,9 @@ int btrfs_mark_used_tree_blocks(struct btrfs_fs_info *fs_info, ret =traverse_tree_blocks (tree, fs_info->chunk_root->node,0 );if (!ret) ret =traverse_tree_blocks (tree, fs_info->tree_root->node,1 ); +if (!ret && fs_info->block_group_root) + ret =traverse_tree_blocks (tree, + fs_info->block_group_root->node,0 );return ret; }
Signature · 1 line
2.26.3
PATCH v2 23/30 btrfs-progs: load the number of global roots into the fs_info
In reply to Josef BacikWe need to know how many global roots we have in order to round robin assign block groups to their specific global root.
--- kernel-shared/ctree.h | 2 ++ kernel-shared/disk-io.c | 42 +++++++++++++++++++++++++++++++++++++++++ 2 files changed, 44 insertions(+)
kernel-shared/ctree.h +2 -0
@@ -1262,6 +1262,8 @@ struct btrfs_fs_info {u32 sectorsize;u32 stripesize; +u64 num_global_roots; +/* * Zone size > 0 when in ZONED mode, otherwise it's used for a check * if the mode is enabled
kernel-shared/disk-io.c +42 -0
54 lines not on this page · raw message
Signature · 1 line
2.26.3
PATCH v2 24/30 btrfs-progs: handle the per-block group global root id
In reply to Josef BacikWe will now be using block_group->chunk_objectid to point at the global root id for this particular block group. For now we'll assign this based on mod'ing the offset of the block group against the number of global root id's and handle the block_group_item updating appropriately.
--- kernel-shared/ctree.h | 2 ++ kernel-shared/disk-io.c | 24 ++++++++++++++++++++++-- kernel-shared/disk-io.h | 1 + kernel-shared/extent-tree.c | 24 ++++++++++++++++++++++-- kernel-shared/free-space-tree.c | 3 +++ 5 files changed, 50 insertions(+), 4 deletions(-)
kernel-shared/ctree.h +2 -0
@@ -1182,6 +1182,8 @@ struct btrfs_block_group {*/ u64 alloc_offset;u64 write_offset; + +u64 global_root_id; };struct btrfs_device ;
kernel-shared/disk-io.c +22 -2
@@ -798,13 +798,33 @@ struct btrfs_root *btrfs_global_root(struct btrfs_fs_info *fs_info,return NULL ; } +u64 btrfs_global_root_id (struct btrfs_fs_info *fs_info,u64 bytenr) +{ +struct btrfs_block_group *block_group; +u64 ret =0 ; + +if (!btrfs_fs_incompat (fs_info,EXTENT_TREE_V2 )) +return ret; + +/* +* We use this because we won't have this many global roots, and -1 is +* special, so we need something that'll not be found if we have any +* errors from here on. +*/ + ret =BTRFS_LAST_FREE_OBJECTID ; + block_group =btrfs_lookup_first_block_group (fs_info, bytenr); +if (block_group) + ret = block_group->global_root_id; +return ret; +} +struct btrfs_root *btrfs_csum_root (struct btrfs_fs_info *fs_info,u64 bytenr) {struct btrfs_key key = { .objectid =BTRFS_CSUM_TREE_OBJECTID , .type =BTRFS_ROOT_ITEM_KEY , - .offset =0 , + .offset =btrfs_global_root_id (fs_info, bytenr), };return btrfs_global_root (fs_info, &key);
@@ -816,7 +836,7 @@ struct btrfs_root *btrfs_extent_root(struct btrfs_fs_info *fs_info,struct btrfs_key key = { .objectid =BTRFS_EXTENT_TREE_OBJECTID , .type =BTRFS_ROOT_ITEM_KEY , - .offset =0 , + .offset =btrfs_global_root_id (fs_info, bytenr), };return btrfs_global_root (fs_info, &key);
kernel-shared/disk-io.h +1 -0
@@ -221,6 +221,7 @@ struct btrfs_root *btrfs_csum_root(struct btrfs_fs_info *fs_info, u64 bytenr);struct btrfs_root *btrfs_extent_root (struct btrfs_fs_info *fs_inf,u64 bytenr);struct btrfs_root *btrfs_global_root (struct btrfs_fs_info *fs_info,struct btrfs_key *key); +u64 btrfs_global_root_id (struct btrfs_fs_info *fs_info,u64 bytenr);int btrfs_global_root_insert (struct btrfs_fs_info *fs_info,struct btrfs_root *root);
kernel-shared/extent-tree.c +22 -2
@@ -1561,7 +1561,7 @@ static int update_block_group_item(struct btrfs_trans_handle *trans,btrfs_set_stack_block_group_used (&bgi, cache->used);btrfs_set_stack_block_group_flags (&bgi, cache->flags);btrfs_set_stack_block_group_chunk_objectid (&bgi, -BTRFS_FIRST_CHUNK_TREE_OBJECTID ); + cache->global_root_id);write_extent_buffer (leaf, &bgi, bi,sizeof (bgi));btrfs_mark_buffer_dirty (leaf); fail:
@@ -2658,6 +2658,7 @@ static int read_block_group_item(struct btrfs_block_group *cache, sizeof(bgi)); cache->used =btrfs_stack_block_group_used (&bgi); cache->flags =btrfs_stack_block_group_flags (&bgi); + cache->global_root_id =btrfs_stack_block_group_chunk_objectid (&bgi);return 0 ; }
@@ -2765,6 +2766,24 @@ error:return ret; } +/* +* For extent tree v2 we use the block_group_item->chunk_offset to point at our +* global root id. For v1 it's always set to BTRFS_FIRST_CHUNK_TREE_OBJECTID. +*/ +static u64 calculate_global_root_id (struct btrfs_fs_info *fs_info,u64 offset) +{ +u64 div =SZ_1G ; + +if (!btrfs_fs_incompat (fs_info,EXTENT_TREE_V2 )) +return BTRFS_FIRST_CHUNK_TREE_OBJECTID ; + +/* If we have a smaller fs index based on 128m. */ +if (btrfs_super_total_bytes (fs_info->super_copy) <= (SZ_1G *10ULL )) + div =SZ_128M ; + +return (div_u64 (offset, div) % fs_info->num_global_roots); +} +struct btrfs_block_group *btrfs_add_block_group (struct btrfs_fs_info *fs_info,u64 bytes_used,u64 type,u64 chunk_offset,u64 size)
@@ -2776,6 +2795,7 @@ btrfs_add_block_group(struct btrfs_fs_info *fs_info, u64 bytes_used, u64 type,BUG_ON (!cache); cache->start = chunk_offset; cache->length = size; + cache->global_root_id =calculate_global_root_id (fs_info, chunk_offset); ret =btrfs_load_block_group_zone_info (fs_info, cache);BUG_ON (ret);
@@ -2806,7 +2826,7 @@ static int insert_block_group_item(struct btrfs_trans_handle *trans,btrfs_set_stack_block_group_used (&bgi, block_group->used);btrfs_set_stack_block_group_chunk_objectid (&bgi, -BTRFS_FIRST_CHUNK_TREE_OBJECTID ); + block_group->global_root_id);btrfs_set_stack_block_group_flags (&bgi, block_group->flags); key.objectid = block_group->start; key.type =BTRFS_BLOCK_GROUP_ITEM_KEY ;
kernel-shared/free-space-tree.c +3 -0
@@ -34,6 +34,9 @@ static struct btrfs_root *btrfs_free_space_root(struct btrfs_fs_info *fs_info, .offset = 0, }; +if (btrfs_fs_incompat (fs_info,EXTENT_TREE_V2 )) + key.offset = block_group->global_root_id; +return btrfs_global_root (fs_info, &key); }
Signature · 1 line
2.26.3
PATCH v2 25/30 btrfs-progs: add a btrfs_delete_and_free_root helper
In reply to Josef BacikThe free space tree code already does this, but we need it for cleaning up per block group roots. Abstract this code out into a helper so that we can use it in multiple places in the future.
--- kernel-shared/disk-io.c | 25 +++++++++++++++++++++++++ kernel-shared/disk-io.h | 2 ++ kernel-shared/free-space-tree.c | 24 +++--------------------- 3 files changed, 30 insertions(+), 21 deletions(-)
kernel-shared/disk-io.c +25 -0
@@ -2367,6 +2367,31 @@ int btrfs_set_buffer_uptodate(struct extent_buffer *eb)return set_extent_buffer_uptodate (eb); } +int btrfs_delete_and_free_root (struct btrfs_trans_handle *trans, +struct btrfs_root *root) +{ +struct btrfs_fs_info *fs_info = root->fs_info; +struct btrfs_root *tree_root = fs_info->tree_root; +int ret; + + ret =btrfs_del_root (trans, tree_root, &root->root_key); +if (ret) +return ret; + +list_del (&root->dirty_list); + ret =clean_tree_block (root->node); +if (ret) +return ret; + ret =btrfs_free_tree_block (trans, root, root->node,0 ,1 ); +if (ret) +return ret; +rb_erase (&root->rb_node, &fs_info->global_roots_tree); +free_extent_buffer (root->node); +free_extent_buffer (root->commit_root); +kfree (root); +return 0 ; +} +struct btrfs_root *btrfs_create_tree (struct btrfs_trans_handle *trans,struct btrfs_fs_info *fs_info,u64 objectid)
kernel-shared/disk-io.h +2 -0
@@ -217,6 +217,8 @@ int btrfs_fs_roots_compare_roots(struct rb_node *node1, struct rb_node *node2);struct btrfs_root *btrfs_create_tree (struct btrfs_trans_handle *trans,struct btrfs_fs_info *fs_info,u64 objectid); +int btrfs_delete_and_free_root (struct btrfs_trans_handle *trans, +struct btrfs_root *root);struct btrfs_root *btrfs_csum_root (struct btrfs_fs_info *fs_info,u64 bytenr);struct btrfs_root *btrfs_extent_root (struct btrfs_fs_info *fs_inf,u64 bytenr); struct btrfs_root *btrfs_global_root(struct btrfs_fs_info *fs_info,
kernel-shared/free-space-tree.c +3 -21
@@ -1257,27 +1257,9 @@ int btrfs_clear_free_space_tree(struct btrfs_fs_info *fs_info)if (ret) goto abort; - ret =btrfs_del_root (trans, tree_root, &free_space_root->root_key); -if (ret) - goto abort; - -list_del (&free_space_root->dirty_list); - - ret =clean_tree_block (free_space_root->node); -if (ret) - goto abort; - ret =btrfs_free_tree_block (trans, free_space_root, - free_space_root->node,0 ,1 ); -if (ret) - goto abort; - -rb_erase (&free_space_root->rb_node, &fs_info->global_roots_tree); -free_extent_buffer (free_space_root->node); -free_extent_buffer (free_space_root->commit_root); -kfree (free_space_root); - - ret =btrfs_commit_transaction (trans, tree_root); - + ret =btrfs_delete_and_free_root (trans, free_space_root); +if (!ret) + ret =btrfs_commit_transaction (trans, tree_root); abort:return ret; }
Signature · 1 line
2.26.3
PATCH v2 26/30 btrfs-progs: make btrfs_clear_free_space_tree extent tree v2 aware
In reply to Josef BacikWith extent tree v2 we'll have multiple free space trees, and we can't just unset the feature flags for the free space tree. Fix this to loop through all of the free space trees and clear them out properly.
--- kernel-shared/free-space-tree.c | 37 ++++++++++++++++++++++++--------- 1 file changed, 27 insertions(+), 10 deletions(-)
kernel-shared/free-space-tree.c +27 -10
@@ -1248,18 +1248,35 @@ int btrfs_clear_free_space_tree(struct btrfs_fs_info *fs_info)if (IS_ERR (trans))return PTR_ERR (trans); - features =btrfs_super_compat_ro_flags (fs_info->super_copy); - features &= ~(BTRFS_FEATURE_COMPAT_RO_FREE_SPACE_TREE_VALID | -BTRFS_FEATURE_COMPAT_RO_FREE_SPACE_TREE ); -btrfs_set_super_compat_ro_flags (fs_info->super_copy, features); +if (btrfs_fs_incompat (fs_info,EXTENT_TREE_V2 )) { +struct btrfs_key key = { + .objectid =BTRFS_FREE_SPACE_TREE_OBJECTID , + .type =BTRFS_ROOT_ITEM_KEY , + .offset =0 , + }; + +while (key.offset < fs_info->num_global_roots) { + free_space_root =btrfs_global_root (fs_info, &key); + ret =clear_free_space_tree (trans, free_space_root); +if (ret) + goto abort; + key.offset++; + } + }else { + features =btrfs_super_compat_ro_flags (fs_info->super_copy); + features &= ~(BTRFS_FEATURE_COMPAT_RO_FREE_SPACE_TREE_VALID | +BTRFS_FEATURE_COMPAT_RO_FREE_SPACE_TREE ); +btrfs_set_super_compat_ro_flags (fs_info->super_copy, features); - ret =clear_free_space_tree (trans, free_space_root); -if (ret) - goto abort; + ret =clear_free_space_tree (trans, free_space_root); +if (ret) + goto abort; - ret =btrfs_delete_and_free_root (trans, free_space_root); -if (!ret) - ret =btrfs_commit_transaction (trans, tree_root); + ret =btrfs_delete_and_free_root (trans, free_space_root); +if (ret) + goto abort; + } + ret =btrfs_commit_transaction (trans, tree_root); abort:return ret; }
Signature · 1 line
2.26.3
PATCH v2 27/30 btrfs-progs: make btrfs_create_tree take a key for the root key
In reply to Josef BacikWe're going to start create global roots from mkfs, and we need to have a offset set for the root key. Make the btrfs_create_tree() take a key for the root_key instead of just the objectid so we can setup these new style roots properly.
--- kernel-shared/disk-io.c | 21 ++++++++------------- kernel-shared/disk-io.h | 2 +- kernel-shared/free-space-tree.c | 7 +++++-- mkfs/main.c | 13 ++++++++++--- 4 files changed, 24 insertions(+), 19 deletions(-)
kernel-shared/disk-io.c +8 -13
@@ -2394,25 +2394,22 @@ int btrfs_delete_and_free_root(struct btrfs_trans_handle *trans,struct btrfs_root *btrfs_create_tree (struct btrfs_trans_handle *trans,struct btrfs_fs_info *fs_info, -u64 objectid) +struct btrfs_key *key) {struct extent_buffer *leaf;struct btrfs_root *tree_root = fs_info->tree_root;struct btrfs_root *root; -struct btrfs_key key;int ret =0 ; root =kzalloc (sizeof (*root),GFP_KERNEL );if (!root)return ERR_PTR (-ENOMEM ); -btrfs_setup_root (root, fs_info, objectid); - root->root_key.objectid = objectid; - root->root_key.type =BTRFS_ROOT_ITEM_KEY ; - root->root_key.offset =0 ; +btrfs_setup_root (root, fs_info, key->objectid); +memcpy (&root->root_key, key,sizeof (struct btrfs_key )); - leaf =btrfs_alloc_free_block (trans, root, fs_info->nodesize, objectid, -NULL ,0 ,0 ,0 ); + leaf =btrfs_alloc_free_block (trans, root, fs_info->nodesize, + root->root_key.objectid,NULL ,0 ,0 ,0 );if (IS_ERR (leaf)) { ret =PTR_ERR (leaf); leaf =NULL ;
@@ -2423,7 +2420,7 @@ struct btrfs_root *btrfs_create_tree(struct btrfs_trans_handle *trans,btrfs_set_header_bytenr (leaf, leaf->start);btrfs_set_header_generation (leaf, trans->transid);btrfs_set_header_backref_rev (leaf,BTRFS_MIXED_BACKREF_REV ); -btrfs_set_header_owner (leaf, objectid); +btrfs_set_header_owner (leaf, root->root_key.objectid); root->node = leaf;write_extent_buffer (leaf, fs_info->fs_devices->metadata_uuid,btrfs_header_fsid (),BTRFS_FSID_SIZE );
@@ -2448,10 +2445,8 @@ struct btrfs_root *btrfs_create_tree(struct btrfs_trans_handle *trans,memset (root->root_item.uuid,0 ,BTRFS_UUID_SIZE ); root->root_item.drop_level =0 ; - key.objectid = objectid; - key.type =BTRFS_ROOT_ITEM_KEY ; - key.offset =0 ; - ret =btrfs_insert_root (trans, tree_root, &key, &root->root_item); + ret =btrfs_insert_root (trans, tree_root, &root->root_key, + &root->root_item);if (ret) goto fail;
kernel-shared/disk-io.h +1 -1
@@ -216,7 +216,7 @@ int write_and_map_eb(struct btrfs_fs_info *fs_info, struct extent_buffer *eb);int btrfs_fs_roots_compare_roots (struct rb_node *node1,struct rb_node *node2);struct btrfs_root *btrfs_create_tree (struct btrfs_trans_handle *trans,struct btrfs_fs_info *fs_info, -u64 objectid); +struct btrfs_key *key);int btrfs_delete_and_free_root (struct btrfs_trans_handle *trans,struct btrfs_root *root);struct btrfs_root *btrfs_csum_root (struct btrfs_fs_info *fs_info,u64 bytenr);
kernel-shared/free-space-tree.c +5 -2
@@ -1475,14 +1475,17 @@ int btrfs_create_free_space_tree(struct btrfs_fs_info *fs_info)struct btrfs_root *free_space_root;struct btrfs_block_group *block_group;u64 start =BTRFS_SUPER_INFO_OFFSET +BTRFS_SUPER_INFO_SIZE ; +struct btrfs_key root_key = { + .objectid =BTRFS_FREE_SPACE_TREE_OBJECTID , + .type =BTRFS_ROOT_ITEM_KEY , + };int ret; trans =btrfs_start_transaction (tree_root,0 );if (IS_ERR (trans))return PTR_ERR (trans); - free_space_root =btrfs_create_tree (trans, fs_info, -BTRFS_FREE_SPACE_TREE_OBJECTID ); + free_space_root =btrfs_create_tree (trans, fs_info, &root_key);if (IS_ERR (free_space_root)) { ret =PTR_ERR (free_space_root); goto abort;
mkfs/main.c +10 -3
@@ -717,12 +717,15 @@ static int create_data_reloc_tree(struct btrfs_trans_handle *trans)struct btrfs_inode_item *inode;struct btrfs_root *root;struct btrfs_path path; -struct btrfs_key key; +struct btrfs_key key = { + .objectid =BTRFS_DATA_RELOC_TREE_OBJECTID , + .type =BTRFS_ROOT_ITEM_KEY , + };u64 ino =BTRFS_FIRST_FREE_OBJECTID ;char *name =".." ;int ret; - root =btrfs_create_tree (trans, fs_info,BTRFS_DATA_RELOC_TREE_OBJECTID ); + root =btrfs_create_tree (trans, fs_info, &key);if (IS_ERR (root)) { ret =PTR_ERR (root); goto out;
@@ -782,10 +785,14 @@ static int create_uuid_tree(struct btrfs_trans_handle *trans) {struct btrfs_fs_info *fs_info = trans->fs_info;struct btrfs_root *root; +struct btrfs_key key = { + .objectid =BTRFS_UUID_TREE_OBJECTID , + .type =BTRFS_ROOT_ITEM_KEY , + };int ret =0 ;ASSERT (fs_info->uuid_root ==NULL ); - root =btrfs_create_tree (trans, fs_info,BTRFS_UUID_TREE_OBJECTID ); + root =btrfs_create_tree (trans, fs_info, &key);if (IS_ERR (root)) { ret =PTR_ERR (root); goto out;
Signature · 1 line
2.26.3
PATCH v2 28/30 btrfs-progs: mkfs: set chunk_item_objectid properly for extent tree v2
In reply to Josef BacikOur initial block group will use global root id 0 with extent tree v2, so adjust the helper to take the chunk_objectid as an argument, as we'll set this to 0 for extent tree v2 and then BTRFS_FIRST_CHUNK_TREE_OBJECTID for extent tree v1.
--- mkfs/common.c | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-)
mkfs/common.c +4 -4
@@ -192,7 +192,7 @@ static int create_free_space_tree(int fd, struct btrfs_mkfs_config *cfg,static void write_block_group_item (struct extent_buffer *buf,u32 nr,u64 objectid,u64 offset,u64 used, -u32 itemoff) +u64 chunk_objectid,u32 itemoff) {struct btrfs_block_group_item *bg_item;struct btrfs_disk_key disk_key;
@@ -207,8 +207,7 @@ static void write_block_group_item(struct extent_buffer *buf, u32 nr, bg_item = btrfs_item_ptr(buf, nr, struct btrfs_block_group_item);btrfs_set_block_group_used (buf, bg_item, used);btrfs_set_block_group_flags (buf, bg_item,BTRFS_BLOCK_GROUP_SYSTEM ); -btrfs_set_block_group_chunk_objectid (buf, bg_item, -BTRFS_FIRST_CHUNK_TREE_OBJECTID ); +btrfs_set_block_group_chunk_objectid (buf, bg_item, chunk_objectid); } static int create_block_group_tree(int fd, struct btrfs_mkfs_config *cfg,
@@ -219,7 +218,7 @@ static int create_block_group_tree(int fd, struct btrfs_mkfs_config *cfg,memset (buf->data +sizeof (struct btrfs_header ),0 , cfg->nodesize -sizeof (struct btrfs_header )); -write_block_group_item (buf,0 , bg_offset, bg_size, bg_used, +write_block_group_item (buf,0 , bg_offset, bg_size, bg_used,0 ,__BTRFS_LEAF_DATA_SIZE (cfg->nodesize) -sizeof (struct btrfs_block_group_item ));btrfs_set_header_bytenr (buf, cfg->blocks[MKFS_BLOCK_GROUP_TREE ]);
@@ -404,6 +403,7 @@ int make_btrfs(int fd, struct btrfs_mkfs_config *cfg)write_block_group_item (buf, nritems, system_group_offset, system_group_size, total_used, +BTRFS_FIRST_CHUNK_TREE_OBJECTID , itemoff); add_block_group = false; nritems++;
Signature · 1 line
2.26.3
PATCH v2 29/30 btrfs-progs: mkfs: create the global root's
In reply to Josef BacikNow that we have all of the supporting code, add the ability to create all of the global roots for an extent tree v2 fs. This will default to nr_cpu's, but also allow the user to specify how many global roots they would like.
--- mkfs/main.c | 68 ++++++++++++++++++++++++++++++++++++++++++++++++++++- 1 file changed, 67 insertions(+), 1 deletion(-)
mkfs/main.c +67 -1
@@ -810,6 +810,50 @@ out:return ret; } +static int create_global_root (struct btrfs_trans_handle *trans,u64 objectid, +int root_id) +{ +struct btrfs_fs_info *fs_info = trans->fs_info; +struct btrfs_root *root; +struct btrfs_key key = { + .objectid = objectid, + .type =BTRFS_ROOT_ITEM_KEY , + .offset = root_id, + }; +int ret =0 ; + + root =btrfs_create_tree (trans, fs_info, &key); +if (IS_ERR (root)) { + ret =PTR_ERR (root); + goto out; + } + ret =btrfs_global_root_insert (fs_info, root); +out: +if (ret) +btrfs_abort_transaction (trans, ret); +return ret; +} + +static int create_global_roots (struct btrfs_trans_handle *trans, +int nr_global_roots) +{ +int ret, i; + +for (i =1 ; i < nr_global_roots; i++) { + ret =create_global_root (trans,BTRFS_EXTENT_TREE_OBJECTID , i); +if (ret) +return ret; + ret =create_global_root (trans,BTRFS_CSUM_TREE_OBJECTID , i); +if (ret) +return ret; + ret =create_global_root (trans,BTRFS_FREE_SPACE_TREE_OBJECTID , i); +if (ret) +return ret; + } + +return 0 ; +} +static int insert_qgroup_items (struct btrfs_trans_handle *trans,struct btrfs_fs_info *fs_info,u64 qgroupid)
@@ -966,13 +1010,18 @@ int BOX_MAIN(mkfs)(int argc, char **argv)struct btrfs_mkfs_config mkfs_cfg;enum btrfs_csum_type csum_type =BTRFS_CSUM_TYPE_CRC32 ;u64 system_group_size; +int nr_global_roots =sysconf (_SC_NPROCESSORS_ONLN);crc32c_optimization_init ();btrfs_config_init ();while (1 ) {int c; -enum {GETOPT_VAL_SHRINK =257 ,GETOPT_VAL_CHECKSUM }; +enum { +GETOPT_VAL_SHRINK =257 , +GETOPT_VAL_CHECKSUM , +GETOPT_VAL_GLOBAL_ROOTS , + };static const struct option long_options[] = { {"byte-count" , required_argument,NULL ,'b' }, {"csum" , required_argument,NULL ,
@@ -996,6 +1045,7 @@ int BOX_MAIN(mkfs)(int argc, char **argv) { "quiet", 0, NULL, 'q' }, { "verbose", 0, NULL, 'v' }, { "shrink", no_argument, NULL, GETOPT_VAL_SHRINK }, + { "num-global-roots", required_argument, NULL, GETOPT_VAL_GLOBAL_ROOTS }, { "help", no_argument, NULL, GETOPT_VAL_HELP }, { NULL, 0, NULL, 0} };
@@ -1100,6 +1150,9 @@ int BOX_MAIN(mkfs)(int argc, char **argv)case GETOPT_VAL_CHECKSUM : csum_type =parse_csum_type (optarg);break ; +case GETOPT_VAL_GLOBAL_ROOTS : + nr_global_roots = (int )arg_strtou64 (optarg); +break ;case GETOPT_VAL_HELP :default :print_usage (c !=GETOPT_VAL_HELP );
@@ -1239,6 +1292,11 @@ int BOX_MAIN(mkfs)(int argc, char **argv)if (features &BTRFS_FEATURE_INCOMPAT_EXTENT_TREE_V2 ) { features |=BTRFS_FEATURE_INCOMPAT_NO_HOLES ; runtime_features |=BTRFS_RUNTIME_FEATURE_FREE_SPACE_TREE ; + +if (!nr_global_roots) { +error ("you must set a non-zero num-global-roots value" ); +exit (1 ); + } }if (zoned) {
@@ -1466,6 +1524,14 @@ int BOX_MAIN(mkfs)(int argc, char **argv) goto error; } +if (features &BTRFS_FEATURE_INCOMPAT_EXTENT_TREE_V2 ) { + ret =create_global_roots (trans, nr_global_roots); +if (ret) { +error ("failed to create global roots: %d" , ret); + goto error; + } + } + ret =make_root_dir (trans, root);if (ret) {error ("failed to setup the root directory: %d" , ret);
Signature · 1 line
2.26.3
Re: [PATCH v2 29/30] btrfs-progs: mkfs: create the global root's
Quoted 21 lines · Josef Bacik
mkfs/main.c +6
-1@@ -966,13 +1010,18 @@ int BOX_MAIN(mkfs)(int argc, char **argv)struct btrfs_mkfs_config mkfs_cfg;enum btrfs_csum_type csum_type =BTRFS_CSUM_TYPE_CRC32 ;u64 system_group_size; +int nr_global_roots =sysconf (_SC_NPROCESSORS_ONLN);crc32c_optimization_init ();btrfs_config_init ();while (1 ) {int c; -enum {GETOPT_VAL_SHRINK =257 ,GETOPT_VAL_CHECKSUM }; +enum { +GETOPT_VAL_SHRINK =257 , +GETOPT_VAL_CHECKSUM , +GETOPT_VAL_GLOBAL_ROOTS , + };static const struct option long_options[] = { {"byte-count" , required_argument,NULL ,'b' }, {"csum" , required_argument,NULL ,
mkfs/main.c int BOX_MAIN(mkfs)(int argc, char **argv) · line 1048
Quoted 4 lines
mkfs/main.c +1
-0@@ -996,6 +1045,7 @@ int BOX_MAIN(mkfs)(int argc, char **argv) { "quiet", 0, NULL, 'q' }, { "verbose", 0, NULL, 'v' }, { "shrink", no_argument, NULL, GETOPT_VAL_SHRINK }, + { "num-global-roots", required_argument, NULL, GETOPT_VAL_GLOBAL_ROOTS },
This will be good under the #ifdef EXPERIMENTAL too, so we don't accidentaly expose it, the rest of the option handling code can stay as it would be unreachable.
No need to resend, a separate patch is ok for that.
Quoted 3 lines
mkfs/main.c +0
-0{ "help", no_argument, NULL, GETOPT_VAL_HELP }, { NULL, 0, NULL, 0} };
PATCH v3 1/1 btrfs-progs: mkfs: create the global root's
Now that we have all of the supporting code, add the ability to create all of the global roots for an extent tree v2 fs. This will default to nr_cpu's, but also allow the user to specify how many global roots they would like.
---v2->v3:
- Added the EXPERIMENTAL block around --num-global-roots.
mkfs/main.c | 70 ++++++++++++++++++++++++++++++++++++++++++++++++++++- 1 file changed, 69 insertions(+), 1 deletion(-)
mkfs/main.c +69 -1
@@ -810,6 +810,50 @@ out:return ret; } +static int create_global_root (struct btrfs_trans_handle *trans,u64 objectid, +int root_id) +{ +struct btrfs_fs_info *fs_info = trans->fs_info; +struct btrfs_root *root; +struct btrfs_key key = { + .objectid = objectid, + .type =BTRFS_ROOT_ITEM_KEY , + .offset = root_id, + }; +int ret =0 ; + + root =btrfs_create_tree (trans, fs_info, &key); +if (IS_ERR (root)) { + ret =PTR_ERR (root); + goto out; + } + ret =btrfs_global_root_insert (fs_info, root); +out: +if (ret) +btrfs_abort_transaction (trans, ret); +return ret; +} + +static int create_global_roots (struct btrfs_trans_handle *trans, +int nr_global_roots) +{ +int ret, i; + +for (i =1 ; i < nr_global_roots; i++) { + ret =create_global_root (trans,BTRFS_EXTENT_TREE_OBJECTID , i); +if (ret) +return ret; + ret =create_global_root (trans,BTRFS_CSUM_TREE_OBJECTID , i); +if (ret) +return ret; + ret =create_global_root (trans,BTRFS_FREE_SPACE_TREE_OBJECTID , i); +if (ret) +return ret; + } + +return 0 ; +} +static int insert_qgroup_items (struct btrfs_trans_handle *trans,struct btrfs_fs_info *fs_info,u64 qgroupid)
@@ -966,13 +1010,18 @@ int BOX_MAIN(mkfs)(int argc, char **argv)struct btrfs_mkfs_config mkfs_cfg;enum btrfs_csum_type csum_type =BTRFS_CSUM_TYPE_CRC32 ;u64 system_group_size; +int nr_global_roots =sysconf (_SC_NPROCESSORS_ONLN);crc32c_optimization_init ();btrfs_config_init ();while (1 ) {int c; -enum {GETOPT_VAL_SHRINK =257 ,GETOPT_VAL_CHECKSUM }; +enum { +GETOPT_VAL_SHRINK =257 , +GETOPT_VAL_CHECKSUM , +GETOPT_VAL_GLOBAL_ROOTS , + };static const struct option long_options[] = { {"byte-count" , required_argument,NULL ,'b' }, {"csum" , required_argument,NULL ,
@@ -996,6 +1045,9 @@ int BOX_MAIN(mkfs)(int argc, char **argv) { "quiet", 0, NULL, 'q' }, { "verbose", 0, NULL, 'v' }, { "shrink", no_argument, NULL, GETOPT_VAL_SHRINK }, +#if EXPERIMENTAL + { "num-global-roots", required_argument, NULL, GETOPT_VAL_GLOBAL_ROOTS }, +#endif { "help", no_argument, NULL, GETOPT_VAL_HELP }, { NULL, 0, NULL, 0} };
@@ -1100,6 +1152,9 @@ int BOX_MAIN(mkfs)(int argc, char **argv)case GETOPT_VAL_CHECKSUM : csum_type =parse_csum_type (optarg);break ; +case GETOPT_VAL_GLOBAL_ROOTS : + nr_global_roots = (int )arg_strtou64 (optarg); +break ;case GETOPT_VAL_HELP :default :print_usage (c !=GETOPT_VAL_HELP );
@@ -1239,6 +1294,11 @@ int BOX_MAIN(mkfs)(int argc, char **argv)if (features &BTRFS_FEATURE_INCOMPAT_EXTENT_TREE_V2 ) { features |=BTRFS_FEATURE_INCOMPAT_NO_HOLES ; runtime_features |=BTRFS_RUNTIME_FEATURE_FREE_SPACE_TREE ; + +if (!nr_global_roots) { +error ("you must set a non-zero num-global-roots value" ); +exit (1 ); + } }if (zoned) {
@@ -1466,6 +1526,14 @@ int BOX_MAIN(mkfs)(int argc, char **argv) goto error; } +if (features &BTRFS_FEATURE_INCOMPAT_EXTENT_TREE_V2 ) { + ret =create_global_roots (trans, nr_global_roots); +if (ret) { +error ("failed to create global roots: %d" , ret); + goto error; + } + } + ret =make_root_dir (trans, root);if (ret) {error ("failed to setup the root directory: %d" , ret);
Signature · 1 line
2.26.3
PATCH v2 30/30 btrfs-progs: check: don't do the root item check for extent tree v2
In reply to Josef BacikWith the current set of changes we could probably do this check, but it would involve changing the code quite a bit, and in the future we're not going to track the metadata in the extent tree at all. Since this check was for a very old kernel just skip it for extent tree v2.
--- check/main.c | 3 +++ 1 file changed, 3 insertions(+)
check/main.c +3 -0
@@ -10065,6 +10065,9 @@ static int repair_root_items(void)int bad_roots =0 ;int need_trans =0 ; +if (btrfs_fs_incompat (gfs_info,EXTENT_TREE_V2 )) +return 0 ; +btrfs_init_path (&path); ret =build_roots_info_cache ();
Signature · 1 line
2.26.3