diff options
| author | Liu Bo <liubo2009@cn.fujitsu.com> | 2012-02-16 18:34:36 +0800 |
|---|---|---|
| committer | David Sterba <dsterba@suse.cz> | 2012-02-21 16:02:10 +0100 |
| commit | 692e5759a43b916f0b66bcb39b2957499992381e (patch) | |
| tree | b3e1ea148b1702c63ccca95712d7cad2bb35a1ea | |
| parent | d9b0218f6cb682aa6a4ada2bfc5a25fdf3018563 (diff) | |
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>
| -rw-r--r-- | fs/btrfs/extent_io.c | 3 |
1 files changed, 1 insertions, 2 deletions
diff --git a/fs/btrfs/extent_io.c b/fs/btrfs/extent_io.c index 37259ff5cd7..45ca8f9b0d6 100644 --- a/fs/btrfs/extent_io.c +++ b/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; |