27 		struct blk_align_bitmap *bm = &bt->map[i];  in bt_has_free_tags()  local
30 		ret = find_first_zero_bit(&bm->word, bm->depth);  in bt_has_free_tags()
31 		if (ret < bm->depth)  in bt_has_free_tags()
147 static int __bt_get_word(struct blk_align_bitmap *bm, unsigned int last_tag,  in __bt_get_word()  argument
153 		tag = find_next_zero_bit(&bm->word, bm->depth, last_tag);  in __bt_get_word()
154 		if (unlikely(tag >= bm->depth)) {  in __bt_get_word()
167 		if (!test_and_set_bit(tag, &bm->word))  in __bt_get_word()
171 		if (last_tag >= bm->depth - 1)  in __bt_get_word()
431 		struct blk_align_bitmap *bm = &bt->map[i];  in bt_for_each()  local
433 		for (bit = find_first_bit(&bm->word, bm->depth);  in bt_for_each()
434 		     bit < bm->depth;  in bt_for_each()
435 		     bit = find_next_bit(&bm->word, bm->depth, bit + 1)) {  in bt_for_each()
455 		struct blk_align_bitmap *bm = &bt->map[i];  in bt_tags_for_each()  local
457 		for (bit = find_first_bit(&bm->word, bm->depth);  in bt_tags_for_each()
458 		     bit < bm->depth;  in bt_tags_for_each()
459 		     bit = find_next_bit(&bm->word, bm->depth, bit + 1)) {  in bt_tags_for_each()
508 		struct blk_align_bitmap *bm = &bt->map[i];  in bt_unused_tags()  local
510 		used += bitmap_weight(&bm->word, bm->depth);  in bt_unused_tags()