Btrfs: be less strict on finding next node in clear_extent_bit

liub · kdave · commit 692e5759a43b · 2012-02-21T16:02:10.000+01:00
In clear_extent_bit, it is enough that next node is adjacent in tree level.

Signed-off-by: Liu Bo &lt;liubo2009@cn.fujitsu.com&gt;
diff --git a/fs/btrfs/extent_io.c b/fs/btrfs/extent_io.c
@@ -582,8 +582,7 @@ 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 hit_next;
 	}
 	goto search_again;
 

Original file line number	Diff line number	Diff line change
`@@ -582,8 +582,7 @@ int clear_extent_bit(struct extent_io_tree *tree, u64 start, u64 end,`
`582`	`582`	`if (start <= end && next_node) {`
`583`	`583`	`state = rb_entry(next_node, struct extent_state,`
`584`	`584`	`rb_node);`
`585`		`- if (state->start == start)`
`586`		`- goto hit_next;`
	`585`	`+ goto hit_next;`
`587`	`586`	`}`
`588`	`587`	`goto search_again;`
`589`	`588`