Lines Matching refs:bt
106 struct sbitmap_queue *bt)
109 !hctx_may_queue(data->hctx, bt))
113 return sbitmap_queue_get_shallow(bt, data->shallow_depth);
115 return __sbitmap_queue_get(bt);
122 struct sbitmap_queue *bt = &tags->bitmap_tags;
128 ret = __sbitmap_queue_get_batch(bt, nr_tags, offset);
136 struct sbitmap_queue *bt;
147 bt = &tags->breserved_tags;
150 bt = &tags->bitmap_tags;
154 tag = __blk_mq_get_tag(data, bt);
161 ws = bt_wait_ptr(bt, data->hctx);
176 tag = __blk_mq_get_tag(data, bt);
180 sbitmap_prepare_to_wait(bt, ws, &wait, TASK_UNINTERRUPTIBLE);
182 tag = __blk_mq_get_tag(data, bt);
186 bt_prev = bt;
189 sbitmap_finish_wait(bt, ws, &wait);
196 bt = &tags->breserved_tags;
198 bt = &tags->bitmap_tags;
205 if (bt != bt_prev)
208 ws = bt_wait_ptr(bt, data->hctx);
211 sbitmap_finish_wait(bt, ws, &wait);
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,
324 sbitmap_for_each_set(&bt->sb, bt_iter, &iter_data);
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,
391 sbitmap_for_each_set(&bt->sb, bt_tags_iter, &iter_data);
539 static int bt_alloc(struct sbitmap_queue *bt, unsigned int depth,
542 return sbitmap_queue_init_node(bt, depth, -1, round_robin, GFP_KERNEL,