Browse Source

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>
master
Liu Bo 10 years ago
committed by David Sterba
parent
commit
692e5759a4
  1. 3
      fs/btrfs/extent_io.c

3
fs/btrfs/extent_io.c

@ -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…
Cancel
Save