[GitHub/MotorolaMobilityLLC/kernel-slsi.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"

struct blk_mq_tag_set;

struct blk_mq_ctx {
	struct {
		spinlock_t		lock;
		struct list_head	rq_list;
	}  ____cacheline_aligned_in_smp;

	unsigned int		cpu;
	unsigned int		index_hw;

	/* incremented at dispatch time */
	unsigned long		rq_dispatched[2];
	unsigned long		rq_merged;

	/* incremented at completion time */
	unsigned long		____cacheline_aligned_in_smp rq_completed[2];

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

void blk_mq_run_hw_queue(struct blk_mq_hw_ctx *hctx, bool async);
void blk_mq_freeze_queue(struct request_queue *q);
void blk_mq_free_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 request_queue *, struct list_head *);
void blk_mq_flush_busy_ctxs(struct blk_mq_hw_ctx *hctx, struct list_head *list);
bool blk_mq_hctx_has_pending(struct blk_mq_hw_ctx *hctx);
bool blk_mq_get_driver_tag(struct request *rq, struct blk_mq_hw_ctx **hctx,
				bool wait);

/*
 * 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_rq_map(struct blk_mq_tag_set *set,
					unsigned int hctx_idx,
					unsigned int nr_tags,
					unsigned int reserved_tags);
int blk_mq_alloc_rqs(struct blk_mq_tag_set *set, struct blk_mq_tags *tags,
		     unsigned int hctx_idx, unsigned int depth);

/*
 * 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);
void blk_mq_insert_requests(struct blk_mq_hw_ctx *hctx, struct blk_mq_ctx *ctx,
				struct list_head *list);

/*
 * CPU -> queue mappings
 */
extern int blk_mq_hw_queue_to_node(unsigned int *map, unsigned int);

static inline struct blk_mq_hw_ctx *blk_mq_map_queue(struct request_queue *q,
		int cpu)
{
	return q->queue_hw_ctx[q->mq_map[cpu]];
}

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

extern void blk_mq_rq_timed_out(struct request *req, bool reserved);

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, get_cpu());
}

static inline void blk_mq_put_ctx(struct blk_mq_ctx *ctx)
{
	put_cpu();
}

