]>
Commit | Line | Data |
---|---|---|
b2441318 | 1 | // SPDX-License-Identifier: GPL-2.0 |
e43473b7 VG |
2 | /* |
3 | * Interface for controlling IO bandwidth on a request queue | |
4 | * | |
5 | * Copyright (C) 2010 Vivek Goyal <vgoyal@redhat.com> | |
6 | */ | |
7 | ||
8 | #include <linux/module.h> | |
9 | #include <linux/slab.h> | |
10 | #include <linux/blkdev.h> | |
11 | #include <linux/bio.h> | |
12 | #include <linux/blktrace_api.h> | |
eea8f41c | 13 | #include <linux/blk-cgroup.h> |
bc9fcbf9 | 14 | #include "blk.h" |
1d156646 | 15 | #include "blk-cgroup-rwstat.h" |
e43473b7 VG |
16 | |
17 | /* Max dispatch from a group in 1 round */ | |
e675df2a | 18 | #define THROTL_GRP_QUANTUM 8 |
e43473b7 VG |
19 | |
20 | /* Total max dispatch from all groups in one round */ | |
e675df2a | 21 | #define THROTL_QUANTUM 32 |
e43473b7 | 22 | |
d61fcfa4 SL |
23 | /* Throttling is performed over a slice and after that slice is renewed */ |
24 | #define DFL_THROTL_SLICE_HD (HZ / 10) | |
25 | #define DFL_THROTL_SLICE_SSD (HZ / 50) | |
297e3d85 | 26 | #define MAX_THROTL_SLICE (HZ) |
9e234eea | 27 | #define MAX_IDLE_TIME (5L * 1000 * 1000) /* 5 s */ |
9bb67aeb SL |
28 | #define MIN_THROTL_BPS (320 * 1024) |
29 | #define MIN_THROTL_IOPS (10) | |
b4f428ef SL |
30 | #define DFL_LATENCY_TARGET (-1L) |
31 | #define DFL_IDLE_THRESHOLD (0) | |
6679a90c SL |
32 | #define DFL_HD_BASELINE_LATENCY (4000L) /* 4ms */ |
33 | #define LATENCY_FILTERED_SSD (0) | |
34 | /* | |
35 | * For HD, very small latency comes from sequential IO. Such IO is helpless to | |
36 | * help determine if its IO is impacted by others, hence we ignore the IO | |
37 | */ | |
38 | #define LATENCY_FILTERED_HD (1000L) /* 1ms */ | |
e43473b7 | 39 | |
3c798398 | 40 | static struct blkcg_policy blkcg_policy_throtl; |
0381411e | 41 | |
450adcbe VG |
42 | /* A workqueue to queue throttle related work */ |
43 | static struct workqueue_struct *kthrotld_workqueue; | |
450adcbe | 44 | |
c5cc2070 TH |
45 | /* |
46 | * To implement hierarchical throttling, throtl_grps form a tree and bios | |
47 | * are dispatched upwards level by level until they reach the top and get | |
48 | * issued. When dispatching bios from the children and local group at each | |
49 | * level, if the bios are dispatched into a single bio_list, there's a risk | |
50 | * of a local or child group which can queue many bios at once filling up | |
51 | * the list starving others. | |
52 | * | |
53 | * To avoid such starvation, dispatched bios are queued separately | |
54 | * according to where they came from. When they are again dispatched to | |
55 | * the parent, they're popped in round-robin order so that no single source | |
56 | * hogs the dispatch window. | |
57 | * | |
58 | * throtl_qnode is used to keep the queued bios separated by their sources. | |
59 | * Bios are queued to throtl_qnode which in turn is queued to | |
60 | * throtl_service_queue and then dispatched in round-robin order. | |
61 | * | |
62 | * It's also used to track the reference counts on blkg's. A qnode always | |
63 | * belongs to a throtl_grp and gets queued on itself or the parent, so | |
64 | * incrementing the reference of the associated throtl_grp when a qnode is | |
65 | * queued and decrementing when dequeued is enough to keep the whole blkg | |
66 | * tree pinned while bios are in flight. | |
67 | */ | |
68 | struct throtl_qnode { | |
69 | struct list_head node; /* service_queue->queued[] */ | |
70 | struct bio_list bios; /* queued bios */ | |
71 | struct throtl_grp *tg; /* tg this qnode belongs to */ | |
72 | }; | |
73 | ||
c9e0332e | 74 | struct throtl_service_queue { |
77216b04 TH |
75 | struct throtl_service_queue *parent_sq; /* the parent service_queue */ |
76 | ||
73f0d49a TH |
77 | /* |
78 | * Bios queued directly to this service_queue or dispatched from | |
79 | * children throtl_grp's. | |
80 | */ | |
c5cc2070 | 81 | struct list_head queued[2]; /* throtl_qnode [READ/WRITE] */ |
73f0d49a TH |
82 | unsigned int nr_queued[2]; /* number of queued bios */ |
83 | ||
84 | /* | |
85 | * RB tree of active children throtl_grp's, which are sorted by | |
86 | * their ->disptime. | |
87 | */ | |
9ff01255 | 88 | struct rb_root_cached pending_tree; /* RB tree of active tgs */ |
c9e0332e TH |
89 | unsigned int nr_pending; /* # queued in the tree */ |
90 | unsigned long first_pending_disptime; /* disptime of the first tg */ | |
69df0ab0 | 91 | struct timer_list pending_timer; /* fires on first_pending_disptime */ |
e43473b7 VG |
92 | }; |
93 | ||
5b2c16aa TH |
94 | enum tg_state_flags { |
95 | THROTL_TG_PENDING = 1 << 0, /* on parent's pending tree */ | |
0e9f4164 | 96 | THROTL_TG_WAS_EMPTY = 1 << 1, /* bio_lists[] became non-empty */ |
5b2c16aa TH |
97 | }; |
98 | ||
e43473b7 VG |
99 | #define rb_entry_tg(node) rb_entry((node), struct throtl_grp, rb_node) |
100 | ||
9f626e37 | 101 | enum { |
cd5ab1b0 | 102 | LIMIT_LOW, |
9f626e37 SL |
103 | LIMIT_MAX, |
104 | LIMIT_CNT, | |
105 | }; | |
106 | ||
e43473b7 | 107 | struct throtl_grp { |
f95a04af TH |
108 | /* must be the first member */ |
109 | struct blkg_policy_data pd; | |
110 | ||
c9e0332e | 111 | /* active throtl group service_queue member */ |
e43473b7 VG |
112 | struct rb_node rb_node; |
113 | ||
0f3457f6 TH |
114 | /* throtl_data this group belongs to */ |
115 | struct throtl_data *td; | |
116 | ||
49a2f1e3 TH |
117 | /* this group's service queue */ |
118 | struct throtl_service_queue service_queue; | |
119 | ||
c5cc2070 TH |
120 | /* |
121 | * qnode_on_self is used when bios are directly queued to this | |
122 | * throtl_grp so that local bios compete fairly with bios | |
123 | * dispatched from children. qnode_on_parent is used when bios are | |
124 | * dispatched from this throtl_grp into its parent and will compete | |
125 | * with the sibling qnode_on_parents and the parent's | |
126 | * qnode_on_self. | |
127 | */ | |
128 | struct throtl_qnode qnode_on_self[2]; | |
129 | struct throtl_qnode qnode_on_parent[2]; | |
130 | ||
e43473b7 VG |
131 | /* |
132 | * Dispatch time in jiffies. This is the estimated time when group | |
133 | * will unthrottle and is ready to dispatch more bio. It is used as | |
134 | * key to sort active groups in service tree. | |
135 | */ | |
136 | unsigned long disptime; | |
137 | ||
e43473b7 VG |
138 | unsigned int flags; |
139 | ||
693e751e TH |
140 | /* are there any throtl rules between this group and td? */ |
141 | bool has_rules[2]; | |
142 | ||
cd5ab1b0 | 143 | /* internally used bytes per second rate limits */ |
9f626e37 | 144 | uint64_t bps[2][LIMIT_CNT]; |
cd5ab1b0 SL |
145 | /* user configured bps limits */ |
146 | uint64_t bps_conf[2][LIMIT_CNT]; | |
e43473b7 | 147 | |
cd5ab1b0 | 148 | /* internally used IOPS limits */ |
9f626e37 | 149 | unsigned int iops[2][LIMIT_CNT]; |
cd5ab1b0 SL |
150 | /* user configured IOPS limits */ |
151 | unsigned int iops_conf[2][LIMIT_CNT]; | |
8e89d13f | 152 | |
b53b072c | 153 | /* Number of bytes dispatched in current slice */ |
e43473b7 | 154 | uint64_t bytes_disp[2]; |
8e89d13f VG |
155 | /* Number of bio's dispatched in current slice */ |
156 | unsigned int io_disp[2]; | |
e43473b7 | 157 | |
3f0abd80 SL |
158 | unsigned long last_low_overflow_time[2]; |
159 | ||
160 | uint64_t last_bytes_disp[2]; | |
161 | unsigned int last_io_disp[2]; | |
162 | ||
163 | unsigned long last_check_time; | |
164 | ||
ec80991d | 165 | unsigned long latency_target; /* us */ |
5b81fc3c | 166 | unsigned long latency_target_conf; /* us */ |
e43473b7 VG |
167 | /* When did we start a new slice */ |
168 | unsigned long slice_start[2]; | |
169 | unsigned long slice_end[2]; | |
9e234eea SL |
170 | |
171 | unsigned long last_finish_time; /* ns / 1024 */ | |
172 | unsigned long checked_last_finish_time; /* ns / 1024 */ | |
173 | unsigned long avg_idletime; /* ns / 1024 */ | |
174 | unsigned long idletime_threshold; /* us */ | |
5b81fc3c | 175 | unsigned long idletime_threshold_conf; /* us */ |
53696b8d SL |
176 | |
177 | unsigned int bio_cnt; /* total bios */ | |
178 | unsigned int bad_bio_cnt; /* bios exceeding latency threshold */ | |
179 | unsigned long bio_cnt_reset_time; | |
7ca46438 | 180 | |
4f1e9630 CX |
181 | atomic_t io_split_cnt[2]; |
182 | atomic_t last_io_split_cnt[2]; | |
183 | ||
7ca46438 TH |
184 | struct blkg_rwstat stat_bytes; |
185 | struct blkg_rwstat stat_ios; | |
e43473b7 VG |
186 | }; |
187 | ||
b9147dd1 SL |
188 | /* We measure latency for request size from <= 4k to >= 1M */ |
189 | #define LATENCY_BUCKET_SIZE 9 | |
190 | ||
191 | struct latency_bucket { | |
192 | unsigned long total_latency; /* ns / 1024 */ | |
193 | int samples; | |
194 | }; | |
195 | ||
196 | struct avg_latency_bucket { | |
197 | unsigned long latency; /* ns / 1024 */ | |
198 | bool valid; | |
199 | }; | |
200 | ||
e43473b7 VG |
201 | struct throtl_data |
202 | { | |
e43473b7 | 203 | /* service tree for active throtl groups */ |
c9e0332e | 204 | struct throtl_service_queue service_queue; |
e43473b7 | 205 | |
e43473b7 VG |
206 | struct request_queue *queue; |
207 | ||
208 | /* Total Number of queued bios on READ and WRITE lists */ | |
209 | unsigned int nr_queued[2]; | |
210 | ||
297e3d85 SL |
211 | unsigned int throtl_slice; |
212 | ||
e43473b7 | 213 | /* Work for dispatching throttled bios */ |
69df0ab0 | 214 | struct work_struct dispatch_work; |
9f626e37 SL |
215 | unsigned int limit_index; |
216 | bool limit_valid[LIMIT_CNT]; | |
3f0abd80 SL |
217 | |
218 | unsigned long low_upgrade_time; | |
219 | unsigned long low_downgrade_time; | |
7394e31f SL |
220 | |
221 | unsigned int scale; | |
b9147dd1 | 222 | |
b889bf66 JQ |
223 | struct latency_bucket tmp_buckets[2][LATENCY_BUCKET_SIZE]; |
224 | struct avg_latency_bucket avg_buckets[2][LATENCY_BUCKET_SIZE]; | |
225 | struct latency_bucket __percpu *latency_buckets[2]; | |
b9147dd1 | 226 | unsigned long last_calculate_time; |
6679a90c | 227 | unsigned long filtered_latency; |
b9147dd1 SL |
228 | |
229 | bool track_bio_latency; | |
e43473b7 VG |
230 | }; |
231 | ||
e99e88a9 | 232 | static void throtl_pending_timer_fn(struct timer_list *t); |
69df0ab0 | 233 | |
f95a04af TH |
234 | static inline struct throtl_grp *pd_to_tg(struct blkg_policy_data *pd) |
235 | { | |
236 | return pd ? container_of(pd, struct throtl_grp, pd) : NULL; | |
237 | } | |
238 | ||
3c798398 | 239 | static inline struct throtl_grp *blkg_to_tg(struct blkcg_gq *blkg) |
0381411e | 240 | { |
f95a04af | 241 | return pd_to_tg(blkg_to_pd(blkg, &blkcg_policy_throtl)); |
0381411e TH |
242 | } |
243 | ||
3c798398 | 244 | static inline struct blkcg_gq *tg_to_blkg(struct throtl_grp *tg) |
0381411e | 245 | { |
f95a04af | 246 | return pd_to_blkg(&tg->pd); |
0381411e TH |
247 | } |
248 | ||
fda6f272 TH |
249 | /** |
250 | * sq_to_tg - return the throl_grp the specified service queue belongs to | |
251 | * @sq: the throtl_service_queue of interest | |
252 | * | |
253 | * Return the throtl_grp @sq belongs to. If @sq is the top-level one | |
254 | * embedded in throtl_data, %NULL is returned. | |
255 | */ | |
256 | static struct throtl_grp *sq_to_tg(struct throtl_service_queue *sq) | |
257 | { | |
258 | if (sq && sq->parent_sq) | |
259 | return container_of(sq, struct throtl_grp, service_queue); | |
260 | else | |
261 | return NULL; | |
262 | } | |
263 | ||
264 | /** | |
265 | * sq_to_td - return throtl_data the specified service queue belongs to | |
266 | * @sq: the throtl_service_queue of interest | |
267 | * | |
b43daedc | 268 | * A service_queue can be embedded in either a throtl_grp or throtl_data. |
fda6f272 TH |
269 | * Determine the associated throtl_data accordingly and return it. |
270 | */ | |
271 | static struct throtl_data *sq_to_td(struct throtl_service_queue *sq) | |
272 | { | |
273 | struct throtl_grp *tg = sq_to_tg(sq); | |
274 | ||
275 | if (tg) | |
276 | return tg->td; | |
277 | else | |
278 | return container_of(sq, struct throtl_data, service_queue); | |
279 | } | |
280 | ||
7394e31f SL |
281 | /* |
282 | * cgroup's limit in LIMIT_MAX is scaled if low limit is set. This scale is to | |
283 | * make the IO dispatch more smooth. | |
284 | * Scale up: linearly scale up according to lapsed time since upgrade. For | |
285 | * every throtl_slice, the limit scales up 1/2 .low limit till the | |
286 | * limit hits .max limit | |
287 | * Scale down: exponentially scale down if a cgroup doesn't hit its .low limit | |
288 | */ | |
289 | static uint64_t throtl_adjusted_limit(uint64_t low, struct throtl_data *td) | |
290 | { | |
291 | /* arbitrary value to avoid too big scale */ | |
292 | if (td->scale < 4096 && time_after_eq(jiffies, | |
293 | td->low_upgrade_time + td->scale * td->throtl_slice)) | |
294 | td->scale = (jiffies - td->low_upgrade_time) / td->throtl_slice; | |
295 | ||
296 | return low + (low >> 1) * td->scale; | |
297 | } | |
298 | ||
9f626e37 SL |
299 | static uint64_t tg_bps_limit(struct throtl_grp *tg, int rw) |
300 | { | |
b22c417c | 301 | struct blkcg_gq *blkg = tg_to_blkg(tg); |
7394e31f | 302 | struct throtl_data *td; |
b22c417c SL |
303 | uint64_t ret; |
304 | ||
305 | if (cgroup_subsys_on_dfl(io_cgrp_subsys) && !blkg->parent) | |
306 | return U64_MAX; | |
7394e31f SL |
307 | |
308 | td = tg->td; | |
309 | ret = tg->bps[rw][td->limit_index]; | |
9bb67aeb SL |
310 | if (ret == 0 && td->limit_index == LIMIT_LOW) { |
311 | /* intermediate node or iops isn't 0 */ | |
312 | if (!list_empty(&blkg->blkcg->css.children) || | |
313 | tg->iops[rw][td->limit_index]) | |
314 | return U64_MAX; | |
315 | else | |
316 | return MIN_THROTL_BPS; | |
317 | } | |
7394e31f SL |
318 | |
319 | if (td->limit_index == LIMIT_MAX && tg->bps[rw][LIMIT_LOW] && | |
320 | tg->bps[rw][LIMIT_LOW] != tg->bps[rw][LIMIT_MAX]) { | |
321 | uint64_t adjusted; | |
322 | ||
323 | adjusted = throtl_adjusted_limit(tg->bps[rw][LIMIT_LOW], td); | |
324 | ret = min(tg->bps[rw][LIMIT_MAX], adjusted); | |
325 | } | |
b22c417c | 326 | return ret; |
9f626e37 SL |
327 | } |
328 | ||
329 | static unsigned int tg_iops_limit(struct throtl_grp *tg, int rw) | |
330 | { | |
b22c417c | 331 | struct blkcg_gq *blkg = tg_to_blkg(tg); |
7394e31f | 332 | struct throtl_data *td; |
b22c417c SL |
333 | unsigned int ret; |
334 | ||
335 | if (cgroup_subsys_on_dfl(io_cgrp_subsys) && !blkg->parent) | |
336 | return UINT_MAX; | |
9bb67aeb | 337 | |
7394e31f SL |
338 | td = tg->td; |
339 | ret = tg->iops[rw][td->limit_index]; | |
9bb67aeb SL |
340 | if (ret == 0 && tg->td->limit_index == LIMIT_LOW) { |
341 | /* intermediate node or bps isn't 0 */ | |
342 | if (!list_empty(&blkg->blkcg->css.children) || | |
343 | tg->bps[rw][td->limit_index]) | |
344 | return UINT_MAX; | |
345 | else | |
346 | return MIN_THROTL_IOPS; | |
347 | } | |
7394e31f SL |
348 | |
349 | if (td->limit_index == LIMIT_MAX && tg->iops[rw][LIMIT_LOW] && | |
350 | tg->iops[rw][LIMIT_LOW] != tg->iops[rw][LIMIT_MAX]) { | |
351 | uint64_t adjusted; | |
352 | ||
353 | adjusted = throtl_adjusted_limit(tg->iops[rw][LIMIT_LOW], td); | |
354 | if (adjusted > UINT_MAX) | |
355 | adjusted = UINT_MAX; | |
356 | ret = min_t(unsigned int, tg->iops[rw][LIMIT_MAX], adjusted); | |
357 | } | |
b22c417c | 358 | return ret; |
9f626e37 SL |
359 | } |
360 | ||
b9147dd1 SL |
361 | #define request_bucket_index(sectors) \ |
362 | clamp_t(int, order_base_2(sectors) - 3, 0, LATENCY_BUCKET_SIZE - 1) | |
363 | ||
fda6f272 TH |
364 | /** |
365 | * throtl_log - log debug message via blktrace | |
366 | * @sq: the service_queue being reported | |
367 | * @fmt: printf format string | |
368 | * @args: printf args | |
369 | * | |
370 | * The messages are prefixed with "throtl BLKG_NAME" if @sq belongs to a | |
371 | * throtl_grp; otherwise, just "throtl". | |
fda6f272 TH |
372 | */ |
373 | #define throtl_log(sq, fmt, args...) do { \ | |
374 | struct throtl_grp *__tg = sq_to_tg((sq)); \ | |
375 | struct throtl_data *__td = sq_to_td((sq)); \ | |
376 | \ | |
377 | (void)__td; \ | |
59fa0224 SL |
378 | if (likely(!blk_trace_note_message_enabled(__td->queue))) \ |
379 | break; \ | |
fda6f272 | 380 | if ((__tg)) { \ |
35fe6d76 SL |
381 | blk_add_cgroup_trace_msg(__td->queue, \ |
382 | tg_to_blkg(__tg)->blkcg, "throtl " fmt, ##args);\ | |
fda6f272 TH |
383 | } else { \ |
384 | blk_add_trace_msg(__td->queue, "throtl " fmt, ##args); \ | |
385 | } \ | |
54e7ed12 | 386 | } while (0) |
e43473b7 | 387 | |
ea0ea2bc SL |
388 | static inline unsigned int throtl_bio_data_size(struct bio *bio) |
389 | { | |
390 | /* assume it's one sector */ | |
391 | if (unlikely(bio_op(bio) == REQ_OP_DISCARD)) | |
392 | return 512; | |
393 | return bio->bi_iter.bi_size; | |
394 | } | |
395 | ||
c5cc2070 TH |
396 | static void throtl_qnode_init(struct throtl_qnode *qn, struct throtl_grp *tg) |
397 | { | |
398 | INIT_LIST_HEAD(&qn->node); | |
399 | bio_list_init(&qn->bios); | |
400 | qn->tg = tg; | |
401 | } | |
402 | ||
403 | /** | |
404 | * throtl_qnode_add_bio - add a bio to a throtl_qnode and activate it | |
405 | * @bio: bio being added | |
406 | * @qn: qnode to add bio to | |
407 | * @queued: the service_queue->queued[] list @qn belongs to | |
408 | * | |
409 | * Add @bio to @qn and put @qn on @queued if it's not already on. | |
410 | * @qn->tg's reference count is bumped when @qn is activated. See the | |
411 | * comment on top of throtl_qnode definition for details. | |
412 | */ | |
413 | static void throtl_qnode_add_bio(struct bio *bio, struct throtl_qnode *qn, | |
414 | struct list_head *queued) | |
415 | { | |
416 | bio_list_add(&qn->bios, bio); | |
417 | if (list_empty(&qn->node)) { | |
418 | list_add_tail(&qn->node, queued); | |
419 | blkg_get(tg_to_blkg(qn->tg)); | |
420 | } | |
421 | } | |
422 | ||
423 | /** | |
424 | * throtl_peek_queued - peek the first bio on a qnode list | |
425 | * @queued: the qnode list to peek | |
426 | */ | |
427 | static struct bio *throtl_peek_queued(struct list_head *queued) | |
428 | { | |
b7b609de | 429 | struct throtl_qnode *qn; |
c5cc2070 TH |
430 | struct bio *bio; |
431 | ||
432 | if (list_empty(queued)) | |
433 | return NULL; | |
434 | ||
b7b609de | 435 | qn = list_first_entry(queued, struct throtl_qnode, node); |
c5cc2070 TH |
436 | bio = bio_list_peek(&qn->bios); |
437 | WARN_ON_ONCE(!bio); | |
438 | return bio; | |
439 | } | |
440 | ||
441 | /** | |
442 | * throtl_pop_queued - pop the first bio form a qnode list | |
443 | * @queued: the qnode list to pop a bio from | |
444 | * @tg_to_put: optional out argument for throtl_grp to put | |
445 | * | |
446 | * Pop the first bio from the qnode list @queued. After popping, the first | |
447 | * qnode is removed from @queued if empty or moved to the end of @queued so | |
448 | * that the popping order is round-robin. | |
449 | * | |
450 | * When the first qnode is removed, its associated throtl_grp should be put | |
451 | * too. If @tg_to_put is NULL, this function automatically puts it; | |
452 | * otherwise, *@tg_to_put is set to the throtl_grp to put and the caller is | |
453 | * responsible for putting it. | |
454 | */ | |
455 | static struct bio *throtl_pop_queued(struct list_head *queued, | |
456 | struct throtl_grp **tg_to_put) | |
457 | { | |
b7b609de | 458 | struct throtl_qnode *qn; |
c5cc2070 TH |
459 | struct bio *bio; |
460 | ||
461 | if (list_empty(queued)) | |
462 | return NULL; | |
463 | ||
b7b609de | 464 | qn = list_first_entry(queued, struct throtl_qnode, node); |
c5cc2070 TH |
465 | bio = bio_list_pop(&qn->bios); |
466 | WARN_ON_ONCE(!bio); | |
467 | ||
468 | if (bio_list_empty(&qn->bios)) { | |
469 | list_del_init(&qn->node); | |
470 | if (tg_to_put) | |
471 | *tg_to_put = qn->tg; | |
472 | else | |
473 | blkg_put(tg_to_blkg(qn->tg)); | |
474 | } else { | |
475 | list_move_tail(&qn->node, queued); | |
476 | } | |
477 | ||
478 | return bio; | |
479 | } | |
480 | ||
49a2f1e3 | 481 | /* init a service_queue, assumes the caller zeroed it */ |
b2ce2643 | 482 | static void throtl_service_queue_init(struct throtl_service_queue *sq) |
49a2f1e3 | 483 | { |
c5cc2070 TH |
484 | INIT_LIST_HEAD(&sq->queued[0]); |
485 | INIT_LIST_HEAD(&sq->queued[1]); | |
9ff01255 | 486 | sq->pending_tree = RB_ROOT_CACHED; |
e99e88a9 | 487 | timer_setup(&sq->pending_timer, throtl_pending_timer_fn, 0); |
69df0ab0 TH |
488 | } |
489 | ||
cf09a8ee TH |
490 | static struct blkg_policy_data *throtl_pd_alloc(gfp_t gfp, |
491 | struct request_queue *q, | |
492 | struct blkcg *blkcg) | |
001bea73 | 493 | { |
4fb72036 | 494 | struct throtl_grp *tg; |
24bdb8ef | 495 | int rw; |
4fb72036 | 496 | |
cf09a8ee | 497 | tg = kzalloc_node(sizeof(*tg), gfp, q->node); |
4fb72036 | 498 | if (!tg) |
77ea7338 | 499 | return NULL; |
4fb72036 | 500 | |
7ca46438 TH |
501 | if (blkg_rwstat_init(&tg->stat_bytes, gfp)) |
502 | goto err_free_tg; | |
503 | ||
504 | if (blkg_rwstat_init(&tg->stat_ios, gfp)) | |
505 | goto err_exit_stat_bytes; | |
506 | ||
b2ce2643 TH |
507 | throtl_service_queue_init(&tg->service_queue); |
508 | ||
509 | for (rw = READ; rw <= WRITE; rw++) { | |
510 | throtl_qnode_init(&tg->qnode_on_self[rw], tg); | |
511 | throtl_qnode_init(&tg->qnode_on_parent[rw], tg); | |
512 | } | |
513 | ||
514 | RB_CLEAR_NODE(&tg->rb_node); | |
9f626e37 SL |
515 | tg->bps[READ][LIMIT_MAX] = U64_MAX; |
516 | tg->bps[WRITE][LIMIT_MAX] = U64_MAX; | |
517 | tg->iops[READ][LIMIT_MAX] = UINT_MAX; | |
518 | tg->iops[WRITE][LIMIT_MAX] = UINT_MAX; | |
cd5ab1b0 SL |
519 | tg->bps_conf[READ][LIMIT_MAX] = U64_MAX; |
520 | tg->bps_conf[WRITE][LIMIT_MAX] = U64_MAX; | |
521 | tg->iops_conf[READ][LIMIT_MAX] = UINT_MAX; | |
522 | tg->iops_conf[WRITE][LIMIT_MAX] = UINT_MAX; | |
523 | /* LIMIT_LOW will have default value 0 */ | |
b2ce2643 | 524 | |
ec80991d | 525 | tg->latency_target = DFL_LATENCY_TARGET; |
5b81fc3c | 526 | tg->latency_target_conf = DFL_LATENCY_TARGET; |
b4f428ef SL |
527 | tg->idletime_threshold = DFL_IDLE_THRESHOLD; |
528 | tg->idletime_threshold_conf = DFL_IDLE_THRESHOLD; | |
ec80991d | 529 | |
4fb72036 | 530 | return &tg->pd; |
7ca46438 TH |
531 | |
532 | err_exit_stat_bytes: | |
533 | blkg_rwstat_exit(&tg->stat_bytes); | |
534 | err_free_tg: | |
535 | kfree(tg); | |
536 | return NULL; | |
001bea73 TH |
537 | } |
538 | ||
a9520cd6 | 539 | static void throtl_pd_init(struct blkg_policy_data *pd) |
a29a171e | 540 | { |
a9520cd6 TH |
541 | struct throtl_grp *tg = pd_to_tg(pd); |
542 | struct blkcg_gq *blkg = tg_to_blkg(tg); | |
77216b04 | 543 | struct throtl_data *td = blkg->q->td; |
b2ce2643 | 544 | struct throtl_service_queue *sq = &tg->service_queue; |
cd1604fa | 545 | |
9138125b | 546 | /* |
aa6ec29b | 547 | * If on the default hierarchy, we switch to properly hierarchical |
9138125b TH |
548 | * behavior where limits on a given throtl_grp are applied to the |
549 | * whole subtree rather than just the group itself. e.g. If 16M | |
550 | * read_bps limit is set on the root group, the whole system can't | |
551 | * exceed 16M for the device. | |
552 | * | |
aa6ec29b | 553 | * If not on the default hierarchy, the broken flat hierarchy |
9138125b TH |
554 | * behavior is retained where all throtl_grps are treated as if |
555 | * they're all separate root groups right below throtl_data. | |
556 | * Limits of a group don't interact with limits of other groups | |
557 | * regardless of the position of the group in the hierarchy. | |
558 | */ | |
b2ce2643 | 559 | sq->parent_sq = &td->service_queue; |
9e10a130 | 560 | if (cgroup_subsys_on_dfl(io_cgrp_subsys) && blkg->parent) |
b2ce2643 | 561 | sq->parent_sq = &blkg_to_tg(blkg->parent)->service_queue; |
77216b04 | 562 | tg->td = td; |
8a3d2615 TH |
563 | } |
564 | ||
693e751e TH |
565 | /* |
566 | * Set has_rules[] if @tg or any of its parents have limits configured. | |
567 | * This doesn't require walking up to the top of the hierarchy as the | |
568 | * parent's has_rules[] is guaranteed to be correct. | |
569 | */ | |
570 | static void tg_update_has_rules(struct throtl_grp *tg) | |
571 | { | |
572 | struct throtl_grp *parent_tg = sq_to_tg(tg->service_queue.parent_sq); | |
9f626e37 | 573 | struct throtl_data *td = tg->td; |
693e751e TH |
574 | int rw; |
575 | ||
576 | for (rw = READ; rw <= WRITE; rw++) | |
577 | tg->has_rules[rw] = (parent_tg && parent_tg->has_rules[rw]) || | |
9f626e37 SL |
578 | (td->limit_valid[td->limit_index] && |
579 | (tg_bps_limit(tg, rw) != U64_MAX || | |
580 | tg_iops_limit(tg, rw) != UINT_MAX)); | |
693e751e TH |
581 | } |
582 | ||
a9520cd6 | 583 | static void throtl_pd_online(struct blkg_policy_data *pd) |
693e751e | 584 | { |
aec24246 | 585 | struct throtl_grp *tg = pd_to_tg(pd); |
693e751e TH |
586 | /* |
587 | * We don't want new groups to escape the limits of its ancestors. | |
588 | * Update has_rules[] after a new group is brought online. | |
589 | */ | |
aec24246 | 590 | tg_update_has_rules(tg); |
693e751e TH |
591 | } |
592 | ||
acaf523a | 593 | #ifdef CONFIG_BLK_DEV_THROTTLING_LOW |
cd5ab1b0 SL |
594 | static void blk_throtl_update_limit_valid(struct throtl_data *td) |
595 | { | |
596 | struct cgroup_subsys_state *pos_css; | |
597 | struct blkcg_gq *blkg; | |
598 | bool low_valid = false; | |
599 | ||
600 | rcu_read_lock(); | |
601 | blkg_for_each_descendant_post(blkg, pos_css, td->queue->root_blkg) { | |
602 | struct throtl_grp *tg = blkg_to_tg(blkg); | |
603 | ||
604 | if (tg->bps[READ][LIMIT_LOW] || tg->bps[WRITE][LIMIT_LOW] || | |
43ada787 | 605 | tg->iops[READ][LIMIT_LOW] || tg->iops[WRITE][LIMIT_LOW]) { |
cd5ab1b0 | 606 | low_valid = true; |
43ada787 LB |
607 | break; |
608 | } | |
cd5ab1b0 SL |
609 | } |
610 | rcu_read_unlock(); | |
611 | ||
612 | td->limit_valid[LIMIT_LOW] = low_valid; | |
613 | } | |
acaf523a YK |
614 | #else |
615 | static inline void blk_throtl_update_limit_valid(struct throtl_data *td) | |
616 | { | |
617 | } | |
618 | #endif | |
cd5ab1b0 | 619 | |
c79892c5 | 620 | static void throtl_upgrade_state(struct throtl_data *td); |
cd5ab1b0 SL |
621 | static void throtl_pd_offline(struct blkg_policy_data *pd) |
622 | { | |
623 | struct throtl_grp *tg = pd_to_tg(pd); | |
624 | ||
625 | tg->bps[READ][LIMIT_LOW] = 0; | |
626 | tg->bps[WRITE][LIMIT_LOW] = 0; | |
627 | tg->iops[READ][LIMIT_LOW] = 0; | |
628 | tg->iops[WRITE][LIMIT_LOW] = 0; | |
629 | ||
630 | blk_throtl_update_limit_valid(tg->td); | |
631 | ||
c79892c5 SL |
632 | if (!tg->td->limit_valid[tg->td->limit_index]) |
633 | throtl_upgrade_state(tg->td); | |
cd5ab1b0 SL |
634 | } |
635 | ||
001bea73 TH |
636 | static void throtl_pd_free(struct blkg_policy_data *pd) |
637 | { | |
4fb72036 TH |
638 | struct throtl_grp *tg = pd_to_tg(pd); |
639 | ||
b2ce2643 | 640 | del_timer_sync(&tg->service_queue.pending_timer); |
7ca46438 TH |
641 | blkg_rwstat_exit(&tg->stat_bytes); |
642 | blkg_rwstat_exit(&tg->stat_ios); | |
4fb72036 | 643 | kfree(tg); |
001bea73 TH |
644 | } |
645 | ||
0049af73 TH |
646 | static struct throtl_grp * |
647 | throtl_rb_first(struct throtl_service_queue *parent_sq) | |
e43473b7 | 648 | { |
9ff01255 | 649 | struct rb_node *n; |
e43473b7 | 650 | |
9ff01255 LB |
651 | n = rb_first_cached(&parent_sq->pending_tree); |
652 | WARN_ON_ONCE(!n); | |
653 | if (!n) | |
654 | return NULL; | |
655 | return rb_entry_tg(n); | |
e43473b7 VG |
656 | } |
657 | ||
0049af73 TH |
658 | static void throtl_rb_erase(struct rb_node *n, |
659 | struct throtl_service_queue *parent_sq) | |
e43473b7 | 660 | { |
9ff01255 LB |
661 | rb_erase_cached(n, &parent_sq->pending_tree); |
662 | RB_CLEAR_NODE(n); | |
0049af73 | 663 | --parent_sq->nr_pending; |
e43473b7 VG |
664 | } |
665 | ||
0049af73 | 666 | static void update_min_dispatch_time(struct throtl_service_queue *parent_sq) |
e43473b7 VG |
667 | { |
668 | struct throtl_grp *tg; | |
669 | ||
0049af73 | 670 | tg = throtl_rb_first(parent_sq); |
e43473b7 VG |
671 | if (!tg) |
672 | return; | |
673 | ||
0049af73 | 674 | parent_sq->first_pending_disptime = tg->disptime; |
e43473b7 VG |
675 | } |
676 | ||
77216b04 | 677 | static void tg_service_queue_add(struct throtl_grp *tg) |
e43473b7 | 678 | { |
77216b04 | 679 | struct throtl_service_queue *parent_sq = tg->service_queue.parent_sq; |
9ff01255 | 680 | struct rb_node **node = &parent_sq->pending_tree.rb_root.rb_node; |
e43473b7 VG |
681 | struct rb_node *parent = NULL; |
682 | struct throtl_grp *__tg; | |
683 | unsigned long key = tg->disptime; | |
9ff01255 | 684 | bool leftmost = true; |
e43473b7 VG |
685 | |
686 | while (*node != NULL) { | |
687 | parent = *node; | |
688 | __tg = rb_entry_tg(parent); | |
689 | ||
690 | if (time_before(key, __tg->disptime)) | |
691 | node = &parent->rb_left; | |
692 | else { | |
693 | node = &parent->rb_right; | |
9ff01255 | 694 | leftmost = false; |
e43473b7 VG |
695 | } |
696 | } | |
697 | ||
e43473b7 | 698 | rb_link_node(&tg->rb_node, parent, node); |
9ff01255 LB |
699 | rb_insert_color_cached(&tg->rb_node, &parent_sq->pending_tree, |
700 | leftmost); | |
e43473b7 VG |
701 | } |
702 | ||
77216b04 | 703 | static void throtl_enqueue_tg(struct throtl_grp *tg) |
e43473b7 | 704 | { |
29379674 BW |
705 | if (!(tg->flags & THROTL_TG_PENDING)) { |
706 | tg_service_queue_add(tg); | |
707 | tg->flags |= THROTL_TG_PENDING; | |
708 | tg->service_queue.parent_sq->nr_pending++; | |
709 | } | |
e43473b7 VG |
710 | } |
711 | ||
77216b04 | 712 | static void throtl_dequeue_tg(struct throtl_grp *tg) |
e43473b7 | 713 | { |
29379674 BW |
714 | if (tg->flags & THROTL_TG_PENDING) { |
715 | throtl_rb_erase(&tg->rb_node, tg->service_queue.parent_sq); | |
716 | tg->flags &= ~THROTL_TG_PENDING; | |
717 | } | |
e43473b7 VG |
718 | } |
719 | ||
a9131a27 | 720 | /* Call with queue lock held */ |
69df0ab0 TH |
721 | static void throtl_schedule_pending_timer(struct throtl_service_queue *sq, |
722 | unsigned long expires) | |
a9131a27 | 723 | { |
a41b816c | 724 | unsigned long max_expire = jiffies + 8 * sq_to_td(sq)->throtl_slice; |
06cceedc SL |
725 | |
726 | /* | |
727 | * Since we are adjusting the throttle limit dynamically, the sleep | |
728 | * time calculated according to previous limit might be invalid. It's | |
729 | * possible the cgroup sleep time is very long and no other cgroups | |
730 | * have IO running so notify the limit changes. Make sure the cgroup | |
731 | * doesn't sleep too long to avoid the missed notification. | |
732 | */ | |
733 | if (time_after(expires, max_expire)) | |
734 | expires = max_expire; | |
69df0ab0 TH |
735 | mod_timer(&sq->pending_timer, expires); |
736 | throtl_log(sq, "schedule timer. delay=%lu jiffies=%lu", | |
737 | expires - jiffies, jiffies); | |
a9131a27 TH |
738 | } |
739 | ||
7f52f98c TH |
740 | /** |
741 | * throtl_schedule_next_dispatch - schedule the next dispatch cycle | |
742 | * @sq: the service_queue to schedule dispatch for | |
743 | * @force: force scheduling | |
744 | * | |
745 | * Arm @sq->pending_timer so that the next dispatch cycle starts on the | |
746 | * dispatch time of the first pending child. Returns %true if either timer | |
747 | * is armed or there's no pending child left. %false if the current | |
748 | * dispatch window is still open and the caller should continue | |
749 | * dispatching. | |
750 | * | |
751 | * If @force is %true, the dispatch timer is always scheduled and this | |
752 | * function is guaranteed to return %true. This is to be used when the | |
753 | * caller can't dispatch itself and needs to invoke pending_timer | |
754 | * unconditionally. Note that forced scheduling is likely to induce short | |
755 | * delay before dispatch starts even if @sq->first_pending_disptime is not | |
756 | * in the future and thus shouldn't be used in hot paths. | |
757 | */ | |
758 | static bool throtl_schedule_next_dispatch(struct throtl_service_queue *sq, | |
759 | bool force) | |
e43473b7 | 760 | { |
6a525600 | 761 | /* any pending children left? */ |
c9e0332e | 762 | if (!sq->nr_pending) |
7f52f98c | 763 | return true; |
e43473b7 | 764 | |
c9e0332e | 765 | update_min_dispatch_time(sq); |
e43473b7 | 766 | |
69df0ab0 | 767 | /* is the next dispatch time in the future? */ |
7f52f98c | 768 | if (force || time_after(sq->first_pending_disptime, jiffies)) { |
69df0ab0 | 769 | throtl_schedule_pending_timer(sq, sq->first_pending_disptime); |
7f52f98c | 770 | return true; |
69df0ab0 TH |
771 | } |
772 | ||
7f52f98c TH |
773 | /* tell the caller to continue dispatching */ |
774 | return false; | |
e43473b7 VG |
775 | } |
776 | ||
32ee5bc4 VG |
777 | static inline void throtl_start_new_slice_with_credit(struct throtl_grp *tg, |
778 | bool rw, unsigned long start) | |
779 | { | |
780 | tg->bytes_disp[rw] = 0; | |
781 | tg->io_disp[rw] = 0; | |
782 | ||
4f1e9630 CX |
783 | atomic_set(&tg->io_split_cnt[rw], 0); |
784 | ||
32ee5bc4 VG |
785 | /* |
786 | * Previous slice has expired. We must have trimmed it after last | |
787 | * bio dispatch. That means since start of last slice, we never used | |
788 | * that bandwidth. Do try to make use of that bandwidth while giving | |
789 | * credit. | |
790 | */ | |
791 | if (time_after_eq(start, tg->slice_start[rw])) | |
792 | tg->slice_start[rw] = start; | |
793 | ||
297e3d85 | 794 | tg->slice_end[rw] = jiffies + tg->td->throtl_slice; |
32ee5bc4 VG |
795 | throtl_log(&tg->service_queue, |
796 | "[%c] new slice with credit start=%lu end=%lu jiffies=%lu", | |
797 | rw == READ ? 'R' : 'W', tg->slice_start[rw], | |
798 | tg->slice_end[rw], jiffies); | |
799 | } | |
800 | ||
0f3457f6 | 801 | static inline void throtl_start_new_slice(struct throtl_grp *tg, bool rw) |
e43473b7 VG |
802 | { |
803 | tg->bytes_disp[rw] = 0; | |
8e89d13f | 804 | tg->io_disp[rw] = 0; |
e43473b7 | 805 | tg->slice_start[rw] = jiffies; |
297e3d85 | 806 | tg->slice_end[rw] = jiffies + tg->td->throtl_slice; |
4f1e9630 CX |
807 | |
808 | atomic_set(&tg->io_split_cnt[rw], 0); | |
809 | ||
fda6f272 TH |
810 | throtl_log(&tg->service_queue, |
811 | "[%c] new slice start=%lu end=%lu jiffies=%lu", | |
812 | rw == READ ? 'R' : 'W', tg->slice_start[rw], | |
813 | tg->slice_end[rw], jiffies); | |
e43473b7 VG |
814 | } |
815 | ||
0f3457f6 TH |
816 | static inline void throtl_set_slice_end(struct throtl_grp *tg, bool rw, |
817 | unsigned long jiffy_end) | |
d1ae8ffd | 818 | { |
297e3d85 | 819 | tg->slice_end[rw] = roundup(jiffy_end, tg->td->throtl_slice); |
d1ae8ffd VG |
820 | } |
821 | ||
0f3457f6 TH |
822 | static inline void throtl_extend_slice(struct throtl_grp *tg, bool rw, |
823 | unsigned long jiffy_end) | |
e43473b7 | 824 | { |
1da30f95 | 825 | throtl_set_slice_end(tg, rw, jiffy_end); |
fda6f272 TH |
826 | throtl_log(&tg->service_queue, |
827 | "[%c] extend slice start=%lu end=%lu jiffies=%lu", | |
828 | rw == READ ? 'R' : 'W', tg->slice_start[rw], | |
829 | tg->slice_end[rw], jiffies); | |
e43473b7 VG |
830 | } |
831 | ||
832 | /* Determine if previously allocated or extended slice is complete or not */ | |
0f3457f6 | 833 | static bool throtl_slice_used(struct throtl_grp *tg, bool rw) |
e43473b7 VG |
834 | { |
835 | if (time_in_range(jiffies, tg->slice_start[rw], tg->slice_end[rw])) | |
5cf8c227 | 836 | return false; |
e43473b7 | 837 | |
0b6bad7d | 838 | return true; |
e43473b7 VG |
839 | } |
840 | ||
841 | /* Trim the used slices and adjust slice start accordingly */ | |
0f3457f6 | 842 | static inline void throtl_trim_slice(struct throtl_grp *tg, bool rw) |
e43473b7 | 843 | { |
3aad5d3e VG |
844 | unsigned long nr_slices, time_elapsed, io_trim; |
845 | u64 bytes_trim, tmp; | |
e43473b7 VG |
846 | |
847 | BUG_ON(time_before(tg->slice_end[rw], tg->slice_start[rw])); | |
848 | ||
849 | /* | |
850 | * If bps are unlimited (-1), then time slice don't get | |
851 | * renewed. Don't try to trim the slice if slice is used. A new | |
852 | * slice will start when appropriate. | |
853 | */ | |
0f3457f6 | 854 | if (throtl_slice_used(tg, rw)) |
e43473b7 VG |
855 | return; |
856 | ||
d1ae8ffd VG |
857 | /* |
858 | * A bio has been dispatched. Also adjust slice_end. It might happen | |
859 | * that initially cgroup limit was very low resulting in high | |
b53b072c | 860 | * slice_end, but later limit was bumped up and bio was dispatched |
d1ae8ffd VG |
861 | * sooner, then we need to reduce slice_end. A high bogus slice_end |
862 | * is bad because it does not allow new slice to start. | |
863 | */ | |
864 | ||
297e3d85 | 865 | throtl_set_slice_end(tg, rw, jiffies + tg->td->throtl_slice); |
d1ae8ffd | 866 | |
e43473b7 VG |
867 | time_elapsed = jiffies - tg->slice_start[rw]; |
868 | ||
297e3d85 | 869 | nr_slices = time_elapsed / tg->td->throtl_slice; |
e43473b7 VG |
870 | |
871 | if (!nr_slices) | |
872 | return; | |
297e3d85 | 873 | tmp = tg_bps_limit(tg, rw) * tg->td->throtl_slice * nr_slices; |
3aad5d3e VG |
874 | do_div(tmp, HZ); |
875 | bytes_trim = tmp; | |
e43473b7 | 876 | |
297e3d85 SL |
877 | io_trim = (tg_iops_limit(tg, rw) * tg->td->throtl_slice * nr_slices) / |
878 | HZ; | |
e43473b7 | 879 | |
8e89d13f | 880 | if (!bytes_trim && !io_trim) |
e43473b7 VG |
881 | return; |
882 | ||
883 | if (tg->bytes_disp[rw] >= bytes_trim) | |
884 | tg->bytes_disp[rw] -= bytes_trim; | |
885 | else | |
886 | tg->bytes_disp[rw] = 0; | |
887 | ||
8e89d13f VG |
888 | if (tg->io_disp[rw] >= io_trim) |
889 | tg->io_disp[rw] -= io_trim; | |
890 | else | |
891 | tg->io_disp[rw] = 0; | |
892 | ||
297e3d85 | 893 | tg->slice_start[rw] += nr_slices * tg->td->throtl_slice; |
e43473b7 | 894 | |
fda6f272 TH |
895 | throtl_log(&tg->service_queue, |
896 | "[%c] trim slice nr=%lu bytes=%llu io=%lu start=%lu end=%lu jiffies=%lu", | |
897 | rw == READ ? 'R' : 'W', nr_slices, bytes_trim, io_trim, | |
898 | tg->slice_start[rw], tg->slice_end[rw], jiffies); | |
e43473b7 VG |
899 | } |
900 | ||
0f3457f6 | 901 | static bool tg_with_in_iops_limit(struct throtl_grp *tg, struct bio *bio, |
4599ea49 | 902 | u32 iops_limit, unsigned long *wait) |
e43473b7 VG |
903 | { |
904 | bool rw = bio_data_dir(bio); | |
8e89d13f | 905 | unsigned int io_allowed; |
e43473b7 | 906 | unsigned long jiffy_elapsed, jiffy_wait, jiffy_elapsed_rnd; |
c49c06e4 | 907 | u64 tmp; |
e43473b7 | 908 | |
87fbeb88 BW |
909 | if (iops_limit == UINT_MAX) { |
910 | if (wait) | |
911 | *wait = 0; | |
912 | return true; | |
913 | } | |
914 | ||
3a10f999 | 915 | jiffy_elapsed = jiffies - tg->slice_start[rw]; |
e43473b7 | 916 | |
3a10f999 KK |
917 | /* Round up to the next throttle slice, wait time must be nonzero */ |
918 | jiffy_elapsed_rnd = roundup(jiffy_elapsed + 1, tg->td->throtl_slice); | |
8e89d13f | 919 | |
c49c06e4 VG |
920 | /* |
921 | * jiffy_elapsed_rnd should not be a big value as minimum iops can be | |
922 | * 1 then at max jiffy elapsed should be equivalent of 1 second as we | |
923 | * will allow dispatch after 1 second and after that slice should | |
924 | * have been trimmed. | |
925 | */ | |
926 | ||
4599ea49 | 927 | tmp = (u64)iops_limit * jiffy_elapsed_rnd; |
c49c06e4 VG |
928 | do_div(tmp, HZ); |
929 | ||
930 | if (tmp > UINT_MAX) | |
931 | io_allowed = UINT_MAX; | |
932 | else | |
933 | io_allowed = tmp; | |
8e89d13f VG |
934 | |
935 | if (tg->io_disp[rw] + 1 <= io_allowed) { | |
e43473b7 VG |
936 | if (wait) |
937 | *wait = 0; | |
5cf8c227 | 938 | return true; |
e43473b7 VG |
939 | } |
940 | ||
8e89d13f | 941 | /* Calc approx time to dispatch */ |
991f61fe | 942 | jiffy_wait = jiffy_elapsed_rnd - jiffy_elapsed; |
8e89d13f VG |
943 | |
944 | if (wait) | |
945 | *wait = jiffy_wait; | |
0b6bad7d | 946 | return false; |
8e89d13f VG |
947 | } |
948 | ||
0f3457f6 | 949 | static bool tg_with_in_bps_limit(struct throtl_grp *tg, struct bio *bio, |
4599ea49 | 950 | u64 bps_limit, unsigned long *wait) |
8e89d13f VG |
951 | { |
952 | bool rw = bio_data_dir(bio); | |
3aad5d3e | 953 | u64 bytes_allowed, extra_bytes, tmp; |
8e89d13f | 954 | unsigned long jiffy_elapsed, jiffy_wait, jiffy_elapsed_rnd; |
ea0ea2bc | 955 | unsigned int bio_size = throtl_bio_data_size(bio); |
e43473b7 | 956 | |
87fbeb88 BW |
957 | if (bps_limit == U64_MAX) { |
958 | if (wait) | |
959 | *wait = 0; | |
960 | return true; | |
961 | } | |
962 | ||
e43473b7 VG |
963 | jiffy_elapsed = jiffy_elapsed_rnd = jiffies - tg->slice_start[rw]; |
964 | ||
965 | /* Slice has just started. Consider one slice interval */ | |
966 | if (!jiffy_elapsed) | |
297e3d85 | 967 | jiffy_elapsed_rnd = tg->td->throtl_slice; |
e43473b7 | 968 | |
297e3d85 | 969 | jiffy_elapsed_rnd = roundup(jiffy_elapsed_rnd, tg->td->throtl_slice); |
e43473b7 | 970 | |
4599ea49 | 971 | tmp = bps_limit * jiffy_elapsed_rnd; |
5e901a2b | 972 | do_div(tmp, HZ); |
3aad5d3e | 973 | bytes_allowed = tmp; |
e43473b7 | 974 | |
ea0ea2bc | 975 | if (tg->bytes_disp[rw] + bio_size <= bytes_allowed) { |
e43473b7 VG |
976 | if (wait) |
977 | *wait = 0; | |
5cf8c227 | 978 | return true; |
e43473b7 VG |
979 | } |
980 | ||
981 | /* Calc approx time to dispatch */ | |
ea0ea2bc | 982 | extra_bytes = tg->bytes_disp[rw] + bio_size - bytes_allowed; |
4599ea49 | 983 | jiffy_wait = div64_u64(extra_bytes * HZ, bps_limit); |
e43473b7 VG |
984 | |
985 | if (!jiffy_wait) | |
986 | jiffy_wait = 1; | |
987 | ||
988 | /* | |
989 | * This wait time is without taking into consideration the rounding | |
990 | * up we did. Add that time also. | |
991 | */ | |
992 | jiffy_wait = jiffy_wait + (jiffy_elapsed_rnd - jiffy_elapsed); | |
e43473b7 VG |
993 | if (wait) |
994 | *wait = jiffy_wait; | |
0b6bad7d | 995 | return false; |
8e89d13f VG |
996 | } |
997 | ||
998 | /* | |
999 | * Returns whether one can dispatch a bio or not. Also returns approx number | |
1000 | * of jiffies to wait before this bio is with-in IO rate and can be dispatched | |
1001 | */ | |
0f3457f6 TH |
1002 | static bool tg_may_dispatch(struct throtl_grp *tg, struct bio *bio, |
1003 | unsigned long *wait) | |
8e89d13f VG |
1004 | { |
1005 | bool rw = bio_data_dir(bio); | |
1006 | unsigned long bps_wait = 0, iops_wait = 0, max_wait = 0; | |
4599ea49 BW |
1007 | u64 bps_limit = tg_bps_limit(tg, rw); |
1008 | u32 iops_limit = tg_iops_limit(tg, rw); | |
8e89d13f VG |
1009 | |
1010 | /* | |
1011 | * Currently whole state machine of group depends on first bio | |
1012 | * queued in the group bio list. So one should not be calling | |
1013 | * this function with a different bio if there are other bios | |
1014 | * queued. | |
1015 | */ | |
73f0d49a | 1016 | BUG_ON(tg->service_queue.nr_queued[rw] && |
c5cc2070 | 1017 | bio != throtl_peek_queued(&tg->service_queue.queued[rw])); |
e43473b7 | 1018 | |
8e89d13f | 1019 | /* If tg->bps = -1, then BW is unlimited */ |
4599ea49 | 1020 | if (bps_limit == U64_MAX && iops_limit == UINT_MAX) { |
8e89d13f VG |
1021 | if (wait) |
1022 | *wait = 0; | |
5cf8c227 | 1023 | return true; |
8e89d13f VG |
1024 | } |
1025 | ||
1026 | /* | |
1027 | * If previous slice expired, start a new one otherwise renew/extend | |
1028 | * existing slice to make sure it is at least throtl_slice interval | |
164c80ed VG |
1029 | * long since now. New slice is started only for empty throttle group. |
1030 | * If there is queued bio, that means there should be an active | |
1031 | * slice and it should be extended instead. | |
8e89d13f | 1032 | */ |
164c80ed | 1033 | if (throtl_slice_used(tg, rw) && !(tg->service_queue.nr_queued[rw])) |
0f3457f6 | 1034 | throtl_start_new_slice(tg, rw); |
8e89d13f | 1035 | else { |
297e3d85 SL |
1036 | if (time_before(tg->slice_end[rw], |
1037 | jiffies + tg->td->throtl_slice)) | |
1038 | throtl_extend_slice(tg, rw, | |
1039 | jiffies + tg->td->throtl_slice); | |
8e89d13f VG |
1040 | } |
1041 | ||
4f1e9630 CX |
1042 | if (iops_limit != UINT_MAX) |
1043 | tg->io_disp[rw] += atomic_xchg(&tg->io_split_cnt[rw], 0); | |
1044 | ||
4599ea49 BW |
1045 | if (tg_with_in_bps_limit(tg, bio, bps_limit, &bps_wait) && |
1046 | tg_with_in_iops_limit(tg, bio, iops_limit, &iops_wait)) { | |
8e89d13f VG |
1047 | if (wait) |
1048 | *wait = 0; | |
0b6bad7d | 1049 | return true; |
8e89d13f VG |
1050 | } |
1051 | ||
1052 | max_wait = max(bps_wait, iops_wait); | |
1053 | ||
1054 | if (wait) | |
1055 | *wait = max_wait; | |
1056 | ||
1057 | if (time_before(tg->slice_end[rw], jiffies + max_wait)) | |
0f3457f6 | 1058 | throtl_extend_slice(tg, rw, jiffies + max_wait); |
e43473b7 | 1059 | |
0b6bad7d | 1060 | return false; |
e43473b7 VG |
1061 | } |
1062 | ||
1063 | static void throtl_charge_bio(struct throtl_grp *tg, struct bio *bio) | |
1064 | { | |
1065 | bool rw = bio_data_dir(bio); | |
ea0ea2bc | 1066 | unsigned int bio_size = throtl_bio_data_size(bio); |
e43473b7 VG |
1067 | |
1068 | /* Charge the bio to the group */ | |
ea0ea2bc | 1069 | tg->bytes_disp[rw] += bio_size; |
8e89d13f | 1070 | tg->io_disp[rw]++; |
ea0ea2bc | 1071 | tg->last_bytes_disp[rw] += bio_size; |
3f0abd80 | 1072 | tg->last_io_disp[rw]++; |
e43473b7 | 1073 | |
2a0f61e6 | 1074 | /* |
8d2bbd4c | 1075 | * BIO_THROTTLED is used to prevent the same bio to be throttled |
2a0f61e6 TH |
1076 | * more than once as a throttled bio will go through blk-throtl the |
1077 | * second time when it eventually gets issued. Set it when a bio | |
1078 | * is being charged to a tg. | |
2a0f61e6 | 1079 | */ |
8d2bbd4c CH |
1080 | if (!bio_flagged(bio, BIO_THROTTLED)) |
1081 | bio_set_flag(bio, BIO_THROTTLED); | |
e43473b7 VG |
1082 | } |
1083 | ||
c5cc2070 TH |
1084 | /** |
1085 | * throtl_add_bio_tg - add a bio to the specified throtl_grp | |
1086 | * @bio: bio to add | |
1087 | * @qn: qnode to use | |
1088 | * @tg: the target throtl_grp | |
1089 | * | |
1090 | * Add @bio to @tg's service_queue using @qn. If @qn is not specified, | |
1091 | * tg->qnode_on_self[] is used. | |
1092 | */ | |
1093 | static void throtl_add_bio_tg(struct bio *bio, struct throtl_qnode *qn, | |
1094 | struct throtl_grp *tg) | |
e43473b7 | 1095 | { |
73f0d49a | 1096 | struct throtl_service_queue *sq = &tg->service_queue; |
e43473b7 VG |
1097 | bool rw = bio_data_dir(bio); |
1098 | ||
c5cc2070 TH |
1099 | if (!qn) |
1100 | qn = &tg->qnode_on_self[rw]; | |
1101 | ||
0e9f4164 TH |
1102 | /* |
1103 | * If @tg doesn't currently have any bios queued in the same | |
1104 | * direction, queueing @bio can change when @tg should be | |
1105 | * dispatched. Mark that @tg was empty. This is automatically | |
b53b072c | 1106 | * cleared on the next tg_update_disptime(). |
0e9f4164 TH |
1107 | */ |
1108 | if (!sq->nr_queued[rw]) | |
1109 | tg->flags |= THROTL_TG_WAS_EMPTY; | |
1110 | ||
c5cc2070 TH |
1111 | throtl_qnode_add_bio(bio, qn, &sq->queued[rw]); |
1112 | ||
73f0d49a | 1113 | sq->nr_queued[rw]++; |
77216b04 | 1114 | throtl_enqueue_tg(tg); |
e43473b7 VG |
1115 | } |
1116 | ||
77216b04 | 1117 | static void tg_update_disptime(struct throtl_grp *tg) |
e43473b7 | 1118 | { |
73f0d49a | 1119 | struct throtl_service_queue *sq = &tg->service_queue; |
e43473b7 VG |
1120 | unsigned long read_wait = -1, write_wait = -1, min_wait = -1, disptime; |
1121 | struct bio *bio; | |
1122 | ||
d609af3a ME |
1123 | bio = throtl_peek_queued(&sq->queued[READ]); |
1124 | if (bio) | |
0f3457f6 | 1125 | tg_may_dispatch(tg, bio, &read_wait); |
e43473b7 | 1126 | |
d609af3a ME |
1127 | bio = throtl_peek_queued(&sq->queued[WRITE]); |
1128 | if (bio) | |
0f3457f6 | 1129 | tg_may_dispatch(tg, bio, &write_wait); |
e43473b7 VG |
1130 | |
1131 | min_wait = min(read_wait, write_wait); | |
1132 | disptime = jiffies + min_wait; | |
1133 | ||
e43473b7 | 1134 | /* Update dispatch time */ |
77216b04 | 1135 | throtl_dequeue_tg(tg); |
e43473b7 | 1136 | tg->disptime = disptime; |
77216b04 | 1137 | throtl_enqueue_tg(tg); |
0e9f4164 TH |
1138 | |
1139 | /* see throtl_add_bio_tg() */ | |
1140 | tg->flags &= ~THROTL_TG_WAS_EMPTY; | |
e43473b7 VG |
1141 | } |
1142 | ||
32ee5bc4 VG |
1143 | static void start_parent_slice_with_credit(struct throtl_grp *child_tg, |
1144 | struct throtl_grp *parent_tg, bool rw) | |
1145 | { | |
1146 | if (throtl_slice_used(parent_tg, rw)) { | |
1147 | throtl_start_new_slice_with_credit(parent_tg, rw, | |
1148 | child_tg->slice_start[rw]); | |
1149 | } | |
1150 | ||
1151 | } | |
1152 | ||
77216b04 | 1153 | static void tg_dispatch_one_bio(struct throtl_grp *tg, bool rw) |
e43473b7 | 1154 | { |
73f0d49a | 1155 | struct throtl_service_queue *sq = &tg->service_queue; |
6bc9c2b4 TH |
1156 | struct throtl_service_queue *parent_sq = sq->parent_sq; |
1157 | struct throtl_grp *parent_tg = sq_to_tg(parent_sq); | |
c5cc2070 | 1158 | struct throtl_grp *tg_to_put = NULL; |
e43473b7 VG |
1159 | struct bio *bio; |
1160 | ||
c5cc2070 TH |
1161 | /* |
1162 | * @bio is being transferred from @tg to @parent_sq. Popping a bio | |
1163 | * from @tg may put its reference and @parent_sq might end up | |
1164 | * getting released prematurely. Remember the tg to put and put it | |
1165 | * after @bio is transferred to @parent_sq. | |
1166 | */ | |
1167 | bio = throtl_pop_queued(&sq->queued[rw], &tg_to_put); | |
73f0d49a | 1168 | sq->nr_queued[rw]--; |
e43473b7 VG |
1169 | |
1170 | throtl_charge_bio(tg, bio); | |
6bc9c2b4 TH |
1171 | |
1172 | /* | |
1173 | * If our parent is another tg, we just need to transfer @bio to | |
1174 | * the parent using throtl_add_bio_tg(). If our parent is | |
1175 | * @td->service_queue, @bio is ready to be issued. Put it on its | |
1176 | * bio_lists[] and decrease total number queued. The caller is | |
1177 | * responsible for issuing these bios. | |
1178 | */ | |
1179 | if (parent_tg) { | |
c5cc2070 | 1180 | throtl_add_bio_tg(bio, &tg->qnode_on_parent[rw], parent_tg); |
32ee5bc4 | 1181 | start_parent_slice_with_credit(tg, parent_tg, rw); |
6bc9c2b4 | 1182 | } else { |
c5cc2070 TH |
1183 | throtl_qnode_add_bio(bio, &tg->qnode_on_parent[rw], |
1184 | &parent_sq->queued[rw]); | |
6bc9c2b4 TH |
1185 | BUG_ON(tg->td->nr_queued[rw] <= 0); |
1186 | tg->td->nr_queued[rw]--; | |
1187 | } | |
e43473b7 | 1188 | |
0f3457f6 | 1189 | throtl_trim_slice(tg, rw); |
6bc9c2b4 | 1190 | |
c5cc2070 TH |
1191 | if (tg_to_put) |
1192 | blkg_put(tg_to_blkg(tg_to_put)); | |
e43473b7 VG |
1193 | } |
1194 | ||
77216b04 | 1195 | static int throtl_dispatch_tg(struct throtl_grp *tg) |
e43473b7 | 1196 | { |
73f0d49a | 1197 | struct throtl_service_queue *sq = &tg->service_queue; |
e43473b7 | 1198 | unsigned int nr_reads = 0, nr_writes = 0; |
e675df2a BW |
1199 | unsigned int max_nr_reads = THROTL_GRP_QUANTUM * 3 / 4; |
1200 | unsigned int max_nr_writes = THROTL_GRP_QUANTUM - max_nr_reads; | |
e43473b7 VG |
1201 | struct bio *bio; |
1202 | ||
1203 | /* Try to dispatch 75% READS and 25% WRITES */ | |
1204 | ||
c5cc2070 | 1205 | while ((bio = throtl_peek_queued(&sq->queued[READ])) && |
0f3457f6 | 1206 | tg_may_dispatch(tg, bio, NULL)) { |
e43473b7 | 1207 | |
77216b04 | 1208 | tg_dispatch_one_bio(tg, bio_data_dir(bio)); |
e43473b7 VG |
1209 | nr_reads++; |
1210 | ||
1211 | if (nr_reads >= max_nr_reads) | |
1212 | break; | |
1213 | } | |
1214 | ||
c5cc2070 | 1215 | while ((bio = throtl_peek_queued(&sq->queued[WRITE])) && |
0f3457f6 | 1216 | tg_may_dispatch(tg, bio, NULL)) { |
e43473b7 | 1217 | |
77216b04 | 1218 | tg_dispatch_one_bio(tg, bio_data_dir(bio)); |
e43473b7 VG |
1219 | nr_writes++; |
1220 | ||
1221 | if (nr_writes >= max_nr_writes) | |
1222 | break; | |
1223 | } | |
1224 | ||
1225 | return nr_reads + nr_writes; | |
1226 | } | |
1227 | ||
651930bc | 1228 | static int throtl_select_dispatch(struct throtl_service_queue *parent_sq) |
e43473b7 VG |
1229 | { |
1230 | unsigned int nr_disp = 0; | |
e43473b7 VG |
1231 | |
1232 | while (1) { | |
2397611a | 1233 | struct throtl_grp *tg; |
2ab74cd2 | 1234 | struct throtl_service_queue *sq; |
e43473b7 | 1235 | |
2397611a BW |
1236 | if (!parent_sq->nr_pending) |
1237 | break; | |
1238 | ||
1239 | tg = throtl_rb_first(parent_sq); | |
e43473b7 VG |
1240 | if (!tg) |
1241 | break; | |
1242 | ||
1243 | if (time_before(jiffies, tg->disptime)) | |
1244 | break; | |
1245 | ||
77216b04 | 1246 | throtl_dequeue_tg(tg); |
e43473b7 | 1247 | |
77216b04 | 1248 | nr_disp += throtl_dispatch_tg(tg); |
e43473b7 | 1249 | |
2ab74cd2 | 1250 | sq = &tg->service_queue; |
73f0d49a | 1251 | if (sq->nr_queued[0] || sq->nr_queued[1]) |
77216b04 | 1252 | tg_update_disptime(tg); |
e43473b7 | 1253 | |
e675df2a | 1254 | if (nr_disp >= THROTL_QUANTUM) |
e43473b7 VG |
1255 | break; |
1256 | } | |
1257 | ||
1258 | return nr_disp; | |
1259 | } | |
1260 | ||
c79892c5 SL |
1261 | static bool throtl_can_upgrade(struct throtl_data *td, |
1262 | struct throtl_grp *this_tg); | |
6e1a5704 TH |
1263 | /** |
1264 | * throtl_pending_timer_fn - timer function for service_queue->pending_timer | |
216382dc | 1265 | * @t: the pending_timer member of the throtl_service_queue being serviced |
6e1a5704 TH |
1266 | * |
1267 | * This timer is armed when a child throtl_grp with active bio's become | |
1268 | * pending and queued on the service_queue's pending_tree and expires when | |
1269 | * the first child throtl_grp should be dispatched. This function | |
2e48a530 TH |
1270 | * dispatches bio's from the children throtl_grps to the parent |
1271 | * service_queue. | |
1272 | * | |
1273 | * If the parent's parent is another throtl_grp, dispatching is propagated | |
1274 | * by either arming its pending_timer or repeating dispatch directly. If | |
1275 | * the top-level service_tree is reached, throtl_data->dispatch_work is | |
1276 | * kicked so that the ready bio's are issued. | |
6e1a5704 | 1277 | */ |
e99e88a9 | 1278 | static void throtl_pending_timer_fn(struct timer_list *t) |
69df0ab0 | 1279 | { |
e99e88a9 | 1280 | struct throtl_service_queue *sq = from_timer(sq, t, pending_timer); |
2e48a530 | 1281 | struct throtl_grp *tg = sq_to_tg(sq); |
69df0ab0 | 1282 | struct throtl_data *td = sq_to_td(sq); |
cb76199c | 1283 | struct request_queue *q = td->queue; |
2e48a530 TH |
1284 | struct throtl_service_queue *parent_sq; |
1285 | bool dispatched; | |
6e1a5704 | 1286 | int ret; |
e43473b7 | 1287 | |
0d945c1f | 1288 | spin_lock_irq(&q->queue_lock); |
c79892c5 SL |
1289 | if (throtl_can_upgrade(td, NULL)) |
1290 | throtl_upgrade_state(td); | |
1291 | ||
2e48a530 TH |
1292 | again: |
1293 | parent_sq = sq->parent_sq; | |
1294 | dispatched = false; | |
e43473b7 | 1295 | |
7f52f98c TH |
1296 | while (true) { |
1297 | throtl_log(sq, "dispatch nr_queued=%u read=%u write=%u", | |
2e48a530 TH |
1298 | sq->nr_queued[READ] + sq->nr_queued[WRITE], |
1299 | sq->nr_queued[READ], sq->nr_queued[WRITE]); | |
7f52f98c TH |
1300 | |
1301 | ret = throtl_select_dispatch(sq); | |
1302 | if (ret) { | |
7f52f98c TH |
1303 | throtl_log(sq, "bios disp=%u", ret); |
1304 | dispatched = true; | |
1305 | } | |
e43473b7 | 1306 | |
7f52f98c TH |
1307 | if (throtl_schedule_next_dispatch(sq, false)) |
1308 | break; | |
e43473b7 | 1309 | |
7f52f98c | 1310 | /* this dispatch windows is still open, relax and repeat */ |
0d945c1f | 1311 | spin_unlock_irq(&q->queue_lock); |
7f52f98c | 1312 | cpu_relax(); |
0d945c1f | 1313 | spin_lock_irq(&q->queue_lock); |
651930bc | 1314 | } |
e43473b7 | 1315 | |
2e48a530 TH |
1316 | if (!dispatched) |
1317 | goto out_unlock; | |
6e1a5704 | 1318 | |
2e48a530 TH |
1319 | if (parent_sq) { |
1320 | /* @parent_sq is another throl_grp, propagate dispatch */ | |
1321 | if (tg->flags & THROTL_TG_WAS_EMPTY) { | |
1322 | tg_update_disptime(tg); | |
1323 | if (!throtl_schedule_next_dispatch(parent_sq, false)) { | |
1324 | /* window is already open, repeat dispatching */ | |
1325 | sq = parent_sq; | |
1326 | tg = sq_to_tg(sq); | |
1327 | goto again; | |
1328 | } | |
1329 | } | |
1330 | } else { | |
b53b072c | 1331 | /* reached the top-level, queue issuing */ |
2e48a530 TH |
1332 | queue_work(kthrotld_workqueue, &td->dispatch_work); |
1333 | } | |
1334 | out_unlock: | |
0d945c1f | 1335 | spin_unlock_irq(&q->queue_lock); |
6e1a5704 | 1336 | } |
e43473b7 | 1337 | |
6e1a5704 TH |
1338 | /** |
1339 | * blk_throtl_dispatch_work_fn - work function for throtl_data->dispatch_work | |
1340 | * @work: work item being executed | |
1341 | * | |
b53b072c BW |
1342 | * This function is queued for execution when bios reach the bio_lists[] |
1343 | * of throtl_data->service_queue. Those bios are ready and issued by this | |
6e1a5704 TH |
1344 | * function. |
1345 | */ | |
8876e140 | 1346 | static void blk_throtl_dispatch_work_fn(struct work_struct *work) |
6e1a5704 TH |
1347 | { |
1348 | struct throtl_data *td = container_of(work, struct throtl_data, | |
1349 | dispatch_work); | |
1350 | struct throtl_service_queue *td_sq = &td->service_queue; | |
1351 | struct request_queue *q = td->queue; | |
1352 | struct bio_list bio_list_on_stack; | |
1353 | struct bio *bio; | |
1354 | struct blk_plug plug; | |
1355 | int rw; | |
1356 | ||
1357 | bio_list_init(&bio_list_on_stack); | |
1358 | ||
0d945c1f | 1359 | spin_lock_irq(&q->queue_lock); |
c5cc2070 TH |
1360 | for (rw = READ; rw <= WRITE; rw++) |
1361 | while ((bio = throtl_pop_queued(&td_sq->queued[rw], NULL))) | |
1362 | bio_list_add(&bio_list_on_stack, bio); | |
0d945c1f | 1363 | spin_unlock_irq(&q->queue_lock); |
6e1a5704 TH |
1364 | |
1365 | if (!bio_list_empty(&bio_list_on_stack)) { | |
69d60eb9 | 1366 | blk_start_plug(&plug); |
ed00aabd CH |
1367 | while ((bio = bio_list_pop(&bio_list_on_stack))) |
1368 | submit_bio_noacct(bio); | |
69d60eb9 | 1369 | blk_finish_plug(&plug); |
e43473b7 | 1370 | } |
e43473b7 VG |
1371 | } |
1372 | ||
f95a04af TH |
1373 | static u64 tg_prfill_conf_u64(struct seq_file *sf, struct blkg_policy_data *pd, |
1374 | int off) | |
60c2bc2d | 1375 | { |
f95a04af TH |
1376 | struct throtl_grp *tg = pd_to_tg(pd); |
1377 | u64 v = *(u64 *)((void *)tg + off); | |
60c2bc2d | 1378 | |
2ab5492d | 1379 | if (v == U64_MAX) |
60c2bc2d | 1380 | return 0; |
f95a04af | 1381 | return __blkg_prfill_u64(sf, pd, v); |
60c2bc2d TH |
1382 | } |
1383 | ||
f95a04af TH |
1384 | static u64 tg_prfill_conf_uint(struct seq_file *sf, struct blkg_policy_data *pd, |
1385 | int off) | |
e43473b7 | 1386 | { |
f95a04af TH |
1387 | struct throtl_grp *tg = pd_to_tg(pd); |
1388 | unsigned int v = *(unsigned int *)((void *)tg + off); | |
fe071437 | 1389 | |
2ab5492d | 1390 | if (v == UINT_MAX) |
af133ceb | 1391 | return 0; |
f95a04af | 1392 | return __blkg_prfill_u64(sf, pd, v); |
e43473b7 VG |
1393 | } |
1394 | ||
2da8ca82 | 1395 | static int tg_print_conf_u64(struct seq_file *sf, void *v) |
8e89d13f | 1396 | { |
2da8ca82 TH |
1397 | blkcg_print_blkgs(sf, css_to_blkcg(seq_css(sf)), tg_prfill_conf_u64, |
1398 | &blkcg_policy_throtl, seq_cft(sf)->private, false); | |
af133ceb | 1399 | return 0; |
8e89d13f VG |
1400 | } |
1401 | ||
2da8ca82 | 1402 | static int tg_print_conf_uint(struct seq_file *sf, void *v) |
8e89d13f | 1403 | { |
2da8ca82 TH |
1404 | blkcg_print_blkgs(sf, css_to_blkcg(seq_css(sf)), tg_prfill_conf_uint, |
1405 | &blkcg_policy_throtl, seq_cft(sf)->private, false); | |
af133ceb | 1406 | return 0; |
60c2bc2d TH |
1407 | } |
1408 | ||
9bb67aeb | 1409 | static void tg_conf_updated(struct throtl_grp *tg, bool global) |
60c2bc2d | 1410 | { |
69948b07 | 1411 | struct throtl_service_queue *sq = &tg->service_queue; |
492eb21b | 1412 | struct cgroup_subsys_state *pos_css; |
69948b07 | 1413 | struct blkcg_gq *blkg; |
af133ceb | 1414 | |
fda6f272 TH |
1415 | throtl_log(&tg->service_queue, |
1416 | "limit change rbps=%llu wbps=%llu riops=%u wiops=%u", | |
9f626e37 SL |
1417 | tg_bps_limit(tg, READ), tg_bps_limit(tg, WRITE), |
1418 | tg_iops_limit(tg, READ), tg_iops_limit(tg, WRITE)); | |
632b4493 | 1419 | |
693e751e TH |
1420 | /* |
1421 | * Update has_rules[] flags for the updated tg's subtree. A tg is | |
1422 | * considered to have rules if either the tg itself or any of its | |
1423 | * ancestors has rules. This identifies groups without any | |
1424 | * restrictions in the whole hierarchy and allows them to bypass | |
1425 | * blk-throttle. | |
1426 | */ | |
9bb67aeb SL |
1427 | blkg_for_each_descendant_pre(blkg, pos_css, |
1428 | global ? tg->td->queue->root_blkg : tg_to_blkg(tg)) { | |
5b81fc3c SL |
1429 | struct throtl_grp *this_tg = blkg_to_tg(blkg); |
1430 | struct throtl_grp *parent_tg; | |
1431 | ||
1432 | tg_update_has_rules(this_tg); | |
1433 | /* ignore root/second level */ | |
1434 | if (!cgroup_subsys_on_dfl(io_cgrp_subsys) || !blkg->parent || | |
1435 | !blkg->parent->parent) | |
1436 | continue; | |
1437 | parent_tg = blkg_to_tg(blkg->parent); | |
1438 | /* | |
1439 | * make sure all children has lower idle time threshold and | |
1440 | * higher latency target | |
1441 | */ | |
1442 | this_tg->idletime_threshold = min(this_tg->idletime_threshold, | |
1443 | parent_tg->idletime_threshold); | |
1444 | this_tg->latency_target = max(this_tg->latency_target, | |
1445 | parent_tg->latency_target); | |
1446 | } | |
693e751e | 1447 | |
632b4493 TH |
1448 | /* |
1449 | * We're already holding queue_lock and know @tg is valid. Let's | |
1450 | * apply the new config directly. | |
1451 | * | |
1452 | * Restart the slices for both READ and WRITES. It might happen | |
1453 | * that a group's limit are dropped suddenly and we don't want to | |
1454 | * account recently dispatched IO with new low rate. | |
1455 | */ | |
ff8b22c0 BW |
1456 | throtl_start_new_slice(tg, READ); |
1457 | throtl_start_new_slice(tg, WRITE); | |
632b4493 | 1458 | |
5b2c16aa | 1459 | if (tg->flags & THROTL_TG_PENDING) { |
77216b04 | 1460 | tg_update_disptime(tg); |
7f52f98c | 1461 | throtl_schedule_next_dispatch(sq->parent_sq, true); |
632b4493 | 1462 | } |
69948b07 TH |
1463 | } |
1464 | ||
1465 | static ssize_t tg_set_conf(struct kernfs_open_file *of, | |
1466 | char *buf, size_t nbytes, loff_t off, bool is_u64) | |
1467 | { | |
1468 | struct blkcg *blkcg = css_to_blkcg(of_css(of)); | |
1469 | struct blkg_conf_ctx ctx; | |
1470 | struct throtl_grp *tg; | |
1471 | int ret; | |
1472 | u64 v; | |
1473 | ||
1474 | ret = blkg_conf_prep(blkcg, &blkcg_policy_throtl, buf, &ctx); | |
1475 | if (ret) | |
1476 | return ret; | |
1477 | ||
1478 | ret = -EINVAL; | |
1479 | if (sscanf(ctx.body, "%llu", &v) != 1) | |
1480 | goto out_finish; | |
1481 | if (!v) | |
2ab5492d | 1482 | v = U64_MAX; |
69948b07 TH |
1483 | |
1484 | tg = blkg_to_tg(ctx.blkg); | |
1485 | ||
1486 | if (is_u64) | |
1487 | *(u64 *)((void *)tg + of_cft(of)->private) = v; | |
1488 | else | |
1489 | *(unsigned int *)((void *)tg + of_cft(of)->private) = v; | |
60c2bc2d | 1490 | |
9bb67aeb | 1491 | tg_conf_updated(tg, false); |
36aa9e5f TH |
1492 | ret = 0; |
1493 | out_finish: | |
60c2bc2d | 1494 | blkg_conf_finish(&ctx); |
36aa9e5f | 1495 | return ret ?: nbytes; |
8e89d13f VG |
1496 | } |
1497 | ||
451af504 TH |
1498 | static ssize_t tg_set_conf_u64(struct kernfs_open_file *of, |
1499 | char *buf, size_t nbytes, loff_t off) | |
60c2bc2d | 1500 | { |
451af504 | 1501 | return tg_set_conf(of, buf, nbytes, off, true); |
60c2bc2d TH |
1502 | } |
1503 | ||
451af504 TH |
1504 | static ssize_t tg_set_conf_uint(struct kernfs_open_file *of, |
1505 | char *buf, size_t nbytes, loff_t off) | |
60c2bc2d | 1506 | { |
451af504 | 1507 | return tg_set_conf(of, buf, nbytes, off, false); |
60c2bc2d TH |
1508 | } |
1509 | ||
7ca46438 TH |
1510 | static int tg_print_rwstat(struct seq_file *sf, void *v) |
1511 | { | |
1512 | blkcg_print_blkgs(sf, css_to_blkcg(seq_css(sf)), | |
1513 | blkg_prfill_rwstat, &blkcg_policy_throtl, | |
1514 | seq_cft(sf)->private, true); | |
1515 | return 0; | |
1516 | } | |
1517 | ||
1518 | static u64 tg_prfill_rwstat_recursive(struct seq_file *sf, | |
1519 | struct blkg_policy_data *pd, int off) | |
1520 | { | |
1521 | struct blkg_rwstat_sample sum; | |
1522 | ||
1523 | blkg_rwstat_recursive_sum(pd_to_blkg(pd), &blkcg_policy_throtl, off, | |
1524 | &sum); | |
1525 | return __blkg_prfill_rwstat(sf, pd, &sum); | |
1526 | } | |
1527 | ||
1528 | static int tg_print_rwstat_recursive(struct seq_file *sf, void *v) | |
1529 | { | |
1530 | blkcg_print_blkgs(sf, css_to_blkcg(seq_css(sf)), | |
1531 | tg_prfill_rwstat_recursive, &blkcg_policy_throtl, | |
1532 | seq_cft(sf)->private, true); | |
1533 | return 0; | |
1534 | } | |
1535 | ||
880f50e2 | 1536 | static struct cftype throtl_legacy_files[] = { |
60c2bc2d TH |
1537 | { |
1538 | .name = "throttle.read_bps_device", | |
9f626e37 | 1539 | .private = offsetof(struct throtl_grp, bps[READ][LIMIT_MAX]), |
2da8ca82 | 1540 | .seq_show = tg_print_conf_u64, |
451af504 | 1541 | .write = tg_set_conf_u64, |
60c2bc2d TH |
1542 | }, |
1543 | { | |
1544 | .name = "throttle.write_bps_device", | |
9f626e37 | 1545 | .private = offsetof(struct throtl_grp, bps[WRITE][LIMIT_MAX]), |
2da8ca82 | 1546 | .seq_show = tg_print_conf_u64, |
451af504 | 1547 | .write = tg_set_conf_u64, |
60c2bc2d TH |
1548 | }, |
1549 | { | |
1550 | .name = "throttle.read_iops_device", | |
9f626e37 | 1551 | .private = offsetof(struct throtl_grp, iops[READ][LIMIT_MAX]), |
2da8ca82 | 1552 | .seq_show = tg_print_conf_uint, |
451af504 | 1553 | .write = tg_set_conf_uint, |
60c2bc2d TH |
1554 | }, |
1555 | { | |
1556 | .name = "throttle.write_iops_device", | |
9f626e37 | 1557 | .private = offsetof(struct throtl_grp, iops[WRITE][LIMIT_MAX]), |
2da8ca82 | 1558 | .seq_show = tg_print_conf_uint, |
451af504 | 1559 | .write = tg_set_conf_uint, |
60c2bc2d TH |
1560 | }, |
1561 | { | |
1562 | .name = "throttle.io_service_bytes", | |
7ca46438 TH |
1563 | .private = offsetof(struct throtl_grp, stat_bytes), |
1564 | .seq_show = tg_print_rwstat, | |
60c2bc2d | 1565 | }, |
17534c6f | 1566 | { |
1567 | .name = "throttle.io_service_bytes_recursive", | |
7ca46438 TH |
1568 | .private = offsetof(struct throtl_grp, stat_bytes), |
1569 | .seq_show = tg_print_rwstat_recursive, | |
17534c6f | 1570 | }, |
60c2bc2d TH |
1571 | { |
1572 | .name = "throttle.io_serviced", | |
7ca46438 TH |
1573 | .private = offsetof(struct throtl_grp, stat_ios), |
1574 | .seq_show = tg_print_rwstat, | |
60c2bc2d | 1575 | }, |
17534c6f | 1576 | { |
1577 | .name = "throttle.io_serviced_recursive", | |
7ca46438 TH |
1578 | .private = offsetof(struct throtl_grp, stat_ios), |
1579 | .seq_show = tg_print_rwstat_recursive, | |
17534c6f | 1580 | }, |
60c2bc2d TH |
1581 | { } /* terminate */ |
1582 | }; | |
1583 | ||
cd5ab1b0 | 1584 | static u64 tg_prfill_limit(struct seq_file *sf, struct blkg_policy_data *pd, |
2ee867dc TH |
1585 | int off) |
1586 | { | |
1587 | struct throtl_grp *tg = pd_to_tg(pd); | |
1588 | const char *dname = blkg_dev_name(pd->blkg); | |
1589 | char bufs[4][21] = { "max", "max", "max", "max" }; | |
cd5ab1b0 SL |
1590 | u64 bps_dft; |
1591 | unsigned int iops_dft; | |
ada75b6e | 1592 | char idle_time[26] = ""; |
ec80991d | 1593 | char latency_time[26] = ""; |
2ee867dc TH |
1594 | |
1595 | if (!dname) | |
1596 | return 0; | |
9f626e37 | 1597 | |
cd5ab1b0 SL |
1598 | if (off == LIMIT_LOW) { |
1599 | bps_dft = 0; | |
1600 | iops_dft = 0; | |
1601 | } else { | |
1602 | bps_dft = U64_MAX; | |
1603 | iops_dft = UINT_MAX; | |
1604 | } | |
1605 | ||
1606 | if (tg->bps_conf[READ][off] == bps_dft && | |
1607 | tg->bps_conf[WRITE][off] == bps_dft && | |
1608 | tg->iops_conf[READ][off] == iops_dft && | |
ada75b6e | 1609 | tg->iops_conf[WRITE][off] == iops_dft && |
ec80991d | 1610 | (off != LIMIT_LOW || |
b4f428ef | 1611 | (tg->idletime_threshold_conf == DFL_IDLE_THRESHOLD && |
5b81fc3c | 1612 | tg->latency_target_conf == DFL_LATENCY_TARGET))) |
2ee867dc TH |
1613 | return 0; |
1614 | ||
9bb67aeb | 1615 | if (tg->bps_conf[READ][off] != U64_MAX) |
9f626e37 | 1616 | snprintf(bufs[0], sizeof(bufs[0]), "%llu", |
cd5ab1b0 | 1617 | tg->bps_conf[READ][off]); |
9bb67aeb | 1618 | if (tg->bps_conf[WRITE][off] != U64_MAX) |
9f626e37 | 1619 | snprintf(bufs[1], sizeof(bufs[1]), "%llu", |
cd5ab1b0 | 1620 | tg->bps_conf[WRITE][off]); |
9bb67aeb | 1621 | if (tg->iops_conf[READ][off] != UINT_MAX) |
9f626e37 | 1622 | snprintf(bufs[2], sizeof(bufs[2]), "%u", |
cd5ab1b0 | 1623 | tg->iops_conf[READ][off]); |
9bb67aeb | 1624 | if (tg->iops_conf[WRITE][off] != UINT_MAX) |
9f626e37 | 1625 | snprintf(bufs[3], sizeof(bufs[3]), "%u", |
cd5ab1b0 | 1626 | tg->iops_conf[WRITE][off]); |
ada75b6e | 1627 | if (off == LIMIT_LOW) { |
5b81fc3c | 1628 | if (tg->idletime_threshold_conf == ULONG_MAX) |
ada75b6e SL |
1629 | strcpy(idle_time, " idle=max"); |
1630 | else | |
1631 | snprintf(idle_time, sizeof(idle_time), " idle=%lu", | |
5b81fc3c | 1632 | tg->idletime_threshold_conf); |
ec80991d | 1633 | |
5b81fc3c | 1634 | if (tg->latency_target_conf == ULONG_MAX) |
ec80991d SL |
1635 | strcpy(latency_time, " latency=max"); |
1636 | else | |
1637 | snprintf(latency_time, sizeof(latency_time), | |
5b81fc3c | 1638 | " latency=%lu", tg->latency_target_conf); |
ada75b6e | 1639 | } |
2ee867dc | 1640 | |
ec80991d SL |
1641 | seq_printf(sf, "%s rbps=%s wbps=%s riops=%s wiops=%s%s%s\n", |
1642 | dname, bufs[0], bufs[1], bufs[2], bufs[3], idle_time, | |
1643 | latency_time); | |
2ee867dc TH |
1644 | return 0; |
1645 | } | |
1646 | ||
cd5ab1b0 | 1647 | static int tg_print_limit(struct seq_file *sf, void *v) |
2ee867dc | 1648 | { |
cd5ab1b0 | 1649 | blkcg_print_blkgs(sf, css_to_blkcg(seq_css(sf)), tg_prfill_limit, |
2ee867dc TH |
1650 | &blkcg_policy_throtl, seq_cft(sf)->private, false); |
1651 | return 0; | |
1652 | } | |
1653 | ||
cd5ab1b0 | 1654 | static ssize_t tg_set_limit(struct kernfs_open_file *of, |
2ee867dc TH |
1655 | char *buf, size_t nbytes, loff_t off) |
1656 | { | |
1657 | struct blkcg *blkcg = css_to_blkcg(of_css(of)); | |
1658 | struct blkg_conf_ctx ctx; | |
1659 | struct throtl_grp *tg; | |
1660 | u64 v[4]; | |
ada75b6e | 1661 | unsigned long idle_time; |
ec80991d | 1662 | unsigned long latency_time; |
2ee867dc | 1663 | int ret; |
cd5ab1b0 | 1664 | int index = of_cft(of)->private; |
2ee867dc TH |
1665 | |
1666 | ret = blkg_conf_prep(blkcg, &blkcg_policy_throtl, buf, &ctx); | |
1667 | if (ret) | |
1668 | return ret; | |
1669 | ||
1670 | tg = blkg_to_tg(ctx.blkg); | |
1671 | ||
cd5ab1b0 SL |
1672 | v[0] = tg->bps_conf[READ][index]; |
1673 | v[1] = tg->bps_conf[WRITE][index]; | |
1674 | v[2] = tg->iops_conf[READ][index]; | |
1675 | v[3] = tg->iops_conf[WRITE][index]; | |
2ee867dc | 1676 | |
5b81fc3c SL |
1677 | idle_time = tg->idletime_threshold_conf; |
1678 | latency_time = tg->latency_target_conf; | |
2ee867dc TH |
1679 | while (true) { |
1680 | char tok[27]; /* wiops=18446744073709551616 */ | |
1681 | char *p; | |
2ab5492d | 1682 | u64 val = U64_MAX; |
2ee867dc TH |
1683 | int len; |
1684 | ||
1685 | if (sscanf(ctx.body, "%26s%n", tok, &len) != 1) | |
1686 | break; | |
1687 | if (tok[0] == '\0') | |
1688 | break; | |
1689 | ctx.body += len; | |
1690 | ||
1691 | ret = -EINVAL; | |
1692 | p = tok; | |
1693 | strsep(&p, "="); | |
1694 | if (!p || (sscanf(p, "%llu", &val) != 1 && strcmp(p, "max"))) | |
1695 | goto out_finish; | |
1696 | ||
1697 | ret = -ERANGE; | |
1698 | if (!val) | |
1699 | goto out_finish; | |
1700 | ||
1701 | ret = -EINVAL; | |
5b7048b8 | 1702 | if (!strcmp(tok, "rbps") && val > 1) |
2ee867dc | 1703 | v[0] = val; |
5b7048b8 | 1704 | else if (!strcmp(tok, "wbps") && val > 1) |
2ee867dc | 1705 | v[1] = val; |
5b7048b8 | 1706 | else if (!strcmp(tok, "riops") && val > 1) |
2ee867dc | 1707 | v[2] = min_t(u64, val, UINT_MAX); |
5b7048b8 | 1708 | else if (!strcmp(tok, "wiops") && val > 1) |
2ee867dc | 1709 | v[3] = min_t(u64, val, UINT_MAX); |
ada75b6e SL |
1710 | else if (off == LIMIT_LOW && !strcmp(tok, "idle")) |
1711 | idle_time = val; | |
ec80991d SL |
1712 | else if (off == LIMIT_LOW && !strcmp(tok, "latency")) |
1713 | latency_time = val; | |
2ee867dc TH |
1714 | else |
1715 | goto out_finish; | |
1716 | } | |
1717 | ||
cd5ab1b0 SL |
1718 | tg->bps_conf[READ][index] = v[0]; |
1719 | tg->bps_conf[WRITE][index] = v[1]; | |
1720 | tg->iops_conf[READ][index] = v[2]; | |
1721 | tg->iops_conf[WRITE][index] = v[3]; | |
2ee867dc | 1722 | |
cd5ab1b0 SL |
1723 | if (index == LIMIT_MAX) { |
1724 | tg->bps[READ][index] = v[0]; | |
1725 | tg->bps[WRITE][index] = v[1]; | |
1726 | tg->iops[READ][index] = v[2]; | |
1727 | tg->iops[WRITE][index] = v[3]; | |
1728 | } | |
1729 | tg->bps[READ][LIMIT_LOW] = min(tg->bps_conf[READ][LIMIT_LOW], | |
1730 | tg->bps_conf[READ][LIMIT_MAX]); | |
1731 | tg->bps[WRITE][LIMIT_LOW] = min(tg->bps_conf[WRITE][LIMIT_LOW], | |
1732 | tg->bps_conf[WRITE][LIMIT_MAX]); | |
1733 | tg->iops[READ][LIMIT_LOW] = min(tg->iops_conf[READ][LIMIT_LOW], | |
1734 | tg->iops_conf[READ][LIMIT_MAX]); | |
1735 | tg->iops[WRITE][LIMIT_LOW] = min(tg->iops_conf[WRITE][LIMIT_LOW], | |
1736 | tg->iops_conf[WRITE][LIMIT_MAX]); | |
b4f428ef SL |
1737 | tg->idletime_threshold_conf = idle_time; |
1738 | tg->latency_target_conf = latency_time; | |
1739 | ||
1740 | /* force user to configure all settings for low limit */ | |
1741 | if (!(tg->bps[READ][LIMIT_LOW] || tg->iops[READ][LIMIT_LOW] || | |
1742 | tg->bps[WRITE][LIMIT_LOW] || tg->iops[WRITE][LIMIT_LOW]) || | |
1743 | tg->idletime_threshold_conf == DFL_IDLE_THRESHOLD || | |
1744 | tg->latency_target_conf == DFL_LATENCY_TARGET) { | |
1745 | tg->bps[READ][LIMIT_LOW] = 0; | |
1746 | tg->bps[WRITE][LIMIT_LOW] = 0; | |
1747 | tg->iops[READ][LIMIT_LOW] = 0; | |
1748 | tg->iops[WRITE][LIMIT_LOW] = 0; | |
1749 | tg->idletime_threshold = DFL_IDLE_THRESHOLD; | |
1750 | tg->latency_target = DFL_LATENCY_TARGET; | |
1751 | } else if (index == LIMIT_LOW) { | |
5b81fc3c | 1752 | tg->idletime_threshold = tg->idletime_threshold_conf; |
5b81fc3c | 1753 | tg->latency_target = tg->latency_target_conf; |
cd5ab1b0 | 1754 | } |
b4f428ef SL |
1755 | |
1756 | blk_throtl_update_limit_valid(tg->td); | |
1757 | if (tg->td->limit_valid[LIMIT_LOW]) { | |
1758 | if (index == LIMIT_LOW) | |
1759 | tg->td->limit_index = LIMIT_LOW; | |
1760 | } else | |
1761 | tg->td->limit_index = LIMIT_MAX; | |
9bb67aeb SL |
1762 | tg_conf_updated(tg, index == LIMIT_LOW && |
1763 | tg->td->limit_valid[LIMIT_LOW]); | |
2ee867dc TH |
1764 | ret = 0; |
1765 | out_finish: | |
1766 | blkg_conf_finish(&ctx); | |
1767 | return ret ?: nbytes; | |
1768 | } | |
1769 | ||
1770 | static struct cftype throtl_files[] = { | |
cd5ab1b0 SL |
1771 | #ifdef CONFIG_BLK_DEV_THROTTLING_LOW |
1772 | { | |
1773 | .name = "low", | |
1774 | .flags = CFTYPE_NOT_ON_ROOT, | |
1775 | .seq_show = tg_print_limit, | |
1776 | .write = tg_set_limit, | |
1777 | .private = LIMIT_LOW, | |
1778 | }, | |
1779 | #endif | |
2ee867dc TH |
1780 | { |
1781 | .name = "max", | |
1782 | .flags = CFTYPE_NOT_ON_ROOT, | |
cd5ab1b0 SL |
1783 | .seq_show = tg_print_limit, |
1784 | .write = tg_set_limit, | |
1785 | .private = LIMIT_MAX, | |
2ee867dc TH |
1786 | }, |
1787 | { } /* terminate */ | |
1788 | }; | |
1789 | ||
da527770 | 1790 | static void throtl_shutdown_wq(struct request_queue *q) |
e43473b7 VG |
1791 | { |
1792 | struct throtl_data *td = q->td; | |
1793 | ||
69df0ab0 | 1794 | cancel_work_sync(&td->dispatch_work); |
e43473b7 VG |
1795 | } |
1796 | ||
3c798398 | 1797 | static struct blkcg_policy blkcg_policy_throtl = { |
2ee867dc | 1798 | .dfl_cftypes = throtl_files, |
880f50e2 | 1799 | .legacy_cftypes = throtl_legacy_files, |
f9fcc2d3 | 1800 | |
001bea73 | 1801 | .pd_alloc_fn = throtl_pd_alloc, |
f9fcc2d3 | 1802 | .pd_init_fn = throtl_pd_init, |
693e751e | 1803 | .pd_online_fn = throtl_pd_online, |
cd5ab1b0 | 1804 | .pd_offline_fn = throtl_pd_offline, |
001bea73 | 1805 | .pd_free_fn = throtl_pd_free, |
e43473b7 VG |
1806 | }; |
1807 | ||
3f0abd80 SL |
1808 | static unsigned long __tg_last_low_overflow_time(struct throtl_grp *tg) |
1809 | { | |
1810 | unsigned long rtime = jiffies, wtime = jiffies; | |
1811 | ||
1812 | if (tg->bps[READ][LIMIT_LOW] || tg->iops[READ][LIMIT_LOW]) | |
1813 | rtime = tg->last_low_overflow_time[READ]; | |
1814 | if (tg->bps[WRITE][LIMIT_LOW] || tg->iops[WRITE][LIMIT_LOW]) | |
1815 | wtime = tg->last_low_overflow_time[WRITE]; | |
1816 | return min(rtime, wtime); | |
1817 | } | |
1818 | ||
1819 | /* tg should not be an intermediate node */ | |
1820 | static unsigned long tg_last_low_overflow_time(struct throtl_grp *tg) | |
1821 | { | |
1822 | struct throtl_service_queue *parent_sq; | |
1823 | struct throtl_grp *parent = tg; | |
1824 | unsigned long ret = __tg_last_low_overflow_time(tg); | |
1825 | ||
1826 | while (true) { | |
1827 | parent_sq = parent->service_queue.parent_sq; | |
1828 | parent = sq_to_tg(parent_sq); | |
1829 | if (!parent) | |
1830 | break; | |
1831 | ||
1832 | /* | |
1833 | * The parent doesn't have low limit, it always reaches low | |
1834 | * limit. Its overflow time is useless for children | |
1835 | */ | |
1836 | if (!parent->bps[READ][LIMIT_LOW] && | |
1837 | !parent->iops[READ][LIMIT_LOW] && | |
1838 | !parent->bps[WRITE][LIMIT_LOW] && | |
1839 | !parent->iops[WRITE][LIMIT_LOW]) | |
1840 | continue; | |
1841 | if (time_after(__tg_last_low_overflow_time(parent), ret)) | |
1842 | ret = __tg_last_low_overflow_time(parent); | |
1843 | } | |
1844 | return ret; | |
1845 | } | |
1846 | ||
9e234eea SL |
1847 | static bool throtl_tg_is_idle(struct throtl_grp *tg) |
1848 | { | |
1849 | /* | |
1850 | * cgroup is idle if: | |
1851 | * - single idle is too long, longer than a fixed value (in case user | |
b4f428ef | 1852 | * configure a too big threshold) or 4 times of idletime threshold |
9e234eea | 1853 | * - average think time is more than threshold |
53696b8d | 1854 | * - IO latency is largely below threshold |
9e234eea | 1855 | */ |
b4f428ef | 1856 | unsigned long time; |
4cff729f | 1857 | bool ret; |
9e234eea | 1858 | |
b4f428ef SL |
1859 | time = min_t(unsigned long, MAX_IDLE_TIME, 4 * tg->idletime_threshold); |
1860 | ret = tg->latency_target == DFL_LATENCY_TARGET || | |
1861 | tg->idletime_threshold == DFL_IDLE_THRESHOLD || | |
1862 | (ktime_get_ns() >> 10) - tg->last_finish_time > time || | |
1863 | tg->avg_idletime > tg->idletime_threshold || | |
1864 | (tg->latency_target && tg->bio_cnt && | |
53696b8d | 1865 | tg->bad_bio_cnt * 5 < tg->bio_cnt); |
4cff729f SL |
1866 | throtl_log(&tg->service_queue, |
1867 | "avg_idle=%ld, idle_threshold=%ld, bad_bio=%d, total_bio=%d, is_idle=%d, scale=%d", | |
1868 | tg->avg_idletime, tg->idletime_threshold, tg->bad_bio_cnt, | |
1869 | tg->bio_cnt, ret, tg->td->scale); | |
1870 | return ret; | |
9e234eea SL |
1871 | } |
1872 | ||
c79892c5 SL |
1873 | static bool throtl_tg_can_upgrade(struct throtl_grp *tg) |
1874 | { | |
1875 | struct throtl_service_queue *sq = &tg->service_queue; | |
1876 | bool read_limit, write_limit; | |
1877 | ||
1878 | /* | |
1879 | * if cgroup reaches low limit (if low limit is 0, the cgroup always | |
1880 | * reaches), it's ok to upgrade to next limit | |
1881 | */ | |
1882 | read_limit = tg->bps[READ][LIMIT_LOW] || tg->iops[READ][LIMIT_LOW]; | |
1883 | write_limit = tg->bps[WRITE][LIMIT_LOW] || tg->iops[WRITE][LIMIT_LOW]; | |
1884 | if (!read_limit && !write_limit) | |
1885 | return true; | |
1886 | if (read_limit && sq->nr_queued[READ] && | |
1887 | (!write_limit || sq->nr_queued[WRITE])) | |
1888 | return true; | |
1889 | if (write_limit && sq->nr_queued[WRITE] && | |
1890 | (!read_limit || sq->nr_queued[READ])) | |
1891 | return true; | |
aec24246 SL |
1892 | |
1893 | if (time_after_eq(jiffies, | |
fa6fb5aa SL |
1894 | tg_last_low_overflow_time(tg) + tg->td->throtl_slice) && |
1895 | throtl_tg_is_idle(tg)) | |
aec24246 | 1896 | return true; |
c79892c5 SL |
1897 | return false; |
1898 | } | |
1899 | ||
1900 | static bool throtl_hierarchy_can_upgrade(struct throtl_grp *tg) | |
1901 | { | |
1902 | while (true) { | |
1903 | if (throtl_tg_can_upgrade(tg)) | |
1904 | return true; | |
1905 | tg = sq_to_tg(tg->service_queue.parent_sq); | |
1906 | if (!tg || !tg_to_blkg(tg)->parent) | |
1907 | return false; | |
1908 | } | |
1909 | return false; | |
1910 | } | |
1911 | ||
1912 | static bool throtl_can_upgrade(struct throtl_data *td, | |
1913 | struct throtl_grp *this_tg) | |
1914 | { | |
1915 | struct cgroup_subsys_state *pos_css; | |
1916 | struct blkcg_gq *blkg; | |
1917 | ||
1918 | if (td->limit_index != LIMIT_LOW) | |
1919 | return false; | |
1920 | ||
297e3d85 | 1921 | if (time_before(jiffies, td->low_downgrade_time + td->throtl_slice)) |
3f0abd80 SL |
1922 | return false; |
1923 | ||
c79892c5 SL |
1924 | rcu_read_lock(); |
1925 | blkg_for_each_descendant_post(blkg, pos_css, td->queue->root_blkg) { | |
1926 | struct throtl_grp *tg = blkg_to_tg(blkg); | |
1927 | ||
1928 | if (tg == this_tg) | |
1929 | continue; | |
1930 | if (!list_empty(&tg_to_blkg(tg)->blkcg->css.children)) | |
1931 | continue; | |
1932 | if (!throtl_hierarchy_can_upgrade(tg)) { | |
1933 | rcu_read_unlock(); | |
1934 | return false; | |
1935 | } | |
1936 | } | |
1937 | rcu_read_unlock(); | |
1938 | return true; | |
1939 | } | |
1940 | ||
fa6fb5aa SL |
1941 | static void throtl_upgrade_check(struct throtl_grp *tg) |
1942 | { | |
1943 | unsigned long now = jiffies; | |
1944 | ||
1945 | if (tg->td->limit_index != LIMIT_LOW) | |
1946 | return; | |
1947 | ||
1948 | if (time_after(tg->last_check_time + tg->td->throtl_slice, now)) | |
1949 | return; | |
1950 | ||
1951 | tg->last_check_time = now; | |
1952 | ||
1953 | if (!time_after_eq(now, | |
1954 | __tg_last_low_overflow_time(tg) + tg->td->throtl_slice)) | |
1955 | return; | |
1956 | ||
1957 | if (throtl_can_upgrade(tg->td, NULL)) | |
1958 | throtl_upgrade_state(tg->td); | |
1959 | } | |
1960 | ||
c79892c5 SL |
1961 | static void throtl_upgrade_state(struct throtl_data *td) |
1962 | { | |
1963 | struct cgroup_subsys_state *pos_css; | |
1964 | struct blkcg_gq *blkg; | |
1965 | ||
4cff729f | 1966 | throtl_log(&td->service_queue, "upgrade to max"); |
c79892c5 | 1967 | td->limit_index = LIMIT_MAX; |
3f0abd80 | 1968 | td->low_upgrade_time = jiffies; |
7394e31f | 1969 | td->scale = 0; |
c79892c5 SL |
1970 | rcu_read_lock(); |
1971 | blkg_for_each_descendant_post(blkg, pos_css, td->queue->root_blkg) { | |
1972 | struct throtl_grp *tg = blkg_to_tg(blkg); | |
1973 | struct throtl_service_queue *sq = &tg->service_queue; | |
1974 | ||
1975 | tg->disptime = jiffies - 1; | |
1976 | throtl_select_dispatch(sq); | |
4f02fb76 | 1977 | throtl_schedule_next_dispatch(sq, true); |
c79892c5 SL |
1978 | } |
1979 | rcu_read_unlock(); | |
1980 | throtl_select_dispatch(&td->service_queue); | |
4f02fb76 | 1981 | throtl_schedule_next_dispatch(&td->service_queue, true); |
c79892c5 SL |
1982 | queue_work(kthrotld_workqueue, &td->dispatch_work); |
1983 | } | |
1984 | ||
4247d9c8 | 1985 | static void throtl_downgrade_state(struct throtl_data *td) |
3f0abd80 | 1986 | { |
7394e31f SL |
1987 | td->scale /= 2; |
1988 | ||
4cff729f | 1989 | throtl_log(&td->service_queue, "downgrade, scale %d", td->scale); |
7394e31f SL |
1990 | if (td->scale) { |
1991 | td->low_upgrade_time = jiffies - td->scale * td->throtl_slice; | |
1992 | return; | |
1993 | } | |
1994 | ||
4247d9c8 | 1995 | td->limit_index = LIMIT_LOW; |
3f0abd80 SL |
1996 | td->low_downgrade_time = jiffies; |
1997 | } | |
1998 | ||
1999 | static bool throtl_tg_can_downgrade(struct throtl_grp *tg) | |
2000 | { | |
2001 | struct throtl_data *td = tg->td; | |
2002 | unsigned long now = jiffies; | |
2003 | ||
2004 | /* | |
2005 | * If cgroup is below low limit, consider downgrade and throttle other | |
2006 | * cgroups | |
2007 | */ | |
297e3d85 SL |
2008 | if (time_after_eq(now, td->low_upgrade_time + td->throtl_slice) && |
2009 | time_after_eq(now, tg_last_low_overflow_time(tg) + | |
fa6fb5aa SL |
2010 | td->throtl_slice) && |
2011 | (!throtl_tg_is_idle(tg) || | |
2012 | !list_empty(&tg_to_blkg(tg)->blkcg->css.children))) | |
3f0abd80 SL |
2013 | return true; |
2014 | return false; | |
2015 | } | |
2016 | ||
2017 | static bool throtl_hierarchy_can_downgrade(struct throtl_grp *tg) | |
2018 | { | |
2019 | while (true) { | |
2020 | if (!throtl_tg_can_downgrade(tg)) | |
2021 | return false; | |
2022 | tg = sq_to_tg(tg->service_queue.parent_sq); | |
2023 | if (!tg || !tg_to_blkg(tg)->parent) | |
2024 | break; | |
2025 | } | |
2026 | return true; | |
2027 | } | |
2028 | ||
2029 | static void throtl_downgrade_check(struct throtl_grp *tg) | |
2030 | { | |
2031 | uint64_t bps; | |
2032 | unsigned int iops; | |
2033 | unsigned long elapsed_time; | |
2034 | unsigned long now = jiffies; | |
2035 | ||
2036 | if (tg->td->limit_index != LIMIT_MAX || | |
2037 | !tg->td->limit_valid[LIMIT_LOW]) | |
2038 | return; | |
2039 | if (!list_empty(&tg_to_blkg(tg)->blkcg->css.children)) | |
2040 | return; | |
297e3d85 | 2041 | if (time_after(tg->last_check_time + tg->td->throtl_slice, now)) |
3f0abd80 SL |
2042 | return; |
2043 | ||
2044 | elapsed_time = now - tg->last_check_time; | |
2045 | tg->last_check_time = now; | |
2046 | ||
297e3d85 SL |
2047 | if (time_before(now, tg_last_low_overflow_time(tg) + |
2048 | tg->td->throtl_slice)) | |
3f0abd80 SL |
2049 | return; |
2050 | ||
2051 | if (tg->bps[READ][LIMIT_LOW]) { | |
2052 | bps = tg->last_bytes_disp[READ] * HZ; | |
2053 | do_div(bps, elapsed_time); | |
2054 | if (bps >= tg->bps[READ][LIMIT_LOW]) | |
2055 | tg->last_low_overflow_time[READ] = now; | |
2056 | } | |
2057 | ||
2058 | if (tg->bps[WRITE][LIMIT_LOW]) { | |
2059 | bps = tg->last_bytes_disp[WRITE] * HZ; | |
2060 | do_div(bps, elapsed_time); | |
2061 | if (bps >= tg->bps[WRITE][LIMIT_LOW]) | |
2062 | tg->last_low_overflow_time[WRITE] = now; | |
2063 | } | |
2064 | ||
2065 | if (tg->iops[READ][LIMIT_LOW]) { | |
4f1e9630 | 2066 | tg->last_io_disp[READ] += atomic_xchg(&tg->last_io_split_cnt[READ], 0); |
3f0abd80 SL |
2067 | iops = tg->last_io_disp[READ] * HZ / elapsed_time; |
2068 | if (iops >= tg->iops[READ][LIMIT_LOW]) | |
2069 | tg->last_low_overflow_time[READ] = now; | |
2070 | } | |
2071 | ||
2072 | if (tg->iops[WRITE][LIMIT_LOW]) { | |
4f1e9630 | 2073 | tg->last_io_disp[WRITE] += atomic_xchg(&tg->last_io_split_cnt[WRITE], 0); |
3f0abd80 SL |
2074 | iops = tg->last_io_disp[WRITE] * HZ / elapsed_time; |
2075 | if (iops >= tg->iops[WRITE][LIMIT_LOW]) | |
2076 | tg->last_low_overflow_time[WRITE] = now; | |
2077 | } | |
2078 | ||
2079 | /* | |
2080 | * If cgroup is below low limit, consider downgrade and throttle other | |
2081 | * cgroups | |
2082 | */ | |
2083 | if (throtl_hierarchy_can_downgrade(tg)) | |
4247d9c8 | 2084 | throtl_downgrade_state(tg->td); |
3f0abd80 SL |
2085 | |
2086 | tg->last_bytes_disp[READ] = 0; | |
2087 | tg->last_bytes_disp[WRITE] = 0; | |
2088 | tg->last_io_disp[READ] = 0; | |
2089 | tg->last_io_disp[WRITE] = 0; | |
2090 | } | |
2091 | ||
9e234eea SL |
2092 | static void blk_throtl_update_idletime(struct throtl_grp *tg) |
2093 | { | |
7901601a | 2094 | unsigned long now; |
9e234eea SL |
2095 | unsigned long last_finish_time = tg->last_finish_time; |
2096 | ||
7901601a BW |
2097 | if (last_finish_time == 0) |
2098 | return; | |
2099 | ||
2100 | now = ktime_get_ns() >> 10; | |
2101 | if (now <= last_finish_time || | |
9e234eea SL |
2102 | last_finish_time == tg->checked_last_finish_time) |
2103 | return; | |
2104 | ||
2105 | tg->avg_idletime = (tg->avg_idletime * 7 + now - last_finish_time) >> 3; | |
2106 | tg->checked_last_finish_time = last_finish_time; | |
2107 | } | |
2108 | ||
b9147dd1 SL |
2109 | #ifdef CONFIG_BLK_DEV_THROTTLING_LOW |
2110 | static void throtl_update_latency_buckets(struct throtl_data *td) | |
2111 | { | |
b889bf66 JQ |
2112 | struct avg_latency_bucket avg_latency[2][LATENCY_BUCKET_SIZE]; |
2113 | int i, cpu, rw; | |
2114 | unsigned long last_latency[2] = { 0 }; | |
2115 | unsigned long latency[2]; | |
b9147dd1 | 2116 | |
b185efa7 | 2117 | if (!blk_queue_nonrot(td->queue) || !td->limit_valid[LIMIT_LOW]) |
b9147dd1 SL |
2118 | return; |
2119 | if (time_before(jiffies, td->last_calculate_time + HZ)) | |
2120 | return; | |
2121 | td->last_calculate_time = jiffies; | |
2122 | ||
2123 | memset(avg_latency, 0, sizeof(avg_latency)); | |
b889bf66 JQ |
2124 | for (rw = READ; rw <= WRITE; rw++) { |
2125 | for (i = 0; i < LATENCY_BUCKET_SIZE; i++) { | |
2126 | struct latency_bucket *tmp = &td->tmp_buckets[rw][i]; | |
2127 | ||
2128 | for_each_possible_cpu(cpu) { | |
2129 | struct latency_bucket *bucket; | |
2130 | ||
2131 | /* this isn't race free, but ok in practice */ | |
2132 | bucket = per_cpu_ptr(td->latency_buckets[rw], | |
2133 | cpu); | |
2134 | tmp->total_latency += bucket[i].total_latency; | |
2135 | tmp->samples += bucket[i].samples; | |
2136 | bucket[i].total_latency = 0; | |
2137 | bucket[i].samples = 0; | |
2138 | } | |
b9147dd1 | 2139 | |
b889bf66 JQ |
2140 | if (tmp->samples >= 32) { |
2141 | int samples = tmp->samples; | |
b9147dd1 | 2142 | |
b889bf66 | 2143 | latency[rw] = tmp->total_latency; |
b9147dd1 | 2144 | |
b889bf66 JQ |
2145 | tmp->total_latency = 0; |
2146 | tmp->samples = 0; | |
2147 | latency[rw] /= samples; | |
2148 | if (latency[rw] == 0) | |
2149 | continue; | |
2150 | avg_latency[rw][i].latency = latency[rw]; | |
2151 | } | |
b9147dd1 SL |
2152 | } |
2153 | } | |
2154 | ||
b889bf66 JQ |
2155 | for (rw = READ; rw <= WRITE; rw++) { |
2156 | for (i = 0; i < LATENCY_BUCKET_SIZE; i++) { | |
2157 | if (!avg_latency[rw][i].latency) { | |
2158 | if (td->avg_buckets[rw][i].latency < last_latency[rw]) | |
2159 | td->avg_buckets[rw][i].latency = | |
2160 | last_latency[rw]; | |
2161 | continue; | |
2162 | } | |
b9147dd1 | 2163 | |
b889bf66 JQ |
2164 | if (!td->avg_buckets[rw][i].valid) |
2165 | latency[rw] = avg_latency[rw][i].latency; | |
2166 | else | |
2167 | latency[rw] = (td->avg_buckets[rw][i].latency * 7 + | |
2168 | avg_latency[rw][i].latency) >> 3; | |
b9147dd1 | 2169 | |
b889bf66 JQ |
2170 | td->avg_buckets[rw][i].latency = max(latency[rw], |
2171 | last_latency[rw]); | |
2172 | td->avg_buckets[rw][i].valid = true; | |
2173 | last_latency[rw] = td->avg_buckets[rw][i].latency; | |
2174 | } | |
b9147dd1 | 2175 | } |
4cff729f SL |
2176 | |
2177 | for (i = 0; i < LATENCY_BUCKET_SIZE; i++) | |
2178 | throtl_log(&td->service_queue, | |
b889bf66 JQ |
2179 | "Latency bucket %d: read latency=%ld, read valid=%d, " |
2180 | "write latency=%ld, write valid=%d", i, | |
2181 | td->avg_buckets[READ][i].latency, | |
2182 | td->avg_buckets[READ][i].valid, | |
2183 | td->avg_buckets[WRITE][i].latency, | |
2184 | td->avg_buckets[WRITE][i].valid); | |
b9147dd1 SL |
2185 | } |
2186 | #else | |
2187 | static inline void throtl_update_latency_buckets(struct throtl_data *td) | |
2188 | { | |
2189 | } | |
2190 | #endif | |
2191 | ||
4f1e9630 CX |
2192 | void blk_throtl_charge_bio_split(struct bio *bio) |
2193 | { | |
2194 | struct blkcg_gq *blkg = bio->bi_blkg; | |
2195 | struct throtl_grp *parent = blkg_to_tg(blkg); | |
2196 | struct throtl_service_queue *parent_sq; | |
2197 | bool rw = bio_data_dir(bio); | |
2198 | ||
2199 | do { | |
2200 | if (!parent->has_rules[rw]) | |
2201 | break; | |
2202 | ||
2203 | atomic_inc(&parent->io_split_cnt[rw]); | |
2204 | atomic_inc(&parent->last_io_split_cnt[rw]); | |
2205 | ||
2206 | parent_sq = parent->service_queue.parent_sq; | |
2207 | parent = sq_to_tg(parent_sq); | |
2208 | } while (parent); | |
2209 | } | |
2210 | ||
db18a53e | 2211 | bool blk_throtl_bio(struct bio *bio) |
e43473b7 | 2212 | { |
309dca30 | 2213 | struct request_queue *q = bio->bi_bdev->bd_disk->queue; |
db18a53e | 2214 | struct blkcg_gq *blkg = bio->bi_blkg; |
c5cc2070 | 2215 | struct throtl_qnode *qn = NULL; |
a2e83ef9 | 2216 | struct throtl_grp *tg = blkg_to_tg(blkg); |
73f0d49a | 2217 | struct throtl_service_queue *sq; |
0e9f4164 | 2218 | bool rw = bio_data_dir(bio); |
bc16a4f9 | 2219 | bool throttled = false; |
b9147dd1 | 2220 | struct throtl_data *td = tg->td; |
e43473b7 | 2221 | |
93b80638 | 2222 | rcu_read_lock(); |
ae118896 | 2223 | |
2a0f61e6 | 2224 | /* see throtl_charge_bio() */ |
7ca46438 TH |
2225 | if (bio_flagged(bio, BIO_THROTTLED)) |
2226 | goto out; | |
2227 | ||
2228 | if (!cgroup_subsys_on_dfl(io_cgrp_subsys)) { | |
2229 | blkg_rwstat_add(&tg->stat_bytes, bio->bi_opf, | |
2230 | bio->bi_iter.bi_size); | |
2231 | blkg_rwstat_add(&tg->stat_ios, bio->bi_opf, 1); | |
2232 | } | |
2233 | ||
2234 | if (!tg->has_rules[rw]) | |
bc16a4f9 | 2235 | goto out; |
e43473b7 | 2236 | |
0d945c1f | 2237 | spin_lock_irq(&q->queue_lock); |
c9589f03 | 2238 | |
b9147dd1 SL |
2239 | throtl_update_latency_buckets(td); |
2240 | ||
9e234eea SL |
2241 | blk_throtl_update_idletime(tg); |
2242 | ||
73f0d49a TH |
2243 | sq = &tg->service_queue; |
2244 | ||
c79892c5 | 2245 | again: |
9e660acf | 2246 | while (true) { |
3f0abd80 SL |
2247 | if (tg->last_low_overflow_time[rw] == 0) |
2248 | tg->last_low_overflow_time[rw] = jiffies; | |
2249 | throtl_downgrade_check(tg); | |
fa6fb5aa | 2250 | throtl_upgrade_check(tg); |
9e660acf TH |
2251 | /* throtl is FIFO - if bios are already queued, should queue */ |
2252 | if (sq->nr_queued[rw]) | |
2253 | break; | |
de701c74 | 2254 | |
9e660acf | 2255 | /* if above limits, break to queue */ |
c79892c5 | 2256 | if (!tg_may_dispatch(tg, bio, NULL)) { |
3f0abd80 | 2257 | tg->last_low_overflow_time[rw] = jiffies; |
b9147dd1 SL |
2258 | if (throtl_can_upgrade(td, tg)) { |
2259 | throtl_upgrade_state(td); | |
c79892c5 SL |
2260 | goto again; |
2261 | } | |
9e660acf | 2262 | break; |
c79892c5 | 2263 | } |
9e660acf TH |
2264 | |
2265 | /* within limits, let's charge and dispatch directly */ | |
e43473b7 | 2266 | throtl_charge_bio(tg, bio); |
04521db0 VG |
2267 | |
2268 | /* | |
2269 | * We need to trim slice even when bios are not being queued | |
2270 | * otherwise it might happen that a bio is not queued for | |
2271 | * a long time and slice keeps on extending and trim is not | |
2272 | * called for a long time. Now if limits are reduced suddenly | |
2273 | * we take into account all the IO dispatched so far at new | |
2274 | * low rate and * newly queued IO gets a really long dispatch | |
2275 | * time. | |
2276 | * | |
2277 | * So keep on trimming slice even if bio is not queued. | |
2278 | */ | |
0f3457f6 | 2279 | throtl_trim_slice(tg, rw); |
9e660acf TH |
2280 | |
2281 | /* | |
2282 | * @bio passed through this layer without being throttled. | |
b53b072c | 2283 | * Climb up the ladder. If we're already at the top, it |
9e660acf TH |
2284 | * can be executed directly. |
2285 | */ | |
c5cc2070 | 2286 | qn = &tg->qnode_on_parent[rw]; |
9e660acf TH |
2287 | sq = sq->parent_sq; |
2288 | tg = sq_to_tg(sq); | |
2289 | if (!tg) | |
2290 | goto out_unlock; | |
e43473b7 VG |
2291 | } |
2292 | ||
9e660acf | 2293 | /* out-of-limit, queue to @tg */ |
fda6f272 TH |
2294 | throtl_log(sq, "[%c] bio. bdisp=%llu sz=%u bps=%llu iodisp=%u iops=%u queued=%d/%d", |
2295 | rw == READ ? 'R' : 'W', | |
9f626e37 SL |
2296 | tg->bytes_disp[rw], bio->bi_iter.bi_size, |
2297 | tg_bps_limit(tg, rw), | |
2298 | tg->io_disp[rw], tg_iops_limit(tg, rw), | |
fda6f272 | 2299 | sq->nr_queued[READ], sq->nr_queued[WRITE]); |
e43473b7 | 2300 | |
3f0abd80 SL |
2301 | tg->last_low_overflow_time[rw] = jiffies; |
2302 | ||
b9147dd1 | 2303 | td->nr_queued[rw]++; |
c5cc2070 | 2304 | throtl_add_bio_tg(bio, qn, tg); |
bc16a4f9 | 2305 | throttled = true; |
e43473b7 | 2306 | |
7f52f98c TH |
2307 | /* |
2308 | * Update @tg's dispatch time and force schedule dispatch if @tg | |
2309 | * was empty before @bio. The forced scheduling isn't likely to | |
2310 | * cause undue delay as @bio is likely to be dispatched directly if | |
2311 | * its @tg's disptime is not in the future. | |
2312 | */ | |
0e9f4164 | 2313 | if (tg->flags & THROTL_TG_WAS_EMPTY) { |
77216b04 | 2314 | tg_update_disptime(tg); |
7f52f98c | 2315 | throtl_schedule_next_dispatch(tg->service_queue.parent_sq, true); |
e43473b7 VG |
2316 | } |
2317 | ||
bc16a4f9 | 2318 | out_unlock: |
0d945c1f | 2319 | spin_unlock_irq(&q->queue_lock); |
bc16a4f9 | 2320 | out: |
111be883 | 2321 | bio_set_flag(bio, BIO_THROTTLED); |
b9147dd1 SL |
2322 | |
2323 | #ifdef CONFIG_BLK_DEV_THROTTLING_LOW | |
2324 | if (throttled || !td->track_bio_latency) | |
5238dcf4 | 2325 | bio->bi_issue.value |= BIO_ISSUE_THROTL_SKIP_LATENCY; |
b9147dd1 | 2326 | #endif |
93b80638 | 2327 | rcu_read_unlock(); |
bc16a4f9 | 2328 | return throttled; |
e43473b7 VG |
2329 | } |
2330 | ||
9e234eea | 2331 | #ifdef CONFIG_BLK_DEV_THROTTLING_LOW |
b9147dd1 SL |
2332 | static void throtl_track_latency(struct throtl_data *td, sector_t size, |
2333 | int op, unsigned long time) | |
2334 | { | |
2335 | struct latency_bucket *latency; | |
2336 | int index; | |
2337 | ||
b889bf66 JQ |
2338 | if (!td || td->limit_index != LIMIT_LOW || |
2339 | !(op == REQ_OP_READ || op == REQ_OP_WRITE) || | |
b9147dd1 SL |
2340 | !blk_queue_nonrot(td->queue)) |
2341 | return; | |
2342 | ||
2343 | index = request_bucket_index(size); | |
2344 | ||
b889bf66 | 2345 | latency = get_cpu_ptr(td->latency_buckets[op]); |
b9147dd1 SL |
2346 | latency[index].total_latency += time; |
2347 | latency[index].samples++; | |
b889bf66 | 2348 | put_cpu_ptr(td->latency_buckets[op]); |
b9147dd1 SL |
2349 | } |
2350 | ||
2351 | void blk_throtl_stat_add(struct request *rq, u64 time_ns) | |
2352 | { | |
2353 | struct request_queue *q = rq->q; | |
2354 | struct throtl_data *td = q->td; | |
2355 | ||
3d244306 HT |
2356 | throtl_track_latency(td, blk_rq_stats_sectors(rq), req_op(rq), |
2357 | time_ns >> 10); | |
b9147dd1 SL |
2358 | } |
2359 | ||
9e234eea SL |
2360 | void blk_throtl_bio_endio(struct bio *bio) |
2361 | { | |
08e18eab | 2362 | struct blkcg_gq *blkg; |
9e234eea | 2363 | struct throtl_grp *tg; |
b9147dd1 SL |
2364 | u64 finish_time_ns; |
2365 | unsigned long finish_time; | |
2366 | unsigned long start_time; | |
2367 | unsigned long lat; | |
b889bf66 | 2368 | int rw = bio_data_dir(bio); |
9e234eea | 2369 | |
08e18eab JB |
2370 | blkg = bio->bi_blkg; |
2371 | if (!blkg) | |
9e234eea | 2372 | return; |
08e18eab | 2373 | tg = blkg_to_tg(blkg); |
b185efa7 BW |
2374 | if (!tg->td->limit_valid[LIMIT_LOW]) |
2375 | return; | |
9e234eea | 2376 | |
b9147dd1 SL |
2377 | finish_time_ns = ktime_get_ns(); |
2378 | tg->last_finish_time = finish_time_ns >> 10; | |
2379 | ||
5238dcf4 OS |
2380 | start_time = bio_issue_time(&bio->bi_issue) >> 10; |
2381 | finish_time = __bio_issue_time(finish_time_ns) >> 10; | |
08e18eab | 2382 | if (!start_time || finish_time <= start_time) |
53696b8d SL |
2383 | return; |
2384 | ||
2385 | lat = finish_time - start_time; | |
b9147dd1 | 2386 | /* this is only for bio based driver */ |
5238dcf4 OS |
2387 | if (!(bio->bi_issue.value & BIO_ISSUE_THROTL_SKIP_LATENCY)) |
2388 | throtl_track_latency(tg->td, bio_issue_size(&bio->bi_issue), | |
2389 | bio_op(bio), lat); | |
53696b8d | 2390 | |
6679a90c | 2391 | if (tg->latency_target && lat >= tg->td->filtered_latency) { |
53696b8d SL |
2392 | int bucket; |
2393 | unsigned int threshold; | |
2394 | ||
5238dcf4 | 2395 | bucket = request_bucket_index(bio_issue_size(&bio->bi_issue)); |
b889bf66 | 2396 | threshold = tg->td->avg_buckets[rw][bucket].latency + |
53696b8d SL |
2397 | tg->latency_target; |
2398 | if (lat > threshold) | |
2399 | tg->bad_bio_cnt++; | |
2400 | /* | |
2401 | * Not race free, could get wrong count, which means cgroups | |
2402 | * will be throttled | |
2403 | */ | |
2404 | tg->bio_cnt++; | |
2405 | } | |
2406 | ||
2407 | if (time_after(jiffies, tg->bio_cnt_reset_time) || tg->bio_cnt > 1024) { | |
2408 | tg->bio_cnt_reset_time = tg->td->throtl_slice + jiffies; | |
2409 | tg->bio_cnt /= 2; | |
2410 | tg->bad_bio_cnt /= 2; | |
b9147dd1 | 2411 | } |
9e234eea SL |
2412 | } |
2413 | #endif | |
2414 | ||
e43473b7 VG |
2415 | int blk_throtl_init(struct request_queue *q) |
2416 | { | |
2417 | struct throtl_data *td; | |
a2b1693b | 2418 | int ret; |
e43473b7 VG |
2419 | |
2420 | td = kzalloc_node(sizeof(*td), GFP_KERNEL, q->node); | |
2421 | if (!td) | |
2422 | return -ENOMEM; | |
b889bf66 | 2423 | td->latency_buckets[READ] = __alloc_percpu(sizeof(struct latency_bucket) * |
b9147dd1 | 2424 | LATENCY_BUCKET_SIZE, __alignof__(u64)); |
b889bf66 JQ |
2425 | if (!td->latency_buckets[READ]) { |
2426 | kfree(td); | |
2427 | return -ENOMEM; | |
2428 | } | |
2429 | td->latency_buckets[WRITE] = __alloc_percpu(sizeof(struct latency_bucket) * | |
b9147dd1 | 2430 | LATENCY_BUCKET_SIZE, __alignof__(u64)); |
b889bf66 JQ |
2431 | if (!td->latency_buckets[WRITE]) { |
2432 | free_percpu(td->latency_buckets[READ]); | |
b9147dd1 SL |
2433 | kfree(td); |
2434 | return -ENOMEM; | |
2435 | } | |
e43473b7 | 2436 | |
69df0ab0 | 2437 | INIT_WORK(&td->dispatch_work, blk_throtl_dispatch_work_fn); |
b2ce2643 | 2438 | throtl_service_queue_init(&td->service_queue); |
e43473b7 | 2439 | |
cd1604fa | 2440 | q->td = td; |
29b12589 | 2441 | td->queue = q; |
02977e4a | 2442 | |
9f626e37 | 2443 | td->limit_valid[LIMIT_MAX] = true; |
cd5ab1b0 | 2444 | td->limit_index = LIMIT_MAX; |
3f0abd80 SL |
2445 | td->low_upgrade_time = jiffies; |
2446 | td->low_downgrade_time = jiffies; | |
9e234eea | 2447 | |
a2b1693b | 2448 | /* activate policy */ |
3c798398 | 2449 | ret = blkcg_activate_policy(q, &blkcg_policy_throtl); |
b9147dd1 | 2450 | if (ret) { |
b889bf66 JQ |
2451 | free_percpu(td->latency_buckets[READ]); |
2452 | free_percpu(td->latency_buckets[WRITE]); | |
f51b802c | 2453 | kfree(td); |
b9147dd1 | 2454 | } |
a2b1693b | 2455 | return ret; |
e43473b7 VG |
2456 | } |
2457 | ||
2458 | void blk_throtl_exit(struct request_queue *q) | |
2459 | { | |
c875f4d0 | 2460 | BUG_ON(!q->td); |
da527770 | 2461 | throtl_shutdown_wq(q); |
3c798398 | 2462 | blkcg_deactivate_policy(q, &blkcg_policy_throtl); |
b889bf66 JQ |
2463 | free_percpu(q->td->latency_buckets[READ]); |
2464 | free_percpu(q->td->latency_buckets[WRITE]); | |
c9a929dd | 2465 | kfree(q->td); |
e43473b7 VG |
2466 | } |
2467 | ||
d61fcfa4 SL |
2468 | void blk_throtl_register_queue(struct request_queue *q) |
2469 | { | |
2470 | struct throtl_data *td; | |
6679a90c | 2471 | int i; |
d61fcfa4 SL |
2472 | |
2473 | td = q->td; | |
2474 | BUG_ON(!td); | |
2475 | ||
6679a90c | 2476 | if (blk_queue_nonrot(q)) { |
d61fcfa4 | 2477 | td->throtl_slice = DFL_THROTL_SLICE_SSD; |
6679a90c SL |
2478 | td->filtered_latency = LATENCY_FILTERED_SSD; |
2479 | } else { | |
d61fcfa4 | 2480 | td->throtl_slice = DFL_THROTL_SLICE_HD; |
6679a90c | 2481 | td->filtered_latency = LATENCY_FILTERED_HD; |
b889bf66 JQ |
2482 | for (i = 0; i < LATENCY_BUCKET_SIZE; i++) { |
2483 | td->avg_buckets[READ][i].latency = DFL_HD_BASELINE_LATENCY; | |
2484 | td->avg_buckets[WRITE][i].latency = DFL_HD_BASELINE_LATENCY; | |
2485 | } | |
6679a90c | 2486 | } |
d61fcfa4 SL |
2487 | #ifndef CONFIG_BLK_DEV_THROTTLING_LOW |
2488 | /* if no low limit, use previous default */ | |
2489 | td->throtl_slice = DFL_THROTL_SLICE_HD; | |
2490 | #endif | |
9e234eea | 2491 | |
344e9ffc | 2492 | td->track_bio_latency = !queue_is_mq(q); |
b9147dd1 SL |
2493 | if (!td->track_bio_latency) |
2494 | blk_stat_enable_accounting(q); | |
d61fcfa4 SL |
2495 | } |
2496 | ||
297e3d85 SL |
2497 | #ifdef CONFIG_BLK_DEV_THROTTLING_LOW |
2498 | ssize_t blk_throtl_sample_time_show(struct request_queue *q, char *page) | |
2499 | { | |
2500 | if (!q->td) | |
2501 | return -EINVAL; | |
2502 | return sprintf(page, "%u\n", jiffies_to_msecs(q->td->throtl_slice)); | |
2503 | } | |
2504 | ||
2505 | ssize_t blk_throtl_sample_time_store(struct request_queue *q, | |
2506 | const char *page, size_t count) | |
2507 | { | |
2508 | unsigned long v; | |
2509 | unsigned long t; | |
2510 | ||
2511 | if (!q->td) | |
2512 | return -EINVAL; | |
2513 | if (kstrtoul(page, 10, &v)) | |
2514 | return -EINVAL; | |
2515 | t = msecs_to_jiffies(v); | |
2516 | if (t == 0 || t > MAX_THROTL_SLICE) | |
2517 | return -EINVAL; | |
2518 | q->td->throtl_slice = t; | |
2519 | return count; | |
2520 | } | |
2521 | #endif | |
2522 | ||
e43473b7 VG |
2523 | static int __init throtl_init(void) |
2524 | { | |
450adcbe VG |
2525 | kthrotld_workqueue = alloc_workqueue("kthrotld", WQ_MEM_RECLAIM, 0); |
2526 | if (!kthrotld_workqueue) | |
2527 | panic("Failed to create kthrotld\n"); | |
2528 | ||
3c798398 | 2529 | return blkcg_policy_register(&blkcg_policy_throtl); |
e43473b7 VG |
2530 | } |
2531 | ||
2532 | module_init(throtl_init); |