24 	int i;  in bt_has_free_tags()  local
26 	for (i = 0; i < bt->map_nr; i++) {  in bt_has_free_tags()
27 		struct blk_align_bitmap *bm = &bt->map[i];  in bt_has_free_tags()
76 	int i, wake_index;  in blk_mq_tag_wakeup_all()  local
84 	for (i = 0; i < BT_WAIT_QUEUES; i++) {  in blk_mq_tag_wakeup_all()
195 	int index, i, tag;  in __bt_get()  local
203 	for (i = 0; i < bt->map_nr; i++) {  in __bt_get()
360 	int i, wake_index;  in bt_wake_ptr()  local
363 	for (i = 0; i < BT_WAIT_QUEUES; i++) {  in bt_wake_ptr()
428 	int bit, i;  in bt_for_each()  local
430 	for (i = 0; i < bt->map_nr; i++) {  in bt_for_each()
431 		struct blk_align_bitmap *bm = &bt->map[i];  in bt_for_each()
450 	int bit, i;  in bt_tags_for_each()  local
454 	for (i = 0; i < bt->map_nr; i++) {  in bt_tags_for_each()
455 		struct blk_align_bitmap *bm = &bt->map[i];  in bt_tags_for_each()
482 	int i;  in blk_mq_queue_tag_busy_iter()  local
490 	queue_for_each_hw_ctx(q, hctx, i) {  in blk_mq_queue_tag_busy_iter()
510 	unsigned int i, used;  in bt_unused_tags()  local
512 	for (i = 0, used = 0; i < bt->map_nr; i++) {  in bt_unused_tags()
513 		struct blk_align_bitmap *bm = &bt->map[i];  in bt_unused_tags()
528 		int i;  in bt_update_count()  local
530 		for (i = 0; i < bt->map_nr; i++) {  in bt_update_count()
531 			bt->map[i].depth = min(map_depth, tags_per_word);  in bt_update_count()
532 			map_depth -= bt->map[i].depth;  in bt_update_count()
546 	int i;  in bt_alloc()  local
590 	for (i = 0; i < BT_WAIT_QUEUES; i++) {  in bt_alloc()
591 		init_waitqueue_head(&bt->bs[i].wait);  in bt_alloc()
592 		atomic_set(&bt->bs[i].wait_cnt, bt->wake_cnt);  in bt_alloc()