blk-mq.h 10.6 KB
Newer Older
1
/* SPDX-License-Identifier: GPL-2.0 */
2 3 4 5
#ifndef BLK_MQ_H
#define BLK_MQ_H

#include <linux/blkdev.h>
6
#include <linux/sbitmap.h>
7
#include <linux/srcu.h>
8 9

struct blk_mq_tags;
10
struct blk_flush_queue;
11

12 13 14
/**
 * struct blk_mq_hw_ctx - State for a hardware queue facing the hardware block device
 */
15 16 17 18
struct blk_mq_hw_ctx {
	struct {
		spinlock_t		lock;
		struct list_head	dispatch;
19
		unsigned long		state;		/* BLK_MQ_S_* flags */
20 21
	} ____cacheline_aligned_in_smp;

22
	struct delayed_work	run_work;
23
	cpumask_var_t		cpumask;
24 25
	int			next_cpu;
	int			next_cpu_batch;
26 27 28

	unsigned long		flags;		/* BLK_MQ_F_* flags */

29
	void			*sched_data;
30
	struct request_queue	*queue;
31
	struct blk_flush_queue	*fq;
32 33 34

	void			*driver_data;

35
	struct sbitmap		ctx_map;
36

37
	struct blk_mq_ctx	*dispatch_from;
38
	unsigned int		dispatch_busy;
39

40 41
	unsigned short		type;
	unsigned short		nr_ctx;
42
	struct blk_mq_ctx	**ctxs;
43

44
	spinlock_t		dispatch_wait_lock;
45
	wait_queue_entry_t	dispatch_wait;
46
	atomic_t		wait_index;
47 48

	struct blk_mq_tags	*tags;
49
	struct blk_mq_tags	*sched_tags;
50 51 52

	unsigned long		queued;
	unsigned long		run;
53
#define BLK_MQ_MAX_DISPATCH_ORDER	7
54 55 56
	unsigned long		dispatched[BLK_MQ_MAX_DISPATCH_ORDER];

	unsigned int		numa_node;
57
	unsigned int		queue_num;
58

59
	atomic_t		nr_active;
60
	unsigned int		nr_expired;
61

62
	struct hlist_node	cpuhp_dead;
63
	struct kobject		kobj;
J
Jens Axboe 已提交
64

65
	unsigned long		poll_considered;
J
Jens Axboe 已提交
66 67
	unsigned long		poll_invoked;
	unsigned long		poll_success;
68 69 70

#ifdef CONFIG_BLK_DEBUG_FS
	struct dentry		*debugfs_dir;
71
	struct dentry		*sched_debugfs_dir;
72
#endif
73 74

	/* Must be the last member - see also blk_mq_hw_ctx_size(). */
75
	struct srcu_struct	srcu[0];
76 77
};

J
Jens Axboe 已提交
78 79 80
struct blk_mq_queue_map {
	unsigned int *mq_map;
	unsigned int nr_queues;
81
	unsigned int queue_offset;
J
Jens Axboe 已提交
82 83
};

84 85 86 87 88 89
enum hctx_type {
	HCTX_TYPE_DEFAULT,	/* all I/O not otherwise accounted for */
	HCTX_TYPE_READ,		/* just for READ I/O */
	HCTX_TYPE_POLL,		/* polled I/O of any kind */

	HCTX_MAX_TYPES,
J
Jens Axboe 已提交
90 91
};

92
struct blk_mq_tag_set {
J
Jens Axboe 已提交
93 94 95 96 97 98
	/*
	 * map[] holds ctx -> hctx mappings, one map exists for each type
	 * that the driver wishes to support. There are no restrictions
	 * on maps being of the same size, and it's perfectly legal to
	 * share maps between types.
	 */
J
Jens Axboe 已提交
99
	struct blk_mq_queue_map	map[HCTX_MAX_TYPES];
J
Jens Axboe 已提交
100
	unsigned int		nr_maps;	/* nr entries in map[] */
J
Jens Axboe 已提交
101
	const struct blk_mq_ops	*ops;
J
Jens Axboe 已提交
102
	unsigned int		nr_hw_queues;	/* nr hw queues across maps */
103
	unsigned int		queue_depth;	/* max hw supported */
104 105 106 107 108
	unsigned int		reserved_tags;
	unsigned int		cmd_size;	/* per-request extra data */
	int			numa_node;
	unsigned int		timeout;
	unsigned int		flags;		/* BLK_MQ_F_* */
109 110 111
	void			*driver_data;

