Commit 692e5759 authored Feb 16, 2012 by Liu Bo Committed by David Sterba Feb 21, 2012

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>

parent d9b0218f

fs/btrfs/extent_io.c

+1 −2

Original line number	Diff line number	Diff line
		@@ -582,7 +582,6 @@ int clear_extent_bit(struct extent_io_tree *tree, u64 start, u64 end,
		if (start <= end && next_node) {
		state = rb_entry(next_node, struct extent_state,
		rb_node);
		if (state->start == start)
		goto hit_next;
		}
		goto search_again;