blob: 8591a54d989b163284f14d420524af6dc008cc28 [file] [log] [blame]
Greg Kroah-Hartmanb2441312017-11-01 15:07:57 +01001/* SPDX-License-Identifier: GPL-2.0 */
Jens Axboe320ae512013-10-24 09:20:05 +01002#ifndef INT_BLK_MQ_H
3#define INT_BLK_MQ_H
4
Jens Axboecf43e6b2016-11-07 21:32:37 -07005#include "blk-stat.h"
Ming Lei244c65a2017-11-04 12:39:57 -06006#include "blk-mq-tag.h"
Jens Axboecf43e6b2016-11-07 21:32:37 -07007
Christoph Hellwig24d2f902014-04-15 14:14:00 -06008struct blk_mq_tag_set;
9
Jens Axboe320ae512013-10-24 09:20:05 +010010struct blk_mq_ctx {
11 struct {
12 spinlock_t lock;
13 struct list_head rq_list;
14 } ____cacheline_aligned_in_smp;
15
16 unsigned int cpu;
17 unsigned int index_hw;
Jens Axboe320ae512013-10-24 09:20:05 +010018
19 /* incremented at dispatch time */
20 unsigned long rq_dispatched[2];
21 unsigned long rq_merged;
22
23 /* incremented at completion time */
24 unsigned long ____cacheline_aligned_in_smp rq_completed[2];
25
26 struct request_queue *queue;
27 struct kobject kobj;
Jens Axboe4bb659b2014-05-09 09:36:49 -060028} ____cacheline_aligned_in_smp;
Jens Axboe320ae512013-10-24 09:20:05 +010029
Tejun Heo1d9bd512018-01-09 08:29:48 -080030/*
31 * Bits for request->gstate. The lower two bits carry MQ_RQ_* state value
32 * and the upper bits the generation number.
33 */
34enum mq_rq_state {
35 MQ_RQ_IDLE = 0,
36 MQ_RQ_IN_FLIGHT = 1,
Tejun Heo5a61c362018-01-09 08:29:52 -080037 MQ_RQ_COMPLETE = 2,
Tejun Heo1d9bd512018-01-09 08:29:48 -080038
39 MQ_RQ_STATE_BITS = 2,
40 MQ_RQ_STATE_MASK = (1 << MQ_RQ_STATE_BITS) - 1,
41 MQ_RQ_GEN_INC = 1 << MQ_RQ_STATE_BITS,
42};
43
Tejun Heo780db202014-07-01 10:31:13 -060044void blk_mq_freeze_queue(struct request_queue *q);
Ming Lei3edcc0c2013-12-26 21:31:38 +080045void blk_mq_free_queue(struct request_queue *q);
Jens Axboee3a2b3f2014-05-20 11:49:02 -060046int blk_mq_update_nr_requests(struct request_queue *q, unsigned int nr);
Jens Axboeaed3ea92014-12-22 14:04:42 -070047void blk_mq_wake_waiters(struct request_queue *q);
Ming Leide148292017-10-14 17:22:29 +080048bool blk_mq_dispatch_rq_list(struct request_queue *, struct list_head *, bool);
Jens Axboe2c3ad662016-12-14 14:34:47 -070049void blk_mq_flush_busy_ctxs(struct blk_mq_hw_ctx *hctx, struct list_head *list);
Jens Axboebd6737f2017-01-27 01:00:47 -070050bool blk_mq_get_driver_tag(struct request *rq, struct blk_mq_hw_ctx **hctx,
51 bool wait);
Ming Leib3476892017-10-14 17:22:30 +080052struct request *blk_mq_dequeue_from_ctx(struct blk_mq_hw_ctx *hctx,
53 struct blk_mq_ctx *start);
Jens Axboe2c3ad662016-12-14 14:34:47 -070054
55/*
56 * Internal helpers for allocating/freeing the request map
57 */
Jens Axboecc71a6f2017-01-11 14:29:56 -070058void blk_mq_free_rqs(struct blk_mq_tag_set *set, struct blk_mq_tags *tags,
59 unsigned int hctx_idx);
60void blk_mq_free_rq_map(struct blk_mq_tags *tags);
61struct blk_mq_tags *blk_mq_alloc_rq_map(struct blk_mq_tag_set *set,
62 unsigned int hctx_idx,
63 unsigned int nr_tags,
64 unsigned int reserved_tags);
65int blk_mq_alloc_rqs(struct blk_mq_tag_set *set, struct blk_mq_tags *tags,
66 unsigned int hctx_idx, unsigned int depth);
Jens Axboe2c3ad662016-12-14 14:34:47 -070067
68/*
69 * Internal helpers for request insertion into sw queues
70 */
71void __blk_mq_insert_request(struct blk_mq_hw_ctx *hctx, struct request *rq,
72 bool at_head);
Ming Leib0850292017-11-02 23:24:34 +080073void blk_mq_request_bypass_insert(struct request *rq, bool run_queue);
Jens Axboebd166ef2017-01-17 06:03:22 -070074void blk_mq_insert_requests(struct blk_mq_hw_ctx *hctx, struct blk_mq_ctx *ctx,
75 struct list_head *list);
Jens Axboe320ae512013-10-24 09:20:05 +010076
77/*
78 * CPU -> queue mappings
79 */
Jens Axboef14bbe72014-05-27 12:06:53 -060080extern int blk_mq_hw_queue_to_node(unsigned int *map, unsigned int);
Jens Axboe320ae512013-10-24 09:20:05 +010081
Christoph Hellwig7d7e0f92016-09-14 16:18:54 +020082static inline struct blk_mq_hw_ctx *blk_mq_map_queue(struct request_queue *q,
83 int cpu)
84{
85 return q->queue_hw_ctx[q->mq_map[cpu]];
86}
87
Jens Axboee93ecf62014-05-19 09:17:48 -060088/*
Jens Axboe67aec142014-05-30 08:25:36 -060089 * sysfs helpers
90 */
Ming Lei737f98c2017-02-22 18:13:59 +080091extern void blk_mq_sysfs_init(struct request_queue *q);
Ming Lei7ea5fe32017-02-22 18:14:00 +080092extern void blk_mq_sysfs_deinit(struct request_queue *q);
Bart Van Assche2d0364c2017-04-26 13:47:48 -070093extern int __blk_mq_register_dev(struct device *dev, struct request_queue *q);
Jens Axboe67aec142014-05-30 08:25:36 -060094extern int blk_mq_sysfs_register(struct request_queue *q);
95extern void blk_mq_sysfs_unregister(struct request_queue *q);
Keith Busch868f2f02015-12-17 17:08:14 -070096extern void blk_mq_hctx_kobj_init(struct blk_mq_hw_ctx *hctx);
Jens Axboe67aec142014-05-30 08:25:36 -060097
Ming Leie09aae7e2015-01-29 20:17:27 +080098void blk_mq_release(struct request_queue *q);
99
Tejun Heo1d9bd512018-01-09 08:29:48 -0800100/**
101 * blk_mq_rq_state() - read the current MQ_RQ_* state of a request
102 * @rq: target request.
103 */
104static inline int blk_mq_rq_state(struct request *rq)
105{
106 return READ_ONCE(rq->gstate) & MQ_RQ_STATE_MASK;
107}
108
109/**
110 * blk_mq_rq_update_state() - set the current MQ_RQ_* state of a request
111 * @rq: target request.
112 * @state: new state to set.
113 *
114 * Set @rq's state to @state. The caller is responsible for ensuring that
115 * there are no other updaters. A request can transition into IN_FLIGHT
116 * only from IDLE and doing so increments the generation number.
117 */
118static inline void blk_mq_rq_update_state(struct request *rq,
119 enum mq_rq_state state)
120{
121 u64 old_val = READ_ONCE(rq->gstate);
122 u64 new_val = (old_val & ~MQ_RQ_STATE_MASK) | state;
123
124 if (state == MQ_RQ_IN_FLIGHT) {
125 WARN_ON_ONCE((old_val & MQ_RQ_STATE_MASK) != MQ_RQ_IDLE);
126 new_val += MQ_RQ_GEN_INC;
127 }
128
129 /* avoid exposing interim values */
130 WRITE_ONCE(rq->gstate, new_val);
131}
132
Ming Lei1aecfe42014-06-01 00:43:36 +0800133static inline struct blk_mq_ctx *__blk_mq_get_ctx(struct request_queue *q,
134 unsigned int cpu)
135{
136 return per_cpu_ptr(q->queue_ctx, cpu);
137}
138
139/*
140 * This assumes per-cpu software queueing queues. They could be per-node
141 * as well, for instance. For now this is hardcoded as-is. Note that we don't
142 * care about preemption, since we know the ctx's are persistent. This does
143 * mean that we can't rely on ctx always matching the currently running CPU.
144 */
145static inline struct blk_mq_ctx *blk_mq_get_ctx(struct request_queue *q)
146{
147 return __blk_mq_get_ctx(q, get_cpu());
148}
149
150static inline void blk_mq_put_ctx(struct blk_mq_ctx *ctx)
151{
152 put_cpu();
153}
154
Ming Leicb96a422014-06-01 00:43:37 +0800155struct blk_mq_alloc_data {
156 /* input parameter */
157 struct request_queue *q;
Bart Van Assche9a95e4e2017-11-09 10:49:59 -0800158 blk_mq_req_flags_t flags;
Omar Sandoval229a92872017-04-14 00:59:59 -0700159 unsigned int shallow_depth;
Ming Leicb96a422014-06-01 00:43:37 +0800160
161 /* input & output parameter */
162 struct blk_mq_ctx *ctx;
163 struct blk_mq_hw_ctx *hctx;
164};
165
Jens Axboe49411152017-01-13 08:09:05 -0700166static inline struct blk_mq_tags *blk_mq_tags_from_data(struct blk_mq_alloc_data *data)
167{
Jens Axboebd166ef2017-01-17 06:03:22 -0700168 if (data->flags & BLK_MQ_REQ_INTERNAL)
169 return data->hctx->sched_tags;
170
Jens Axboe49411152017-01-13 08:09:05 -0700171 return data->hctx->tags;
172}
173
Bart Van Assche5d1b25c2016-10-28 17:19:15 -0700174static inline bool blk_mq_hctx_stopped(struct blk_mq_hw_ctx *hctx)
175{
176 return test_bit(BLK_MQ_S_STOPPED, &hctx->state);
177}
178
Ming Lei19c66e52014-12-03 19:38:04 +0800179static inline bool blk_mq_hw_queue_mapped(struct blk_mq_hw_ctx *hctx)
180{
181 return hctx->nr_ctx && hctx->tags;
182}
183
Jens Axboef299b7c2017-08-08 17:51:45 -0600184void blk_mq_in_flight(struct request_queue *q, struct hd_struct *part,
185 unsigned int inflight[2]);
186
Ming Leide148292017-10-14 17:22:29 +0800187static inline void blk_mq_put_dispatch_budget(struct blk_mq_hw_ctx *hctx)
188{
189 struct request_queue *q = hctx->queue;
190
191 if (q->mq_ops->put_budget)
192 q->mq_ops->put_budget(hctx);
193}
194
Ming Lei88022d72017-11-05 02:21:12 +0800195static inline bool blk_mq_get_dispatch_budget(struct blk_mq_hw_ctx *hctx)
Ming Leide148292017-10-14 17:22:29 +0800196{
197 struct request_queue *q = hctx->queue;
198
199 if (q->mq_ops->get_budget)
200 return q->mq_ops->get_budget(hctx);
Ming Lei88022d72017-11-05 02:21:12 +0800201 return true;
Ming Leide148292017-10-14 17:22:29 +0800202}
203
Ming Lei244c65a2017-11-04 12:39:57 -0600204static inline void __blk_mq_put_driver_tag(struct blk_mq_hw_ctx *hctx,
205 struct request *rq)
206{
207 blk_mq_put_tag(hctx, hctx->tags, rq->mq_ctx, rq->tag);
208 rq->tag = -1;
209
210 if (rq->rq_flags & RQF_MQ_INFLIGHT) {
211 rq->rq_flags &= ~RQF_MQ_INFLIGHT;
212 atomic_dec(&hctx->nr_active);
213 }
214}
215
216static inline void blk_mq_put_driver_tag_hctx(struct blk_mq_hw_ctx *hctx,
217 struct request *rq)
218{
219 if (rq->tag == -1 || rq->internal_tag == -1)
220 return;
221
222 __blk_mq_put_driver_tag(hctx, rq);
223}
224
225static inline void blk_mq_put_driver_tag(struct request *rq)
226{
227 struct blk_mq_hw_ctx *hctx;
228
229 if (rq->tag == -1 || rq->internal_tag == -1)
230 return;
231
232 hctx = blk_mq_map_queue(rq->q, rq->mq_ctx->cpu);
233 __blk_mq_put_driver_tag(hctx, rq);
234}
235
Jens Axboe320ae512013-10-24 09:20:05 +0100236#endif