	struct blk_mq_tags	**tags;
112 113 114

	struct mutex		tag_list_lock;
	struct list_head	tag_list;
115 116
};

117 118 119 120 121
struct blk_mq_queue_data {
	struct request *rq;
	bool last;
};

122 123
typedef blk_status_t (queue_rq_fn)(struct blk_mq_hw_ctx *,
		const struct blk_mq_queue_data *);
J
Jens Axboe 已提交
124
typedef void (commit_rqs_fn)(struct blk_mq_hw_ctx *);
125
typedef bool (get_budget_fn)(struct blk_mq_hw_ctx *);
126
typedef void (put_budget_fn)(struct blk_mq_hw_ctx *);
127
typedef enum blk_eh_timer_return (timeout_fn)(struct request *, bool);
128 129
typedef int (init_hctx_fn)(struct blk_mq_hw_ctx *, void *, unsigned int);
typedef void (exit_hctx_fn)(struct blk_mq_hw_ctx *, unsigned int);
130
typedef int (init_request_fn)(struct blk_mq_tag_set *set, struct request *,
131
		unsigned int, unsigned int);
132
typedef void (exit_request_fn)(struct blk_mq_tag_set *set, struct request *,
133
		unsigned int);
134

135
typedef bool (busy_iter_fn)(struct blk_mq_hw_ctx *, struct request *, void *,
136
		bool);
137
typedef bool (busy_tag_iter_fn)(struct request *, void *, bool);
138
typedef int (poll_fn)(struct blk_mq_hw_ctx *);
139
typedef int (map_queues_fn)(struct blk_mq_tag_set *set);
J
Jens Axboe 已提交
140
typedef bool (busy_fn)(struct request_queue *);
141
typedef void (complete_fn)(struct request *);
J
Jens Axboe 已提交
142

143

144 145 146 147 148 149
struct blk_mq_ops {
	/*
	 * Queue request
	 */
	queue_rq_fn		*queue_rq;

J
Jens Axboe 已提交
150 151 152 153 154 155 156 157 158
	/*
	 * If a driver uses bd->last to judge when to submit requests to
	 * hardware, it must define this function. In case of errors that
	 * make us stop issuing further requests, this hook serves the
	 * purpose of kicking the hardware (which the last request otherwise
	 * would have done).
	 */
	commit_rqs_fn		*commit_rqs;

159 160 161 162 163 164 165 166 167
	/*
	 * Reserve budget before queue request, once .queue_rq is
	 * run, it is driver's responsibility to release the
	 * reserved budget. Also we have to handle failure case
	 * of .get_budget for avoiding I/O deadlock.
	 */
	get_budget_fn		*get_budget;
	put_budget_fn		*put_budget;

168 169 170
	/*
	 * Called on request timeout
	 */
171
	timeout_fn		*timeout;
172

J
Jens Axboe 已提交
173 174 175 176 177
	/*
	 * Called to poll for completion of a specific tag.
	 */
	poll_fn			*poll;

178
	complete_fn		*complete;
179

180 181 182 183 184 185 186
	/*
	 * Called when the block layer side of a hardware queue has been
	 * set up, allowing the driver to allocate/init matching structures.
	 * Ditto for exit/teardown.
	 */
	init_hctx_fn		*init_hctx;
	exit_hctx_fn		*exit_hctx;
187 188 189 190

	/*
	 * Called for every command allocated by the block layer to allow
	 * the driver to set up driver specific data.
191 192 193 194
	 *
	 * Tag greater than or equal to queue_depth is for setting up
	 * flush request.
	 *
195 196 197 198
	 * Ditto for exit/teardown.
	 */
	init_request_fn		*init_request;
	exit_request_fn		*exit_request;
199 200
	/* Called from inside blk_get_request() */
	void (*initialize_rq_fn)(struct request *rq);
201

J
Jens Axboe 已提交
202 203 204 205 206
	/*
	 * If set, returns whether or not this queue currently is busy
	 */
	busy_fn			*busy;

207
	map_queues_fn		*map_queues;
208 209 210 211 212 213 214 215

#ifdef CONFIG_BLK_DEBUG_FS
	/*
	 * Used by the debugfs implementation to show driver-specific
	 * information about a request.
	 */
	void (*show_rq)(struct seq_file *m, struct request *rq);
#endif
216 217 218 219
};

