[linux-block.git] / block / blk-mq.h

/* SPDX-License-Identifier: GPL-2.0 */
#ifndef INT_BLK_MQ_H
#define INT_BLK_MQ_H

#include "blk-stat.h"
#include "blk-mq-tag.h"

struct blk_mq_tag_set;

struct blk_mq_ctxs {
	struct kobject kobj;
	struct blk_mq_ctx __percpu	*queue_ctx;
};

/**
 * struct blk_mq_ctx - State for a software queue facing the submitting CPUs
 */
struct blk_mq_ctx {
	struct {
		spinlock_t		lock;
		struct list_head	rq_lists[HCTX_MAX_TYPES];
	} ____cacheline_aligned_in_smp;

	unsigned int		cpu;
	unsigned short		index_hw[HCTX_MAX_TYPES];
	struct blk_mq_hw_ctx 	*hctxs[HCTX_MAX_TYPES];

	struct request_queue	*queue;
	struct blk_mq_ctxs      *ctxs;
	struct kobject		kobj;
} ____cacheline_aligned_in_smp;

void blk_mq_submit_bio(struct bio *bio);
int blk_mq_poll(struct request_queue *q, blk_qc_t cookie, struct io_comp_batch *iob,
		unsigned int flags);
void blk_mq_exit_queue(struct request_queue *q);
int blk_mq_update_nr_requests(struct request_queue *q, unsigned int nr);
void blk_mq_wake_waiters(struct request_queue *q);
bool blk_mq_dispatch_rq_list(struct blk_mq_hw_ctx *hctx, struct list_head *,
			     unsigned int);
void blk_mq_add_to_requeue_list(struct request *rq, bool at_head,
				bool kick_requeue_list);
void blk_mq_flush_busy_ctxs(struct blk_mq_hw_ctx *hctx, struct list_head *list);
struct request *blk_mq_dequeue_from_ctx(struct blk_mq_hw_ctx *hctx,
					struct blk_mq_ctx *start);
void blk_mq_put_rq_ref(struct request *rq);

/*
 * Internal helpers for allocating/freeing the request map
 */
void blk_mq_free_rqs(struct blk_mq_tag_set *set, struct blk_mq_tags *tags,
		     unsigned int hctx_idx);
void blk_mq_free_rq_map(struct blk_mq_tags *tags);
struct blk_mq_tags *blk_mq_alloc_map_and_rqs(struct blk_mq_tag_set *set,
				unsigned int hctx_idx, unsigned int depth);
void blk_mq_free_map_and_rqs(struct blk_mq_tag_set *set,
			     struct blk_mq_tags *tags,
			     unsigned int hctx_idx);
/*
 * Internal helpers for request insertion into sw queues
 */
void __blk_mq_insert_request(struct blk_mq_hw_ctx *hctx, struct request *rq,
				bool at_head);
void blk_mq_request_bypass_insert(struct request *rq, bool at_head,
				  bool run_queue);
void blk_mq_insert_requests(struct blk_mq_hw_ctx *hctx, struct blk_mq_ctx *ctx,
				struct list_head *list);
void blk_mq_try_issue_list_directly(struct blk_mq_hw_ctx *hctx,
				    struct list_head *list);

/*
 * CPU -> queue mappings
 */
extern int blk_mq_hw_queue_to_node(struct blk_mq_queue_map *qmap, unsigned int);

/*
 * blk_mq_map_queue_type() - map (hctx_type,cpu) to hardware queue
 * @q: request queue
 * @type: the hctx type index
 * @cpu: CPU
 */
static inline struct blk_mq_hw_ctx *blk_mq_map_queue_type(struct request_queue *q,
							  enum hctx_type type,
							  unsigned int cpu)
{
	return q->queue_hw_ctx[q->tag_set->map[type].mq_map[cpu]];
}

static inline enum hctx_type blk_mq_get_hctx_type(unsigned int flags)
{
	enum hctx_type type = HCTX_TYPE_DEFAULT;

	/*
	 * The caller ensure that if REQ_POLLED, poll must be enabled.
	 */
	if (flags & REQ_POLLED)
		type = HCTX_TYPE_POLL;
	else if ((flags & REQ_OP_MASK) == REQ_OP_READ)
		type = HCTX_TYPE_READ;
	return type;
}

