|
@@ -1074,7 +1074,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, fs_info, buf);
|
|
|
+ clean_tree_block(fs_info, buf);
|
|
|
*last_ref = 1;
|
|
|
}
|
|
|
return 0;
|
|
@@ -1938,7 +1938,7 @@ static noinline int balance_level(struct btrfs_trans_handle *trans,
|
|
|
|
|
|
path->locks[level] = 0;
|
|
|
path->nodes[level] = NULL;
|
|
|
- clean_tree_block(trans, fs_info, mid);
|
|
|
+ clean_tree_block(fs_info, mid);
|
|
|
btrfs_tree_unlock(mid);
|
|
|
/* once for the path */
|
|
|
free_extent_buffer(mid);
|
|
@@ -1999,7 +1999,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, fs_info, right);
|
|
|
+ clean_tree_block(fs_info, right);
|
|
|
btrfs_tree_unlock(right);
|
|
|
del_ptr(root, path, level + 1, pslot + 1);
|
|
|
root_sub_used(root, right->len);
|
|
@@ -2043,7 +2043,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, fs_info, mid);
|
|
|
+ clean_tree_block(fs_info, mid);
|
|
|
btrfs_tree_unlock(mid);
|
|
|
del_ptr(root, path, level + 1, pslot);
|
|
|
root_sub_used(root, mid->len);
|
|
@@ -3705,7 +3705,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, fs_info, left);
|
|
|
+ clean_tree_block(fs_info, left);
|
|
|
|
|
|
btrfs_mark_buffer_dirty(right);
|
|
|
|
|
@@ -3717,7 +3717,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, fs_info, path->nodes[0]);
|
|
|
+ clean_tree_block(fs_info, path->nodes[0]);
|
|
|
btrfs_tree_unlock(path->nodes[0]);
|
|
|
free_extent_buffer(path->nodes[0]);
|
|
|
path->nodes[0] = right;
|
|
@@ -3946,7 +3946,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, fs_info, right);
|
|
|
+ clean_tree_block(fs_info, right);
|
|
|
|
|
|
btrfs_item_key(right, &disk_key, 0);
|
|
|
fixup_low_keys(fs_info, path, &disk_key, 1);
|
|
@@ -5009,7 +5009,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, fs_info, leaf);
|
|
|
+ clean_tree_block(fs_info, leaf);
|
|
|
btrfs_del_leaf(trans, root, path, leaf);
|
|
|
}
|
|
|
} else {
|