enum {
	BLK_MQ_F_SHOULD_MERGE	= 1 << 0,
220 221
	BLK_MQ_F_TAG_SHARED	= 1 << 1,
	BLK_MQ_F_SG_MERGE	= 1 << 2,
222
	BLK_MQ_F_BLOCKING	= 1 << 5,
223
	BLK_MQ_F_NO_SCHED	= 1 << 6,
S
Shaohua Li 已提交
224 225
	BLK_MQ_F_ALLOC_POLICY_START_BIT = 8,
	BLK_MQ_F_ALLOC_POLICY_BITS = 1,
226

227
	BLK_MQ_S_STOPPED	= 0,
228
	BLK_MQ_S_TAG_ACTIVE	= 1,
229
	BLK_MQ_S_SCHED_RESTART	= 2,
230

231
	BLK_MQ_MAX_DEPTH	= 10240,
232 233

	BLK_MQ_CPU_WORK_BATCH	= 8,
234
};
S
Shaohua Li 已提交
235 236 237 238 239 240
#define BLK_MQ_FLAG_TO_ALLOC_POLICY(flags) \
	((flags >> BLK_MQ_F_ALLOC_POLICY_START_BIT) & \
		((1 << BLK_MQ_F_ALLOC_POLICY_BITS) - 1))
#define BLK_ALLOC_POLICY_TO_MQ_FLAG(policy) \
	((policy & ((1 << BLK_MQ_F_ALLOC_POLICY_BITS) - 1)) \
		<< BLK_MQ_F_ALLOC_POLICY_START_BIT)
241

242
struct request_queue *blk_mq_init_queue(struct blk_mq_tag_set *);
243 244
struct request_queue *blk_mq_init_allocated_queue(struct blk_mq_tag_set *set,
						  struct request_queue *q);
245 246 247 248
struct request_queue *blk_mq_init_sq_queue(struct blk_mq_tag_set *set,
						const struct blk_mq_ops *ops,
						unsigned int queue_depth,
						unsigned int set_flags);
249 250
int blk_mq_register_dev(struct device *, struct request_queue *);
void blk_mq_unregister_dev(struct device *, struct request_queue *);
251

252 253 254
int blk_mq_alloc_tag_set(struct blk_mq_tag_set *set);
void blk_mq_free_tag_set(struct blk_mq_tag_set *set);

255 256 257 258
void blk_mq_flush_plug_list(struct blk_plug *plug, bool from_schedule);

void blk_mq_free_request(struct request *rq);
bool blk_mq_can_queue(struct blk_mq_hw_ctx *);
259

260 261
bool blk_mq_queue_busy(struct request_queue *q);

262
enum {
263 264 265 266 267 268 269 270
	/* return when out of requests */
	BLK_MQ_REQ_NOWAIT	= (__force blk_mq_req_flags_t)(1 << 0),
	/* allocate from reserved pool */
	BLK_MQ_REQ_RESERVED	= (__force blk_mq_req_flags_t)(1 << 1),
	/* allocate internal/sched tag */
	BLK_MQ_REQ_INTERNAL	= (__force blk_mq_req_flags_t)(1 << 2),
	/* set RQF_PREEMPT */
	BLK_MQ_REQ_PREEMPT	= (__force blk_mq_req_flags_t)(1 << 3),
271 272
};

273
struct request *blk_mq_alloc_request(struct request_queue *q, unsigned int op,
274
		blk_mq_req_flags_t flags);
275
struct request *blk_mq_alloc_request_hctx(struct request_queue *q,
276 277
		unsigned int op, blk_mq_req_flags_t flags,
		unsigned int hctx_idx);
278
struct request *blk_mq_tag_to_rq(struct blk_mq_tags *tags, unsigned int tag);
279

B
Bart Van Assche 已提交
280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296
enum {
	BLK_MQ_UNIQUE_TAG_BITS = 16,
	BLK_MQ_UNIQUE_TAG_MASK = (1 << BLK_MQ_UNIQUE_TAG_BITS) - 1,
};

