46 		if (hctx->ctx_map.map[i].word)  in blk_mq_hctx_has_pending()
55 	return &hctx->ctx_map.map[ctx->index_hw / hctx->ctx_map.bits_per_word];  in get_bm()
713 		struct blk_align_bitmap *bm = &hctx->ctx_map.map[i];  in flush_busy_ctxs()
1565 	kfree(bitmap->map);  in blk_mq_free_bitmap()
1575 	bitmap->map = kzalloc_node(num_maps * sizeof(struct blk_align_bitmap),  in blk_mq_alloc_bitmap()
1577 	if (!bitmap->map)  in blk_mq_alloc_bitmap()
1582 		bitmap->map[i].depth = min(total, bitmap->bits_per_word);  in blk_mq_alloc_bitmap()
1583 		total -= bitmap->map[i].depth;  in blk_mq_alloc_bitmap()
1853 		struct blk_mq_ctxmap *map = &hctx->ctx_map;  in blk_mq_map_swqueue()  local
1879 		map->size = DIV_ROUND_UP(hctx->nr_ctx, map->bits_per_word);  in blk_mq_map_swqueue()
2005 	unsigned int *map;  in blk_mq_init_allocated_queue()  local
2018 	map = blk_mq_make_queue_map(set);  in blk_mq_init_allocated_queue()
2019 	if (!map)  in blk_mq_init_allocated_queue()
2023 		int node = blk_mq_hw_queue_to_node(map, i);  in blk_mq_init_allocated_queue()
2044 	q->mq_map = map;  in blk_mq_init_allocated_queue()
2092 	kfree(map);  in blk_mq_init_allocated_queue()