]> git.proxmox.com Git - mirror_ubuntu-bionic-kernel.git/blob - include/linux/blk-cgroup.h
Merge tag 'sirf-iobrg2regmap-for-4.2' of git://git.kernel.org/pub/scm/linux/kernel...
[mirror_ubuntu-bionic-kernel.git] / include / linux / blk-cgroup.h
1 #ifndef _BLK_CGROUP_H
2 #define _BLK_CGROUP_H
3 /*
4 * Common Block IO controller cgroup interface
5 *
6 * Based on ideas and code from CFQ, CFS and BFQ:
7 * Copyright (C) 2003 Jens Axboe <axboe@kernel.dk>
8 *
9 * Copyright (C) 2008 Fabio Checconi <fabio@gandalf.sssup.it>
10 * Paolo Valente <paolo.valente@unimore.it>
11 *
12 * Copyright (C) 2009 Vivek Goyal <vgoyal@redhat.com>
13 * Nauman Rafique <nauman@google.com>
14 */
15
16 #include <linux/cgroup.h>
17 #include <linux/u64_stats_sync.h>
18 #include <linux/seq_file.h>
19 #include <linux/radix-tree.h>
20 #include <linux/blkdev.h>
21 #include <linux/atomic.h>
22
23 /* Max limits for throttle policy */
24 #define THROTL_IOPS_MAX UINT_MAX
25
26 #ifdef CONFIG_BLK_CGROUP
27
28 enum blkg_rwstat_type {
29 BLKG_RWSTAT_READ,
30 BLKG_RWSTAT_WRITE,
31 BLKG_RWSTAT_SYNC,
32 BLKG_RWSTAT_ASYNC,
33
34 BLKG_RWSTAT_NR,
35 BLKG_RWSTAT_TOTAL = BLKG_RWSTAT_NR,
36 };
37
38 struct blkcg_gq;
39
40 struct blkcg {
41 struct cgroup_subsys_state css;
42 spinlock_t lock;
43
44 struct radix_tree_root blkg_tree;
45 struct blkcg_gq *blkg_hint;
46 struct hlist_head blkg_list;
47
48 struct blkcg_policy_data *pd[BLKCG_MAX_POLS];
49
50 #ifdef CONFIG_CGROUP_WRITEBACK
51 struct list_head cgwb_list;
52 #endif
53 };
54
55 struct blkg_stat {
56 struct u64_stats_sync syncp;
57 uint64_t cnt;
58 };
59
60 struct blkg_rwstat {
61 struct u64_stats_sync syncp;
62 uint64_t cnt[BLKG_RWSTAT_NR];
63 };
64
65 /*
66 * A blkcg_gq (blkg) is association between a block cgroup (blkcg) and a
67 * request_queue (q). This is used by blkcg policies which need to track
68 * information per blkcg - q pair.
69 *
70 * There can be multiple active blkcg policies and each has its private
71 * data on each blkg, the size of which is determined by
72 * blkcg_policy->pd_size. blkcg core allocates and frees such areas
73 * together with blkg and invokes pd_init/exit_fn() methods.
74 *
75 * Such private data must embed struct blkg_policy_data (pd) at the
76 * beginning and pd_size can't be smaller than pd.
77 */
78 struct blkg_policy_data {
79 /* the blkg and policy id this per-policy data belongs to */
80 struct blkcg_gq *blkg;
81 int plid;
82
83 /* used during policy activation */
84 struct list_head alloc_node;
85 };
86
87 /*
88 * Policies that need to keep per-blkcg data which is independent
89 * from any request_queue associated to it must specify its size
90 * with the cpd_size field of the blkcg_policy structure and
91 * embed a blkcg_policy_data in it. blkcg core allocates
92 * policy-specific per-blkcg structures lazily the first time
93 * they are actually needed, so it handles them together with
94 * blkgs. cpd_init() is invoked to let each policy handle
95 * per-blkcg data.
96 */
97 struct blkcg_policy_data {
98 /* the policy id this per-policy data belongs to */
99 int plid;
100
101 /* used during policy activation */
102 struct list_head alloc_node;
103 };
104
105 /* association between a blk cgroup and a request queue */
106 struct blkcg_gq {
107 /* Pointer to the associated request_queue */
108 struct request_queue *q;
109 struct list_head q_node;
110 struct hlist_node blkcg_node;
111 struct blkcg *blkcg;
112
113 /*
114 * Each blkg gets congested separately and the congestion state is
115 * propagated to the matching bdi_writeback_congested.
116 */
117 struct bdi_writeback_congested *wb_congested;
118
119 /* all non-root blkcg_gq's are guaranteed to have access to parent */
120 struct blkcg_gq *parent;
121
122 /* request allocation list for this blkcg-q pair */
123 struct request_list rl;
124
125 /* reference count */
126 atomic_t refcnt;
127
128 /* is this blkg online? protected by both blkcg and q locks */
129 bool online;
130
131 struct blkg_policy_data *pd[BLKCG_MAX_POLS];
132
133 struct rcu_head rcu_head;
134 };
135
136 typedef void (blkcg_pol_init_cpd_fn)(const struct blkcg *blkcg);
137 typedef void (blkcg_pol_init_pd_fn)(struct blkcg_gq *blkg);
138 typedef void (blkcg_pol_online_pd_fn)(struct blkcg_gq *blkg);
139 typedef void (blkcg_pol_offline_pd_fn)(struct blkcg_gq *blkg);
140 typedef void (blkcg_pol_exit_pd_fn)(struct blkcg_gq *blkg);
141 typedef void (blkcg_pol_reset_pd_stats_fn)(struct blkcg_gq *blkg);
142
143 struct blkcg_policy {
144 int plid;
145 /* policy specific private data size */
146 size_t pd_size;
147 /* policy specific per-blkcg data size */
148 size_t cpd_size;
149 /* cgroup files for the policy */
150 struct cftype *cftypes;
151
152 /* operations */
153 blkcg_pol_init_cpd_fn *cpd_init_fn;
154 blkcg_pol_init_pd_fn *pd_init_fn;
155 blkcg_pol_online_pd_fn *pd_online_fn;
156 blkcg_pol_offline_pd_fn *pd_offline_fn;
157 blkcg_pol_exit_pd_fn *pd_exit_fn;
158 blkcg_pol_reset_pd_stats_fn *pd_reset_stats_fn;
159 };
160
161 extern struct blkcg blkcg_root;
162 extern struct cgroup_subsys_state * const blkcg_root_css;
163
164 struct blkcg_gq *blkg_lookup(struct blkcg *blkcg, struct request_queue *q);
165 struct blkcg_gq *blkg_lookup_create(struct blkcg *blkcg,
166 struct request_queue *q);
167 int blkcg_init_queue(struct request_queue *q);
168 void blkcg_drain_queue(struct request_queue *q);
169 void blkcg_exit_queue(struct request_queue *q);
170
171 /* Blkio controller policy registration */
172 int blkcg_policy_register(struct blkcg_policy *pol);
173 void blkcg_policy_unregister(struct blkcg_policy *pol);
174 int blkcg_activate_policy(struct request_queue *q,
175 const struct blkcg_policy *pol);
176 void blkcg_deactivate_policy(struct request_queue *q,
177 const struct blkcg_policy *pol);
178
179 void blkcg_print_blkgs(struct seq_file *sf, struct blkcg *blkcg,
180 u64 (*prfill)(struct seq_file *,
181 struct blkg_policy_data *, int),
182 const struct blkcg_policy *pol, int data,
183 bool show_total);
184 u64 __blkg_prfill_u64(struct seq_file *sf, struct blkg_policy_data *pd, u64 v);
185 u64 __blkg_prfill_rwstat(struct seq_file *sf, struct blkg_policy_data *pd,
186 const struct blkg_rwstat *rwstat);
187 u64 blkg_prfill_stat(struct seq_file *sf, struct blkg_policy_data *pd, int off);
188 u64 blkg_prfill_rwstat(struct seq_file *sf, struct blkg_policy_data *pd,
189 int off);
190
191 u64 blkg_stat_recursive_sum(struct blkg_policy_data *pd, int off);
192 struct blkg_rwstat blkg_rwstat_recursive_sum(struct blkg_policy_data *pd,
193 int off);
194
195 struct blkg_conf_ctx {
196 struct gendisk *disk;
197 struct blkcg_gq *blkg;
198 u64 v;
199 };
200
201 int blkg_conf_prep(struct blkcg *blkcg, const struct blkcg_policy *pol,
202 const char *input, struct blkg_conf_ctx *ctx);
203 void blkg_conf_finish(struct blkg_conf_ctx *ctx);
204
205
206 static inline struct blkcg *css_to_blkcg(struct cgroup_subsys_state *css)
207 {
208 return css ? container_of(css, struct blkcg, css) : NULL;
209 }
210
211 static inline struct blkcg *task_blkcg(struct task_struct *tsk)
212 {
213 return css_to_blkcg(task_css(tsk, blkio_cgrp_id));
214 }
215
216 static inline struct blkcg *bio_blkcg(struct bio *bio)
217 {
218 if (bio && bio->bi_css)
219 return css_to_blkcg(bio->bi_css);
220 return task_blkcg(current);
221 }
222
223 static inline struct cgroup_subsys_state *
224 task_get_blkcg_css(struct task_struct *task)
225 {
226 return task_get_css(task, blkio_cgrp_id);
227 }
228
229 /**
230 * blkcg_parent - get the parent of a blkcg
231 * @blkcg: blkcg of interest
232 *
233 * Return the parent blkcg of @blkcg. Can be called anytime.
234 */
235 static inline struct blkcg *blkcg_parent(struct blkcg *blkcg)
236 {
237 return css_to_blkcg(blkcg->css.parent);
238 }
239
240 /**
241 * blkg_to_pdata - get policy private data
242 * @blkg: blkg of interest
243 * @pol: policy of interest
244 *
245 * Return pointer to private data associated with the @blkg-@pol pair.
246 */
247 static inline struct blkg_policy_data *blkg_to_pd(struct blkcg_gq *blkg,
248 struct blkcg_policy *pol)
249 {
250 return blkg ? blkg->pd[pol->plid] : NULL;
251 }
252
253 static inline struct blkcg_policy_data *blkcg_to_cpd(struct blkcg *blkcg,
254 struct blkcg_policy *pol)
255 {
256 return blkcg ? blkcg->pd[pol->plid] : NULL;
257 }
258
259 /**
260 * pdata_to_blkg - get blkg associated with policy private data
261 * @pd: policy private data of interest
262 *
263 * @pd is policy private data. Determine the blkg it's associated with.
264 */
265 static inline struct blkcg_gq *pd_to_blkg(struct blkg_policy_data *pd)
266 {
267 return pd ? pd->blkg : NULL;
268 }
269
270 /**
271 * blkg_path - format cgroup path of blkg
272 * @blkg: blkg of interest
273 * @buf: target buffer
274 * @buflen: target buffer length
275 *
276 * Format the path of the cgroup of @blkg into @buf.
277 */
278 static inline int blkg_path(struct blkcg_gq *blkg, char *buf, int buflen)
279 {
280 char *p;
281
282 p = cgroup_path(blkg->blkcg->css.cgroup, buf, buflen);
283 if (!p) {
284 strncpy(buf, "<unavailable>", buflen);
285 return -ENAMETOOLONG;
286 }
287
288 memmove(buf, p, buf + buflen - p);
289 return 0;
290 }
291
292 /**
293 * blkg_get - get a blkg reference
294 * @blkg: blkg to get
295 *
296 * The caller should be holding an existing reference.
297 */
298 static inline void blkg_get(struct blkcg_gq *blkg)
299 {
300 WARN_ON_ONCE(atomic_read(&blkg->refcnt) <= 0);
301 atomic_inc(&blkg->refcnt);
302 }
303
304 void __blkg_release_rcu(struct rcu_head *rcu);
305
306 /**
307 * blkg_put - put a blkg reference
308 * @blkg: blkg to put
309 */
310 static inline void blkg_put(struct blkcg_gq *blkg)
311 {
312 WARN_ON_ONCE(atomic_read(&blkg->refcnt) <= 0);
313 if (atomic_dec_and_test(&blkg->refcnt))
314 call_rcu(&blkg->rcu_head, __blkg_release_rcu);
315 }
316
317 struct blkcg_gq *__blkg_lookup(struct blkcg *blkcg, struct request_queue *q,
318 bool update_hint);
319
320 /**
321 * blkg_for_each_descendant_pre - pre-order walk of a blkg's descendants
322 * @d_blkg: loop cursor pointing to the current descendant
323 * @pos_css: used for iteration
324 * @p_blkg: target blkg to walk descendants of
325 *
326 * Walk @c_blkg through the descendants of @p_blkg. Must be used with RCU
327 * read locked. If called under either blkcg or queue lock, the iteration
328 * is guaranteed to include all and only online blkgs. The caller may
329 * update @pos_css by calling css_rightmost_descendant() to skip subtree.
330 * @p_blkg is included in the iteration and the first node to be visited.
331 */
332 #define blkg_for_each_descendant_pre(d_blkg, pos_css, p_blkg) \
333 css_for_each_descendant_pre((pos_css), &(p_blkg)->blkcg->css) \
334 if (((d_blkg) = __blkg_lookup(css_to_blkcg(pos_css), \
335 (p_blkg)->q, false)))
336
337 /**
338 * blkg_for_each_descendant_post - post-order walk of a blkg's descendants
339 * @d_blkg: loop cursor pointing to the current descendant
340 * @pos_css: used for iteration
341 * @p_blkg: target blkg to walk descendants of
342 *
343 * Similar to blkg_for_each_descendant_pre() but performs post-order
344 * traversal instead. Synchronization rules are the same. @p_blkg is
345 * included in the iteration and the last node to be visited.
346 */
347 #define blkg_for_each_descendant_post(d_blkg, pos_css, p_blkg) \
348 css_for_each_descendant_post((pos_css), &(p_blkg)->blkcg->css) \
349 if (((d_blkg) = __blkg_lookup(css_to_blkcg(pos_css), \
350 (p_blkg)->q, false)))
351
352 /**
353 * blk_get_rl - get request_list to use
354 * @q: request_queue of interest
355 * @bio: bio which will be attached to the allocated request (may be %NULL)
356 *
357 * The caller wants to allocate a request from @q to use for @bio. Find
358 * the request_list to use and obtain a reference on it. Should be called
359 * under queue_lock. This function is guaranteed to return non-%NULL
360 * request_list.
361 */
362 static inline struct request_list *blk_get_rl(struct request_queue *q,
363 struct bio *bio)
364 {
365 struct blkcg *blkcg;
366 struct blkcg_gq *blkg;
367
368 rcu_read_lock();
369
370 blkcg = bio_blkcg(bio);
371
372 /* bypass blkg lookup and use @q->root_rl directly for root */
373 if (blkcg == &blkcg_root)
374 goto root_rl;
375
376 /*
377 * Try to use blkg->rl. blkg lookup may fail under memory pressure
378 * or if either the blkcg or queue is going away. Fall back to
379 * root_rl in such cases.
380 */
381 blkg = blkg_lookup_create(blkcg, q);
382 if (unlikely(IS_ERR(blkg)))
383 goto root_rl;
384
385 blkg_get(blkg);
386 rcu_read_unlock();
387 return &blkg->rl;
388 root_rl:
389 rcu_read_unlock();
390 return &q->root_rl;
391 }
392
393 /**
394 * blk_put_rl - put request_list
395 * @rl: request_list to put
396 *
397 * Put the reference acquired by blk_get_rl(). Should be called under
398 * queue_lock.
399 */
400 static inline void blk_put_rl(struct request_list *rl)
401 {
402 /* root_rl may not have blkg set */
403 if (rl->blkg && rl->blkg->blkcg != &blkcg_root)
404 blkg_put(rl->blkg);
405 }
406
407 /**
408 * blk_rq_set_rl - associate a request with a request_list
409 * @rq: request of interest
410 * @rl: target request_list
411 *
412 * Associate @rq with @rl so that accounting and freeing can know the
413 * request_list @rq came from.
414 */
415 static inline void blk_rq_set_rl(struct request *rq, struct request_list *rl)
416 {
417 rq->rl = rl;
418 }
419
420 /**
421 * blk_rq_rl - return the request_list a request came from
422 * @rq: request of interest
423 *
424 * Return the request_list @rq is allocated from.
425 */
426 static inline struct request_list *blk_rq_rl(struct request *rq)
427 {
428 return rq->rl;
429 }
430
431 struct request_list *__blk_queue_next_rl(struct request_list *rl,
432 struct request_queue *q);
433 /**
434 * blk_queue_for_each_rl - iterate through all request_lists of a request_queue
435 *
436 * Should be used under queue_lock.
437 */
438 #define blk_queue_for_each_rl(rl, q) \
439 for ((rl) = &(q)->root_rl; (rl); (rl) = __blk_queue_next_rl((rl), (q)))
440
441 static inline void blkg_stat_init(struct blkg_stat *stat)
442 {
443 u64_stats_init(&stat->syncp);
444 }
445
446 /**
447 * blkg_stat_add - add a value to a blkg_stat
448 * @stat: target blkg_stat
449 * @val: value to add
450 *
451 * Add @val to @stat. The caller is responsible for synchronizing calls to
452 * this function.
453 */
454 static inline void blkg_stat_add(struct blkg_stat *stat, uint64_t val)
455 {
456 u64_stats_update_begin(&stat->syncp);
457 stat->cnt += val;
458 u64_stats_update_end(&stat->syncp);
459 }
460
461 /**
462 * blkg_stat_read - read the current value of a blkg_stat
463 * @stat: blkg_stat to read
464 *
465 * Read the current value of @stat. This function can be called without
466 * synchroniztion and takes care of u64 atomicity.
467 */
468 static inline uint64_t blkg_stat_read(struct blkg_stat *stat)
469 {
470 unsigned int start;
471 uint64_t v;
472
473 do {
474 start = u64_stats_fetch_begin_irq(&stat->syncp);
475 v = stat->cnt;
476 } while (u64_stats_fetch_retry_irq(&stat->syncp, start));
477
478 return v;
479 }
480
481 /**
482 * blkg_stat_reset - reset a blkg_stat
483 * @stat: blkg_stat to reset
484 */
485 static inline void blkg_stat_reset(struct blkg_stat *stat)
486 {
487 stat->cnt = 0;
488 }
489
490 /**
491 * blkg_stat_merge - merge a blkg_stat into another
492 * @to: the destination blkg_stat
493 * @from: the source
494 *
495 * Add @from's count to @to.
496 */
497 static inline void blkg_stat_merge(struct blkg_stat *to, struct blkg_stat *from)
498 {
499 blkg_stat_add(to, blkg_stat_read(from));
500 }
501
502 static inline void blkg_rwstat_init(struct blkg_rwstat *rwstat)
503 {
504 u64_stats_init(&rwstat->syncp);
505 }
506
507 /**
508 * blkg_rwstat_add - add a value to a blkg_rwstat
509 * @rwstat: target blkg_rwstat
510 * @rw: mask of REQ_{WRITE|SYNC}
511 * @val: value to add
512 *
513 * Add @val to @rwstat. The counters are chosen according to @rw. The
514 * caller is responsible for synchronizing calls to this function.
515 */
516 static inline void blkg_rwstat_add(struct blkg_rwstat *rwstat,
517 int rw, uint64_t val)
518 {
519 u64_stats_update_begin(&rwstat->syncp);
520
521 if (rw & REQ_WRITE)
522 rwstat->cnt[BLKG_RWSTAT_WRITE] += val;
523 else
524 rwstat->cnt[BLKG_RWSTAT_READ] += val;
525 if (rw & REQ_SYNC)
526 rwstat->cnt[BLKG_RWSTAT_SYNC] += val;
527 else
528 rwstat->cnt[BLKG_RWSTAT_ASYNC] += val;
529
530 u64_stats_update_end(&rwstat->syncp);
531 }
532
533 /**
534 * blkg_rwstat_read - read the current values of a blkg_rwstat
535 * @rwstat: blkg_rwstat to read
536 *
537 * Read the current snapshot of @rwstat and return it as the return value.
538 * This function can be called without synchronization and takes care of
539 * u64 atomicity.
540 */
541 static inline struct blkg_rwstat blkg_rwstat_read(struct blkg_rwstat *rwstat)
542 {
543 unsigned int start;
544 struct blkg_rwstat tmp;
545
546 do {
547 start = u64_stats_fetch_begin_irq(&rwstat->syncp);
548 tmp = *rwstat;
549 } while (u64_stats_fetch_retry_irq(&rwstat->syncp, start));
550
551 return tmp;
552 }
553
554 /**
555 * blkg_rwstat_total - read the total count of a blkg_rwstat
556 * @rwstat: blkg_rwstat to read
557 *
558 * Return the total count of @rwstat regardless of the IO direction. This
559 * function can be called without synchronization and takes care of u64
560 * atomicity.
561 */
562 static inline uint64_t blkg_rwstat_total(struct blkg_rwstat *rwstat)
563 {
564 struct blkg_rwstat tmp = blkg_rwstat_read(rwstat);
565
566 return tmp.cnt[BLKG_RWSTAT_READ] + tmp.cnt[BLKG_RWSTAT_WRITE];
567 }
568
569 /**
570 * blkg_rwstat_reset - reset a blkg_rwstat
571 * @rwstat: blkg_rwstat to reset
572 */
573 static inline void blkg_rwstat_reset(struct blkg_rwstat *rwstat)
574 {
575 memset(rwstat->cnt, 0, sizeof(rwstat->cnt));
576 }
577
578 /**
579 * blkg_rwstat_merge - merge a blkg_rwstat into another
580 * @to: the destination blkg_rwstat
581 * @from: the source
582 *
583 * Add @from's counts to @to.
584 */
585 static inline void blkg_rwstat_merge(struct blkg_rwstat *to,
586 struct blkg_rwstat *from)
587 {
588 struct blkg_rwstat v = blkg_rwstat_read(from);
589 int i;
590
591 u64_stats_update_begin(&to->syncp);
592 for (i = 0; i < BLKG_RWSTAT_NR; i++)
593 to->cnt[i] += v.cnt[i];
594 u64_stats_update_end(&to->syncp);
595 }
596
597 #else /* CONFIG_BLK_CGROUP */
598
599 struct blkcg {
600 };
601
602 struct blkg_policy_data {
603 };
604
605 struct blkcg_policy_data {
606 };
607
608 struct blkcg_gq {
609 };
610
611 struct blkcg_policy {
612 };
613
614 #define blkcg_root_css ((struct cgroup_subsys_state *)ERR_PTR(-EINVAL))
615
616 static inline struct cgroup_subsys_state *
617 task_get_blkcg_css(struct task_struct *task)
618 {
619 return NULL;
620 }
621
622 #ifdef CONFIG_BLOCK
623
624 static inline struct blkcg_gq *blkg_lookup(struct blkcg *blkcg, void *key) { return NULL; }
625 static inline int blkcg_init_queue(struct request_queue *q) { return 0; }
626 static inline void blkcg_drain_queue(struct request_queue *q) { }
627 static inline void blkcg_exit_queue(struct request_queue *q) { }
628 static inline int blkcg_policy_register(struct blkcg_policy *pol) { return 0; }
629 static inline void blkcg_policy_unregister(struct blkcg_policy *pol) { }
630 static inline int blkcg_activate_policy(struct request_queue *q,
631 const struct blkcg_policy *pol) { return 0; }
632 static inline void blkcg_deactivate_policy(struct request_queue *q,
633 const struct blkcg_policy *pol) { }
634
635 static inline struct blkcg *bio_blkcg(struct bio *bio) { return NULL; }
636
637 static inline struct blkg_policy_data *blkg_to_pd(struct blkcg_gq *blkg,
638 struct blkcg_policy *pol) { return NULL; }
639 static inline struct blkcg_gq *pd_to_blkg(struct blkg_policy_data *pd) { return NULL; }
640 static inline char *blkg_path(struct blkcg_gq *blkg) { return NULL; }
641 static inline void blkg_get(struct blkcg_gq *blkg) { }
642 static inline void blkg_put(struct blkcg_gq *blkg) { }
643
644 static inline struct request_list *blk_get_rl(struct request_queue *q,
645 struct bio *bio) { return &q->root_rl; }
646 static inline void blk_put_rl(struct request_list *rl) { }
647 static inline void blk_rq_set_rl(struct request *rq, struct request_list *rl) { }
648 static inline struct request_list *blk_rq_rl(struct request *rq) { return &rq->q->root_rl; }
649
650 #define blk_queue_for_each_rl(rl, q) \
651 for ((rl) = &(q)->root_rl; (rl); (rl) = NULL)
652
653 #endif /* CONFIG_BLOCK */
654 #endif /* CONFIG_BLK_CGROUP */
655 #endif /* _BLK_CGROUP_H */