diff options
| author | Josef Bacik | 2020-03-13 17:09:54 -0400 |
|---|---|---|
| committer | David Sterba | 2020-03-23 17:03:50 +0100 |
| commit | d7ff00f6082c8578a26d75f2ca1aa28b8f05901e (patch) | |
| tree | 8ebc8fb4d2ac90272ebfa310e1ea9e6e89085d2b /fs | |
| parent | cd22a51c6650f567f297215dd7c47c3401ee7290 (diff) | |
btrfs: do not readahead in build_backref_tree
Here we are just searching down to the bytenr we're building the backref
tree for, and all of it's paths to the roots. These bytenrs are not
guaranteed to be anywhere near each other, so readahead just generates
extra latency.
Reviewed-by: Qu Wenruo <wqu@suse.com>
Signed-off-by: Josef Bacik <josef@toxicpanda.com>
Reviewed-by: David Sterba <dsterba@suse.com>
Signed-off-by: David Sterba <dsterba@suse.com>
Diffstat (limited to 'fs')
| -rw-r--r-- | fs/btrfs/relocation.c | 2 |
1 files changed, 0 insertions, 2 deletions
diff --git a/fs/btrfs/relocation.c b/fs/btrfs/relocation.c index 7f31dd57de54..63b11e546a87 100644 --- a/fs/btrfs/relocation.c +++ b/fs/btrfs/relocation.c @@ -743,8 +743,6 @@ struct backref_node *build_backref_tree(struct reloc_control *rc, err = -ENOMEM; goto out; } - path1->reada = READA_FORWARD; - path2->reada = READA_FORWARD; node = alloc_backref_node(cache); if (!node) { |