Donate to e Foundation | Murena handsets with /e/OS | Own a part of Murena! Learn more

Commit ebb3dad4 authored by Wei Yongjun's avatar Wei Yongjun Committed by Chris Mason
Browse files

Btrfs: using for_each_set_bit_from to simplify the code 

Using for_each_set_bit_from() to simplify the code.

spatch with a semantic match is used to found this.
(http://coccinelle.lip6.fr/

)

Signed-off-by: default avatarWei Yongjun <yongjun_wei@trendmicro.com.cn>
parent 1bcea355

fs/btrfs/free-space-cache.c

+2 −6
Original line number Diff line number Diff line
@@ -1454,9 +1454,7 @@ static int search_bitmap(struct btrfs_free_space_ctl *ctl, 
			  max_t(u64, *offset, bitmap_info->offset));

	bits = bytes_to_bits(*bytes, ctl->unit);



	for (i = find_next_bit(bitmap_info->bitmap, BITS_PER_BITMAP, i);

	     i < BITS_PER_BITMAP;

	     i = find_next_bit(bitmap_info->bitmap, BITS_PER_BITMAP, i + 1)) {

	for_each_set_bit_from(i, bitmap_info->bitmap, BITS_PER_BITMAP) {

		next_zero = find_next_zero_bit(bitmap_info->bitmap,

					       BITS_PER_BITMAP, i);

		if ((next_zero - i) >= bits) {
@@ -2307,9 +2305,7 @@ static int btrfs_bitmap_cluster(struct btrfs_block_group_cache *block_group, 


again:

	found_bits = 0;

	for (i = find_next_bit(entry->bitmap, BITS_PER_BITMAP, i);

	     i < BITS_PER_BITMAP;

	     i = find_next_bit(entry->bitmap, BITS_PER_BITMAP, i + 1)) {

	for_each_set_bit_from(i, entry->bitmap, BITS_PER_BITMAP) {

		next_zero = find_next_zero_bit(entry->bitmap,

					       BITS_PER_BITMAP, i);

		if (next_zero - i >= min_bits) {