blk-mq-tag.h 2.7 KB
Newer Older
1
/* SPDX-License-Identifier: GPL-2.0 */
2 3 4
#ifndef INT_BLK_MQ_TAG_H
#define INT_BLK_MQ_TAG_H

5 6
#include "blk-mq.h"

7 8 9 10 11 12 13
/*
 * Tag address space map.
 */
struct blk_mq_tags {
	unsigned int nr_tags;
	unsigned int nr_reserved_tags;

14 15
	atomic_t active_queues;

16 17
	struct sbitmap_queue bitmap_tags;
	struct sbitmap_queue breserved_tags;
18 19

	struct request **rqs;
J
Jens Axboe 已提交
20
	struct request **static_rqs;
21 22 23
	struct list_head page_list;
};

24

S
Shaohua Li 已提交
25
extern struct blk_mq_tags *blk_mq_init_tags(unsigned int nr_tags, unsigned int reserved_tags, int node, int alloc_policy);
26 27
extern void blk_mq_free_tags(struct blk_mq_tags *tags);

28
extern unsigned int blk_mq_get_tag(struct blk_mq_alloc_data *data);
29 30
extern void blk_mq_put_tag(struct blk_mq_tags *tags, struct blk_mq_ctx *ctx,
			   unsigned int tag);
31 32 33
extern int blk_mq_tag_update_depth(struct blk_mq_hw_ctx *hctx,
					struct blk_mq_tags **tags,
					unsigned int depth, bool can_grow);
34
extern void blk_mq_tag_wakeup_all(struct blk_mq_tags *tags, bool);
35 36
void blk_mq_queue_tag_busy_iter(struct request_queue *q, busy_iter_fn *fn,
		void *priv);
M
Ming Lei 已提交
37 38
void blk_mq_all_tag_iter(struct blk_mq_tags *tags, busy_tag_iter_fn *fn,
		void *priv);
39

40 41 42 43 44 45 46 47
static inline struct sbq_wait_state *bt_wait_ptr(struct sbitmap_queue *bt,
						 struct blk_mq_hw_ctx *hctx)
{
	if (!hctx)
		return &bt->ws[0];
	return sbq_wait_ptr(bt, &hctx->wait_index);
}

48
enum {
49
	BLK_MQ_NO_TAG		= -1U,
J
Jens Axboe 已提交
50
	BLK_MQ_TAG_MIN		= 1,
51
	BLK_MQ_TAG_MAX		= BLK_MQ_NO_TAG - 1,
52 53
};

54 55 56 57 58
extern bool __blk_mq_tag_busy(struct blk_mq_hw_ctx *);
extern void __blk_mq_tag_idle(struct blk_mq_hw_ctx *);

static inline bool blk_mq_tag_busy(struct blk_mq_hw_ctx *hctx)
{
59
	if (!(hctx->flags & BLK_MQ_F_TAG_QUEUE_SHARED))
60 61 62 63 64 65 66
		return false;

	return __blk_mq_tag_busy(hctx);
}

static inline void blk_mq_tag_idle(struct blk_mq_hw_ctx *hctx)
{
67
	if (!(hctx->flags & BLK_MQ_F_TAG_QUEUE_SHARED))
68 69 70 71 72
		return;

	__blk_mq_tag_idle(hctx);
}

73 74 75 76 77 78 79 80 81
/*
 * For shared tag users, we track the number of currently active users
 * and attempt to provide a fair share of the tag depth for each of them.
 */
static inline bool hctx_may_queue(struct blk_mq_hw_ctx *hctx,
				  struct sbitmap_queue *bt)
{
	unsigned int depth, users;

82
	if (!hctx || !(hctx->flags & BLK_MQ_F_TAG_QUEUE_SHARED))
83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103
		return true;
	if (!test_bit(BLK_MQ_S_TAG_ACTIVE, &hctx->state))
		return true;

	/*
	 * Don't try dividing an ant
	 */
	if (bt->sb.depth == 1)
		return true;

	users = atomic_read(&hctx->tags->active_queues);
	if (!users)
		return true;

	/*
	 * Allow at least some tags
	 */
	depth = max((bt->sb.depth + users - 1) / users, 4U);
	return atomic_read(&hctx->nr_active) < depth;
}

104 105 106 107 108 109
static inline bool blk_mq_tag_is_reserved(struct blk_mq_tags *tags,
					  unsigned int tag)
{
	return tag < tags->nr_reserved_tags;
}

110
#endif