/*
 * blk_mq_map_queue() - map (cmd_flags,type) to hardware queue
 * @q: request queue
 * @flags: request command flags
 * @ctx: software queue cpu ctx
 */
static inline struct blk_mq_hw_ctx *blk_mq_map_queue(struct request_queue *q,
						     unsigned int flags,
						     struct blk_mq_ctx *ctx)
{
	return ctx->hctxs[blk_mq_get_hctx_type(flags)];
}

/*
 * sysfs helpers
 */
extern void blk_mq_sysfs_init(struct request_queue *q);
extern void blk_mq_sysfs_deinit(struct request_queue *q);
extern int __blk_mq_register_dev(struct device *dev, struct request_queue *q);
extern int blk_mq_sysfs_register(struct request_queue *q);
extern void blk_mq_sysfs_unregister(struct request_queue *q);
extern void blk_mq_hctx_kobj_init(struct blk_mq_hw_ctx *hctx);
void blk_mq_free_plug_rqs(struct blk_plug *plug);
void blk_mq_flush_plug_list(struct blk_plug *plug, bool from_schedule);

void blk_mq_cancel_work_sync(struct request_queue *q);

void blk_mq_release(struct request_queue *q);

static inline struct blk_mq_ctx *__blk_mq_get_ctx(struct request_queue *q,
					   unsigned int cpu)
{
	return per_cpu_ptr(q->queue_ctx, cpu);
}

/*
 * This assumes per-cpu software queueing queues. They could be per-node
 * as well, for instance. For now this is hardcoded as-is. Note that we don't
 * care about preemption, since we know the ctx's are persistent. This does
 * mean that we can't rely on ctx always matching the currently running CPU.
 */
static inline struct blk_mq_ctx *blk_mq_get_ctx(struct request_queue *q)
{
	return __blk_mq_get_ctx(q, raw_smp_processor_id());
}

struct blk_mq_alloc_data {
	/* input parameter */
	struct request_queue *q;
	blk_mq_req_flags_t flags;
	unsigned int shallow_depth;
	unsigned int cmd_flags;
	req_flags_t rq_flags;

	/* allocate multiple requests/tags in one go */
	unsigned int nr_tags;
	struct request **cached_rq;

	/* input & output parameter */
	struct blk_mq_ctx *ctx;
	struct blk_mq_hw_ctx *hctx;
};

static inline bool blk_mq_is_shared_tags(unsigned int flags)
{
	return flags & BLK_MQ_F_TAG_HCTX_SHARED;
}

static inline struct blk_mq_tags *blk_mq_tags_from_data(struct blk_mq_alloc_data *data)
{
	if (!(data->rq_flags & RQF_ELV))
		return data->hctx->tags;
	return data->hctx->sched_tags;
}

static inline bool blk_mq_hctx_stopped(struct blk_mq_hw_ctx *hctx)
{
	return test_bit(BLK_MQ_S_STOPPED, &hctx->state);
}

static inline bool blk_mq_hw_queue_mapped(struct blk_mq_hw_ctx *hctx)
{
	return hctx->nr_ctx && hctx->tags;
}

unsigned int blk_mq_in_flight(struct request_queue *q,
		struct block_device *part);
void blk_mq_in_flight_rw(struct request_queue *q, struct block_device *part,
		unsigned int inflight[2]);

static inline void blk_mq_put_dispatch_budget(struct request_queue *q,
					      int budget_token)
{
	if (q->mq_ops->put_budget)
		q->mq_ops->put_budget(q, budget_token);
}

static inline int blk_mq_get_dispatch_budget(struct request_queue *q)
{
	if (q->mq_ops->get_budget)
		return q->mq_ops->get_budget(q);
	return 0;
}

static inline void blk_mq_set_rq_budget_token(struct request *rq, int token)
{
	if (token < 0)
		return;

	if (rq->q->mq_ops->set_rq_budget_token)
		rq->q->mq_ops->set_rq_budget_token(rq, token);
}

static inline int blk_mq_get_rq_budget_token(struct request *rq)
{
	if (rq->q->mq_ops->get_rq_budget_token)
		return rq->q->mq_ops->get_rq_budget_token(rq);
	return -1;
}

