Lines Matching refs:bqt
816 * @bqt: the tag map to free
818 * Tries to free the specified @bqt@. Returns true if it was
821 static int __blk_free_tags(struct blk_queue_tag *bqt)
825 retval = atomic_dec_and_test(&bqt->refcnt);
827 BUG_ON(bqt->busy);
828 BUG_ON(!list_empty(&bqt->busy_list));
830 kfree(bqt->tag_index);
831 bqt->tag_index = NULL;
833 kfree(bqt->tag_map);
834 bqt->tag_map = NULL;
836 kfree(bqt);
853 struct blk_queue_tag *bqt = q->queue_tags;
855 if (!bqt)
858 __blk_free_tags(bqt);
867 * @bqt: the tag map to free
869 * For externally managed @bqt@ frees the map. Callers of this
873 void blk_free_tags(struct blk_queue_tag *bqt)
875 if (unlikely(!__blk_free_tags(bqt)))
1009 struct blk_queue_tag *bqt = q->queue_tags;
1014 if (!bqt)
1023 if (new_depth <= bqt->real_max_depth) {
1024 bqt->max_depth = new_depth;
1032 if (atomic_read(&bqt->refcnt) != 1)
1038 tag_index = bqt->tag_index;
1039 tag_map = bqt->tag_map;
1040 max_depth = bqt->real_max_depth;
1042 if (init_tag_map(q, bqt, new_depth))
1045 memcpy(bqt->tag_index, tag_index, max_depth * sizeof(struct request *));
1047 memcpy(bqt->tag_map, tag_map, nr_ulongs * sizeof(unsigned long));
1072 struct blk_queue_tag *bqt = q->queue_tags;
1077 if (unlikely(tag >= bqt->real_max_depth))
1080 if (unlikely(!__test_and_clear_bit(tag, bqt->tag_map))) {
1090 if (unlikely(bqt->tag_index[tag] == NULL))
1094 bqt->tag_index[tag] = NULL;
1095 bqt->busy--;
1120 struct blk_queue_tag *bqt = q->queue_tags;
1136 tag = find_first_zero_bit(bqt->tag_map, bqt->max_depth);
1137 if (tag >= bqt->max_depth)
1140 } while (test_and_set_bit(tag, bqt->tag_map));
1144 bqt->tag_index[tag] = rq;
1146 list_add(&rq->queuelist, &bqt->busy_list);
1147 bqt->busy++;
1167 struct blk_queue_tag *bqt = q->queue_tags;
1171 list_for_each_safe(tmp, n, &bqt->busy_list) {