blk-mq: remove dead check from blk_mq_dispatch_rq_list
[linux-block.git] / block / blk-mq.h
CommitLineData
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
8struct blk_mq_tag_set;
9
1db4909e
ML
10struct 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
18struct blk_mq_ctx {
19 struct {
20 spinlock_t lock;
c16d6b5a
ML
21 struct list_head rq_lists[HCTX_MAX_TYPES];
22 } ____cacheline_aligned_in_smp;
320ae51f
JA
23
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
JA
27
28 /* incremented at dispatch time */
29 unsigned long rq_dispatched[2];
30 unsigned long rq_merged;
31
32 /* incremented at completion time */
33 unsigned long ____cacheline_aligned_in_smp rq_completed[2];
34
35 struct request_queue *queue;
1db4909e 36 struct blk_mq_ctxs *ctxs;
320ae51f 37 struct kobject kobj;
4bb659b1 38} ____cacheline_aligned_in_smp;
320ae51f 39
c7e2d94b 40void blk_mq_exit_queue(struct request_queue *q);
e3a2b3f9 41int blk_mq_update_nr_requests(struct request_queue *q, unsigned int nr);
aed3ea94 42void blk_mq_wake_waiters(struct request_queue *q);
445874e8 43bool blk_mq_dispatch_rq_list(struct blk_mq_hw_ctx *hctx, struct list_head *, bool);
e6c98712
BVA
44void blk_mq_add_to_requeue_list(struct request *rq, bool at_head,
45 bool kick_requeue_list);
2c3ad667 46void blk_mq_flush_busy_ctxs(struct blk_mq_hw_ctx *hctx, struct list_head *list);
b347689f
ML
47struct request *blk_mq_dequeue_from_ctx(struct blk_mq_hw_ctx *hctx,
48 struct blk_mq_ctx *start);
2c3ad667
JA
49
50/*
51 * Internal helpers for allocating/freeing the request map
52 */
cc71a6f4
JA
53void blk_mq_free_rqs(struct blk_mq_tag_set *set, struct blk_mq_tags *tags,
54 unsigned int hctx_idx);
55void blk_mq_free_rq_map(struct blk_mq_tags *tags);
56struct blk_mq_tags *blk_mq_alloc_rq_map(struct blk_mq_tag_set *set,
57 unsigned int hctx_idx,
58 unsigned int nr_tags,
59 unsigned int reserved_tags);
60int blk_mq_alloc_rqs(struct blk_mq_tag_set *set, struct blk_mq_tags *tags,
61 unsigned int hctx_idx, unsigned int depth);
2c3ad667
JA
62
63/*
64 * Internal helpers for request insertion into sw queues
65 */
66void __blk_mq_insert_request(struct blk_mq_hw_ctx *hctx, struct request *rq,
67 bool at_head);
01e99aec
ML
68void blk_mq_request_bypass_insert(struct request *rq, bool at_head,
69 bool run_queue);
bd166ef1
JA
70void blk_mq_insert_requests(struct blk_mq_hw_ctx *hctx, struct blk_mq_ctx *ctx,
71 struct list_head *list);
320ae51f 72
fd9c40f6
BVA
73/* Used by blk_insert_cloned_request() to issue request directly */
74blk_status_t blk_mq_request_issue_directly(struct request *rq, bool last);
6ce3dd6e
ML
75void blk_mq_try_issue_list_directly(struct blk_mq_hw_ctx *hctx,
76 struct list_head *list);
396eaf21 77
320ae51f
JA
78/*
79 * CPU -> queue mappings
80 */
ed76e329 81extern int blk_mq_hw_queue_to_node(struct blk_mq_queue_map *qmap, unsigned int);
320ae51f 82
b3c661b1
JA
83/*
84 * blk_mq_map_queue_type() - map (hctx_type,cpu) to hardware queue
85 * @q: request queue
e20ba6e1 86 * @type: the hctx type index
b3c661b1
JA
87 * @cpu: CPU
88 */
89static inline struct blk_mq_hw_ctx *blk_mq_map_queue_type(struct request_queue *q,
e20ba6e1 90 enum hctx_type type,
b3c661b1 91 unsigned int cpu)
7d7e0f90 92{
e20ba6e1 93 return q->queue_hw_ctx[q->tag_set->map[type].mq_map[cpu]];
7d7e0f90
CH
94}
95
b3c661b1
JA
96/*
97 * blk_mq_map_queue() - map (cmd_flags,type) to hardware queue
98 * @q: request queue
99 * @flags: request command flags
8ccdf4a3 100 * @cpu: cpu ctx
b3c661b1
JA
101 */
102static inline struct blk_mq_hw_ctx *blk_mq_map_queue(struct request_queue *q,
103 unsigned int flags,
8ccdf4a3 104 struct blk_mq_ctx *ctx)
ff2c5660 105{
e20ba6e1
CH
106 enum hctx_type type = HCTX_TYPE_DEFAULT;
107
bb94aea1
JW
108 /*
109 * The caller ensure that if REQ_HIPRI, poll must be enabled.
110 */
111 if (flags & REQ_HIPRI)
e20ba6e1 112 type = HCTX_TYPE_POLL;
bb94aea1 113 else if ((flags & REQ_OP_MASK) == REQ_OP_READ)
e20ba6e1 114 type = HCTX_TYPE_READ;
5aceaeb2 115
8ccdf4a3 116 return ctx->hctxs[type];
ff2c5660
JA
117}
118
67aec14c
JA
119/*
120 * sysfs helpers
121 */
737f98cf 122extern void blk_mq_sysfs_init(struct request_queue *q);
7ea5fe31 123extern void blk_mq_sysfs_deinit(struct request_queue *q);
2d0364c8 124extern int __blk_mq_register_dev(struct device *dev, struct request_queue *q);
67aec14c
JA
125extern int blk_mq_sysfs_register(struct request_queue *q);
126extern void blk_mq_sysfs_unregister(struct request_queue *q);
868f2f0b 127extern void blk_mq_hctx_kobj_init(struct blk_mq_hw_ctx *hctx);
67aec14c 128
e09aae7e
ML
129void blk_mq_release(struct request_queue *q);
130
1aecfe48
ML
131static inline struct blk_mq_ctx *__blk_mq_get_ctx(struct request_queue *q,
132 unsigned int cpu)
133{
134 return per_cpu_ptr(q->queue_ctx, cpu);
135}
136
137/*
138 * This assumes per-cpu software queueing queues. They could be per-node
139 * as well, for instance. For now this is hardcoded as-is. Note that we don't
140 * care about preemption, since we know the ctx's are persistent. This does
141 * mean that we can't rely on ctx always matching the currently running CPU.
142 */
143static inline struct blk_mq_ctx *blk_mq_get_ctx(struct request_queue *q)
144{
c05f4220 145 return __blk_mq_get_ctx(q, raw_smp_processor_id());
1aecfe48
ML
146}
147
cb96a42c
ML
148struct blk_mq_alloc_data {
149 /* input parameter */
150 struct request_queue *q;
9a95e4ef 151 blk_mq_req_flags_t flags;
229a9287 152 unsigned int shallow_depth;
f9afca4d 153 unsigned int cmd_flags;
cb96a42c
ML
154
155 /* input & output parameter */
156 struct blk_mq_ctx *ctx;
157 struct blk_mq_hw_ctx *hctx;
158};
159
4941115b
JA
160static inline struct blk_mq_tags *blk_mq_tags_from_data(struct blk_mq_alloc_data *data)
161{
42fdc5e4 162 if (data->q->elevator)
bd166ef1
JA
163 return data->hctx->sched_tags;
164
4941115b
JA
165 return data->hctx->tags;
166}
167
5d1b25c1
BVA
168static inline bool blk_mq_hctx_stopped(struct blk_mq_hw_ctx *hctx)
169{
170 return test_bit(BLK_MQ_S_STOPPED, &hctx->state);
171}
172
19c66e59
ML
173static inline bool blk_mq_hw_queue_mapped(struct blk_mq_hw_ctx *hctx)
174{
175 return hctx->nr_ctx && hctx->tags;
176}
177
e016b782 178unsigned int blk_mq_in_flight(struct request_queue *q, struct hd_struct *part);
bf0ddaba
OS
179void blk_mq_in_flight_rw(struct request_queue *q, struct hd_struct *part,
180 unsigned int inflight[2]);
f299b7c7 181
65c76369 182static inline void blk_mq_put_dispatch_budget(struct request_queue *q)
de148297 183{
de148297 184 if (q->mq_ops->put_budget)
65c76369 185 q->mq_ops->put_budget(q);
de148297
ML
186}
187
65c76369 188static inline bool blk_mq_get_dispatch_budget(struct request_queue *q)
de148297 189{
de148297 190 if (q->mq_ops->get_budget)
65c76369 191 return q->mq_ops->get_budget(q);
88022d72 192 return true;
de148297
ML
193}
194
244c65a3
ML
195static inline void __blk_mq_put_driver_tag(struct blk_mq_hw_ctx *hctx,
196 struct request *rq)
197{
cae740a0 198 blk_mq_put_tag(hctx->tags, rq->mq_ctx, rq->tag);
76647368 199 rq->tag = BLK_MQ_NO_TAG;
244c65a3
ML
200
201 if (rq->rq_flags & RQF_MQ_INFLIGHT) {
202 rq->rq_flags &= ~RQF_MQ_INFLIGHT;
203 atomic_dec(&hctx->nr_active);
204 }
205}
206
244c65a3
ML
207static inline void blk_mq_put_driver_tag(struct request *rq)
208{
76647368 209 if (rq->tag == BLK_MQ_NO_TAG || rq->internal_tag == BLK_MQ_NO_TAG)
244c65a3
ML
210 return;
211
ea4f995e 212 __blk_mq_put_driver_tag(rq->mq_hctx, rq);
244c65a3
ML
213}
214
ed76e329 215static inline void blk_mq_clear_mq_map(struct blk_mq_queue_map *qmap)
0da73d00
MI
216{
217 int cpu;
218
219 for_each_possible_cpu(cpu)
ed76e329 220 qmap->mq_map[cpu] = 0;
0da73d00
MI
221}
222
b49773e7
DLM
223/*
224 * blk_mq_plug() - Get caller context plug
225 * @q: request queue
226 * @bio : the bio being submitted by the caller context
227 *
228 * Plugging, by design, may delay the insertion of BIOs into the elevator in
229 * order to increase BIO merging opportunities. This however can cause BIO
230 * insertion order to change from the order in which submit_bio() is being
231 * executed in the case of multiple contexts concurrently issuing BIOs to a
232 * device, even if these context are synchronized to tightly control BIO issuing
233 * order. While this is not a problem with regular block devices, this ordering
234 * change can cause write BIO failures with zoned block devices as these
235 * require sequential write patterns to zones. Prevent this from happening by
236 * ignoring the plug state of a BIO issuing context if the target request queue
237 * is for a zoned block device and the BIO to plug is a write operation.
238 *
239 * Return current->plug if the bio can be plugged and NULL otherwise
240 */
241static inline struct blk_plug *blk_mq_plug(struct request_queue *q,
242 struct bio *bio)
243{
244 /*
245 * For regular block devices or read operations, use the context plug
246 * which may be NULL if blk_start_plug() was not executed.
247 */
248 if (!blk_queue_is_zoned(q) || !op_is_write(bio_op(bio)))
249 return current->plug;
250
251 /* Zoned block device write operation case: do not plug the BIO */
252 return NULL;
253}
254
320ae51f 255#endif