struct blk_mq_alloc_data {
	/* input parameter */
	struct request_queue *q;
	unsigned int flags;
	unsigned int shallow_depth;

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

static inline struct blk_mq_tags *blk_mq_tags_from_data(struct blk_mq_alloc_data *data)
{
	if (data->flags & BLK_MQ_REQ_INTERNAL)
		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;
}

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

#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 JA	5	#include "blk-stat.h"
cf43e6be JA	6
24d2f903 CH	7	struct blk_mq_tag_set;
24d2f903 CH	8
320ae51f JA	9	struct blk_mq_ctx {
	10	struct {
	11	spinlock_t lock;
	12	struct list_head rq_list;
	13	} ____cacheline_aligned_in_smp;
	14
	15	unsigned int cpu;
	16	unsigned int index_hw;
320ae51f JA	17
	18	/* incremented at dispatch time */
	19	unsigned long rq_dispatched[2];
	20	unsigned long rq_merged;
	21
	22	/* incremented at completion time */
	23	unsigned long ____cacheline_aligned_in_smp rq_completed[2];
	24
	25	struct request_queue *queue;
	26	struct kobject kobj;
4bb659b1	27	} ____cacheline_aligned_in_smp;
320ae51f	28
320ae51f	29	void blk_mq_run_hw_queue(struct blk_mq_hw_ctx *hctx, bool async);
780db207	30	void blk_mq_freeze_queue(struct request_queue *q);
3edcc0ce	31	void blk_mq_free_queue(struct request_queue *q);
e3a2b3f9	32	int blk_mq_update_nr_requests(struct request_queue *q, unsigned int nr);
aed3ea94	33	void blk_mq_wake_waiters(struct request_queue *q);
81380ca1	34	bool blk_mq_dispatch_rq_list(struct request_queue , struct list_head );
2c3ad667	35	void blk_mq_flush_busy_ctxs(struct blk_mq_hw_ctx hctx, struct list_head list);
50e1dab8	36	bool blk_mq_hctx_has_pending(struct blk_mq_hw_ctx *hctx);
bd6737f1 JA	37	bool blk_mq_get_driver_tag(struct request rq, struct blk_mq_hw_ctx *hctx,
bd6737f1 JA	38	bool wait);
2c3ad667 JA	39
	40	/*
	41	* Internal helpers for allocating/freeing the request map
	42	*/
cc71a6f4 JA	43	void blk_mq_free_rqs(struct blk_mq_tag_set set, struct blk_mq_tags tags,
	44	unsigned int hctx_idx);
	45	void blk_mq_free_rq_map(struct blk_mq_tags *tags);
	46	struct blk_mq_tags blk_mq_alloc_rq_map(struct blk_mq_tag_set set,
	47	unsigned int hctx_idx,
	48	unsigned int nr_tags,
	49	unsigned int reserved_tags);
	50	int blk_mq_alloc_rqs(struct blk_mq_tag_set set, struct blk_mq_tags tags,
	51	unsigned int hctx_idx, unsigned int depth);
2c3ad667 JA	52
	53	/*
	54	* Internal helpers for request insertion into sw queues
	55	*/
	56	void __blk_mq_insert_request(struct blk_mq_hw_ctx hctx, struct request rq,
	57	bool at_head);
157f377b	58	void blk_mq_request_bypass_insert(struct request *rq);
bd166ef1 JA	59	void blk_mq_insert_requests(struct blk_mq_hw_ctx hctx, struct blk_mq_ctx ctx,
bd166ef1 JA	60	struct list_head *list);
320ae51f JA	61
	62	/*
	63	* CPU -> queue mappings
	64	*/
f14bbe77	65	extern int blk_mq_hw_queue_to_node(unsigned int *map, unsigned int);
320ae51f	66
7d7e0f90 CH	67	static inline struct blk_mq_hw_ctx blk_mq_map_queue(struct request_queue q,
	68	int cpu)
	69	{
	70	return q->queue_hw_ctx[q->mq_map[cpu]];
	71	}
	72
67aec14c JA	73	/*
	74	* sysfs helpers
	75	*/
737f98cf	76	extern void blk_mq_sysfs_init(struct request_queue *q);
7ea5fe31	77	extern void blk_mq_sysfs_deinit(struct request_queue *q);
2d0364c8	78	extern int __blk_mq_register_dev(struct device dev, struct request_queue q);
67aec14c JA	79	extern int blk_mq_sysfs_register(struct request_queue *q);
67aec14c JA	80	extern void blk_mq_sysfs_unregister(struct request_queue *q);
868f2f0b	81	extern void blk_mq_hctx_kobj_init(struct blk_mq_hw_ctx *hctx);
67aec14c	82
90415837 CH	83	extern void blk_mq_rq_timed_out(struct request *req, bool reserved);
90415837 CH	84
e09aae7e ML	85	void blk_mq_release(struct request_queue *q);
e09aae7e ML	86
1aecfe48 ML	87	static inline struct blk_mq_ctx __blk_mq_get_ctx(struct request_queue q,
	88	unsigned int cpu)
	89	{
	90	return per_cpu_ptr(q->queue_ctx, cpu);
	91	}
	92
	93	/*
	94	* This assumes per-cpu software queueing queues. They could be per-node
	95	* as well, for instance. For now this is hardcoded as-is. Note that we don't
	96	* care about preemption, since we know the ctx's are persistent. This does
	97	* mean that we can't rely on ctx always matching the currently running CPU.
	98	*/
	99	static inline struct blk_mq_ctx blk_mq_get_ctx(struct request_queue q)
	100	{
	101	return __blk_mq_get_ctx(q, get_cpu());
	102	}
	103
	104	static inline void blk_mq_put_ctx(struct blk_mq_ctx *ctx)
	105	{
	106	put_cpu();
	107	}
	108
cb96a42c ML	109	struct blk_mq_alloc_data {
	110	/* input parameter */
	111	struct request_queue *q;
6f3b0e8b	112	unsigned int flags;
229a9287	113	unsigned int shallow_depth;
cb96a42c ML	114
	115	/* input & output parameter */
	116	struct blk_mq_ctx *ctx;
	117	struct blk_mq_hw_ctx *hctx;
	118	};
	119
4941115b JA	120	static inline struct blk_mq_tags blk_mq_tags_from_data(struct blk_mq_alloc_data data)
4941115b JA	121	{
bd166ef1 JA	122	if (data->flags & BLK_MQ_REQ_INTERNAL)
	123	return data->hctx->sched_tags;
	124
4941115b JA	125	return data->hctx->tags;
	126	}
	127
5d1b25c1 BVA	128	static inline bool blk_mq_hctx_stopped(struct blk_mq_hw_ctx *hctx)
	129	{
	130	return test_bit(BLK_MQ_S_STOPPED, &hctx->state);
	131	}
	132
19c66e59 ML	133	static inline bool blk_mq_hw_queue_mapped(struct blk_mq_hw_ctx *hctx)
	134	{
	135	return hctx->nr_ctx && hctx->tags;
	136	}
	137
f299b7c7	138	void blk_mq_in_flight(struct request_queue q, struct hd_struct part,
06beec87 OS	139	unsigned int inflight[2]);
	140	void blk_mq_in_flight_rw(struct request_queue q, struct hd_struct part,
	141	unsigned int inflight[2]);
f299b7c7	142
320ae51f	143	#endif