]> git.baikalelectronics.ru Git - kernel.git/commit
projects / kernel.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: a71e8d2) | patch
Btrfs: be less strict on finding next node in clear_extent_bit
authorLiu Bo <liubo2009@cn.fujitsu.com>
Thu, 16 Feb 2012 10:34:36 +0000 (18:34 +0800)
committerDavid Sterba <dsterba@suse.cz>
Tue, 21 Feb 2012 15:02:10 +0000 (16:02 +0100)
commit444c11c0b7ebe4017cfaf34fb47f2a57de7f62e3
treeb3e1ea148b1702c63ccca95712d7cad2bb35a1eatree | snapshot
parenta71e8d27c548e87560ae9e5a22f5e49cea9130d2commit | 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>
fs/btrfs/extent_io.c diff | blob | history
Linux Kernel Source Tree.