static inline void __blk_mq_inc_active_requests(struct blk_mq_hw_ctx *hctx)
{
	if (blk_mq_is_shared_tags(hctx->flags))
		atomic_inc(&hctx->queue->nr_active_requests_shared_tags);
	else
		atomic_inc(&hctx->nr_active);
}

static inline void __blk_mq_sub_active_requests(struct blk_mq_hw_ctx *hctx,
		int val)
{
	if (blk_mq_is_shared_tags(hctx->flags))
		atomic_sub(val, &hctx->queue->nr_active_requests_shared_tags);
	else
		atomic_sub(val, &hctx->nr_active);
}

static inline void __blk_mq_dec_active_requests(struct blk_mq_hw_ctx *hctx)
{
	__blk_mq_sub_active_requests(hctx, 1);
}

static inline int __blk_mq_active_requests(struct blk_mq_hw_ctx *hctx)
{
	if (blk_mq_is_shared_tags(hctx->flags))
		return atomic_read(&hctx->queue->nr_active_requests_shared_tags);
	return atomic_read(&hctx->nr_active);
}
static inline void __blk_mq_put_driver_tag(struct blk_mq_hw_ctx *hctx,
					   struct request *rq)
{
	blk_mq_put_tag(hctx->tags, rq->mq_ctx, rq->tag);
	rq->tag = BLK_MQ_NO_TAG;

	if (rq->rq_flags & RQF_MQ_INFLIGHT) {
		rq->rq_flags &= ~RQF_MQ_INFLIGHT;
		__blk_mq_dec_active_requests(hctx);
	}
}

static inline void blk_mq_put_driver_tag(struct request *rq)
{
	if (rq->tag == BLK_MQ_NO_TAG || rq->internal_tag == BLK_MQ_NO_TAG)
		return;

	__blk_mq_put_driver_tag(rq->mq_hctx, rq);
}

bool __blk_mq_get_driver_tag(struct blk_mq_hw_ctx *hctx, struct request *rq);

static inline bool blk_mq_get_driver_tag(struct request *rq)
{
	struct blk_mq_hw_ctx *hctx = rq->mq_hctx;

	if (rq->tag != BLK_MQ_NO_TAG &&
	    !(hctx->flags & BLK_MQ_F_TAG_QUEUE_SHARED)) {
		hctx->tags->rqs[rq->tag] = rq;
		return true;
	}

	return __blk_mq_get_driver_tag(hctx, rq);
}

static inline void blk_mq_clear_mq_map(struct blk_mq_queue_map *qmap)
{
	int cpu;

	for_each_possible_cpu(cpu)
		qmap->mq_map[cpu] = 0;
}

/*
 * blk_mq_plug() - Get caller context plug
 * @q: request queue
 * @bio : the bio being submitted by the caller context
 *
 * Plugging, by design, may delay the insertion of BIOs into the elevator in
 * order to increase BIO merging opportunities. This however can cause BIO
 * insertion order to change from the order in which submit_bio() is being
 * executed in the case of multiple contexts concurrently issuing BIOs to a
 * device, even if these context are synchronized to tightly control BIO issuing
 * order. While this is not a problem with regular block devices, this ordering
 * change can cause write BIO failures with zoned block devices as these
 * require sequential write patterns to zones. Prevent this from happening by
 * ignoring the plug state of a BIO issuing context if the target request queue
 * is for a zoned block device and the BIO to plug is a write operation.
 *
 * Return current->plug if the bio can be plugged and NULL otherwise
 */
static inline struct blk_plug *blk_mq_plug(struct request_queue *q,
					   struct bio *bio)
{
	/*
	 * For regular block devices or read operations, use the context plug
	 * which may be NULL if blk_start_plug() was not executed.
	 */
	if (!blk_queue_is_zoned(q) || !op_is_write(bio_op(bio)))
		return current->plug;

	/* Zoned block device write operation case: do not plug the BIO */
	return NULL;
}

/* Free all requests on the list */
static inline void blk_mq_free_requests(struct list_head *list)
{
	while (!list_empty(list)) {
		struct request *rq = list_entry_rq(list->next);

		list_del_init(&rq->queuelist);
		blk_mq_free_request(rq);
	}
}

/*
 * 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;

	if (!hctx || !(hctx->flags & BLK_MQ_F_TAG_QUEUE_SHARED))
		return true;

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

	if (blk_mq_is_shared_tags(hctx->flags)) {
		struct request_queue *q = hctx->queue;

		if (!test_bit(QUEUE_FLAG_HCTX_ACTIVE, &q->queue_flags))
			return true;
	} else {
		if (!test_bit(BLK_MQ_S_TAG_ACTIVE, &hctx->state))
			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 __blk_mq_active_requests(hctx) < depth;
}

/* run the code block in @dispatch_ops with rcu/srcu read lock held */
#define __blk_mq_run_dispatch_ops(q, check_sleep, dispatch_ops)	\
do {								\
	if (!blk_queue_has_srcu(q)) {				\
		rcu_read_lock();				\
		(dispatch_ops);					\
		rcu_read_unlock();				\
	} else {						\
		int srcu_idx;					\
								\
		might_sleep_if(check_sleep);			\
		srcu_idx = srcu_read_lock((q)->srcu);		\
		(dispatch_ops);					\
		srcu_read_unlock((q)->srcu, srcu_idx);		\
	}							\
} while (0)

#define blk_mq_run_dispatch_ops(q, dispatch_ops)		\
	__blk_mq_run_dispatch_ops(q, true, dispatch_ops)	\

#endif
Commit	Line	Data
b2441318	1	/* SPDX-License-Identifier: GPL-2.0 */
320ae51f JA	2	#ifndef INT_BLK_MQ_H
	3	#define INT_BLK_MQ_H
	4
cf43e6be	5	#include "blk-stat.h"
244c65a3	6	#include "blk-mq-tag.h"
cf43e6be	7
24d2f903 CH	8	struct blk_mq_tag_set;
24d2f903 CH	9
1db4909e ML	10	struct blk_mq_ctxs {
	11	struct kobject kobj;
	12	struct blk_mq_ctx __percpu *queue_ctx;
	13	};
	14
fe644072 LW	15	/**
	16	* struct blk_mq_ctx - State for a software queue facing the submitting CPUs
	17	*/
320ae51f JA	18	struct blk_mq_ctx {
	19	struct {
	20	spinlock_t lock;
c16d6b5a ML	21	struct list_head rq_lists[HCTX_MAX_TYPES];
c16d6b5a ML	22	} ____cacheline_aligned_in_smp;
320ae51f JA	23
320ae51f JA	24	unsigned int cpu;
f31967f0	25	unsigned short index_hw[HCTX_MAX_TYPES];
8ccdf4a3	26	struct blk_mq_hw_ctx *hctxs[HCTX_MAX_TYPES];
320ae51f	27
320ae51f	28	struct request_queue *queue;
1db4909e	29	struct blk_mq_ctxs *ctxs;
320ae51f	30	struct kobject kobj;
4bb659b1	31	} ____cacheline_aligned_in_smp;
320ae51f	32
3e08773c	33	void blk_mq_submit_bio(struct bio *bio);
5a72e899 JA	34	int blk_mq_poll(struct request_queue q, blk_qc_t cookie, struct io_comp_batch iob,
5a72e899 JA	35	unsigned int flags);
c7e2d94b	36	void blk_mq_exit_queue(struct request_queue *q);
e3a2b3f9	37	int blk_mq_update_nr_requests(struct request_queue *q, unsigned int nr);
aed3ea94	38	void blk_mq_wake_waiters(struct request_queue *q);
1fd40b5e ML	39	bool blk_mq_dispatch_rq_list(struct blk_mq_hw_ctx hctx, struct list_head ,
1fd40b5e ML	40	unsigned int);
e6c98712 BVA	41	void blk_mq_add_to_requeue_list(struct request *rq, bool at_head,
e6c98712 BVA	42	bool kick_requeue_list);
2c3ad667	43	void blk_mq_flush_busy_ctxs(struct blk_mq_hw_ctx hctx, struct list_head list);
b347689f ML	44	struct request blk_mq_dequeue_from_ctx(struct blk_mq_hw_ctx hctx,
b347689f ML	45	struct blk_mq_ctx *start);
2e315dc0	46	void blk_mq_put_rq_ref(struct request *rq);
2c3ad667 JA	47
	48	/*
	49	* Internal helpers for allocating/freeing the request map
	50	*/
cc71a6f4 JA	51	void blk_mq_free_rqs(struct blk_mq_tag_set set, struct blk_mq_tags tags,
cc71a6f4 JA	52	unsigned int hctx_idx);
e155b0c2	53	void blk_mq_free_rq_map(struct blk_mq_tags *tags);
63064be1 JG	54	struct blk_mq_tags blk_mq_alloc_map_and_rqs(struct blk_mq_tag_set set,
63064be1 JG	55	unsigned int hctx_idx, unsigned int depth);
645db34e JG	56	void blk_mq_free_map_and_rqs(struct blk_mq_tag_set *set,
	57	struct blk_mq_tags *tags,
	58	unsigned int hctx_idx);
2c3ad667 JA	59	/*
	60	* Internal helpers for request insertion into sw queues
	61	*/
	62	void __blk_mq_insert_request(struct blk_mq_hw_ctx hctx, struct request rq,
	63	bool at_head);
01e99aec ML	64	void blk_mq_request_bypass_insert(struct request *rq, bool at_head,
01e99aec ML	65	bool run_queue);
bd166ef1 JA	66	void blk_mq_insert_requests(struct blk_mq_hw_ctx hctx, struct blk_mq_ctx ctx,
bd166ef1 JA	67	struct list_head *list);
6ce3dd6e ML	68	void blk_mq_try_issue_list_directly(struct blk_mq_hw_ctx *hctx,
6ce3dd6e ML	69	struct list_head *list);
396eaf21	70
320ae51f JA	71	/*
	72	* CPU -> queue mappings
	73	*/
ed76e329	74	extern int blk_mq_hw_queue_to_node(struct blk_mq_queue_map *qmap, unsigned int);
320ae51f	75
b3c661b1 JA	76	/*
	77	* blk_mq_map_queue_type() - map (hctx_type,cpu) to hardware queue
	78	* @q: request queue
e20ba6e1	79	* @type: the hctx type index
b3c661b1 JA	80	* @cpu: CPU
	81	*/
	82	static inline struct blk_mq_hw_ctx blk_mq_map_queue_type(struct request_queue q,
e20ba6e1	83	enum hctx_type type,
b3c661b1	84	unsigned int cpu)
7d7e0f90	85	{
e20ba6e1	86	return q->queue_hw_ctx[q->tag_set->map[type].mq_map[cpu]];
7d7e0f90 CH	87	}
7d7e0f90 CH	88
b637108a	89	static inline enum hctx_type blk_mq_get_hctx_type(unsigned int flags)
ff2c5660	90	{
e20ba6e1 CH	91	enum hctx_type type = HCTX_TYPE_DEFAULT;
e20ba6e1 CH	92
bb94aea1	93	/*
6ce913fe	94	* The caller ensure that if REQ_POLLED, poll must be enabled.
bb94aea1	95	*/
6ce913fe	96	if (flags & REQ_POLLED)
e20ba6e1	97	type = HCTX_TYPE_POLL;
bb94aea1	98	else if ((flags & REQ_OP_MASK) == REQ_OP_READ)
e20ba6e1	99	type = HCTX_TYPE_READ;
b637108a ML	100	return type;
	101	}
	102
	103	/*
	104	* blk_mq_map_queue() - map (cmd_flags,type) to hardware queue
	105	* @q: request queue
	106	* @flags: request command flags
	107	* @ctx: software queue cpu ctx
	108	*/
	109	static inline struct blk_mq_hw_ctx blk_mq_map_queue(struct request_queue q,
	110	unsigned int flags,
	111	struct blk_mq_ctx *ctx)
	112	{
	113	return ctx->hctxs[blk_mq_get_hctx_type(flags)];
ff2c5660 JA	114	}
ff2c5660 JA	115
67aec14c JA	116	/*
	117	* sysfs helpers
	118	*/
737f98cf	119	extern void blk_mq_sysfs_init(struct request_queue *q);
7ea5fe31	120	extern void blk_mq_sysfs_deinit(struct request_queue *q);
2d0364c8	121	extern int __blk_mq_register_dev(struct device dev, struct request_queue q);
67aec14c JA	122	extern int blk_mq_sysfs_register(struct request_queue *q);
67aec14c JA	123	extern void blk_mq_sysfs_unregister(struct request_queue *q);
868f2f0b	124	extern void blk_mq_hctx_kobj_init(struct blk_mq_hw_ctx *hctx);
47c122e3	125	void blk_mq_free_plug_rqs(struct blk_plug *plug);
dbb6f764	126	void blk_mq_flush_plug_list(struct blk_plug *plug, bool from_schedule);
67aec14c	127
2a19b28f ML	128	void blk_mq_cancel_work_sync(struct request_queue *q);
2a19b28f ML	129
e09aae7e ML	130	void blk_mq_release(struct request_queue *q);
e09aae7e ML	131
1aecfe48 ML	132	static inline struct blk_mq_ctx __blk_mq_get_ctx(struct request_queue q,
	133	unsigned int cpu)
	134	{
	135	return per_cpu_ptr(q->queue_ctx, cpu);
	136	}
	137
	138	/*
	139	* This assumes per-cpu software queueing queues. They could be per-node
	140	* as well, for instance. For now this is hardcoded as-is. Note that we don't
	141	* care about preemption, since we know the ctx's are persistent. This does
	142	* mean that we can't rely on ctx always matching the currently running CPU.
	143	*/
	144	static inline struct blk_mq_ctx blk_mq_get_ctx(struct request_queue q)
	145	{
c05f4220	146	return __blk_mq_get_ctx(q, raw_smp_processor_id());
1aecfe48 ML	147	}
1aecfe48 ML	148
cb96a42c ML	149	struct blk_mq_alloc_data {
	150	/* input parameter */
	151	struct request_queue *q;
9a95e4ef	152	blk_mq_req_flags_t flags;
229a9287	153	unsigned int shallow_depth;
f9afca4d	154	unsigned int cmd_flags;
ecaf97f4	155	req_flags_t rq_flags;
cb96a42c	156
47c122e3 JA	157	/* allocate multiple requests/tags in one go */
	158	unsigned int nr_tags;
	159	struct request **cached_rq;
	160
cb96a42c ML	161	/* input & output parameter */
	162	struct blk_mq_ctx *ctx;
	163	struct blk_mq_hw_ctx *hctx;
	164	};
	165
079a2e3e	166	static inline bool blk_mq_is_shared_tags(unsigned int flags)
32bc15af JG	167	{
	168	return flags & BLK_MQ_F_TAG_HCTX_SHARED;
	169	}
	170
4941115b JA	171	static inline struct blk_mq_tags blk_mq_tags_from_data(struct blk_mq_alloc_data data)
4941115b JA	172	{
56f8da64 JA	173	if (!(data->rq_flags & RQF_ELV))
	174	return data->hctx->tags;
	175	return data->hctx->sched_tags;
4941115b JA	176	}
4941115b JA	177
5d1b25c1 BVA	178	static inline bool blk_mq_hctx_stopped(struct blk_mq_hw_ctx *hctx)
	179	{
	180	return test_bit(BLK_MQ_S_STOPPED, &hctx->state);
	181	}
	182
19c66e59 ML	183	static inline bool blk_mq_hw_queue_mapped(struct blk_mq_hw_ctx *hctx)
	184	{
	185	return hctx->nr_ctx && hctx->tags;
	186	}
	187
8446fe92 CH	188	unsigned int blk_mq_in_flight(struct request_queue *q,
	189	struct block_device *part);
	190	void blk_mq_in_flight_rw(struct request_queue q, struct block_device part,
	191	unsigned int inflight[2]);
f299b7c7	192
2a5a24aa ML	193	static inline void blk_mq_put_dispatch_budget(struct request_queue *q,
2a5a24aa ML	194	int budget_token)
de148297	195	{
de148297	196	if (q->mq_ops->put_budget)
2a5a24aa	197	q->mq_ops->put_budget(q, budget_token);
de148297 ML	198	}
de148297 ML	199
2a5a24aa	200	static inline int blk_mq_get_dispatch_budget(struct request_queue *q)
de148297	201	{
de148297	202	if (q->mq_ops->get_budget)
65c76369	203	return q->mq_ops->get_budget(q);
2a5a24aa ML	204	return 0;
	205	}
	206
	207	static inline void blk_mq_set_rq_budget_token(struct request *rq, int token)
	208	{
	209	if (token < 0)
	210	return;
	211
	212	if (rq->q->mq_ops->set_rq_budget_token)
	213	rq->q->mq_ops->set_rq_budget_token(rq, token);
	214	}
	215
	216	static inline int blk_mq_get_rq_budget_token(struct request *rq)
	217	{
	218	if (rq->q->mq_ops->get_rq_budget_token)
	219	return rq->q->mq_ops->get_rq_budget_token(rq);
	220	return -1;
de148297 ML	221	}
de148297 ML	222
bccf5e26 JG	223	static inline void __blk_mq_inc_active_requests(struct blk_mq_hw_ctx *hctx)
bccf5e26 JG	224	{
079a2e3e JG	225	if (blk_mq_is_shared_tags(hctx->flags))
079a2e3e JG	226	atomic_inc(&hctx->queue->nr_active_requests_shared_tags);
bccf5e26 JG	227	else
	228	atomic_inc(&hctx->nr_active);
	229	}
	230
3b87c6ea ML	231	static inline void __blk_mq_sub_active_requests(struct blk_mq_hw_ctx *hctx,
3b87c6ea ML	232	int val)
bccf5e26	233	{
079a2e3e	234	if (blk_mq_is_shared_tags(hctx->flags))
3b87c6ea	235	atomic_sub(val, &hctx->queue->nr_active_requests_shared_tags);
bccf5e26	236	else
3b87c6ea ML	237	atomic_sub(val, &hctx->nr_active);
	238	}
	239
	240	static inline void __blk_mq_dec_active_requests(struct blk_mq_hw_ctx *hctx)
	241	{
	242	__blk_mq_sub_active_requests(hctx, 1);
bccf5e26 JG	243	}
	244
	245	static inline int __blk_mq_active_requests(struct blk_mq_hw_ctx *hctx)
	246	{
079a2e3e JG	247	if (blk_mq_is_shared_tags(hctx->flags))
079a2e3e JG	248	return atomic_read(&hctx->queue->nr_active_requests_shared_tags);
bccf5e26 JG	249	return atomic_read(&hctx->nr_active);
bccf5e26 JG	250	}
4e2f62e5 JA	251	static inline void __blk_mq_put_driver_tag(struct blk_mq_hw_ctx *hctx,
	252	struct request *rq)
	253	{
	254	blk_mq_put_tag(hctx->tags, rq->mq_ctx, rq->tag);
	255	rq->tag = BLK_MQ_NO_TAG;
	256
	257	if (rq->rq_flags & RQF_MQ_INFLIGHT) {
	258	rq->rq_flags &= ~RQF_MQ_INFLIGHT;
bccf5e26	259	__blk_mq_dec_active_requests(hctx);
4e2f62e5 JA	260	}
	261	}
	262
	263	static inline void blk_mq_put_driver_tag(struct request *rq)
	264	{
	265	if (rq->tag == BLK_MQ_NO_TAG \|\| rq->internal_tag == BLK_MQ_NO_TAG)
	266	return;
	267
	268	__blk_mq_put_driver_tag(rq->mq_hctx, rq);
	269	}
	270
a808a9d5 JA	271	bool __blk_mq_get_driver_tag(struct blk_mq_hw_ctx hctx, struct request rq);
	272
	273	static inline bool blk_mq_get_driver_tag(struct request *rq)
	274	{
	275	struct blk_mq_hw_ctx *hctx = rq->mq_hctx;
	276
	277	if (rq->tag != BLK_MQ_NO_TAG &&
	278	!(hctx->flags & BLK_MQ_F_TAG_QUEUE_SHARED)) {
	279	hctx->tags->rqs[rq->tag] = rq;
	280	return true;
	281	}
	282
	283	return __blk_mq_get_driver_tag(hctx, rq);
	284	}
61347154	285
ed76e329	286	static inline void blk_mq_clear_mq_map(struct blk_mq_queue_map *qmap)
0da73d00 MI	287	{
	288	int cpu;
	289
	290	for_each_possible_cpu(cpu)
ed76e329	291	qmap->mq_map[cpu] = 0;
0da73d00 MI	292	}
0da73d00 MI	293
b49773e7 DLM	294	/*
	295	* blk_mq_plug() - Get caller context plug
	296	* @q: request queue
	297	* @bio : the bio being submitted by the caller context
	298	*
	299	* Plugging, by design, may delay the insertion of BIOs into the elevator in
	300	* order to increase BIO merging opportunities. This however can cause BIO
	301	* insertion order to change from the order in which submit_bio() is being
	302	* executed in the case of multiple contexts concurrently issuing BIOs to a
	303	* device, even if these context are synchronized to tightly control BIO issuing
	304	* order. While this is not a problem with regular block devices, this ordering
	305	* change can cause write BIO failures with zoned block devices as these
	306	* require sequential write patterns to zones. Prevent this from happening by
	307	* ignoring the plug state of a BIO issuing context if the target request queue
	308	* is for a zoned block device and the BIO to plug is a write operation.
	309	*
	310	* Return current->plug if the bio can be plugged and NULL otherwise
	311	*/
	312	static inline struct blk_plug blk_mq_plug(struct request_queue q,
	313	struct bio *bio)
	314	{
	315	/*
	316	* For regular block devices or read operations, use the context plug
	317	* which may be NULL if blk_start_plug() was not executed.
	318	*/
	319	if (!blk_queue_is_zoned(q) \|\| !op_is_write(bio_op(bio)))
	320	return current->plug;
	321
	322	/* Zoned block device write operation case: do not plug the BIO */
	323	return NULL;
	324	}
	325
fd2ef39c JK	326	/* Free all requests on the list */
	327	static inline void blk_mq_free_requests(struct list_head *list)
	328	{
	329	while (!list_empty(list)) {
	330	struct request *rq = list_entry_rq(list->next);
	331
	332	list_del_init(&rq->queuelist);
	333	blk_mq_free_request(rq);
	334	}
	335	}
	336
a0235d23 JG	337	/*
	338	* For shared tag users, we track the number of currently active users
	339	* and attempt to provide a fair share of the tag depth for each of them.
	340	*/
	341	static inline bool hctx_may_queue(struct blk_mq_hw_ctx *hctx,
	342	struct sbitmap_queue *bt)
	343	{
	344	unsigned int depth, users;
	345
	346	if (!hctx \|\| !(hctx->flags & BLK_MQ_F_TAG_QUEUE_SHARED))
	347	return true;
a0235d23 JG	348
	349	/*
	350	* Don't try dividing an ant
	351	*/
	352	if (bt->sb.depth == 1)
	353	return true;
	354
079a2e3e	355	if (blk_mq_is_shared_tags(hctx->flags)) {
f1b49fdc	356	struct request_queue *q = hctx->queue;
f1b49fdc	357
2569063c	358	if (!test_bit(QUEUE_FLAG_HCTX_ACTIVE, &q->queue_flags))
f1b49fdc	359	return true;
f1b49fdc JG	360	} else {
	361	if (!test_bit(BLK_MQ_S_TAG_ACTIVE, &hctx->state))
	362	return true;
f1b49fdc JG	363	}
f1b49fdc JG	364
e155b0c2 JG	365	users = atomic_read(&hctx->tags->active_queues);
e155b0c2 JG	366
a0235d23 JG	367	if (!users)
	368	return true;
	369
	370	/*
	371	* Allow at least some tags
	372	*/
	373	depth = max((bt->sb.depth + users - 1) / users, 4U);
bccf5e26	374	return __blk_mq_active_requests(hctx) < depth;
a0235d23 JG	375	}
a0235d23 JG	376
2a904d00	377	/* run the code block in @dispatch_ops with rcu/srcu read lock held */
41adf531	378	#define __blk_mq_run_dispatch_ops(q, check_sleep, dispatch_ops) \
2a904d00	379	do { \
bcc330f4	380	if (!blk_queue_has_srcu(q)) { \
2a904d00 ML	381	rcu_read_lock(); \
	382	(dispatch_ops); \
	383	rcu_read_unlock(); \
	384	} else { \
	385	int srcu_idx; \
	386	\
41adf531	387	might_sleep_if(check_sleep); \
bcc330f4	388	srcu_idx = srcu_read_lock((q)->srcu); \
2a904d00	389	(dispatch_ops); \
bcc330f4	390	srcu_read_unlock((q)->srcu, srcu_idx); \
2a904d00 ML	391	} \
2a904d00 ML	392	} while (0)
a0235d23	393
41adf531 ML	394	#define blk_mq_run_dispatch_ops(q, dispatch_ops) \
	395	__blk_mq_run_dispatch_ops(q, true, dispatch_ops) \
	396
320ae51f	397	#endif