korg/linux
0
0
Fork 0
mirror of https://mirrors.bfsu.edu.cn/git/linux.git synced 2024-12-14 14:34:28 +08:00
Code Issues Packages Projects Releases Wiki Activity

Btrfs: deal with min_bytes appropriately when looking for a cluster

Browse Source 
We do all this fun stuff with min_bytes, but either don't use it in the case of
just normal extents, or use it completely wrong in the case of bitmaps.  So fix
this for both cases

1) In the extent case, stop looking for space with window_free >= min_bytes
instead of bytes + empty_size.

2) In the bitmap case, we were looking for streches of free space that was at
least min_bytes in size, which was not right at all.  So instead search for
stretches of free space that are at least bytes in size (this will make a
difference when we have > page size blocks) and then only search for min_bytes
amount of free space.

Thanks,

Reviewed-by: Li Zefan <lizf@cn.fujitsu.com>
Signed-off-by: Josef Bacik <josef@redhat.com>
This commit is contained in:
Josef Bacik 2011-03-18 15:27:43 -04:00
parent 7d0d2e8e6b
commit d0a365e84a
1 changed files with 4 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
fs/btrfs/free-space-cache.c
View File

@ -1910,8 +1910,8 @@ static int btrfs_bitmap_cluster(struct btrfs_block_group_cache *block_group,
i = offset_to_bit(entry->offset, block_group->sectorsize, i = offset_to_bit(entry->offset, block_group->sectorsize,
max_t(u64, offset, entry->offset)); max_t(u64, offset, entry->offset));
search_bits = bytes_to_bits(min_bytes, block_group->sectorsize); search_bits = bytes_to_bits(bytes, block_group->sectorsize);
total_bits = bytes_to_bits(bytes, block_group->sectorsize); total_bits = bytes_to_bits(min_bytes, block_group->sectorsize);
again: again:
found_bits = 0; found_bits = 0;
@ -2034,8 +2034,7 @@ again:
if (entry->bitmap && entry->bytes > bytes + empty_size) { if (entry->bitmap && entry->bytes > bytes + empty_size) {
ret = btrfs_bitmap_cluster(block_group, entry, cluster, ret = btrfs_bitmap_cluster(block_group, entry, cluster,
offset, bytes + empty_size, offset, bytes, min_bytes);
min_bytes);
if (!ret) if (!ret)
goto got_it; goto got_it;
} }
@ -2065,7 +2064,7 @@ again:
while (1) { while (1) {
/* out window is just right, lets fill it */ /* out window is just right, lets fill it */
if (window_free >= bytes + empty_size) if (window_free >= min_bytes)
break; break;
node = rb_next(&last->offset_index); node = rb_next(&last->offset_index);