]>
Commit | Line | Data |
---|---|---|
31e4c28d VG |
1 | /* |
2 | * Common Block IO controller cgroup interface | |
3 | * | |
4 | * Based on ideas and code from CFQ, CFS and BFQ: | |
5 | * Copyright (C) 2003 Jens Axboe <axboe@kernel.dk> | |
6 | * | |
7 | * Copyright (C) 2008 Fabio Checconi <fabio@gandalf.sssup.it> | |
8 | * Paolo Valente <paolo.valente@unimore.it> | |
9 | * | |
10 | * Copyright (C) 2009 Vivek Goyal <vgoyal@redhat.com> | |
11 | * Nauman Rafique <nauman@google.com> | |
12 | */ | |
13 | #include <linux/ioprio.h> | |
22084190 | 14 | #include <linux/kdev_t.h> |
9d6a986c | 15 | #include <linux/module.h> |
accee785 | 16 | #include <linux/err.h> |
9195291e | 17 | #include <linux/blkdev.h> |
5a0e3ad6 | 18 | #include <linux/slab.h> |
34d0f179 | 19 | #include <linux/genhd.h> |
72e06c25 | 20 | #include <linux/delay.h> |
9a9e8a26 | 21 | #include <linux/atomic.h> |
72e06c25 | 22 | #include "blk-cgroup.h" |
5efd6113 | 23 | #include "blk.h" |
3e252066 | 24 | |
84c124da DS |
25 | #define MAX_KEY_LEN 100 |
26 | ||
bc0d6501 | 27 | static DEFINE_MUTEX(blkcg_pol_mutex); |
923adde1 | 28 | |
e71357e1 TH |
29 | struct blkcg blkcg_root = { .cfq_weight = 2 * CFQ_WEIGHT_DEFAULT, |
30 | .cfq_leaf_weight = 2 * CFQ_WEIGHT_DEFAULT, }; | |
3c798398 | 31 | EXPORT_SYMBOL_GPL(blkcg_root); |
9d6a986c | 32 | |
3c798398 | 33 | static struct blkcg_policy *blkcg_policy[BLKCG_MAX_POLS]; |
035d10b2 | 34 | |
a2b1693b | 35 | static bool blkcg_policy_enabled(struct request_queue *q, |
3c798398 | 36 | const struct blkcg_policy *pol) |
a2b1693b TH |
37 | { |
38 | return pol && test_bit(pol->plid, q->blkcg_pols); | |
39 | } | |
40 | ||
0381411e TH |
41 | /** |
42 | * blkg_free - free a blkg | |
43 | * @blkg: blkg to free | |
44 | * | |
45 | * Free @blkg which may be partially allocated. | |
46 | */ | |
3c798398 | 47 | static void blkg_free(struct blkcg_gq *blkg) |
0381411e | 48 | { |
e8989fae | 49 | int i; |
549d3aa8 TH |
50 | |
51 | if (!blkg) | |
52 | return; | |
53 | ||
8bd435b3 | 54 | for (i = 0; i < BLKCG_MAX_POLS; i++) { |
3c798398 | 55 | struct blkcg_policy *pol = blkcg_policy[i]; |
e8989fae TH |
56 | struct blkg_policy_data *pd = blkg->pd[i]; |
57 | ||
9ade5ea4 TH |
58 | if (!pd) |
59 | continue; | |
60 | ||
f9fcc2d3 TH |
61 | if (pol && pol->pd_exit_fn) |
62 | pol->pd_exit_fn(blkg); | |
9ade5ea4 | 63 | |
9ade5ea4 | 64 | kfree(pd); |
0381411e | 65 | } |
e8989fae | 66 | |
a051661c | 67 | blk_exit_rl(&blkg->rl); |
549d3aa8 | 68 | kfree(blkg); |
0381411e TH |
69 | } |
70 | ||
71 | /** | |
72 | * blkg_alloc - allocate a blkg | |
73 | * @blkcg: block cgroup the new blkg is associated with | |
74 | * @q: request_queue the new blkg is associated with | |
15974993 | 75 | * @gfp_mask: allocation mask to use |
0381411e | 76 | * |
e8989fae | 77 | * Allocate a new blkg assocating @blkcg and @q. |
0381411e | 78 | */ |
15974993 TH |
79 | static struct blkcg_gq *blkg_alloc(struct blkcg *blkcg, struct request_queue *q, |
80 | gfp_t gfp_mask) | |
0381411e | 81 | { |
3c798398 | 82 | struct blkcg_gq *blkg; |
e8989fae | 83 | int i; |
0381411e TH |
84 | |
85 | /* alloc and init base part */ | |
15974993 | 86 | blkg = kzalloc_node(sizeof(*blkg), gfp_mask, q->node); |
0381411e TH |
87 | if (!blkg) |
88 | return NULL; | |
89 | ||
c875f4d0 | 90 | blkg->q = q; |
e8989fae | 91 | INIT_LIST_HEAD(&blkg->q_node); |
0381411e | 92 | blkg->blkcg = blkcg; |
1adaf3dd | 93 | blkg->refcnt = 1; |
0381411e | 94 | |
a051661c TH |
95 | /* root blkg uses @q->root_rl, init rl only for !root blkgs */ |
96 | if (blkcg != &blkcg_root) { | |
97 | if (blk_init_rl(&blkg->rl, q, gfp_mask)) | |
98 | goto err_free; | |
99 | blkg->rl.blkg = blkg; | |
100 | } | |
101 | ||
8bd435b3 | 102 | for (i = 0; i < BLKCG_MAX_POLS; i++) { |
3c798398 | 103 | struct blkcg_policy *pol = blkcg_policy[i]; |
e8989fae | 104 | struct blkg_policy_data *pd; |
0381411e | 105 | |
a2b1693b | 106 | if (!blkcg_policy_enabled(q, pol)) |
e8989fae TH |
107 | continue; |
108 | ||
109 | /* alloc per-policy data and attach it to blkg */ | |
15974993 | 110 | pd = kzalloc_node(pol->pd_size, gfp_mask, q->node); |
a051661c TH |
111 | if (!pd) |
112 | goto err_free; | |
549d3aa8 | 113 | |
e8989fae TH |
114 | blkg->pd[i] = pd; |
115 | pd->blkg = blkg; | |
b276a876 | 116 | pd->plid = i; |
e8989fae | 117 | |
9b2ea86b | 118 | /* invoke per-policy init */ |
356d2e58 | 119 | if (pol->pd_init_fn) |
f9fcc2d3 | 120 | pol->pd_init_fn(blkg); |
e8989fae TH |
121 | } |
122 | ||
0381411e | 123 | return blkg; |
a051661c TH |
124 | |
125 | err_free: | |
126 | blkg_free(blkg); | |
127 | return NULL; | |
0381411e TH |
128 | } |
129 | ||
3c798398 | 130 | static struct blkcg_gq *__blkg_lookup(struct blkcg *blkcg, |
86cde6b6 | 131 | struct request_queue *q, bool update_hint) |
80fd9979 | 132 | { |
3c798398 | 133 | struct blkcg_gq *blkg; |
80fd9979 | 134 | |
a637120e TH |
135 | blkg = rcu_dereference(blkcg->blkg_hint); |
136 | if (blkg && blkg->q == q) | |
137 | return blkg; | |
138 | ||
139 | /* | |
86cde6b6 TH |
140 | * Hint didn't match. Look up from the radix tree. Note that the |
141 | * hint can only be updated under queue_lock as otherwise @blkg | |
142 | * could have already been removed from blkg_tree. The caller is | |
143 | * responsible for grabbing queue_lock if @update_hint. | |
a637120e TH |
144 | */ |
145 | blkg = radix_tree_lookup(&blkcg->blkg_tree, q->id); | |
86cde6b6 TH |
146 | if (blkg && blkg->q == q) { |
147 | if (update_hint) { | |
148 | lockdep_assert_held(q->queue_lock); | |
149 | rcu_assign_pointer(blkcg->blkg_hint, blkg); | |
150 | } | |
a637120e | 151 | return blkg; |
86cde6b6 | 152 | } |
a637120e | 153 | |
80fd9979 TH |
154 | return NULL; |
155 | } | |
156 | ||
157 | /** | |
158 | * blkg_lookup - lookup blkg for the specified blkcg - q pair | |
159 | * @blkcg: blkcg of interest | |
160 | * @q: request_queue of interest | |
161 | * | |
162 | * Lookup blkg for the @blkcg - @q pair. This function should be called | |
163 | * under RCU read lock and is guaranteed to return %NULL if @q is bypassing | |
164 | * - see blk_queue_bypass_start() for details. | |
165 | */ | |
3c798398 | 166 | struct blkcg_gq *blkg_lookup(struct blkcg *blkcg, struct request_queue *q) |
80fd9979 TH |
167 | { |
168 | WARN_ON_ONCE(!rcu_read_lock_held()); | |
169 | ||
170 | if (unlikely(blk_queue_bypass(q))) | |
171 | return NULL; | |
86cde6b6 | 172 | return __blkg_lookup(blkcg, q, false); |
80fd9979 TH |
173 | } |
174 | EXPORT_SYMBOL_GPL(blkg_lookup); | |
175 | ||
15974993 TH |
176 | /* |
177 | * If @new_blkg is %NULL, this function tries to allocate a new one as | |
178 | * necessary using %GFP_ATOMIC. @new_blkg is always consumed on return. | |
179 | */ | |
86cde6b6 TH |
180 | static struct blkcg_gq *blkg_create(struct blkcg *blkcg, |
181 | struct request_queue *q, | |
182 | struct blkcg_gq *new_blkg) | |
5624a4e4 | 183 | { |
3c798398 | 184 | struct blkcg_gq *blkg; |
496fb780 | 185 | int ret; |
5624a4e4 | 186 | |
cd1604fa TH |
187 | WARN_ON_ONCE(!rcu_read_lock_held()); |
188 | lockdep_assert_held(q->queue_lock); | |
189 | ||
7ee9c562 | 190 | /* blkg holds a reference to blkcg */ |
15974993 | 191 | if (!css_tryget(&blkcg->css)) { |
93e6d5d8 TH |
192 | ret = -EINVAL; |
193 | goto err_free_blkg; | |
15974993 | 194 | } |
cd1604fa | 195 | |
496fb780 | 196 | /* allocate */ |
15974993 TH |
197 | if (!new_blkg) { |
198 | new_blkg = blkg_alloc(blkcg, q, GFP_ATOMIC); | |
199 | if (unlikely(!new_blkg)) { | |
93e6d5d8 TH |
200 | ret = -ENOMEM; |
201 | goto err_put_css; | |
15974993 TH |
202 | } |
203 | } | |
204 | blkg = new_blkg; | |
cd1604fa | 205 | |
3c547865 TH |
206 | /* link parent and insert */ |
207 | if (blkcg_parent(blkcg)) { | |
208 | blkg->parent = __blkg_lookup(blkcg_parent(blkcg), q, false); | |
209 | if (WARN_ON_ONCE(!blkg->parent)) { | |
210 | blkg = ERR_PTR(-EINVAL); | |
211 | goto err_put_css; | |
212 | } | |
213 | blkg_get(blkg->parent); | |
214 | } | |
215 | ||
cd1604fa | 216 | spin_lock(&blkcg->lock); |
a637120e TH |
217 | ret = radix_tree_insert(&blkcg->blkg_tree, q->id, blkg); |
218 | if (likely(!ret)) { | |
219 | hlist_add_head_rcu(&blkg->blkcg_node, &blkcg->blkg_list); | |
220 | list_add(&blkg->q_node, &q->blkg_list); | |
221 | } | |
cd1604fa | 222 | spin_unlock(&blkcg->lock); |
496fb780 | 223 | |
a637120e TH |
224 | if (!ret) |
225 | return blkg; | |
15974993 | 226 | |
3c547865 TH |
227 | /* @blkg failed fully initialized, use the usual release path */ |
228 | blkg_put(blkg); | |
229 | return ERR_PTR(ret); | |
230 | ||
93e6d5d8 | 231 | err_put_css: |
496fb780 | 232 | css_put(&blkcg->css); |
93e6d5d8 | 233 | err_free_blkg: |
15974993 | 234 | blkg_free(new_blkg); |
93e6d5d8 | 235 | return ERR_PTR(ret); |
31e4c28d | 236 | } |
3c96cb32 | 237 | |
86cde6b6 TH |
238 | /** |
239 | * blkg_lookup_create - lookup blkg, try to create one if not there | |
240 | * @blkcg: blkcg of interest | |
241 | * @q: request_queue of interest | |
242 | * | |
243 | * Lookup blkg for the @blkcg - @q pair. If it doesn't exist, try to | |
3c547865 TH |
244 | * create one. blkg creation is performed recursively from blkcg_root such |
245 | * that all non-root blkg's have access to the parent blkg. This function | |
246 | * should be called under RCU read lock and @q->queue_lock. | |
86cde6b6 TH |
247 | * |
248 | * Returns pointer to the looked up or created blkg on success, ERR_PTR() | |
249 | * value on error. If @q is dead, returns ERR_PTR(-EINVAL). If @q is not | |
250 | * dead and bypassing, returns ERR_PTR(-EBUSY). | |
251 | */ | |
3c798398 TH |
252 | struct blkcg_gq *blkg_lookup_create(struct blkcg *blkcg, |
253 | struct request_queue *q) | |
3c96cb32 | 254 | { |
86cde6b6 TH |
255 | struct blkcg_gq *blkg; |
256 | ||
257 | WARN_ON_ONCE(!rcu_read_lock_held()); | |
258 | lockdep_assert_held(q->queue_lock); | |
259 | ||
3c96cb32 TH |
260 | /* |
261 | * This could be the first entry point of blkcg implementation and | |
262 | * we shouldn't allow anything to go through for a bypassing queue. | |
263 | */ | |
264 | if (unlikely(blk_queue_bypass(q))) | |
3f3299d5 | 265 | return ERR_PTR(blk_queue_dying(q) ? -EINVAL : -EBUSY); |
86cde6b6 TH |
266 | |
267 | blkg = __blkg_lookup(blkcg, q, true); | |
268 | if (blkg) | |
269 | return blkg; | |
270 | ||
3c547865 TH |
271 | /* |
272 | * Create blkgs walking down from blkcg_root to @blkcg, so that all | |
273 | * non-root blkgs have access to their parents. | |
274 | */ | |
275 | while (true) { | |
276 | struct blkcg *pos = blkcg; | |
277 | struct blkcg *parent = blkcg_parent(blkcg); | |
278 | ||
279 | while (parent && !__blkg_lookup(parent, q, false)) { | |
280 | pos = parent; | |
281 | parent = blkcg_parent(parent); | |
282 | } | |
283 | ||
284 | blkg = blkg_create(pos, q, NULL); | |
285 | if (pos == blkcg || IS_ERR(blkg)) | |
286 | return blkg; | |
287 | } | |
3c96cb32 | 288 | } |
cd1604fa | 289 | EXPORT_SYMBOL_GPL(blkg_lookup_create); |
31e4c28d | 290 | |
3c798398 | 291 | static void blkg_destroy(struct blkcg_gq *blkg) |
03aa264a | 292 | { |
3c798398 | 293 | struct blkcg *blkcg = blkg->blkcg; |
03aa264a | 294 | |
27e1f9d1 | 295 | lockdep_assert_held(blkg->q->queue_lock); |
9f13ef67 | 296 | lockdep_assert_held(&blkcg->lock); |
03aa264a TH |
297 | |
298 | /* Something wrong if we are trying to remove same group twice */ | |
e8989fae | 299 | WARN_ON_ONCE(list_empty(&blkg->q_node)); |
9f13ef67 | 300 | WARN_ON_ONCE(hlist_unhashed(&blkg->blkcg_node)); |
a637120e TH |
301 | |
302 | radix_tree_delete(&blkcg->blkg_tree, blkg->q->id); | |
e8989fae | 303 | list_del_init(&blkg->q_node); |
9f13ef67 | 304 | hlist_del_init_rcu(&blkg->blkcg_node); |
03aa264a | 305 | |
a637120e TH |
306 | /* |
307 | * Both setting lookup hint to and clearing it from @blkg are done | |
308 | * under queue_lock. If it's not pointing to @blkg now, it never | |
309 | * will. Hint assignment itself can race safely. | |
310 | */ | |
311 | if (rcu_dereference_raw(blkcg->blkg_hint) == blkg) | |
312 | rcu_assign_pointer(blkcg->blkg_hint, NULL); | |
313 | ||
03aa264a TH |
314 | /* |
315 | * Put the reference taken at the time of creation so that when all | |
316 | * queues are gone, group can be destroyed. | |
317 | */ | |
318 | blkg_put(blkg); | |
319 | } | |
320 | ||
9f13ef67 TH |
321 | /** |
322 | * blkg_destroy_all - destroy all blkgs associated with a request_queue | |
323 | * @q: request_queue of interest | |
9f13ef67 | 324 | * |
3c96cb32 | 325 | * Destroy all blkgs associated with @q. |
9f13ef67 | 326 | */ |
3c96cb32 | 327 | static void blkg_destroy_all(struct request_queue *q) |
72e06c25 | 328 | { |
3c798398 | 329 | struct blkcg_gq *blkg, *n; |
72e06c25 | 330 | |
6d18b008 | 331 | lockdep_assert_held(q->queue_lock); |
72e06c25 | 332 | |
9f13ef67 | 333 | list_for_each_entry_safe(blkg, n, &q->blkg_list, q_node) { |
3c798398 | 334 | struct blkcg *blkcg = blkg->blkcg; |
72e06c25 | 335 | |
9f13ef67 TH |
336 | spin_lock(&blkcg->lock); |
337 | blkg_destroy(blkg); | |
338 | spin_unlock(&blkcg->lock); | |
72e06c25 | 339 | } |
65635cbc JN |
340 | |
341 | /* | |
342 | * root blkg is destroyed. Just clear the pointer since | |
343 | * root_rl does not take reference on root blkg. | |
344 | */ | |
345 | q->root_blkg = NULL; | |
346 | q->root_rl.blkg = NULL; | |
72e06c25 TH |
347 | } |
348 | ||
1adaf3dd TH |
349 | static void blkg_rcu_free(struct rcu_head *rcu_head) |
350 | { | |
3c798398 | 351 | blkg_free(container_of(rcu_head, struct blkcg_gq, rcu_head)); |
1adaf3dd TH |
352 | } |
353 | ||
3c798398 | 354 | void __blkg_release(struct blkcg_gq *blkg) |
1adaf3dd | 355 | { |
3c547865 | 356 | /* release the blkcg and parent blkg refs this blkg has been holding */ |
1adaf3dd | 357 | css_put(&blkg->blkcg->css); |
3c547865 TH |
358 | if (blkg->parent) |
359 | blkg_put(blkg->parent); | |
1adaf3dd TH |
360 | |
361 | /* | |
362 | * A group is freed in rcu manner. But having an rcu lock does not | |
363 | * mean that one can access all the fields of blkg and assume these | |
364 | * are valid. For example, don't try to follow throtl_data and | |
365 | * request queue links. | |
366 | * | |
367 | * Having a reference to blkg under an rcu allows acess to only | |
368 | * values local to groups like group stats and group rate limits | |
369 | */ | |
370 | call_rcu(&blkg->rcu_head, blkg_rcu_free); | |
371 | } | |
372 | EXPORT_SYMBOL_GPL(__blkg_release); | |
373 | ||
a051661c TH |
374 | /* |
375 | * The next function used by blk_queue_for_each_rl(). It's a bit tricky | |
376 | * because the root blkg uses @q->root_rl instead of its own rl. | |
377 | */ | |
378 | struct request_list *__blk_queue_next_rl(struct request_list *rl, | |
379 | struct request_queue *q) | |
380 | { | |
381 | struct list_head *ent; | |
382 | struct blkcg_gq *blkg; | |
383 | ||
384 | /* | |
385 | * Determine the current blkg list_head. The first entry is | |
386 | * root_rl which is off @q->blkg_list and mapped to the head. | |
387 | */ | |
388 | if (rl == &q->root_rl) { | |
389 | ent = &q->blkg_list; | |
65c77fd9 JN |
390 | /* There are no more block groups, hence no request lists */ |
391 | if (list_empty(ent)) | |
392 | return NULL; | |
a051661c TH |
393 | } else { |
394 | blkg = container_of(rl, struct blkcg_gq, rl); | |
395 | ent = &blkg->q_node; | |
396 | } | |
397 | ||
398 | /* walk to the next list_head, skip root blkcg */ | |
399 | ent = ent->next; | |
400 | if (ent == &q->root_blkg->q_node) | |
401 | ent = ent->next; | |
402 | if (ent == &q->blkg_list) | |
403 | return NULL; | |
404 | ||
405 | blkg = container_of(ent, struct blkcg_gq, q_node); | |
406 | return &blkg->rl; | |
407 | } | |
408 | ||
3c798398 TH |
409 | static int blkcg_reset_stats(struct cgroup *cgroup, struct cftype *cftype, |
410 | u64 val) | |
303a3acb | 411 | { |
3c798398 TH |
412 | struct blkcg *blkcg = cgroup_to_blkcg(cgroup); |
413 | struct blkcg_gq *blkg; | |
303a3acb | 414 | struct hlist_node *n; |
bc0d6501 | 415 | int i; |
303a3acb | 416 | |
bc0d6501 | 417 | mutex_lock(&blkcg_pol_mutex); |
303a3acb | 418 | spin_lock_irq(&blkcg->lock); |
997a026c TH |
419 | |
420 | /* | |
421 | * Note that stat reset is racy - it doesn't synchronize against | |
422 | * stat updates. This is a debug feature which shouldn't exist | |
423 | * anyway. If you get hit by a race, retry. | |
424 | */ | |
303a3acb | 425 | hlist_for_each_entry(blkg, n, &blkcg->blkg_list, blkcg_node) { |
8bd435b3 | 426 | for (i = 0; i < BLKCG_MAX_POLS; i++) { |
3c798398 | 427 | struct blkcg_policy *pol = blkcg_policy[i]; |
549d3aa8 | 428 | |
a2b1693b | 429 | if (blkcg_policy_enabled(blkg->q, pol) && |
f9fcc2d3 TH |
430 | pol->pd_reset_stats_fn) |
431 | pol->pd_reset_stats_fn(blkg); | |
bc0d6501 | 432 | } |
303a3acb | 433 | } |
f0bdc8cd | 434 | |
303a3acb | 435 | spin_unlock_irq(&blkcg->lock); |
bc0d6501 | 436 | mutex_unlock(&blkcg_pol_mutex); |
303a3acb DS |
437 | return 0; |
438 | } | |
439 | ||
3c798398 | 440 | static const char *blkg_dev_name(struct blkcg_gq *blkg) |
303a3acb | 441 | { |
d3d32e69 TH |
442 | /* some drivers (floppy) instantiate a queue w/o disk registered */ |
443 | if (blkg->q->backing_dev_info.dev) | |
444 | return dev_name(blkg->q->backing_dev_info.dev); | |
445 | return NULL; | |
303a3acb DS |
446 | } |
447 | ||
d3d32e69 TH |
448 | /** |
449 | * blkcg_print_blkgs - helper for printing per-blkg data | |
450 | * @sf: seq_file to print to | |
451 | * @blkcg: blkcg of interest | |
452 | * @prfill: fill function to print out a blkg | |
453 | * @pol: policy in question | |
454 | * @data: data to be passed to @prfill | |
455 | * @show_total: to print out sum of prfill return values or not | |
456 | * | |
457 | * This function invokes @prfill on each blkg of @blkcg if pd for the | |
458 | * policy specified by @pol exists. @prfill is invoked with @sf, the | |
459 | * policy data and @data. If @show_total is %true, the sum of the return | |
460 | * values from @prfill is printed with "Total" label at the end. | |
461 | * | |
462 | * This is to be used to construct print functions for | |
463 | * cftype->read_seq_string method. | |
464 | */ | |
3c798398 | 465 | void blkcg_print_blkgs(struct seq_file *sf, struct blkcg *blkcg, |
f95a04af TH |
466 | u64 (*prfill)(struct seq_file *, |
467 | struct blkg_policy_data *, int), | |
3c798398 | 468 | const struct blkcg_policy *pol, int data, |
ec399347 | 469 | bool show_total) |
5624a4e4 | 470 | { |
3c798398 | 471 | struct blkcg_gq *blkg; |
d3d32e69 TH |
472 | struct hlist_node *n; |
473 | u64 total = 0; | |
5624a4e4 | 474 | |
d3d32e69 TH |
475 | spin_lock_irq(&blkcg->lock); |
476 | hlist_for_each_entry(blkg, n, &blkcg->blkg_list, blkcg_node) | |
a2b1693b | 477 | if (blkcg_policy_enabled(blkg->q, pol)) |
f95a04af | 478 | total += prfill(sf, blkg->pd[pol->plid], data); |
d3d32e69 TH |
479 | spin_unlock_irq(&blkcg->lock); |
480 | ||
481 | if (show_total) | |
482 | seq_printf(sf, "Total %llu\n", (unsigned long long)total); | |
483 | } | |
829fdb50 | 484 | EXPORT_SYMBOL_GPL(blkcg_print_blkgs); |
d3d32e69 TH |
485 | |
486 | /** | |
487 | * __blkg_prfill_u64 - prfill helper for a single u64 value | |
488 | * @sf: seq_file to print to | |
f95a04af | 489 | * @pd: policy private data of interest |
d3d32e69 TH |
490 | * @v: value to print |
491 | * | |
f95a04af | 492 | * Print @v to @sf for the device assocaited with @pd. |
d3d32e69 | 493 | */ |
f95a04af | 494 | u64 __blkg_prfill_u64(struct seq_file *sf, struct blkg_policy_data *pd, u64 v) |
d3d32e69 | 495 | { |
f95a04af | 496 | const char *dname = blkg_dev_name(pd->blkg); |
d3d32e69 TH |
497 | |
498 | if (!dname) | |
499 | return 0; | |
500 | ||
501 | seq_printf(sf, "%s %llu\n", dname, (unsigned long long)v); | |
502 | return v; | |
503 | } | |
829fdb50 | 504 | EXPORT_SYMBOL_GPL(__blkg_prfill_u64); |
d3d32e69 TH |
505 | |
506 | /** | |
507 | * __blkg_prfill_rwstat - prfill helper for a blkg_rwstat | |
508 | * @sf: seq_file to print to | |
f95a04af | 509 | * @pd: policy private data of interest |
d3d32e69 TH |
510 | * @rwstat: rwstat to print |
511 | * | |
f95a04af | 512 | * Print @rwstat to @sf for the device assocaited with @pd. |
d3d32e69 | 513 | */ |
f95a04af | 514 | u64 __blkg_prfill_rwstat(struct seq_file *sf, struct blkg_policy_data *pd, |
829fdb50 | 515 | const struct blkg_rwstat *rwstat) |
d3d32e69 TH |
516 | { |
517 | static const char *rwstr[] = { | |
518 | [BLKG_RWSTAT_READ] = "Read", | |
519 | [BLKG_RWSTAT_WRITE] = "Write", | |
520 | [BLKG_RWSTAT_SYNC] = "Sync", | |
521 | [BLKG_RWSTAT_ASYNC] = "Async", | |
522 | }; | |
f95a04af | 523 | const char *dname = blkg_dev_name(pd->blkg); |
d3d32e69 TH |
524 | u64 v; |
525 | int i; | |
526 | ||
527 | if (!dname) | |
528 | return 0; | |
529 | ||
530 | for (i = 0; i < BLKG_RWSTAT_NR; i++) | |
531 | seq_printf(sf, "%s %s %llu\n", dname, rwstr[i], | |
532 | (unsigned long long)rwstat->cnt[i]); | |
533 | ||
534 | v = rwstat->cnt[BLKG_RWSTAT_READ] + rwstat->cnt[BLKG_RWSTAT_WRITE]; | |
535 | seq_printf(sf, "%s Total %llu\n", dname, (unsigned long long)v); | |
536 | return v; | |
537 | } | |
538 | ||
5bc4afb1 TH |
539 | /** |
540 | * blkg_prfill_stat - prfill callback for blkg_stat | |
541 | * @sf: seq_file to print to | |
f95a04af TH |
542 | * @pd: policy private data of interest |
543 | * @off: offset to the blkg_stat in @pd | |
5bc4afb1 TH |
544 | * |
545 | * prfill callback for printing a blkg_stat. | |
546 | */ | |
f95a04af | 547 | u64 blkg_prfill_stat(struct seq_file *sf, struct blkg_policy_data *pd, int off) |
d3d32e69 | 548 | { |
f95a04af | 549 | return __blkg_prfill_u64(sf, pd, blkg_stat_read((void *)pd + off)); |
d3d32e69 | 550 | } |
5bc4afb1 | 551 | EXPORT_SYMBOL_GPL(blkg_prfill_stat); |
d3d32e69 | 552 | |
5bc4afb1 TH |
553 | /** |
554 | * blkg_prfill_rwstat - prfill callback for blkg_rwstat | |
555 | * @sf: seq_file to print to | |
f95a04af TH |
556 | * @pd: policy private data of interest |
557 | * @off: offset to the blkg_rwstat in @pd | |
5bc4afb1 TH |
558 | * |
559 | * prfill callback for printing a blkg_rwstat. | |
560 | */ | |
f95a04af TH |
561 | u64 blkg_prfill_rwstat(struct seq_file *sf, struct blkg_policy_data *pd, |
562 | int off) | |
d3d32e69 | 563 | { |
f95a04af | 564 | struct blkg_rwstat rwstat = blkg_rwstat_read((void *)pd + off); |
d3d32e69 | 565 | |
f95a04af | 566 | return __blkg_prfill_rwstat(sf, pd, &rwstat); |
d3d32e69 | 567 | } |
5bc4afb1 | 568 | EXPORT_SYMBOL_GPL(blkg_prfill_rwstat); |
d3d32e69 | 569 | |
3a8b31d3 TH |
570 | /** |
571 | * blkg_conf_prep - parse and prepare for per-blkg config update | |
572 | * @blkcg: target block cgroup | |
da8b0662 | 573 | * @pol: target policy |
3a8b31d3 TH |
574 | * @input: input string |
575 | * @ctx: blkg_conf_ctx to be filled | |
576 | * | |
577 | * Parse per-blkg config update from @input and initialize @ctx with the | |
578 | * result. @ctx->blkg points to the blkg to be updated and @ctx->v the new | |
da8b0662 TH |
579 | * value. This function returns with RCU read lock and queue lock held and |
580 | * must be paired with blkg_conf_finish(). | |
3a8b31d3 | 581 | */ |
3c798398 TH |
582 | int blkg_conf_prep(struct blkcg *blkcg, const struct blkcg_policy *pol, |
583 | const char *input, struct blkg_conf_ctx *ctx) | |
da8b0662 | 584 | __acquires(rcu) __acquires(disk->queue->queue_lock) |
34d0f179 | 585 | { |
3a8b31d3 | 586 | struct gendisk *disk; |
3c798398 | 587 | struct blkcg_gq *blkg; |
726fa694 TH |
588 | unsigned int major, minor; |
589 | unsigned long long v; | |
590 | int part, ret; | |
34d0f179 | 591 | |
726fa694 TH |
592 | if (sscanf(input, "%u:%u %llu", &major, &minor, &v) != 3) |
593 | return -EINVAL; | |
3a8b31d3 | 594 | |
726fa694 | 595 | disk = get_gendisk(MKDEV(major, minor), &part); |
4bfd482e | 596 | if (!disk || part) |
726fa694 | 597 | return -EINVAL; |
e56da7e2 TH |
598 | |
599 | rcu_read_lock(); | |
4bfd482e | 600 | spin_lock_irq(disk->queue->queue_lock); |
da8b0662 | 601 | |
a2b1693b | 602 | if (blkcg_policy_enabled(disk->queue, pol)) |
3c96cb32 | 603 | blkg = blkg_lookup_create(blkcg, disk->queue); |
a2b1693b TH |
604 | else |
605 | blkg = ERR_PTR(-EINVAL); | |
e56da7e2 | 606 | |
4bfd482e TH |
607 | if (IS_ERR(blkg)) { |
608 | ret = PTR_ERR(blkg); | |
3a8b31d3 | 609 | rcu_read_unlock(); |
da8b0662 | 610 | spin_unlock_irq(disk->queue->queue_lock); |
3a8b31d3 TH |
611 | put_disk(disk); |
612 | /* | |
613 | * If queue was bypassing, we should retry. Do so after a | |
614 | * short msleep(). It isn't strictly necessary but queue | |
615 | * can be bypassing for some time and it's always nice to | |
616 | * avoid busy looping. | |
617 | */ | |
618 | if (ret == -EBUSY) { | |
619 | msleep(10); | |
620 | ret = restart_syscall(); | |
7702e8f4 | 621 | } |
726fa694 | 622 | return ret; |
062a644d | 623 | } |
3a8b31d3 TH |
624 | |
625 | ctx->disk = disk; | |
626 | ctx->blkg = blkg; | |
726fa694 TH |
627 | ctx->v = v; |
628 | return 0; | |
34d0f179 | 629 | } |
829fdb50 | 630 | EXPORT_SYMBOL_GPL(blkg_conf_prep); |
34d0f179 | 631 | |
3a8b31d3 TH |
632 | /** |
633 | * blkg_conf_finish - finish up per-blkg config update | |
634 | * @ctx: blkg_conf_ctx intiailized by blkg_conf_prep() | |
635 | * | |
636 | * Finish up after per-blkg config update. This function must be paired | |
637 | * with blkg_conf_prep(). | |
638 | */ | |
829fdb50 | 639 | void blkg_conf_finish(struct blkg_conf_ctx *ctx) |
da8b0662 | 640 | __releases(ctx->disk->queue->queue_lock) __releases(rcu) |
34d0f179 | 641 | { |
da8b0662 | 642 | spin_unlock_irq(ctx->disk->queue->queue_lock); |
3a8b31d3 TH |
643 | rcu_read_unlock(); |
644 | put_disk(ctx->disk); | |
34d0f179 | 645 | } |
829fdb50 | 646 | EXPORT_SYMBOL_GPL(blkg_conf_finish); |
34d0f179 | 647 | |
3c798398 | 648 | struct cftype blkcg_files[] = { |
84c124da DS |
649 | { |
650 | .name = "reset_stats", | |
3c798398 | 651 | .write_u64 = blkcg_reset_stats, |
22084190 | 652 | }, |
4baf6e33 | 653 | { } /* terminate */ |
31e4c28d VG |
654 | }; |
655 | ||
9f13ef67 | 656 | /** |
92fb9748 | 657 | * blkcg_css_offline - cgroup css_offline callback |
9f13ef67 TH |
658 | * @cgroup: cgroup of interest |
659 | * | |
660 | * This function is called when @cgroup is about to go away and responsible | |
661 | * for shooting down all blkgs associated with @cgroup. blkgs should be | |
662 | * removed while holding both q and blkcg locks. As blkcg lock is nested | |
663 | * inside q lock, this function performs reverse double lock dancing. | |
664 | * | |
665 | * This is the blkcg counterpart of ioc_release_fn(). | |
666 | */ | |
92fb9748 | 667 | static void blkcg_css_offline(struct cgroup *cgroup) |
31e4c28d | 668 | { |
3c798398 | 669 | struct blkcg *blkcg = cgroup_to_blkcg(cgroup); |
b1c35769 | 670 | |
9f13ef67 | 671 | spin_lock_irq(&blkcg->lock); |
7ee9c562 | 672 | |
9f13ef67 | 673 | while (!hlist_empty(&blkcg->blkg_list)) { |
3c798398 TH |
674 | struct blkcg_gq *blkg = hlist_entry(blkcg->blkg_list.first, |
675 | struct blkcg_gq, blkcg_node); | |
c875f4d0 | 676 | struct request_queue *q = blkg->q; |
b1c35769 | 677 | |
9f13ef67 TH |
678 | if (spin_trylock(q->queue_lock)) { |
679 | blkg_destroy(blkg); | |
680 | spin_unlock(q->queue_lock); | |
681 | } else { | |
682 | spin_unlock_irq(&blkcg->lock); | |
9f13ef67 | 683 | cpu_relax(); |
a5567932 | 684 | spin_lock_irq(&blkcg->lock); |
0f3942a3 | 685 | } |
9f13ef67 | 686 | } |
b1c35769 | 687 | |
9f13ef67 | 688 | spin_unlock_irq(&blkcg->lock); |
7ee9c562 TH |
689 | } |
690 | ||
92fb9748 | 691 | static void blkcg_css_free(struct cgroup *cgroup) |
7ee9c562 | 692 | { |
3c798398 | 693 | struct blkcg *blkcg = cgroup_to_blkcg(cgroup); |
7ee9c562 | 694 | |
3c798398 | 695 | if (blkcg != &blkcg_root) |
67523c48 | 696 | kfree(blkcg); |
31e4c28d VG |
697 | } |
698 | ||
92fb9748 | 699 | static struct cgroup_subsys_state *blkcg_css_alloc(struct cgroup *cgroup) |
31e4c28d | 700 | { |
9a9e8a26 | 701 | static atomic64_t id_seq = ATOMIC64_INIT(0); |
3c798398 | 702 | struct blkcg *blkcg; |
0341509f | 703 | struct cgroup *parent = cgroup->parent; |
31e4c28d | 704 | |
0341509f | 705 | if (!parent) { |
3c798398 | 706 | blkcg = &blkcg_root; |
31e4c28d VG |
707 | goto done; |
708 | } | |
709 | ||
31e4c28d VG |
710 | blkcg = kzalloc(sizeof(*blkcg), GFP_KERNEL); |
711 | if (!blkcg) | |
712 | return ERR_PTR(-ENOMEM); | |
713 | ||
3381cb8d | 714 | blkcg->cfq_weight = CFQ_WEIGHT_DEFAULT; |
e71357e1 | 715 | blkcg->cfq_leaf_weight = CFQ_WEIGHT_DEFAULT; |
9a9e8a26 | 716 | blkcg->id = atomic64_inc_return(&id_seq); /* root is 0, start from 1 */ |
31e4c28d VG |
717 | done: |
718 | spin_lock_init(&blkcg->lock); | |
a637120e | 719 | INIT_RADIX_TREE(&blkcg->blkg_tree, GFP_ATOMIC); |
31e4c28d VG |
720 | INIT_HLIST_HEAD(&blkcg->blkg_list); |
721 | ||
722 | return &blkcg->css; | |
723 | } | |
724 | ||
5efd6113 TH |
725 | /** |
726 | * blkcg_init_queue - initialize blkcg part of request queue | |
727 | * @q: request_queue to initialize | |
728 | * | |
729 | * Called from blk_alloc_queue_node(). Responsible for initializing blkcg | |
730 | * part of new request_queue @q. | |
731 | * | |
732 | * RETURNS: | |
733 | * 0 on success, -errno on failure. | |
734 | */ | |
735 | int blkcg_init_queue(struct request_queue *q) | |
736 | { | |
737 | might_sleep(); | |
738 | ||
3c96cb32 | 739 | return blk_throtl_init(q); |
5efd6113 TH |
740 | } |
741 | ||
742 | /** | |
743 | * blkcg_drain_queue - drain blkcg part of request_queue | |
744 | * @q: request_queue to drain | |
745 | * | |
746 | * Called from blk_drain_queue(). Responsible for draining blkcg part. | |
747 | */ | |
748 | void blkcg_drain_queue(struct request_queue *q) | |
749 | { | |
750 | lockdep_assert_held(q->queue_lock); | |
751 | ||
752 | blk_throtl_drain(q); | |
753 | } | |
754 | ||
755 | /** | |
756 | * blkcg_exit_queue - exit and release blkcg part of request_queue | |
757 | * @q: request_queue being released | |
758 | * | |
759 | * Called from blk_release_queue(). Responsible for exiting blkcg part. | |
760 | */ | |
761 | void blkcg_exit_queue(struct request_queue *q) | |
762 | { | |
6d18b008 | 763 | spin_lock_irq(q->queue_lock); |
3c96cb32 | 764 | blkg_destroy_all(q); |
6d18b008 TH |
765 | spin_unlock_irq(q->queue_lock); |
766 | ||
5efd6113 TH |
767 | blk_throtl_exit(q); |
768 | } | |
769 | ||
31e4c28d VG |
770 | /* |
771 | * We cannot support shared io contexts, as we have no mean to support | |
772 | * two tasks with the same ioc in two different groups without major rework | |
773 | * of the main cic data structures. For now we allow a task to change | |
774 | * its cgroup only if it's the only owner of its ioc. | |
775 | */ | |
3c798398 | 776 | static int blkcg_can_attach(struct cgroup *cgrp, struct cgroup_taskset *tset) |
31e4c28d | 777 | { |
bb9d97b6 | 778 | struct task_struct *task; |
31e4c28d VG |
779 | struct io_context *ioc; |
780 | int ret = 0; | |
781 | ||
782 | /* task_lock() is needed to avoid races with exit_io_context() */ | |
bb9d97b6 TH |
783 | cgroup_taskset_for_each(task, cgrp, tset) { |
784 | task_lock(task); | |
785 | ioc = task->io_context; | |
786 | if (ioc && atomic_read(&ioc->nr_tasks) > 1) | |
787 | ret = -EINVAL; | |
788 | task_unlock(task); | |
789 | if (ret) | |
790 | break; | |
791 | } | |
31e4c28d VG |
792 | return ret; |
793 | } | |
794 | ||
676f7c8f TH |
795 | struct cgroup_subsys blkio_subsys = { |
796 | .name = "blkio", | |
92fb9748 TH |
797 | .css_alloc = blkcg_css_alloc, |
798 | .css_offline = blkcg_css_offline, | |
799 | .css_free = blkcg_css_free, | |
3c798398 | 800 | .can_attach = blkcg_can_attach, |
676f7c8f | 801 | .subsys_id = blkio_subsys_id, |
3c798398 | 802 | .base_cftypes = blkcg_files, |
676f7c8f | 803 | .module = THIS_MODULE, |
8c7f6edb TH |
804 | |
805 | /* | |
806 | * blkio subsystem is utterly broken in terms of hierarchy support. | |
807 | * It treats all cgroups equally regardless of where they're | |
808 | * located in the hierarchy - all cgroups are treated as if they're | |
809 | * right below the root. Fix it and remove the following. | |
810 | */ | |
811 | .broken_hierarchy = true, | |
676f7c8f TH |
812 | }; |
813 | EXPORT_SYMBOL_GPL(blkio_subsys); | |
814 | ||
a2b1693b TH |
815 | /** |
816 | * blkcg_activate_policy - activate a blkcg policy on a request_queue | |
817 | * @q: request_queue of interest | |
818 | * @pol: blkcg policy to activate | |
819 | * | |
820 | * Activate @pol on @q. Requires %GFP_KERNEL context. @q goes through | |
821 | * bypass mode to populate its blkgs with policy_data for @pol. | |
822 | * | |
823 | * Activation happens with @q bypassed, so nobody would be accessing blkgs | |
824 | * from IO path. Update of each blkg is protected by both queue and blkcg | |
825 | * locks so that holding either lock and testing blkcg_policy_enabled() is | |
826 | * always enough for dereferencing policy data. | |
827 | * | |
828 | * The caller is responsible for synchronizing [de]activations and policy | |
829 | * [un]registerations. Returns 0 on success, -errno on failure. | |
830 | */ | |
831 | int blkcg_activate_policy(struct request_queue *q, | |
3c798398 | 832 | const struct blkcg_policy *pol) |
a2b1693b TH |
833 | { |
834 | LIST_HEAD(pds); | |
86cde6b6 | 835 | struct blkcg_gq *blkg, *new_blkg; |
a2b1693b TH |
836 | struct blkg_policy_data *pd, *n; |
837 | int cnt = 0, ret; | |
15974993 | 838 | bool preloaded; |
a2b1693b TH |
839 | |
840 | if (blkcg_policy_enabled(q, pol)) | |
841 | return 0; | |
842 | ||
15974993 | 843 | /* preallocations for root blkg */ |
86cde6b6 TH |
844 | new_blkg = blkg_alloc(&blkcg_root, q, GFP_KERNEL); |
845 | if (!new_blkg) | |
15974993 TH |
846 | return -ENOMEM; |
847 | ||
848 | preloaded = !radix_tree_preload(GFP_KERNEL); | |
849 | ||
a2b1693b TH |
850 | blk_queue_bypass_start(q); |
851 | ||
86cde6b6 TH |
852 | /* |
853 | * Make sure the root blkg exists and count the existing blkgs. As | |
854 | * @q is bypassing at this point, blkg_lookup_create() can't be | |
855 | * used. Open code it. | |
856 | */ | |
a2b1693b TH |
857 | spin_lock_irq(q->queue_lock); |
858 | ||
859 | rcu_read_lock(); | |
86cde6b6 TH |
860 | blkg = __blkg_lookup(&blkcg_root, q, false); |
861 | if (blkg) | |
862 | blkg_free(new_blkg); | |
863 | else | |
864 | blkg = blkg_create(&blkcg_root, q, new_blkg); | |
a2b1693b TH |
865 | rcu_read_unlock(); |
866 | ||
15974993 TH |
867 | if (preloaded) |
868 | radix_tree_preload_end(); | |
869 | ||
a2b1693b TH |
870 | if (IS_ERR(blkg)) { |
871 | ret = PTR_ERR(blkg); | |
872 | goto out_unlock; | |
873 | } | |
874 | q->root_blkg = blkg; | |
a051661c | 875 | q->root_rl.blkg = blkg; |
a2b1693b TH |
876 | |
877 | list_for_each_entry(blkg, &q->blkg_list, q_node) | |
878 | cnt++; | |
879 | ||
880 | spin_unlock_irq(q->queue_lock); | |
881 | ||
882 | /* allocate policy_data for all existing blkgs */ | |
883 | while (cnt--) { | |
f95a04af | 884 | pd = kzalloc_node(pol->pd_size, GFP_KERNEL, q->node); |
a2b1693b TH |
885 | if (!pd) { |
886 | ret = -ENOMEM; | |
887 | goto out_free; | |
888 | } | |
889 | list_add_tail(&pd->alloc_node, &pds); | |
890 | } | |
891 | ||
892 | /* | |
893 | * Install the allocated pds. With @q bypassing, no new blkg | |
894 | * should have been created while the queue lock was dropped. | |
895 | */ | |
896 | spin_lock_irq(q->queue_lock); | |
897 | ||
898 | list_for_each_entry(blkg, &q->blkg_list, q_node) { | |
899 | if (WARN_ON(list_empty(&pds))) { | |
900 | /* umm... this shouldn't happen, just abort */ | |
901 | ret = -ENOMEM; | |
902 | goto out_unlock; | |
903 | } | |
904 | pd = list_first_entry(&pds, struct blkg_policy_data, alloc_node); | |
905 | list_del_init(&pd->alloc_node); | |
906 | ||
907 | /* grab blkcg lock too while installing @pd on @blkg */ | |
908 | spin_lock(&blkg->blkcg->lock); | |
909 | ||
910 | blkg->pd[pol->plid] = pd; | |
911 | pd->blkg = blkg; | |
b276a876 | 912 | pd->plid = pol->plid; |
f9fcc2d3 | 913 | pol->pd_init_fn(blkg); |
a2b1693b TH |
914 | |
915 | spin_unlock(&blkg->blkcg->lock); | |
916 | } | |
917 | ||
918 | __set_bit(pol->plid, q->blkcg_pols); | |
919 | ret = 0; | |
920 | out_unlock: | |
921 | spin_unlock_irq(q->queue_lock); | |
922 | out_free: | |
923 | blk_queue_bypass_end(q); | |
924 | list_for_each_entry_safe(pd, n, &pds, alloc_node) | |
925 | kfree(pd); | |
926 | return ret; | |
927 | } | |
928 | EXPORT_SYMBOL_GPL(blkcg_activate_policy); | |
929 | ||
930 | /** | |
931 | * blkcg_deactivate_policy - deactivate a blkcg policy on a request_queue | |
932 | * @q: request_queue of interest | |
933 | * @pol: blkcg policy to deactivate | |
934 | * | |
935 | * Deactivate @pol on @q. Follows the same synchronization rules as | |
936 | * blkcg_activate_policy(). | |
937 | */ | |
938 | void blkcg_deactivate_policy(struct request_queue *q, | |
3c798398 | 939 | const struct blkcg_policy *pol) |
a2b1693b | 940 | { |
3c798398 | 941 | struct blkcg_gq *blkg; |
a2b1693b TH |
942 | |
943 | if (!blkcg_policy_enabled(q, pol)) | |
944 | return; | |
945 | ||
946 | blk_queue_bypass_start(q); | |
947 | spin_lock_irq(q->queue_lock); | |
948 | ||
949 | __clear_bit(pol->plid, q->blkcg_pols); | |
950 | ||
6d18b008 TH |
951 | /* if no policy is left, no need for blkgs - shoot them down */ |
952 | if (bitmap_empty(q->blkcg_pols, BLKCG_MAX_POLS)) | |
953 | blkg_destroy_all(q); | |
954 | ||
a2b1693b TH |
955 | list_for_each_entry(blkg, &q->blkg_list, q_node) { |
956 | /* grab blkcg lock too while removing @pd from @blkg */ | |
957 | spin_lock(&blkg->blkcg->lock); | |
958 | ||
f9fcc2d3 TH |
959 | if (pol->pd_exit_fn) |
960 | pol->pd_exit_fn(blkg); | |
a2b1693b TH |
961 | |
962 | kfree(blkg->pd[pol->plid]); | |
963 | blkg->pd[pol->plid] = NULL; | |
964 | ||
965 | spin_unlock(&blkg->blkcg->lock); | |
966 | } | |
967 | ||
968 | spin_unlock_irq(q->queue_lock); | |
969 | blk_queue_bypass_end(q); | |
970 | } | |
971 | EXPORT_SYMBOL_GPL(blkcg_deactivate_policy); | |
972 | ||
8bd435b3 | 973 | /** |
3c798398 TH |
974 | * blkcg_policy_register - register a blkcg policy |
975 | * @pol: blkcg policy to register | |
8bd435b3 | 976 | * |
3c798398 TH |
977 | * Register @pol with blkcg core. Might sleep and @pol may be modified on |
978 | * successful registration. Returns 0 on success and -errno on failure. | |
8bd435b3 | 979 | */ |
3c798398 | 980 | int blkcg_policy_register(struct blkcg_policy *pol) |
3e252066 | 981 | { |
8bd435b3 | 982 | int i, ret; |
e8989fae | 983 | |
f95a04af TH |
984 | if (WARN_ON(pol->pd_size < sizeof(struct blkg_policy_data))) |
985 | return -EINVAL; | |
986 | ||
bc0d6501 TH |
987 | mutex_lock(&blkcg_pol_mutex); |
988 | ||
8bd435b3 TH |
989 | /* find an empty slot */ |
990 | ret = -ENOSPC; | |
991 | for (i = 0; i < BLKCG_MAX_POLS; i++) | |
3c798398 | 992 | if (!blkcg_policy[i]) |
8bd435b3 TH |
993 | break; |
994 | if (i >= BLKCG_MAX_POLS) | |
995 | goto out_unlock; | |
035d10b2 | 996 | |
8bd435b3 | 997 | /* register and update blkgs */ |
3c798398 TH |
998 | pol->plid = i; |
999 | blkcg_policy[i] = pol; | |
8bd435b3 | 1000 | |
8bd435b3 | 1001 | /* everything is in place, add intf files for the new policy */ |
3c798398 TH |
1002 | if (pol->cftypes) |
1003 | WARN_ON(cgroup_add_cftypes(&blkio_subsys, pol->cftypes)); | |
8bd435b3 TH |
1004 | ret = 0; |
1005 | out_unlock: | |
bc0d6501 | 1006 | mutex_unlock(&blkcg_pol_mutex); |
8bd435b3 | 1007 | return ret; |
3e252066 | 1008 | } |
3c798398 | 1009 | EXPORT_SYMBOL_GPL(blkcg_policy_register); |
3e252066 | 1010 | |
8bd435b3 | 1011 | /** |
3c798398 TH |
1012 | * blkcg_policy_unregister - unregister a blkcg policy |
1013 | * @pol: blkcg policy to unregister | |
8bd435b3 | 1014 | * |
3c798398 | 1015 | * Undo blkcg_policy_register(@pol). Might sleep. |
8bd435b3 | 1016 | */ |
3c798398 | 1017 | void blkcg_policy_unregister(struct blkcg_policy *pol) |
3e252066 | 1018 | { |
bc0d6501 TH |
1019 | mutex_lock(&blkcg_pol_mutex); |
1020 | ||
3c798398 | 1021 | if (WARN_ON(blkcg_policy[pol->plid] != pol)) |
8bd435b3 TH |
1022 | goto out_unlock; |
1023 | ||
1024 | /* kill the intf files first */ | |
3c798398 TH |
1025 | if (pol->cftypes) |
1026 | cgroup_rm_cftypes(&blkio_subsys, pol->cftypes); | |
44ea53de | 1027 | |
8bd435b3 | 1028 | /* unregister and update blkgs */ |
3c798398 | 1029 | blkcg_policy[pol->plid] = NULL; |
8bd435b3 | 1030 | out_unlock: |
bc0d6501 | 1031 | mutex_unlock(&blkcg_pol_mutex); |
3e252066 | 1032 | } |
3c798398 | 1033 | EXPORT_SYMBOL_GPL(blkcg_policy_unregister); |