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: Liu Bo <liubo2009@cn.fujitsu.com>
This commit is contained in:
parent
d9b0218f6c
commit
692e5759a4
|
@ -582,8 +582,7 @@ next:
|
|||
if (start <= end && next_node) {
|
||||
state = rb_entry(next_node, struct extent_state,
|
||||
rb_node);
|
||||
if (state->start == start)
|
||||
goto hit_next;
|
||||
goto hit_next;
|
||||
}
|
||||
goto search_again;
|
||||
|
||||
|
|
Loading…
Reference in a new issue