99 			    struct sbitmap_queue *bt)  in __blk_mq_get_tag()  argument
102 			!hctx_may_queue(data->hctx, bt))  in __blk_mq_get_tag()
106 		return sbitmap_queue_get_shallow(bt, data->shallow_depth);  in __blk_mq_get_tag()
108 		return __sbitmap_queue_get(bt);  in __blk_mq_get_tag()
115 	struct sbitmap_queue *bt = &tags->bitmap_tags;  in blk_mq_get_tags()  local
121 	ret = __sbitmap_queue_get_batch(bt, nr_tags, offset);  in blk_mq_get_tags()
129 	struct sbitmap_queue *bt;  in blk_mq_get_tag()  local
140 		bt = &tags->breserved_tags;  in blk_mq_get_tag()
143 		bt = &tags->bitmap_tags;  in blk_mq_get_tag()
147 	tag = __blk_mq_get_tag(data, bt);  in blk_mq_get_tag()
154 	ws = bt_wait_ptr(bt, data->hctx);  in blk_mq_get_tag()
169 		tag = __blk_mq_get_tag(data, bt);  in blk_mq_get_tag()
173 		sbitmap_prepare_to_wait(bt, ws, &wait, TASK_UNINTERRUPTIBLE);  in blk_mq_get_tag()
175 		tag = __blk_mq_get_tag(data, bt);  in blk_mq_get_tag()
179 		bt_prev = bt;  in blk_mq_get_tag()
182 		sbitmap_finish_wait(bt, ws, &wait);  in blk_mq_get_tag()
189 			bt = &tags->breserved_tags;  in blk_mq_get_tag()
191 			bt = &tags->bitmap_tags;  in blk_mq_get_tag()
198 		if (bt != bt_prev)  in blk_mq_get_tag()
201 		ws = bt_wait_ptr(bt, data->hctx);  in blk_mq_get_tag()
204 	sbitmap_finish_wait(bt, ws, &wait);  in blk_mq_get_tag()
306 			struct sbitmap_queue *bt, busy_tag_iter_fn *fn,  in bt_for_each()  argument
317 	sbitmap_for_each_set(&bt->sb, bt_iter, &iter_data);  in bt_for_each()
373 static void bt_tags_for_each(struct blk_mq_tags *tags, struct sbitmap_queue *bt,  in bt_tags_for_each()  argument
384 		sbitmap_for_each_set(&bt->sb, bt_tags_iter, &iter_data);  in bt_tags_for_each()
532 static int bt_alloc(struct sbitmap_queue *bt, unsigned int depth,  in bt_alloc()  argument
535 	return sbitmap_queue_init_node(bt, depth, -1, round_robin, GFP_KERNEL,  in bt_alloc()