btrfs-progs: sync ctree.c into btrfs-progs
Subsystems (2)
cover btrfs-progs: sync ctree.c into btrfs-progs
Hello,
This is a long series, and it depends on the following series
btrfs-progs: prep work for syncing files into kernel-shared
btrfs-progs: sync basic code from the kernel
btrfs-progs: prep work for syncing ctree.c
btrfs-progs: more prep work for syncing ctree.c
This is even more more prep work for syncing ctree.c, and the last patch is the actual sync. A lot of these prep patches are updating the callers to match the current calling conventions in the kernel to make the syncing straightforward.
This entire series passes our tests. Thanks,
Josef
Josef Bacik (26):
btrfs-progs: stop using add_root_to_dirty_list in check
btrfs-progs: remove useless add_root_to_dirty_list call in mkfs
btrfs-progs: remove add_root_to_dirty_list call when creating free
space tree
btrfs-progs: make add_root_to_dirty_list static and unexport it
btrfs-progs: pass btrfs_trans_handle through btrfs_clear_buffer_dirty
btrfs-progs: update read_node_slot to match the kernel definition
btrfs-progs: update btrfs_bin_search to match the kernel definition
btrfs-progs: update btrfs_set_item_key_safe to match kernel definition
btrfs-progs: update btrfs_print_leaf to match the kernel definition
btrfs-progs: update btrfs_truncate_item to match the kernel definition
btrfs-progs: update btrfs_extend_item to match the kernel definition
btrfs-progs: sync memcpy_extent_buffer from the kernel
btrfs-progs: change how we check supported csum type
btrfs-progs: drop btrfs_init_path
btrfs-progs: move btrfs_set_item_key_unsafe to check/
btrfs-progs: move btrfs_record_file_extent and code into a new file
btrfs-progs: make a local copy of btrfs_next_sibling_block in
print-tree.c
btrfs-progs: don't set the ->commit_root in btrfs_create_tree
btrfs-progs: remove btrfs_create_root
btrfs-progs: move btrfs_uuid_tree_add into mkfs/main.c
btrfs-progs: make btrfs_del_ptr a void
btrfs-progs: replace blocksize with parent argument for
btrfs_alloc_tree_block
btrfs-progs: use path->search_for_extension
btrfs-progs: add write_extent_buffer_chunk_tree_uuid helper
btrfs-progs: init new tree blocks in btrfs_alloc_tree_block
btrfs-progs: sync ctree.c from the kernel
Makefile | 1 + btrfs-corrupt-block.c | 1 + btrfs-map-logical.c | 1 + check/clear-cache.c | 10 +- check/main.c | 114 +- check/mode-common.c | 35 +- check/mode-lowmem.c | 84 +- check/qgroup-verify.c | 14 +- check/repair.c | 50 +- check/repair.h | 5 + cmds/inspect-dump-tree.c | 5 +- cmds/inspect-tree-stats.c | 3 +- cmds/rescue-chunk-recover.c | 16 +- cmds/rescue.c | 2 +- cmds/restore.c | 26 +- common/extent-tree-utils.c | 282 ++ common/extent-tree-utils.h | 28 + convert/main.c | 10 +- convert/source-fs.c | 5 +- image/main.c | 13 +- include/kerncompat.h | 80 + kernel-lib/trace.h | 8 + kernel-shared/ctree.c | 4848 ++++++++++++++++++++---------- kernel-shared/ctree.h | 138 +- kernel-shared/dir-item.c | 4 +- kernel-shared/disk-io.c | 36 +- kernel-shared/extent-tree.c | 281 +- kernel-shared/extent_io.c | 16 +- kernel-shared/extent_io.h | 9 +- kernel-shared/file-item.c | 15 +- kernel-shared/file.c | 3 +- kernel-shared/free-space-cache.c | 4 +- kernel-shared/free-space-tree.c | 1 - kernel-shared/inode-item.c | 5 +- kernel-shared/inode.c | 5 +- kernel-shared/locking.c | 6 +- kernel-shared/print-tree.c | 62 +- kernel-shared/print-tree.h | 7 +- kernel-shared/transaction.c | 9 +- kernel-shared/volumes.c | 6 +- mkfs/main.c | 89 +- mkfs/rootdir.c | 11 +- quick-test.c | 6 +- tune/change-csum.c | 23 +- tune/change-uuid.c | 6 +- tune/convert-bgt.c | 13 +- 46 files changed, 4245 insertions(+), 2151 deletions(-) create mode 100644 common/extent-tree-utils.c create mode 100644 common/extent-tree-utils.h
Signature · 1 line
2.40.0
PATCH 1/26 btrfs-progs: stop using add_root_to_dirty_list in check
This is used to make sure the root is updated in the tree_root when we re-init the root, however this function is static in the kernel and doesn't need to be exported for any reason. Simply update the root item and then update it in the tree_root instead of adding it to the dirty list.
--- check/main.c | 8 ++++++-- 1 file changed, 6 insertions(+), 2 deletions(-)
check/main.c +6 -2
@@ -9163,8 +9163,12 @@ static int btrfs_fsck_reinit_root(struct btrfs_trans_handle *trans,free_extent_buffer (root->node); root->node = c; -add_root_to_dirty_list (root); -return 0 ; + +btrfs_set_root_bytenr (&root->root_item, c->start); +btrfs_set_root_generation (&root->root_item, trans->transid); + +return btrfs_update_root (trans, gfs_info->tree_root, &root->root_key, + &root->root_item); }static int reset_block_groups (void )
Signature · 1 line
2.40.0
PATCH 2/26 btrfs-progs: remove useless add_root_to_dirty_list call in mkfs
In reply to Josef BacikWe are calling this when creating the UUID tree, however when we create the tree it inserts the root item into the tree_root, so this call is superfluous.
--- mkfs/main.c | 1 - 1 file changed, 1 deletion(-)
mkfs/main.c +0 -1
@@ -789,7 +789,6 @@ static int create_uuid_tree(struct btrfs_trans_handle *trans) goto out; } -add_root_to_dirty_list (root); fs_info->uuid_root = root; ret = btrfs_uuid_tree_add(trans, fs_info->fs_root->root_item.uuid, BTRFS_UUID_KEY_SUBVOL,
Signature · 1 line
2.40.0
PATCH 3/26 btrfs-progs: remove add_root_to_dirty_list call when creating free space tree
In reply to Josef BacikSince we insert the free space tree item into the tree_root when we create the tree we don't need to call add_root_to_dirty_list.
--- kernel-shared/free-space-tree.c | 1 - 1 file changed, 1 deletion(-)
kernel-shared/free-space-tree.c +0 -1
@@ -1522,7 +1522,6 @@ int btrfs_create_free_space_tree(struct btrfs_fs_info *fs_info) ret =btrfs_global_root_insert (fs_info, free_space_root);if (ret) goto abort; -add_root_to_dirty_list (free_space_root); do { block_group = btrfs_lookup_first_block_group(fs_info, start);
Signature · 1 line
2.40.0
PATCH 4/26 btrfs-progs: make add_root_to_dirty_list static and unexport it
In reply to Josef BacikNow that there are no users of this helper outside of ctree.c, unexport it and make it static.
--- kernel-shared/ctree.c | 2 +- kernel-shared/ctree.h | 1 - 2 files changed, 1 insertion(+), 2 deletions(-)
kernel-shared/ctree.c +1 -1
@@ -119,7 +119,7 @@ void btrfs_release_path(struct btrfs_path *p)memset (p,0 ,sizeof (*p)); } -void add_root_to_dirty_list (struct btrfs_root *root) +static void add_root_to_dirty_list (struct btrfs_root *root) {if (test_bit (BTRFS_ROOT_TRACK_DIRTY , &root->state) &&list_empty (&root->dirty_list)) {
kernel-shared/ctree.h +0 -1
@@ -988,7 +988,6 @@ int btrfs_find_item(struct btrfs_root *fs_root, struct btrfs_path *found_path, u64 iobjectid, u64 ioff, u8 key_type, struct btrfs_key *found_key);void btrfs_release_path (struct btrfs_path *p); -void add_root_to_dirty_list (struct btrfs_root *root);struct btrfs_path *btrfs_alloc_path (void );void btrfs_free_path (struct btrfs_path *p);void btrfs_init_path (struct btrfs_path *p);
Signature · 1 line
2.40.0
PATCH 5/26 btrfs-progs: pass btrfs_trans_handle through btrfs_clear_buffer_dirty
In reply to Josef BacikThis is the calling convention in the kernel because we track dirty blocks per transaction instead of globally in the fs_info. Simply mirror what we do in the kernel to make it easier to sync ctree.c locally.
--- cmds/rescue.c | 2 +- kernel-shared/ctree.c | 12 ++++++------ kernel-shared/disk-io.c | 2 +- kernel-shared/extent-tree.c | 2 +- kernel-shared/extent_io.c | 3 ++- kernel-shared/extent_io.h | 4 +++- kernel-shared/transaction.c | 4 ++-- 7 files changed, 16 insertions(+), 13 deletions(-)
cmds/rescue.c +1 -1
@@ -340,7 +340,7 @@ static int clear_uuid_tree(struct btrfs_fs_info *fs_info)if (ret <0 ) goto out;list_del (&uuid_root->dirty_list); - ret =btrfs_clear_buffer_dirty (uuid_root->node); + ret =btrfs_clear_buffer_dirty (trans, uuid_root->node);if (ret <0 ) goto out; ret = btrfs_free_tree_block(trans, btrfs_root_id(uuid_root),
kernel-shared/ctree.c +6 -6
@@ -434,7 +434,7 @@ static noinline int update_ref_for_cow(struct btrfs_trans_handle *trans, ret =btrfs_dec_ref (trans, root, buf,1 );BUG_ON (ret); } -btrfs_clear_buffer_dirty (buf); +btrfs_clear_buffer_dirty (trans, buf); }return 0 ; }
@@ -760,7 +760,7 @@ static int balance_level(struct btrfs_trans_handle *trans, root->node = child;add_root_to_dirty_list (root); path->nodes[level] =NULL ; -btrfs_clear_buffer_dirty (mid); +btrfs_clear_buffer_dirty (trans, mid);/* once for the path */ free_extent_buffer (mid);
@@ -814,7 +814,7 @@ static int balance_level(struct btrfs_trans_handle *trans,u64 bytenr = right->start;u32 blocksize = right->len; -btrfs_clear_buffer_dirty (right); +btrfs_clear_buffer_dirty (trans, right);free_extent_buffer (right); right =NULL ; wret =btrfs_del_ptr (root, path, level +1 , pslot +1 );
@@ -861,7 +861,7 @@ static int balance_level(struct btrfs_trans_handle *trans,/* we've managed to empty the middle node, drop it */ u64 bytenr = mid->start;u32 blocksize = mid->len; -btrfs_clear_buffer_dirty (mid); +btrfs_clear_buffer_dirty (trans, mid);free_extent_buffer (mid); mid =NULL ; wret =btrfs_del_ptr (root, path, level +1 , pslot);
@@ -2834,7 +2834,7 @@ int btrfs_del_items(struct btrfs_trans_handle *trans, struct btrfs_root *root,if (leaf == root->node) {btrfs_set_header_level (leaf,0 ); }else { -btrfs_clear_buffer_dirty (leaf); +btrfs_clear_buffer_dirty (trans, leaf); wret =btrfs_del_leaf (trans, root, path, leaf);BUG_ON (ret);if (wret)
@@ -2870,7 +2870,7 @@ int btrfs_del_items(struct btrfs_trans_handle *trans, struct btrfs_root *root, }if (btrfs_header_nritems (leaf) ==0 ) { -btrfs_clear_buffer_dirty (leaf); +btrfs_clear_buffer_dirty (trans, leaf); path->slots[1 ] = slot; ret =btrfs_del_leaf (trans, root, path, leaf);BUG_ON (ret);
kernel-shared/disk-io.c +1 -1
@@ -2318,7 +2318,7 @@ int btrfs_delete_and_free_root(struct btrfs_trans_handle *trans,return ret;list_del (&root->dirty_list); - ret =btrfs_clear_buffer_dirty (root->node); + ret =btrfs_clear_buffer_dirty (trans, root->node);if (ret)return ret; ret =btrfs_free_tree_block (trans,btrfs_root_id (root), root->node,0 ,1 );
kernel-shared/extent-tree.c +1 -1
@@ -1899,7 +1899,7 @@ static int pin_down_bytes(struct btrfs_trans_handle *trans, u64 bytenr,if (header_owner !=BTRFS_TREE_LOG_OBJECTID && header_transid == trans->transid && !btrfs_header_flag (buf,BTRFS_HEADER_FLAG_WRITTEN )) { -btrfs_clear_buffer_dirty (buf); +btrfs_clear_buffer_dirty (trans, buf);free_extent_buffer (buf);return 1 ; }
kernel-shared/extent_io.c +2 -1
@@ -585,7 +585,8 @@ int set_extent_buffer_dirty(struct extent_buffer *eb)return 0 ; } -int btrfs_clear_buffer_dirty (struct extent_buffer *eb) +int btrfs_clear_buffer_dirty (struct btrfs_trans_handle *trans, +struct extent_buffer *eb) {struct extent_io_tree *tree = &eb->fs_info->dirty_buffers;if (eb->flags &EXTENT_BUFFER_DIRTY ) {
kernel-shared/extent_io.h +3 -1
@@ -54,6 +54,7 @@ static inline int le_test_bit(int nr, const u8 *addr) }struct btrfs_fs_info ; +struct btrfs_trans_handle ;struct extent_buffer {struct cache_extent cache_node;
@@ -125,7 +126,8 @@ void memset_extent_buffer(const struct extent_buffer *eb, char c,int extent_buffer_test_bit (const struct extent_buffer *eb,unsigned long start,unsigned long nr);int set_extent_buffer_dirty (struct extent_buffer *eb); -int btrfs_clear_buffer_dirty (struct extent_buffer *eb); +int btrfs_clear_buffer_dirty (struct btrfs_trans_handle *trans, +struct extent_buffer *eb);int read_data_from_disk (struct btrfs_fs_info *info,void *buf,u64 logical,u64 *len,int mirror); int write_data_to_disk(struct btrfs_fs_info *info, void *buf, u64 offset,
kernel-shared/transaction.c +2 -2
@@ -161,7 +161,7 @@ again: goto cleanup; } start += eb->len; -btrfs_clear_buffer_dirty (eb); +btrfs_clear_buffer_dirty (trans, eb);free_extent_buffer (eb); } }
@@ -184,7 +184,7 @@ cleanup: eb =find_first_extent_buffer (fs_info, start);BUG_ON (!eb || eb->start != start); start += eb->len; -btrfs_clear_buffer_dirty (eb); +btrfs_clear_buffer_dirty (trans, eb);free_extent_buffer (eb); } }
Signature · 1 line
2.40.0
PATCH 6/26 btrfs-progs: update read_node_slot to match the kernel definition
In reply to Josef BacikIn the kernel this is called btrfs_read_node_slot, and it doesn't take a btrfs_fs_info. Update the btrfs-progs version to match the kernel and update all of the callers.
--- cmds/restore.c | 5 ++--- kernel-shared/ctree.c | 32 +++++++++++++++----------------- kernel-shared/ctree.h | 4 ++-- kernel-shared/print-tree.c | 2 +- 4 files changed, 20 insertions(+), 23 deletions(-)
cmds/restore.c +2 -3
@@ -240,7 +240,6 @@ static int next_leaf(struct btrfs_root *root, struct btrfs_path *path)int offset =1 ;struct extent_buffer *c;struct extent_buffer *next =NULL ; -struct btrfs_fs_info *fs_info = root->fs_info; again:for (; level <BTRFS_MAX_LEVEL ; level++) {
@@ -267,7 +266,7 @@ again:continue ; } - next =read_node_slot (fs_info, c, slot); + next =btrfs_read_node_slot (c, slot);if (extent_buffer_uptodate (next))break ; offset++;
@@ -281,7 +280,7 @@ again: path->slots[level] =0 ;if (!level)break ; - next =read_node_slot (fs_info, next,0 ); + next =btrfs_read_node_slot (next,0 );if (!extent_buffer_uptodate (next)) goto again; }
kernel-shared/ctree.c +15 -17
@@ -681,9 +681,10 @@ int btrfs_bin_search(struct extent_buffer *eb, const struct btrfs_key *key, slot); } -struct extent_buffer *read_node_slot (struct btrfs_fs_info *fs_info, -struct extent_buffer *parent,int slot) +struct extent_buffer *btrfs_read_node_slot (struct extent_buffer *parent, +int slot) { +struct btrfs_fs_info *fs_info = parent->fs_info;struct extent_buffer *ret;int level =btrfs_header_level (parent);
@@ -752,7 +753,7 @@ static int balance_level(struct btrfs_trans_handle *trans,return 0 ;/* promote the child to a root */ - child =read_node_slot (fs_info, mid,0 ); + child =btrfs_read_node_slot (mid,0 );BUG_ON (!extent_buffer_uptodate (child)); ret =btrfs_cow_block (trans, root, child, mid,0 , &child);BUG_ON (ret);
@@ -776,7 +777,7 @@ static int balance_level(struct btrfs_trans_handle *trans, BTRFS_NODEPTRS_PER_BLOCK(fs_info) / 4)return 0 ; - left =read_node_slot (fs_info, parent, pslot -1 ); + left =btrfs_read_node_slot (parent, pslot -1 );if (extent_buffer_uptodate (left)) { wret =btrfs_cow_block (trans, root, left, parent, pslot -1 , &left);
@@ -785,7 +786,7 @@ static int balance_level(struct btrfs_trans_handle *trans, goto enospc; } } - right =read_node_slot (fs_info, parent, pslot +1 ); + right =btrfs_read_node_slot (parent, pslot +1 );if (extent_buffer_uptodate (right)) { wret =btrfs_cow_block (trans, root, right, parent, pslot +1 , &right);
@@ -937,7 +938,7 @@ static int noinline push_nodes_for_insert(struct btrfs_trans_handle *trans,if (!parent)return 1 ; - left =read_node_slot (fs_info, parent, pslot -1 ); + left =btrfs_read_node_slot (parent, pslot -1 );/* first, try to make some room in the middle buffer */ if (extent_buffer_uptodate (left)) {
@@ -978,7 +979,7 @@ static int noinline push_nodes_for_insert(struct btrfs_trans_handle *trans, }free_extent_buffer (left); } - right=read_node_slot (fs_info, parent, pslot +1 ); + right=btrfs_read_node_slot (parent, pslot +1 );/* * then try to empty the right most buffer into the middle
@@ -1230,7 +1231,7 @@ again:reada_for_search (fs_info, p, level, slot, key->objectid); - b =read_node_slot (fs_info, b, slot); + b =btrfs_read_node_slot (b, slot);if (!extent_buffer_uptodate (b))return -EIO ; }else {
@@ -1789,7 +1790,6 @@ static int push_leaf_right(struct btrfs_trans_handle *trans, struct btrfs_rootstruct extent_buffer *right;struct extent_buffer *upper;struct btrfs_disk_key disk_key; -struct btrfs_fs_info *fs_info = root->fs_info;int slot;u32 i;int free_space;
@@ -1810,7 +1810,7 @@ static int push_leaf_right(struct btrfs_trans_handle *trans, struct btrfs_rootif (slot >=btrfs_header_nritems (upper) -1 )return 1 ; - right =read_node_slot (fs_info, upper, slot +1 ); + right =btrfs_read_node_slot (upper, slot +1 );if (!extent_buffer_uptodate (right)) {if (IS_ERR (right))return PTR_ERR (right);
@@ -1938,7 +1938,6 @@ static int push_leaf_left(struct btrfs_trans_handle *trans, struct btrfs_rootstruct btrfs_disk_key disk_key;struct extent_buffer *right = path->nodes[0 ];struct extent_buffer *left; -struct btrfs_fs_info *fs_info = root->fs_info;int slot;int i;int free_space;
@@ -1962,7 +1961,7 @@ static int push_leaf_left(struct btrfs_trans_handle *trans, struct btrfs_rootreturn 1 ; } - left =read_node_slot (fs_info, path->nodes[1 ], slot -1 ); + left =btrfs_read_node_slot (path->nodes[1 ], slot -1 ); free_space =btrfs_leaf_free_space (left);if (free_space < data_size) {free_extent_buffer (left);
@@ -2898,7 +2897,6 @@ int btrfs_prev_leaf(struct btrfs_root *root, struct btrfs_path *path)int level =1 ;struct extent_buffer *c;struct extent_buffer *next =NULL ; -struct btrfs_fs_info *fs_info = root->fs_info;while (level <BTRFS_MAX_LEVEL ) {if (!path->nodes[level])
@@ -2914,7 +2912,7 @@ int btrfs_prev_leaf(struct btrfs_root *root, struct btrfs_path *path) } slot--; - next =read_node_slot (fs_info, c, slot); + next =btrfs_read_node_slot (c, slot);if (!extent_buffer_uptodate (next)) {if (IS_ERR (next))return PTR_ERR (next);
@@ -2934,7 +2932,7 @@ int btrfs_prev_leaf(struct btrfs_root *root, struct btrfs_path *path) path->slots[level] = slot;if (!level)break ; - next =read_node_slot (fs_info, next, slot); + next =btrfs_read_node_slot (next, slot);if (!extent_buffer_uptodate (next)) {if (IS_ERR (next))return PTR_ERR (next);
@@ -2977,7 +2975,7 @@ int btrfs_next_sibling_tree_block(struct btrfs_fs_info *fs_info,if (path->reada)reada_for_search (fs_info, path, level, slot,0 ); - next =read_node_slot (fs_info, c, slot); + next =btrfs_read_node_slot (c, slot);if (!extent_buffer_uptodate (next))return -EIO ;break ;
@@ -3000,7 +2998,7 @@ int btrfs_next_sibling_tree_block(struct btrfs_fs_info *fs_info,break ;if (path->reada)reada_for_search (fs_info, path, level,0 ,0 ); - next =read_node_slot (fs_info, next,0 ); + next =btrfs_read_node_slot (next,0 );if (!extent_buffer_uptodate (next))return -EIO ; }
kernel-shared/ctree.h +2 -2
@@ -948,8 +948,8 @@ int btrfs_convert_one_bg(struct btrfs_trans_handle *trans, u64 bytenr);int btrfs_comp_cpu_keys (const struct btrfs_key *k1,const struct btrfs_key *k2);int btrfs_del_ptr (struct btrfs_root *root,struct btrfs_path *path,int level,int slot); -struct extent_buffer *read_node_slot (struct btrfs_fs_info *fs_info, -struct extent_buffer *parent,int slot); +struct extent_buffer *btrfs_read_node_slot (struct extent_buffer *parent, +int slot);int btrfs_previous_item (struct btrfs_root *root,struct btrfs_path *path,u64 min_objectid,int type);
kernel-shared/print-tree.c +1 -1
@@ -1487,7 +1487,7 @@ static int search_leftmost_tree_block(struct btrfs_fs_info *fs_info,struct extent_buffer *eb; path->slots[i] =0 ; - eb =read_node_slot (fs_info, path->nodes[i],0 ); + eb =btrfs_read_node_slot (path->nodes[i],0 );if (!extent_buffer_uptodate (eb)) { ret = -EIO ; goto out;
Signature · 1 line
2.40.0
PATCH 7/26 btrfs-progs: update btrfs_bin_search to match the kernel definition
In reply to Josef BacikThis was updated to include a first_slot argument, update it to match the kernel definition to make it easier to sync ctree.c.
--- check/main.c | 2 +- kernel-shared/ctree.c | 6 +++--- kernel-shared/ctree.h | 4 ++-- 3 files changed, 6 insertions(+), 6 deletions(-)
check/main.c +1 -1
@@ -6524,7 +6524,7 @@ static int run_next_block(struct btrfs_root *root,* technically unreferenced and don't need to be worried about. */ if (ri !=NULL && ri->drop_level && level > ri->drop_level) { - ret =btrfs_bin_search (buf, &ri->drop_key, &i); + ret =btrfs_bin_search (buf,0 , &ri->drop_key, &i);if (ret && i >0 ) i--; }
kernel-shared/ctree.c +3 -3
@@ -664,8 +664,8 @@ static int generic_bin_search(struct extent_buffer *eb, unsigned long p,* simple bin_search frontend that does the right thing for * leaves vs nodes */ -int btrfs_bin_search (struct extent_buffer *eb,const struct btrfs_key *key, -int *slot) +int btrfs_bin_search (struct extent_buffer *eb,int first_slot, +const struct btrfs_key *key,int *slot) {if (btrfs_header_level (eb) ==0 ) return generic_bin_search(eb,
@@ -1196,7 +1196,7 @@ again: ret =check_block (fs_info, p, level);if (ret)return -1 ; - ret =btrfs_bin_search (b, key, &slot); + ret =btrfs_bin_search (b,0 , key, &slot);if (level !=0 ) {if (ret && slot >0 ) slot -=1 ;
kernel-shared/ctree.h +2 -2
@@ -982,8 +982,8 @@ int btrfs_search_slot_for_read(struct btrfs_root *root,const struct btrfs_key *key, struct btrfs_path *p, int find_higher, int return_any); -int btrfs_bin_search (struct extent_buffer *eb,const struct btrfs_key *key, -int *slot); +int btrfs_bin_search (struct extent_buffer *eb,int first_slot, +const struct btrfs_key *key,int *slot);int btrfs_find_item (struct btrfs_root *fs_root,struct btrfs_path *found_path,u64 iobjectid,u64 ioff,u8 key_type,struct btrfs_key *found_key);
Signature · 1 line
2.40.0
PATCH 8/26 btrfs-progs: update btrfs_set_item_key_safe to match kernel definition
In reply to Josef BacikIn the kernel we just pass the btrfs_fs_info, and we const'ify the new_key. Update the btrfs-progs definition to make syncing ctree.c easier.
--- kernel-shared/ctree.c | 12 +++++------- kernel-shared/ctree.h | 5 +++-- kernel-shared/file-item.c | 3 +-- 3 files changed, 9 insertions(+), 11 deletions(-)
kernel-shared/ctree.c +5 -7
@@ -1355,8 +1355,9 @@ void btrfs_fixup_low_keys( struct btrfs_path *path, struct btrfs_disk_key *key,* This function isn't completely safe. It's the caller's responsibility * that the new key won't break the order */ -int btrfs_set_item_key_safe (struct btrfs_root *root,struct btrfs_path *path, -struct btrfs_key *new_key) +void btrfs_set_item_key_safe (struct btrfs_fs_info *fs_info, +struct btrfs_path *path, +const struct btrfs_key *new_key) {struct btrfs_disk_key disk_key;struct extent_buffer *eb;
@@ -1366,13 +1367,11 @@ int btrfs_set_item_key_safe(struct btrfs_root *root, struct btrfs_path *path, slot = path->slots[0 ];if (slot >0 ) {btrfs_item_key (eb, &disk_key, slot -1 ); -if (btrfs_comp_keys (&disk_key, new_key) >=0 ) -return -1 ; +BUG_ON (btrfs_comp_keys (&disk_key, new_key) >=0 ); }if (slot <btrfs_header_nritems (eb) -1 ) {btrfs_item_key (eb, &disk_key, slot +1 ); -if (btrfs_comp_keys (&disk_key, new_key) <=0 ) -return -1 ; +BUG_ON (btrfs_comp_keys (&disk_key, new_key) <=0 ); }btrfs_cpu_key_to_disk (&disk_key, new_key);
@@ -1380,7 +1379,6 @@ int btrfs_set_item_key_safe(struct btrfs_root *root, struct btrfs_path *path,btrfs_mark_buffer_dirty (eb);if (slot ==0 )btrfs_fixup_low_keys (path, &disk_key,1 ); -return 0 ; }/*
kernel-shared/ctree.h +3 -2
@@ -1055,8 +1055,9 @@ int btrfs_prev_leaf(struct btrfs_root *root, struct btrfs_path *path);int btrfs_leaf_free_space (struct extent_buffer *leaf);void btrfs_fixup_low_keys (struct btrfs_path *path,struct btrfs_disk_key *key,int level); -int btrfs_set_item_key_safe (struct btrfs_root *root,struct btrfs_path *path, -struct btrfs_key *new_key); +void btrfs_set_item_key_safe (struct btrfs_fs_info *fs_info, +struct btrfs_path *path, +const struct btrfs_key *new_key);void btrfs_set_item_key_unsafe (struct btrfs_root *root,struct btrfs_path *path,struct btrfs_key *new_key);
kernel-shared/file-item.c +1 -2
@@ -389,8 +389,7 @@ static noinline int truncate_one_csum(struct btrfs_root *root,BUG_ON (ret); key->offset = end_byte; - ret =btrfs_set_item_key_safe (root, path, key); -BUG_ON (ret); +btrfs_set_item_key_safe (root->fs_info, path, key); }else {BUG (); }
Signature · 1 line
2.40.0
PATCH 9/26 btrfs-progs: update btrfs_print_leaf to match the kernel definition
In reply to Josef BacikIn the kernel we have btrfs_print_leaf(eb) instead of btrfs_print_leaf(eb, mode). In fact in all of the kernel-shared sources we're just using the default mode. Fix this to have a __btrfs_print_leaf() which handles the mode for the user space utilities that want the different behavior, and then change btrfs_print_leaf() to just be the normal default style.
--- cmds/inspect-dump-tree.c | 2 +- kernel-shared/ctree.c | 16 ++++++++-------- kernel-shared/extent-tree.c | 8 ++++---- kernel-shared/print-tree.c | 4 ++-- kernel-shared/print-tree.h | 7 ++++++- 5 files changed, 21 insertions(+), 16 deletions(-)
cmds/inspect-dump-tree.c +1 -1
@@ -52,7 +52,7 @@ static void print_extents(struct extent_buffer *eb)return ;if (btrfs_is_leaf (eb)) { -btrfs_print_leaf (eb,BTRFS_PRINT_TREE_DEFAULT ); +btrfs_print_leaf (eb);return ; }
kernel-shared/ctree.c +8 -8
@@ -2418,7 +2418,7 @@ split: ret =0 ;if (btrfs_leaf_free_space (leaf) <0 ) { -btrfs_print_leaf (leaf,BTRFS_PRINT_TREE_DEFAULT ); +btrfs_print_leaf (leaf);BUG (); }kfree (buf);
@@ -2510,7 +2510,7 @@ int btrfs_truncate_item(struct btrfs_path *path, u32 new_size, int from_end) ret =0 ;if (btrfs_leaf_free_space (leaf) <0 ) { -btrfs_print_leaf (leaf,BTRFS_PRINT_TREE_DEFAULT ); +btrfs_print_leaf (leaf);BUG (); }return ret;
@@ -2534,7 +2534,7 @@ int btrfs_extend_item(struct btrfs_root *root, struct btrfs_path *path, data_end =leaf_data_end (leaf);if (btrfs_leaf_free_space (leaf) < data_size) { -btrfs_print_leaf (leaf,BTRFS_PRINT_TREE_DEFAULT ); +btrfs_print_leaf (leaf);BUG (); } slot = path->slots[0 ];
@@ -2542,7 +2542,7 @@ int btrfs_extend_item(struct btrfs_root *root, struct btrfs_path *path,BUG_ON (slot <0 );if (slot >= nritems) { -btrfs_print_leaf (leaf,BTRFS_PRINT_TREE_DEFAULT ); +btrfs_print_leaf (leaf);printk ("slot %d too large, nritems %u\n" , slot, nritems);BUG_ON (1 ); }
@@ -2569,7 +2569,7 @@ int btrfs_extend_item(struct btrfs_root *root, struct btrfs_path *path, ret =0 ;if (btrfs_leaf_free_space (leaf) <0 ) { -btrfs_print_leaf (leaf,BTRFS_PRINT_TREE_DEFAULT ); +btrfs_print_leaf (leaf);BUG (); }return ret;
@@ -2617,7 +2617,7 @@ int btrfs_insert_empty_items(struct btrfs_trans_handle *trans, data_end =leaf_data_end (leaf);if (btrfs_leaf_free_space (leaf) < total_size) { -btrfs_print_leaf (leaf,BTRFS_PRINT_TREE_DEFAULT ); +btrfs_print_leaf (leaf);printk ("not enough freespace need %u have %d\n" , total_size,btrfs_leaf_free_space (leaf));BUG ();
@@ -2630,7 +2630,7 @@ int btrfs_insert_empty_items(struct btrfs_trans_handle *trans,unsigned int old_data =btrfs_item_data_end (leaf, slot);if (old_data < data_end) { -btrfs_print_leaf (leaf,BTRFS_PRINT_TREE_DEFAULT ); +btrfs_print_leaf (leaf);printk ("slot %d old_data %u data_end %u\n" , slot, old_data, data_end);BUG_ON (1 );
@@ -2676,7 +2676,7 @@ int btrfs_insert_empty_items(struct btrfs_trans_handle *trans, }if (btrfs_leaf_free_space (leaf) <0 ) { -btrfs_print_leaf (leaf,BTRFS_PRINT_TREE_DEFAULT ); +btrfs_print_leaf (leaf);BUG (); }
kernel-shared/extent-tree.c +4 -4
@@ -937,7 +937,7 @@ again:printf ("Size is %u, needs to be %u, slot %d\n" , (unsigned )item_size, (unsigned )sizeof (*ei), path->slots[0 ]); -btrfs_print_leaf (leaf,BTRFS_PRINT_TREE_DEFAULT ); +btrfs_print_leaf (leaf);return -EINVAL ; }
@@ -1428,7 +1428,7 @@ again: }if (ret !=0 ) { -btrfs_print_leaf (path->nodes[0 ],BTRFS_PRINT_TREE_DEFAULT ); +btrfs_print_leaf (path->nodes[0 ]);printk ("failed to find block number %llu\n" , (unsigned long long )bytenr);BUG ();
@@ -2034,7 +2034,7 @@ static int __free_extent(struct btrfs_trans_handle *trans,printk (KERN_ERR "umm, got %d back from search" ", was looking for %llu\n" , ret, (unsigned long long )bytenr); -btrfs_print_leaf (path->nodes[0 ],BTRFS_PRINT_TREE_DEFAULT ); +btrfs_print_leaf (path->nodes[0 ]); }BUG_ON (ret); extent_slot = path->slots[0 ];
@@ -2048,7 +2048,7 @@ static int __free_extent(struct btrfs_trans_handle *trans, (unsigned long long )owner_objectid, (unsigned long long)owner_offset);printf ("path->slots[0]: %d path->nodes[0]:\n" , path->slots[0 ]); -btrfs_print_leaf (path->nodes[0 ],BTRFS_PRINT_TREE_DEFAULT ); +btrfs_print_leaf (path->nodes[0 ]); ret = -EIO ; goto fail; }
kernel-shared/print-tree.c +2 -2
@@ -1294,7 +1294,7 @@ static void print_header_info(struct extent_buffer *eb, unsigned int mode)fflush (stdout); } -void btrfs_print_leaf (struct extent_buffer *eb,unsigned int mode) +void __btrfs_print_leaf (struct extent_buffer *eb,unsigned int mode) {struct btrfs_disk_key disk_key;u32 leaf_data_size =BTRFS_LEAF_DATA_SIZE (eb->fs_info);
@@ -1607,7 +1607,7 @@ void btrfs_print_tree(struct extent_buffer *eb, unsigned int mode) nr =btrfs_header_nritems (eb);if (btrfs_is_leaf (eb)) { -btrfs_print_leaf (eb, mode); +__btrfs_print_leaf (eb, mode);return ; }/* We are crossing eb boundary, this node must be corrupted */
kernel-shared/print-tree.h +6 -1
@@ -34,7 +34,12 @@ enum { };void btrfs_print_tree (struct extent_buffer *eb,unsigned int mode); -void btrfs_print_leaf (struct extent_buffer *eb,unsigned int mode); +void __btrfs_print_leaf (struct extent_buffer *eb,unsigned int mode); + +static inline void btrfs_print_leaf (struct extent_buffer *eb) +{ +__btrfs_print_leaf (eb,BTRFS_PRINT_TREE_DEFAULT ); +}void btrfs_print_key (struct btrfs_disk_key *disk_key);void print_chunk_item (struct extent_buffer *eb,struct btrfs_chunk *chunk);
Signature · 1 line
2.40.0
PATCH 10/26 btrfs-progs: update btrfs_truncate_item to match the kernel definition
In reply to Josef BacikThis is void in the kernel, and this makes sense in btrfs-progs as it stands currently as it doesn't actually return an error if there's a problem, it simply BUG()'s. Update this to be a void and update the callers to make it easier to sync ctree.c.
--- kernel-shared/ctree.c | 7 ++----- kernel-shared/ctree.h | 2 +- kernel-shared/extent-tree.c | 4 +--- kernel-shared/file-item.c | 7 ++----- 4 files changed, 6 insertions(+), 14 deletions(-)
kernel-shared/ctree.c +2 -5
@@ -2425,9 +2425,8 @@ split:return ret; } -int btrfs_truncate_item (struct btrfs_path *path,u32 new_size,int from_end) +void btrfs_truncate_item (struct btrfs_path *path,u32 new_size,int from_end) { -int ret =0 ;int slot;struct extent_buffer *leaf;u32 nritems;
@@ -2442,7 +2441,7 @@ int btrfs_truncate_item(struct btrfs_path *path, u32 new_size, int from_end) old_size =btrfs_item_size (leaf, slot);if (old_size == new_size) -return 0 ; +return ; nritems =btrfs_header_nritems (leaf); data_end =leaf_data_end (leaf);
@@ -2508,12 +2507,10 @@ int btrfs_truncate_item(struct btrfs_path *path, u32 new_size, int from_end)btrfs_set_item_size (leaf, slot, new_size);btrfs_mark_buffer_dirty (leaf); - ret =0 ;if (btrfs_leaf_free_space (leaf) <0 ) {btrfs_print_leaf (leaf);BUG (); } -return ret; } int btrfs_extend_item(struct btrfs_root *root, struct btrfs_path *path,
kernel-shared/ctree.h +1 -1
@@ -969,7 +969,7 @@ int btrfs_create_root(struct btrfs_trans_handle *trans, struct btrfs_fs_info *fs_info, u64 objectid);int btrfs_extend_item (struct btrfs_root *root,struct btrfs_path *path,u32 data_size); -int btrfs_truncate_item (struct btrfs_path *path,u32 new_size,int from_end); +void btrfs_truncate_item (struct btrfs_path *path,u32 new_size,int from_end); int btrfs_split_item(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_path *path,
kernel-shared/extent-tree.c +1 -3
@@ -1129,7 +1129,6 @@ static int update_inline_extent_backref(struct btrfs_trans_handle *trans,u32 item_size;int size;int type; -int ret;u64 refs; leaf = path->nodes[0 ];
@@ -1169,8 +1168,7 @@ static int update_inline_extent_backref(struct btrfs_trans_handle *trans,memmove_extent_buffer (leaf, ptr, ptr + size, end - ptr - size); item_size -= size; - ret =btrfs_truncate_item (path, item_size,1 ); -BUG_ON (ret); +btrfs_truncate_item (path, item_size,1 ); }btrfs_mark_buffer_dirty (leaf);return 0 ;
kernel-shared/file-item.c +2 -5
@@ -356,7 +356,6 @@ static noinline int truncate_one_csum(struct btrfs_root *root,u64 csum_end;u64 end_byte = bytenr + len;u32 blocksize = root->fs_info->sectorsize; -int ret; leaf = path->nodes[0 ]; csum_end =btrfs_item_size (leaf, path->slots[0 ]) / csum_size;
@@ -372,8 +371,7 @@ static noinline int truncate_one_csum(struct btrfs_root *root,*/ u32 new_size = (bytenr - key->offset) / blocksize; new_size *= csum_size; - ret =btrfs_truncate_item (path, new_size,1 ); -BUG_ON (ret); +btrfs_truncate_item (path, new_size,1 ); }else if (key->offset >= bytenr && csum_end > end_byte && end_byte > key->offset) {/*
@@ -385,8 +383,7 @@ static noinline int truncate_one_csum(struct btrfs_root *root,u32 new_size = (csum_end - end_byte) / blocksize; new_size *= csum_size; - ret =btrfs_truncate_item (path, new_size,0 ); -BUG_ON (ret); +btrfs_truncate_item (path, new_size,0 ); key->offset = end_byte;btrfs_set_item_key_safe (root->fs_info, path, key);
Signature · 1 line
2.40.0
PATCH 11/26 btrfs-progs: update btrfs_extend_item to match the kernel definition
In reply to Josef BacikSimilar to btrfs_truncate_item(), this is void in the kernel as the failure case is simply BUG_ON(). Additionally there is no root parameter as it's not used in the function at all. Make these changes and update the callers.
--- kernel-shared/ctree.c | 8 ++------ kernel-shared/ctree.h | 3 +-- kernel-shared/dir-item.c | 4 ++-- kernel-shared/extent-tree.c | 4 +--- kernel-shared/file-item.c | 3 +-- kernel-shared/inode-item.c | 5 ++--- tune/change-csum.c | 3 +-- 7 files changed, 10 insertions(+), 20 deletions(-)
kernel-shared/ctree.c +2 -6
@@ -2513,10 +2513,8 @@ void btrfs_truncate_item(struct btrfs_path *path, u32 new_size, int from_end) } } -int btrfs_extend_item (struct btrfs_root *root,struct btrfs_path *path, -u32 data_size) +void btrfs_extend_item (struct btrfs_path *path,u32 data_size) { -int ret =0 ;int slot;struct extent_buffer *leaf;u32 nritems;
@@ -2564,12 +2562,10 @@ int btrfs_extend_item(struct btrfs_root *root, struct btrfs_path *path,btrfs_set_item_size (leaf, slot, old_size + data_size);btrfs_mark_buffer_dirty (leaf); - ret =0 ;if (btrfs_leaf_free_space (leaf) <0 ) {btrfs_print_leaf (leaf);BUG (); } -return ret; }/*
@@ -3218,7 +3214,7 @@ int btrfs_uuid_tree_add(struct btrfs_trans_handle *trans, u8 *uuid, u8 type,* ret == -EEXIST case, An item with that type already exists. * Extend the item and store the new subvol_id at the end. */ -btrfs_extend_item (uuid_root, path,sizeof (subvol_id_le)); +btrfs_extend_item (path,sizeof (subvol_id_le)); eb = path->nodes[0 ]; slot = path->slots[0 ]; offset =btrfs_item_ptr_offset (eb, slot);
kernel-shared/ctree.h +1 -2
@@ -967,8 +967,7 @@ int btrfs_copy_root(struct btrfs_trans_handle *trans, struct extent_buffer **cow_ret, u64 new_root_objectid);int btrfs_create_root (struct btrfs_trans_handle *trans,struct btrfs_fs_info *fs_info,u64 objectid); -int btrfs_extend_item (struct btrfs_root *root,struct btrfs_path *path, -u32 data_size); +void btrfs_extend_item (struct btrfs_path *path,u32 data_size);void btrfs_truncate_item (struct btrfs_path *path,u32 new_size,int from_end); int btrfs_split_item(struct btrfs_trans_handle *trans, struct btrfs_root *root,
kernel-shared/dir-item.c +2 -2
@@ -40,8 +40,8 @@ static struct btrfs_dir_item *insert_with_overflow(struct btrfs_trans_handle di =btrfs_match_dir_item_name (root, path, name, name_len);if (di)return ERR_PTR (-EEXIST ); - ret =btrfs_extend_item (root, path, data_size); -WARN_ON (ret >0 ); +btrfs_extend_item (path, data_size); + ret =0 ; }if (ret <0 )return ERR_PTR (ret);
kernel-shared/extent-tree.c +1 -3
@@ -1040,7 +1040,6 @@ static int setup_inline_extent_backref(struct btrfs_root *root,u64 refs;int size;int type; -int ret; leaf = path->nodes[0 ]; ei = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item);
@@ -1049,8 +1048,7 @@ static int setup_inline_extent_backref(struct btrfs_root *root, type =extent_ref_type (parent, owner); size =btrfs_extent_inline_ref_size (type); - ret =btrfs_extend_item (root, path, size); -BUG_ON (ret); +btrfs_extend_item (path, size); ei = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item); refs =btrfs_extent_refs (leaf, ei);
kernel-shared/file-item.c +1 -2
@@ -293,8 +293,7 @@ int btrfs_csum_file_block(struct btrfs_trans_handle *trans, diff = diff -btrfs_item_size (leaf, path->slots[0 ]);if (diff != csum_size) goto insert; - ret =btrfs_extend_item (root, path, diff); -BUG_ON (ret); +btrfs_extend_item (path, diff); goto csum; }
kernel-shared/inode-item.c +2 -3
@@ -78,8 +78,7 @@ int btrfs_insert_inode_ref(struct btrfs_trans_handle *trans, goto out; old_size =btrfs_item_size (path->nodes[0 ], path->slots[0 ]); - ret =btrfs_extend_item (root, path, ins_len); -BUG_ON (ret); +btrfs_extend_item (path, ins_len); ref =btrfs_item_ptr (path->nodes[0 ], path->slots[0 ], struct btrfs_inode_ref); ref = (struct btrfs_inode_ref *)((unsigned long )ref + old_size);
@@ -352,7 +351,7 @@ int btrfs_insert_inode_extref(struct btrfs_trans_handle *trans, name, name_len, NULL)) goto out; -btrfs_extend_item (root, path, ins_len); +btrfs_extend_item (path, ins_len); ret =0 ; }
tune/change-csum.c +1 -2
@@ -232,8 +232,7 @@ static int csum_file_block(struct btrfs_trans_handle *trans, diff = diff -btrfs_item_size (leaf, path->slots[0 ]);if (diff != csum_size) goto insert; - ret =btrfs_extend_item (csum_root, path, diff); -BUG_ON (ret); +btrfs_extend_item (path, diff); goto csum; }
Signature · 1 line
2.40.0
PATCH 12/26 btrfs-progs: sync memcpy_extent_buffer from the kernel
In reply to Josef BacikWe use this in ctree.c in the kernel, so sync this helper into btrfs-progs to make sync'ing ctree.c easier.
--- kernel-shared/extent_io.c | 6 ++++++ kernel-shared/extent_io.h | 3 +++ 2 files changed, 9 insertions(+)
kernel-shared/extent_io.c +6 -0
@@ -630,6 +630,12 @@ void copy_extent_buffer_full(const struct extent_buffer *dst,copy_extent_buffer (dst, src,0 ,0 , src->len); } +void memcpy_extent_buffer (const struct extent_buffer *dst,unsigned long dst_offset, +unsigned long src_offset,unsigned long len) +{ +memcpy ((void *)dst->data + dst_offset, dst->data + src_offset, len); +} +void memmove_extent_buffer (const struct extent_buffer *dst,unsigned long dst_offset,unsigned long src_offset,unsigned long len) {
kernel-shared/extent_io.h +3 -0
@@ -118,6 +118,9 @@ void copy_extent_buffer(const struct extent_buffer *dst, unsigned long len);void copy_extent_buffer_full (const struct extent_buffer *dst,const struct extent_buffer *src); +void memcpy_extent_buffer (const struct extent_buffer *dst, +unsigned long dst_offset,unsigned long src_offset, +unsigned long len);void memmove_extent_buffer (const struct extent_buffer *dst,const unsigned long dst_offset,unsigned long src_offset,unsigned long len);
Signature · 1 line
2.40.0
PATCH 13/26 btrfs-progs: change how we check supported csum type
In reply to Josef BacikIn the kernel we have a basic btrfs_supported_super_csum() helper in disk-io.c to validate the csum type. Update progs to do the same thing that the kernel does and then drop the btrfs_super_num_csums() helper as it doesn't exist upstream and is no longer used.
--- kernel-shared/ctree.c | 5 ----- kernel-shared/ctree.h | 1 - kernel-shared/disk-io.c | 15 ++++++++++++++- 3 files changed, 14 insertions(+), 7 deletions(-)
kernel-shared/ctree.c +0 -5
@@ -65,11 +65,6 @@ const char *btrfs_super_csum_name(u16 csum_type)return btrfs_csums[csum_type].name; } -size_t btrfs_super_num_csums (void ) -{ -return ARRAY_SIZE (btrfs_csums); -} -u16 btrfs_csum_type_size (u16 csum_type) {return btrfs_csums[csum_type].size;
kernel-shared/ctree.h +0 -1
@@ -1064,7 +1064,6 @@ void btrfs_set_item_key_unsafe(struct btrfs_root *root,u16 btrfs_super_csum_size (const struct btrfs_super_block *s);const char *btrfs_super_csum_name (u16 csum_type);u16 btrfs_csum_type_size (u16 csum_type); -size_t btrfs_super_num_csums (void );/* root-item.c */ int btrfs_add_root_ref(struct btrfs_trans_handle *trans,
kernel-shared/disk-io.c +14 -1
@@ -1713,6 +1713,19 @@ struct btrfs_root *open_ctree_fd(int fp, const char *path, u64 sb_bytenr,return info->fs_root; } +static bool btrfs_supported_super_csum (u16 csum_type) +{ +switch (csum_type) { +case BTRFS_CSUM_TYPE_CRC32 : +case BTRFS_CSUM_TYPE_XXHASH : +case BTRFS_CSUM_TYPE_SHA256 : +case BTRFS_CSUM_TYPE_BLAKE2 : +return true; +default : +return false; + } +} +/* * Check if the super is valid: * - nodesize/sectorsize - minimum, maximum, alignment
@@ -1737,7 +1750,7 @@ int btrfs_check_super(struct btrfs_super_block *sb, unsigned sbflags) } csum_type =btrfs_super_csum_type (sb); -if (csum_type >=btrfs_super_num_csums ()) { +if (!btrfs_supported_super_csum (csum_type)) {error ("unsupported checksum algorithm %u" , csum_type);return -EIO ; }
Signature · 1 line
2.40.0
PATCH 15/26 btrfs-progs: move btrfs_set_item_key_unsafe to check/
In reply to Josef BacikThis helper exists for check and for btrfs-corrupt-block. Move the helper and the btrfs_fixup_low_keys helper into check/repair.[ch] so we can keep the kernel-shared sources close to the upstream kernel.
--- btrfs-corrupt-block.c | 1 + check/repair.c | 47 +++++++++++++++++++++++++++++++++++++++++++ check/repair.h | 5 +++++ kernel-shared/ctree.c | 40 +++++++++--------------------------- kernel-shared/ctree.h | 5 ----- 5 files changed, 62 insertions(+), 36 deletions(-)
btrfs-corrupt-block.c +1 -0
@@ -35,6 +35,7 @@#include "common/messages.h" #include "common/string-utils.h" #include "cmds/commands.h" +#include "check/repair.h" #define FIELD_BUF_LEN 80
check/repair.c +47 -0
53 lines not on this page · raw message
check/repair.h +5 -0
@@ -45,4 +45,9 @@ int btrfs_mark_used_blocks(struct btrfs_fs_info *fs_info, struct extent_io_tree *tree);enum btrfs_tree_block_status btrfs_check_block_for_repair (struct extent_buffer *eb,struct btrfs_key *first_key); +void btrfs_set_item_key_unsafe (struct btrfs_root *root, +struct btrfs_path *path, +struct btrfs_key *new_key); +void btrfs_fixup_low_keys (struct btrfs_path *path,struct btrfs_disk_key *key, +int level);#endif
kernel-shared/ctree.c +9 -31
@@ -1321,8 +1321,8 @@ again:* fixing up pointers when a given leaf/node is not in slot 0 of the * higher levels */ -void btrfs_fixup_low_keys (struct btrfs_path *path,struct btrfs_disk_key *key, -int level) +static void fixup_low_keys (struct btrfs_path *path,struct btrfs_disk_key *key, +int level) {int i;struct extent_buffer *t;
@@ -1368,29 +1368,7 @@ void btrfs_set_item_key_safe(struct btrfs_fs_info *fs_info,btrfs_set_item_key (eb, &disk_key, slot);btrfs_mark_buffer_dirty (eb);if (slot ==0 ) -btrfs_fixup_low_keys (path, &disk_key,1 ); -} - -/* -* update an item key without the safety checks. This is meant to be called by -* fsck only. -*/ -void btrfs_set_item_key_unsafe (struct btrfs_root *root, -struct btrfs_path *path, -struct btrfs_key *new_key) -{ -struct btrfs_disk_key disk_key; -struct extent_buffer *eb; -int slot; - - eb = path->nodes[0 ]; - slot = path->slots[0 ]; - -btrfs_cpu_key_to_disk (&disk_key, new_key); -btrfs_set_item_key (eb, &disk_key, slot); -btrfs_mark_buffer_dirty (eb); -if (slot ==0 ) -btrfs_fixup_low_keys (path, &disk_key,1 ); +fixup_low_keys (path, &disk_key,1 ); }/*
@@ -2056,7 +2034,7 @@ static int push_leaf_left(struct btrfs_trans_handle *trans, struct btrfs_rootbtrfs_mark_buffer_dirty (right);btrfs_item_key (right, &disk_key,0 ); -btrfs_fixup_low_keys (path, &disk_key,1 ); +fixup_low_keys (path, &disk_key,1 );/* then fixup the leaf pointer in the path */ if (path->slots[0 ] < push_items) {
@@ -2286,7 +2264,7 @@ again: path->nodes[0 ] = right; path->slots[0 ] =0 ;if (path->slots[1 ] ==0 ) -btrfs_fixup_low_keys (path, &disk_key,1 ); +fixup_low_keys (path, &disk_key,1 ); }btrfs_mark_buffer_dirty (right);return ret;
@@ -2491,7 +2469,7 @@ void btrfs_truncate_item(struct btrfs_path *path, u32 new_size, int from_end)btrfs_set_disk_key_offset (&disk_key, offset + size_diff);btrfs_set_item_key (leaf, &disk_key, slot);if (slot ==0 ) -btrfs_fixup_low_keys (path, &disk_key,1 ); +fixup_low_keys (path, &disk_key,1 ); }btrfs_set_item_size (leaf, slot, new_size);
@@ -2655,7 +2633,7 @@ int btrfs_insert_empty_items(struct btrfs_trans_handle *trans, ret =0 ;if (slot ==0 ) {btrfs_cpu_key_to_disk (&disk_key, cpu_key); -btrfs_fixup_low_keys (path, &disk_key,1 ); +fixup_low_keys (path, &disk_key,1 ); }if (btrfs_leaf_free_space (leaf) <0 ) {
@@ -2728,7 +2706,7 @@ int btrfs_del_ptr(struct btrfs_root *root, struct btrfs_path *path,struct btrfs_disk_key disk_key;btrfs_node_key (parent, &disk_key,0 ); -btrfs_fixup_low_keys (path, &disk_key, level +1 ); +fixup_low_keys (path, &disk_key, level +1 ); }btrfs_mark_buffer_dirty (parent);return ret;
@@ -2826,7 +2804,7 @@ int btrfs_del_items(struct btrfs_trans_handle *trans, struct btrfs_root *root,struct btrfs_disk_key disk_key;btrfs_item_key (leaf, &disk_key,0 ); -btrfs_fixup_low_keys (path, &disk_key,1 ); +fixup_low_keys (path, &disk_key,1 ); }/* delete the leaf if it is mostly empty */
kernel-shared/ctree.h +0 -5
@@ -1051,14 +1051,9 @@ static inline int btrfs_next_item(struct btrfs_root *root,int btrfs_prev_leaf (struct btrfs_root *root,struct btrfs_path *path);int btrfs_leaf_free_space (struct extent_buffer *leaf); -void btrfs_fixup_low_keys (struct btrfs_path *path,struct btrfs_disk_key *key, -int level);void btrfs_set_item_key_safe (struct btrfs_fs_info *fs_info,struct btrfs_path *path,const struct btrfs_key *new_key); -void btrfs_set_item_key_unsafe (struct btrfs_root *root, -struct btrfs_path *path, -struct btrfs_key *new_key);u16 btrfs_super_csum_size (const struct btrfs_super_block *s);const char *btrfs_super_csum_name (u16 csum_type);
Signature · 1 line
2.40.0
PATCH 17/26 btrfs-progs: make a local copy of btrfs_next_sibling_block in print-tree.c
In reply to Josef BacikWe use this in print-tree to do BFS tree printing, but there are no other users and it doesn't exist upstream. Copy the current code and clean it up so it can exist in print-tree.c and use the local copy there. This will allow us to remove the function call when ctree.c is synced.
--- kernel-shared/print-tree.c | 53 +++++++++++++++++++++++++++++++++++++- 1 file changed, 52 insertions(+), 1 deletion(-)
kernel-shared/print-tree.c +52 -1
@@ -1498,6 +1498,57 @@ out:return ret; } +/* +* Walk up the tree as far as necessary to find the next sibling tree block. +* More generic version of btrfs_next_leaf(), as it could find sibling nodes +* if @path->lowest_level is not 0. +* +* returns 0 if it found something or 1 if there are no greater leaves. +* returns < 0 on io errors. +*/ +int next_sibling_tree_block (struct btrfs_fs_info *fs_info, +struct btrfs_path *path) +{ +int slot; +int level = path->lowest_level +1 ; +struct extent_buffer *c; +struct extent_buffer *next =NULL ; + +BUG_ON (path->lowest_level +1 >=BTRFS_MAX_LEVEL ); +do { +if (!path->nodes[level]) +return 1 ; + + slot = path->slots[level] +1 ; + c = path->nodes[level]; +if (slot >=btrfs_header_nritems (c)) { + level++; +if (level ==BTRFS_MAX_LEVEL ) +return 1 ; +continue ; + } + + next =btrfs_read_node_slot (c, slot); +if (!extent_buffer_uptodate (next)) +return -EIO ; +break ; + }while (level <BTRFS_MAX_LEVEL ); + path->slots[level] = slot; +while (1 ) { + level--; + c = path->nodes[level]; +free_extent_buffer (c); + path->nodes[level] = next; + path->slots[level] =0 ; +if (level == path->lowest_level) +break ; + next =btrfs_read_node_slot (next,0 ); +if (!extent_buffer_uptodate (next)) +return -EIO ; + } +return 0 ; +} +static void bfs_print_children (struct extent_buffer *root_eb,unsigned int mode) {struct btrfs_fs_info *fs_info = root_eb->fs_info;
@@ -1528,7 +1579,7 @@ static void bfs_print_children(struct extent_buffer *root_eb, unsigned int mode)/* Print all sibling tree blocks */ while (1 ) {btrfs_print_tree (path.nodes[cur_level], mode); - ret =btrfs_next_sibling_tree_block (fs_info, &path); + ret =next_sibling_tree_block (fs_info, &path);if (ret <0 ) goto out;if (ret >0 ) {
Signature · 1 line
2.40.0
PATCH 18/26 btrfs-progs: don't set the ->commit_root in btrfs_create_tree
In reply to Josef BacikIn btrfs_create_tree we set ->commit_root to the current node, however we don't add the root to the dirty list, so this is never cleaned up. This is a problem in btrfs-progs because the transaction commit stuff clears the commit_root when we write the dirty root out, so if we try to re-modify this root later we'll fail to start the transaction. Fix this by noting that we do this differently in the kernel, and drop the assignment as we're inserting the root into the tree_root in this function and thus don't need to update it again at transaction commit time.
--- kernel-shared/disk-io.c | 9 ++++++++- 1 file changed, 8 insertions(+), 1 deletion(-)
kernel-shared/disk-io.c +8 -1
@@ -2384,7 +2384,14 @@ struct btrfs_root *btrfs_create_tree(struct btrfs_trans_handle *trans,btrfs_mark_buffer_dirty (leaf);extent_buffer_get (root->node); - root->commit_root = root->node; + +/* +* MODIFIED: +* - In the kernel we set ->commit_root here, however in btrfs-progs +* confuses the transaction code. For now don't set the commit_root +* here, if we update transaction.c to match the kernel version we +* need to revisit this. +*/ set_bit (BTRFS_ROOT_TRACK_DIRTY , &root->state); root->root_item.flags =0 ;
Signature · 1 line
2.40.0
PATCH 14/26 btrfs-progs: drop btrfs_init_path
In reply to Josef BacikThis simply zero's out the path, and this is used everywhere we use a stack path. Drop this usage and simply init the path's to empty instead of using a function to do the memset.
--- check/clear-cache.c | 10 +--- check/main.c | 94 ++++++++++---------------------- check/mode-common.c | 35 ++++-------- check/mode-lowmem.c | 84 +++++++++------------------- check/qgroup-verify.c | 14 ++--- check/repair.c | 3 +- cmds/inspect-dump-tree.c | 3 +- cmds/inspect-tree-stats.c | 3 +- cmds/rescue-chunk-recover.c | 13 ++--- cmds/restore.c | 21 +++---- convert/main.c | 9 +-- convert/source-fs.c | 4 +- image/main.c | 13 ++--- kernel-shared/ctree.c | 5 -- kernel-shared/ctree.h | 1 - kernel-shared/extent-tree.c | 3 +- kernel-shared/file.c | 3 +- kernel-shared/free-space-cache.c | 4 +- kernel-shared/inode.c | 5 +- kernel-shared/print-tree.c | 3 +- kernel-shared/volumes.c | 6 +- mkfs/main.c | 15 ++--- mkfs/rootdir.c | 10 +--- quick-test.c | 6 +- tune/change-csum.c | 9 +-- tune/change-uuid.c | 6 +- 26 files changed, 116 insertions(+), 266 deletions(-)
check/clear-cache.c +3 -7
@@ -129,11 +129,9 @@ close_out:static int check_free_space_tree (struct btrfs_root *root) {struct btrfs_key key = {0 }; -struct btrfs_path path; +struct btrfs_path path = {};int ret =0 ; -btrfs_init_path (&path); -while (1 ) {struct btrfs_block_group *bg;u64 cur_start = key.objectid;
@@ -447,7 +445,6 @@ out:int truncate_free_ino_items (struct btrfs_root *root) { -struct btrfs_path path;struct btrfs_key key = { .objectid =BTRFS_FREE_INO_OBJECTID , .type = (u8)-1 , .offset = (u64)-1 };
@@ -465,9 +462,9 @@ int truncate_free_ino_items(struct btrfs_root *root)struct btrfs_file_extent_item *fi;struct btrfs_root *csum_root;struct btrfs_key found_key; +struct btrfs_path path = {};u8 found_type; -btrfs_init_path (&path); ret =btrfs_search_slot (trans, root, &key, &path,-1 ,1 );if (ret <0 ) {btrfs_abort_transaction (trans, ret);
@@ -548,14 +545,13 @@ out:int clear_ino_cache_items (void ) {int ret; -struct btrfs_path path; +struct btrfs_path path = {};struct btrfs_key key; key.objectid =BTRFS_FS_TREE_OBJECTID ; key.type =BTRFS_ROOT_ITEM_KEY ; key.offset =0 ; -btrfs_init_path (&path); ret =btrfs_search_slot (NULL , gfs_info->tree_root, &key, &path,0 ,0 );if (ret <0 )return ret;
check/main.c +29 -65
432 lines not on this page · raw message
check/mode-common.c +11 -24
@@ -52,10 +52,9 @@ static int check_prealloc_data_ref(u64 disk_bytenr,u64 offset =btrfs_extent_data_ref_offset (eb, dref);struct btrfs_root *root;struct btrfs_key key; -struct btrfs_path path; +struct btrfs_path path = {};int ret; -btrfs_init_path (&path); key.objectid = rootid; key.type =BTRFS_ROOT_ITEM_KEY ; key.offset = (u64)-1 ;
@@ -190,7 +189,7 @@ 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_path path = {};struct btrfs_key key;int ret;struct btrfs_extent_item *ei;
@@ -202,7 +201,6 @@ int check_prealloc_extent_written(u64 disk_bytenr, u64 num_bytes) key.type =BTRFS_EXTENT_ITEM_KEY ; key.offset = num_bytes; -btrfs_init_path (&path); ret =btrfs_search_slot (NULL , extent_root, &key, &path,0 ,0 );if (ret >0 ) { fprintf(stderr,
@@ -303,7 +301,7 @@ int count_csum_range(u64 start, u64 len, u64 *found) {struct btrfs_root *csum_root =btrfs_csum_root (gfs_info, start);struct btrfs_key key; -struct btrfs_path path; +struct btrfs_path path = {};struct extent_buffer *leaf;int ret;size_t size;
@@ -311,8 +309,6 @@ int count_csum_range(u64 start, u64 len, u64 *found)u64 csum_end;u16 csum_size = gfs_info->csum_size; -btrfs_init_path (&path); - key.objectid =BTRFS_EXTENT_CSUM_OBJECTID ; key.offset = start; key.type =BTRFS_EXTENT_CSUM_KEY ;
@@ -416,7 +412,6 @@ static int get_highest_inode(struct btrfs_trans_handle *trans,struct btrfs_key key, found_key;int ret; -btrfs_init_path (path); key.objectid =BTRFS_LAST_FREE_OBJECTID ; key.offset =-1 ; key.type =BTRFS_INODE_ITEM_KEY ;
@@ -654,10 +649,9 @@ int delete_corrupted_dir_item(struct btrfs_trans_handle *trans, u32 namelen) {struct btrfs_dir_item *di_item; -struct btrfs_path path; +struct btrfs_path path = {};int ret; -btrfs_init_path (&path); ret =btrfs_search_slot (trans, root, di_key, &path,0 ,1 );if (ret >0 ) { error("key (%llu %u %llu) doesn't exist in root %llu",
@@ -736,7 +730,7 @@ static int find_file_type_dir_index(struct btrfs_root *root, u64 ino, u64 dirid, u64 index, const char *name, u32 name_len, u32 *imode_ret) { - struct btrfs_path path; + struct btrfs_path path = {};struct btrfs_key key;struct btrfs_key location;struct btrfs_dir_item *di;
@@ -746,7 +740,6 @@ static int find_file_type_dir_index(struct btrfs_root *root, u64 ino, u64 dirid,u32 len;int ret; -btrfs_init_path (&path); key.objectid = dirid; key.offset = index; key.type =BTRFS_DIR_INDEX_KEY ;
@@ -788,7 +781,7 @@ static int find_file_type_dir_item(struct btrfs_root *root, u64 ino, u64 dirid, const char *name, u32 name_len, u32 *imode_ret) { - struct btrfs_path path; + struct btrfs_path path = {};struct btrfs_key key;struct btrfs_key location;struct btrfs_dir_item *di;
@@ -800,7 +793,6 @@ static int find_file_type_dir_item(struct btrfs_root *root, u64 ino, u64 dirid,u32 len;int ret; -btrfs_init_path (&path); key.objectid = dirid; key.offset =btrfs_name_hash (name, name_len); key.type =BTRFS_DIR_INDEX_KEY ;
@@ -1056,7 +1048,7 @@ int check_repair_free_space_inode(struct btrfs_path *path)int recow_extent_buffer (struct btrfs_root *root,struct extent_buffer *eb) { -struct btrfs_path path; +struct btrfs_path path = {};struct btrfs_trans_handle *trans;struct btrfs_key key;int ret;
@@ -1077,7 +1069,6 @@ int recow_extent_buffer(struct btrfs_root *root, struct extent_buffer *eb)if (IS_ERR (trans))return PTR_ERR (trans); -btrfs_init_path (&path); path.lowest_level =btrfs_header_level (eb);if (path.lowest_level)btrfs_node_key_to_cpu (eb, &key,0 );
@@ -1100,7 +1091,7 @@ int get_extent_item_generation(u64 bytenr, u64 *gen_ret) {struct btrfs_root *root =btrfs_extent_root (gfs_info, bytenr);struct btrfs_extent_item *ei; -struct btrfs_path path; +struct btrfs_path path = {};struct btrfs_key key;int ret;
@@ -1108,7 +1099,6 @@ int get_extent_item_generation(u64 bytenr, u64 *gen_ret) key.type =BTRFS_METADATA_ITEM_KEY ; key.offset = (u64)-1 ; -btrfs_init_path (&path); ret =btrfs_search_slot (NULL , root, &key, &path,0 ,0 );/* Not possible */ if (ret ==0 )
@@ -1232,7 +1222,7 @@ static int fill_csum_tree_from_one_fs_root(struct btrfs_trans_handle *trans, struct btrfs_root *cur_root) {struct btrfs_root *csum_root; -struct btrfs_path path; +struct btrfs_path path = {};struct btrfs_key key;struct extent_buffer *node;struct btrfs_file_extent_item *fi;
@@ -1247,7 +1237,6 @@ static int fill_csum_tree_from_one_fs_root(struct btrfs_trans_handle *trans,if (!buf)return -ENOMEM ; -btrfs_init_path (&path); key.objectid =0 ; key.offset =0 ; key.type =0 ;
@@ -1339,7 +1328,7 @@ out:static int fill_csum_tree_from_fs (struct btrfs_trans_handle *trans) { -struct btrfs_path path; +struct btrfs_path path = {};struct btrfs_root *tree_root = gfs_info->tree_root;struct btrfs_root *cur_root;struct extent_buffer *node;
@@ -1347,7 +1336,6 @@ static int fill_csum_tree_from_fs(struct btrfs_trans_handle *trans)int slot =0 ;int ret =0 ; -btrfs_init_path (&path); key.objectid =BTRFS_FS_TREE_OBJECTID ; key.offset =0 ; key.type =BTRFS_ROOT_ITEM_KEY ;
@@ -1486,14 +1474,13 @@ static int fill_csum_tree_from_extent(struct btrfs_trans_handle *trans, struct btrfs_root *extent_root) {struct btrfs_root *csum_root; -struct btrfs_path path; +struct btrfs_path path = {};struct btrfs_extent_item *ei;struct extent_buffer *leaf;char *buf;struct btrfs_key key;int ret; -btrfs_init_path (&path); key.objectid =0 ; key.type =BTRFS_EXTENT_ITEM_KEY ; key.offset =0 ;
check/mode-lowmem.c +26 -58
414 lines not on this page · raw message
check/qgroup-verify.c +4 -10
@@ -938,7 +938,7 @@ static int load_quota_info(struct btrfs_fs_info *info)int ret;struct btrfs_root *root = info->quota_root;struct btrfs_root *tmproot; -struct btrfs_path path; +struct btrfs_path path = {};struct btrfs_key key;struct btrfs_key root_key;struct btrfs_disk_key disk_key;
@@ -954,8 +954,6 @@ loop:* items. The 2nd pass picks up relation items and glues them to their * respective count structures. */ -btrfs_init_path (&path); - key.offset =0 ; key.objectid = search_relations ?0 :BTRFS_QGROUP_RELATION_KEY ; key.type =0 ;
@@ -1164,13 +1162,11 @@ static int scan_extents(struct btrfs_fs_info *info,int ret, i, nr, level;struct btrfs_root *root =btrfs_extent_root (info, start);struct btrfs_key key; -struct btrfs_path path; +struct btrfs_path path = {};struct btrfs_disk_key disk_key;struct extent_buffer *leaf;u64 bytenr =0 , num_bytes =0 ; -btrfs_init_path (&path); - key.objectid = start; key.type =0 ; key.offset =0 ;
@@ -1562,7 +1558,7 @@ static int repair_qgroup_info(struct btrfs_fs_info *info,int ret;struct btrfs_root *root = info->quota_root;struct btrfs_trans_handle *trans; -struct btrfs_path path; +struct btrfs_path path = {};struct btrfs_qgroup_info_item *info_item;struct btrfs_key key;
@@ -1575,7 +1571,6 @@ static int repair_qgroup_info(struct btrfs_fs_info *info,if (IS_ERR (trans))return PTR_ERR (trans); -btrfs_init_path (&path); key.objectid =0 ; key.type =BTRFS_QGROUP_INFO_KEY ; key.offset = count->qgroupid;
@@ -1619,7 +1614,7 @@ static int repair_qgroup_status(struct btrfs_fs_info *info, bool silent)int ret;struct btrfs_root *root = info->quota_root;struct btrfs_trans_handle *trans; -struct btrfs_path path; +struct btrfs_path path = {};struct btrfs_key key;struct btrfs_qgroup_status_item *status_item;
@@ -1630,7 +1625,6 @@ static int repair_qgroup_status(struct btrfs_fs_info *info, bool silent)if (IS_ERR (trans))return PTR_ERR (trans); -btrfs_init_path (&path); key.objectid =0 ; key.type =BTRFS_QGROUP_STATUS_KEY ; key.offset =0 ;
check/repair.c +1 -2
@@ -172,12 +172,11 @@ static int populate_used_from_extent_root(struct btrfs_root *root, {struct btrfs_fs_info *fs_info = root->fs_info;struct extent_buffer *leaf; -struct btrfs_path path; +struct btrfs_path path = {};struct btrfs_key key;int slot;int ret; -btrfs_init_path (&path); key.offset =0 ; key.objectid =0 ; key.type =BTRFS_EXTENT_ITEM_KEY ;
cmds/inspect-dump-tree.c +1 -2
@@ -310,7 +310,7 @@ static int cmd_inspect_dump_tree(const struct cmd_struct *cmd, {struct btrfs_root *root;struct btrfs_fs_info *info; -struct btrfs_path path; +struct btrfs_path path = {};struct btrfs_key key;struct btrfs_root_item ri;struct extent_buffer *leaf;
@@ -545,7 +545,6 @@ static int cmd_inspect_dump_tree(const struct cmd_struct *cmd, } tree_root_scan = info->tree_root; -btrfs_init_path (&path); again:if (!extent_buffer_uptodate (tree_root_scan->node)) goto no_node;
cmds/inspect-tree-stats.c +1 -2
@@ -314,7 +314,7 @@ static int calc_root_size(struct btrfs_root *tree_root, struct btrfs_key *key, int find_inline) {struct btrfs_root *root; -struct btrfs_path path; +struct btrfs_path path = {};struct rb_node *n;struct timeval start, end, diff = {0 };struct root_stats stat;
@@ -329,7 +329,6 @@ static int calc_root_size(struct btrfs_root *tree_root, struct btrfs_key *key,return 1 ; } -btrfs_init_path (&path);memset (&stat,0 ,sizeof (stat)); level =btrfs_header_level (root->node); stat.lowest_bytenr =btrfs_header_bytenr (root->node);
cmds/rescue-chunk-recover.c +4 -9
@@ -556,7 +556,7 @@ static int check_chunk_by_metadata(struct recover_control *rc,int ret;int i;int slot; -struct btrfs_path path; +struct btrfs_path path = {};struct btrfs_key key;struct btrfs_root *dev_root;struct stripe *stripe;
@@ -564,8 +564,6 @@ static int check_chunk_by_metadata(struct recover_control *rc,struct btrfs_block_group_item *bg_ptr;struct extent_buffer *l; -btrfs_init_path (&path); -if (bg_only) goto bg_check;
@@ -985,7 +983,7 @@ static int block_group_remove_all_extent_items(struct btrfs_trans_handle *trans, {struct btrfs_fs_info *fs_info = root->fs_info;struct btrfs_key key; -struct btrfs_path path; +struct btrfs_path path = {};struct extent_buffer *leaf;u64 start = bg->objectid;u64 end = bg->objectid + bg->offset;
@@ -995,7 +993,6 @@ static int block_group_remove_all_extent_items(struct btrfs_trans_handle *trans,int i;int del_s, del_nr; -btrfs_init_path (&path); root =btrfs_extent_root (fs_info, start); key.objectid = start;
@@ -1384,14 +1381,13 @@ static int rebuild_block_group(struct btrfs_trans_handle *trans,struct btrfs_fs_info *fs_info = root->fs_info;struct chunk_record *chunk_rec;struct btrfs_key search_key; -struct btrfs_path path; +struct btrfs_path path = {};u64 used =0 ;int ret =0 ;if (list_empty (&rc->rebuild_chunks))return 0 ; -btrfs_init_path (&path);list_for_each_entry (chunk_rec, &rc->rebuild_chunks, list) { search_key.objectid = chunk_rec->offset; search_key.type =BTRFS_EXTENT_ITEM_KEY ;
@@ -1968,7 +1964,7 @@ static int rebuild_raid_data_chunk_stripes(struct recover_control *rc,int i;int ret =0 ;int slot; -struct btrfs_path path; +struct btrfs_path path = {};struct btrfs_key prev_key;struct btrfs_key key;struct btrfs_root *csum_root;
@@ -1988,7 +1984,6 @@ static int rebuild_raid_data_chunk_stripes(struct recover_control *rc,LIST_HEAD (unordered);LIST_HEAD (candidates); -btrfs_init_path (&path);list_splice_init (&chunk->dextents, &candidates); again:if (list_is_last (candidates.next, &candidates))
cmds/restore.c +7 -14
@@ -474,7 +474,7 @@ static int set_file_xattrs(struct btrfs_root *root, u64 inode, int fd, const char *file_name) { struct btrfs_key key; -struct btrfs_path path; +struct btrfs_path path = {};struct extent_buffer *leaf;struct btrfs_dir_item *di;u32 name_len =0 ;
@@ -485,7 +485,6 @@ static int set_file_xattrs(struct btrfs_root *root, u64 inode,char *data =NULL ;int ret =0 ; -btrfs_init_path (&path); key.objectid = inode; key.type =BTRFS_XATTR_ITEM_KEY ; key.offset =0 ;
@@ -571,11 +570,10 @@ out:static int copy_metadata (struct btrfs_root *root,int fd,struct btrfs_key *key) { -struct btrfs_path path; +struct btrfs_path path = {};struct btrfs_inode_item *inode_item;int ret; -btrfs_init_path (&path); ret =btrfs_lookup_inode (NULL , root, &path, key,0 );if (ret ==0 ) {struct btrfs_timespec *bts;
@@ -620,7 +618,7 @@ static int copy_file(struct btrfs_root *root, int fd, struct btrfs_key *key, const char *file) {struct extent_buffer *leaf; -struct btrfs_path path; +struct btrfs_path path = {};struct btrfs_file_extent_item *fi;struct btrfs_inode_item *inode_item;struct btrfs_timespec *bts;
@@ -632,7 +630,6 @@ static int copy_file(struct btrfs_root *root, int fd, struct btrfs_key *key,struct timespec times[2 ];bool times_ok = false; -btrfs_init_path (&path); ret =btrfs_lookup_inode (NULL , root, &path, key,0 );if (ret ==0 ) { inode_item = btrfs_item_ptr(path.nodes[0], path.slots[0],
@@ -798,7 +795,7 @@ static int overwrite_ok(const char * path)static int copy_symlink (struct btrfs_root *root,struct btrfs_key *key,const char *file) { -struct btrfs_path path; +struct btrfs_path path = {};struct extent_buffer *leaf;struct btrfs_file_extent_item *extent_item;struct btrfs_inode_item *inode_item;
@@ -821,7 +818,6 @@ static int copy_symlink(struct btrfs_root *root, struct btrfs_key *key, } } -btrfs_init_path (&path); key->type =BTRFS_EXTENT_DATA_KEY ; key->offset =0 ; ret =btrfs_search_slot (NULL , root, key, &path,0 ,0 );
@@ -913,7 +909,7 @@ static int search_dir(struct btrfs_root *root, struct btrfs_key *key, const char *output_rootdir, const char *in_dir, const regex_t *mreg) { - struct btrfs_path path; + struct btrfs_path path = {};struct extent_buffer *leaf;struct btrfs_dir_item *dir_item;struct btrfs_key found_key, location;
@@ -924,7 +920,6 @@ static int search_dir(struct btrfs_root *root, struct btrfs_key *key,int fd;u8 type; -btrfs_init_path (&path); key->offset =0 ; key->type =BTRFS_DIR_INDEX_KEY ; ret =btrfs_search_slot (NULL , root, key, &path,0 ,0 );
@@ -1159,7 +1154,7 @@ static int do_list_roots(struct btrfs_root *root)struct btrfs_key key;struct btrfs_key found_key;struct btrfs_disk_key disk_key; -struct btrfs_path path; +struct btrfs_path path = {};struct extent_buffer *leaf;struct btrfs_root_item ri;unsigned long offset;
@@ -1168,7 +1163,6 @@ static int do_list_roots(struct btrfs_root *root) root = root->fs_info->tree_root; -btrfs_init_path (&path); key.offset =0 ; key.objectid =0 ; key.type =BTRFS_ROOT_ITEM_KEY ;
@@ -1287,13 +1281,12 @@ static struct btrfs_root *open_fs(const char *dev, u64 root_location,static int find_first_dir (struct btrfs_root *root,u64 *objectid) { -struct btrfs_path path; +struct btrfs_path path = {};struct btrfs_key found_key;struct btrfs_key key;int ret =-1 ;int i; -btrfs_init_path (&path); key.objectid =0 ; key.type =BTRFS_DIR_INDEX_KEY ; key.offset =0 ;
convert/main.c +3 -6
@@ -790,7 +790,7 @@ static int create_image(struct btrfs_root *root, {struct btrfs_inode_item buf;struct btrfs_trans_handle *trans; -struct btrfs_path path; +struct btrfs_path path = {};struct btrfs_key key;struct cache_extent *cache;struct cache_tree used_tmp;
@@ -807,7 +807,6 @@ static int create_image(struct btrfs_root *root,return PTR_ERR (trans);cache_tree_init (&used_tmp); -btrfs_init_path (&path); ret =btrfs_find_free_objectid (trans, root,BTRFS_FIRST_FREE_OBJECTID , &ino);
@@ -1448,7 +1447,7 @@ static int check_convert_image(struct btrfs_root *image_root, u64 ino, u64 total_size, char *reserved_ranges[]) { struct btrfs_key key; -struct btrfs_path path; +struct btrfs_path path = {};struct btrfs_fs_info *fs_info = image_root->fs_info;u64 checked_bytes =0 ;int ret;
@@ -1457,7 +1456,6 @@ static int check_convert_image(struct btrfs_root *image_root, u64 ino, key.offset =0 ; key.type =BTRFS_EXTENT_DATA_KEY ; -btrfs_init_path (&path); ret =btrfs_search_slot (NULL , image_root, &key, &path,0 ,0 );/* * It's possible that some fs doesn't store any (including sb)
@@ -1613,7 +1611,7 @@ static int do_rollback(const char *devname)struct btrfs_root *image_root;struct btrfs_fs_info *fs_info;struct btrfs_key key; -struct btrfs_path path; +struct btrfs_path path = {};struct btrfs_dir_item *dir;struct btrfs_inode_item *inode_item;struct btrfs_root_ref *root_ref_item;
@@ -1673,7 +1671,6 @@ static int do_rollback(const char *devname) key.objectid =CONV_IMAGE_SUBVOL_OBJECTID ; key.type =BTRFS_ROOT_BACKREF_KEY ; key.offset =BTRFS_FS_TREE_OBJECTID ; -btrfs_init_path (&path); ret =btrfs_search_slot (NULL , fs_info->tree_root, &key, &path,0 ,0 );if (ret >0 ) {error ("unable to find source fs image subvolume, is it deleted?" );
convert/source-fs.c +1 -3
@@ -228,7 +228,7 @@ int record_file_blocks(struct blk_iterate_data *data,int ret =0 ;struct btrfs_root *root = data->root;struct btrfs_root *convert_root = data->convert_root; -struct btrfs_path path; +struct btrfs_path path = {};u32 sectorsize = root->fs_info->sectorsize;u64 file_pos = file_block * sectorsize;u64 old_disk_bytenr = disk_block * sectorsize;
@@ -241,8 +241,6 @@ int record_file_blocks(struct blk_iterate_data *data, data->objectid, data->inode, file_pos,0 , num_bytes); -btrfs_init_path (&path); -/* * Search real disk bytenr from convert root */
image/main.c +4 -9
@@ -1020,7 +1020,7 @@ static int create_metadump(const char *input, FILE *out, int num_threads, int walk_trees, bool dump_data) {struct btrfs_root *root; -struct btrfs_path path; +struct btrfs_path path = {};struct metadump_struct metadump;int ret;int err =0 ;
@@ -1048,8 +1048,6 @@ static int create_metadump(const char *input, FILE *out, int num_threads, goto out; } -btrfs_init_path (&path); -if (walk_trees) { ret =copy_tree_blocks (root, root->fs_info->chunk_root->node, &metadump,1 );
@@ -2392,7 +2390,7 @@ static int fixup_device_size(struct btrfs_trans_handle *trans,struct btrfs_dev_item *dev_item;struct btrfs_dev_extent *dev_ext;struct btrfs_device *dev; -struct btrfs_path path; +struct btrfs_path path = {};struct extent_buffer *leaf;struct btrfs_root *root = fs_info->chunk_root;struct btrfs_key key;
@@ -2403,7 +2401,6 @@ static int fixup_device_size(struct btrfs_trans_handle *trans, dev_item = &fs_info->super_copy->dev_item; -btrfs_init_path (&path); devid =btrfs_stack_device_id (dev_item); key.objectid = devid;
@@ -2568,7 +2565,7 @@ static int remove_all_dev_extents(struct btrfs_trans_handle *trans) {struct btrfs_fs_info *fs_info = trans->fs_info;struct btrfs_root *root = fs_info->dev_root; -struct btrfs_path path; +struct btrfs_path path = {};struct btrfs_key key;struct extent_buffer *leaf;int slot;
@@ -2577,7 +2574,6 @@ static int remove_all_dev_extents(struct btrfs_trans_handle *trans) key.objectid =1 ; key.type =BTRFS_DEV_EXTENT_KEY ; key.offset =0 ; -btrfs_init_path (&path); ret =btrfs_search_slot (trans, root, &key, &path,-1 ,1 );if (ret <0 ) {
@@ -2944,7 +2940,7 @@ static int update_disk_super_on_device(struct btrfs_fs_info *info, {struct btrfs_key key;struct extent_buffer *leaf; -struct btrfs_path path; +struct btrfs_path path = {};struct btrfs_dev_item *dev_item;struct btrfs_super_block disk_super;char dev_uuid[BTRFS_UUID_SIZE ];
@@ -2958,7 +2954,6 @@ static int update_disk_super_on_device(struct btrfs_fs_info *info, key.type =BTRFS_DEV_ITEM_KEY ; key.offset = cur_devid; -btrfs_init_path (&path); ret =btrfs_search_slot (NULL , info->chunk_root, &key, &path,0 ,0 );if (ret) {error ("search key failed: %d" , ret);
kernel-shared/ctree.c +0 -5
@@ -83,11 +83,6 @@ u64 btrfs_extref_hash(u64 parent_objectid, const char *name, int len)return (u64 )crc32c (parent_objectid, name, len); } -inline void btrfs_init_path (struct btrfs_path *p) -{ -memset (p,0 ,sizeof (*p)); -} -struct btrfs_path *btrfs_alloc_path (void ) {struct btrfs_path *path;
kernel-shared/ctree.h +0 -1
@@ -989,7 +989,6 @@ int btrfs_find_item(struct btrfs_root *fs_root, struct btrfs_path *found_path,void btrfs_release_path (struct btrfs_path *p);struct btrfs_path *btrfs_alloc_path (void );void btrfs_free_path (struct btrfs_path *p); -void btrfs_init_path (struct btrfs_path *p);int btrfs_del_items (struct btrfs_trans_handle *trans,struct btrfs_root *root,struct btrfs_path *path,int slot,int nr);
kernel-shared/extent-tree.c +1 -2
@@ -3463,7 +3463,7 @@ int btrfs_remove_block_group(struct btrfs_trans_handle *trans, {struct btrfs_fs_info *fs_info = trans->fs_info;struct btrfs_block_group *block_group; -struct btrfs_path path; +struct btrfs_path path = {};int ret =0 ; block_group =btrfs_lookup_block_group (fs_info, bytenr);
@@ -3485,7 +3485,6 @@ int btrfs_remove_block_group(struct btrfs_trans_handle *trans,*/ btrfs_pin_extent (fs_info, bytenr, len); -btrfs_init_path (&path);/* delete block group item and chunk item */ ret =remove_block_group_item (trans, &path, block_group);btrfs_release_path (&path);
kernel-shared/file.c +1 -2
@@ -187,7 +187,7 @@ int btrfs_read_file(struct btrfs_root *root, u64 ino, u64 start, int len, {struct btrfs_fs_info *fs_info = root->fs_info;struct btrfs_key key; -struct btrfs_path path; +struct btrfs_path path = {};struct extent_buffer *leaf;struct btrfs_inode_item *ii;u64 isize;
@@ -203,7 +203,6 @@ int btrfs_read_file(struct btrfs_root *root, u64 ino, u64 start, int len,return -EINVAL ; } -btrfs_init_path (&path); key.objectid = ino; key.offset = start; key.type =BTRFS_EXTENT_DATA_KEY ;
kernel-shared/free-space-cache.c +1 -3
@@ -910,7 +910,7 @@ int btrfs_clear_free_space_cache(struct btrfs_trans_handle *trans, {struct btrfs_fs_info *fs_info = trans->fs_info;struct btrfs_root *tree_root = fs_info->tree_root; -struct btrfs_path path; +struct btrfs_path path = {};struct btrfs_key key;struct btrfs_disk_key location;struct btrfs_free_space_header *sc_header;
@@ -919,8 +919,6 @@ int btrfs_clear_free_space_cache(struct btrfs_trans_handle *trans,int slot;int ret; -btrfs_init_path (&path); - key.objectid =BTRFS_FREE_SPACE_OBJECTID ; key.type =0 ; key.offset = bg->start;
kernel-shared/inode.c +1 -4
@@ -585,7 +585,7 @@ struct btrfs_root *btrfs_mksubvol(struct btrfs_root *root,struct btrfs_fs_info *fs_info = root->fs_info;struct btrfs_root *tree_root = fs_info->tree_root;struct btrfs_root *new_root =NULL ; -struct btrfs_path path; +struct btrfs_path path = {};struct btrfs_inode_item *inode_item;struct extent_buffer *leaf;struct btrfs_key key;
@@ -600,7 +600,6 @@ struct btrfs_root *btrfs_mksubvol(struct btrfs_root *root,if (len ==0 || len >BTRFS_NAME_LEN )return NULL ; -btrfs_init_path (&path); key.objectid = dirid; key.type =BTRFS_DIR_INDEX_KEY ; key.offset = (u64)-1 ;
@@ -705,7 +704,6 @@ struct btrfs_root *btrfs_mksubvol(struct btrfs_root *root, new_root =NULL ; } fail: -btrfs_init_path (&path);return new_root; }
@@ -737,7 +735,6 @@ int btrfs_find_free_objectid(struct btrfs_trans_handle *trans, search_key.offset =0 ; search_key.type =0 ; -btrfs_init_path (path); start_found =0 ; ret =btrfs_search_slot (trans, root, &search_key, path,0 ,0 );if (ret <0 )
kernel-shared/print-tree.c +1 -2
@@ -1501,7 +1501,7 @@ out:static void bfs_print_children (struct extent_buffer *root_eb,unsigned int mode) {struct btrfs_fs_info *fs_info = root_eb->fs_info; -struct btrfs_path path; +struct btrfs_path path = {};int root_level =btrfs_header_level (root_eb);int cur_level;int ret;
@@ -1513,7 +1513,6 @@ static void bfs_print_children(struct extent_buffer *root_eb, unsigned int mode) mode |=BTRFS_PRINT_TREE_BFS ; mode &= ~(BTRFS_PRINT_TREE_DFS ); -btrfs_init_path (&path);/* For path */ extent_buffer_get (root_eb); path.nodes[root_level] = root_eb;
kernel-shared/volumes.c +2 -4
@@ -2664,7 +2664,7 @@ static int check_dev_extent_beyond_bytenr(struct btrfs_fs_info *fs_info, u64 physical) {struct btrfs_root *root = fs_info->dev_root; -struct btrfs_path path; +struct btrfs_path path = {};struct btrfs_dev_extent *dext;struct btrfs_key key;u64 dext_len;
@@ -2675,7 +2675,6 @@ static int check_dev_extent_beyond_bytenr(struct btrfs_fs_info *fs_info, key.type =BTRFS_DEV_EXTENT_KEY ; key.offset = (u64)-1 ; -btrfs_init_path (&path); ret =btrfs_search_slot (NULL , root, &key, &path,0 ,0 );if (ret <0 )return ret;
@@ -2714,7 +2713,7 @@ static int reset_device_item_total_bytes(struct btrfs_fs_info *fs_info, {struct btrfs_trans_handle *trans;struct btrfs_key key; -struct btrfs_path path; +struct btrfs_path path = {};struct btrfs_root *chunk_root = fs_info->chunk_root;struct btrfs_dev_item *di;u64 old_bytes = device->total_bytes;
@@ -2737,7 +2736,6 @@ static int reset_device_item_total_bytes(struct btrfs_fs_info *fs_info,return ret; } -btrfs_init_path (&path); ret =btrfs_search_slot (trans, chunk_root, &key, &path,0 ,1 );if (ret >0 ) {error ("failed to find DEV_ITEM for devid %llu" , device->devid);
mkfs/main.c +5 -10
@@ -235,11 +235,10 @@ err:static int __recow_root (struct btrfs_trans_handle *trans,struct btrfs_root *root) { -struct btrfs_path path; +struct btrfs_path path = {};struct btrfs_key key;int ret; -btrfs_init_path (&path); key.objectid =0 ; key.type =0 ; key.offset =0 ;
@@ -590,10 +589,9 @@ static int cleanup_temp_chunks(struct btrfs_fs_info *fs_info,struct btrfs_root *root =btrfs_block_group_root (fs_info);struct btrfs_key key;struct btrfs_key found_key; -struct btrfs_path path; +struct btrfs_path path = {};int ret =0 ; -btrfs_init_path (&path); trans =btrfs_start_transaction (root,1 );if (IS_ERR (trans)) { ret =PTR_ERR (trans);
@@ -707,7 +705,7 @@ static int create_data_reloc_tree(struct btrfs_trans_handle *trans)struct btrfs_fs_info *fs_info = trans->fs_info;struct btrfs_inode_item *inode;struct btrfs_root *root; -struct btrfs_path path; +struct btrfs_path path = {};struct btrfs_key key = { .objectid =BTRFS_DATA_RELOC_TREE_OBJECTID , .type =BTRFS_ROOT_ITEM_KEY ,
@@ -749,7 +747,6 @@ static int create_data_reloc_tree(struct btrfs_trans_handle *trans) key.objectid = ino; key.type =BTRFS_INODE_ITEM_KEY ; key.offset =0 ; -btrfs_init_path (&path); ret =btrfs_search_slot (trans, root, &key, &path,0 ,1 );if (ret >0 ) {
@@ -851,7 +848,7 @@ static int insert_qgroup_items(struct btrfs_trans_handle *trans, struct btrfs_fs_info *fs_info, u64 qgroupid) { -struct btrfs_path path; +struct btrfs_path path = {};struct btrfs_root *quota_root = fs_info->quota_root;struct btrfs_key key;int ret;
@@ -865,7 +862,6 @@ static int insert_qgroup_items(struct btrfs_trans_handle *trans, key.type =BTRFS_QGROUP_INFO_KEY ; key.offset = qgroupid; -btrfs_init_path (&path); ret =btrfs_insert_empty_item (trans, quota_root, &path, &key,sizeof (struct btrfs_qgroup_info_item ));btrfs_release_path (&path);
@@ -886,7 +882,7 @@ static int setup_quota_root(struct btrfs_fs_info *fs_info)struct btrfs_trans_handle *trans;struct btrfs_qgroup_status_item *qsi;struct btrfs_root *quota_root; -struct btrfs_path path; +struct btrfs_path path = {};struct btrfs_key key;int qgroup_repaired =0 ;int ret;
@@ -910,7 +906,6 @@ static int setup_quota_root(struct btrfs_fs_info *fs_info) key.type =BTRFS_QGROUP_STATUS_KEY ; key.offset =0 ; -btrfs_init_path (&path); ret =btrfs_insert_empty_item (trans, quota_root, &path, &key,sizeof (*qsi));if (ret <0 ) {
mkfs/rootdir.c +3 -7
@@ -455,7 +455,7 @@ static int traverse_directory(struct btrfs_trans_handle *trans,ino_t parent_inum, cur_inum;ino_t highest_inum =0 ;const char *parent_dir_name; -struct btrfs_path path; +struct btrfs_path path = {};struct extent_buffer *leaf;struct btrfs_key root_dir_key;u64 root_dir_inode_size =0 ;
@@ -476,8 +476,6 @@ static int traverse_directory(struct btrfs_trans_handle *trans, dir_entry->inum = parent_inum;list_add_tail (&dir_entry->list, &dir_head->list); -btrfs_init_path (&path); - root_dir_key.objectid =btrfs_root_dirid (&root->root_item); root_dir_key.offset =0 ; root_dir_key.type =BTRFS_INODE_ITEM_KEY ;
@@ -810,7 +808,7 @@ static int get_device_extent_end(struct btrfs_fs_info *fs_info, {struct btrfs_root *dev_root = fs_info->dev_root;struct btrfs_key key; -struct btrfs_path path; +struct btrfs_path path = {};struct btrfs_dev_extent *de;int ret;
@@ -818,7 +816,6 @@ static int get_device_extent_end(struct btrfs_fs_info *fs_info, key.type =BTRFS_DEV_EXTENT_KEY ; key.offset = (u64)-1 ; -btrfs_init_path (&path); ret =btrfs_search_slot (NULL , dev_root, &key, &path,0 ,0 );if (ret ==0 ) {error ("DEV_EXTENT for devid %llu not found" , devid);
@@ -862,7 +859,7 @@ static int set_device_size(struct btrfs_fs_info *fs_info,struct btrfs_root *chunk_root = fs_info->chunk_root;struct btrfs_trans_handle *trans;struct btrfs_dev_item *di; -struct btrfs_path path; +struct btrfs_path path = {};struct btrfs_key key;int ret;
@@ -871,7 +868,6 @@ static int set_device_size(struct btrfs_fs_info *fs_info,* super->dev_item will also get updated */ device->total_bytes = new_size; -btrfs_init_path (&path);/* Update device item in chunk tree */ trans =btrfs_start_transaction (chunk_root,1 );
quick-test.c +1 -5
@@ -41,7 +41,7 @@ int main(int ac, char **av) {int run_size =300000 ;int max_key =100000000 ;int tree_size =2 ; -struct btrfs_path path; +struct btrfs_path path = {};struct btrfs_root *root;struct btrfs_trans_handle *trans;
@@ -86,7 +86,6 @@ int main(int ac, char **av) {for (i =0 ; i < run_size; i++) { num =next_key (i, max_key); ins.objectid = num; -btrfs_init_path (&path);if (i %10000 ==0 )fprintf (stderr,"search %d:%d\n" , num, i); ret =btrfs_search_slot (NULL , root, &ins, &path,0 ,0 );
@@ -117,7 +116,6 @@ int main(int ac, char **av) {for (i =0 ; i < run_size/4 ; i++) { num =next_key (i, max_key); ins.objectid = num; -btrfs_init_path (&path); ret =btrfs_search_slot (trans, root, &ins, &path,-1 ,1 );if (!ret) {if (i %10000 ==0 )
@@ -163,7 +161,6 @@ int main(int ac, char **av) {for (i =0 ; i < run_size; i++) { num =next_key (i, max_key); ins.objectid = num; -btrfs_init_path (&path);if (i %10000 ==0 )fprintf (stderr,"search %d:%d\n" , num, i); ret =btrfs_search_slot (NULL , root, &ins, &path,0 ,0 );
@@ -181,7 +178,6 @@ int main(int ac, char **av) {struct extent_buffer *leaf;int slot; ins.objectid = (u64)-1 ; -btrfs_init_path (&path); ret =btrfs_search_slot (trans, root, &ins, &path,-1 ,1 );if (ret ==0 )BUG ();
tune/change-csum.c +3 -6
@@ -29,12 +29,11 @@ static int change_tree_csum(struct btrfs_trans_handle *trans, struct btrfs_root int csum_type) {struct btrfs_fs_info *fs_info = root->fs_info; -struct btrfs_path path; +struct btrfs_path path = {};struct btrfs_key key = {0 ,0 ,0 };int ret =0 ;int level; -btrfs_init_path (&path);/* No transaction, all in-place */ ret =btrfs_search_slot (NULL , root, &key, &path,0 ,0 );if (ret <0 )
@@ -298,7 +297,7 @@ static int fill_csum_tree_from_extent(struct btrfs_fs_info *fs_info) {struct btrfs_root *extent_root =btrfs_extent_root (fs_info,0 );struct btrfs_trans_handle *trans; -struct btrfs_path path; +struct btrfs_path path = {};struct btrfs_extent_item *ei;struct extent_buffer *leaf;char *buf;
@@ -313,7 +312,6 @@ static int fill_csum_tree_from_extent(struct btrfs_fs_info *fs_info)return -EINVAL ; } -btrfs_init_path (&path); key.objectid =0 ; key.type =BTRFS_EXTENT_ITEM_KEY ; key.offset =0 ;
@@ -373,7 +371,7 @@ int rewrite_checksums(struct btrfs_fs_info *fs_info, int csum_type)struct btrfs_root *root;struct btrfs_super_block *disk_super;struct btrfs_trans_handle *trans; -struct btrfs_path path; +struct btrfs_path path = {};struct btrfs_key key;u64 super_flags;int ret;
@@ -404,7 +402,6 @@ int rewrite_checksums(struct btrfs_fs_info *fs_info, int csum_type)return ret; } -btrfs_init_path (&path); key.objectid =BTRFS_CSUM_TREE_TMP_OBJECTID ; key.type =BTRFS_TEMPORARY_ITEM_KEY ; key.offset =0 ;
tune/change-uuid.c +2 -4
@@ -81,11 +81,10 @@ static int change_buffer_header_uuid(struct extent_buffer *eb, uuid_t new_fsid)static int change_extent_tree_uuid (struct btrfs_fs_info *fs_info,uuid_t new_fsid) {struct btrfs_root *root =btrfs_extent_root (fs_info,0 ); -struct btrfs_path path; +struct btrfs_path path = {};struct btrfs_key key = {0 ,0 ,0 };int ret =0 ; -btrfs_init_path (&path);/* * Here we don't use transaction as it will takes a lot of reserve * space, and that will make a near-full btrfs unable to change uuid
@@ -161,11 +160,10 @@ static int change_device_uuid(struct extent_buffer *eb, int slot,static int change_chunk_tree_uuid (struct btrfs_root *root,uuid_t new_fsid) { -struct btrfs_path path; +struct btrfs_path path = {};struct btrfs_key key = {0 ,0 ,0 };int ret =0 ; -btrfs_init_path (&path);/* No transaction again */ ret =btrfs_search_slot (NULL , root, &key, &path,0 ,0 );if (ret <0 )
Signature · 1 line
2.40.0
PATCH 16/26 btrfs-progs: move btrfs_record_file_extent and code into a new file
In reply to Josef BacikThis function and it's related functions only exist for the utilities that populate existing file systems, and do not exist in the upstream kernel. Move this function and the related function into it's own common source file and out of the kernel-shared sources, and then update all of the users to include the new location of this code.
--- Makefile | 1 + btrfs-map-logical.c | 1 + common/extent-tree-utils.c | 282 ++++++++++++++++++++++++++++++++++++ common/extent-tree-utils.h | 28 ++++ convert/main.c | 1 + convert/source-fs.c | 1 + kernel-shared/ctree.c | 24 --- kernel-shared/ctree.h | 7 - kernel-shared/extent-tree.c | 234 ------------------------------ mkfs/rootdir.c | 1 + 10 files changed, 315 insertions(+), 265 deletions(-) create mode 100644 common/extent-tree-utils.c create mode 100644 common/extent-tree-utils.h
Makefile +1 -0
@@ -196,6 +196,7 @@ objects = \ common/device-scan.o \ common/device-utils.o \ common/extent-cache.o \ + common/extent-tree-utils.o \ common/filesystem-utils.o \ common/format-output.o \ common/fsfeatures.o \
btrfs-map-logical.c +1 -0
@@ -33,6 +33,7 @@#include "common/utils.h" #include "common/help.h" #include "common/extent-cache.h" +#include "common/extent-tree-utils.h" #include "common/string-utils.h" #include "cmds/commands.h"
common/extent-tree-utils.c new file +282 -0
282 lines not on this page · raw message
common/extent-tree-utils.h new file +28 -0
@@ -0,0 +1,28 @@ +/* +* This program is free software; you can redistribute it and/or +* modify it under the terms of the GNU General Public +* License v2 as published by the Free Software Foundation. +* +* This program is distributed in the hope that it will be useful, +* but WITHOUT ANY WARRANTY; without even the implied warranty of +* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU +* General Public License for more details. +* +* You should have received a copy of the GNU General Public +* License along with this program; if not, write to the +* Free Software Foundation, Inc., 59 Temple Place - Suite 330, +* Boston, MA 021110-1307, USA. +*/ + +#ifndef _EXTENT_TREE_UTILS_H_ +#define _EXTENT_TREE_UTILS_H_ + +int btrfs_next_extent_item (struct btrfs_root *root,struct btrfs_path *path, +u64 max_objectid); +int btrfs_record_file_extent (struct btrfs_trans_handle *trans, +struct btrfs_root *root,u64 objectid, +struct btrfs_inode_item *inode, +u64 file_pos,u64 disk_bytenr, +u64 num_bytes); + +#endif /* _EXTENT_TREE_UTILS_H_ */
convert/main.c +1 -0
@@ -114,6 +114,7 @@#include "common/device-scan.h" #include "common/box.h" #include "common/open-utils.h" +#include "common/extent-tree-utils.h" #include "cmds/commands.h" #include "check/repair.h" #include "mkfs/common.h"
convert/source-fs.c +1 -0
@@ -24,6 +24,7 @@#include "common/internal.h" #include "common/messages.h" #include "common/extent-cache.h" +#include "common/extent-tree-utils.h" #include "convert/common.h" #include "convert/source-fs.h"
kernel-shared/ctree.c +0 -24
@@ -3042,30 +3042,6 @@ int btrfs_previous_extent_item(struct btrfs_root *root,return 1 ; } -/* -* Search in extent tree to found next meta/data extent -* Caller needs to check for no-hole or skinny metadata features. -*/ -int btrfs_next_extent_item (struct btrfs_root *root, -struct btrfs_path *path,u64 max_objectid) -{ -struct btrfs_key found_key; -int ret; - -while (1 ) { - ret =btrfs_next_item (root, path); -if (ret) -return ret; -btrfs_item_key_to_cpu (path->nodes[0 ], &found_key, - path->slots[0 ]); -if (found_key.objectid > max_objectid) -return 1 ; -if (found_key.type ==BTRFS_EXTENT_ITEM_KEY || - found_key.type ==BTRFS_METADATA_ITEM_KEY ) -return 0 ; - } -} -/* * Search uuid tree - unmounted *
kernel-shared/ctree.h +0 -7
@@ -928,11 +928,6 @@ int btrfs_make_block_groups(struct btrfs_trans_handle *trans, struct btrfs_fs_info *fs_info);int btrfs_update_block_group (struct btrfs_trans_handle *trans,u64 bytenr,u64 num,int alloc,int mark_free); -int btrfs_record_file_extent (struct btrfs_trans_handle *trans, -struct btrfs_root *root,u64 objectid, -struct btrfs_inode_item *inode, -u64 file_pos,u64 disk_bytenr, -u64 num_bytes);int btrfs_remove_block_group (struct btrfs_trans_handle *trans,u64 bytenr,u64 len); void free_excluded_extents(struct btrfs_fs_info *fs_info,
@@ -955,8 +950,6 @@ int btrfs_previous_item(struct btrfs_root *root, int type);int btrfs_previous_extent_item (struct btrfs_root *root,struct btrfs_path *path,u64 min_objectid); -int btrfs_next_extent_item (struct btrfs_root *root, -struct btrfs_path *path,u64 max_objectid); int btrfs_cow_block(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct extent_buffer *buf, struct extent_buffer *parent, int parent_slot,
kernel-shared/extent-tree.c +0 -234
240 lines not on this page · raw message
mkfs/rootdir.c +1 -0
@@ -39,6 +39,7 @@#include "common/internal.h" #include "common/messages.h" #include "common/path-utils.h" +#include "common/extent-tree-utils.h" #include "mkfs/rootdir.h" static u32 fs_block_size;
Signature · 1 line
2.40.0
PATCH 19/26 btrfs-progs: remove btrfs_create_root
In reply to Josef BacikWe have btrfs_create_root and btrfs_create_tree that do essentially the same thing. However btrfs_create_root isn't in the kernel, and btrfs_create_tree is. Update all of the callers of btrfs_create_root to use btrfs_create_tree instead and then remove btrfs_create_root.
--- kernel-shared/ctree.c | 123 ------------------------------------------ kernel-shared/ctree.h | 2 - mkfs/main.c | 14 +++-- tune/change-csum.c | 11 +++- tune/convert-bgt.c | 13 +++-- 5 files changed, 29 insertions(+), 134 deletions(-)
kernel-shared/ctree.c +0 -123
@@ -193,129 +193,6 @@ int btrfs_copy_root(struct btrfs_trans_handle *trans,return 0 ; } -/* -* Create a new tree root, with root objectid set to @objectid. -* -* NOTE: Doesn't support tree with non-zero offset, like data reloc tree. -*/ -int btrfs_create_root (struct btrfs_trans_handle *trans, -struct btrfs_fs_info *fs_info,u64 objectid) -{ -struct extent_buffer *node; -struct btrfs_root *new_root; -struct btrfs_disk_key disk_key; -struct btrfs_key location; -struct btrfs_root_item root_item = {0 }; -int ret; - - new_root =malloc (sizeof (*new_root)); -if (!new_root) -return -ENOMEM ; - -btrfs_setup_root (new_root, fs_info, objectid); -if (!is_fstree (objectid)) -set_bit (BTRFS_ROOT_TRACK_DIRTY , &new_root->state); -add_root_to_dirty_list (new_root); - - new_root->objectid = objectid; - new_root->root_key.objectid = objectid; - new_root->root_key.type =BTRFS_ROOT_ITEM_KEY ; - new_root->root_key.offset =0 ; - - node =btrfs_alloc_tree_block (trans, new_root, fs_info->nodesize, - objectid, &disk_key,0 ,0 ,0 , -BTRFS_NESTING_NORMAL ); -if (IS_ERR (node)) { - ret =PTR_ERR (node); -error ("failed to create root node for tree %llu: %d (%m)" , - objectid, ret); -return ret; - } - new_root->node = node; - -memset_extent_buffer (node,0 ,0 ,sizeof (struct btrfs_header )); -btrfs_set_header_bytenr (node, node->start); -btrfs_set_header_generation (node, trans->transid); -btrfs_set_header_backref_rev (node,BTRFS_MIXED_BACKREF_REV ); -btrfs_set_header_owner (node, objectid); -write_extent_buffer (node, fs_info->fs_devices->metadata_uuid, -btrfs_header_fsid (),BTRFS_FSID_SIZE ); -write_extent_buffer (node, fs_info->chunk_tree_uuid, -btrfs_header_chunk_tree_uuid (node), -BTRFS_UUID_SIZE ); -btrfs_set_header_nritems (node,0 ); -btrfs_set_header_level (node,0 ); - ret =btrfs_inc_ref (trans, new_root, node,0 ); -if (ret <0 ) - goto free; - -/* -* Special tree roots may need to modify pointers in @fs_info -* Only quota is supported yet. -*/ -switch (objectid) { -case BTRFS_QUOTA_TREE_OBJECTID : -if (fs_info->quota_root) { -error ("quota root already exists" ); - ret = -EEXIST ; - goto free; - } - fs_info->quota_root = new_root; - fs_info->quota_enabled =1 ; -break ; -case BTRFS_BLOCK_GROUP_TREE_OBJECTID : -if (fs_info->block_group_root) { -error ("bg root already exists" ); - ret = -EEXIST ; - goto free; - } - fs_info->block_group_root = new_root; -break ; - -case BTRFS_CSUM_TREE_TMP_OBJECTID : - fs_info->csum_tree_tmp = new_root; -break ; -/* -* Essential trees can't be created by this function, yet. -* As we expect such skeleton exists, or a lot of functions like -* btrfs_alloc_tree_block() doesn't work at all -*/ -case BTRFS_ROOT_TREE_OBJECTID : -case BTRFS_EXTENT_TREE_OBJECTID : -case BTRFS_CHUNK_TREE_OBJECTID : -case BTRFS_FS_TREE_OBJECTID : - ret = -EEXIST ; - goto free; -default : -/* Subvolume trees don't need special handling */ -if (is_fstree (objectid)) -break ; -/* Other special trees are not supported yet */ - ret = -ENOTTY ; - goto free; - } -btrfs_mark_buffer_dirty (node); -btrfs_set_root_bytenr (&root_item,btrfs_header_bytenr (node)); -btrfs_set_root_level (&root_item,0 ); -btrfs_set_root_generation (&root_item, trans->transid); -btrfs_set_root_dirid (&root_item,0 ); -btrfs_set_root_refs (&root_item,1 ); -btrfs_set_root_used (&root_item, fs_info->nodesize); - location.objectid = objectid; - location.type =BTRFS_ROOT_ITEM_KEY ; - location.offset =0 ; - - ret =btrfs_insert_root (trans, fs_info->tree_root, &location, &root_item); -if (ret <0 ) - goto free; -return ret; - -free: -free_extent_buffer (node); -free (new_root); -return ret; -} -/* * check if the tree block can be shared by multiple trees */
kernel-shared/ctree.h +0 -2
@@ -958,8 +958,6 @@ int btrfs_copy_root(struct btrfs_trans_handle *trans,struct btrfs_root *root, struct extent_buffer *buf, struct extent_buffer **cow_ret, u64 new_root_objectid); -int btrfs_create_root (struct btrfs_trans_handle *trans, -struct btrfs_fs_info *fs_info,u64 objectid);void btrfs_extend_item (struct btrfs_path *path,u32 data_size);void btrfs_truncate_item (struct btrfs_path *path,u32 new_size,int from_end); int btrfs_split_item(struct btrfs_trans_handle *trans,
mkfs/main.c +10 -4
@@ -883,7 +883,10 @@ static int setup_quota_root(struct btrfs_fs_info *fs_info)struct btrfs_qgroup_status_item *qsi;struct btrfs_root *quota_root;struct btrfs_path path = {}; -struct btrfs_key key; +struct btrfs_key key = { + .objectid =BTRFS_QUOTA_TREE_OBJECTID , + .type =BTRFS_ROOT_ITEM_KEY , + };int qgroup_repaired =0 ;int ret;
@@ -895,12 +898,15 @@ static int setup_quota_root(struct btrfs_fs_info *fs_info)error_msg (ERROR_MSG_START_TRANS ,"%m" );return ret; } - ret =btrfs_create_root (trans, fs_info,BTRFS_QUOTA_TREE_OBJECTID ); -if (ret <0 ) { + + quota_root =btrfs_create_tree (trans, fs_info, &key); +if (IS_ERR (quota_root)) { + ret =PTR_ERR (quota_root);error ("failed to create quota root: %d (%m)" , ret); goto fail; } - quota_root = fs_info->quota_root; + fs_info->quota_root = quota_root; + fs_info->quota_enabled =1 ; key.objectid =0 ; key.type =BTRFS_QGROUP_STATUS_KEY ;
tune/change-csum.c +9 -2
@@ -410,6 +410,11 @@ int rewrite_checksums(struct btrfs_fs_info *fs_info, int csum_type)return ret;if (ret ==1 ) { +struct btrfs_root *tmp; +struct btrfs_key key = { + .objectid =BTRFS_CSUM_TREE_TMP_OBJECTID , + .type =BTRFS_ROOT_ITEM_KEY , + };struct item {u64 offset;u64 generation;
@@ -421,10 +426,12 @@ int rewrite_checksums(struct btrfs_fs_info *fs_info, int csum_type)*/ } item[1 ]; - ret =btrfs_create_root (trans, fs_info,BTRFS_CSUM_TREE_TMP_OBJECTID ); -if (ret <0 ) { + tmp =btrfs_create_tree (trans, fs_info, &key); +if (IS_ERR (tmp)) { + ret =PTR_ERR (tmp);return ret; }else { + fs_info->csum_tree_tmp = tmp; item->offset =btrfs_header_bytenr (fs_info->csum_tree_tmp->node); item->generation =btrfs_super_generation (fs_info->super_copy); item->csum_type = csum_type;
tune/convert-bgt.c +10 -3
@@ -30,7 +30,12 @@ int convert_to_bg_tree(struct btrfs_fs_info *fs_info) {struct btrfs_super_block *sb = fs_info->super_copy;struct btrfs_trans_handle *trans; +struct btrfs_root *root;struct cache_extent *ce; +struct btrfs_key key = { + .objectid =BTRFS_BLOCK_GROUP_TREE_OBJECTID , + .type =BTRFS_ROOT_ITEM_KEY , + };int converted_bgs =0 ;int ret;
@@ -50,12 +55,14 @@ int convert_to_bg_tree(struct btrfs_fs_info *fs_info)if (btrfs_super_flags (sb) &BTRFS_SUPER_FLAG_CHANGING_BG_TREE ) goto iterate_bgs; - ret =btrfs_create_root (trans, fs_info, -BTRFS_BLOCK_GROUP_TREE_OBJECTID ); -if (ret <0 ) { + root =btrfs_create_tree (trans, fs_info, &key); +if (IS_ERR (root)) { + ret =PTR_ERR (root);error ("failed to create block group root: %d" , ret); goto error; } + fs_info->block_group_root = root; +btrfs_set_super_flags (sb,btrfs_super_flags (sb) |BTRFS_SUPER_FLAG_CHANGING_BG_TREE );
Signature · 1 line
2.40.0
PATCH 20/26 btrfs-progs: move btrfs_uuid_tree_add into mkfs/main.c
In reply to Josef BacikThis function is only used in mkfs, and doesn't exist in the kernel in ctree.c. Additionally we have a uuid lookup function to see if the uuid exists in the tree, which for mkfs it won't because we just created the tree. Move btrfs_uuid_tree_add into mkfs, and remove the lookup function as it's not needed.
--- kernel-shared/ctree.c | 133 ------------------------------------------ kernel-shared/ctree.h | 2 - mkfs/main.c | 59 +++++++++++++++++++ 3 files changed, 59 insertions(+), 135 deletions(-)
kernel-shared/ctree.c +0 -133
@@ -2918,136 +2918,3 @@ int btrfs_previous_extent_item(struct btrfs_root *root, }return 1 ; } - -/* -* Search uuid tree - unmounted -* -* return -ENOENT for !found, < 0 for errors, or 0 if an item was found -*/ -static int btrfs_uuid_tree_lookup (struct btrfs_root *uuid_root,u8 *uuid, -u8 type,u64 subid) -{ -int ret; -struct btrfs_path *path =NULL ; -struct extent_buffer *eb; -int slot; -u32 item_size; -unsigned long offset; -struct btrfs_key key; - -if (!uuid_root) { - ret = -ENOENT ; - goto out; - } - - path =btrfs_alloc_path (); -if (!path) { - ret = -ENOMEM ; - goto out; - } - -btrfs_uuid_to_key (uuid, &key); - key.type = type; - ret =btrfs_search_slot (NULL , uuid_root, &key, path,0 ,0 ); -if (ret <0 ) { - goto out; - }else if (ret >0 ) { - ret = -ENOENT ; - goto out; - } - - eb = path->nodes[0 ]; - slot = path->slots[0 ]; - item_size =btrfs_item_size (eb, slot); - offset =btrfs_item_ptr_offset (eb, slot); - ret = -ENOENT ; - -if (!IS_ALIGNED (item_size,sizeof (u64))) { -warning ("uuid item with invalid size %lu!" , - (unsigned long )item_size); - goto out; - } -while (item_size) { -__le64 data; - -read_extent_buffer (eb, &data, offset,sizeof (data)); -if (le64_to_cpu (data) == subid) { - ret =0 ; -break ; - } - offset +=sizeof (data); - item_size -=sizeof (data); - } - -out: -btrfs_free_path (path); -return ret; -} - -int btrfs_uuid_tree_add (struct btrfs_trans_handle *trans,u8 *uuid,u8 type, -u64 subvol_id_cpu) -{ -struct btrfs_fs_info *fs_info = trans->fs_info; -struct btrfs_root *uuid_root = fs_info->uuid_root; -int ret; -struct btrfs_path *path =NULL ; -struct btrfs_key key; -struct extent_buffer *eb; -int slot; -unsigned long offset; -__le64 subvol_id_le; - -if (!uuid_root) { -warning ("%s: uuid root is not initialized" , __func__); -return -EINVAL ; - } - - ret =btrfs_uuid_tree_lookup (uuid_root, uuid, type, subvol_id_cpu); -if (ret != -ENOENT ) -return ret; - - key.type = type; -btrfs_uuid_to_key (uuid, &key); - - path =btrfs_alloc_path (); -if (!path) { - ret = -ENOMEM ; - goto out; - } - - ret =btrfs_insert_empty_item (trans, uuid_root, path, &key, -sizeof (subvol_id_le)); -if (ret <0 && ret != -EEXIST ) { -warning ( -"inserting uuid item failed (0x%016llx, 0x%016llx) type %u: %d" , - (unsigned long long )key.objectid, - (unsigned long long )key.offset, type, ret); - goto out; - } - -if (ret >=0 ) { -/* Add an item for the type for the first time */ - eb = path->nodes[0 ]; - slot = path->slots[0 ]; - offset =btrfs_item_ptr_offset (eb, slot); - }else { -/* -* ret == -EEXIST case, An item with that type already exists. -* Extend the item and store the new subvol_id at the end. -*/ -btrfs_extend_item (path,sizeof (subvol_id_le)); - eb = path->nodes[0 ]; - slot = path->slots[0 ]; - offset =btrfs_item_ptr_offset (eb, slot); - offset +=btrfs_item_size (eb, slot) -sizeof (subvol_id_le); - } - - ret =0 ; - subvol_id_le =cpu_to_le64 (subvol_id_cpu); -write_extent_buffer (eb, &subvol_id_le, offset,sizeof (subvol_id_le)); -btrfs_mark_buffer_dirty (eb); - -out: -btrfs_free_path (path); -return ret; -}
kernel-shared/ctree.h +0 -2
@@ -1130,8 +1130,6 @@ int btrfs_lookup_uuid_received_subvol_item(int fd, const u8 *uuid, u64 *subvol_id);/* uuid-tree.c, interface for unmounte filesystem */ -int btrfs_uuid_tree_add (struct btrfs_trans_handle *trans,u8 *uuid,u8 type, -u64 subvol_id_cpu);int btrfs_uuid_tree_remove (struct btrfs_trans_handle *trans,u8 *uuid,u8 type,u64 subid);
mkfs/main.c +59 -0
65 lines not on this page · raw message
Signature · 1 line
2.40.0
PATCH 21/26 btrfs-progs: make btrfs_del_ptr a void
In reply to Josef BacikThis always returns 0, and in the kernel is a void. Update the definition to match the kernel and then update all of the callers.
--- check/main.c | 7 +++---- kernel-shared/ctree.c | 16 ++++------------ kernel-shared/ctree.h | 2 +- 3 files changed, 8 insertions(+), 17 deletions(-)
check/main.c +3 -4
@@ -3569,9 +3569,8 @@ static int repair_btree(struct btrfs_root *root, path.slots[level]);/* Remove the ptr */ - ret =btrfs_del_ptr (root, &path, level, path.slots[level]); -if (ret <0 ) - goto out; +btrfs_del_ptr (root, &path, level, path.slots[level]); +/* * Remove the corresponding extent * return value is not concerned.
@@ -7829,7 +7828,7 @@ again: del_ptr:printk ("deleting pointer to block %llu\n" , corrupt->cache.start); - ret =btrfs_del_ptr (extent_root, &path, level, slot); +btrfs_del_ptr (extent_root, &path, level, slot); out:btrfs_release_path (&path);
kernel-shared/ctree.c +4 -12
@@ -685,9 +685,7 @@ static int balance_level(struct btrfs_trans_handle *trans,btrfs_clear_buffer_dirty (trans, right);free_extent_buffer (right); right =NULL ; - wret =btrfs_del_ptr (root, path, level +1 , pslot +1 ); -if (wret) - ret = wret; +btrfs_del_ptr (root, path, level +1 , pslot +1 );root_sub_used (root, blocksize); wret = btrfs_free_extent(trans, bytenr, blocksize, 0,
@@ -732,9 +730,7 @@ static int balance_level(struct btrfs_trans_handle *trans,btrfs_clear_buffer_dirty (trans, mid);free_extent_buffer (mid); mid =NULL ; - wret =btrfs_del_ptr (root, path, level +1 , pslot); -if (wret) - ret = wret; +btrfs_del_ptr (root, path, level +1 , pslot);root_sub_used (root, blocksize); wret = btrfs_free_extent(trans, bytenr, blocksize, 0,
@@ -2557,12 +2553,11 @@ int btrfs_insert_item(struct btrfs_trans_handle *trans, struct btrfs_root* continuing all the way the root if required. The root is converted into * a leaf if all the nodes are emptied. */ -int btrfs_del_ptr (struct btrfs_root *root,struct btrfs_path *path, +void btrfs_del_ptr (struct btrfs_root *root,struct btrfs_path *path,int level,int slot) {struct extent_buffer *parent = path->nodes[level];u32 nritems; -int ret =0 ; nritems =btrfs_header_nritems (parent);if (slot < nritems -1 ) {
@@ -2586,7 +2581,6 @@ int btrfs_del_ptr(struct btrfs_root *root, struct btrfs_path *path,fixup_low_keys (path, &disk_key, level +1 ); }btrfs_mark_buffer_dirty (parent); -return ret; }/*
@@ -2607,9 +2601,7 @@ static noinline int btrfs_del_leaf(struct btrfs_trans_handle *trans,int ret;WARN_ON (btrfs_header_generation (leaf) != trans->transid); - ret =btrfs_del_ptr (root, path,1 , path->slots[1 ]); -if (ret) -return ret; +btrfs_del_ptr (root, path,1 , path->slots[1 ]);root_sub_used (root, leaf->len);
kernel-shared/ctree.h +1 -1
@@ -941,7 +941,7 @@ int btrfs_convert_one_bg(struct btrfs_trans_handle *trans, u64 bytenr);/* ctree.c */ int btrfs_comp_cpu_keys (const struct btrfs_key *k1,const struct btrfs_key *k2); -int btrfs_del_ptr (struct btrfs_root *root,struct btrfs_path *path, +void btrfs_del_ptr (struct btrfs_root *root,struct btrfs_path *path,int level,int slot);struct extent_buffer *btrfs_read_node_slot (struct extent_buffer *parent,int slot);
Signature · 1 line
2.40.0
PATCH 22/26 btrfs-progs: replace blocksize with parent argument for btrfs_alloc_tree_block
In reply to Josef BacikIn the kernel we pass in the parent to btrfs_alloc_tree_block instead of the blocksize and simply derive the blocksize from the fs_info. Update the function to match the kernel's convention and update all of the callers so we can sync ctree.c easily.
--- check/main.c | 3 +-- cmds/rescue-chunk-recover.c | 3 +-- kernel-shared/ctree.c | 29 ++++++++++++----------------- kernel-shared/ctree.h | 2 +- kernel-shared/disk-io.c | 5 ++--- kernel-shared/extent-tree.c | 9 +++++---- 6 files changed, 22 insertions(+), 29 deletions(-)
check/main.c +1 -2
@@ -9067,8 +9067,7 @@ static struct extent_buffer *btrfs_fsck_clear_root(if (!path)return ERR_PTR (-ENOMEM ); - c =btrfs_alloc_tree_block (trans, gfs_info->tree_root, - gfs_info->nodesize, key->objectid, + c =btrfs_alloc_tree_block (trans, gfs_info->tree_root,0 , key->objectid, &disk_key,0 ,0 ,0 ,BTRFS_NESTING_NORMAL );if (IS_ERR (c)) {btrfs_free_path (path);
cmds/rescue-chunk-recover.c +1 -2
@@ -1143,8 +1143,7 @@ static int __rebuild_chunk_root(struct btrfs_trans_handle *trans,btrfs_set_disk_key_type (&disk_key,BTRFS_DEV_ITEM_KEY );btrfs_set_disk_key_offset (&disk_key, min_devid); - cow =btrfs_alloc_tree_block (trans, root, root->fs_info->nodesize, -BTRFS_CHUNK_TREE_OBJECTID , + cow =btrfs_alloc_tree_block (trans, root,0 ,BTRFS_CHUNK_TREE_OBJECTID , &disk_key,0 ,0 ,0 ,BTRFS_NESTING_NORMAL );btrfs_set_header_bytenr (cow, cow->start);btrfs_set_header_generation (cow, trans->transid);
kernel-shared/ctree.c +12 -17
@@ -158,9 +158,8 @@ int btrfs_copy_root(struct btrfs_trans_handle *trans,btrfs_item_key (buf, &disk_key,0 ); else btrfs_node_key(buf, &disk_key, 0); - cow = btrfs_alloc_tree_block(trans, new_root, buf->len, - new_root_objectid, &disk_key, - level, buf->start, 0, + cow = btrfs_alloc_tree_block(trans, new_root, 0, new_root_objectid, + &disk_key, level, buf->start, 0, BTRFS_NESTING_NORMAL);if (IS_ERR (cow)) {kfree (new_root);
@@ -329,9 +328,8 @@ static int __btrfs_cow_block(struct btrfs_trans_handle *trans,else btrfs_node_key (buf, &disk_key,0 ); - cow =btrfs_alloc_tree_block (trans, root, buf->len, - root->root_key.objectid, &disk_key, - level, search_start, empty_size, + cow =btrfs_alloc_tree_block (trans, root,0 , root->root_key.objectid, + &disk_key, level, search_start, empty_size,BTRFS_NESTING_NORMAL );if (IS_ERR (cow))return PTR_ERR (cow);
@@ -1395,9 +1393,8 @@ static int noinline insert_new_root(struct btrfs_trans_handle *trans,else btrfs_node_key (lower, &lower_key,0 ); - c =btrfs_alloc_tree_block (trans, root, root->fs_info->nodesize, - root->root_key.objectid, &lower_key, - level, root->node->start,0 , + c =btrfs_alloc_tree_block (trans, root,0 , root->root_key.objectid, + &lower_key, level, root->node->start,0 ,BTRFS_NESTING_NORMAL );if (IS_ERR (c))
@@ -1522,10 +1519,9 @@ static int split_node(struct btrfs_trans_handle *trans, struct btrfs_root mid = (c_nritems +1 ) /2 ;btrfs_node_key (c, &disk_key, mid); - split =btrfs_alloc_tree_block (trans, root, root->fs_info->nodesize, - root->root_key.objectid, - &disk_key, level, c->start,0 , -BTRFS_NESTING_NORMAL ); + split =btrfs_alloc_tree_block (trans, root,0 , root->root_key.objectid, + &disk_key, level, c->start,0 , +BTRFS_NESTING_NORMAL );if (IS_ERR (split))return PTR_ERR (split);
@@ -2088,10 +2084,9 @@ again:else btrfs_item_key (l, &disk_key, mid); - right =btrfs_alloc_tree_block (trans, root, root->fs_info->nodesize, - root->root_key.objectid, - &disk_key,0 , l->start,0 , -BTRFS_NESTING_NORMAL ); + right =btrfs_alloc_tree_block (trans, root,0 , root->root_key.objectid, + &disk_key,0 , l->start,0 , +BTRFS_NESTING_NORMAL );if (IS_ERR (right)) {BUG_ON (1 );return PTR_ERR (right);
kernel-shared/ctree.h +1 -1
@@ -885,7 +885,7 @@ struct btrfs_block_group *btrfs_lookup_first_block_group(struct u64 bytenr);struct extent_buffer *btrfs_alloc_tree_block (struct btrfs_trans_handle *trans,struct btrfs_root *root, -u32 blocksize,u64 root_objectid, +u64 parent,u64 root_objectid,struct btrfs_disk_key *key,int level,u64 hint,u64 empty_size,enum btrfs_lock_nesting nest);
kernel-shared/disk-io.c +2 -3
@@ -2361,9 +2361,8 @@ struct btrfs_root *btrfs_create_tree(struct btrfs_trans_handle *trans,btrfs_setup_root (root, fs_info, key->objectid);memcpy (&root->root_key, key,sizeof (struct btrfs_key )); - leaf =btrfs_alloc_tree_block (trans, root, fs_info->nodesize, - root->root_key.objectid,NULL ,0 ,0 ,0 , -BTRFS_NESTING_NORMAL ); + leaf =btrfs_alloc_tree_block (trans, root,0 , root->root_key.objectid, +NULL ,0 ,0 ,0 ,BTRFS_NESTING_NORMAL );if (IS_ERR (leaf)) { ret =PTR_ERR (leaf); leaf =NULL ;
kernel-shared/extent-tree.c +5 -4
@@ -2480,7 +2480,7 @@ static int alloc_reserved_tree_block(struct btrfs_trans_handle *trans, } static int alloc_tree_block(struct btrfs_trans_handle *trans, - struct btrfs_root *root, u64 num_bytes, + struct btrfs_root *root, u64 parent, u64 root_objectid, u64 generation, u64 flags, struct btrfs_disk_key *key, int level, u64 empty_size, u64 hint_byte,
@@ -2491,6 +2491,7 @@ static int alloc_tree_block(struct btrfs_trans_handle *trans,struct btrfs_delayed_extent_op *extent_op;struct btrfs_space_info *sinfo;struct btrfs_fs_info *fs_info = root->fs_info; +u64 num_bytes = fs_info->nodesize;bool skinny_metadata =btrfs_fs_incompat (root->fs_info,SKINNY_METADATA );
@@ -2537,7 +2538,7 @@ static int alloc_tree_block(struct btrfs_trans_handle *trans, sinfo->bytes_reserved += extent_size; ret =btrfs_add_delayed_tree_ref (root->fs_info, trans, ins->objectid, - extent_size,0 , root_objectid, + extent_size, parent, root_objectid, level,BTRFS_ADD_DELAYED_EXTENT , extent_op,NULL ,NULL );return ret;
@@ -2549,7 +2550,7 @@ static int alloc_tree_block(struct btrfs_trans_handle *trans,*/ struct extent_buffer *btrfs_alloc_tree_block (struct btrfs_trans_handle *trans,struct btrfs_root *root, -u32 blocksize,u64 root_objectid, +u64 parent,u64 root_objectid,struct btrfs_disk_key *key,int level,u64 hint,u64 empty_size,enum btrfs_lock_nesting nest)
@@ -2558,7 +2559,7 @@ struct extent_buffer *btrfs_alloc_tree_block(struct btrfs_trans_handle *trans,int ret;struct extent_buffer *buf; - ret =alloc_tree_block (trans, root, blocksize, root_objectid, + ret =alloc_tree_block (trans, root, parent, root_objectid, trans->transid,0 , key, level, empty_size, hint, (u64)-1 , &ins);if (ret) {
Signature · 1 line
2.40.0
PATCH 23/26 btrfs-progs: use path->search_for_extension
In reply to Josef BacikThis flag is used by the kernel btrfs_search_slot to make sure that leaf splitting decision doesn't subtract the size of an item. This is for inline extent items and csum items where we know we're going to find the item we want, and we're only going to want to extend it. Currently this flag doesn't do anything, but when we sync ctree.c we'll stop making the right decision WRT the leaf space, so add the flag usage in the places we need it so we can sync ctree.c easily.
--- kernel-shared/extent-tree.c | 8 ++++++-- kernel-shared/file-item.c | 2 ++ 2 files changed, 8 insertions(+), 2 deletions(-)
kernel-shared/extent-tree.c +6 -2
@@ -882,10 +882,12 @@ static int lookup_inline_extent_backref(struct btrfs_trans_handle *trans, key.offset = num_bytes; want =extent_ref_type (parent, owner); -if (insert) +if (insert) { extra_size =btrfs_extent_inline_ref_size (want); -else + path->search_for_extension =1 ; + }else { extra_size =-1 ; + }if (owner <BTRFS_FIRST_FREE_OBJECTID && skinny_metadata) { key.type =BTRFS_METADATA_ITEM_KEY ;
@@ -1023,6 +1025,8 @@ again: } *ref_ret = (struct btrfs_extent_inline_ref *)ptr; out: +if (insert) + path->search_for_extension =0 ;return err; }
kernel-shared/file-item.c +2 -0
@@ -268,8 +268,10 @@ int btrfs_csum_file_block(struct btrfs_trans_handle *trans,* enough yet to put our csum in. Grow it */ btrfs_release_path (path); + path->search_for_extension =1 ; ret =btrfs_search_slot (trans, root, &file_key, path, csum_size,1 ); + path->search_for_extension =0 ;if (ret <0 ) goto fail;if (ret ==0 ) {
Signature · 1 line
2.40.0
PATCH 24/26 btrfs-progs: add write_extent_buffer_chunk_tree_uuid helper
In reply to Josef BacikThis exists in the kernel to update the chunk tree uuid on the btrfs_header. Add the helper to btrfs-progs to make future kernel sync changes easier.
--- kernel-shared/ctree.h | 2 +- kernel-shared/extent_io.c | 7 +++++++ kernel-shared/extent_io.h | 2 ++ 3 files changed, 10 insertions(+), 1 deletion(-)
kernel-shared/ctree.h +1 -1
@@ -731,7 +731,7 @@ static inline unsigned long btrfs_header_fsid(void)return offsetof(struct btrfs_header , fsid); } -static inline unsigned long btrfs_header_chunk_tree_uuid (struct extent_buffer *eb) +static inline unsigned long btrfs_header_chunk_tree_uuid (const struct extent_buffer *eb) {return offsetof(struct btrfs_header , chunk_tree_uuid); }
kernel-shared/extent_io.c +7 -0
@@ -659,6 +659,13 @@ void write_extent_buffer_fsid(const struct extent_buffer *eb, const void *srcv)write_extent_buffer (eb, srcv,btrfs_header_fsid (),BTRFS_FSID_SIZE ); } +void write_extent_buffer_chunk_tree_uuid (const struct extent_buffer *eb, +const void *srcv) +{ +write_extent_buffer (eb, srcv,btrfs_header_chunk_tree_uuid (eb), +BTRFS_FSID_SIZE ); +} +/* * btrfs_readahead_node_child - readahead a node's child block * @node: parent node we're reading from
kernel-shared/extent_io.h +2 -0
@@ -143,5 +143,7 @@ void extent_buffer_init_cache(struct btrfs_fs_info *fs_info);void extent_buffer_free_cache (struct btrfs_fs_info *fs_info);void write_extent_buffer_fsid (const struct extent_buffer *eb,const void *srcv);void btrfs_readahead_node_child (struct extent_buffer *node,int slot); +void write_extent_buffer_chunk_tree_uuid (const struct extent_buffer *eb, +const void *src);#endif
Signature · 1 line
2.40.0
PATCH 25/26 btrfs-progs: init new tree blocks in btrfs_alloc_tree_block
In reply to Josef BacikThis is how the kernel initializes blocks, so anybody who uses btrfs_alloc_tree_block in the kernel expects the blocks to be already initialized. Put this init code into btrfs-progs so as we sync code from the kernel we get the correct behavior.
--- kernel-shared/extent-tree.c | 9 +++++++++ 1 file changed, 9 insertions(+)
kernel-shared/extent-tree.c +9 -0
@@ -2559,6 +2559,7 @@ struct extent_buffer *btrfs_alloc_tree_block(struct btrfs_trans_handle *trans, u64 hint, u64 empty_size, enum btrfs_lock_nesting nest) { + struct btrfs_fs_info *fs_info = trans->fs_info;struct btrfs_key ins;int ret;struct extent_buffer *buf;
@@ -2579,6 +2580,14 @@ struct extent_buffer *btrfs_alloc_tree_block(struct btrfs_trans_handle *trans,return ERR_PTR (-ENOMEM ); }btrfs_set_buffer_uptodate (buf); +memset_extent_buffer (buf,0 ,0 ,sizeof (struct btrfs_header )); +btrfs_set_header_level (buf, level); +btrfs_set_header_bytenr (buf, buf->start); +btrfs_set_header_generation (buf, trans->transid); +btrfs_set_header_backref_rev (buf,BTRFS_MIXED_BACKREF_REV ); +btrfs_set_header_owner (buf, root_objectid); +write_extent_buffer_fsid (buf, fs_info->fs_devices->metadata_uuid); +write_extent_buffer_chunk_tree_uuid (buf, fs_info->chunk_tree_uuid); trans->blocks_used++;return buf;
Signature · 1 line
2.40.0
PATCH 26/26 btrfs-progs: sync ctree.c from the kernel
In reply to Josef BacikThis patch sync's ctree.c from the kernel. This is mostly painless, there were a few modifications that were necessary
- There is no btrfs_transaction in btrfs-progs currently, those references had to be commented out.
- The path kmem cache has to be init'ed on open ctree, so there was some weirdness to get that to work properly.
- Some references to page_address that had to be removed in the btrfs_bin_search function that are optimizations for the kernel.
- We have a struct that we pass around for block validation in the kernel that we don't have here, so removed that stuff.
These sites are all marked, otherwise it's a straight copy. There were some changes outside of ctree.c that couldn't be done as a preparation as it came with the behavior changes in the newer ctree.c. This are easy to spot as they're outside of ctree.c and straightforward.
--- include/kerncompat.h | 80 + kernel-lib/trace.h | 8 + kernel-shared/ctree.c | 4474 ++++++++++++++++++++++++++--------- kernel-shared/ctree.h | 95 +- kernel-shared/disk-io.c | 5 + kernel-shared/locking.c | 6 +- kernel-shared/transaction.c | 5 +- 7 files changed, 3477 insertions(+), 1196 deletions(-)
include/kerncompat.h +80 -0
@@ -202,6 +202,10 @@ typedef struct spinlock_struct {unsigned long lock; } spinlock_t; +struct rw_semaphore { +long lock; +}; +#define mutex_init (m) \ do { \ (m)->lock = 1; \
@@ -244,6 +248,27 @@ static inline void spin_unlock_irqrestore(spinlock_t *lock, unsigned long flags)spin_unlock (lock); } +static inline void init_rwsem (struct rw_semaphore *sem) +{ + sem->lock =0 ; +} + +static inline bool down_read_trylock (struct rw_semaphore *sem) +{ + sem->lock++; +return true; +} + +static inline void down_read (struct rw_semaphore *sem) +{ + sem->lock++; +} + +static inline void up_read (struct rw_semaphore *sem) +{ + sem->lock--; +} +#define cond_resched () do { } while (0)#define preempt_enable () do { } while (0)#define preempt_disable () do { } while (0)
@@ -400,6 +425,11 @@ static inline void *kmem_cache_alloc(struct kmem_cache *cache, gfp_t mask)return malloc (cache->size); } +static inline void *kmem_cache_zalloc (struct kmem_cache *cache,gfp_t mask) +{ +return calloc (1 , cache->size); +} +static inline void kmem_cache_free (struct kmem_cache *cache,void *ptr) {free (ptr);
@@ -704,6 +734,10 @@ static inline bool sb_rdonly(struct super_block *sb)#define unlikely (cond) (cond) +#define rcu_dereference (c) (c) + +#define rcu_assign_pointer (p, v) do { (p) = (v); } while (0) +static inline void atomic_set (atomic_t *a,int val) { *a = val;
@@ -724,6 +758,15 @@ static inline void atomic_dec(atomic_t *a) (*a)--; } +static inline bool atomic_inc_not_zero (atomic_t *a) +{ +if (*a) { +atomic_inc (a); +return true; + } +return false; +} +static inline struct workqueue_struct *alloc_workqueue (const char *name,unsigned long flags,int max_active, ...)
@@ -766,6 +809,10 @@ static inline void lockdep_set_class(spinlock_t *lock, struct lock_class_key *lc { } +static inline void lockdep_assert_held_read (struct rw_semaphore *sem) +{ +} +static inline bool cond_resched_lock (spinlock_t *lock) {return false;
@@ -800,11 +847,30 @@ static inline void schedule(void) { } +static inline void might_sleep (void ) +{ +} + +static inline void rcu_read_lock (void ) +{ +} + +static inline void rcu_read_unlock (void ) +{ +} + +static inline void synchronize_rcu (void ) +{ +} +/* * Temporary definitions while syncing. */ struct btrfs_inode ;struct extent_state ; +struct extent_buffer ; +struct btrfs_root ; +struct btrfs_trans_handle ; static inline void btrfs_merge_delalloc_extent(struct btrfs_inode *inode, struct extent_state *state,
@@ -830,4 +896,18 @@ static inline void btrfs_clear_delalloc_extent(struct btrfs_inode *inode, { } +static inline int btrfs_reloc_cow_block (struct btrfs_trans_handle *trans, +struct btrfs_root *root, +struct extent_buffer *buf, +struct extent_buffer *cow) +{ +return 0 ; +} + +static inline void btrfs_qgroup_trace_subtree_after_cow (struct btrfs_trans_handle *trans, +struct btrfs_root *root, +struct extent_buffer *buf) +{ +} +#endif
kernel-lib/trace.h +8 -0
@@ -1,6 +1,8 @@#ifndef __PROGS_TRACE_H__#define __PROGS_TRACE_H__ +struct btrfs_work ; +static inline void trace_btrfs_workqueue_alloc (void *ret,const char *name) { }
@@ -52,4 +54,10 @@ static inline void trace_btrfs_convert_extent_bit(struct extent_io_tree *tree, { } +static inline void trace_btrfs_cow_block (struct btrfs_root *root, +struct extent_buffer *buf, +struct extent_buffer *cow) +{ +} +#endif /* __PROGS_TRACE_H__ */
kernel-shared/ctree.c +3309 -1165
2,851 lines not on this page · raw message
kernel-shared/ctree.h +68 -27
95 lines not on this page · raw message
The rest of this diff is not shown. View the raw message.
Signature · 1 line
2.40.0
Part of the diff is not shown here. View the raw message.
Quoted 4 lines · Josef Bacik
Hello,
This is a long series, and it depends on the following series
Quoted 8 lines
btrfs-progs: prep work for syncing files into kernel-shared
btrfs-progs: sync basic code from the kernel
btrfs-progs: prep work for syncingctree.c
btrfs-progs: more prep work for syncingctree.cThis is even more more prep work for syncing
ctree.c, and the last patch is the actual sync. A lot of these prep patches are updating the callers to match the current calling conventions in the kernel to make the syncing straightforward.
Added to devel, thanks. The includes were out of order or without the prefix and some forward declarations or kerncompat.h includes were needed to make it compile in the end.
The remaining issues are basically all around messages. There are now two messages.[ch] and the pV handling is in the userspace side while only used by kernel. Musl does not have the user defined specifiers so we'll need to add a workaround with an intermediate string.
Other build tests seem to pass so I'll take it as a base line for further fixups. Some changes can be done as separate patches to avoid cascading changes in other commits but at least the printf.h should be done in place.