Commit 692e5759 authored by Liu Bo's avatar Liu Bo Committed by David Sterba

Btrfs: be less strict on finding next node in clear_extent_bit

In clear_extent_bit, it is enough that next node is adjacent in tree level.
Signed-off-by: default avatarLiu Bo <liubo2009@cn.fujitsu.com>
parent d9b0218f
...@@ -582,8 +582,7 @@ int clear_extent_bit(struct extent_io_tree *tree, u64 start, u64 end, ...@@ -582,8 +582,7 @@ int clear_extent_bit(struct extent_io_tree *tree, u64 start, u64 end,
if (start <= end && next_node) { if (start <= end && next_node) {
state = rb_entry(next_node, struct extent_state, state = rb_entry(next_node, struct extent_state,
rb_node); rb_node);
if (state->start == start) goto hit_next;
goto hit_next;
} }
goto search_again; goto search_again;
......
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment