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

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

#include <linux/blk-mq.h>
#include "blk-stat.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;

enum {
	BLK_MQ_NO_TAG		= -1U,
	BLK_MQ_TAG_MIN		= 1,
	BLK_MQ_TAG_MAX		= BLK_MQ_NO_TAG - 1,
};

typedef unsigned int __bitwise blk_insert_t;
#define BLK_MQ_INSERT_AT_HEAD		((__force blk_insert_t)0x01)

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, blk_insert_t insert_flags);
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);

/*
 * 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 xa_load(&q->hctx_table, q->tag_set->map[type].mq_map[cpu]);
}

static inline enum hctx_type blk_mq_get_hctx_type(blk_opf_t opf)
{
	enum hctx_type type = HCTX_TYPE_DEFAULT;

	/*
	 * The caller ensure that if REQ_POLLED, poll must be enabled.
	 */
	if (opf & REQ_POLLED)
		type = HCTX_TYPE_POLL;
	else if ((opf & 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
 * @opf: operation type (REQ_OP_*) and flags (e.g. REQ_POLLED).
 * @ctx: software queue cpu ctx
 */
static inline struct blk_mq_hw_ctx *blk_mq_map_queue(struct request_queue *q,
						     blk_opf_t opf,
						     struct blk_mq_ctx *ctx)
{
	return ctx->hctxs[blk_mq_get_hctx_type(opf)];
}

/*
 * sysfs helpers
 */
extern void blk_mq_sysfs_init(struct request_queue *q);
extern void blk_mq_sysfs_deinit(struct request_queue *q);
int blk_mq_sysfs_register(struct gendisk *disk);
void blk_mq_sysfs_unregister(struct gendisk *disk);
int blk_mq_sysfs_register_hctxs(struct request_queue *q);
void blk_mq_sysfs_unregister_hctxs(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;
	blk_opf_t 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;
};

struct blk_mq_tags *blk_mq_init_tags(unsigned int nr_tags,
		unsigned int reserved_tags, int node, int alloc_policy);
void blk_mq_free_tags(struct blk_mq_tags *tags);
int blk_mq_init_bitmaps(struct sbitmap_queue *bitmap_tags,
		struct sbitmap_queue *breserved_tags, unsigned int queue_depth,
		unsigned int reserved, int node, int alloc_policy);

unsigned int blk_mq_get_tag(struct blk_mq_alloc_data *data);
unsigned long blk_mq_get_tags(struct blk_mq_alloc_data *data, int nr_tags,
		unsigned int *offset);
void blk_mq_put_tag(struct blk_mq_tags *tags, struct blk_mq_ctx *ctx,
		unsigned int tag);
void blk_mq_put_tags(struct blk_mq_tags *tags, int *tag_array, int nr_tags);
int blk_mq_tag_update_depth(struct blk_mq_hw_ctx *hctx,
		struct blk_mq_tags **tags, unsigned int depth, bool can_grow);
void blk_mq_tag_resize_shared_tags(struct blk_mq_tag_set *set,
		unsigned int size);
void blk_mq_tag_update_sched_shared_tags(struct request_queue *q);

void blk_mq_tag_wakeup_all(struct blk_mq_tags *tags, bool);
void blk_mq_queue_tag_busy_iter(struct request_queue *q, busy_tag_iter_fn *fn,
		void *priv);
void blk_mq_all_tag_iter(struct blk_mq_tags *tags, busy_tag_iter_fn *fn,
		void *priv);

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);
}

void __blk_mq_tag_busy(struct blk_mq_hw_ctx *);
void __blk_mq_tag_idle(struct blk_mq_hw_ctx *);

static inline void blk_mq_tag_busy(struct blk_mq_hw_ctx *hctx)
{
	if (hctx->flags & BLK_MQ_F_TAG_QUEUE_SHARED)
		__blk_mq_tag_busy(hctx);
}

