blob: 3954c0dc14433d21c4baf7f9b007c2710fa67d64 [file] [log] [blame]
Christoph Hellwig3dcf60b2019-04-30 14:42:43 -04001// SPDX-License-Identifier: GPL-2.0
2
Josef Bacika7905042018-07-03 09:32:35 -06003#include "blk-rq-qos.h"
4
Josef Bacika7905042018-07-03 09:32:35 -06005/*
6 * Increment 'v', if 'v' is below 'below'. Returns true if we succeeded,
7 * false if 'v' + 1 would be bigger than 'below'.
8 */
Josef Bacik22f17952018-07-19 21:42:13 -04009static bool atomic_inc_below(atomic_t *v, unsigned int below)
Josef Bacika7905042018-07-03 09:32:35 -060010{
Josef Bacik22f17952018-07-19 21:42:13 -040011 unsigned int cur = atomic_read(v);
Josef Bacika7905042018-07-03 09:32:35 -060012
13 for (;;) {
Josef Bacik22f17952018-07-19 21:42:13 -040014 unsigned int old;
Josef Bacika7905042018-07-03 09:32:35 -060015
16 if (cur >= below)
17 return false;
18 old = atomic_cmpxchg(v, cur, cur + 1);
19 if (old == cur)
20 break;
21 cur = old;
22 }
23
24 return true;
25}
26
Josef Bacik22f17952018-07-19 21:42:13 -040027bool rq_wait_inc_below(struct rq_wait *rq_wait, unsigned int limit)
Josef Bacika7905042018-07-03 09:32:35 -060028{
29 return atomic_inc_below(&rq_wait->inflight, limit);
30}
31
Jens Axboee5045452018-11-15 12:25:10 -070032void __rq_qos_cleanup(struct rq_qos *rqos, struct bio *bio)
Josef Bacika7905042018-07-03 09:32:35 -060033{
Jens Axboee5045452018-11-15 12:25:10 -070034 do {
Josef Bacika7905042018-07-03 09:32:35 -060035 if (rqos->ops->cleanup)
Josef Bacikc1c80382018-07-03 11:14:59 -040036 rqos->ops->cleanup(rqos, bio);
Jens Axboee5045452018-11-15 12:25:10 -070037 rqos = rqos->next;
38 } while (rqos);
Josef Bacika7905042018-07-03 09:32:35 -060039}
40
Jens Axboee5045452018-11-15 12:25:10 -070041void __rq_qos_done(struct rq_qos *rqos, struct request *rq)
Josef Bacika7905042018-07-03 09:32:35 -060042{
Jens Axboee5045452018-11-15 12:25:10 -070043 do {
Josef Bacika7905042018-07-03 09:32:35 -060044 if (rqos->ops->done)
45 rqos->ops->done(rqos, rq);
Jens Axboee5045452018-11-15 12:25:10 -070046 rqos = rqos->next;
47 } while (rqos);
Josef Bacika7905042018-07-03 09:32:35 -060048}
49
Jens Axboee5045452018-11-15 12:25:10 -070050void __rq_qos_issue(struct rq_qos *rqos, struct request *rq)
Josef Bacika7905042018-07-03 09:32:35 -060051{
Jens Axboee5045452018-11-15 12:25:10 -070052 do {
Josef Bacika7905042018-07-03 09:32:35 -060053 if (rqos->ops->issue)
54 rqos->ops->issue(rqos, rq);
Jens Axboee5045452018-11-15 12:25:10 -070055 rqos = rqos->next;
56 } while (rqos);
Josef Bacika7905042018-07-03 09:32:35 -060057}
58
Jens Axboee5045452018-11-15 12:25:10 -070059void __rq_qos_requeue(struct rq_qos *rqos, struct request *rq)
Josef Bacika7905042018-07-03 09:32:35 -060060{
Jens Axboee5045452018-11-15 12:25:10 -070061 do {
Josef Bacika7905042018-07-03 09:32:35 -060062 if (rqos->ops->requeue)
63 rqos->ops->requeue(rqos, rq);
Jens Axboee5045452018-11-15 12:25:10 -070064 rqos = rqos->next;
65 } while (rqos);
Josef Bacika7905042018-07-03 09:32:35 -060066}
67
Jens Axboee5045452018-11-15 12:25:10 -070068void __rq_qos_throttle(struct rq_qos *rqos, struct bio *bio)
Josef Bacika7905042018-07-03 09:32:35 -060069{
Jens Axboee5045452018-11-15 12:25:10 -070070 do {
Josef Bacika7905042018-07-03 09:32:35 -060071 if (rqos->ops->throttle)
Christoph Hellwigd5337562018-11-14 17:02:09 +010072 rqos->ops->throttle(rqos, bio);
Jens Axboee5045452018-11-15 12:25:10 -070073 rqos = rqos->next;
74 } while (rqos);
Josef Bacikc1c80382018-07-03 11:14:59 -040075}
76
Jens Axboee5045452018-11-15 12:25:10 -070077void __rq_qos_track(struct rq_qos *rqos, struct request *rq, struct bio *bio)
Josef Bacikc1c80382018-07-03 11:14:59 -040078{
Jens Axboee5045452018-11-15 12:25:10 -070079 do {
Josef Bacikc1c80382018-07-03 11:14:59 -040080 if (rqos->ops->track)
81 rqos->ops->track(rqos, rq, bio);
Jens Axboee5045452018-11-15 12:25:10 -070082 rqos = rqos->next;
83 } while (rqos);
Josef Bacika7905042018-07-03 09:32:35 -060084}
85
Jens Axboee5045452018-11-15 12:25:10 -070086void __rq_qos_done_bio(struct rq_qos *rqos, struct bio *bio)
Josef Bacik67b42d02018-07-03 11:15:00 -040087{
Jens Axboee5045452018-11-15 12:25:10 -070088 do {
Josef Bacik67b42d02018-07-03 11:15:00 -040089 if (rqos->ops->done_bio)
90 rqos->ops->done_bio(rqos, bio);
Jens Axboee5045452018-11-15 12:25:10 -070091 rqos = rqos->next;
92 } while (rqos);
Josef Bacik67b42d02018-07-03 11:15:00 -040093}
94
Josef Bacika7905042018-07-03 09:32:35 -060095/*
96 * Return true, if we can't increase the depth further by scaling
97 */
98bool rq_depth_calc_max_depth(struct rq_depth *rqd)
99{
100 unsigned int depth;
101 bool ret = false;
102
103 /*
104 * For QD=1 devices, this is a special case. It's important for those
105 * to have one request ready when one completes, so force a depth of
106 * 2 for those devices. On the backend, it'll be a depth of 1 anyway,
107 * since the device can't have more than that in flight. If we're
108 * scaling down, then keep a setting of 1/1/1.
109 */
110 if (rqd->queue_depth == 1) {
111 if (rqd->scale_step > 0)
112 rqd->max_depth = 1;
113 else {
114 rqd->max_depth = 2;
115 ret = true;
116 }
117 } else {
118 /*
119 * scale_step == 0 is our default state. If we have suffered
120 * latency spikes, step will be > 0, and we shrink the
121 * allowed write depths. If step is < 0, we're only doing
122 * writes, and we allow a temporarily higher depth to
123 * increase performance.
124 */
125 depth = min_t(unsigned int, rqd->default_depth,
126 rqd->queue_depth);
127 if (rqd->scale_step > 0)
128 depth = 1 + ((depth - 1) >> min(31, rqd->scale_step));
129 else if (rqd->scale_step < 0) {
130 unsigned int maxd = 3 * rqd->queue_depth / 4;
131
132 depth = 1 + ((depth - 1) << -rqd->scale_step);
133 if (depth > maxd) {
134 depth = maxd;
135 ret = true;
136 }
137 }
138
139 rqd->max_depth = depth;
140 }
141
142 return ret;
143}
144
145void rq_depth_scale_up(struct rq_depth *rqd)
146{
147 /*
148 * Hit max in previous round, stop here
149 */
150 if (rqd->scaled_max)
151 return;
152
153 rqd->scale_step--;
154
155 rqd->scaled_max = rq_depth_calc_max_depth(rqd);
156}
157
158/*
159 * Scale rwb down. If 'hard_throttle' is set, do it quicker, since we
160 * had a latency violation.
161 */
162void rq_depth_scale_down(struct rq_depth *rqd, bool hard_throttle)
163{
164 /*
165 * Stop scaling down when we've hit the limit. This also prevents
166 * ->scale_step from going to crazy values, if the device can't
167 * keep up.
168 */
169 if (rqd->max_depth == 1)
170 return;
171
172 if (rqd->scale_step < 0 && hard_throttle)
173 rqd->scale_step = 0;
174 else
175 rqd->scale_step++;
176
177 rqd->scaled_max = false;
178 rq_depth_calc_max_depth(rqd);
179}
180
Josef Bacik84f60322018-12-04 12:59:02 -0500181struct rq_qos_wait_data {
182 struct wait_queue_entry wq;
183 struct task_struct *task;
184 struct rq_wait *rqw;
185 acquire_inflight_cb_t *cb;
186 void *private_data;
187 bool got_token;
188};
189
190static int rq_qos_wake_function(struct wait_queue_entry *curr,
191 unsigned int mode, int wake_flags, void *key)
192{
193 struct rq_qos_wait_data *data = container_of(curr,
194 struct rq_qos_wait_data,
195 wq);
196
197 /*
198 * If we fail to get a budget, return -1 to interrupt the wake up loop
199 * in __wake_up_common.
200 */
201 if (!data->cb(data->rqw, data->private_data))
202 return -1;
203
204 data->got_token = true;
Josef Bacikac382972019-07-16 16:19:29 -0400205 smp_wmb();
Josef Bacik84f60322018-12-04 12:59:02 -0500206 list_del_init(&curr->entry);
207 wake_up_process(data->task);
208 return 1;
209}
210
211/**
212 * rq_qos_wait - throttle on a rqw if we need to
Bart Van Assche83826a52019-05-30 17:00:50 -0700213 * @rqw: rqw to throttle on
214 * @private_data: caller provided specific data
215 * @acquire_inflight_cb: inc the rqw->inflight counter if we can
216 * @cleanup_cb: the callback to cleanup in case we race with a waker
Josef Bacik84f60322018-12-04 12:59:02 -0500217 *
218 * This provides a uniform place for the rq_qos users to do their throttling.
219 * Since you can end up with a lot of things sleeping at once, this manages the
220 * waking up based on the resources available. The acquire_inflight_cb should
221 * inc the rqw->inflight if we have the ability to do so, or return false if not
222 * and then we will sleep until the room becomes available.
223 *
224 * cleanup_cb is in case that we race with a waker and need to cleanup the
225 * inflight count accordingly.
226 */
227void rq_qos_wait(struct rq_wait *rqw, void *private_data,
228 acquire_inflight_cb_t *acquire_inflight_cb,
229 cleanup_cb_t *cleanup_cb)
230{
231 struct rq_qos_wait_data data = {
232 .wq = {
233 .func = rq_qos_wake_function,
234 .entry = LIST_HEAD_INIT(data.wq.entry),
235 },
236 .task = current,
237 .rqw = rqw,
238 .cb = acquire_inflight_cb,
239 .private_data = private_data,
240 };
241 bool has_sleeper;
242
243 has_sleeper = wq_has_sleeper(&rqw->wait);
244 if (!has_sleeper && acquire_inflight_cb(rqw, private_data))
245 return;
246
247 prepare_to_wait_exclusive(&rqw->wait, &data.wq, TASK_UNINTERRUPTIBLE);
Josef Bacik545fbd02019-07-16 16:19:26 -0400248 has_sleeper = !wq_has_single_sleeper(&rqw->wait);
Josef Bacik84f60322018-12-04 12:59:02 -0500249 do {
Josef Bacikac382972019-07-16 16:19:29 -0400250 /* The memory barrier in set_task_state saves us here. */
Josef Bacik84f60322018-12-04 12:59:02 -0500251 if (data.got_token)
252 break;
253 if (!has_sleeper && acquire_inflight_cb(rqw, private_data)) {
254 finish_wait(&rqw->wait, &data.wq);
255
256 /*
257 * We raced with wbt_wake_function() getting a token,
258 * which means we now have two. Put our local token
259 * and wake anyone else potentially waiting for one.
260 */
Josef Bacikac382972019-07-16 16:19:29 -0400261 smp_rmb();
Josef Bacik84f60322018-12-04 12:59:02 -0500262 if (data.got_token)
263 cleanup_cb(rqw, private_data);
264 break;
265 }
266 io_schedule();
Josef Bacik64e7ea82019-07-16 16:19:27 -0400267 has_sleeper = true;
Josef Bacikd14a9b32019-07-16 16:19:28 -0400268 set_current_state(TASK_UNINTERRUPTIBLE);
Josef Bacik84f60322018-12-04 12:59:02 -0500269 } while (1);
270 finish_wait(&rqw->wait, &data.wq);
271}
272
Josef Bacika7905042018-07-03 09:32:35 -0600273void rq_qos_exit(struct request_queue *q)
274{
Ming Leicc566942018-12-17 09:46:00 +0800275 blk_mq_debugfs_unregister_queue_rqos(q);
276
Josef Bacika7905042018-07-03 09:32:35 -0600277 while (q->rq_qos) {
278 struct rq_qos *rqos = q->rq_qos;
279 q->rq_qos = rqos->next;
280 rqos->ops->exit(rqos);
281 }
282}