]>
Commit | Line | Data |
---|---|---|
aee69d78 PV |
1 | /* |
2 | * Budget Fair Queueing (BFQ) I/O scheduler. | |
3 | * | |
4 | * Based on ideas and code from CFQ: | |
5 | * Copyright (C) 2003 Jens Axboe <axboe@kernel.dk> | |
6 | * | |
7 | * Copyright (C) 2008 Fabio Checconi <fabio@gandalf.sssup.it> | |
8 | * Paolo Valente <paolo.valente@unimore.it> | |
9 | * | |
10 | * Copyright (C) 2010 Paolo Valente <paolo.valente@unimore.it> | |
11 | * Arianna Avanzini <avanzini@google.com> | |
12 | * | |
13 | * Copyright (C) 2017 Paolo Valente <paolo.valente@linaro.org> | |
14 | * | |
15 | * This program is free software; you can redistribute it and/or | |
16 | * modify it under the terms of the GNU General Public License as | |
17 | * published by the Free Software Foundation; either version 2 of the | |
18 | * License, or (at your option) any later version. | |
19 | * | |
20 | * This program is distributed in the hope that it will be useful, | |
21 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
22 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
23 | * General Public License for more details. | |
24 | * | |
25 | * BFQ is a proportional-share I/O scheduler, with some extra | |
26 | * low-latency capabilities. BFQ also supports full hierarchical | |
27 | * scheduling through cgroups. Next paragraphs provide an introduction | |
28 | * on BFQ inner workings. Details on BFQ benefits, usage and | |
29 | * limitations can be found in Documentation/block/bfq-iosched.txt. | |
30 | * | |
31 | * BFQ is a proportional-share storage-I/O scheduling algorithm based | |
32 | * on the slice-by-slice service scheme of CFQ. But BFQ assigns | |
33 | * budgets, measured in number of sectors, to processes instead of | |
34 | * time slices. The device is not granted to the in-service process | |
35 | * for a given time slice, but until it has exhausted its assigned | |
36 | * budget. This change from the time to the service domain enables BFQ | |
37 | * to distribute the device throughput among processes as desired, | |
38 | * without any distortion due to throughput fluctuations, or to device | |
39 | * internal queueing. BFQ uses an ad hoc internal scheduler, called | |
40 | * B-WF2Q+, to schedule processes according to their budgets. More | |
41 | * precisely, BFQ schedules queues associated with processes. Each | |
42 | * process/queue is assigned a user-configurable weight, and B-WF2Q+ | |
43 | * guarantees that each queue receives a fraction of the throughput | |
44 | * proportional to its weight. Thanks to the accurate policy of | |
45 | * B-WF2Q+, BFQ can afford to assign high budgets to I/O-bound | |
46 | * processes issuing sequential requests (to boost the throughput), | |
47 | * and yet guarantee a low latency to interactive and soft real-time | |
48 | * applications. | |
49 | * | |
50 | * In particular, to provide these low-latency guarantees, BFQ | |
51 | * explicitly privileges the I/O of two classes of time-sensitive | |
4029eef1 PV |
52 | * applications: interactive and soft real-time. In more detail, BFQ |
53 | * behaves this way if the low_latency parameter is set (default | |
54 | * configuration). This feature enables BFQ to provide applications in | |
55 | * these classes with a very low latency. | |
56 | * | |
57 | * To implement this feature, BFQ constantly tries to detect whether | |
58 | * the I/O requests in a bfq_queue come from an interactive or a soft | |
59 | * real-time application. For brevity, in these cases, the queue is | |
60 | * said to be interactive or soft real-time. In both cases, BFQ | |
61 | * privileges the service of the queue, over that of non-interactive | |
62 | * and non-soft-real-time queues. This privileging is performed, | |
63 | * mainly, by raising the weight of the queue. So, for brevity, we | |
64 | * call just weight-raising periods the time periods during which a | |
65 | * queue is privileged, because deemed interactive or soft real-time. | |
66 | * | |
67 | * The detection of soft real-time queues/applications is described in | |
68 | * detail in the comments on the function | |
69 | * bfq_bfqq_softrt_next_start. On the other hand, the detection of an | |
70 | * interactive queue works as follows: a queue is deemed interactive | |
71 | * if it is constantly non empty only for a limited time interval, | |
72 | * after which it does become empty. The queue may be deemed | |
73 | * interactive again (for a limited time), if it restarts being | |
74 | * constantly non empty, provided that this happens only after the | |
75 | * queue has remained empty for a given minimum idle time. | |
76 | * | |
77 | * By default, BFQ computes automatically the above maximum time | |
78 | * interval, i.e., the time interval after which a constantly | |
79 | * non-empty queue stops being deemed interactive. Since a queue is | |
80 | * weight-raised while it is deemed interactive, this maximum time | |
81 | * interval happens to coincide with the (maximum) duration of the | |
82 | * weight-raising for interactive queues. | |
83 | * | |
84 | * Finally, BFQ also features additional heuristics for | |
aee69d78 PV |
85 | * preserving both a low latency and a high throughput on NCQ-capable, |
86 | * rotational or flash-based devices, and to get the job done quickly | |
87 | * for applications consisting in many I/O-bound processes. | |
88 | * | |
43c1b3d6 PV |
89 | * NOTE: if the main or only goal, with a given device, is to achieve |
90 | * the maximum-possible throughput at all times, then do switch off | |
91 | * all low-latency heuristics for that device, by setting low_latency | |
92 | * to 0. | |
93 | * | |
4029eef1 PV |
94 | * BFQ is described in [1], where also a reference to the initial, |
95 | * more theoretical paper on BFQ can be found. The interested reader | |
96 | * can find in the latter paper full details on the main algorithm, as | |
97 | * well as formulas of the guarantees and formal proofs of all the | |
98 | * properties. With respect to the version of BFQ presented in these | |
99 | * papers, this implementation adds a few more heuristics, such as the | |
100 | * ones that guarantee a low latency to interactive and soft real-time | |
101 | * applications, and a hierarchical extension based on H-WF2Q+. | |
aee69d78 PV |
102 | * |
103 | * B-WF2Q+ is based on WF2Q+, which is described in [2], together with | |
104 | * H-WF2Q+, while the augmented tree used here to implement B-WF2Q+ | |
105 | * with O(log N) complexity derives from the one introduced with EEVDF | |
106 | * in [3]. | |
107 | * | |
108 | * [1] P. Valente, A. Avanzini, "Evolution of the BFQ Storage I/O | |
109 | * Scheduler", Proceedings of the First Workshop on Mobile System | |
110 | * Technologies (MST-2015), May 2015. | |
111 | * http://algogroup.unimore.it/people/paolo/disk_sched/mst-2015.pdf | |
112 | * | |
113 | * [2] Jon C.R. Bennett and H. Zhang, "Hierarchical Packet Fair Queueing | |
114 | * Algorithms", IEEE/ACM Transactions on Networking, 5(5):675-689, | |
115 | * Oct 1997. | |
116 | * | |
117 | * http://www.cs.cmu.edu/~hzhang/papers/TON-97-Oct.ps.gz | |
118 | * | |
119 | * [3] I. Stoica and H. Abdel-Wahab, "Earliest Eligible Virtual Deadline | |
120 | * First: A Flexible and Accurate Mechanism for Proportional Share | |
121 | * Resource Allocation", technical report. | |
122 | * | |
123 | * http://www.cs.berkeley.edu/~istoica/papers/eevdf-tr-95.pdf | |
124 | */ | |
125 | #include <linux/module.h> | |
126 | #include <linux/slab.h> | |
127 | #include <linux/blkdev.h> | |
e21b7a0b | 128 | #include <linux/cgroup.h> |
aee69d78 PV |
129 | #include <linux/elevator.h> |
130 | #include <linux/ktime.h> | |
131 | #include <linux/rbtree.h> | |
132 | #include <linux/ioprio.h> | |
133 | #include <linux/sbitmap.h> | |
134 | #include <linux/delay.h> | |
135 | ||
136 | #include "blk.h" | |
137 | #include "blk-mq.h" | |
138 | #include "blk-mq-tag.h" | |
139 | #include "blk-mq-sched.h" | |
ea25da48 | 140 | #include "bfq-iosched.h" |
b5dc5d4d | 141 | #include "blk-wbt.h" |
aee69d78 | 142 | |
ea25da48 PV |
143 | #define BFQ_BFQQ_FNS(name) \ |
144 | void bfq_mark_bfqq_##name(struct bfq_queue *bfqq) \ | |
145 | { \ | |
146 | __set_bit(BFQQF_##name, &(bfqq)->flags); \ | |
147 | } \ | |
148 | void bfq_clear_bfqq_##name(struct bfq_queue *bfqq) \ | |
149 | { \ | |
150 | __clear_bit(BFQQF_##name, &(bfqq)->flags); \ | |
151 | } \ | |
152 | int bfq_bfqq_##name(const struct bfq_queue *bfqq) \ | |
153 | { \ | |
154 | return test_bit(BFQQF_##name, &(bfqq)->flags); \ | |
44e44a1b PV |
155 | } |
156 | ||
ea25da48 PV |
157 | BFQ_BFQQ_FNS(just_created); |
158 | BFQ_BFQQ_FNS(busy); | |
159 | BFQ_BFQQ_FNS(wait_request); | |
160 | BFQ_BFQQ_FNS(non_blocking_wait_rq); | |
161 | BFQ_BFQQ_FNS(fifo_expire); | |
d5be3fef | 162 | BFQ_BFQQ_FNS(has_short_ttime); |
ea25da48 PV |
163 | BFQ_BFQQ_FNS(sync); |
164 | BFQ_BFQQ_FNS(IO_bound); | |
165 | BFQ_BFQQ_FNS(in_large_burst); | |
166 | BFQ_BFQQ_FNS(coop); | |
167 | BFQ_BFQQ_FNS(split_coop); | |
168 | BFQ_BFQQ_FNS(softrt_update); | |
169 | #undef BFQ_BFQQ_FNS \ | |
aee69d78 | 170 | |
ea25da48 PV |
171 | /* Expiration time of sync (0) and async (1) requests, in ns. */ |
172 | static const u64 bfq_fifo_expire[2] = { NSEC_PER_SEC / 4, NSEC_PER_SEC / 8 }; | |
aee69d78 | 173 | |
ea25da48 PV |
174 | /* Maximum backwards seek (magic number lifted from CFQ), in KiB. */ |
175 | static const int bfq_back_max = 16 * 1024; | |
aee69d78 | 176 | |
ea25da48 PV |
177 | /* Penalty of a backwards seek, in number of sectors. */ |
178 | static const int bfq_back_penalty = 2; | |
e21b7a0b | 179 | |
ea25da48 PV |
180 | /* Idling period duration, in ns. */ |
181 | static u64 bfq_slice_idle = NSEC_PER_SEC / 125; | |
aee69d78 | 182 | |
ea25da48 PV |
183 | /* Minimum number of assigned budgets for which stats are safe to compute. */ |
184 | static const int bfq_stats_min_budgets = 194; | |
aee69d78 | 185 | |
ea25da48 PV |
186 | /* Default maximum budget values, in sectors and number of requests. */ |
187 | static const int bfq_default_max_budget = 16 * 1024; | |
e21b7a0b | 188 | |
ea25da48 | 189 | /* |
d5801088 PV |
190 | * When a sync request is dispatched, the queue that contains that |
191 | * request, and all the ancestor entities of that queue, are charged | |
192 | * with the number of sectors of the request. In constrast, if the | |
193 | * request is async, then the queue and its ancestor entities are | |
194 | * charged with the number of sectors of the request, multiplied by | |
195 | * the factor below. This throttles the bandwidth for async I/O, | |
196 | * w.r.t. to sync I/O, and it is done to counter the tendency of async | |
197 | * writes to steal I/O throughput to reads. | |
198 | * | |
199 | * The current value of this parameter is the result of a tuning with | |
200 | * several hardware and software configurations. We tried to find the | |
201 | * lowest value for which writes do not cause noticeable problems to | |
202 | * reads. In fact, the lower this parameter, the stabler I/O control, | |
203 | * in the following respect. The lower this parameter is, the less | |
204 | * the bandwidth enjoyed by a group decreases | |
205 | * - when the group does writes, w.r.t. to when it does reads; | |
206 | * - when other groups do reads, w.r.t. to when they do writes. | |
ea25da48 | 207 | */ |
d5801088 | 208 | static const int bfq_async_charge_factor = 3; |
aee69d78 | 209 | |
ea25da48 PV |
210 | /* Default timeout values, in jiffies, approximating CFQ defaults. */ |
211 | const int bfq_timeout = HZ / 8; | |
aee69d78 | 212 | |
7b8fa3b9 PV |
213 | /* |
214 | * Time limit for merging (see comments in bfq_setup_cooperator). Set | |
215 | * to the slowest value that, in our tests, proved to be effective in | |
216 | * removing false positives, while not causing true positives to miss | |
217 | * queue merging. | |
218 | * | |
219 | * As can be deduced from the low time limit below, queue merging, if | |
220 | * successful, happens at the very beggining of the I/O of the involved | |
221 | * cooperating processes, as a consequence of the arrival of the very | |
222 | * first requests from each cooperator. After that, there is very | |
223 | * little chance to find cooperators. | |
224 | */ | |
225 | static const unsigned long bfq_merge_time_limit = HZ/10; | |
226 | ||
ea25da48 | 227 | static struct kmem_cache *bfq_pool; |
e21b7a0b | 228 | |
ea25da48 PV |
229 | /* Below this threshold (in ns), we consider thinktime immediate. */ |
230 | #define BFQ_MIN_TT (2 * NSEC_PER_MSEC) | |
e21b7a0b | 231 | |
ea25da48 | 232 | /* hw_tag detection: parallel requests threshold and min samples needed. */ |
a3c92560 | 233 | #define BFQ_HW_QUEUE_THRESHOLD 3 |
ea25da48 | 234 | #define BFQ_HW_QUEUE_SAMPLES 32 |
aee69d78 | 235 | |
ea25da48 PV |
236 | #define BFQQ_SEEK_THR (sector_t)(8 * 100) |
237 | #define BFQQ_SECT_THR_NONROT (sector_t)(2 * 32) | |
d87447d8 PV |
238 | #define BFQ_RQ_SEEKY(bfqd, last_pos, rq) \ |
239 | (get_sdist(last_pos, rq) > \ | |
240 | BFQQ_SEEK_THR && \ | |
241 | (!blk_queue_nonrot(bfqd->queue) || \ | |
242 | blk_rq_sectors(rq) < BFQQ_SECT_THR_NONROT)) | |
ea25da48 | 243 | #define BFQQ_CLOSE_THR (sector_t)(8 * 1024) |
f0ba5ea2 | 244 | #define BFQQ_SEEKY(bfqq) (hweight32(bfqq->seek_history) > 19) |
7074f076 PV |
245 | /* |
246 | * Sync random I/O is likely to be confused with soft real-time I/O, | |
247 | * because it is characterized by limited throughput and apparently | |
248 | * isochronous arrival pattern. To avoid false positives, queues | |
249 | * containing only random (seeky) I/O are prevented from being tagged | |
250 | * as soft real-time. | |
251 | */ | |
252 | #define BFQQ_TOTALLY_SEEKY(bfqq) (bfqq->seek_history & -1) | |
aee69d78 | 253 | |
ea25da48 PV |
254 | /* Min number of samples required to perform peak-rate update */ |
255 | #define BFQ_RATE_MIN_SAMPLES 32 | |
256 | /* Min observation time interval required to perform a peak-rate update (ns) */ | |
257 | #define BFQ_RATE_MIN_INTERVAL (300*NSEC_PER_MSEC) | |
258 | /* Target observation time interval for a peak-rate update (ns) */ | |
259 | #define BFQ_RATE_REF_INTERVAL NSEC_PER_SEC | |
aee69d78 | 260 | |
bc56e2ca PV |
261 | /* |
262 | * Shift used for peak-rate fixed precision calculations. | |
263 | * With | |
264 | * - the current shift: 16 positions | |
265 | * - the current type used to store rate: u32 | |
266 | * - the current unit of measure for rate: [sectors/usec], or, more precisely, | |
267 | * [(sectors/usec) / 2^BFQ_RATE_SHIFT] to take into account the shift, | |
268 | * the range of rates that can be stored is | |
269 | * [1 / 2^BFQ_RATE_SHIFT, 2^(32 - BFQ_RATE_SHIFT)] sectors/usec = | |
270 | * [1 / 2^16, 2^16] sectors/usec = [15e-6, 65536] sectors/usec = | |
271 | * [15, 65G] sectors/sec | |
272 | * Which, assuming a sector size of 512B, corresponds to a range of | |
273 | * [7.5K, 33T] B/sec | |
274 | */ | |
ea25da48 | 275 | #define BFQ_RATE_SHIFT 16 |
aee69d78 | 276 | |
ea25da48 | 277 | /* |
4029eef1 PV |
278 | * When configured for computing the duration of the weight-raising |
279 | * for interactive queues automatically (see the comments at the | |
280 | * beginning of this file), BFQ does it using the following formula: | |
e24f1c24 PV |
281 | * duration = (ref_rate / r) * ref_wr_duration, |
282 | * where r is the peak rate of the device, and ref_rate and | |
283 | * ref_wr_duration are two reference parameters. In particular, | |
284 | * ref_rate is the peak rate of the reference storage device (see | |
285 | * below), and ref_wr_duration is about the maximum time needed, with | |
286 | * BFQ and while reading two files in parallel, to load typical large | |
287 | * applications on the reference device (see the comments on | |
288 | * max_service_from_wr below, for more details on how ref_wr_duration | |
289 | * is obtained). In practice, the slower/faster the device at hand | |
290 | * is, the more/less it takes to load applications with respect to the | |
4029eef1 PV |
291 | * reference device. Accordingly, the longer/shorter BFQ grants |
292 | * weight raising to interactive applications. | |
ea25da48 | 293 | * |
e24f1c24 PV |
294 | * BFQ uses two different reference pairs (ref_rate, ref_wr_duration), |
295 | * depending on whether the device is rotational or non-rotational. | |
ea25da48 | 296 | * |
e24f1c24 PV |
297 | * In the following definitions, ref_rate[0] and ref_wr_duration[0] |
298 | * are the reference values for a rotational device, whereas | |
299 | * ref_rate[1] and ref_wr_duration[1] are the reference values for a | |
300 | * non-rotational device. The reference rates are not the actual peak | |
301 | * rates of the devices used as a reference, but slightly lower | |
302 | * values. The reason for using slightly lower values is that the | |
303 | * peak-rate estimator tends to yield slightly lower values than the | |
304 | * actual peak rate (it can yield the actual peak rate only if there | |
305 | * is only one process doing I/O, and the process does sequential | |
306 | * I/O). | |
ea25da48 | 307 | * |
e24f1c24 PV |
308 | * The reference peak rates are measured in sectors/usec, left-shifted |
309 | * by BFQ_RATE_SHIFT. | |
ea25da48 | 310 | */ |
e24f1c24 | 311 | static int ref_rate[2] = {14000, 33000}; |
ea25da48 | 312 | /* |
e24f1c24 PV |
313 | * To improve readability, a conversion function is used to initialize |
314 | * the following array, which entails that the array can be | |
315 | * initialized only in a function. | |
ea25da48 | 316 | */ |
e24f1c24 | 317 | static int ref_wr_duration[2]; |
aee69d78 | 318 | |
8a8747dc PV |
319 | /* |
320 | * BFQ uses the above-detailed, time-based weight-raising mechanism to | |
321 | * privilege interactive tasks. This mechanism is vulnerable to the | |
322 | * following false positives: I/O-bound applications that will go on | |
323 | * doing I/O for much longer than the duration of weight | |
324 | * raising. These applications have basically no benefit from being | |
325 | * weight-raised at the beginning of their I/O. On the opposite end, | |
326 | * while being weight-raised, these applications | |
327 | * a) unjustly steal throughput to applications that may actually need | |
328 | * low latency; | |
329 | * b) make BFQ uselessly perform device idling; device idling results | |
330 | * in loss of device throughput with most flash-based storage, and may | |
331 | * increase latencies when used purposelessly. | |
332 | * | |
333 | * BFQ tries to reduce these problems, by adopting the following | |
334 | * countermeasure. To introduce this countermeasure, we need first to | |
335 | * finish explaining how the duration of weight-raising for | |
336 | * interactive tasks is computed. | |
337 | * | |
338 | * For a bfq_queue deemed as interactive, the duration of weight | |
339 | * raising is dynamically adjusted, as a function of the estimated | |
340 | * peak rate of the device, so as to be equal to the time needed to | |
341 | * execute the 'largest' interactive task we benchmarked so far. By | |
342 | * largest task, we mean the task for which each involved process has | |
343 | * to do more I/O than for any of the other tasks we benchmarked. This | |
344 | * reference interactive task is the start-up of LibreOffice Writer, | |
345 | * and in this task each process/bfq_queue needs to have at most ~110K | |
346 | * sectors transferred. | |
347 | * | |
348 | * This last piece of information enables BFQ to reduce the actual | |
349 | * duration of weight-raising for at least one class of I/O-bound | |
350 | * applications: those doing sequential or quasi-sequential I/O. An | |
351 | * example is file copy. In fact, once started, the main I/O-bound | |
352 | * processes of these applications usually consume the above 110K | |
353 | * sectors in much less time than the processes of an application that | |
354 | * is starting, because these I/O-bound processes will greedily devote | |
355 | * almost all their CPU cycles only to their target, | |
356 | * throughput-friendly I/O operations. This is even more true if BFQ | |
357 | * happens to be underestimating the device peak rate, and thus | |
358 | * overestimating the duration of weight raising. But, according to | |
359 | * our measurements, once transferred 110K sectors, these processes | |
360 | * have no right to be weight-raised any longer. | |
361 | * | |
362 | * Basing on the last consideration, BFQ ends weight-raising for a | |
363 | * bfq_queue if the latter happens to have received an amount of | |
364 | * service at least equal to the following constant. The constant is | |
365 | * set to slightly more than 110K, to have a minimum safety margin. | |
366 | * | |
367 | * This early ending of weight-raising reduces the amount of time | |
368 | * during which interactive false positives cause the two problems | |
369 | * described at the beginning of these comments. | |
370 | */ | |
371 | static const unsigned long max_service_from_wr = 120000; | |
372 | ||
12cd3a2f | 373 | #define RQ_BIC(rq) icq_to_bic((rq)->elv.priv[0]) |
ea25da48 | 374 | #define RQ_BFQQ(rq) ((rq)->elv.priv[1]) |
aee69d78 | 375 | |
ea25da48 | 376 | struct bfq_queue *bic_to_bfqq(struct bfq_io_cq *bic, bool is_sync) |
e21b7a0b | 377 | { |
ea25da48 | 378 | return bic->bfqq[is_sync]; |
aee69d78 PV |
379 | } |
380 | ||
ea25da48 | 381 | void bic_set_bfqq(struct bfq_io_cq *bic, struct bfq_queue *bfqq, bool is_sync) |
aee69d78 | 382 | { |
ea25da48 | 383 | bic->bfqq[is_sync] = bfqq; |
aee69d78 PV |
384 | } |
385 | ||
ea25da48 | 386 | struct bfq_data *bic_to_bfqd(struct bfq_io_cq *bic) |
aee69d78 | 387 | { |
ea25da48 | 388 | return bic->icq.q->elevator->elevator_data; |
e21b7a0b | 389 | } |
aee69d78 | 390 | |
ea25da48 PV |
391 | /** |
392 | * icq_to_bic - convert iocontext queue structure to bfq_io_cq. | |
393 | * @icq: the iocontext queue. | |
394 | */ | |
395 | static struct bfq_io_cq *icq_to_bic(struct io_cq *icq) | |
e21b7a0b | 396 | { |
ea25da48 PV |
397 | /* bic->icq is the first member, %NULL will convert to %NULL */ |
398 | return container_of(icq, struct bfq_io_cq, icq); | |
e21b7a0b | 399 | } |
aee69d78 | 400 | |
ea25da48 PV |
401 | /** |
402 | * bfq_bic_lookup - search into @ioc a bic associated to @bfqd. | |
403 | * @bfqd: the lookup key. | |
404 | * @ioc: the io_context of the process doing I/O. | |
405 | * @q: the request queue. | |
406 | */ | |
407 | static struct bfq_io_cq *bfq_bic_lookup(struct bfq_data *bfqd, | |
408 | struct io_context *ioc, | |
409 | struct request_queue *q) | |
e21b7a0b | 410 | { |
ea25da48 PV |
411 | if (ioc) { |
412 | unsigned long flags; | |
413 | struct bfq_io_cq *icq; | |
aee69d78 | 414 | |
0d945c1f | 415 | spin_lock_irqsave(&q->queue_lock, flags); |
ea25da48 | 416 | icq = icq_to_bic(ioc_lookup_icq(ioc, q)); |
0d945c1f | 417 | spin_unlock_irqrestore(&q->queue_lock, flags); |
aee69d78 | 418 | |
ea25da48 | 419 | return icq; |
e21b7a0b | 420 | } |
e21b7a0b | 421 | |
ea25da48 | 422 | return NULL; |
aee69d78 PV |
423 | } |
424 | ||
ea25da48 PV |
425 | /* |
426 | * Scheduler run of queue, if there are requests pending and no one in the | |
427 | * driver that will restart queueing. | |
428 | */ | |
429 | void bfq_schedule_dispatch(struct bfq_data *bfqd) | |
aee69d78 | 430 | { |
ea25da48 PV |
431 | if (bfqd->queued != 0) { |
432 | bfq_log(bfqd, "schedule dispatch"); | |
433 | blk_mq_run_hw_queues(bfqd->queue, true); | |
e21b7a0b | 434 | } |
aee69d78 PV |
435 | } |
436 | ||
437 | #define bfq_class_idle(bfqq) ((bfqq)->ioprio_class == IOPRIO_CLASS_IDLE) | |
438 | #define bfq_class_rt(bfqq) ((bfqq)->ioprio_class == IOPRIO_CLASS_RT) | |
439 | ||
440 | #define bfq_sample_valid(samples) ((samples) > 80) | |
441 | ||
aee69d78 PV |
442 | /* |
443 | * Lifted from AS - choose which of rq1 and rq2 that is best served now. | |
444 | * We choose the request that is closesr to the head right now. Distance | |
445 | * behind the head is penalized and only allowed to a certain extent. | |
446 | */ | |
447 | static struct request *bfq_choose_req(struct bfq_data *bfqd, | |
448 | struct request *rq1, | |
449 | struct request *rq2, | |
450 | sector_t last) | |
451 | { | |
452 | sector_t s1, s2, d1 = 0, d2 = 0; | |
453 | unsigned long back_max; | |
454 | #define BFQ_RQ1_WRAP 0x01 /* request 1 wraps */ | |
455 | #define BFQ_RQ2_WRAP 0x02 /* request 2 wraps */ | |
456 | unsigned int wrap = 0; /* bit mask: requests behind the disk head? */ | |
457 | ||
458 | if (!rq1 || rq1 == rq2) | |
459 | return rq2; | |
460 | if (!rq2) | |
461 | return rq1; | |
462 | ||
463 | if (rq_is_sync(rq1) && !rq_is_sync(rq2)) | |
464 | return rq1; | |
465 | else if (rq_is_sync(rq2) && !rq_is_sync(rq1)) | |
466 | return rq2; | |
467 | if ((rq1->cmd_flags & REQ_META) && !(rq2->cmd_flags & REQ_META)) | |
468 | return rq1; | |
469 | else if ((rq2->cmd_flags & REQ_META) && !(rq1->cmd_flags & REQ_META)) | |
470 | return rq2; | |
471 | ||
472 | s1 = blk_rq_pos(rq1); | |
473 | s2 = blk_rq_pos(rq2); | |
474 | ||
475 | /* | |
476 | * By definition, 1KiB is 2 sectors. | |
477 | */ | |
478 | back_max = bfqd->bfq_back_max * 2; | |
479 | ||
480 | /* | |
481 | * Strict one way elevator _except_ in the case where we allow | |
482 | * short backward seeks which are biased as twice the cost of a | |
483 | * similar forward seek. | |
484 | */ | |
485 | if (s1 >= last) | |
486 | d1 = s1 - last; | |
487 | else if (s1 + back_max >= last) | |
488 | d1 = (last - s1) * bfqd->bfq_back_penalty; | |
489 | else | |
490 | wrap |= BFQ_RQ1_WRAP; | |
491 | ||
492 | if (s2 >= last) | |
493 | d2 = s2 - last; | |
494 | else if (s2 + back_max >= last) | |
495 | d2 = (last - s2) * bfqd->bfq_back_penalty; | |
496 | else | |
497 | wrap |= BFQ_RQ2_WRAP; | |
498 | ||
499 | /* Found required data */ | |
500 | ||
501 | /* | |
502 | * By doing switch() on the bit mask "wrap" we avoid having to | |
503 | * check two variables for all permutations: --> faster! | |
504 | */ | |
505 | switch (wrap) { | |
506 | case 0: /* common case for CFQ: rq1 and rq2 not wrapped */ | |
507 | if (d1 < d2) | |
508 | return rq1; | |
509 | else if (d2 < d1) | |
510 | return rq2; | |
511 | ||
512 | if (s1 >= s2) | |
513 | return rq1; | |
514 | else | |
515 | return rq2; | |
516 | ||
517 | case BFQ_RQ2_WRAP: | |
518 | return rq1; | |
519 | case BFQ_RQ1_WRAP: | |
520 | return rq2; | |
521 | case BFQ_RQ1_WRAP|BFQ_RQ2_WRAP: /* both rqs wrapped */ | |
522 | default: | |
523 | /* | |
524 | * Since both rqs are wrapped, | |
525 | * start with the one that's further behind head | |
526 | * (--> only *one* back seek required), | |
527 | * since back seek takes more time than forward. | |
528 | */ | |
529 | if (s1 <= s2) | |
530 | return rq1; | |
531 | else | |
532 | return rq2; | |
533 | } | |
534 | } | |
535 | ||
a52a69ea PV |
536 | /* |
537 | * Async I/O can easily starve sync I/O (both sync reads and sync | |
538 | * writes), by consuming all tags. Similarly, storms of sync writes, | |
539 | * such as those that sync(2) may trigger, can starve sync reads. | |
540 | * Limit depths of async I/O and sync writes so as to counter both | |
541 | * problems. | |
542 | */ | |
543 | static void bfq_limit_depth(unsigned int op, struct blk_mq_alloc_data *data) | |
544 | { | |
a52a69ea | 545 | struct bfq_data *bfqd = data->q->elevator->elevator_data; |
a52a69ea PV |
546 | |
547 | if (op_is_sync(op) && !op_is_write(op)) | |
548 | return; | |
549 | ||
a52a69ea PV |
550 | data->shallow_depth = |
551 | bfqd->word_depths[!!bfqd->wr_busy_queues][op_is_sync(op)]; | |
552 | ||
553 | bfq_log(bfqd, "[%s] wr_busy %d sync %d depth %u", | |
554 | __func__, bfqd->wr_busy_queues, op_is_sync(op), | |
555 | data->shallow_depth); | |
556 | } | |
557 | ||
36eca894 AA |
558 | static struct bfq_queue * |
559 | bfq_rq_pos_tree_lookup(struct bfq_data *bfqd, struct rb_root *root, | |
560 | sector_t sector, struct rb_node **ret_parent, | |
561 | struct rb_node ***rb_link) | |
562 | { | |
563 | struct rb_node **p, *parent; | |
564 | struct bfq_queue *bfqq = NULL; | |
565 | ||
566 | parent = NULL; | |
567 | p = &root->rb_node; | |
568 | while (*p) { | |
569 | struct rb_node **n; | |
570 | ||
571 | parent = *p; | |
572 | bfqq = rb_entry(parent, struct bfq_queue, pos_node); | |
573 | ||
574 | /* | |
575 | * Sort strictly based on sector. Smallest to the left, | |
576 | * largest to the right. | |
577 | */ | |
578 | if (sector > blk_rq_pos(bfqq->next_rq)) | |
579 | n = &(*p)->rb_right; | |
580 | else if (sector < blk_rq_pos(bfqq->next_rq)) | |
581 | n = &(*p)->rb_left; | |
582 | else | |
583 | break; | |
584 | p = n; | |
585 | bfqq = NULL; | |
586 | } | |
587 | ||
588 | *ret_parent = parent; | |
589 | if (rb_link) | |
590 | *rb_link = p; | |
591 | ||
592 | bfq_log(bfqd, "rq_pos_tree_lookup %llu: returning %d", | |
593 | (unsigned long long)sector, | |
594 | bfqq ? bfqq->pid : 0); | |
595 | ||
596 | return bfqq; | |
597 | } | |
598 | ||
7b8fa3b9 PV |
599 | static bool bfq_too_late_for_merging(struct bfq_queue *bfqq) |
600 | { | |
601 | return bfqq->service_from_backlogged > 0 && | |
602 | time_is_before_jiffies(bfqq->first_IO_time + | |
603 | bfq_merge_time_limit); | |
604 | } | |
605 | ||
8cacc5ab PV |
606 | /* |
607 | * The following function is not marked as __cold because it is | |
608 | * actually cold, but for the same performance goal described in the | |
609 | * comments on the likely() at the beginning of | |
610 | * bfq_setup_cooperator(). Unexpectedly, to reach an even lower | |
611 | * execution time for the case where this function is not invoked, we | |
612 | * had to add an unlikely() in each involved if(). | |
613 | */ | |
614 | void __cold | |
615 | bfq_pos_tree_add_move(struct bfq_data *bfqd, struct bfq_queue *bfqq) | |
36eca894 AA |
616 | { |
617 | struct rb_node **p, *parent; | |
618 | struct bfq_queue *__bfqq; | |
619 | ||
620 | if (bfqq->pos_root) { | |
621 | rb_erase(&bfqq->pos_node, bfqq->pos_root); | |
622 | bfqq->pos_root = NULL; | |
623 | } | |
624 | ||
7b8fa3b9 PV |
625 | /* |
626 | * bfqq cannot be merged any longer (see comments in | |
627 | * bfq_setup_cooperator): no point in adding bfqq into the | |
628 | * position tree. | |
629 | */ | |
630 | if (bfq_too_late_for_merging(bfqq)) | |
631 | return; | |
632 | ||
36eca894 AA |
633 | if (bfq_class_idle(bfqq)) |
634 | return; | |
635 | if (!bfqq->next_rq) | |
636 | return; | |
637 | ||
638 | bfqq->pos_root = &bfq_bfqq_to_bfqg(bfqq)->rq_pos_tree; | |
639 | __bfqq = bfq_rq_pos_tree_lookup(bfqd, bfqq->pos_root, | |
640 | blk_rq_pos(bfqq->next_rq), &parent, &p); | |
641 | if (!__bfqq) { | |
642 | rb_link_node(&bfqq->pos_node, parent, p); | |
643 | rb_insert_color(&bfqq->pos_node, bfqq->pos_root); | |
644 | } else | |
645 | bfqq->pos_root = NULL; | |
646 | } | |
647 | ||
1de0c4cd | 648 | /* |
fb53ac6c PV |
649 | * The following function returns false either if every active queue |
650 | * must receive the same share of the throughput (symmetric scenario), | |
651 | * or, as a special case, if bfqq must receive a share of the | |
652 | * throughput lower than or equal to the share that every other active | |
653 | * queue must receive. If bfqq does sync I/O, then these are the only | |
654 | * two cases where bfqq happens to be guaranteed its share of the | |
655 | * throughput even if I/O dispatching is not plugged when bfqq remains | |
656 | * temporarily empty (for more details, see the comments in the | |
657 | * function bfq_better_to_idle()). For this reason, the return value | |
658 | * of this function is used to check whether I/O-dispatch plugging can | |
659 | * be avoided. | |
1de0c4cd | 660 | * |
fb53ac6c | 661 | * The above first case (symmetric scenario) occurs when: |
1de0c4cd | 662 | * 1) all active queues have the same weight, |
73d58118 | 663 | * 2) all active queues belong to the same I/O-priority class, |
1de0c4cd | 664 | * 3) all active groups at the same level in the groups tree have the same |
73d58118 PV |
665 | * weight, |
666 | * 4) all active groups at the same level in the groups tree have the same | |
1de0c4cd AA |
667 | * number of children. |
668 | * | |
2d29c9f8 FM |
669 | * Unfortunately, keeping the necessary state for evaluating exactly |
670 | * the last two symmetry sub-conditions above would be quite complex | |
73d58118 PV |
671 | * and time consuming. Therefore this function evaluates, instead, |
672 | * only the following stronger three sub-conditions, for which it is | |
2d29c9f8 | 673 | * much easier to maintain the needed state: |
1de0c4cd | 674 | * 1) all active queues have the same weight, |
73d58118 PV |
675 | * 2) all active queues belong to the same I/O-priority class, |
676 | * 3) there are no active groups. | |
2d29c9f8 FM |
677 | * In particular, the last condition is always true if hierarchical |
678 | * support or the cgroups interface are not enabled, thus no state | |
679 | * needs to be maintained in this case. | |
1de0c4cd | 680 | */ |
fb53ac6c PV |
681 | static bool bfq_asymmetric_scenario(struct bfq_data *bfqd, |
682 | struct bfq_queue *bfqq) | |
1de0c4cd | 683 | { |
fb53ac6c PV |
684 | bool smallest_weight = bfqq && |
685 | bfqq->weight_counter && | |
686 | bfqq->weight_counter == | |
687 | container_of( | |
688 | rb_first_cached(&bfqd->queue_weights_tree), | |
689 | struct bfq_weight_counter, | |
690 | weights_node); | |
691 | ||
73d58118 PV |
692 | /* |
693 | * For queue weights to differ, queue_weights_tree must contain | |
694 | * at least two nodes. | |
695 | */ | |
fb53ac6c PV |
696 | bool varied_queue_weights = !smallest_weight && |
697 | !RB_EMPTY_ROOT(&bfqd->queue_weights_tree.rb_root) && | |
698 | (bfqd->queue_weights_tree.rb_root.rb_node->rb_left || | |
699 | bfqd->queue_weights_tree.rb_root.rb_node->rb_right); | |
73d58118 PV |
700 | |
701 | bool multiple_classes_busy = | |
702 | (bfqd->busy_queues[0] && bfqd->busy_queues[1]) || | |
703 | (bfqd->busy_queues[0] && bfqd->busy_queues[2]) || | |
704 | (bfqd->busy_queues[1] && bfqd->busy_queues[2]); | |
705 | ||
fb53ac6c | 706 | return varied_queue_weights || multiple_classes_busy |
42b1bd33 | 707 | #ifdef CONFIG_BFQ_GROUP_IOSCHED |
73d58118 PV |
708 | || bfqd->num_groups_with_pending_reqs > 0 |
709 | #endif | |
fb53ac6c | 710 | ; |
1de0c4cd AA |
711 | } |
712 | ||
713 | /* | |
714 | * If the weight-counter tree passed as input contains no counter for | |
2d29c9f8 | 715 | * the weight of the input queue, then add that counter; otherwise just |
1de0c4cd AA |
716 | * increment the existing counter. |
717 | * | |
718 | * Note that weight-counter trees contain few nodes in mostly symmetric | |
719 | * scenarios. For example, if all queues have the same weight, then the | |
720 | * weight-counter tree for the queues may contain at most one node. | |
721 | * This holds even if low_latency is on, because weight-raised queues | |
722 | * are not inserted in the tree. | |
723 | * In most scenarios, the rate at which nodes are created/destroyed | |
724 | * should be low too. | |
725 | */ | |
2d29c9f8 | 726 | void bfq_weights_tree_add(struct bfq_data *bfqd, struct bfq_queue *bfqq, |
fb53ac6c | 727 | struct rb_root_cached *root) |
1de0c4cd | 728 | { |
2d29c9f8 | 729 | struct bfq_entity *entity = &bfqq->entity; |
fb53ac6c PV |
730 | struct rb_node **new = &(root->rb_root.rb_node), *parent = NULL; |
731 | bool leftmost = true; | |
1de0c4cd AA |
732 | |
733 | /* | |
2d29c9f8 | 734 | * Do not insert if the queue is already associated with a |
1de0c4cd | 735 | * counter, which happens if: |
2d29c9f8 | 736 | * 1) a request arrival has caused the queue to become both |
1de0c4cd AA |
737 | * non-weight-raised, and hence change its weight, and |
738 | * backlogged; in this respect, each of the two events | |
739 | * causes an invocation of this function, | |
2d29c9f8 | 740 | * 2) this is the invocation of this function caused by the |
1de0c4cd AA |
741 | * second event. This second invocation is actually useless, |
742 | * and we handle this fact by exiting immediately. More | |
743 | * efficient or clearer solutions might possibly be adopted. | |
744 | */ | |
2d29c9f8 | 745 | if (bfqq->weight_counter) |
1de0c4cd AA |
746 | return; |
747 | ||
748 | while (*new) { | |
749 | struct bfq_weight_counter *__counter = container_of(*new, | |
750 | struct bfq_weight_counter, | |
751 | weights_node); | |
752 | parent = *new; | |
753 | ||
754 | if (entity->weight == __counter->weight) { | |
2d29c9f8 | 755 | bfqq->weight_counter = __counter; |
1de0c4cd AA |
756 | goto inc_counter; |
757 | } | |
758 | if (entity->weight < __counter->weight) | |
759 | new = &((*new)->rb_left); | |
fb53ac6c | 760 | else { |
1de0c4cd | 761 | new = &((*new)->rb_right); |
fb53ac6c PV |
762 | leftmost = false; |
763 | } | |
1de0c4cd AA |
764 | } |
765 | ||
2d29c9f8 FM |
766 | bfqq->weight_counter = kzalloc(sizeof(struct bfq_weight_counter), |
767 | GFP_ATOMIC); | |
1de0c4cd AA |
768 | |
769 | /* | |
770 | * In the unlucky event of an allocation failure, we just | |
2d29c9f8 | 771 | * exit. This will cause the weight of queue to not be |
fb53ac6c | 772 | * considered in bfq_asymmetric_scenario, which, in its turn, |
73d58118 PV |
773 | * causes the scenario to be deemed wrongly symmetric in case |
774 | * bfqq's weight would have been the only weight making the | |
775 | * scenario asymmetric. On the bright side, no unbalance will | |
776 | * however occur when bfqq becomes inactive again (the | |
777 | * invocation of this function is triggered by an activation | |
778 | * of queue). In fact, bfq_weights_tree_remove does nothing | |
779 | * if !bfqq->weight_counter. | |
1de0c4cd | 780 | */ |
2d29c9f8 | 781 | if (unlikely(!bfqq->weight_counter)) |
1de0c4cd AA |
782 | return; |
783 | ||
2d29c9f8 FM |
784 | bfqq->weight_counter->weight = entity->weight; |
785 | rb_link_node(&bfqq->weight_counter->weights_node, parent, new); | |
fb53ac6c PV |
786 | rb_insert_color_cached(&bfqq->weight_counter->weights_node, root, |
787 | leftmost); | |
1de0c4cd AA |
788 | |
789 | inc_counter: | |
2d29c9f8 | 790 | bfqq->weight_counter->num_active++; |
9dee8b3b | 791 | bfqq->ref++; |
1de0c4cd AA |
792 | } |
793 | ||
794 | /* | |
2d29c9f8 | 795 | * Decrement the weight counter associated with the queue, and, if the |
1de0c4cd AA |
796 | * counter reaches 0, remove the counter from the tree. |
797 | * See the comments to the function bfq_weights_tree_add() for considerations | |
798 | * about overhead. | |
799 | */ | |
0471559c | 800 | void __bfq_weights_tree_remove(struct bfq_data *bfqd, |
2d29c9f8 | 801 | struct bfq_queue *bfqq, |
fb53ac6c | 802 | struct rb_root_cached *root) |
1de0c4cd | 803 | { |
2d29c9f8 | 804 | if (!bfqq->weight_counter) |
1de0c4cd AA |
805 | return; |
806 | ||
2d29c9f8 FM |
807 | bfqq->weight_counter->num_active--; |
808 | if (bfqq->weight_counter->num_active > 0) | |
1de0c4cd AA |
809 | goto reset_entity_pointer; |
810 | ||
fb53ac6c | 811 | rb_erase_cached(&bfqq->weight_counter->weights_node, root); |
2d29c9f8 | 812 | kfree(bfqq->weight_counter); |
1de0c4cd AA |
813 | |
814 | reset_entity_pointer: | |
2d29c9f8 | 815 | bfqq->weight_counter = NULL; |
9dee8b3b | 816 | bfq_put_queue(bfqq); |
1de0c4cd AA |
817 | } |
818 | ||
0471559c | 819 | /* |
2d29c9f8 FM |
820 | * Invoke __bfq_weights_tree_remove on bfqq and decrement the number |
821 | * of active groups for each queue's inactive parent entity. | |
0471559c PV |
822 | */ |
823 | void bfq_weights_tree_remove(struct bfq_data *bfqd, | |
824 | struct bfq_queue *bfqq) | |
825 | { | |
826 | struct bfq_entity *entity = bfqq->entity.parent; | |
827 | ||
0471559c PV |
828 | for_each_entity(entity) { |
829 | struct bfq_sched_data *sd = entity->my_sched_data; | |
830 | ||
831 | if (sd->next_in_service || sd->in_service_entity) { | |
832 | /* | |
833 | * entity is still active, because either | |
834 | * next_in_service or in_service_entity is not | |
835 | * NULL (see the comments on the definition of | |
836 | * next_in_service for details on why | |
837 | * in_service_entity must be checked too). | |
838 | * | |
2d29c9f8 FM |
839 | * As a consequence, its parent entities are |
840 | * active as well, and thus this loop must | |
841 | * stop here. | |
0471559c PV |
842 | */ |
843 | break; | |
844 | } | |
ba7aeae5 PV |
845 | |
846 | /* | |
847 | * The decrement of num_groups_with_pending_reqs is | |
848 | * not performed immediately upon the deactivation of | |
849 | * entity, but it is delayed to when it also happens | |
850 | * that the first leaf descendant bfqq of entity gets | |
851 | * all its pending requests completed. The following | |
852 | * instructions perform this delayed decrement, if | |
853 | * needed. See the comments on | |
854 | * num_groups_with_pending_reqs for details. | |
855 | */ | |
856 | if (entity->in_groups_with_pending_reqs) { | |
857 | entity->in_groups_with_pending_reqs = false; | |
858 | bfqd->num_groups_with_pending_reqs--; | |
859 | } | |
0471559c | 860 | } |
9dee8b3b PV |
861 | |
862 | /* | |
863 | * Next function is invoked last, because it causes bfqq to be | |
864 | * freed if the following holds: bfqq is not in service and | |
865 | * has no dispatched request. DO NOT use bfqq after the next | |
866 | * function invocation. | |
867 | */ | |
868 | __bfq_weights_tree_remove(bfqd, bfqq, | |
869 | &bfqd->queue_weights_tree); | |
0471559c PV |
870 | } |
871 | ||
aee69d78 PV |
872 | /* |
873 | * Return expired entry, or NULL to just start from scratch in rbtree. | |
874 | */ | |
875 | static struct request *bfq_check_fifo(struct bfq_queue *bfqq, | |
876 | struct request *last) | |
877 | { | |
878 | struct request *rq; | |
879 | ||
880 | if (bfq_bfqq_fifo_expire(bfqq)) | |
881 | return NULL; | |
882 | ||
883 | bfq_mark_bfqq_fifo_expire(bfqq); | |
884 | ||
885 | rq = rq_entry_fifo(bfqq->fifo.next); | |
886 | ||
887 | if (rq == last || ktime_get_ns() < rq->fifo_time) | |
888 | return NULL; | |
889 | ||
890 | bfq_log_bfqq(bfqq->bfqd, bfqq, "check_fifo: returned %p", rq); | |
891 | return rq; | |
892 | } | |
893 | ||
894 | static struct request *bfq_find_next_rq(struct bfq_data *bfqd, | |
895 | struct bfq_queue *bfqq, | |
896 | struct request *last) | |
897 | { | |
898 | struct rb_node *rbnext = rb_next(&last->rb_node); | |
899 | struct rb_node *rbprev = rb_prev(&last->rb_node); | |
900 | struct request *next, *prev = NULL; | |
901 | ||
902 | /* Follow expired path, else get first next available. */ | |
903 | next = bfq_check_fifo(bfqq, last); | |
904 | if (next) | |
905 | return next; | |
906 | ||
907 | if (rbprev) | |
908 | prev = rb_entry_rq(rbprev); | |
909 | ||
910 | if (rbnext) | |
911 | next = rb_entry_rq(rbnext); | |
912 | else { | |
913 | rbnext = rb_first(&bfqq->sort_list); | |
914 | if (rbnext && rbnext != &last->rb_node) | |
915 | next = rb_entry_rq(rbnext); | |
916 | } | |
917 | ||
918 | return bfq_choose_req(bfqd, next, prev, blk_rq_pos(last)); | |
919 | } | |
920 | ||
c074170e | 921 | /* see the definition of bfq_async_charge_factor for details */ |
aee69d78 PV |
922 | static unsigned long bfq_serv_to_charge(struct request *rq, |
923 | struct bfq_queue *bfqq) | |
924 | { | |
02a6d787 | 925 | if (bfq_bfqq_sync(bfqq) || bfqq->wr_coeff > 1 || |
fb53ac6c | 926 | bfq_asymmetric_scenario(bfqq->bfqd, bfqq)) |
c074170e PV |
927 | return blk_rq_sectors(rq); |
928 | ||
d5801088 | 929 | return blk_rq_sectors(rq) * bfq_async_charge_factor; |
aee69d78 PV |
930 | } |
931 | ||
932 | /** | |
933 | * bfq_updated_next_req - update the queue after a new next_rq selection. | |
934 | * @bfqd: the device data the queue belongs to. | |
935 | * @bfqq: the queue to update. | |
936 | * | |
937 | * If the first request of a queue changes we make sure that the queue | |
938 | * has enough budget to serve at least its first request (if the | |
939 | * request has grown). We do this because if the queue has not enough | |
940 | * budget for its first request, it has to go through two dispatch | |
941 | * rounds to actually get it dispatched. | |
942 | */ | |
943 | static void bfq_updated_next_req(struct bfq_data *bfqd, | |
944 | struct bfq_queue *bfqq) | |
945 | { | |
946 | struct bfq_entity *entity = &bfqq->entity; | |
947 | struct request *next_rq = bfqq->next_rq; | |
948 | unsigned long new_budget; | |
949 | ||
950 | if (!next_rq) | |
951 | return; | |
952 | ||
953 | if (bfqq == bfqd->in_service_queue) | |
954 | /* | |
955 | * In order not to break guarantees, budgets cannot be | |
956 | * changed after an entity has been selected. | |
957 | */ | |
958 | return; | |
959 | ||
f3218ad8 PV |
960 | new_budget = max_t(unsigned long, |
961 | max_t(unsigned long, bfqq->max_budget, | |
962 | bfq_serv_to_charge(next_rq, bfqq)), | |
963 | entity->service); | |
aee69d78 PV |
964 | if (entity->budget != new_budget) { |
965 | entity->budget = new_budget; | |
966 | bfq_log_bfqq(bfqd, bfqq, "updated next rq: new budget %lu", | |
967 | new_budget); | |
80294c3b | 968 | bfq_requeue_bfqq(bfqd, bfqq, false); |
aee69d78 PV |
969 | } |
970 | } | |
971 | ||
3e2bdd6d PV |
972 | static unsigned int bfq_wr_duration(struct bfq_data *bfqd) |
973 | { | |
974 | u64 dur; | |
975 | ||
976 | if (bfqd->bfq_wr_max_time > 0) | |
977 | return bfqd->bfq_wr_max_time; | |
978 | ||
e24f1c24 | 979 | dur = bfqd->rate_dur_prod; |
3e2bdd6d PV |
980 | do_div(dur, bfqd->peak_rate); |
981 | ||
982 | /* | |
d450542e DS |
983 | * Limit duration between 3 and 25 seconds. The upper limit |
984 | * has been conservatively set after the following worst case: | |
985 | * on a QEMU/KVM virtual machine | |
986 | * - running in a slow PC | |
987 | * - with a virtual disk stacked on a slow low-end 5400rpm HDD | |
988 | * - serving a heavy I/O workload, such as the sequential reading | |
989 | * of several files | |
990 | * mplayer took 23 seconds to start, if constantly weight-raised. | |
991 | * | |
992 | * As for higher values than that accomodating the above bad | |
993 | * scenario, tests show that higher values would often yield | |
994 | * the opposite of the desired result, i.e., would worsen | |
995 | * responsiveness by allowing non-interactive applications to | |
996 | * preserve weight raising for too long. | |
3e2bdd6d PV |
997 | * |
998 | * On the other end, lower values than 3 seconds make it | |
999 | * difficult for most interactive tasks to complete their jobs | |
1000 | * before weight-raising finishes. | |
1001 | */ | |
d450542e | 1002 | return clamp_val(dur, msecs_to_jiffies(3000), msecs_to_jiffies(25000)); |
3e2bdd6d PV |
1003 | } |
1004 | ||
1005 | /* switch back from soft real-time to interactive weight raising */ | |
1006 | static void switch_back_to_interactive_wr(struct bfq_queue *bfqq, | |
1007 | struct bfq_data *bfqd) | |
1008 | { | |
1009 | bfqq->wr_coeff = bfqd->bfq_wr_coeff; | |
1010 | bfqq->wr_cur_max_time = bfq_wr_duration(bfqd); | |
1011 | bfqq->last_wr_start_finish = bfqq->wr_start_at_switch_to_srt; | |
1012 | } | |
1013 | ||
36eca894 | 1014 | static void |
13c931bd PV |
1015 | bfq_bfqq_resume_state(struct bfq_queue *bfqq, struct bfq_data *bfqd, |
1016 | struct bfq_io_cq *bic, bool bfq_already_existing) | |
36eca894 | 1017 | { |
13c931bd PV |
1018 | unsigned int old_wr_coeff = bfqq->wr_coeff; |
1019 | bool busy = bfq_already_existing && bfq_bfqq_busy(bfqq); | |
1020 | ||
d5be3fef PV |
1021 | if (bic->saved_has_short_ttime) |
1022 | bfq_mark_bfqq_has_short_ttime(bfqq); | |
36eca894 | 1023 | else |
d5be3fef | 1024 | bfq_clear_bfqq_has_short_ttime(bfqq); |
36eca894 AA |
1025 | |
1026 | if (bic->saved_IO_bound) | |
1027 | bfq_mark_bfqq_IO_bound(bfqq); | |
1028 | else | |
1029 | bfq_clear_bfqq_IO_bound(bfqq); | |
1030 | ||
1031 | bfqq->ttime = bic->saved_ttime; | |
1032 | bfqq->wr_coeff = bic->saved_wr_coeff; | |
1033 | bfqq->wr_start_at_switch_to_srt = bic->saved_wr_start_at_switch_to_srt; | |
1034 | bfqq->last_wr_start_finish = bic->saved_last_wr_start_finish; | |
1035 | bfqq->wr_cur_max_time = bic->saved_wr_cur_max_time; | |
1036 | ||
e1b2324d | 1037 | if (bfqq->wr_coeff > 1 && (bfq_bfqq_in_large_burst(bfqq) || |
36eca894 | 1038 | time_is_before_jiffies(bfqq->last_wr_start_finish + |
e1b2324d | 1039 | bfqq->wr_cur_max_time))) { |
3e2bdd6d PV |
1040 | if (bfqq->wr_cur_max_time == bfqd->bfq_wr_rt_max_time && |
1041 | !bfq_bfqq_in_large_burst(bfqq) && | |
1042 | time_is_after_eq_jiffies(bfqq->wr_start_at_switch_to_srt + | |
1043 | bfq_wr_duration(bfqd))) { | |
1044 | switch_back_to_interactive_wr(bfqq, bfqd); | |
1045 | } else { | |
1046 | bfqq->wr_coeff = 1; | |
1047 | bfq_log_bfqq(bfqq->bfqd, bfqq, | |
1048 | "resume state: switching off wr"); | |
1049 | } | |
36eca894 AA |
1050 | } |
1051 | ||
1052 | /* make sure weight will be updated, however we got here */ | |
1053 | bfqq->entity.prio_changed = 1; | |
13c931bd PV |
1054 | |
1055 | if (likely(!busy)) | |
1056 | return; | |
1057 | ||
1058 | if (old_wr_coeff == 1 && bfqq->wr_coeff > 1) | |
1059 | bfqd->wr_busy_queues++; | |
1060 | else if (old_wr_coeff > 1 && bfqq->wr_coeff == 1) | |
1061 | bfqd->wr_busy_queues--; | |
36eca894 AA |
1062 | } |
1063 | ||
1064 | static int bfqq_process_refs(struct bfq_queue *bfqq) | |
1065 | { | |
9dee8b3b PV |
1066 | return bfqq->ref - bfqq->allocated - bfqq->entity.on_st - |
1067 | (bfqq->weight_counter != NULL); | |
36eca894 AA |
1068 | } |
1069 | ||
e1b2324d AA |
1070 | /* Empty burst list and add just bfqq (see comments on bfq_handle_burst) */ |
1071 | static void bfq_reset_burst_list(struct bfq_data *bfqd, struct bfq_queue *bfqq) | |
1072 | { | |
1073 | struct bfq_queue *item; | |
1074 | struct hlist_node *n; | |
1075 | ||
1076 | hlist_for_each_entry_safe(item, n, &bfqd->burst_list, burst_list_node) | |
1077 | hlist_del_init(&item->burst_list_node); | |
1078 | hlist_add_head(&bfqq->burst_list_node, &bfqd->burst_list); | |
1079 | bfqd->burst_size = 1; | |
1080 | bfqd->burst_parent_entity = bfqq->entity.parent; | |
1081 | } | |
1082 | ||
1083 | /* Add bfqq to the list of queues in current burst (see bfq_handle_burst) */ | |
1084 | static void bfq_add_to_burst(struct bfq_data *bfqd, struct bfq_queue *bfqq) | |
1085 | { | |
1086 | /* Increment burst size to take into account also bfqq */ | |
1087 | bfqd->burst_size++; | |
1088 | ||
1089 | if (bfqd->burst_size == bfqd->bfq_large_burst_thresh) { | |
1090 | struct bfq_queue *pos, *bfqq_item; | |
1091 | struct hlist_node *n; | |
1092 | ||
1093 | /* | |
1094 | * Enough queues have been activated shortly after each | |
1095 | * other to consider this burst as large. | |
1096 | */ | |
1097 | bfqd->large_burst = true; | |
1098 | ||
1099 | /* | |
1100 | * We can now mark all queues in the burst list as | |
1101 | * belonging to a large burst. | |
1102 | */ | |
1103 | hlist_for_each_entry(bfqq_item, &bfqd->burst_list, | |
1104 | burst_list_node) | |
1105 | bfq_mark_bfqq_in_large_burst(bfqq_item); | |
1106 | bfq_mark_bfqq_in_large_burst(bfqq); | |
1107 | ||
1108 | /* | |
1109 | * From now on, and until the current burst finishes, any | |
1110 | * new queue being activated shortly after the last queue | |
1111 | * was inserted in the burst can be immediately marked as | |
1112 | * belonging to a large burst. So the burst list is not | |
1113 | * needed any more. Remove it. | |
1114 | */ | |
1115 | hlist_for_each_entry_safe(pos, n, &bfqd->burst_list, | |
1116 | burst_list_node) | |
1117 | hlist_del_init(&pos->burst_list_node); | |
1118 | } else /* | |
1119 | * Burst not yet large: add bfqq to the burst list. Do | |
1120 | * not increment the ref counter for bfqq, because bfqq | |
1121 | * is removed from the burst list before freeing bfqq | |
1122 | * in put_queue. | |
1123 | */ | |
1124 | hlist_add_head(&bfqq->burst_list_node, &bfqd->burst_list); | |
1125 | } | |
1126 | ||
1127 | /* | |
1128 | * If many queues belonging to the same group happen to be created | |
1129 | * shortly after each other, then the processes associated with these | |
1130 | * queues have typically a common goal. In particular, bursts of queue | |
1131 | * creations are usually caused by services or applications that spawn | |
1132 | * many parallel threads/processes. Examples are systemd during boot, | |
1133 | * or git grep. To help these processes get their job done as soon as | |
1134 | * possible, it is usually better to not grant either weight-raising | |
1135 | * or device idling to their queues. | |
1136 | * | |
1137 | * In this comment we describe, firstly, the reasons why this fact | |
1138 | * holds, and, secondly, the next function, which implements the main | |
1139 | * steps needed to properly mark these queues so that they can then be | |
1140 | * treated in a different way. | |
1141 | * | |
1142 | * The above services or applications benefit mostly from a high | |
1143 | * throughput: the quicker the requests of the activated queues are | |
1144 | * cumulatively served, the sooner the target job of these queues gets | |
1145 | * completed. As a consequence, weight-raising any of these queues, | |
1146 | * which also implies idling the device for it, is almost always | |
1147 | * counterproductive. In most cases it just lowers throughput. | |
1148 | * | |
1149 | * On the other hand, a burst of queue creations may be caused also by | |
1150 | * the start of an application that does not consist of a lot of | |
1151 | * parallel I/O-bound threads. In fact, with a complex application, | |
1152 | * several short processes may need to be executed to start-up the | |
1153 | * application. In this respect, to start an application as quickly as | |
1154 | * possible, the best thing to do is in any case to privilege the I/O | |
1155 | * related to the application with respect to all other | |
1156 | * I/O. Therefore, the best strategy to start as quickly as possible | |
1157 | * an application that causes a burst of queue creations is to | |
1158 | * weight-raise all the queues created during the burst. This is the | |
1159 | * exact opposite of the best strategy for the other type of bursts. | |
1160 | * | |
1161 | * In the end, to take the best action for each of the two cases, the | |
1162 | * two types of bursts need to be distinguished. Fortunately, this | |
1163 | * seems relatively easy, by looking at the sizes of the bursts. In | |
1164 | * particular, we found a threshold such that only bursts with a | |
1165 | * larger size than that threshold are apparently caused by | |
1166 | * services or commands such as systemd or git grep. For brevity, | |
1167 | * hereafter we call just 'large' these bursts. BFQ *does not* | |
1168 | * weight-raise queues whose creation occurs in a large burst. In | |
1169 | * addition, for each of these queues BFQ performs or does not perform | |
1170 | * idling depending on which choice boosts the throughput more. The | |
1171 | * exact choice depends on the device and request pattern at | |
1172 | * hand. | |
1173 | * | |
1174 | * Unfortunately, false positives may occur while an interactive task | |
1175 | * is starting (e.g., an application is being started). The | |
1176 | * consequence is that the queues associated with the task do not | |
1177 | * enjoy weight raising as expected. Fortunately these false positives | |
1178 | * are very rare. They typically occur if some service happens to | |
1179 | * start doing I/O exactly when the interactive task starts. | |
1180 | * | |
1181 | * Turning back to the next function, it implements all the steps | |
1182 | * needed to detect the occurrence of a large burst and to properly | |
1183 | * mark all the queues belonging to it (so that they can then be | |
1184 | * treated in a different way). This goal is achieved by maintaining a | |
1185 | * "burst list" that holds, temporarily, the queues that belong to the | |
1186 | * burst in progress. The list is then used to mark these queues as | |
1187 | * belonging to a large burst if the burst does become large. The main | |
1188 | * steps are the following. | |
1189 | * | |
1190 | * . when the very first queue is created, the queue is inserted into the | |
1191 | * list (as it could be the first queue in a possible burst) | |
1192 | * | |
1193 | * . if the current burst has not yet become large, and a queue Q that does | |
1194 | * not yet belong to the burst is activated shortly after the last time | |
1195 | * at which a new queue entered the burst list, then the function appends | |
1196 | * Q to the burst list | |
1197 | * | |
1198 | * . if, as a consequence of the previous step, the burst size reaches | |
1199 | * the large-burst threshold, then | |
1200 | * | |
1201 | * . all the queues in the burst list are marked as belonging to a | |
1202 | * large burst | |
1203 | * | |
1204 | * . the burst list is deleted; in fact, the burst list already served | |
1205 | * its purpose (keeping temporarily track of the queues in a burst, | |
1206 | * so as to be able to mark them as belonging to a large burst in the | |
1207 | * previous sub-step), and now is not needed any more | |
1208 | * | |
1209 | * . the device enters a large-burst mode | |
1210 | * | |
1211 | * . if a queue Q that does not belong to the burst is created while | |
1212 | * the device is in large-burst mode and shortly after the last time | |
1213 | * at which a queue either entered the burst list or was marked as | |
1214 | * belonging to the current large burst, then Q is immediately marked | |
1215 | * as belonging to a large burst. | |
1216 | * | |
1217 | * . if a queue Q that does not belong to the burst is created a while | |
1218 | * later, i.e., not shortly after, than the last time at which a queue | |
1219 | * either entered the burst list or was marked as belonging to the | |
1220 | * current large burst, then the current burst is deemed as finished and: | |
1221 | * | |
1222 | * . the large-burst mode is reset if set | |
1223 | * | |
1224 | * . the burst list is emptied | |
1225 | * | |
1226 | * . Q is inserted in the burst list, as Q may be the first queue | |
1227 | * in a possible new burst (then the burst list contains just Q | |
1228 | * after this step). | |
1229 | */ | |
1230 | static void bfq_handle_burst(struct bfq_data *bfqd, struct bfq_queue *bfqq) | |
1231 | { | |
1232 | /* | |
1233 | * If bfqq is already in the burst list or is part of a large | |
1234 | * burst, or finally has just been split, then there is | |
1235 | * nothing else to do. | |
1236 | */ | |
1237 | if (!hlist_unhashed(&bfqq->burst_list_node) || | |
1238 | bfq_bfqq_in_large_burst(bfqq) || | |
1239 | time_is_after_eq_jiffies(bfqq->split_time + | |
1240 | msecs_to_jiffies(10))) | |
1241 | return; | |
1242 | ||
1243 | /* | |
1244 | * If bfqq's creation happens late enough, or bfqq belongs to | |
1245 | * a different group than the burst group, then the current | |
1246 | * burst is finished, and related data structures must be | |
1247 | * reset. | |
1248 | * | |
1249 | * In this respect, consider the special case where bfqq is | |
1250 | * the very first queue created after BFQ is selected for this | |
1251 | * device. In this case, last_ins_in_burst and | |
1252 | * burst_parent_entity are not yet significant when we get | |
1253 | * here. But it is easy to verify that, whether or not the | |
1254 | * following condition is true, bfqq will end up being | |
1255 | * inserted into the burst list. In particular the list will | |
1256 | * happen to contain only bfqq. And this is exactly what has | |
1257 | * to happen, as bfqq may be the first queue of the first | |
1258 | * burst. | |
1259 | */ | |
1260 | if (time_is_before_jiffies(bfqd->last_ins_in_burst + | |
1261 | bfqd->bfq_burst_interval) || | |
1262 | bfqq->entity.parent != bfqd->burst_parent_entity) { | |
1263 | bfqd->large_burst = false; | |
1264 | bfq_reset_burst_list(bfqd, bfqq); | |
1265 | goto end; | |
1266 | } | |
1267 | ||
1268 | /* | |
1269 | * If we get here, then bfqq is being activated shortly after the | |
1270 | * last queue. So, if the current burst is also large, we can mark | |
1271 | * bfqq as belonging to this large burst immediately. | |
1272 | */ | |
1273 | if (bfqd->large_burst) { | |
1274 | bfq_mark_bfqq_in_large_burst(bfqq); | |
1275 | goto end; | |
1276 | } | |
1277 | ||
1278 | /* | |
1279 | * If we get here, then a large-burst state has not yet been | |
1280 | * reached, but bfqq is being activated shortly after the last | |
1281 | * queue. Then we add bfqq to the burst. | |
1282 | */ | |
1283 | bfq_add_to_burst(bfqd, bfqq); | |
1284 | end: | |
1285 | /* | |
1286 | * At this point, bfqq either has been added to the current | |
1287 | * burst or has caused the current burst to terminate and a | |
1288 | * possible new burst to start. In particular, in the second | |
1289 | * case, bfqq has become the first queue in the possible new | |
1290 | * burst. In both cases last_ins_in_burst needs to be moved | |
1291 | * forward. | |
1292 | */ | |
1293 | bfqd->last_ins_in_burst = jiffies; | |
1294 | } | |
1295 | ||
aee69d78 PV |
1296 | static int bfq_bfqq_budget_left(struct bfq_queue *bfqq) |
1297 | { | |
1298 | struct bfq_entity *entity = &bfqq->entity; | |
1299 | ||
1300 | return entity->budget - entity->service; | |
1301 | } | |
1302 | ||
1303 | /* | |
1304 | * If enough samples have been computed, return the current max budget | |
1305 | * stored in bfqd, which is dynamically updated according to the | |
1306 | * estimated disk peak rate; otherwise return the default max budget | |
1307 | */ | |
1308 | static int bfq_max_budget(struct bfq_data *bfqd) | |
1309 | { | |
1310 | if (bfqd->budgets_assigned < bfq_stats_min_budgets) | |
1311 | return bfq_default_max_budget; | |
1312 | else | |
1313 | return bfqd->bfq_max_budget; | |
1314 | } | |
1315 | ||
1316 | /* | |
1317 | * Return min budget, which is a fraction of the current or default | |
1318 | * max budget (trying with 1/32) | |
1319 | */ | |
1320 | static int bfq_min_budget(struct bfq_data *bfqd) | |
1321 | { | |
1322 | if (bfqd->budgets_assigned < bfq_stats_min_budgets) | |
1323 | return bfq_default_max_budget / 32; | |
1324 | else | |
1325 | return bfqd->bfq_max_budget / 32; | |
1326 | } | |
1327 | ||
aee69d78 PV |
1328 | /* |
1329 | * The next function, invoked after the input queue bfqq switches from | |
1330 | * idle to busy, updates the budget of bfqq. The function also tells | |
1331 | * whether the in-service queue should be expired, by returning | |
1332 | * true. The purpose of expiring the in-service queue is to give bfqq | |
1333 | * the chance to possibly preempt the in-service queue, and the reason | |
44e44a1b PV |
1334 | * for preempting the in-service queue is to achieve one of the two |
1335 | * goals below. | |
aee69d78 | 1336 | * |
44e44a1b PV |
1337 | * 1. Guarantee to bfqq its reserved bandwidth even if bfqq has |
1338 | * expired because it has remained idle. In particular, bfqq may have | |
1339 | * expired for one of the following two reasons: | |
aee69d78 PV |
1340 | * |
1341 | * - BFQQE_NO_MORE_REQUESTS bfqq did not enjoy any device idling | |
1342 | * and did not make it to issue a new request before its last | |
1343 | * request was served; | |
1344 | * | |
1345 | * - BFQQE_TOO_IDLE bfqq did enjoy device idling, but did not issue | |
1346 | * a new request before the expiration of the idling-time. | |
1347 | * | |
1348 | * Even if bfqq has expired for one of the above reasons, the process | |
1349 | * associated with the queue may be however issuing requests greedily, | |
1350 | * and thus be sensitive to the bandwidth it receives (bfqq may have | |
1351 | * remained idle for other reasons: CPU high load, bfqq not enjoying | |
1352 | * idling, I/O throttling somewhere in the path from the process to | |
1353 | * the I/O scheduler, ...). But if, after every expiration for one of | |
1354 | * the above two reasons, bfqq has to wait for the service of at least | |
1355 | * one full budget of another queue before being served again, then | |
1356 | * bfqq is likely to get a much lower bandwidth or resource time than | |
1357 | * its reserved ones. To address this issue, two countermeasures need | |
1358 | * to be taken. | |
1359 | * | |
1360 | * First, the budget and the timestamps of bfqq need to be updated in | |
1361 | * a special way on bfqq reactivation: they need to be updated as if | |
1362 | * bfqq did not remain idle and did not expire. In fact, if they are | |
1363 | * computed as if bfqq expired and remained idle until reactivation, | |
1364 | * then the process associated with bfqq is treated as if, instead of | |
1365 | * being greedy, it stopped issuing requests when bfqq remained idle, | |
1366 | * and restarts issuing requests only on this reactivation. In other | |
1367 | * words, the scheduler does not help the process recover the "service | |
1368 | * hole" between bfqq expiration and reactivation. As a consequence, | |
1369 | * the process receives a lower bandwidth than its reserved one. In | |
1370 | * contrast, to recover this hole, the budget must be updated as if | |
1371 | * bfqq was not expired at all before this reactivation, i.e., it must | |
1372 | * be set to the value of the remaining budget when bfqq was | |
1373 | * expired. Along the same line, timestamps need to be assigned the | |
1374 | * value they had the last time bfqq was selected for service, i.e., | |
1375 | * before last expiration. Thus timestamps need to be back-shifted | |
1376 | * with respect to their normal computation (see [1] for more details | |
1377 | * on this tricky aspect). | |
1378 | * | |
1379 | * Secondly, to allow the process to recover the hole, the in-service | |
1380 | * queue must be expired too, to give bfqq the chance to preempt it | |
1381 | * immediately. In fact, if bfqq has to wait for a full budget of the | |
1382 | * in-service queue to be completed, then it may become impossible to | |
1383 | * let the process recover the hole, even if the back-shifted | |
1384 | * timestamps of bfqq are lower than those of the in-service queue. If | |
1385 | * this happens for most or all of the holes, then the process may not | |
1386 | * receive its reserved bandwidth. In this respect, it is worth noting | |
1387 | * that, being the service of outstanding requests unpreemptible, a | |
1388 | * little fraction of the holes may however be unrecoverable, thereby | |
1389 | * causing a little loss of bandwidth. | |
1390 | * | |
1391 | * The last important point is detecting whether bfqq does need this | |
1392 | * bandwidth recovery. In this respect, the next function deems the | |
1393 | * process associated with bfqq greedy, and thus allows it to recover | |
1394 | * the hole, if: 1) the process is waiting for the arrival of a new | |
1395 | * request (which implies that bfqq expired for one of the above two | |
1396 | * reasons), and 2) such a request has arrived soon. The first | |
1397 | * condition is controlled through the flag non_blocking_wait_rq, | |
1398 | * while the second through the flag arrived_in_time. If both | |
1399 | * conditions hold, then the function computes the budget in the | |
1400 | * above-described special way, and signals that the in-service queue | |
1401 | * should be expired. Timestamp back-shifting is done later in | |
1402 | * __bfq_activate_entity. | |
44e44a1b PV |
1403 | * |
1404 | * 2. Reduce latency. Even if timestamps are not backshifted to let | |
1405 | * the process associated with bfqq recover a service hole, bfqq may | |
1406 | * however happen to have, after being (re)activated, a lower finish | |
1407 | * timestamp than the in-service queue. That is, the next budget of | |
1408 | * bfqq may have to be completed before the one of the in-service | |
1409 | * queue. If this is the case, then preempting the in-service queue | |
1410 | * allows this goal to be achieved, apart from the unpreemptible, | |
1411 | * outstanding requests mentioned above. | |
1412 | * | |
1413 | * Unfortunately, regardless of which of the above two goals one wants | |
1414 | * to achieve, service trees need first to be updated to know whether | |
1415 | * the in-service queue must be preempted. To have service trees | |
1416 | * correctly updated, the in-service queue must be expired and | |
1417 | * rescheduled, and bfqq must be scheduled too. This is one of the | |
1418 | * most costly operations (in future versions, the scheduling | |
1419 | * mechanism may be re-designed in such a way to make it possible to | |
1420 | * know whether preemption is needed without needing to update service | |
1421 | * trees). In addition, queue preemptions almost always cause random | |
1422 | * I/O, and thus loss of throughput. Because of these facts, the next | |
1423 | * function adopts the following simple scheme to avoid both costly | |
1424 | * operations and too frequent preemptions: it requests the expiration | |
1425 | * of the in-service queue (unconditionally) only for queues that need | |
1426 | * to recover a hole, or that either are weight-raised or deserve to | |
1427 | * be weight-raised. | |
aee69d78 PV |
1428 | */ |
1429 | static bool bfq_bfqq_update_budg_for_activation(struct bfq_data *bfqd, | |
1430 | struct bfq_queue *bfqq, | |
44e44a1b PV |
1431 | bool arrived_in_time, |
1432 | bool wr_or_deserves_wr) | |
aee69d78 PV |
1433 | { |
1434 | struct bfq_entity *entity = &bfqq->entity; | |
1435 | ||
218cb897 PV |
1436 | /* |
1437 | * In the next compound condition, we check also whether there | |
1438 | * is some budget left, because otherwise there is no point in | |
1439 | * trying to go on serving bfqq with this same budget: bfqq | |
1440 | * would be expired immediately after being selected for | |
1441 | * service. This would only cause useless overhead. | |
1442 | */ | |
1443 | if (bfq_bfqq_non_blocking_wait_rq(bfqq) && arrived_in_time && | |
1444 | bfq_bfqq_budget_left(bfqq) > 0) { | |
aee69d78 PV |
1445 | /* |
1446 | * We do not clear the flag non_blocking_wait_rq here, as | |
1447 | * the latter is used in bfq_activate_bfqq to signal | |
1448 | * that timestamps need to be back-shifted (and is | |
1449 | * cleared right after). | |
1450 | */ | |
1451 | ||
1452 | /* | |
1453 | * In next assignment we rely on that either | |
1454 | * entity->service or entity->budget are not updated | |
1455 | * on expiration if bfqq is empty (see | |
1456 | * __bfq_bfqq_recalc_budget). Thus both quantities | |
1457 | * remain unchanged after such an expiration, and the | |
1458 | * following statement therefore assigns to | |
1459 | * entity->budget the remaining budget on such an | |
9fae8dd5 | 1460 | * expiration. |
aee69d78 PV |
1461 | */ |
1462 | entity->budget = min_t(unsigned long, | |
1463 | bfq_bfqq_budget_left(bfqq), | |
1464 | bfqq->max_budget); | |
1465 | ||
9fae8dd5 PV |
1466 | /* |
1467 | * At this point, we have used entity->service to get | |
1468 | * the budget left (needed for updating | |
1469 | * entity->budget). Thus we finally can, and have to, | |
1470 | * reset entity->service. The latter must be reset | |
1471 | * because bfqq would otherwise be charged again for | |
1472 | * the service it has received during its previous | |
1473 | * service slot(s). | |
1474 | */ | |
1475 | entity->service = 0; | |
1476 | ||
aee69d78 PV |
1477 | return true; |
1478 | } | |
1479 | ||
9fae8dd5 PV |
1480 | /* |
1481 | * We can finally complete expiration, by setting service to 0. | |
1482 | */ | |
1483 | entity->service = 0; | |
aee69d78 PV |
1484 | entity->budget = max_t(unsigned long, bfqq->max_budget, |
1485 | bfq_serv_to_charge(bfqq->next_rq, bfqq)); | |
1486 | bfq_clear_bfqq_non_blocking_wait_rq(bfqq); | |
44e44a1b PV |
1487 | return wr_or_deserves_wr; |
1488 | } | |
1489 | ||
4baa8bb1 PV |
1490 | /* |
1491 | * Return the farthest past time instant according to jiffies | |
1492 | * macros. | |
1493 | */ | |
1494 | static unsigned long bfq_smallest_from_now(void) | |
1495 | { | |
1496 | return jiffies - MAX_JIFFY_OFFSET; | |
1497 | } | |
1498 | ||
44e44a1b PV |
1499 | static void bfq_update_bfqq_wr_on_rq_arrival(struct bfq_data *bfqd, |
1500 | struct bfq_queue *bfqq, | |
1501 | unsigned int old_wr_coeff, | |
1502 | bool wr_or_deserves_wr, | |
77b7dcea | 1503 | bool interactive, |
e1b2324d | 1504 | bool in_burst, |
77b7dcea | 1505 | bool soft_rt) |
44e44a1b PV |
1506 | { |
1507 | if (old_wr_coeff == 1 && wr_or_deserves_wr) { | |
1508 | /* start a weight-raising period */ | |
77b7dcea | 1509 | if (interactive) { |
8a8747dc | 1510 | bfqq->service_from_wr = 0; |
77b7dcea PV |
1511 | bfqq->wr_coeff = bfqd->bfq_wr_coeff; |
1512 | bfqq->wr_cur_max_time = bfq_wr_duration(bfqd); | |
1513 | } else { | |
4baa8bb1 PV |
1514 | /* |
1515 | * No interactive weight raising in progress | |
1516 | * here: assign minus infinity to | |
1517 | * wr_start_at_switch_to_srt, to make sure | |
1518 | * that, at the end of the soft-real-time | |
1519 | * weight raising periods that is starting | |
1520 | * now, no interactive weight-raising period | |
1521 | * may be wrongly considered as still in | |
1522 | * progress (and thus actually started by | |
1523 | * mistake). | |
1524 | */ | |
1525 | bfqq->wr_start_at_switch_to_srt = | |
1526 | bfq_smallest_from_now(); | |
77b7dcea PV |
1527 | bfqq->wr_coeff = bfqd->bfq_wr_coeff * |
1528 | BFQ_SOFTRT_WEIGHT_FACTOR; | |
1529 | bfqq->wr_cur_max_time = | |
1530 | bfqd->bfq_wr_rt_max_time; | |
1531 | } | |
44e44a1b PV |
1532 | |
1533 | /* | |
1534 | * If needed, further reduce budget to make sure it is | |
1535 | * close to bfqq's backlog, so as to reduce the | |
1536 | * scheduling-error component due to a too large | |
1537 | * budget. Do not care about throughput consequences, | |
1538 | * but only about latency. Finally, do not assign a | |
1539 | * too small budget either, to avoid increasing | |
1540 | * latency by causing too frequent expirations. | |
1541 | */ | |
1542 | bfqq->entity.budget = min_t(unsigned long, | |
1543 | bfqq->entity.budget, | |
1544 | 2 * bfq_min_budget(bfqd)); | |
1545 | } else if (old_wr_coeff > 1) { | |
77b7dcea PV |
1546 | if (interactive) { /* update wr coeff and duration */ |
1547 | bfqq->wr_coeff = bfqd->bfq_wr_coeff; | |
1548 | bfqq->wr_cur_max_time = bfq_wr_duration(bfqd); | |
e1b2324d AA |
1549 | } else if (in_burst) |
1550 | bfqq->wr_coeff = 1; | |
1551 | else if (soft_rt) { | |
77b7dcea PV |
1552 | /* |
1553 | * The application is now or still meeting the | |
1554 | * requirements for being deemed soft rt. We | |
1555 | * can then correctly and safely (re)charge | |
1556 | * the weight-raising duration for the | |
1557 | * application with the weight-raising | |
1558 | * duration for soft rt applications. | |
1559 | * | |
1560 | * In particular, doing this recharge now, i.e., | |
1561 | * before the weight-raising period for the | |
1562 | * application finishes, reduces the probability | |
1563 | * of the following negative scenario: | |
1564 | * 1) the weight of a soft rt application is | |
1565 | * raised at startup (as for any newly | |
1566 | * created application), | |
1567 | * 2) since the application is not interactive, | |
1568 | * at a certain time weight-raising is | |
1569 | * stopped for the application, | |
1570 | * 3) at that time the application happens to | |
1571 | * still have pending requests, and hence | |
1572 | * is destined to not have a chance to be | |
1573 | * deemed soft rt before these requests are | |
1574 | * completed (see the comments to the | |
1575 | * function bfq_bfqq_softrt_next_start() | |
1576 | * for details on soft rt detection), | |
1577 | * 4) these pending requests experience a high | |
1578 | * latency because the application is not | |
1579 | * weight-raised while they are pending. | |
1580 | */ | |
1581 | if (bfqq->wr_cur_max_time != | |
1582 | bfqd->bfq_wr_rt_max_time) { | |
1583 | bfqq->wr_start_at_switch_to_srt = | |
1584 | bfqq->last_wr_start_finish; | |
1585 | ||
1586 | bfqq->wr_cur_max_time = | |
1587 | bfqd->bfq_wr_rt_max_time; | |
1588 | bfqq->wr_coeff = bfqd->bfq_wr_coeff * | |
1589 | BFQ_SOFTRT_WEIGHT_FACTOR; | |
1590 | } | |
1591 | bfqq->last_wr_start_finish = jiffies; | |
1592 | } | |
44e44a1b PV |
1593 | } |
1594 | } | |
1595 | ||
1596 | static bool bfq_bfqq_idle_for_long_time(struct bfq_data *bfqd, | |
1597 | struct bfq_queue *bfqq) | |
1598 | { | |
1599 | return bfqq->dispatched == 0 && | |
1600 | time_is_before_jiffies( | |
1601 | bfqq->budget_timeout + | |
1602 | bfqd->bfq_wr_min_idle_time); | |
aee69d78 PV |
1603 | } |
1604 | ||
1605 | static void bfq_bfqq_handle_idle_busy_switch(struct bfq_data *bfqd, | |
1606 | struct bfq_queue *bfqq, | |
44e44a1b PV |
1607 | int old_wr_coeff, |
1608 | struct request *rq, | |
1609 | bool *interactive) | |
aee69d78 | 1610 | { |
e1b2324d AA |
1611 | bool soft_rt, in_burst, wr_or_deserves_wr, |
1612 | bfqq_wants_to_preempt, | |
44e44a1b | 1613 | idle_for_long_time = bfq_bfqq_idle_for_long_time(bfqd, bfqq), |
aee69d78 PV |
1614 | /* |
1615 | * See the comments on | |
1616 | * bfq_bfqq_update_budg_for_activation for | |
1617 | * details on the usage of the next variable. | |
1618 | */ | |
1619 | arrived_in_time = ktime_get_ns() <= | |
1620 | bfqq->ttime.last_end_request + | |
1621 | bfqd->bfq_slice_idle * 3; | |
1622 | ||
e21b7a0b | 1623 | |
aee69d78 | 1624 | /* |
44e44a1b PV |
1625 | * bfqq deserves to be weight-raised if: |
1626 | * - it is sync, | |
e1b2324d | 1627 | * - it does not belong to a large burst, |
36eca894 AA |
1628 | * - it has been idle for enough time or is soft real-time, |
1629 | * - is linked to a bfq_io_cq (it is not shared in any sense). | |
44e44a1b | 1630 | */ |
e1b2324d | 1631 | in_burst = bfq_bfqq_in_large_burst(bfqq); |
77b7dcea | 1632 | soft_rt = bfqd->bfq_wr_max_softrt_rate > 0 && |
7074f076 | 1633 | !BFQQ_TOTALLY_SEEKY(bfqq) && |
e1b2324d | 1634 | !in_burst && |
f6c3ca0e DS |
1635 | time_is_before_jiffies(bfqq->soft_rt_next_start) && |
1636 | bfqq->dispatched == 0; | |
e1b2324d | 1637 | *interactive = !in_burst && idle_for_long_time; |
44e44a1b PV |
1638 | wr_or_deserves_wr = bfqd->low_latency && |
1639 | (bfqq->wr_coeff > 1 || | |
36eca894 AA |
1640 | (bfq_bfqq_sync(bfqq) && |
1641 | bfqq->bic && (*interactive || soft_rt))); | |
44e44a1b PV |
1642 | |
1643 | /* | |
1644 | * Using the last flag, update budget and check whether bfqq | |
1645 | * may want to preempt the in-service queue. | |
aee69d78 PV |
1646 | */ |
1647 | bfqq_wants_to_preempt = | |
1648 | bfq_bfqq_update_budg_for_activation(bfqd, bfqq, | |
44e44a1b PV |
1649 | arrived_in_time, |
1650 | wr_or_deserves_wr); | |
aee69d78 | 1651 | |
e1b2324d AA |
1652 | /* |
1653 | * If bfqq happened to be activated in a burst, but has been | |
1654 | * idle for much more than an interactive queue, then we | |
1655 | * assume that, in the overall I/O initiated in the burst, the | |
1656 | * I/O associated with bfqq is finished. So bfqq does not need | |
1657 | * to be treated as a queue belonging to a burst | |
1658 | * anymore. Accordingly, we reset bfqq's in_large_burst flag | |
1659 | * if set, and remove bfqq from the burst list if it's | |
1660 | * there. We do not decrement burst_size, because the fact | |
1661 | * that bfqq does not need to belong to the burst list any | |
1662 | * more does not invalidate the fact that bfqq was created in | |
1663 | * a burst. | |
1664 | */ | |
1665 | if (likely(!bfq_bfqq_just_created(bfqq)) && | |
1666 | idle_for_long_time && | |
1667 | time_is_before_jiffies( | |
1668 | bfqq->budget_timeout + | |
1669 | msecs_to_jiffies(10000))) { | |
1670 | hlist_del_init(&bfqq->burst_list_node); | |
1671 | bfq_clear_bfqq_in_large_burst(bfqq); | |
1672 | } | |
1673 | ||
1674 | bfq_clear_bfqq_just_created(bfqq); | |
1675 | ||
1676 | ||
aee69d78 PV |
1677 | if (!bfq_bfqq_IO_bound(bfqq)) { |
1678 | if (arrived_in_time) { | |
1679 | bfqq->requests_within_timer++; | |
1680 | if (bfqq->requests_within_timer >= | |
1681 | bfqd->bfq_requests_within_timer) | |
1682 | bfq_mark_bfqq_IO_bound(bfqq); | |
1683 | } else | |
1684 | bfqq->requests_within_timer = 0; | |
1685 | } | |
1686 | ||
44e44a1b | 1687 | if (bfqd->low_latency) { |
36eca894 AA |
1688 | if (unlikely(time_is_after_jiffies(bfqq->split_time))) |
1689 | /* wraparound */ | |
1690 | bfqq->split_time = | |
1691 | jiffies - bfqd->bfq_wr_min_idle_time - 1; | |
1692 | ||
1693 | if (time_is_before_jiffies(bfqq->split_time + | |
1694 | bfqd->bfq_wr_min_idle_time)) { | |
1695 | bfq_update_bfqq_wr_on_rq_arrival(bfqd, bfqq, | |
1696 | old_wr_coeff, | |
1697 | wr_or_deserves_wr, | |
1698 | *interactive, | |
e1b2324d | 1699 | in_burst, |
36eca894 AA |
1700 | soft_rt); |
1701 | ||
1702 | if (old_wr_coeff != bfqq->wr_coeff) | |
1703 | bfqq->entity.prio_changed = 1; | |
1704 | } | |
44e44a1b PV |
1705 | } |
1706 | ||
77b7dcea PV |
1707 | bfqq->last_idle_bklogged = jiffies; |
1708 | bfqq->service_from_backlogged = 0; | |
1709 | bfq_clear_bfqq_softrt_update(bfqq); | |
1710 | ||
aee69d78 PV |
1711 | bfq_add_bfqq_busy(bfqd, bfqq); |
1712 | ||
1713 | /* | |
1714 | * Expire in-service queue only if preemption may be needed | |
1715 | * for guarantees. In this respect, the function | |
1716 | * next_queue_may_preempt just checks a simple, necessary | |
1717 | * condition, and not a sufficient condition based on | |
1718 | * timestamps. In fact, for the latter condition to be | |
1719 | * evaluated, timestamps would need first to be updated, and | |
1720 | * this operation is quite costly (see the comments on the | |
1721 | * function bfq_bfqq_update_budg_for_activation). | |
1722 | */ | |
1723 | if (bfqd->in_service_queue && bfqq_wants_to_preempt && | |
77b7dcea | 1724 | bfqd->in_service_queue->wr_coeff < bfqq->wr_coeff && |
aee69d78 PV |
1725 | next_queue_may_preempt(bfqd)) |
1726 | bfq_bfqq_expire(bfqd, bfqd->in_service_queue, | |
1727 | false, BFQQE_PREEMPTED); | |
1728 | } | |
1729 | ||
1730 | static void bfq_add_request(struct request *rq) | |
1731 | { | |
1732 | struct bfq_queue *bfqq = RQ_BFQQ(rq); | |
1733 | struct bfq_data *bfqd = bfqq->bfqd; | |
1734 | struct request *next_rq, *prev; | |
44e44a1b PV |
1735 | unsigned int old_wr_coeff = bfqq->wr_coeff; |
1736 | bool interactive = false; | |
aee69d78 PV |
1737 | |
1738 | bfq_log_bfqq(bfqd, bfqq, "add_request %d", rq_is_sync(rq)); | |
1739 | bfqq->queued[rq_is_sync(rq)]++; | |
1740 | bfqd->queued++; | |
1741 | ||
2341d662 PV |
1742 | if (RB_EMPTY_ROOT(&bfqq->sort_list) && bfq_bfqq_sync(bfqq)) { |
1743 | /* | |
1744 | * Periodically reset inject limit, to make sure that | |
1745 | * the latter eventually drops in case workload | |
1746 | * changes, see step (3) in the comments on | |
1747 | * bfq_update_inject_limit(). | |
1748 | */ | |
1749 | if (time_is_before_eq_jiffies(bfqq->decrease_time_jif + | |
1750 | msecs_to_jiffies(1000))) { | |
1751 | /* invalidate baseline total service time */ | |
1752 | bfqq->last_serv_time_ns = 0; | |
1753 | ||
1754 | /* | |
1755 | * Reset pointer in case we are waiting for | |
1756 | * some request completion. | |
1757 | */ | |
1758 | bfqd->waited_rq = NULL; | |
1759 | ||
1760 | /* | |
1761 | * If bfqq has a short think time, then start | |
1762 | * by setting the inject limit to 0 | |
1763 | * prudentially, because the service time of | |
1764 | * an injected I/O request may be higher than | |
1765 | * the think time of bfqq, and therefore, if | |
1766 | * one request was injected when bfqq remains | |
1767 | * empty, this injected request might delay | |
1768 | * the service of the next I/O request for | |
1769 | * bfqq significantly. In case bfqq can | |
1770 | * actually tolerate some injection, then the | |
1771 | * adaptive update will however raise the | |
1772 | * limit soon. This lucky circumstance holds | |
1773 | * exactly because bfqq has a short think | |
1774 | * time, and thus, after remaining empty, is | |
1775 | * likely to get new I/O enqueued---and then | |
1776 | * completed---before being expired. This is | |
1777 | * the very pattern that gives the | |
1778 | * limit-update algorithm the chance to | |
1779 | * measure the effect of injection on request | |
1780 | * service times, and then to update the limit | |
1781 | * accordingly. | |
1782 | * | |
1783 | * On the opposite end, if bfqq has a long | |
1784 | * think time, then start directly by 1, | |
1785 | * because: | |
1786 | * a) on the bright side, keeping at most one | |
1787 | * request in service in the drive is unlikely | |
1788 | * to cause any harm to the latency of bfqq's | |
1789 | * requests, as the service time of a single | |
1790 | * request is likely to be lower than the | |
1791 | * think time of bfqq; | |
1792 | * b) on the downside, after becoming empty, | |
1793 | * bfqq is likely to expire before getting its | |
1794 | * next request. With this request arrival | |
1795 | * pattern, it is very hard to sample total | |
1796 | * service times and update the inject limit | |
1797 | * accordingly (see comments on | |
1798 | * bfq_update_inject_limit()). So the limit is | |
1799 | * likely to be never, or at least seldom, | |
1800 | * updated. As a consequence, by setting the | |
1801 | * limit to 1, we avoid that no injection ever | |
1802 | * occurs with bfqq. On the downside, this | |
1803 | * proactive step further reduces chances to | |
1804 | * actually compute the baseline total service | |
1805 | * time. Thus it reduces chances to execute the | |
1806 | * limit-update algorithm and possibly raise the | |
1807 | * limit to more than 1. | |
1808 | */ | |
1809 | if (bfq_bfqq_has_short_ttime(bfqq)) | |
1810 | bfqq->inject_limit = 0; | |
1811 | else | |
1812 | bfqq->inject_limit = 1; | |
1813 | bfqq->decrease_time_jif = jiffies; | |
1814 | } | |
1815 | ||
1816 | /* | |
1817 | * The following conditions must hold to setup a new | |
1818 | * sampling of total service time, and then a new | |
1819 | * update of the inject limit: | |
1820 | * - bfqq is in service, because the total service | |
1821 | * time is evaluated only for the I/O requests of | |
1822 | * the queues in service; | |
1823 | * - this is the right occasion to compute or to | |
1824 | * lower the baseline total service time, because | |
1825 | * there are actually no requests in the drive, | |
1826 | * or | |
1827 | * the baseline total service time is available, and | |
1828 | * this is the right occasion to compute the other | |
1829 | * quantity needed to update the inject limit, i.e., | |
1830 | * the total service time caused by the amount of | |
1831 | * injection allowed by the current value of the | |
1832 | * limit. It is the right occasion because injection | |
1833 | * has actually been performed during the service | |
1834 | * hole, and there are still in-flight requests, | |
1835 | * which are very likely to be exactly the injected | |
1836 | * requests, or part of them; | |
1837 | * - the minimum interval for sampling the total | |
1838 | * service time and updating the inject limit has | |
1839 | * elapsed. | |
1840 | */ | |
1841 | if (bfqq == bfqd->in_service_queue && | |
1842 | (bfqd->rq_in_driver == 0 || | |
1843 | (bfqq->last_serv_time_ns > 0 && | |
1844 | bfqd->rqs_injected && bfqd->rq_in_driver > 0)) && | |
1845 | time_is_before_eq_jiffies(bfqq->decrease_time_jif + | |
1846 | msecs_to_jiffies(100))) { | |
1847 | bfqd->last_empty_occupied_ns = ktime_get_ns(); | |
1848 | /* | |
1849 | * Start the state machine for measuring the | |
1850 | * total service time of rq: setting | |
1851 | * wait_dispatch will cause bfqd->waited_rq to | |
1852 | * be set when rq will be dispatched. | |
1853 | */ | |
1854 | bfqd->wait_dispatch = true; | |
1855 | bfqd->rqs_injected = false; | |
1856 | } | |
1857 | } | |
1858 | ||
aee69d78 PV |
1859 | elv_rb_add(&bfqq->sort_list, rq); |
1860 | ||
1861 | /* | |
1862 | * Check if this request is a better next-serve candidate. | |
1863 | */ | |
1864 | prev = bfqq->next_rq; | |
1865 | next_rq = bfq_choose_req(bfqd, bfqq->next_rq, rq, bfqd->last_position); | |
1866 | bfqq->next_rq = next_rq; | |
1867 | ||
36eca894 AA |
1868 | /* |
1869 | * Adjust priority tree position, if next_rq changes. | |
8cacc5ab | 1870 | * See comments on bfq_pos_tree_add_move() for the unlikely(). |
36eca894 | 1871 | */ |
8cacc5ab | 1872 | if (unlikely(!bfqd->nonrot_with_queueing && prev != bfqq->next_rq)) |
36eca894 AA |
1873 | bfq_pos_tree_add_move(bfqd, bfqq); |
1874 | ||
aee69d78 | 1875 | if (!bfq_bfqq_busy(bfqq)) /* switching to busy ... */ |
44e44a1b PV |
1876 | bfq_bfqq_handle_idle_busy_switch(bfqd, bfqq, old_wr_coeff, |
1877 | rq, &interactive); | |
1878 | else { | |
1879 | if (bfqd->low_latency && old_wr_coeff == 1 && !rq_is_sync(rq) && | |
1880 | time_is_before_jiffies( | |
1881 | bfqq->last_wr_start_finish + | |
1882 | bfqd->bfq_wr_min_inter_arr_async)) { | |
1883 | bfqq->wr_coeff = bfqd->bfq_wr_coeff; | |
1884 | bfqq->wr_cur_max_time = bfq_wr_duration(bfqd); | |
1885 | ||
cfd69712 | 1886 | bfqd->wr_busy_queues++; |
44e44a1b PV |
1887 | bfqq->entity.prio_changed = 1; |
1888 | } | |
1889 | if (prev != bfqq->next_rq) | |
1890 | bfq_updated_next_req(bfqd, bfqq); | |
1891 | } | |
1892 | ||
1893 | /* | |
1894 | * Assign jiffies to last_wr_start_finish in the following | |
1895 | * cases: | |
1896 | * | |
1897 | * . if bfqq is not going to be weight-raised, because, for | |
1898 | * non weight-raised queues, last_wr_start_finish stores the | |
1899 | * arrival time of the last request; as of now, this piece | |
1900 | * of information is used only for deciding whether to | |
1901 | * weight-raise async queues | |
1902 | * | |
1903 | * . if bfqq is not weight-raised, because, if bfqq is now | |
1904 | * switching to weight-raised, then last_wr_start_finish | |
1905 | * stores the time when weight-raising starts | |
1906 | * | |
1907 | * . if bfqq is interactive, because, regardless of whether | |
1908 | * bfqq is currently weight-raised, the weight-raising | |
1909 | * period must start or restart (this case is considered | |
1910 | * separately because it is not detected by the above | |
1911 | * conditions, if bfqq is already weight-raised) | |
77b7dcea PV |
1912 | * |
1913 | * last_wr_start_finish has to be updated also if bfqq is soft | |
1914 | * real-time, because the weight-raising period is constantly | |
1915 | * restarted on idle-to-busy transitions for these queues, but | |
1916 | * this is already done in bfq_bfqq_handle_idle_busy_switch if | |
1917 | * needed. | |
44e44a1b PV |
1918 | */ |
1919 | if (bfqd->low_latency && | |
1920 | (old_wr_coeff == 1 || bfqq->wr_coeff == 1 || interactive)) | |
1921 | bfqq->last_wr_start_finish = jiffies; | |
aee69d78 PV |
1922 | } |
1923 | ||
1924 | static struct request *bfq_find_rq_fmerge(struct bfq_data *bfqd, | |
1925 | struct bio *bio, | |
1926 | struct request_queue *q) | |
1927 | { | |
1928 | struct bfq_queue *bfqq = bfqd->bio_bfqq; | |
1929 | ||
1930 | ||
1931 | if (bfqq) | |
1932 | return elv_rb_find(&bfqq->sort_list, bio_end_sector(bio)); | |
1933 | ||
1934 | return NULL; | |
1935 | } | |
1936 | ||
ab0e43e9 PV |
1937 | static sector_t get_sdist(sector_t last_pos, struct request *rq) |
1938 | { | |
1939 | if (last_pos) | |
1940 | return abs(blk_rq_pos(rq) - last_pos); | |
1941 | ||
1942 | return 0; | |
1943 | } | |
1944 | ||
aee69d78 PV |
1945 | #if 0 /* Still not clear if we can do without next two functions */ |
1946 | static void bfq_activate_request(struct request_queue *q, struct request *rq) | |
1947 | { | |
1948 | struct bfq_data *bfqd = q->elevator->elevator_data; | |
1949 | ||
1950 | bfqd->rq_in_driver++; | |
aee69d78 PV |
1951 | } |
1952 | ||
1953 | static void bfq_deactivate_request(struct request_queue *q, struct request *rq) | |
1954 | { | |
1955 | struct bfq_data *bfqd = q->elevator->elevator_data; | |
1956 | ||
1957 | bfqd->rq_in_driver--; | |
1958 | } | |
1959 | #endif | |
1960 | ||
1961 | static void bfq_remove_request(struct request_queue *q, | |
1962 | struct request *rq) | |
1963 | { | |
1964 | struct bfq_queue *bfqq = RQ_BFQQ(rq); | |
1965 | struct bfq_data *bfqd = bfqq->bfqd; | |
1966 | const int sync = rq_is_sync(rq); | |
1967 | ||
1968 | if (bfqq->next_rq == rq) { | |
1969 | bfqq->next_rq = bfq_find_next_rq(bfqd, bfqq, rq); | |
1970 | bfq_updated_next_req(bfqd, bfqq); | |
1971 | } | |
1972 | ||
1973 | if (rq->queuelist.prev != &rq->queuelist) | |
1974 | list_del_init(&rq->queuelist); | |
1975 | bfqq->queued[sync]--; | |
1976 | bfqd->queued--; | |
1977 | elv_rb_del(&bfqq->sort_list, rq); | |
1978 | ||
1979 | elv_rqhash_del(q, rq); | |
1980 | if (q->last_merge == rq) | |
1981 | q->last_merge = NULL; | |
1982 | ||
1983 | if (RB_EMPTY_ROOT(&bfqq->sort_list)) { | |
1984 | bfqq->next_rq = NULL; | |
1985 | ||
1986 | if (bfq_bfqq_busy(bfqq) && bfqq != bfqd->in_service_queue) { | |
e21b7a0b | 1987 | bfq_del_bfqq_busy(bfqd, bfqq, false); |
aee69d78 PV |
1988 | /* |
1989 | * bfqq emptied. In normal operation, when | |
1990 | * bfqq is empty, bfqq->entity.service and | |
1991 | * bfqq->entity.budget must contain, | |
1992 | * respectively, the service received and the | |
1993 | * budget used last time bfqq emptied. These | |
1994 | * facts do not hold in this case, as at least | |
1995 | * this last removal occurred while bfqq is | |
1996 | * not in service. To avoid inconsistencies, | |
1997 | * reset both bfqq->entity.service and | |
1998 | * bfqq->entity.budget, if bfqq has still a | |
1999 | * process that may issue I/O requests to it. | |
2000 | */ | |
2001 | bfqq->entity.budget = bfqq->entity.service = 0; | |
2002 | } | |
36eca894 AA |
2003 | |
2004 | /* | |
2005 | * Remove queue from request-position tree as it is empty. | |
2006 | */ | |
2007 | if (bfqq->pos_root) { | |
2008 | rb_erase(&bfqq->pos_node, bfqq->pos_root); | |
2009 | bfqq->pos_root = NULL; | |
2010 | } | |
05e90283 | 2011 | } else { |
8cacc5ab PV |
2012 | /* see comments on bfq_pos_tree_add_move() for the unlikely() */ |
2013 | if (unlikely(!bfqd->nonrot_with_queueing)) | |
2014 | bfq_pos_tree_add_move(bfqd, bfqq); | |
aee69d78 PV |
2015 | } |
2016 | ||
2017 | if (rq->cmd_flags & REQ_META) | |
2018 | bfqq->meta_pending--; | |
e21b7a0b | 2019 | |
aee69d78 PV |
2020 | } |
2021 | ||
2022 | static bool bfq_bio_merge(struct blk_mq_hw_ctx *hctx, struct bio *bio) | |
2023 | { | |
2024 | struct request_queue *q = hctx->queue; | |
2025 | struct bfq_data *bfqd = q->elevator->elevator_data; | |
2026 | struct request *free = NULL; | |
2027 | /* | |
2028 | * bfq_bic_lookup grabs the queue_lock: invoke it now and | |
2029 | * store its return value for later use, to avoid nesting | |
2030 | * queue_lock inside the bfqd->lock. We assume that the bic | |
2031 | * returned by bfq_bic_lookup does not go away before | |
2032 | * bfqd->lock is taken. | |
2033 | */ | |
2034 | struct bfq_io_cq *bic = bfq_bic_lookup(bfqd, current->io_context, q); | |
2035 | bool ret; | |
2036 | ||
2037 | spin_lock_irq(&bfqd->lock); | |
2038 | ||
2039 | if (bic) | |
2040 | bfqd->bio_bfqq = bic_to_bfqq(bic, op_is_sync(bio->bi_opf)); | |
2041 | else | |
2042 | bfqd->bio_bfqq = NULL; | |
2043 | bfqd->bio_bic = bic; | |
2044 | ||
2045 | ret = blk_mq_sched_try_merge(q, bio, &free); | |
2046 | ||
2047 | if (free) | |
2048 | blk_mq_free_request(free); | |
2049 | spin_unlock_irq(&bfqd->lock); | |
2050 | ||
2051 | return ret; | |
2052 | } | |
2053 | ||
2054 | static int bfq_request_merge(struct request_queue *q, struct request **req, | |
2055 | struct bio *bio) | |
2056 | { | |
2057 | struct bfq_data *bfqd = q->elevator->elevator_data; | |
2058 | struct request *__rq; | |
2059 | ||
2060 | __rq = bfq_find_rq_fmerge(bfqd, bio, q); | |
2061 | if (__rq && elv_bio_merge_ok(__rq, bio)) { | |
2062 | *req = __rq; | |
2063 | return ELEVATOR_FRONT_MERGE; | |
2064 | } | |
2065 | ||
2066 | return ELEVATOR_NO_MERGE; | |
2067 | } | |
2068 | ||
18e5a57d PV |
2069 | static struct bfq_queue *bfq_init_rq(struct request *rq); |
2070 | ||
aee69d78 PV |
2071 | static void bfq_request_merged(struct request_queue *q, struct request *req, |
2072 | enum elv_merge type) | |
2073 | { | |
2074 | if (type == ELEVATOR_FRONT_MERGE && | |
2075 | rb_prev(&req->rb_node) && | |
2076 | blk_rq_pos(req) < | |
2077 | blk_rq_pos(container_of(rb_prev(&req->rb_node), | |
2078 | struct request, rb_node))) { | |
18e5a57d | 2079 | struct bfq_queue *bfqq = bfq_init_rq(req); |
aee69d78 PV |
2080 | struct bfq_data *bfqd = bfqq->bfqd; |
2081 | struct request *prev, *next_rq; | |
2082 | ||
2083 | /* Reposition request in its sort_list */ | |
2084 | elv_rb_del(&bfqq->sort_list, req); | |
2085 | elv_rb_add(&bfqq->sort_list, req); | |
2086 | ||
2087 | /* Choose next request to be served for bfqq */ | |
2088 | prev = bfqq->next_rq; | |
2089 | next_rq = bfq_choose_req(bfqd, bfqq->next_rq, req, | |
2090 | bfqd->last_position); | |
2091 | bfqq->next_rq = next_rq; | |
2092 | /* | |
36eca894 AA |
2093 | * If next_rq changes, update both the queue's budget to |
2094 | * fit the new request and the queue's position in its | |
2095 | * rq_pos_tree. | |
aee69d78 | 2096 | */ |
36eca894 | 2097 | if (prev != bfqq->next_rq) { |
aee69d78 | 2098 | bfq_updated_next_req(bfqd, bfqq); |
8cacc5ab PV |
2099 | /* |
2100 | * See comments on bfq_pos_tree_add_move() for | |
2101 | * the unlikely(). | |
2102 | */ | |
2103 | if (unlikely(!bfqd->nonrot_with_queueing)) | |
2104 | bfq_pos_tree_add_move(bfqd, bfqq); | |
36eca894 | 2105 | } |
aee69d78 PV |
2106 | } |
2107 | } | |
2108 | ||
8abfa4d6 PV |
2109 | /* |
2110 | * This function is called to notify the scheduler that the requests | |
2111 | * rq and 'next' have been merged, with 'next' going away. BFQ | |
2112 | * exploits this hook to address the following issue: if 'next' has a | |
2113 | * fifo_time lower that rq, then the fifo_time of rq must be set to | |
2114 | * the value of 'next', to not forget the greater age of 'next'. | |
8abfa4d6 PV |
2115 | * |
2116 | * NOTE: in this function we assume that rq is in a bfq_queue, basing | |
2117 | * on that rq is picked from the hash table q->elevator->hash, which, | |
2118 | * in its turn, is filled only with I/O requests present in | |
2119 | * bfq_queues, while BFQ is in use for the request queue q. In fact, | |
2120 | * the function that fills this hash table (elv_rqhash_add) is called | |
2121 | * only by bfq_insert_request. | |
2122 | */ | |
aee69d78 PV |
2123 | static void bfq_requests_merged(struct request_queue *q, struct request *rq, |
2124 | struct request *next) | |
2125 | { | |
18e5a57d PV |
2126 | struct bfq_queue *bfqq = bfq_init_rq(rq), |
2127 | *next_bfqq = bfq_init_rq(next); | |
aee69d78 | 2128 | |
aee69d78 PV |
2129 | /* |
2130 | * If next and rq belong to the same bfq_queue and next is older | |
2131 | * than rq, then reposition rq in the fifo (by substituting next | |
2132 | * with rq). Otherwise, if next and rq belong to different | |
2133 | * bfq_queues, never reposition rq: in fact, we would have to | |
2134 | * reposition it with respect to next's position in its own fifo, | |
2135 | * which would most certainly be too expensive with respect to | |
2136 | * the benefits. | |
2137 | */ | |
2138 | if (bfqq == next_bfqq && | |
2139 | !list_empty(&rq->queuelist) && !list_empty(&next->queuelist) && | |
2140 | next->fifo_time < rq->fifo_time) { | |
2141 | list_del_init(&rq->queuelist); | |
2142 | list_replace_init(&next->queuelist, &rq->queuelist); | |
2143 | rq->fifo_time = next->fifo_time; | |
2144 | } | |
2145 | ||
2146 | if (bfqq->next_rq == next) | |
2147 | bfqq->next_rq = rq; | |
2148 | ||
e21b7a0b | 2149 | bfqg_stats_update_io_merged(bfqq_group(bfqq), next->cmd_flags); |
aee69d78 PV |
2150 | } |
2151 | ||
44e44a1b PV |
2152 | /* Must be called with bfqq != NULL */ |
2153 | static void bfq_bfqq_end_wr(struct bfq_queue *bfqq) | |
2154 | { | |
cfd69712 PV |
2155 | if (bfq_bfqq_busy(bfqq)) |
2156 | bfqq->bfqd->wr_busy_queues--; | |
44e44a1b PV |
2157 | bfqq->wr_coeff = 1; |
2158 | bfqq->wr_cur_max_time = 0; | |
77b7dcea | 2159 | bfqq->last_wr_start_finish = jiffies; |
44e44a1b PV |
2160 | /* |
2161 | * Trigger a weight change on the next invocation of | |
2162 | * __bfq_entity_update_weight_prio. | |
2163 | */ | |
2164 | bfqq->entity.prio_changed = 1; | |
2165 | } | |
2166 | ||
ea25da48 PV |
2167 | void bfq_end_wr_async_queues(struct bfq_data *bfqd, |
2168 | struct bfq_group *bfqg) | |
44e44a1b PV |
2169 | { |
2170 | int i, j; | |
2171 | ||
2172 | for (i = 0; i < 2; i++) | |
2173 | for (j = 0; j < IOPRIO_BE_NR; j++) | |
2174 | if (bfqg->async_bfqq[i][j]) | |
2175 | bfq_bfqq_end_wr(bfqg->async_bfqq[i][j]); | |
2176 | if (bfqg->async_idle_bfqq) | |
2177 | bfq_bfqq_end_wr(bfqg->async_idle_bfqq); | |
2178 | } | |
2179 | ||
2180 | static void bfq_end_wr(struct bfq_data *bfqd) | |
2181 | { | |
2182 | struct bfq_queue *bfqq; | |
2183 | ||
2184 | spin_lock_irq(&bfqd->lock); | |
2185 | ||
2186 | list_for_each_entry(bfqq, &bfqd->active_list, bfqq_list) | |
2187 | bfq_bfqq_end_wr(bfqq); | |
2188 | list_for_each_entry(bfqq, &bfqd->idle_list, bfqq_list) | |
2189 | bfq_bfqq_end_wr(bfqq); | |
2190 | bfq_end_wr_async(bfqd); | |
2191 | ||
2192 | spin_unlock_irq(&bfqd->lock); | |
2193 | } | |
2194 | ||
36eca894 AA |
2195 | static sector_t bfq_io_struct_pos(void *io_struct, bool request) |
2196 | { | |
2197 | if (request) | |
2198 | return blk_rq_pos(io_struct); | |
2199 | else | |
2200 | return ((struct bio *)io_struct)->bi_iter.bi_sector; | |
2201 | } | |
2202 | ||
2203 | static int bfq_rq_close_to_sector(void *io_struct, bool request, | |
2204 | sector_t sector) | |
2205 | { | |
2206 | return abs(bfq_io_struct_pos(io_struct, request) - sector) <= | |
2207 | BFQQ_CLOSE_THR; | |
2208 | } | |
2209 | ||
2210 | static struct bfq_queue *bfqq_find_close(struct bfq_data *bfqd, | |
2211 | struct bfq_queue *bfqq, | |
2212 | sector_t sector) | |
2213 | { | |
2214 | struct rb_root *root = &bfq_bfqq_to_bfqg(bfqq)->rq_pos_tree; | |
2215 | struct rb_node *parent, *node; | |
2216 | struct bfq_queue *__bfqq; | |
2217 | ||
2218 | if (RB_EMPTY_ROOT(root)) | |
2219 | return NULL; | |
2220 | ||
2221 | /* | |
2222 | * First, if we find a request starting at the end of the last | |
2223 | * request, choose it. | |
2224 | */ | |
2225 | __bfqq = bfq_rq_pos_tree_lookup(bfqd, root, sector, &parent, NULL); | |
2226 | if (__bfqq) | |
2227 | return __bfqq; | |
2228 | ||
2229 | /* | |
2230 | * If the exact sector wasn't found, the parent of the NULL leaf | |
2231 | * will contain the closest sector (rq_pos_tree sorted by | |
2232 | * next_request position). | |
2233 | */ | |
2234 | __bfqq = rb_entry(parent, struct bfq_queue, pos_node); | |
2235 | if (bfq_rq_close_to_sector(__bfqq->next_rq, true, sector)) | |
2236 | return __bfqq; | |
2237 | ||
2238 | if (blk_rq_pos(__bfqq->next_rq) < sector) | |
2239 | node = rb_next(&__bfqq->pos_node); | |
2240 | else | |
2241 | node = rb_prev(&__bfqq->pos_node); | |
2242 | if (!node) | |
2243 | return NULL; | |
2244 | ||
2245 | __bfqq = rb_entry(node, struct bfq_queue, pos_node); | |
2246 | if (bfq_rq_close_to_sector(__bfqq->next_rq, true, sector)) | |
2247 | return __bfqq; | |
2248 | ||
2249 | return NULL; | |
2250 | } | |
2251 | ||
2252 | static struct bfq_queue *bfq_find_close_cooperator(struct bfq_data *bfqd, | |
2253 | struct bfq_queue *cur_bfqq, | |
2254 | sector_t sector) | |
2255 | { | |
2256 | struct bfq_queue *bfqq; | |
2257 | ||
2258 | /* | |
2259 | * We shall notice if some of the queues are cooperating, | |
2260 | * e.g., working closely on the same area of the device. In | |
2261 | * that case, we can group them together and: 1) don't waste | |
2262 | * time idling, and 2) serve the union of their requests in | |
2263 | * the best possible order for throughput. | |
2264 | */ | |
2265 | bfqq = bfqq_find_close(bfqd, cur_bfqq, sector); | |
2266 | if (!bfqq || bfqq == cur_bfqq) | |
2267 | return NULL; | |
2268 | ||
2269 | return bfqq; | |
2270 | } | |
2271 | ||
2272 | static struct bfq_queue * | |
2273 | bfq_setup_merge(struct bfq_queue *bfqq, struct bfq_queue *new_bfqq) | |
2274 | { | |
2275 | int process_refs, new_process_refs; | |
2276 | struct bfq_queue *__bfqq; | |
2277 | ||
2278 | /* | |
2279 | * If there are no process references on the new_bfqq, then it is | |
2280 | * unsafe to follow the ->new_bfqq chain as other bfqq's in the chain | |
2281 | * may have dropped their last reference (not just their last process | |
2282 | * reference). | |
2283 | */ | |
2284 | if (!bfqq_process_refs(new_bfqq)) | |
2285 | return NULL; | |
2286 | ||
2287 | /* Avoid a circular list and skip interim queue merges. */ | |
2288 | while ((__bfqq = new_bfqq->new_bfqq)) { | |
2289 | if (__bfqq == bfqq) | |
2290 | return NULL; | |
2291 | new_bfqq = __bfqq; | |
2292 | } | |
2293 | ||
2294 | process_refs = bfqq_process_refs(bfqq); | |
2295 | new_process_refs = bfqq_process_refs(new_bfqq); | |
2296 | /* | |
2297 | * If the process for the bfqq has gone away, there is no | |
2298 | * sense in merging the queues. | |
2299 | */ | |
2300 | if (process_refs == 0 || new_process_refs == 0) | |
2301 | return NULL; | |
2302 | ||
2303 | bfq_log_bfqq(bfqq->bfqd, bfqq, "scheduling merge with queue %d", | |
2304 | new_bfqq->pid); | |
2305 | ||
2306 | /* | |
2307 | * Merging is just a redirection: the requests of the process | |
2308 | * owning one of the two queues are redirected to the other queue. | |
2309 | * The latter queue, in its turn, is set as shared if this is the | |
2310 | * first time that the requests of some process are redirected to | |
2311 | * it. | |
2312 | * | |
6fa3e8d3 PV |
2313 | * We redirect bfqq to new_bfqq and not the opposite, because |
2314 | * we are in the context of the process owning bfqq, thus we | |
2315 | * have the io_cq of this process. So we can immediately | |
2316 | * configure this io_cq to redirect the requests of the | |
2317 | * process to new_bfqq. In contrast, the io_cq of new_bfqq is | |
2318 | * not available any more (new_bfqq->bic == NULL). | |
36eca894 | 2319 | * |
6fa3e8d3 PV |
2320 | * Anyway, even in case new_bfqq coincides with the in-service |
2321 | * queue, redirecting requests the in-service queue is the | |
2322 | * best option, as we feed the in-service queue with new | |
2323 | * requests close to the last request served and, by doing so, | |
2324 | * are likely to increase the throughput. | |
36eca894 AA |
2325 | */ |
2326 | bfqq->new_bfqq = new_bfqq; | |
2327 | new_bfqq->ref += process_refs; | |
2328 | return new_bfqq; | |
2329 | } | |
2330 | ||
2331 | static bool bfq_may_be_close_cooperator(struct bfq_queue *bfqq, | |
2332 | struct bfq_queue *new_bfqq) | |
2333 | { | |
7b8fa3b9 PV |
2334 | if (bfq_too_late_for_merging(new_bfqq)) |
2335 | return false; | |
2336 | ||
36eca894 AA |
2337 | if (bfq_class_idle(bfqq) || bfq_class_idle(new_bfqq) || |
2338 | (bfqq->ioprio_class != new_bfqq->ioprio_class)) | |
2339 | return false; | |
2340 | ||
2341 | /* | |
2342 | * If either of the queues has already been detected as seeky, | |
2343 | * then merging it with the other queue is unlikely to lead to | |
2344 | * sequential I/O. | |
2345 | */ | |
2346 | if (BFQQ_SEEKY(bfqq) || BFQQ_SEEKY(new_bfqq)) | |
2347 | return false; | |
2348 | ||
2349 | /* | |
2350 | * Interleaved I/O is known to be done by (some) applications | |
2351 | * only for reads, so it does not make sense to merge async | |
2352 | * queues. | |
2353 | */ | |
2354 | if (!bfq_bfqq_sync(bfqq) || !bfq_bfqq_sync(new_bfqq)) | |
2355 | return false; | |
2356 | ||
2357 | return true; | |
2358 | } | |
2359 | ||
36eca894 AA |
2360 | /* |
2361 | * Attempt to schedule a merge of bfqq with the currently in-service | |
2362 | * queue or with a close queue among the scheduled queues. Return | |
2363 | * NULL if no merge was scheduled, a pointer to the shared bfq_queue | |
2364 | * structure otherwise. | |
2365 | * | |
2366 | * The OOM queue is not allowed to participate to cooperation: in fact, since | |
2367 | * the requests temporarily redirected to the OOM queue could be redirected | |
2368 | * again to dedicated queues at any time, the state needed to correctly | |
2369 | * handle merging with the OOM queue would be quite complex and expensive | |
2370 | * to maintain. Besides, in such a critical condition as an out of memory, | |
2371 | * the benefits of queue merging may be little relevant, or even negligible. | |
2372 | * | |
36eca894 AA |
2373 | * WARNING: queue merging may impair fairness among non-weight raised |
2374 | * queues, for at least two reasons: 1) the original weight of a | |
2375 | * merged queue may change during the merged state, 2) even being the | |
2376 | * weight the same, a merged queue may be bloated with many more | |
2377 | * requests than the ones produced by its originally-associated | |
2378 | * process. | |
2379 | */ | |
2380 | static struct bfq_queue * | |
2381 | bfq_setup_cooperator(struct bfq_data *bfqd, struct bfq_queue *bfqq, | |
2382 | void *io_struct, bool request) | |
2383 | { | |
2384 | struct bfq_queue *in_service_bfqq, *new_bfqq; | |
2385 | ||
8cacc5ab PV |
2386 | /* |
2387 | * Do not perform queue merging if the device is non | |
2388 | * rotational and performs internal queueing. In fact, such a | |
2389 | * device reaches a high speed through internal parallelism | |
2390 | * and pipelining. This means that, to reach a high | |
2391 | * throughput, it must have many requests enqueued at the same | |
2392 | * time. But, in this configuration, the internal scheduling | |
2393 | * algorithm of the device does exactly the job of queue | |
2394 | * merging: it reorders requests so as to obtain as much as | |
2395 | * possible a sequential I/O pattern. As a consequence, with | |
2396 | * the workload generated by processes doing interleaved I/O, | |
2397 | * the throughput reached by the device is likely to be the | |
2398 | * same, with and without queue merging. | |
2399 | * | |
2400 | * Disabling merging also provides a remarkable benefit in | |
2401 | * terms of throughput. Merging tends to make many workloads | |
2402 | * artificially more uneven, because of shared queues | |
2403 | * remaining non empty for incomparably more time than | |
2404 | * non-merged queues. This may accentuate workload | |
2405 | * asymmetries. For example, if one of the queues in a set of | |
2406 | * merged queues has a higher weight than a normal queue, then | |
2407 | * the shared queue may inherit such a high weight and, by | |
2408 | * staying almost always active, may force BFQ to perform I/O | |
2409 | * plugging most of the time. This evidently makes it harder | |
2410 | * for BFQ to let the device reach a high throughput. | |
2411 | * | |
2412 | * Finally, the likely() macro below is not used because one | |
2413 | * of the two branches is more likely than the other, but to | |
2414 | * have the code path after the following if() executed as | |
2415 | * fast as possible for the case of a non rotational device | |
2416 | * with queueing. We want it because this is the fastest kind | |
2417 | * of device. On the opposite end, the likely() may lengthen | |
2418 | * the execution time of BFQ for the case of slower devices | |
2419 | * (rotational or at least without queueing). But in this case | |
2420 | * the execution time of BFQ matters very little, if not at | |
2421 | * all. | |
2422 | */ | |
2423 | if (likely(bfqd->nonrot_with_queueing)) | |
2424 | return NULL; | |
2425 | ||
7b8fa3b9 PV |
2426 | /* |
2427 | * Prevent bfqq from being merged if it has been created too | |
2428 | * long ago. The idea is that true cooperating processes, and | |
2429 | * thus their associated bfq_queues, are supposed to be | |
2430 | * created shortly after each other. This is the case, e.g., | |
2431 | * for KVM/QEMU and dump I/O threads. Basing on this | |
2432 | * assumption, the following filtering greatly reduces the | |
2433 | * probability that two non-cooperating processes, which just | |
2434 | * happen to do close I/O for some short time interval, have | |
2435 | * their queues merged by mistake. | |
2436 | */ | |
2437 | if (bfq_too_late_for_merging(bfqq)) | |
2438 | return NULL; | |
2439 | ||
36eca894 AA |
2440 | if (bfqq->new_bfqq) |
2441 | return bfqq->new_bfqq; | |
2442 | ||
4403e4e4 | 2443 | if (!io_struct || unlikely(bfqq == &bfqd->oom_bfqq)) |
36eca894 AA |
2444 | return NULL; |
2445 | ||
2446 | /* If there is only one backlogged queue, don't search. */ | |
73d58118 | 2447 | if (bfq_tot_busy_queues(bfqd) == 1) |
36eca894 AA |
2448 | return NULL; |
2449 | ||
2450 | in_service_bfqq = bfqd->in_service_queue; | |
2451 | ||
4403e4e4 AR |
2452 | if (in_service_bfqq && in_service_bfqq != bfqq && |
2453 | likely(in_service_bfqq != &bfqd->oom_bfqq) && | |
058fdecc PV |
2454 | bfq_rq_close_to_sector(io_struct, request, |
2455 | bfqd->in_serv_last_pos) && | |
36eca894 AA |
2456 | bfqq->entity.parent == in_service_bfqq->entity.parent && |
2457 | bfq_may_be_close_cooperator(bfqq, in_service_bfqq)) { | |
2458 | new_bfqq = bfq_setup_merge(bfqq, in_service_bfqq); | |
2459 | if (new_bfqq) | |
2460 | return new_bfqq; | |
2461 | } | |
2462 | /* | |
2463 | * Check whether there is a cooperator among currently scheduled | |
2464 | * queues. The only thing we need is that the bio/request is not | |
2465 | * NULL, as we need it to establish whether a cooperator exists. | |
2466 | */ | |
36eca894 AA |
2467 | new_bfqq = bfq_find_close_cooperator(bfqd, bfqq, |
2468 | bfq_io_struct_pos(io_struct, request)); | |
2469 | ||
4403e4e4 | 2470 | if (new_bfqq && likely(new_bfqq != &bfqd->oom_bfqq) && |
36eca894 AA |
2471 | bfq_may_be_close_cooperator(bfqq, new_bfqq)) |
2472 | return bfq_setup_merge(bfqq, new_bfqq); | |
2473 | ||
2474 | return NULL; | |
2475 | } | |
2476 | ||
2477 | static void bfq_bfqq_save_state(struct bfq_queue *bfqq) | |
2478 | { | |
2479 | struct bfq_io_cq *bic = bfqq->bic; | |
2480 | ||
2481 | /* | |
2482 | * If !bfqq->bic, the queue is already shared or its requests | |
2483 | * have already been redirected to a shared queue; both idle window | |
2484 | * and weight raising state have already been saved. Do nothing. | |
2485 | */ | |
2486 | if (!bic) | |
2487 | return; | |
2488 | ||
2489 | bic->saved_ttime = bfqq->ttime; | |
d5be3fef | 2490 | bic->saved_has_short_ttime = bfq_bfqq_has_short_ttime(bfqq); |
36eca894 | 2491 | bic->saved_IO_bound = bfq_bfqq_IO_bound(bfqq); |
e1b2324d AA |
2492 | bic->saved_in_large_burst = bfq_bfqq_in_large_burst(bfqq); |
2493 | bic->was_in_burst_list = !hlist_unhashed(&bfqq->burst_list_node); | |
894df937 | 2494 | if (unlikely(bfq_bfqq_just_created(bfqq) && |
1be6e8a9 AR |
2495 | !bfq_bfqq_in_large_burst(bfqq) && |
2496 | bfqq->bfqd->low_latency)) { | |
894df937 PV |
2497 | /* |
2498 | * bfqq being merged right after being created: bfqq | |
2499 | * would have deserved interactive weight raising, but | |
2500 | * did not make it to be set in a weight-raised state, | |
2501 | * because of this early merge. Store directly the | |
2502 | * weight-raising state that would have been assigned | |
2503 | * to bfqq, so that to avoid that bfqq unjustly fails | |
2504 | * to enjoy weight raising if split soon. | |
2505 | */ | |
2506 | bic->saved_wr_coeff = bfqq->bfqd->bfq_wr_coeff; | |
2507 | bic->saved_wr_cur_max_time = bfq_wr_duration(bfqq->bfqd); | |
2508 | bic->saved_last_wr_start_finish = jiffies; | |
2509 | } else { | |
2510 | bic->saved_wr_coeff = bfqq->wr_coeff; | |
2511 | bic->saved_wr_start_at_switch_to_srt = | |
2512 | bfqq->wr_start_at_switch_to_srt; | |
2513 | bic->saved_last_wr_start_finish = bfqq->last_wr_start_finish; | |
2514 | bic->saved_wr_cur_max_time = bfqq->wr_cur_max_time; | |
2515 | } | |
36eca894 AA |
2516 | } |
2517 | ||
36eca894 AA |
2518 | static void |
2519 | bfq_merge_bfqqs(struct bfq_data *bfqd, struct bfq_io_cq *bic, | |
2520 | struct bfq_queue *bfqq, struct bfq_queue *new_bfqq) | |
2521 | { | |
2522 | bfq_log_bfqq(bfqd, bfqq, "merging with queue %lu", | |
2523 | (unsigned long)new_bfqq->pid); | |
2524 | /* Save weight raising and idle window of the merged queues */ | |
2525 | bfq_bfqq_save_state(bfqq); | |
2526 | bfq_bfqq_save_state(new_bfqq); | |
2527 | if (bfq_bfqq_IO_bound(bfqq)) | |
2528 | bfq_mark_bfqq_IO_bound(new_bfqq); | |
2529 | bfq_clear_bfqq_IO_bound(bfqq); | |
2530 | ||
2531 | /* | |
2532 | * If bfqq is weight-raised, then let new_bfqq inherit | |
2533 | * weight-raising. To reduce false positives, neglect the case | |
2534 | * where bfqq has just been created, but has not yet made it | |
2535 | * to be weight-raised (which may happen because EQM may merge | |
2536 | * bfqq even before bfq_add_request is executed for the first | |
e1b2324d AA |
2537 | * time for bfqq). Handling this case would however be very |
2538 | * easy, thanks to the flag just_created. | |
36eca894 AA |
2539 | */ |
2540 | if (new_bfqq->wr_coeff == 1 && bfqq->wr_coeff > 1) { | |
2541 | new_bfqq->wr_coeff = bfqq->wr_coeff; | |
2542 | new_bfqq->wr_cur_max_time = bfqq->wr_cur_max_time; | |
2543 | new_bfqq->last_wr_start_finish = bfqq->last_wr_start_finish; | |
2544 | new_bfqq->wr_start_at_switch_to_srt = | |
2545 | bfqq->wr_start_at_switch_to_srt; | |
2546 | if (bfq_bfqq_busy(new_bfqq)) | |
2547 | bfqd->wr_busy_queues++; | |
2548 | new_bfqq->entity.prio_changed = 1; | |
2549 | } | |
2550 | ||
2551 | if (bfqq->wr_coeff > 1) { /* bfqq has given its wr to new_bfqq */ | |
2552 | bfqq->wr_coeff = 1; | |
2553 | bfqq->entity.prio_changed = 1; | |
2554 | if (bfq_bfqq_busy(bfqq)) | |
2555 | bfqd->wr_busy_queues--; | |
2556 | } | |
2557 | ||
2558 | bfq_log_bfqq(bfqd, new_bfqq, "merge_bfqqs: wr_busy %d", | |
2559 | bfqd->wr_busy_queues); | |
2560 | ||
36eca894 AA |
2561 | /* |
2562 | * Merge queues (that is, let bic redirect its requests to new_bfqq) | |
2563 | */ | |
2564 | bic_set_bfqq(bic, new_bfqq, 1); | |
2565 | bfq_mark_bfqq_coop(new_bfqq); | |
2566 | /* | |
2567 | * new_bfqq now belongs to at least two bics (it is a shared queue): | |
2568 | * set new_bfqq->bic to NULL. bfqq either: | |
2569 | * - does not belong to any bic any more, and hence bfqq->bic must | |
2570 | * be set to NULL, or | |
2571 | * - is a queue whose owning bics have already been redirected to a | |
2572 | * different queue, hence the queue is destined to not belong to | |
2573 | * any bic soon and bfqq->bic is already NULL (therefore the next | |
2574 | * assignment causes no harm). | |
2575 | */ | |
2576 | new_bfqq->bic = NULL; | |
2577 | bfqq->bic = NULL; | |
2578 | /* release process reference to bfqq */ | |
2579 | bfq_put_queue(bfqq); | |
2580 | } | |
2581 | ||
aee69d78 PV |
2582 | static bool bfq_allow_bio_merge(struct request_queue *q, struct request *rq, |
2583 | struct bio *bio) | |
2584 | { | |
2585 | struct bfq_data *bfqd = q->elevator->elevator_data; | |
2586 | bool is_sync = op_is_sync(bio->bi_opf); | |
36eca894 | 2587 | struct bfq_queue *bfqq = bfqd->bio_bfqq, *new_bfqq; |
aee69d78 PV |
2588 | |
2589 | /* | |
2590 | * Disallow merge of a sync bio into an async request. | |
2591 | */ | |
2592 | if (is_sync && !rq_is_sync(rq)) | |
2593 | return false; | |
2594 | ||
2595 | /* | |
2596 | * Lookup the bfqq that this bio will be queued with. Allow | |
2597 | * merge only if rq is queued there. | |
2598 | */ | |
2599 | if (!bfqq) | |
2600 | return false; | |
2601 | ||
36eca894 AA |
2602 | /* |
2603 | * We take advantage of this function to perform an early merge | |
2604 | * of the queues of possible cooperating processes. | |
2605 | */ | |
2606 | new_bfqq = bfq_setup_cooperator(bfqd, bfqq, bio, false); | |
2607 | if (new_bfqq) { | |
2608 | /* | |
2609 | * bic still points to bfqq, then it has not yet been | |
2610 | * redirected to some other bfq_queue, and a queue | |
2611 | * merge beween bfqq and new_bfqq can be safely | |
2612 | * fulfillled, i.e., bic can be redirected to new_bfqq | |
2613 | * and bfqq can be put. | |
2614 | */ | |
2615 | bfq_merge_bfqqs(bfqd, bfqd->bio_bic, bfqq, | |
2616 | new_bfqq); | |
2617 | /* | |
2618 | * If we get here, bio will be queued into new_queue, | |
2619 | * so use new_bfqq to decide whether bio and rq can be | |
2620 | * merged. | |
2621 | */ | |
2622 | bfqq = new_bfqq; | |
2623 | ||
2624 | /* | |
2625 | * Change also bqfd->bio_bfqq, as | |
2626 | * bfqd->bio_bic now points to new_bfqq, and | |
2627 | * this function may be invoked again (and then may | |
2628 | * use again bqfd->bio_bfqq). | |
2629 | */ | |
2630 | bfqd->bio_bfqq = bfqq; | |
2631 | } | |
2632 | ||
aee69d78 PV |
2633 | return bfqq == RQ_BFQQ(rq); |
2634 | } | |
2635 | ||
44e44a1b PV |
2636 | /* |
2637 | * Set the maximum time for the in-service queue to consume its | |
2638 | * budget. This prevents seeky processes from lowering the throughput. | |
2639 | * In practice, a time-slice service scheme is used with seeky | |
2640 | * processes. | |
2641 | */ | |
2642 | static void bfq_set_budget_timeout(struct bfq_data *bfqd, | |
2643 | struct bfq_queue *bfqq) | |
2644 | { | |
77b7dcea PV |
2645 | unsigned int timeout_coeff; |
2646 | ||
2647 | if (bfqq->wr_cur_max_time == bfqd->bfq_wr_rt_max_time) | |
2648 | timeout_coeff = 1; | |
2649 | else | |
2650 | timeout_coeff = bfqq->entity.weight / bfqq->entity.orig_weight; | |
2651 | ||
44e44a1b PV |
2652 | bfqd->last_budget_start = ktime_get(); |
2653 | ||
2654 | bfqq->budget_timeout = jiffies + | |
77b7dcea | 2655 | bfqd->bfq_timeout * timeout_coeff; |
44e44a1b PV |
2656 | } |
2657 | ||
aee69d78 PV |
2658 | static void __bfq_set_in_service_queue(struct bfq_data *bfqd, |
2659 | struct bfq_queue *bfqq) | |
2660 | { | |
2661 | if (bfqq) { | |
aee69d78 PV |
2662 | bfq_clear_bfqq_fifo_expire(bfqq); |
2663 | ||
2664 | bfqd->budgets_assigned = (bfqd->budgets_assigned * 7 + 256) / 8; | |
2665 | ||
77b7dcea PV |
2666 | if (time_is_before_jiffies(bfqq->last_wr_start_finish) && |
2667 | bfqq->wr_coeff > 1 && | |
2668 | bfqq->wr_cur_max_time == bfqd->bfq_wr_rt_max_time && | |
2669 | time_is_before_jiffies(bfqq->budget_timeout)) { | |
2670 | /* | |
2671 | * For soft real-time queues, move the start | |
2672 | * of the weight-raising period forward by the | |
2673 | * time the queue has not received any | |
2674 | * service. Otherwise, a relatively long | |
2675 | * service delay is likely to cause the | |
2676 | * weight-raising period of the queue to end, | |
2677 | * because of the short duration of the | |
2678 | * weight-raising period of a soft real-time | |
2679 | * queue. It is worth noting that this move | |
2680 | * is not so dangerous for the other queues, | |
2681 | * because soft real-time queues are not | |
2682 | * greedy. | |
2683 | * | |
2684 | * To not add a further variable, we use the | |
2685 | * overloaded field budget_timeout to | |
2686 | * determine for how long the queue has not | |
2687 | * received service, i.e., how much time has | |
2688 | * elapsed since the queue expired. However, | |
2689 | * this is a little imprecise, because | |
2690 | * budget_timeout is set to jiffies if bfqq | |
2691 | * not only expires, but also remains with no | |
2692 | * request. | |
2693 | */ | |
2694 | if (time_after(bfqq->budget_timeout, | |
2695 | bfqq->last_wr_start_finish)) | |
2696 | bfqq->last_wr_start_finish += | |
2697 | jiffies - bfqq->budget_timeout; | |
2698 | else | |
2699 | bfqq->last_wr_start_finish = jiffies; | |
2700 | } | |
2701 | ||
44e44a1b | 2702 | bfq_set_budget_timeout(bfqd, bfqq); |
aee69d78 PV |
2703 | bfq_log_bfqq(bfqd, bfqq, |
2704 | "set_in_service_queue, cur-budget = %d", | |
2705 | bfqq->entity.budget); | |
2706 | } | |
2707 | ||
2708 | bfqd->in_service_queue = bfqq; | |
2709 | } | |
2710 | ||
2711 | /* | |
2712 | * Get and set a new queue for service. | |
2713 | */ | |
2714 | static struct bfq_queue *bfq_set_in_service_queue(struct bfq_data *bfqd) | |
2715 | { | |
2716 | struct bfq_queue *bfqq = bfq_get_next_queue(bfqd); | |
2717 | ||
2718 | __bfq_set_in_service_queue(bfqd, bfqq); | |
2719 | return bfqq; | |
2720 | } | |
2721 | ||
aee69d78 PV |
2722 | static void bfq_arm_slice_timer(struct bfq_data *bfqd) |
2723 | { | |
2724 | struct bfq_queue *bfqq = bfqd->in_service_queue; | |
aee69d78 PV |
2725 | u32 sl; |
2726 | ||
aee69d78 PV |
2727 | bfq_mark_bfqq_wait_request(bfqq); |
2728 | ||
2729 | /* | |
2730 | * We don't want to idle for seeks, but we do want to allow | |
2731 | * fair distribution of slice time for a process doing back-to-back | |
2732 | * seeks. So allow a little bit of time for him to submit a new rq. | |
2733 | */ | |
2734 | sl = bfqd->bfq_slice_idle; | |
2735 | /* | |
1de0c4cd AA |
2736 | * Unless the queue is being weight-raised or the scenario is |
2737 | * asymmetric, grant only minimum idle time if the queue | |
2738 | * is seeky. A long idling is preserved for a weight-raised | |
2739 | * queue, or, more in general, in an asymmetric scenario, | |
2740 | * because a long idling is needed for guaranteeing to a queue | |
2741 | * its reserved share of the throughput (in particular, it is | |
2742 | * needed if the queue has a higher weight than some other | |
2743 | * queue). | |
aee69d78 | 2744 | */ |
1de0c4cd | 2745 | if (BFQQ_SEEKY(bfqq) && bfqq->wr_coeff == 1 && |
fb53ac6c | 2746 | !bfq_asymmetric_scenario(bfqd, bfqq)) |
aee69d78 | 2747 | sl = min_t(u64, sl, BFQ_MIN_TT); |
778c02a2 PV |
2748 | else if (bfqq->wr_coeff > 1) |
2749 | sl = max_t(u32, sl, 20ULL * NSEC_PER_MSEC); | |
aee69d78 PV |
2750 | |
2751 | bfqd->last_idling_start = ktime_get(); | |
2341d662 PV |
2752 | bfqd->last_idling_start_jiffies = jiffies; |
2753 | ||
aee69d78 PV |
2754 | hrtimer_start(&bfqd->idle_slice_timer, ns_to_ktime(sl), |
2755 | HRTIMER_MODE_REL); | |
e21b7a0b | 2756 | bfqg_stats_set_start_idle_time(bfqq_group(bfqq)); |
aee69d78 PV |
2757 | } |
2758 | ||
ab0e43e9 PV |
2759 | /* |
2760 | * In autotuning mode, max_budget is dynamically recomputed as the | |
2761 | * amount of sectors transferred in timeout at the estimated peak | |
2762 | * rate. This enables BFQ to utilize a full timeslice with a full | |
2763 | * budget, even if the in-service queue is served at peak rate. And | |
2764 | * this maximises throughput with sequential workloads. | |
2765 | */ | |
2766 | static unsigned long bfq_calc_max_budget(struct bfq_data *bfqd) | |
2767 | { | |
2768 | return (u64)bfqd->peak_rate * USEC_PER_MSEC * | |
2769 | jiffies_to_msecs(bfqd->bfq_timeout)>>BFQ_RATE_SHIFT; | |
2770 | } | |
2771 | ||
44e44a1b PV |
2772 | /* |
2773 | * Update parameters related to throughput and responsiveness, as a | |
2774 | * function of the estimated peak rate. See comments on | |
e24f1c24 | 2775 | * bfq_calc_max_budget(), and on the ref_wr_duration array. |
44e44a1b PV |
2776 | */ |
2777 | static void update_thr_responsiveness_params(struct bfq_data *bfqd) | |
2778 | { | |
e24f1c24 | 2779 | if (bfqd->bfq_user_max_budget == 0) { |
44e44a1b PV |
2780 | bfqd->bfq_max_budget = |
2781 | bfq_calc_max_budget(bfqd); | |
e24f1c24 | 2782 | bfq_log(bfqd, "new max_budget = %d", bfqd->bfq_max_budget); |
44e44a1b | 2783 | } |
44e44a1b PV |
2784 | } |
2785 | ||
ab0e43e9 PV |
2786 | static void bfq_reset_rate_computation(struct bfq_data *bfqd, |
2787 | struct request *rq) | |
2788 | { | |
2789 | if (rq != NULL) { /* new rq dispatch now, reset accordingly */ | |
2790 | bfqd->last_dispatch = bfqd->first_dispatch = ktime_get_ns(); | |
2791 | bfqd->peak_rate_samples = 1; | |
2792 | bfqd->sequential_samples = 0; | |
2793 | bfqd->tot_sectors_dispatched = bfqd->last_rq_max_size = | |
2794 | blk_rq_sectors(rq); | |
2795 | } else /* no new rq dispatched, just reset the number of samples */ | |
2796 | bfqd->peak_rate_samples = 0; /* full re-init on next disp. */ | |
2797 | ||
2798 | bfq_log(bfqd, | |
2799 | "reset_rate_computation at end, sample %u/%u tot_sects %llu", | |
2800 | bfqd->peak_rate_samples, bfqd->sequential_samples, | |
2801 | bfqd->tot_sectors_dispatched); | |
2802 | } | |
2803 | ||
2804 | static void bfq_update_rate_reset(struct bfq_data *bfqd, struct request *rq) | |
2805 | { | |
2806 | u32 rate, weight, divisor; | |
2807 | ||
2808 | /* | |
2809 | * For the convergence property to hold (see comments on | |
2810 | * bfq_update_peak_rate()) and for the assessment to be | |
2811 | * reliable, a minimum number of samples must be present, and | |
2812 | * a minimum amount of time must have elapsed. If not so, do | |
2813 | * not compute new rate. Just reset parameters, to get ready | |
2814 | * for a new evaluation attempt. | |
2815 | */ | |
2816 | if (bfqd->peak_rate_samples < BFQ_RATE_MIN_SAMPLES || | |
2817 | bfqd->delta_from_first < BFQ_RATE_MIN_INTERVAL) | |
2818 | goto reset_computation; | |
2819 | ||
2820 | /* | |
2821 | * If a new request completion has occurred after last | |
2822 | * dispatch, then, to approximate the rate at which requests | |
2823 | * have been served by the device, it is more precise to | |
2824 | * extend the observation interval to the last completion. | |
2825 | */ | |
2826 | bfqd->delta_from_first = | |
2827 | max_t(u64, bfqd->delta_from_first, | |
2828 | bfqd->last_completion - bfqd->first_dispatch); | |
2829 | ||
2830 | /* | |
2831 | * Rate computed in sects/usec, and not sects/nsec, for | |
2832 | * precision issues. | |
2833 | */ | |
2834 | rate = div64_ul(bfqd->tot_sectors_dispatched<<BFQ_RATE_SHIFT, | |
2835 | div_u64(bfqd->delta_from_first, NSEC_PER_USEC)); | |
2836 | ||
2837 | /* | |
2838 | * Peak rate not updated if: | |
2839 | * - the percentage of sequential dispatches is below 3/4 of the | |
2840 | * total, and rate is below the current estimated peak rate | |
2841 | * - rate is unreasonably high (> 20M sectors/sec) | |
2842 | */ | |
2843 | if ((bfqd->sequential_samples < (3 * bfqd->peak_rate_samples)>>2 && | |
2844 | rate <= bfqd->peak_rate) || | |
2845 | rate > 20<<BFQ_RATE_SHIFT) | |
2846 | goto reset_computation; | |
2847 | ||
2848 | /* | |
2849 | * We have to update the peak rate, at last! To this purpose, | |
2850 | * we use a low-pass filter. We compute the smoothing constant | |
2851 | * of the filter as a function of the 'weight' of the new | |
2852 | * measured rate. | |
2853 | * | |
2854 | * As can be seen in next formulas, we define this weight as a | |
2855 | * quantity proportional to how sequential the workload is, | |
2856 | * and to how long the observation time interval is. | |
2857 | * | |
2858 | * The weight runs from 0 to 8. The maximum value of the | |
2859 | * weight, 8, yields the minimum value for the smoothing | |
2860 | * constant. At this minimum value for the smoothing constant, | |
2861 | * the measured rate contributes for half of the next value of | |
2862 | * the estimated peak rate. | |
2863 | * | |
2864 | * So, the first step is to compute the weight as a function | |
2865 | * of how sequential the workload is. Note that the weight | |
2866 | * cannot reach 9, because bfqd->sequential_samples cannot | |
2867 | * become equal to bfqd->peak_rate_samples, which, in its | |
2868 | * turn, holds true because bfqd->sequential_samples is not | |
2869 | * incremented for the first sample. | |
2870 | */ | |
2871 | weight = (9 * bfqd->sequential_samples) / bfqd->peak_rate_samples; | |
2872 | ||
2873 | /* | |
2874 | * Second step: further refine the weight as a function of the | |
2875 | * duration of the observation interval. | |
2876 | */ | |
2877 | weight = min_t(u32, 8, | |
2878 | div_u64(weight * bfqd->delta_from_first, | |
2879 | BFQ_RATE_REF_INTERVAL)); | |
2880 | ||
2881 | /* | |
2882 | * Divisor ranging from 10, for minimum weight, to 2, for | |
2883 | * maximum weight. | |
2884 | */ | |
2885 | divisor = 10 - weight; | |
2886 | ||
2887 | /* | |
2888 | * Finally, update peak rate: | |
2889 | * | |
2890 | * peak_rate = peak_rate * (divisor-1) / divisor + rate / divisor | |
2891 | */ | |
2892 | bfqd->peak_rate *= divisor-1; | |
2893 | bfqd->peak_rate /= divisor; | |
2894 | rate /= divisor; /* smoothing constant alpha = 1/divisor */ | |
2895 | ||
2896 | bfqd->peak_rate += rate; | |
bc56e2ca PV |
2897 | |
2898 | /* | |
2899 | * For a very slow device, bfqd->peak_rate can reach 0 (see | |
2900 | * the minimum representable values reported in the comments | |
2901 | * on BFQ_RATE_SHIFT). Push to 1 if this happens, to avoid | |
2902 | * divisions by zero where bfqd->peak_rate is used as a | |
2903 | * divisor. | |
2904 | */ | |
2905 | bfqd->peak_rate = max_t(u32, 1, bfqd->peak_rate); | |
2906 | ||
44e44a1b | 2907 | update_thr_responsiveness_params(bfqd); |
ab0e43e9 PV |
2908 | |
2909 | reset_computation: | |
2910 | bfq_reset_rate_computation(bfqd, rq); | |
2911 | } | |
2912 | ||
2913 | /* | |
2914 | * Update the read/write peak rate (the main quantity used for | |
2915 | * auto-tuning, see update_thr_responsiveness_params()). | |
2916 | * | |
2917 | * It is not trivial to estimate the peak rate (correctly): because of | |
2918 | * the presence of sw and hw queues between the scheduler and the | |
2919 | * device components that finally serve I/O requests, it is hard to | |
2920 | * say exactly when a given dispatched request is served inside the | |
2921 | * device, and for how long. As a consequence, it is hard to know | |
2922 | * precisely at what rate a given set of requests is actually served | |
2923 | * by the device. | |
2924 | * | |
2925 | * On the opposite end, the dispatch time of any request is trivially | |
2926 | * available, and, from this piece of information, the "dispatch rate" | |
2927 | * of requests can be immediately computed. So, the idea in the next | |
2928 | * function is to use what is known, namely request dispatch times | |
2929 | * (plus, when useful, request completion times), to estimate what is | |
2930 | * unknown, namely in-device request service rate. | |
2931 | * | |
2932 | * The main issue is that, because of the above facts, the rate at | |
2933 | * which a certain set of requests is dispatched over a certain time | |
2934 | * interval can vary greatly with respect to the rate at which the | |
2935 | * same requests are then served. But, since the size of any | |
2936 | * intermediate queue is limited, and the service scheme is lossless | |
2937 | * (no request is silently dropped), the following obvious convergence | |
2938 | * property holds: the number of requests dispatched MUST become | |
2939 | * closer and closer to the number of requests completed as the | |
2940 | * observation interval grows. This is the key property used in | |
2941 | * the next function to estimate the peak service rate as a function | |
2942 | * of the observed dispatch rate. The function assumes to be invoked | |
2943 | * on every request dispatch. | |
2944 | */ | |
2945 | static void bfq_update_peak_rate(struct bfq_data *bfqd, struct request *rq) | |
2946 | { | |
2947 | u64 now_ns = ktime_get_ns(); | |
2948 | ||
2949 | if (bfqd->peak_rate_samples == 0) { /* first dispatch */ | |
2950 | bfq_log(bfqd, "update_peak_rate: goto reset, samples %d", | |
2951 | bfqd->peak_rate_samples); | |
2952 | bfq_reset_rate_computation(bfqd, rq); | |
2953 | goto update_last_values; /* will add one sample */ | |
2954 | } | |
2955 | ||
2956 | /* | |
2957 | * Device idle for very long: the observation interval lasting | |
2958 | * up to this dispatch cannot be a valid observation interval | |
2959 | * for computing a new peak rate (similarly to the late- | |
2960 | * completion event in bfq_completed_request()). Go to | |
2961 | * update_rate_and_reset to have the following three steps | |
2962 | * taken: | |
2963 | * - close the observation interval at the last (previous) | |
2964 | * request dispatch or completion | |
2965 | * - compute rate, if possible, for that observation interval | |
2966 | * - start a new observation interval with this dispatch | |
2967 | */ | |
2968 | if (now_ns - bfqd->last_dispatch > 100*NSEC_PER_MSEC && | |
2969 | bfqd->rq_in_driver == 0) | |
2970 | goto update_rate_and_reset; | |
2971 | ||
2972 | /* Update sampling information */ | |
2973 | bfqd->peak_rate_samples++; | |
2974 | ||
2975 | if ((bfqd->rq_in_driver > 0 || | |
2976 | now_ns - bfqd->last_completion < BFQ_MIN_TT) | |
d87447d8 | 2977 | && !BFQ_RQ_SEEKY(bfqd, bfqd->last_position, rq)) |
ab0e43e9 PV |
2978 | bfqd->sequential_samples++; |
2979 | ||
2980 | bfqd->tot_sectors_dispatched += blk_rq_sectors(rq); | |
2981 | ||
2982 | /* Reset max observed rq size every 32 dispatches */ | |
2983 | if (likely(bfqd->peak_rate_samples % 32)) | |
2984 | bfqd->last_rq_max_size = | |
2985 | max_t(u32, blk_rq_sectors(rq), bfqd->last_rq_max_size); | |
2986 | else | |
2987 | bfqd->last_rq_max_size = blk_rq_sectors(rq); | |
2988 | ||
2989 | bfqd->delta_from_first = now_ns - bfqd->first_dispatch; | |
2990 | ||
2991 | /* Target observation interval not yet reached, go on sampling */ | |
2992 | if (bfqd->delta_from_first < BFQ_RATE_REF_INTERVAL) | |
2993 | goto update_last_values; | |
2994 | ||
2995 | update_rate_and_reset: | |
2996 | bfq_update_rate_reset(bfqd, rq); | |
2997 | update_last_values: | |
2998 | bfqd->last_position = blk_rq_pos(rq) + blk_rq_sectors(rq); | |
058fdecc PV |
2999 | if (RQ_BFQQ(rq) == bfqd->in_service_queue) |
3000 | bfqd->in_serv_last_pos = bfqd->last_position; | |
ab0e43e9 PV |
3001 | bfqd->last_dispatch = now_ns; |
3002 | } | |
3003 | ||
aee69d78 PV |
3004 | /* |
3005 | * Remove request from internal lists. | |
3006 | */ | |
3007 | static void bfq_dispatch_remove(struct request_queue *q, struct request *rq) | |
3008 | { | |
3009 | struct bfq_queue *bfqq = RQ_BFQQ(rq); | |
3010 | ||
3011 | /* | |
3012 | * For consistency, the next instruction should have been | |
3013 | * executed after removing the request from the queue and | |
3014 | * dispatching it. We execute instead this instruction before | |
3015 | * bfq_remove_request() (and hence introduce a temporary | |
3016 | * inconsistency), for efficiency. In fact, should this | |
3017 | * dispatch occur for a non in-service bfqq, this anticipated | |
3018 | * increment prevents two counters related to bfqq->dispatched | |
3019 | * from risking to be, first, uselessly decremented, and then | |
3020 | * incremented again when the (new) value of bfqq->dispatched | |
3021 | * happens to be taken into account. | |
3022 | */ | |
3023 | bfqq->dispatched++; | |
ab0e43e9 | 3024 | bfq_update_peak_rate(q->elevator->elevator_data, rq); |
aee69d78 PV |
3025 | |
3026 | bfq_remove_request(q, rq); | |
3027 | } | |
3028 | ||
3029 | static void __bfq_bfqq_expire(struct bfq_data *bfqd, struct bfq_queue *bfqq) | |
3030 | { | |
36eca894 AA |
3031 | /* |
3032 | * If this bfqq is shared between multiple processes, check | |
3033 | * to make sure that those processes are still issuing I/Os | |
3034 | * within the mean seek distance. If not, it may be time to | |
3035 | * break the queues apart again. | |
3036 | */ | |
3037 | if (bfq_bfqq_coop(bfqq) && BFQQ_SEEKY(bfqq)) | |
3038 | bfq_mark_bfqq_split_coop(bfqq); | |
3039 | ||
44e44a1b PV |
3040 | if (RB_EMPTY_ROOT(&bfqq->sort_list)) { |
3041 | if (bfqq->dispatched == 0) | |
3042 | /* | |
3043 | * Overloading budget_timeout field to store | |
3044 | * the time at which the queue remains with no | |
3045 | * backlog and no outstanding request; used by | |
3046 | * the weight-raising mechanism. | |
3047 | */ | |
3048 | bfqq->budget_timeout = jiffies; | |
3049 | ||
e21b7a0b | 3050 | bfq_del_bfqq_busy(bfqd, bfqq, true); |
36eca894 | 3051 | } else { |
80294c3b | 3052 | bfq_requeue_bfqq(bfqd, bfqq, true); |
36eca894 AA |
3053 | /* |
3054 | * Resort priority tree of potential close cooperators. | |
8cacc5ab | 3055 | * See comments on bfq_pos_tree_add_move() for the unlikely(). |
36eca894 | 3056 | */ |
8cacc5ab PV |
3057 | if (unlikely(!bfqd->nonrot_with_queueing)) |
3058 | bfq_pos_tree_add_move(bfqd, bfqq); | |
36eca894 | 3059 | } |
e21b7a0b AA |
3060 | |
3061 | /* | |
3062 | * All in-service entities must have been properly deactivated | |
3063 | * or requeued before executing the next function, which | |
3064 | * resets all in-service entites as no more in service. | |
3065 | */ | |
3066 | __bfq_bfqd_reset_in_service(bfqd); | |
aee69d78 PV |
3067 | } |
3068 | ||
3069 | /** | |
3070 | * __bfq_bfqq_recalc_budget - try to adapt the budget to the @bfqq behavior. | |
3071 | * @bfqd: device data. | |
3072 | * @bfqq: queue to update. | |
3073 | * @reason: reason for expiration. | |
3074 | * | |
3075 | * Handle the feedback on @bfqq budget at queue expiration. | |
3076 | * See the body for detailed comments. | |
3077 | */ | |
3078 | static void __bfq_bfqq_recalc_budget(struct bfq_data *bfqd, | |
3079 | struct bfq_queue *bfqq, | |
3080 | enum bfqq_expiration reason) | |
3081 | { | |
3082 | struct request *next_rq; | |
3083 | int budget, min_budget; | |
3084 | ||
aee69d78 PV |
3085 | min_budget = bfq_min_budget(bfqd); |
3086 | ||
44e44a1b PV |
3087 | if (bfqq->wr_coeff == 1) |
3088 | budget = bfqq->max_budget; | |
3089 | else /* | |
3090 | * Use a constant, low budget for weight-raised queues, | |
3091 | * to help achieve a low latency. Keep it slightly higher | |
3092 | * than the minimum possible budget, to cause a little | |
3093 | * bit fewer expirations. | |
3094 | */ | |
3095 | budget = 2 * min_budget; | |
3096 | ||
aee69d78 PV |
3097 | bfq_log_bfqq(bfqd, bfqq, "recalc_budg: last budg %d, budg left %d", |
3098 | bfqq->entity.budget, bfq_bfqq_budget_left(bfqq)); | |
3099 | bfq_log_bfqq(bfqd, bfqq, "recalc_budg: last max_budg %d, min budg %d", | |
3100 | budget, bfq_min_budget(bfqd)); | |
3101 | bfq_log_bfqq(bfqd, bfqq, "recalc_budg: sync %d, seeky %d", | |
3102 | bfq_bfqq_sync(bfqq), BFQQ_SEEKY(bfqd->in_service_queue)); | |
3103 | ||
44e44a1b | 3104 | if (bfq_bfqq_sync(bfqq) && bfqq->wr_coeff == 1) { |
aee69d78 PV |
3105 | switch (reason) { |
3106 | /* | |
3107 | * Caveat: in all the following cases we trade latency | |
3108 | * for throughput. | |
3109 | */ | |
3110 | case BFQQE_TOO_IDLE: | |
54b60456 PV |
3111 | /* |
3112 | * This is the only case where we may reduce | |
3113 | * the budget: if there is no request of the | |
3114 | * process still waiting for completion, then | |
3115 | * we assume (tentatively) that the timer has | |
3116 | * expired because the batch of requests of | |
3117 | * the process could have been served with a | |
3118 | * smaller budget. Hence, betting that | |
3119 | * process will behave in the same way when it | |
3120 | * becomes backlogged again, we reduce its | |
3121 | * next budget. As long as we guess right, | |
3122 | * this budget cut reduces the latency | |
3123 | * experienced by the process. | |
3124 | * | |
3125 | * However, if there are still outstanding | |
3126 | * requests, then the process may have not yet | |
3127 | * issued its next request just because it is | |
3128 | * still waiting for the completion of some of | |
3129 | * the still outstanding ones. So in this | |
3130 | * subcase we do not reduce its budget, on the | |
3131 | * contrary we increase it to possibly boost | |
3132 | * the throughput, as discussed in the | |
3133 | * comments to the BUDGET_TIMEOUT case. | |
3134 | */ | |
3135 | if (bfqq->dispatched > 0) /* still outstanding reqs */ | |
3136 | budget = min(budget * 2, bfqd->bfq_max_budget); | |
3137 | else { | |
3138 | if (budget > 5 * min_budget) | |
3139 | budget -= 4 * min_budget; | |
3140 | else | |
3141 | budget = min_budget; | |
3142 | } | |
aee69d78 PV |
3143 | break; |
3144 | case BFQQE_BUDGET_TIMEOUT: | |
54b60456 PV |
3145 | /* |
3146 | * We double the budget here because it gives | |
3147 | * the chance to boost the throughput if this | |
3148 | * is not a seeky process (and has bumped into | |
3149 | * this timeout because of, e.g., ZBR). | |
3150 | */ | |
3151 | budget = min(budget * 2, bfqd->bfq_max_budget); | |
aee69d78 PV |
3152 | break; |
3153 | case BFQQE_BUDGET_EXHAUSTED: | |
3154 | /* | |
3155 | * The process still has backlog, and did not | |
3156 | * let either the budget timeout or the disk | |
3157 | * idling timeout expire. Hence it is not | |
3158 | * seeky, has a short thinktime and may be | |
3159 | * happy with a higher budget too. So | |
3160 | * definitely increase the budget of this good | |
3161 | * candidate to boost the disk throughput. | |
3162 | */ | |
54b60456 | 3163 | budget = min(budget * 4, bfqd->bfq_max_budget); |
aee69d78 PV |
3164 | break; |
3165 | case BFQQE_NO_MORE_REQUESTS: | |
3166 | /* | |
3167 | * For queues that expire for this reason, it | |
3168 | * is particularly important to keep the | |
3169 | * budget close to the actual service they | |
3170 | * need. Doing so reduces the timestamp | |
3171 | * misalignment problem described in the | |
3172 | * comments in the body of | |
3173 | * __bfq_activate_entity. In fact, suppose | |
3174 | * that a queue systematically expires for | |
3175 | * BFQQE_NO_MORE_REQUESTS and presents a | |
3176 | * new request in time to enjoy timestamp | |
3177 | * back-shifting. The larger the budget of the | |
3178 | * queue is with respect to the service the | |
3179 | * queue actually requests in each service | |
3180 | * slot, the more times the queue can be | |
3181 | * reactivated with the same virtual finish | |
3182 | * time. It follows that, even if this finish | |
3183 | * time is pushed to the system virtual time | |
3184 | * to reduce the consequent timestamp | |
3185 | * misalignment, the queue unjustly enjoys for | |
3186 | * many re-activations a lower finish time | |
3187 | * than all newly activated queues. | |
3188 | * | |
3189 | * The service needed by bfqq is measured | |
3190 | * quite precisely by bfqq->entity.service. | |
3191 | * Since bfqq does not enjoy device idling, | |
3192 | * bfqq->entity.service is equal to the number | |
3193 | * of sectors that the process associated with | |
3194 | * bfqq requested to read/write before waiting | |
3195 | * for request completions, or blocking for | |
3196 | * other reasons. | |
3197 | */ | |
3198 | budget = max_t(int, bfqq->entity.service, min_budget); | |
3199 | break; | |
3200 | default: | |
3201 | return; | |
3202 | } | |
44e44a1b | 3203 | } else if (!bfq_bfqq_sync(bfqq)) { |
aee69d78 PV |
3204 | /* |
3205 | * Async queues get always the maximum possible | |
3206 | * budget, as for them we do not care about latency | |
3207 | * (in addition, their ability to dispatch is limited | |
3208 | * by the charging factor). | |
3209 | */ | |
3210 | budget = bfqd->bfq_max_budget; | |
3211 | } | |
3212 | ||
3213 | bfqq->max_budget = budget; | |
3214 | ||
3215 | if (bfqd->budgets_assigned >= bfq_stats_min_budgets && | |
3216 | !bfqd->bfq_user_max_budget) | |
3217 | bfqq->max_budget = min(bfqq->max_budget, bfqd->bfq_max_budget); | |
3218 | ||
3219 | /* | |
3220 | * If there is still backlog, then assign a new budget, making | |
3221 | * sure that it is large enough for the next request. Since | |
3222 | * the finish time of bfqq must be kept in sync with the | |
3223 | * budget, be sure to call __bfq_bfqq_expire() *after* this | |
3224 | * update. | |
3225 | * | |
3226 | * If there is no backlog, then no need to update the budget; | |
3227 | * it will be updated on the arrival of a new request. | |
3228 | */ | |
3229 | next_rq = bfqq->next_rq; | |
3230 | if (next_rq) | |
3231 | bfqq->entity.budget = max_t(unsigned long, bfqq->max_budget, | |
3232 | bfq_serv_to_charge(next_rq, bfqq)); | |
3233 | ||
3234 | bfq_log_bfqq(bfqd, bfqq, "head sect: %u, new budget %d", | |
3235 | next_rq ? blk_rq_sectors(next_rq) : 0, | |
3236 | bfqq->entity.budget); | |
3237 | } | |
3238 | ||
aee69d78 | 3239 | /* |
ab0e43e9 PV |
3240 | * Return true if the process associated with bfqq is "slow". The slow |
3241 | * flag is used, in addition to the budget timeout, to reduce the | |
3242 | * amount of service provided to seeky processes, and thus reduce | |
3243 | * their chances to lower the throughput. More details in the comments | |
3244 | * on the function bfq_bfqq_expire(). | |
3245 | * | |
3246 | * An important observation is in order: as discussed in the comments | |
3247 | * on the function bfq_update_peak_rate(), with devices with internal | |
3248 | * queues, it is hard if ever possible to know when and for how long | |
3249 | * an I/O request is processed by the device (apart from the trivial | |
3250 | * I/O pattern where a new request is dispatched only after the | |
3251 | * previous one has been completed). This makes it hard to evaluate | |
3252 | * the real rate at which the I/O requests of each bfq_queue are | |
3253 | * served. In fact, for an I/O scheduler like BFQ, serving a | |
3254 | * bfq_queue means just dispatching its requests during its service | |
3255 | * slot (i.e., until the budget of the queue is exhausted, or the | |
3256 | * queue remains idle, or, finally, a timeout fires). But, during the | |
3257 | * service slot of a bfq_queue, around 100 ms at most, the device may | |
3258 | * be even still processing requests of bfq_queues served in previous | |
3259 | * service slots. On the opposite end, the requests of the in-service | |
3260 | * bfq_queue may be completed after the service slot of the queue | |
3261 | * finishes. | |
3262 | * | |
3263 | * Anyway, unless more sophisticated solutions are used | |
3264 | * (where possible), the sum of the sizes of the requests dispatched | |
3265 | * during the service slot of a bfq_queue is probably the only | |
3266 | * approximation available for the service received by the bfq_queue | |
3267 | * during its service slot. And this sum is the quantity used in this | |
3268 | * function to evaluate the I/O speed of a process. | |
aee69d78 | 3269 | */ |
ab0e43e9 PV |
3270 | static bool bfq_bfqq_is_slow(struct bfq_data *bfqd, struct bfq_queue *bfqq, |
3271 | bool compensate, enum bfqq_expiration reason, | |
3272 | unsigned long *delta_ms) | |
aee69d78 | 3273 | { |
ab0e43e9 PV |
3274 | ktime_t delta_ktime; |
3275 | u32 delta_usecs; | |
3276 | bool slow = BFQQ_SEEKY(bfqq); /* if delta too short, use seekyness */ | |
aee69d78 | 3277 | |
ab0e43e9 | 3278 | if (!bfq_bfqq_sync(bfqq)) |
aee69d78 PV |
3279 | return false; |
3280 | ||
3281 | if (compensate) | |
ab0e43e9 | 3282 | delta_ktime = bfqd->last_idling_start; |
aee69d78 | 3283 | else |
ab0e43e9 PV |
3284 | delta_ktime = ktime_get(); |
3285 | delta_ktime = ktime_sub(delta_ktime, bfqd->last_budget_start); | |
3286 | delta_usecs = ktime_to_us(delta_ktime); | |
aee69d78 PV |
3287 | |
3288 | /* don't use too short time intervals */ | |
ab0e43e9 PV |
3289 | if (delta_usecs < 1000) { |
3290 | if (blk_queue_nonrot(bfqd->queue)) | |
3291 | /* | |
3292 | * give same worst-case guarantees as idling | |
3293 | * for seeky | |
3294 | */ | |
3295 | *delta_ms = BFQ_MIN_TT / NSEC_PER_MSEC; | |
3296 | else /* charge at least one seek */ | |
3297 | *delta_ms = bfq_slice_idle / NSEC_PER_MSEC; | |
3298 | ||
3299 | return slow; | |
3300 | } | |
aee69d78 | 3301 | |
ab0e43e9 | 3302 | *delta_ms = delta_usecs / USEC_PER_MSEC; |
aee69d78 PV |
3303 | |
3304 | /* | |
ab0e43e9 PV |
3305 | * Use only long (> 20ms) intervals to filter out excessive |
3306 | * spikes in service rate estimation. | |
aee69d78 | 3307 | */ |
ab0e43e9 PV |
3308 | if (delta_usecs > 20000) { |
3309 | /* | |
3310 | * Caveat for rotational devices: processes doing I/O | |
3311 | * in the slower disk zones tend to be slow(er) even | |
3312 | * if not seeky. In this respect, the estimated peak | |
3313 | * rate is likely to be an average over the disk | |
3314 | * surface. Accordingly, to not be too harsh with | |
3315 | * unlucky processes, a process is deemed slow only if | |
3316 | * its rate has been lower than half of the estimated | |
3317 | * peak rate. | |
3318 | */ | |
3319 | slow = bfqq->entity.service < bfqd->bfq_max_budget / 2; | |
aee69d78 PV |
3320 | } |
3321 | ||
ab0e43e9 | 3322 | bfq_log_bfqq(bfqd, bfqq, "bfq_bfqq_is_slow: slow %d", slow); |
aee69d78 | 3323 | |
ab0e43e9 | 3324 | return slow; |
aee69d78 PV |
3325 | } |
3326 | ||
77b7dcea PV |
3327 | /* |
3328 | * To be deemed as soft real-time, an application must meet two | |
3329 | * requirements. First, the application must not require an average | |
3330 | * bandwidth higher than the approximate bandwidth required to playback or | |
3331 | * record a compressed high-definition video. | |
3332 | * The next function is invoked on the completion of the last request of a | |
3333 | * batch, to compute the next-start time instant, soft_rt_next_start, such | |
3334 | * that, if the next request of the application does not arrive before | |
3335 | * soft_rt_next_start, then the above requirement on the bandwidth is met. | |
3336 | * | |
3337 | * The second requirement is that the request pattern of the application is | |
3338 | * isochronous, i.e., that, after issuing a request or a batch of requests, | |
3339 | * the application stops issuing new requests until all its pending requests | |
3340 | * have been completed. After that, the application may issue a new batch, | |
3341 | * and so on. | |
3342 | * For this reason the next function is invoked to compute | |
3343 | * soft_rt_next_start only for applications that meet this requirement, | |
3344 | * whereas soft_rt_next_start is set to infinity for applications that do | |
3345 | * not. | |
3346 | * | |
a34b0244 PV |
3347 | * Unfortunately, even a greedy (i.e., I/O-bound) application may |
3348 | * happen to meet, occasionally or systematically, both the above | |
3349 | * bandwidth and isochrony requirements. This may happen at least in | |
3350 | * the following circumstances. First, if the CPU load is high. The | |
3351 | * application may stop issuing requests while the CPUs are busy | |
3352 | * serving other processes, then restart, then stop again for a while, | |
3353 | * and so on. The other circumstances are related to the storage | |
3354 | * device: the storage device is highly loaded or reaches a low-enough | |
3355 | * throughput with the I/O of the application (e.g., because the I/O | |
3356 | * is random and/or the device is slow). In all these cases, the | |
3357 | * I/O of the application may be simply slowed down enough to meet | |
3358 | * the bandwidth and isochrony requirements. To reduce the probability | |
3359 | * that greedy applications are deemed as soft real-time in these | |
3360 | * corner cases, a further rule is used in the computation of | |
3361 | * soft_rt_next_start: the return value of this function is forced to | |
3362 | * be higher than the maximum between the following two quantities. | |
3363 | * | |
3364 | * (a) Current time plus: (1) the maximum time for which the arrival | |
3365 | * of a request is waited for when a sync queue becomes idle, | |
3366 | * namely bfqd->bfq_slice_idle, and (2) a few extra jiffies. We | |
3367 | * postpone for a moment the reason for adding a few extra | |
3368 | * jiffies; we get back to it after next item (b). Lower-bounding | |
3369 | * the return value of this function with the current time plus | |
3370 | * bfqd->bfq_slice_idle tends to filter out greedy applications, | |
3371 | * because the latter issue their next request as soon as possible | |
3372 | * after the last one has been completed. In contrast, a soft | |
3373 | * real-time application spends some time processing data, after a | |
3374 | * batch of its requests has been completed. | |
3375 | * | |
3376 | * (b) Current value of bfqq->soft_rt_next_start. As pointed out | |
3377 | * above, greedy applications may happen to meet both the | |
3378 | * bandwidth and isochrony requirements under heavy CPU or | |
3379 | * storage-device load. In more detail, in these scenarios, these | |
3380 | * applications happen, only for limited time periods, to do I/O | |
3381 | * slowly enough to meet all the requirements described so far, | |
3382 | * including the filtering in above item (a). These slow-speed | |
3383 | * time intervals are usually interspersed between other time | |
3384 | * intervals during which these applications do I/O at a very high | |
3385 | * speed. Fortunately, exactly because of the high speed of the | |
3386 | * I/O in the high-speed intervals, the values returned by this | |
3387 | * function happen to be so high, near the end of any such | |
3388 | * high-speed interval, to be likely to fall *after* the end of | |
3389 | * the low-speed time interval that follows. These high values are | |
3390 | * stored in bfqq->soft_rt_next_start after each invocation of | |
3391 | * this function. As a consequence, if the last value of | |
3392 | * bfqq->soft_rt_next_start is constantly used to lower-bound the | |
3393 | * next value that this function may return, then, from the very | |
3394 | * beginning of a low-speed interval, bfqq->soft_rt_next_start is | |
3395 | * likely to be constantly kept so high that any I/O request | |
3396 | * issued during the low-speed interval is considered as arriving | |
3397 | * to soon for the application to be deemed as soft | |
3398 | * real-time. Then, in the high-speed interval that follows, the | |
3399 | * application will not be deemed as soft real-time, just because | |
3400 | * it will do I/O at a high speed. And so on. | |
3401 | * | |
3402 | * Getting back to the filtering in item (a), in the following two | |
3403 | * cases this filtering might be easily passed by a greedy | |
3404 | * application, if the reference quantity was just | |
3405 | * bfqd->bfq_slice_idle: | |
3406 | * 1) HZ is so low that the duration of a jiffy is comparable to or | |
3407 | * higher than bfqd->bfq_slice_idle. This happens, e.g., on slow | |
3408 | * devices with HZ=100. The time granularity may be so coarse | |
3409 | * that the approximation, in jiffies, of bfqd->bfq_slice_idle | |
3410 | * is rather lower than the exact value. | |
77b7dcea PV |
3411 | * 2) jiffies, instead of increasing at a constant rate, may stop increasing |
3412 | * for a while, then suddenly 'jump' by several units to recover the lost | |
3413 | * increments. This seems to happen, e.g., inside virtual machines. | |
a34b0244 PV |
3414 | * To address this issue, in the filtering in (a) we do not use as a |
3415 | * reference time interval just bfqd->bfq_slice_idle, but | |
3416 | * bfqd->bfq_slice_idle plus a few jiffies. In particular, we add the | |
3417 | * minimum number of jiffies for which the filter seems to be quite | |
3418 | * precise also in embedded systems and KVM/QEMU virtual machines. | |
77b7dcea PV |
3419 | */ |
3420 | static unsigned long bfq_bfqq_softrt_next_start(struct bfq_data *bfqd, | |
3421 | struct bfq_queue *bfqq) | |
3422 | { | |
a34b0244 PV |
3423 | return max3(bfqq->soft_rt_next_start, |
3424 | bfqq->last_idle_bklogged + | |
3425 | HZ * bfqq->service_from_backlogged / | |
3426 | bfqd->bfq_wr_max_softrt_rate, | |
3427 | jiffies + nsecs_to_jiffies(bfqq->bfqd->bfq_slice_idle) + 4); | |
77b7dcea PV |
3428 | } |
3429 | ||
aee69d78 PV |
3430 | /** |
3431 | * bfq_bfqq_expire - expire a queue. | |
3432 | * @bfqd: device owning the queue. | |
3433 | * @bfqq: the queue to expire. | |
3434 | * @compensate: if true, compensate for the time spent idling. | |
3435 | * @reason: the reason causing the expiration. | |
3436 | * | |
c074170e PV |
3437 | * If the process associated with bfqq does slow I/O (e.g., because it |
3438 | * issues random requests), we charge bfqq with the time it has been | |
3439 | * in service instead of the service it has received (see | |
3440 | * bfq_bfqq_charge_time for details on how this goal is achieved). As | |
3441 | * a consequence, bfqq will typically get higher timestamps upon | |
3442 | * reactivation, and hence it will be rescheduled as if it had | |
3443 | * received more service than what it has actually received. In the | |
3444 | * end, bfqq receives less service in proportion to how slowly its | |
3445 | * associated process consumes its budgets (and hence how seriously it | |
3446 | * tends to lower the throughput). In addition, this time-charging | |
3447 | * strategy guarantees time fairness among slow processes. In | |
3448 | * contrast, if the process associated with bfqq is not slow, we | |
3449 | * charge bfqq exactly with the service it has received. | |
aee69d78 | 3450 | * |
c074170e PV |
3451 | * Charging time to the first type of queues and the exact service to |
3452 | * the other has the effect of using the WF2Q+ policy to schedule the | |
3453 | * former on a timeslice basis, without violating service domain | |
3454 | * guarantees among the latter. | |
aee69d78 | 3455 | */ |
ea25da48 PV |
3456 | void bfq_bfqq_expire(struct bfq_data *bfqd, |
3457 | struct bfq_queue *bfqq, | |
3458 | bool compensate, | |
3459 | enum bfqq_expiration reason) | |
aee69d78 PV |
3460 | { |
3461 | bool slow; | |
ab0e43e9 PV |
3462 | unsigned long delta = 0; |
3463 | struct bfq_entity *entity = &bfqq->entity; | |
aee69d78 PV |
3464 | int ref; |
3465 | ||
3466 | /* | |
ab0e43e9 | 3467 | * Check whether the process is slow (see bfq_bfqq_is_slow). |
aee69d78 | 3468 | */ |
ab0e43e9 | 3469 | slow = bfq_bfqq_is_slow(bfqd, bfqq, compensate, reason, &delta); |
aee69d78 PV |
3470 | |
3471 | /* | |
c074170e PV |
3472 | * As above explained, charge slow (typically seeky) and |
3473 | * timed-out queues with the time and not the service | |
3474 | * received, to favor sequential workloads. | |
3475 | * | |
3476 | * Processes doing I/O in the slower disk zones will tend to | |
3477 | * be slow(er) even if not seeky. Therefore, since the | |
3478 | * estimated peak rate is actually an average over the disk | |
3479 | * surface, these processes may timeout just for bad luck. To | |
3480 | * avoid punishing them, do not charge time to processes that | |
3481 | * succeeded in consuming at least 2/3 of their budget. This | |
3482 | * allows BFQ to preserve enough elasticity to still perform | |
3483 | * bandwidth, and not time, distribution with little unlucky | |
3484 | * or quasi-sequential processes. | |
aee69d78 | 3485 | */ |
44e44a1b PV |
3486 | if (bfqq->wr_coeff == 1 && |
3487 | (slow || | |
3488 | (reason == BFQQE_BUDGET_TIMEOUT && | |
3489 | bfq_bfqq_budget_left(bfqq) >= entity->budget / 3))) | |
c074170e | 3490 | bfq_bfqq_charge_time(bfqd, bfqq, delta); |
aee69d78 PV |
3491 | |
3492 | if (reason == BFQQE_TOO_IDLE && | |
ab0e43e9 | 3493 | entity->service <= 2 * entity->budget / 10) |
aee69d78 PV |
3494 | bfq_clear_bfqq_IO_bound(bfqq); |
3495 | ||
44e44a1b PV |
3496 | if (bfqd->low_latency && bfqq->wr_coeff == 1) |
3497 | bfqq->last_wr_start_finish = jiffies; | |
3498 | ||
77b7dcea PV |
3499 | if (bfqd->low_latency && bfqd->bfq_wr_max_softrt_rate > 0 && |
3500 | RB_EMPTY_ROOT(&bfqq->sort_list)) { | |
3501 | /* | |
3502 | * If we get here, and there are no outstanding | |
3503 | * requests, then the request pattern is isochronous | |
3504 | * (see the comments on the function | |
3505 | * bfq_bfqq_softrt_next_start()). Thus we can compute | |
20cd3245 PV |
3506 | * soft_rt_next_start. And we do it, unless bfqq is in |
3507 | * interactive weight raising. We do not do it in the | |
3508 | * latter subcase, for the following reason. bfqq may | |
3509 | * be conveying the I/O needed to load a soft | |
3510 | * real-time application. Such an application will | |
3511 | * actually exhibit a soft real-time I/O pattern after | |
3512 | * it finally starts doing its job. But, if | |
3513 | * soft_rt_next_start is computed here for an | |
3514 | * interactive bfqq, and bfqq had received a lot of | |
3515 | * service before remaining with no outstanding | |
3516 | * request (likely to happen on a fast device), then | |
3517 | * soft_rt_next_start would be assigned such a high | |
3518 | * value that, for a very long time, bfqq would be | |
3519 | * prevented from being possibly considered as soft | |
3520 | * real time. | |
3521 | * | |
3522 | * If, instead, the queue still has outstanding | |
3523 | * requests, then we have to wait for the completion | |
3524 | * of all the outstanding requests to discover whether | |
3525 | * the request pattern is actually isochronous. | |
77b7dcea | 3526 | */ |
20cd3245 PV |
3527 | if (bfqq->dispatched == 0 && |
3528 | bfqq->wr_coeff != bfqd->bfq_wr_coeff) | |
77b7dcea PV |
3529 | bfqq->soft_rt_next_start = |
3530 | bfq_bfqq_softrt_next_start(bfqd, bfqq); | |
20cd3245 | 3531 | else if (bfqq->dispatched > 0) { |
77b7dcea PV |
3532 | /* |
3533 | * Schedule an update of soft_rt_next_start to when | |
3534 | * the task may be discovered to be isochronous. | |
3535 | */ | |
3536 | bfq_mark_bfqq_softrt_update(bfqq); | |
3537 | } | |
3538 | } | |
3539 | ||
aee69d78 | 3540 | bfq_log_bfqq(bfqd, bfqq, |
d5be3fef PV |
3541 | "expire (%d, slow %d, num_disp %d, short_ttime %d)", reason, |
3542 | slow, bfqq->dispatched, bfq_bfqq_has_short_ttime(bfqq)); | |
aee69d78 | 3543 | |
2341d662 PV |
3544 | /* |
3545 | * bfqq expired, so no total service time needs to be computed | |
3546 | * any longer: reset state machine for measuring total service | |
3547 | * times. | |
3548 | */ | |
3549 | bfqd->rqs_injected = bfqd->wait_dispatch = false; | |
3550 | bfqd->waited_rq = NULL; | |
3551 | ||
aee69d78 PV |
3552 | /* |
3553 | * Increase, decrease or leave budget unchanged according to | |
3554 | * reason. | |
3555 | */ | |
3556 | __bfq_bfqq_recalc_budget(bfqd, bfqq, reason); | |
3557 | ref = bfqq->ref; | |
3558 | __bfq_bfqq_expire(bfqd, bfqq); | |
3559 | ||
9fae8dd5 PV |
3560 | if (ref == 1) /* bfqq is gone, no more actions on it */ |
3561 | return; | |
3562 | ||
aee69d78 | 3563 | /* mark bfqq as waiting a request only if a bic still points to it */ |
9fae8dd5 | 3564 | if (!bfq_bfqq_busy(bfqq) && |
aee69d78 | 3565 | reason != BFQQE_BUDGET_TIMEOUT && |
9fae8dd5 | 3566 | reason != BFQQE_BUDGET_EXHAUSTED) { |
aee69d78 | 3567 | bfq_mark_bfqq_non_blocking_wait_rq(bfqq); |
9fae8dd5 PV |
3568 | /* |
3569 | * Not setting service to 0, because, if the next rq | |
3570 | * arrives in time, the queue will go on receiving | |
3571 | * service with this same budget (as if it never expired) | |
3572 | */ | |
3573 | } else | |
3574 | entity->service = 0; | |
8a511ba5 PV |
3575 | |
3576 | /* | |
3577 | * Reset the received-service counter for every parent entity. | |
3578 | * Differently from what happens with bfqq->entity.service, | |
3579 | * the resetting of this counter never needs to be postponed | |
3580 | * for parent entities. In fact, in case bfqq may have a | |
3581 | * chance to go on being served using the last, partially | |
3582 | * consumed budget, bfqq->entity.service needs to be kept, | |
3583 | * because if bfqq then actually goes on being served using | |
3584 | * the same budget, the last value of bfqq->entity.service is | |
3585 | * needed to properly decrement bfqq->entity.budget by the | |
3586 | * portion already consumed. In contrast, it is not necessary | |
3587 | * to keep entity->service for parent entities too, because | |
3588 | * the bubble up of the new value of bfqq->entity.budget will | |
3589 | * make sure that the budgets of parent entities are correct, | |
3590 | * even in case bfqq and thus parent entities go on receiving | |
3591 | * service with the same budget. | |
3592 | */ | |
3593 | entity = entity->parent; | |
3594 | for_each_entity(entity) | |
3595 | entity->service = 0; | |
aee69d78 PV |
3596 | } |
3597 | ||
3598 | /* | |
3599 | * Budget timeout is not implemented through a dedicated timer, but | |
3600 | * just checked on request arrivals and completions, as well as on | |
3601 | * idle timer expirations. | |
3602 | */ | |
3603 | static bool bfq_bfqq_budget_timeout(struct bfq_queue *bfqq) | |
3604 | { | |
44e44a1b | 3605 | return time_is_before_eq_jiffies(bfqq->budget_timeout); |
aee69d78 PV |
3606 | } |
3607 | ||
3608 | /* | |
3609 | * If we expire a queue that is actively waiting (i.e., with the | |
3610 | * device idled) for the arrival of a new request, then we may incur | |
3611 | * the timestamp misalignment problem described in the body of the | |
3612 | * function __bfq_activate_entity. Hence we return true only if this | |
3613 | * condition does not hold, or if the queue is slow enough to deserve | |
3614 | * only to be kicked off for preserving a high throughput. | |
3615 | */ | |
3616 | static bool bfq_may_expire_for_budg_timeout(struct bfq_queue *bfqq) | |
3617 | { | |
3618 | bfq_log_bfqq(bfqq->bfqd, bfqq, | |
3619 | "may_budget_timeout: wait_request %d left %d timeout %d", | |
3620 | bfq_bfqq_wait_request(bfqq), | |
3621 | bfq_bfqq_budget_left(bfqq) >= bfqq->entity.budget / 3, | |
3622 | bfq_bfqq_budget_timeout(bfqq)); | |
3623 | ||
3624 | return (!bfq_bfqq_wait_request(bfqq) || | |
3625 | bfq_bfqq_budget_left(bfqq) >= bfqq->entity.budget / 3) | |
3626 | && | |
3627 | bfq_bfqq_budget_timeout(bfqq); | |
3628 | } | |
3629 | ||
05c2f5c3 PV |
3630 | static bool idling_boosts_thr_without_issues(struct bfq_data *bfqd, |
3631 | struct bfq_queue *bfqq) | |
aee69d78 | 3632 | { |
edaf9428 PV |
3633 | bool rot_without_queueing = |
3634 | !blk_queue_nonrot(bfqd->queue) && !bfqd->hw_tag, | |
3635 | bfqq_sequential_and_IO_bound, | |
05c2f5c3 | 3636 | idling_boosts_thr; |
d5be3fef | 3637 | |
edaf9428 PV |
3638 | bfqq_sequential_and_IO_bound = !BFQQ_SEEKY(bfqq) && |
3639 | bfq_bfqq_IO_bound(bfqq) && bfq_bfqq_has_short_ttime(bfqq); | |
3640 | ||
aee69d78 | 3641 | /* |
44e44a1b PV |
3642 | * The next variable takes into account the cases where idling |
3643 | * boosts the throughput. | |
3644 | * | |
e01eff01 PV |
3645 | * The value of the variable is computed considering, first, that |
3646 | * idling is virtually always beneficial for the throughput if: | |
edaf9428 PV |
3647 | * (a) the device is not NCQ-capable and rotational, or |
3648 | * (b) regardless of the presence of NCQ, the device is rotational and | |
3649 | * the request pattern for bfqq is I/O-bound and sequential, or | |
3650 | * (c) regardless of whether it is rotational, the device is | |
3651 | * not NCQ-capable and the request pattern for bfqq is | |
3652 | * I/O-bound and sequential. | |
bf2b79e7 PV |
3653 | * |
3654 | * Secondly, and in contrast to the above item (b), idling an | |
3655 | * NCQ-capable flash-based device would not boost the | |
e01eff01 | 3656 | * throughput even with sequential I/O; rather it would lower |
bf2b79e7 PV |
3657 | * the throughput in proportion to how fast the device |
3658 | * is. Accordingly, the next variable is true if any of the | |
edaf9428 PV |
3659 | * above conditions (a), (b) or (c) is true, and, in |
3660 | * particular, happens to be false if bfqd is an NCQ-capable | |
3661 | * flash-based device. | |
aee69d78 | 3662 | */ |
edaf9428 PV |
3663 | idling_boosts_thr = rot_without_queueing || |
3664 | ((!blk_queue_nonrot(bfqd->queue) || !bfqd->hw_tag) && | |
3665 | bfqq_sequential_and_IO_bound); | |
aee69d78 | 3666 | |
cfd69712 | 3667 | /* |
05c2f5c3 | 3668 | * The return value of this function is equal to that of |
cfd69712 PV |
3669 | * idling_boosts_thr, unless a special case holds. In this |
3670 | * special case, described below, idling may cause problems to | |
3671 | * weight-raised queues. | |
3672 | * | |
3673 | * When the request pool is saturated (e.g., in the presence | |
3674 | * of write hogs), if the processes associated with | |
3675 | * non-weight-raised queues ask for requests at a lower rate, | |
3676 | * then processes associated with weight-raised queues have a | |
3677 | * higher probability to get a request from the pool | |
3678 | * immediately (or at least soon) when they need one. Thus | |
3679 | * they have a higher probability to actually get a fraction | |
3680 | * of the device throughput proportional to their high | |
3681 | * weight. This is especially true with NCQ-capable drives, | |
3682 | * which enqueue several requests in advance, and further | |
3683 | * reorder internally-queued requests. | |
3684 | * | |
05c2f5c3 PV |
3685 | * For this reason, we force to false the return value if |
3686 | * there are weight-raised busy queues. In this case, and if | |
3687 | * bfqq is not weight-raised, this guarantees that the device | |
3688 | * is not idled for bfqq (if, instead, bfqq is weight-raised, | |
3689 | * then idling will be guaranteed by another variable, see | |
3690 | * below). Combined with the timestamping rules of BFQ (see | |
3691 | * [1] for details), this behavior causes bfqq, and hence any | |
3692 | * sync non-weight-raised queue, to get a lower number of | |
3693 | * requests served, and thus to ask for a lower number of | |
3694 | * requests from the request pool, before the busy | |
3695 | * weight-raised queues get served again. This often mitigates | |
3696 | * starvation problems in the presence of heavy write | |
3697 | * workloads and NCQ, thereby guaranteeing a higher | |
3698 | * application and system responsiveness in these hostile | |
3699 | * scenarios. | |
3700 | */ | |
3701 | return idling_boosts_thr && | |
cfd69712 | 3702 | bfqd->wr_busy_queues == 0; |
05c2f5c3 | 3703 | } |
cfd69712 | 3704 | |
530c4cbb | 3705 | /* |
fb53ac6c PV |
3706 | * There is a case where idling does not have to be performed for |
3707 | * throughput concerns, but to preserve the throughput share of | |
3708 | * the process associated with bfqq. | |
530c4cbb PV |
3709 | * |
3710 | * To introduce this case, we can note that allowing the drive | |
3711 | * to enqueue more than one request at a time, and hence | |
3712 | * delegating de facto final scheduling decisions to the | |
3713 | * drive's internal scheduler, entails loss of control on the | |
3714 | * actual request service order. In particular, the critical | |
3715 | * situation is when requests from different processes happen | |
3716 | * to be present, at the same time, in the internal queue(s) | |
3717 | * of the drive. In such a situation, the drive, by deciding | |
3718 | * the service order of the internally-queued requests, does | |
3719 | * determine also the actual throughput distribution among | |
3720 | * these processes. But the drive typically has no notion or | |
3721 | * concern about per-process throughput distribution, and | |
3722 | * makes its decisions only on a per-request basis. Therefore, | |
3723 | * the service distribution enforced by the drive's internal | |
fb53ac6c PV |
3724 | * scheduler is likely to coincide with the desired throughput |
3725 | * distribution only in a completely symmetric, or favorably | |
3726 | * skewed scenario where: | |
3727 | * (i-a) each of these processes must get the same throughput as | |
3728 | * the others, | |
3729 | * (i-b) in case (i-a) does not hold, it holds that the process | |
3730 | * associated with bfqq must receive a lower or equal | |
3731 | * throughput than any of the other processes; | |
3732 | * (ii) the I/O of each process has the same properties, in | |
3733 | * terms of locality (sequential or random), direction | |
3734 | * (reads or writes), request sizes, greediness | |
3735 | * (from I/O-bound to sporadic), and so on; | |
3736 | ||
3737 | * In fact, in such a scenario, the drive tends to treat the requests | |
3738 | * of each process in about the same way as the requests of the | |
3739 | * others, and thus to provide each of these processes with about the | |
3740 | * same throughput. This is exactly the desired throughput | |
3741 | * distribution if (i-a) holds, or, if (i-b) holds instead, this is an | |
3742 | * even more convenient distribution for (the process associated with) | |
3743 | * bfqq. | |
3744 | * | |
3745 | * In contrast, in any asymmetric or unfavorable scenario, device | |
3746 | * idling (I/O-dispatch plugging) is certainly needed to guarantee | |
3747 | * that bfqq receives its assigned fraction of the device throughput | |
3748 | * (see [1] for details). | |
3749 | * | |
3750 | * The problem is that idling may significantly reduce throughput with | |
3751 | * certain combinations of types of I/O and devices. An important | |
3752 | * example is sync random I/O on flash storage with command | |
3753 | * queueing. So, unless bfqq falls in cases where idling also boosts | |
3754 | * throughput, it is important to check conditions (i-a), i(-b) and | |
3755 | * (ii) accurately, so as to avoid idling when not strictly needed for | |
3756 | * service guarantees. | |
530c4cbb | 3757 | * |
fb53ac6c PV |
3758 | * Unfortunately, it is extremely difficult to thoroughly check |
3759 | * condition (ii). And, in case there are active groups, it becomes | |
3760 | * very difficult to check conditions (i-a) and (i-b) too. In fact, | |
3761 | * if there are active groups, then, for conditions (i-a) or (i-b) to | |
3762 | * become false 'indirectly', it is enough that an active group | |
3763 | * contains more active processes or sub-groups than some other active | |
3764 | * group. More precisely, for conditions (i-a) or (i-b) to become | |
3765 | * false because of such a group, it is not even necessary that the | |
3766 | * group is (still) active: it is sufficient that, even if the group | |
3767 | * has become inactive, some of its descendant processes still have | |
3768 | * some request already dispatched but still waiting for | |
3769 | * completion. In fact, requests have still to be guaranteed their | |
3770 | * share of the throughput even after being dispatched. In this | |
3771 | * respect, it is easy to show that, if a group frequently becomes | |
3772 | * inactive while still having in-flight requests, and if, when this | |
3773 | * happens, the group is not considered in the calculation of whether | |
3774 | * the scenario is asymmetric, then the group may fail to be | |
3775 | * guaranteed its fair share of the throughput (basically because | |
3776 | * idling may not be performed for the descendant processes of the | |
3777 | * group, but it had to be). We address this issue with the following | |
3778 | * bi-modal behavior, implemented in the function | |
3779 | * bfq_asymmetric_scenario(). | |
530c4cbb PV |
3780 | * |
3781 | * If there are groups with requests waiting for completion | |
3782 | * (as commented above, some of these groups may even be | |
3783 | * already inactive), then the scenario is tagged as | |
3784 | * asymmetric, conservatively, without checking any of the | |
fb53ac6c | 3785 | * conditions (i-a), (i-b) or (ii). So the device is idled for bfqq. |
530c4cbb PV |
3786 | * This behavior matches also the fact that groups are created |
3787 | * exactly if controlling I/O is a primary concern (to | |
3788 | * preserve bandwidth and latency guarantees). | |
3789 | * | |
fb53ac6c PV |
3790 | * On the opposite end, if there are no groups with requests waiting |
3791 | * for completion, then only conditions (i-a) and (i-b) are actually | |
3792 | * controlled, i.e., provided that conditions (i-a) or (i-b) holds, | |
3793 | * idling is not performed, regardless of whether condition (ii) | |
3794 | * holds. In other words, only if conditions (i-a) and (i-b) do not | |
3795 | * hold, then idling is allowed, and the device tends to be prevented | |
3796 | * from queueing many requests, possibly of several processes. Since | |
3797 | * there are no groups with requests waiting for completion, then, to | |
3798 | * control conditions (i-a) and (i-b) it is enough to check just | |
3799 | * whether all the queues with requests waiting for completion also | |
3800 | * have the same weight. | |
530c4cbb PV |
3801 | * |
3802 | * Not checking condition (ii) evidently exposes bfqq to the | |
3803 | * risk of getting less throughput than its fair share. | |
3804 | * However, for queues with the same weight, a further | |
3805 | * mechanism, preemption, mitigates or even eliminates this | |
3806 | * problem. And it does so without consequences on overall | |
3807 | * throughput. This mechanism and its benefits are explained | |
3808 | * in the next three paragraphs. | |
3809 | * | |
3810 | * Even if a queue, say Q, is expired when it remains idle, Q | |
3811 | * can still preempt the new in-service queue if the next | |
3812 | * request of Q arrives soon (see the comments on | |
3813 | * bfq_bfqq_update_budg_for_activation). If all queues and | |
3814 | * groups have the same weight, this form of preemption, | |
3815 | * combined with the hole-recovery heuristic described in the | |
3816 | * comments on function bfq_bfqq_update_budg_for_activation, | |
3817 | * are enough to preserve a correct bandwidth distribution in | |
3818 | * the mid term, even without idling. In fact, even if not | |
3819 | * idling allows the internal queues of the device to contain | |
3820 | * many requests, and thus to reorder requests, we can rather | |
3821 | * safely assume that the internal scheduler still preserves a | |
3822 | * minimum of mid-term fairness. | |
3823 | * | |
3824 | * More precisely, this preemption-based, idleless approach | |
3825 | * provides fairness in terms of IOPS, and not sectors per | |
3826 | * second. This can be seen with a simple example. Suppose | |
3827 | * that there are two queues with the same weight, but that | |
3828 | * the first queue receives requests of 8 sectors, while the | |
3829 | * second queue receives requests of 1024 sectors. In | |
3830 | * addition, suppose that each of the two queues contains at | |
3831 | * most one request at a time, which implies that each queue | |
3832 | * always remains idle after it is served. Finally, after | |
3833 | * remaining idle, each queue receives very quickly a new | |
3834 | * request. It follows that the two queues are served | |
3835 | * alternatively, preempting each other if needed. This | |
3836 | * implies that, although both queues have the same weight, | |
3837 | * the queue with large requests receives a service that is | |
3838 | * 1024/8 times as high as the service received by the other | |
3839 | * queue. | |
3840 | * | |
3841 | * The motivation for using preemption instead of idling (for | |
3842 | * queues with the same weight) is that, by not idling, | |
3843 | * service guarantees are preserved (completely or at least in | |
3844 | * part) without minimally sacrificing throughput. And, if | |
3845 | * there is no active group, then the primary expectation for | |
3846 | * this device is probably a high throughput. | |
3847 | * | |
3848 | * We are now left only with explaining the additional | |
3849 | * compound condition that is checked below for deciding | |
3850 | * whether the scenario is asymmetric. To explain this | |
3851 | * compound condition, we need to add that the function | |
fb53ac6c | 3852 | * bfq_asymmetric_scenario checks the weights of only |
530c4cbb PV |
3853 | * non-weight-raised queues, for efficiency reasons (see |
3854 | * comments on bfq_weights_tree_add()). Then the fact that | |
3855 | * bfqq is weight-raised is checked explicitly here. More | |
3856 | * precisely, the compound condition below takes into account | |
3857 | * also the fact that, even if bfqq is being weight-raised, | |
3858 | * the scenario is still symmetric if all queues with requests | |
3859 | * waiting for completion happen to be | |
3860 | * weight-raised. Actually, we should be even more precise | |
3861 | * here, and differentiate between interactive weight raising | |
3862 | * and soft real-time weight raising. | |
3863 | * | |
3864 | * As a side note, it is worth considering that the above | |
3865 | * device-idling countermeasures may however fail in the | |
3866 | * following unlucky scenario: if idling is (correctly) | |
3867 | * disabled in a time period during which all symmetry | |
3868 | * sub-conditions hold, and hence the device is allowed to | |
3869 | * enqueue many requests, but at some later point in time some | |
3870 | * sub-condition stops to hold, then it may become impossible | |
3871 | * to let requests be served in the desired order until all | |
3872 | * the requests already queued in the device have been served. | |
3873 | */ | |
05c2f5c3 PV |
3874 | static bool idling_needed_for_service_guarantees(struct bfq_data *bfqd, |
3875 | struct bfq_queue *bfqq) | |
3876 | { | |
530c4cbb PV |
3877 | return (bfqq->wr_coeff > 1 && |
3878 | bfqd->wr_busy_queues < | |
3879 | bfq_tot_busy_queues(bfqd)) || | |
fb53ac6c | 3880 | bfq_asymmetric_scenario(bfqd, bfqq); |
05c2f5c3 PV |
3881 | } |
3882 | ||
3883 | /* | |
3884 | * For a queue that becomes empty, device idling is allowed only if | |
3885 | * this function returns true for that queue. As a consequence, since | |
3886 | * device idling plays a critical role for both throughput boosting | |
3887 | * and service guarantees, the return value of this function plays a | |
3888 | * critical role as well. | |
3889 | * | |
3890 | * In a nutshell, this function returns true only if idling is | |
3891 | * beneficial for throughput or, even if detrimental for throughput, | |
3892 | * idling is however necessary to preserve service guarantees (low | |
3893 | * latency, desired throughput distribution, ...). In particular, on | |
3894 | * NCQ-capable devices, this function tries to return false, so as to | |
3895 | * help keep the drives' internal queues full, whenever this helps the | |
3896 | * device boost the throughput without causing any service-guarantee | |
3897 | * issue. | |
3898 | * | |
3899 | * Most of the issues taken into account to get the return value of | |
3900 | * this function are not trivial. We discuss these issues in the two | |
3901 | * functions providing the main pieces of information needed by this | |
3902 | * function. | |
3903 | */ | |
3904 | static bool bfq_better_to_idle(struct bfq_queue *bfqq) | |
3905 | { | |
3906 | struct bfq_data *bfqd = bfqq->bfqd; | |
3907 | bool idling_boosts_thr_with_no_issue, idling_needed_for_service_guar; | |
3908 | ||
3909 | if (unlikely(bfqd->strict_guarantees)) | |
3910 | return true; | |
3911 | ||
3912 | /* | |
3913 | * Idling is performed only if slice_idle > 0. In addition, we | |
3914 | * do not idle if | |
3915 | * (a) bfqq is async | |
3916 | * (b) bfqq is in the idle io prio class: in this case we do | |
3917 | * not idle because we want to minimize the bandwidth that | |
3918 | * queues in this class can steal to higher-priority queues | |
3919 | */ | |
3920 | if (bfqd->bfq_slice_idle == 0 || !bfq_bfqq_sync(bfqq) || | |
3921 | bfq_class_idle(bfqq)) | |
3922 | return false; | |
3923 | ||
3924 | idling_boosts_thr_with_no_issue = | |
3925 | idling_boosts_thr_without_issues(bfqd, bfqq); | |
3926 | ||
3927 | idling_needed_for_service_guar = | |
3928 | idling_needed_for_service_guarantees(bfqd, bfqq); | |
e1b2324d | 3929 | |
44e44a1b | 3930 | /* |
05c2f5c3 | 3931 | * We have now the two components we need to compute the |
d5be3fef PV |
3932 | * return value of the function, which is true only if idling |
3933 | * either boosts the throughput (without issues), or is | |
3934 | * necessary to preserve service guarantees. | |
aee69d78 | 3935 | */ |
05c2f5c3 PV |
3936 | return idling_boosts_thr_with_no_issue || |
3937 | idling_needed_for_service_guar; | |
aee69d78 PV |
3938 | } |
3939 | ||
3940 | /* | |
277a4a9b | 3941 | * If the in-service queue is empty but the function bfq_better_to_idle |
aee69d78 PV |
3942 | * returns true, then: |
3943 | * 1) the queue must remain in service and cannot be expired, and | |
3944 | * 2) the device must be idled to wait for the possible arrival of a new | |
3945 | * request for the queue. | |
277a4a9b | 3946 | * See the comments on the function bfq_better_to_idle for the reasons |
aee69d78 | 3947 | * why performing device idling is the best choice to boost the throughput |
277a4a9b | 3948 | * and preserve service guarantees when bfq_better_to_idle itself |
aee69d78 PV |
3949 | * returns true. |
3950 | */ | |
3951 | static bool bfq_bfqq_must_idle(struct bfq_queue *bfqq) | |
3952 | { | |
277a4a9b | 3953 | return RB_EMPTY_ROOT(&bfqq->sort_list) && bfq_better_to_idle(bfqq); |
aee69d78 PV |
3954 | } |
3955 | ||
2341d662 PV |
3956 | /* |
3957 | * This function chooses the queue from which to pick the next extra | |
3958 | * I/O request to inject, if it finds a compatible queue. See the | |
3959 | * comments on bfq_update_inject_limit() for details on the injection | |
3960 | * mechanism, and for the definitions of the quantities mentioned | |
3961 | * below. | |
3962 | */ | |
3963 | static struct bfq_queue * | |
3964 | bfq_choose_bfqq_for_injection(struct bfq_data *bfqd) | |
d0edc247 | 3965 | { |
2341d662 PV |
3966 | struct bfq_queue *bfqq, *in_serv_bfqq = bfqd->in_service_queue; |
3967 | unsigned int limit = in_serv_bfqq->inject_limit; | |
3968 | /* | |
3969 | * If | |
3970 | * - bfqq is not weight-raised and therefore does not carry | |
3971 | * time-critical I/O, | |
3972 | * or | |
3973 | * - regardless of whether bfqq is weight-raised, bfqq has | |
3974 | * however a long think time, during which it can absorb the | |
3975 | * effect of an appropriate number of extra I/O requests | |
3976 | * from other queues (see bfq_update_inject_limit for | |
3977 | * details on the computation of this number); | |
3978 | * then injection can be performed without restrictions. | |
3979 | */ | |
3980 | bool in_serv_always_inject = in_serv_bfqq->wr_coeff == 1 || | |
3981 | !bfq_bfqq_has_short_ttime(in_serv_bfqq); | |
d0edc247 PV |
3982 | |
3983 | /* | |
2341d662 PV |
3984 | * If |
3985 | * - the baseline total service time could not be sampled yet, | |
3986 | * so the inject limit happens to be still 0, and | |
3987 | * - a lot of time has elapsed since the plugging of I/O | |
3988 | * dispatching started, so drive speed is being wasted | |
3989 | * significantly; | |
3990 | * then temporarily raise inject limit to one request. | |
3991 | */ | |
3992 | if (limit == 0 && in_serv_bfqq->last_serv_time_ns == 0 && | |
3993 | bfq_bfqq_wait_request(in_serv_bfqq) && | |
3994 | time_is_before_eq_jiffies(bfqd->last_idling_start_jiffies + | |
3995 | bfqd->bfq_slice_idle) | |
3996 | ) | |
3997 | limit = 1; | |
3998 | ||
3999 | if (bfqd->rq_in_driver >= limit) | |
4000 | return NULL; | |
4001 | ||
4002 | /* | |
4003 | * Linear search of the source queue for injection; but, with | |
4004 | * a high probability, very few steps are needed to find a | |
4005 | * candidate queue, i.e., a queue with enough budget left for | |
4006 | * its next request. In fact: | |
d0edc247 PV |
4007 | * - BFQ dynamically updates the budget of every queue so as |
4008 | * to accommodate the expected backlog of the queue; | |
4009 | * - if a queue gets all its requests dispatched as injected | |
4010 | * service, then the queue is removed from the active list | |
2341d662 PV |
4011 | * (and re-added only if it gets new requests, but then it |
4012 | * is assigned again enough budget for its new backlog). | |
d0edc247 PV |
4013 | */ |
4014 | list_for_each_entry(bfqq, &bfqd->active_list, bfqq_list) | |
4015 | if (!RB_EMPTY_ROOT(&bfqq->sort_list) && | |
2341d662 | 4016 | (in_serv_always_inject || bfqq->wr_coeff > 1) && |
d0edc247 | 4017 | bfq_serv_to_charge(bfqq->next_rq, bfqq) <= |
2341d662 PV |
4018 | bfq_bfqq_budget_left(bfqq)) { |
4019 | /* | |
4020 | * Allow for only one large in-flight request | |
4021 | * on non-rotational devices, for the | |
4022 | * following reason. On non-rotationl drives, | |
4023 | * large requests take much longer than | |
4024 | * smaller requests to be served. In addition, | |
4025 | * the drive prefers to serve large requests | |
4026 | * w.r.t. to small ones, if it can choose. So, | |
4027 | * having more than one large requests queued | |
4028 | * in the drive may easily make the next first | |
4029 | * request of the in-service queue wait for so | |
4030 | * long to break bfqq's service guarantees. On | |
4031 | * the bright side, large requests let the | |
4032 | * drive reach a very high throughput, even if | |
4033 | * there is only one in-flight large request | |
4034 | * at a time. | |
4035 | */ | |
4036 | if (blk_queue_nonrot(bfqd->queue) && | |
4037 | blk_rq_sectors(bfqq->next_rq) >= | |
4038 | BFQQ_SECT_THR_NONROT) | |
4039 | limit = min_t(unsigned int, 1, limit); | |
4040 | else | |
4041 | limit = in_serv_bfqq->inject_limit; | |
4042 | ||
4043 | if (bfqd->rq_in_driver < limit) { | |
4044 | bfqd->rqs_injected = true; | |
4045 | return bfqq; | |
4046 | } | |
4047 | } | |
d0edc247 PV |
4048 | |
4049 | return NULL; | |
4050 | } | |
4051 | ||
aee69d78 PV |
4052 | /* |
4053 | * Select a queue for service. If we have a current queue in service, | |
4054 | * check whether to continue servicing it, or retrieve and set a new one. | |
4055 | */ | |
4056 | static struct bfq_queue *bfq_select_queue(struct bfq_data *bfqd) | |
4057 | { | |
4058 | struct bfq_queue *bfqq; | |
4059 | struct request *next_rq; | |
4060 | enum bfqq_expiration reason = BFQQE_BUDGET_TIMEOUT; | |
4061 | ||
4062 | bfqq = bfqd->in_service_queue; | |
4063 | if (!bfqq) | |
4064 | goto new_queue; | |
4065 | ||
4066 | bfq_log_bfqq(bfqd, bfqq, "select_queue: already in-service queue"); | |
4067 | ||
4420b095 PV |
4068 | /* |
4069 | * Do not expire bfqq for budget timeout if bfqq may be about | |
4070 | * to enjoy device idling. The reason why, in this case, we | |
4071 | * prevent bfqq from expiring is the same as in the comments | |
4072 | * on the case where bfq_bfqq_must_idle() returns true, in | |
4073 | * bfq_completed_request(). | |
4074 | */ | |
aee69d78 | 4075 | if (bfq_may_expire_for_budg_timeout(bfqq) && |
aee69d78 PV |
4076 | !bfq_bfqq_must_idle(bfqq)) |
4077 | goto expire; | |
4078 | ||
4079 | check_queue: | |
4080 | /* | |
4081 | * This loop is rarely executed more than once. Even when it | |
4082 | * happens, it is much more convenient to re-execute this loop | |
4083 | * than to return NULL and trigger a new dispatch to get a | |
4084 | * request served. | |
4085 | */ | |
4086 | next_rq = bfqq->next_rq; | |
4087 | /* | |
4088 | * If bfqq has requests queued and it has enough budget left to | |
4089 | * serve them, keep the queue, otherwise expire it. | |
4090 | */ | |
4091 | if (next_rq) { | |
4092 | if (bfq_serv_to_charge(next_rq, bfqq) > | |
4093 | bfq_bfqq_budget_left(bfqq)) { | |
4094 | /* | |
4095 | * Expire the queue for budget exhaustion, | |
4096 | * which makes sure that the next budget is | |
4097 | * enough to serve the next request, even if | |
4098 | * it comes from the fifo expired path. | |
4099 | */ | |
4100 | reason = BFQQE_BUDGET_EXHAUSTED; | |
4101 | goto expire; | |
4102 | } else { | |
4103 | /* | |
4104 | * The idle timer may be pending because we may | |
4105 | * not disable disk idling even when a new request | |
4106 | * arrives. | |
4107 | */ | |
4108 | if (bfq_bfqq_wait_request(bfqq)) { | |
4109 | /* | |
4110 | * If we get here: 1) at least a new request | |
4111 | * has arrived but we have not disabled the | |
4112 | * timer because the request was too small, | |
4113 | * 2) then the block layer has unplugged | |
4114 | * the device, causing the dispatch to be | |
4115 | * invoked. | |
4116 | * | |
4117 | * Since the device is unplugged, now the | |
4118 | * requests are probably large enough to | |
4119 | * provide a reasonable throughput. | |
4120 | * So we disable idling. | |
4121 | */ | |
4122 | bfq_clear_bfqq_wait_request(bfqq); | |
4123 | hrtimer_try_to_cancel(&bfqd->idle_slice_timer); | |
4124 | } | |
4125 | goto keep_queue; | |
4126 | } | |
4127 | } | |
4128 | ||
4129 | /* | |
4130 | * No requests pending. However, if the in-service queue is idling | |
4131 | * for a new request, or has requests waiting for a completion and | |
4132 | * may idle after their completion, then keep it anyway. | |
d0edc247 | 4133 | * |
2341d662 PV |
4134 | * Yet, inject service from other queues if it boosts |
4135 | * throughput and is possible. | |
aee69d78 PV |
4136 | */ |
4137 | if (bfq_bfqq_wait_request(bfqq) || | |
277a4a9b | 4138 | (bfqq->dispatched != 0 && bfq_better_to_idle(bfqq))) { |
2341d662 PV |
4139 | struct bfq_queue *async_bfqq = |
4140 | bfqq->bic && bfqq->bic->bfqq[0] && | |
4141 | bfq_bfqq_busy(bfqq->bic->bfqq[0]) ? | |
4142 | bfqq->bic->bfqq[0] : NULL; | |
4143 | ||
4144 | /* | |
4145 | * If the process associated with bfqq has also async | |
4146 | * I/O pending, then inject it | |
4147 | * unconditionally. Injecting I/O from the same | |
4148 | * process can cause no harm to the process. On the | |
4149 | * contrary, it can only increase bandwidth and reduce | |
4150 | * latency for the process. | |
4151 | */ | |
4152 | if (async_bfqq && | |
4153 | icq_to_bic(async_bfqq->next_rq->elv.icq) == bfqq->bic && | |
4154 | bfq_serv_to_charge(async_bfqq->next_rq, async_bfqq) <= | |
4155 | bfq_bfqq_budget_left(async_bfqq)) | |
4156 | bfqq = bfqq->bic->bfqq[0]; | |
4157 | else if (!idling_boosts_thr_without_issues(bfqd, bfqq) && | |
4158 | (bfqq->wr_coeff == 1 || bfqd->wr_busy_queues > 1 || | |
4159 | !bfq_bfqq_has_short_ttime(bfqq))) | |
d0edc247 PV |
4160 | bfqq = bfq_choose_bfqq_for_injection(bfqd); |
4161 | else | |
4162 | bfqq = NULL; | |
4163 | ||
aee69d78 PV |
4164 | goto keep_queue; |
4165 | } | |
4166 | ||
4167 | reason = BFQQE_NO_MORE_REQUESTS; | |
4168 | expire: | |
4169 | bfq_bfqq_expire(bfqd, bfqq, false, reason); | |
4170 | new_queue: | |
4171 | bfqq = bfq_set_in_service_queue(bfqd); | |
4172 | if (bfqq) { | |
4173 | bfq_log_bfqq(bfqd, bfqq, "select_queue: checking new queue"); | |
4174 | goto check_queue; | |
4175 | } | |
4176 | keep_queue: | |
4177 | if (bfqq) | |
4178 | bfq_log_bfqq(bfqd, bfqq, "select_queue: returned this queue"); | |
4179 | else | |
4180 | bfq_log(bfqd, "select_queue: no queue returned"); | |
4181 | ||
4182 | return bfqq; | |
4183 | } | |
4184 | ||
44e44a1b PV |
4185 | static void bfq_update_wr_data(struct bfq_data *bfqd, struct bfq_queue *bfqq) |
4186 | { | |
4187 | struct bfq_entity *entity = &bfqq->entity; | |
4188 | ||
4189 | if (bfqq->wr_coeff > 1) { /* queue is being weight-raised */ | |
4190 | bfq_log_bfqq(bfqd, bfqq, | |
4191 | "raising period dur %u/%u msec, old coeff %u, w %d(%d)", | |
4192 | jiffies_to_msecs(jiffies - bfqq->last_wr_start_finish), | |
4193 | jiffies_to_msecs(bfqq->wr_cur_max_time), | |
4194 | bfqq->wr_coeff, | |
4195 | bfqq->entity.weight, bfqq->entity.orig_weight); | |
4196 | ||
4197 | if (entity->prio_changed) | |
4198 | bfq_log_bfqq(bfqd, bfqq, "WARN: pending prio change"); | |
4199 | ||
4200 | /* | |
e1b2324d AA |
4201 | * If the queue was activated in a burst, or too much |
4202 | * time has elapsed from the beginning of this | |
4203 | * weight-raising period, then end weight raising. | |
44e44a1b | 4204 | */ |
e1b2324d AA |
4205 | if (bfq_bfqq_in_large_burst(bfqq)) |
4206 | bfq_bfqq_end_wr(bfqq); | |
4207 | else if (time_is_before_jiffies(bfqq->last_wr_start_finish + | |
4208 | bfqq->wr_cur_max_time)) { | |
77b7dcea PV |
4209 | if (bfqq->wr_cur_max_time != bfqd->bfq_wr_rt_max_time || |
4210 | time_is_before_jiffies(bfqq->wr_start_at_switch_to_srt + | |
e1b2324d | 4211 | bfq_wr_duration(bfqd))) |
77b7dcea PV |
4212 | bfq_bfqq_end_wr(bfqq); |
4213 | else { | |
3e2bdd6d | 4214 | switch_back_to_interactive_wr(bfqq, bfqd); |
77b7dcea PV |
4215 | bfqq->entity.prio_changed = 1; |
4216 | } | |
44e44a1b | 4217 | } |
8a8747dc PV |
4218 | if (bfqq->wr_coeff > 1 && |
4219 | bfqq->wr_cur_max_time != bfqd->bfq_wr_rt_max_time && | |
4220 | bfqq->service_from_wr > max_service_from_wr) { | |
4221 | /* see comments on max_service_from_wr */ | |
4222 | bfq_bfqq_end_wr(bfqq); | |
4223 | } | |
44e44a1b | 4224 | } |
431b17f9 PV |
4225 | /* |
4226 | * To improve latency (for this or other queues), immediately | |
4227 | * update weight both if it must be raised and if it must be | |
4228 | * lowered. Since, entity may be on some active tree here, and | |
4229 | * might have a pending change of its ioprio class, invoke | |
4230 | * next function with the last parameter unset (see the | |
4231 | * comments on the function). | |
4232 | */ | |
44e44a1b | 4233 | if ((entity->weight > entity->orig_weight) != (bfqq->wr_coeff > 1)) |
431b17f9 PV |
4234 | __bfq_entity_update_weight_prio(bfq_entity_service_tree(entity), |
4235 | entity, false); | |
44e44a1b PV |
4236 | } |
4237 | ||
aee69d78 PV |
4238 | /* |
4239 | * Dispatch next request from bfqq. | |
4240 | */ | |
4241 | static struct request *bfq_dispatch_rq_from_bfqq(struct bfq_data *bfqd, | |
4242 | struct bfq_queue *bfqq) | |
4243 | { | |
4244 | struct request *rq = bfqq->next_rq; | |
4245 | unsigned long service_to_charge; | |
4246 | ||
4247 | service_to_charge = bfq_serv_to_charge(rq, bfqq); | |
4248 | ||
4249 | bfq_bfqq_served(bfqq, service_to_charge); | |
4250 | ||
2341d662 PV |
4251 | if (bfqq == bfqd->in_service_queue && bfqd->wait_dispatch) { |
4252 | bfqd->wait_dispatch = false; | |
4253 | bfqd->waited_rq = rq; | |
4254 | } | |
aee69d78 | 4255 | |
2341d662 | 4256 | bfq_dispatch_remove(bfqd->queue, rq); |
d0edc247 | 4257 | |
2341d662 | 4258 | if (bfqq != bfqd->in_service_queue) |
d0edc247 | 4259 | goto return_rq; |
d0edc247 | 4260 | |
44e44a1b PV |
4261 | /* |
4262 | * If weight raising has to terminate for bfqq, then next | |
4263 | * function causes an immediate update of bfqq's weight, | |
4264 | * without waiting for next activation. As a consequence, on | |
4265 | * expiration, bfqq will be timestamped as if has never been | |
4266 | * weight-raised during this service slot, even if it has | |
4267 | * received part or even most of the service as a | |
4268 | * weight-raised queue. This inflates bfqq's timestamps, which | |
4269 | * is beneficial, as bfqq is then more willing to leave the | |
4270 | * device immediately to possible other weight-raised queues. | |
4271 | */ | |
4272 | bfq_update_wr_data(bfqd, bfqq); | |
4273 | ||
aee69d78 PV |
4274 | /* |
4275 | * Expire bfqq, pretending that its budget expired, if bfqq | |
4276 | * belongs to CLASS_IDLE and other queues are waiting for | |
4277 | * service. | |
4278 | */ | |
73d58118 | 4279 | if (!(bfq_tot_busy_queues(bfqd) > 1 && bfq_class_idle(bfqq))) |
d0edc247 | 4280 | goto return_rq; |
aee69d78 | 4281 | |
aee69d78 | 4282 | bfq_bfqq_expire(bfqd, bfqq, false, BFQQE_BUDGET_EXHAUSTED); |
d0edc247 PV |
4283 | |
4284 | return_rq: | |
aee69d78 PV |
4285 | return rq; |
4286 | } | |
4287 | ||
4288 | static bool bfq_has_work(struct blk_mq_hw_ctx *hctx) | |
4289 | { | |
4290 | struct bfq_data *bfqd = hctx->queue->elevator->elevator_data; | |
4291 | ||
4292 | /* | |
4293 | * Avoiding lock: a race on bfqd->busy_queues should cause at | |
4294 | * most a call to dispatch for nothing | |
4295 | */ | |
4296 | return !list_empty_careful(&bfqd->dispatch) || | |
73d58118 | 4297 | bfq_tot_busy_queues(bfqd) > 0; |
aee69d78 PV |
4298 | } |
4299 | ||
4300 | static struct request *__bfq_dispatch_request(struct blk_mq_hw_ctx *hctx) | |
4301 | { | |
4302 | struct bfq_data *bfqd = hctx->queue->elevator->elevator_data; | |
4303 | struct request *rq = NULL; | |
4304 | struct bfq_queue *bfqq = NULL; | |
4305 | ||
4306 | if (!list_empty(&bfqd->dispatch)) { | |
4307 | rq = list_first_entry(&bfqd->dispatch, struct request, | |
4308 | queuelist); | |
4309 | list_del_init(&rq->queuelist); | |
4310 | ||
4311 | bfqq = RQ_BFQQ(rq); | |
4312 | ||
4313 | if (bfqq) { | |
4314 | /* | |
4315 | * Increment counters here, because this | |
4316 | * dispatch does not follow the standard | |
4317 | * dispatch flow (where counters are | |
4318 | * incremented) | |
4319 | */ | |
4320 | bfqq->dispatched++; | |
4321 | ||
4322 | goto inc_in_driver_start_rq; | |
4323 | } | |
4324 | ||
4325 | /* | |
a7877390 PV |
4326 | * We exploit the bfq_finish_requeue_request hook to |
4327 | * decrement rq_in_driver, but | |
4328 | * bfq_finish_requeue_request will not be invoked on | |
4329 | * this request. So, to avoid unbalance, just start | |
4330 | * this request, without incrementing rq_in_driver. As | |
4331 | * a negative consequence, rq_in_driver is deceptively | |
4332 | * lower than it should be while this request is in | |
4333 | * service. This may cause bfq_schedule_dispatch to be | |
4334 | * invoked uselessly. | |
aee69d78 PV |
4335 | * |
4336 | * As for implementing an exact solution, the | |
a7877390 PV |
4337 | * bfq_finish_requeue_request hook, if defined, is |
4338 | * probably invoked also on this request. So, by | |
4339 | * exploiting this hook, we could 1) increment | |
4340 | * rq_in_driver here, and 2) decrement it in | |
4341 | * bfq_finish_requeue_request. Such a solution would | |
4342 | * let the value of the counter be always accurate, | |
4343 | * but it would entail using an extra interface | |
4344 | * function. This cost seems higher than the benefit, | |
4345 | * being the frequency of non-elevator-private | |
aee69d78 PV |
4346 | * requests very low. |
4347 | */ | |
4348 | goto start_rq; | |
4349 | } | |
4350 | ||
73d58118 PV |
4351 | bfq_log(bfqd, "dispatch requests: %d busy queues", |
4352 | bfq_tot_busy_queues(bfqd)); | |
aee69d78 | 4353 | |
73d58118 | 4354 | if (bfq_tot_busy_queues(bfqd) == 0) |
aee69d78 PV |
4355 | goto exit; |
4356 | ||
4357 | /* | |
4358 | * Force device to serve one request at a time if | |
4359 | * strict_guarantees is true. Forcing this service scheme is | |
4360 | * currently the ONLY way to guarantee that the request | |
4361 | * service order enforced by the scheduler is respected by a | |
4362 | * queueing device. Otherwise the device is free even to make | |
4363 | * some unlucky request wait for as long as the device | |
4364 | * wishes. | |
4365 | * | |
4366 | * Of course, serving one request at at time may cause loss of | |
4367 | * throughput. | |
4368 | */ | |
4369 | if (bfqd->strict_guarantees && bfqd->rq_in_driver > 0) | |
4370 | goto exit; | |
4371 | ||
4372 | bfqq = bfq_select_queue(bfqd); | |
4373 | if (!bfqq) | |
4374 | goto exit; | |
4375 | ||
4376 | rq = bfq_dispatch_rq_from_bfqq(bfqd, bfqq); | |
4377 | ||
4378 | if (rq) { | |
4379 | inc_in_driver_start_rq: | |
4380 | bfqd->rq_in_driver++; | |
4381 | start_rq: | |
4382 | rq->rq_flags |= RQF_STARTED; | |
4383 | } | |
4384 | exit: | |
4385 | return rq; | |
4386 | } | |
4387 | ||
a33801e8 | 4388 | #if defined(CONFIG_BFQ_GROUP_IOSCHED) && defined(CONFIG_DEBUG_BLK_CGROUP) |
9b25bd03 PV |
4389 | static void bfq_update_dispatch_stats(struct request_queue *q, |
4390 | struct request *rq, | |
4391 | struct bfq_queue *in_serv_queue, | |
4392 | bool idle_timer_disabled) | |
4393 | { | |
4394 | struct bfq_queue *bfqq = rq ? RQ_BFQQ(rq) : NULL; | |
aee69d78 | 4395 | |
24bfd19b | 4396 | if (!idle_timer_disabled && !bfqq) |
9b25bd03 | 4397 | return; |
24bfd19b PV |
4398 | |
4399 | /* | |
4400 | * rq and bfqq are guaranteed to exist until this function | |
4401 | * ends, for the following reasons. First, rq can be | |
4402 | * dispatched to the device, and then can be completed and | |
4403 | * freed, only after this function ends. Second, rq cannot be | |
4404 | * merged (and thus freed because of a merge) any longer, | |
4405 | * because it has already started. Thus rq cannot be freed | |
4406 | * before this function ends, and, since rq has a reference to | |
4407 | * bfqq, the same guarantee holds for bfqq too. | |
4408 | * | |
4409 | * In addition, the following queue lock guarantees that | |
4410 | * bfqq_group(bfqq) exists as well. | |
4411 | */ | |
0d945c1f | 4412 | spin_lock_irq(&q->queue_lock); |
24bfd19b PV |
4413 | if (idle_timer_disabled) |
4414 | /* | |
4415 | * Since the idle timer has been disabled, | |
4416 | * in_serv_queue contained some request when | |
4417 | * __bfq_dispatch_request was invoked above, which | |
4418 | * implies that rq was picked exactly from | |
4419 | * in_serv_queue. Thus in_serv_queue == bfqq, and is | |
4420 | * therefore guaranteed to exist because of the above | |
4421 | * arguments. | |
4422 | */ | |
4423 | bfqg_stats_update_idle_time(bfqq_group(in_serv_queue)); | |
4424 | if (bfqq) { | |
4425 | struct bfq_group *bfqg = bfqq_group(bfqq); | |
4426 | ||
4427 | bfqg_stats_update_avg_queue_size(bfqg); | |
4428 | bfqg_stats_set_start_empty_time(bfqg); | |
4429 | bfqg_stats_update_io_remove(bfqg, rq->cmd_flags); | |
4430 | } | |
0d945c1f | 4431 | spin_unlock_irq(&q->queue_lock); |
9b25bd03 PV |
4432 | } |
4433 | #else | |
4434 | static inline void bfq_update_dispatch_stats(struct request_queue *q, | |
4435 | struct request *rq, | |
4436 | struct bfq_queue *in_serv_queue, | |
4437 | bool idle_timer_disabled) {} | |
24bfd19b PV |
4438 | #endif |
4439 | ||
9b25bd03 PV |
4440 | static struct request *bfq_dispatch_request(struct blk_mq_hw_ctx *hctx) |
4441 | { | |
4442 | struct bfq_data *bfqd = hctx->queue->elevator->elevator_data; | |
4443 | struct request *rq; | |
4444 | struct bfq_queue *in_serv_queue; | |
4445 | bool waiting_rq, idle_timer_disabled; | |
4446 | ||
4447 | spin_lock_irq(&bfqd->lock); | |
4448 | ||
4449 | in_serv_queue = bfqd->in_service_queue; | |
4450 | waiting_rq = in_serv_queue && bfq_bfqq_wait_request(in_serv_queue); | |
4451 | ||
4452 | rq = __bfq_dispatch_request(hctx); | |
4453 | ||
4454 | idle_timer_disabled = | |
4455 | waiting_rq && !bfq_bfqq_wait_request(in_serv_queue); | |
4456 | ||
4457 | spin_unlock_irq(&bfqd->lock); | |
4458 | ||
4459 | bfq_update_dispatch_stats(hctx->queue, rq, in_serv_queue, | |
4460 | idle_timer_disabled); | |
4461 | ||
aee69d78 PV |
4462 | return rq; |
4463 | } | |
4464 | ||
4465 | /* | |
4466 | * Task holds one reference to the queue, dropped when task exits. Each rq | |
4467 | * in-flight on this queue also holds a reference, dropped when rq is freed. | |
4468 | * | |
4469 | * Scheduler lock must be held here. Recall not to use bfqq after calling | |
4470 | * this function on it. | |
4471 | */ | |
ea25da48 | 4472 | void bfq_put_queue(struct bfq_queue *bfqq) |
aee69d78 | 4473 | { |
e21b7a0b AA |
4474 | #ifdef CONFIG_BFQ_GROUP_IOSCHED |
4475 | struct bfq_group *bfqg = bfqq_group(bfqq); | |
4476 | #endif | |
4477 | ||
aee69d78 PV |
4478 | if (bfqq->bfqd) |
4479 | bfq_log_bfqq(bfqq->bfqd, bfqq, "put_queue: %p %d", | |
4480 | bfqq, bfqq->ref); | |
4481 | ||
4482 | bfqq->ref--; | |
4483 | if (bfqq->ref) | |
4484 | return; | |
4485 | ||
99fead8d | 4486 | if (!hlist_unhashed(&bfqq->burst_list_node)) { |
e1b2324d | 4487 | hlist_del_init(&bfqq->burst_list_node); |
99fead8d PV |
4488 | /* |
4489 | * Decrement also burst size after the removal, if the | |
4490 | * process associated with bfqq is exiting, and thus | |
4491 | * does not contribute to the burst any longer. This | |
4492 | * decrement helps filter out false positives of large | |
4493 | * bursts, when some short-lived process (often due to | |
4494 | * the execution of commands by some service) happens | |
4495 | * to start and exit while a complex application is | |
4496 | * starting, and thus spawning several processes that | |
4497 | * do I/O (and that *must not* be treated as a large | |
4498 | * burst, see comments on bfq_handle_burst). | |
4499 | * | |
4500 | * In particular, the decrement is performed only if: | |
4501 | * 1) bfqq is not a merged queue, because, if it is, | |
4502 | * then this free of bfqq is not triggered by the exit | |
4503 | * of the process bfqq is associated with, but exactly | |
4504 | * by the fact that bfqq has just been merged. | |
4505 | * 2) burst_size is greater than 0, to handle | |
4506 | * unbalanced decrements. Unbalanced decrements may | |
4507 | * happen in te following case: bfqq is inserted into | |
4508 | * the current burst list--without incrementing | |
4509 | * bust_size--because of a split, but the current | |
4510 | * burst list is not the burst list bfqq belonged to | |
4511 | * (see comments on the case of a split in | |
4512 | * bfq_set_request). | |
4513 | */ | |
4514 | if (bfqq->bic && bfqq->bfqd->burst_size > 0) | |
4515 | bfqq->bfqd->burst_size--; | |
7cb04004 | 4516 | } |
e21b7a0b | 4517 | |
aee69d78 | 4518 | kmem_cache_free(bfq_pool, bfqq); |
e21b7a0b | 4519 | #ifdef CONFIG_BFQ_GROUP_IOSCHED |
8f9bebc3 | 4520 | bfqg_and_blkg_put(bfqg); |
e21b7a0b | 4521 | #endif |
aee69d78 PV |
4522 | } |
4523 | ||
36eca894 AA |
4524 | static void bfq_put_cooperator(struct bfq_queue *bfqq) |
4525 | { | |
4526 | struct bfq_queue *__bfqq, *next; | |
4527 | ||
4528 | /* | |
4529 | * If this queue was scheduled to merge with another queue, be | |
4530 | * sure to drop the reference taken on that queue (and others in | |
4531 | * the merge chain). See bfq_setup_merge and bfq_merge_bfqqs. | |
4532 | */ | |
4533 | __bfqq = bfqq->new_bfqq; | |
4534 | while (__bfqq) { | |
4535 | if (__bfqq == bfqq) | |
4536 | break; | |
4537 | next = __bfqq->new_bfqq; | |
4538 | bfq_put_queue(__bfqq); | |
4539 | __bfqq = next; | |
4540 | } | |
4541 | } | |
4542 | ||
aee69d78 PV |
4543 | static void bfq_exit_bfqq(struct bfq_data *bfqd, struct bfq_queue *bfqq) |
4544 | { | |
4545 | if (bfqq == bfqd->in_service_queue) { | |
4546 | __bfq_bfqq_expire(bfqd, bfqq); | |
4547 | bfq_schedule_dispatch(bfqd); | |
4548 | } | |
4549 | ||
4550 | bfq_log_bfqq(bfqd, bfqq, "exit_bfqq: %p, %d", bfqq, bfqq->ref); | |
4551 | ||
36eca894 AA |
4552 | bfq_put_cooperator(bfqq); |
4553 | ||
aee69d78 PV |
4554 | bfq_put_queue(bfqq); /* release process reference */ |
4555 | } | |
4556 | ||
4557 | static void bfq_exit_icq_bfqq(struct bfq_io_cq *bic, bool is_sync) | |
4558 | { | |
4559 | struct bfq_queue *bfqq = bic_to_bfqq(bic, is_sync); | |
4560 | struct bfq_data *bfqd; | |
4561 | ||
4562 | if (bfqq) | |
4563 | bfqd = bfqq->bfqd; /* NULL if scheduler already exited */ | |
4564 | ||
4565 | if (bfqq && bfqd) { | |
4566 | unsigned long flags; | |
4567 | ||
4568 | spin_lock_irqsave(&bfqd->lock, flags); | |
4569 | bfq_exit_bfqq(bfqd, bfqq); | |
4570 | bic_set_bfqq(bic, NULL, is_sync); | |
6fa3e8d3 | 4571 | spin_unlock_irqrestore(&bfqd->lock, flags); |
aee69d78 PV |
4572 | } |
4573 | } | |
4574 | ||
4575 | static void bfq_exit_icq(struct io_cq *icq) | |
4576 | { | |
4577 | struct bfq_io_cq *bic = icq_to_bic(icq); | |
4578 | ||
4579 | bfq_exit_icq_bfqq(bic, true); | |
4580 | bfq_exit_icq_bfqq(bic, false); | |
4581 | } | |
4582 | ||
4583 | /* | |
4584 | * Update the entity prio values; note that the new values will not | |
4585 | * be used until the next (re)activation. | |
4586 | */ | |
4587 | static void | |
4588 | bfq_set_next_ioprio_data(struct bfq_queue *bfqq, struct bfq_io_cq *bic) | |
4589 | { | |
4590 | struct task_struct *tsk = current; | |
4591 | int ioprio_class; | |
4592 | struct bfq_data *bfqd = bfqq->bfqd; | |
4593 | ||
4594 | if (!bfqd) | |
4595 | return; | |
4596 | ||
4597 | ioprio_class = IOPRIO_PRIO_CLASS(bic->ioprio); | |
4598 | switch (ioprio_class) { | |
4599 | default: | |
4600 | dev_err(bfqq->bfqd->queue->backing_dev_info->dev, | |
4601 | "bfq: bad prio class %d\n", ioprio_class); | |
fa393d1b | 4602 | /* fall through */ |
aee69d78 PV |
4603 | case IOPRIO_CLASS_NONE: |
4604 | /* | |
4605 | * No prio set, inherit CPU scheduling settings. | |
4606 | */ | |
4607 | bfqq->new_ioprio = task_nice_ioprio(tsk); | |
4608 | bfqq->new_ioprio_class = task_nice_ioclass(tsk); | |
4609 | break; | |
4610 | case IOPRIO_CLASS_RT: | |
4611 | bfqq->new_ioprio = IOPRIO_PRIO_DATA(bic->ioprio); | |
4612 | bfqq->new_ioprio_class = IOPRIO_CLASS_RT; | |
4613 | break; | |
4614 | case IOPRIO_CLASS_BE: | |
4615 | bfqq->new_ioprio = IOPRIO_PRIO_DATA(bic->ioprio); | |
4616 | bfqq->new_ioprio_class = IOPRIO_CLASS_BE; | |
4617 | break; | |
4618 | case IOPRIO_CLASS_IDLE: | |
4619 | bfqq->new_ioprio_class = IOPRIO_CLASS_IDLE; | |
4620 | bfqq->new_ioprio = 7; | |
aee69d78 PV |
4621 | break; |
4622 | } | |
4623 | ||
4624 | if (bfqq->new_ioprio >= IOPRIO_BE_NR) { | |
4625 | pr_crit("bfq_set_next_ioprio_data: new_ioprio %d\n", | |
4626 | bfqq->new_ioprio); | |
4627 | bfqq->new_ioprio = IOPRIO_BE_NR; | |
4628 | } | |
4629 | ||
4630 | bfqq->entity.new_weight = bfq_ioprio_to_weight(bfqq->new_ioprio); | |
4631 | bfqq->entity.prio_changed = 1; | |
4632 | } | |
4633 | ||
ea25da48 PV |
4634 | static struct bfq_queue *bfq_get_queue(struct bfq_data *bfqd, |
4635 | struct bio *bio, bool is_sync, | |
4636 | struct bfq_io_cq *bic); | |
4637 | ||
aee69d78 PV |
4638 | static void bfq_check_ioprio_change(struct bfq_io_cq *bic, struct bio *bio) |
4639 | { | |
4640 | struct bfq_data *bfqd = bic_to_bfqd(bic); | |
4641 | struct bfq_queue *bfqq; | |
4642 | int ioprio = bic->icq.ioc->ioprio; | |
4643 | ||
4644 | /* | |
4645 | * This condition may trigger on a newly created bic, be sure to | |
4646 | * drop the lock before returning. | |
4647 | */ | |
4648 | if (unlikely(!bfqd) || likely(bic->ioprio == ioprio)) | |
4649 | return; | |
4650 | ||
4651 | bic->ioprio = ioprio; | |
4652 | ||
4653 | bfqq = bic_to_bfqq(bic, false); | |
4654 | if (bfqq) { | |
4655 | /* release process reference on this queue */ | |
4656 | bfq_put_queue(bfqq); | |
4657 | bfqq = bfq_get_queue(bfqd, bio, BLK_RW_ASYNC, bic); | |
4658 | bic_set_bfqq(bic, bfqq, false); | |
4659 | } | |
4660 | ||
4661 | bfqq = bic_to_bfqq(bic, true); | |
4662 | if (bfqq) | |
4663 | bfq_set_next_ioprio_data(bfqq, bic); | |
4664 | } | |
4665 | ||
4666 | static void bfq_init_bfqq(struct bfq_data *bfqd, struct bfq_queue *bfqq, | |
4667 | struct bfq_io_cq *bic, pid_t pid, int is_sync) | |
4668 | { | |
4669 | RB_CLEAR_NODE(&bfqq->entity.rb_node); | |
4670 | INIT_LIST_HEAD(&bfqq->fifo); | |
e1b2324d | 4671 | INIT_HLIST_NODE(&bfqq->burst_list_node); |
aee69d78 PV |
4672 | |
4673 | bfqq->ref = 0; | |
4674 | bfqq->bfqd = bfqd; | |
4675 | ||
4676 | if (bic) | |
4677 | bfq_set_next_ioprio_data(bfqq, bic); | |
4678 | ||
4679 | if (is_sync) { | |
d5be3fef PV |
4680 | /* |
4681 | * No need to mark as has_short_ttime if in | |
4682 | * idle_class, because no device idling is performed | |
4683 | * for queues in idle class | |
4684 | */ | |
aee69d78 | 4685 | if (!bfq_class_idle(bfqq)) |
d5be3fef PV |
4686 | /* tentatively mark as has_short_ttime */ |
4687 | bfq_mark_bfqq_has_short_ttime(bfqq); | |
aee69d78 | 4688 | bfq_mark_bfqq_sync(bfqq); |
e1b2324d | 4689 | bfq_mark_bfqq_just_created(bfqq); |
aee69d78 PV |
4690 | } else |
4691 | bfq_clear_bfqq_sync(bfqq); | |
4692 | ||
4693 | /* set end request to minus infinity from now */ | |
4694 | bfqq->ttime.last_end_request = ktime_get_ns() + 1; | |
4695 | ||
4696 | bfq_mark_bfqq_IO_bound(bfqq); | |
4697 | ||
4698 | bfqq->pid = pid; | |
4699 | ||
4700 | /* Tentative initial value to trade off between thr and lat */ | |
54b60456 | 4701 | bfqq->max_budget = (2 * bfq_max_budget(bfqd)) / 3; |
aee69d78 | 4702 | bfqq->budget_timeout = bfq_smallest_from_now(); |
aee69d78 | 4703 | |
44e44a1b | 4704 | bfqq->wr_coeff = 1; |
36eca894 | 4705 | bfqq->last_wr_start_finish = jiffies; |
77b7dcea | 4706 | bfqq->wr_start_at_switch_to_srt = bfq_smallest_from_now(); |
36eca894 | 4707 | bfqq->split_time = bfq_smallest_from_now(); |
77b7dcea PV |
4708 | |
4709 | /* | |
a34b0244 PV |
4710 | * To not forget the possibly high bandwidth consumed by a |
4711 | * process/queue in the recent past, | |
4712 | * bfq_bfqq_softrt_next_start() returns a value at least equal | |
4713 | * to the current value of bfqq->soft_rt_next_start (see | |
4714 | * comments on bfq_bfqq_softrt_next_start). Set | |
4715 | * soft_rt_next_start to now, to mean that bfqq has consumed | |
4716 | * no bandwidth so far. | |
77b7dcea | 4717 | */ |
a34b0244 | 4718 | bfqq->soft_rt_next_start = jiffies; |
44e44a1b | 4719 | |
aee69d78 PV |
4720 | /* first request is almost certainly seeky */ |
4721 | bfqq->seek_history = 1; | |
4722 | } | |
4723 | ||
4724 | static struct bfq_queue **bfq_async_queue_prio(struct bfq_data *bfqd, | |
e21b7a0b | 4725 | struct bfq_group *bfqg, |
aee69d78 PV |
4726 | int ioprio_class, int ioprio) |
4727 | { | |
4728 | switch (ioprio_class) { | |
4729 | case IOPRIO_CLASS_RT: | |
e21b7a0b | 4730 | return &bfqg->async_bfqq[0][ioprio]; |
aee69d78 PV |
4731 | case IOPRIO_CLASS_NONE: |
4732 | ioprio = IOPRIO_NORM; | |
4733 | /* fall through */ | |
4734 | case IOPRIO_CLASS_BE: | |
e21b7a0b | 4735 | return &bfqg->async_bfqq[1][ioprio]; |
aee69d78 | 4736 | case IOPRIO_CLASS_IDLE: |
e21b7a0b | 4737 | return &bfqg->async_idle_bfqq; |
aee69d78 PV |
4738 | default: |
4739 | return NULL; | |
4740 | } | |
4741 | } | |
4742 | ||
4743 | static struct bfq_queue *bfq_get_queue(struct bfq_data *bfqd, | |
4744 | struct bio *bio, bool is_sync, | |
4745 | struct bfq_io_cq *bic) | |
4746 | { | |
4747 | const int ioprio = IOPRIO_PRIO_DATA(bic->ioprio); | |
4748 | const int ioprio_class = IOPRIO_PRIO_CLASS(bic->ioprio); | |
4749 | struct bfq_queue **async_bfqq = NULL; | |
4750 | struct bfq_queue *bfqq; | |
e21b7a0b | 4751 | struct bfq_group *bfqg; |
aee69d78 PV |
4752 | |
4753 | rcu_read_lock(); | |
4754 | ||
0fe061b9 | 4755 | bfqg = bfq_find_set_group(bfqd, __bio_blkcg(bio)); |
e21b7a0b AA |
4756 | if (!bfqg) { |
4757 | bfqq = &bfqd->oom_bfqq; | |
4758 | goto out; | |
4759 | } | |
4760 | ||
aee69d78 | 4761 | if (!is_sync) { |
e21b7a0b | 4762 | async_bfqq = bfq_async_queue_prio(bfqd, bfqg, ioprio_class, |
aee69d78 PV |
4763 | ioprio); |
4764 | bfqq = *async_bfqq; | |
4765 | if (bfqq) | |
4766 | goto out; | |
4767 | } | |
4768 | ||
4769 | bfqq = kmem_cache_alloc_node(bfq_pool, | |
4770 | GFP_NOWAIT | __GFP_ZERO | __GFP_NOWARN, | |
4771 | bfqd->queue->node); | |
4772 | ||
4773 | if (bfqq) { | |
4774 | bfq_init_bfqq(bfqd, bfqq, bic, current->pid, | |
4775 | is_sync); | |
e21b7a0b | 4776 | bfq_init_entity(&bfqq->entity, bfqg); |
aee69d78 PV |
4777 | bfq_log_bfqq(bfqd, bfqq, "allocated"); |
4778 | } else { | |
4779 | bfqq = &bfqd->oom_bfqq; | |
4780 | bfq_log_bfqq(bfqd, bfqq, "using oom bfqq"); | |
4781 | goto out; | |
4782 | } | |
4783 | ||
4784 | /* | |
4785 | * Pin the queue now that it's allocated, scheduler exit will | |
4786 | * prune it. | |
4787 | */ | |
4788 | if (async_bfqq) { | |
e21b7a0b AA |
4789 | bfqq->ref++; /* |
4790 | * Extra group reference, w.r.t. sync | |
4791 | * queue. This extra reference is removed | |
4792 | * only if bfqq->bfqg disappears, to | |
4793 | * guarantee that this queue is not freed | |
4794 | * until its group goes away. | |
4795 | */ | |
4796 | bfq_log_bfqq(bfqd, bfqq, "get_queue, bfqq not in async: %p, %d", | |
aee69d78 PV |
4797 | bfqq, bfqq->ref); |
4798 | *async_bfqq = bfqq; | |
4799 | } | |
4800 | ||
4801 | out: | |
4802 | bfqq->ref++; /* get a process reference to this queue */ | |
4803 | bfq_log_bfqq(bfqd, bfqq, "get_queue, at end: %p, %d", bfqq, bfqq->ref); | |
4804 | rcu_read_unlock(); | |
4805 | return bfqq; | |
4806 | } | |
4807 | ||
4808 | static void bfq_update_io_thinktime(struct bfq_data *bfqd, | |
4809 | struct bfq_queue *bfqq) | |
4810 | { | |
4811 | struct bfq_ttime *ttime = &bfqq->ttime; | |
4812 | u64 elapsed = ktime_get_ns() - bfqq->ttime.last_end_request; | |
4813 | ||
4814 | elapsed = min_t(u64, elapsed, 2ULL * bfqd->bfq_slice_idle); | |
4815 | ||
4816 | ttime->ttime_samples = (7*bfqq->ttime.ttime_samples + 256) / 8; | |
4817 | ttime->ttime_total = div_u64(7*ttime->ttime_total + 256*elapsed, 8); | |
4818 | ttime->ttime_mean = div64_ul(ttime->ttime_total + 128, | |
4819 | ttime->ttime_samples); | |
4820 | } | |
4821 | ||
4822 | static void | |
4823 | bfq_update_io_seektime(struct bfq_data *bfqd, struct bfq_queue *bfqq, | |
4824 | struct request *rq) | |
4825 | { | |
aee69d78 | 4826 | bfqq->seek_history <<= 1; |
d87447d8 | 4827 | bfqq->seek_history |= BFQ_RQ_SEEKY(bfqd, bfqq->last_request_pos, rq); |
7074f076 PV |
4828 | |
4829 | if (bfqq->wr_coeff > 1 && | |
4830 | bfqq->wr_cur_max_time == bfqd->bfq_wr_rt_max_time && | |
4831 | BFQQ_TOTALLY_SEEKY(bfqq)) | |
4832 | bfq_bfqq_end_wr(bfqq); | |
aee69d78 PV |
4833 | } |
4834 | ||
d5be3fef PV |
4835 | static void bfq_update_has_short_ttime(struct bfq_data *bfqd, |
4836 | struct bfq_queue *bfqq, | |
4837 | struct bfq_io_cq *bic) | |
aee69d78 | 4838 | { |
d5be3fef | 4839 | bool has_short_ttime = true; |
aee69d78 | 4840 | |
d5be3fef PV |
4841 | /* |
4842 | * No need to update has_short_ttime if bfqq is async or in | |
4843 | * idle io prio class, or if bfq_slice_idle is zero, because | |
4844 | * no device idling is performed for bfqq in this case. | |
4845 | */ | |
4846 | if (!bfq_bfqq_sync(bfqq) || bfq_class_idle(bfqq) || | |
4847 | bfqd->bfq_slice_idle == 0) | |
aee69d78 PV |
4848 | return; |
4849 | ||
36eca894 AA |
4850 | /* Idle window just restored, statistics are meaningless. */ |
4851 | if (time_is_after_eq_jiffies(bfqq->split_time + | |
4852 | bfqd->bfq_wr_min_idle_time)) | |
4853 | return; | |
4854 | ||
d5be3fef PV |
4855 | /* Think time is infinite if no process is linked to |
4856 | * bfqq. Otherwise check average think time to | |
4857 | * decide whether to mark as has_short_ttime | |
4858 | */ | |
aee69d78 | 4859 | if (atomic_read(&bic->icq.ioc->active_ref) == 0 || |
d5be3fef PV |
4860 | (bfq_sample_valid(bfqq->ttime.ttime_samples) && |
4861 | bfqq->ttime.ttime_mean > bfqd->bfq_slice_idle)) | |
4862 | has_short_ttime = false; | |
4863 | ||
4864 | bfq_log_bfqq(bfqd, bfqq, "update_has_short_ttime: has_short_ttime %d", | |
4865 | has_short_ttime); | |
aee69d78 | 4866 | |
d5be3fef PV |
4867 | if (has_short_ttime) |
4868 | bfq_mark_bfqq_has_short_ttime(bfqq); | |
aee69d78 | 4869 | else |
d5be3fef | 4870 | bfq_clear_bfqq_has_short_ttime(bfqq); |
aee69d78 PV |
4871 | } |
4872 | ||
4873 | /* | |
4874 | * Called when a new fs request (rq) is added to bfqq. Check if there's | |
4875 | * something we should do about it. | |
4876 | */ | |
4877 | static void bfq_rq_enqueued(struct bfq_data *bfqd, struct bfq_queue *bfqq, | |
4878 | struct request *rq) | |
4879 | { | |
4880 | struct bfq_io_cq *bic = RQ_BIC(rq); | |
4881 | ||
4882 | if (rq->cmd_flags & REQ_META) | |
4883 | bfqq->meta_pending++; | |
4884 | ||
4885 | bfq_update_io_thinktime(bfqd, bfqq); | |
d5be3fef | 4886 | bfq_update_has_short_ttime(bfqd, bfqq, bic); |
aee69d78 | 4887 | bfq_update_io_seektime(bfqd, bfqq, rq); |
aee69d78 PV |
4888 | |
4889 | bfq_log_bfqq(bfqd, bfqq, | |
d5be3fef PV |
4890 | "rq_enqueued: has_short_ttime=%d (seeky %d)", |
4891 | bfq_bfqq_has_short_ttime(bfqq), BFQQ_SEEKY(bfqq)); | |
aee69d78 PV |
4892 | |
4893 | bfqq->last_request_pos = blk_rq_pos(rq) + blk_rq_sectors(rq); | |
4894 | ||
4895 | if (bfqq == bfqd->in_service_queue && bfq_bfqq_wait_request(bfqq)) { | |
4896 | bool small_req = bfqq->queued[rq_is_sync(rq)] == 1 && | |
4897 | blk_rq_sectors(rq) < 32; | |
4898 | bool budget_timeout = bfq_bfqq_budget_timeout(bfqq); | |
4899 | ||
4900 | /* | |
ac8b0cb4 PV |
4901 | * There is just this request queued: if |
4902 | * - the request is small, and | |
4903 | * - we are idling to boost throughput, and | |
4904 | * - the queue is not to be expired, | |
4905 | * then just exit. | |
aee69d78 PV |
4906 | * |
4907 | * In this way, if the device is being idled to wait | |
4908 | * for a new request from the in-service queue, we | |
4909 | * avoid unplugging the device and committing the | |
ac8b0cb4 PV |
4910 | * device to serve just a small request. In contrast |
4911 | * we wait for the block layer to decide when to | |
4912 | * unplug the device: hopefully, new requests will be | |
4913 | * merged to this one quickly, then the device will be | |
4914 | * unplugged and larger requests will be dispatched. | |
aee69d78 | 4915 | */ |
ac8b0cb4 PV |
4916 | if (small_req && idling_boosts_thr_without_issues(bfqd, bfqq) && |
4917 | !budget_timeout) | |
aee69d78 PV |
4918 | return; |
4919 | ||
4920 | /* | |
ac8b0cb4 PV |
4921 | * A large enough request arrived, or idling is being |
4922 | * performed to preserve service guarantees, or | |
4923 | * finally the queue is to be expired: in all these | |
4924 | * cases disk idling is to be stopped, so clear | |
4925 | * wait_request flag and reset timer. | |
aee69d78 PV |
4926 | */ |
4927 | bfq_clear_bfqq_wait_request(bfqq); | |
4928 | hrtimer_try_to_cancel(&bfqd->idle_slice_timer); | |
4929 | ||
4930 | /* | |
4931 | * The queue is not empty, because a new request just | |
4932 | * arrived. Hence we can safely expire the queue, in | |
4933 | * case of budget timeout, without risking that the | |
4934 | * timestamps of the queue are not updated correctly. | |
4935 | * See [1] for more details. | |
4936 | */ | |
4937 | if (budget_timeout) | |
4938 | bfq_bfqq_expire(bfqd, bfqq, false, | |
4939 | BFQQE_BUDGET_TIMEOUT); | |
4940 | } | |
4941 | } | |
4942 | ||
24bfd19b PV |
4943 | /* returns true if it causes the idle timer to be disabled */ |
4944 | static bool __bfq_insert_request(struct bfq_data *bfqd, struct request *rq) | |
aee69d78 | 4945 | { |
36eca894 AA |
4946 | struct bfq_queue *bfqq = RQ_BFQQ(rq), |
4947 | *new_bfqq = bfq_setup_cooperator(bfqd, bfqq, rq, true); | |
24bfd19b | 4948 | bool waiting, idle_timer_disabled = false; |
36eca894 AA |
4949 | |
4950 | if (new_bfqq) { | |
36eca894 AA |
4951 | /* |
4952 | * Release the request's reference to the old bfqq | |
4953 | * and make sure one is taken to the shared queue. | |
4954 | */ | |
4955 | new_bfqq->allocated++; | |
4956 | bfqq->allocated--; | |
4957 | new_bfqq->ref++; | |
4958 | /* | |
4959 | * If the bic associated with the process | |
4960 | * issuing this request still points to bfqq | |
4961 | * (and thus has not been already redirected | |
4962 | * to new_bfqq or even some other bfq_queue), | |
4963 | * then complete the merge and redirect it to | |
4964 | * new_bfqq. | |
4965 | */ | |
4966 | if (bic_to_bfqq(RQ_BIC(rq), 1) == bfqq) | |
4967 | bfq_merge_bfqqs(bfqd, RQ_BIC(rq), | |
4968 | bfqq, new_bfqq); | |
894df937 PV |
4969 | |
4970 | bfq_clear_bfqq_just_created(bfqq); | |
36eca894 AA |
4971 | /* |
4972 | * rq is about to be enqueued into new_bfqq, | |
4973 | * release rq reference on bfqq | |
4974 | */ | |
4975 | bfq_put_queue(bfqq); | |
4976 | rq->elv.priv[1] = new_bfqq; | |
4977 | bfqq = new_bfqq; | |
4978 | } | |
aee69d78 | 4979 | |
24bfd19b | 4980 | waiting = bfqq && bfq_bfqq_wait_request(bfqq); |
aee69d78 | 4981 | bfq_add_request(rq); |
24bfd19b | 4982 | idle_timer_disabled = waiting && !bfq_bfqq_wait_request(bfqq); |
aee69d78 PV |
4983 | |
4984 | rq->fifo_time = ktime_get_ns() + bfqd->bfq_fifo_expire[rq_is_sync(rq)]; | |
4985 | list_add_tail(&rq->queuelist, &bfqq->fifo); | |
4986 | ||
4987 | bfq_rq_enqueued(bfqd, bfqq, rq); | |
24bfd19b PV |
4988 | |
4989 | return idle_timer_disabled; | |
aee69d78 PV |
4990 | } |
4991 | ||
9b25bd03 PV |
4992 | #if defined(CONFIG_BFQ_GROUP_IOSCHED) && defined(CONFIG_DEBUG_BLK_CGROUP) |
4993 | static void bfq_update_insert_stats(struct request_queue *q, | |
4994 | struct bfq_queue *bfqq, | |
4995 | bool idle_timer_disabled, | |
4996 | unsigned int cmd_flags) | |
4997 | { | |
4998 | if (!bfqq) | |
4999 | return; | |
5000 | ||
5001 | /* | |
5002 | * bfqq still exists, because it can disappear only after | |
5003 | * either it is merged with another queue, or the process it | |
5004 | * is associated with exits. But both actions must be taken by | |
5005 | * the same process currently executing this flow of | |
5006 | * instructions. | |
5007 | * | |
5008 | * In addition, the following queue lock guarantees that | |
5009 | * bfqq_group(bfqq) exists as well. | |
5010 | */ | |
0d945c1f | 5011 | spin_lock_irq(&q->queue_lock); |
9b25bd03 PV |
5012 | bfqg_stats_update_io_add(bfqq_group(bfqq), bfqq, cmd_flags); |
5013 | if (idle_timer_disabled) | |
5014 | bfqg_stats_update_idle_time(bfqq_group(bfqq)); | |
0d945c1f | 5015 | spin_unlock_irq(&q->queue_lock); |
9b25bd03 PV |
5016 | } |
5017 | #else | |
5018 | static inline void bfq_update_insert_stats(struct request_queue *q, | |
5019 | struct bfq_queue *bfqq, | |
5020 | bool idle_timer_disabled, | |
5021 | unsigned int cmd_flags) {} | |
5022 | #endif | |
5023 | ||
aee69d78 PV |
5024 | static void bfq_insert_request(struct blk_mq_hw_ctx *hctx, struct request *rq, |
5025 | bool at_head) | |
5026 | { | |
5027 | struct request_queue *q = hctx->queue; | |
5028 | struct bfq_data *bfqd = q->elevator->elevator_data; | |
18e5a57d | 5029 | struct bfq_queue *bfqq; |
24bfd19b PV |
5030 | bool idle_timer_disabled = false; |
5031 | unsigned int cmd_flags; | |
aee69d78 PV |
5032 | |
5033 | spin_lock_irq(&bfqd->lock); | |
5034 | if (blk_mq_sched_try_insert_merge(q, rq)) { | |
5035 | spin_unlock_irq(&bfqd->lock); | |
5036 | return; | |
5037 | } | |
5038 | ||
5039 | spin_unlock_irq(&bfqd->lock); | |
5040 | ||
5041 | blk_mq_sched_request_inserted(rq); | |
5042 | ||
5043 | spin_lock_irq(&bfqd->lock); | |
18e5a57d | 5044 | bfqq = bfq_init_rq(rq); |
aee69d78 PV |
5045 | if (at_head || blk_rq_is_passthrough(rq)) { |
5046 | if (at_head) | |
5047 | list_add(&rq->queuelist, &bfqd->dispatch); | |
5048 | else | |
5049 | list_add_tail(&rq->queuelist, &bfqd->dispatch); | |
18e5a57d | 5050 | } else { /* bfqq is assumed to be non null here */ |
24bfd19b | 5051 | idle_timer_disabled = __bfq_insert_request(bfqd, rq); |
614822f8 LM |
5052 | /* |
5053 | * Update bfqq, because, if a queue merge has occurred | |
5054 | * in __bfq_insert_request, then rq has been | |
5055 | * redirected into a new queue. | |
5056 | */ | |
5057 | bfqq = RQ_BFQQ(rq); | |
aee69d78 PV |
5058 | |
5059 | if (rq_mergeable(rq)) { | |
5060 | elv_rqhash_add(q, rq); | |
5061 | if (!q->last_merge) | |
5062 | q->last_merge = rq; | |
5063 | } | |
5064 | } | |
5065 | ||
24bfd19b PV |
5066 | /* |
5067 | * Cache cmd_flags before releasing scheduler lock, because rq | |
5068 | * may disappear afterwards (for example, because of a request | |
5069 | * merge). | |
5070 | */ | |
5071 | cmd_flags = rq->cmd_flags; | |
9b25bd03 | 5072 | |
6fa3e8d3 | 5073 | spin_unlock_irq(&bfqd->lock); |
24bfd19b | 5074 | |
9b25bd03 PV |
5075 | bfq_update_insert_stats(q, bfqq, idle_timer_disabled, |
5076 | cmd_flags); | |
aee69d78 PV |
5077 | } |
5078 | ||
5079 | static void bfq_insert_requests(struct blk_mq_hw_ctx *hctx, | |
5080 | struct list_head *list, bool at_head) | |
5081 | { | |
5082 | while (!list_empty(list)) { | |
5083 | struct request *rq; | |
5084 | ||
5085 | rq = list_first_entry(list, struct request, queuelist); | |
5086 | list_del_init(&rq->queuelist); | |
5087 | bfq_insert_request(hctx, rq, at_head); | |
5088 | } | |
5089 | } | |
5090 | ||
5091 | static void bfq_update_hw_tag(struct bfq_data *bfqd) | |
5092 | { | |
b3c34981 PV |
5093 | struct bfq_queue *bfqq = bfqd->in_service_queue; |
5094 | ||
aee69d78 PV |
5095 | bfqd->max_rq_in_driver = max_t(int, bfqd->max_rq_in_driver, |
5096 | bfqd->rq_in_driver); | |
5097 | ||
5098 | if (bfqd->hw_tag == 1) | |
5099 | return; | |
5100 | ||
5101 | /* | |
5102 | * This sample is valid if the number of outstanding requests | |
5103 | * is large enough to allow a queueing behavior. Note that the | |
5104 | * sum is not exact, as it's not taking into account deactivated | |
5105 | * requests. | |
5106 | */ | |
a3c92560 | 5107 | if (bfqd->rq_in_driver + bfqd->queued <= BFQ_HW_QUEUE_THRESHOLD) |
aee69d78 PV |
5108 | return; |
5109 | ||
b3c34981 PV |
5110 | /* |
5111 | * If active queue hasn't enough requests and can idle, bfq might not | |
5112 | * dispatch sufficient requests to hardware. Don't zero hw_tag in this | |
5113 | * case | |
5114 | */ | |
5115 | if (bfqq && bfq_bfqq_has_short_ttime(bfqq) && | |
5116 | bfqq->dispatched + bfqq->queued[0] + bfqq->queued[1] < | |
5117 | BFQ_HW_QUEUE_THRESHOLD && | |
5118 | bfqd->rq_in_driver < BFQ_HW_QUEUE_THRESHOLD) | |
5119 | return; | |
5120 | ||
aee69d78 PV |
5121 | if (bfqd->hw_tag_samples++ < BFQ_HW_QUEUE_SAMPLES) |
5122 | return; | |
5123 | ||
5124 | bfqd->hw_tag = bfqd->max_rq_in_driver > BFQ_HW_QUEUE_THRESHOLD; | |
5125 | bfqd->max_rq_in_driver = 0; | |
5126 | bfqd->hw_tag_samples = 0; | |
8cacc5ab PV |
5127 | |
5128 | bfqd->nonrot_with_queueing = | |
5129 | blk_queue_nonrot(bfqd->queue) && bfqd->hw_tag; | |
aee69d78 PV |
5130 | } |
5131 | ||
5132 | static void bfq_completed_request(struct bfq_queue *bfqq, struct bfq_data *bfqd) | |
5133 | { | |
ab0e43e9 PV |
5134 | u64 now_ns; |
5135 | u32 delta_us; | |
5136 | ||
aee69d78 PV |
5137 | bfq_update_hw_tag(bfqd); |
5138 | ||
5139 | bfqd->rq_in_driver--; | |
5140 | bfqq->dispatched--; | |
5141 | ||
44e44a1b PV |
5142 | if (!bfqq->dispatched && !bfq_bfqq_busy(bfqq)) { |
5143 | /* | |
5144 | * Set budget_timeout (which we overload to store the | |
5145 | * time at which the queue remains with no backlog and | |
5146 | * no outstanding request; used by the weight-raising | |
5147 | * mechanism). | |
5148 | */ | |
5149 | bfqq->budget_timeout = jiffies; | |
1de0c4cd | 5150 | |
0471559c | 5151 | bfq_weights_tree_remove(bfqd, bfqq); |
44e44a1b PV |
5152 | } |
5153 | ||
ab0e43e9 PV |
5154 | now_ns = ktime_get_ns(); |
5155 | ||
5156 | bfqq->ttime.last_end_request = now_ns; | |
5157 | ||
5158 | /* | |
5159 | * Using us instead of ns, to get a reasonable precision in | |
5160 | * computing rate in next check. | |
5161 | */ | |
5162 | delta_us = div_u64(now_ns - bfqd->last_completion, NSEC_PER_USEC); | |
5163 | ||
5164 | /* | |
5165 | * If the request took rather long to complete, and, according | |
5166 | * to the maximum request size recorded, this completion latency | |
5167 | * implies that the request was certainly served at a very low | |
5168 | * rate (less than 1M sectors/sec), then the whole observation | |
5169 | * interval that lasts up to this time instant cannot be a | |
5170 | * valid time interval for computing a new peak rate. Invoke | |
5171 | * bfq_update_rate_reset to have the following three steps | |
5172 | * taken: | |
5173 | * - close the observation interval at the last (previous) | |
5174 | * request dispatch or completion | |
5175 | * - compute rate, if possible, for that observation interval | |
5176 | * - reset to zero samples, which will trigger a proper | |
5177 | * re-initialization of the observation interval on next | |
5178 | * dispatch | |
5179 | */ | |
5180 | if (delta_us > BFQ_MIN_TT/NSEC_PER_USEC && | |
5181 | (bfqd->last_rq_max_size<<BFQ_RATE_SHIFT)/delta_us < | |
5182 | 1UL<<(BFQ_RATE_SHIFT - 10)) | |
5183 | bfq_update_rate_reset(bfqd, NULL); | |
5184 | bfqd->last_completion = now_ns; | |
aee69d78 | 5185 | |
77b7dcea PV |
5186 | /* |
5187 | * If we are waiting to discover whether the request pattern | |
5188 | * of the task associated with the queue is actually | |
5189 | * isochronous, and both requisites for this condition to hold | |
5190 | * are now satisfied, then compute soft_rt_next_start (see the | |
5191 | * comments on the function bfq_bfqq_softrt_next_start()). We | |
20cd3245 PV |
5192 | * do not compute soft_rt_next_start if bfqq is in interactive |
5193 | * weight raising (see the comments in bfq_bfqq_expire() for | |
5194 | * an explanation). We schedule this delayed update when bfqq | |
5195 | * expires, if it still has in-flight requests. | |
77b7dcea PV |
5196 | */ |
5197 | if (bfq_bfqq_softrt_update(bfqq) && bfqq->dispatched == 0 && | |
20cd3245 PV |
5198 | RB_EMPTY_ROOT(&bfqq->sort_list) && |
5199 | bfqq->wr_coeff != bfqd->bfq_wr_coeff) | |
77b7dcea PV |
5200 | bfqq->soft_rt_next_start = |
5201 | bfq_bfqq_softrt_next_start(bfqd, bfqq); | |
5202 | ||
aee69d78 PV |
5203 | /* |
5204 | * If this is the in-service queue, check if it needs to be expired, | |
5205 | * or if we want to idle in case it has no pending requests. | |
5206 | */ | |
5207 | if (bfqd->in_service_queue == bfqq) { | |
4420b095 PV |
5208 | if (bfq_bfqq_must_idle(bfqq)) { |
5209 | if (bfqq->dispatched == 0) | |
5210 | bfq_arm_slice_timer(bfqd); | |
5211 | /* | |
5212 | * If we get here, we do not expire bfqq, even | |
5213 | * if bfqq was in budget timeout or had no | |
5214 | * more requests (as controlled in the next | |
5215 | * conditional instructions). The reason for | |
5216 | * not expiring bfqq is as follows. | |
5217 | * | |
5218 | * Here bfqq->dispatched > 0 holds, but | |
5219 | * bfq_bfqq_must_idle() returned true. This | |
5220 | * implies that, even if no request arrives | |
5221 | * for bfqq before bfqq->dispatched reaches 0, | |
5222 | * bfqq will, however, not be expired on the | |
5223 | * completion event that causes bfqq->dispatch | |
5224 | * to reach zero. In contrast, on this event, | |
5225 | * bfqq will start enjoying device idling | |
5226 | * (I/O-dispatch plugging). | |
5227 | * | |
5228 | * But, if we expired bfqq here, bfqq would | |
5229 | * not have the chance to enjoy device idling | |
5230 | * when bfqq->dispatched finally reaches | |
5231 | * zero. This would expose bfqq to violation | |
5232 | * of its reserved service guarantees. | |
5233 | */ | |
aee69d78 PV |
5234 | return; |
5235 | } else if (bfq_may_expire_for_budg_timeout(bfqq)) | |
5236 | bfq_bfqq_expire(bfqd, bfqq, false, | |
5237 | BFQQE_BUDGET_TIMEOUT); | |
5238 | else if (RB_EMPTY_ROOT(&bfqq->sort_list) && | |
5239 | (bfqq->dispatched == 0 || | |
277a4a9b | 5240 | !bfq_better_to_idle(bfqq))) |
aee69d78 PV |
5241 | bfq_bfqq_expire(bfqd, bfqq, false, |
5242 | BFQQE_NO_MORE_REQUESTS); | |
5243 | } | |
3f7cb4f4 HT |
5244 | |
5245 | if (!bfqd->rq_in_driver) | |
5246 | bfq_schedule_dispatch(bfqd); | |
aee69d78 PV |
5247 | } |
5248 | ||
a7877390 | 5249 | static void bfq_finish_requeue_request_body(struct bfq_queue *bfqq) |
aee69d78 PV |
5250 | { |
5251 | bfqq->allocated--; | |
5252 | ||
5253 | bfq_put_queue(bfqq); | |
5254 | } | |
5255 | ||
2341d662 PV |
5256 | /* |
5257 | * The processes associated with bfqq may happen to generate their | |
5258 | * cumulative I/O at a lower rate than the rate at which the device | |
5259 | * could serve the same I/O. This is rather probable, e.g., if only | |
5260 | * one process is associated with bfqq and the device is an SSD. It | |
5261 | * results in bfqq becoming often empty while in service. In this | |
5262 | * respect, if BFQ is allowed to switch to another queue when bfqq | |
5263 | * remains empty, then the device goes on being fed with I/O requests, | |
5264 | * and the throughput is not affected. In contrast, if BFQ is not | |
5265 | * allowed to switch to another queue---because bfqq is sync and | |
5266 | * I/O-dispatch needs to be plugged while bfqq is temporarily | |
5267 | * empty---then, during the service of bfqq, there will be frequent | |
5268 | * "service holes", i.e., time intervals during which bfqq gets empty | |
5269 | * and the device can only consume the I/O already queued in its | |
5270 | * hardware queues. During service holes, the device may even get to | |
5271 | * remaining idle. In the end, during the service of bfqq, the device | |
5272 | * is driven at a lower speed than the one it can reach with the kind | |
5273 | * of I/O flowing through bfqq. | |
5274 | * | |
5275 | * To counter this loss of throughput, BFQ implements a "request | |
5276 | * injection mechanism", which tries to fill the above service holes | |
5277 | * with I/O requests taken from other queues. The hard part in this | |
5278 | * mechanism is finding the right amount of I/O to inject, so as to | |
5279 | * both boost throughput and not break bfqq's bandwidth and latency | |
5280 | * guarantees. In this respect, the mechanism maintains a per-queue | |
5281 | * inject limit, computed as below. While bfqq is empty, the injection | |
5282 | * mechanism dispatches extra I/O requests only until the total number | |
5283 | * of I/O requests in flight---i.e., already dispatched but not yet | |
5284 | * completed---remains lower than this limit. | |
5285 | * | |
5286 | * A first definition comes in handy to introduce the algorithm by | |
5287 | * which the inject limit is computed. We define as first request for | |
5288 | * bfqq, an I/O request for bfqq that arrives while bfqq is in | |
5289 | * service, and causes bfqq to switch from empty to non-empty. The | |
5290 | * algorithm updates the limit as a function of the effect of | |
5291 | * injection on the service times of only the first requests of | |
5292 | * bfqq. The reason for this restriction is that these are the | |
5293 | * requests whose service time is affected most, because they are the | |
5294 | * first to arrive after injection possibly occurred. | |
5295 | * | |
5296 | * To evaluate the effect of injection, the algorithm measures the | |
5297 | * "total service time" of first requests. We define as total service | |
5298 | * time of an I/O request, the time that elapses since when the | |
5299 | * request is enqueued into bfqq, to when it is completed. This | |
5300 | * quantity allows the whole effect of injection to be measured. It is | |
5301 | * easy to see why. Suppose that some requests of other queues are | |
5302 | * actually injected while bfqq is empty, and that a new request R | |
5303 | * then arrives for bfqq. If the device does start to serve all or | |
5304 | * part of the injected requests during the service hole, then, | |
5305 | * because of this extra service, it may delay the next invocation of | |
5306 | * the dispatch hook of BFQ. Then, even after R gets eventually | |
5307 | * dispatched, the device may delay the actual service of R if it is | |
5308 | * still busy serving the extra requests, or if it decides to serve, | |
5309 | * before R, some extra request still present in its queues. As a | |
5310 | * conclusion, the cumulative extra delay caused by injection can be | |
5311 | * easily evaluated by just comparing the total service time of first | |
5312 | * requests with and without injection. | |
5313 | * | |
5314 | * The limit-update algorithm works as follows. On the arrival of a | |
5315 | * first request of bfqq, the algorithm measures the total time of the | |
5316 | * request only if one of the three cases below holds, and, for each | |
5317 | * case, it updates the limit as described below: | |
5318 | * | |
5319 | * (1) If there is no in-flight request. This gives a baseline for the | |
5320 | * total service time of the requests of bfqq. If the baseline has | |
5321 | * not been computed yet, then, after computing it, the limit is | |
5322 | * set to 1, to start boosting throughput, and to prepare the | |
5323 | * ground for the next case. If the baseline has already been | |
5324 | * computed, then it is updated, in case it results to be lower | |
5325 | * than the previous value. | |
5326 | * | |
5327 | * (2) If the limit is higher than 0 and there are in-flight | |
5328 | * requests. By comparing the total service time in this case with | |
5329 | * the above baseline, it is possible to know at which extent the | |
5330 | * current value of the limit is inflating the total service | |
5331 | * time. If the inflation is below a certain threshold, then bfqq | |
5332 | * is assumed to be suffering from no perceivable loss of its | |
5333 | * service guarantees, and the limit is even tentatively | |
5334 | * increased. If the inflation is above the threshold, then the | |
5335 | * limit is decreased. Due to the lack of any hysteresis, this | |
5336 | * logic makes the limit oscillate even in steady workload | |
5337 | * conditions. Yet we opted for it, because it is fast in reaching | |
5338 | * the best value for the limit, as a function of the current I/O | |
5339 | * workload. To reduce oscillations, this step is disabled for a | |
5340 | * short time interval after the limit happens to be decreased. | |
5341 | * | |
5342 | * (3) Periodically, after resetting the limit, to make sure that the | |
5343 | * limit eventually drops in case the workload changes. This is | |
5344 | * needed because, after the limit has gone safely up for a | |
5345 | * certain workload, it is impossible to guess whether the | |
5346 | * baseline total service time may have changed, without measuring | |
5347 | * it again without injection. A more effective version of this | |
5348 | * step might be to just sample the baseline, by interrupting | |
5349 | * injection only once, and then to reset/lower the limit only if | |
5350 | * the total service time with the current limit does happen to be | |
5351 | * too large. | |
5352 | * | |
5353 | * More details on each step are provided in the comments on the | |
5354 | * pieces of code that implement these steps: the branch handling the | |
5355 | * transition from empty to non empty in bfq_add_request(), the branch | |
5356 | * handling injection in bfq_select_queue(), and the function | |
5357 | * bfq_choose_bfqq_for_injection(). These comments also explain some | |
5358 | * exceptions, made by the injection mechanism in some special cases. | |
5359 | */ | |
5360 | static void bfq_update_inject_limit(struct bfq_data *bfqd, | |
5361 | struct bfq_queue *bfqq) | |
5362 | { | |
5363 | u64 tot_time_ns = ktime_get_ns() - bfqd->last_empty_occupied_ns; | |
5364 | unsigned int old_limit = bfqq->inject_limit; | |
5365 | ||
5366 | if (bfqq->last_serv_time_ns > 0) { | |
5367 | u64 threshold = (bfqq->last_serv_time_ns * 3)>>1; | |
5368 | ||
5369 | if (tot_time_ns >= threshold && old_limit > 0) { | |
5370 | bfqq->inject_limit--; | |
5371 | bfqq->decrease_time_jif = jiffies; | |
5372 | } else if (tot_time_ns < threshold && | |
5373 | old_limit < bfqd->max_rq_in_driver<<1) | |
5374 | bfqq->inject_limit++; | |
5375 | } | |
5376 | ||
5377 | /* | |
5378 | * Either we still have to compute the base value for the | |
5379 | * total service time, and there seem to be the right | |
5380 | * conditions to do it, or we can lower the last base value | |
5381 | * computed. | |
5382 | */ | |
5383 | if ((bfqq->last_serv_time_ns == 0 && bfqd->rq_in_driver == 0) || | |
5384 | tot_time_ns < bfqq->last_serv_time_ns) { | |
5385 | bfqq->last_serv_time_ns = tot_time_ns; | |
5386 | /* | |
5387 | * Now we certainly have a base value: make sure we | |
5388 | * start trying injection. | |
5389 | */ | |
5390 | bfqq->inject_limit = max_t(unsigned int, 1, old_limit); | |
5391 | } | |
5392 | ||
5393 | /* update complete, not waiting for any request completion any longer */ | |
5394 | bfqd->waited_rq = NULL; | |
5395 | } | |
5396 | ||
a7877390 PV |
5397 | /* |
5398 | * Handle either a requeue or a finish for rq. The things to do are | |
5399 | * the same in both cases: all references to rq are to be dropped. In | |
5400 | * particular, rq is considered completed from the point of view of | |
5401 | * the scheduler. | |
5402 | */ | |
5403 | static void bfq_finish_requeue_request(struct request *rq) | |
aee69d78 | 5404 | { |
a7877390 | 5405 | struct bfq_queue *bfqq = RQ_BFQQ(rq); |
5bbf4e5a CH |
5406 | struct bfq_data *bfqd; |
5407 | ||
a7877390 PV |
5408 | /* |
5409 | * Requeue and finish hooks are invoked in blk-mq without | |
5410 | * checking whether the involved request is actually still | |
5411 | * referenced in the scheduler. To handle this fact, the | |
5412 | * following two checks make this function exit in case of | |
5413 | * spurious invocations, for which there is nothing to do. | |
5414 | * | |
5415 | * First, check whether rq has nothing to do with an elevator. | |
5416 | */ | |
5417 | if (unlikely(!(rq->rq_flags & RQF_ELVPRIV))) | |
5418 | return; | |
5419 | ||
5420 | /* | |
5421 | * rq either is not associated with any icq, or is an already | |
5422 | * requeued request that has not (yet) been re-inserted into | |
5423 | * a bfq_queue. | |
5424 | */ | |
5425 | if (!rq->elv.icq || !bfqq) | |
5bbf4e5a CH |
5426 | return; |
5427 | ||
5bbf4e5a | 5428 | bfqd = bfqq->bfqd; |
aee69d78 | 5429 | |
e21b7a0b AA |
5430 | if (rq->rq_flags & RQF_STARTED) |
5431 | bfqg_stats_update_completion(bfqq_group(bfqq), | |
522a7775 OS |
5432 | rq->start_time_ns, |
5433 | rq->io_start_time_ns, | |
e21b7a0b | 5434 | rq->cmd_flags); |
aee69d78 PV |
5435 | |
5436 | if (likely(rq->rq_flags & RQF_STARTED)) { | |
5437 | unsigned long flags; | |
5438 | ||
5439 | spin_lock_irqsave(&bfqd->lock, flags); | |
5440 | ||
2341d662 PV |
5441 | if (rq == bfqd->waited_rq) |
5442 | bfq_update_inject_limit(bfqd, bfqq); | |
5443 | ||
aee69d78 | 5444 | bfq_completed_request(bfqq, bfqd); |
a7877390 | 5445 | bfq_finish_requeue_request_body(bfqq); |
aee69d78 | 5446 | |
6fa3e8d3 | 5447 | spin_unlock_irqrestore(&bfqd->lock, flags); |
aee69d78 PV |
5448 | } else { |
5449 | /* | |
5450 | * Request rq may be still/already in the scheduler, | |
a7877390 PV |
5451 | * in which case we need to remove it (this should |
5452 | * never happen in case of requeue). And we cannot | |
aee69d78 PV |
5453 | * defer such a check and removal, to avoid |
5454 | * inconsistencies in the time interval from the end | |
5455 | * of this function to the start of the deferred work. | |
5456 | * This situation seems to occur only in process | |
5457 | * context, as a consequence of a merge. In the | |
5458 | * current version of the code, this implies that the | |
5459 | * lock is held. | |
5460 | */ | |
5461 | ||
614822f8 | 5462 | if (!RB_EMPTY_NODE(&rq->rb_node)) { |
7b9e9361 | 5463 | bfq_remove_request(rq->q, rq); |
614822f8 LM |
5464 | bfqg_stats_update_io_remove(bfqq_group(bfqq), |
5465 | rq->cmd_flags); | |
5466 | } | |
a7877390 | 5467 | bfq_finish_requeue_request_body(bfqq); |
aee69d78 PV |
5468 | } |
5469 | ||
a7877390 PV |
5470 | /* |
5471 | * Reset private fields. In case of a requeue, this allows | |
5472 | * this function to correctly do nothing if it is spuriously | |
5473 | * invoked again on this same request (see the check at the | |
5474 | * beginning of the function). Probably, a better general | |
5475 | * design would be to prevent blk-mq from invoking the requeue | |
5476 | * or finish hooks of an elevator, for a request that is not | |
5477 | * referred by that elevator. | |
5478 | * | |
5479 | * Resetting the following fields would break the | |
5480 | * request-insertion logic if rq is re-inserted into a bfq | |
5481 | * internal queue, without a re-preparation. Here we assume | |
5482 | * that re-insertions of requeued requests, without | |
5483 | * re-preparation, can happen only for pass_through or at_head | |
5484 | * requests (which are not re-inserted into bfq internal | |
5485 | * queues). | |
5486 | */ | |
aee69d78 PV |
5487 | rq->elv.priv[0] = NULL; |
5488 | rq->elv.priv[1] = NULL; | |
5489 | } | |
5490 | ||
36eca894 AA |
5491 | /* |
5492 | * Returns NULL if a new bfqq should be allocated, or the old bfqq if this | |
5493 | * was the last process referring to that bfqq. | |
5494 | */ | |
5495 | static struct bfq_queue * | |
5496 | bfq_split_bfqq(struct bfq_io_cq *bic, struct bfq_queue *bfqq) | |
5497 | { | |
5498 | bfq_log_bfqq(bfqq->bfqd, bfqq, "splitting queue"); | |
5499 | ||
5500 | if (bfqq_process_refs(bfqq) == 1) { | |
5501 | bfqq->pid = current->pid; | |
5502 | bfq_clear_bfqq_coop(bfqq); | |
5503 | bfq_clear_bfqq_split_coop(bfqq); | |
5504 | return bfqq; | |
5505 | } | |
5506 | ||
5507 | bic_set_bfqq(bic, NULL, 1); | |
5508 | ||
5509 | bfq_put_cooperator(bfqq); | |
5510 | ||
5511 | bfq_put_queue(bfqq); | |
5512 | return NULL; | |
5513 | } | |
5514 | ||
5515 | static struct bfq_queue *bfq_get_bfqq_handle_split(struct bfq_data *bfqd, | |
5516 | struct bfq_io_cq *bic, | |
5517 | struct bio *bio, | |
5518 | bool split, bool is_sync, | |
5519 | bool *new_queue) | |
5520 | { | |
5521 | struct bfq_queue *bfqq = bic_to_bfqq(bic, is_sync); | |
5522 | ||
5523 | if (likely(bfqq && bfqq != &bfqd->oom_bfqq)) | |
5524 | return bfqq; | |
5525 | ||
5526 | if (new_queue) | |
5527 | *new_queue = true; | |
5528 | ||
5529 | if (bfqq) | |
5530 | bfq_put_queue(bfqq); | |
5531 | bfqq = bfq_get_queue(bfqd, bio, is_sync, bic); | |
5532 | ||
5533 | bic_set_bfqq(bic, bfqq, is_sync); | |
e1b2324d AA |
5534 | if (split && is_sync) { |
5535 | if ((bic->was_in_burst_list && bfqd->large_burst) || | |
5536 | bic->saved_in_large_burst) | |
5537 | bfq_mark_bfqq_in_large_burst(bfqq); | |
5538 | else { | |
5539 | bfq_clear_bfqq_in_large_burst(bfqq); | |
5540 | if (bic->was_in_burst_list) | |
99fead8d PV |
5541 | /* |
5542 | * If bfqq was in the current | |
5543 | * burst list before being | |
5544 | * merged, then we have to add | |
5545 | * it back. And we do not need | |
5546 | * to increase burst_size, as | |
5547 | * we did not decrement | |
5548 | * burst_size when we removed | |
5549 | * bfqq from the burst list as | |
5550 | * a consequence of a merge | |
5551 | * (see comments in | |
5552 | * bfq_put_queue). In this | |
5553 | * respect, it would be rather | |
5554 | * costly to know whether the | |
5555 | * current burst list is still | |
5556 | * the same burst list from | |
5557 | * which bfqq was removed on | |
5558 | * the merge. To avoid this | |
5559 | * cost, if bfqq was in a | |
5560 | * burst list, then we add | |
5561 | * bfqq to the current burst | |
5562 | * list without any further | |
5563 | * check. This can cause | |
5564 | * inappropriate insertions, | |
5565 | * but rarely enough to not | |
5566 | * harm the detection of large | |
5567 | * bursts significantly. | |
5568 | */ | |
e1b2324d AA |
5569 | hlist_add_head(&bfqq->burst_list_node, |
5570 | &bfqd->burst_list); | |
5571 | } | |
36eca894 | 5572 | bfqq->split_time = jiffies; |
e1b2324d | 5573 | } |
36eca894 AA |
5574 | |
5575 | return bfqq; | |
5576 | } | |
5577 | ||
aee69d78 | 5578 | /* |
18e5a57d PV |
5579 | * Only reset private fields. The actual request preparation will be |
5580 | * performed by bfq_init_rq, when rq is either inserted or merged. See | |
5581 | * comments on bfq_init_rq for the reason behind this delayed | |
5582 | * preparation. | |
aee69d78 | 5583 | */ |
5bbf4e5a | 5584 | static void bfq_prepare_request(struct request *rq, struct bio *bio) |
18e5a57d PV |
5585 | { |
5586 | /* | |
5587 | * Regardless of whether we have an icq attached, we have to | |
5588 | * clear the scheduler pointers, as they might point to | |
5589 | * previously allocated bic/bfqq structs. | |
5590 | */ | |
5591 | rq->elv.priv[0] = rq->elv.priv[1] = NULL; | |
5592 | } | |
5593 | ||
5594 | /* | |
5595 | * If needed, init rq, allocate bfq data structures associated with | |
5596 | * rq, and increment reference counters in the destination bfq_queue | |
5597 | * for rq. Return the destination bfq_queue for rq, or NULL is rq is | |
5598 | * not associated with any bfq_queue. | |
5599 | * | |
5600 | * This function is invoked by the functions that perform rq insertion | |
5601 | * or merging. One may have expected the above preparation operations | |
5602 | * to be performed in bfq_prepare_request, and not delayed to when rq | |
5603 | * is inserted or merged. The rationale behind this delayed | |
5604 | * preparation is that, after the prepare_request hook is invoked for | |
5605 | * rq, rq may still be transformed into a request with no icq, i.e., a | |
5606 | * request not associated with any queue. No bfq hook is invoked to | |
5607 | * signal this tranformation. As a consequence, should these | |
5608 | * preparation operations be performed when the prepare_request hook | |
5609 | * is invoked, and should rq be transformed one moment later, bfq | |
5610 | * would end up in an inconsistent state, because it would have | |
5611 | * incremented some queue counters for an rq destined to | |
5612 | * transformation, without any chance to correctly lower these | |
5613 | * counters back. In contrast, no transformation can still happen for | |
5614 | * rq after rq has been inserted or merged. So, it is safe to execute | |
5615 | * these preparation operations when rq is finally inserted or merged. | |
5616 | */ | |
5617 | static struct bfq_queue *bfq_init_rq(struct request *rq) | |
aee69d78 | 5618 | { |
5bbf4e5a | 5619 | struct request_queue *q = rq->q; |
18e5a57d | 5620 | struct bio *bio = rq->bio; |
aee69d78 | 5621 | struct bfq_data *bfqd = q->elevator->elevator_data; |
9f210738 | 5622 | struct bfq_io_cq *bic; |
aee69d78 PV |
5623 | const int is_sync = rq_is_sync(rq); |
5624 | struct bfq_queue *bfqq; | |
36eca894 | 5625 | bool new_queue = false; |
13c931bd | 5626 | bool bfqq_already_existing = false, split = false; |
aee69d78 | 5627 | |
18e5a57d PV |
5628 | if (unlikely(!rq->elv.icq)) |
5629 | return NULL; | |
5630 | ||
72961c4e | 5631 | /* |
18e5a57d PV |
5632 | * Assuming that elv.priv[1] is set only if everything is set |
5633 | * for this rq. This holds true, because this function is | |
5634 | * invoked only for insertion or merging, and, after such | |
5635 | * events, a request cannot be manipulated any longer before | |
5636 | * being removed from bfq. | |
72961c4e | 5637 | */ |
18e5a57d PV |
5638 | if (rq->elv.priv[1]) |
5639 | return rq->elv.priv[1]; | |
72961c4e | 5640 | |
9f210738 | 5641 | bic = icq_to_bic(rq->elv.icq); |
aee69d78 | 5642 | |
8c9ff1ad CIK |
5643 | bfq_check_ioprio_change(bic, bio); |
5644 | ||
e21b7a0b AA |
5645 | bfq_bic_update_cgroup(bic, bio); |
5646 | ||
36eca894 AA |
5647 | bfqq = bfq_get_bfqq_handle_split(bfqd, bic, bio, false, is_sync, |
5648 | &new_queue); | |
5649 | ||
5650 | if (likely(!new_queue)) { | |
5651 | /* If the queue was seeky for too long, break it apart. */ | |
5652 | if (bfq_bfqq_coop(bfqq) && bfq_bfqq_split_coop(bfqq)) { | |
5653 | bfq_log_bfqq(bfqd, bfqq, "breaking apart bfqq"); | |
e1b2324d AA |
5654 | |
5655 | /* Update bic before losing reference to bfqq */ | |
5656 | if (bfq_bfqq_in_large_burst(bfqq)) | |
5657 | bic->saved_in_large_burst = true; | |
5658 | ||
36eca894 | 5659 | bfqq = bfq_split_bfqq(bic, bfqq); |
6fa3e8d3 | 5660 | split = true; |
36eca894 AA |
5661 | |
5662 | if (!bfqq) | |
5663 | bfqq = bfq_get_bfqq_handle_split(bfqd, bic, bio, | |
5664 | true, is_sync, | |
5665 | NULL); | |
13c931bd PV |
5666 | else |
5667 | bfqq_already_existing = true; | |
36eca894 | 5668 | } |
aee69d78 PV |
5669 | } |
5670 | ||
5671 | bfqq->allocated++; | |
5672 | bfqq->ref++; | |
5673 | bfq_log_bfqq(bfqd, bfqq, "get_request %p: bfqq %p, %d", | |
5674 | rq, bfqq, bfqq->ref); | |
5675 | ||
5676 | rq->elv.priv[0] = bic; | |
5677 | rq->elv.priv[1] = bfqq; | |
5678 | ||
36eca894 AA |
5679 | /* |
5680 | * If a bfq_queue has only one process reference, it is owned | |
5681 | * by only this bic: we can then set bfqq->bic = bic. in | |
5682 | * addition, if the queue has also just been split, we have to | |
5683 | * resume its state. | |
5684 | */ | |
5685 | if (likely(bfqq != &bfqd->oom_bfqq) && bfqq_process_refs(bfqq) == 1) { | |
5686 | bfqq->bic = bic; | |
6fa3e8d3 | 5687 | if (split) { |
36eca894 AA |
5688 | /* |
5689 | * The queue has just been split from a shared | |
5690 | * queue: restore the idle window and the | |
5691 | * possible weight raising period. | |
5692 | */ | |
13c931bd PV |
5693 | bfq_bfqq_resume_state(bfqq, bfqd, bic, |
5694 | bfqq_already_existing); | |
36eca894 AA |
5695 | } |
5696 | } | |
5697 | ||
e1b2324d AA |
5698 | if (unlikely(bfq_bfqq_just_created(bfqq))) |
5699 | bfq_handle_burst(bfqd, bfqq); | |
5700 | ||
18e5a57d | 5701 | return bfqq; |
aee69d78 PV |
5702 | } |
5703 | ||
5704 | static void bfq_idle_slice_timer_body(struct bfq_queue *bfqq) | |
5705 | { | |
5706 | struct bfq_data *bfqd = bfqq->bfqd; | |
5707 | enum bfqq_expiration reason; | |
5708 | unsigned long flags; | |
5709 | ||
5710 | spin_lock_irqsave(&bfqd->lock, flags); | |
5711 | bfq_clear_bfqq_wait_request(bfqq); | |
5712 | ||
5713 | if (bfqq != bfqd->in_service_queue) { | |
5714 | spin_unlock_irqrestore(&bfqd->lock, flags); | |
5715 | return; | |
5716 | } | |
5717 | ||
5718 | if (bfq_bfqq_budget_timeout(bfqq)) | |
5719 | /* | |
5720 | * Also here the queue can be safely expired | |
5721 | * for budget timeout without wasting | |
5722 | * guarantees | |
5723 | */ | |
5724 | reason = BFQQE_BUDGET_TIMEOUT; | |
5725 | else if (bfqq->queued[0] == 0 && bfqq->queued[1] == 0) | |
5726 | /* | |
5727 | * The queue may not be empty upon timer expiration, | |
5728 | * because we may not disable the timer when the | |
5729 | * first request of the in-service queue arrives | |
5730 | * during disk idling. | |
5731 | */ | |
5732 | reason = BFQQE_TOO_IDLE; | |
5733 | else | |
5734 | goto schedule_dispatch; | |
5735 | ||
5736 | bfq_bfqq_expire(bfqd, bfqq, true, reason); | |
5737 | ||
5738 | schedule_dispatch: | |
6fa3e8d3 | 5739 | spin_unlock_irqrestore(&bfqd->lock, flags); |
aee69d78 PV |
5740 | bfq_schedule_dispatch(bfqd); |
5741 | } | |
5742 | ||
5743 | /* | |
5744 | * Handler of the expiration of the timer running if the in-service queue | |
5745 | * is idling inside its time slice. | |
5746 | */ | |
5747 | static enum hrtimer_restart bfq_idle_slice_timer(struct hrtimer *timer) | |
5748 | { | |
5749 | struct bfq_data *bfqd = container_of(timer, struct bfq_data, | |
5750 | idle_slice_timer); | |
5751 | struct bfq_queue *bfqq = bfqd->in_service_queue; | |
5752 | ||
5753 | /* | |
5754 | * Theoretical race here: the in-service queue can be NULL or | |
5755 | * different from the queue that was idling if a new request | |
5756 | * arrives for the current queue and there is a full dispatch | |
5757 | * cycle that changes the in-service queue. This can hardly | |
5758 | * happen, but in the worst case we just expire a queue too | |
5759 | * early. | |
5760 | */ | |
5761 | if (bfqq) | |
5762 | bfq_idle_slice_timer_body(bfqq); | |
5763 | ||
5764 | return HRTIMER_NORESTART; | |
5765 | } | |
5766 | ||
5767 | static void __bfq_put_async_bfqq(struct bfq_data *bfqd, | |
5768 | struct bfq_queue **bfqq_ptr) | |
5769 | { | |
5770 | struct bfq_queue *bfqq = *bfqq_ptr; | |
5771 | ||
5772 | bfq_log(bfqd, "put_async_bfqq: %p", bfqq); | |
5773 | if (bfqq) { | |
e21b7a0b AA |
5774 | bfq_bfqq_move(bfqd, bfqq, bfqd->root_group); |
5775 | ||
aee69d78 PV |
5776 | bfq_log_bfqq(bfqd, bfqq, "put_async_bfqq: putting %p, %d", |
5777 | bfqq, bfqq->ref); | |
5778 | bfq_put_queue(bfqq); | |
5779 | *bfqq_ptr = NULL; | |
5780 | } | |
5781 | } | |
5782 | ||
5783 | /* | |
e21b7a0b AA |
5784 | * Release all the bfqg references to its async queues. If we are |
5785 | * deallocating the group these queues may still contain requests, so | |
5786 | * we reparent them to the root cgroup (i.e., the only one that will | |
5787 | * exist for sure until all the requests on a device are gone). | |
aee69d78 | 5788 | */ |
ea25da48 | 5789 | void bfq_put_async_queues(struct bfq_data *bfqd, struct bfq_group *bfqg) |
aee69d78 PV |
5790 | { |
5791 | int i, j; | |
5792 | ||
5793 | for (i = 0; i < 2; i++) | |
5794 | for (j = 0; j < IOPRIO_BE_NR; j++) | |
e21b7a0b | 5795 | __bfq_put_async_bfqq(bfqd, &bfqg->async_bfqq[i][j]); |
aee69d78 | 5796 | |
e21b7a0b | 5797 | __bfq_put_async_bfqq(bfqd, &bfqg->async_idle_bfqq); |
aee69d78 PV |
5798 | } |
5799 | ||
f0635b8a JA |
5800 | /* |
5801 | * See the comments on bfq_limit_depth for the purpose of | |
483b7bf2 | 5802 | * the depths set in the function. Return minimum shallow depth we'll use. |
f0635b8a | 5803 | */ |
483b7bf2 JA |
5804 | static unsigned int bfq_update_depths(struct bfq_data *bfqd, |
5805 | struct sbitmap_queue *bt) | |
f0635b8a | 5806 | { |
483b7bf2 JA |
5807 | unsigned int i, j, min_shallow = UINT_MAX; |
5808 | ||
f0635b8a JA |
5809 | /* |
5810 | * In-word depths if no bfq_queue is being weight-raised: | |
5811 | * leaving 25% of tags only for sync reads. | |
5812 | * | |
5813 | * In next formulas, right-shift the value | |
bd7d4ef6 JA |
5814 | * (1U<<bt->sb.shift), instead of computing directly |
5815 | * (1U<<(bt->sb.shift - something)), to be robust against | |
5816 | * any possible value of bt->sb.shift, without having to | |
f0635b8a JA |
5817 | * limit 'something'. |
5818 | */ | |
5819 | /* no more than 50% of tags for async I/O */ | |
bd7d4ef6 | 5820 | bfqd->word_depths[0][0] = max((1U << bt->sb.shift) >> 1, 1U); |
f0635b8a JA |
5821 | /* |
5822 | * no more than 75% of tags for sync writes (25% extra tags | |
5823 | * w.r.t. async I/O, to prevent async I/O from starving sync | |
5824 | * writes) | |
5825 | */ | |
bd7d4ef6 | 5826 | bfqd->word_depths[0][1] = max(((1U << bt->sb.shift) * 3) >> 2, 1U); |
f0635b8a JA |
5827 | |
5828 | /* | |
5829 | * In-word depths in case some bfq_queue is being weight- | |
5830 | * raised: leaving ~63% of tags for sync reads. This is the | |
5831 | * highest percentage for which, in our tests, application | |
5832 | * start-up times didn't suffer from any regression due to tag | |
5833 | * shortage. | |
5834 | */ | |
5835 | /* no more than ~18% of tags for async I/O */ | |
bd7d4ef6 | 5836 | bfqd->word_depths[1][0] = max(((1U << bt->sb.shift) * 3) >> 4, 1U); |
f0635b8a | 5837 | /* no more than ~37% of tags for sync writes (~20% extra tags) */ |
bd7d4ef6 | 5838 | bfqd->word_depths[1][1] = max(((1U << bt->sb.shift) * 6) >> 4, 1U); |
483b7bf2 JA |
5839 | |
5840 | for (i = 0; i < 2; i++) | |
5841 | for (j = 0; j < 2; j++) | |
5842 | min_shallow = min(min_shallow, bfqd->word_depths[i][j]); | |
5843 | ||
5844 | return min_shallow; | |
f0635b8a JA |
5845 | } |
5846 | ||
5847 | static int bfq_init_hctx(struct blk_mq_hw_ctx *hctx, unsigned int index) | |
5848 | { | |
5849 | struct bfq_data *bfqd = hctx->queue->elevator->elevator_data; | |
5850 | struct blk_mq_tags *tags = hctx->sched_tags; | |
483b7bf2 | 5851 | unsigned int min_shallow; |
f0635b8a | 5852 | |
483b7bf2 JA |
5853 | min_shallow = bfq_update_depths(bfqd, &tags->bitmap_tags); |
5854 | sbitmap_queue_min_shallow_depth(&tags->bitmap_tags, min_shallow); | |
f0635b8a JA |
5855 | return 0; |
5856 | } | |
5857 | ||
aee69d78 PV |
5858 | static void bfq_exit_queue(struct elevator_queue *e) |
5859 | { | |
5860 | struct bfq_data *bfqd = e->elevator_data; | |
5861 | struct bfq_queue *bfqq, *n; | |
5862 | ||
5863 | hrtimer_cancel(&bfqd->idle_slice_timer); | |
5864 | ||
5865 | spin_lock_irq(&bfqd->lock); | |
5866 | list_for_each_entry_safe(bfqq, n, &bfqd->idle_list, bfqq_list) | |
e21b7a0b | 5867 | bfq_deactivate_bfqq(bfqd, bfqq, false, false); |
aee69d78 PV |
5868 | spin_unlock_irq(&bfqd->lock); |
5869 | ||
5870 | hrtimer_cancel(&bfqd->idle_slice_timer); | |
5871 | ||
8abef10b | 5872 | #ifdef CONFIG_BFQ_GROUP_IOSCHED |
0d52af59 PV |
5873 | /* release oom-queue reference to root group */ |
5874 | bfqg_and_blkg_put(bfqd->root_group); | |
5875 | ||
e21b7a0b AA |
5876 | blkcg_deactivate_policy(bfqd->queue, &blkcg_policy_bfq); |
5877 | #else | |
5878 | spin_lock_irq(&bfqd->lock); | |
5879 | bfq_put_async_queues(bfqd, bfqd->root_group); | |
5880 | kfree(bfqd->root_group); | |
5881 | spin_unlock_irq(&bfqd->lock); | |
5882 | #endif | |
5883 | ||
aee69d78 PV |
5884 | kfree(bfqd); |
5885 | } | |
5886 | ||
e21b7a0b AA |
5887 | static void bfq_init_root_group(struct bfq_group *root_group, |
5888 | struct bfq_data *bfqd) | |
5889 | { | |
5890 | int i; | |
5891 | ||
5892 | #ifdef CONFIG_BFQ_GROUP_IOSCHED | |
5893 | root_group->entity.parent = NULL; | |
5894 | root_group->my_entity = NULL; | |
5895 | root_group->bfqd = bfqd; | |
5896 | #endif | |
36eca894 | 5897 | root_group->rq_pos_tree = RB_ROOT; |
e21b7a0b AA |
5898 | for (i = 0; i < BFQ_IOPRIO_CLASSES; i++) |
5899 | root_group->sched_data.service_tree[i] = BFQ_SERVICE_TREE_INIT; | |
5900 | root_group->sched_data.bfq_class_idle_last_service = jiffies; | |
5901 | } | |
5902 | ||
aee69d78 PV |
5903 | static int bfq_init_queue(struct request_queue *q, struct elevator_type *e) |
5904 | { | |
5905 | struct bfq_data *bfqd; | |
5906 | struct elevator_queue *eq; | |
aee69d78 PV |
5907 | |
5908 | eq = elevator_alloc(q, e); | |
5909 | if (!eq) | |
5910 | return -ENOMEM; | |
5911 | ||
5912 | bfqd = kzalloc_node(sizeof(*bfqd), GFP_KERNEL, q->node); | |
5913 | if (!bfqd) { | |
5914 | kobject_put(&eq->kobj); | |
5915 | return -ENOMEM; | |
5916 | } | |
5917 | eq->elevator_data = bfqd; | |
5918 | ||
0d945c1f | 5919 | spin_lock_irq(&q->queue_lock); |
e21b7a0b | 5920 | q->elevator = eq; |
0d945c1f | 5921 | spin_unlock_irq(&q->queue_lock); |
e21b7a0b | 5922 | |
aee69d78 PV |
5923 | /* |
5924 | * Our fallback bfqq if bfq_find_alloc_queue() runs into OOM issues. | |
5925 | * Grab a permanent reference to it, so that the normal code flow | |
5926 | * will not attempt to free it. | |
5927 | */ | |
5928 | bfq_init_bfqq(bfqd, &bfqd->oom_bfqq, NULL, 1, 0); | |
5929 | bfqd->oom_bfqq.ref++; | |
5930 | bfqd->oom_bfqq.new_ioprio = BFQ_DEFAULT_QUEUE_IOPRIO; | |
5931 | bfqd->oom_bfqq.new_ioprio_class = IOPRIO_CLASS_BE; | |
5932 | bfqd->oom_bfqq.entity.new_weight = | |
5933 | bfq_ioprio_to_weight(bfqd->oom_bfqq.new_ioprio); | |
e1b2324d AA |
5934 | |
5935 | /* oom_bfqq does not participate to bursts */ | |
5936 | bfq_clear_bfqq_just_created(&bfqd->oom_bfqq); | |
5937 | ||
aee69d78 PV |
5938 | /* |
5939 | * Trigger weight initialization, according to ioprio, at the | |
5940 | * oom_bfqq's first activation. The oom_bfqq's ioprio and ioprio | |
5941 | * class won't be changed any more. | |
5942 | */ | |
5943 | bfqd->oom_bfqq.entity.prio_changed = 1; | |
5944 | ||
5945 | bfqd->queue = q; | |
5946 | ||
e21b7a0b | 5947 | INIT_LIST_HEAD(&bfqd->dispatch); |
aee69d78 PV |
5948 | |
5949 | hrtimer_init(&bfqd->idle_slice_timer, CLOCK_MONOTONIC, | |
5950 | HRTIMER_MODE_REL); | |
5951 | bfqd->idle_slice_timer.function = bfq_idle_slice_timer; | |
5952 | ||
fb53ac6c | 5953 | bfqd->queue_weights_tree = RB_ROOT_CACHED; |
ba7aeae5 | 5954 | bfqd->num_groups_with_pending_reqs = 0; |
1de0c4cd | 5955 | |
aee69d78 PV |
5956 | INIT_LIST_HEAD(&bfqd->active_list); |
5957 | INIT_LIST_HEAD(&bfqd->idle_list); | |
e1b2324d | 5958 | INIT_HLIST_HEAD(&bfqd->burst_list); |
aee69d78 PV |
5959 | |
5960 | bfqd->hw_tag = -1; | |
8cacc5ab | 5961 | bfqd->nonrot_with_queueing = blk_queue_nonrot(bfqd->queue); |
aee69d78 PV |
5962 | |
5963 | bfqd->bfq_max_budget = bfq_default_max_budget; | |
5964 | ||
5965 | bfqd->bfq_fifo_expire[0] = bfq_fifo_expire[0]; | |
5966 | bfqd->bfq_fifo_expire[1] = bfq_fifo_expire[1]; | |
5967 | bfqd->bfq_back_max = bfq_back_max; | |
5968 | bfqd->bfq_back_penalty = bfq_back_penalty; | |
5969 | bfqd->bfq_slice_idle = bfq_slice_idle; | |
aee69d78 PV |
5970 | bfqd->bfq_timeout = bfq_timeout; |
5971 | ||
5972 | bfqd->bfq_requests_within_timer = 120; | |
5973 | ||
e1b2324d AA |
5974 | bfqd->bfq_large_burst_thresh = 8; |
5975 | bfqd->bfq_burst_interval = msecs_to_jiffies(180); | |
5976 | ||
44e44a1b PV |
5977 | bfqd->low_latency = true; |
5978 | ||
5979 | /* | |
5980 | * Trade-off between responsiveness and fairness. | |
5981 | */ | |
5982 | bfqd->bfq_wr_coeff = 30; | |
77b7dcea | 5983 | bfqd->bfq_wr_rt_max_time = msecs_to_jiffies(300); |
44e44a1b PV |
5984 | bfqd->bfq_wr_max_time = 0; |
5985 | bfqd->bfq_wr_min_idle_time = msecs_to_jiffies(2000); | |
5986 | bfqd->bfq_wr_min_inter_arr_async = msecs_to_jiffies(500); | |
77b7dcea PV |
5987 | bfqd->bfq_wr_max_softrt_rate = 7000; /* |
5988 | * Approximate rate required | |
5989 | * to playback or record a | |
5990 | * high-definition compressed | |
5991 | * video. | |
5992 | */ | |
cfd69712 | 5993 | bfqd->wr_busy_queues = 0; |
44e44a1b PV |
5994 | |
5995 | /* | |
e24f1c24 PV |
5996 | * Begin by assuming, optimistically, that the device peak |
5997 | * rate is equal to 2/3 of the highest reference rate. | |
44e44a1b | 5998 | */ |
e24f1c24 PV |
5999 | bfqd->rate_dur_prod = ref_rate[blk_queue_nonrot(bfqd->queue)] * |
6000 | ref_wr_duration[blk_queue_nonrot(bfqd->queue)]; | |
6001 | bfqd->peak_rate = ref_rate[blk_queue_nonrot(bfqd->queue)] * 2 / 3; | |
44e44a1b | 6002 | |
aee69d78 | 6003 | spin_lock_init(&bfqd->lock); |
aee69d78 | 6004 | |
e21b7a0b AA |
6005 | /* |
6006 | * The invocation of the next bfq_create_group_hierarchy | |
6007 | * function is the head of a chain of function calls | |
6008 | * (bfq_create_group_hierarchy->blkcg_activate_policy-> | |
6009 | * blk_mq_freeze_queue) that may lead to the invocation of the | |
6010 | * has_work hook function. For this reason, | |
6011 | * bfq_create_group_hierarchy is invoked only after all | |
6012 | * scheduler data has been initialized, apart from the fields | |
6013 | * that can be initialized only after invoking | |
6014 | * bfq_create_group_hierarchy. This, in particular, enables | |
6015 | * has_work to correctly return false. Of course, to avoid | |
6016 | * other inconsistencies, the blk-mq stack must then refrain | |
6017 | * from invoking further scheduler hooks before this init | |
6018 | * function is finished. | |
6019 | */ | |
6020 | bfqd->root_group = bfq_create_group_hierarchy(bfqd, q->node); | |
6021 | if (!bfqd->root_group) | |
6022 | goto out_free; | |
6023 | bfq_init_root_group(bfqd->root_group, bfqd); | |
6024 | bfq_init_entity(&bfqd->oom_bfqq.entity, bfqd->root_group); | |
6025 | ||
b5dc5d4d | 6026 | wbt_disable_default(q); |
aee69d78 | 6027 | return 0; |
e21b7a0b AA |
6028 | |
6029 | out_free: | |
6030 | kfree(bfqd); | |
6031 | kobject_put(&eq->kobj); | |
6032 | return -ENOMEM; | |
aee69d78 PV |
6033 | } |
6034 | ||
6035 | static void bfq_slab_kill(void) | |
6036 | { | |
6037 | kmem_cache_destroy(bfq_pool); | |
6038 | } | |
6039 | ||
6040 | static int __init bfq_slab_setup(void) | |
6041 | { | |
6042 | bfq_pool = KMEM_CACHE(bfq_queue, 0); | |
6043 | if (!bfq_pool) | |
6044 | return -ENOMEM; | |
6045 | return 0; | |
6046 | } | |
6047 | ||
6048 | static ssize_t bfq_var_show(unsigned int var, char *page) | |
6049 | { | |
6050 | return sprintf(page, "%u\n", var); | |
6051 | } | |
6052 | ||
2f79136b | 6053 | static int bfq_var_store(unsigned long *var, const char *page) |
aee69d78 PV |
6054 | { |
6055 | unsigned long new_val; | |
6056 | int ret = kstrtoul(page, 10, &new_val); | |
6057 | ||
2f79136b BVA |
6058 | if (ret) |
6059 | return ret; | |
6060 | *var = new_val; | |
6061 | return 0; | |
aee69d78 PV |
6062 | } |
6063 | ||
6064 | #define SHOW_FUNCTION(__FUNC, __VAR, __CONV) \ | |
6065 | static ssize_t __FUNC(struct elevator_queue *e, char *page) \ | |
6066 | { \ | |
6067 | struct bfq_data *bfqd = e->elevator_data; \ | |
6068 | u64 __data = __VAR; \ | |
6069 | if (__CONV == 1) \ | |
6070 | __data = jiffies_to_msecs(__data); \ | |
6071 | else if (__CONV == 2) \ | |
6072 | __data = div_u64(__data, NSEC_PER_MSEC); \ | |
6073 | return bfq_var_show(__data, (page)); \ | |
6074 | } | |
6075 | SHOW_FUNCTION(bfq_fifo_expire_sync_show, bfqd->bfq_fifo_expire[1], 2); | |
6076 | SHOW_FUNCTION(bfq_fifo_expire_async_show, bfqd->bfq_fifo_expire[0], 2); | |
6077 | SHOW_FUNCTION(bfq_back_seek_max_show, bfqd->bfq_back_max, 0); | |
6078 | SHOW_FUNCTION(bfq_back_seek_penalty_show, bfqd->bfq_back_penalty, 0); | |
6079 | SHOW_FUNCTION(bfq_slice_idle_show, bfqd->bfq_slice_idle, 2); | |
6080 | SHOW_FUNCTION(bfq_max_budget_show, bfqd->bfq_user_max_budget, 0); | |
6081 | SHOW_FUNCTION(bfq_timeout_sync_show, bfqd->bfq_timeout, 1); | |
6082 | SHOW_FUNCTION(bfq_strict_guarantees_show, bfqd->strict_guarantees, 0); | |
44e44a1b | 6083 | SHOW_FUNCTION(bfq_low_latency_show, bfqd->low_latency, 0); |
aee69d78 PV |
6084 | #undef SHOW_FUNCTION |
6085 | ||
6086 | #define USEC_SHOW_FUNCTION(__FUNC, __VAR) \ | |
6087 | static ssize_t __FUNC(struct elevator_queue *e, char *page) \ | |
6088 | { \ | |
6089 | struct bfq_data *bfqd = e->elevator_data; \ | |
6090 | u64 __data = __VAR; \ | |
6091 | __data = div_u64(__data, NSEC_PER_USEC); \ | |
6092 | return bfq_var_show(__data, (page)); \ | |
6093 | } | |
6094 | USEC_SHOW_FUNCTION(bfq_slice_idle_us_show, bfqd->bfq_slice_idle); | |
6095 | #undef USEC_SHOW_FUNCTION | |
6096 | ||
6097 | #define STORE_FUNCTION(__FUNC, __PTR, MIN, MAX, __CONV) \ | |
6098 | static ssize_t \ | |
6099 | __FUNC(struct elevator_queue *e, const char *page, size_t count) \ | |
6100 | { \ | |
6101 | struct bfq_data *bfqd = e->elevator_data; \ | |
1530486c | 6102 | unsigned long __data, __min = (MIN), __max = (MAX); \ |
2f79136b BVA |
6103 | int ret; \ |
6104 | \ | |
6105 | ret = bfq_var_store(&__data, (page)); \ | |
6106 | if (ret) \ | |
6107 | return ret; \ | |
1530486c BVA |
6108 | if (__data < __min) \ |
6109 | __data = __min; \ | |
6110 | else if (__data > __max) \ | |
6111 | __data = __max; \ | |
aee69d78 PV |
6112 | if (__CONV == 1) \ |
6113 | *(__PTR) = msecs_to_jiffies(__data); \ | |
6114 | else if (__CONV == 2) \ | |
6115 | *(__PTR) = (u64)__data * NSEC_PER_MSEC; \ | |
6116 | else \ | |
6117 | *(__PTR) = __data; \ | |
235f8da1 | 6118 | return count; \ |
aee69d78 PV |
6119 | } |
6120 | STORE_FUNCTION(bfq_fifo_expire_sync_store, &bfqd->bfq_fifo_expire[1], 1, | |
6121 | INT_MAX, 2); | |
6122 | STORE_FUNCTION(bfq_fifo_expire_async_store, &bfqd->bfq_fifo_expire[0], 1, | |
6123 | INT_MAX, 2); | |
6124 | STORE_FUNCTION(bfq_back_seek_max_store, &bfqd->bfq_back_max, 0, INT_MAX, 0); | |
6125 | STORE_FUNCTION(bfq_back_seek_penalty_store, &bfqd->bfq_back_penalty, 1, | |
6126 | INT_MAX, 0); | |
6127 | STORE_FUNCTION(bfq_slice_idle_store, &bfqd->bfq_slice_idle, 0, INT_MAX, 2); | |
6128 | #undef STORE_FUNCTION | |
6129 | ||
6130 | #define USEC_STORE_FUNCTION(__FUNC, __PTR, MIN, MAX) \ | |
6131 | static ssize_t __FUNC(struct elevator_queue *e, const char *page, size_t count)\ | |
6132 | { \ | |
6133 | struct bfq_data *bfqd = e->elevator_data; \ | |
1530486c | 6134 | unsigned long __data, __min = (MIN), __max = (MAX); \ |
2f79136b BVA |
6135 | int ret; \ |
6136 | \ | |
6137 | ret = bfq_var_store(&__data, (page)); \ | |
6138 | if (ret) \ | |
6139 | return ret; \ | |
1530486c BVA |
6140 | if (__data < __min) \ |
6141 | __data = __min; \ | |
6142 | else if (__data > __max) \ | |
6143 | __data = __max; \ | |
aee69d78 | 6144 | *(__PTR) = (u64)__data * NSEC_PER_USEC; \ |
235f8da1 | 6145 | return count; \ |
aee69d78 PV |
6146 | } |
6147 | USEC_STORE_FUNCTION(bfq_slice_idle_us_store, &bfqd->bfq_slice_idle, 0, | |
6148 | UINT_MAX); | |
6149 | #undef USEC_STORE_FUNCTION | |
6150 | ||
aee69d78 PV |
6151 | static ssize_t bfq_max_budget_store(struct elevator_queue *e, |
6152 | const char *page, size_t count) | |
6153 | { | |
6154 | struct bfq_data *bfqd = e->elevator_data; | |
2f79136b BVA |
6155 | unsigned long __data; |
6156 | int ret; | |
235f8da1 | 6157 | |
2f79136b BVA |
6158 | ret = bfq_var_store(&__data, (page)); |
6159 | if (ret) | |
6160 | return ret; | |
aee69d78 PV |
6161 | |
6162 | if (__data == 0) | |
ab0e43e9 | 6163 | bfqd->bfq_max_budget = bfq_calc_max_budget(bfqd); |
aee69d78 PV |
6164 | else { |
6165 | if (__data > INT_MAX) | |
6166 | __data = INT_MAX; | |
6167 | bfqd->bfq_max_budget = __data; | |
6168 | } | |
6169 | ||
6170 | bfqd->bfq_user_max_budget = __data; | |
6171 | ||
235f8da1 | 6172 | return count; |
aee69d78 PV |
6173 | } |
6174 | ||
6175 | /* | |
6176 | * Leaving this name to preserve name compatibility with cfq | |
6177 | * parameters, but this timeout is used for both sync and async. | |
6178 | */ | |
6179 | static ssize_t bfq_timeout_sync_store(struct elevator_queue *e, | |
6180 | const char *page, size_t count) | |
6181 | { | |
6182 | struct bfq_data *bfqd = e->elevator_data; | |
2f79136b BVA |
6183 | unsigned long __data; |
6184 | int ret; | |
235f8da1 | 6185 | |
2f79136b BVA |
6186 | ret = bfq_var_store(&__data, (page)); |
6187 | if (ret) | |
6188 | return ret; | |
aee69d78 PV |
6189 | |
6190 | if (__data < 1) | |
6191 | __data = 1; | |
6192 | else if (__data > INT_MAX) | |
6193 | __data = INT_MAX; | |
6194 | ||
6195 | bfqd->bfq_timeout = msecs_to_jiffies(__data); | |
6196 | if (bfqd->bfq_user_max_budget == 0) | |
ab0e43e9 | 6197 | bfqd->bfq_max_budget = bfq_calc_max_budget(bfqd); |
aee69d78 | 6198 | |
235f8da1 | 6199 | return count; |
aee69d78 PV |
6200 | } |
6201 | ||
6202 | static ssize_t bfq_strict_guarantees_store(struct elevator_queue *e, | |
6203 | const char *page, size_t count) | |
6204 | { | |
6205 | struct bfq_data *bfqd = e->elevator_data; | |
2f79136b BVA |
6206 | unsigned long __data; |
6207 | int ret; | |
235f8da1 | 6208 | |
2f79136b BVA |
6209 | ret = bfq_var_store(&__data, (page)); |
6210 | if (ret) | |
6211 | return ret; | |
aee69d78 PV |
6212 | |
6213 | if (__data > 1) | |
6214 | __data = 1; | |
6215 | if (!bfqd->strict_guarantees && __data == 1 | |
6216 | && bfqd->bfq_slice_idle < 8 * NSEC_PER_MSEC) | |
6217 | bfqd->bfq_slice_idle = 8 * NSEC_PER_MSEC; | |
6218 | ||
6219 | bfqd->strict_guarantees = __data; | |
6220 | ||
235f8da1 | 6221 | return count; |
aee69d78 PV |
6222 | } |
6223 | ||
44e44a1b PV |
6224 | static ssize_t bfq_low_latency_store(struct elevator_queue *e, |
6225 | const char *page, size_t count) | |
6226 | { | |
6227 | struct bfq_data *bfqd = e->elevator_data; | |
2f79136b BVA |
6228 | unsigned long __data; |
6229 | int ret; | |
235f8da1 | 6230 | |
2f79136b BVA |
6231 | ret = bfq_var_store(&__data, (page)); |
6232 | if (ret) | |
6233 | return ret; | |
44e44a1b PV |
6234 | |
6235 | if (__data > 1) | |
6236 | __data = 1; | |
6237 | if (__data == 0 && bfqd->low_latency != 0) | |
6238 | bfq_end_wr(bfqd); | |
6239 | bfqd->low_latency = __data; | |
6240 | ||
235f8da1 | 6241 | return count; |
44e44a1b PV |
6242 | } |
6243 | ||
aee69d78 PV |
6244 | #define BFQ_ATTR(name) \ |
6245 | __ATTR(name, 0644, bfq_##name##_show, bfq_##name##_store) | |
6246 | ||
6247 | static struct elv_fs_entry bfq_attrs[] = { | |
6248 | BFQ_ATTR(fifo_expire_sync), | |
6249 | BFQ_ATTR(fifo_expire_async), | |
6250 | BFQ_ATTR(back_seek_max), | |
6251 | BFQ_ATTR(back_seek_penalty), | |
6252 | BFQ_ATTR(slice_idle), | |
6253 | BFQ_ATTR(slice_idle_us), | |
6254 | BFQ_ATTR(max_budget), | |
6255 | BFQ_ATTR(timeout_sync), | |
6256 | BFQ_ATTR(strict_guarantees), | |
44e44a1b | 6257 | BFQ_ATTR(low_latency), |
aee69d78 PV |
6258 | __ATTR_NULL |
6259 | }; | |
6260 | ||
6261 | static struct elevator_type iosched_bfq_mq = { | |
f9cd4bfe | 6262 | .ops = { |
a52a69ea | 6263 | .limit_depth = bfq_limit_depth, |
5bbf4e5a | 6264 | .prepare_request = bfq_prepare_request, |
a7877390 PV |
6265 | .requeue_request = bfq_finish_requeue_request, |
6266 | .finish_request = bfq_finish_requeue_request, | |
aee69d78 PV |
6267 | .exit_icq = bfq_exit_icq, |
6268 | .insert_requests = bfq_insert_requests, | |
6269 | .dispatch_request = bfq_dispatch_request, | |
6270 | .next_request = elv_rb_latter_request, | |
6271 | .former_request = elv_rb_former_request, | |
6272 | .allow_merge = bfq_allow_bio_merge, | |
6273 | .bio_merge = bfq_bio_merge, | |
6274 | .request_merge = bfq_request_merge, | |
6275 | .requests_merged = bfq_requests_merged, | |
6276 | .request_merged = bfq_request_merged, | |
6277 | .has_work = bfq_has_work, | |
f0635b8a | 6278 | .init_hctx = bfq_init_hctx, |
aee69d78 PV |
6279 | .init_sched = bfq_init_queue, |
6280 | .exit_sched = bfq_exit_queue, | |
6281 | }, | |
6282 | ||
aee69d78 PV |
6283 | .icq_size = sizeof(struct bfq_io_cq), |
6284 | .icq_align = __alignof__(struct bfq_io_cq), | |
6285 | .elevator_attrs = bfq_attrs, | |
6286 | .elevator_name = "bfq", | |
6287 | .elevator_owner = THIS_MODULE, | |
6288 | }; | |
26b4cf24 | 6289 | MODULE_ALIAS("bfq-iosched"); |
aee69d78 PV |
6290 | |
6291 | static int __init bfq_init(void) | |
6292 | { | |
6293 | int ret; | |
6294 | ||
e21b7a0b AA |
6295 | #ifdef CONFIG_BFQ_GROUP_IOSCHED |
6296 | ret = blkcg_policy_register(&blkcg_policy_bfq); | |
6297 | if (ret) | |
6298 | return ret; | |
6299 | #endif | |
6300 | ||
aee69d78 PV |
6301 | ret = -ENOMEM; |
6302 | if (bfq_slab_setup()) | |
6303 | goto err_pol_unreg; | |
6304 | ||
44e44a1b PV |
6305 | /* |
6306 | * Times to load large popular applications for the typical | |
6307 | * systems installed on the reference devices (see the | |
e24f1c24 PV |
6308 | * comments before the definition of the next |
6309 | * array). Actually, we use slightly lower values, as the | |
44e44a1b PV |
6310 | * estimated peak rate tends to be smaller than the actual |
6311 | * peak rate. The reason for this last fact is that estimates | |
6312 | * are computed over much shorter time intervals than the long | |
6313 | * intervals typically used for benchmarking. Why? First, to | |
6314 | * adapt more quickly to variations. Second, because an I/O | |
6315 | * scheduler cannot rely on a peak-rate-evaluation workload to | |
6316 | * be run for a long time. | |
6317 | */ | |
e24f1c24 PV |
6318 | ref_wr_duration[0] = msecs_to_jiffies(7000); /* actually 8 sec */ |
6319 | ref_wr_duration[1] = msecs_to_jiffies(2500); /* actually 3 sec */ | |
44e44a1b | 6320 | |
aee69d78 PV |
6321 | ret = elv_register(&iosched_bfq_mq); |
6322 | if (ret) | |
37dcd657 | 6323 | goto slab_kill; |
aee69d78 PV |
6324 | |
6325 | return 0; | |
6326 | ||
37dcd657 | 6327 | slab_kill: |
6328 | bfq_slab_kill(); | |
aee69d78 | 6329 | err_pol_unreg: |
e21b7a0b AA |
6330 | #ifdef CONFIG_BFQ_GROUP_IOSCHED |
6331 | blkcg_policy_unregister(&blkcg_policy_bfq); | |
6332 | #endif | |
aee69d78 PV |
6333 | return ret; |
6334 | } | |
6335 | ||
6336 | static void __exit bfq_exit(void) | |
6337 | { | |
6338 | elv_unregister(&iosched_bfq_mq); | |
e21b7a0b AA |
6339 | #ifdef CONFIG_BFQ_GROUP_IOSCHED |
6340 | blkcg_policy_unregister(&blkcg_policy_bfq); | |
6341 | #endif | |
aee69d78 PV |
6342 | bfq_slab_kill(); |
6343 | } | |
6344 | ||
6345 | module_init(bfq_init); | |
6346 | module_exit(bfq_exit); | |
6347 | ||
6348 | MODULE_AUTHOR("Paolo Valente"); | |
6349 | MODULE_LICENSE("GPL"); | |
6350 | MODULE_DESCRIPTION("MQ Budget Fair Queueing I/O Scheduler"); |