u32 blk_mq_unique_tag(struct request *rq);

static inline u16 blk_mq_unique_tag_to_hwq(u32 unique_tag)
{
	return unique_tag >> BLK_MQ_UNIQUE_TAG_BITS;
}

static inline u16 blk_mq_unique_tag_to_tag(u32 unique_tag)
{
	return unique_tag & BLK_MQ_UNIQUE_TAG_MASK;
}

297

298
int blk_mq_request_started(struct request *rq);
299
void blk_mq_start_request(struct request *rq);
300 301
void blk_mq_end_request(struct request *rq, blk_status_t error);
void __blk_mq_end_request(struct request *rq, blk_status_t error);
302

303 304 305
void blk_mq_requeue_request(struct request *rq, bool kick_requeue_list);
void blk_mq_add_to_requeue_list(struct request *rq, bool at_head,
				bool kick_requeue_list);
306
void blk_mq_kick_requeue_list(struct request_queue *q);
307
void blk_mq_delay_kick_requeue_list(struct request_queue *q, unsigned long msecs);
308
bool blk_mq_complete_request(struct request *rq);
309 310
bool blk_mq_bio_list_merge(struct request_queue *q, struct list_head *list,
			   struct bio *bio);
311
bool blk_mq_queue_stopped(struct request_queue *q);
312 313
void blk_mq_stop_hw_queue(struct blk_mq_hw_ctx *hctx);
void blk_mq_start_hw_queue(struct blk_mq_hw_ctx *hctx);
314
void blk_mq_stop_hw_queues(struct request_queue *q);
315
void blk_mq_start_hw_queues(struct request_queue *q);
316
void blk_mq_start_stopped_hw_queue(struct blk_mq_hw_ctx *hctx, bool async);
317
void blk_mq_start_stopped_hw_queues(struct request_queue *q, bool async);
318
void blk_mq_quiesce_queue(struct request_queue *q);
319
void blk_mq_unquiesce_queue(struct request_queue *q);
320
void blk_mq_delay_run_hw_queue(struct blk_mq_hw_ctx *hctx, unsigned long msecs);
321
bool blk_mq_run_hw_queue(struct blk_mq_hw_ctx *hctx, bool async);
322
void blk_mq_run_hw_queues(struct request_queue *q, bool async);
323 324
void blk_mq_tagset_busy_iter(struct blk_mq_tag_set *tagset,
		busy_tag_iter_fn *fn, void *priv);
325
void blk_mq_freeze_queue(struct request_queue *q);
326
void blk_mq_unfreeze_queue(struct request_queue *q);
327
void blk_freeze_queue_start(struct request_queue *q);
328
void blk_mq_freeze_queue_wait(struct request_queue *q);
329 330
int blk_mq_freeze_queue_wait_timeout(struct request_queue *q,
				     unsigned long timeout);
331

J
Jens Axboe 已提交
332
int blk_mq_map_queues(struct blk_mq_queue_map *qmap);
K
Keith Busch 已提交
333 334
void blk_mq_update_nr_hw_queues(struct blk_mq_tag_set *set, int nr_hw_queues);

335
void blk_mq_quiesce_queue_nowait(struct request_queue *q);
336

J
Jens Axboe 已提交
337 338
unsigned int blk_mq_rq_cpu(struct request *rq);

339 340
/*
 * Driver command data is immediately after the request. So subtract request
J
Jens Axboe 已提交
341
 * size to get back to the original request, add request size to get the PDU.
342 343 344 345 346 347 348
 */
static inline struct request *blk_mq_rq_from_pdu(void *pdu)
{
	return pdu - sizeof(struct request);
}
static inline void *blk_mq_rq_to_pdu(struct request *rq)
{
J
Jens Axboe 已提交
349
	return rq + 1;
350 351 352
}

#define queue_for_each_hw_ctx(q, hctx, i)				\
353 354
	for ((i) = 0; (i) < (q)->nr_hw_queues &&			\
	     ({ hctx = (q)->queue_hw_ctx[i]; 1; }); (i)++)
355 356

#define hctx_for_each_ctx(hctx, ctx, i)					\
357 358
	for ((i) = 0; (i) < (hctx)->nr_ctx &&				\
	     ({ ctx = (hctx)->ctxs[(i)]; 1; }); (i)++)
359 360

#endif