]>
Commit | Line | Data |
---|---|---|
e43473b7 VG |
1 | /* |
2 | * Interface for controlling IO bandwidth on a request queue | |
3 | * | |
4 | * Copyright (C) 2010 Vivek Goyal <vgoyal@redhat.com> | |
5 | */ | |
6 | ||
7 | #include <linux/module.h> | |
8 | #include <linux/slab.h> | |
9 | #include <linux/blkdev.h> | |
10 | #include <linux/bio.h> | |
11 | #include <linux/blktrace_api.h> | |
12 | #include "blk-cgroup.h" | |
bc9fcbf9 | 13 | #include "blk.h" |
e43473b7 VG |
14 | |
15 | /* Max dispatch from a group in 1 round */ | |
16 | static int throtl_grp_quantum = 8; | |
17 | ||
18 | /* Total max dispatch from all groups in one round */ | |
19 | static int throtl_quantum = 32; | |
20 | ||
21 | /* Throttling is performed over 100ms slice and after that slice is renewed */ | |
22 | static unsigned long throtl_slice = HZ/10; /* 100 ms */ | |
23 | ||
3c798398 | 24 | static struct blkcg_policy blkcg_policy_throtl; |
0381411e | 25 | |
450adcbe VG |
26 | /* A workqueue to queue throttle related work */ |
27 | static struct workqueue_struct *kthrotld_workqueue; | |
450adcbe | 28 | |
c9e0332e TH |
29 | struct throtl_service_queue { |
30 | struct rb_root pending_tree; /* RB tree of active tgs */ | |
31 | struct rb_node *first_pending; /* first node in the tree */ | |
32 | unsigned int nr_pending; /* # queued in the tree */ | |
33 | unsigned long first_pending_disptime; /* disptime of the first tg */ | |
e43473b7 VG |
34 | }; |
35 | ||
5b2c16aa TH |
36 | enum tg_state_flags { |
37 | THROTL_TG_PENDING = 1 << 0, /* on parent's pending tree */ | |
38 | }; | |
39 | ||
e43473b7 VG |
40 | #define rb_entry_tg(node) rb_entry((node), struct throtl_grp, rb_node) |
41 | ||
8a3d2615 TH |
42 | /* Per-cpu group stats */ |
43 | struct tg_stats_cpu { | |
44 | /* total bytes transferred */ | |
45 | struct blkg_rwstat service_bytes; | |
46 | /* total IOs serviced, post merge */ | |
47 | struct blkg_rwstat serviced; | |
48 | }; | |
49 | ||
e43473b7 | 50 | struct throtl_grp { |
f95a04af TH |
51 | /* must be the first member */ |
52 | struct blkg_policy_data pd; | |
53 | ||
c9e0332e | 54 | /* active throtl group service_queue member */ |
e43473b7 VG |
55 | struct rb_node rb_node; |
56 | ||
0f3457f6 TH |
57 | /* throtl_data this group belongs to */ |
58 | struct throtl_data *td; | |
59 | ||
49a2f1e3 TH |
60 | /* this group's service queue */ |
61 | struct throtl_service_queue service_queue; | |
62 | ||
e43473b7 VG |
63 | /* |
64 | * Dispatch time in jiffies. This is the estimated time when group | |
65 | * will unthrottle and is ready to dispatch more bio. It is used as | |
66 | * key to sort active groups in service tree. | |
67 | */ | |
68 | unsigned long disptime; | |
69 | ||
e43473b7 VG |
70 | unsigned int flags; |
71 | ||
72 | /* Two lists for READ and WRITE */ | |
73 | struct bio_list bio_lists[2]; | |
74 | ||
75 | /* Number of queued bios on READ and WRITE lists */ | |
76 | unsigned int nr_queued[2]; | |
77 | ||
78 | /* bytes per second rate limits */ | |
79 | uint64_t bps[2]; | |
80 | ||
8e89d13f VG |
81 | /* IOPS limits */ |
82 | unsigned int iops[2]; | |
83 | ||
e43473b7 VG |
84 | /* Number of bytes disptached in current slice */ |
85 | uint64_t bytes_disp[2]; | |
8e89d13f VG |
86 | /* Number of bio's dispatched in current slice */ |
87 | unsigned int io_disp[2]; | |
e43473b7 VG |
88 | |
89 | /* When did we start a new slice */ | |
90 | unsigned long slice_start[2]; | |
91 | unsigned long slice_end[2]; | |
fe071437 | 92 | |
8a3d2615 TH |
93 | /* Per cpu stats pointer */ |
94 | struct tg_stats_cpu __percpu *stats_cpu; | |
95 | ||
96 | /* List of tgs waiting for per cpu stats memory to be allocated */ | |
97 | struct list_head stats_alloc_node; | |
e43473b7 VG |
98 | }; |
99 | ||
100 | struct throtl_data | |
101 | { | |
e43473b7 | 102 | /* service tree for active throtl groups */ |
c9e0332e | 103 | struct throtl_service_queue service_queue; |
e43473b7 | 104 | |
e43473b7 VG |
105 | struct request_queue *queue; |
106 | ||
107 | /* Total Number of queued bios on READ and WRITE lists */ | |
108 | unsigned int nr_queued[2]; | |
109 | ||
110 | /* | |
02977e4a | 111 | * number of total undestroyed groups |
e43473b7 VG |
112 | */ |
113 | unsigned int nr_undestroyed_grps; | |
114 | ||
115 | /* Work for dispatching throttled bios */ | |
cb76199c | 116 | struct delayed_work dispatch_work; |
e43473b7 VG |
117 | }; |
118 | ||
8a3d2615 TH |
119 | /* list and work item to allocate percpu group stats */ |
120 | static DEFINE_SPINLOCK(tg_stats_alloc_lock); | |
121 | static LIST_HEAD(tg_stats_alloc_list); | |
122 | ||
123 | static void tg_stats_alloc_fn(struct work_struct *); | |
124 | static DECLARE_DELAYED_WORK(tg_stats_alloc_work, tg_stats_alloc_fn); | |
125 | ||
f95a04af TH |
126 | static inline struct throtl_grp *pd_to_tg(struct blkg_policy_data *pd) |
127 | { | |
128 | return pd ? container_of(pd, struct throtl_grp, pd) : NULL; | |
129 | } | |
130 | ||
3c798398 | 131 | static inline struct throtl_grp *blkg_to_tg(struct blkcg_gq *blkg) |
0381411e | 132 | { |
f95a04af | 133 | return pd_to_tg(blkg_to_pd(blkg, &blkcg_policy_throtl)); |
0381411e TH |
134 | } |
135 | ||
3c798398 | 136 | static inline struct blkcg_gq *tg_to_blkg(struct throtl_grp *tg) |
0381411e | 137 | { |
f95a04af | 138 | return pd_to_blkg(&tg->pd); |
0381411e TH |
139 | } |
140 | ||
03d8e111 TH |
141 | static inline struct throtl_grp *td_root_tg(struct throtl_data *td) |
142 | { | |
143 | return blkg_to_tg(td->queue->root_blkg); | |
144 | } | |
145 | ||
0f3457f6 | 146 | #define throtl_log_tg(tg, fmt, args...) do { \ |
54e7ed12 TH |
147 | char __pbuf[128]; \ |
148 | \ | |
149 | blkg_path(tg_to_blkg(tg), __pbuf, sizeof(__pbuf)); \ | |
0f3457f6 | 150 | blk_add_trace_msg((tg)->td->queue, "throtl %s " fmt, __pbuf, ##args); \ |
54e7ed12 | 151 | } while (0) |
e43473b7 VG |
152 | |
153 | #define throtl_log(td, fmt, args...) \ | |
154 | blk_add_trace_msg((td)->queue, "throtl " fmt, ##args) | |
155 | ||
8a3d2615 TH |
156 | /* |
157 | * Worker for allocating per cpu stat for tgs. This is scheduled on the | |
3b07e9ca | 158 | * system_wq once there are some groups on the alloc_list waiting for |
8a3d2615 TH |
159 | * allocation. |
160 | */ | |
161 | static void tg_stats_alloc_fn(struct work_struct *work) | |
162 | { | |
163 | static struct tg_stats_cpu *stats_cpu; /* this fn is non-reentrant */ | |
164 | struct delayed_work *dwork = to_delayed_work(work); | |
165 | bool empty = false; | |
166 | ||
167 | alloc_stats: | |
168 | if (!stats_cpu) { | |
169 | stats_cpu = alloc_percpu(struct tg_stats_cpu); | |
170 | if (!stats_cpu) { | |
171 | /* allocation failed, try again after some time */ | |
3b07e9ca | 172 | schedule_delayed_work(dwork, msecs_to_jiffies(10)); |
8a3d2615 TH |
173 | return; |
174 | } | |
175 | } | |
176 | ||
177 | spin_lock_irq(&tg_stats_alloc_lock); | |
178 | ||
179 | if (!list_empty(&tg_stats_alloc_list)) { | |
180 | struct throtl_grp *tg = list_first_entry(&tg_stats_alloc_list, | |
181 | struct throtl_grp, | |
182 | stats_alloc_node); | |
183 | swap(tg->stats_cpu, stats_cpu); | |
184 | list_del_init(&tg->stats_alloc_node); | |
185 | } | |
186 | ||
187 | empty = list_empty(&tg_stats_alloc_list); | |
188 | spin_unlock_irq(&tg_stats_alloc_lock); | |
189 | if (!empty) | |
190 | goto alloc_stats; | |
191 | } | |
192 | ||
49a2f1e3 TH |
193 | /* init a service_queue, assumes the caller zeroed it */ |
194 | static void throtl_service_queue_init(struct throtl_service_queue *sq) | |
195 | { | |
196 | sq->pending_tree = RB_ROOT; | |
197 | } | |
198 | ||
3c798398 | 199 | static void throtl_pd_init(struct blkcg_gq *blkg) |
a29a171e | 200 | { |
0381411e | 201 | struct throtl_grp *tg = blkg_to_tg(blkg); |
ff26eaad | 202 | unsigned long flags; |
cd1604fa | 203 | |
49a2f1e3 | 204 | throtl_service_queue_init(&tg->service_queue); |
a29a171e | 205 | RB_CLEAR_NODE(&tg->rb_node); |
0f3457f6 | 206 | tg->td = blkg->q->td; |
a29a171e VG |
207 | bio_list_init(&tg->bio_lists[0]); |
208 | bio_list_init(&tg->bio_lists[1]); | |
a29a171e | 209 | |
e56da7e2 TH |
210 | tg->bps[READ] = -1; |
211 | tg->bps[WRITE] = -1; | |
212 | tg->iops[READ] = -1; | |
213 | tg->iops[WRITE] = -1; | |
8a3d2615 TH |
214 | |
215 | /* | |
216 | * Ugh... We need to perform per-cpu allocation for tg->stats_cpu | |
217 | * but percpu allocator can't be called from IO path. Queue tg on | |
218 | * tg_stats_alloc_list and allocate from work item. | |
219 | */ | |
ff26eaad | 220 | spin_lock_irqsave(&tg_stats_alloc_lock, flags); |
8a3d2615 | 221 | list_add(&tg->stats_alloc_node, &tg_stats_alloc_list); |
3b07e9ca | 222 | schedule_delayed_work(&tg_stats_alloc_work, 0); |
ff26eaad | 223 | spin_unlock_irqrestore(&tg_stats_alloc_lock, flags); |
8a3d2615 TH |
224 | } |
225 | ||
3c798398 | 226 | static void throtl_pd_exit(struct blkcg_gq *blkg) |
8a3d2615 TH |
227 | { |
228 | struct throtl_grp *tg = blkg_to_tg(blkg); | |
ff26eaad | 229 | unsigned long flags; |
8a3d2615 | 230 | |
ff26eaad | 231 | spin_lock_irqsave(&tg_stats_alloc_lock, flags); |
8a3d2615 | 232 | list_del_init(&tg->stats_alloc_node); |
ff26eaad | 233 | spin_unlock_irqrestore(&tg_stats_alloc_lock, flags); |
8a3d2615 TH |
234 | |
235 | free_percpu(tg->stats_cpu); | |
236 | } | |
237 | ||
3c798398 | 238 | static void throtl_pd_reset_stats(struct blkcg_gq *blkg) |
8a3d2615 TH |
239 | { |
240 | struct throtl_grp *tg = blkg_to_tg(blkg); | |
241 | int cpu; | |
242 | ||
243 | if (tg->stats_cpu == NULL) | |
244 | return; | |
245 | ||
246 | for_each_possible_cpu(cpu) { | |
247 | struct tg_stats_cpu *sc = per_cpu_ptr(tg->stats_cpu, cpu); | |
248 | ||
249 | blkg_rwstat_reset(&sc->service_bytes); | |
250 | blkg_rwstat_reset(&sc->serviced); | |
251 | } | |
a29a171e VG |
252 | } |
253 | ||
3c798398 TH |
254 | static struct throtl_grp *throtl_lookup_tg(struct throtl_data *td, |
255 | struct blkcg *blkcg) | |
e43473b7 | 256 | { |
be2c6b19 | 257 | /* |
3c798398 TH |
258 | * This is the common case when there are no blkcgs. Avoid lookup |
259 | * in this case | |
cd1604fa | 260 | */ |
3c798398 | 261 | if (blkcg == &blkcg_root) |
03d8e111 | 262 | return td_root_tg(td); |
e43473b7 | 263 | |
e8989fae | 264 | return blkg_to_tg(blkg_lookup(blkcg, td->queue)); |
e43473b7 VG |
265 | } |
266 | ||
cd1604fa | 267 | static struct throtl_grp *throtl_lookup_create_tg(struct throtl_data *td, |
3c798398 | 268 | struct blkcg *blkcg) |
e43473b7 | 269 | { |
f469a7b4 | 270 | struct request_queue *q = td->queue; |
cd1604fa | 271 | struct throtl_grp *tg = NULL; |
bc16a4f9 | 272 | |
f469a7b4 | 273 | /* |
3c798398 TH |
274 | * This is the common case when there are no blkcgs. Avoid lookup |
275 | * in this case | |
f469a7b4 | 276 | */ |
3c798398 | 277 | if (blkcg == &blkcg_root) { |
03d8e111 | 278 | tg = td_root_tg(td); |
cd1604fa | 279 | } else { |
3c798398 | 280 | struct blkcg_gq *blkg; |
f469a7b4 | 281 | |
3c96cb32 | 282 | blkg = blkg_lookup_create(blkcg, q); |
f469a7b4 | 283 | |
cd1604fa TH |
284 | /* if %NULL and @q is alive, fall back to root_tg */ |
285 | if (!IS_ERR(blkg)) | |
0381411e | 286 | tg = blkg_to_tg(blkg); |
3f3299d5 | 287 | else if (!blk_queue_dying(q)) |
03d8e111 | 288 | tg = td_root_tg(td); |
f469a7b4 VG |
289 | } |
290 | ||
e43473b7 VG |
291 | return tg; |
292 | } | |
293 | ||
0049af73 TH |
294 | static struct throtl_grp * |
295 | throtl_rb_first(struct throtl_service_queue *parent_sq) | |
e43473b7 VG |
296 | { |
297 | /* Service tree is empty */ | |
0049af73 | 298 | if (!parent_sq->nr_pending) |
e43473b7 VG |
299 | return NULL; |
300 | ||
0049af73 TH |
301 | if (!parent_sq->first_pending) |
302 | parent_sq->first_pending = rb_first(&parent_sq->pending_tree); | |
e43473b7 | 303 | |
0049af73 TH |
304 | if (parent_sq->first_pending) |
305 | return rb_entry_tg(parent_sq->first_pending); | |
e43473b7 VG |
306 | |
307 | return NULL; | |
308 | } | |
309 | ||
310 | static void rb_erase_init(struct rb_node *n, struct rb_root *root) | |
311 | { | |
312 | rb_erase(n, root); | |
313 | RB_CLEAR_NODE(n); | |
314 | } | |
315 | ||
0049af73 TH |
316 | static void throtl_rb_erase(struct rb_node *n, |
317 | struct throtl_service_queue *parent_sq) | |
e43473b7 | 318 | { |
0049af73 TH |
319 | if (parent_sq->first_pending == n) |
320 | parent_sq->first_pending = NULL; | |
321 | rb_erase_init(n, &parent_sq->pending_tree); | |
322 | --parent_sq->nr_pending; | |
e43473b7 VG |
323 | } |
324 | ||
0049af73 | 325 | static void update_min_dispatch_time(struct throtl_service_queue *parent_sq) |
e43473b7 VG |
326 | { |
327 | struct throtl_grp *tg; | |
328 | ||
0049af73 | 329 | tg = throtl_rb_first(parent_sq); |
e43473b7 VG |
330 | if (!tg) |
331 | return; | |
332 | ||
0049af73 | 333 | parent_sq->first_pending_disptime = tg->disptime; |
e43473b7 VG |
334 | } |
335 | ||
0049af73 TH |
336 | static void tg_service_queue_add(struct throtl_grp *tg, |
337 | struct throtl_service_queue *parent_sq) | |
e43473b7 | 338 | { |
0049af73 | 339 | struct rb_node **node = &parent_sq->pending_tree.rb_node; |
e43473b7 VG |
340 | struct rb_node *parent = NULL; |
341 | struct throtl_grp *__tg; | |
342 | unsigned long key = tg->disptime; | |
343 | int left = 1; | |
344 | ||
345 | while (*node != NULL) { | |
346 | parent = *node; | |
347 | __tg = rb_entry_tg(parent); | |
348 | ||
349 | if (time_before(key, __tg->disptime)) | |
350 | node = &parent->rb_left; | |
351 | else { | |
352 | node = &parent->rb_right; | |
353 | left = 0; | |
354 | } | |
355 | } | |
356 | ||
357 | if (left) | |
0049af73 | 358 | parent_sq->first_pending = &tg->rb_node; |
e43473b7 VG |
359 | |
360 | rb_link_node(&tg->rb_node, parent, node); | |
0049af73 | 361 | rb_insert_color(&tg->rb_node, &parent_sq->pending_tree); |
e43473b7 VG |
362 | } |
363 | ||
0049af73 TH |
364 | static void __throtl_enqueue_tg(struct throtl_grp *tg, |
365 | struct throtl_service_queue *parent_sq) | |
e43473b7 | 366 | { |
0049af73 | 367 | tg_service_queue_add(tg, parent_sq); |
5b2c16aa | 368 | tg->flags |= THROTL_TG_PENDING; |
0049af73 | 369 | parent_sq->nr_pending++; |
e43473b7 VG |
370 | } |
371 | ||
0049af73 TH |
372 | static void throtl_enqueue_tg(struct throtl_grp *tg, |
373 | struct throtl_service_queue *parent_sq) | |
e43473b7 | 374 | { |
5b2c16aa | 375 | if (!(tg->flags & THROTL_TG_PENDING)) |
0049af73 | 376 | __throtl_enqueue_tg(tg, parent_sq); |
e43473b7 VG |
377 | } |
378 | ||
0049af73 TH |
379 | static void __throtl_dequeue_tg(struct throtl_grp *tg, |
380 | struct throtl_service_queue *parent_sq) | |
e43473b7 | 381 | { |
0049af73 | 382 | throtl_rb_erase(&tg->rb_node, parent_sq); |
5b2c16aa | 383 | tg->flags &= ~THROTL_TG_PENDING; |
e43473b7 VG |
384 | } |
385 | ||
0049af73 TH |
386 | static void throtl_dequeue_tg(struct throtl_grp *tg, |
387 | struct throtl_service_queue *parent_sq) | |
e43473b7 | 388 | { |
5b2c16aa | 389 | if (tg->flags & THROTL_TG_PENDING) |
0049af73 | 390 | __throtl_dequeue_tg(tg, parent_sq); |
e43473b7 VG |
391 | } |
392 | ||
a9131a27 TH |
393 | /* Call with queue lock held */ |
394 | static void throtl_schedule_delayed_work(struct throtl_data *td, | |
395 | unsigned long delay) | |
396 | { | |
397 | struct delayed_work *dwork = &td->dispatch_work; | |
398 | ||
6a525600 TH |
399 | mod_delayed_work(kthrotld_workqueue, dwork, delay); |
400 | throtl_log(td, "schedule work. delay=%lu jiffies=%lu", delay, jiffies); | |
a9131a27 TH |
401 | } |
402 | ||
e43473b7 VG |
403 | static void throtl_schedule_next_dispatch(struct throtl_data *td) |
404 | { | |
c9e0332e | 405 | struct throtl_service_queue *sq = &td->service_queue; |
e43473b7 | 406 | |
6a525600 | 407 | /* any pending children left? */ |
c9e0332e | 408 | if (!sq->nr_pending) |
e43473b7 VG |
409 | return; |
410 | ||
c9e0332e | 411 | update_min_dispatch_time(sq); |
e43473b7 | 412 | |
c9e0332e | 413 | if (time_before_eq(sq->first_pending_disptime, jiffies)) |
450adcbe | 414 | throtl_schedule_delayed_work(td, 0); |
e43473b7 | 415 | else |
c9e0332e | 416 | throtl_schedule_delayed_work(td, sq->first_pending_disptime - jiffies); |
e43473b7 VG |
417 | } |
418 | ||
0f3457f6 | 419 | static inline void throtl_start_new_slice(struct throtl_grp *tg, bool rw) |
e43473b7 VG |
420 | { |
421 | tg->bytes_disp[rw] = 0; | |
8e89d13f | 422 | tg->io_disp[rw] = 0; |
e43473b7 VG |
423 | tg->slice_start[rw] = jiffies; |
424 | tg->slice_end[rw] = jiffies + throtl_slice; | |
0f3457f6 | 425 | throtl_log_tg(tg, "[%c] new slice start=%lu end=%lu jiffies=%lu", |
e43473b7 VG |
426 | rw == READ ? 'R' : 'W', tg->slice_start[rw], |
427 | tg->slice_end[rw], jiffies); | |
428 | } | |
429 | ||
0f3457f6 TH |
430 | static inline void throtl_set_slice_end(struct throtl_grp *tg, bool rw, |
431 | unsigned long jiffy_end) | |
d1ae8ffd VG |
432 | { |
433 | tg->slice_end[rw] = roundup(jiffy_end, throtl_slice); | |
434 | } | |
435 | ||
0f3457f6 TH |
436 | static inline void throtl_extend_slice(struct throtl_grp *tg, bool rw, |
437 | unsigned long jiffy_end) | |
e43473b7 VG |
438 | { |
439 | tg->slice_end[rw] = roundup(jiffy_end, throtl_slice); | |
0f3457f6 | 440 | throtl_log_tg(tg, "[%c] extend slice start=%lu end=%lu jiffies=%lu", |
e43473b7 VG |
441 | rw == READ ? 'R' : 'W', tg->slice_start[rw], |
442 | tg->slice_end[rw], jiffies); | |
443 | } | |
444 | ||
445 | /* Determine if previously allocated or extended slice is complete or not */ | |
0f3457f6 | 446 | static bool throtl_slice_used(struct throtl_grp *tg, bool rw) |
e43473b7 VG |
447 | { |
448 | if (time_in_range(jiffies, tg->slice_start[rw], tg->slice_end[rw])) | |
449 | return 0; | |
450 | ||
451 | return 1; | |
452 | } | |
453 | ||
454 | /* Trim the used slices and adjust slice start accordingly */ | |
0f3457f6 | 455 | static inline void throtl_trim_slice(struct throtl_grp *tg, bool rw) |
e43473b7 | 456 | { |
3aad5d3e VG |
457 | unsigned long nr_slices, time_elapsed, io_trim; |
458 | u64 bytes_trim, tmp; | |
e43473b7 VG |
459 | |
460 | BUG_ON(time_before(tg->slice_end[rw], tg->slice_start[rw])); | |
461 | ||
462 | /* | |
463 | * If bps are unlimited (-1), then time slice don't get | |
464 | * renewed. Don't try to trim the slice if slice is used. A new | |
465 | * slice will start when appropriate. | |
466 | */ | |
0f3457f6 | 467 | if (throtl_slice_used(tg, rw)) |
e43473b7 VG |
468 | return; |
469 | ||
d1ae8ffd VG |
470 | /* |
471 | * A bio has been dispatched. Also adjust slice_end. It might happen | |
472 | * that initially cgroup limit was very low resulting in high | |
473 | * slice_end, but later limit was bumped up and bio was dispached | |
474 | * sooner, then we need to reduce slice_end. A high bogus slice_end | |
475 | * is bad because it does not allow new slice to start. | |
476 | */ | |
477 | ||
0f3457f6 | 478 | throtl_set_slice_end(tg, rw, jiffies + throtl_slice); |
d1ae8ffd | 479 | |
e43473b7 VG |
480 | time_elapsed = jiffies - tg->slice_start[rw]; |
481 | ||
482 | nr_slices = time_elapsed / throtl_slice; | |
483 | ||
484 | if (!nr_slices) | |
485 | return; | |
3aad5d3e VG |
486 | tmp = tg->bps[rw] * throtl_slice * nr_slices; |
487 | do_div(tmp, HZ); | |
488 | bytes_trim = tmp; | |
e43473b7 | 489 | |
8e89d13f | 490 | io_trim = (tg->iops[rw] * throtl_slice * nr_slices)/HZ; |
e43473b7 | 491 | |
8e89d13f | 492 | if (!bytes_trim && !io_trim) |
e43473b7 VG |
493 | return; |
494 | ||
495 | if (tg->bytes_disp[rw] >= bytes_trim) | |
496 | tg->bytes_disp[rw] -= bytes_trim; | |
497 | else | |
498 | tg->bytes_disp[rw] = 0; | |
499 | ||
8e89d13f VG |
500 | if (tg->io_disp[rw] >= io_trim) |
501 | tg->io_disp[rw] -= io_trim; | |
502 | else | |
503 | tg->io_disp[rw] = 0; | |
504 | ||
e43473b7 VG |
505 | tg->slice_start[rw] += nr_slices * throtl_slice; |
506 | ||
0f3457f6 | 507 | throtl_log_tg(tg, "[%c] trim slice nr=%lu bytes=%llu io=%lu" |
e43473b7 | 508 | " start=%lu end=%lu jiffies=%lu", |
8e89d13f | 509 | rw == READ ? 'R' : 'W', nr_slices, bytes_trim, io_trim, |
e43473b7 VG |
510 | tg->slice_start[rw], tg->slice_end[rw], jiffies); |
511 | } | |
512 | ||
0f3457f6 TH |
513 | static bool tg_with_in_iops_limit(struct throtl_grp *tg, struct bio *bio, |
514 | unsigned long *wait) | |
e43473b7 VG |
515 | { |
516 | bool rw = bio_data_dir(bio); | |
8e89d13f | 517 | unsigned int io_allowed; |
e43473b7 | 518 | unsigned long jiffy_elapsed, jiffy_wait, jiffy_elapsed_rnd; |
c49c06e4 | 519 | u64 tmp; |
e43473b7 | 520 | |
8e89d13f | 521 | jiffy_elapsed = jiffy_elapsed_rnd = jiffies - tg->slice_start[rw]; |
e43473b7 | 522 | |
8e89d13f VG |
523 | /* Slice has just started. Consider one slice interval */ |
524 | if (!jiffy_elapsed) | |
525 | jiffy_elapsed_rnd = throtl_slice; | |
526 | ||
527 | jiffy_elapsed_rnd = roundup(jiffy_elapsed_rnd, throtl_slice); | |
528 | ||
c49c06e4 VG |
529 | /* |
530 | * jiffy_elapsed_rnd should not be a big value as minimum iops can be | |
531 | * 1 then at max jiffy elapsed should be equivalent of 1 second as we | |
532 | * will allow dispatch after 1 second and after that slice should | |
533 | * have been trimmed. | |
534 | */ | |
535 | ||
536 | tmp = (u64)tg->iops[rw] * jiffy_elapsed_rnd; | |
537 | do_div(tmp, HZ); | |
538 | ||
539 | if (tmp > UINT_MAX) | |
540 | io_allowed = UINT_MAX; | |
541 | else | |
542 | io_allowed = tmp; | |
8e89d13f VG |
543 | |
544 | if (tg->io_disp[rw] + 1 <= io_allowed) { | |
e43473b7 VG |
545 | if (wait) |
546 | *wait = 0; | |
547 | return 1; | |
548 | } | |
549 | ||
8e89d13f VG |
550 | /* Calc approx time to dispatch */ |
551 | jiffy_wait = ((tg->io_disp[rw] + 1) * HZ)/tg->iops[rw] + 1; | |
552 | ||
553 | if (jiffy_wait > jiffy_elapsed) | |
554 | jiffy_wait = jiffy_wait - jiffy_elapsed; | |
555 | else | |
556 | jiffy_wait = 1; | |
557 | ||
558 | if (wait) | |
559 | *wait = jiffy_wait; | |
560 | return 0; | |
561 | } | |
562 | ||
0f3457f6 TH |
563 | static bool tg_with_in_bps_limit(struct throtl_grp *tg, struct bio *bio, |
564 | unsigned long *wait) | |
8e89d13f VG |
565 | { |
566 | bool rw = bio_data_dir(bio); | |
3aad5d3e | 567 | u64 bytes_allowed, extra_bytes, tmp; |
8e89d13f | 568 | unsigned long jiffy_elapsed, jiffy_wait, jiffy_elapsed_rnd; |
e43473b7 VG |
569 | |
570 | jiffy_elapsed = jiffy_elapsed_rnd = jiffies - tg->slice_start[rw]; | |
571 | ||
572 | /* Slice has just started. Consider one slice interval */ | |
573 | if (!jiffy_elapsed) | |
574 | jiffy_elapsed_rnd = throtl_slice; | |
575 | ||
576 | jiffy_elapsed_rnd = roundup(jiffy_elapsed_rnd, throtl_slice); | |
577 | ||
5e901a2b VG |
578 | tmp = tg->bps[rw] * jiffy_elapsed_rnd; |
579 | do_div(tmp, HZ); | |
3aad5d3e | 580 | bytes_allowed = tmp; |
e43473b7 VG |
581 | |
582 | if (tg->bytes_disp[rw] + bio->bi_size <= bytes_allowed) { | |
583 | if (wait) | |
584 | *wait = 0; | |
585 | return 1; | |
586 | } | |
587 | ||
588 | /* Calc approx time to dispatch */ | |
589 | extra_bytes = tg->bytes_disp[rw] + bio->bi_size - bytes_allowed; | |
590 | jiffy_wait = div64_u64(extra_bytes * HZ, tg->bps[rw]); | |
591 | ||
592 | if (!jiffy_wait) | |
593 | jiffy_wait = 1; | |
594 | ||
595 | /* | |
596 | * This wait time is without taking into consideration the rounding | |
597 | * up we did. Add that time also. | |
598 | */ | |
599 | jiffy_wait = jiffy_wait + (jiffy_elapsed_rnd - jiffy_elapsed); | |
e43473b7 VG |
600 | if (wait) |
601 | *wait = jiffy_wait; | |
8e89d13f VG |
602 | return 0; |
603 | } | |
604 | ||
af75cd3c VG |
605 | static bool tg_no_rule_group(struct throtl_grp *tg, bool rw) { |
606 | if (tg->bps[rw] == -1 && tg->iops[rw] == -1) | |
607 | return 1; | |
608 | return 0; | |
609 | } | |
610 | ||
8e89d13f VG |
611 | /* |
612 | * Returns whether one can dispatch a bio or not. Also returns approx number | |
613 | * of jiffies to wait before this bio is with-in IO rate and can be dispatched | |
614 | */ | |
0f3457f6 TH |
615 | static bool tg_may_dispatch(struct throtl_grp *tg, struct bio *bio, |
616 | unsigned long *wait) | |
8e89d13f VG |
617 | { |
618 | bool rw = bio_data_dir(bio); | |
619 | unsigned long bps_wait = 0, iops_wait = 0, max_wait = 0; | |
620 | ||
621 | /* | |
622 | * Currently whole state machine of group depends on first bio | |
623 | * queued in the group bio list. So one should not be calling | |
624 | * this function with a different bio if there are other bios | |
625 | * queued. | |
626 | */ | |
627 | BUG_ON(tg->nr_queued[rw] && bio != bio_list_peek(&tg->bio_lists[rw])); | |
e43473b7 | 628 | |
8e89d13f VG |
629 | /* If tg->bps = -1, then BW is unlimited */ |
630 | if (tg->bps[rw] == -1 && tg->iops[rw] == -1) { | |
631 | if (wait) | |
632 | *wait = 0; | |
633 | return 1; | |
634 | } | |
635 | ||
636 | /* | |
637 | * If previous slice expired, start a new one otherwise renew/extend | |
638 | * existing slice to make sure it is at least throtl_slice interval | |
639 | * long since now. | |
640 | */ | |
0f3457f6 TH |
641 | if (throtl_slice_used(tg, rw)) |
642 | throtl_start_new_slice(tg, rw); | |
8e89d13f VG |
643 | else { |
644 | if (time_before(tg->slice_end[rw], jiffies + throtl_slice)) | |
0f3457f6 | 645 | throtl_extend_slice(tg, rw, jiffies + throtl_slice); |
8e89d13f VG |
646 | } |
647 | ||
0f3457f6 TH |
648 | if (tg_with_in_bps_limit(tg, bio, &bps_wait) && |
649 | tg_with_in_iops_limit(tg, bio, &iops_wait)) { | |
8e89d13f VG |
650 | if (wait) |
651 | *wait = 0; | |
652 | return 1; | |
653 | } | |
654 | ||
655 | max_wait = max(bps_wait, iops_wait); | |
656 | ||
657 | if (wait) | |
658 | *wait = max_wait; | |
659 | ||
660 | if (time_before(tg->slice_end[rw], jiffies + max_wait)) | |
0f3457f6 | 661 | throtl_extend_slice(tg, rw, jiffies + max_wait); |
e43473b7 VG |
662 | |
663 | return 0; | |
664 | } | |
665 | ||
3c798398 | 666 | static void throtl_update_dispatch_stats(struct blkcg_gq *blkg, u64 bytes, |
629ed0b1 TH |
667 | int rw) |
668 | { | |
8a3d2615 TH |
669 | struct throtl_grp *tg = blkg_to_tg(blkg); |
670 | struct tg_stats_cpu *stats_cpu; | |
629ed0b1 TH |
671 | unsigned long flags; |
672 | ||
673 | /* If per cpu stats are not allocated yet, don't do any accounting. */ | |
8a3d2615 | 674 | if (tg->stats_cpu == NULL) |
629ed0b1 TH |
675 | return; |
676 | ||
677 | /* | |
678 | * Disabling interrupts to provide mutual exclusion between two | |
679 | * writes on same cpu. It probably is not needed for 64bit. Not | |
680 | * optimizing that case yet. | |
681 | */ | |
682 | local_irq_save(flags); | |
683 | ||
8a3d2615 | 684 | stats_cpu = this_cpu_ptr(tg->stats_cpu); |
629ed0b1 | 685 | |
629ed0b1 TH |
686 | blkg_rwstat_add(&stats_cpu->serviced, rw, 1); |
687 | blkg_rwstat_add(&stats_cpu->service_bytes, rw, bytes); | |
688 | ||
689 | local_irq_restore(flags); | |
690 | } | |
691 | ||
e43473b7 VG |
692 | static void throtl_charge_bio(struct throtl_grp *tg, struct bio *bio) |
693 | { | |
694 | bool rw = bio_data_dir(bio); | |
e43473b7 VG |
695 | |
696 | /* Charge the bio to the group */ | |
697 | tg->bytes_disp[rw] += bio->bi_size; | |
8e89d13f | 698 | tg->io_disp[rw]++; |
e43473b7 | 699 | |
629ed0b1 | 700 | throtl_update_dispatch_stats(tg_to_blkg(tg), bio->bi_size, bio->bi_rw); |
e43473b7 VG |
701 | } |
702 | ||
0049af73 TH |
703 | static void throtl_add_bio_tg(struct bio *bio, struct throtl_grp *tg, |
704 | struct throtl_service_queue *parent_sq) | |
e43473b7 VG |
705 | { |
706 | bool rw = bio_data_dir(bio); | |
707 | ||
708 | bio_list_add(&tg->bio_lists[rw], bio); | |
709 | /* Take a bio reference on tg */ | |
1adaf3dd | 710 | blkg_get(tg_to_blkg(tg)); |
e43473b7 | 711 | tg->nr_queued[rw]++; |
e2d57e60 | 712 | tg->td->nr_queued[rw]++; |
0049af73 | 713 | throtl_enqueue_tg(tg, parent_sq); |
e43473b7 VG |
714 | } |
715 | ||
0049af73 TH |
716 | static void tg_update_disptime(struct throtl_grp *tg, |
717 | struct throtl_service_queue *parent_sq) | |
e43473b7 VG |
718 | { |
719 | unsigned long read_wait = -1, write_wait = -1, min_wait = -1, disptime; | |
720 | struct bio *bio; | |
721 | ||
722 | if ((bio = bio_list_peek(&tg->bio_lists[READ]))) | |
0f3457f6 | 723 | tg_may_dispatch(tg, bio, &read_wait); |
e43473b7 VG |
724 | |
725 | if ((bio = bio_list_peek(&tg->bio_lists[WRITE]))) | |
0f3457f6 | 726 | tg_may_dispatch(tg, bio, &write_wait); |
e43473b7 VG |
727 | |
728 | min_wait = min(read_wait, write_wait); | |
729 | disptime = jiffies + min_wait; | |
730 | ||
e43473b7 | 731 | /* Update dispatch time */ |
0049af73 | 732 | throtl_dequeue_tg(tg, parent_sq); |
e43473b7 | 733 | tg->disptime = disptime; |
0049af73 | 734 | throtl_enqueue_tg(tg, parent_sq); |
e43473b7 VG |
735 | } |
736 | ||
0f3457f6 TH |
737 | static void tg_dispatch_one_bio(struct throtl_grp *tg, bool rw, |
738 | struct bio_list *bl) | |
e43473b7 VG |
739 | { |
740 | struct bio *bio; | |
741 | ||
742 | bio = bio_list_pop(&tg->bio_lists[rw]); | |
743 | tg->nr_queued[rw]--; | |
1adaf3dd TH |
744 | /* Drop bio reference on blkg */ |
745 | blkg_put(tg_to_blkg(tg)); | |
e43473b7 | 746 | |
0f3457f6 TH |
747 | BUG_ON(tg->td->nr_queued[rw] <= 0); |
748 | tg->td->nr_queued[rw]--; | |
e43473b7 VG |
749 | |
750 | throtl_charge_bio(tg, bio); | |
751 | bio_list_add(bl, bio); | |
752 | bio->bi_rw |= REQ_THROTTLED; | |
753 | ||
0f3457f6 | 754 | throtl_trim_slice(tg, rw); |
e43473b7 VG |
755 | } |
756 | ||
0f3457f6 | 757 | static int throtl_dispatch_tg(struct throtl_grp *tg, struct bio_list *bl) |
e43473b7 VG |
758 | { |
759 | unsigned int nr_reads = 0, nr_writes = 0; | |
760 | unsigned int max_nr_reads = throtl_grp_quantum*3/4; | |
c2f6805d | 761 | unsigned int max_nr_writes = throtl_grp_quantum - max_nr_reads; |
e43473b7 VG |
762 | struct bio *bio; |
763 | ||
764 | /* Try to dispatch 75% READS and 25% WRITES */ | |
765 | ||
0f3457f6 TH |
766 | while ((bio = bio_list_peek(&tg->bio_lists[READ])) && |
767 | tg_may_dispatch(tg, bio, NULL)) { | |
e43473b7 | 768 | |
0f3457f6 | 769 | tg_dispatch_one_bio(tg, bio_data_dir(bio), bl); |
e43473b7 VG |
770 | nr_reads++; |
771 | ||
772 | if (nr_reads >= max_nr_reads) | |
773 | break; | |
774 | } | |
775 | ||
0f3457f6 TH |
776 | while ((bio = bio_list_peek(&tg->bio_lists[WRITE])) && |
777 | tg_may_dispatch(tg, bio, NULL)) { | |
e43473b7 | 778 | |
0f3457f6 | 779 | tg_dispatch_one_bio(tg, bio_data_dir(bio), bl); |
e43473b7 VG |
780 | nr_writes++; |
781 | ||
782 | if (nr_writes >= max_nr_writes) | |
783 | break; | |
784 | } | |
785 | ||
786 | return nr_reads + nr_writes; | |
787 | } | |
788 | ||
0049af73 | 789 | static int throtl_select_dispatch(struct throtl_service_queue *parent_sq, |
e2d57e60 | 790 | struct bio_list *bl) |
e43473b7 VG |
791 | { |
792 | unsigned int nr_disp = 0; | |
793 | struct throtl_grp *tg; | |
e43473b7 VG |
794 | |
795 | while (1) { | |
0049af73 | 796 | tg = throtl_rb_first(parent_sq); |
e43473b7 VG |
797 | |
798 | if (!tg) | |
799 | break; | |
800 | ||
801 | if (time_before(jiffies, tg->disptime)) | |
802 | break; | |
803 | ||
0049af73 | 804 | throtl_dequeue_tg(tg, parent_sq); |
e43473b7 | 805 | |
0f3457f6 | 806 | nr_disp += throtl_dispatch_tg(tg, bl); |
e43473b7 | 807 | |
2db6314c | 808 | if (tg->nr_queued[0] || tg->nr_queued[1]) |
0049af73 | 809 | tg_update_disptime(tg, parent_sq); |
e43473b7 VG |
810 | |
811 | if (nr_disp >= throtl_quantum) | |
812 | break; | |
813 | } | |
814 | ||
815 | return nr_disp; | |
816 | } | |
817 | ||
cb76199c TH |
818 | /* work function to dispatch throttled bios */ |
819 | void blk_throtl_dispatch_work_fn(struct work_struct *work) | |
e43473b7 | 820 | { |
cb76199c TH |
821 | struct throtl_data *td = container_of(to_delayed_work(work), |
822 | struct throtl_data, dispatch_work); | |
823 | struct request_queue *q = td->queue; | |
e43473b7 VG |
824 | unsigned int nr_disp = 0; |
825 | struct bio_list bio_list_on_stack; | |
826 | struct bio *bio; | |
69d60eb9 | 827 | struct blk_plug plug; |
e43473b7 VG |
828 | |
829 | spin_lock_irq(q->queue_lock); | |
830 | ||
e43473b7 VG |
831 | bio_list_init(&bio_list_on_stack); |
832 | ||
d2f31a5f | 833 | throtl_log(td, "dispatch nr_queued=%u read=%u write=%u", |
6a525600 TH |
834 | td->nr_queued[READ] + td->nr_queued[WRITE], |
835 | td->nr_queued[READ], td->nr_queued[WRITE]); | |
e43473b7 | 836 | |
e2d57e60 | 837 | nr_disp = throtl_select_dispatch(&td->service_queue, &bio_list_on_stack); |
e43473b7 VG |
838 | |
839 | if (nr_disp) | |
840 | throtl_log(td, "bios disp=%u", nr_disp); | |
841 | ||
842 | throtl_schedule_next_dispatch(td); | |
6a525600 | 843 | |
e43473b7 VG |
844 | spin_unlock_irq(q->queue_lock); |
845 | ||
846 | /* | |
847 | * If we dispatched some requests, unplug the queue to make sure | |
848 | * immediate dispatch | |
849 | */ | |
850 | if (nr_disp) { | |
69d60eb9 | 851 | blk_start_plug(&plug); |
e43473b7 VG |
852 | while((bio = bio_list_pop(&bio_list_on_stack))) |
853 | generic_make_request(bio); | |
69d60eb9 | 854 | blk_finish_plug(&plug); |
e43473b7 | 855 | } |
e43473b7 VG |
856 | } |
857 | ||
f95a04af TH |
858 | static u64 tg_prfill_cpu_rwstat(struct seq_file *sf, |
859 | struct blkg_policy_data *pd, int off) | |
41b38b6d | 860 | { |
f95a04af | 861 | struct throtl_grp *tg = pd_to_tg(pd); |
41b38b6d TH |
862 | struct blkg_rwstat rwstat = { }, tmp; |
863 | int i, cpu; | |
864 | ||
865 | for_each_possible_cpu(cpu) { | |
8a3d2615 | 866 | struct tg_stats_cpu *sc = per_cpu_ptr(tg->stats_cpu, cpu); |
41b38b6d TH |
867 | |
868 | tmp = blkg_rwstat_read((void *)sc + off); | |
869 | for (i = 0; i < BLKG_RWSTAT_NR; i++) | |
870 | rwstat.cnt[i] += tmp.cnt[i]; | |
871 | } | |
872 | ||
f95a04af | 873 | return __blkg_prfill_rwstat(sf, pd, &rwstat); |
41b38b6d TH |
874 | } |
875 | ||
8a3d2615 TH |
876 | static int tg_print_cpu_rwstat(struct cgroup *cgrp, struct cftype *cft, |
877 | struct seq_file *sf) | |
41b38b6d | 878 | { |
3c798398 | 879 | struct blkcg *blkcg = cgroup_to_blkcg(cgrp); |
41b38b6d | 880 | |
3c798398 | 881 | blkcg_print_blkgs(sf, blkcg, tg_prfill_cpu_rwstat, &blkcg_policy_throtl, |
5bc4afb1 | 882 | cft->private, true); |
41b38b6d TH |
883 | return 0; |
884 | } | |
885 | ||
f95a04af TH |
886 | static u64 tg_prfill_conf_u64(struct seq_file *sf, struct blkg_policy_data *pd, |
887 | int off) | |
60c2bc2d | 888 | { |
f95a04af TH |
889 | struct throtl_grp *tg = pd_to_tg(pd); |
890 | u64 v = *(u64 *)((void *)tg + off); | |
60c2bc2d | 891 | |
af133ceb | 892 | if (v == -1) |
60c2bc2d | 893 | return 0; |
f95a04af | 894 | return __blkg_prfill_u64(sf, pd, v); |
60c2bc2d TH |
895 | } |
896 | ||
f95a04af TH |
897 | static u64 tg_prfill_conf_uint(struct seq_file *sf, struct blkg_policy_data *pd, |
898 | int off) | |
e43473b7 | 899 | { |
f95a04af TH |
900 | struct throtl_grp *tg = pd_to_tg(pd); |
901 | unsigned int v = *(unsigned int *)((void *)tg + off); | |
fe071437 | 902 | |
af133ceb TH |
903 | if (v == -1) |
904 | return 0; | |
f95a04af | 905 | return __blkg_prfill_u64(sf, pd, v); |
e43473b7 VG |
906 | } |
907 | ||
af133ceb TH |
908 | static int tg_print_conf_u64(struct cgroup *cgrp, struct cftype *cft, |
909 | struct seq_file *sf) | |
8e89d13f | 910 | { |
3c798398 TH |
911 | blkcg_print_blkgs(sf, cgroup_to_blkcg(cgrp), tg_prfill_conf_u64, |
912 | &blkcg_policy_throtl, cft->private, false); | |
af133ceb | 913 | return 0; |
8e89d13f VG |
914 | } |
915 | ||
af133ceb TH |
916 | static int tg_print_conf_uint(struct cgroup *cgrp, struct cftype *cft, |
917 | struct seq_file *sf) | |
8e89d13f | 918 | { |
3c798398 TH |
919 | blkcg_print_blkgs(sf, cgroup_to_blkcg(cgrp), tg_prfill_conf_uint, |
920 | &blkcg_policy_throtl, cft->private, false); | |
af133ceb | 921 | return 0; |
60c2bc2d TH |
922 | } |
923 | ||
af133ceb TH |
924 | static int tg_set_conf(struct cgroup *cgrp, struct cftype *cft, const char *buf, |
925 | bool is_u64) | |
60c2bc2d | 926 | { |
3c798398 | 927 | struct blkcg *blkcg = cgroup_to_blkcg(cgrp); |
60c2bc2d | 928 | struct blkg_conf_ctx ctx; |
af133ceb | 929 | struct throtl_grp *tg; |
a2b1693b | 930 | struct throtl_data *td; |
60c2bc2d TH |
931 | int ret; |
932 | ||
3c798398 | 933 | ret = blkg_conf_prep(blkcg, &blkcg_policy_throtl, buf, &ctx); |
60c2bc2d TH |
934 | if (ret) |
935 | return ret; | |
936 | ||
af133ceb | 937 | tg = blkg_to_tg(ctx.blkg); |
a2b1693b | 938 | td = ctx.blkg->q->td; |
af133ceb | 939 | |
a2b1693b TH |
940 | if (!ctx.v) |
941 | ctx.v = -1; | |
af133ceb | 942 | |
a2b1693b TH |
943 | if (is_u64) |
944 | *(u64 *)((void *)tg + cft->private) = ctx.v; | |
945 | else | |
946 | *(unsigned int *)((void *)tg + cft->private) = ctx.v; | |
af133ceb | 947 | |
0f3457f6 | 948 | throtl_log_tg(tg, "limit change rbps=%llu wbps=%llu riops=%u wiops=%u", |
632b4493 TH |
949 | tg->bps[READ], tg->bps[WRITE], |
950 | tg->iops[READ], tg->iops[WRITE]); | |
951 | ||
952 | /* | |
953 | * We're already holding queue_lock and know @tg is valid. Let's | |
954 | * apply the new config directly. | |
955 | * | |
956 | * Restart the slices for both READ and WRITES. It might happen | |
957 | * that a group's limit are dropped suddenly and we don't want to | |
958 | * account recently dispatched IO with new low rate. | |
959 | */ | |
0f3457f6 TH |
960 | throtl_start_new_slice(tg, 0); |
961 | throtl_start_new_slice(tg, 1); | |
632b4493 | 962 | |
5b2c16aa | 963 | if (tg->flags & THROTL_TG_PENDING) { |
0049af73 | 964 | tg_update_disptime(tg, &td->service_queue); |
632b4493 TH |
965 | throtl_schedule_next_dispatch(td); |
966 | } | |
60c2bc2d TH |
967 | |
968 | blkg_conf_finish(&ctx); | |
a2b1693b | 969 | return 0; |
8e89d13f VG |
970 | } |
971 | ||
af133ceb TH |
972 | static int tg_set_conf_u64(struct cgroup *cgrp, struct cftype *cft, |
973 | const char *buf) | |
60c2bc2d | 974 | { |
af133ceb | 975 | return tg_set_conf(cgrp, cft, buf, true); |
60c2bc2d TH |
976 | } |
977 | ||
af133ceb TH |
978 | static int tg_set_conf_uint(struct cgroup *cgrp, struct cftype *cft, |
979 | const char *buf) | |
60c2bc2d | 980 | { |
af133ceb | 981 | return tg_set_conf(cgrp, cft, buf, false); |
60c2bc2d TH |
982 | } |
983 | ||
984 | static struct cftype throtl_files[] = { | |
985 | { | |
986 | .name = "throttle.read_bps_device", | |
af133ceb TH |
987 | .private = offsetof(struct throtl_grp, bps[READ]), |
988 | .read_seq_string = tg_print_conf_u64, | |
989 | .write_string = tg_set_conf_u64, | |
60c2bc2d TH |
990 | .max_write_len = 256, |
991 | }, | |
992 | { | |
993 | .name = "throttle.write_bps_device", | |
af133ceb TH |
994 | .private = offsetof(struct throtl_grp, bps[WRITE]), |
995 | .read_seq_string = tg_print_conf_u64, | |
996 | .write_string = tg_set_conf_u64, | |
60c2bc2d TH |
997 | .max_write_len = 256, |
998 | }, | |
999 | { | |
1000 | .name = "throttle.read_iops_device", | |
af133ceb TH |
1001 | .private = offsetof(struct throtl_grp, iops[READ]), |
1002 | .read_seq_string = tg_print_conf_uint, | |
1003 | .write_string = tg_set_conf_uint, | |
60c2bc2d TH |
1004 | .max_write_len = 256, |
1005 | }, | |
1006 | { | |
1007 | .name = "throttle.write_iops_device", | |
af133ceb TH |
1008 | .private = offsetof(struct throtl_grp, iops[WRITE]), |
1009 | .read_seq_string = tg_print_conf_uint, | |
1010 | .write_string = tg_set_conf_uint, | |
60c2bc2d TH |
1011 | .max_write_len = 256, |
1012 | }, | |
1013 | { | |
1014 | .name = "throttle.io_service_bytes", | |
5bc4afb1 | 1015 | .private = offsetof(struct tg_stats_cpu, service_bytes), |
8a3d2615 | 1016 | .read_seq_string = tg_print_cpu_rwstat, |
60c2bc2d TH |
1017 | }, |
1018 | { | |
1019 | .name = "throttle.io_serviced", | |
5bc4afb1 | 1020 | .private = offsetof(struct tg_stats_cpu, serviced), |
8a3d2615 | 1021 | .read_seq_string = tg_print_cpu_rwstat, |
60c2bc2d TH |
1022 | }, |
1023 | { } /* terminate */ | |
1024 | }; | |
1025 | ||
da527770 | 1026 | static void throtl_shutdown_wq(struct request_queue *q) |
e43473b7 VG |
1027 | { |
1028 | struct throtl_data *td = q->td; | |
1029 | ||
cb76199c | 1030 | cancel_delayed_work_sync(&td->dispatch_work); |
e43473b7 VG |
1031 | } |
1032 | ||
3c798398 | 1033 | static struct blkcg_policy blkcg_policy_throtl = { |
f9fcc2d3 TH |
1034 | .pd_size = sizeof(struct throtl_grp), |
1035 | .cftypes = throtl_files, | |
1036 | ||
1037 | .pd_init_fn = throtl_pd_init, | |
1038 | .pd_exit_fn = throtl_pd_exit, | |
1039 | .pd_reset_stats_fn = throtl_pd_reset_stats, | |
e43473b7 VG |
1040 | }; |
1041 | ||
bc16a4f9 | 1042 | bool blk_throtl_bio(struct request_queue *q, struct bio *bio) |
e43473b7 VG |
1043 | { |
1044 | struct throtl_data *td = q->td; | |
1045 | struct throtl_grp *tg; | |
e43473b7 | 1046 | bool rw = bio_data_dir(bio), update_disptime = true; |
3c798398 | 1047 | struct blkcg *blkcg; |
bc16a4f9 | 1048 | bool throttled = false; |
e43473b7 VG |
1049 | |
1050 | if (bio->bi_rw & REQ_THROTTLED) { | |
1051 | bio->bi_rw &= ~REQ_THROTTLED; | |
bc16a4f9 | 1052 | goto out; |
e43473b7 VG |
1053 | } |
1054 | ||
af75cd3c VG |
1055 | /* |
1056 | * A throtl_grp pointer retrieved under rcu can be used to access | |
1057 | * basic fields like stats and io rates. If a group has no rules, | |
1058 | * just update the dispatch stats in lockless manner and return. | |
1059 | */ | |
af75cd3c | 1060 | rcu_read_lock(); |
3c798398 | 1061 | blkcg = bio_blkcg(bio); |
cd1604fa | 1062 | tg = throtl_lookup_tg(td, blkcg); |
af75cd3c | 1063 | if (tg) { |
af75cd3c | 1064 | if (tg_no_rule_group(tg, rw)) { |
629ed0b1 TH |
1065 | throtl_update_dispatch_stats(tg_to_blkg(tg), |
1066 | bio->bi_size, bio->bi_rw); | |
2a7f1244 | 1067 | goto out_unlock_rcu; |
af75cd3c VG |
1068 | } |
1069 | } | |
af75cd3c VG |
1070 | |
1071 | /* | |
1072 | * Either group has not been allocated yet or it is not an unlimited | |
1073 | * IO group | |
1074 | */ | |
e43473b7 | 1075 | spin_lock_irq(q->queue_lock); |
cd1604fa | 1076 | tg = throtl_lookup_create_tg(td, blkcg); |
bc16a4f9 TH |
1077 | if (unlikely(!tg)) |
1078 | goto out_unlock; | |
f469a7b4 | 1079 | |
e43473b7 VG |
1080 | if (tg->nr_queued[rw]) { |
1081 | /* | |
1082 | * There is already another bio queued in same dir. No | |
1083 | * need to update dispatch time. | |
1084 | */ | |
231d704b | 1085 | update_disptime = false; |
e43473b7 | 1086 | goto queue_bio; |
de701c74 | 1087 | |
e43473b7 VG |
1088 | } |
1089 | ||
1090 | /* Bio is with-in rate limit of group */ | |
0f3457f6 | 1091 | if (tg_may_dispatch(tg, bio, NULL)) { |
e43473b7 | 1092 | throtl_charge_bio(tg, bio); |
04521db0 VG |
1093 | |
1094 | /* | |
1095 | * We need to trim slice even when bios are not being queued | |
1096 | * otherwise it might happen that a bio is not queued for | |
1097 | * a long time and slice keeps on extending and trim is not | |
1098 | * called for a long time. Now if limits are reduced suddenly | |
1099 | * we take into account all the IO dispatched so far at new | |
1100 | * low rate and * newly queued IO gets a really long dispatch | |
1101 | * time. | |
1102 | * | |
1103 | * So keep on trimming slice even if bio is not queued. | |
1104 | */ | |
0f3457f6 | 1105 | throtl_trim_slice(tg, rw); |
bc16a4f9 | 1106 | goto out_unlock; |
e43473b7 VG |
1107 | } |
1108 | ||
1109 | queue_bio: | |
0f3457f6 | 1110 | throtl_log_tg(tg, "[%c] bio. bdisp=%llu sz=%u bps=%llu" |
8e89d13f VG |
1111 | " iodisp=%u iops=%u queued=%d/%d", |
1112 | rw == READ ? 'R' : 'W', | |
e43473b7 | 1113 | tg->bytes_disp[rw], bio->bi_size, tg->bps[rw], |
8e89d13f | 1114 | tg->io_disp[rw], tg->iops[rw], |
e43473b7 VG |
1115 | tg->nr_queued[READ], tg->nr_queued[WRITE]); |
1116 | ||
671058fb | 1117 | bio_associate_current(bio); |
0049af73 | 1118 | throtl_add_bio_tg(bio, tg, &q->td->service_queue); |
bc16a4f9 | 1119 | throttled = true; |
e43473b7 VG |
1120 | |
1121 | if (update_disptime) { | |
0049af73 | 1122 | tg_update_disptime(tg, &td->service_queue); |
e43473b7 VG |
1123 | throtl_schedule_next_dispatch(td); |
1124 | } | |
1125 | ||
bc16a4f9 | 1126 | out_unlock: |
e43473b7 | 1127 | spin_unlock_irq(q->queue_lock); |
2a7f1244 TH |
1128 | out_unlock_rcu: |
1129 | rcu_read_unlock(); | |
bc16a4f9 TH |
1130 | out: |
1131 | return throttled; | |
e43473b7 VG |
1132 | } |
1133 | ||
c9a929dd TH |
1134 | /** |
1135 | * blk_throtl_drain - drain throttled bios | |
1136 | * @q: request_queue to drain throttled bios for | |
1137 | * | |
1138 | * Dispatch all currently throttled bios on @q through ->make_request_fn(). | |
1139 | */ | |
1140 | void blk_throtl_drain(struct request_queue *q) | |
1141 | __releases(q->queue_lock) __acquires(q->queue_lock) | |
1142 | { | |
1143 | struct throtl_data *td = q->td; | |
0049af73 | 1144 | struct throtl_service_queue *parent_sq = &td->service_queue; |
c9a929dd TH |
1145 | struct throtl_grp *tg; |
1146 | struct bio_list bl; | |
1147 | struct bio *bio; | |
1148 | ||
8bcb6c7d | 1149 | queue_lockdep_assert_held(q); |
c9a929dd TH |
1150 | |
1151 | bio_list_init(&bl); | |
1152 | ||
0049af73 TH |
1153 | while ((tg = throtl_rb_first(parent_sq))) { |
1154 | throtl_dequeue_tg(tg, parent_sq); | |
c9a929dd TH |
1155 | |
1156 | while ((bio = bio_list_peek(&tg->bio_lists[READ]))) | |
0f3457f6 | 1157 | tg_dispatch_one_bio(tg, bio_data_dir(bio), &bl); |
c9a929dd | 1158 | while ((bio = bio_list_peek(&tg->bio_lists[WRITE]))) |
0f3457f6 | 1159 | tg_dispatch_one_bio(tg, bio_data_dir(bio), &bl); |
c9a929dd TH |
1160 | } |
1161 | spin_unlock_irq(q->queue_lock); | |
1162 | ||
1163 | while ((bio = bio_list_pop(&bl))) | |
1164 | generic_make_request(bio); | |
1165 | ||
1166 | spin_lock_irq(q->queue_lock); | |
1167 | } | |
1168 | ||
e43473b7 VG |
1169 | int blk_throtl_init(struct request_queue *q) |
1170 | { | |
1171 | struct throtl_data *td; | |
a2b1693b | 1172 | int ret; |
e43473b7 VG |
1173 | |
1174 | td = kzalloc_node(sizeof(*td), GFP_KERNEL, q->node); | |
1175 | if (!td) | |
1176 | return -ENOMEM; | |
1177 | ||
cb76199c | 1178 | INIT_DELAYED_WORK(&td->dispatch_work, blk_throtl_dispatch_work_fn); |
49a2f1e3 | 1179 | throtl_service_queue_init(&td->service_queue); |
e43473b7 | 1180 | |
cd1604fa | 1181 | q->td = td; |
29b12589 | 1182 | td->queue = q; |
02977e4a | 1183 | |
a2b1693b | 1184 | /* activate policy */ |
3c798398 | 1185 | ret = blkcg_activate_policy(q, &blkcg_policy_throtl); |
a2b1693b | 1186 | if (ret) |
f51b802c | 1187 | kfree(td); |
a2b1693b | 1188 | return ret; |
e43473b7 VG |
1189 | } |
1190 | ||
1191 | void blk_throtl_exit(struct request_queue *q) | |
1192 | { | |
c875f4d0 | 1193 | BUG_ON(!q->td); |
da527770 | 1194 | throtl_shutdown_wq(q); |
3c798398 | 1195 | blkcg_deactivate_policy(q, &blkcg_policy_throtl); |
c9a929dd | 1196 | kfree(q->td); |
e43473b7 VG |
1197 | } |
1198 | ||
1199 | static int __init throtl_init(void) | |
1200 | { | |
450adcbe VG |
1201 | kthrotld_workqueue = alloc_workqueue("kthrotld", WQ_MEM_RECLAIM, 0); |
1202 | if (!kthrotld_workqueue) | |
1203 | panic("Failed to create kthrotld\n"); | |
1204 | ||
3c798398 | 1205 | return blkcg_policy_register(&blkcg_policy_throtl); |
e43473b7 VG |
1206 | } |
1207 | ||
1208 | module_init(throtl_init); |