Lines Matching full:bt
106 struct sbitmap_queue *bt) in __blk_mq_get_tag() argument
109 !hctx_may_queue(data->hctx, bt)) in __blk_mq_get_tag()
113 return sbitmap_queue_get_shallow(bt, data->shallow_depth); in __blk_mq_get_tag()
115 return __sbitmap_queue_get(bt); in __blk_mq_get_tag()
122 struct sbitmap_queue *bt = &tags->bitmap_tags; in blk_mq_get_tags() local
128 ret = __sbitmap_queue_get_batch(bt, nr_tags, offset); in blk_mq_get_tags()
136 struct sbitmap_queue *bt; in blk_mq_get_tag() local
147 bt = &tags->breserved_tags; in blk_mq_get_tag()
150 bt = &tags->bitmap_tags; in blk_mq_get_tag()
154 tag = __blk_mq_get_tag(data, bt); in blk_mq_get_tag()
161 ws = bt_wait_ptr(bt, data->hctx); in blk_mq_get_tag()
176 tag = __blk_mq_get_tag(data, bt); in blk_mq_get_tag()
180 sbitmap_prepare_to_wait(bt, ws, &wait, TASK_UNINTERRUPTIBLE); in blk_mq_get_tag()
182 tag = __blk_mq_get_tag(data, bt); in blk_mq_get_tag()
186 bt_prev = bt; in blk_mq_get_tag()
189 sbitmap_finish_wait(bt, ws, &wait); in blk_mq_get_tag()
196 bt = &tags->breserved_tags; in blk_mq_get_tag()
198 bt = &tags->bitmap_tags; in blk_mq_get_tag()
205 if (bt != bt_prev) in blk_mq_get_tag()
208 ws = bt_wait_ptr(bt, data->hctx); in blk_mq_get_tag()
211 sbitmap_finish_wait(bt, ws, &wait); in blk_mq_get_tag()
301 * @bt: sbitmap to examine. This is either the breserved_tags member
309 * @reserved: Indicates whether @bt is the breserved_tags member or the
313 struct sbitmap_queue *bt, busy_tag_iter_fn *fn, in bt_for_each() argument
324 sbitmap_for_each_set(&bt->sb, bt_iter, &iter_data); in bt_for_each()
371 * @bt: sbitmap to examine. This is either the breserved_tags member
380 static void bt_tags_for_each(struct blk_mq_tags *tags, struct sbitmap_queue *bt, in bt_tags_for_each() argument
391 sbitmap_for_each_set(&bt->sb, bt_tags_iter, &iter_data); in bt_tags_for_each()
539 static int bt_alloc(struct sbitmap_queue *bt, unsigned int depth, in bt_alloc() argument
542 return sbitmap_queue_init_node(bt, depth, -1, round_robin, GFP_KERNEL, in bt_alloc()