1 // SPDX-License-Identifier: GPL-2.0-or-later
3 * Budget Fair Queueing (BFQ) I/O scheduler.
5 * Based on ideas and code from CFQ:
6 * Copyright (C) 2003 Jens Axboe <axboe@kernel.dk>
8 * Copyright (C) 2008 Fabio Checconi <fabio@gandalf.sssup.it>
9 * Paolo Valente <paolo.valente@unimore.it>
11 * Copyright (C) 2010 Paolo Valente <paolo.valente@unimore.it>
12 * Arianna Avanzini <avanzini@google.com>
14 * Copyright (C) 2017 Paolo Valente <paolo.valente@linaro.org>
16 * BFQ is a proportional-share I/O scheduler, with some extra
17 * low-latency capabilities. BFQ also supports full hierarchical
18 * scheduling through cgroups. Next paragraphs provide an introduction
19 * on BFQ inner workings. Details on BFQ benefits, usage and
20 * limitations can be found in Documentation/block/bfq-iosched.rst.
22 * BFQ is a proportional-share storage-I/O scheduling algorithm based
23 * on the slice-by-slice service scheme of CFQ. But BFQ assigns
24 * budgets, measured in number of sectors, to processes instead of
25 * time slices. The device is not granted to the in-service process
26 * for a given time slice, but until it has exhausted its assigned
27 * budget. This change from the time to the service domain enables BFQ
28 * to distribute the device throughput among processes as desired,
29 * without any distortion due to throughput fluctuations, or to device
30 * internal queueing. BFQ uses an ad hoc internal scheduler, called
31 * B-WF2Q+, to schedule processes according to their budgets. More
32 * precisely, BFQ schedules queues associated with processes. Each
33 * process/queue is assigned a user-configurable weight, and B-WF2Q+
34 * guarantees that each queue receives a fraction of the throughput
35 * proportional to its weight. Thanks to the accurate policy of
36 * B-WF2Q+, BFQ can afford to assign high budgets to I/O-bound
37 * processes issuing sequential requests (to boost the throughput),
38 * and yet guarantee a low latency to interactive and soft real-time
41 * In particular, to provide these low-latency guarantees, BFQ
42 * explicitly privileges the I/O of two classes of time-sensitive
43 * applications: interactive and soft real-time. In more detail, BFQ
44 * behaves this way if the low_latency parameter is set (default
45 * configuration). This feature enables BFQ to provide applications in
46 * these classes with a very low latency.
48 * To implement this feature, BFQ constantly tries to detect whether
49 * the I/O requests in a bfq_queue come from an interactive or a soft
50 * real-time application. For brevity, in these cases, the queue is
51 * said to be interactive or soft real-time. In both cases, BFQ
52 * privileges the service of the queue, over that of non-interactive
53 * and non-soft-real-time queues. This privileging is performed,
54 * mainly, by raising the weight of the queue. So, for brevity, we
55 * call just weight-raising periods the time periods during which a
56 * queue is privileged, because deemed interactive or soft real-time.
58 * The detection of soft real-time queues/applications is described in
59 * detail in the comments on the function
60 * bfq_bfqq_softrt_next_start. On the other hand, the detection of an
61 * interactive queue works as follows: a queue is deemed interactive
62 * if it is constantly non empty only for a limited time interval,
63 * after which it does become empty. The queue may be deemed
64 * interactive again (for a limited time), if it restarts being
65 * constantly non empty, provided that this happens only after the
66 * queue has remained empty for a given minimum idle time.
68 * By default, BFQ computes automatically the above maximum time
69 * interval, i.e., the time interval after which a constantly
70 * non-empty queue stops being deemed interactive. Since a queue is
71 * weight-raised while it is deemed interactive, this maximum time
72 * interval happens to coincide with the (maximum) duration of the
73 * weight-raising for interactive queues.
75 * Finally, BFQ also features additional heuristics for
76 * preserving both a low latency and a high throughput on NCQ-capable,
77 * rotational or flash-based devices, and to get the job done quickly
78 * for applications consisting in many I/O-bound processes.
80 * NOTE: if the main or only goal, with a given device, is to achieve
81 * the maximum-possible throughput at all times, then do switch off
82 * all low-latency heuristics for that device, by setting low_latency
85 * BFQ is described in [1], where also a reference to the initial,
86 * more theoretical paper on BFQ can be found. The interested reader
87 * can find in the latter paper full details on the main algorithm, as
88 * well as formulas of the guarantees and formal proofs of all the
89 * properties. With respect to the version of BFQ presented in these
90 * papers, this implementation adds a few more heuristics, such as the
91 * ones that guarantee a low latency to interactive and soft real-time
92 * applications, and a hierarchical extension based on H-WF2Q+.
94 * B-WF2Q+ is based on WF2Q+, which is described in [2], together with
95 * H-WF2Q+, while the augmented tree used here to implement B-WF2Q+
96 * with O(log N) complexity derives from the one introduced with EEVDF
99 * [1] P. Valente, A. Avanzini, "Evolution of the BFQ Storage I/O
100 * Scheduler", Proceedings of the First Workshop on Mobile System
101 * Technologies (MST-2015), May 2015.
102 * http://algogroup.unimore.it/people/paolo/disk_sched/mst-2015.pdf
104 * [2] Jon C.R. Bennett and H. Zhang, "Hierarchical Packet Fair Queueing
105 * Algorithms", IEEE/ACM Transactions on Networking, 5(5):675-689,
108 * http://www.cs.cmu.edu/~hzhang/papers/TON-97-Oct.ps.gz
110 * [3] I. Stoica and H. Abdel-Wahab, "Earliest Eligible Virtual Deadline
111 * First: A Flexible and Accurate Mechanism for Proportional Share
112 * Resource Allocation", technical report.
114 * http://www.cs.berkeley.edu/~istoica/papers/eevdf-tr-95.pdf
116 #include <linux/module.h>
117 #include <linux/slab.h>
118 #include <linux/blkdev.h>
119 #include <linux/cgroup.h>
120 #include <linux/ktime.h>
121 #include <linux/rbtree.h>
122 #include <linux/ioprio.h>
123 #include <linux/sbitmap.h>
124 #include <linux/delay.h>
125 #include <linux/backing-dev.h>
127 #include <trace/events/block.h>
129 #include "elevator.h"
132 #include "blk-mq-tag.h"
133 #include "blk-mq-sched.h"
134 #include "bfq-iosched.h"
137 #define BFQ_BFQQ_FNS(name) \
138 void bfq_mark_bfqq_##name(struct bfq_queue *bfqq) \
140 __set_bit(BFQQF_##name, &(bfqq)->flags); \
142 void bfq_clear_bfqq_##name(struct bfq_queue *bfqq) \
144 __clear_bit(BFQQF_##name, &(bfqq)->flags); \
146 int bfq_bfqq_##name(const struct bfq_queue *bfqq) \
148 return test_bit(BFQQF_##name, &(bfqq)->flags); \
151 BFQ_BFQQ_FNS(just_created);
153 BFQ_BFQQ_FNS(wait_request);
154 BFQ_BFQQ_FNS(non_blocking_wait_rq);
155 BFQ_BFQQ_FNS(fifo_expire);
156 BFQ_BFQQ_FNS(has_short_ttime);
158 BFQ_BFQQ_FNS(IO_bound);
159 BFQ_BFQQ_FNS(in_large_burst);
161 BFQ_BFQQ_FNS(split_coop);
162 BFQ_BFQQ_FNS(softrt_update);
163 #undef BFQ_BFQQ_FNS \
165 /* Expiration time of async (0) and sync (1) requests, in ns. */
166 static const u64 bfq_fifo_expire[2] = { NSEC_PER_SEC / 4, NSEC_PER_SEC / 8 };
168 /* Maximum backwards seek (magic number lifted from CFQ), in KiB. */
169 static const int bfq_back_max = 16 * 1024;
171 /* Penalty of a backwards seek, in number of sectors. */
172 static const int bfq_back_penalty = 2;
174 /* Idling period duration, in ns. */
175 static u64 bfq_slice_idle = NSEC_PER_SEC / 125;
177 /* Minimum number of assigned budgets for which stats are safe to compute. */
178 static const int bfq_stats_min_budgets = 194;
180 /* Default maximum budget values, in sectors and number of requests. */
181 static const int bfq_default_max_budget = 16 * 1024;
184 * When a sync request is dispatched, the queue that contains that
185 * request, and all the ancestor entities of that queue, are charged
186 * with the number of sectors of the request. In contrast, if the
187 * request is async, then the queue and its ancestor entities are
188 * charged with the number of sectors of the request, multiplied by
189 * the factor below. This throttles the bandwidth for async I/O,
190 * w.r.t. to sync I/O, and it is done to counter the tendency of async
191 * writes to steal I/O throughput to reads.
193 * The current value of this parameter is the result of a tuning with
194 * several hardware and software configurations. We tried to find the
195 * lowest value for which writes do not cause noticeable problems to
196 * reads. In fact, the lower this parameter, the stabler I/O control,
197 * in the following respect. The lower this parameter is, the less
198 * the bandwidth enjoyed by a group decreases
199 * - when the group does writes, w.r.t. to when it does reads;
200 * - when other groups do reads, w.r.t. to when they do writes.
202 static const int bfq_async_charge_factor = 3;
204 /* Default timeout values, in jiffies, approximating CFQ defaults. */
205 const int bfq_timeout = HZ / 8;
208 * Time limit for merging (see comments in bfq_setup_cooperator). Set
209 * to the slowest value that, in our tests, proved to be effective in
210 * removing false positives, while not causing true positives to miss
213 * As can be deduced from the low time limit below, queue merging, if
214 * successful, happens at the very beginning of the I/O of the involved
215 * cooperating processes, as a consequence of the arrival of the very
216 * first requests from each cooperator. After that, there is very
217 * little chance to find cooperators.
219 static const unsigned long bfq_merge_time_limit = HZ/10;
221 static struct kmem_cache *bfq_pool;
223 /* Below this threshold (in ns), we consider thinktime immediate. */
224 #define BFQ_MIN_TT (2 * NSEC_PER_MSEC)
226 /* hw_tag detection: parallel requests threshold and min samples needed. */
227 #define BFQ_HW_QUEUE_THRESHOLD 3
228 #define BFQ_HW_QUEUE_SAMPLES 32
230 #define BFQQ_SEEK_THR (sector_t)(8 * 100)
231 #define BFQQ_SECT_THR_NONROT (sector_t)(2 * 32)
232 #define BFQ_RQ_SEEKY(bfqd, last_pos, rq) \
233 (get_sdist(last_pos, rq) > \
235 (!blk_queue_nonrot(bfqd->queue) || \
236 blk_rq_sectors(rq) < BFQQ_SECT_THR_NONROT))
237 #define BFQQ_CLOSE_THR (sector_t)(8 * 1024)
238 #define BFQQ_SEEKY(bfqq) (hweight32(bfqq->seek_history) > 19)
240 * Sync random I/O is likely to be confused with soft real-time I/O,
241 * because it is characterized by limited throughput and apparently
242 * isochronous arrival pattern. To avoid false positives, queues
243 * containing only random (seeky) I/O are prevented from being tagged
246 #define BFQQ_TOTALLY_SEEKY(bfqq) (bfqq->seek_history == -1)
248 /* Min number of samples required to perform peak-rate update */
249 #define BFQ_RATE_MIN_SAMPLES 32
250 /* Min observation time interval required to perform a peak-rate update (ns) */
251 #define BFQ_RATE_MIN_INTERVAL (300*NSEC_PER_MSEC)
252 /* Target observation time interval for a peak-rate update (ns) */
253 #define BFQ_RATE_REF_INTERVAL NSEC_PER_SEC
256 * Shift used for peak-rate fixed precision calculations.
258 * - the current shift: 16 positions
259 * - the current type used to store rate: u32
260 * - the current unit of measure for rate: [sectors/usec], or, more precisely,
261 * [(sectors/usec) / 2^BFQ_RATE_SHIFT] to take into account the shift,
262 * the range of rates that can be stored is
263 * [1 / 2^BFQ_RATE_SHIFT, 2^(32 - BFQ_RATE_SHIFT)] sectors/usec =
264 * [1 / 2^16, 2^16] sectors/usec = [15e-6, 65536] sectors/usec =
265 * [15, 65G] sectors/sec
266 * Which, assuming a sector size of 512B, corresponds to a range of
269 #define BFQ_RATE_SHIFT 16
272 * When configured for computing the duration of the weight-raising
273 * for interactive queues automatically (see the comments at the
274 * beginning of this file), BFQ does it using the following formula:
275 * duration = (ref_rate / r) * ref_wr_duration,
276 * where r is the peak rate of the device, and ref_rate and
277 * ref_wr_duration are two reference parameters. In particular,
278 * ref_rate is the peak rate of the reference storage device (see
279 * below), and ref_wr_duration is about the maximum time needed, with
280 * BFQ and while reading two files in parallel, to load typical large
281 * applications on the reference device (see the comments on
282 * max_service_from_wr below, for more details on how ref_wr_duration
283 * is obtained). In practice, the slower/faster the device at hand
284 * is, the more/less it takes to load applications with respect to the
285 * reference device. Accordingly, the longer/shorter BFQ grants
286 * weight raising to interactive applications.
288 * BFQ uses two different reference pairs (ref_rate, ref_wr_duration),
289 * depending on whether the device is rotational or non-rotational.
291 * In the following definitions, ref_rate[0] and ref_wr_duration[0]
292 * are the reference values for a rotational device, whereas
293 * ref_rate[1] and ref_wr_duration[1] are the reference values for a
294 * non-rotational device. The reference rates are not the actual peak
295 * rates of the devices used as a reference, but slightly lower
296 * values. The reason for using slightly lower values is that the
297 * peak-rate estimator tends to yield slightly lower values than the
298 * actual peak rate (it can yield the actual peak rate only if there
299 * is only one process doing I/O, and the process does sequential
302 * The reference peak rates are measured in sectors/usec, left-shifted
305 static int ref_rate[2] = {14000, 33000};
307 * To improve readability, a conversion function is used to initialize
308 * the following array, which entails that the array can be
309 * initialized only in a function.
311 static int ref_wr_duration[2];
314 * BFQ uses the above-detailed, time-based weight-raising mechanism to
315 * privilege interactive tasks. This mechanism is vulnerable to the
316 * following false positives: I/O-bound applications that will go on
317 * doing I/O for much longer than the duration of weight
318 * raising. These applications have basically no benefit from being
319 * weight-raised at the beginning of their I/O. On the opposite end,
320 * while being weight-raised, these applications
321 * a) unjustly steal throughput to applications that may actually need
323 * b) make BFQ uselessly perform device idling; device idling results
324 * in loss of device throughput with most flash-based storage, and may
325 * increase latencies when used purposelessly.
327 * BFQ tries to reduce these problems, by adopting the following
328 * countermeasure. To introduce this countermeasure, we need first to
329 * finish explaining how the duration of weight-raising for
330 * interactive tasks is computed.
332 * For a bfq_queue deemed as interactive, the duration of weight
333 * raising is dynamically adjusted, as a function of the estimated
334 * peak rate of the device, so as to be equal to the time needed to
335 * execute the 'largest' interactive task we benchmarked so far. By
336 * largest task, we mean the task for which each involved process has
337 * to do more I/O than for any of the other tasks we benchmarked. This
338 * reference interactive task is the start-up of LibreOffice Writer,
339 * and in this task each process/bfq_queue needs to have at most ~110K
340 * sectors transferred.
342 * This last piece of information enables BFQ to reduce the actual
343 * duration of weight-raising for at least one class of I/O-bound
344 * applications: those doing sequential or quasi-sequential I/O. An
345 * example is file copy. In fact, once started, the main I/O-bound
346 * processes of these applications usually consume the above 110K
347 * sectors in much less time than the processes of an application that
348 * is starting, because these I/O-bound processes will greedily devote
349 * almost all their CPU cycles only to their target,
350 * throughput-friendly I/O operations. This is even more true if BFQ
351 * happens to be underestimating the device peak rate, and thus
352 * overestimating the duration of weight raising. But, according to
353 * our measurements, once transferred 110K sectors, these processes
354 * have no right to be weight-raised any longer.
356 * Basing on the last consideration, BFQ ends weight-raising for a
357 * bfq_queue if the latter happens to have received an amount of
358 * service at least equal to the following constant. The constant is
359 * set to slightly more than 110K, to have a minimum safety margin.
361 * This early ending of weight-raising reduces the amount of time
362 * during which interactive false positives cause the two problems
363 * described at the beginning of these comments.
365 static const unsigned long max_service_from_wr = 120000;
368 * Maximum time between the creation of two queues, for stable merge
369 * to be activated (in ms)
371 static const unsigned long bfq_activation_stable_merging = 600;
373 * Minimum time to be waited before evaluating delayed stable merge (in ms)
375 static const unsigned long bfq_late_stable_merging = 600;
377 #define RQ_BIC(rq) ((struct bfq_io_cq *)((rq)->elv.priv[0]))
378 #define RQ_BFQQ(rq) ((rq)->elv.priv[1])
380 struct bfq_queue *bic_to_bfqq(struct bfq_io_cq *bic, bool is_sync)
382 return bic->bfqq[is_sync];
385 static void bfq_put_stable_ref(struct bfq_queue *bfqq);
387 void bic_set_bfqq(struct bfq_io_cq *bic, struct bfq_queue *bfqq, bool is_sync)
390 * If bfqq != NULL, then a non-stable queue merge between
391 * bic->bfqq and bfqq is happening here. This causes troubles
392 * in the following case: bic->bfqq has also been scheduled
393 * for a possible stable merge with bic->stable_merge_bfqq,
394 * and bic->stable_merge_bfqq == bfqq happens to
395 * hold. Troubles occur because bfqq may then undergo a split,
396 * thereby becoming eligible for a stable merge. Yet, if
397 * bic->stable_merge_bfqq points exactly to bfqq, then bfqq
398 * would be stably merged with itself. To avoid this anomaly,
399 * we cancel the stable merge if
400 * bic->stable_merge_bfqq == bfqq.
402 bic->bfqq[is_sync] = bfqq;
404 if (bfqq && bic->stable_merge_bfqq == bfqq) {
406 * Actually, these same instructions are executed also
407 * in bfq_setup_cooperator, in case of abort or actual
408 * execution of a stable merge. We could avoid
409 * repeating these instructions there too, but if we
410 * did so, we would nest even more complexity in this
413 bfq_put_stable_ref(bic->stable_merge_bfqq);
415 bic->stable_merge_bfqq = NULL;
419 struct bfq_data *bic_to_bfqd(struct bfq_io_cq *bic)
421 return bic->icq.q->elevator->elevator_data;
425 * icq_to_bic - convert iocontext queue structure to bfq_io_cq.
426 * @icq: the iocontext queue.
428 static struct bfq_io_cq *icq_to_bic(struct io_cq *icq)
430 /* bic->icq is the first member, %NULL will convert to %NULL */
431 return container_of(icq, struct bfq_io_cq, icq);
435 * bfq_bic_lookup - search into @ioc a bic associated to @bfqd.
436 * @q: the request queue.
438 static struct bfq_io_cq *bfq_bic_lookup(struct request_queue *q)
440 struct bfq_io_cq *icq;
443 if (!current->io_context)
446 spin_lock_irqsave(&q->queue_lock, flags);
447 icq = icq_to_bic(ioc_lookup_icq(q));
448 spin_unlock_irqrestore(&q->queue_lock, flags);
454 * Scheduler run of queue, if there are requests pending and no one in the
455 * driver that will restart queueing.
457 void bfq_schedule_dispatch(struct bfq_data *bfqd)
459 lockdep_assert_held(&bfqd->lock);
461 if (bfqd->queued != 0) {
462 bfq_log(bfqd, "schedule dispatch");
463 blk_mq_run_hw_queues(bfqd->queue, true);
467 #define bfq_class_idle(bfqq) ((bfqq)->ioprio_class == IOPRIO_CLASS_IDLE)
469 #define bfq_sample_valid(samples) ((samples) > 80)
472 * Lifted from AS - choose which of rq1 and rq2 that is best served now.
473 * We choose the request that is closer to the head right now. Distance
474 * behind the head is penalized and only allowed to a certain extent.
476 static struct request *bfq_choose_req(struct bfq_data *bfqd,
481 sector_t s1, s2, d1 = 0, d2 = 0;
482 unsigned long back_max;
483 #define BFQ_RQ1_WRAP 0x01 /* request 1 wraps */
484 #define BFQ_RQ2_WRAP 0x02 /* request 2 wraps */
485 unsigned int wrap = 0; /* bit mask: requests behind the disk head? */
487 if (!rq1 || rq1 == rq2)
492 if (rq_is_sync(rq1) && !rq_is_sync(rq2))
494 else if (rq_is_sync(rq2) && !rq_is_sync(rq1))
496 if ((rq1->cmd_flags & REQ_META) && !(rq2->cmd_flags & REQ_META))
498 else if ((rq2->cmd_flags & REQ_META) && !(rq1->cmd_flags & REQ_META))
501 s1 = blk_rq_pos(rq1);
502 s2 = blk_rq_pos(rq2);
505 * By definition, 1KiB is 2 sectors.
507 back_max = bfqd->bfq_back_max * 2;
510 * Strict one way elevator _except_ in the case where we allow
511 * short backward seeks which are biased as twice the cost of a
512 * similar forward seek.
516 else if (s1 + back_max >= last)
517 d1 = (last - s1) * bfqd->bfq_back_penalty;
519 wrap |= BFQ_RQ1_WRAP;
523 else if (s2 + back_max >= last)
524 d2 = (last - s2) * bfqd->bfq_back_penalty;
526 wrap |= BFQ_RQ2_WRAP;
528 /* Found required data */
531 * By doing switch() on the bit mask "wrap" we avoid having to
532 * check two variables for all permutations: --> faster!
535 case 0: /* common case for CFQ: rq1 and rq2 not wrapped */
550 case BFQ_RQ1_WRAP|BFQ_RQ2_WRAP: /* both rqs wrapped */
553 * Since both rqs are wrapped,
554 * start with the one that's further behind head
555 * (--> only *one* back seek required),
556 * since back seek takes more time than forward.
565 #define BFQ_LIMIT_INLINE_DEPTH 16
567 #ifdef CONFIG_BFQ_GROUP_IOSCHED
568 static bool bfqq_request_over_limit(struct bfq_queue *bfqq, int limit)
570 struct bfq_data *bfqd = bfqq->bfqd;
571 struct bfq_entity *entity = &bfqq->entity;
572 struct bfq_entity *inline_entities[BFQ_LIMIT_INLINE_DEPTH];
573 struct bfq_entity **entities = inline_entities;
574 int depth, level, alloc_depth = BFQ_LIMIT_INLINE_DEPTH;
575 int class_idx = bfqq->ioprio_class - 1;
576 struct bfq_sched_data *sched_data;
580 if (!entity->on_st_or_in_serv)
584 spin_lock_irq(&bfqd->lock);
585 /* +1 for bfqq entity, root cgroup not included */
586 depth = bfqg_to_blkg(bfqq_group(bfqq))->blkcg->css.cgroup->level + 1;
587 if (depth > alloc_depth) {
588 spin_unlock_irq(&bfqd->lock);
589 if (entities != inline_entities)
591 entities = kmalloc_array(depth, sizeof(*entities), GFP_NOIO);
598 sched_data = entity->sched_data;
599 /* Gather our ancestors as we need to traverse them in reverse order */
601 for_each_entity(entity) {
603 * If at some level entity is not even active, allow request
604 * queueing so that BFQ knows there's work to do and activate
607 if (!entity->on_st_or_in_serv)
609 /* Uh, more parents than cgroup subsystem thinks? */
610 if (WARN_ON_ONCE(level >= depth))
612 entities[level++] = entity;
614 WARN_ON_ONCE(level != depth);
615 for (level--; level >= 0; level--) {
616 entity = entities[level];
618 wsum = bfq_entity_service_tree(entity)->wsum;
622 * For bfqq itself we take into account service trees
623 * of all higher priority classes and multiply their
624 * weights so that low prio queue from higher class
625 * gets more requests than high prio queue from lower
629 for (i = 0; i <= class_idx; i++) {
630 wsum = wsum * IOPRIO_BE_NR +
631 sched_data->service_tree[i].wsum;
634 limit = DIV_ROUND_CLOSEST(limit * entity->weight, wsum);
635 if (entity->allocated >= limit) {
636 bfq_log_bfqq(bfqq->bfqd, bfqq,
637 "too many requests: allocated %d limit %d level %d",
638 entity->allocated, limit, level);
644 spin_unlock_irq(&bfqd->lock);
645 if (entities != inline_entities)
650 static bool bfqq_request_over_limit(struct bfq_queue *bfqq, int limit)
657 * Async I/O can easily starve sync I/O (both sync reads and sync
658 * writes), by consuming all tags. Similarly, storms of sync writes,
659 * such as those that sync(2) may trigger, can starve sync reads.
660 * Limit depths of async I/O and sync writes so as to counter both
663 * Also if a bfq queue or its parent cgroup consume more tags than would be
664 * appropriate for their weight, we trim the available tag depth to 1. This
665 * avoids a situation where one cgroup can starve another cgroup from tags and
666 * thus block service differentiation among cgroups. Note that because the
667 * queue / cgroup already has many requests allocated and queued, this does not
668 * significantly affect service guarantees coming from the BFQ scheduling
671 static void bfq_limit_depth(blk_opf_t opf, struct blk_mq_alloc_data *data)
673 struct bfq_data *bfqd = data->q->elevator->elevator_data;
674 struct bfq_io_cq *bic = bfq_bic_lookup(data->q);
675 struct bfq_queue *bfqq = bic ? bic_to_bfqq(bic, op_is_sync(opf)) : NULL;
677 unsigned limit = data->q->nr_requests;
679 /* Sync reads have full depth available */
680 if (op_is_sync(opf) && !op_is_write(opf)) {
683 depth = bfqd->word_depths[!!bfqd->wr_busy_queues][op_is_sync(opf)];
684 limit = (limit * depth) >> bfqd->full_depth_shift;
688 * Does queue (or any parent entity) exceed number of requests that
689 * should be available to it? Heavily limit depth so that it cannot
690 * consume more available requests and thus starve other entities.
692 if (bfqq && bfqq_request_over_limit(bfqq, limit))
695 bfq_log(bfqd, "[%s] wr_busy %d sync %d depth %u",
696 __func__, bfqd->wr_busy_queues, op_is_sync(opf), depth);
698 data->shallow_depth = depth;
701 static struct bfq_queue *
702 bfq_rq_pos_tree_lookup(struct bfq_data *bfqd, struct rb_root *root,
703 sector_t sector, struct rb_node **ret_parent,
704 struct rb_node ***rb_link)
706 struct rb_node **p, *parent;
707 struct bfq_queue *bfqq = NULL;
715 bfqq = rb_entry(parent, struct bfq_queue, pos_node);
718 * Sort strictly based on sector. Smallest to the left,
719 * largest to the right.
721 if (sector > blk_rq_pos(bfqq->next_rq))
723 else if (sector < blk_rq_pos(bfqq->next_rq))
731 *ret_parent = parent;
735 bfq_log(bfqd, "rq_pos_tree_lookup %llu: returning %d",
736 (unsigned long long)sector,
737 bfqq ? bfqq->pid : 0);
742 static bool bfq_too_late_for_merging(struct bfq_queue *bfqq)
744 return bfqq->service_from_backlogged > 0 &&
745 time_is_before_jiffies(bfqq->first_IO_time +
746 bfq_merge_time_limit);
750 * The following function is not marked as __cold because it is
751 * actually cold, but for the same performance goal described in the
752 * comments on the likely() at the beginning of
753 * bfq_setup_cooperator(). Unexpectedly, to reach an even lower
754 * execution time for the case where this function is not invoked, we
755 * had to add an unlikely() in each involved if().
758 bfq_pos_tree_add_move(struct bfq_data *bfqd, struct bfq_queue *bfqq)
760 struct rb_node **p, *parent;
761 struct bfq_queue *__bfqq;
763 if (bfqq->pos_root) {
764 rb_erase(&bfqq->pos_node, bfqq->pos_root);
765 bfqq->pos_root = NULL;
768 /* oom_bfqq does not participate in queue merging */
769 if (bfqq == &bfqd->oom_bfqq)
773 * bfqq cannot be merged any longer (see comments in
774 * bfq_setup_cooperator): no point in adding bfqq into the
777 if (bfq_too_late_for_merging(bfqq))
780 if (bfq_class_idle(bfqq))
785 bfqq->pos_root = &bfqq_group(bfqq)->rq_pos_tree;
786 __bfqq = bfq_rq_pos_tree_lookup(bfqd, bfqq->pos_root,
787 blk_rq_pos(bfqq->next_rq), &parent, &p);
789 rb_link_node(&bfqq->pos_node, parent, p);
790 rb_insert_color(&bfqq->pos_node, bfqq->pos_root);
792 bfqq->pos_root = NULL;
796 * The following function returns false either if every active queue
797 * must receive the same share of the throughput (symmetric scenario),
798 * or, as a special case, if bfqq must receive a share of the
799 * throughput lower than or equal to the share that every other active
800 * queue must receive. If bfqq does sync I/O, then these are the only
801 * two cases where bfqq happens to be guaranteed its share of the
802 * throughput even if I/O dispatching is not plugged when bfqq remains
803 * temporarily empty (for more details, see the comments in the
804 * function bfq_better_to_idle()). For this reason, the return value
805 * of this function is used to check whether I/O-dispatch plugging can
808 * The above first case (symmetric scenario) occurs when:
809 * 1) all active queues have the same weight,
810 * 2) all active queues belong to the same I/O-priority class,
811 * 3) all active groups at the same level in the groups tree have the same
813 * 4) all active groups at the same level in the groups tree have the same
814 * number of children.
816 * Unfortunately, keeping the necessary state for evaluating exactly
817 * the last two symmetry sub-conditions above would be quite complex
818 * and time consuming. Therefore this function evaluates, instead,
819 * only the following stronger three sub-conditions, for which it is
820 * much easier to maintain the needed state:
821 * 1) all active queues have the same weight,
822 * 2) all active queues belong to the same I/O-priority class,
823 * 3) there is at most one active group.
824 * In particular, the last condition is always true if hierarchical
825 * support or the cgroups interface are not enabled, thus no state
826 * needs to be maintained in this case.
828 static bool bfq_asymmetric_scenario(struct bfq_data *bfqd,
829 struct bfq_queue *bfqq)
831 bool smallest_weight = bfqq &&
832 bfqq->weight_counter &&
833 bfqq->weight_counter ==
835 rb_first_cached(&bfqd->queue_weights_tree),
836 struct bfq_weight_counter,
840 * For queue weights to differ, queue_weights_tree must contain
841 * at least two nodes.
843 bool varied_queue_weights = !smallest_weight &&
844 !RB_EMPTY_ROOT(&bfqd->queue_weights_tree.rb_root) &&
845 (bfqd->queue_weights_tree.rb_root.rb_node->rb_left ||
846 bfqd->queue_weights_tree.rb_root.rb_node->rb_right);
848 bool multiple_classes_busy =
849 (bfqd->busy_queues[0] && bfqd->busy_queues[1]) ||
850 (bfqd->busy_queues[0] && bfqd->busy_queues[2]) ||
851 (bfqd->busy_queues[1] && bfqd->busy_queues[2]);
853 return varied_queue_weights || multiple_classes_busy
854 #ifdef CONFIG_BFQ_GROUP_IOSCHED
855 || bfqd->num_groups_with_pending_reqs > 1
861 * If the weight-counter tree passed as input contains no counter for
862 * the weight of the input queue, then add that counter; otherwise just
863 * increment the existing counter.
865 * Note that weight-counter trees contain few nodes in mostly symmetric
866 * scenarios. For example, if all queues have the same weight, then the
867 * weight-counter tree for the queues may contain at most one node.
868 * This holds even if low_latency is on, because weight-raised queues
869 * are not inserted in the tree.
870 * In most scenarios, the rate at which nodes are created/destroyed
873 void bfq_weights_tree_add(struct bfq_data *bfqd, struct bfq_queue *bfqq,
874 struct rb_root_cached *root)
876 struct bfq_entity *entity = &bfqq->entity;
877 struct rb_node **new = &(root->rb_root.rb_node), *parent = NULL;
878 bool leftmost = true;
881 * Do not insert if the queue is already associated with a
882 * counter, which happens if:
883 * 1) a request arrival has caused the queue to become both
884 * non-weight-raised, and hence change its weight, and
885 * backlogged; in this respect, each of the two events
886 * causes an invocation of this function,
887 * 2) this is the invocation of this function caused by the
888 * second event. This second invocation is actually useless,
889 * and we handle this fact by exiting immediately. More
890 * efficient or clearer solutions might possibly be adopted.
892 if (bfqq->weight_counter)
896 struct bfq_weight_counter *__counter = container_of(*new,
897 struct bfq_weight_counter,
901 if (entity->weight == __counter->weight) {
902 bfqq->weight_counter = __counter;
905 if (entity->weight < __counter->weight)
906 new = &((*new)->rb_left);
908 new = &((*new)->rb_right);
913 bfqq->weight_counter = kzalloc(sizeof(struct bfq_weight_counter),
917 * In the unlucky event of an allocation failure, we just
918 * exit. This will cause the weight of queue to not be
919 * considered in bfq_asymmetric_scenario, which, in its turn,
920 * causes the scenario to be deemed wrongly symmetric in case
921 * bfqq's weight would have been the only weight making the
922 * scenario asymmetric. On the bright side, no unbalance will
923 * however occur when bfqq becomes inactive again (the
924 * invocation of this function is triggered by an activation
925 * of queue). In fact, bfq_weights_tree_remove does nothing
926 * if !bfqq->weight_counter.
928 if (unlikely(!bfqq->weight_counter))
931 bfqq->weight_counter->weight = entity->weight;
932 rb_link_node(&bfqq->weight_counter->weights_node, parent, new);
933 rb_insert_color_cached(&bfqq->weight_counter->weights_node, root,
937 bfqq->weight_counter->num_active++;
942 * Decrement the weight counter associated with the queue, and, if the
943 * counter reaches 0, remove the counter from the tree.
944 * See the comments to the function bfq_weights_tree_add() for considerations
947 void __bfq_weights_tree_remove(struct bfq_data *bfqd,
948 struct bfq_queue *bfqq,
949 struct rb_root_cached *root)
951 if (!bfqq->weight_counter)
954 bfqq->weight_counter->num_active--;
955 if (bfqq->weight_counter->num_active > 0)
956 goto reset_entity_pointer;
958 rb_erase_cached(&bfqq->weight_counter->weights_node, root);
959 kfree(bfqq->weight_counter);
961 reset_entity_pointer:
962 bfqq->weight_counter = NULL;
967 * Invoke __bfq_weights_tree_remove on bfqq and decrement the number
968 * of active groups for each queue's inactive parent entity.
970 void bfq_weights_tree_remove(struct bfq_data *bfqd,
971 struct bfq_queue *bfqq)
973 __bfq_weights_tree_remove(bfqd, bfqq,
974 &bfqd->queue_weights_tree);
978 * Return expired entry, or NULL to just start from scratch in rbtree.
980 static struct request *bfq_check_fifo(struct bfq_queue *bfqq,
981 struct request *last)
985 if (bfq_bfqq_fifo_expire(bfqq))
988 bfq_mark_bfqq_fifo_expire(bfqq);
990 rq = rq_entry_fifo(bfqq->fifo.next);
992 if (rq == last || ktime_get_ns() < rq->fifo_time)
995 bfq_log_bfqq(bfqq->bfqd, bfqq, "check_fifo: returned %p", rq);
999 static struct request *bfq_find_next_rq(struct bfq_data *bfqd,
1000 struct bfq_queue *bfqq,
1001 struct request *last)
1003 struct rb_node *rbnext = rb_next(&last->rb_node);
1004 struct rb_node *rbprev = rb_prev(&last->rb_node);
1005 struct request *next, *prev = NULL;
1007 /* Follow expired path, else get first next available. */
1008 next = bfq_check_fifo(bfqq, last);
1013 prev = rb_entry_rq(rbprev);
1016 next = rb_entry_rq(rbnext);
1018 rbnext = rb_first(&bfqq->sort_list);
1019 if (rbnext && rbnext != &last->rb_node)
1020 next = rb_entry_rq(rbnext);
1023 return bfq_choose_req(bfqd, next, prev, blk_rq_pos(last));
1026 /* see the definition of bfq_async_charge_factor for details */
1027 static unsigned long bfq_serv_to_charge(struct request *rq,
1028 struct bfq_queue *bfqq)
1030 if (bfq_bfqq_sync(bfqq) || bfqq->wr_coeff > 1 ||
1031 bfq_asymmetric_scenario(bfqq->bfqd, bfqq))
1032 return blk_rq_sectors(rq);
1034 return blk_rq_sectors(rq) * bfq_async_charge_factor;
1038 * bfq_updated_next_req - update the queue after a new next_rq selection.
1039 * @bfqd: the device data the queue belongs to.
1040 * @bfqq: the queue to update.
1042 * If the first request of a queue changes we make sure that the queue
1043 * has enough budget to serve at least its first request (if the
1044 * request has grown). We do this because if the queue has not enough
1045 * budget for its first request, it has to go through two dispatch
1046 * rounds to actually get it dispatched.
1048 static void bfq_updated_next_req(struct bfq_data *bfqd,
1049 struct bfq_queue *bfqq)
1051 struct bfq_entity *entity = &bfqq->entity;
1052 struct request *next_rq = bfqq->next_rq;
1053 unsigned long new_budget;
1058 if (bfqq == bfqd->in_service_queue)
1060 * In order not to break guarantees, budgets cannot be
1061 * changed after an entity has been selected.
1065 new_budget = max_t(unsigned long,
1066 max_t(unsigned long, bfqq->max_budget,
1067 bfq_serv_to_charge(next_rq, bfqq)),
1069 if (entity->budget != new_budget) {
1070 entity->budget = new_budget;
1071 bfq_log_bfqq(bfqd, bfqq, "updated next rq: new budget %lu",
1073 bfq_requeue_bfqq(bfqd, bfqq, false);
1077 static unsigned int bfq_wr_duration(struct bfq_data *bfqd)
1081 if (bfqd->bfq_wr_max_time > 0)
1082 return bfqd->bfq_wr_max_time;
1084 dur = bfqd->rate_dur_prod;
1085 do_div(dur, bfqd->peak_rate);
1088 * Limit duration between 3 and 25 seconds. The upper limit
1089 * has been conservatively set after the following worst case:
1090 * on a QEMU/KVM virtual machine
1091 * - running in a slow PC
1092 * - with a virtual disk stacked on a slow low-end 5400rpm HDD
1093 * - serving a heavy I/O workload, such as the sequential reading
1095 * mplayer took 23 seconds to start, if constantly weight-raised.
1097 * As for higher values than that accommodating the above bad
1098 * scenario, tests show that higher values would often yield
1099 * the opposite of the desired result, i.e., would worsen
1100 * responsiveness by allowing non-interactive applications to
1101 * preserve weight raising for too long.
1103 * On the other end, lower values than 3 seconds make it
1104 * difficult for most interactive tasks to complete their jobs
1105 * before weight-raising finishes.
1107 return clamp_val(dur, msecs_to_jiffies(3000), msecs_to_jiffies(25000));
1110 /* switch back from soft real-time to interactive weight raising */
1111 static void switch_back_to_interactive_wr(struct bfq_queue *bfqq,
1112 struct bfq_data *bfqd)
1114 bfqq->wr_coeff = bfqd->bfq_wr_coeff;
1115 bfqq->wr_cur_max_time = bfq_wr_duration(bfqd);
1116 bfqq->last_wr_start_finish = bfqq->wr_start_at_switch_to_srt;
1120 bfq_bfqq_resume_state(struct bfq_queue *bfqq, struct bfq_data *bfqd,
1121 struct bfq_io_cq *bic, bool bfq_already_existing)
1123 unsigned int old_wr_coeff = 1;
1124 bool busy = bfq_already_existing && bfq_bfqq_busy(bfqq);
1126 if (bic->saved_has_short_ttime)
1127 bfq_mark_bfqq_has_short_ttime(bfqq);
1129 bfq_clear_bfqq_has_short_ttime(bfqq);
1131 if (bic->saved_IO_bound)
1132 bfq_mark_bfqq_IO_bound(bfqq);
1134 bfq_clear_bfqq_IO_bound(bfqq);
1136 bfqq->last_serv_time_ns = bic->saved_last_serv_time_ns;
1137 bfqq->inject_limit = bic->saved_inject_limit;
1138 bfqq->decrease_time_jif = bic->saved_decrease_time_jif;
1140 bfqq->entity.new_weight = bic->saved_weight;
1141 bfqq->ttime = bic->saved_ttime;
1142 bfqq->io_start_time = bic->saved_io_start_time;
1143 bfqq->tot_idle_time = bic->saved_tot_idle_time;
1145 * Restore weight coefficient only if low_latency is on
1147 if (bfqd->low_latency) {
1148 old_wr_coeff = bfqq->wr_coeff;
1149 bfqq->wr_coeff = bic->saved_wr_coeff;
1151 bfqq->service_from_wr = bic->saved_service_from_wr;
1152 bfqq->wr_start_at_switch_to_srt = bic->saved_wr_start_at_switch_to_srt;
1153 bfqq->last_wr_start_finish = bic->saved_last_wr_start_finish;
1154 bfqq->wr_cur_max_time = bic->saved_wr_cur_max_time;
1156 if (bfqq->wr_coeff > 1 && (bfq_bfqq_in_large_burst(bfqq) ||
1157 time_is_before_jiffies(bfqq->last_wr_start_finish +
1158 bfqq->wr_cur_max_time))) {
1159 if (bfqq->wr_cur_max_time == bfqd->bfq_wr_rt_max_time &&
1160 !bfq_bfqq_in_large_burst(bfqq) &&
1161 time_is_after_eq_jiffies(bfqq->wr_start_at_switch_to_srt +
1162 bfq_wr_duration(bfqd))) {
1163 switch_back_to_interactive_wr(bfqq, bfqd);
1166 bfq_log_bfqq(bfqq->bfqd, bfqq,
1167 "resume state: switching off wr");
1171 /* make sure weight will be updated, however we got here */
1172 bfqq->entity.prio_changed = 1;
1177 if (old_wr_coeff == 1 && bfqq->wr_coeff > 1)
1178 bfqd->wr_busy_queues++;
1179 else if (old_wr_coeff > 1 && bfqq->wr_coeff == 1)
1180 bfqd->wr_busy_queues--;
1183 static int bfqq_process_refs(struct bfq_queue *bfqq)
1185 return bfqq->ref - bfqq->entity.allocated -
1186 bfqq->entity.on_st_or_in_serv -
1187 (bfqq->weight_counter != NULL) - bfqq->stable_ref;
1190 /* Empty burst list and add just bfqq (see comments on bfq_handle_burst) */
1191 static void bfq_reset_burst_list(struct bfq_data *bfqd, struct bfq_queue *bfqq)
1193 struct bfq_queue *item;
1194 struct hlist_node *n;
1196 hlist_for_each_entry_safe(item, n, &bfqd->burst_list, burst_list_node)
1197 hlist_del_init(&item->burst_list_node);
1200 * Start the creation of a new burst list only if there is no
1201 * active queue. See comments on the conditional invocation of
1202 * bfq_handle_burst().
1204 if (bfq_tot_busy_queues(bfqd) == 0) {
1205 hlist_add_head(&bfqq->burst_list_node, &bfqd->burst_list);
1206 bfqd->burst_size = 1;
1208 bfqd->burst_size = 0;
1210 bfqd->burst_parent_entity = bfqq->entity.parent;
1213 /* Add bfqq to the list of queues in current burst (see bfq_handle_burst) */
1214 static void bfq_add_to_burst(struct bfq_data *bfqd, struct bfq_queue *bfqq)
1216 /* Increment burst size to take into account also bfqq */
1219 if (bfqd->burst_size == bfqd->bfq_large_burst_thresh) {
1220 struct bfq_queue *pos, *bfqq_item;
1221 struct hlist_node *n;
1224 * Enough queues have been activated shortly after each
1225 * other to consider this burst as large.
1227 bfqd->large_burst = true;
1230 * We can now mark all queues in the burst list as
1231 * belonging to a large burst.
1233 hlist_for_each_entry(bfqq_item, &bfqd->burst_list,
1235 bfq_mark_bfqq_in_large_burst(bfqq_item);
1236 bfq_mark_bfqq_in_large_burst(bfqq);
1239 * From now on, and until the current burst finishes, any
1240 * new queue being activated shortly after the last queue
1241 * was inserted in the burst can be immediately marked as
1242 * belonging to a large burst. So the burst list is not
1243 * needed any more. Remove it.
1245 hlist_for_each_entry_safe(pos, n, &bfqd->burst_list,
1247 hlist_del_init(&pos->burst_list_node);
1249 * Burst not yet large: add bfqq to the burst list. Do
1250 * not increment the ref counter for bfqq, because bfqq
1251 * is removed from the burst list before freeing bfqq
1254 hlist_add_head(&bfqq->burst_list_node, &bfqd->burst_list);
1258 * If many queues belonging to the same group happen to be created
1259 * shortly after each other, then the processes associated with these
1260 * queues have typically a common goal. In particular, bursts of queue
1261 * creations are usually caused by services or applications that spawn
1262 * many parallel threads/processes. Examples are systemd during boot,
1263 * or git grep. To help these processes get their job done as soon as
1264 * possible, it is usually better to not grant either weight-raising
1265 * or device idling to their queues, unless these queues must be
1266 * protected from the I/O flowing through other active queues.
1268 * In this comment we describe, firstly, the reasons why this fact
1269 * holds, and, secondly, the next function, which implements the main
1270 * steps needed to properly mark these queues so that they can then be
1271 * treated in a different way.
1273 * The above services or applications benefit mostly from a high
1274 * throughput: the quicker the requests of the activated queues are
1275 * cumulatively served, the sooner the target job of these queues gets
1276 * completed. As a consequence, weight-raising any of these queues,
1277 * which also implies idling the device for it, is almost always
1278 * counterproductive, unless there are other active queues to isolate
1279 * these new queues from. If there no other active queues, then
1280 * weight-raising these new queues just lowers throughput in most
1283 * On the other hand, a burst of queue creations may be caused also by
1284 * the start of an application that does not consist of a lot of
1285 * parallel I/O-bound threads. In fact, with a complex application,
1286 * several short processes may need to be executed to start-up the
1287 * application. In this respect, to start an application as quickly as
1288 * possible, the best thing to do is in any case to privilege the I/O
1289 * related to the application with respect to all other
1290 * I/O. Therefore, the best strategy to start as quickly as possible
1291 * an application that causes a burst of queue creations is to
1292 * weight-raise all the queues created during the burst. This is the
1293 * exact opposite of the best strategy for the other type of bursts.
1295 * In the end, to take the best action for each of the two cases, the
1296 * two types of bursts need to be distinguished. Fortunately, this
1297 * seems relatively easy, by looking at the sizes of the bursts. In
1298 * particular, we found a threshold such that only bursts with a
1299 * larger size than that threshold are apparently caused by
1300 * services or commands such as systemd or git grep. For brevity,
1301 * hereafter we call just 'large' these bursts. BFQ *does not*
1302 * weight-raise queues whose creation occurs in a large burst. In
1303 * addition, for each of these queues BFQ performs or does not perform
1304 * idling depending on which choice boosts the throughput more. The
1305 * exact choice depends on the device and request pattern at
1308 * Unfortunately, false positives may occur while an interactive task
1309 * is starting (e.g., an application is being started). The
1310 * consequence is that the queues associated with the task do not
1311 * enjoy weight raising as expected. Fortunately these false positives
1312 * are very rare. They typically occur if some service happens to
1313 * start doing I/O exactly when the interactive task starts.
1315 * Turning back to the next function, it is invoked only if there are
1316 * no active queues (apart from active queues that would belong to the
1317 * same, possible burst bfqq would belong to), and it implements all
1318 * the steps needed to detect the occurrence of a large burst and to
1319 * properly mark all the queues belonging to it (so that they can then
1320 * be treated in a different way). This goal is achieved by
1321 * maintaining a "burst list" that holds, temporarily, the queues that
1322 * belong to the burst in progress. The list is then used to mark
1323 * these queues as belonging to a large burst if the burst does become
1324 * large. The main steps are the following.
1326 * . when the very first queue is created, the queue is inserted into the
1327 * list (as it could be the first queue in a possible burst)
1329 * . if the current burst has not yet become large, and a queue Q that does
1330 * not yet belong to the burst is activated shortly after the last time
1331 * at which a new queue entered the burst list, then the function appends
1332 * Q to the burst list
1334 * . if, as a consequence of the previous step, the burst size reaches
1335 * the large-burst threshold, then
1337 * . all the queues in the burst list are marked as belonging to a
1340 * . the burst list is deleted; in fact, the burst list already served
1341 * its purpose (keeping temporarily track of the queues in a burst,
1342 * so as to be able to mark them as belonging to a large burst in the
1343 * previous sub-step), and now is not needed any more
1345 * . the device enters a large-burst mode
1347 * . if a queue Q that does not belong to the burst is created while
1348 * the device is in large-burst mode and shortly after the last time
1349 * at which a queue either entered the burst list or was marked as
1350 * belonging to the current large burst, then Q is immediately marked
1351 * as belonging to a large burst.
1353 * . if a queue Q that does not belong to the burst is created a while
1354 * later, i.e., not shortly after, than the last time at which a queue
1355 * either entered the burst list or was marked as belonging to the
1356 * current large burst, then the current burst is deemed as finished and:
1358 * . the large-burst mode is reset if set
1360 * . the burst list is emptied
1362 * . Q is inserted in the burst list, as Q may be the first queue
1363 * in a possible new burst (then the burst list contains just Q
1366 static void bfq_handle_burst(struct bfq_data *bfqd, struct bfq_queue *bfqq)
1369 * If bfqq is already in the burst list or is part of a large
1370 * burst, or finally has just been split, then there is
1371 * nothing else to do.
1373 if (!hlist_unhashed(&bfqq->burst_list_node) ||
1374 bfq_bfqq_in_large_burst(bfqq) ||
1375 time_is_after_eq_jiffies(bfqq->split_time +
1376 msecs_to_jiffies(10)))
1380 * If bfqq's creation happens late enough, or bfqq belongs to
1381 * a different group than the burst group, then the current
1382 * burst is finished, and related data structures must be
1385 * In this respect, consider the special case where bfqq is
1386 * the very first queue created after BFQ is selected for this
1387 * device. In this case, last_ins_in_burst and
1388 * burst_parent_entity are not yet significant when we get
1389 * here. But it is easy to verify that, whether or not the
1390 * following condition is true, bfqq will end up being
1391 * inserted into the burst list. In particular the list will
1392 * happen to contain only bfqq. And this is exactly what has
1393 * to happen, as bfqq may be the first queue of the first
1396 if (time_is_before_jiffies(bfqd->last_ins_in_burst +
1397 bfqd->bfq_burst_interval) ||
1398 bfqq->entity.parent != bfqd->burst_parent_entity) {
1399 bfqd->large_burst = false;
1400 bfq_reset_burst_list(bfqd, bfqq);
1405 * If we get here, then bfqq is being activated shortly after the
1406 * last queue. So, if the current burst is also large, we can mark
1407 * bfqq as belonging to this large burst immediately.
1409 if (bfqd->large_burst) {
1410 bfq_mark_bfqq_in_large_burst(bfqq);
1415 * If we get here, then a large-burst state has not yet been
1416 * reached, but bfqq is being activated shortly after the last
1417 * queue. Then we add bfqq to the burst.
1419 bfq_add_to_burst(bfqd, bfqq);
1422 * At this point, bfqq either has been added to the current
1423 * burst or has caused the current burst to terminate and a
1424 * possible new burst to start. In particular, in the second
1425 * case, bfqq has become the first queue in the possible new
1426 * burst. In both cases last_ins_in_burst needs to be moved
1429 bfqd->last_ins_in_burst = jiffies;
1432 static int bfq_bfqq_budget_left(struct bfq_queue *bfqq)
1434 struct bfq_entity *entity = &bfqq->entity;
1436 return entity->budget - entity->service;
1440 * If enough samples have been computed, return the current max budget
1441 * stored in bfqd, which is dynamically updated according to the
1442 * estimated disk peak rate; otherwise return the default max budget
1444 static int bfq_max_budget(struct bfq_data *bfqd)
1446 if (bfqd->budgets_assigned < bfq_stats_min_budgets)
1447 return bfq_default_max_budget;
1449 return bfqd->bfq_max_budget;
1453 * Return min budget, which is a fraction of the current or default
1454 * max budget (trying with 1/32)
1456 static int bfq_min_budget(struct bfq_data *bfqd)
1458 if (bfqd->budgets_assigned < bfq_stats_min_budgets)
1459 return bfq_default_max_budget / 32;
1461 return bfqd->bfq_max_budget / 32;
1465 * The next function, invoked after the input queue bfqq switches from
1466 * idle to busy, updates the budget of bfqq. The function also tells
1467 * whether the in-service queue should be expired, by returning
1468 * true. The purpose of expiring the in-service queue is to give bfqq
1469 * the chance to possibly preempt the in-service queue, and the reason
1470 * for preempting the in-service queue is to achieve one of the two
1473 * 1. Guarantee to bfqq its reserved bandwidth even if bfqq has
1474 * expired because it has remained idle. In particular, bfqq may have
1475 * expired for one of the following two reasons:
1477 * - BFQQE_NO_MORE_REQUESTS bfqq did not enjoy any device idling
1478 * and did not make it to issue a new request before its last
1479 * request was served;
1481 * - BFQQE_TOO_IDLE bfqq did enjoy device idling, but did not issue
1482 * a new request before the expiration of the idling-time.
1484 * Even if bfqq has expired for one of the above reasons, the process
1485 * associated with the queue may be however issuing requests greedily,
1486 * and thus be sensitive to the bandwidth it receives (bfqq may have
1487 * remained idle for other reasons: CPU high load, bfqq not enjoying
1488 * idling, I/O throttling somewhere in the path from the process to
1489 * the I/O scheduler, ...). But if, after every expiration for one of
1490 * the above two reasons, bfqq has to wait for the service of at least
1491 * one full budget of another queue before being served again, then
1492 * bfqq is likely to get a much lower bandwidth or resource time than
1493 * its reserved ones. To address this issue, two countermeasures need
1496 * First, the budget and the timestamps of bfqq need to be updated in
1497 * a special way on bfqq reactivation: they need to be updated as if
1498 * bfqq did not remain idle and did not expire. In fact, if they are
1499 * computed as if bfqq expired and remained idle until reactivation,
1500 * then the process associated with bfqq is treated as if, instead of
1501 * being greedy, it stopped issuing requests when bfqq remained idle,
1502 * and restarts issuing requests only on this reactivation. In other
1503 * words, the scheduler does not help the process recover the "service
1504 * hole" between bfqq expiration and reactivation. As a consequence,
1505 * the process receives a lower bandwidth than its reserved one. In
1506 * contrast, to recover this hole, the budget must be updated as if
1507 * bfqq was not expired at all before this reactivation, i.e., it must
1508 * be set to the value of the remaining budget when bfqq was
1509 * expired. Along the same line, timestamps need to be assigned the
1510 * value they had the last time bfqq was selected for service, i.e.,
1511 * before last expiration. Thus timestamps need to be back-shifted
1512 * with respect to their normal computation (see [1] for more details
1513 * on this tricky aspect).
1515 * Secondly, to allow the process to recover the hole, the in-service
1516 * queue must be expired too, to give bfqq the chance to preempt it
1517 * immediately. In fact, if bfqq has to wait for a full budget of the
1518 * in-service queue to be completed, then it may become impossible to
1519 * let the process recover the hole, even if the back-shifted
1520 * timestamps of bfqq are lower than those of the in-service queue. If
1521 * this happens for most or all of the holes, then the process may not
1522 * receive its reserved bandwidth. In this respect, it is worth noting
1523 * that, being the service of outstanding requests unpreemptible, a
1524 * little fraction of the holes may however be unrecoverable, thereby
1525 * causing a little loss of bandwidth.
1527 * The last important point is detecting whether bfqq does need this
1528 * bandwidth recovery. In this respect, the next function deems the
1529 * process associated with bfqq greedy, and thus allows it to recover
1530 * the hole, if: 1) the process is waiting for the arrival of a new
1531 * request (which implies that bfqq expired for one of the above two
1532 * reasons), and 2) such a request has arrived soon. The first
1533 * condition is controlled through the flag non_blocking_wait_rq,
1534 * while the second through the flag arrived_in_time. If both
1535 * conditions hold, then the function computes the budget in the
1536 * above-described special way, and signals that the in-service queue
1537 * should be expired. Timestamp back-shifting is done later in
1538 * __bfq_activate_entity.
1540 * 2. Reduce latency. Even if timestamps are not backshifted to let
1541 * the process associated with bfqq recover a service hole, bfqq may
1542 * however happen to have, after being (re)activated, a lower finish
1543 * timestamp than the in-service queue. That is, the next budget of
1544 * bfqq may have to be completed before the one of the in-service
1545 * queue. If this is the case, then preempting the in-service queue
1546 * allows this goal to be achieved, apart from the unpreemptible,
1547 * outstanding requests mentioned above.
1549 * Unfortunately, regardless of which of the above two goals one wants
1550 * to achieve, service trees need first to be updated to know whether
1551 * the in-service queue must be preempted. To have service trees
1552 * correctly updated, the in-service queue must be expired and
1553 * rescheduled, and bfqq must be scheduled too. This is one of the
1554 * most costly operations (in future versions, the scheduling
1555 * mechanism may be re-designed in such a way to make it possible to
1556 * know whether preemption is needed without needing to update service
1557 * trees). In addition, queue preemptions almost always cause random
1558 * I/O, which may in turn cause loss of throughput. Finally, there may
1559 * even be no in-service queue when the next function is invoked (so,
1560 * no queue to compare timestamps with). Because of these facts, the
1561 * next function adopts the following simple scheme to avoid costly
1562 * operations, too frequent preemptions and too many dependencies on
1563 * the state of the scheduler: it requests the expiration of the
1564 * in-service queue (unconditionally) only for queues that need to
1565 * recover a hole. Then it delegates to other parts of the code the
1566 * responsibility of handling the above case 2.
1568 static bool bfq_bfqq_update_budg_for_activation(struct bfq_data *bfqd,
1569 struct bfq_queue *bfqq,
1570 bool arrived_in_time)
1572 struct bfq_entity *entity = &bfqq->entity;
1575 * In the next compound condition, we check also whether there
1576 * is some budget left, because otherwise there is no point in
1577 * trying to go on serving bfqq with this same budget: bfqq
1578 * would be expired immediately after being selected for
1579 * service. This would only cause useless overhead.
1581 if (bfq_bfqq_non_blocking_wait_rq(bfqq) && arrived_in_time &&
1582 bfq_bfqq_budget_left(bfqq) > 0) {
1584 * We do not clear the flag non_blocking_wait_rq here, as
1585 * the latter is used in bfq_activate_bfqq to signal
1586 * that timestamps need to be back-shifted (and is
1587 * cleared right after).
1591 * In next assignment we rely on that either
1592 * entity->service or entity->budget are not updated
1593 * on expiration if bfqq is empty (see
1594 * __bfq_bfqq_recalc_budget). Thus both quantities
1595 * remain unchanged after such an expiration, and the
1596 * following statement therefore assigns to
1597 * entity->budget the remaining budget on such an
1600 entity->budget = min_t(unsigned long,
1601 bfq_bfqq_budget_left(bfqq),
1605 * At this point, we have used entity->service to get
1606 * the budget left (needed for updating
1607 * entity->budget). Thus we finally can, and have to,
1608 * reset entity->service. The latter must be reset
1609 * because bfqq would otherwise be charged again for
1610 * the service it has received during its previous
1613 entity->service = 0;
1619 * We can finally complete expiration, by setting service to 0.
1621 entity->service = 0;
1622 entity->budget = max_t(unsigned long, bfqq->max_budget,
1623 bfq_serv_to_charge(bfqq->next_rq, bfqq));
1624 bfq_clear_bfqq_non_blocking_wait_rq(bfqq);
1629 * Return the farthest past time instant according to jiffies
1632 static unsigned long bfq_smallest_from_now(void)
1634 return jiffies - MAX_JIFFY_OFFSET;
1637 static void bfq_update_bfqq_wr_on_rq_arrival(struct bfq_data *bfqd,
1638 struct bfq_queue *bfqq,
1639 unsigned int old_wr_coeff,
1640 bool wr_or_deserves_wr,
1645 if (old_wr_coeff == 1 && wr_or_deserves_wr) {
1646 /* start a weight-raising period */
1648 bfqq->service_from_wr = 0;
1649 bfqq->wr_coeff = bfqd->bfq_wr_coeff;
1650 bfqq->wr_cur_max_time = bfq_wr_duration(bfqd);
1653 * No interactive weight raising in progress
1654 * here: assign minus infinity to
1655 * wr_start_at_switch_to_srt, to make sure
1656 * that, at the end of the soft-real-time
1657 * weight raising periods that is starting
1658 * now, no interactive weight-raising period
1659 * may be wrongly considered as still in
1660 * progress (and thus actually started by
1663 bfqq->wr_start_at_switch_to_srt =
1664 bfq_smallest_from_now();
1665 bfqq->wr_coeff = bfqd->bfq_wr_coeff *
1666 BFQ_SOFTRT_WEIGHT_FACTOR;
1667 bfqq->wr_cur_max_time =
1668 bfqd->bfq_wr_rt_max_time;
1672 * If needed, further reduce budget to make sure it is
1673 * close to bfqq's backlog, so as to reduce the
1674 * scheduling-error component due to a too large
1675 * budget. Do not care about throughput consequences,
1676 * but only about latency. Finally, do not assign a
1677 * too small budget either, to avoid increasing
1678 * latency by causing too frequent expirations.
1680 bfqq->entity.budget = min_t(unsigned long,
1681 bfqq->entity.budget,
1682 2 * bfq_min_budget(bfqd));
1683 } else if (old_wr_coeff > 1) {
1684 if (interactive) { /* update wr coeff and duration */
1685 bfqq->wr_coeff = bfqd->bfq_wr_coeff;
1686 bfqq->wr_cur_max_time = bfq_wr_duration(bfqd);
1687 } else if (in_burst)
1691 * The application is now or still meeting the
1692 * requirements for being deemed soft rt. We
1693 * can then correctly and safely (re)charge
1694 * the weight-raising duration for the
1695 * application with the weight-raising
1696 * duration for soft rt applications.
1698 * In particular, doing this recharge now, i.e.,
1699 * before the weight-raising period for the
1700 * application finishes, reduces the probability
1701 * of the following negative scenario:
1702 * 1) the weight of a soft rt application is
1703 * raised at startup (as for any newly
1704 * created application),
1705 * 2) since the application is not interactive,
1706 * at a certain time weight-raising is
1707 * stopped for the application,
1708 * 3) at that time the application happens to
1709 * still have pending requests, and hence
1710 * is destined to not have a chance to be
1711 * deemed soft rt before these requests are
1712 * completed (see the comments to the
1713 * function bfq_bfqq_softrt_next_start()
1714 * for details on soft rt detection),
1715 * 4) these pending requests experience a high
1716 * latency because the application is not
1717 * weight-raised while they are pending.
1719 if (bfqq->wr_cur_max_time !=
1720 bfqd->bfq_wr_rt_max_time) {
1721 bfqq->wr_start_at_switch_to_srt =
1722 bfqq->last_wr_start_finish;
1724 bfqq->wr_cur_max_time =
1725 bfqd->bfq_wr_rt_max_time;
1726 bfqq->wr_coeff = bfqd->bfq_wr_coeff *
1727 BFQ_SOFTRT_WEIGHT_FACTOR;
1729 bfqq->last_wr_start_finish = jiffies;
1734 static bool bfq_bfqq_idle_for_long_time(struct bfq_data *bfqd,
1735 struct bfq_queue *bfqq)
1737 return bfqq->dispatched == 0 &&
1738 time_is_before_jiffies(
1739 bfqq->budget_timeout +
1740 bfqd->bfq_wr_min_idle_time);
1745 * Return true if bfqq is in a higher priority class, or has a higher
1746 * weight than the in-service queue.
1748 static bool bfq_bfqq_higher_class_or_weight(struct bfq_queue *bfqq,
1749 struct bfq_queue *in_serv_bfqq)
1751 int bfqq_weight, in_serv_weight;
1753 if (bfqq->ioprio_class < in_serv_bfqq->ioprio_class)
1756 if (in_serv_bfqq->entity.parent == bfqq->entity.parent) {
1757 bfqq_weight = bfqq->entity.weight;
1758 in_serv_weight = in_serv_bfqq->entity.weight;
1760 if (bfqq->entity.parent)
1761 bfqq_weight = bfqq->entity.parent->weight;
1763 bfqq_weight = bfqq->entity.weight;
1764 if (in_serv_bfqq->entity.parent)
1765 in_serv_weight = in_serv_bfqq->entity.parent->weight;
1767 in_serv_weight = in_serv_bfqq->entity.weight;
1770 return bfqq_weight > in_serv_weight;
1773 static bool bfq_better_to_idle(struct bfq_queue *bfqq);
1775 static void bfq_bfqq_handle_idle_busy_switch(struct bfq_data *bfqd,
1776 struct bfq_queue *bfqq,
1781 bool soft_rt, in_burst, wr_or_deserves_wr,
1782 bfqq_wants_to_preempt,
1783 idle_for_long_time = bfq_bfqq_idle_for_long_time(bfqd, bfqq),
1785 * See the comments on
1786 * bfq_bfqq_update_budg_for_activation for
1787 * details on the usage of the next variable.
1789 arrived_in_time = ktime_get_ns() <=
1790 bfqq->ttime.last_end_request +
1791 bfqd->bfq_slice_idle * 3;
1795 * bfqq deserves to be weight-raised if:
1797 * - it does not belong to a large burst,
1798 * - it has been idle for enough time or is soft real-time,
1799 * - is linked to a bfq_io_cq (it is not shared in any sense),
1800 * - has a default weight (otherwise we assume the user wanted
1801 * to control its weight explicitly)
1803 in_burst = bfq_bfqq_in_large_burst(bfqq);
1804 soft_rt = bfqd->bfq_wr_max_softrt_rate > 0 &&
1805 !BFQQ_TOTALLY_SEEKY(bfqq) &&
1807 time_is_before_jiffies(bfqq->soft_rt_next_start) &&
1808 bfqq->dispatched == 0 &&
1809 bfqq->entity.new_weight == 40;
1810 *interactive = !in_burst && idle_for_long_time &&
1811 bfqq->entity.new_weight == 40;
1813 * Merged bfq_queues are kept out of weight-raising
1814 * (low-latency) mechanisms. The reason is that these queues
1815 * are usually created for non-interactive and
1816 * non-soft-real-time tasks. Yet this is not the case for
1817 * stably-merged queues. These queues are merged just because
1818 * they are created shortly after each other. So they may
1819 * easily serve the I/O of an interactive or soft-real time
1820 * application, if the application happens to spawn multiple
1821 * processes. So let also stably-merged queued enjoy weight
1824 wr_or_deserves_wr = bfqd->low_latency &&
1825 (bfqq->wr_coeff > 1 ||
1826 (bfq_bfqq_sync(bfqq) &&
1827 (bfqq->bic || RQ_BIC(rq)->stably_merged) &&
1828 (*interactive || soft_rt)));
1831 * Using the last flag, update budget and check whether bfqq
1832 * may want to preempt the in-service queue.
1834 bfqq_wants_to_preempt =
1835 bfq_bfqq_update_budg_for_activation(bfqd, bfqq,
1839 * If bfqq happened to be activated in a burst, but has been
1840 * idle for much more than an interactive queue, then we
1841 * assume that, in the overall I/O initiated in the burst, the
1842 * I/O associated with bfqq is finished. So bfqq does not need
1843 * to be treated as a queue belonging to a burst
1844 * anymore. Accordingly, we reset bfqq's in_large_burst flag
1845 * if set, and remove bfqq from the burst list if it's
1846 * there. We do not decrement burst_size, because the fact
1847 * that bfqq does not need to belong to the burst list any
1848 * more does not invalidate the fact that bfqq was created in
1851 if (likely(!bfq_bfqq_just_created(bfqq)) &&
1852 idle_for_long_time &&
1853 time_is_before_jiffies(
1854 bfqq->budget_timeout +
1855 msecs_to_jiffies(10000))) {
1856 hlist_del_init(&bfqq->burst_list_node);
1857 bfq_clear_bfqq_in_large_burst(bfqq);
1860 bfq_clear_bfqq_just_created(bfqq);
1862 if (bfqd->low_latency) {
1863 if (unlikely(time_is_after_jiffies(bfqq->split_time)))
1866 jiffies - bfqd->bfq_wr_min_idle_time - 1;
1868 if (time_is_before_jiffies(bfqq->split_time +
1869 bfqd->bfq_wr_min_idle_time)) {
1870 bfq_update_bfqq_wr_on_rq_arrival(bfqd, bfqq,
1877 if (old_wr_coeff != bfqq->wr_coeff)
1878 bfqq->entity.prio_changed = 1;
1882 bfqq->last_idle_bklogged = jiffies;
1883 bfqq->service_from_backlogged = 0;
1884 bfq_clear_bfqq_softrt_update(bfqq);
1886 bfq_add_bfqq_busy(bfqq);
1889 * Expire in-service queue if preemption may be needed for
1890 * guarantees or throughput. As for guarantees, we care
1891 * explicitly about two cases. The first is that bfqq has to
1892 * recover a service hole, as explained in the comments on
1893 * bfq_bfqq_update_budg_for_activation(), i.e., that
1894 * bfqq_wants_to_preempt is true. However, if bfqq does not
1895 * carry time-critical I/O, then bfqq's bandwidth is less
1896 * important than that of queues that carry time-critical I/O.
1897 * So, as a further constraint, we consider this case only if
1898 * bfqq is at least as weight-raised, i.e., at least as time
1899 * critical, as the in-service queue.
1901 * The second case is that bfqq is in a higher priority class,
1902 * or has a higher weight than the in-service queue. If this
1903 * condition does not hold, we don't care because, even if
1904 * bfqq does not start to be served immediately, the resulting
1905 * delay for bfqq's I/O is however lower or much lower than
1906 * the ideal completion time to be guaranteed to bfqq's I/O.
1908 * In both cases, preemption is needed only if, according to
1909 * the timestamps of both bfqq and of the in-service queue,
1910 * bfqq actually is the next queue to serve. So, to reduce
1911 * useless preemptions, the return value of
1912 * next_queue_may_preempt() is considered in the next compound
1913 * condition too. Yet next_queue_may_preempt() just checks a
1914 * simple, necessary condition for bfqq to be the next queue
1915 * to serve. In fact, to evaluate a sufficient condition, the
1916 * timestamps of the in-service queue would need to be
1917 * updated, and this operation is quite costly (see the
1918 * comments on bfq_bfqq_update_budg_for_activation()).
1920 * As for throughput, we ask bfq_better_to_idle() whether we
1921 * still need to plug I/O dispatching. If bfq_better_to_idle()
1922 * says no, then plugging is not needed any longer, either to
1923 * boost throughput or to perserve service guarantees. Then
1924 * the best option is to stop plugging I/O, as not doing so
1925 * would certainly lower throughput. We may end up in this
1926 * case if: (1) upon a dispatch attempt, we detected that it
1927 * was better to plug I/O dispatch, and to wait for a new
1928 * request to arrive for the currently in-service queue, but
1929 * (2) this switch of bfqq to busy changes the scenario.
1931 if (bfqd->in_service_queue &&
1932 ((bfqq_wants_to_preempt &&
1933 bfqq->wr_coeff >= bfqd->in_service_queue->wr_coeff) ||
1934 bfq_bfqq_higher_class_or_weight(bfqq, bfqd->in_service_queue) ||
1935 !bfq_better_to_idle(bfqd->in_service_queue)) &&
1936 next_queue_may_preempt(bfqd))
1937 bfq_bfqq_expire(bfqd, bfqd->in_service_queue,
1938 false, BFQQE_PREEMPTED);
1941 static void bfq_reset_inject_limit(struct bfq_data *bfqd,
1942 struct bfq_queue *bfqq)
1944 /* invalidate baseline total service time */
1945 bfqq->last_serv_time_ns = 0;
1948 * Reset pointer in case we are waiting for
1949 * some request completion.
1951 bfqd->waited_rq = NULL;
1954 * If bfqq has a short think time, then start by setting the
1955 * inject limit to 0 prudentially, because the service time of
1956 * an injected I/O request may be higher than the think time
1957 * of bfqq, and therefore, if one request was injected when
1958 * bfqq remains empty, this injected request might delay the
1959 * service of the next I/O request for bfqq significantly. In
1960 * case bfqq can actually tolerate some injection, then the
1961 * adaptive update will however raise the limit soon. This
1962 * lucky circumstance holds exactly because bfqq has a short
1963 * think time, and thus, after remaining empty, is likely to
1964 * get new I/O enqueued---and then completed---before being
1965 * expired. This is the very pattern that gives the
1966 * limit-update algorithm the chance to measure the effect of
1967 * injection on request service times, and then to update the
1968 * limit accordingly.
1970 * However, in the following special case, the inject limit is
1971 * left to 1 even if the think time is short: bfqq's I/O is
1972 * synchronized with that of some other queue, i.e., bfqq may
1973 * receive new I/O only after the I/O of the other queue is
1974 * completed. Keeping the inject limit to 1 allows the
1975 * blocking I/O to be served while bfqq is in service. And
1976 * this is very convenient both for bfqq and for overall
1977 * throughput, as explained in detail in the comments in
1978 * bfq_update_has_short_ttime().
1980 * On the opposite end, if bfqq has a long think time, then
1981 * start directly by 1, because:
1982 * a) on the bright side, keeping at most one request in
1983 * service in the drive is unlikely to cause any harm to the
1984 * latency of bfqq's requests, as the service time of a single
1985 * request is likely to be lower than the think time of bfqq;
1986 * b) on the downside, after becoming empty, bfqq is likely to
1987 * expire before getting its next request. With this request
1988 * arrival pattern, it is very hard to sample total service
1989 * times and update the inject limit accordingly (see comments
1990 * on bfq_update_inject_limit()). So the limit is likely to be
1991 * never, or at least seldom, updated. As a consequence, by
1992 * setting the limit to 1, we avoid that no injection ever
1993 * occurs with bfqq. On the downside, this proactive step
1994 * further reduces chances to actually compute the baseline
1995 * total service time. Thus it reduces chances to execute the
1996 * limit-update algorithm and possibly raise the limit to more
1999 if (bfq_bfqq_has_short_ttime(bfqq))
2000 bfqq->inject_limit = 0;
2002 bfqq->inject_limit = 1;
2004 bfqq->decrease_time_jif = jiffies;
2007 static void bfq_update_io_intensity(struct bfq_queue *bfqq, u64 now_ns)
2009 u64 tot_io_time = now_ns - bfqq->io_start_time;
2011 if (RB_EMPTY_ROOT(&bfqq->sort_list) && bfqq->dispatched == 0)
2012 bfqq->tot_idle_time +=
2013 now_ns - bfqq->ttime.last_end_request;
2015 if (unlikely(bfq_bfqq_just_created(bfqq)))
2019 * Must be busy for at least about 80% of the time to be
2020 * considered I/O bound.
2022 if (bfqq->tot_idle_time * 5 > tot_io_time)
2023 bfq_clear_bfqq_IO_bound(bfqq);
2025 bfq_mark_bfqq_IO_bound(bfqq);
2028 * Keep an observation window of at most 200 ms in the past
2031 if (tot_io_time > 200 * NSEC_PER_MSEC) {
2032 bfqq->io_start_time = now_ns - (tot_io_time>>1);
2033 bfqq->tot_idle_time >>= 1;
2038 * Detect whether bfqq's I/O seems synchronized with that of some
2039 * other queue, i.e., whether bfqq, after remaining empty, happens to
2040 * receive new I/O only right after some I/O request of the other
2041 * queue has been completed. We call waker queue the other queue, and
2042 * we assume, for simplicity, that bfqq may have at most one waker
2045 * A remarkable throughput boost can be reached by unconditionally
2046 * injecting the I/O of the waker queue, every time a new
2047 * bfq_dispatch_request happens to be invoked while I/O is being
2048 * plugged for bfqq. In addition to boosting throughput, this
2049 * unblocks bfqq's I/O, thereby improving bandwidth and latency for
2050 * bfqq. Note that these same results may be achieved with the general
2051 * injection mechanism, but less effectively. For details on this
2052 * aspect, see the comments on the choice of the queue for injection
2053 * in bfq_select_queue().
2055 * Turning back to the detection of a waker queue, a queue Q is deemed as a
2056 * waker queue for bfqq if, for three consecutive times, bfqq happens to become
2057 * non empty right after a request of Q has been completed within given
2058 * timeout. In this respect, even if bfqq is empty, we do not check for a waker
2059 * if it still has some in-flight I/O. In fact, in this case bfqq is actually
2060 * still being served by the drive, and may receive new I/O on the completion
2061 * of some of the in-flight requests. In particular, on the first time, Q is
2062 * tentatively set as a candidate waker queue, while on the third consecutive
2063 * time that Q is detected, the field waker_bfqq is set to Q, to confirm that Q
2064 * is a waker queue for bfqq. These detection steps are performed only if bfqq
2065 * has a long think time, so as to make it more likely that bfqq's I/O is
2066 * actually being blocked by a synchronization. This last filter, plus the
2067 * above three-times requirement and time limit for detection, make false
2068 * positives less likely.
2072 * The sooner a waker queue is detected, the sooner throughput can be
2073 * boosted by injecting I/O from the waker queue. Fortunately,
2074 * detection is likely to be actually fast, for the following
2075 * reasons. While blocked by synchronization, bfqq has a long think
2076 * time. This implies that bfqq's inject limit is at least equal to 1
2077 * (see the comments in bfq_update_inject_limit()). So, thanks to
2078 * injection, the waker queue is likely to be served during the very
2079 * first I/O-plugging time interval for bfqq. This triggers the first
2080 * step of the detection mechanism. Thanks again to injection, the
2081 * candidate waker queue is then likely to be confirmed no later than
2082 * during the next I/O-plugging interval for bfqq.
2086 * On queue merging all waker information is lost.
2088 static void bfq_check_waker(struct bfq_data *bfqd, struct bfq_queue *bfqq,
2091 char waker_name[MAX_BFQQ_NAME_LENGTH];
2093 if (!bfqd->last_completed_rq_bfqq ||
2094 bfqd->last_completed_rq_bfqq == bfqq ||
2095 bfq_bfqq_has_short_ttime(bfqq) ||
2096 now_ns - bfqd->last_completion >= 4 * NSEC_PER_MSEC)
2100 * We reset waker detection logic also if too much time has passed
2101 * since the first detection. If wakeups are rare, pointless idling
2102 * doesn't hurt throughput that much. The condition below makes sure
2103 * we do not uselessly idle blocking waker in more than 1/64 cases.
2105 if (bfqd->last_completed_rq_bfqq !=
2106 bfqq->tentative_waker_bfqq ||
2107 now_ns > bfqq->waker_detection_started +
2108 128 * (u64)bfqd->bfq_slice_idle) {
2110 * First synchronization detected with a
2111 * candidate waker queue, or with a different
2112 * candidate waker queue from the current one.
2114 bfqq->tentative_waker_bfqq =
2115 bfqd->last_completed_rq_bfqq;
2116 bfqq->num_waker_detections = 1;
2117 bfqq->waker_detection_started = now_ns;
2118 bfq_bfqq_name(bfqq->tentative_waker_bfqq, waker_name,
2119 MAX_BFQQ_NAME_LENGTH);
2120 bfq_log_bfqq(bfqd, bfqq, "set tentative waker %s", waker_name);
2121 } else /* Same tentative waker queue detected again */
2122 bfqq->num_waker_detections++;
2124 if (bfqq->num_waker_detections == 3) {
2125 bfqq->waker_bfqq = bfqd->last_completed_rq_bfqq;
2126 bfqq->tentative_waker_bfqq = NULL;
2127 bfq_bfqq_name(bfqq->waker_bfqq, waker_name,
2128 MAX_BFQQ_NAME_LENGTH);
2129 bfq_log_bfqq(bfqd, bfqq, "set waker %s", waker_name);
2132 * If the waker queue disappears, then
2133 * bfqq->waker_bfqq must be reset. To
2134 * this goal, we maintain in each
2135 * waker queue a list, woken_list, of
2136 * all the queues that reference the
2137 * waker queue through their
2138 * waker_bfqq pointer. When the waker
2139 * queue exits, the waker_bfqq pointer
2140 * of all the queues in the woken_list
2143 * In addition, if bfqq is already in
2144 * the woken_list of a waker queue,
2145 * then, before being inserted into
2146 * the woken_list of a new waker
2147 * queue, bfqq must be removed from
2148 * the woken_list of the old waker
2151 if (!hlist_unhashed(&bfqq->woken_list_node))
2152 hlist_del_init(&bfqq->woken_list_node);
2153 hlist_add_head(&bfqq->woken_list_node,
2154 &bfqd->last_completed_rq_bfqq->woken_list);
2158 static void bfq_add_request(struct request *rq)
2160 struct bfq_queue *bfqq = RQ_BFQQ(rq);
2161 struct bfq_data *bfqd = bfqq->bfqd;
2162 struct request *next_rq, *prev;
2163 unsigned int old_wr_coeff = bfqq->wr_coeff;
2164 bool interactive = false;
2165 u64 now_ns = ktime_get_ns();
2167 bfq_log_bfqq(bfqd, bfqq, "add_request %d", rq_is_sync(rq));
2168 bfqq->queued[rq_is_sync(rq)]++;
2170 * Updating of 'bfqd->queued' is protected by 'bfqd->lock', however, it
2171 * may be read without holding the lock in bfq_has_work().
2173 WRITE_ONCE(bfqd->queued, bfqd->queued + 1);
2175 if (bfq_bfqq_sync(bfqq) && RQ_BIC(rq)->requests <= 1) {
2176 bfq_check_waker(bfqd, bfqq, now_ns);
2179 * Periodically reset inject limit, to make sure that
2180 * the latter eventually drops in case workload
2181 * changes, see step (3) in the comments on
2182 * bfq_update_inject_limit().
2184 if (time_is_before_eq_jiffies(bfqq->decrease_time_jif +
2185 msecs_to_jiffies(1000)))
2186 bfq_reset_inject_limit(bfqd, bfqq);
2189 * The following conditions must hold to setup a new
2190 * sampling of total service time, and then a new
2191 * update of the inject limit:
2192 * - bfqq is in service, because the total service
2193 * time is evaluated only for the I/O requests of
2194 * the queues in service;
2195 * - this is the right occasion to compute or to
2196 * lower the baseline total service time, because
2197 * there are actually no requests in the drive,
2199 * the baseline total service time is available, and
2200 * this is the right occasion to compute the other
2201 * quantity needed to update the inject limit, i.e.,
2202 * the total service time caused by the amount of
2203 * injection allowed by the current value of the
2204 * limit. It is the right occasion because injection
2205 * has actually been performed during the service
2206 * hole, and there are still in-flight requests,
2207 * which are very likely to be exactly the injected
2208 * requests, or part of them;
2209 * - the minimum interval for sampling the total
2210 * service time and updating the inject limit has
2213 if (bfqq == bfqd->in_service_queue &&
2214 (bfqd->rq_in_driver == 0 ||
2215 (bfqq->last_serv_time_ns > 0 &&
2216 bfqd->rqs_injected && bfqd->rq_in_driver > 0)) &&
2217 time_is_before_eq_jiffies(bfqq->decrease_time_jif +
2218 msecs_to_jiffies(10))) {
2219 bfqd->last_empty_occupied_ns = ktime_get_ns();
2221 * Start the state machine for measuring the
2222 * total service time of rq: setting
2223 * wait_dispatch will cause bfqd->waited_rq to
2224 * be set when rq will be dispatched.
2226 bfqd->wait_dispatch = true;
2228 * If there is no I/O in service in the drive,
2229 * then possible injection occurred before the
2230 * arrival of rq will not affect the total
2231 * service time of rq. So the injection limit
2232 * must not be updated as a function of such
2233 * total service time, unless new injection
2234 * occurs before rq is completed. To have the
2235 * injection limit updated only in the latter
2236 * case, reset rqs_injected here (rqs_injected
2237 * will be set in case injection is performed
2238 * on bfqq before rq is completed).
2240 if (bfqd->rq_in_driver == 0)
2241 bfqd->rqs_injected = false;
2245 if (bfq_bfqq_sync(bfqq))
2246 bfq_update_io_intensity(bfqq, now_ns);
2248 elv_rb_add(&bfqq->sort_list, rq);
2251 * Check if this request is a better next-serve candidate.
2253 prev = bfqq->next_rq;
2254 next_rq = bfq_choose_req(bfqd, bfqq->next_rq, rq, bfqd->last_position);
2255 bfqq->next_rq = next_rq;
2258 * Adjust priority tree position, if next_rq changes.
2259 * See comments on bfq_pos_tree_add_move() for the unlikely().
2261 if (unlikely(!bfqd->nonrot_with_queueing && prev != bfqq->next_rq))
2262 bfq_pos_tree_add_move(bfqd, bfqq);
2264 if (!bfq_bfqq_busy(bfqq)) /* switching to busy ... */
2265 bfq_bfqq_handle_idle_busy_switch(bfqd, bfqq, old_wr_coeff,
2268 if (bfqd->low_latency && old_wr_coeff == 1 && !rq_is_sync(rq) &&
2269 time_is_before_jiffies(
2270 bfqq->last_wr_start_finish +
2271 bfqd->bfq_wr_min_inter_arr_async)) {
2272 bfqq->wr_coeff = bfqd->bfq_wr_coeff;
2273 bfqq->wr_cur_max_time = bfq_wr_duration(bfqd);
2275 bfqd->wr_busy_queues++;
2276 bfqq->entity.prio_changed = 1;
2278 if (prev != bfqq->next_rq)
2279 bfq_updated_next_req(bfqd, bfqq);
2283 * Assign jiffies to last_wr_start_finish in the following
2286 * . if bfqq is not going to be weight-raised, because, for
2287 * non weight-raised queues, last_wr_start_finish stores the
2288 * arrival time of the last request; as of now, this piece
2289 * of information is used only for deciding whether to
2290 * weight-raise async queues
2292 * . if bfqq is not weight-raised, because, if bfqq is now
2293 * switching to weight-raised, then last_wr_start_finish
2294 * stores the time when weight-raising starts
2296 * . if bfqq is interactive, because, regardless of whether
2297 * bfqq is currently weight-raised, the weight-raising
2298 * period must start or restart (this case is considered
2299 * separately because it is not detected by the above
2300 * conditions, if bfqq is already weight-raised)
2302 * last_wr_start_finish has to be updated also if bfqq is soft
2303 * real-time, because the weight-raising period is constantly
2304 * restarted on idle-to-busy transitions for these queues, but
2305 * this is already done in bfq_bfqq_handle_idle_busy_switch if
2308 if (bfqd->low_latency &&
2309 (old_wr_coeff == 1 || bfqq->wr_coeff == 1 || interactive))
2310 bfqq->last_wr_start_finish = jiffies;
2313 static struct request *bfq_find_rq_fmerge(struct bfq_data *bfqd,
2315 struct request_queue *q)
2317 struct bfq_queue *bfqq = bfqd->bio_bfqq;
2321 return elv_rb_find(&bfqq->sort_list, bio_end_sector(bio));
2326 static sector_t get_sdist(sector_t last_pos, struct request *rq)
2329 return abs(blk_rq_pos(rq) - last_pos);
2334 #if 0 /* Still not clear if we can do without next two functions */
2335 static void bfq_activate_request(struct request_queue *q, struct request *rq)
2337 struct bfq_data *bfqd = q->elevator->elevator_data;
2339 bfqd->rq_in_driver++;
2342 static void bfq_deactivate_request(struct request_queue *q, struct request *rq)
2344 struct bfq_data *bfqd = q->elevator->elevator_data;
2346 bfqd->rq_in_driver--;
2350 static void bfq_remove_request(struct request_queue *q,
2353 struct bfq_queue *bfqq = RQ_BFQQ(rq);
2354 struct bfq_data *bfqd = bfqq->bfqd;
2355 const int sync = rq_is_sync(rq);
2357 if (bfqq->next_rq == rq) {
2358 bfqq->next_rq = bfq_find_next_rq(bfqd, bfqq, rq);
2359 bfq_updated_next_req(bfqd, bfqq);
2362 if (rq->queuelist.prev != &rq->queuelist)
2363 list_del_init(&rq->queuelist);
2364 bfqq->queued[sync]--;
2366 * Updating of 'bfqd->queued' is protected by 'bfqd->lock', however, it
2367 * may be read without holding the lock in bfq_has_work().
2369 WRITE_ONCE(bfqd->queued, bfqd->queued - 1);
2370 elv_rb_del(&bfqq->sort_list, rq);
2372 elv_rqhash_del(q, rq);
2373 if (q->last_merge == rq)
2374 q->last_merge = NULL;
2376 if (RB_EMPTY_ROOT(&bfqq->sort_list)) {
2377 bfqq->next_rq = NULL;
2379 if (bfq_bfqq_busy(bfqq) && bfqq != bfqd->in_service_queue) {
2380 bfq_del_bfqq_busy(bfqq, false);
2382 * bfqq emptied. In normal operation, when
2383 * bfqq is empty, bfqq->entity.service and
2384 * bfqq->entity.budget must contain,
2385 * respectively, the service received and the
2386 * budget used last time bfqq emptied. These
2387 * facts do not hold in this case, as at least
2388 * this last removal occurred while bfqq is
2389 * not in service. To avoid inconsistencies,
2390 * reset both bfqq->entity.service and
2391 * bfqq->entity.budget, if bfqq has still a
2392 * process that may issue I/O requests to it.
2394 bfqq->entity.budget = bfqq->entity.service = 0;
2398 * Remove queue from request-position tree as it is empty.
2400 if (bfqq->pos_root) {
2401 rb_erase(&bfqq->pos_node, bfqq->pos_root);
2402 bfqq->pos_root = NULL;
2405 /* see comments on bfq_pos_tree_add_move() for the unlikely() */
2406 if (unlikely(!bfqd->nonrot_with_queueing))
2407 bfq_pos_tree_add_move(bfqd, bfqq);
2410 if (rq->cmd_flags & REQ_META)
2411 bfqq->meta_pending--;
2415 static bool bfq_bio_merge(struct request_queue *q, struct bio *bio,
2416 unsigned int nr_segs)
2418 struct bfq_data *bfqd = q->elevator->elevator_data;
2419 struct request *free = NULL;
2421 * bfq_bic_lookup grabs the queue_lock: invoke it now and
2422 * store its return value for later use, to avoid nesting
2423 * queue_lock inside the bfqd->lock. We assume that the bic
2424 * returned by bfq_bic_lookup does not go away before
2425 * bfqd->lock is taken.
2427 struct bfq_io_cq *bic = bfq_bic_lookup(q);
2430 spin_lock_irq(&bfqd->lock);
2434 * Make sure cgroup info is uptodate for current process before
2435 * considering the merge.
2437 bfq_bic_update_cgroup(bic, bio);
2439 bfqd->bio_bfqq = bic_to_bfqq(bic, op_is_sync(bio->bi_opf));
2441 bfqd->bio_bfqq = NULL;
2443 bfqd->bio_bic = bic;
2445 ret = blk_mq_sched_try_merge(q, bio, nr_segs, &free);
2447 spin_unlock_irq(&bfqd->lock);
2449 blk_mq_free_request(free);
2454 static int bfq_request_merge(struct request_queue *q, struct request **req,
2457 struct bfq_data *bfqd = q->elevator->elevator_data;
2458 struct request *__rq;
2460 __rq = bfq_find_rq_fmerge(bfqd, bio, q);
2461 if (__rq && elv_bio_merge_ok(__rq, bio)) {
2464 if (blk_discard_mergable(__rq))
2465 return ELEVATOR_DISCARD_MERGE;
2466 return ELEVATOR_FRONT_MERGE;
2469 return ELEVATOR_NO_MERGE;
2472 static void bfq_request_merged(struct request_queue *q, struct request *req,
2473 enum elv_merge type)
2475 if (type == ELEVATOR_FRONT_MERGE &&
2476 rb_prev(&req->rb_node) &&
2478 blk_rq_pos(container_of(rb_prev(&req->rb_node),
2479 struct request, rb_node))) {
2480 struct bfq_queue *bfqq = RQ_BFQQ(req);
2481 struct bfq_data *bfqd;
2482 struct request *prev, *next_rq;
2489 /* Reposition request in its sort_list */
2490 elv_rb_del(&bfqq->sort_list, req);
2491 elv_rb_add(&bfqq->sort_list, req);
2493 /* Choose next request to be served for bfqq */
2494 prev = bfqq->next_rq;
2495 next_rq = bfq_choose_req(bfqd, bfqq->next_rq, req,
2496 bfqd->last_position);
2497 bfqq->next_rq = next_rq;
2499 * If next_rq changes, update both the queue's budget to
2500 * fit the new request and the queue's position in its
2503 if (prev != bfqq->next_rq) {
2504 bfq_updated_next_req(bfqd, bfqq);
2506 * See comments on bfq_pos_tree_add_move() for
2509 if (unlikely(!bfqd->nonrot_with_queueing))
2510 bfq_pos_tree_add_move(bfqd, bfqq);
2516 * This function is called to notify the scheduler that the requests
2517 * rq and 'next' have been merged, with 'next' going away. BFQ
2518 * exploits this hook to address the following issue: if 'next' has a
2519 * fifo_time lower that rq, then the fifo_time of rq must be set to
2520 * the value of 'next', to not forget the greater age of 'next'.
2522 * NOTE: in this function we assume that rq is in a bfq_queue, basing
2523 * on that rq is picked from the hash table q->elevator->hash, which,
2524 * in its turn, is filled only with I/O requests present in
2525 * bfq_queues, while BFQ is in use for the request queue q. In fact,
2526 * the function that fills this hash table (elv_rqhash_add) is called
2527 * only by bfq_insert_request.
2529 static void bfq_requests_merged(struct request_queue *q, struct request *rq,
2530 struct request *next)
2532 struct bfq_queue *bfqq = RQ_BFQQ(rq),
2533 *next_bfqq = RQ_BFQQ(next);
2539 * If next and rq belong to the same bfq_queue and next is older
2540 * than rq, then reposition rq in the fifo (by substituting next
2541 * with rq). Otherwise, if next and rq belong to different
2542 * bfq_queues, never reposition rq: in fact, we would have to
2543 * reposition it with respect to next's position in its own fifo,
2544 * which would most certainly be too expensive with respect to
2547 if (bfqq == next_bfqq &&
2548 !list_empty(&rq->queuelist) && !list_empty(&next->queuelist) &&
2549 next->fifo_time < rq->fifo_time) {
2550 list_del_init(&rq->queuelist);
2551 list_replace_init(&next->queuelist, &rq->queuelist);
2552 rq->fifo_time = next->fifo_time;
2555 if (bfqq->next_rq == next)
2558 bfqg_stats_update_io_merged(bfqq_group(bfqq), next->cmd_flags);
2560 /* Merged request may be in the IO scheduler. Remove it. */
2561 if (!RB_EMPTY_NODE(&next->rb_node)) {
2562 bfq_remove_request(next->q, next);
2564 bfqg_stats_update_io_remove(bfqq_group(next_bfqq),
2569 /* Must be called with bfqq != NULL */
2570 static void bfq_bfqq_end_wr(struct bfq_queue *bfqq)
2573 * If bfqq has been enjoying interactive weight-raising, then
2574 * reset soft_rt_next_start. We do it for the following
2575 * reason. bfqq may have been conveying the I/O needed to load
2576 * a soft real-time application. Such an application actually
2577 * exhibits a soft real-time I/O pattern after it finishes
2578 * loading, and finally starts doing its job. But, if bfqq has
2579 * been receiving a lot of bandwidth so far (likely to happen
2580 * on a fast device), then soft_rt_next_start now contains a
2581 * high value that. So, without this reset, bfqq would be
2582 * prevented from being possibly considered as soft_rt for a
2586 if (bfqq->wr_cur_max_time !=
2587 bfqq->bfqd->bfq_wr_rt_max_time)
2588 bfqq->soft_rt_next_start = jiffies;
2590 if (bfq_bfqq_busy(bfqq))
2591 bfqq->bfqd->wr_busy_queues--;
2593 bfqq->wr_cur_max_time = 0;
2594 bfqq->last_wr_start_finish = jiffies;
2596 * Trigger a weight change on the next invocation of
2597 * __bfq_entity_update_weight_prio.
2599 bfqq->entity.prio_changed = 1;
2602 void bfq_end_wr_async_queues(struct bfq_data *bfqd,
2603 struct bfq_group *bfqg)
2607 for (i = 0; i < 2; i++)
2608 for (j = 0; j < IOPRIO_NR_LEVELS; j++)
2609 if (bfqg->async_bfqq[i][j])
2610 bfq_bfqq_end_wr(bfqg->async_bfqq[i][j]);
2611 if (bfqg->async_idle_bfqq)
2612 bfq_bfqq_end_wr(bfqg->async_idle_bfqq);
2615 static void bfq_end_wr(struct bfq_data *bfqd)
2617 struct bfq_queue *bfqq;
2619 spin_lock_irq(&bfqd->lock);
2621 list_for_each_entry(bfqq, &bfqd->active_list, bfqq_list)
2622 bfq_bfqq_end_wr(bfqq);
2623 list_for_each_entry(bfqq, &bfqd->idle_list, bfqq_list)
2624 bfq_bfqq_end_wr(bfqq);
2625 bfq_end_wr_async(bfqd);
2627 spin_unlock_irq(&bfqd->lock);
2630 static sector_t bfq_io_struct_pos(void *io_struct, bool request)
2633 return blk_rq_pos(io_struct);
2635 return ((struct bio *)io_struct)->bi_iter.bi_sector;
2638 static int bfq_rq_close_to_sector(void *io_struct, bool request,
2641 return abs(bfq_io_struct_pos(io_struct, request) - sector) <=
2645 static struct bfq_queue *bfqq_find_close(struct bfq_data *bfqd,
2646 struct bfq_queue *bfqq,
2649 struct rb_root *root = &bfqq_group(bfqq)->rq_pos_tree;
2650 struct rb_node *parent, *node;
2651 struct bfq_queue *__bfqq;
2653 if (RB_EMPTY_ROOT(root))
2657 * First, if we find a request starting at the end of the last
2658 * request, choose it.
2660 __bfqq = bfq_rq_pos_tree_lookup(bfqd, root, sector, &parent, NULL);
2665 * If the exact sector wasn't found, the parent of the NULL leaf
2666 * will contain the closest sector (rq_pos_tree sorted by
2667 * next_request position).
2669 __bfqq = rb_entry(parent, struct bfq_queue, pos_node);
2670 if (bfq_rq_close_to_sector(__bfqq->next_rq, true, sector))
2673 if (blk_rq_pos(__bfqq->next_rq) < sector)
2674 node = rb_next(&__bfqq->pos_node);
2676 node = rb_prev(&__bfqq->pos_node);
2680 __bfqq = rb_entry(node, struct bfq_queue, pos_node);
2681 if (bfq_rq_close_to_sector(__bfqq->next_rq, true, sector))
2687 static struct bfq_queue *bfq_find_close_cooperator(struct bfq_data *bfqd,
2688 struct bfq_queue *cur_bfqq,
2691 struct bfq_queue *bfqq;
2694 * We shall notice if some of the queues are cooperating,
2695 * e.g., working closely on the same area of the device. In
2696 * that case, we can group them together and: 1) don't waste
2697 * time idling, and 2) serve the union of their requests in
2698 * the best possible order for throughput.
2700 bfqq = bfqq_find_close(bfqd, cur_bfqq, sector);
2701 if (!bfqq || bfqq == cur_bfqq)
2707 static struct bfq_queue *
2708 bfq_setup_merge(struct bfq_queue *bfqq, struct bfq_queue *new_bfqq)
2710 int process_refs, new_process_refs;
2711 struct bfq_queue *__bfqq;
2714 * If there are no process references on the new_bfqq, then it is
2715 * unsafe to follow the ->new_bfqq chain as other bfqq's in the chain
2716 * may have dropped their last reference (not just their last process
2719 if (!bfqq_process_refs(new_bfqq))
2722 /* Avoid a circular list and skip interim queue merges. */
2723 while ((__bfqq = new_bfqq->new_bfqq)) {
2729 process_refs = bfqq_process_refs(bfqq);
2730 new_process_refs = bfqq_process_refs(new_bfqq);
2732 * If the process for the bfqq has gone away, there is no
2733 * sense in merging the queues.
2735 if (process_refs == 0 || new_process_refs == 0)
2739 * Make sure merged queues belong to the same parent. Parents could
2740 * have changed since the time we decided the two queues are suitable
2743 if (new_bfqq->entity.parent != bfqq->entity.parent)
2746 bfq_log_bfqq(bfqq->bfqd, bfqq, "scheduling merge with queue %d",
2750 * Merging is just a redirection: the requests of the process
2751 * owning one of the two queues are redirected to the other queue.
2752 * The latter queue, in its turn, is set as shared if this is the
2753 * first time that the requests of some process are redirected to
2756 * We redirect bfqq to new_bfqq and not the opposite, because
2757 * we are in the context of the process owning bfqq, thus we
2758 * have the io_cq of this process. So we can immediately
2759 * configure this io_cq to redirect the requests of the
2760 * process to new_bfqq. In contrast, the io_cq of new_bfqq is
2761 * not available any more (new_bfqq->bic == NULL).
2763 * Anyway, even in case new_bfqq coincides with the in-service
2764 * queue, redirecting requests the in-service queue is the
2765 * best option, as we feed the in-service queue with new
2766 * requests close to the last request served and, by doing so,
2767 * are likely to increase the throughput.
2769 bfqq->new_bfqq = new_bfqq;
2771 * The above assignment schedules the following redirections:
2772 * each time some I/O for bfqq arrives, the process that
2773 * generated that I/O is disassociated from bfqq and
2774 * associated with new_bfqq. Here we increases new_bfqq->ref
2775 * in advance, adding the number of processes that are
2776 * expected to be associated with new_bfqq as they happen to
2779 new_bfqq->ref += process_refs;
2783 static bool bfq_may_be_close_cooperator(struct bfq_queue *bfqq,
2784 struct bfq_queue *new_bfqq)
2786 if (bfq_too_late_for_merging(new_bfqq))
2789 if (bfq_class_idle(bfqq) || bfq_class_idle(new_bfqq) ||
2790 (bfqq->ioprio_class != new_bfqq->ioprio_class))
2794 * If either of the queues has already been detected as seeky,
2795 * then merging it with the other queue is unlikely to lead to
2798 if (BFQQ_SEEKY(bfqq) || BFQQ_SEEKY(new_bfqq))
2802 * Interleaved I/O is known to be done by (some) applications
2803 * only for reads, so it does not make sense to merge async
2806 if (!bfq_bfqq_sync(bfqq) || !bfq_bfqq_sync(new_bfqq))
2812 static bool idling_boosts_thr_without_issues(struct bfq_data *bfqd,
2813 struct bfq_queue *bfqq);
2816 * Attempt to schedule a merge of bfqq with the currently in-service
2817 * queue or with a close queue among the scheduled queues. Return
2818 * NULL if no merge was scheduled, a pointer to the shared bfq_queue
2819 * structure otherwise.
2821 * The OOM queue is not allowed to participate to cooperation: in fact, since
2822 * the requests temporarily redirected to the OOM queue could be redirected
2823 * again to dedicated queues at any time, the state needed to correctly
2824 * handle merging with the OOM queue would be quite complex and expensive
2825 * to maintain. Besides, in such a critical condition as an out of memory,
2826 * the benefits of queue merging may be little relevant, or even negligible.
2828 * WARNING: queue merging may impair fairness among non-weight raised
2829 * queues, for at least two reasons: 1) the original weight of a
2830 * merged queue may change during the merged state, 2) even being the
2831 * weight the same, a merged queue may be bloated with many more
2832 * requests than the ones produced by its originally-associated
2835 static struct bfq_queue *
2836 bfq_setup_cooperator(struct bfq_data *bfqd, struct bfq_queue *bfqq,
2837 void *io_struct, bool request, struct bfq_io_cq *bic)
2839 struct bfq_queue *in_service_bfqq, *new_bfqq;
2841 /* if a merge has already been setup, then proceed with that first */
2843 return bfqq->new_bfqq;
2846 * Check delayed stable merge for rotational or non-queueing
2847 * devs. For this branch to be executed, bfqq must not be
2848 * currently merged with some other queue (i.e., bfqq->bic
2849 * must be non null). If we considered also merged queues,
2850 * then we should also check whether bfqq has already been
2851 * merged with bic->stable_merge_bfqq. But this would be
2852 * costly and complicated.
2854 if (unlikely(!bfqd->nonrot_with_queueing)) {
2856 * Make sure also that bfqq is sync, because
2857 * bic->stable_merge_bfqq may point to some queue (for
2858 * stable merging) also if bic is associated with a
2859 * sync queue, but this bfqq is async
2861 if (bfq_bfqq_sync(bfqq) && bic->stable_merge_bfqq &&
2862 !bfq_bfqq_just_created(bfqq) &&
2863 time_is_before_jiffies(bfqq->split_time +
2864 msecs_to_jiffies(bfq_late_stable_merging)) &&
2865 time_is_before_jiffies(bfqq->creation_time +
2866 msecs_to_jiffies(bfq_late_stable_merging))) {
2867 struct bfq_queue *stable_merge_bfqq =
2868 bic->stable_merge_bfqq;
2869 int proc_ref = min(bfqq_process_refs(bfqq),
2870 bfqq_process_refs(stable_merge_bfqq));
2872 /* deschedule stable merge, because done or aborted here */
2873 bfq_put_stable_ref(stable_merge_bfqq);
2875 bic->stable_merge_bfqq = NULL;
2877 if (!idling_boosts_thr_without_issues(bfqd, bfqq) &&
2879 /* next function will take at least one ref */
2880 struct bfq_queue *new_bfqq =
2881 bfq_setup_merge(bfqq, stable_merge_bfqq);
2884 bic->stably_merged = true;
2886 new_bfqq->bic->stably_merged =
2896 * Do not perform queue merging if the device is non
2897 * rotational and performs internal queueing. In fact, such a
2898 * device reaches a high speed through internal parallelism
2899 * and pipelining. This means that, to reach a high
2900 * throughput, it must have many requests enqueued at the same
2901 * time. But, in this configuration, the internal scheduling
2902 * algorithm of the device does exactly the job of queue
2903 * merging: it reorders requests so as to obtain as much as
2904 * possible a sequential I/O pattern. As a consequence, with
2905 * the workload generated by processes doing interleaved I/O,
2906 * the throughput reached by the device is likely to be the
2907 * same, with and without queue merging.
2909 * Disabling merging also provides a remarkable benefit in
2910 * terms of throughput. Merging tends to make many workloads
2911 * artificially more uneven, because of shared queues
2912 * remaining non empty for incomparably more time than
2913 * non-merged queues. This may accentuate workload
2914 * asymmetries. For example, if one of the queues in a set of
2915 * merged queues has a higher weight than a normal queue, then
2916 * the shared queue may inherit such a high weight and, by
2917 * staying almost always active, may force BFQ to perform I/O
2918 * plugging most of the time. This evidently makes it harder
2919 * for BFQ to let the device reach a high throughput.
2921 * Finally, the likely() macro below is not used because one
2922 * of the two branches is more likely than the other, but to
2923 * have the code path after the following if() executed as
2924 * fast as possible for the case of a non rotational device
2925 * with queueing. We want it because this is the fastest kind
2926 * of device. On the opposite end, the likely() may lengthen
2927 * the execution time of BFQ for the case of slower devices
2928 * (rotational or at least without queueing). But in this case
2929 * the execution time of BFQ matters very little, if not at
2932 if (likely(bfqd->nonrot_with_queueing))
2936 * Prevent bfqq from being merged if it has been created too
2937 * long ago. The idea is that true cooperating processes, and
2938 * thus their associated bfq_queues, are supposed to be
2939 * created shortly after each other. This is the case, e.g.,
2940 * for KVM/QEMU and dump I/O threads. Basing on this
2941 * assumption, the following filtering greatly reduces the
2942 * probability that two non-cooperating processes, which just
2943 * happen to do close I/O for some short time interval, have
2944 * their queues merged by mistake.
2946 if (bfq_too_late_for_merging(bfqq))
2949 if (!io_struct || unlikely(bfqq == &bfqd->oom_bfqq))
2952 /* If there is only one backlogged queue, don't search. */
2953 if (bfq_tot_busy_queues(bfqd) == 1)
2956 in_service_bfqq = bfqd->in_service_queue;
2958 if (in_service_bfqq && in_service_bfqq != bfqq &&
2959 likely(in_service_bfqq != &bfqd->oom_bfqq) &&
2960 bfq_rq_close_to_sector(io_struct, request,
2961 bfqd->in_serv_last_pos) &&
2962 bfqq->entity.parent == in_service_bfqq->entity.parent &&
2963 bfq_may_be_close_cooperator(bfqq, in_service_bfqq)) {
2964 new_bfqq = bfq_setup_merge(bfqq, in_service_bfqq);
2969 * Check whether there is a cooperator among currently scheduled
2970 * queues. The only thing we need is that the bio/request is not
2971 * NULL, as we need it to establish whether a cooperator exists.
2973 new_bfqq = bfq_find_close_cooperator(bfqd, bfqq,
2974 bfq_io_struct_pos(io_struct, request));
2976 if (new_bfqq && likely(new_bfqq != &bfqd->oom_bfqq) &&
2977 bfq_may_be_close_cooperator(bfqq, new_bfqq))
2978 return bfq_setup_merge(bfqq, new_bfqq);
2983 static void bfq_bfqq_save_state(struct bfq_queue *bfqq)
2985 struct bfq_io_cq *bic = bfqq->bic;
2988 * If !bfqq->bic, the queue is already shared or its requests
2989 * have already been redirected to a shared queue; both idle window
2990 * and weight raising state have already been saved. Do nothing.
2995 bic->saved_last_serv_time_ns = bfqq->last_serv_time_ns;
2996 bic->saved_inject_limit = bfqq->inject_limit;
2997 bic->saved_decrease_time_jif = bfqq->decrease_time_jif;
2999 bic->saved_weight = bfqq->entity.orig_weight;
3000 bic->saved_ttime = bfqq->ttime;
3001 bic->saved_has_short_ttime = bfq_bfqq_has_short_ttime(bfqq);
3002 bic->saved_IO_bound = bfq_bfqq_IO_bound(bfqq);
3003 bic->saved_io_start_time = bfqq->io_start_time;
3004 bic->saved_tot_idle_time = bfqq->tot_idle_time;
3005 bic->saved_in_large_burst = bfq_bfqq_in_large_burst(bfqq);
3006 bic->was_in_burst_list = !hlist_unhashed(&bfqq->burst_list_node);
3007 if (unlikely(bfq_bfqq_just_created(bfqq) &&
3008 !bfq_bfqq_in_large_burst(bfqq) &&
3009 bfqq->bfqd->low_latency)) {
3011 * bfqq being merged right after being created: bfqq
3012 * would have deserved interactive weight raising, but
3013 * did not make it to be set in a weight-raised state,
3014 * because of this early merge. Store directly the
3015 * weight-raising state that would have been assigned
3016 * to bfqq, so that to avoid that bfqq unjustly fails
3017 * to enjoy weight raising if split soon.
3019 bic->saved_wr_coeff = bfqq->bfqd->bfq_wr_coeff;
3020 bic->saved_wr_start_at_switch_to_srt = bfq_smallest_from_now();
3021 bic->saved_wr_cur_max_time = bfq_wr_duration(bfqq->bfqd);
3022 bic->saved_last_wr_start_finish = jiffies;
3024 bic->saved_wr_coeff = bfqq->wr_coeff;
3025 bic->saved_wr_start_at_switch_to_srt =
3026 bfqq->wr_start_at_switch_to_srt;
3027 bic->saved_service_from_wr = bfqq->service_from_wr;
3028 bic->saved_last_wr_start_finish = bfqq->last_wr_start_finish;
3029 bic->saved_wr_cur_max_time = bfqq->wr_cur_max_time;
3035 bfq_reassign_last_bfqq(struct bfq_queue *cur_bfqq, struct bfq_queue *new_bfqq)
3037 if (cur_bfqq->entity.parent &&
3038 cur_bfqq->entity.parent->last_bfqq_created == cur_bfqq)
3039 cur_bfqq->entity.parent->last_bfqq_created = new_bfqq;
3040 else if (cur_bfqq->bfqd && cur_bfqq->bfqd->last_bfqq_created == cur_bfqq)
3041 cur_bfqq->bfqd->last_bfqq_created = new_bfqq;
3044 void bfq_release_process_ref(struct bfq_data *bfqd, struct bfq_queue *bfqq)
3047 * To prevent bfqq's service guarantees from being violated,
3048 * bfqq may be left busy, i.e., queued for service, even if
3049 * empty (see comments in __bfq_bfqq_expire() for
3050 * details). But, if no process will send requests to bfqq any
3051 * longer, then there is no point in keeping bfqq queued for
3052 * service. In addition, keeping bfqq queued for service, but
3053 * with no process ref any longer, may have caused bfqq to be
3054 * freed when dequeued from service. But this is assumed to
3057 if (bfq_bfqq_busy(bfqq) && RB_EMPTY_ROOT(&bfqq->sort_list) &&
3058 bfqq != bfqd->in_service_queue)
3059 bfq_del_bfqq_busy(bfqq, false);
3061 bfq_reassign_last_bfqq(bfqq, NULL);
3063 bfq_put_queue(bfqq);
3067 bfq_merge_bfqqs(struct bfq_data *bfqd, struct bfq_io_cq *bic,
3068 struct bfq_queue *bfqq, struct bfq_queue *new_bfqq)
3070 bfq_log_bfqq(bfqd, bfqq, "merging with queue %lu",
3071 (unsigned long)new_bfqq->pid);
3072 /* Save weight raising and idle window of the merged queues */
3073 bfq_bfqq_save_state(bfqq);
3074 bfq_bfqq_save_state(new_bfqq);
3075 if (bfq_bfqq_IO_bound(bfqq))
3076 bfq_mark_bfqq_IO_bound(new_bfqq);
3077 bfq_clear_bfqq_IO_bound(bfqq);
3080 * The processes associated with bfqq are cooperators of the
3081 * processes associated with new_bfqq. So, if bfqq has a
3082 * waker, then assume that all these processes will be happy
3083 * to let bfqq's waker freely inject I/O when they have no
3086 if (bfqq->waker_bfqq && !new_bfqq->waker_bfqq &&
3087 bfqq->waker_bfqq != new_bfqq) {
3088 new_bfqq->waker_bfqq = bfqq->waker_bfqq;
3089 new_bfqq->tentative_waker_bfqq = NULL;
3092 * If the waker queue disappears, then
3093 * new_bfqq->waker_bfqq must be reset. So insert
3094 * new_bfqq into the woken_list of the waker. See
3095 * bfq_check_waker for details.
3097 hlist_add_head(&new_bfqq->woken_list_node,
3098 &new_bfqq->waker_bfqq->woken_list);
3103 * If bfqq is weight-raised, then let new_bfqq inherit
3104 * weight-raising. To reduce false positives, neglect the case
3105 * where bfqq has just been created, but has not yet made it
3106 * to be weight-raised (which may happen because EQM may merge
3107 * bfqq even before bfq_add_request is executed for the first
3108 * time for bfqq). Handling this case would however be very
3109 * easy, thanks to the flag just_created.
3111 if (new_bfqq->wr_coeff == 1 && bfqq->wr_coeff > 1) {
3112 new_bfqq->wr_coeff = bfqq->wr_coeff;
3113 new_bfqq->wr_cur_max_time = bfqq->wr_cur_max_time;
3114 new_bfqq->last_wr_start_finish = bfqq->last_wr_start_finish;
3115 new_bfqq->wr_start_at_switch_to_srt =
3116 bfqq->wr_start_at_switch_to_srt;
3117 if (bfq_bfqq_busy(new_bfqq))
3118 bfqd->wr_busy_queues++;
3119 new_bfqq->entity.prio_changed = 1;
3122 if (bfqq->wr_coeff > 1) { /* bfqq has given its wr to new_bfqq */
3124 bfqq->entity.prio_changed = 1;
3125 if (bfq_bfqq_busy(bfqq))
3126 bfqd->wr_busy_queues--;
3129 bfq_log_bfqq(bfqd, new_bfqq, "merge_bfqqs: wr_busy %d",
3130 bfqd->wr_busy_queues);
3133 * Merge queues (that is, let bic redirect its requests to new_bfqq)
3135 bic_set_bfqq(bic, new_bfqq, 1);
3136 bfq_mark_bfqq_coop(new_bfqq);
3138 * new_bfqq now belongs to at least two bics (it is a shared queue):
3139 * set new_bfqq->bic to NULL. bfqq either:
3140 * - does not belong to any bic any more, and hence bfqq->bic must
3141 * be set to NULL, or
3142 * - is a queue whose owning bics have already been redirected to a
3143 * different queue, hence the queue is destined to not belong to
3144 * any bic soon and bfqq->bic is already NULL (therefore the next
3145 * assignment causes no harm).
3147 new_bfqq->bic = NULL;
3149 * If the queue is shared, the pid is the pid of one of the associated
3150 * processes. Which pid depends on the exact sequence of merge events
3151 * the queue underwent. So printing such a pid is useless and confusing
3152 * because it reports a random pid between those of the associated
3154 * We mark such a queue with a pid -1, and then print SHARED instead of
3155 * a pid in logging messages.
3160 bfq_reassign_last_bfqq(bfqq, new_bfqq);
3162 bfq_release_process_ref(bfqd, bfqq);
3165 static bool bfq_allow_bio_merge(struct request_queue *q, struct request *rq,
3168 struct bfq_data *bfqd = q->elevator->elevator_data;
3169 bool is_sync = op_is_sync(bio->bi_opf);
3170 struct bfq_queue *bfqq = bfqd->bio_bfqq, *new_bfqq;
3173 * Disallow merge of a sync bio into an async request.
3175 if (is_sync && !rq_is_sync(rq))
3179 * Lookup the bfqq that this bio will be queued with. Allow
3180 * merge only if rq is queued there.
3186 * We take advantage of this function to perform an early merge
3187 * of the queues of possible cooperating processes.
3189 new_bfqq = bfq_setup_cooperator(bfqd, bfqq, bio, false, bfqd->bio_bic);
3192 * bic still points to bfqq, then it has not yet been
3193 * redirected to some other bfq_queue, and a queue
3194 * merge between bfqq and new_bfqq can be safely
3195 * fulfilled, i.e., bic can be redirected to new_bfqq
3196 * and bfqq can be put.
3198 bfq_merge_bfqqs(bfqd, bfqd->bio_bic, bfqq,
3201 * If we get here, bio will be queued into new_queue,
3202 * so use new_bfqq to decide whether bio and rq can be
3208 * Change also bqfd->bio_bfqq, as
3209 * bfqd->bio_bic now points to new_bfqq, and
3210 * this function may be invoked again (and then may
3211 * use again bqfd->bio_bfqq).
3213 bfqd->bio_bfqq = bfqq;
3216 return bfqq == RQ_BFQQ(rq);
3220 * Set the maximum time for the in-service queue to consume its
3221 * budget. This prevents seeky processes from lowering the throughput.
3222 * In practice, a time-slice service scheme is used with seeky
3225 static void bfq_set_budget_timeout(struct bfq_data *bfqd,
3226 struct bfq_queue *bfqq)
3228 unsigned int timeout_coeff;
3230 if (bfqq->wr_cur_max_time == bfqd->bfq_wr_rt_max_time)
3233 timeout_coeff = bfqq->entity.weight / bfqq->entity.orig_weight;
3235 bfqd->last_budget_start = ktime_get();
3237 bfqq->budget_timeout = jiffies +
3238 bfqd->bfq_timeout * timeout_coeff;
3241 static void __bfq_set_in_service_queue(struct bfq_data *bfqd,
3242 struct bfq_queue *bfqq)
3245 bfq_clear_bfqq_fifo_expire(bfqq);
3247 bfqd->budgets_assigned = (bfqd->budgets_assigned * 7 + 256) / 8;
3249 if (time_is_before_jiffies(bfqq->last_wr_start_finish) &&
3250 bfqq->wr_coeff > 1 &&
3251 bfqq->wr_cur_max_time == bfqd->bfq_wr_rt_max_time &&
3252 time_is_before_jiffies(bfqq->budget_timeout)) {
3254 * For soft real-time queues, move the start
3255 * of the weight-raising period forward by the
3256 * time the queue has not received any
3257 * service. Otherwise, a relatively long
3258 * service delay is likely to cause the
3259 * weight-raising period of the queue to end,
3260 * because of the short duration of the
3261 * weight-raising period of a soft real-time
3262 * queue. It is worth noting that this move
3263 * is not so dangerous for the other queues,
3264 * because soft real-time queues are not
3267 * To not add a further variable, we use the
3268 * overloaded field budget_timeout to
3269 * determine for how long the queue has not
3270 * received service, i.e., how much time has
3271 * elapsed since the queue expired. However,
3272 * this is a little imprecise, because
3273 * budget_timeout is set to jiffies if bfqq
3274 * not only expires, but also remains with no
3277 if (time_after(bfqq->budget_timeout,
3278 bfqq->last_wr_start_finish))
3279 bfqq->last_wr_start_finish +=
3280 jiffies - bfqq->budget_timeout;
3282 bfqq->last_wr_start_finish = jiffies;
3285 bfq_set_budget_timeout(bfqd, bfqq);
3286 bfq_log_bfqq(bfqd, bfqq,
3287 "set_in_service_queue, cur-budget = %d",
3288 bfqq->entity.budget);
3291 bfqd->in_service_queue = bfqq;
3292 bfqd->in_serv_last_pos = 0;
3296 * Get and set a new queue for service.
3298 static struct bfq_queue *bfq_set_in_service_queue(struct bfq_data *bfqd)
3300 struct bfq_queue *bfqq = bfq_get_next_queue(bfqd);
3302 __bfq_set_in_service_queue(bfqd, bfqq);
3306 static void bfq_arm_slice_timer(struct bfq_data *bfqd)
3308 struct bfq_queue *bfqq = bfqd->in_service_queue;
3311 bfq_mark_bfqq_wait_request(bfqq);
3314 * We don't want to idle for seeks, but we do want to allow
3315 * fair distribution of slice time for a process doing back-to-back
3316 * seeks. So allow a little bit of time for him to submit a new rq.
3318 sl = bfqd->bfq_slice_idle;
3320 * Unless the queue is being weight-raised or the scenario is
3321 * asymmetric, grant only minimum idle time if the queue
3322 * is seeky. A long idling is preserved for a weight-raised
3323 * queue, or, more in general, in an asymmetric scenario,
3324 * because a long idling is needed for guaranteeing to a queue
3325 * its reserved share of the throughput (in particular, it is
3326 * needed if the queue has a higher weight than some other
3329 if (BFQQ_SEEKY(bfqq) && bfqq->wr_coeff == 1 &&
3330 !bfq_asymmetric_scenario(bfqd, bfqq))
3331 sl = min_t(u64, sl, BFQ_MIN_TT);
3332 else if (bfqq->wr_coeff > 1)
3333 sl = max_t(u32, sl, 20ULL * NSEC_PER_MSEC);
3335 bfqd->last_idling_start = ktime_get();
3336 bfqd->last_idling_start_jiffies = jiffies;
3338 hrtimer_start(&bfqd->idle_slice_timer, ns_to_ktime(sl),
3340 bfqg_stats_set_start_idle_time(bfqq_group(bfqq));
3344 * In autotuning mode, max_budget is dynamically recomputed as the
3345 * amount of sectors transferred in timeout at the estimated peak
3346 * rate. This enables BFQ to utilize a full timeslice with a full
3347 * budget, even if the in-service queue is served at peak rate. And
3348 * this maximises throughput with sequential workloads.
3350 static unsigned long bfq_calc_max_budget(struct bfq_data *bfqd)
3352 return (u64)bfqd->peak_rate * USEC_PER_MSEC *
3353 jiffies_to_msecs(bfqd->bfq_timeout)>>BFQ_RATE_SHIFT;
3357 * Update parameters related to throughput and responsiveness, as a
3358 * function of the estimated peak rate. See comments on
3359 * bfq_calc_max_budget(), and on the ref_wr_duration array.
3361 static void update_thr_responsiveness_params(struct bfq_data *bfqd)
3363 if (bfqd->bfq_user_max_budget == 0) {
3364 bfqd->bfq_max_budget =
3365 bfq_calc_max_budget(bfqd);
3366 bfq_log(bfqd, "new max_budget = %d", bfqd->bfq_max_budget);
3370 static void bfq_reset_rate_computation(struct bfq_data *bfqd,
3373 if (rq != NULL) { /* new rq dispatch now, reset accordingly */
3374 bfqd->last_dispatch = bfqd->first_dispatch = ktime_get_ns();
3375 bfqd->peak_rate_samples = 1;
3376 bfqd->sequential_samples = 0;
3377 bfqd->tot_sectors_dispatched = bfqd->last_rq_max_size =
3379 } else /* no new rq dispatched, just reset the number of samples */
3380 bfqd->peak_rate_samples = 0; /* full re-init on next disp. */
3383 "reset_rate_computation at end, sample %u/%u tot_sects %llu",
3384 bfqd->peak_rate_samples, bfqd->sequential_samples,
3385 bfqd->tot_sectors_dispatched);
3388 static void bfq_update_rate_reset(struct bfq_data *bfqd, struct request *rq)
3390 u32 rate, weight, divisor;
3393 * For the convergence property to hold (see comments on
3394 * bfq_update_peak_rate()) and for the assessment to be
3395 * reliable, a minimum number of samples must be present, and
3396 * a minimum amount of time must have elapsed. If not so, do
3397 * not compute new rate. Just reset parameters, to get ready
3398 * for a new evaluation attempt.
3400 if (bfqd->peak_rate_samples < BFQ_RATE_MIN_SAMPLES ||
3401 bfqd->delta_from_first < BFQ_RATE_MIN_INTERVAL)
3402 goto reset_computation;
3405 * If a new request completion has occurred after last
3406 * dispatch, then, to approximate the rate at which requests
3407 * have been served by the device, it is more precise to
3408 * extend the observation interval to the last completion.
3410 bfqd->delta_from_first =
3411 max_t(u64, bfqd->delta_from_first,
3412 bfqd->last_completion - bfqd->first_dispatch);
3415 * Rate computed in sects/usec, and not sects/nsec, for
3418 rate = div64_ul(bfqd->tot_sectors_dispatched<<BFQ_RATE_SHIFT,
3419 div_u64(bfqd->delta_from_first, NSEC_PER_USEC));
3422 * Peak rate not updated if:
3423 * - the percentage of sequential dispatches is below 3/4 of the
3424 * total, and rate is below the current estimated peak rate
3425 * - rate is unreasonably high (> 20M sectors/sec)
3427 if ((bfqd->sequential_samples < (3 * bfqd->peak_rate_samples)>>2 &&
3428 rate <= bfqd->peak_rate) ||
3429 rate > 20<<BFQ_RATE_SHIFT)
3430 goto reset_computation;
3433 * We have to update the peak rate, at last! To this purpose,
3434 * we use a low-pass filter. We compute the smoothing constant
3435 * of the filter as a function of the 'weight' of the new
3438 * As can be seen in next formulas, we define this weight as a
3439 * quantity proportional to how sequential the workload is,
3440 * and to how long the observation time interval is.
3442 * The weight runs from 0 to 8. The maximum value of the
3443 * weight, 8, yields the minimum value for the smoothing
3444 * constant. At this minimum value for the smoothing constant,
3445 * the measured rate contributes for half of the next value of
3446 * the estimated peak rate.
3448 * So, the first step is to compute the weight as a function
3449 * of how sequential the workload is. Note that the weight
3450 * cannot reach 9, because bfqd->sequential_samples cannot
3451 * become equal to bfqd->peak_rate_samples, which, in its
3452 * turn, holds true because bfqd->sequential_samples is not
3453 * incremented for the first sample.
3455 weight = (9 * bfqd->sequential_samples) / bfqd->peak_rate_samples;
3458 * Second step: further refine the weight as a function of the
3459 * duration of the observation interval.
3461 weight = min_t(u32, 8,
3462 div_u64(weight * bfqd->delta_from_first,
3463 BFQ_RATE_REF_INTERVAL));
3466 * Divisor ranging from 10, for minimum weight, to 2, for
3469 divisor = 10 - weight;
3472 * Finally, update peak rate:
3474 * peak_rate = peak_rate * (divisor-1) / divisor + rate / divisor
3476 bfqd->peak_rate *= divisor-1;
3477 bfqd->peak_rate /= divisor;
3478 rate /= divisor; /* smoothing constant alpha = 1/divisor */
3480 bfqd->peak_rate += rate;
3483 * For a very slow device, bfqd->peak_rate can reach 0 (see
3484 * the minimum representable values reported in the comments
3485 * on BFQ_RATE_SHIFT). Push to 1 if this happens, to avoid
3486 * divisions by zero where bfqd->peak_rate is used as a
3489 bfqd->peak_rate = max_t(u32, 1, bfqd->peak_rate);
3491 update_thr_responsiveness_params(bfqd);
3494 bfq_reset_rate_computation(bfqd, rq);
3498 * Update the read/write peak rate (the main quantity used for
3499 * auto-tuning, see update_thr_responsiveness_params()).
3501 * It is not trivial to estimate the peak rate (correctly): because of
3502 * the presence of sw and hw queues between the scheduler and the
3503 * device components that finally serve I/O requests, it is hard to
3504 * say exactly when a given dispatched request is served inside the
3505 * device, and for how long. As a consequence, it is hard to know
3506 * precisely at what rate a given set of requests is actually served
3509 * On the opposite end, the dispatch time of any request is trivially
3510 * available, and, from this piece of information, the "dispatch rate"
3511 * of requests can be immediately computed. So, the idea in the next
3512 * function is to use what is known, namely request dispatch times
3513 * (plus, when useful, request completion times), to estimate what is
3514 * unknown, namely in-device request service rate.
3516 * The main issue is that, because of the above facts, the rate at
3517 * which a certain set of requests is dispatched over a certain time
3518 * interval can vary greatly with respect to the rate at which the
3519 * same requests are then served. But, since the size of any
3520 * intermediate queue is limited, and the service scheme is lossless
3521 * (no request is silently dropped), the following obvious convergence
3522 * property holds: the number of requests dispatched MUST become
3523 * closer and closer to the number of requests completed as the
3524 * observation interval grows. This is the key property used in
3525 * the next function to estimate the peak service rate as a function
3526 * of the observed dispatch rate. The function assumes to be invoked
3527 * on every request dispatch.
3529 static void bfq_update_peak_rate(struct bfq_data *bfqd, struct request *rq)
3531 u64 now_ns = ktime_get_ns();
3533 if (bfqd->peak_rate_samples == 0) { /* first dispatch */
3534 bfq_log(bfqd, "update_peak_rate: goto reset, samples %d",
3535 bfqd->peak_rate_samples);
3536 bfq_reset_rate_computation(bfqd, rq);
3537 goto update_last_values; /* will add one sample */
3541 * Device idle for very long: the observation interval lasting
3542 * up to this dispatch cannot be a valid observation interval
3543 * for computing a new peak rate (similarly to the late-
3544 * completion event in bfq_completed_request()). Go to
3545 * update_rate_and_reset to have the following three steps
3547 * - close the observation interval at the last (previous)
3548 * request dispatch or completion
3549 * - compute rate, if possible, for that observation interval
3550 * - start a new observation interval with this dispatch
3552 if (now_ns - bfqd->last_dispatch > 100*NSEC_PER_MSEC &&
3553 bfqd->rq_in_driver == 0)
3554 goto update_rate_and_reset;
3556 /* Update sampling information */
3557 bfqd->peak_rate_samples++;
3559 if ((bfqd->rq_in_driver > 0 ||
3560 now_ns - bfqd->last_completion < BFQ_MIN_TT)
3561 && !BFQ_RQ_SEEKY(bfqd, bfqd->last_position, rq))
3562 bfqd->sequential_samples++;
3564 bfqd->tot_sectors_dispatched += blk_rq_sectors(rq);
3566 /* Reset max observed rq size every 32 dispatches */
3567 if (likely(bfqd->peak_rate_samples % 32))
3568 bfqd->last_rq_max_size =
3569 max_t(u32, blk_rq_sectors(rq), bfqd->last_rq_max_size);
3571 bfqd->last_rq_max_size = blk_rq_sectors(rq);
3573 bfqd->delta_from_first = now_ns - bfqd->first_dispatch;
3575 /* Target observation interval not yet reached, go on sampling */
3576 if (bfqd->delta_from_first < BFQ_RATE_REF_INTERVAL)
3577 goto update_last_values;
3579 update_rate_and_reset:
3580 bfq_update_rate_reset(bfqd, rq);
3582 bfqd->last_position = blk_rq_pos(rq) + blk_rq_sectors(rq);
3583 if (RQ_BFQQ(rq) == bfqd->in_service_queue)
3584 bfqd->in_serv_last_pos = bfqd->last_position;
3585 bfqd->last_dispatch = now_ns;
3589 * Remove request from internal lists.
3591 static void bfq_dispatch_remove(struct request_queue *q, struct request *rq)
3593 struct bfq_queue *bfqq = RQ_BFQQ(rq);
3596 * For consistency, the next instruction should have been
3597 * executed after removing the request from the queue and
3598 * dispatching it. We execute instead this instruction before
3599 * bfq_remove_request() (and hence introduce a temporary
3600 * inconsistency), for efficiency. In fact, should this
3601 * dispatch occur for a non in-service bfqq, this anticipated
3602 * increment prevents two counters related to bfqq->dispatched
3603 * from risking to be, first, uselessly decremented, and then
3604 * incremented again when the (new) value of bfqq->dispatched
3605 * happens to be taken into account.
3608 bfq_update_peak_rate(q->elevator->elevator_data, rq);
3610 bfq_remove_request(q, rq);
3614 * There is a case where idling does not have to be performed for
3615 * throughput concerns, but to preserve the throughput share of
3616 * the process associated with bfqq.
3618 * To introduce this case, we can note that allowing the drive
3619 * to enqueue more than one request at a time, and hence
3620 * delegating de facto final scheduling decisions to the
3621 * drive's internal scheduler, entails loss of control on the
3622 * actual request service order. In particular, the critical
3623 * situation is when requests from different processes happen
3624 * to be present, at the same time, in the internal queue(s)
3625 * of the drive. In such a situation, the drive, by deciding
3626 * the service order of the internally-queued requests, does
3627 * determine also the actual throughput distribution among
3628 * these processes. But the drive typically has no notion or
3629 * concern about per-process throughput distribution, and
3630 * makes its decisions only on a per-request basis. Therefore,
3631 * the service distribution enforced by the drive's internal
3632 * scheduler is likely to coincide with the desired throughput
3633 * distribution only in a completely symmetric, or favorably
3634 * skewed scenario where:
3635 * (i-a) each of these processes must get the same throughput as
3637 * (i-b) in case (i-a) does not hold, it holds that the process
3638 * associated with bfqq must receive a lower or equal
3639 * throughput than any of the other processes;
3640 * (ii) the I/O of each process has the same properties, in
3641 * terms of locality (sequential or random), direction
3642 * (reads or writes), request sizes, greediness
3643 * (from I/O-bound to sporadic), and so on;
3645 * In fact, in such a scenario, the drive tends to treat the requests
3646 * of each process in about the same way as the requests of the
3647 * others, and thus to provide each of these processes with about the
3648 * same throughput. This is exactly the desired throughput
3649 * distribution if (i-a) holds, or, if (i-b) holds instead, this is an
3650 * even more convenient distribution for (the process associated with)
3653 * In contrast, in any asymmetric or unfavorable scenario, device
3654 * idling (I/O-dispatch plugging) is certainly needed to guarantee
3655 * that bfqq receives its assigned fraction of the device throughput
3656 * (see [1] for details).
3658 * The problem is that idling may significantly reduce throughput with
3659 * certain combinations of types of I/O and devices. An important
3660 * example is sync random I/O on flash storage with command
3661 * queueing. So, unless bfqq falls in cases where idling also boosts
3662 * throughput, it is important to check conditions (i-a), i(-b) and
3663 * (ii) accurately, so as to avoid idling when not strictly needed for
3664 * service guarantees.
3666 * Unfortunately, it is extremely difficult to thoroughly check
3667 * condition (ii). And, in case there are active groups, it becomes
3668 * very difficult to check conditions (i-a) and (i-b) too. In fact,
3669 * if there are active groups, then, for conditions (i-a) or (i-b) to
3670 * become false 'indirectly', it is enough that an active group
3671 * contains more active processes or sub-groups than some other active
3672 * group. More precisely, for conditions (i-a) or (i-b) to become
3673 * false because of such a group, it is not even necessary that the
3674 * group is (still) active: it is sufficient that, even if the group
3675 * has become inactive, some of its descendant processes still have
3676 * some request already dispatched but still waiting for
3677 * completion. In fact, requests have still to be guaranteed their
3678 * share of the throughput even after being dispatched. In this
3679 * respect, it is easy to show that, if a group frequently becomes
3680 * inactive while still having in-flight requests, and if, when this
3681 * happens, the group is not considered in the calculation of whether
3682 * the scenario is asymmetric, then the group may fail to be
3683 * guaranteed its fair share of the throughput (basically because
3684 * idling may not be performed for the descendant processes of the
3685 * group, but it had to be). We address this issue with the following
3686 * bi-modal behavior, implemented in the function
3687 * bfq_asymmetric_scenario().
3689 * If there are groups with requests waiting for completion
3690 * (as commented above, some of these groups may even be
3691 * already inactive), then the scenario is tagged as
3692 * asymmetric, conservatively, without checking any of the
3693 * conditions (i-a), (i-b) or (ii). So the device is idled for bfqq.
3694 * This behavior matches also the fact that groups are created
3695 * exactly if controlling I/O is a primary concern (to
3696 * preserve bandwidth and latency guarantees).
3698 * On the opposite end, if there are no groups with requests waiting
3699 * for completion, then only conditions (i-a) and (i-b) are actually
3700 * controlled, i.e., provided that conditions (i-a) or (i-b) holds,
3701 * idling is not performed, regardless of whether condition (ii)
3702 * holds. In other words, only if conditions (i-a) and (i-b) do not
3703 * hold, then idling is allowed, and the device tends to be prevented
3704 * from queueing many requests, possibly of several processes. Since
3705 * there are no groups with requests waiting for completion, then, to
3706 * control conditions (i-a) and (i-b) it is enough to check just
3707 * whether all the queues with requests waiting for completion also
3708 * have the same weight.
3710 * Not checking condition (ii) evidently exposes bfqq to the
3711 * risk of getting less throughput than its fair share.
3712 * However, for queues with the same weight, a further
3713 * mechanism, preemption, mitigates or even eliminates this
3714 * problem. And it does so without consequences on overall
3715 * throughput. This mechanism and its benefits are explained
3716 * in the next three paragraphs.
3718 * Even if a queue, say Q, is expired when it remains idle, Q
3719 * can still preempt the new in-service queue if the next
3720 * request of Q arrives soon (see the comments on
3721 * bfq_bfqq_update_budg_for_activation). If all queues and
3722 * groups have the same weight, this form of preemption,
3723 * combined with the hole-recovery heuristic described in the
3724 * comments on function bfq_bfqq_update_budg_for_activation,
3725 * are enough to preserve a correct bandwidth distribution in
3726 * the mid term, even without idling. In fact, even if not
3727 * idling allows the internal queues of the device to contain
3728 * many requests, and thus to reorder requests, we can rather
3729 * safely assume that the internal scheduler still preserves a
3730 * minimum of mid-term fairness.
3732 * More precisely, this preemption-based, idleless approach
3733 * provides fairness in terms of IOPS, and not sectors per
3734 * second. This can be seen with a simple example. Suppose
3735 * that there are two queues with the same weight, but that
3736 * the first queue receives requests of 8 sectors, while the
3737 * second queue receives requests of 1024 sectors. In
3738 * addition, suppose that each of the two queues contains at
3739 * most one request at a time, which implies that each queue
3740 * always remains idle after it is served. Finally, after
3741 * remaining idle, each queue receives very quickly a new
3742 * request. It follows that the two queues are served
3743 * alternatively, preempting each other if needed. This
3744 * implies that, although both queues have the same weight,
3745 * the queue with large requests receives a service that is
3746 * 1024/8 times as high as the service received by the other
3749 * The motivation for using preemption instead of idling (for
3750 * queues with the same weight) is that, by not idling,
3751 * service guarantees are preserved (completely or at least in
3752 * part) without minimally sacrificing throughput. And, if
3753 * there is no active group, then the primary expectation for
3754 * this device is probably a high throughput.
3756 * We are now left only with explaining the two sub-conditions in the
3757 * additional compound condition that is checked below for deciding
3758 * whether the scenario is asymmetric. To explain the first
3759 * sub-condition, we need to add that the function
3760 * bfq_asymmetric_scenario checks the weights of only
3761 * non-weight-raised queues, for efficiency reasons (see comments on
3762 * bfq_weights_tree_add()). Then the fact that bfqq is weight-raised
3763 * is checked explicitly here. More precisely, the compound condition
3764 * below takes into account also the fact that, even if bfqq is being
3765 * weight-raised, the scenario is still symmetric if all queues with
3766 * requests waiting for completion happen to be
3767 * weight-raised. Actually, we should be even more precise here, and
3768 * differentiate between interactive weight raising and soft real-time
3771 * The second sub-condition checked in the compound condition is
3772 * whether there is a fair amount of already in-flight I/O not
3773 * belonging to bfqq. If so, I/O dispatching is to be plugged, for the
3774 * following reason. The drive may decide to serve in-flight
3775 * non-bfqq's I/O requests before bfqq's ones, thereby delaying the
3776 * arrival of new I/O requests for bfqq (recall that bfqq is sync). If
3777 * I/O-dispatching is not plugged, then, while bfqq remains empty, a
3778 * basically uncontrolled amount of I/O from other queues may be
3779 * dispatched too, possibly causing the service of bfqq's I/O to be
3780 * delayed even longer in the drive. This problem gets more and more
3781 * serious as the speed and the queue depth of the drive grow,
3782 * because, as these two quantities grow, the probability to find no
3783 * queue busy but many requests in flight grows too. By contrast,
3784 * plugging I/O dispatching minimizes the delay induced by already
3785 * in-flight I/O, and enables bfqq to recover the bandwidth it may
3786 * lose because of this delay.
3788 * As a side note, it is worth considering that the above
3789 * device-idling countermeasures may however fail in the following
3790 * unlucky scenario: if I/O-dispatch plugging is (correctly) disabled
3791 * in a time period during which all symmetry sub-conditions hold, and
3792 * therefore the device is allowed to enqueue many requests, but at
3793 * some later point in time some sub-condition stops to hold, then it
3794 * may become impossible to make requests be served in the desired
3795 * order until all the requests already queued in the device have been
3796 * served. The last sub-condition commented above somewhat mitigates
3797 * this problem for weight-raised queues.
3799 * However, as an additional mitigation for this problem, we preserve
3800 * plugging for a special symmetric case that may suddenly turn into
3801 * asymmetric: the case where only bfqq is busy. In this case, not
3802 * expiring bfqq does not cause any harm to any other queues in terms
3803 * of service guarantees. In contrast, it avoids the following unlucky
3804 * sequence of events: (1) bfqq is expired, (2) a new queue with a
3805 * lower weight than bfqq becomes busy (or more queues), (3) the new
3806 * queue is served until a new request arrives for bfqq, (4) when bfqq
3807 * is finally served, there are so many requests of the new queue in
3808 * the drive that the pending requests for bfqq take a lot of time to
3809 * be served. In particular, event (2) may case even already
3810 * dispatched requests of bfqq to be delayed, inside the drive. So, to
3811 * avoid this series of events, the scenario is preventively declared
3812 * as asymmetric also if bfqq is the only busy queues
3814 static bool idling_needed_for_service_guarantees(struct bfq_data *bfqd,
3815 struct bfq_queue *bfqq)
3817 int tot_busy_queues = bfq_tot_busy_queues(bfqd);
3819 /* No point in idling for bfqq if it won't get requests any longer */
3820 if (unlikely(!bfqq_process_refs(bfqq)))
3823 return (bfqq->wr_coeff > 1 &&
3824 (bfqd->wr_busy_queues <
3826 bfqd->rq_in_driver >=
3827 bfqq->dispatched + 4)) ||
3828 bfq_asymmetric_scenario(bfqd, bfqq) ||
3829 tot_busy_queues == 1;
3832 static bool __bfq_bfqq_expire(struct bfq_data *bfqd, struct bfq_queue *bfqq,
3833 enum bfqq_expiration reason)
3836 * If this bfqq is shared between multiple processes, check
3837 * to make sure that those processes are still issuing I/Os
3838 * within the mean seek distance. If not, it may be time to
3839 * break the queues apart again.
3841 if (bfq_bfqq_coop(bfqq) && BFQQ_SEEKY(bfqq))
3842 bfq_mark_bfqq_split_coop(bfqq);
3845 * Consider queues with a higher finish virtual time than
3846 * bfqq. If idling_needed_for_service_guarantees(bfqq) returns
3847 * true, then bfqq's bandwidth would be violated if an
3848 * uncontrolled amount of I/O from these queues were
3849 * dispatched while bfqq is waiting for its new I/O to
3850 * arrive. This is exactly what may happen if this is a forced
3851 * expiration caused by a preemption attempt, and if bfqq is
3852 * not re-scheduled. To prevent this from happening, re-queue
3853 * bfqq if it needs I/O-dispatch plugging, even if it is
3854 * empty. By doing so, bfqq is granted to be served before the
3855 * above queues (provided that bfqq is of course eligible).
3857 if (RB_EMPTY_ROOT(&bfqq->sort_list) &&
3858 !(reason == BFQQE_PREEMPTED &&
3859 idling_needed_for_service_guarantees(bfqd, bfqq))) {
3860 if (bfqq->dispatched == 0)
3862 * Overloading budget_timeout field to store
3863 * the time at which the queue remains with no
3864 * backlog and no outstanding request; used by
3865 * the weight-raising mechanism.
3867 bfqq->budget_timeout = jiffies;
3869 bfq_del_bfqq_busy(bfqq, true);
3871 bfq_requeue_bfqq(bfqd, bfqq, true);
3873 * Resort priority tree of potential close cooperators.
3874 * See comments on bfq_pos_tree_add_move() for the unlikely().
3876 if (unlikely(!bfqd->nonrot_with_queueing &&
3877 !RB_EMPTY_ROOT(&bfqq->sort_list)))
3878 bfq_pos_tree_add_move(bfqd, bfqq);
3882 * All in-service entities must have been properly deactivated
3883 * or requeued before executing the next function, which
3884 * resets all in-service entities as no more in service. This
3885 * may cause bfqq to be freed. If this happens, the next
3886 * function returns true.
3888 return __bfq_bfqd_reset_in_service(bfqd);
3892 * __bfq_bfqq_recalc_budget - try to adapt the budget to the @bfqq behavior.
3893 * @bfqd: device data.
3894 * @bfqq: queue to update.
3895 * @reason: reason for expiration.
3897 * Handle the feedback on @bfqq budget at queue expiration.
3898 * See the body for detailed comments.
3900 static void __bfq_bfqq_recalc_budget(struct bfq_data *bfqd,
3901 struct bfq_queue *bfqq,
3902 enum bfqq_expiration reason)
3904 struct request *next_rq;
3905 int budget, min_budget;
3907 min_budget = bfq_min_budget(bfqd);
3909 if (bfqq->wr_coeff == 1)
3910 budget = bfqq->max_budget;
3912 * Use a constant, low budget for weight-raised queues,
3913 * to help achieve a low latency. Keep it slightly higher
3914 * than the minimum possible budget, to cause a little
3915 * bit fewer expirations.
3917 budget = 2 * min_budget;
3919 bfq_log_bfqq(bfqd, bfqq, "recalc_budg: last budg %d, budg left %d",
3920 bfqq->entity.budget, bfq_bfqq_budget_left(bfqq));
3921 bfq_log_bfqq(bfqd, bfqq, "recalc_budg: last max_budg %d, min budg %d",
3922 budget, bfq_min_budget(bfqd));
3923 bfq_log_bfqq(bfqd, bfqq, "recalc_budg: sync %d, seeky %d",
3924 bfq_bfqq_sync(bfqq), BFQQ_SEEKY(bfqd->in_service_queue));
3926 if (bfq_bfqq_sync(bfqq) && bfqq->wr_coeff == 1) {
3929 * Caveat: in all the following cases we trade latency
3932 case BFQQE_TOO_IDLE:
3934 * This is the only case where we may reduce
3935 * the budget: if there is no request of the
3936 * process still waiting for completion, then
3937 * we assume (tentatively) that the timer has
3938 * expired because the batch of requests of
3939 * the process could have been served with a
3940 * smaller budget. Hence, betting that
3941 * process will behave in the same way when it
3942 * becomes backlogged again, we reduce its
3943 * next budget. As long as we guess right,
3944 * this budget cut reduces the latency
3945 * experienced by the process.
3947 * However, if there are still outstanding
3948 * requests, then the process may have not yet
3949 * issued its next request just because it is
3950 * still waiting for the completion of some of
3951 * the still outstanding ones. So in this
3952 * subcase we do not reduce its budget, on the
3953 * contrary we increase it to possibly boost
3954 * the throughput, as discussed in the
3955 * comments to the BUDGET_TIMEOUT case.
3957 if (bfqq->dispatched > 0) /* still outstanding reqs */
3958 budget = min(budget * 2, bfqd->bfq_max_budget);
3960 if (budget > 5 * min_budget)
3961 budget -= 4 * min_budget;
3963 budget = min_budget;
3966 case BFQQE_BUDGET_TIMEOUT:
3968 * We double the budget here because it gives
3969 * the chance to boost the throughput if this
3970 * is not a seeky process (and has bumped into
3971 * this timeout because of, e.g., ZBR).
3973 budget = min(budget * 2, bfqd->bfq_max_budget);
3975 case BFQQE_BUDGET_EXHAUSTED:
3977 * The process still has backlog, and did not
3978 * let either the budget timeout or the disk
3979 * idling timeout expire. Hence it is not
3980 * seeky, has a short thinktime and may be
3981 * happy with a higher budget too. So
3982 * definitely increase the budget of this good
3983 * candidate to boost the disk throughput.
3985 budget = min(budget * 4, bfqd->bfq_max_budget);
3987 case BFQQE_NO_MORE_REQUESTS:
3989 * For queues that expire for this reason, it
3990 * is particularly important to keep the
3991 * budget close to the actual service they
3992 * need. Doing so reduces the timestamp
3993 * misalignment problem described in the
3994 * comments in the body of
3995 * __bfq_activate_entity. In fact, suppose
3996 * that a queue systematically expires for
3997 * BFQQE_NO_MORE_REQUESTS and presents a
3998 * new request in time to enjoy timestamp
3999 * back-shifting. The larger the budget of the
4000 * queue is with respect to the service the
4001 * queue actually requests in each service
4002 * slot, the more times the queue can be
4003 * reactivated with the same virtual finish
4004 * time. It follows that, even if this finish
4005 * time is pushed to the system virtual time
4006 * to reduce the consequent timestamp
4007 * misalignment, the queue unjustly enjoys for
4008 * many re-activations a lower finish time
4009 * than all newly activated queues.
4011 * The service needed by bfqq is measured
4012 * quite precisely by bfqq->entity.service.
4013 * Since bfqq does not enjoy device idling,
4014 * bfqq->entity.service is equal to the number
4015 * of sectors that the process associated with
4016 * bfqq requested to read/write before waiting
4017 * for request completions, or blocking for
4020 budget = max_t(int, bfqq->entity.service, min_budget);
4025 } else if (!bfq_bfqq_sync(bfqq)) {
4027 * Async queues get always the maximum possible
4028 * budget, as for them we do not care about latency
4029 * (in addition, their ability to dispatch is limited
4030 * by the charging factor).
4032 budget = bfqd->bfq_max_budget;
4035 bfqq->max_budget = budget;
4037 if (bfqd->budgets_assigned >= bfq_stats_min_budgets &&
4038 !bfqd->bfq_user_max_budget)
4039 bfqq->max_budget = min(bfqq->max_budget, bfqd->bfq_max_budget);
4042 * If there is still backlog, then assign a new budget, making
4043 * sure that it is large enough for the next request. Since
4044 * the finish time of bfqq must be kept in sync with the
4045 * budget, be sure to call __bfq_bfqq_expire() *after* this
4048 * If there is no backlog, then no need to update the budget;
4049 * it will be updated on the arrival of a new request.
4051 next_rq = bfqq->next_rq;
4053 bfqq->entity.budget = max_t(unsigned long, bfqq->max_budget,
4054 bfq_serv_to_charge(next_rq, bfqq));
4056 bfq_log_bfqq(bfqd, bfqq, "head sect: %u, new budget %d",
4057 next_rq ? blk_rq_sectors(next_rq) : 0,
4058 bfqq->entity.budget);
4062 * Return true if the process associated with bfqq is "slow". The slow
4063 * flag is used, in addition to the budget timeout, to reduce the
4064 * amount of service provided to seeky processes, and thus reduce
4065 * their chances to lower the throughput. More details in the comments
4066 * on the function bfq_bfqq_expire().
4068 * An important observation is in order: as discussed in the comments
4069 * on the function bfq_update_peak_rate(), with devices with internal
4070 * queues, it is hard if ever possible to know when and for how long
4071 * an I/O request is processed by the device (apart from the trivial
4072 * I/O pattern where a new request is dispatched only after the
4073 * previous one has been completed). This makes it hard to evaluate
4074 * the real rate at which the I/O requests of each bfq_queue are
4075 * served. In fact, for an I/O scheduler like BFQ, serving a
4076 * bfq_queue means just dispatching its requests during its service
4077 * slot (i.e., until the budget of the queue is exhausted, or the
4078 * queue remains idle, or, finally, a timeout fires). But, during the
4079 * service slot of a bfq_queue, around 100 ms at most, the device may
4080 * be even still processing requests of bfq_queues served in previous
4081 * service slots. On the opposite end, the requests of the in-service
4082 * bfq_queue may be completed after the service slot of the queue
4085 * Anyway, unless more sophisticated solutions are used
4086 * (where possible), the sum of the sizes of the requests dispatched
4087 * during the service slot of a bfq_queue is probably the only
4088 * approximation available for the service received by the bfq_queue
4089 * during its service slot. And this sum is the quantity used in this
4090 * function to evaluate the I/O speed of a process.
4092 static bool bfq_bfqq_is_slow(struct bfq_data *bfqd, struct bfq_queue *bfqq,
4093 bool compensate, enum bfqq_expiration reason,
4094 unsigned long *delta_ms)
4096 ktime_t delta_ktime;
4098 bool slow = BFQQ_SEEKY(bfqq); /* if delta too short, use seekyness */
4100 if (!bfq_bfqq_sync(bfqq))
4104 delta_ktime = bfqd->last_idling_start;
4106 delta_ktime = ktime_get();
4107 delta_ktime = ktime_sub(delta_ktime, bfqd->last_budget_start);
4108 delta_usecs = ktime_to_us(delta_ktime);
4110 /* don't use too short time intervals */
4111 if (delta_usecs < 1000) {
4112 if (blk_queue_nonrot(bfqd->queue))
4114 * give same worst-case guarantees as idling
4117 *delta_ms = BFQ_MIN_TT / NSEC_PER_MSEC;
4118 else /* charge at least one seek */
4119 *delta_ms = bfq_slice_idle / NSEC_PER_MSEC;
4124 *delta_ms = delta_usecs / USEC_PER_MSEC;
4127 * Use only long (> 20ms) intervals to filter out excessive
4128 * spikes in service rate estimation.
4130 if (delta_usecs > 20000) {
4132 * Caveat for rotational devices: processes doing I/O
4133 * in the slower disk zones tend to be slow(er) even
4134 * if not seeky. In this respect, the estimated peak
4135 * rate is likely to be an average over the disk
4136 * surface. Accordingly, to not be too harsh with
4137 * unlucky processes, a process is deemed slow only if
4138 * its rate has been lower than half of the estimated
4141 slow = bfqq->entity.service < bfqd->bfq_max_budget / 2;
4144 bfq_log_bfqq(bfqd, bfqq, "bfq_bfqq_is_slow: slow %d", slow);
4150 * To be deemed as soft real-time, an application must meet two
4151 * requirements. First, the application must not require an average
4152 * bandwidth higher than the approximate bandwidth required to playback or
4153 * record a compressed high-definition video.
4154 * The next function is invoked on the completion of the last request of a
4155 * batch, to compute the next-start time instant, soft_rt_next_start, such
4156 * that, if the next request of the application does not arrive before
4157 * soft_rt_next_start, then the above requirement on the bandwidth is met.
4159 * The second requirement is that the request pattern of the application is
4160 * isochronous, i.e., that, after issuing a request or a batch of requests,
4161 * the application stops issuing new requests until all its pending requests
4162 * have been completed. After that, the application may issue a new batch,
4164 * For this reason the next function is invoked to compute
4165 * soft_rt_next_start only for applications that meet this requirement,
4166 * whereas soft_rt_next_start is set to infinity for applications that do
4169 * Unfortunately, even a greedy (i.e., I/O-bound) application may
4170 * happen to meet, occasionally or systematically, both the above
4171 * bandwidth and isochrony requirements. This may happen at least in
4172 * the following circumstances. First, if the CPU load is high. The
4173 * application may stop issuing requests while the CPUs are busy
4174 * serving other processes, then restart, then stop again for a while,
4175 * and so on. The other circumstances are related to the storage
4176 * device: the storage device is highly loaded or reaches a low-enough
4177 * throughput with the I/O of the application (e.g., because the I/O
4178 * is random and/or the device is slow). In all these cases, the
4179 * I/O of the application may be simply slowed down enough to meet
4180 * the bandwidth and isochrony requirements. To reduce the probability
4181 * that greedy applications are deemed as soft real-time in these
4182 * corner cases, a further rule is used in the computation of
4183 * soft_rt_next_start: the return value of this function is forced to
4184 * be higher than the maximum between the following two quantities.
4186 * (a) Current time plus: (1) the maximum time for which the arrival
4187 * of a request is waited for when a sync queue becomes idle,
4188 * namely bfqd->bfq_slice_idle, and (2) a few extra jiffies. We
4189 * postpone for a moment the reason for adding a few extra
4190 * jiffies; we get back to it after next item (b). Lower-bounding
4191 * the return value of this function with the current time plus
4192 * bfqd->bfq_slice_idle tends to filter out greedy applications,
4193 * because the latter issue their next request as soon as possible
4194 * after the last one has been completed. In contrast, a soft
4195 * real-time application spends some time processing data, after a
4196 * batch of its requests has been completed.
4198 * (b) Current value of bfqq->soft_rt_next_start. As pointed out
4199 * above, greedy applications may happen to meet both the
4200 * bandwidth and isochrony requirements under heavy CPU or
4201 * storage-device load. In more detail, in these scenarios, these
4202 * applications happen, only for limited time periods, to do I/O
4203 * slowly enough to meet all the requirements described so far,
4204 * including the filtering in above item (a). These slow-speed
4205 * time intervals are usually interspersed between other time
4206 * intervals during which these applications do I/O at a very high
4207 * speed. Fortunately, exactly because of the high speed of the
4208 * I/O in the high-speed intervals, the values returned by this
4209 * function happen to be so high, near the end of any such
4210 * high-speed interval, to be likely to fall *after* the end of
4211 * the low-speed time interval that follows. These high values are
4212 * stored in bfqq->soft_rt_next_start after each invocation of
4213 * this function. As a consequence, if the last value of
4214 * bfqq->soft_rt_next_start is constantly used to lower-bound the
4215 * next value that this function may return, then, from the very
4216 * beginning of a low-speed interval, bfqq->soft_rt_next_start is
4217 * likely to be constantly kept so high that any I/O request
4218 * issued during the low-speed interval is considered as arriving
4219 * to soon for the application to be deemed as soft
4220 * real-time. Then, in the high-speed interval that follows, the
4221 * application will not be deemed as soft real-time, just because
4222 * it will do I/O at a high speed. And so on.
4224 * Getting back to the filtering in item (a), in the following two
4225 * cases this filtering might be easily passed by a greedy
4226 * application, if the reference quantity was just
4227 * bfqd->bfq_slice_idle:
4228 * 1) HZ is so low that the duration of a jiffy is comparable to or
4229 * higher than bfqd->bfq_slice_idle. This happens, e.g., on slow
4230 * devices with HZ=100. The time granularity may be so coarse
4231 * that the approximation, in jiffies, of bfqd->bfq_slice_idle
4232 * is rather lower than the exact value.
4233 * 2) jiffies, instead of increasing at a constant rate, may stop increasing
4234 * for a while, then suddenly 'jump' by several units to recover the lost
4235 * increments. This seems to happen, e.g., inside virtual machines.
4236 * To address this issue, in the filtering in (a) we do not use as a
4237 * reference time interval just bfqd->bfq_slice_idle, but
4238 * bfqd->bfq_slice_idle plus a few jiffies. In particular, we add the
4239 * minimum number of jiffies for which the filter seems to be quite
4240 * precise also in embedded systems and KVM/QEMU virtual machines.
4242 static unsigned long bfq_bfqq_softrt_next_start(struct bfq_data *bfqd,
4243 struct bfq_queue *bfqq)
4245 return max3(bfqq->soft_rt_next_start,
4246 bfqq->last_idle_bklogged +
4247 HZ * bfqq->service_from_backlogged /
4248 bfqd->bfq_wr_max_softrt_rate,
4249 jiffies + nsecs_to_jiffies(bfqq->bfqd->bfq_slice_idle) + 4);
4253 * bfq_bfqq_expire - expire a queue.
4254 * @bfqd: device owning the queue.
4255 * @bfqq: the queue to expire.
4256 * @compensate: if true, compensate for the time spent idling.
4257 * @reason: the reason causing the expiration.
4259 * If the process associated with bfqq does slow I/O (e.g., because it
4260 * issues random requests), we charge bfqq with the time it has been
4261 * in service instead of the service it has received (see
4262 * bfq_bfqq_charge_time for details on how this goal is achieved). As
4263 * a consequence, bfqq will typically get higher timestamps upon
4264 * reactivation, and hence it will be rescheduled as if it had
4265 * received more service than what it has actually received. In the
4266 * end, bfqq receives less service in proportion to how slowly its
4267 * associated process consumes its budgets (and hence how seriously it
4268 * tends to lower the throughput). In addition, this time-charging
4269 * strategy guarantees time fairness among slow processes. In
4270 * contrast, if the process associated with bfqq is not slow, we
4271 * charge bfqq exactly with the service it has received.
4273 * Charging time to the first type of queues and the exact service to
4274 * the other has the effect of using the WF2Q+ policy to schedule the
4275 * former on a timeslice basis, without violating service domain
4276 * guarantees among the latter.
4278 void bfq_bfqq_expire(struct bfq_data *bfqd,
4279 struct bfq_queue *bfqq,
4281 enum bfqq_expiration reason)
4284 unsigned long delta = 0;
4285 struct bfq_entity *entity = &bfqq->entity;
4288 * Check whether the process is slow (see bfq_bfqq_is_slow).
4290 slow = bfq_bfqq_is_slow(bfqd, bfqq, compensate, reason, &delta);
4293 * As above explained, charge slow (typically seeky) and
4294 * timed-out queues with the time and not the service
4295 * received, to favor sequential workloads.
4297 * Processes doing I/O in the slower disk zones will tend to
4298 * be slow(er) even if not seeky. Therefore, since the
4299 * estimated peak rate is actually an average over the disk
4300 * surface, these processes may timeout just for bad luck. To
4301 * avoid punishing them, do not charge time to processes that
4302 * succeeded in consuming at least 2/3 of their budget. This
4303 * allows BFQ to preserve enough elasticity to still perform
4304 * bandwidth, and not time, distribution with little unlucky
4305 * or quasi-sequential processes.
4307 if (bfqq->wr_coeff == 1 &&
4309 (reason == BFQQE_BUDGET_TIMEOUT &&
4310 bfq_bfqq_budget_left(bfqq) >= entity->budget / 3)))
4311 bfq_bfqq_charge_time(bfqd, bfqq, delta);
4313 if (bfqd->low_latency && bfqq->wr_coeff == 1)
4314 bfqq->last_wr_start_finish = jiffies;
4316 if (bfqd->low_latency && bfqd->bfq_wr_max_softrt_rate > 0 &&
4317 RB_EMPTY_ROOT(&bfqq->sort_list)) {
4319 * If we get here, and there are no outstanding
4320 * requests, then the request pattern is isochronous
4321 * (see the comments on the function
4322 * bfq_bfqq_softrt_next_start()). Therefore we can
4323 * compute soft_rt_next_start.
4325 * If, instead, the queue still has outstanding
4326 * requests, then we have to wait for the completion
4327 * of all the outstanding requests to discover whether
4328 * the request pattern is actually isochronous.
4330 if (bfqq->dispatched == 0)
4331 bfqq->soft_rt_next_start =
4332 bfq_bfqq_softrt_next_start(bfqd, bfqq);
4333 else if (bfqq->dispatched > 0) {
4335 * Schedule an update of soft_rt_next_start to when
4336 * the task may be discovered to be isochronous.
4338 bfq_mark_bfqq_softrt_update(bfqq);
4342 bfq_log_bfqq(bfqd, bfqq,
4343 "expire (%d, slow %d, num_disp %d, short_ttime %d)", reason,
4344 slow, bfqq->dispatched, bfq_bfqq_has_short_ttime(bfqq));
4347 * bfqq expired, so no total service time needs to be computed
4348 * any longer: reset state machine for measuring total service
4351 bfqd->rqs_injected = bfqd->wait_dispatch = false;
4352 bfqd->waited_rq = NULL;
4355 * Increase, decrease or leave budget unchanged according to
4358 __bfq_bfqq_recalc_budget(bfqd, bfqq, reason);
4359 if (__bfq_bfqq_expire(bfqd, bfqq, reason))
4360 /* bfqq is gone, no more actions on it */
4363 /* mark bfqq as waiting a request only if a bic still points to it */
4364 if (!bfq_bfqq_busy(bfqq) &&
4365 reason != BFQQE_BUDGET_TIMEOUT &&
4366 reason != BFQQE_BUDGET_EXHAUSTED) {
4367 bfq_mark_bfqq_non_blocking_wait_rq(bfqq);
4369 * Not setting service to 0, because, if the next rq
4370 * arrives in time, the queue will go on receiving
4371 * service with this same budget (as if it never expired)
4374 entity->service = 0;
4377 * Reset the received-service counter for every parent entity.
4378 * Differently from what happens with bfqq->entity.service,
4379 * the resetting of this counter never needs to be postponed
4380 * for parent entities. In fact, in case bfqq may have a
4381 * chance to go on being served using the last, partially
4382 * consumed budget, bfqq->entity.service needs to be kept,
4383 * because if bfqq then actually goes on being served using
4384 * the same budget, the last value of bfqq->entity.service is
4385 * needed to properly decrement bfqq->entity.budget by the
4386 * portion already consumed. In contrast, it is not necessary
4387 * to keep entity->service for parent entities too, because
4388 * the bubble up of the new value of bfqq->entity.budget will
4389 * make sure that the budgets of parent entities are correct,
4390 * even in case bfqq and thus parent entities go on receiving
4391 * service with the same budget.
4393 entity = entity->parent;
4394 for_each_entity(entity)
4395 entity->service = 0;
4399 * Budget timeout is not implemented through a dedicated timer, but
4400 * just checked on request arrivals and completions, as well as on
4401 * idle timer expirations.
4403 static bool bfq_bfqq_budget_timeout(struct bfq_queue *bfqq)
4405 return time_is_before_eq_jiffies(bfqq->budget_timeout);
4409 * If we expire a queue that is actively waiting (i.e., with the
4410 * device idled) for the arrival of a new request, then we may incur
4411 * the timestamp misalignment problem described in the body of the
4412 * function __bfq_activate_entity. Hence we return true only if this
4413 * condition does not hold, or if the queue is slow enough to deserve
4414 * only to be kicked off for preserving a high throughput.
4416 static bool bfq_may_expire_for_budg_timeout(struct bfq_queue *bfqq)
4418 bfq_log_bfqq(bfqq->bfqd, bfqq,
4419 "may_budget_timeout: wait_request %d left %d timeout %d",
4420 bfq_bfqq_wait_request(bfqq),
4421 bfq_bfqq_budget_left(bfqq) >= bfqq->entity.budget / 3,
4422 bfq_bfqq_budget_timeout(bfqq));
4424 return (!bfq_bfqq_wait_request(bfqq) ||
4425 bfq_bfqq_budget_left(bfqq) >= bfqq->entity.budget / 3)
4427 bfq_bfqq_budget_timeout(bfqq);
4430 static bool idling_boosts_thr_without_issues(struct bfq_data *bfqd,
4431 struct bfq_queue *bfqq)
4433 bool rot_without_queueing =
4434 !blk_queue_nonrot(bfqd->queue) && !bfqd->hw_tag,
4435 bfqq_sequential_and_IO_bound,
4438 /* No point in idling for bfqq if it won't get requests any longer */
4439 if (unlikely(!bfqq_process_refs(bfqq)))
4442 bfqq_sequential_and_IO_bound = !BFQQ_SEEKY(bfqq) &&
4443 bfq_bfqq_IO_bound(bfqq) && bfq_bfqq_has_short_ttime(bfqq);
4446 * The next variable takes into account the cases where idling
4447 * boosts the throughput.
4449 * The value of the variable is computed considering, first, that
4450 * idling is virtually always beneficial for the throughput if:
4451 * (a) the device is not NCQ-capable and rotational, or
4452 * (b) regardless of the presence of NCQ, the device is rotational and
4453 * the request pattern for bfqq is I/O-bound and sequential, or
4454 * (c) regardless of whether it is rotational, the device is
4455 * not NCQ-capable and the request pattern for bfqq is
4456 * I/O-bound and sequential.
4458 * Secondly, and in contrast to the above item (b), idling an
4459 * NCQ-capable flash-based device would not boost the
4460 * throughput even with sequential I/O; rather it would lower
4461 * the throughput in proportion to how fast the device
4462 * is. Accordingly, the next variable is true if any of the
4463 * above conditions (a), (b) or (c) is true, and, in
4464 * particular, happens to be false if bfqd is an NCQ-capable
4465 * flash-based device.
4467 idling_boosts_thr = rot_without_queueing ||
4468 ((!blk_queue_nonrot(bfqd->queue) || !bfqd->hw_tag) &&
4469 bfqq_sequential_and_IO_bound);
4472 * The return value of this function is equal to that of
4473 * idling_boosts_thr, unless a special case holds. In this
4474 * special case, described below, idling may cause problems to
4475 * weight-raised queues.
4477 * When the request pool is saturated (e.g., in the presence
4478 * of write hogs), if the processes associated with
4479 * non-weight-raised queues ask for requests at a lower rate,
4480 * then processes associated with weight-raised queues have a
4481 * higher probability to get a request from the pool
4482 * immediately (or at least soon) when they need one. Thus
4483 * they have a higher probability to actually get a fraction
4484 * of the device throughput proportional to their high
4485 * weight. This is especially true with NCQ-capable drives,
4486 * which enqueue several requests in advance, and further
4487 * reorder internally-queued requests.
4489 * For this reason, we force to false the return value if
4490 * there are weight-raised busy queues. In this case, and if
4491 * bfqq is not weight-raised, this guarantees that the device
4492 * is not idled for bfqq (if, instead, bfqq is weight-raised,
4493 * then idling will be guaranteed by another variable, see
4494 * below). Combined with the timestamping rules of BFQ (see
4495 * [1] for details), this behavior causes bfqq, and hence any
4496 * sync non-weight-raised queue, to get a lower number of
4497 * requests served, and thus to ask for a lower number of
4498 * requests from the request pool, before the busy
4499 * weight-raised queues get served again. This often mitigates
4500 * starvation problems in the presence of heavy write
4501 * workloads and NCQ, thereby guaranteeing a higher
4502 * application and system responsiveness in these hostile
4505 return idling_boosts_thr &&
4506 bfqd->wr_busy_queues == 0;
4510 * For a queue that becomes empty, device idling is allowed only if
4511 * this function returns true for that queue. As a consequence, since
4512 * device idling plays a critical role for both throughput boosting
4513 * and service guarantees, the return value of this function plays a
4514 * critical role as well.
4516 * In a nutshell, this function returns true only if idling is
4517 * beneficial for throughput or, even if detrimental for throughput,
4518 * idling is however necessary to preserve service guarantees (low
4519 * latency, desired throughput distribution, ...). In particular, on
4520 * NCQ-capable devices, this function tries to return false, so as to
4521 * help keep the drives' internal queues full, whenever this helps the
4522 * device boost the throughput without causing any service-guarantee
4525 * Most of the issues taken into account to get the return value of
4526 * this function are not trivial. We discuss these issues in the two
4527 * functions providing the main pieces of information needed by this
4530 static bool bfq_better_to_idle(struct bfq_queue *bfqq)
4532 struct bfq_data *bfqd = bfqq->bfqd;
4533 bool idling_boosts_thr_with_no_issue, idling_needed_for_service_guar;
4535 /* No point in idling for bfqq if it won't get requests any longer */
4536 if (unlikely(!bfqq_process_refs(bfqq)))
4539 if (unlikely(bfqd->strict_guarantees))
4543 * Idling is performed only if slice_idle > 0. In addition, we
4546 * (b) bfqq is in the idle io prio class: in this case we do
4547 * not idle because we want to minimize the bandwidth that
4548 * queues in this class can steal to higher-priority queues
4550 if (bfqd->bfq_slice_idle == 0 || !bfq_bfqq_sync(bfqq) ||
4551 bfq_class_idle(bfqq))
4554 idling_boosts_thr_with_no_issue =
4555 idling_boosts_thr_without_issues(bfqd, bfqq);
4557 idling_needed_for_service_guar =
4558 idling_needed_for_service_guarantees(bfqd, bfqq);
4561 * We have now the two components we need to compute the
4562 * return value of the function, which is true only if idling
4563 * either boosts the throughput (without issues), or is
4564 * necessary to preserve service guarantees.
4566 return idling_boosts_thr_with_no_issue ||
4567 idling_needed_for_service_guar;
4571 * If the in-service queue is empty but the function bfq_better_to_idle
4572 * returns true, then:
4573 * 1) the queue must remain in service and cannot be expired, and
4574 * 2) the device must be idled to wait for the possible arrival of a new
4575 * request for the queue.
4576 * See the comments on the function bfq_better_to_idle for the reasons
4577 * why performing device idling is the best choice to boost the throughput
4578 * and preserve service guarantees when bfq_better_to_idle itself
4581 static bool bfq_bfqq_must_idle(struct bfq_queue *bfqq)
4583 return RB_EMPTY_ROOT(&bfqq->sort_list) && bfq_better_to_idle(bfqq);
4587 * This function chooses the queue from which to pick the next extra
4588 * I/O request to inject, if it finds a compatible queue. See the
4589 * comments on bfq_update_inject_limit() for details on the injection
4590 * mechanism, and for the definitions of the quantities mentioned
4593 static struct bfq_queue *
4594 bfq_choose_bfqq_for_injection(struct bfq_data *bfqd)
4596 struct bfq_queue *bfqq, *in_serv_bfqq = bfqd->in_service_queue;
4597 unsigned int limit = in_serv_bfqq->inject_limit;
4600 * - bfqq is not weight-raised and therefore does not carry
4601 * time-critical I/O,
4603 * - regardless of whether bfqq is weight-raised, bfqq has
4604 * however a long think time, during which it can absorb the
4605 * effect of an appropriate number of extra I/O requests
4606 * from other queues (see bfq_update_inject_limit for
4607 * details on the computation of this number);
4608 * then injection can be performed without restrictions.
4610 bool in_serv_always_inject = in_serv_bfqq->wr_coeff == 1 ||
4611 !bfq_bfqq_has_short_ttime(in_serv_bfqq);
4615 * - the baseline total service time could not be sampled yet,
4616 * so the inject limit happens to be still 0, and
4617 * - a lot of time has elapsed since the plugging of I/O
4618 * dispatching started, so drive speed is being wasted
4620 * then temporarily raise inject limit to one request.
4622 if (limit == 0 && in_serv_bfqq->last_serv_time_ns == 0 &&
4623 bfq_bfqq_wait_request(in_serv_bfqq) &&
4624 time_is_before_eq_jiffies(bfqd->last_idling_start_jiffies +
4625 bfqd->bfq_slice_idle)
4629 if (bfqd->rq_in_driver >= limit)
4633 * Linear search of the source queue for injection; but, with
4634 * a high probability, very few steps are needed to find a
4635 * candidate queue, i.e., a queue with enough budget left for
4636 * its next request. In fact:
4637 * - BFQ dynamically updates the budget of every queue so as
4638 * to accommodate the expected backlog of the queue;
4639 * - if a queue gets all its requests dispatched as injected
4640 * service, then the queue is removed from the active list
4641 * (and re-added only if it gets new requests, but then it
4642 * is assigned again enough budget for its new backlog).
4644 list_for_each_entry(bfqq, &bfqd->active_list, bfqq_list)
4645 if (!RB_EMPTY_ROOT(&bfqq->sort_list) &&
4646 (in_serv_always_inject || bfqq->wr_coeff > 1) &&
4647 bfq_serv_to_charge(bfqq->next_rq, bfqq) <=
4648 bfq_bfqq_budget_left(bfqq)) {
4650 * Allow for only one large in-flight request
4651 * on non-rotational devices, for the
4652 * following reason. On non-rotationl drives,
4653 * large requests take much longer than
4654 * smaller requests to be served. In addition,
4655 * the drive prefers to serve large requests
4656 * w.r.t. to small ones, if it can choose. So,
4657 * having more than one large requests queued
4658 * in the drive may easily make the next first
4659 * request of the in-service queue wait for so
4660 * long to break bfqq's service guarantees. On
4661 * the bright side, large requests let the
4662 * drive reach a very high throughput, even if
4663 * there is only one in-flight large request
4666 if (blk_queue_nonrot(bfqd->queue) &&
4667 blk_rq_sectors(bfqq->next_rq) >=
4668 BFQQ_SECT_THR_NONROT)
4669 limit = min_t(unsigned int, 1, limit);
4671 limit = in_serv_bfqq->inject_limit;
4673 if (bfqd->rq_in_driver < limit) {
4674 bfqd->rqs_injected = true;
4683 * Select a queue for service. If we have a current queue in service,
4684 * check whether to continue servicing it, or retrieve and set a new one.
4686 static struct bfq_queue *bfq_select_queue(struct bfq_data *bfqd)
4688 struct bfq_queue *bfqq;
4689 struct request *next_rq;
4690 enum bfqq_expiration reason = BFQQE_BUDGET_TIMEOUT;
4692 bfqq = bfqd->in_service_queue;
4696 bfq_log_bfqq(bfqd, bfqq, "select_queue: already in-service queue");
4699 * Do not expire bfqq for budget timeout if bfqq may be about
4700 * to enjoy device idling. The reason why, in this case, we
4701 * prevent bfqq from expiring is the same as in the comments
4702 * on the case where bfq_bfqq_must_idle() returns true, in
4703 * bfq_completed_request().
4705 if (bfq_may_expire_for_budg_timeout(bfqq) &&
4706 !bfq_bfqq_must_idle(bfqq))
4711 * This loop is rarely executed more than once. Even when it
4712 * happens, it is much more convenient to re-execute this loop
4713 * than to return NULL and trigger a new dispatch to get a
4716 next_rq = bfqq->next_rq;
4718 * If bfqq has requests queued and it has enough budget left to
4719 * serve them, keep the queue, otherwise expire it.
4722 if (bfq_serv_to_charge(next_rq, bfqq) >
4723 bfq_bfqq_budget_left(bfqq)) {
4725 * Expire the queue for budget exhaustion,
4726 * which makes sure that the next budget is
4727 * enough to serve the next request, even if
4728 * it comes from the fifo expired path.
4730 reason = BFQQE_BUDGET_EXHAUSTED;
4734 * The idle timer may be pending because we may
4735 * not disable disk idling even when a new request
4738 if (bfq_bfqq_wait_request(bfqq)) {
4740 * If we get here: 1) at least a new request
4741 * has arrived but we have not disabled the
4742 * timer because the request was too small,
4743 * 2) then the block layer has unplugged
4744 * the device, causing the dispatch to be
4747 * Since the device is unplugged, now the
4748 * requests are probably large enough to
4749 * provide a reasonable throughput.
4750 * So we disable idling.
4752 bfq_clear_bfqq_wait_request(bfqq);
4753 hrtimer_try_to_cancel(&bfqd->idle_slice_timer);
4760 * No requests pending. However, if the in-service queue is idling
4761 * for a new request, or has requests waiting for a completion and
4762 * may idle after their completion, then keep it anyway.
4764 * Yet, inject service from other queues if it boosts
4765 * throughput and is possible.
4767 if (bfq_bfqq_wait_request(bfqq) ||
4768 (bfqq->dispatched != 0 && bfq_better_to_idle(bfqq))) {
4769 struct bfq_queue *async_bfqq =
4770 bfqq->bic && bfqq->bic->bfqq[0] &&
4771 bfq_bfqq_busy(bfqq->bic->bfqq[0]) &&
4772 bfqq->bic->bfqq[0]->next_rq ?
4773 bfqq->bic->bfqq[0] : NULL;
4774 struct bfq_queue *blocked_bfqq =
4775 !hlist_empty(&bfqq->woken_list) ?
4776 container_of(bfqq->woken_list.first,
4782 * The next four mutually-exclusive ifs decide
4783 * whether to try injection, and choose the queue to
4784 * pick an I/O request from.
4786 * The first if checks whether the process associated
4787 * with bfqq has also async I/O pending. If so, it
4788 * injects such I/O unconditionally. Injecting async
4789 * I/O from the same process can cause no harm to the
4790 * process. On the contrary, it can only increase
4791 * bandwidth and reduce latency for the process.
4793 * The second if checks whether there happens to be a
4794 * non-empty waker queue for bfqq, i.e., a queue whose
4795 * I/O needs to be completed for bfqq to receive new
4796 * I/O. This happens, e.g., if bfqq is associated with
4797 * a process that does some sync. A sync generates
4798 * extra blocking I/O, which must be completed before
4799 * the process associated with bfqq can go on with its
4800 * I/O. If the I/O of the waker queue is not served,
4801 * then bfqq remains empty, and no I/O is dispatched,
4802 * until the idle timeout fires for bfqq. This is
4803 * likely to result in lower bandwidth and higher
4804 * latencies for bfqq, and in a severe loss of total
4805 * throughput. The best action to take is therefore to
4806 * serve the waker queue as soon as possible. So do it
4807 * (without relying on the third alternative below for
4808 * eventually serving waker_bfqq's I/O; see the last
4809 * paragraph for further details). This systematic
4810 * injection of I/O from the waker queue does not
4811 * cause any delay to bfqq's I/O. On the contrary,
4812 * next bfqq's I/O is brought forward dramatically,
4813 * for it is not blocked for milliseconds.
4815 * The third if checks whether there is a queue woken
4816 * by bfqq, and currently with pending I/O. Such a
4817 * woken queue does not steal bandwidth from bfqq,
4818 * because it remains soon without I/O if bfqq is not
4819 * served. So there is virtually no risk of loss of
4820 * bandwidth for bfqq if this woken queue has I/O
4821 * dispatched while bfqq is waiting for new I/O.
4823 * The fourth if checks whether bfqq is a queue for
4824 * which it is better to avoid injection. It is so if
4825 * bfqq delivers more throughput when served without
4826 * any further I/O from other queues in the middle, or
4827 * if the service times of bfqq's I/O requests both
4828 * count more than overall throughput, and may be
4829 * easily increased by injection (this happens if bfqq
4830 * has a short think time). If none of these
4831 * conditions holds, then a candidate queue for
4832 * injection is looked for through
4833 * bfq_choose_bfqq_for_injection(). Note that the
4834 * latter may return NULL (for example if the inject
4835 * limit for bfqq is currently 0).
4837 * NOTE: motivation for the second alternative
4839 * Thanks to the way the inject limit is updated in
4840 * bfq_update_has_short_ttime(), it is rather likely
4841 * that, if I/O is being plugged for bfqq and the
4842 * waker queue has pending I/O requests that are
4843 * blocking bfqq's I/O, then the fourth alternative
4844 * above lets the waker queue get served before the
4845 * I/O-plugging timeout fires. So one may deem the
4846 * second alternative superfluous. It is not, because
4847 * the fourth alternative may be way less effective in
4848 * case of a synchronization. For two main
4849 * reasons. First, throughput may be low because the
4850 * inject limit may be too low to guarantee the same
4851 * amount of injected I/O, from the waker queue or
4852 * other queues, that the second alternative
4853 * guarantees (the second alternative unconditionally
4854 * injects a pending I/O request of the waker queue
4855 * for each bfq_dispatch_request()). Second, with the
4856 * fourth alternative, the duration of the plugging,
4857 * i.e., the time before bfqq finally receives new I/O,
4858 * may not be minimized, because the waker queue may
4859 * happen to be served only after other queues.
4862 icq_to_bic(async_bfqq->next_rq->elv.icq) == bfqq->bic &&
4863 bfq_serv_to_charge(async_bfqq->next_rq, async_bfqq) <=
4864 bfq_bfqq_budget_left(async_bfqq))
4865 bfqq = bfqq->bic->bfqq[0];
4866 else if (bfqq->waker_bfqq &&
4867 bfq_bfqq_busy(bfqq->waker_bfqq) &&
4868 bfqq->waker_bfqq->next_rq &&
4869 bfq_serv_to_charge(bfqq->waker_bfqq->next_rq,
4870 bfqq->waker_bfqq) <=
4871 bfq_bfqq_budget_left(bfqq->waker_bfqq)
4873 bfqq = bfqq->waker_bfqq;
4874 else if (blocked_bfqq &&
4875 bfq_bfqq_busy(blocked_bfqq) &&
4876 blocked_bfqq->next_rq &&
4877 bfq_serv_to_charge(blocked_bfqq->next_rq,
4879 bfq_bfqq_budget_left(blocked_bfqq)
4881 bfqq = blocked_bfqq;
4882 else if (!idling_boosts_thr_without_issues(bfqd, bfqq) &&
4883 (bfqq->wr_coeff == 1 || bfqd->wr_busy_queues > 1 ||
4884 !bfq_bfqq_has_short_ttime(bfqq)))
4885 bfqq = bfq_choose_bfqq_for_injection(bfqd);
4892 reason = BFQQE_NO_MORE_REQUESTS;
4894 bfq_bfqq_expire(bfqd, bfqq, false, reason);
4896 bfqq = bfq_set_in_service_queue(bfqd);
4898 bfq_log_bfqq(bfqd, bfqq, "select_queue: checking new queue");
4903 bfq_log_bfqq(bfqd, bfqq, "select_queue: returned this queue");
4905 bfq_log(bfqd, "select_queue: no queue returned");
4910 static void bfq_update_wr_data(struct bfq_data *bfqd, struct bfq_queue *bfqq)
4912 struct bfq_entity *entity = &bfqq->entity;
4914 if (bfqq->wr_coeff > 1) { /* queue is being weight-raised */
4915 bfq_log_bfqq(bfqd, bfqq,
4916 "raising period dur %u/%u msec, old coeff %u, w %d(%d)",
4917 jiffies_to_msecs(jiffies - bfqq->last_wr_start_finish),
4918 jiffies_to_msecs(bfqq->wr_cur_max_time),
4920 bfqq->entity.weight, bfqq->entity.orig_weight);
4922 if (entity->prio_changed)
4923 bfq_log_bfqq(bfqd, bfqq, "WARN: pending prio change");
4926 * If the queue was activated in a burst, or too much
4927 * time has elapsed from the beginning of this
4928 * weight-raising period, then end weight raising.
4930 if (bfq_bfqq_in_large_burst(bfqq))
4931 bfq_bfqq_end_wr(bfqq);
4932 else if (time_is_before_jiffies(bfqq->last_wr_start_finish +
4933 bfqq->wr_cur_max_time)) {
4934 if (bfqq->wr_cur_max_time != bfqd->bfq_wr_rt_max_time ||
4935 time_is_before_jiffies(bfqq->wr_start_at_switch_to_srt +
4936 bfq_wr_duration(bfqd))) {
4938 * Either in interactive weight
4939 * raising, or in soft_rt weight
4941 * interactive-weight-raising period
4942 * elapsed (so no switch back to
4943 * interactive weight raising).
4945 bfq_bfqq_end_wr(bfqq);
4947 * soft_rt finishing while still in
4948 * interactive period, switch back to
4949 * interactive weight raising
4951 switch_back_to_interactive_wr(bfqq, bfqd);
4952 bfqq->entity.prio_changed = 1;
4955 if (bfqq->wr_coeff > 1 &&
4956 bfqq->wr_cur_max_time != bfqd->bfq_wr_rt_max_time &&
4957 bfqq->service_from_wr > max_service_from_wr) {
4958 /* see comments on max_service_from_wr */
4959 bfq_bfqq_end_wr(bfqq);
4963 * To improve latency (for this or other queues), immediately
4964 * update weight both if it must be raised and if it must be
4965 * lowered. Since, entity may be on some active tree here, and
4966 * might have a pending change of its ioprio class, invoke
4967 * next function with the last parameter unset (see the
4968 * comments on the function).
4970 if ((entity->weight > entity->orig_weight) != (bfqq->wr_coeff > 1))
4971 __bfq_entity_update_weight_prio(bfq_entity_service_tree(entity),
4976 * Dispatch next request from bfqq.
4978 static struct request *bfq_dispatch_rq_from_bfqq(struct bfq_data *bfqd,
4979 struct bfq_queue *bfqq)
4981 struct request *rq = bfqq->next_rq;
4982 unsigned long service_to_charge;
4984 service_to_charge = bfq_serv_to_charge(rq, bfqq);
4986 bfq_bfqq_served(bfqq, service_to_charge);
4988 if (bfqq == bfqd->in_service_queue && bfqd->wait_dispatch) {
4989 bfqd->wait_dispatch = false;
4990 bfqd->waited_rq = rq;
4993 bfq_dispatch_remove(bfqd->queue, rq);
4995 if (bfqq != bfqd->in_service_queue)
4999 * If weight raising has to terminate for bfqq, then next
5000 * function causes an immediate update of bfqq's weight,
5001 * without waiting for next activation. As a consequence, on
5002 * expiration, bfqq will be timestamped as if has never been
5003 * weight-raised during this service slot, even if it has
5004 * received part or even most of the service as a
5005 * weight-raised queue. This inflates bfqq's timestamps, which
5006 * is beneficial, as bfqq is then more willing to leave the
5007 * device immediately to possible other weight-raised queues.
5009 bfq_update_wr_data(bfqd, bfqq);
5012 * Expire bfqq, pretending that its budget expired, if bfqq
5013 * belongs to CLASS_IDLE and other queues are waiting for
5016 if (!(bfq_tot_busy_queues(bfqd) > 1 && bfq_class_idle(bfqq)))
5019 bfq_bfqq_expire(bfqd, bfqq, false, BFQQE_BUDGET_EXHAUSTED);
5025 static bool bfq_has_work(struct blk_mq_hw_ctx *hctx)
5027 struct bfq_data *bfqd = hctx->queue->elevator->elevator_data;
5030 * Avoiding lock: a race on bfqd->queued should cause at
5031 * most a call to dispatch for nothing
5033 return !list_empty_careful(&bfqd->dispatch) ||
5034 READ_ONCE(bfqd->queued);
5037 static struct request *__bfq_dispatch_request(struct blk_mq_hw_ctx *hctx)
5039 struct bfq_data *bfqd = hctx->queue->elevator->elevator_data;
5040 struct request *rq = NULL;
5041 struct bfq_queue *bfqq = NULL;
5043 if (!list_empty(&bfqd->dispatch)) {
5044 rq = list_first_entry(&bfqd->dispatch, struct request,
5046 list_del_init(&rq->queuelist);
5052 * Increment counters here, because this
5053 * dispatch does not follow the standard
5054 * dispatch flow (where counters are
5059 goto inc_in_driver_start_rq;
5063 * We exploit the bfq_finish_requeue_request hook to
5064 * decrement rq_in_driver, but
5065 * bfq_finish_requeue_request will not be invoked on
5066 * this request. So, to avoid unbalance, just start
5067 * this request, without incrementing rq_in_driver. As
5068 * a negative consequence, rq_in_driver is deceptively
5069 * lower than it should be while this request is in
5070 * service. This may cause bfq_schedule_dispatch to be
5071 * invoked uselessly.
5073 * As for implementing an exact solution, the
5074 * bfq_finish_requeue_request hook, if defined, is
5075 * probably invoked also on this request. So, by
5076 * exploiting this hook, we could 1) increment
5077 * rq_in_driver here, and 2) decrement it in
5078 * bfq_finish_requeue_request. Such a solution would
5079 * let the value of the counter be always accurate,
5080 * but it would entail using an extra interface
5081 * function. This cost seems higher than the benefit,
5082 * being the frequency of non-elevator-private
5083 * requests very low.
5088 bfq_log(bfqd, "dispatch requests: %d busy queues",
5089 bfq_tot_busy_queues(bfqd));
5091 if (bfq_tot_busy_queues(bfqd) == 0)
5095 * Force device to serve one request at a time if
5096 * strict_guarantees is true. Forcing this service scheme is
5097 * currently the ONLY way to guarantee that the request
5098 * service order enforced by the scheduler is respected by a
5099 * queueing device. Otherwise the device is free even to make
5100 * some unlucky request wait for as long as the device
5103 * Of course, serving one request at a time may cause loss of
5106 if (bfqd->strict_guarantees && bfqd->rq_in_driver > 0)
5109 bfqq = bfq_select_queue(bfqd);
5113 rq = bfq_dispatch_rq_from_bfqq(bfqd, bfqq);
5116 inc_in_driver_start_rq:
5117 bfqd->rq_in_driver++;
5119 rq->rq_flags |= RQF_STARTED;
5125 #ifdef CONFIG_BFQ_CGROUP_DEBUG
5126 static void bfq_update_dispatch_stats(struct request_queue *q,
5128 struct bfq_queue *in_serv_queue,
5129 bool idle_timer_disabled)
5131 struct bfq_queue *bfqq = rq ? RQ_BFQQ(rq) : NULL;
5133 if (!idle_timer_disabled && !bfqq)
5137 * rq and bfqq are guaranteed to exist until this function
5138 * ends, for the following reasons. First, rq can be
5139 * dispatched to the device, and then can be completed and
5140 * freed, only after this function ends. Second, rq cannot be
5141 * merged (and thus freed because of a merge) any longer,
5142 * because it has already started. Thus rq cannot be freed
5143 * before this function ends, and, since rq has a reference to
5144 * bfqq, the same guarantee holds for bfqq too.
5146 * In addition, the following queue lock guarantees that
5147 * bfqq_group(bfqq) exists as well.
5149 spin_lock_irq(&q->queue_lock);
5150 if (idle_timer_disabled)
5152 * Since the idle timer has been disabled,
5153 * in_serv_queue contained some request when
5154 * __bfq_dispatch_request was invoked above, which
5155 * implies that rq was picked exactly from
5156 * in_serv_queue. Thus in_serv_queue == bfqq, and is
5157 * therefore guaranteed to exist because of the above
5160 bfqg_stats_update_idle_time(bfqq_group(in_serv_queue));
5162 struct bfq_group *bfqg = bfqq_group(bfqq);
5164 bfqg_stats_update_avg_queue_size(bfqg);
5165 bfqg_stats_set_start_empty_time(bfqg);
5166 bfqg_stats_update_io_remove(bfqg, rq->cmd_flags);
5168 spin_unlock_irq(&q->queue_lock);
5171 static inline void bfq_update_dispatch_stats(struct request_queue *q,
5173 struct bfq_queue *in_serv_queue,
5174 bool idle_timer_disabled) {}
5175 #endif /* CONFIG_BFQ_CGROUP_DEBUG */
5177 static struct request *bfq_dispatch_request(struct blk_mq_hw_ctx *hctx)
5179 struct bfq_data *bfqd = hctx->queue->elevator->elevator_data;
5181 struct bfq_queue *in_serv_queue;
5182 bool waiting_rq, idle_timer_disabled = false;
5184 spin_lock_irq(&bfqd->lock);
5186 in_serv_queue = bfqd->in_service_queue;
5187 waiting_rq = in_serv_queue && bfq_bfqq_wait_request(in_serv_queue);
5189 rq = __bfq_dispatch_request(hctx);
5190 if (in_serv_queue == bfqd->in_service_queue) {
5191 idle_timer_disabled =
5192 waiting_rq && !bfq_bfqq_wait_request(in_serv_queue);
5195 spin_unlock_irq(&bfqd->lock);
5196 bfq_update_dispatch_stats(hctx->queue, rq,
5197 idle_timer_disabled ? in_serv_queue : NULL,
5198 idle_timer_disabled);
5204 * Task holds one reference to the queue, dropped when task exits. Each rq
5205 * in-flight on this queue also holds a reference, dropped when rq is freed.
5207 * Scheduler lock must be held here. Recall not to use bfqq after calling
5208 * this function on it.
5210 void bfq_put_queue(struct bfq_queue *bfqq)
5212 struct bfq_queue *item;
5213 struct hlist_node *n;
5214 struct bfq_group *bfqg = bfqq_group(bfqq);
5216 bfq_log_bfqq(bfqq->bfqd, bfqq, "put_queue: %p %d", bfqq, bfqq->ref);
5222 if (!hlist_unhashed(&bfqq->burst_list_node)) {
5223 hlist_del_init(&bfqq->burst_list_node);
5225 * Decrement also burst size after the removal, if the
5226 * process associated with bfqq is exiting, and thus
5227 * does not contribute to the burst any longer. This
5228 * decrement helps filter out false positives of large
5229 * bursts, when some short-lived process (often due to
5230 * the execution of commands by some service) happens
5231 * to start and exit while a complex application is
5232 * starting, and thus spawning several processes that
5233 * do I/O (and that *must not* be treated as a large
5234 * burst, see comments on bfq_handle_burst).
5236 * In particular, the decrement is performed only if:
5237 * 1) bfqq is not a merged queue, because, if it is,
5238 * then this free of bfqq is not triggered by the exit
5239 * of the process bfqq is associated with, but exactly
5240 * by the fact that bfqq has just been merged.
5241 * 2) burst_size is greater than 0, to handle
5242 * unbalanced decrements. Unbalanced decrements may
5243 * happen in te following case: bfqq is inserted into
5244 * the current burst list--without incrementing
5245 * bust_size--because of a split, but the current
5246 * burst list is not the burst list bfqq belonged to
5247 * (see comments on the case of a split in
5250 if (bfqq->bic && bfqq->bfqd->burst_size > 0)
5251 bfqq->bfqd->burst_size--;
5255 * bfqq does not exist any longer, so it cannot be woken by
5256 * any other queue, and cannot wake any other queue. Then bfqq
5257 * must be removed from the woken list of its possible waker
5258 * queue, and all queues in the woken list of bfqq must stop
5259 * having a waker queue. Strictly speaking, these updates
5260 * should be performed when bfqq remains with no I/O source
5261 * attached to it, which happens before bfqq gets freed. In
5262 * particular, this happens when the last process associated
5263 * with bfqq exits or gets associated with a different
5264 * queue. However, both events lead to bfqq being freed soon,
5265 * and dangling references would come out only after bfqq gets
5266 * freed. So these updates are done here, as a simple and safe
5267 * way to handle all cases.
5269 /* remove bfqq from woken list */
5270 if (!hlist_unhashed(&bfqq->woken_list_node))
5271 hlist_del_init(&bfqq->woken_list_node);
5273 /* reset waker for all queues in woken list */
5274 hlist_for_each_entry_safe(item, n, &bfqq->woken_list,
5276 item->waker_bfqq = NULL;
5277 hlist_del_init(&item->woken_list_node);
5280 if (bfqq->bfqd->last_completed_rq_bfqq == bfqq)
5281 bfqq->bfqd->last_completed_rq_bfqq = NULL;
5283 kmem_cache_free(bfq_pool, bfqq);
5284 bfqg_and_blkg_put(bfqg);
5287 static void bfq_put_stable_ref(struct bfq_queue *bfqq)
5290 bfq_put_queue(bfqq);
5293 void bfq_put_cooperator(struct bfq_queue *bfqq)
5295 struct bfq_queue *__bfqq, *next;
5298 * If this queue was scheduled to merge with another queue, be
5299 * sure to drop the reference taken on that queue (and others in
5300 * the merge chain). See bfq_setup_merge and bfq_merge_bfqqs.
5302 __bfqq = bfqq->new_bfqq;
5306 next = __bfqq->new_bfqq;
5307 bfq_put_queue(__bfqq);
5312 static void bfq_exit_bfqq(struct bfq_data *bfqd, struct bfq_queue *bfqq)
5314 if (bfqq == bfqd->in_service_queue) {
5315 __bfq_bfqq_expire(bfqd, bfqq, BFQQE_BUDGET_TIMEOUT);
5316 bfq_schedule_dispatch(bfqd);
5319 bfq_log_bfqq(bfqd, bfqq, "exit_bfqq: %p, %d", bfqq, bfqq->ref);
5321 bfq_put_cooperator(bfqq);
5323 bfq_release_process_ref(bfqd, bfqq);
5326 static void bfq_exit_icq_bfqq(struct bfq_io_cq *bic, bool is_sync)
5328 struct bfq_queue *bfqq = bic_to_bfqq(bic, is_sync);
5329 struct bfq_data *bfqd;
5332 bfqd = bfqq->bfqd; /* NULL if scheduler already exited */
5335 unsigned long flags;
5337 spin_lock_irqsave(&bfqd->lock, flags);
5339 bfq_exit_bfqq(bfqd, bfqq);
5340 bic_set_bfqq(bic, NULL, is_sync);
5341 spin_unlock_irqrestore(&bfqd->lock, flags);
5345 static void bfq_exit_icq(struct io_cq *icq)
5347 struct bfq_io_cq *bic = icq_to_bic(icq);
5349 if (bic->stable_merge_bfqq) {
5350 struct bfq_data *bfqd = bic->stable_merge_bfqq->bfqd;
5353 * bfqd is NULL if scheduler already exited, and in
5354 * that case this is the last time bfqq is accessed.
5357 unsigned long flags;
5359 spin_lock_irqsave(&bfqd->lock, flags);
5360 bfq_put_stable_ref(bic->stable_merge_bfqq);
5361 spin_unlock_irqrestore(&bfqd->lock, flags);
5363 bfq_put_stable_ref(bic->stable_merge_bfqq);
5367 bfq_exit_icq_bfqq(bic, true);
5368 bfq_exit_icq_bfqq(bic, false);
5372 * Update the entity prio values; note that the new values will not
5373 * be used until the next (re)activation.
5376 bfq_set_next_ioprio_data(struct bfq_queue *bfqq, struct bfq_io_cq *bic)
5378 struct task_struct *tsk = current;
5380 struct bfq_data *bfqd = bfqq->bfqd;
5385 ioprio_class = IOPRIO_PRIO_CLASS(bic->ioprio);
5386 switch (ioprio_class) {
5388 pr_err("bdi %s: bfq: bad prio class %d\n",
5389 bdi_dev_name(bfqq->bfqd->queue->disk->bdi),
5392 case IOPRIO_CLASS_NONE:
5394 * No prio set, inherit CPU scheduling settings.
5396 bfqq->new_ioprio = task_nice_ioprio(tsk);
5397 bfqq->new_ioprio_class = task_nice_ioclass(tsk);
5399 case IOPRIO_CLASS_RT:
5400 bfqq->new_ioprio = IOPRIO_PRIO_DATA(bic->ioprio);
5401 bfqq->new_ioprio_class = IOPRIO_CLASS_RT;
5403 case IOPRIO_CLASS_BE:
5404 bfqq->new_ioprio = IOPRIO_PRIO_DATA(bic->ioprio);
5405 bfqq->new_ioprio_class = IOPRIO_CLASS_BE;
5407 case IOPRIO_CLASS_IDLE:
5408 bfqq->new_ioprio_class = IOPRIO_CLASS_IDLE;
5409 bfqq->new_ioprio = 7;
5413 if (bfqq->new_ioprio >= IOPRIO_NR_LEVELS) {
5414 pr_crit("bfq_set_next_ioprio_data: new_ioprio %d\n",
5416 bfqq->new_ioprio = IOPRIO_NR_LEVELS - 1;
5419 bfqq->entity.new_weight = bfq_ioprio_to_weight(bfqq->new_ioprio);
5420 bfq_log_bfqq(bfqd, bfqq, "new_ioprio %d new_weight %d",
5421 bfqq->new_ioprio, bfqq->entity.new_weight);
5422 bfqq->entity.prio_changed = 1;
5425 static struct bfq_queue *bfq_get_queue(struct bfq_data *bfqd,
5426 struct bio *bio, bool is_sync,
5427 struct bfq_io_cq *bic,
5430 static void bfq_check_ioprio_change(struct bfq_io_cq *bic, struct bio *bio)
5432 struct bfq_data *bfqd = bic_to_bfqd(bic);
5433 struct bfq_queue *bfqq;
5434 int ioprio = bic->icq.ioc->ioprio;
5437 * This condition may trigger on a newly created bic, be sure to
5438 * drop the lock before returning.
5440 if (unlikely(!bfqd) || likely(bic->ioprio == ioprio))
5443 bic->ioprio = ioprio;
5445 bfqq = bic_to_bfqq(bic, false);
5447 bfq_release_process_ref(bfqd, bfqq);
5448 bfqq = bfq_get_queue(bfqd, bio, false, bic, true);
5449 bic_set_bfqq(bic, bfqq, false);
5452 bfqq = bic_to_bfqq(bic, true);
5454 bfq_set_next_ioprio_data(bfqq, bic);
5457 static void bfq_init_bfqq(struct bfq_data *bfqd, struct bfq_queue *bfqq,
5458 struct bfq_io_cq *bic, pid_t pid, int is_sync)
5460 u64 now_ns = ktime_get_ns();
5462 RB_CLEAR_NODE(&bfqq->entity.rb_node);
5463 INIT_LIST_HEAD(&bfqq->fifo);
5464 INIT_HLIST_NODE(&bfqq->burst_list_node);
5465 INIT_HLIST_NODE(&bfqq->woken_list_node);
5466 INIT_HLIST_HEAD(&bfqq->woken_list);
5472 bfq_set_next_ioprio_data(bfqq, bic);
5476 * No need to mark as has_short_ttime if in
5477 * idle_class, because no device idling is performed
5478 * for queues in idle class
5480 if (!bfq_class_idle(bfqq))
5481 /* tentatively mark as has_short_ttime */
5482 bfq_mark_bfqq_has_short_ttime(bfqq);
5483 bfq_mark_bfqq_sync(bfqq);
5484 bfq_mark_bfqq_just_created(bfqq);
5486 bfq_clear_bfqq_sync(bfqq);
5488 /* set end request to minus infinity from now */
5489 bfqq->ttime.last_end_request = now_ns + 1;
5491 bfqq->creation_time = jiffies;
5493 bfqq->io_start_time = now_ns;
5495 bfq_mark_bfqq_IO_bound(bfqq);
5499 /* Tentative initial value to trade off between thr and lat */
5500 bfqq->max_budget = (2 * bfq_max_budget(bfqd)) / 3;
5501 bfqq->budget_timeout = bfq_smallest_from_now();
5504 bfqq->last_wr_start_finish = jiffies;
5505 bfqq->wr_start_at_switch_to_srt = bfq_smallest_from_now();
5506 bfqq->split_time = bfq_smallest_from_now();
5509 * To not forget the possibly high bandwidth consumed by a
5510 * process/queue in the recent past,
5511 * bfq_bfqq_softrt_next_start() returns a value at least equal
5512 * to the current value of bfqq->soft_rt_next_start (see
5513 * comments on bfq_bfqq_softrt_next_start). Set
5514 * soft_rt_next_start to now, to mean that bfqq has consumed
5515 * no bandwidth so far.
5517 bfqq->soft_rt_next_start = jiffies;
5519 /* first request is almost certainly seeky */
5520 bfqq->seek_history = 1;
5523 static struct bfq_queue **bfq_async_queue_prio(struct bfq_data *bfqd,
5524 struct bfq_group *bfqg,
5525 int ioprio_class, int ioprio)
5527 switch (ioprio_class) {
5528 case IOPRIO_CLASS_RT:
5529 return &bfqg->async_bfqq[0][ioprio];
5530 case IOPRIO_CLASS_NONE:
5531 ioprio = IOPRIO_BE_NORM;
5533 case IOPRIO_CLASS_BE:
5534 return &bfqg->async_bfqq[1][ioprio];
5535 case IOPRIO_CLASS_IDLE:
5536 return &bfqg->async_idle_bfqq;
5542 static struct bfq_queue *
5543 bfq_do_early_stable_merge(struct bfq_data *bfqd, struct bfq_queue *bfqq,
5544 struct bfq_io_cq *bic,
5545 struct bfq_queue *last_bfqq_created)
5547 struct bfq_queue *new_bfqq =
5548 bfq_setup_merge(bfqq, last_bfqq_created);
5554 new_bfqq->bic->stably_merged = true;
5555 bic->stably_merged = true;
5558 * Reusing merge functions. This implies that
5559 * bfqq->bic must be set too, for
5560 * bfq_merge_bfqqs to correctly save bfqq's
5561 * state before killing it.
5564 bfq_merge_bfqqs(bfqd, bic, bfqq, new_bfqq);
5570 * Many throughput-sensitive workloads are made of several parallel
5571 * I/O flows, with all flows generated by the same application, or
5572 * more generically by the same task (e.g., system boot). The most
5573 * counterproductive action with these workloads is plugging I/O
5574 * dispatch when one of the bfq_queues associated with these flows
5575 * remains temporarily empty.
5577 * To avoid this plugging, BFQ has been using a burst-handling
5578 * mechanism for years now. This mechanism has proven effective for
5579 * throughput, and not detrimental for service guarantees. The
5580 * following function pushes this mechanism a little bit further,
5581 * basing on the following two facts.
5583 * First, all the I/O flows of a the same application or task
5584 * contribute to the execution/completion of that common application
5585 * or task. So the performance figures that matter are total
5586 * throughput of the flows and task-wide I/O latency. In particular,
5587 * these flows do not need to be protected from each other, in terms
5588 * of individual bandwidth or latency.
5590 * Second, the above fact holds regardless of the number of flows.
5592 * Putting these two facts together, this commits merges stably the
5593 * bfq_queues associated with these I/O flows, i.e., with the
5594 * processes that generate these IO/ flows, regardless of how many the
5595 * involved processes are.
5597 * To decide whether a set of bfq_queues is actually associated with
5598 * the I/O flows of a common application or task, and to merge these
5599 * queues stably, this function operates as follows: given a bfq_queue,
5600 * say Q2, currently being created, and the last bfq_queue, say Q1,
5601 * created before Q2, Q2 is merged stably with Q1 if
5602 * - very little time has elapsed since when Q1 was created
5603 * - Q2 has the same ioprio as Q1
5604 * - Q2 belongs to the same group as Q1
5606 * Merging bfq_queues also reduces scheduling overhead. A fio test
5607 * with ten random readers on /dev/nullb shows a throughput boost of
5608 * 40%, with a quadcore. Since BFQ's execution time amounts to ~50% of
5609 * the total per-request processing time, the above throughput boost
5610 * implies that BFQ's overhead is reduced by more than 50%.
5612 * This new mechanism most certainly obsoletes the current
5613 * burst-handling heuristics. We keep those heuristics for the moment.
5615 static struct bfq_queue *bfq_do_or_sched_stable_merge(struct bfq_data *bfqd,
5616 struct bfq_queue *bfqq,
5617 struct bfq_io_cq *bic)
5619 struct bfq_queue **source_bfqq = bfqq->entity.parent ?
5620 &bfqq->entity.parent->last_bfqq_created :
5621 &bfqd->last_bfqq_created;
5623 struct bfq_queue *last_bfqq_created = *source_bfqq;
5626 * If last_bfqq_created has not been set yet, then init it. If
5627 * it has been set already, but too long ago, then move it
5628 * forward to bfqq. Finally, move also if bfqq belongs to a
5629 * different group than last_bfqq_created, or if bfqq has a
5630 * different ioprio or ioprio_class. If none of these
5631 * conditions holds true, then try an early stable merge or
5632 * schedule a delayed stable merge.
5634 * A delayed merge is scheduled (instead of performing an
5635 * early merge), in case bfqq might soon prove to be more
5636 * throughput-beneficial if not merged. Currently this is
5637 * possible only if bfqd is rotational with no queueing. For
5638 * such a drive, not merging bfqq is better for throughput if
5639 * bfqq happens to contain sequential I/O. So, we wait a
5640 * little bit for enough I/O to flow through bfqq. After that,
5641 * if such an I/O is sequential, then the merge is
5642 * canceled. Otherwise the merge is finally performed.
5644 if (!last_bfqq_created ||
5645 time_before(last_bfqq_created->creation_time +
5646 msecs_to_jiffies(bfq_activation_stable_merging),
5647 bfqq->creation_time) ||
5648 bfqq->entity.parent != last_bfqq_created->entity.parent ||
5649 bfqq->ioprio != last_bfqq_created->ioprio ||
5650 bfqq->ioprio_class != last_bfqq_created->ioprio_class)
5651 *source_bfqq = bfqq;
5652 else if (time_after_eq(last_bfqq_created->creation_time +
5653 bfqd->bfq_burst_interval,
5654 bfqq->creation_time)) {
5655 if (likely(bfqd->nonrot_with_queueing))
5657 * With this type of drive, leaving
5658 * bfqq alone may provide no
5659 * throughput benefits compared with
5660 * merging bfqq. So merge bfqq now.
5662 bfqq = bfq_do_early_stable_merge(bfqd, bfqq,
5665 else { /* schedule tentative stable merge */
5667 * get reference on last_bfqq_created,
5668 * to prevent it from being freed,
5669 * until we decide whether to merge
5671 last_bfqq_created->ref++;
5673 * need to keep track of stable refs, to
5674 * compute process refs correctly
5676 last_bfqq_created->stable_ref++;
5678 * Record the bfqq to merge to.
5680 bic->stable_merge_bfqq = last_bfqq_created;
5688 static struct bfq_queue *bfq_get_queue(struct bfq_data *bfqd,
5689 struct bio *bio, bool is_sync,
5690 struct bfq_io_cq *bic,
5693 const int ioprio = IOPRIO_PRIO_DATA(bic->ioprio);
5694 const int ioprio_class = IOPRIO_PRIO_CLASS(bic->ioprio);
5695 struct bfq_queue **async_bfqq = NULL;
5696 struct bfq_queue *bfqq;
5697 struct bfq_group *bfqg;
5699 bfqg = bfq_bio_bfqg(bfqd, bio);
5701 async_bfqq = bfq_async_queue_prio(bfqd, bfqg, ioprio_class,
5708 bfqq = kmem_cache_alloc_node(bfq_pool,
5709 GFP_NOWAIT | __GFP_ZERO | __GFP_NOWARN,
5713 bfq_init_bfqq(bfqd, bfqq, bic, current->pid,
5715 bfq_init_entity(&bfqq->entity, bfqg);
5716 bfq_log_bfqq(bfqd, bfqq, "allocated");
5718 bfqq = &bfqd->oom_bfqq;
5719 bfq_log_bfqq(bfqd, bfqq, "using oom bfqq");
5724 * Pin the queue now that it's allocated, scheduler exit will
5729 * Extra group reference, w.r.t. sync
5730 * queue. This extra reference is removed
5731 * only if bfqq->bfqg disappears, to
5732 * guarantee that this queue is not freed
5733 * until its group goes away.
5735 bfq_log_bfqq(bfqd, bfqq, "get_queue, bfqq not in async: %p, %d",
5741 bfqq->ref++; /* get a process reference to this queue */
5743 if (bfqq != &bfqd->oom_bfqq && is_sync && !respawn)
5744 bfqq = bfq_do_or_sched_stable_merge(bfqd, bfqq, bic);
5748 static void bfq_update_io_thinktime(struct bfq_data *bfqd,
5749 struct bfq_queue *bfqq)
5751 struct bfq_ttime *ttime = &bfqq->ttime;
5755 * We are really interested in how long it takes for the queue to
5756 * become busy when there is no outstanding IO for this queue. So
5757 * ignore cases when the bfq queue has already IO queued.
5759 if (bfqq->dispatched || bfq_bfqq_busy(bfqq))
5761 elapsed = ktime_get_ns() - bfqq->ttime.last_end_request;
5762 elapsed = min_t(u64, elapsed, 2ULL * bfqd->bfq_slice_idle);
5764 ttime->ttime_samples = (7*ttime->ttime_samples + 256) / 8;
5765 ttime->ttime_total = div_u64(7*ttime->ttime_total + 256*elapsed, 8);
5766 ttime->ttime_mean = div64_ul(ttime->ttime_total + 128,
5767 ttime->ttime_samples);
5771 bfq_update_io_seektime(struct bfq_data *bfqd, struct bfq_queue *bfqq,
5774 bfqq->seek_history <<= 1;
5775 bfqq->seek_history |= BFQ_RQ_SEEKY(bfqd, bfqq->last_request_pos, rq);
5777 if (bfqq->wr_coeff > 1 &&
5778 bfqq->wr_cur_max_time == bfqd->bfq_wr_rt_max_time &&
5779 BFQQ_TOTALLY_SEEKY(bfqq)) {
5780 if (time_is_before_jiffies(bfqq->wr_start_at_switch_to_srt +
5781 bfq_wr_duration(bfqd))) {
5783 * In soft_rt weight raising with the
5784 * interactive-weight-raising period
5785 * elapsed (so no switch back to
5786 * interactive weight raising).
5788 bfq_bfqq_end_wr(bfqq);
5790 * stopping soft_rt weight raising
5791 * while still in interactive period,
5792 * switch back to interactive weight
5795 switch_back_to_interactive_wr(bfqq, bfqd);
5796 bfqq->entity.prio_changed = 1;
5801 static void bfq_update_has_short_ttime(struct bfq_data *bfqd,
5802 struct bfq_queue *bfqq,
5803 struct bfq_io_cq *bic)
5805 bool has_short_ttime = true, state_changed;
5808 * No need to update has_short_ttime if bfqq is async or in
5809 * idle io prio class, or if bfq_slice_idle is zero, because
5810 * no device idling is performed for bfqq in this case.
5812 if (!bfq_bfqq_sync(bfqq) || bfq_class_idle(bfqq) ||
5813 bfqd->bfq_slice_idle == 0)
5816 /* Idle window just restored, statistics are meaningless. */
5817 if (time_is_after_eq_jiffies(bfqq->split_time +
5818 bfqd->bfq_wr_min_idle_time))
5821 /* Think time is infinite if no process is linked to
5822 * bfqq. Otherwise check average think time to decide whether
5823 * to mark as has_short_ttime. To this goal, compare average
5824 * think time with half the I/O-plugging timeout.
5826 if (atomic_read(&bic->icq.ioc->active_ref) == 0 ||
5827 (bfq_sample_valid(bfqq->ttime.ttime_samples) &&
5828 bfqq->ttime.ttime_mean > bfqd->bfq_slice_idle>>1))
5829 has_short_ttime = false;
5831 state_changed = has_short_ttime != bfq_bfqq_has_short_ttime(bfqq);
5833 if (has_short_ttime)
5834 bfq_mark_bfqq_has_short_ttime(bfqq);
5836 bfq_clear_bfqq_has_short_ttime(bfqq);
5839 * Until the base value for the total service time gets
5840 * finally computed for bfqq, the inject limit does depend on
5841 * the think-time state (short|long). In particular, the limit
5842 * is 0 or 1 if the think time is deemed, respectively, as
5843 * short or long (details in the comments in
5844 * bfq_update_inject_limit()). Accordingly, the next
5845 * instructions reset the inject limit if the think-time state
5846 * has changed and the above base value is still to be
5849 * However, the reset is performed only if more than 100 ms
5850 * have elapsed since the last update of the inject limit, or
5851 * (inclusive) if the change is from short to long think
5852 * time. The reason for this waiting is as follows.
5854 * bfqq may have a long think time because of a
5855 * synchronization with some other queue, i.e., because the
5856 * I/O of some other queue may need to be completed for bfqq
5857 * to receive new I/O. Details in the comments on the choice
5858 * of the queue for injection in bfq_select_queue().
5860 * As stressed in those comments, if such a synchronization is
5861 * actually in place, then, without injection on bfqq, the
5862 * blocking I/O cannot happen to served while bfqq is in
5863 * service. As a consequence, if bfqq is granted
5864 * I/O-dispatch-plugging, then bfqq remains empty, and no I/O
5865 * is dispatched, until the idle timeout fires. This is likely
5866 * to result in lower bandwidth and higher latencies for bfqq,
5867 * and in a severe loss of total throughput.
5869 * On the opposite end, a non-zero inject limit may allow the
5870 * I/O that blocks bfqq to be executed soon, and therefore
5871 * bfqq to receive new I/O soon.
5873 * But, if the blocking gets actually eliminated, then the
5874 * next think-time sample for bfqq may be very low. This in
5875 * turn may cause bfqq's think time to be deemed
5876 * short. Without the 100 ms barrier, this new state change
5877 * would cause the body of the next if to be executed
5878 * immediately. But this would set to 0 the inject
5879 * limit. Without injection, the blocking I/O would cause the
5880 * think time of bfqq to become long again, and therefore the
5881 * inject limit to be raised again, and so on. The only effect
5882 * of such a steady oscillation between the two think-time
5883 * states would be to prevent effective injection on bfqq.
5885 * In contrast, if the inject limit is not reset during such a
5886 * long time interval as 100 ms, then the number of short
5887 * think time samples can grow significantly before the reset
5888 * is performed. As a consequence, the think time state can
5889 * become stable before the reset. Therefore there will be no
5890 * state change when the 100 ms elapse, and no reset of the
5891 * inject limit. The inject limit remains steadily equal to 1
5892 * both during and after the 100 ms. So injection can be
5893 * performed at all times, and throughput gets boosted.
5895 * An inject limit equal to 1 is however in conflict, in
5896 * general, with the fact that the think time of bfqq is
5897 * short, because injection may be likely to delay bfqq's I/O
5898 * (as explained in the comments in
5899 * bfq_update_inject_limit()). But this does not happen in
5900 * this special case, because bfqq's low think time is due to
5901 * an effective handling of a synchronization, through
5902 * injection. In this special case, bfqq's I/O does not get
5903 * delayed by injection; on the contrary, bfqq's I/O is
5904 * brought forward, because it is not blocked for
5907 * In addition, serving the blocking I/O much sooner, and much
5908 * more frequently than once per I/O-plugging timeout, makes
5909 * it much quicker to detect a waker queue (the concept of
5910 * waker queue is defined in the comments in
5911 * bfq_add_request()). This makes it possible to start sooner
5912 * to boost throughput more effectively, by injecting the I/O
5913 * of the waker queue unconditionally on every
5914 * bfq_dispatch_request().
5916 * One last, important benefit of not resetting the inject
5917 * limit before 100 ms is that, during this time interval, the
5918 * base value for the total service time is likely to get
5919 * finally computed for bfqq, freeing the inject limit from
5920 * its relation with the think time.
5922 if (state_changed && bfqq->last_serv_time_ns == 0 &&
5923 (time_is_before_eq_jiffies(bfqq->decrease_time_jif +
5924 msecs_to_jiffies(100)) ||
5926 bfq_reset_inject_limit(bfqd, bfqq);
5930 * Called when a new fs request (rq) is added to bfqq. Check if there's
5931 * something we should do about it.
5933 static void bfq_rq_enqueued(struct bfq_data *bfqd, struct bfq_queue *bfqq,
5936 if (rq->cmd_flags & REQ_META)
5937 bfqq->meta_pending++;
5939 bfqq->last_request_pos = blk_rq_pos(rq) + blk_rq_sectors(rq);
5941 if (bfqq == bfqd->in_service_queue && bfq_bfqq_wait_request(bfqq)) {
5942 bool small_req = bfqq->queued[rq_is_sync(rq)] == 1 &&
5943 blk_rq_sectors(rq) < 32;
5944 bool budget_timeout = bfq_bfqq_budget_timeout(bfqq);
5947 * There is just this request queued: if
5948 * - the request is small, and
5949 * - we are idling to boost throughput, and
5950 * - the queue is not to be expired,
5953 * In this way, if the device is being idled to wait
5954 * for a new request from the in-service queue, we
5955 * avoid unplugging the device and committing the
5956 * device to serve just a small request. In contrast
5957 * we wait for the block layer to decide when to
5958 * unplug the device: hopefully, new requests will be
5959 * merged to this one quickly, then the device will be
5960 * unplugged and larger requests will be dispatched.
5962 if (small_req && idling_boosts_thr_without_issues(bfqd, bfqq) &&
5967 * A large enough request arrived, or idling is being
5968 * performed to preserve service guarantees, or
5969 * finally the queue is to be expired: in all these
5970 * cases disk idling is to be stopped, so clear
5971 * wait_request flag and reset timer.
5973 bfq_clear_bfqq_wait_request(bfqq);
5974 hrtimer_try_to_cancel(&bfqd->idle_slice_timer);
5977 * The queue is not empty, because a new request just
5978 * arrived. Hence we can safely expire the queue, in
5979 * case of budget timeout, without risking that the
5980 * timestamps of the queue are not updated correctly.
5981 * See [1] for more details.
5984 bfq_bfqq_expire(bfqd, bfqq, false,
5985 BFQQE_BUDGET_TIMEOUT);
5989 static void bfqq_request_allocated(struct bfq_queue *bfqq)
5991 struct bfq_entity *entity = &bfqq->entity;
5993 for_each_entity(entity)
5994 entity->allocated++;
5997 static void bfqq_request_freed(struct bfq_queue *bfqq)
5999 struct bfq_entity *entity = &bfqq->entity;
6001 for_each_entity(entity)
6002 entity->allocated--;
6005 /* returns true if it causes the idle timer to be disabled */
6006 static bool __bfq_insert_request(struct bfq_data *bfqd, struct request *rq)
6008 struct bfq_queue *bfqq = RQ_BFQQ(rq),
6009 *new_bfqq = bfq_setup_cooperator(bfqd, bfqq, rq, true,
6011 bool waiting, idle_timer_disabled = false;
6015 * Release the request's reference to the old bfqq
6016 * and make sure one is taken to the shared queue.
6018 bfqq_request_allocated(new_bfqq);
6019 bfqq_request_freed(bfqq);
6022 * If the bic associated with the process
6023 * issuing this request still points to bfqq
6024 * (and thus has not been already redirected
6025 * to new_bfqq or even some other bfq_queue),
6026 * then complete the merge and redirect it to
6029 if (bic_to_bfqq(RQ_BIC(rq), 1) == bfqq)
6030 bfq_merge_bfqqs(bfqd, RQ_BIC(rq),
6033 bfq_clear_bfqq_just_created(bfqq);
6035 * rq is about to be enqueued into new_bfqq,
6036 * release rq reference on bfqq
6038 bfq_put_queue(bfqq);
6039 rq->elv.priv[1] = new_bfqq;
6043 bfq_update_io_thinktime(bfqd, bfqq);
6044 bfq_update_has_short_ttime(bfqd, bfqq, RQ_BIC(rq));
6045 bfq_update_io_seektime(bfqd, bfqq, rq);
6047 waiting = bfqq && bfq_bfqq_wait_request(bfqq);
6048 bfq_add_request(rq);
6049 idle_timer_disabled = waiting && !bfq_bfqq_wait_request(bfqq);
6051 rq->fifo_time = ktime_get_ns() + bfqd->bfq_fifo_expire[rq_is_sync(rq)];
6052 list_add_tail(&rq->queuelist, &bfqq->fifo);
6054 bfq_rq_enqueued(bfqd, bfqq, rq);
6056 return idle_timer_disabled;
6059 #ifdef CONFIG_BFQ_CGROUP_DEBUG
6060 static void bfq_update_insert_stats(struct request_queue *q,
6061 struct bfq_queue *bfqq,
6062 bool idle_timer_disabled,
6063 blk_opf_t cmd_flags)
6069 * bfqq still exists, because it can disappear only after
6070 * either it is merged with another queue, or the process it
6071 * is associated with exits. But both actions must be taken by
6072 * the same process currently executing this flow of
6075 * In addition, the following queue lock guarantees that
6076 * bfqq_group(bfqq) exists as well.
6078 spin_lock_irq(&q->queue_lock);
6079 bfqg_stats_update_io_add(bfqq_group(bfqq), bfqq, cmd_flags);
6080 if (idle_timer_disabled)
6081 bfqg_stats_update_idle_time(bfqq_group(bfqq));
6082 spin_unlock_irq(&q->queue_lock);
6085 static inline void bfq_update_insert_stats(struct request_queue *q,
6086 struct bfq_queue *bfqq,
6087 bool idle_timer_disabled,
6088 blk_opf_t cmd_flags) {}
6089 #endif /* CONFIG_BFQ_CGROUP_DEBUG */
6091 static struct bfq_queue *bfq_init_rq(struct request *rq);
6093 static void bfq_insert_request(struct blk_mq_hw_ctx *hctx, struct request *rq,
6096 struct request_queue *q = hctx->queue;
6097 struct bfq_data *bfqd = q->elevator->elevator_data;
6098 struct bfq_queue *bfqq;
6099 bool idle_timer_disabled = false;
6100 blk_opf_t cmd_flags;
6103 #ifdef CONFIG_BFQ_GROUP_IOSCHED
6104 if (!cgroup_subsys_on_dfl(io_cgrp_subsys) && rq->bio)
6105 bfqg_stats_update_legacy_io(q, rq);
6107 spin_lock_irq(&bfqd->lock);
6108 bfqq = bfq_init_rq(rq);
6109 if (blk_mq_sched_try_insert_merge(q, rq, &free)) {
6110 spin_unlock_irq(&bfqd->lock);
6111 blk_mq_free_requests(&free);
6115 trace_block_rq_insert(rq);
6117 if (!bfqq || at_head) {
6119 list_add(&rq->queuelist, &bfqd->dispatch);
6121 list_add_tail(&rq->queuelist, &bfqd->dispatch);
6123 idle_timer_disabled = __bfq_insert_request(bfqd, rq);
6125 * Update bfqq, because, if a queue merge has occurred
6126 * in __bfq_insert_request, then rq has been
6127 * redirected into a new queue.
6131 if (rq_mergeable(rq)) {
6132 elv_rqhash_add(q, rq);
6139 * Cache cmd_flags before releasing scheduler lock, because rq
6140 * may disappear afterwards (for example, because of a request
6143 cmd_flags = rq->cmd_flags;
6144 spin_unlock_irq(&bfqd->lock);
6146 bfq_update_insert_stats(q, bfqq, idle_timer_disabled,
6150 static void bfq_insert_requests(struct blk_mq_hw_ctx *hctx,
6151 struct list_head *list, bool at_head)
6153 while (!list_empty(list)) {
6156 rq = list_first_entry(list, struct request, queuelist);
6157 list_del_init(&rq->queuelist);
6158 bfq_insert_request(hctx, rq, at_head);
6162 static void bfq_update_hw_tag(struct bfq_data *bfqd)
6164 struct bfq_queue *bfqq = bfqd->in_service_queue;
6166 bfqd->max_rq_in_driver = max_t(int, bfqd->max_rq_in_driver,
6167 bfqd->rq_in_driver);
6169 if (bfqd->hw_tag == 1)
6173 * This sample is valid if the number of outstanding requests
6174 * is large enough to allow a queueing behavior. Note that the
6175 * sum is not exact, as it's not taking into account deactivated
6178 if (bfqd->rq_in_driver + bfqd->queued <= BFQ_HW_QUEUE_THRESHOLD)
6182 * If active queue hasn't enough requests and can idle, bfq might not
6183 * dispatch sufficient requests to hardware. Don't zero hw_tag in this
6186 if (bfqq && bfq_bfqq_has_short_ttime(bfqq) &&
6187 bfqq->dispatched + bfqq->queued[0] + bfqq->queued[1] <
6188 BFQ_HW_QUEUE_THRESHOLD &&
6189 bfqd->rq_in_driver < BFQ_HW_QUEUE_THRESHOLD)
6192 if (bfqd->hw_tag_samples++ < BFQ_HW_QUEUE_SAMPLES)
6195 bfqd->hw_tag = bfqd->max_rq_in_driver > BFQ_HW_QUEUE_THRESHOLD;
6196 bfqd->max_rq_in_driver = 0;
6197 bfqd->hw_tag_samples = 0;
6199 bfqd->nonrot_with_queueing =
6200 blk_queue_nonrot(bfqd->queue) && bfqd->hw_tag;
6203 static void bfq_completed_request(struct bfq_queue *bfqq, struct bfq_data *bfqd)
6208 bfq_update_hw_tag(bfqd);
6210 bfqd->rq_in_driver--;
6213 if (!bfqq->dispatched && !bfq_bfqq_busy(bfqq)) {
6215 * Set budget_timeout (which we overload to store the
6216 * time at which the queue remains with no backlog and
6217 * no outstanding request; used by the weight-raising
6220 bfqq->budget_timeout = jiffies;
6222 bfq_del_bfqq_in_groups_with_pending_reqs(bfqq);
6223 bfq_weights_tree_remove(bfqd, bfqq);
6226 now_ns = ktime_get_ns();
6228 bfqq->ttime.last_end_request = now_ns;
6231 * Using us instead of ns, to get a reasonable precision in
6232 * computing rate in next check.
6234 delta_us = div_u64(now_ns - bfqd->last_completion, NSEC_PER_USEC);
6237 * If the request took rather long to complete, and, according
6238 * to the maximum request size recorded, this completion latency
6239 * implies that the request was certainly served at a very low
6240 * rate (less than 1M sectors/sec), then the whole observation
6241 * interval that lasts up to this time instant cannot be a
6242 * valid time interval for computing a new peak rate. Invoke
6243 * bfq_update_rate_reset to have the following three steps
6245 * - close the observation interval at the last (previous)
6246 * request dispatch or completion
6247 * - compute rate, if possible, for that observation interval
6248 * - reset to zero samples, which will trigger a proper
6249 * re-initialization of the observation interval on next
6252 if (delta_us > BFQ_MIN_TT/NSEC_PER_USEC &&
6253 (bfqd->last_rq_max_size<<BFQ_RATE_SHIFT)/delta_us <
6254 1UL<<(BFQ_RATE_SHIFT - 10))
6255 bfq_update_rate_reset(bfqd, NULL);
6256 bfqd->last_completion = now_ns;
6258 * Shared queues are likely to receive I/O at a high
6259 * rate. This may deceptively let them be considered as wakers
6260 * of other queues. But a false waker will unjustly steal
6261 * bandwidth to its supposedly woken queue. So considering
6262 * also shared queues in the waking mechanism may cause more
6263 * control troubles than throughput benefits. Then reset
6264 * last_completed_rq_bfqq if bfqq is a shared queue.
6266 if (!bfq_bfqq_coop(bfqq))
6267 bfqd->last_completed_rq_bfqq = bfqq;
6269 bfqd->last_completed_rq_bfqq = NULL;
6272 * If we are waiting to discover whether the request pattern
6273 * of the task associated with the queue is actually
6274 * isochronous, and both requisites for this condition to hold
6275 * are now satisfied, then compute soft_rt_next_start (see the
6276 * comments on the function bfq_bfqq_softrt_next_start()). We
6277 * do not compute soft_rt_next_start if bfqq is in interactive
6278 * weight raising (see the comments in bfq_bfqq_expire() for
6279 * an explanation). We schedule this delayed update when bfqq
6280 * expires, if it still has in-flight requests.
6282 if (bfq_bfqq_softrt_update(bfqq) && bfqq->dispatched == 0 &&
6283 RB_EMPTY_ROOT(&bfqq->sort_list) &&
6284 bfqq->wr_coeff != bfqd->bfq_wr_coeff)
6285 bfqq->soft_rt_next_start =
6286 bfq_bfqq_softrt_next_start(bfqd, bfqq);
6289 * If this is the in-service queue, check if it needs to be expired,
6290 * or if we want to idle in case it has no pending requests.
6292 if (bfqd->in_service_queue == bfqq) {
6293 if (bfq_bfqq_must_idle(bfqq)) {
6294 if (bfqq->dispatched == 0)
6295 bfq_arm_slice_timer(bfqd);
6297 * If we get here, we do not expire bfqq, even
6298 * if bfqq was in budget timeout or had no
6299 * more requests (as controlled in the next
6300 * conditional instructions). The reason for
6301 * not expiring bfqq is as follows.
6303 * Here bfqq->dispatched > 0 holds, but
6304 * bfq_bfqq_must_idle() returned true. This
6305 * implies that, even if no request arrives
6306 * for bfqq before bfqq->dispatched reaches 0,
6307 * bfqq will, however, not be expired on the
6308 * completion event that causes bfqq->dispatch
6309 * to reach zero. In contrast, on this event,
6310 * bfqq will start enjoying device idling
6311 * (I/O-dispatch plugging).
6313 * But, if we expired bfqq here, bfqq would
6314 * not have the chance to enjoy device idling
6315 * when bfqq->dispatched finally reaches
6316 * zero. This would expose bfqq to violation
6317 * of its reserved service guarantees.
6320 } else if (bfq_may_expire_for_budg_timeout(bfqq))
6321 bfq_bfqq_expire(bfqd, bfqq, false,
6322 BFQQE_BUDGET_TIMEOUT);
6323 else if (RB_EMPTY_ROOT(&bfqq->sort_list) &&
6324 (bfqq->dispatched == 0 ||
6325 !bfq_better_to_idle(bfqq)))
6326 bfq_bfqq_expire(bfqd, bfqq, false,
6327 BFQQE_NO_MORE_REQUESTS);
6330 if (!bfqd->rq_in_driver)
6331 bfq_schedule_dispatch(bfqd);
6335 * The processes associated with bfqq may happen to generate their
6336 * cumulative I/O at a lower rate than the rate at which the device
6337 * could serve the same I/O. This is rather probable, e.g., if only
6338 * one process is associated with bfqq and the device is an SSD. It
6339 * results in bfqq becoming often empty while in service. In this
6340 * respect, if BFQ is allowed to switch to another queue when bfqq
6341 * remains empty, then the device goes on being fed with I/O requests,
6342 * and the throughput is not affected. In contrast, if BFQ is not
6343 * allowed to switch to another queue---because bfqq is sync and
6344 * I/O-dispatch needs to be plugged while bfqq is temporarily
6345 * empty---then, during the service of bfqq, there will be frequent
6346 * "service holes", i.e., time intervals during which bfqq gets empty
6347 * and the device can only consume the I/O already queued in its
6348 * hardware queues. During service holes, the device may even get to
6349 * remaining idle. In the end, during the service of bfqq, the device
6350 * is driven at a lower speed than the one it can reach with the kind
6351 * of I/O flowing through bfqq.
6353 * To counter this loss of throughput, BFQ implements a "request
6354 * injection mechanism", which tries to fill the above service holes
6355 * with I/O requests taken from other queues. The hard part in this
6356 * mechanism is finding the right amount of I/O to inject, so as to
6357 * both boost throughput and not break bfqq's bandwidth and latency
6358 * guarantees. In this respect, the mechanism maintains a per-queue
6359 * inject limit, computed as below. While bfqq is empty, the injection
6360 * mechanism dispatches extra I/O requests only until the total number
6361 * of I/O requests in flight---i.e., already dispatched but not yet
6362 * completed---remains lower than this limit.
6364 * A first definition comes in handy to introduce the algorithm by
6365 * which the inject limit is computed. We define as first request for
6366 * bfqq, an I/O request for bfqq that arrives while bfqq is in
6367 * service, and causes bfqq to switch from empty to non-empty. The
6368 * algorithm updates the limit as a function of the effect of
6369 * injection on the service times of only the first requests of
6370 * bfqq. The reason for this restriction is that these are the
6371 * requests whose service time is affected most, because they are the
6372 * first to arrive after injection possibly occurred.
6374 * To evaluate the effect of injection, the algorithm measures the
6375 * "total service time" of first requests. We define as total service
6376 * time of an I/O request, the time that elapses since when the
6377 * request is enqueued into bfqq, to when it is completed. This
6378 * quantity allows the whole effect of injection to be measured. It is
6379 * easy to see why. Suppose that some requests of other queues are
6380 * actually injected while bfqq is empty, and that a new request R
6381 * then arrives for bfqq. If the device does start to serve all or
6382 * part of the injected requests during the service hole, then,
6383 * because of this extra service, it may delay the next invocation of
6384 * the dispatch hook of BFQ. Then, even after R gets eventually
6385 * dispatched, the device may delay the actual service of R if it is
6386 * still busy serving the extra requests, or if it decides to serve,
6387 * before R, some extra request still present in its queues. As a
6388 * conclusion, the cumulative extra delay caused by injection can be
6389 * easily evaluated by just comparing the total service time of first
6390 * requests with and without injection.
6392 * The limit-update algorithm works as follows. On the arrival of a
6393 * first request of bfqq, the algorithm measures the total time of the
6394 * request only if one of the three cases below holds, and, for each
6395 * case, it updates the limit as described below:
6397 * (1) If there is no in-flight request. This gives a baseline for the
6398 * total service time of the requests of bfqq. If the baseline has
6399 * not been computed yet, then, after computing it, the limit is
6400 * set to 1, to start boosting throughput, and to prepare the
6401 * ground for the next case. If the baseline has already been
6402 * computed, then it is updated, in case it results to be lower
6403 * than the previous value.
6405 * (2) If the limit is higher than 0 and there are in-flight
6406 * requests. By comparing the total service time in this case with
6407 * the above baseline, it is possible to know at which extent the
6408 * current value of the limit is inflating the total service
6409 * time. If the inflation is below a certain threshold, then bfqq
6410 * is assumed to be suffering from no perceivable loss of its
6411 * service guarantees, and the limit is even tentatively
6412 * increased. If the inflation is above the threshold, then the
6413 * limit is decreased. Due to the lack of any hysteresis, this
6414 * logic makes the limit oscillate even in steady workload
6415 * conditions. Yet we opted for it, because it is fast in reaching
6416 * the best value for the limit, as a function of the current I/O
6417 * workload. To reduce oscillations, this step is disabled for a
6418 * short time interval after the limit happens to be decreased.
6420 * (3) Periodically, after resetting the limit, to make sure that the
6421 * limit eventually drops in case the workload changes. This is
6422 * needed because, after the limit has gone safely up for a
6423 * certain workload, it is impossible to guess whether the
6424 * baseline total service time may have changed, without measuring
6425 * it again without injection. A more effective version of this
6426 * step might be to just sample the baseline, by interrupting
6427 * injection only once, and then to reset/lower the limit only if
6428 * the total service time with the current limit does happen to be
6431 * More details on each step are provided in the comments on the
6432 * pieces of code that implement these steps: the branch handling the
6433 * transition from empty to non empty in bfq_add_request(), the branch
6434 * handling injection in bfq_select_queue(), and the function
6435 * bfq_choose_bfqq_for_injection(). These comments also explain some
6436 * exceptions, made by the injection mechanism in some special cases.
6438 static void bfq_update_inject_limit(struct bfq_data *bfqd,
6439 struct bfq_queue *bfqq)
6441 u64 tot_time_ns = ktime_get_ns() - bfqd->last_empty_occupied_ns;
6442 unsigned int old_limit = bfqq->inject_limit;
6444 if (bfqq->last_serv_time_ns > 0 && bfqd->rqs_injected) {
6445 u64 threshold = (bfqq->last_serv_time_ns * 3)>>1;
6447 if (tot_time_ns >= threshold && old_limit > 0) {
6448 bfqq->inject_limit--;
6449 bfqq->decrease_time_jif = jiffies;
6450 } else if (tot_time_ns < threshold &&
6451 old_limit <= bfqd->max_rq_in_driver)
6452 bfqq->inject_limit++;
6456 * Either we still have to compute the base value for the
6457 * total service time, and there seem to be the right
6458 * conditions to do it, or we can lower the last base value
6461 * NOTE: (bfqd->rq_in_driver == 1) means that there is no I/O
6462 * request in flight, because this function is in the code
6463 * path that handles the completion of a request of bfqq, and,
6464 * in particular, this function is executed before
6465 * bfqd->rq_in_driver is decremented in such a code path.
6467 if ((bfqq->last_serv_time_ns == 0 && bfqd->rq_in_driver == 1) ||
6468 tot_time_ns < bfqq->last_serv_time_ns) {
6469 if (bfqq->last_serv_time_ns == 0) {
6471 * Now we certainly have a base value: make sure we
6472 * start trying injection.
6474 bfqq->inject_limit = max_t(unsigned int, 1, old_limit);
6476 bfqq->last_serv_time_ns = tot_time_ns;
6477 } else if (!bfqd->rqs_injected && bfqd->rq_in_driver == 1)
6479 * No I/O injected and no request still in service in
6480 * the drive: these are the exact conditions for
6481 * computing the base value of the total service time
6482 * for bfqq. So let's update this value, because it is
6483 * rather variable. For example, it varies if the size
6484 * or the spatial locality of the I/O requests in bfqq
6487 bfqq->last_serv_time_ns = tot_time_ns;
6490 /* update complete, not waiting for any request completion any longer */
6491 bfqd->waited_rq = NULL;
6492 bfqd->rqs_injected = false;
6496 * Handle either a requeue or a finish for rq. The things to do are
6497 * the same in both cases: all references to rq are to be dropped. In
6498 * particular, rq is considered completed from the point of view of
6501 static void bfq_finish_requeue_request(struct request *rq)
6503 struct bfq_queue *bfqq = RQ_BFQQ(rq);
6504 struct bfq_data *bfqd;
6505 unsigned long flags;
6508 * rq either is not associated with any icq, or is an already
6509 * requeued request that has not (yet) been re-inserted into
6512 if (!rq->elv.icq || !bfqq)
6517 if (rq->rq_flags & RQF_STARTED)
6518 bfqg_stats_update_completion(bfqq_group(bfqq),
6520 rq->io_start_time_ns,
6523 spin_lock_irqsave(&bfqd->lock, flags);
6524 if (likely(rq->rq_flags & RQF_STARTED)) {
6525 if (rq == bfqd->waited_rq)
6526 bfq_update_inject_limit(bfqd, bfqq);
6528 bfq_completed_request(bfqq, bfqd);
6530 bfqq_request_freed(bfqq);
6531 bfq_put_queue(bfqq);
6532 RQ_BIC(rq)->requests--;
6533 spin_unlock_irqrestore(&bfqd->lock, flags);
6536 * Reset private fields. In case of a requeue, this allows
6537 * this function to correctly do nothing if it is spuriously
6538 * invoked again on this same request (see the check at the
6539 * beginning of the function). Probably, a better general
6540 * design would be to prevent blk-mq from invoking the requeue
6541 * or finish hooks of an elevator, for a request that is not
6542 * referred by that elevator.
6544 * Resetting the following fields would break the
6545 * request-insertion logic if rq is re-inserted into a bfq
6546 * internal queue, without a re-preparation. Here we assume
6547 * that re-insertions of requeued requests, without
6548 * re-preparation, can happen only for pass_through or at_head
6549 * requests (which are not re-inserted into bfq internal
6552 rq->elv.priv[0] = NULL;
6553 rq->elv.priv[1] = NULL;
6556 static void bfq_finish_request(struct request *rq)
6558 bfq_finish_requeue_request(rq);
6561 put_io_context(rq->elv.icq->ioc);
6567 * Removes the association between the current task and bfqq, assuming
6568 * that bic points to the bfq iocontext of the task.
6569 * Returns NULL if a new bfqq should be allocated, or the old bfqq if this
6570 * was the last process referring to that bfqq.
6572 static struct bfq_queue *
6573 bfq_split_bfqq(struct bfq_io_cq *bic, struct bfq_queue *bfqq)
6575 bfq_log_bfqq(bfqq->bfqd, bfqq, "splitting queue");
6577 if (bfqq_process_refs(bfqq) == 1) {
6578 bfqq->pid = current->pid;
6579 bfq_clear_bfqq_coop(bfqq);
6580 bfq_clear_bfqq_split_coop(bfqq);
6584 bic_set_bfqq(bic, NULL, 1);
6586 bfq_put_cooperator(bfqq);
6588 bfq_release_process_ref(bfqq->bfqd, bfqq);
6592 static struct bfq_queue *bfq_get_bfqq_handle_split(struct bfq_data *bfqd,
6593 struct bfq_io_cq *bic,
6595 bool split, bool is_sync,
6598 struct bfq_queue *bfqq = bic_to_bfqq(bic, is_sync);
6600 if (likely(bfqq && bfqq != &bfqd->oom_bfqq))
6607 bfq_put_queue(bfqq);
6608 bfqq = bfq_get_queue(bfqd, bio, is_sync, bic, split);
6610 bic_set_bfqq(bic, bfqq, is_sync);
6611 if (split && is_sync) {
6612 if ((bic->was_in_burst_list && bfqd->large_burst) ||
6613 bic->saved_in_large_burst)
6614 bfq_mark_bfqq_in_large_burst(bfqq);
6616 bfq_clear_bfqq_in_large_burst(bfqq);
6617 if (bic->was_in_burst_list)
6619 * If bfqq was in the current
6620 * burst list before being
6621 * merged, then we have to add
6622 * it back. And we do not need
6623 * to increase burst_size, as
6624 * we did not decrement
6625 * burst_size when we removed
6626 * bfqq from the burst list as
6627 * a consequence of a merge
6629 * bfq_put_queue). In this
6630 * respect, it would be rather
6631 * costly to know whether the
6632 * current burst list is still
6633 * the same burst list from
6634 * which bfqq was removed on
6635 * the merge. To avoid this
6636 * cost, if bfqq was in a
6637 * burst list, then we add
6638 * bfqq to the current burst
6639 * list without any further
6640 * check. This can cause
6641 * inappropriate insertions,
6642 * but rarely enough to not
6643 * harm the detection of large
6644 * bursts significantly.
6646 hlist_add_head(&bfqq->burst_list_node,
6649 bfqq->split_time = jiffies;
6656 * Only reset private fields. The actual request preparation will be
6657 * performed by bfq_init_rq, when rq is either inserted or merged. See
6658 * comments on bfq_init_rq for the reason behind this delayed
6661 static void bfq_prepare_request(struct request *rq)
6663 rq->elv.icq = ioc_find_get_icq(rq->q);
6666 * Regardless of whether we have an icq attached, we have to
6667 * clear the scheduler pointers, as they might point to
6668 * previously allocated bic/bfqq structs.
6670 rq->elv.priv[0] = rq->elv.priv[1] = NULL;
6674 * If needed, init rq, allocate bfq data structures associated with
6675 * rq, and increment reference counters in the destination bfq_queue
6676 * for rq. Return the destination bfq_queue for rq, or NULL is rq is
6677 * not associated with any bfq_queue.
6679 * This function is invoked by the functions that perform rq insertion
6680 * or merging. One may have expected the above preparation operations
6681 * to be performed in bfq_prepare_request, and not delayed to when rq
6682 * is inserted or merged. The rationale behind this delayed
6683 * preparation is that, after the prepare_request hook is invoked for
6684 * rq, rq may still be transformed into a request with no icq, i.e., a
6685 * request not associated with any queue. No bfq hook is invoked to
6686 * signal this transformation. As a consequence, should these
6687 * preparation operations be performed when the prepare_request hook
6688 * is invoked, and should rq be transformed one moment later, bfq
6689 * would end up in an inconsistent state, because it would have
6690 * incremented some queue counters for an rq destined to
6691 * transformation, without any chance to correctly lower these
6692 * counters back. In contrast, no transformation can still happen for
6693 * rq after rq has been inserted or merged. So, it is safe to execute
6694 * these preparation operations when rq is finally inserted or merged.
6696 static struct bfq_queue *bfq_init_rq(struct request *rq)
6698 struct request_queue *q = rq->q;
6699 struct bio *bio = rq->bio;
6700 struct bfq_data *bfqd = q->elevator->elevator_data;
6701 struct bfq_io_cq *bic;
6702 const int is_sync = rq_is_sync(rq);
6703 struct bfq_queue *bfqq;
6704 bool new_queue = false;
6705 bool bfqq_already_existing = false, split = false;
6707 if (unlikely(!rq->elv.icq))
6711 * Assuming that elv.priv[1] is set only if everything is set
6712 * for this rq. This holds true, because this function is
6713 * invoked only for insertion or merging, and, after such
6714 * events, a request cannot be manipulated any longer before
6715 * being removed from bfq.
6717 if (rq->elv.priv[1])
6718 return rq->elv.priv[1];
6720 bic = icq_to_bic(rq->elv.icq);
6722 bfq_check_ioprio_change(bic, bio);
6724 bfq_bic_update_cgroup(bic, bio);
6726 bfqq = bfq_get_bfqq_handle_split(bfqd, bic, bio, false, is_sync,
6729 if (likely(!new_queue)) {
6730 /* If the queue was seeky for too long, break it apart. */
6731 if (bfq_bfqq_coop(bfqq) && bfq_bfqq_split_coop(bfqq) &&
6732 !bic->stably_merged) {
6733 struct bfq_queue *old_bfqq = bfqq;
6735 /* Update bic before losing reference to bfqq */
6736 if (bfq_bfqq_in_large_burst(bfqq))
6737 bic->saved_in_large_burst = true;
6739 bfqq = bfq_split_bfqq(bic, bfqq);
6743 bfqq = bfq_get_bfqq_handle_split(bfqd, bic, bio,
6746 bfqq->waker_bfqq = old_bfqq->waker_bfqq;
6747 bfqq->tentative_waker_bfqq = NULL;
6750 * If the waker queue disappears, then
6751 * new_bfqq->waker_bfqq must be
6752 * reset. So insert new_bfqq into the
6753 * woken_list of the waker. See
6754 * bfq_check_waker for details.
6756 if (bfqq->waker_bfqq)
6757 hlist_add_head(&bfqq->woken_list_node,
6758 &bfqq->waker_bfqq->woken_list);
6760 bfqq_already_existing = true;
6764 bfqq_request_allocated(bfqq);
6767 bfq_log_bfqq(bfqd, bfqq, "get_request %p: bfqq %p, %d",
6768 rq, bfqq, bfqq->ref);
6770 rq->elv.priv[0] = bic;
6771 rq->elv.priv[1] = bfqq;
6774 * If a bfq_queue has only one process reference, it is owned
6775 * by only this bic: we can then set bfqq->bic = bic. in
6776 * addition, if the queue has also just been split, we have to
6779 if (likely(bfqq != &bfqd->oom_bfqq) && bfqq_process_refs(bfqq) == 1) {
6783 * The queue has just been split from a shared
6784 * queue: restore the idle window and the
6785 * possible weight raising period.
6787 bfq_bfqq_resume_state(bfqq, bfqd, bic,
6788 bfqq_already_existing);
6793 * Consider bfqq as possibly belonging to a burst of newly
6794 * created queues only if:
6795 * 1) A burst is actually happening (bfqd->burst_size > 0)
6797 * 2) There is no other active queue. In fact, if, in
6798 * contrast, there are active queues not belonging to the
6799 * possible burst bfqq may belong to, then there is no gain
6800 * in considering bfqq as belonging to a burst, and
6801 * therefore in not weight-raising bfqq. See comments on
6802 * bfq_handle_burst().
6804 * This filtering also helps eliminating false positives,
6805 * occurring when bfqq does not belong to an actual large
6806 * burst, but some background task (e.g., a service) happens
6807 * to trigger the creation of new queues very close to when
6808 * bfqq and its possible companion queues are created. See
6809 * comments on bfq_handle_burst() for further details also on
6812 if (unlikely(bfq_bfqq_just_created(bfqq) &&
6813 (bfqd->burst_size > 0 ||
6814 bfq_tot_busy_queues(bfqd) == 0)))
6815 bfq_handle_burst(bfqd, bfqq);
6821 bfq_idle_slice_timer_body(struct bfq_data *bfqd, struct bfq_queue *bfqq)
6823 enum bfqq_expiration reason;
6824 unsigned long flags;
6826 spin_lock_irqsave(&bfqd->lock, flags);
6829 * Considering that bfqq may be in race, we should firstly check
6830 * whether bfqq is in service before doing something on it. If
6831 * the bfqq in race is not in service, it has already been expired
6832 * through __bfq_bfqq_expire func and its wait_request flags has
6833 * been cleared in __bfq_bfqd_reset_in_service func.
6835 if (bfqq != bfqd->in_service_queue) {
6836 spin_unlock_irqrestore(&bfqd->lock, flags);
6840 bfq_clear_bfqq_wait_request(bfqq);
6842 if (bfq_bfqq_budget_timeout(bfqq))
6844 * Also here the queue can be safely expired
6845 * for budget timeout without wasting
6848 reason = BFQQE_BUDGET_TIMEOUT;
6849 else if (bfqq->queued[0] == 0 && bfqq->queued[1] == 0)
6851 * The queue may not be empty upon timer expiration,
6852 * because we may not disable the timer when the
6853 * first request of the in-service queue arrives
6854 * during disk idling.
6856 reason = BFQQE_TOO_IDLE;
6858 goto schedule_dispatch;
6860 bfq_bfqq_expire(bfqd, bfqq, true, reason);
6863 bfq_schedule_dispatch(bfqd);
6864 spin_unlock_irqrestore(&bfqd->lock, flags);
6868 * Handler of the expiration of the timer running if the in-service queue
6869 * is idling inside its time slice.
6871 static enum hrtimer_restart bfq_idle_slice_timer(struct hrtimer *timer)
6873 struct bfq_data *bfqd = container_of(timer, struct bfq_data,
6875 struct bfq_queue *bfqq = bfqd->in_service_queue;
6878 * Theoretical race here: the in-service queue can be NULL or
6879 * different from the queue that was idling if a new request
6880 * arrives for the current queue and there is a full dispatch
6881 * cycle that changes the in-service queue. This can hardly
6882 * happen, but in the worst case we just expire a queue too
6886 bfq_idle_slice_timer_body(bfqd, bfqq);
6888 return HRTIMER_NORESTART;
6891 static void __bfq_put_async_bfqq(struct bfq_data *bfqd,
6892 struct bfq_queue **bfqq_ptr)
6894 struct bfq_queue *bfqq = *bfqq_ptr;
6896 bfq_log(bfqd, "put_async_bfqq: %p", bfqq);
6898 bfq_bfqq_move(bfqd, bfqq, bfqd->root_group);
6900 bfq_log_bfqq(bfqd, bfqq, "put_async_bfqq: putting %p, %d",
6902 bfq_put_queue(bfqq);
6908 * Release all the bfqg references to its async queues. If we are
6909 * deallocating the group these queues may still contain requests, so
6910 * we reparent them to the root cgroup (i.e., the only one that will
6911 * exist for sure until all the requests on a device are gone).
6913 void bfq_put_async_queues(struct bfq_data *bfqd, struct bfq_group *bfqg)
6917 for (i = 0; i < 2; i++)
6918 for (j = 0; j < IOPRIO_NR_LEVELS; j++)
6919 __bfq_put_async_bfqq(bfqd, &bfqg->async_bfqq[i][j]);
6921 __bfq_put_async_bfqq(bfqd, &bfqg->async_idle_bfqq);
6925 * See the comments on bfq_limit_depth for the purpose of
6926 * the depths set in the function. Return minimum shallow depth we'll use.
6928 static void bfq_update_depths(struct bfq_data *bfqd, struct sbitmap_queue *bt)
6930 unsigned int depth = 1U << bt->sb.shift;
6932 bfqd->full_depth_shift = bt->sb.shift;
6934 * In-word depths if no bfq_queue is being weight-raised:
6935 * leaving 25% of tags only for sync reads.
6937 * In next formulas, right-shift the value
6938 * (1U<<bt->sb.shift), instead of computing directly
6939 * (1U<<(bt->sb.shift - something)), to be robust against
6940 * any possible value of bt->sb.shift, without having to
6941 * limit 'something'.
6943 /* no more than 50% of tags for async I/O */
6944 bfqd->word_depths[0][0] = max(depth >> 1, 1U);
6946 * no more than 75% of tags for sync writes (25% extra tags
6947 * w.r.t. async I/O, to prevent async I/O from starving sync
6950 bfqd->word_depths[0][1] = max((depth * 3) >> 2, 1U);
6953 * In-word depths in case some bfq_queue is being weight-
6954 * raised: leaving ~63% of tags for sync reads. This is the
6955 * highest percentage for which, in our tests, application
6956 * start-up times didn't suffer from any regression due to tag
6959 /* no more than ~18% of tags for async I/O */
6960 bfqd->word_depths[1][0] = max((depth * 3) >> 4, 1U);
6961 /* no more than ~37% of tags for sync writes (~20% extra tags) */
6962 bfqd->word_depths[1][1] = max((depth * 6) >> 4, 1U);
6965 static void bfq_depth_updated(struct blk_mq_hw_ctx *hctx)
6967 struct bfq_data *bfqd = hctx->queue->elevator->elevator_data;
6968 struct blk_mq_tags *tags = hctx->sched_tags;
6970 bfq_update_depths(bfqd, &tags->bitmap_tags);
6971 sbitmap_queue_min_shallow_depth(&tags->bitmap_tags, 1);
6974 static int bfq_init_hctx(struct blk_mq_hw_ctx *hctx, unsigned int index)
6976 bfq_depth_updated(hctx);
6980 static void bfq_exit_queue(struct elevator_queue *e)
6982 struct bfq_data *bfqd = e->elevator_data;
6983 struct bfq_queue *bfqq, *n;
6985 hrtimer_cancel(&bfqd->idle_slice_timer);
6987 spin_lock_irq(&bfqd->lock);
6988 list_for_each_entry_safe(bfqq, n, &bfqd->idle_list, bfqq_list)
6989 bfq_deactivate_bfqq(bfqd, bfqq, false, false);
6990 spin_unlock_irq(&bfqd->lock);
6992 hrtimer_cancel(&bfqd->idle_slice_timer);
6994 /* release oom-queue reference to root group */
6995 bfqg_and_blkg_put(bfqd->root_group);
6997 #ifdef CONFIG_BFQ_GROUP_IOSCHED
6998 blkcg_deactivate_policy(bfqd->queue, &blkcg_policy_bfq);
7000 spin_lock_irq(&bfqd->lock);
7001 bfq_put_async_queues(bfqd, bfqd->root_group);
7002 kfree(bfqd->root_group);
7003 spin_unlock_irq(&bfqd->lock);
7006 blk_stat_disable_accounting(bfqd->queue);
7007 clear_bit(ELEVATOR_FLAG_DISABLE_WBT, &e->flags);
7008 wbt_enable_default(bfqd->queue);
7013 static void bfq_init_root_group(struct bfq_group *root_group,
7014 struct bfq_data *bfqd)
7018 #ifdef CONFIG_BFQ_GROUP_IOSCHED
7019 root_group->entity.parent = NULL;
7020 root_group->my_entity = NULL;
7021 root_group->bfqd = bfqd;
7023 root_group->rq_pos_tree = RB_ROOT;
7024 for (i = 0; i < BFQ_IOPRIO_CLASSES; i++)
7025 root_group->sched_data.service_tree[i] = BFQ_SERVICE_TREE_INIT;
7026 root_group->sched_data.bfq_class_idle_last_service = jiffies;
7029 static int bfq_init_queue(struct request_queue *q, struct elevator_type *e)
7031 struct bfq_data *bfqd;
7032 struct elevator_queue *eq;
7034 eq = elevator_alloc(q, e);
7038 bfqd = kzalloc_node(sizeof(*bfqd), GFP_KERNEL, q->node);
7040 kobject_put(&eq->kobj);
7043 eq->elevator_data = bfqd;
7045 spin_lock_irq(&q->queue_lock);
7047 spin_unlock_irq(&q->queue_lock);
7050 * Our fallback bfqq if bfq_find_alloc_queue() runs into OOM issues.
7051 * Grab a permanent reference to it, so that the normal code flow
7052 * will not attempt to free it.
7054 bfq_init_bfqq(bfqd, &bfqd->oom_bfqq, NULL, 1, 0);
7055 bfqd->oom_bfqq.ref++;
7056 bfqd->oom_bfqq.new_ioprio = BFQ_DEFAULT_QUEUE_IOPRIO;
7057 bfqd->oom_bfqq.new_ioprio_class = IOPRIO_CLASS_BE;
7058 bfqd->oom_bfqq.entity.new_weight =
7059 bfq_ioprio_to_weight(bfqd->oom_bfqq.new_ioprio);
7061 /* oom_bfqq does not participate to bursts */
7062 bfq_clear_bfqq_just_created(&bfqd->oom_bfqq);
7065 * Trigger weight initialization, according to ioprio, at the
7066 * oom_bfqq's first activation. The oom_bfqq's ioprio and ioprio
7067 * class won't be changed any more.
7069 bfqd->oom_bfqq.entity.prio_changed = 1;
7073 INIT_LIST_HEAD(&bfqd->dispatch);
7075 hrtimer_init(&bfqd->idle_slice_timer, CLOCK_MONOTONIC,
7077 bfqd->idle_slice_timer.function = bfq_idle_slice_timer;
7079 bfqd->queue_weights_tree = RB_ROOT_CACHED;
7080 bfqd->num_groups_with_pending_reqs = 0;
7082 INIT_LIST_HEAD(&bfqd->active_list);
7083 INIT_LIST_HEAD(&bfqd->idle_list);
7084 INIT_HLIST_HEAD(&bfqd->burst_list);
7087 bfqd->nonrot_with_queueing = blk_queue_nonrot(bfqd->queue);
7089 bfqd->bfq_max_budget = bfq_default_max_budget;
7091 bfqd->bfq_fifo_expire[0] = bfq_fifo_expire[0];
7092 bfqd->bfq_fifo_expire[1] = bfq_fifo_expire[1];
7093 bfqd->bfq_back_max = bfq_back_max;
7094 bfqd->bfq_back_penalty = bfq_back_penalty;
7095 bfqd->bfq_slice_idle = bfq_slice_idle;
7096 bfqd->bfq_timeout = bfq_timeout;
7098 bfqd->bfq_large_burst_thresh = 8;
7099 bfqd->bfq_burst_interval = msecs_to_jiffies(180);
7101 bfqd->low_latency = true;
7104 * Trade-off between responsiveness and fairness.
7106 bfqd->bfq_wr_coeff = 30;
7107 bfqd->bfq_wr_rt_max_time = msecs_to_jiffies(300);
7108 bfqd->bfq_wr_max_time = 0;
7109 bfqd->bfq_wr_min_idle_time = msecs_to_jiffies(2000);
7110 bfqd->bfq_wr_min_inter_arr_async = msecs_to_jiffies(500);
7111 bfqd->bfq_wr_max_softrt_rate = 7000; /*
7112 * Approximate rate required
7113 * to playback or record a
7114 * high-definition compressed
7117 bfqd->wr_busy_queues = 0;
7120 * Begin by assuming, optimistically, that the device peak
7121 * rate is equal to 2/3 of the highest reference rate.
7123 bfqd->rate_dur_prod = ref_rate[blk_queue_nonrot(bfqd->queue)] *
7124 ref_wr_duration[blk_queue_nonrot(bfqd->queue)];
7125 bfqd->peak_rate = ref_rate[blk_queue_nonrot(bfqd->queue)] * 2 / 3;
7127 spin_lock_init(&bfqd->lock);
7130 * The invocation of the next bfq_create_group_hierarchy
7131 * function is the head of a chain of function calls
7132 * (bfq_create_group_hierarchy->blkcg_activate_policy->
7133 * blk_mq_freeze_queue) that may lead to the invocation of the
7134 * has_work hook function. For this reason,
7135 * bfq_create_group_hierarchy is invoked only after all
7136 * scheduler data has been initialized, apart from the fields
7137 * that can be initialized only after invoking
7138 * bfq_create_group_hierarchy. This, in particular, enables
7139 * has_work to correctly return false. Of course, to avoid
7140 * other inconsistencies, the blk-mq stack must then refrain
7141 * from invoking further scheduler hooks before this init
7142 * function is finished.
7144 bfqd->root_group = bfq_create_group_hierarchy(bfqd, q->node);
7145 if (!bfqd->root_group)
7147 bfq_init_root_group(bfqd->root_group, bfqd);
7148 bfq_init_entity(&bfqd->oom_bfqq.entity, bfqd->root_group);
7150 /* We dispatch from request queue wide instead of hw queue */
7151 blk_queue_flag_set(QUEUE_FLAG_SQ_SCHED, q);
7153 set_bit(ELEVATOR_FLAG_DISABLE_WBT, &eq->flags);
7154 wbt_disable_default(q);
7155 blk_stat_enable_accounting(q);
7161 kobject_put(&eq->kobj);
7165 static void bfq_slab_kill(void)
7167 kmem_cache_destroy(bfq_pool);
7170 static int __init bfq_slab_setup(void)
7172 bfq_pool = KMEM_CACHE(bfq_queue, 0);
7178 static ssize_t bfq_var_show(unsigned int var, char *page)
7180 return sprintf(page, "%u\n", var);
7183 static int bfq_var_store(unsigned long *var, const char *page)
7185 unsigned long new_val;
7186 int ret = kstrtoul(page, 10, &new_val);
7194 #define SHOW_FUNCTION(__FUNC, __VAR, __CONV) \
7195 static ssize_t __FUNC(struct elevator_queue *e, char *page) \
7197 struct bfq_data *bfqd = e->elevator_data; \
7198 u64 __data = __VAR; \
7200 __data = jiffies_to_msecs(__data); \
7201 else if (__CONV == 2) \
7202 __data = div_u64(__data, NSEC_PER_MSEC); \
7203 return bfq_var_show(__data, (page)); \
7205 SHOW_FUNCTION(bfq_fifo_expire_sync_show, bfqd->bfq_fifo_expire[1], 2);
7206 SHOW_FUNCTION(bfq_fifo_expire_async_show, bfqd->bfq_fifo_expire[0], 2);
7207 SHOW_FUNCTION(bfq_back_seek_max_show, bfqd->bfq_back_max, 0);
7208 SHOW_FUNCTION(bfq_back_seek_penalty_show, bfqd->bfq_back_penalty, 0);
7209 SHOW_FUNCTION(bfq_slice_idle_show, bfqd->bfq_slice_idle, 2);
7210 SHOW_FUNCTION(bfq_max_budget_show, bfqd->bfq_user_max_budget, 0);
7211 SHOW_FUNCTION(bfq_timeout_sync_show, bfqd->bfq_timeout, 1);
7212 SHOW_FUNCTION(bfq_strict_guarantees_show, bfqd->strict_guarantees, 0);
7213 SHOW_FUNCTION(bfq_low_latency_show, bfqd->low_latency, 0);
7214 #undef SHOW_FUNCTION
7216 #define USEC_SHOW_FUNCTION(__FUNC, __VAR) \
7217 static ssize_t __FUNC(struct elevator_queue *e, char *page) \
7219 struct bfq_data *bfqd = e->elevator_data; \
7220 u64 __data = __VAR; \
7221 __data = div_u64(__data, NSEC_PER_USEC); \
7222 return bfq_var_show(__data, (page)); \
7224 USEC_SHOW_FUNCTION(bfq_slice_idle_us_show, bfqd->bfq_slice_idle);
7225 #undef USEC_SHOW_FUNCTION
7227 #define STORE_FUNCTION(__FUNC, __PTR, MIN, MAX, __CONV) \
7229 __FUNC(struct elevator_queue *e, const char *page, size_t count) \
7231 struct bfq_data *bfqd = e->elevator_data; \
7232 unsigned long __data, __min = (MIN), __max = (MAX); \
7235 ret = bfq_var_store(&__data, (page)); \
7238 if (__data < __min) \
7240 else if (__data > __max) \
7243 *(__PTR) = msecs_to_jiffies(__data); \
7244 else if (__CONV == 2) \
7245 *(__PTR) = (u64)__data * NSEC_PER_MSEC; \
7247 *(__PTR) = __data; \
7250 STORE_FUNCTION(bfq_fifo_expire_sync_store, &bfqd->bfq_fifo_expire[1], 1,
7252 STORE_FUNCTION(bfq_fifo_expire_async_store, &bfqd->bfq_fifo_expire[0], 1,
7254 STORE_FUNCTION(bfq_back_seek_max_store, &bfqd->bfq_back_max, 0, INT_MAX, 0);
7255 STORE_FUNCTION(bfq_back_seek_penalty_store, &bfqd->bfq_back_penalty, 1,
7257 STORE_FUNCTION(bfq_slice_idle_store, &bfqd->bfq_slice_idle, 0, INT_MAX, 2);
7258 #undef STORE_FUNCTION
7260 #define USEC_STORE_FUNCTION(__FUNC, __PTR, MIN, MAX) \
7261 static ssize_t __FUNC(struct elevator_queue *e, const char *page, size_t count)\
7263 struct bfq_data *bfqd = e->elevator_data; \
7264 unsigned long __data, __min = (MIN), __max = (MAX); \
7267 ret = bfq_var_store(&__data, (page)); \
7270 if (__data < __min) \
7272 else if (__data > __max) \
7274 *(__PTR) = (u64)__data * NSEC_PER_USEC; \
7277 USEC_STORE_FUNCTION(bfq_slice_idle_us_store, &bfqd->bfq_slice_idle, 0,
7279 #undef USEC_STORE_FUNCTION
7281 static ssize_t bfq_max_budget_store(struct elevator_queue *e,
7282 const char *page, size_t count)
7284 struct bfq_data *bfqd = e->elevator_data;
7285 unsigned long __data;
7288 ret = bfq_var_store(&__data, (page));
7293 bfqd->bfq_max_budget = bfq_calc_max_budget(bfqd);
7295 if (__data > INT_MAX)
7297 bfqd->bfq_max_budget = __data;
7300 bfqd->bfq_user_max_budget = __data;
7306 * Leaving this name to preserve name compatibility with cfq
7307 * parameters, but this timeout is used for both sync and async.
7309 static ssize_t bfq_timeout_sync_store(struct elevator_queue *e,
7310 const char *page, size_t count)
7312 struct bfq_data *bfqd = e->elevator_data;
7313 unsigned long __data;
7316 ret = bfq_var_store(&__data, (page));
7322 else if (__data > INT_MAX)
7325 bfqd->bfq_timeout = msecs_to_jiffies(__data);
7326 if (bfqd->bfq_user_max_budget == 0)
7327 bfqd->bfq_max_budget = bfq_calc_max_budget(bfqd);
7332 static ssize_t bfq_strict_guarantees_store(struct elevator_queue *e,
7333 const char *page, size_t count)
7335 struct bfq_data *bfqd = e->elevator_data;
7336 unsigned long __data;
7339 ret = bfq_var_store(&__data, (page));
7345 if (!bfqd->strict_guarantees && __data == 1
7346 && bfqd->bfq_slice_idle < 8 * NSEC_PER_MSEC)
7347 bfqd->bfq_slice_idle = 8 * NSEC_PER_MSEC;
7349 bfqd->strict_guarantees = __data;
7354 static ssize_t bfq_low_latency_store(struct elevator_queue *e,
7355 const char *page, size_t count)
7357 struct bfq_data *bfqd = e->elevator_data;
7358 unsigned long __data;
7361 ret = bfq_var_store(&__data, (page));
7367 if (__data == 0 && bfqd->low_latency != 0)
7369 bfqd->low_latency = __data;
7374 #define BFQ_ATTR(name) \
7375 __ATTR(name, 0644, bfq_##name##_show, bfq_##name##_store)
7377 static struct elv_fs_entry bfq_attrs[] = {
7378 BFQ_ATTR(fifo_expire_sync),
7379 BFQ_ATTR(fifo_expire_async),
7380 BFQ_ATTR(back_seek_max),
7381 BFQ_ATTR(back_seek_penalty),
7382 BFQ_ATTR(slice_idle),
7383 BFQ_ATTR(slice_idle_us),
7384 BFQ_ATTR(max_budget),
7385 BFQ_ATTR(timeout_sync),
7386 BFQ_ATTR(strict_guarantees),
7387 BFQ_ATTR(low_latency),
7391 static struct elevator_type iosched_bfq_mq = {
7393 .limit_depth = bfq_limit_depth,
7394 .prepare_request = bfq_prepare_request,
7395 .requeue_request = bfq_finish_requeue_request,
7396 .finish_request = bfq_finish_request,
7397 .exit_icq = bfq_exit_icq,
7398 .insert_requests = bfq_insert_requests,
7399 .dispatch_request = bfq_dispatch_request,
7400 .next_request = elv_rb_latter_request,
7401 .former_request = elv_rb_former_request,
7402 .allow_merge = bfq_allow_bio_merge,
7403 .bio_merge = bfq_bio_merge,
7404 .request_merge = bfq_request_merge,
7405 .requests_merged = bfq_requests_merged,
7406 .request_merged = bfq_request_merged,
7407 .has_work = bfq_has_work,
7408 .depth_updated = bfq_depth_updated,
7409 .init_hctx = bfq_init_hctx,
7410 .init_sched = bfq_init_queue,
7411 .exit_sched = bfq_exit_queue,
7414 .icq_size = sizeof(struct bfq_io_cq),
7415 .icq_align = __alignof__(struct bfq_io_cq),
7416 .elevator_attrs = bfq_attrs,
7417 .elevator_name = "bfq",
7418 .elevator_owner = THIS_MODULE,
7420 MODULE_ALIAS("bfq-iosched");
7422 static int __init bfq_init(void)
7426 #ifdef CONFIG_BFQ_GROUP_IOSCHED
7427 ret = blkcg_policy_register(&blkcg_policy_bfq);
7433 if (bfq_slab_setup())
7437 * Times to load large popular applications for the typical
7438 * systems installed on the reference devices (see the
7439 * comments before the definition of the next
7440 * array). Actually, we use slightly lower values, as the
7441 * estimated peak rate tends to be smaller than the actual
7442 * peak rate. The reason for this last fact is that estimates
7443 * are computed over much shorter time intervals than the long
7444 * intervals typically used for benchmarking. Why? First, to
7445 * adapt more quickly to variations. Second, because an I/O
7446 * scheduler cannot rely on a peak-rate-evaluation workload to
7447 * be run for a long time.
7449 ref_wr_duration[0] = msecs_to_jiffies(7000); /* actually 8 sec */
7450 ref_wr_duration[1] = msecs_to_jiffies(2500); /* actually 3 sec */
7452 ret = elv_register(&iosched_bfq_mq);
7461 #ifdef CONFIG_BFQ_GROUP_IOSCHED
7462 blkcg_policy_unregister(&blkcg_policy_bfq);
7467 static void __exit bfq_exit(void)
7469 elv_unregister(&iosched_bfq_mq);
7470 #ifdef CONFIG_BFQ_GROUP_IOSCHED
7471 blkcg_policy_unregister(&blkcg_policy_bfq);
7476 module_init(bfq_init);
7477 module_exit(bfq_exit);
7479 MODULE_AUTHOR("Paolo Valente");
7480 MODULE_LICENSE("GPL");
7481 MODULE_DESCRIPTION("MQ Budget Fair Queueing I/O Scheduler");