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

5
#include "blk-stat.h"
6
#include "blk-mq-tag.h"
7

8 9
struct blk_mq_tag_set;

10 11 12 13 14
struct blk_mq_ctxs {
	struct kobject kobj;
	struct blk_mq_ctx __percpu	*queue_ctx;
};

15 16 17
/**
 * struct blk_mq_ctx - State for a software queue facing the submitting CPUs
 */
18 19 20
struct blk_mq_ctx {
	struct {
		spinlock_t		lock;
M
Ming Lei 已提交
21 22
		struct list_head	rq_lists[HCTX_MAX_TYPES];
	} ____cacheline_aligned_in_smp;
23 24

	unsigned int		cpu;
25
	unsigned short		index_hw[HCTX_MAX_TYPES];
26
	struct blk_mq_hw_ctx 	*hctxs[HCTX_MAX_TYPES];
27 28

	struct request_queue	*queue;
29
	struct blk_mq_ctxs      *ctxs;
30
	struct kobject		kobj;
31
} ____cacheline_aligned_in_smp;
32

33
void blk_mq_submit_bio(struct bio *bio);
34 35
int blk_mq_poll(struct request_queue *q, blk_qc_t cookie, struct io_comp_batch *iob,
		unsigned int flags);
36
void blk_mq_exit_queue(struct request_queue *q);
37
int blk_mq_update_nr_requests(struct request_queue *q, unsigned int nr);
38
void blk_mq_wake_waiters(struct request_queue *q);
39 40
bool blk_mq_dispatch_rq_list(struct blk_mq_hw_ctx *hctx, struct list_head *,
			     unsigned int);
41 42
void blk_mq_add_to_requeue_list(struct request *rq, bool at_head,
				bool kick_requeue_list);
43
void blk_mq_flush_busy_ctxs(struct blk_mq_hw_ctx *hctx, struct list_head *list);
44 45
struct request *blk_mq_dequeue_from_ctx(struct blk_mq_hw_ctx *hctx,
					struct blk_mq_ctx *start);
46
void blk_mq_put_rq_ref(struct request *rq);
47 48 49 50

/*
 * Internal helpers for allocating/freeing the request map
 */
51 52
void blk_mq_free_rqs(struct blk_mq_tag_set *set, struct blk_mq_tags *tags,
		     unsigned int hctx_idx);
53
void blk_mq_free_rq_map(struct blk_mq_tags *tags);
54 55
struct blk_mq_tags *blk_mq_alloc_map_and_rqs(struct blk_mq_tag_set *set,
				unsigned int hctx_idx, unsigned int depth);
56 57 58
void blk_mq_free_map_and_rqs(struct blk_mq_tag_set *set,
			     struct blk_mq_tags *tags,
			     unsigned int hctx_idx);
59 60 61 62 63
/*
 * 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);
64 65
void blk_mq_request_bypass_insert(struct request *rq, bool at_head,
				  bool run_queue);
66 67
void blk_mq_insert_requests(struct blk_mq_hw_ctx *hctx, struct blk_mq_ctx *ctx,
				struct list_head *list);
68 69
void blk_mq_try_issue_list_directly(struct blk_mq_hw_ctx *hctx,
				    struct list_head *list);
70

71 72 73
/*
 * CPU -> queue mappings
 */
J
Jens Axboe 已提交
74
extern int blk_mq_hw_queue_to_node(struct blk_mq_queue_map *qmap, unsigned int);
75

J
Jens Axboe 已提交
76 77 78
/*
 * blk_mq_map_queue_type() - map (hctx_type,cpu) to hardware queue
 * @q: request queue
79
 * @type: the hctx type index
J
Jens Axboe 已提交
80 81 82
 * @cpu: CPU
 */
static inline struct blk_mq_hw_ctx *blk_mq_map_queue_type(struct request_queue *q,
83
							  enum hctx_type type,
J
Jens Axboe 已提交
84
							  unsigned int cpu)
C
Christoph Hellwig 已提交
85
{
M
Ming Lei 已提交
86
	return xa_load(&q->hctx_table, q->tag_set->map[type].mq_map[cpu]);
C
Christoph Hellwig 已提交
87 88
}

89
static inline enum hctx_type blk_mq_get_hctx_type(unsigned int flags)
90
{
91 92
	enum hctx_type type = HCTX_TYPE_DEFAULT;

93
	/*
94
	 * The caller ensure that if REQ_POLLED, poll must be enabled.
95
	 */
96
	if (flags & REQ_POLLED)
97
		type = HCTX_TYPE_POLL;
98
	else if ((flags & REQ_OP_MASK) == REQ_OP_READ)
99
		type = HCTX_TYPE_READ;
100 101 102 103 104 105 106 107 108 109 110 111 112 113
	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)];
114 115
}

116 117 118
/*
 * sysfs helpers
 */
119
extern void blk_mq_sysfs_init(struct request_queue *q);
120
extern void blk_mq_sysfs_deinit(struct request_queue *q);
121
extern int __blk_mq_register_dev(struct device *dev, struct request_queue *q);
122 123
extern int blk_mq_sysfs_register(struct request_queue *q);
extern void blk_mq_sysfs_unregister(struct request_queue *q);
K
Keith Busch 已提交
124
extern void blk_mq_hctx_kobj_init(struct blk_mq_hw_ctx *hctx);
125
void blk_mq_free_plug_rqs(struct blk_plug *plug);
126
void blk_mq_flush_plug_list(struct blk_plug *plug, bool from_schedule);
127

