]>
Commit | Line | Data |
---|---|---|
3dcf60bc | 1 | // SPDX-License-Identifier: GPL-2.0 |
31e4c28d VG |
2 | /* |
3 | * Common Block IO controller cgroup interface | |
4 | * | |
5 | * Based on ideas and code from CFQ, CFS and BFQ: | |
6 | * Copyright (C) 2003 Jens Axboe <axboe@kernel.dk> | |
7 | * | |
8 | * Copyright (C) 2008 Fabio Checconi <fabio@gandalf.sssup.it> | |
9 | * Paolo Valente <paolo.valente@unimore.it> | |
10 | * | |
11 | * Copyright (C) 2009 Vivek Goyal <vgoyal@redhat.com> | |
12 | * Nauman Rafique <nauman@google.com> | |
e48453c3 AA |
13 | * |
14 | * For policy-specific per-blkcg data: | |
15 | * Copyright (C) 2015 Paolo Valente <paolo.valente@unimore.it> | |
16 | * Arianna Avanzini <avanzini.arianna@gmail.com> | |
31e4c28d VG |
17 | */ |
18 | #include <linux/ioprio.h> | |
22084190 | 19 | #include <linux/kdev_t.h> |
9d6a986c | 20 | #include <linux/module.h> |
174cd4b1 | 21 | #include <linux/sched/signal.h> |
accee785 | 22 | #include <linux/err.h> |
9195291e | 23 | #include <linux/blkdev.h> |
52ebea74 | 24 | #include <linux/backing-dev.h> |
5a0e3ad6 | 25 | #include <linux/slab.h> |
72e06c25 | 26 | #include <linux/delay.h> |
9a9e8a26 | 27 | #include <linux/atomic.h> |
36aa9e5f | 28 | #include <linux/ctype.h> |
03248add | 29 | #include <linux/resume_user_mode.h> |
fd112c74 | 30 | #include <linux/psi.h> |
82d981d4 | 31 | #include <linux/part_stat.h> |
5efd6113 | 32 | #include "blk.h" |
672fdcf0 | 33 | #include "blk-cgroup.h" |
556910e3 | 34 | #include "blk-ioprio.h" |
a7b36ee6 | 35 | #include "blk-throttle.h" |
3e252066 | 36 | |
20cb1c2f ML |
37 | static void __blkcg_rstat_flush(struct blkcg *blkcg, int cpu); |
38 | ||
838f13bf TH |
39 | /* |
40 | * blkcg_pol_mutex protects blkcg_policy[] and policy [de]activation. | |
41 | * blkcg_pol_register_mutex nests outside of it and synchronizes entire | |
42 | * policy [un]register operations including cgroup file additions / | |
43 | * removals. Putting cgroup file registration outside blkcg_pol_mutex | |
44 | * allows grabbing it from cgroup callbacks. | |
45 | */ | |
46 | static DEFINE_MUTEX(blkcg_pol_register_mutex); | |
bc0d6501 | 47 | static DEFINE_MUTEX(blkcg_pol_mutex); |
923adde1 | 48 | |
e48453c3 | 49 | struct blkcg blkcg_root; |
3c798398 | 50 | EXPORT_SYMBOL_GPL(blkcg_root); |
9d6a986c | 51 | |
496d5e75 | 52 | struct cgroup_subsys_state * const blkcg_root_css = &blkcg_root.css; |
9b0eb69b | 53 | EXPORT_SYMBOL_GPL(blkcg_root_css); |
496d5e75 | 54 | |
3c798398 | 55 | static struct blkcg_policy *blkcg_policy[BLKCG_MAX_POLS]; |
035d10b2 | 56 | |
7876f930 TH |
57 | static LIST_HEAD(all_blkcgs); /* protected by blkcg_pol_mutex */ |
58 | ||
07b0fdec | 59 | bool blkcg_debug_stats = false; |
903d23f0 | 60 | |
20cb1c2f ML |
61 | static DEFINE_RAW_SPINLOCK(blkg_stat_lock); |
62 | ||
a731763f YK |
63 | #define BLKG_DESTROY_BATCH_SIZE 64 |
64 | ||
3b8cc629 WL |
65 | /* |
66 | * Lockless lists for tracking IO stats update | |
67 | * | |
68 | * New IO stats are stored in the percpu iostat_cpu within blkcg_gq (blkg). | |
69 | * There are multiple blkg's (one for each block device) attached to each | |
70 | * blkcg. The rstat code keeps track of which cpu has IO stats updated, | |
71 | * but it doesn't know which blkg has the updated stats. If there are many | |
72 | * block devices in a system, the cost of iterating all the blkg's to flush | |
73 | * out the IO stats can be high. To reduce such overhead, a set of percpu | |
74 | * lockless lists (lhead) per blkcg are used to track the set of recently | |
75 | * updated iostat_cpu's since the last flush. An iostat_cpu will be put | |
76 | * onto the lockless list on the update side [blk_cgroup_bio_start()] if | |
77 | * not there yet and then removed when being flushed [blkcg_rstat_flush()]. | |
78 | * References to blkg are gotten and then put back in the process to | |
79 | * protect against blkg removal. | |
80 | * | |
81 | * Return: 0 if successful or -ENOMEM if allocation fails. | |
82 | */ | |
83 | static int init_blkcg_llists(struct blkcg *blkcg) | |
84 | { | |
85 | int cpu; | |
86 | ||
87 | blkcg->lhead = alloc_percpu_gfp(struct llist_head, GFP_KERNEL); | |
88 | if (!blkcg->lhead) | |
89 | return -ENOMEM; | |
90 | ||
91 | for_each_possible_cpu(cpu) | |
92 | init_llist_head(per_cpu_ptr(blkcg->lhead, cpu)); | |
93 | return 0; | |
94 | } | |
95 | ||
bc5fee91 CH |
96 | /** |
97 | * blkcg_css - find the current css | |
98 | * | |
99 | * Find the css associated with either the kthread or the current task. | |
100 | * This may return a dying css, so it is up to the caller to use tryget logic | |
101 | * to confirm it is alive and well. | |
102 | */ | |
103 | static struct cgroup_subsys_state *blkcg_css(void) | |
104 | { | |
105 | struct cgroup_subsys_state *css; | |
106 | ||
107 | css = kthread_blkcg(); | |
108 | if (css) | |
109 | return css; | |
110 | return task_css(current, io_cgrp_id); | |
111 | } | |
112 | ||
a2b1693b | 113 | static bool blkcg_policy_enabled(struct request_queue *q, |
3c798398 | 114 | const struct blkcg_policy *pol) |
a2b1693b TH |
115 | { |
116 | return pol && test_bit(pol->plid, q->blkcg_pols); | |
117 | } | |
118 | ||
d578c770 | 119 | static void blkg_free_workfn(struct work_struct *work) |
0381411e | 120 | { |
d578c770 ML |
121 | struct blkcg_gq *blkg = container_of(work, struct blkcg_gq, |
122 | free_work); | |
a06377c5 | 123 | struct request_queue *q = blkg->q; |
e8989fae | 124 | int i; |
549d3aa8 | 125 | |
f1c006f1 YK |
126 | /* |
127 | * pd_free_fn() can also be called from blkcg_deactivate_policy(), | |
128 | * in order to make sure pd_free_fn() is called in order, the deletion | |
1231039d | 129 | * of the list blkg->q_node is delayed to here from blkg_destroy(), and |
f1c006f1 YK |
130 | * blkcg_mutex is used to synchronize blkg_free_workfn() and |
131 | * blkcg_deactivate_policy(). | |
132 | */ | |
a06377c5 | 133 | mutex_lock(&q->blkcg_mutex); |
db613670 | 134 | for (i = 0; i < BLKCG_MAX_POLS; i++) |
001bea73 TH |
135 | if (blkg->pd[i]) |
136 | blkcg_policy[i]->pd_free_fn(blkg->pd[i]); | |
c7241bab YK |
137 | if (blkg->parent) |
138 | blkg_put(blkg->parent); | |
c164c7bc | 139 | spin_lock_irq(&q->queue_lock); |
1231039d | 140 | list_del_init(&blkg->q_node); |
c164c7bc | 141 | spin_unlock_irq(&q->queue_lock); |
a06377c5 | 142 | mutex_unlock(&q->blkcg_mutex); |
e8989fae | 143 | |
a06377c5 | 144 | blk_put_queue(q); |
f7331648 | 145 | free_percpu(blkg->iostat_cpu); |
ef069b97 | 146 | percpu_ref_exit(&blkg->refcnt); |
549d3aa8 | 147 | kfree(blkg); |
0381411e TH |
148 | } |
149 | ||
d578c770 ML |
150 | /** |
151 | * blkg_free - free a blkg | |
152 | * @blkg: blkg to free | |
153 | * | |
154 | * Free @blkg which may be partially allocated. | |
155 | */ | |
156 | static void blkg_free(struct blkcg_gq *blkg) | |
157 | { | |
158 | if (!blkg) | |
159 | return; | |
160 | ||
161 | /* | |
162 | * Both ->pd_free_fn() and request queue's release handler may | |
163 | * sleep, so free us by scheduling one work func | |
164 | */ | |
165 | INIT_WORK(&blkg->free_work, blkg_free_workfn); | |
166 | schedule_work(&blkg->free_work); | |
167 | } | |
168 | ||
7fcf2b03 DZ |
169 | static void __blkg_release(struct rcu_head *rcu) |
170 | { | |
171 | struct blkcg_gq *blkg = container_of(rcu, struct blkcg_gq, rcu_head); | |
20cb1c2f ML |
172 | struct blkcg *blkcg = blkg->blkcg; |
173 | int cpu; | |
7fcf2b03 | 174 | |
2c275afe | 175 | #ifdef CONFIG_BLK_CGROUP_PUNT_BIO |
d3f77dfd | 176 | WARN_ON(!bio_list_empty(&blkg->async_bios)); |
2c275afe | 177 | #endif |
20cb1c2f ML |
178 | /* |
179 | * Flush all the non-empty percpu lockless lists before releasing | |
180 | * us, given these stat belongs to us. | |
181 | * | |
182 | * blkg_stat_lock is for serializing blkg stat update | |
183 | */ | |
184 | for_each_possible_cpu(cpu) | |
185 | __blkcg_rstat_flush(blkcg, cpu); | |
d3f77dfd | 186 | |
7fcf2b03 DZ |
187 | /* release the blkcg and parent blkg refs this blkg has been holding */ |
188 | css_put(&blkg->blkcg->css); | |
7fcf2b03 DZ |
189 | blkg_free(blkg); |
190 | } | |
191 | ||
192 | /* | |
193 | * A group is RCU protected, but having an rcu lock does not mean that one | |
194 | * can access all the fields of blkg and assume these are valid. For | |
195 | * example, don't try to follow throtl_data and request queue links. | |
196 | * | |
197 | * Having a reference to blkg under an rcu allows accesses to only values | |
198 | * local to groups like group stats and group rate limits. | |
199 | */ | |
200 | static void blkg_release(struct percpu_ref *ref) | |
201 | { | |
202 | struct blkcg_gq *blkg = container_of(ref, struct blkcg_gq, refcnt); | |
203 | ||
204 | call_rcu(&blkg->rcu_head, __blkg_release); | |
205 | } | |
206 | ||
2c275afe CH |
207 | #ifdef CONFIG_BLK_CGROUP_PUNT_BIO |
208 | static struct workqueue_struct *blkcg_punt_bio_wq; | |
209 | ||
d3f77dfd TH |
210 | static void blkg_async_bio_workfn(struct work_struct *work) |
211 | { | |
212 | struct blkcg_gq *blkg = container_of(work, struct blkcg_gq, | |
213 | async_bio_work); | |
214 | struct bio_list bios = BIO_EMPTY_LIST; | |
215 | struct bio *bio; | |
192f1c6b XT |
216 | struct blk_plug plug; |
217 | bool need_plug = false; | |
d3f77dfd TH |
218 | |
219 | /* as long as there are pending bios, @blkg can't go away */ | |
12be09fe | 220 | spin_lock(&blkg->async_bio_lock); |
7a324d83 | 221 | bio_list_merge_init(&bios, &blkg->async_bios); |
12be09fe | 222 | spin_unlock(&blkg->async_bio_lock); |
d3f77dfd | 223 | |
192f1c6b XT |
224 | /* start plug only when bio_list contains at least 2 bios */ |
225 | if (bios.head && bios.head->bi_next) { | |
226 | need_plug = true; | |
227 | blk_start_plug(&plug); | |
228 | } | |
d3f77dfd TH |
229 | while ((bio = bio_list_pop(&bios))) |
230 | submit_bio(bio); | |
192f1c6b XT |
231 | if (need_plug) |
232 | blk_finish_plug(&plug); | |
d3f77dfd TH |
233 | } |
234 | ||
2c275afe CH |
235 | /* |
236 | * When a shared kthread issues a bio for a cgroup, doing so synchronously can | |
237 | * lead to priority inversions as the kthread can be trapped waiting for that | |
238 | * cgroup. Use this helper instead of submit_bio to punt the actual issuing to | |
239 | * a dedicated per-blkcg work item to avoid such priority inversions. | |
240 | */ | |
241 | void blkcg_punt_bio_submit(struct bio *bio) | |
242 | { | |
243 | struct blkcg_gq *blkg = bio->bi_blkg; | |
244 | ||
245 | if (blkg->parent) { | |
246 | spin_lock(&blkg->async_bio_lock); | |
247 | bio_list_add(&blkg->async_bios, bio); | |
248 | spin_unlock(&blkg->async_bio_lock); | |
249 | queue_work(blkcg_punt_bio_wq, &blkg->async_bio_work); | |
250 | } else { | |
251 | /* never bounce for the root cgroup */ | |
252 | submit_bio(bio); | |
253 | } | |
254 | } | |
255 | EXPORT_SYMBOL_GPL(blkcg_punt_bio_submit); | |
256 | ||
257 | static int __init blkcg_punt_bio_init(void) | |
258 | { | |
259 | blkcg_punt_bio_wq = alloc_workqueue("blkcg_punt_bio", | |
260 | WQ_MEM_RECLAIM | WQ_FREEZABLE | | |
261 | WQ_UNBOUND | WQ_SYSFS, 0); | |
262 | if (!blkcg_punt_bio_wq) | |
263 | return -ENOMEM; | |
264 | return 0; | |
265 | } | |
266 | subsys_initcall(blkcg_punt_bio_init); | |
267 | #endif /* CONFIG_BLK_CGROUP_PUNT_BIO */ | |
268 | ||
bbb1ebe7 CH |
269 | /** |
270 | * bio_blkcg_css - return the blkcg CSS associated with a bio | |
271 | * @bio: target bio | |
272 | * | |
273 | * This returns the CSS for the blkcg associated with a bio, or %NULL if not | |
274 | * associated. Callers are expected to either handle %NULL or know association | |
275 | * has been done prior to calling this. | |
276 | */ | |
277 | struct cgroup_subsys_state *bio_blkcg_css(struct bio *bio) | |
278 | { | |
279 | if (!bio || !bio->bi_blkg) | |
280 | return NULL; | |
281 | return &bio->bi_blkg->blkcg->css; | |
282 | } | |
283 | EXPORT_SYMBOL_GPL(bio_blkcg_css); | |
284 | ||
397c9f46 CH |
285 | /** |
286 | * blkcg_parent - get the parent of a blkcg | |
287 | * @blkcg: blkcg of interest | |
288 | * | |
289 | * Return the parent blkcg of @blkcg. Can be called anytime. | |
290 | */ | |
291 | static inline struct blkcg *blkcg_parent(struct blkcg *blkcg) | |
292 | { | |
293 | return css_to_blkcg(blkcg->css.parent); | |
294 | } | |
295 | ||
0381411e TH |
296 | /** |
297 | * blkg_alloc - allocate a blkg | |
298 | * @blkcg: block cgroup the new blkg is associated with | |
99e60387 | 299 | * @disk: gendisk the new blkg is associated with |
15974993 | 300 | * @gfp_mask: allocation mask to use |
0381411e | 301 | * |
521277d1 | 302 | * Allocate a new blkg associating @blkcg and @disk. |
0381411e | 303 | */ |
99e60387 | 304 | static struct blkcg_gq *blkg_alloc(struct blkcg *blkcg, struct gendisk *disk, |
15974993 | 305 | gfp_t gfp_mask) |
0381411e | 306 | { |
3c798398 | 307 | struct blkcg_gq *blkg; |
f7331648 | 308 | int i, cpu; |
0381411e TH |
309 | |
310 | /* alloc and init base part */ | |
99e60387 | 311 | blkg = kzalloc_node(sizeof(*blkg), gfp_mask, disk->queue->node); |
0381411e TH |
312 | if (!blkg) |
313 | return NULL; | |
ef069b97 | 314 | if (percpu_ref_init(&blkg->refcnt, blkg_release, 0, gfp_mask)) |
0b6f93bd | 315 | goto out_free_blkg; |
f7331648 TH |
316 | blkg->iostat_cpu = alloc_percpu_gfp(struct blkg_iostat_set, gfp_mask); |
317 | if (!blkg->iostat_cpu) | |
0b6f93bd | 318 | goto out_exit_refcnt; |
99e60387 | 319 | if (!blk_get_queue(disk->queue)) |
0b6f93bd | 320 | goto out_free_iostat; |
0a9a25ca | 321 | |
99e60387 | 322 | blkg->q = disk->queue; |
e8989fae | 323 | INIT_LIST_HEAD(&blkg->q_node); |
2c275afe | 324 | blkg->blkcg = blkcg; |
9d230c09 | 325 | blkg->iostat.blkg = blkg; |
2c275afe | 326 | #ifdef CONFIG_BLK_CGROUP_PUNT_BIO |
d3f77dfd TH |
327 | spin_lock_init(&blkg->async_bio_lock); |
328 | bio_list_init(&blkg->async_bios); | |
329 | INIT_WORK(&blkg->async_bio_work, blkg_async_bio_workfn); | |
2c275afe | 330 | #endif |
0381411e | 331 | |
f7331648 | 332 | u64_stats_init(&blkg->iostat.sync); |
3b8cc629 | 333 | for_each_possible_cpu(cpu) { |
f7331648 | 334 | u64_stats_init(&per_cpu_ptr(blkg->iostat_cpu, cpu)->sync); |
3b8cc629 WL |
335 | per_cpu_ptr(blkg->iostat_cpu, cpu)->blkg = blkg; |
336 | } | |
f7331648 | 337 | |
8bd435b3 | 338 | for (i = 0; i < BLKCG_MAX_POLS; i++) { |
3c798398 | 339 | struct blkcg_policy *pol = blkcg_policy[i]; |
e8989fae | 340 | struct blkg_policy_data *pd; |
0381411e | 341 | |
99e60387 | 342 | if (!blkcg_policy_enabled(disk->queue, pol)) |
e8989fae TH |
343 | continue; |
344 | ||
345 | /* alloc per-policy data and attach it to blkg */ | |
0a0b4f79 | 346 | pd = pol->pd_alloc_fn(disk, blkcg, gfp_mask); |
a051661c | 347 | if (!pd) |
0b6f93bd | 348 | goto out_free_pds; |
e8989fae TH |
349 | blkg->pd[i] = pd; |
350 | pd->blkg = blkg; | |
b276a876 | 351 | pd->plid = i; |
dfd6200a | 352 | pd->online = false; |
e8989fae TH |
353 | } |
354 | ||
0381411e | 355 | return blkg; |
a051661c | 356 | |
0b6f93bd CH |
357 | out_free_pds: |
358 | while (--i >= 0) | |
359 | if (blkg->pd[i]) | |
360 | blkcg_policy[i]->pd_free_fn(blkg->pd[i]); | |
a06377c5 | 361 | blk_put_queue(disk->queue); |
0b6f93bd CH |
362 | out_free_iostat: |
363 | free_percpu(blkg->iostat_cpu); | |
364 | out_exit_refcnt: | |
365 | percpu_ref_exit(&blkg->refcnt); | |
366 | out_free_blkg: | |
367 | kfree(blkg); | |
a051661c | 368 | return NULL; |
0381411e TH |
369 | } |
370 | ||
15974993 | 371 | /* |
d708f0d5 JA |
372 | * If @new_blkg is %NULL, this function tries to allocate a new one as |
373 | * necessary using %GFP_NOWAIT. @new_blkg is always consumed on return. | |
15974993 | 374 | */ |
99e60387 | 375 | static struct blkcg_gq *blkg_create(struct blkcg *blkcg, struct gendisk *disk, |
d708f0d5 | 376 | struct blkcg_gq *new_blkg) |
5624a4e4 | 377 | { |
d708f0d5 | 378 | struct blkcg_gq *blkg; |
f427d909 | 379 | int i, ret; |
5624a4e4 | 380 | |
99e60387 | 381 | lockdep_assert_held(&disk->queue->queue_lock); |
cd1604fa | 382 | |
0273ac34 | 383 | /* request_queue is dying, do not create/recreate a blkg */ |
99e60387 | 384 | if (blk_queue_dying(disk->queue)) { |
0273ac34 DZ |
385 | ret = -ENODEV; |
386 | goto err_free_blkg; | |
387 | } | |
388 | ||
7ee9c562 | 389 | /* blkg holds a reference to blkcg */ |
ec903c0c | 390 | if (!css_tryget_online(&blkcg->css)) { |
20386ce0 | 391 | ret = -ENODEV; |
93e6d5d8 | 392 | goto err_free_blkg; |
15974993 | 393 | } |
cd1604fa | 394 | |
d708f0d5 JA |
395 | /* allocate */ |
396 | if (!new_blkg) { | |
99e60387 | 397 | new_blkg = blkg_alloc(blkcg, disk, GFP_NOWAIT | __GFP_NOWARN); |
d708f0d5 JA |
398 | if (unlikely(!new_blkg)) { |
399 | ret = -ENOMEM; | |
8c911f3d | 400 | goto err_put_css; |
15974993 TH |
401 | } |
402 | } | |
d708f0d5 | 403 | blkg = new_blkg; |
cd1604fa | 404 | |
db613670 | 405 | /* link parent */ |
3c547865 | 406 | if (blkcg_parent(blkcg)) { |
99e60387 | 407 | blkg->parent = blkg_lookup(blkcg_parent(blkcg), disk->queue); |
3c547865 | 408 | if (WARN_ON_ONCE(!blkg->parent)) { |
20386ce0 | 409 | ret = -ENODEV; |
8c911f3d | 410 | goto err_put_css; |
3c547865 TH |
411 | } |
412 | blkg_get(blkg->parent); | |
413 | } | |
414 | ||
db613670 TH |
415 | /* invoke per-policy init */ |
416 | for (i = 0; i < BLKCG_MAX_POLS; i++) { | |
417 | struct blkcg_policy *pol = blkcg_policy[i]; | |
418 | ||
419 | if (blkg->pd[i] && pol->pd_init_fn) | |
a9520cd6 | 420 | pol->pd_init_fn(blkg->pd[i]); |
db613670 TH |
421 | } |
422 | ||
423 | /* insert */ | |
cd1604fa | 424 | spin_lock(&blkcg->lock); |
99e60387 | 425 | ret = radix_tree_insert(&blkcg->blkg_tree, disk->queue->id, blkg); |
a637120e TH |
426 | if (likely(!ret)) { |
427 | hlist_add_head_rcu(&blkg->blkcg_node, &blkcg->blkg_list); | |
99e60387 | 428 | list_add(&blkg->q_node, &disk->queue->blkg_list); |
f427d909 TH |
429 | |
430 | for (i = 0; i < BLKCG_MAX_POLS; i++) { | |
431 | struct blkcg_policy *pol = blkcg_policy[i]; | |
432 | ||
dfd6200a YK |
433 | if (blkg->pd[i]) { |
434 | if (pol->pd_online_fn) | |
435 | pol->pd_online_fn(blkg->pd[i]); | |
436 | blkg->pd[i]->online = true; | |
437 | } | |
f427d909 | 438 | } |
a637120e | 439 | } |
f427d909 | 440 | blkg->online = true; |
cd1604fa | 441 | spin_unlock(&blkcg->lock); |
496fb780 | 442 | |
ec13b1d6 | 443 | if (!ret) |
a637120e | 444 | return blkg; |
15974993 | 445 | |
3c547865 TH |
446 | /* @blkg failed fully initialized, use the usual release path */ |
447 | blkg_put(blkg); | |
448 | return ERR_PTR(ret); | |
449 | ||
d708f0d5 | 450 | err_put_css: |
496fb780 | 451 | css_put(&blkcg->css); |
93e6d5d8 | 452 | err_free_blkg: |
28e538a3 CH |
453 | if (new_blkg) |
454 | blkg_free(new_blkg); | |
93e6d5d8 | 455 | return ERR_PTR(ret); |
31e4c28d | 456 | } |
3c96cb32 | 457 | |
86cde6b6 | 458 | /** |
8c546287 | 459 | * blkg_lookup_create - lookup blkg, try to create one if not there |
86cde6b6 | 460 | * @blkcg: blkcg of interest |
99e60387 | 461 | * @disk: gendisk of interest |
86cde6b6 | 462 | * |
99e60387 | 463 | * Lookup blkg for the @blkcg - @disk pair. If it doesn't exist, try to |
3c547865 TH |
464 | * create one. blkg creation is performed recursively from blkcg_root such |
465 | * that all non-root blkg's have access to the parent blkg. This function | |
99e60387 | 466 | * should be called under RCU read lock and takes @disk->queue->queue_lock. |
86cde6b6 | 467 | * |
beea9da0 DZ |
468 | * Returns the blkg or the closest blkg if blkg_create() fails as it walks |
469 | * down from root. | |
86cde6b6 | 470 | */ |
8c546287 | 471 | static struct blkcg_gq *blkg_lookup_create(struct blkcg *blkcg, |
99e60387 | 472 | struct gendisk *disk) |
3c96cb32 | 473 | { |
99e60387 | 474 | struct request_queue *q = disk->queue; |
86cde6b6 | 475 | struct blkcg_gq *blkg; |
8c546287 | 476 | unsigned long flags; |
86cde6b6 TH |
477 | |
478 | WARN_ON_ONCE(!rcu_read_lock_held()); | |
86cde6b6 | 479 | |
8c546287 | 480 | blkg = blkg_lookup(blkcg, q); |
86cde6b6 TH |
481 | if (blkg) |
482 | return blkg; | |
483 | ||
8c546287 | 484 | spin_lock_irqsave(&q->queue_lock, flags); |
4a69f325 CH |
485 | blkg = blkg_lookup(blkcg, q); |
486 | if (blkg) { | |
5765033c CH |
487 | if (blkcg != &blkcg_root && |
488 | blkg != rcu_dereference(blkcg->blkg_hint)) | |
489 | rcu_assign_pointer(blkcg->blkg_hint, blkg); | |
8c546287 | 490 | goto found; |
4a69f325 | 491 | } |
8c546287 | 492 | |
3c547865 TH |
493 | /* |
494 | * Create blkgs walking down from blkcg_root to @blkcg, so that all | |
beea9da0 DZ |
495 | * non-root blkgs have access to their parents. Returns the closest |
496 | * blkg to the intended blkg should blkg_create() fail. | |
3c547865 TH |
497 | */ |
498 | while (true) { | |
499 | struct blkcg *pos = blkcg; | |
500 | struct blkcg *parent = blkcg_parent(blkcg); | |
beea9da0 DZ |
501 | struct blkcg_gq *ret_blkg = q->root_blkg; |
502 | ||
503 | while (parent) { | |
79fcc5be | 504 | blkg = blkg_lookup(parent, q); |
beea9da0 DZ |
505 | if (blkg) { |
506 | /* remember closest blkg */ | |
507 | ret_blkg = blkg; | |
508 | break; | |
509 | } | |
3c547865 TH |
510 | pos = parent; |
511 | parent = blkcg_parent(parent); | |
512 | } | |
513 | ||
99e60387 | 514 | blkg = blkg_create(pos, disk, NULL); |
8c546287 CH |
515 | if (IS_ERR(blkg)) { |
516 | blkg = ret_blkg; | |
517 | break; | |
518 | } | |
beea9da0 | 519 | if (pos == blkcg) |
8c546287 | 520 | break; |
b978962a DZ |
521 | } |
522 | ||
8c546287 CH |
523 | found: |
524 | spin_unlock_irqrestore(&q->queue_lock, flags); | |
b978962a DZ |
525 | return blkg; |
526 | } | |
527 | ||
3c798398 | 528 | static void blkg_destroy(struct blkcg_gq *blkg) |
03aa264a | 529 | { |
3c798398 | 530 | struct blkcg *blkcg = blkg->blkcg; |
6b065462 | 531 | int i; |
03aa264a | 532 | |
0d945c1f | 533 | lockdep_assert_held(&blkg->q->queue_lock); |
9f13ef67 | 534 | lockdep_assert_held(&blkcg->lock); |
03aa264a | 535 | |
f1c006f1 YK |
536 | /* |
537 | * blkg stays on the queue list until blkg_free_workfn(), see details in | |
538 | * blkg_free_workfn(), hence this function can be called from | |
539 | * blkcg_destroy_blkgs() first and again from blkg_destroy_all() before | |
540 | * blkg_free_workfn(). | |
541 | */ | |
542 | if (hlist_unhashed(&blkg->blkcg_node)) | |
543 | return; | |
a637120e | 544 | |
6b065462 DZF |
545 | for (i = 0; i < BLKCG_MAX_POLS; i++) { |
546 | struct blkcg_policy *pol = blkcg_policy[i]; | |
547 | ||
dfd6200a | 548 | if (blkg->pd[i] && blkg->pd[i]->online) { |
f37bf75c | 549 | blkg->pd[i]->online = false; |
dfd6200a YK |
550 | if (pol->pd_offline_fn) |
551 | pol->pd_offline_fn(blkg->pd[i]); | |
dfd6200a | 552 | } |
6b065462 DZF |
553 | } |
554 | ||
f427d909 TH |
555 | blkg->online = false; |
556 | ||
a637120e | 557 | radix_tree_delete(&blkcg->blkg_tree, blkg->q->id); |
9f13ef67 | 558 | hlist_del_init_rcu(&blkg->blkcg_node); |
03aa264a | 559 | |
a637120e TH |
560 | /* |
561 | * Both setting lookup hint to and clearing it from @blkg are done | |
562 | * under queue_lock. If it's not pointing to @blkg now, it never | |
563 | * will. Hint assignment itself can race safely. | |
564 | */ | |
ec6c676a | 565 | if (rcu_access_pointer(blkcg->blkg_hint) == blkg) |
a637120e TH |
566 | rcu_assign_pointer(blkcg->blkg_hint, NULL); |
567 | ||
03aa264a TH |
568 | /* |
569 | * Put the reference taken at the time of creation so that when all | |
570 | * queues are gone, group can be destroyed. | |
571 | */ | |
7fcf2b03 | 572 | percpu_ref_kill(&blkg->refcnt); |
03aa264a TH |
573 | } |
574 | ||
00ad6991 | 575 | static void blkg_destroy_all(struct gendisk *disk) |
72e06c25 | 576 | { |
00ad6991 | 577 | struct request_queue *q = disk->queue; |
fab4c16c | 578 | struct blkcg_gq *blkg; |
a731763f | 579 | int count = BLKG_DESTROY_BATCH_SIZE; |
e63a5730 | 580 | int i; |
72e06c25 | 581 | |
a731763f | 582 | restart: |
0d945c1f | 583 | spin_lock_irq(&q->queue_lock); |
fab4c16c | 584 | list_for_each_entry(blkg, &q->blkg_list, q_node) { |
3c798398 | 585 | struct blkcg *blkcg = blkg->blkcg; |
72e06c25 | 586 | |
8176080d TS |
587 | if (hlist_unhashed(&blkg->blkcg_node)) |
588 | continue; | |
589 | ||
9f13ef67 TH |
590 | spin_lock(&blkcg->lock); |
591 | blkg_destroy(blkg); | |
592 | spin_unlock(&blkcg->lock); | |
a731763f YK |
593 | |
594 | /* | |
595 | * in order to avoid holding the spin lock for too long, release | |
596 | * it when a batch of blkgs are destroyed. | |
597 | */ | |
598 | if (!(--count)) { | |
599 | count = BLKG_DESTROY_BATCH_SIZE; | |
600 | spin_unlock_irq(&q->queue_lock); | |
601 | cond_resched(); | |
602 | goto restart; | |
603 | } | |
72e06c25 | 604 | } |
6fe810bd | 605 | |
e63a5730 ML |
606 | /* |
607 | * Mark policy deactivated since policy offline has been done, and | |
608 | * the free is scheduled, so future blkcg_deactivate_policy() can | |
609 | * be bypassed | |
610 | */ | |
611 | for (i = 0; i < BLKCG_MAX_POLS; i++) { | |
612 | struct blkcg_policy *pol = blkcg_policy[i]; | |
613 | ||
614 | if (pol) | |
615 | __clear_bit(pol->plid, q->blkcg_pols); | |
616 | } | |
617 | ||
6fe810bd | 618 | q->root_blkg = NULL; |
0d945c1f | 619 | spin_unlock_irq(&q->queue_lock); |
72e06c25 TH |
620 | } |
621 | ||
6da66806 ML |
622 | static void blkg_iostat_set(struct blkg_iostat *dst, struct blkg_iostat *src) |
623 | { | |
624 | int i; | |
625 | ||
626 | for (i = 0; i < BLKG_IOSTAT_NR; i++) { | |
627 | dst->bytes[i] = src->bytes[i]; | |
628 | dst->ios[i] = src->ios[i]; | |
629 | } | |
630 | } | |
631 | ||
632 | static void __blkg_clear_stat(struct blkg_iostat_set *bis) | |
633 | { | |
634 | struct blkg_iostat cur = {0}; | |
635 | unsigned long flags; | |
636 | ||
637 | flags = u64_stats_update_begin_irqsave(&bis->sync); | |
638 | blkg_iostat_set(&bis->cur, &cur); | |
639 | blkg_iostat_set(&bis->last, &cur); | |
640 | u64_stats_update_end_irqrestore(&bis->sync, flags); | |
641 | } | |
642 | ||
643 | static void blkg_clear_stat(struct blkcg_gq *blkg) | |
644 | { | |
645 | int cpu; | |
646 | ||
647 | for_each_possible_cpu(cpu) { | |
648 | struct blkg_iostat_set *s = per_cpu_ptr(blkg->iostat_cpu, cpu); | |
649 | ||
650 | __blkg_clear_stat(s); | |
651 | } | |
652 | __blkg_clear_stat(&blkg->iostat); | |
653 | } | |
654 | ||
182446d0 TH |
655 | static int blkcg_reset_stats(struct cgroup_subsys_state *css, |
656 | struct cftype *cftype, u64 val) | |
303a3acb | 657 | { |
182446d0 | 658 | struct blkcg *blkcg = css_to_blkcg(css); |
3c798398 | 659 | struct blkcg_gq *blkg; |
6da66806 | 660 | int i; |
303a3acb | 661 | |
838f13bf | 662 | mutex_lock(&blkcg_pol_mutex); |
303a3acb | 663 | spin_lock_irq(&blkcg->lock); |
997a026c TH |
664 | |
665 | /* | |
666 | * Note that stat reset is racy - it doesn't synchronize against | |
667 | * stat updates. This is a debug feature which shouldn't exist | |
668 | * anyway. If you get hit by a race, retry. | |
669 | */ | |
b67bfe0d | 670 | hlist_for_each_entry(blkg, &blkcg->blkg_list, blkcg_node) { |
6da66806 | 671 | blkg_clear_stat(blkg); |
8bd435b3 | 672 | for (i = 0; i < BLKCG_MAX_POLS; i++) { |
3c798398 | 673 | struct blkcg_policy *pol = blkcg_policy[i]; |
549d3aa8 | 674 | |
a9520cd6 TH |
675 | if (blkg->pd[i] && pol->pd_reset_stats_fn) |
676 | pol->pd_reset_stats_fn(blkg->pd[i]); | |
bc0d6501 | 677 | } |
303a3acb | 678 | } |
f0bdc8cd | 679 | |
303a3acb | 680 | spin_unlock_irq(&blkcg->lock); |
bc0d6501 | 681 | mutex_unlock(&blkcg_pol_mutex); |
303a3acb DS |
682 | return 0; |
683 | } | |
684 | ||
dd165eb3 | 685 | const char *blkg_dev_name(struct blkcg_gq *blkg) |
303a3acb | 686 | { |
a06377c5 | 687 | if (!blkg->q->disk) |
edb0872f | 688 | return NULL; |
d152c682 | 689 | return bdi_dev_name(blkg->q->disk->bdi); |
303a3acb DS |
690 | } |
691 | ||
d3d32e69 TH |
692 | /** |
693 | * blkcg_print_blkgs - helper for printing per-blkg data | |
694 | * @sf: seq_file to print to | |
695 | * @blkcg: blkcg of interest | |
696 | * @prfill: fill function to print out a blkg | |
697 | * @pol: policy in question | |
698 | * @data: data to be passed to @prfill | |
699 | * @show_total: to print out sum of prfill return values or not | |
700 | * | |
701 | * This function invokes @prfill on each blkg of @blkcg if pd for the | |
702 | * policy specified by @pol exists. @prfill is invoked with @sf, the | |
810ecfa7 TH |
703 | * policy data and @data and the matching queue lock held. If @show_total |
704 | * is %true, the sum of the return values from @prfill is printed with | |
705 | * "Total" label at the end. | |
d3d32e69 TH |
706 | * |
707 | * This is to be used to construct print functions for | |
708 | * cftype->read_seq_string method. | |
709 | */ | |
3c798398 | 710 | void blkcg_print_blkgs(struct seq_file *sf, struct blkcg *blkcg, |
f95a04af TH |
711 | u64 (*prfill)(struct seq_file *, |
712 | struct blkg_policy_data *, int), | |
3c798398 | 713 | const struct blkcg_policy *pol, int data, |
ec399347 | 714 | bool show_total) |
5624a4e4 | 715 | { |
3c798398 | 716 | struct blkcg_gq *blkg; |
d3d32e69 | 717 | u64 total = 0; |
5624a4e4 | 718 | |
810ecfa7 | 719 | rcu_read_lock(); |
ee89f812 | 720 | hlist_for_each_entry_rcu(blkg, &blkcg->blkg_list, blkcg_node) { |
0d945c1f | 721 | spin_lock_irq(&blkg->q->queue_lock); |
a2b1693b | 722 | if (blkcg_policy_enabled(blkg->q, pol)) |
f95a04af | 723 | total += prfill(sf, blkg->pd[pol->plid], data); |
0d945c1f | 724 | spin_unlock_irq(&blkg->q->queue_lock); |
810ecfa7 TH |
725 | } |
726 | rcu_read_unlock(); | |
d3d32e69 TH |
727 | |
728 | if (show_total) | |
729 | seq_printf(sf, "Total %llu\n", (unsigned long long)total); | |
730 | } | |
829fdb50 | 731 | EXPORT_SYMBOL_GPL(blkcg_print_blkgs); |
d3d32e69 TH |
732 | |
733 | /** | |
734 | * __blkg_prfill_u64 - prfill helper for a single u64 value | |
735 | * @sf: seq_file to print to | |
f95a04af | 736 | * @pd: policy private data of interest |
d3d32e69 TH |
737 | * @v: value to print |
738 | * | |
37754595 | 739 | * Print @v to @sf for the device associated with @pd. |
d3d32e69 | 740 | */ |
f95a04af | 741 | u64 __blkg_prfill_u64(struct seq_file *sf, struct blkg_policy_data *pd, u64 v) |
d3d32e69 | 742 | { |
f95a04af | 743 | const char *dname = blkg_dev_name(pd->blkg); |
d3d32e69 TH |
744 | |
745 | if (!dname) | |
746 | return 0; | |
747 | ||
748 | seq_printf(sf, "%s %llu\n", dname, (unsigned long long)v); | |
749 | return v; | |
750 | } | |
829fdb50 | 751 | EXPORT_SYMBOL_GPL(__blkg_prfill_u64); |
d3d32e69 | 752 | |
015d254c | 753 | /** |
faffaab2 TH |
754 | * blkg_conf_init - initialize a blkg_conf_ctx |
755 | * @ctx: blkg_conf_ctx to initialize | |
756 | * @input: input string | |
015d254c | 757 | * |
faffaab2 TH |
758 | * Initialize @ctx which can be used to parse blkg config input string @input. |
759 | * Once initialized, @ctx can be used with blkg_conf_open_bdev() and | |
760 | * blkg_conf_prep(), and must be cleaned up with blkg_conf_exit(). | |
761 | */ | |
762 | void blkg_conf_init(struct blkg_conf_ctx *ctx, char *input) | |
763 | { | |
764 | *ctx = (struct blkg_conf_ctx){ .input = input }; | |
765 | } | |
766 | EXPORT_SYMBOL_GPL(blkg_conf_init); | |
767 | ||
768 | /** | |
769 | * blkg_conf_open_bdev - parse and open bdev for per-blkg config update | |
770 | * @ctx: blkg_conf_ctx initialized with blkg_conf_init() | |
015d254c | 771 | * |
faffaab2 TH |
772 | * Parse the device node prefix part, MAJ:MIN, of per-blkg config update from |
773 | * @ctx->input and get and store the matching bdev in @ctx->bdev. @ctx->body is | |
774 | * set to point past the device node prefix. | |
775 | * | |
776 | * This function may be called multiple times on @ctx and the extra calls become | |
777 | * NOOPs. blkg_conf_prep() implicitly calls this function. Use this function | |
778 | * explicitly if bdev access is needed without resolving the blkcg / policy part | |
779 | * of @ctx->input. Returns -errno on error. | |
015d254c | 780 | */ |
faffaab2 | 781 | int blkg_conf_open_bdev(struct blkg_conf_ctx *ctx) |
015d254c | 782 | { |
faffaab2 | 783 | char *input = ctx->input; |
015d254c | 784 | unsigned int major, minor; |
22ae8ce8 CH |
785 | struct block_device *bdev; |
786 | int key_len; | |
015d254c | 787 | |
faffaab2 TH |
788 | if (ctx->bdev) |
789 | return 0; | |
790 | ||
015d254c | 791 | if (sscanf(input, "%u:%u%n", &major, &minor, &key_len) != 2) |
faffaab2 | 792 | return -EINVAL; |
015d254c TH |
793 | |
794 | input += key_len; | |
795 | if (!isspace(*input)) | |
faffaab2 | 796 | return -EINVAL; |
015d254c TH |
797 | input = skip_spaces(input); |
798 | ||
22ae8ce8 CH |
799 | bdev = blkdev_get_no_open(MKDEV(major, minor)); |
800 | if (!bdev) | |
faffaab2 | 801 | return -ENODEV; |
22ae8ce8 CH |
802 | if (bdev_is_partition(bdev)) { |
803 | blkdev_put_no_open(bdev); | |
faffaab2 | 804 | return -ENODEV; |
015d254c TH |
805 | } |
806 | ||
a13bd91b YK |
807 | mutex_lock(&bdev->bd_queue->rq_qos_mutex); |
808 | if (!disk_live(bdev->bd_disk)) { | |
809 | blkdev_put_no_open(bdev); | |
810 | mutex_unlock(&bdev->bd_queue->rq_qos_mutex); | |
811 | return -ENODEV; | |
812 | } | |
813 | ||
faffaab2 TH |
814 | ctx->body = input; |
815 | ctx->bdev = bdev; | |
816 | return 0; | |
015d254c TH |
817 | } |
818 | ||
3a8b31d3 TH |
819 | /** |
820 | * blkg_conf_prep - parse and prepare for per-blkg config update | |
821 | * @blkcg: target block cgroup | |
da8b0662 | 822 | * @pol: target policy |
faffaab2 TH |
823 | * @ctx: blkg_conf_ctx initialized with blkg_conf_init() |
824 | * | |
825 | * Parse per-blkg config update from @ctx->input and initialize @ctx | |
826 | * accordingly. On success, @ctx->body points to the part of @ctx->input | |
827 | * following MAJ:MIN, @ctx->bdev points to the target block device and | |
828 | * @ctx->blkg to the blkg being configured. | |
3a8b31d3 | 829 | * |
faffaab2 TH |
830 | * blkg_conf_open_bdev() may be called on @ctx beforehand. On success, this |
831 | * function returns with queue lock held and must be followed by | |
832 | * blkg_conf_exit(). | |
3a8b31d3 | 833 | */ |
3c798398 | 834 | int blkg_conf_prep(struct blkcg *blkcg, const struct blkcg_policy *pol, |
faffaab2 | 835 | struct blkg_conf_ctx *ctx) |
83462a6c | 836 | __acquires(&bdev->bd_queue->queue_lock) |
34d0f179 | 837 | { |
99e60387 | 838 | struct gendisk *disk; |
457e490f | 839 | struct request_queue *q; |
3c798398 | 840 | struct blkcg_gq *blkg; |
015d254c | 841 | int ret; |
36aa9e5f | 842 | |
faffaab2 TH |
843 | ret = blkg_conf_open_bdev(ctx); |
844 | if (ret) | |
845 | return ret; | |
846 | ||
847 | disk = ctx->bdev->bd_disk; | |
99e60387 | 848 | q = disk->queue; |
da8b0662 | 849 | |
0c9d338c YK |
850 | /* |
851 | * blkcg_deactivate_policy() requires queue to be frozen, we can grab | |
852 | * q_usage_counter to prevent concurrent with blkcg_deactivate_policy(). | |
853 | */ | |
854 | ret = blk_queue_enter(q, 0); | |
855 | if (ret) | |
15c30104 | 856 | goto fail; |
0c9d338c | 857 | |
0d945c1f | 858 | spin_lock_irq(&q->queue_lock); |
e56da7e2 | 859 | |
f753526e CH |
860 | if (!blkcg_policy_enabled(q, pol)) { |
861 | ret = -EOPNOTSUPP; | |
457e490f TE |
862 | goto fail_unlock; |
863 | } | |
864 | ||
f753526e | 865 | blkg = blkg_lookup(blkcg, q); |
5765033c | 866 | if (blkg) |
457e490f TE |
867 | goto success; |
868 | ||
869 | /* | |
870 | * Create blkgs walking down from blkcg_root to @blkcg, so that all | |
871 | * non-root blkgs have access to their parents. | |
872 | */ | |
873 | while (true) { | |
874 | struct blkcg *pos = blkcg; | |
875 | struct blkcg *parent; | |
876 | struct blkcg_gq *new_blkg; | |
877 | ||
878 | parent = blkcg_parent(blkcg); | |
79fcc5be | 879 | while (parent && !blkg_lookup(parent, q)) { |
457e490f TE |
880 | pos = parent; |
881 | parent = blkcg_parent(parent); | |
882 | } | |
883 | ||
884 | /* Drop locks to do new blkg allocation with GFP_KERNEL. */ | |
0d945c1f | 885 | spin_unlock_irq(&q->queue_lock); |
457e490f | 886 | |
99e60387 | 887 | new_blkg = blkg_alloc(pos, disk, GFP_KERNEL); |
457e490f TE |
888 | if (unlikely(!new_blkg)) { |
889 | ret = -ENOMEM; | |
15c30104 | 890 | goto fail_exit_queue; |
7702e8f4 | 891 | } |
3a8b31d3 | 892 | |
f255c19b GKB |
893 | if (radix_tree_preload(GFP_KERNEL)) { |
894 | blkg_free(new_blkg); | |
895 | ret = -ENOMEM; | |
15c30104 | 896 | goto fail_exit_queue; |
f255c19b GKB |
897 | } |
898 | ||
0d945c1f | 899 | spin_lock_irq(&q->queue_lock); |
457e490f | 900 | |
f753526e | 901 | if (!blkcg_policy_enabled(q, pol)) { |
52abfcbd | 902 | blkg_free(new_blkg); |
f753526e | 903 | ret = -EOPNOTSUPP; |
f255c19b | 904 | goto fail_preloaded; |
457e490f TE |
905 | } |
906 | ||
f753526e | 907 | blkg = blkg_lookup(pos, q); |
457e490f TE |
908 | if (blkg) { |
909 | blkg_free(new_blkg); | |
910 | } else { | |
99e60387 | 911 | blkg = blkg_create(pos, disk, new_blkg); |
98d669b4 | 912 | if (IS_ERR(blkg)) { |
457e490f | 913 | ret = PTR_ERR(blkg); |
f255c19b | 914 | goto fail_preloaded; |
457e490f TE |
915 | } |
916 | } | |
917 | ||
f255c19b GKB |
918 | radix_tree_preload_end(); |
919 | ||
457e490f TE |
920 | if (pos == blkcg) |
921 | goto success; | |
922 | } | |
923 | success: | |
0c9d338c | 924 | blk_queue_exit(q); |
3a8b31d3 | 925 | ctx->blkg = blkg; |
726fa694 | 926 | return 0; |
457e490f | 927 | |
f255c19b GKB |
928 | fail_preloaded: |
929 | radix_tree_preload_end(); | |
457e490f | 930 | fail_unlock: |
0d945c1f | 931 | spin_unlock_irq(&q->queue_lock); |
15c30104 YK |
932 | fail_exit_queue: |
933 | blk_queue_exit(q); | |
457e490f | 934 | fail: |
457e490f TE |
935 | /* |
936 | * If queue was bypassing, we should retry. Do so after a | |
937 | * short msleep(). It isn't strictly necessary but queue | |
938 | * can be bypassing for some time and it's always nice to | |
939 | * avoid busy looping. | |
940 | */ | |
941 | if (ret == -EBUSY) { | |
942 | msleep(10); | |
943 | ret = restart_syscall(); | |
944 | } | |
945 | return ret; | |
34d0f179 | 946 | } |
89f3b6d6 | 947 | EXPORT_SYMBOL_GPL(blkg_conf_prep); |
34d0f179 | 948 | |
3a8b31d3 | 949 | /** |
faffaab2 TH |
950 | * blkg_conf_exit - clean up per-blkg config update |
951 | * @ctx: blkg_conf_ctx initialized with blkg_conf_init() | |
3a8b31d3 | 952 | * |
faffaab2 TH |
953 | * Clean up after per-blkg config update. This function must be called on all |
954 | * blkg_conf_ctx's initialized with blkg_conf_init(). | |
3a8b31d3 | 955 | */ |
faffaab2 | 956 | void blkg_conf_exit(struct blkg_conf_ctx *ctx) |
83462a6c | 957 | __releases(&ctx->bdev->bd_queue->queue_lock) |
a13bd91b | 958 | __releases(&ctx->bdev->bd_queue->rq_qos_mutex) |
34d0f179 | 959 | { |
faffaab2 TH |
960 | if (ctx->blkg) { |
961 | spin_unlock_irq(&bdev_get_queue(ctx->bdev)->queue_lock); | |
962 | ctx->blkg = NULL; | |
963 | } | |
964 | ||
965 | if (ctx->bdev) { | |
a13bd91b | 966 | mutex_unlock(&ctx->bdev->bd_queue->rq_qos_mutex); |
faffaab2 TH |
967 | blkdev_put_no_open(ctx->bdev); |
968 | ctx->body = NULL; | |
969 | ctx->bdev = NULL; | |
970 | } | |
34d0f179 | 971 | } |
faffaab2 | 972 | EXPORT_SYMBOL_GPL(blkg_conf_exit); |
34d0f179 | 973 | |
cd1fc4b9 BB |
974 | static void blkg_iostat_add(struct blkg_iostat *dst, struct blkg_iostat *src) |
975 | { | |
976 | int i; | |
977 | ||
978 | for (i = 0; i < BLKG_IOSTAT_NR; i++) { | |
979 | dst->bytes[i] += src->bytes[i]; | |
980 | dst->ios[i] += src->ios[i]; | |
981 | } | |
982 | } | |
983 | ||
984 | static void blkg_iostat_sub(struct blkg_iostat *dst, struct blkg_iostat *src) | |
985 | { | |
986 | int i; | |
987 | ||
988 | for (i = 0; i < BLKG_IOSTAT_NR; i++) { | |
989 | dst->bytes[i] -= src->bytes[i]; | |
990 | dst->ios[i] -= src->ios[i]; | |
991 | } | |
992 | } | |
993 | ||
362b8c16 JY |
994 | static void blkcg_iostat_update(struct blkcg_gq *blkg, struct blkg_iostat *cur, |
995 | struct blkg_iostat *last) | |
996 | { | |
997 | struct blkg_iostat delta; | |
998 | unsigned long flags; | |
999 | ||
1000 | /* propagate percpu delta to global */ | |
1001 | flags = u64_stats_update_begin_irqsave(&blkg->iostat.sync); | |
1002 | blkg_iostat_set(&delta, cur); | |
1003 | blkg_iostat_sub(&delta, last); | |
1004 | blkg_iostat_add(&blkg->iostat.cur, &delta); | |
1005 | blkg_iostat_add(last, &delta); | |
1006 | u64_stats_update_end_irqrestore(&blkg->iostat.sync, flags); | |
1007 | } | |
1008 | ||
20cb1c2f | 1009 | static void __blkcg_rstat_flush(struct blkcg *blkcg, int cpu) |
cd1fc4b9 | 1010 | { |
3b8cc629 WL |
1011 | struct llist_head *lhead = per_cpu_ptr(blkcg->lhead, cpu); |
1012 | struct llist_node *lnode; | |
1013 | struct blkg_iostat_set *bisc, *next_bisc; | |
9c39b7a9 | 1014 | unsigned long flags; |
cd1fc4b9 BB |
1015 | |
1016 | rcu_read_lock(); | |
1017 | ||
3b8cc629 WL |
1018 | lnode = llist_del_all(lhead); |
1019 | if (!lnode) | |
1020 | goto out; | |
1021 | ||
20cb1c2f ML |
1022 | /* |
1023 | * For covering concurrent parent blkg update from blkg_release(). | |
1024 | * | |
1025 | * When flushing from cgroup, cgroup_rstat_lock is always held, so | |
1026 | * this lock won't cause contention most of time. | |
1027 | */ | |
9c39b7a9 | 1028 | raw_spin_lock_irqsave(&blkg_stat_lock, flags); |
20cb1c2f | 1029 | |
3b8cc629 WL |
1030 | /* |
1031 | * Iterate only the iostat_cpu's queued in the lockless list. | |
1032 | */ | |
1033 | llist_for_each_entry_safe(bisc, next_bisc, lnode, lnode) { | |
1034 | struct blkcg_gq *blkg = bisc->blkg; | |
cd1fc4b9 | 1035 | struct blkcg_gq *parent = blkg->parent; |
362b8c16 | 1036 | struct blkg_iostat cur; |
cd1fc4b9 BB |
1037 | unsigned int seq; |
1038 | ||
d0aac236 ML |
1039 | /* |
1040 | * Order assignment of `next_bisc` from `bisc->lnode.next` in | |
1041 | * llist_for_each_entry_safe and clearing `bisc->lqueued` for | |
1042 | * avoiding to assign `next_bisc` with new next pointer added | |
1043 | * in blk_cgroup_bio_start() in case of re-ordering. | |
1044 | * | |
1045 | * The pair barrier is implied in llist_add() in blk_cgroup_bio_start(). | |
1046 | */ | |
1047 | smp_mb(); | |
1048 | ||
3b8cc629 | 1049 | WRITE_ONCE(bisc->lqueued, false); |
9d230c09 WL |
1050 | if (bisc == &blkg->iostat) |
1051 | goto propagate_up; /* propagate up to parent only */ | |
3b8cc629 | 1052 | |
cd1fc4b9 BB |
1053 | /* fetch the current per-cpu values */ |
1054 | do { | |
1055 | seq = u64_stats_fetch_begin(&bisc->sync); | |
1056 | blkg_iostat_set(&cur, &bisc->cur); | |
1057 | } while (u64_stats_fetch_retry(&bisc->sync, seq)); | |
1058 | ||
362b8c16 | 1059 | blkcg_iostat_update(blkg, &cur, &bisc->last); |
cd1fc4b9 | 1060 | |
9d230c09 | 1061 | propagate_up: |
dc26532a | 1062 | /* propagate global delta to parent (unless that's root) */ |
9d230c09 | 1063 | if (parent && parent->parent) { |
362b8c16 JY |
1064 | blkcg_iostat_update(parent, &blkg->iostat.cur, |
1065 | &blkg->iostat.last); | |
9d230c09 WL |
1066 | /* |
1067 | * Queue parent->iostat to its blkcg's lockless | |
1068 | * list to propagate up to the grandparent if the | |
1069 | * iostat hasn't been queued yet. | |
1070 | */ | |
1071 | if (!parent->iostat.lqueued) { | |
1072 | struct llist_head *plhead; | |
1073 | ||
1074 | plhead = per_cpu_ptr(parent->blkcg->lhead, cpu); | |
1075 | llist_add(&parent->iostat.lnode, plhead); | |
1076 | parent->iostat.lqueued = true; | |
1077 | } | |
1078 | } | |
cd1fc4b9 | 1079 | } |
9c39b7a9 | 1080 | raw_spin_unlock_irqrestore(&blkg_stat_lock, flags); |
3b8cc629 | 1081 | out: |
cd1fc4b9 BB |
1082 | rcu_read_unlock(); |
1083 | } | |
1084 | ||
20cb1c2f ML |
1085 | static void blkcg_rstat_flush(struct cgroup_subsys_state *css, int cpu) |
1086 | { | |
1087 | /* Root-level stats are sourced from system-wide IO stats */ | |
1088 | if (cgroup_parent(css->cgroup)) | |
1089 | __blkcg_rstat_flush(css_to_blkcg(css), cpu); | |
1090 | } | |
1091 | ||
ef45fe47 | 1092 | /* |
dc26532a JW |
1093 | * We source root cgroup stats from the system-wide stats to avoid |
1094 | * tracking the same information twice and incurring overhead when no | |
1095 | * cgroups are defined. For that reason, cgroup_rstat_flush in | |
1096 | * blkcg_print_stat does not actually fill out the iostat in the root | |
1097 | * cgroup's blkcg_gq. | |
ef45fe47 BB |
1098 | * |
1099 | * However, we would like to re-use the printing code between the root and | |
1100 | * non-root cgroups to the extent possible. For that reason, we simulate | |
1101 | * flushing the root cgroup's stats by explicitly filling in the iostat | |
1102 | * with disk level statistics. | |
1103 | */ | |
1104 | static void blkcg_fill_root_iostats(void) | |
1105 | { | |
1106 | struct class_dev_iter iter; | |
1107 | struct device *dev; | |
1108 | ||
1109 | class_dev_iter_init(&iter, &block_class, NULL, &disk_type); | |
1110 | while ((dev = class_dev_iter_next(&iter))) { | |
0d02129e | 1111 | struct block_device *bdev = dev_to_bdev(dev); |
928f6f00 | 1112 | struct blkcg_gq *blkg = bdev->bd_disk->queue->root_blkg; |
ef45fe47 BB |
1113 | struct blkg_iostat tmp; |
1114 | int cpu; | |
f122d103 | 1115 | unsigned long flags; |
ef45fe47 BB |
1116 | |
1117 | memset(&tmp, 0, sizeof(tmp)); | |
1118 | for_each_possible_cpu(cpu) { | |
1119 | struct disk_stats *cpu_dkstats; | |
1120 | ||
0d02129e | 1121 | cpu_dkstats = per_cpu_ptr(bdev->bd_stats, cpu); |
ef45fe47 BB |
1122 | tmp.ios[BLKG_IOSTAT_READ] += |
1123 | cpu_dkstats->ios[STAT_READ]; | |
1124 | tmp.ios[BLKG_IOSTAT_WRITE] += | |
1125 | cpu_dkstats->ios[STAT_WRITE]; | |
1126 | tmp.ios[BLKG_IOSTAT_DISCARD] += | |
1127 | cpu_dkstats->ios[STAT_DISCARD]; | |
1128 | // convert sectors to bytes | |
1129 | tmp.bytes[BLKG_IOSTAT_READ] += | |
1130 | cpu_dkstats->sectors[STAT_READ] << 9; | |
1131 | tmp.bytes[BLKG_IOSTAT_WRITE] += | |
1132 | cpu_dkstats->sectors[STAT_WRITE] << 9; | |
1133 | tmp.bytes[BLKG_IOSTAT_DISCARD] += | |
1134 | cpu_dkstats->sectors[STAT_DISCARD] << 9; | |
ef45fe47 | 1135 | } |
f122d103 CZ |
1136 | |
1137 | flags = u64_stats_update_begin_irqsave(&blkg->iostat.sync); | |
1138 | blkg_iostat_set(&blkg->iostat.cur, &tmp); | |
1139 | u64_stats_update_end_irqrestore(&blkg->iostat.sync, flags); | |
ef45fe47 BB |
1140 | } |
1141 | } | |
1142 | ||
49cb5168 | 1143 | static void blkcg_print_one_stat(struct blkcg_gq *blkg, struct seq_file *s) |
2ee867dc | 1144 | { |
49cb5168 CH |
1145 | struct blkg_iostat_set *bis = &blkg->iostat; |
1146 | u64 rbytes, wbytes, rios, wios, dbytes, dios; | |
49cb5168 CH |
1147 | const char *dname; |
1148 | unsigned seq; | |
49cb5168 | 1149 | int i; |
ef45fe47 | 1150 | |
49cb5168 CH |
1151 | if (!blkg->online) |
1152 | return; | |
2ee867dc | 1153 | |
49cb5168 CH |
1154 | dname = blkg_dev_name(blkg); |
1155 | if (!dname) | |
1156 | return; | |
2ee867dc | 1157 | |
252c651a | 1158 | seq_printf(s, "%s ", dname); |
b0814361 | 1159 | |
49cb5168 CH |
1160 | do { |
1161 | seq = u64_stats_fetch_begin(&bis->sync); | |
b0814361 | 1162 | |
49cb5168 CH |
1163 | rbytes = bis->cur.bytes[BLKG_IOSTAT_READ]; |
1164 | wbytes = bis->cur.bytes[BLKG_IOSTAT_WRITE]; | |
1165 | dbytes = bis->cur.bytes[BLKG_IOSTAT_DISCARD]; | |
1166 | rios = bis->cur.ios[BLKG_IOSTAT_READ]; | |
1167 | wios = bis->cur.ios[BLKG_IOSTAT_WRITE]; | |
1168 | dios = bis->cur.ios[BLKG_IOSTAT_DISCARD]; | |
1169 | } while (u64_stats_fetch_retry(&bis->sync, seq)); | |
2ee867dc | 1170 | |
49cb5168 | 1171 | if (rbytes || wbytes || rios || wios) { |
252c651a | 1172 | seq_printf(s, "rbytes=%llu wbytes=%llu rios=%llu wios=%llu dbytes=%llu dios=%llu", |
49cb5168 CH |
1173 | rbytes, wbytes, rios, wios, |
1174 | dbytes, dios); | |
1175 | } | |
903d23f0 | 1176 | |
49cb5168 | 1177 | if (blkcg_debug_stats && atomic_read(&blkg->use_delay)) { |
252c651a | 1178 | seq_printf(s, " use_delay=%d delay_nsec=%llu", |
49cb5168 CH |
1179 | atomic_read(&blkg->use_delay), |
1180 | atomic64_read(&blkg->delay_nsec)); | |
1181 | } | |
2ee867dc | 1182 | |
49cb5168 CH |
1183 | for (i = 0; i < BLKCG_MAX_POLS; i++) { |
1184 | struct blkcg_policy *pol = blkcg_policy[i]; | |
2ee867dc | 1185 | |
49cb5168 CH |
1186 | if (!blkg->pd[i] || !pol->pd_stat_fn) |
1187 | continue; | |
903d23f0 | 1188 | |
3607849d | 1189 | pol->pd_stat_fn(blkg->pd[i], s); |
49cb5168 | 1190 | } |
d09d8df3 | 1191 | |
3607849d | 1192 | seq_puts(s, "\n"); |
49cb5168 | 1193 | } |
903d23f0 | 1194 | |
49cb5168 CH |
1195 | static int blkcg_print_stat(struct seq_file *sf, void *v) |
1196 | { | |
1197 | struct blkcg *blkcg = css_to_blkcg(seq_css(sf)); | |
1198 | struct blkcg_gq *blkg; | |
903d23f0 | 1199 | |
49cb5168 CH |
1200 | if (!seq_css(sf)->parent) |
1201 | blkcg_fill_root_iostats(); | |
1202 | else | |
1203 | cgroup_rstat_flush(blkcg->css.cgroup); | |
07b0fdec | 1204 | |
49cb5168 CH |
1205 | rcu_read_lock(); |
1206 | hlist_for_each_entry_rcu(blkg, &blkcg->blkg_list, blkcg_node) { | |
1207 | spin_lock_irq(&blkg->q->queue_lock); | |
1208 | blkcg_print_one_stat(blkg, sf); | |
b0814361 | 1209 | spin_unlock_irq(&blkg->q->queue_lock); |
2ee867dc | 1210 | } |
2ee867dc TH |
1211 | rcu_read_unlock(); |
1212 | return 0; | |
1213 | } | |
1214 | ||
e1f3b941 | 1215 | static struct cftype blkcg_files[] = { |
2ee867dc TH |
1216 | { |
1217 | .name = "stat", | |
1218 | .seq_show = blkcg_print_stat, | |
1219 | }, | |
1220 | { } /* terminate */ | |
1221 | }; | |
1222 | ||
e1f3b941 | 1223 | static struct cftype blkcg_legacy_files[] = { |
84c124da DS |
1224 | { |
1225 | .name = "reset_stats", | |
3c798398 | 1226 | .write_u64 = blkcg_reset_stats, |
22084190 | 1227 | }, |
4baf6e33 | 1228 | { } /* terminate */ |
31e4c28d VG |
1229 | }; |
1230 | ||
dec223c9 CH |
1231 | #ifdef CONFIG_CGROUP_WRITEBACK |
1232 | struct list_head *blkcg_get_cgwb_list(struct cgroup_subsys_state *css) | |
1233 | { | |
1234 | return &css_to_blkcg(css)->cgwb_list; | |
1235 | } | |
1236 | #endif | |
1237 | ||
59b57717 DZF |
1238 | /* |
1239 | * blkcg destruction is a three-stage process. | |
1240 | * | |
1241 | * 1. Destruction starts. The blkcg_css_offline() callback is invoked | |
1242 | * which offlines writeback. Here we tie the next stage of blkg destruction | |
1243 | * to the completion of writeback associated with the blkcg. This lets us | |
1244 | * avoid punting potentially large amounts of outstanding writeback to root | |
1245 | * while maintaining any ongoing policies. The next stage is triggered when | |
1246 | * the nr_cgwbs count goes to zero. | |
1247 | * | |
1248 | * 2. When the nr_cgwbs count goes to zero, blkcg_destroy_blkgs() is called | |
1249 | * and handles the destruction of blkgs. Here the css reference held by | |
1250 | * the blkg is put back eventually allowing blkcg_css_free() to be called. | |
1251 | * This work may occur in cgwb_release_workfn() on the cgwb_release | |
1252 | * workqueue. Any submitted ios that fail to get the blkg ref will be | |
1253 | * punted to the root_blkg. | |
1254 | * | |
1255 | * 3. Once the blkcg ref count goes to zero, blkcg_css_free() is called. | |
1256 | * This finally frees the blkcg. | |
1257 | */ | |
1258 | ||
59b57717 DZF |
1259 | /** |
1260 | * blkcg_destroy_blkgs - responsible for shooting down blkgs | |
1261 | * @blkcg: blkcg of interest | |
1262 | * | |
1263 | * blkgs should be removed while holding both q and blkcg locks. As blkcg lock | |
1264 | * is nested inside q lock, this function performs reverse double lock dancing. | |
1265 | * Destroying the blkgs releases the reference held on the blkcg's css allowing | |
1266 | * blkcg_css_free to eventually be called. | |
1267 | * | |
1268 | * This is the blkcg counterpart of ioc_release_fn(). | |
1269 | */ | |
397c9f46 | 1270 | static void blkcg_destroy_blkgs(struct blkcg *blkcg) |
59b57717 | 1271 | { |
6c635cae BW |
1272 | might_sleep(); |
1273 | ||
9f13ef67 | 1274 | spin_lock_irq(&blkcg->lock); |
7ee9c562 | 1275 | |
4c699480 JQ |
1276 | while (!hlist_empty(&blkcg->blkg_list)) { |
1277 | struct blkcg_gq *blkg = hlist_entry(blkcg->blkg_list.first, | |
6b065462 | 1278 | struct blkcg_gq, blkcg_node); |
4c699480 JQ |
1279 | struct request_queue *q = blkg->q; |
1280 | ||
6c635cae BW |
1281 | if (need_resched() || !spin_trylock(&q->queue_lock)) { |
1282 | /* | |
1283 | * Given that the system can accumulate a huge number | |
1284 | * of blkgs in pathological cases, check to see if we | |
1285 | * need to rescheduling to avoid softlockup. | |
1286 | */ | |
4c699480 | 1287 | spin_unlock_irq(&blkcg->lock); |
6c635cae | 1288 | cond_resched(); |
4c699480 | 1289 | spin_lock_irq(&blkcg->lock); |
6c635cae | 1290 | continue; |
4c699480 | 1291 | } |
6c635cae BW |
1292 | |
1293 | blkg_destroy(blkg); | |
1294 | spin_unlock(&q->queue_lock); | |
4c699480 | 1295 | } |
6b065462 | 1296 | |
4c699480 JQ |
1297 | spin_unlock_irq(&blkcg->lock); |
1298 | } | |
1299 | ||
397c9f46 CH |
1300 | /** |
1301 | * blkcg_pin_online - pin online state | |
1302 | * @blkcg_css: blkcg of interest | |
1303 | * | |
1304 | * While pinned, a blkcg is kept online. This is primarily used to | |
1305 | * impedance-match blkg and cgwb lifetimes so that blkg doesn't go offline | |
1306 | * while an associated cgwb is still active. | |
1307 | */ | |
1308 | void blkcg_pin_online(struct cgroup_subsys_state *blkcg_css) | |
1309 | { | |
1310 | refcount_inc(&css_to_blkcg(blkcg_css)->online_pin); | |
1311 | } | |
1312 | ||
1313 | /** | |
1314 | * blkcg_unpin_online - unpin online state | |
1315 | * @blkcg_css: blkcg of interest | |
1316 | * | |
1317 | * This is primarily used to impedance-match blkg and cgwb lifetimes so | |
1318 | * that blkg doesn't go offline while an associated cgwb is still active. | |
1319 | * When this count goes to zero, all active cgwbs have finished so the | |
1320 | * blkcg can continue destruction by calling blkcg_destroy_blkgs(). | |
1321 | */ | |
1322 | void blkcg_unpin_online(struct cgroup_subsys_state *blkcg_css) | |
1323 | { | |
1324 | struct blkcg *blkcg = css_to_blkcg(blkcg_css); | |
1325 | ||
1326 | do { | |
1327 | if (!refcount_dec_and_test(&blkcg->online_pin)) | |
1328 | break; | |
1329 | blkcg_destroy_blkgs(blkcg); | |
1330 | blkcg = blkcg_parent(blkcg); | |
1331 | } while (blkcg); | |
1332 | } | |
1333 | ||
1334 | /** | |
1335 | * blkcg_css_offline - cgroup css_offline callback | |
1336 | * @css: css of interest | |
1337 | * | |
1338 | * This function is called when @css is about to go away. Here the cgwbs are | |
1339 | * offlined first and only once writeback associated with the blkcg has | |
1340 | * finished do we start step 2 (see above). | |
1341 | */ | |
1342 | static void blkcg_css_offline(struct cgroup_subsys_state *css) | |
1343 | { | |
1344 | /* this prevents anyone from attaching or migrating to this blkcg */ | |
dec223c9 | 1345 | wb_blkcg_offline(css); |
397c9f46 CH |
1346 | |
1347 | /* put the base online pin allowing step 2 to be triggered */ | |
1348 | blkcg_unpin_online(css); | |
1349 | } | |
1350 | ||
eb95419b | 1351 | static void blkcg_css_free(struct cgroup_subsys_state *css) |
7ee9c562 | 1352 | { |
eb95419b | 1353 | struct blkcg *blkcg = css_to_blkcg(css); |
bc915e61 | 1354 | int i; |
7ee9c562 | 1355 | |
7876f930 | 1356 | mutex_lock(&blkcg_pol_mutex); |
e4a9bde9 | 1357 | |
7876f930 | 1358 | list_del(&blkcg->all_blkcgs_node); |
7876f930 | 1359 | |
bc915e61 | 1360 | for (i = 0; i < BLKCG_MAX_POLS; i++) |
e4a9bde9 TH |
1361 | if (blkcg->cpd[i]) |
1362 | blkcg_policy[i]->cpd_free_fn(blkcg->cpd[i]); | |
1363 | ||
1364 | mutex_unlock(&blkcg_pol_mutex); | |
1365 | ||
3b8cc629 | 1366 | free_percpu(blkcg->lhead); |
bc915e61 | 1367 | kfree(blkcg); |
31e4c28d VG |
1368 | } |
1369 | ||
eb95419b TH |
1370 | static struct cgroup_subsys_state * |
1371 | blkcg_css_alloc(struct cgroup_subsys_state *parent_css) | |
31e4c28d | 1372 | { |
3c798398 | 1373 | struct blkcg *blkcg; |
e48453c3 | 1374 | int i; |
31e4c28d | 1375 | |
7876f930 TH |
1376 | mutex_lock(&blkcg_pol_mutex); |
1377 | ||
eb95419b | 1378 | if (!parent_css) { |
3c798398 | 1379 | blkcg = &blkcg_root; |
bc915e61 TH |
1380 | } else { |
1381 | blkcg = kzalloc(sizeof(*blkcg), GFP_KERNEL); | |
b5a9adcb | 1382 | if (!blkcg) |
4c18c9e9 | 1383 | goto unlock; |
e48453c3 AA |
1384 | } |
1385 | ||
3b8cc629 WL |
1386 | if (init_blkcg_llists(blkcg)) |
1387 | goto free_blkcg; | |
1388 | ||
e48453c3 AA |
1389 | for (i = 0; i < BLKCG_MAX_POLS ; i++) { |
1390 | struct blkcg_policy *pol = blkcg_policy[i]; | |
1391 | struct blkcg_policy_data *cpd; | |
1392 | ||
1393 | /* | |
1394 | * If the policy hasn't been attached yet, wait for it | |
1395 | * to be attached before doing anything else. Otherwise, | |
1396 | * check if the policy requires any specific per-cgroup | |
1397 | * data: if it does, allocate and initialize it. | |
1398 | */ | |
e4a9bde9 | 1399 | if (!pol || !pol->cpd_alloc_fn) |
e48453c3 AA |
1400 | continue; |
1401 | ||
e4a9bde9 | 1402 | cpd = pol->cpd_alloc_fn(GFP_KERNEL); |
b5a9adcb | 1403 | if (!cpd) |
e48453c3 | 1404 | goto free_pd_blkcg; |
b5a9adcb | 1405 | |
81437648 TH |
1406 | blkcg->cpd[i] = cpd; |
1407 | cpd->blkcg = blkcg; | |
e48453c3 | 1408 | cpd->plid = i; |
e48453c3 | 1409 | } |
31e4c28d | 1410 | |
31e4c28d | 1411 | spin_lock_init(&blkcg->lock); |
d866dbf6 | 1412 | refcount_set(&blkcg->online_pin, 1); |
e00f4f4d | 1413 | INIT_RADIX_TREE(&blkcg->blkg_tree, GFP_NOWAIT | __GFP_NOWARN); |
31e4c28d | 1414 | INIT_HLIST_HEAD(&blkcg->blkg_list); |
52ebea74 TH |
1415 | #ifdef CONFIG_CGROUP_WRITEBACK |
1416 | INIT_LIST_HEAD(&blkcg->cgwb_list); | |
1417 | #endif | |
7876f930 TH |
1418 | list_add_tail(&blkcg->all_blkcgs_node, &all_blkcgs); |
1419 | ||
1420 | mutex_unlock(&blkcg_pol_mutex); | |
31e4c28d | 1421 | return &blkcg->css; |
e48453c3 AA |
1422 | |
1423 | free_pd_blkcg: | |
1424 | for (i--; i >= 0; i--) | |
e4a9bde9 TH |
1425 | if (blkcg->cpd[i]) |
1426 | blkcg_policy[i]->cpd_free_fn(blkcg->cpd[i]); | |
3b8cc629 WL |
1427 | free_percpu(blkcg->lhead); |
1428 | free_blkcg: | |
4c18c9e9 | 1429 | if (blkcg != &blkcg_root) |
1430 | kfree(blkcg); | |
1431 | unlock: | |
7876f930 | 1432 | mutex_unlock(&blkcg_pol_mutex); |
b5a9adcb | 1433 | return ERR_PTR(-ENOMEM); |
31e4c28d VG |
1434 | } |
1435 | ||
4308a434 TH |
1436 | static int blkcg_css_online(struct cgroup_subsys_state *css) |
1437 | { | |
397c9f46 | 1438 | struct blkcg *parent = blkcg_parent(css_to_blkcg(css)); |
4308a434 TH |
1439 | |
1440 | /* | |
1441 | * blkcg_pin_online() is used to delay blkcg offline so that blkgs | |
1442 | * don't go offline while cgwbs are still active on them. Pin the | |
1443 | * parent so that offline always happens towards the root. | |
1444 | */ | |
1445 | if (parent) | |
d7dbd43f | 1446 | blkcg_pin_online(&parent->css); |
4308a434 TH |
1447 | return 0; |
1448 | } | |
1449 | ||
8b8ace08 ML |
1450 | void blkg_init_queue(struct request_queue *q) |
1451 | { | |
1452 | INIT_LIST_HEAD(&q->blkg_list); | |
1453 | mutex_init(&q->blkcg_mutex); | |
1454 | } | |
1455 | ||
9823538f | 1456 | int blkcg_init_disk(struct gendisk *disk) |
5efd6113 | 1457 | { |
9823538f | 1458 | struct request_queue *q = disk->queue; |
d708f0d5 JA |
1459 | struct blkcg_gq *new_blkg, *blkg; |
1460 | bool preloaded; | |
ec13b1d6 | 1461 | |
99e60387 | 1462 | new_blkg = blkg_alloc(&blkcg_root, disk, GFP_KERNEL); |
d708f0d5 JA |
1463 | if (!new_blkg) |
1464 | return -ENOMEM; | |
1465 | ||
1466 | preloaded = !radix_tree_preload(GFP_KERNEL); | |
1467 | ||
bea54883 | 1468 | /* Make sure the root blkg exists. */ |
77c570a1 | 1469 | /* spin_lock_irq can serve as RCU read-side critical section. */ |
0d945c1f | 1470 | spin_lock_irq(&q->queue_lock); |
99e60387 | 1471 | blkg = blkg_create(&blkcg_root, disk, new_blkg); |
901932a3 JB |
1472 | if (IS_ERR(blkg)) |
1473 | goto err_unlock; | |
1474 | q->root_blkg = blkg; | |
0d945c1f | 1475 | spin_unlock_irq(&q->queue_lock); |
ec13b1d6 | 1476 | |
d708f0d5 JA |
1477 | if (preloaded) |
1478 | radix_tree_preload_end(); | |
1479 | ||
04be60b5 | 1480 | return 0; |
901932a3 JB |
1481 | |
1482 | err_unlock: | |
0d945c1f | 1483 | spin_unlock_irq(&q->queue_lock); |
901932a3 JB |
1484 | if (preloaded) |
1485 | radix_tree_preload_end(); | |
1486 | return PTR_ERR(blkg); | |
5efd6113 TH |
1487 | } |
1488 | ||
9823538f | 1489 | void blkcg_exit_disk(struct gendisk *disk) |
5efd6113 | 1490 | { |
00ad6991 | 1491 | blkg_destroy_all(disk); |
e13793ba | 1492 | blk_throtl_exit(disk); |
5efd6113 TH |
1493 | } |
1494 | ||
d09d8df3 JB |
1495 | static void blkcg_exit(struct task_struct *tsk) |
1496 | { | |
f05837ed CH |
1497 | if (tsk->throttle_disk) |
1498 | put_disk(tsk->throttle_disk); | |
1499 | tsk->throttle_disk = NULL; | |
d09d8df3 JB |
1500 | } |
1501 | ||
c165b3e3 | 1502 | struct cgroup_subsys io_cgrp_subsys = { |
92fb9748 | 1503 | .css_alloc = blkcg_css_alloc, |
4308a434 | 1504 | .css_online = blkcg_css_online, |
92fb9748 TH |
1505 | .css_offline = blkcg_css_offline, |
1506 | .css_free = blkcg_css_free, | |
f7331648 | 1507 | .css_rstat_flush = blkcg_rstat_flush, |
2ee867dc | 1508 | .dfl_cftypes = blkcg_files, |
880f50e2 | 1509 | .legacy_cftypes = blkcg_legacy_files, |
c165b3e3 | 1510 | .legacy_name = "blkio", |
d09d8df3 | 1511 | .exit = blkcg_exit, |
1ced953b TH |
1512 | #ifdef CONFIG_MEMCG |
1513 | /* | |
1514 | * This ensures that, if available, memcg is automatically enabled | |
1515 | * together on the default hierarchy so that the owner cgroup can | |
1516 | * be retrieved from writeback pages. | |
1517 | */ | |
1518 | .depends_on = 1 << memory_cgrp_id, | |
1519 | #endif | |
676f7c8f | 1520 | }; |
c165b3e3 | 1521 | EXPORT_SYMBOL_GPL(io_cgrp_subsys); |
676f7c8f | 1522 | |
a2b1693b | 1523 | /** |
40e4996e CH |
1524 | * blkcg_activate_policy - activate a blkcg policy on a gendisk |
1525 | * @disk: gendisk of interest | |
a2b1693b TH |
1526 | * @pol: blkcg policy to activate |
1527 | * | |
40e4996e | 1528 | * Activate @pol on @disk. Requires %GFP_KERNEL context. @disk goes through |
a2b1693b TH |
1529 | * bypass mode to populate its blkgs with policy_data for @pol. |
1530 | * | |
40e4996e | 1531 | * Activation happens with @disk bypassed, so nobody would be accessing blkgs |
a2b1693b TH |
1532 | * from IO path. Update of each blkg is protected by both queue and blkcg |
1533 | * locks so that holding either lock and testing blkcg_policy_enabled() is | |
1534 | * always enough for dereferencing policy data. | |
1535 | * | |
1536 | * The caller is responsible for synchronizing [de]activations and policy | |
1537 | * [un]registerations. Returns 0 on success, -errno on failure. | |
1538 | */ | |
40e4996e | 1539 | int blkcg_activate_policy(struct gendisk *disk, const struct blkcg_policy *pol) |
a2b1693b | 1540 | { |
40e4996e | 1541 | struct request_queue *q = disk->queue; |
4c55f4f9 | 1542 | struct blkg_policy_data *pd_prealloc = NULL; |
9d179b86 | 1543 | struct blkcg_gq *blkg, *pinned_blkg = NULL; |
4c55f4f9 | 1544 | int ret; |
a2b1693b TH |
1545 | |
1546 | if (blkcg_policy_enabled(q, pol)) | |
1547 | return 0; | |
1548 | ||
ae8650b4 YK |
1549 | /* |
1550 | * Policy is allowed to be registered without pd_alloc_fn/pd_free_fn, | |
1551 | * for example, ioprio. Such policy will work on blkcg level, not disk | |
1552 | * level, and don't need to be activated. | |
1553 | */ | |
1554 | if (WARN_ON_ONCE(!pol->pd_alloc_fn || !pol->pd_free_fn)) | |
1555 | return -EINVAL; | |
1556 | ||
344e9ffc | 1557 | if (queue_is_mq(q)) |
bd166ef1 | 1558 | blk_mq_freeze_queue(q); |
9d179b86 | 1559 | retry: |
0d945c1f | 1560 | spin_lock_irq(&q->queue_lock); |
a2b1693b | 1561 | |
ec14a87e | 1562 | /* blkg_list is pushed at the head, reverse walk to initialize parents first */ |
71c81407 | 1563 | list_for_each_entry_reverse(blkg, &q->blkg_list, q_node) { |
4c55f4f9 TH |
1564 | struct blkg_policy_data *pd; |
1565 | ||
1566 | if (blkg->pd[pol->plid]) | |
1567 | continue; | |
a2b1693b | 1568 | |
9d179b86 TH |
1569 | /* If prealloc matches, use it; otherwise try GFP_NOWAIT */ |
1570 | if (blkg == pinned_blkg) { | |
1571 | pd = pd_prealloc; | |
1572 | pd_prealloc = NULL; | |
1573 | } else { | |
0a0b4f79 CH |
1574 | pd = pol->pd_alloc_fn(disk, blkg->blkcg, |
1575 | GFP_NOWAIT | __GFP_NOWARN); | |
9d179b86 TH |
1576 | } |
1577 | ||
4c55f4f9 | 1578 | if (!pd) { |
9d179b86 TH |
1579 | /* |
1580 | * GFP_NOWAIT failed. Free the existing one and | |
1581 | * prealloc for @blkg w/ GFP_KERNEL. | |
1582 | */ | |
1583 | if (pinned_blkg) | |
1584 | blkg_put(pinned_blkg); | |
1585 | blkg_get(blkg); | |
1586 | pinned_blkg = blkg; | |
1587 | ||
0d945c1f | 1588 | spin_unlock_irq(&q->queue_lock); |
9d179b86 TH |
1589 | |
1590 | if (pd_prealloc) | |
1591 | pol->pd_free_fn(pd_prealloc); | |
0a0b4f79 CH |
1592 | pd_prealloc = pol->pd_alloc_fn(disk, blkg->blkcg, |
1593 | GFP_KERNEL); | |
9d179b86 TH |
1594 | if (pd_prealloc) |
1595 | goto retry; | |
1596 | else | |
1597 | goto enomem; | |
4c55f4f9 | 1598 | } |
a2b1693b | 1599 | |
ec14a87e TH |
1600 | spin_lock(&blkg->blkcg->lock); |
1601 | ||
a2b1693b | 1602 | pd->blkg = blkg; |
b276a876 | 1603 | pd->plid = pol->plid; |
ec14a87e | 1604 | blkg->pd[pol->plid] = pd; |
a2b1693b | 1605 | |
ec14a87e TH |
1606 | if (pol->pd_init_fn) |
1607 | pol->pd_init_fn(pd); | |
9d179b86 | 1608 | |
dfd6200a | 1609 | if (pol->pd_online_fn) |
ec14a87e TH |
1610 | pol->pd_online_fn(pd); |
1611 | pd->online = true; | |
1612 | ||
1613 | spin_unlock(&blkg->blkcg->lock); | |
dfd6200a | 1614 | } |
e3ff8887 | 1615 | |
a2b1693b TH |
1616 | __set_bit(pol->plid, q->blkcg_pols); |
1617 | ret = 0; | |
4c55f4f9 | 1618 | |
0d945c1f | 1619 | spin_unlock_irq(&q->queue_lock); |
9d179b86 | 1620 | out: |
344e9ffc | 1621 | if (queue_is_mq(q)) |
bd166ef1 | 1622 | blk_mq_unfreeze_queue(q); |
9d179b86 TH |
1623 | if (pinned_blkg) |
1624 | blkg_put(pinned_blkg); | |
001bea73 TH |
1625 | if (pd_prealloc) |
1626 | pol->pd_free_fn(pd_prealloc); | |
a2b1693b | 1627 | return ret; |
9d179b86 TH |
1628 | |
1629 | enomem: | |
ec14a87e | 1630 | /* alloc failed, take down everything */ |
9d179b86 TH |
1631 | spin_lock_irq(&q->queue_lock); |
1632 | list_for_each_entry(blkg, &q->blkg_list, q_node) { | |
858560b2 | 1633 | struct blkcg *blkcg = blkg->blkcg; |
ec14a87e | 1634 | struct blkg_policy_data *pd; |
858560b2 LJ |
1635 | |
1636 | spin_lock(&blkcg->lock); | |
ec14a87e TH |
1637 | pd = blkg->pd[pol->plid]; |
1638 | if (pd) { | |
1639 | if (pd->online && pol->pd_offline_fn) | |
1640 | pol->pd_offline_fn(pd); | |
1641 | pd->online = false; | |
1642 | pol->pd_free_fn(pd); | |
9d179b86 TH |
1643 | blkg->pd[pol->plid] = NULL; |
1644 | } | |
858560b2 | 1645 | spin_unlock(&blkcg->lock); |
9d179b86 TH |
1646 | } |
1647 | spin_unlock_irq(&q->queue_lock); | |
1648 | ret = -ENOMEM; | |
1649 | goto out; | |
a2b1693b TH |
1650 | } |
1651 | EXPORT_SYMBOL_GPL(blkcg_activate_policy); | |
1652 | ||
1653 | /** | |
40e4996e CH |
1654 | * blkcg_deactivate_policy - deactivate a blkcg policy on a gendisk |
1655 | * @disk: gendisk of interest | |
a2b1693b TH |
1656 | * @pol: blkcg policy to deactivate |
1657 | * | |
40e4996e | 1658 | * Deactivate @pol on @disk. Follows the same synchronization rules as |
a2b1693b TH |
1659 | * blkcg_activate_policy(). |
1660 | */ | |
40e4996e | 1661 | void blkcg_deactivate_policy(struct gendisk *disk, |
3c798398 | 1662 | const struct blkcg_policy *pol) |
a2b1693b | 1663 | { |
40e4996e | 1664 | struct request_queue *q = disk->queue; |
3c798398 | 1665 | struct blkcg_gq *blkg; |
a2b1693b TH |
1666 | |
1667 | if (!blkcg_policy_enabled(q, pol)) | |
1668 | return; | |
1669 | ||
344e9ffc | 1670 | if (queue_is_mq(q)) |
bd166ef1 | 1671 | blk_mq_freeze_queue(q); |
bd166ef1 | 1672 | |
1231039d | 1673 | mutex_lock(&q->blkcg_mutex); |
0d945c1f | 1674 | spin_lock_irq(&q->queue_lock); |
a2b1693b TH |
1675 | |
1676 | __clear_bit(pol->plid, q->blkcg_pols); | |
1677 | ||
1678 | list_for_each_entry(blkg, &q->blkg_list, q_node) { | |
858560b2 LJ |
1679 | struct blkcg *blkcg = blkg->blkcg; |
1680 | ||
1681 | spin_lock(&blkcg->lock); | |
001bea73 | 1682 | if (blkg->pd[pol->plid]) { |
dfd6200a | 1683 | if (blkg->pd[pol->plid]->online && pol->pd_offline_fn) |
a9520cd6 | 1684 | pol->pd_offline_fn(blkg->pd[pol->plid]); |
001bea73 TH |
1685 | pol->pd_free_fn(blkg->pd[pol->plid]); |
1686 | blkg->pd[pol->plid] = NULL; | |
1687 | } | |
858560b2 | 1688 | spin_unlock(&blkcg->lock); |
a2b1693b TH |
1689 | } |
1690 | ||
0d945c1f | 1691 | spin_unlock_irq(&q->queue_lock); |
1231039d | 1692 | mutex_unlock(&q->blkcg_mutex); |
bd166ef1 | 1693 | |
344e9ffc | 1694 | if (queue_is_mq(q)) |
bd166ef1 | 1695 | blk_mq_unfreeze_queue(q); |
a2b1693b TH |
1696 | } |
1697 | EXPORT_SYMBOL_GPL(blkcg_deactivate_policy); | |
1698 | ||
e55cf798 JY |
1699 | static void blkcg_free_all_cpd(struct blkcg_policy *pol) |
1700 | { | |
1701 | struct blkcg *blkcg; | |
1702 | ||
1703 | list_for_each_entry(blkcg, &all_blkcgs, all_blkcgs_node) { | |
1704 | if (blkcg->cpd[pol->plid]) { | |
1705 | pol->cpd_free_fn(blkcg->cpd[pol->plid]); | |
1706 | blkcg->cpd[pol->plid] = NULL; | |
1707 | } | |
1708 | } | |
1709 | } | |
1710 | ||
8bd435b3 | 1711 | /** |
3c798398 TH |
1712 | * blkcg_policy_register - register a blkcg policy |
1713 | * @pol: blkcg policy to register | |
8bd435b3 | 1714 | * |
3c798398 TH |
1715 | * Register @pol with blkcg core. Might sleep and @pol may be modified on |
1716 | * successful registration. Returns 0 on success and -errno on failure. | |
8bd435b3 | 1717 | */ |
d5bf0291 | 1718 | int blkcg_policy_register(struct blkcg_policy *pol) |
3e252066 | 1719 | { |
06b285bd | 1720 | struct blkcg *blkcg; |
8bd435b3 | 1721 | int i, ret; |
e8989fae | 1722 | |
838f13bf | 1723 | mutex_lock(&blkcg_pol_register_mutex); |
bc0d6501 TH |
1724 | mutex_lock(&blkcg_pol_mutex); |
1725 | ||
8bd435b3 TH |
1726 | /* find an empty slot */ |
1727 | ret = -ENOSPC; | |
1728 | for (i = 0; i < BLKCG_MAX_POLS; i++) | |
3c798398 | 1729 | if (!blkcg_policy[i]) |
8bd435b3 | 1730 | break; |
01c5f85a JA |
1731 | if (i >= BLKCG_MAX_POLS) { |
1732 | pr_warn("blkcg_policy_register: BLKCG_MAX_POLS too small\n"); | |
838f13bf | 1733 | goto err_unlock; |
01c5f85a | 1734 | } |
035d10b2 | 1735 | |
ae8650b4 YK |
1736 | /* |
1737 | * Make sure cpd/pd_alloc_fn and cpd/pd_free_fn in pairs, and policy | |
1738 | * without pd_alloc_fn/pd_free_fn can't be activated. | |
1739 | */ | |
e8401073 | 1740 | if ((!pol->cpd_alloc_fn ^ !pol->cpd_free_fn) || |
ae8650b4 | 1741 | (!pol->pd_alloc_fn ^ !pol->pd_free_fn)) |
e8401073 | 1742 | goto err_unlock; |
1743 | ||
06b285bd | 1744 | /* register @pol */ |
3c798398 | 1745 | pol->plid = i; |
06b285bd TH |
1746 | blkcg_policy[pol->plid] = pol; |
1747 | ||
1748 | /* allocate and install cpd's */ | |
e4a9bde9 | 1749 | if (pol->cpd_alloc_fn) { |
06b285bd TH |
1750 | list_for_each_entry(blkcg, &all_blkcgs, all_blkcgs_node) { |
1751 | struct blkcg_policy_data *cpd; | |
1752 | ||
e4a9bde9 | 1753 | cpd = pol->cpd_alloc_fn(GFP_KERNEL); |
bbb427e3 | 1754 | if (!cpd) |
06b285bd | 1755 | goto err_free_cpds; |
06b285bd | 1756 | |
81437648 TH |
1757 | blkcg->cpd[pol->plid] = cpd; |
1758 | cpd->blkcg = blkcg; | |
06b285bd | 1759 | cpd->plid = pol->plid; |
06b285bd TH |
1760 | } |
1761 | } | |
1762 | ||
838f13bf | 1763 | mutex_unlock(&blkcg_pol_mutex); |
8bd435b3 | 1764 | |
8bd435b3 | 1765 | /* everything is in place, add intf files for the new policy */ |
2ee867dc TH |
1766 | if (pol->dfl_cftypes) |
1767 | WARN_ON(cgroup_add_dfl_cftypes(&io_cgrp_subsys, | |
1768 | pol->dfl_cftypes)); | |
880f50e2 | 1769 | if (pol->legacy_cftypes) |
c165b3e3 | 1770 | WARN_ON(cgroup_add_legacy_cftypes(&io_cgrp_subsys, |
880f50e2 | 1771 | pol->legacy_cftypes)); |
838f13bf TH |
1772 | mutex_unlock(&blkcg_pol_register_mutex); |
1773 | return 0; | |
1774 | ||
06b285bd | 1775 | err_free_cpds: |
e55cf798 JY |
1776 | if (pol->cpd_free_fn) |
1777 | blkcg_free_all_cpd(pol); | |
1778 | ||
06b285bd | 1779 | blkcg_policy[pol->plid] = NULL; |
838f13bf | 1780 | err_unlock: |
bc0d6501 | 1781 | mutex_unlock(&blkcg_pol_mutex); |
838f13bf | 1782 | mutex_unlock(&blkcg_pol_register_mutex); |
8bd435b3 | 1783 | return ret; |
3e252066 | 1784 | } |
3c798398 | 1785 | EXPORT_SYMBOL_GPL(blkcg_policy_register); |
3e252066 | 1786 | |
8bd435b3 | 1787 | /** |
3c798398 TH |
1788 | * blkcg_policy_unregister - unregister a blkcg policy |
1789 | * @pol: blkcg policy to unregister | |
8bd435b3 | 1790 | * |
3c798398 | 1791 | * Undo blkcg_policy_register(@pol). Might sleep. |
8bd435b3 | 1792 | */ |
3c798398 | 1793 | void blkcg_policy_unregister(struct blkcg_policy *pol) |
3e252066 | 1794 | { |
838f13bf | 1795 | mutex_lock(&blkcg_pol_register_mutex); |
bc0d6501 | 1796 | |
3c798398 | 1797 | if (WARN_ON(blkcg_policy[pol->plid] != pol)) |
8bd435b3 TH |
1798 | goto out_unlock; |
1799 | ||
1800 | /* kill the intf files first */ | |
2ee867dc TH |
1801 | if (pol->dfl_cftypes) |
1802 | cgroup_rm_cftypes(pol->dfl_cftypes); | |
880f50e2 TH |
1803 | if (pol->legacy_cftypes) |
1804 | cgroup_rm_cftypes(pol->legacy_cftypes); | |
44ea53de | 1805 | |
06b285bd | 1806 | /* remove cpds and unregister */ |
838f13bf | 1807 | mutex_lock(&blkcg_pol_mutex); |
06b285bd | 1808 | |
e55cf798 JY |
1809 | if (pol->cpd_free_fn) |
1810 | blkcg_free_all_cpd(pol); | |
1811 | ||
3c798398 | 1812 | blkcg_policy[pol->plid] = NULL; |
06b285bd | 1813 | |
bc0d6501 | 1814 | mutex_unlock(&blkcg_pol_mutex); |
838f13bf TH |
1815 | out_unlock: |
1816 | mutex_unlock(&blkcg_pol_register_mutex); | |
3e252066 | 1817 | } |
3c798398 | 1818 | EXPORT_SYMBOL_GPL(blkcg_policy_unregister); |
903d23f0 | 1819 | |
d09d8df3 JB |
1820 | /* |
1821 | * Scale the accumulated delay based on how long it has been since we updated | |
1822 | * the delay. We only call this when we are adding delay, in case it's been a | |
1823 | * while since we added delay, and when we are checking to see if we need to | |
1824 | * delay a task, to account for any delays that may have occurred. | |
1825 | */ | |
1826 | static void blkcg_scale_delay(struct blkcg_gq *blkg, u64 now) | |
1827 | { | |
1828 | u64 old = atomic64_read(&blkg->delay_start); | |
1829 | ||
54c52e10 TH |
1830 | /* negative use_delay means no scaling, see blkcg_set_delay() */ |
1831 | if (atomic_read(&blkg->use_delay) < 0) | |
1832 | return; | |
1833 | ||
d09d8df3 JB |
1834 | /* |
1835 | * We only want to scale down every second. The idea here is that we | |
1836 | * want to delay people for min(delay_nsec, NSEC_PER_SEC) in a certain | |
1837 | * time window. We only want to throttle tasks for recent delay that | |
1838 | * has occurred, in 1 second time windows since that's the maximum | |
1839 | * things can be throttled. We save the current delay window in | |
1840 | * blkg->last_delay so we know what amount is still left to be charged | |
1841 | * to the blkg from this point onward. blkg->last_use keeps track of | |
1842 | * the use_delay counter. The idea is if we're unthrottling the blkg we | |
1843 | * are ok with whatever is happening now, and we can take away more of | |
1844 | * the accumulated delay as we've already throttled enough that | |
1845 | * everybody is happy with their IO latencies. | |
1846 | */ | |
1847 | if (time_before64(old + NSEC_PER_SEC, now) && | |
96388f57 | 1848 | atomic64_try_cmpxchg(&blkg->delay_start, &old, now)) { |
d09d8df3 JB |
1849 | u64 cur = atomic64_read(&blkg->delay_nsec); |
1850 | u64 sub = min_t(u64, blkg->last_delay, now - old); | |
1851 | int cur_use = atomic_read(&blkg->use_delay); | |
1852 | ||
1853 | /* | |
1854 | * We've been unthrottled, subtract a larger chunk of our | |
1855 | * accumulated delay. | |
1856 | */ | |
1857 | if (cur_use < blkg->last_use) | |
1858 | sub = max_t(u64, sub, blkg->last_delay >> 1); | |
1859 | ||
1860 | /* | |
1861 | * This shouldn't happen, but handle it anyway. Our delay_nsec | |
1862 | * should only ever be growing except here where we subtract out | |
1863 | * min(last_delay, 1 second), but lord knows bugs happen and I'd | |
1864 | * rather not end up with negative numbers. | |
1865 | */ | |
1866 | if (unlikely(cur < sub)) { | |
1867 | atomic64_set(&blkg->delay_nsec, 0); | |
1868 | blkg->last_delay = 0; | |
1869 | } else { | |
1870 | atomic64_sub(sub, &blkg->delay_nsec); | |
1871 | blkg->last_delay = cur - sub; | |
1872 | } | |
1873 | blkg->last_use = cur_use; | |
1874 | } | |
1875 | } | |
1876 | ||
1877 | /* | |
1878 | * This is called when we want to actually walk up the hierarchy and check to | |
1879 | * see if we need to throttle, and then actually throttle if there is some | |
1880 | * accumulated delay. This should only be called upon return to user space so | |
1881 | * we're not holding some lock that would induce a priority inversion. | |
1882 | */ | |
1883 | static void blkcg_maybe_throttle_blkg(struct blkcg_gq *blkg, bool use_memdelay) | |
1884 | { | |
fd112c74 | 1885 | unsigned long pflags; |
5160a5a5 | 1886 | bool clamp; |
08420cf7 | 1887 | u64 now = blk_time_get_ns(); |
d09d8df3 JB |
1888 | u64 exp; |
1889 | u64 delay_nsec = 0; | |
1890 | int tok; | |
1891 | ||
1892 | while (blkg->parent) { | |
5160a5a5 TH |
1893 | int use_delay = atomic_read(&blkg->use_delay); |
1894 | ||
1895 | if (use_delay) { | |
1896 | u64 this_delay; | |
1897 | ||
d09d8df3 | 1898 | blkcg_scale_delay(blkg, now); |
5160a5a5 TH |
1899 | this_delay = atomic64_read(&blkg->delay_nsec); |
1900 | if (this_delay > delay_nsec) { | |
1901 | delay_nsec = this_delay; | |
1902 | clamp = use_delay > 0; | |
1903 | } | |
d09d8df3 JB |
1904 | } |
1905 | blkg = blkg->parent; | |
1906 | } | |
1907 | ||
1908 | if (!delay_nsec) | |
1909 | return; | |
1910 | ||
1911 | /* | |
1912 | * Let's not sleep for all eternity if we've amassed a huge delay. | |
1913 | * Swapping or metadata IO can accumulate 10's of seconds worth of | |
1914 | * delay, and we want userspace to be able to do _something_ so cap the | |
5160a5a5 TH |
1915 | * delays at 0.25s. If there's 10's of seconds worth of delay then the |
1916 | * tasks will be delayed for 0.25 second for every syscall. If | |
1917 | * blkcg_set_delay() was used as indicated by negative use_delay, the | |
1918 | * caller is responsible for regulating the range. | |
d09d8df3 | 1919 | */ |
5160a5a5 TH |
1920 | if (clamp) |
1921 | delay_nsec = min_t(u64, delay_nsec, 250 * NSEC_PER_MSEC); | |
d09d8df3 | 1922 | |
fd112c74 JB |
1923 | if (use_memdelay) |
1924 | psi_memstall_enter(&pflags); | |
d09d8df3 JB |
1925 | |
1926 | exp = ktime_add_ns(now, delay_nsec); | |
1927 | tok = io_schedule_prepare(); | |
1928 | do { | |
1929 | __set_current_state(TASK_KILLABLE); | |
1930 | if (!schedule_hrtimeout(&exp, HRTIMER_MODE_ABS)) | |
1931 | break; | |
1932 | } while (!fatal_signal_pending(current)); | |
1933 | io_schedule_finish(tok); | |
fd112c74 JB |
1934 | |
1935 | if (use_memdelay) | |
1936 | psi_memstall_leave(&pflags); | |
d09d8df3 JB |
1937 | } |
1938 | ||
1939 | /** | |
1940 | * blkcg_maybe_throttle_current - throttle the current task if it has been marked | |
1941 | * | |
1942 | * This is only called if we've been marked with set_notify_resume(). Obviously | |
1943 | * we can be set_notify_resume() for reasons other than blkcg throttling, so we | |
f05837ed | 1944 | * check to see if current->throttle_disk is set and if not this doesn't do |
d09d8df3 JB |
1945 | * anything. This should only ever be called by the resume code, it's not meant |
1946 | * to be called by people willy-nilly as it will actually do the work to | |
1947 | * throttle the task if it is setup for throttling. | |
1948 | */ | |
1949 | void blkcg_maybe_throttle_current(void) | |
1950 | { | |
f05837ed | 1951 | struct gendisk *disk = current->throttle_disk; |
d09d8df3 JB |
1952 | struct blkcg *blkcg; |
1953 | struct blkcg_gq *blkg; | |
1954 | bool use_memdelay = current->use_memdelay; | |
1955 | ||
f05837ed | 1956 | if (!disk) |
d09d8df3 JB |
1957 | return; |
1958 | ||
f05837ed | 1959 | current->throttle_disk = NULL; |
d09d8df3 JB |
1960 | current->use_memdelay = false; |
1961 | ||
1962 | rcu_read_lock(); | |
82778259 | 1963 | blkcg = css_to_blkcg(blkcg_css()); |
d09d8df3 JB |
1964 | if (!blkcg) |
1965 | goto out; | |
9a9c261e | 1966 | blkg = blkg_lookup(blkcg, disk->queue); |
d09d8df3 JB |
1967 | if (!blkg) |
1968 | goto out; | |
7754f669 | 1969 | if (!blkg_tryget(blkg)) |
d09d8df3 JB |
1970 | goto out; |
1971 | rcu_read_unlock(); | |
d09d8df3 JB |
1972 | |
1973 | blkcg_maybe_throttle_blkg(blkg, use_memdelay); | |
1974 | blkg_put(blkg); | |
f05837ed | 1975 | put_disk(disk); |
d09d8df3 JB |
1976 | return; |
1977 | out: | |
1978 | rcu_read_unlock(); | |
d09d8df3 | 1979 | } |
d09d8df3 JB |
1980 | |
1981 | /** | |
1982 | * blkcg_schedule_throttle - this task needs to check for throttling | |
1d6df9d3 | 1983 | * @disk: disk to throttle |
537d71b3 | 1984 | * @use_memdelay: do we charge this to memory delay for PSI |
d09d8df3 JB |
1985 | * |
1986 | * This is called by the IO controller when we know there's delay accumulated | |
1987 | * for the blkg for this task. We do not pass the blkg because there are places | |
1988 | * we call this that may not have that information, the swapping code for | |
de185b56 | 1989 | * instance will only have a block_device at that point. This set's the |
d09d8df3 JB |
1990 | * notify_resume for the task to check and see if it requires throttling before |
1991 | * returning to user space. | |
1992 | * | |
1993 | * We will only schedule once per syscall. You can call this over and over | |
1994 | * again and it will only do the check once upon return to user space, and only | |
1995 | * throttle once. If the task needs to be throttled again it'll need to be | |
1996 | * re-set at the next time we see the task. | |
1997 | */ | |
de185b56 | 1998 | void blkcg_schedule_throttle(struct gendisk *disk, bool use_memdelay) |
d09d8df3 JB |
1999 | { |
2000 | if (unlikely(current->flags & PF_KTHREAD)) | |
2001 | return; | |
2002 | ||
f05837ed CH |
2003 | if (current->throttle_disk != disk) { |
2004 | if (test_bit(GD_DEAD, &disk->state)) | |
49d1822b | 2005 | return; |
f05837ed | 2006 | get_device(disk_to_dev(disk)); |
49d1822b | 2007 | |
f05837ed CH |
2008 | if (current->throttle_disk) |
2009 | put_disk(current->throttle_disk); | |
2010 | current->throttle_disk = disk; | |
49d1822b | 2011 | } |
d09d8df3 | 2012 | |
d09d8df3 JB |
2013 | if (use_memdelay) |
2014 | current->use_memdelay = use_memdelay; | |
2015 | set_notify_resume(current); | |
2016 | } | |
d09d8df3 JB |
2017 | |
2018 | /** | |
2019 | * blkcg_add_delay - add delay to this blkg | |
537d71b3 BVA |
2020 | * @blkg: blkg of interest |
2021 | * @now: the current time in nanoseconds | |
2022 | * @delta: how many nanoseconds of delay to add | |
d09d8df3 JB |
2023 | * |
2024 | * Charge @delta to the blkg's current delay accumulation. This is used to | |
2025 | * throttle tasks if an IO controller thinks we need more throttling. | |
2026 | */ | |
2027 | void blkcg_add_delay(struct blkcg_gq *blkg, u64 now, u64 delta) | |
2028 | { | |
54c52e10 TH |
2029 | if (WARN_ON_ONCE(atomic_read(&blkg->use_delay) < 0)) |
2030 | return; | |
d09d8df3 JB |
2031 | blkcg_scale_delay(blkg, now); |
2032 | atomic64_add(delta, &blkg->delay_nsec); | |
2033 | } | |
d09d8df3 | 2034 | |
28fc591f CH |
2035 | /** |
2036 | * blkg_tryget_closest - try and get a blkg ref on the closet blkg | |
13c7863d CH |
2037 | * @bio: target bio |
2038 | * @css: target css | |
28fc591f | 2039 | * |
13c7863d CH |
2040 | * As the failure mode here is to walk up the blkg tree, this ensure that the |
2041 | * blkg->parent pointers are always valid. This returns the blkg that it ended | |
2042 | * up taking a reference on or %NULL if no reference was taken. | |
28fc591f | 2043 | */ |
13c7863d CH |
2044 | static inline struct blkcg_gq *blkg_tryget_closest(struct bio *bio, |
2045 | struct cgroup_subsys_state *css) | |
28fc591f | 2046 | { |
13c7863d | 2047 | struct blkcg_gq *blkg, *ret_blkg = NULL; |
28fc591f | 2048 | |
13c7863d | 2049 | rcu_read_lock(); |
99e60387 | 2050 | blkg = blkg_lookup_create(css_to_blkcg(css), bio->bi_bdev->bd_disk); |
28fc591f CH |
2051 | while (blkg) { |
2052 | if (blkg_tryget(blkg)) { | |
2053 | ret_blkg = blkg; | |
2054 | break; | |
2055 | } | |
2056 | blkg = blkg->parent; | |
2057 | } | |
13c7863d | 2058 | rcu_read_unlock(); |
28fc591f CH |
2059 | |
2060 | return ret_blkg; | |
2061 | } | |
2062 | ||
2063 | /** | |
2064 | * bio_associate_blkg_from_css - associate a bio with a specified css | |
2065 | * @bio: target bio | |
2066 | * @css: target css | |
2067 | * | |
2068 | * Associate @bio with the blkg found by combining the css's blkg and the | |
2069 | * request_queue of the @bio. An association failure is handled by walking up | |
2070 | * the blkg tree. Therefore, the blkg associated can be anything between @blkg | |
2071 | * and q->root_blkg. This situation only happens when a cgroup is dying and | |
2072 | * then the remaining bios will spill to the closest alive blkg. | |
2073 | * | |
2074 | * A reference will be taken on the blkg and will be released when @bio is | |
2075 | * freed. | |
2076 | */ | |
2077 | void bio_associate_blkg_from_css(struct bio *bio, | |
2078 | struct cgroup_subsys_state *css) | |
2079 | { | |
28fc591f CH |
2080 | if (bio->bi_blkg) |
2081 | blkg_put(bio->bi_blkg); | |
2082 | ||
a5b97526 | 2083 | if (css && css->parent) { |
13c7863d | 2084 | bio->bi_blkg = blkg_tryget_closest(bio, css); |
a5b97526 | 2085 | } else { |
ed6cddef PB |
2086 | blkg_get(bdev_get_queue(bio->bi_bdev)->root_blkg); |
2087 | bio->bi_blkg = bdev_get_queue(bio->bi_bdev)->root_blkg; | |
a5b97526 | 2088 | } |
28fc591f CH |
2089 | } |
2090 | EXPORT_SYMBOL_GPL(bio_associate_blkg_from_css); | |
2091 | ||
2092 | /** | |
2093 | * bio_associate_blkg - associate a bio with a blkg | |
2094 | * @bio: target bio | |
2095 | * | |
2096 | * Associate @bio with the blkg found from the bio's css and request_queue. | |
2097 | * If one is not found, bio_lookup_blkg() creates the blkg. If a blkg is | |
2098 | * already associated, the css is reused and association redone as the | |
2099 | * request_queue may have changed. | |
2100 | */ | |
2101 | void bio_associate_blkg(struct bio *bio) | |
2102 | { | |
2103 | struct cgroup_subsys_state *css; | |
2104 | ||
6c9b9708 KK |
2105 | if (blk_op_is_passthrough(bio->bi_opf)) |
2106 | return; | |
2107 | ||
28fc591f CH |
2108 | rcu_read_lock(); |
2109 | ||
2110 | if (bio->bi_blkg) | |
bbb1ebe7 | 2111 | css = bio_blkcg_css(bio); |
28fc591f CH |
2112 | else |
2113 | css = blkcg_css(); | |
2114 | ||
2115 | bio_associate_blkg_from_css(bio, css); | |
2116 | ||
2117 | rcu_read_unlock(); | |
2118 | } | |
2119 | EXPORT_SYMBOL_GPL(bio_associate_blkg); | |
2120 | ||
2121 | /** | |
2122 | * bio_clone_blkg_association - clone blkg association from src to dst bio | |
2123 | * @dst: destination bio | |
2124 | * @src: source bio | |
2125 | */ | |
2126 | void bio_clone_blkg_association(struct bio *dst, struct bio *src) | |
2127 | { | |
22b106e5 JK |
2128 | if (src->bi_blkg) |
2129 | bio_associate_blkg_from_css(dst, bio_blkcg_css(src)); | |
28fc591f CH |
2130 | } |
2131 | EXPORT_SYMBOL_GPL(bio_clone_blkg_association); | |
2132 | ||
db18a53e CH |
2133 | static int blk_cgroup_io_type(struct bio *bio) |
2134 | { | |
2135 | if (op_is_discard(bio->bi_opf)) | |
2136 | return BLKG_IOSTAT_DISCARD; | |
2137 | if (op_is_write(bio->bi_opf)) | |
2138 | return BLKG_IOSTAT_WRITE; | |
2139 | return BLKG_IOSTAT_READ; | |
2140 | } | |
2141 | ||
2142 | void blk_cgroup_bio_start(struct bio *bio) | |
2143 | { | |
3b8cc629 | 2144 | struct blkcg *blkcg = bio->bi_blkg->blkcg; |
db18a53e CH |
2145 | int rwd = blk_cgroup_io_type(bio), cpu; |
2146 | struct blkg_iostat_set *bis; | |
3c08b093 | 2147 | unsigned long flags; |
db18a53e | 2148 | |
ad7c3b41 JH |
2149 | if (!cgroup_subsys_on_dfl(io_cgrp_subsys)) |
2150 | return; | |
2151 | ||
0416f3be ML |
2152 | /* Root-level stats are sourced from system-wide IO stats */ |
2153 | if (!cgroup_parent(blkcg->css.cgroup)) | |
2154 | return; | |
2155 | ||
db18a53e CH |
2156 | cpu = get_cpu(); |
2157 | bis = per_cpu_ptr(bio->bi_blkg->iostat_cpu, cpu); | |
3c08b093 | 2158 | flags = u64_stats_update_begin_irqsave(&bis->sync); |
db18a53e CH |
2159 | |
2160 | /* | |
2161 | * If the bio is flagged with BIO_CGROUP_ACCT it means this is a split | |
2162 | * bio and we would have already accounted for the size of the bio. | |
2163 | */ | |
2164 | if (!bio_flagged(bio, BIO_CGROUP_ACCT)) { | |
2165 | bio_set_flag(bio, BIO_CGROUP_ACCT); | |
0b8cc25d | 2166 | bis->cur.bytes[rwd] += bio->bi_iter.bi_size; |
db18a53e CH |
2167 | } |
2168 | bis->cur.ios[rwd]++; | |
2169 | ||
3b8cc629 WL |
2170 | /* |
2171 | * If the iostat_cpu isn't in a lockless list, put it into the | |
2172 | * list to indicate that a stat update is pending. | |
2173 | */ | |
2174 | if (!READ_ONCE(bis->lqueued)) { | |
2175 | struct llist_head *lhead = this_cpu_ptr(blkcg->lhead); | |
2176 | ||
2177 | llist_add(&bis->lnode, lhead); | |
2178 | WRITE_ONCE(bis->lqueued, true); | |
3b8cc629 WL |
2179 | } |
2180 | ||
3c08b093 | 2181 | u64_stats_update_end_irqrestore(&bis->sync, flags); |
ad7c3b41 | 2182 | cgroup_rstat_updated(blkcg->css.cgroup, cpu); |
db18a53e CH |
2183 | put_cpu(); |
2184 | } | |
2185 | ||
216889aa CH |
2186 | bool blk_cgroup_congested(void) |
2187 | { | |
89ed6c9a | 2188 | struct blkcg *blkcg; |
216889aa CH |
2189 | bool ret = false; |
2190 | ||
2191 | rcu_read_lock(); | |
89ed6c9a XJ |
2192 | for (blkcg = css_to_blkcg(blkcg_css()); blkcg; |
2193 | blkcg = blkcg_parent(blkcg)) { | |
2194 | if (atomic_read(&blkcg->congestion_count)) { | |
216889aa CH |
2195 | ret = true; |
2196 | break; | |
2197 | } | |
216889aa CH |
2198 | } |
2199 | rcu_read_unlock(); | |
2200 | return ret; | |
2201 | } | |
2202 | ||
903d23f0 JB |
2203 | module_param(blkcg_debug_stats, bool, 0644); |
2204 | MODULE_PARM_DESC(blkcg_debug_stats, "True if you want debug stats, false if not"); |