static inline void blk_mq_tag_idle(struct blk_mq_hw_ctx *hctx)
{
	if (hctx->flags & BLK_MQ_F_TAG_QUEUE_SHARED)
		__blk_mq_tag_idle(hctx);
}

static inline bool blk_mq_tag_is_reserved(struct blk_mq_tags *tags,
					  unsigned int tag)
{
	return tag < tags->nr_reserved_tags;
}

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_SCHED_TAGS)
		return data->hctx->sched_tags;
	return data->hctx->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
 * @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 it 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 bio *bio)
{
	/* Zoned block device write operation case: do not plug the BIO */
	if (IS_ENABLED(CONFIG_BLK_DEV_ZONED) &&
	    bdev_op_is_zoned_write(bio->bi_bdev, bio_op(bio)))
		return NULL;

	/*
	 * For regular block devices or read operations, use the context plug
	 * which may be NULL if blk_start_plug() was not executed.
	 */
	return current->plug;
}

/* 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 ((q)->tag_set->flags & BLK_MQ_F_BLOCKING) {		\
		struct blk_mq_tag_set *__tag_set = (q)->tag_set; \
		int srcu_idx;					\
								\
		might_sleep_if(check_sleep);			\
		srcu_idx = srcu_read_lock(__tag_set->srcu);	\
		(dispatch_ops);					\
		srcu_read_unlock(__tag_set->srcu, srcu_idx);	\
	} else {						\
		rcu_read_lock();				\
		(dispatch_ops);					\
		rcu_read_unlock();				\
	}							\
} 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
90110e04	5	#include <linux/blk-mq.h>
cf43e6be JA	6	#include "blk-stat.h"
cf43e6be JA	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
bebe84eb CH	33	enum {
	34	BLK_MQ_NO_TAG = -1U,
	35	BLK_MQ_TAG_MIN = 1,
	36	BLK_MQ_TAG_MAX = BLK_MQ_NO_TAG - 1,
	37	};
	38
710fa378 CH	39	typedef unsigned int __bitwise blk_insert_t;
	40	#define BLK_MQ_INSERT_AT_HEAD ((__force blk_insert_t)0x01)
	41
3e08773c	42	void blk_mq_submit_bio(struct bio *bio);
5a72e899 JA	43	int blk_mq_poll(struct request_queue q, blk_qc_t cookie, struct io_comp_batch iob,
5a72e899 JA	44	unsigned int flags);
c7e2d94b	45	void blk_mq_exit_queue(struct request_queue *q);
e3a2b3f9	46	int blk_mq_update_nr_requests(struct request_queue *q, unsigned int nr);
aed3ea94	47	void blk_mq_wake_waiters(struct request_queue *q);
1fd40b5e ML	48	bool blk_mq_dispatch_rq_list(struct blk_mq_hw_ctx hctx, struct list_head ,
1fd40b5e ML	49	unsigned int);
b12e5c6c	50	void blk_mq_add_to_requeue_list(struct request *rq, blk_insert_t insert_flags);
2c3ad667	51	void blk_mq_flush_busy_ctxs(struct blk_mq_hw_ctx hctx, struct list_head list);
b347689f ML	52	struct request blk_mq_dequeue_from_ctx(struct blk_mq_hw_ctx hctx,
b347689f ML	53	struct blk_mq_ctx *start);
2e315dc0	54	void blk_mq_put_rq_ref(struct request *rq);
2c3ad667 JA	55
	56	/*
	57	* Internal helpers for allocating/freeing the request map
	58	*/
cc71a6f4 JA	59	void blk_mq_free_rqs(struct blk_mq_tag_set set, struct blk_mq_tags tags,
cc71a6f4 JA	60	unsigned int hctx_idx);
e155b0c2	61	void blk_mq_free_rq_map(struct blk_mq_tags *tags);
63064be1 JG	62	struct blk_mq_tags blk_mq_alloc_map_and_rqs(struct blk_mq_tag_set set,
63064be1 JG	63	unsigned int hctx_idx, unsigned int depth);
645db34e JG	64	void blk_mq_free_map_and_rqs(struct blk_mq_tag_set *set,
	65	struct blk_mq_tags *tags,
	66	unsigned int hctx_idx);
396eaf21	67
320ae51f JA	68	/*
	69	* CPU -> queue mappings
	70	*/
ed76e329	71	extern int blk_mq_hw_queue_to_node(struct blk_mq_queue_map *qmap, unsigned int);
320ae51f	72
b3c661b1 JA	73	/*
	74	* blk_mq_map_queue_type() - map (hctx_type,cpu) to hardware queue
	75	* @q: request queue
e20ba6e1	76	* @type: the hctx type index
b3c661b1 JA	77	* @cpu: CPU
	78	*/
	79	static inline struct blk_mq_hw_ctx blk_mq_map_queue_type(struct request_queue q,
e20ba6e1	80	enum hctx_type type,
b3c661b1	81	unsigned int cpu)
7d7e0f90	82	{
4e5cc99e	83	return xa_load(&q->hctx_table, q->tag_set->map[type].mq_map[cpu]);
7d7e0f90 CH	84	}
7d7e0f90 CH	85
16458cf3	86	static inline enum hctx_type blk_mq_get_hctx_type(blk_opf_t opf)
ff2c5660	87	{
e20ba6e1 CH	88	enum hctx_type type = HCTX_TYPE_DEFAULT;
e20ba6e1 CH	89
bb94aea1	90	/*
6ce913fe	91	* The caller ensure that if REQ_POLLED, poll must be enabled.
bb94aea1	92	*/
7e923f40	93	if (opf & REQ_POLLED)
e20ba6e1	94	type = HCTX_TYPE_POLL;
7e923f40	95	else if ((opf & REQ_OP_MASK) == REQ_OP_READ)
e20ba6e1	96	type = HCTX_TYPE_READ;
b637108a ML	97	return type;
	98	}
	99
	100	/*
	101	* blk_mq_map_queue() - map (cmd_flags,type) to hardware queue
	102	* @q: request queue
7e923f40	103	* @opf: operation type (REQ_OP_*) and flags (e.g. REQ_POLLED).
b637108a ML	104	* @ctx: software queue cpu ctx
	105	*/
	106	static inline struct blk_mq_hw_ctx blk_mq_map_queue(struct request_queue q,
16458cf3	107	blk_opf_t opf,
b637108a ML	108	struct blk_mq_ctx *ctx)
b637108a ML	109	{
7e923f40	110	return ctx->hctxs[blk_mq_get_hctx_type(opf)];
ff2c5660 JA	111	}
ff2c5660 JA	112
67aec14c JA	113	/*
	114	* sysfs helpers
	115	*/
737f98cf	116	extern void blk_mq_sysfs_init(struct request_queue *q);
7ea5fe31	117	extern void blk_mq_sysfs_deinit(struct request_queue *q);
8682b92e CH	118	int blk_mq_sysfs_register(struct gendisk *disk);
8682b92e CH	119	void blk_mq_sysfs_unregister(struct gendisk *disk);
eaa870f9 CH	120	int blk_mq_sysfs_register_hctxs(struct request_queue *q);
eaa870f9 CH	121	void blk_mq_sysfs_unregister_hctxs(struct request_queue *q);
868f2f0b	122	extern void blk_mq_hctx_kobj_init(struct blk_mq_hw_ctx *hctx);
47c122e3	123	void blk_mq_free_plug_rqs(struct blk_plug *plug);
dbb6f764	124	void blk_mq_flush_plug_list(struct blk_plug *plug, bool from_schedule);
67aec14c	125
2a19b28f ML	126	void blk_mq_cancel_work_sync(struct request_queue *q);
2a19b28f ML	127
e09aae7e ML	128	void blk_mq_release(struct request_queue *q);
e09aae7e ML	129
1aecfe48 ML	130	static inline struct blk_mq_ctx __blk_mq_get_ctx(struct request_queue q,
	131	unsigned int cpu)
	132	{
	133	return per_cpu_ptr(q->queue_ctx, cpu);
	134	}
	135
	136	/*
	137	* This assumes per-cpu software queueing queues. They could be per-node
	138	* as well, for instance. For now this is hardcoded as-is. Note that we don't
	139	* care about preemption, since we know the ctx's are persistent. This does
	140	* mean that we can't rely on ctx always matching the currently running CPU.
	141	*/
	142	static inline struct blk_mq_ctx blk_mq_get_ctx(struct request_queue q)
	143	{
c05f4220	144	return __blk_mq_get_ctx(q, raw_smp_processor_id());
1aecfe48 ML	145	}
1aecfe48 ML	146
cb96a42c ML	147	struct blk_mq_alloc_data {
	148	/* input parameter */
	149	struct request_queue *q;
9a95e4ef	150	blk_mq_req_flags_t flags;
229a9287	151	unsigned int shallow_depth;
16458cf3	152	blk_opf_t cmd_flags;
ecaf97f4	153	req_flags_t rq_flags;
cb96a42c	154
47c122e3 JA	155	/* allocate multiple requests/tags in one go */
	156	unsigned int nr_tags;
	157	struct request **cached_rq;
	158
cb96a42c ML	159	/* input & output parameter */
	160	struct blk_mq_ctx *ctx;
	161	struct blk_mq_hw_ctx *hctx;
	162	};
	163
bebe84eb CH	164	struct blk_mq_tags *blk_mq_init_tags(unsigned int nr_tags,
	165	unsigned int reserved_tags, int node, int alloc_policy);
	166	void blk_mq_free_tags(struct blk_mq_tags *tags);
	167	int blk_mq_init_bitmaps(struct sbitmap_queue *bitmap_tags,
	168	struct sbitmap_queue *breserved_tags, unsigned int queue_depth,
	169	unsigned int reserved, int node, int alloc_policy);
	170
	171	unsigned int blk_mq_get_tag(struct blk_mq_alloc_data *data);
	172	unsigned long blk_mq_get_tags(struct blk_mq_alloc_data *data, int nr_tags,
	173	unsigned int *offset);
	174	void blk_mq_put_tag(struct blk_mq_tags tags, struct blk_mq_ctx ctx,
	175	unsigned int tag);
	176	void blk_mq_put_tags(struct blk_mq_tags tags, int tag_array, int nr_tags);
	177	int blk_mq_tag_update_depth(struct blk_mq_hw_ctx *hctx,
	178	struct blk_mq_tags **tags, unsigned int depth, bool can_grow);
	179	void blk_mq_tag_resize_shared_tags(struct blk_mq_tag_set *set,
	180	unsigned int size);
	181	void blk_mq_tag_update_sched_shared_tags(struct request_queue *q);
	182
	183	void blk_mq_tag_wakeup_all(struct blk_mq_tags *tags, bool);
	184	void blk_mq_queue_tag_busy_iter(struct request_queue q, busy_tag_iter_fn fn,
	185	void *priv);
	186	void blk_mq_all_tag_iter(struct blk_mq_tags tags, busy_tag_iter_fn fn,
	187	void *priv);
	188
	189	static inline struct sbq_wait_state bt_wait_ptr(struct sbitmap_queue bt,
	190	struct blk_mq_hw_ctx *hctx)
	191	{
	192	if (!hctx)
	193	return &bt->ws[0];
	194	return sbq_wait_ptr(bt, &hctx->wait_index);
	195	}
	196
	197	void __blk_mq_tag_busy(struct blk_mq_hw_ctx *);
	198	void __blk_mq_tag_idle(struct blk_mq_hw_ctx *);
	199
	200	static inline void blk_mq_tag_busy(struct blk_mq_hw_ctx *hctx)
	201	{
	202	if (hctx->flags & BLK_MQ_F_TAG_QUEUE_SHARED)
	203	__blk_mq_tag_busy(hctx);
	204	}
	205
	206	static inline void blk_mq_tag_idle(struct blk_mq_hw_ctx *hctx)
	207	{
	208	if (hctx->flags & BLK_MQ_F_TAG_QUEUE_SHARED)
	209	__blk_mq_tag_idle(hctx);
	210	}
	211
	212	static inline bool blk_mq_tag_is_reserved(struct blk_mq_tags *tags,
	213	unsigned int tag)
	214	{
	215	return tag < tags->nr_reserved_tags;
	216	}
	217
079a2e3e	218	static inline bool blk_mq_is_shared_tags(unsigned int flags)
32bc15af JG	219	{
	220	return flags & BLK_MQ_F_TAG_HCTX_SHARED;
	221	}
	222
4941115b JA	223	static inline struct blk_mq_tags blk_mq_tags_from_data(struct blk_mq_alloc_data data)
4941115b JA	224	{
dd6216bb CH	225	if (data->rq_flags & RQF_SCHED_TAGS)
	226	return data->hctx->sched_tags;
	227	return data->hctx->tags;
4941115b JA	228	}
4941115b JA	229
5d1b25c1 BVA	230	static inline bool blk_mq_hctx_stopped(struct blk_mq_hw_ctx *hctx)
	231	{
	232	return test_bit(BLK_MQ_S_STOPPED, &hctx->state);
	233	}
	234
19c66e59 ML	235	static inline bool blk_mq_hw_queue_mapped(struct blk_mq_hw_ctx *hctx)
	236	{
	237	return hctx->nr_ctx && hctx->tags;
	238	}
	239
8446fe92 CH	240	unsigned int blk_mq_in_flight(struct request_queue *q,
	241	struct block_device *part);
	242	void blk_mq_in_flight_rw(struct request_queue q, struct block_device part,
	243	unsigned int inflight[2]);
f299b7c7	244
2a5a24aa ML	245	static inline void blk_mq_put_dispatch_budget(struct request_queue *q,
2a5a24aa ML	246	int budget_token)
de148297	247	{
de148297	248	if (q->mq_ops->put_budget)
2a5a24aa	249	q->mq_ops->put_budget(q, budget_token);
de148297 ML	250	}
de148297 ML	251
2a5a24aa	252	static inline int blk_mq_get_dispatch_budget(struct request_queue *q)
de148297	253	{
de148297	254	if (q->mq_ops->get_budget)
65c76369	255	return q->mq_ops->get_budget(q);
2a5a24aa ML	256	return 0;
	257	}
	258
	259	static inline void blk_mq_set_rq_budget_token(struct request *rq, int token)
	260	{
	261	if (token < 0)
	262	return;
	263
	264	if (rq->q->mq_ops->set_rq_budget_token)
	265	rq->q->mq_ops->set_rq_budget_token(rq, token);
	266	}
	267
	268	static inline int blk_mq_get_rq_budget_token(struct request *rq)
	269	{
	270	if (rq->q->mq_ops->get_rq_budget_token)
	271	return rq->q->mq_ops->get_rq_budget_token(rq);
	272	return -1;
de148297 ML	273	}
de148297 ML	274
bccf5e26 JG	275	static inline void __blk_mq_inc_active_requests(struct blk_mq_hw_ctx *hctx)
bccf5e26 JG	276	{
079a2e3e JG	277	if (blk_mq_is_shared_tags(hctx->flags))
079a2e3e JG	278	atomic_inc(&hctx->queue->nr_active_requests_shared_tags);
bccf5e26 JG	279	else
	280	atomic_inc(&hctx->nr_active);
	281	}
	282
3b87c6ea ML	283	static inline void __blk_mq_sub_active_requests(struct blk_mq_hw_ctx *hctx,
3b87c6ea ML	284	int val)
bccf5e26	285	{
079a2e3e	286	if (blk_mq_is_shared_tags(hctx->flags))
3b87c6ea	287	atomic_sub(val, &hctx->queue->nr_active_requests_shared_tags);
bccf5e26	288	else
3b87c6ea ML	289	atomic_sub(val, &hctx->nr_active);
	290	}
	291
	292	static inline void __blk_mq_dec_active_requests(struct blk_mq_hw_ctx *hctx)
	293	{
	294	__blk_mq_sub_active_requests(hctx, 1);
bccf5e26 JG	295	}
	296
	297	static inline int __blk_mq_active_requests(struct blk_mq_hw_ctx *hctx)
	298	{
079a2e3e JG	299	if (blk_mq_is_shared_tags(hctx->flags))
079a2e3e JG	300	return atomic_read(&hctx->queue->nr_active_requests_shared_tags);
bccf5e26 JG	301	return atomic_read(&hctx->nr_active);
bccf5e26 JG	302	}
4e2f62e5 JA	303	static inline void __blk_mq_put_driver_tag(struct blk_mq_hw_ctx *hctx,
	304	struct request *rq)
	305	{
	306	blk_mq_put_tag(hctx->tags, rq->mq_ctx, rq->tag);
	307	rq->tag = BLK_MQ_NO_TAG;
	308
	309	if (rq->rq_flags & RQF_MQ_INFLIGHT) {
	310	rq->rq_flags &= ~RQF_MQ_INFLIGHT;
bccf5e26	311	__blk_mq_dec_active_requests(hctx);
4e2f62e5 JA	312	}
	313	}
	314
	315	static inline void blk_mq_put_driver_tag(struct request *rq)
	316	{
	317	if (rq->tag == BLK_MQ_NO_TAG \|\| rq->internal_tag == BLK_MQ_NO_TAG)
	318	return;
	319
	320	__blk_mq_put_driver_tag(rq->mq_hctx, rq);
	321	}
	322
a808a9d5 JA	323	bool __blk_mq_get_driver_tag(struct blk_mq_hw_ctx hctx, struct request rq);
	324
	325	static inline bool blk_mq_get_driver_tag(struct request *rq)
	326	{
	327	struct blk_mq_hw_ctx *hctx = rq->mq_hctx;
	328
	329	if (rq->tag != BLK_MQ_NO_TAG &&
	330	!(hctx->flags & BLK_MQ_F_TAG_QUEUE_SHARED)) {
	331	hctx->tags->rqs[rq->tag] = rq;
	332	return true;
	333	}
	334
	335	return __blk_mq_get_driver_tag(hctx, rq);
	336	}
61347154	337
ed76e329	338	static inline void blk_mq_clear_mq_map(struct blk_mq_queue_map *qmap)
0da73d00 MI	339	{
	340	int cpu;
	341
	342	for_each_possible_cpu(cpu)
ed76e329	343	qmap->mq_map[cpu] = 0;
0da73d00 MI	344	}
0da73d00 MI	345
b49773e7 DLM	346	/*
b49773e7 DLM	347	* blk_mq_plug() - Get caller context plug
b49773e7 DLM	348	* @bio : the bio being submitted by the caller context
	349	*
	350	* Plugging, by design, may delay the insertion of BIOs into the elevator in
	351	* order to increase BIO merging opportunities. This however can cause BIO
	352	* insertion order to change from the order in which submit_bio() is being
	353	* executed in the case of multiple contexts concurrently issuing BIOs to a
	354	* device, even if these context are synchronized to tightly control BIO issuing
	355	* order. While this is not a problem with regular block devices, this ordering
	356	* change can cause write BIO failures with zoned block devices as these
	357	* require sequential write patterns to zones. Prevent this from happening by
6deacb3b CH	358	* ignoring the plug state of a BIO issuing context if it is for a zoned block
6deacb3b CH	359	* device and the BIO to plug is a write operation.
b49773e7 DLM	360	*
	361	* Return current->plug if the bio can be plugged and NULL otherwise
	362	*/
6deacb3b	363	static inline struct blk_plug blk_mq_plug( struct bio bio)
b49773e7	364	{
6deacb3b	365	/* Zoned block device write operation case: do not plug the BIO */
8cafdb5a PR	366	if (IS_ENABLED(CONFIG_BLK_DEV_ZONED) &&
8cafdb5a PR	367	bdev_op_is_zoned_write(bio->bi_bdev, bio_op(bio)))
6deacb3b CH	368	return NULL;
6deacb3b CH	369
b49773e7 DLM	370	/*
	371	* For regular block devices or read operations, use the context plug
	372	* which may be NULL if blk_start_plug() was not executed.
	373	*/
6deacb3b	374	return current->plug;
b49773e7 DLM	375	}
b49773e7 DLM	376
fd2ef39c JK	377	/* Free all requests on the list */
	378	static inline void blk_mq_free_requests(struct list_head *list)
	379	{
	380	while (!list_empty(list)) {
	381	struct request *rq = list_entry_rq(list->next);
	382
	383	list_del_init(&rq->queuelist);
	384	blk_mq_free_request(rq);
	385	}
	386	}
	387
a0235d23 JG	388	/*
	389	* For shared tag users, we track the number of currently active users
	390	* and attempt to provide a fair share of the tag depth for each of them.
	391	*/
	392	static inline bool hctx_may_queue(struct blk_mq_hw_ctx *hctx,
	393	struct sbitmap_queue *bt)
	394	{
	395	unsigned int depth, users;
	396
	397	if (!hctx \|\| !(hctx->flags & BLK_MQ_F_TAG_QUEUE_SHARED))
	398	return true;
a0235d23 JG	399
	400	/*
	401	* Don't try dividing an ant
	402	*/
	403	if (bt->sb.depth == 1)
	404	return true;
	405
079a2e3e	406	if (blk_mq_is_shared_tags(hctx->flags)) {
f1b49fdc	407	struct request_queue *q = hctx->queue;
f1b49fdc	408
2569063c	409	if (!test_bit(QUEUE_FLAG_HCTX_ACTIVE, &q->queue_flags))
f1b49fdc	410	return true;
f1b49fdc JG	411	} else {
	412	if (!test_bit(BLK_MQ_S_TAG_ACTIVE, &hctx->state))
	413	return true;
f1b49fdc JG	414	}
f1b49fdc JG	415
e155b0c2 JG	416	users = atomic_read(&hctx->tags->active_queues);
e155b0c2 JG	417
a0235d23 JG	418	if (!users)
	419	return true;
	420
	421	/*
	422	* Allow at least some tags
	423	*/
	424	depth = max((bt->sb.depth + users - 1) / users, 4U);
bccf5e26	425	return __blk_mq_active_requests(hctx) < depth;
a0235d23 JG	426	}
a0235d23 JG	427
2a904d00	428	/* run the code block in @dispatch_ops with rcu/srcu read lock held */
41adf531	429	#define __blk_mq_run_dispatch_ops(q, check_sleep, dispatch_ops) \
2a904d00	430	do { \
80bd4a7a	431	if ((q)->tag_set->flags & BLK_MQ_F_BLOCKING) { \
00e885ef	432	struct blk_mq_tag_set *__tag_set = (q)->tag_set; \
2a904d00 ML	433	int srcu_idx; \
2a904d00 ML	434	\
41adf531	435	might_sleep_if(check_sleep); \
00e885ef	436	srcu_idx = srcu_read_lock(__tag_set->srcu); \
2a904d00	437	(dispatch_ops); \
00e885ef	438	srcu_read_unlock(__tag_set->srcu, srcu_idx); \
80bd4a7a CH	439	} else { \
	440	rcu_read_lock(); \
	441	(dispatch_ops); \
	442	rcu_read_unlock(); \
2a904d00 ML	443	} \
2a904d00 ML	444	} while (0)
a0235d23	445
41adf531 ML	446	#define blk_mq_run_dispatch_ops(q, dispatch_ops) \
	447	__blk_mq_run_dispatch_ops(q, true, dispatch_ops) \
	448
320ae51f	449	#endif