summaryrefslogtreecommitdiff
path: root/fs/btrfs/inode.c
diff options
context:
space:
mode:
authorLiu Bo <bo.li.liu@oracle.com>2013-04-27 02:56:57 +0000
committerJosef Bacik <jbacik@fusionio.com>2013-05-06 15:55:26 -0400
commit625f1c8dc66d77878e1a563d6dd5722404968fbf (patch)
tree76277ca036ae9910b5ec94a5263907c4c5ffd48b /fs/btrfs/inode.c
parent55793c0d0381176e727389325d9a47f7f0b5387f (diff)
downloadlwn-625f1c8dc66d77878e1a563d6dd5722404968fbf.tar.gz
lwn-625f1c8dc66d77878e1a563d6dd5722404968fbf.zip
Btrfs: improve the loop of scrub_stripe
1) Right now scrub_stripe() is looping in some unnecessary cases: * when the found extent item's objectid has been out of the dev extent's range but we haven't finish scanning all the range within the dev extent * when all the items has been processed but we haven't finish scanning all the range within the dev extent In both cases, we can just finish the loop to save costs. 2) Besides, when the found extent item's length is larger than the stripe len(64k), we don't have to release the path and search again as it'll get at the same key used in the last loop, we can instead increase the logical cursor in place till all space of the extent is scanned. 3) And we use 0 as the key's offset to search btree, then get to previous item to find a smaller item, and again have to move to the next one to get the right item. Setting offset=-1 and previous_item() is the correct way. 4) As we won't find any checksum at offset unless this 'offset' is in a data extent, we can just find checksum when we're really going to scrub an extent. Signed-off-by: Liu Bo <bo.li.liu@oracle.com> Signed-off-by: Josef Bacik <jbacik@fusionio.com>
Diffstat (limited to 'fs/btrfs/inode.c')
0 files changed, 0 insertions, 0 deletions