btrfs: make tree_search return struct extent_state
authorJosef Bacik <josef@toxicpanda.com>
Fri, 9 Sep 2022 21:53:34 +0000 (17:53 -0400)
committerDavid Sterba <dsterba@suse.com>
Mon, 26 Sep 2022 10:28:04 +0000 (12:28 +0200)
commitaa852dabf9646cb2517e3e7d7d9077201938a6d3
treef5dc9128b4294b367f3e5da9883e9d8eeaccad26
parentccaeff929098dcad1661d0e4d524e569bac949be
btrfs: make tree_search return struct extent_state

We have a consistent pattern of

n = tree_search();
if (!n)
goto out;
state = rb_entry(n, struct extent_state, rb_node);
while (state) {
/* do something. */
}

which is a bit redundant.  If we make tree_search return the state we
can simply have

state = tree_search();
while (state) {
/* do something. */
}

which cleans up the code quite a bit.

Signed-off-by: Josef Bacik <josef@toxicpanda.com>
Reviewed-by: David Sterba <dsterba@suse.com>
Signed-off-by: David Sterba <dsterba@suse.com>
fs/btrfs/extent-io-tree.c