|
@@ -1073,7 +1073,7 @@ static noinline int update_ref_for_cow(struct btrfs_trans_handle *trans,
|
|
|
ret = btrfs_dec_ref(trans, root, buf, 1);
|
|
|
BUG_ON(ret); /* -ENOMEM */
|
|
|
}
|
|
|
- clean_tree_block(trans, root, buf);
|
|
|
+ clean_tree_block(trans, root->fs_info, buf);
|
|
|
*last_ref = 1;
|
|
|
}
|
|
|
return 0;
|
|
@@ -1678,7 +1678,7 @@ int btrfs_realloc_node(struct btrfs_trans_handle *trans,
|
|
|
continue;
|
|
|
}
|
|
|
|
|
|
- cur = btrfs_find_tree_block(root, blocknr);
|
|
|
+ cur = btrfs_find_tree_block(root->fs_info, blocknr);
|
|
|
if (cur)
|
|
|
uptodate = btrfs_buffer_uptodate(cur, gen, 0);
|
|
|
else
|
|
@@ -1943,7 +1943,7 @@ static noinline int balance_level(struct btrfs_trans_handle *trans,
|
|
|
|
|
|
path->locks[level] = 0;
|
|
|
path->nodes[level] = NULL;
|
|
|
- clean_tree_block(trans, root, mid);
|
|
|
+ clean_tree_block(trans, root->fs_info, mid);
|
|
|
btrfs_tree_unlock(mid);
|
|
|
/* once for the path */
|
|
|
free_extent_buffer(mid);
|
|
@@ -1997,7 +1997,7 @@ static noinline int balance_level(struct btrfs_trans_handle *trans,
|
|
|
if (wret < 0 && wret != -ENOSPC)
|
|
|
ret = wret;
|
|
|
if (btrfs_header_nritems(right) == 0) {
|
|
|
- clean_tree_block(trans, root, right);
|
|
|
+ clean_tree_block(trans, root->fs_info, right);
|
|
|
btrfs_tree_unlock(right);
|
|
|
del_ptr(root, path, level + 1, pslot + 1);
|
|
|
root_sub_used(root, right->len);
|
|
@@ -2041,7 +2041,7 @@ static noinline int balance_level(struct btrfs_trans_handle *trans,
|
|
|
BUG_ON(wret == 1);
|
|
|
}
|
|
|
if (btrfs_header_nritems(mid) == 0) {
|
|
|
- clean_tree_block(trans, root, mid);
|
|
|
+ clean_tree_block(trans, root->fs_info, mid);
|
|
|
btrfs_tree_unlock(mid);
|
|
|
del_ptr(root, path, level + 1, pslot);
|
|
|
root_sub_used(root, mid->len);
|
|
@@ -2259,7 +2259,7 @@ static void reada_for_search(struct btrfs_root *root,
|
|
|
|
|
|
search = btrfs_node_blockptr(node, slot);
|
|
|
blocksize = root->nodesize;
|
|
|
- eb = btrfs_find_tree_block(root, search);
|
|
|
+ eb = btrfs_find_tree_block(root->fs_info, search);
|
|
|
if (eb) {
|
|
|
free_extent_buffer(eb);
|
|
|
return;
|
|
@@ -2319,7 +2319,7 @@ static noinline void reada_for_balance(struct btrfs_root *root,
|
|
|
if (slot > 0) {
|
|
|
block1 = btrfs_node_blockptr(parent, slot - 1);
|
|
|
gen = btrfs_node_ptr_generation(parent, slot - 1);
|
|
|
- eb = btrfs_find_tree_block(root, block1);
|
|
|
+ eb = btrfs_find_tree_block(root->fs_info, block1);
|
|
|
/*
|
|
|
* if we get -eagain from btrfs_buffer_uptodate, we
|
|
|
* don't want to return eagain here. That will loop
|
|
@@ -2332,7 +2332,7 @@ static noinline void reada_for_balance(struct btrfs_root *root,
|
|
|
if (slot + 1 < nritems) {
|
|
|
block2 = btrfs_node_blockptr(parent, slot + 1);
|
|
|
gen = btrfs_node_ptr_generation(parent, slot + 1);
|
|
|
- eb = btrfs_find_tree_block(root, block2);
|
|
|
+ eb = btrfs_find_tree_block(root->fs_info, block2);
|
|
|
if (eb && btrfs_buffer_uptodate(eb, gen, 1) != 0)
|
|
|
block2 = 0;
|
|
|
free_extent_buffer(eb);
|
|
@@ -2450,7 +2450,7 @@ read_block_for_search(struct btrfs_trans_handle *trans,
|
|
|
blocknr = btrfs_node_blockptr(b, slot);
|
|
|
gen = btrfs_node_ptr_generation(b, slot);
|
|
|
|
|
|
- tmp = btrfs_find_tree_block(root, blocknr);
|
|
|
+ tmp = btrfs_find_tree_block(root->fs_info, blocknr);
|
|
|
if (tmp) {
|
|
|
/* first we do an atomic uptodate check */
|
|
|
if (btrfs_buffer_uptodate(tmp, gen, 1) > 0) {
|
|
@@ -3694,7 +3694,7 @@ static noinline int __push_leaf_right(struct btrfs_trans_handle *trans,
|
|
|
if (left_nritems)
|
|
|
btrfs_mark_buffer_dirty(left);
|
|
|
else
|
|
|
- clean_tree_block(trans, root, left);
|
|
|
+ clean_tree_block(trans, root->fs_info, left);
|
|
|
|
|
|
btrfs_mark_buffer_dirty(right);
|
|
|
|
|
@@ -3706,7 +3706,7 @@ static noinline int __push_leaf_right(struct btrfs_trans_handle *trans,
|
|
|
if (path->slots[0] >= left_nritems) {
|
|
|
path->slots[0] -= left_nritems;
|
|
|
if (btrfs_header_nritems(path->nodes[0]) == 0)
|
|
|
- clean_tree_block(trans, root, path->nodes[0]);
|
|
|
+ clean_tree_block(trans, root->fs_info, path->nodes[0]);
|
|
|
btrfs_tree_unlock(path->nodes[0]);
|
|
|
free_extent_buffer(path->nodes[0]);
|
|
|
path->nodes[0] = right;
|
|
@@ -3930,7 +3930,7 @@ static noinline int __push_leaf_left(struct btrfs_trans_handle *trans,
|
|
|
if (right_nritems)
|
|
|
btrfs_mark_buffer_dirty(right);
|
|
|
else
|
|
|
- clean_tree_block(trans, root, right);
|
|
|
+ clean_tree_block(trans, root->fs_info, right);
|
|
|
|
|
|
btrfs_item_key(right, &disk_key, 0);
|
|
|
fixup_low_keys(root->fs_info, path, &disk_key, 1);
|
|
@@ -4984,7 +4984,7 @@ int btrfs_del_items(struct btrfs_trans_handle *trans, struct btrfs_root *root,
|
|
|
btrfs_set_header_level(leaf, 0);
|
|
|
} else {
|
|
|
btrfs_set_path_blocking(path);
|
|
|
- clean_tree_block(trans, root, leaf);
|
|
|
+ clean_tree_block(trans, root->fs_info, leaf);
|
|
|
btrfs_del_leaf(trans, root, path, leaf);
|
|
|
}
|
|
|
} else {
|