128 129
void blk_mq_cancel_work_sync(struct request_queue *q);

130 131
void blk_mq_release(struct request_queue *q);

132 133 134 135 136 137 138 139 140 141 142 143 144 145
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)
{
146
	return __blk_mq_get_ctx(q, raw_smp_processor_id());
147 148
}

149 150 151
struct blk_mq_alloc_data {
	/* input parameter */
	struct request_queue *q;
152
	blk_mq_req_flags_t flags;
153
	unsigned int shallow_depth;
154
	unsigned int cmd_flags;
155
	req_flags_t rq_flags;
156

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

161 162 163 164 165
	/* input & output parameter */
	struct blk_mq_ctx *ctx;
	struct blk_mq_hw_ctx *hctx;
};

166
static inline bool blk_mq_is_shared_tags(unsigned int flags)
167 168 169 170
{
	return flags & BLK_MQ_F_TAG_HCTX_SHARED;
}

171 172
static inline struct blk_mq_tags *blk_mq_tags_from_data(struct blk_mq_alloc_data *data)
{
173 174 175
	if (!(data->rq_flags & RQF_ELV))
		return data->hctx->tags;
	return data->hctx->sched_tags;
176 177
}

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

183 184 185 186 187
static inline bool blk_mq_hw_queue_mapped(struct blk_mq_hw_ctx *hctx)
{
	return hctx->nr_ctx && hctx->tags;
}

188 189 190 191
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]);
192

193 194
static inline void blk_mq_put_dispatch_budget(struct request_queue *q,
					      int budget_token)
195 196
{
	if (q->mq_ops->put_budget)
197
		q->mq_ops->put_budget(q, budget_token);
198 199
}

200
static inline int blk_mq_get_dispatch_budget(struct request_queue *q)
201 202
{
	if (q->mq_ops->get_budget)
203
		return q->mq_ops->get_budget(q);
204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220
	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;
221 222
}

223 224
static inline void __blk_mq_inc_active_requests(struct blk_mq_hw_ctx *hctx)
{
225 226
	if (blk_mq_is_shared_tags(hctx->flags))
		atomic_inc(&hctx->queue->nr_active_requests_shared_tags);
227 228 229 230
	else
		atomic_inc(&hctx->nr_active);
}

231 232
static inline void __blk_mq_sub_active_requests(struct blk_mq_hw_ctx *hctx,
		int val)
233
{
234
	if (blk_mq_is_shared_tags(hctx->flags))
235
		atomic_sub(val, &hctx->queue->nr_active_requests_shared_tags);
236
	else
237 238 239 240 241 242
		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);
243 244 245 246
}

static inline int __blk_mq_active_requests(struct blk_mq_hw_ctx *hctx)
{
247 248
	if (blk_mq_is_shared_tags(hctx->flags))
		return atomic_read(&hctx->queue->nr_active_requests_shared_tags);
249 250
	return atomic_read(&hctx->nr_active);
}
251 252 253 254 255 256 257 258
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;
259
		__blk_mq_dec_active_requests(hctx);
260 261 262 263 264 265 266 267 268 269 270
	}
}

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

271 272 273 274 275 276 277 278 279 280 281 282 283 284
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);
}
285

J
Jens Axboe 已提交
286
static inline void blk_mq_clear_mq_map(struct blk_mq_queue_map *qmap)
287 288 289 290
{
	int cpu;

	for_each_possible_cpu(cpu)
J
Jens Axboe 已提交
291
		qmap->mq_map[cpu] = 0;
292 293
}

294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325
/*
 * 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;
}

326 327 328 329 330 331 332 333 334 335 336
/* 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);
	}
}

J
John Garry 已提交
337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354
/*
 * 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;

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

358
		if (!test_bit(QUEUE_FLAG_HCTX_ACTIVE, &q->queue_flags))
359 360 361 362 363 364
			return true;
	} else {
		if (!test_bit(BLK_MQ_S_TAG_ACTIVE, &hctx->state))
			return true;
	}

365 366
	users = atomic_read(&hctx->tags->active_queues);

J
John Garry 已提交
367 368 369 370 371 372 373
	if (!users)
		return true;

	/*
	 * Allow at least some tags
	 */
	depth = max((bt->sb.depth + users - 1) / users, 4U);
374
	return __blk_mq_active_requests(hctx) < depth;
J
John Garry 已提交
375 376
}

377
/* run the code block in @dispatch_ops with rcu/srcu read lock held */
378
#define __blk_mq_run_dispatch_ops(q, check_sleep, dispatch_ops)	\
379
do {								\
380
	if (!blk_queue_has_srcu(q)) {				\
381 382 383 384 385 386
		rcu_read_lock();				\
		(dispatch_ops);					\
		rcu_read_unlock();				\
	} else {						\
		int srcu_idx;					\
								\
387
		might_sleep_if(check_sleep);			\
388
		srcu_idx = srcu_read_lock((q)->srcu);		\
389
		(dispatch_ops);					\
390
		srcu_read_unlock((q)->srcu, srcu_idx);		\
391 392
	}							\
} while (0)
J
John Garry 已提交
393

394 395 396
#define blk_mq_run_dispatch_ops(q, dispatch_ops)		\
	__blk_mq_run_dispatch_ops(q, true, dispatch_ops)	\

397
#endif