diff options
Diffstat (limited to 'fs/btrfs/free-space-cache.c')
| -rw-r--r-- | fs/btrfs/free-space-cache.c | 10 |
1 files changed, 3 insertions, 7 deletions
diff --git a/fs/btrfs/free-space-cache.c b/fs/btrfs/free-space-cache.c index 6b10acfc2f5c..1027b854b90c 100644 --- a/fs/btrfs/free-space-cache.c +++ b/fs/btrfs/free-space-cache.c | |||
| @@ -966,7 +966,7 @@ int __btrfs_write_out_cache(struct btrfs_root *root, struct inode *inode, | |||
| 966 | block_group->key.offset)) { | 966 | block_group->key.offset)) { |
| 967 | ret = find_first_extent_bit(unpin, start, | 967 | ret = find_first_extent_bit(unpin, start, |
| 968 | &extent_start, &extent_end, | 968 | &extent_start, &extent_end, |
| 969 | EXTENT_DIRTY); | 969 | EXTENT_DIRTY, NULL); |
| 970 | if (ret) { | 970 | if (ret) { |
| 971 | ret = 0; | 971 | ret = 0; |
| 972 | break; | 972 | break; |
| @@ -1454,9 +1454,7 @@ static int search_bitmap(struct btrfs_free_space_ctl *ctl, | |||
| 1454 | max_t(u64, *offset, bitmap_info->offset)); | 1454 | max_t(u64, *offset, bitmap_info->offset)); |
| 1455 | bits = bytes_to_bits(*bytes, ctl->unit); | 1455 | bits = bytes_to_bits(*bytes, ctl->unit); |
| 1456 | 1456 | ||
| 1457 | for (i = find_next_bit(bitmap_info->bitmap, BITS_PER_BITMAP, i); | 1457 | for_each_set_bit_from(i, bitmap_info->bitmap, BITS_PER_BITMAP) { |
| 1458 | i < BITS_PER_BITMAP; | ||
| 1459 | i = find_next_bit(bitmap_info->bitmap, BITS_PER_BITMAP, i + 1)) { | ||
| 1460 | next_zero = find_next_zero_bit(bitmap_info->bitmap, | 1458 | next_zero = find_next_zero_bit(bitmap_info->bitmap, |
| 1461 | BITS_PER_BITMAP, i); | 1459 | BITS_PER_BITMAP, i); |
| 1462 | if ((next_zero - i) >= bits) { | 1460 | if ((next_zero - i) >= bits) { |
| @@ -2307,9 +2305,7 @@ static int btrfs_bitmap_cluster(struct btrfs_block_group_cache *block_group, | |||
| 2307 | 2305 | ||
| 2308 | again: | 2306 | again: |
| 2309 | found_bits = 0; | 2307 | found_bits = 0; |
| 2310 | for (i = find_next_bit(entry->bitmap, BITS_PER_BITMAP, i); | 2308 | for_each_set_bit_from(i, entry->bitmap, BITS_PER_BITMAP) { |
| 2311 | i < BITS_PER_BITMAP; | ||
| 2312 | i = find_next_bit(entry->bitmap, BITS_PER_BITMAP, i + 1)) { | ||
| 2313 | next_zero = find_next_zero_bit(entry->bitmap, | 2309 | next_zero = find_next_zero_bit(entry->bitmap, |
| 2314 | BITS_PER_BITMAP, i); | 2310 | BITS_PER_BITMAP, i); |
| 2315 | if (next_zero - i >= min_bits) { | 2311 | if (next_zero - i >= min_bits) { |
