lk/linux-kernel-test
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Btrfs: be less strict on finding next node in clear_extent_bit

Browse Source 
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:
Liu Bo
2012-02-16 18:34:36 +08:00
committed by David Sterba
parent d9b0218f6c
commit 692e5759a4
1 changed files with 1 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

1
fs/btrfs/extent_io.c
View File

@@ -582,7 +582,6 @@ next:
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;