Lines Matching full:bt
107 struct sbitmap_queue *bt) in __blk_mq_get_tag() argument
110 !hctx_may_queue(data->hctx, bt)) in __blk_mq_get_tag()
114 return sbitmap_queue_get_shallow(bt, data->shallow_depth); in __blk_mq_get_tag()
116 return __sbitmap_queue_get(bt); in __blk_mq_get_tag()
123 struct sbitmap_queue *bt = &tags->bitmap_tags; in blk_mq_get_tags() local
129 ret = __sbitmap_queue_get_batch(bt, nr_tags, offset); in blk_mq_get_tags()
137 struct sbitmap_queue *bt; in blk_mq_get_tag() local
148 bt = &tags->breserved_tags; in blk_mq_get_tag()
151 bt = &tags->bitmap_tags; in blk_mq_get_tag()
155 tag = __blk_mq_get_tag(data, bt); in blk_mq_get_tag()
162 ws = bt_wait_ptr(bt, data->hctx); in blk_mq_get_tag()
177 tag = __blk_mq_get_tag(data, bt); in blk_mq_get_tag()
181 sbitmap_prepare_to_wait(bt, ws, &wait, TASK_UNINTERRUPTIBLE); in blk_mq_get_tag()
183 tag = __blk_mq_get_tag(data, bt); in blk_mq_get_tag()
187 bt_prev = bt; in blk_mq_get_tag()
190 sbitmap_finish_wait(bt, ws, &wait); in blk_mq_get_tag()
197 bt = &tags->breserved_tags; in blk_mq_get_tag()
199 bt = &tags->bitmap_tags; in blk_mq_get_tag()
206 if (bt != bt_prev) in blk_mq_get_tag()
209 ws = bt_wait_ptr(bt, data->hctx); in blk_mq_get_tag()
212 sbitmap_finish_wait(bt, ws, &wait); in blk_mq_get_tag()
302 * @bt: sbitmap to examine. This is either the breserved_tags member
310 * @reserved: Indicates whether @bt is the breserved_tags member or the
314 struct sbitmap_queue *bt, busy_tag_iter_fn *fn, in bt_for_each() argument
325 sbitmap_for_each_set(&bt->sb, bt_iter, &iter_data); in bt_for_each()
372 * @bt: sbitmap to examine. This is either the breserved_tags member
381 static void bt_tags_for_each(struct blk_mq_tags *tags, struct sbitmap_queue *bt, in bt_tags_for_each() argument
392 sbitmap_for_each_set(&bt->sb, bt_tags_iter, &iter_data); in bt_tags_for_each()
540 static int bt_alloc(struct sbitmap_queue *bt, unsigned int depth, in bt_alloc() argument
543 return sbitmap_queue_init_node(bt, depth, -1, round_robin, GFP_KERNEL, in bt_alloc()