|
@@ -2282,7 +2282,7 @@ static void reada_for_search(struct btrfs_root *root,
|
|
|
if ((search <= target && target - search <= 65536) ||
|
|
|
(search > target && search - target <= 65536)) {
|
|
|
gen = btrfs_node_ptr_generation(node, nr);
|
|
|
- readahead_tree_block(root, search, blocksize);
|
|
|
+ readahead_tree_block(root, search);
|
|
|
nread += blocksize;
|
|
|
}
|
|
|
nscan++;
|
|
@@ -2301,7 +2301,6 @@ static noinline void reada_for_balance(struct btrfs_root *root,
|
|
|
u64 gen;
|
|
|
u64 block1 = 0;
|
|
|
u64 block2 = 0;
|
|
|
- int blocksize;
|
|
|
|
|
|
parent = path->nodes[level + 1];
|
|
|
if (!parent)
|
|
@@ -2309,7 +2308,6 @@ static noinline void reada_for_balance(struct btrfs_root *root,
|
|
|
|
|
|
nritems = btrfs_header_nritems(parent);
|
|
|
slot = path->slots[level + 1];
|
|
|
- blocksize = root->nodesize;
|
|
|
|
|
|
if (slot > 0) {
|
|
|
block1 = btrfs_node_blockptr(parent, slot - 1);
|
|
@@ -2334,9 +2332,9 @@ static noinline void reada_for_balance(struct btrfs_root *root,
|
|
|
}
|
|
|
|
|
|
if (block1)
|
|
|
- readahead_tree_block(root, block1, blocksize);
|
|
|
+ readahead_tree_block(root, block1);
|
|
|
if (block2)
|
|
|
- readahead_tree_block(root, block2, blocksize);
|
|
|
+ readahead_tree_block(root, block2);
|
|
|
}
|
|
|
|
|
|
|