blob: 8056c03a3382f595212530f6bd1c4dd1a5282ac8 [file] [log] [blame]
Vivek Goyal31e4c282009-12-03 12:59:42 -05001#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>
Vivek Goyal575969a2011-05-19 15:38:29 -040017#include <linux/u64_stats_sync.h>
Tejun Heo829fdb52012-04-01 14:38:43 -070018#include <linux/seq_file.h>
Tejun Heoa6371202012-04-19 16:29:24 -070019#include <linux/radix-tree.h>
Tejun Heoa0516612012-06-26 15:05:44 -070020#include <linux/blkdev.h>
Vivek Goyal31e4c282009-12-03 12:59:42 -050021
Vivek Goyal9355aed2010-10-01 21:16:41 +020022/* Max limits for throttle policy */
23#define THROTL_IOPS_MAX UINT_MAX
24
Tejun Heo3381cb82012-04-01 14:38:44 -070025/* CFQ specific, out here for blkcg->cfq_weight */
26#define CFQ_WEIGHT_MIN 10
27#define CFQ_WEIGHT_MAX 1000
28#define CFQ_WEIGHT_DEFAULT 500
29
Tejun Heof48ec1d2012-04-13 13:11:25 -070030#ifdef CONFIG_BLK_CGROUP
31
Tejun Heoedcb0722012-04-01 14:38:42 -070032enum blkg_rwstat_type {
33 BLKG_RWSTAT_READ,
34 BLKG_RWSTAT_WRITE,
35 BLKG_RWSTAT_SYNC,
36 BLKG_RWSTAT_ASYNC,
37
38 BLKG_RWSTAT_NR,
39 BLKG_RWSTAT_TOTAL = BLKG_RWSTAT_NR,
Divyesh Shah303a3ac2010-04-01 15:01:24 -070040};
41
Tejun Heoa6371202012-04-19 16:29:24 -070042struct blkcg_gq;
43
Tejun Heo3c798392012-04-16 13:57:25 -070044struct blkcg {
Tejun Heo36558c82012-04-16 13:57:24 -070045 struct cgroup_subsys_state css;
46 spinlock_t lock;
Tejun Heoa6371202012-04-19 16:29:24 -070047
48 struct radix_tree_root blkg_tree;
49 struct blkcg_gq *blkg_hint;
Tejun Heo36558c82012-04-16 13:57:24 -070050 struct hlist_head blkg_list;
Tejun Heo9a9e8a22012-03-19 15:10:56 -070051
52 /* for policies to test whether associated blkcg has changed */
Tejun Heo36558c82012-04-16 13:57:24 -070053 uint64_t id;
Tejun Heo3381cb82012-04-01 14:38:44 -070054
Tejun Heo3c798392012-04-16 13:57:25 -070055 /* TODO: per-policy storage in blkcg */
Tejun Heo36558c82012-04-16 13:57:24 -070056 unsigned int cfq_weight; /* belongs to cfq */
Tejun Heoe71357e2013-01-09 08:05:10 -080057 unsigned int cfq_leaf_weight;
Vivek Goyal31e4c282009-12-03 12:59:42 -050058};
59
Tejun Heoedcb0722012-04-01 14:38:42 -070060struct blkg_stat {
61 struct u64_stats_sync syncp;
62 uint64_t cnt;
63};
64
65struct blkg_rwstat {
66 struct u64_stats_sync syncp;
67 uint64_t cnt[BLKG_RWSTAT_NR];
68};
69
Tejun Heof95a04a2012-04-16 13:57:26 -070070/*
71 * A blkcg_gq (blkg) is association between a block cgroup (blkcg) and a
72 * request_queue (q). This is used by blkcg policies which need to track
73 * information per blkcg - q pair.
74 *
75 * There can be multiple active blkcg policies and each has its private
76 * data on each blkg, the size of which is determined by
77 * blkcg_policy->pd_size. blkcg core allocates and frees such areas
78 * together with blkg and invokes pd_init/exit_fn() methods.
79 *
80 * Such private data must embed struct blkg_policy_data (pd) at the
81 * beginning and pd_size can't be smaller than pd.
82 */
Tejun Heo03814112012-03-05 13:15:14 -080083struct blkg_policy_data {
Tejun Heob276a872013-01-09 08:05:12 -080084 /* the blkg and policy id this per-policy data belongs to */
Tejun Heo3c798392012-04-16 13:57:25 -070085 struct blkcg_gq *blkg;
Tejun Heob276a872013-01-09 08:05:12 -080086 int plid;
Tejun Heo03814112012-03-05 13:15:14 -080087
Tejun Heoa2b16932012-04-13 13:11:33 -070088 /* used during policy activation */
Tejun Heo36558c82012-04-16 13:57:24 -070089 struct list_head alloc_node;
Tejun Heo03814112012-03-05 13:15:14 -080090};
91
Tejun Heo3c798392012-04-16 13:57:25 -070092/* association between a blk cgroup and a request queue */
93struct blkcg_gq {
Tejun Heoc875f4d2012-03-05 13:15:22 -080094 /* Pointer to the associated request_queue */
Tejun Heo36558c82012-04-16 13:57:24 -070095 struct request_queue *q;
96 struct list_head q_node;
97 struct hlist_node blkcg_node;
Tejun Heo3c798392012-04-16 13:57:25 -070098 struct blkcg *blkcg;
Tejun Heo3c547862013-01-09 08:05:10 -080099
100 /* all non-root blkcg_gq's are guaranteed to have access to parent */
101 struct blkcg_gq *parent;
102
Tejun Heoa0516612012-06-26 15:05:44 -0700103 /* request allocation list for this blkcg-q pair */
104 struct request_list rl;
Tejun Heo3c547862013-01-09 08:05:10 -0800105
Tejun Heo1adaf3d2012-03-05 13:15:15 -0800106 /* reference count */
Tejun Heo36558c82012-04-16 13:57:24 -0700107 int refcnt;
Vivek Goyal22084192009-12-03 12:59:49 -0500108
Tejun Heof427d902013-01-09 08:05:12 -0800109 /* is this blkg online? protected by both blkcg and q locks */
110 bool online;
111
Tejun Heo36558c82012-04-16 13:57:24 -0700112 struct blkg_policy_data *pd[BLKCG_MAX_POLS];
Tejun Heo1adaf3d2012-03-05 13:15:15 -0800113
Tejun Heo36558c82012-04-16 13:57:24 -0700114 struct rcu_head rcu_head;
Vivek Goyal31e4c282009-12-03 12:59:42 -0500115};
116
Tejun Heo3c798392012-04-16 13:57:25 -0700117typedef void (blkcg_pol_init_pd_fn)(struct blkcg_gq *blkg);
Tejun Heof427d902013-01-09 08:05:12 -0800118typedef void (blkcg_pol_online_pd_fn)(struct blkcg_gq *blkg);
119typedef void (blkcg_pol_offline_pd_fn)(struct blkcg_gq *blkg);
Tejun Heo3c798392012-04-16 13:57:25 -0700120typedef void (blkcg_pol_exit_pd_fn)(struct blkcg_gq *blkg);
121typedef void (blkcg_pol_reset_pd_stats_fn)(struct blkcg_gq *blkg);
Vivek Goyal3e252062009-12-04 10:36:42 -0500122
Tejun Heo3c798392012-04-16 13:57:25 -0700123struct blkcg_policy {
Tejun Heo36558c82012-04-16 13:57:24 -0700124 int plid;
125 /* policy specific private data size */
Tejun Heof95a04a2012-04-16 13:57:26 -0700126 size_t pd_size;
Tejun Heo36558c82012-04-16 13:57:24 -0700127 /* cgroup files for the policy */
128 struct cftype *cftypes;
Tejun Heof9fcc2d2012-04-16 13:57:27 -0700129
130 /* operations */
131 blkcg_pol_init_pd_fn *pd_init_fn;
Tejun Heof427d902013-01-09 08:05:12 -0800132 blkcg_pol_online_pd_fn *pd_online_fn;
133 blkcg_pol_offline_pd_fn *pd_offline_fn;
Tejun Heof9fcc2d2012-04-16 13:57:27 -0700134 blkcg_pol_exit_pd_fn *pd_exit_fn;
135 blkcg_pol_reset_pd_stats_fn *pd_reset_stats_fn;
Vivek Goyal3e252062009-12-04 10:36:42 -0500136};
137
Tejun Heo3c798392012-04-16 13:57:25 -0700138extern struct blkcg blkcg_root;
Tejun Heo36558c82012-04-16 13:57:24 -0700139
Tejun Heo3c798392012-04-16 13:57:25 -0700140struct blkcg_gq *blkg_lookup(struct blkcg *blkcg, struct request_queue *q);
141struct blkcg_gq *blkg_lookup_create(struct blkcg *blkcg,
142 struct request_queue *q);
Tejun Heo36558c82012-04-16 13:57:24 -0700143int blkcg_init_queue(struct request_queue *q);
144void blkcg_drain_queue(struct request_queue *q);
145void blkcg_exit_queue(struct request_queue *q);
Tejun Heo5efd6112012-03-05 13:15:12 -0800146
Vivek Goyal3e252062009-12-04 10:36:42 -0500147/* Blkio controller policy registration */
Tejun Heo3c798392012-04-16 13:57:25 -0700148int blkcg_policy_register(struct blkcg_policy *pol);
149void blkcg_policy_unregister(struct blkcg_policy *pol);
Tejun Heo36558c82012-04-16 13:57:24 -0700150int blkcg_activate_policy(struct request_queue *q,
Tejun Heo3c798392012-04-16 13:57:25 -0700151 const struct blkcg_policy *pol);
Tejun Heo36558c82012-04-16 13:57:24 -0700152void blkcg_deactivate_policy(struct request_queue *q,
Tejun Heo3c798392012-04-16 13:57:25 -0700153 const struct blkcg_policy *pol);
Vivek Goyal3e252062009-12-04 10:36:42 -0500154
Tejun Heo3c798392012-04-16 13:57:25 -0700155void blkcg_print_blkgs(struct seq_file *sf, struct blkcg *blkcg,
Tejun Heof95a04a2012-04-16 13:57:26 -0700156 u64 (*prfill)(struct seq_file *,
157 struct blkg_policy_data *, int),
Tejun Heo3c798392012-04-16 13:57:25 -0700158 const struct blkcg_policy *pol, int data,
Tejun Heoec399342012-04-13 13:11:27 -0700159 bool show_total);
Tejun Heof95a04a2012-04-16 13:57:26 -0700160u64 __blkg_prfill_u64(struct seq_file *sf, struct blkg_policy_data *pd, u64 v);
161u64 __blkg_prfill_rwstat(struct seq_file *sf, struct blkg_policy_data *pd,
Tejun Heo829fdb52012-04-01 14:38:43 -0700162 const struct blkg_rwstat *rwstat);
Tejun Heof95a04a2012-04-16 13:57:26 -0700163u64 blkg_prfill_stat(struct seq_file *sf, struct blkg_policy_data *pd, int off);
164u64 blkg_prfill_rwstat(struct seq_file *sf, struct blkg_policy_data *pd,
165 int off);
Tejun Heo829fdb52012-04-01 14:38:43 -0700166
Tejun Heo16b3de62013-01-09 08:05:12 -0800167u64 blkg_stat_recursive_sum(struct blkg_policy_data *pd, int off);
168struct blkg_rwstat blkg_rwstat_recursive_sum(struct blkg_policy_data *pd,
169 int off);
170
Tejun Heo829fdb52012-04-01 14:38:43 -0700171struct blkg_conf_ctx {
Tejun Heo36558c82012-04-16 13:57:24 -0700172 struct gendisk *disk;
Tejun Heo3c798392012-04-16 13:57:25 -0700173 struct blkcg_gq *blkg;
Tejun Heo36558c82012-04-16 13:57:24 -0700174 u64 v;
Tejun Heo829fdb52012-04-01 14:38:43 -0700175};
176
Tejun Heo3c798392012-04-16 13:57:25 -0700177int blkg_conf_prep(struct blkcg *blkcg, const struct blkcg_policy *pol,
178 const char *input, struct blkg_conf_ctx *ctx);
Tejun Heo829fdb52012-04-01 14:38:43 -0700179void blkg_conf_finish(struct blkg_conf_ctx *ctx);
180
181
Tejun Heob1208b52012-06-04 20:40:57 -0700182static inline struct blkcg *cgroup_to_blkcg(struct cgroup *cgroup)
183{
184 return container_of(cgroup_subsys_state(cgroup, blkio_subsys_id),
185 struct blkcg, css);
186}
187
188static inline struct blkcg *task_blkcg(struct task_struct *tsk)
189{
190 return container_of(task_subsys_state(tsk, blkio_subsys_id),
191 struct blkcg, css);
192}
193
194static inline struct blkcg *bio_blkcg(struct bio *bio)
195{
196 if (bio && bio->bi_css)
197 return container_of(bio->bi_css, struct blkcg, css);
198 return task_blkcg(current);
199}
200
Tejun Heo03814112012-03-05 13:15:14 -0800201/**
Tejun Heo3c547862013-01-09 08:05:10 -0800202 * blkcg_parent - get the parent of a blkcg
203 * @blkcg: blkcg of interest
204 *
205 * Return the parent blkcg of @blkcg. Can be called anytime.
206 */
207static inline struct blkcg *blkcg_parent(struct blkcg *blkcg)
208{
209 struct cgroup *pcg = blkcg->css.cgroup->parent;
210
211 return pcg ? cgroup_to_blkcg(pcg) : NULL;
212}
213
214/**
Tejun Heo03814112012-03-05 13:15:14 -0800215 * blkg_to_pdata - get policy private data
216 * @blkg: blkg of interest
217 * @pol: policy of interest
218 *
219 * Return pointer to private data associated with the @blkg-@pol pair.
220 */
Tejun Heof95a04a2012-04-16 13:57:26 -0700221static inline struct blkg_policy_data *blkg_to_pd(struct blkcg_gq *blkg,
222 struct blkcg_policy *pol)
Tejun Heo03814112012-03-05 13:15:14 -0800223{
Tejun Heof95a04a2012-04-16 13:57:26 -0700224 return blkg ? blkg->pd[pol->plid] : NULL;
Tejun Heo03814112012-03-05 13:15:14 -0800225}
226
227/**
228 * pdata_to_blkg - get blkg associated with policy private data
Tejun Heof95a04a2012-04-16 13:57:26 -0700229 * @pd: policy private data of interest
Tejun Heo03814112012-03-05 13:15:14 -0800230 *
Tejun Heof95a04a2012-04-16 13:57:26 -0700231 * @pd is policy private data. Determine the blkg it's associated with.
Tejun Heo03814112012-03-05 13:15:14 -0800232 */
Tejun Heof95a04a2012-04-16 13:57:26 -0700233static inline struct blkcg_gq *pd_to_blkg(struct blkg_policy_data *pd)
Tejun Heo03814112012-03-05 13:15:14 -0800234{
Tejun Heof95a04a2012-04-16 13:57:26 -0700235 return pd ? pd->blkg : NULL;
Tejun Heo03814112012-03-05 13:15:14 -0800236}
237
Tejun Heo54e7ed12012-04-16 13:57:23 -0700238/**
239 * blkg_path - format cgroup path of blkg
240 * @blkg: blkg of interest
241 * @buf: target buffer
242 * @buflen: target buffer length
243 *
244 * Format the path of the cgroup of @blkg into @buf.
245 */
Tejun Heo3c798392012-04-16 13:57:25 -0700246static inline int blkg_path(struct blkcg_gq *blkg, char *buf, int buflen)
Vivek Goyalafc24d42010-04-26 19:27:56 +0200247{
Tejun Heo54e7ed12012-04-16 13:57:23 -0700248 int ret;
249
Tejun Heo54e7ed12012-04-16 13:57:23 -0700250 ret = cgroup_path(blkg->blkcg->css.cgroup, buf, buflen);
Tejun Heo54e7ed12012-04-16 13:57:23 -0700251 if (ret)
252 strncpy(buf, "<unavailable>", buflen);
253 return ret;
Vivek Goyalafc24d42010-04-26 19:27:56 +0200254}
255
Tejun Heo1adaf3d2012-03-05 13:15:15 -0800256/**
257 * blkg_get - get a blkg reference
258 * @blkg: blkg to get
259 *
260 * The caller should be holding queue_lock and an existing reference.
261 */
Tejun Heo3c798392012-04-16 13:57:25 -0700262static inline void blkg_get(struct blkcg_gq *blkg)
Tejun Heo1adaf3d2012-03-05 13:15:15 -0800263{
264 lockdep_assert_held(blkg->q->queue_lock);
265 WARN_ON_ONCE(!blkg->refcnt);
266 blkg->refcnt++;
267}
268
Tejun Heo2a4fd072013-05-14 13:52:31 -0700269void __blkg_release_rcu(struct rcu_head *rcu);
Tejun Heo1adaf3d2012-03-05 13:15:15 -0800270
271/**
272 * blkg_put - put a blkg reference
273 * @blkg: blkg to put
274 *
275 * The caller should be holding queue_lock.
276 */
Tejun Heo3c798392012-04-16 13:57:25 -0700277static inline void blkg_put(struct blkcg_gq *blkg)
Tejun Heo1adaf3d2012-03-05 13:15:15 -0800278{
279 lockdep_assert_held(blkg->q->queue_lock);
280 WARN_ON_ONCE(blkg->refcnt <= 0);
281 if (!--blkg->refcnt)
Tejun Heo2a4fd072013-05-14 13:52:31 -0700282 call_rcu(&blkg->rcu_head, __blkg_release_rcu);
Tejun Heo1adaf3d2012-03-05 13:15:15 -0800283}
284
Tejun Heodd4a4ff2013-05-14 13:52:30 -0700285struct blkcg_gq *__blkg_lookup(struct blkcg *blkcg, struct request_queue *q,
286 bool update_hint);
287
288/**
289 * blkg_for_each_descendant_pre - pre-order walk of a blkg's descendants
290 * @d_blkg: loop cursor pointing to the current descendant
291 * @pos_cgrp: used for iteration
292 * @p_blkg: target blkg to walk descendants of
293 *
294 * Walk @c_blkg through the descendants of @p_blkg. Must be used with RCU
295 * read locked. If called under either blkcg or queue lock, the iteration
296 * is guaranteed to include all and only online blkgs. The caller may
297 * update @pos_cgrp by calling cgroup_rightmost_descendant() to skip
298 * subtree.
299 */
300#define blkg_for_each_descendant_pre(d_blkg, pos_cgrp, p_blkg) \
301 cgroup_for_each_descendant_pre((pos_cgrp), (p_blkg)->blkcg->css.cgroup) \
302 if (((d_blkg) = __blkg_lookup(cgroup_to_blkcg(pos_cgrp), \
303 (p_blkg)->q, false)))
304
Tejun Heoedcb0722012-04-01 14:38:42 -0700305/**
Tejun Heoaa539cb2013-05-14 13:52:31 -0700306 * blkg_for_each_descendant_post - post-order walk of a blkg's descendants
307 * @d_blkg: loop cursor pointing to the current descendant
308 * @pos_cgrp: used for iteration
309 * @p_blkg: target blkg to walk descendants of
310 *
311 * Similar to blkg_for_each_descendant_pre() but performs post-order
312 * traversal instead. Synchronization rules are the same.
313 */
314#define blkg_for_each_descendant_post(d_blkg, pos_cgrp, p_blkg) \
315 cgroup_for_each_descendant_post((pos_cgrp), (p_blkg)->blkcg->css.cgroup) \
316 if (((d_blkg) = __blkg_lookup(cgroup_to_blkcg(pos_cgrp), \
317 (p_blkg)->q, false)))
318
319/**
Tejun Heoa0516612012-06-26 15:05:44 -0700320 * blk_get_rl - get request_list to use
321 * @q: request_queue of interest
322 * @bio: bio which will be attached to the allocated request (may be %NULL)
323 *
324 * The caller wants to allocate a request from @q to use for @bio. Find
325 * the request_list to use and obtain a reference on it. Should be called
326 * under queue_lock. This function is guaranteed to return non-%NULL
327 * request_list.
328 */
329static inline struct request_list *blk_get_rl(struct request_queue *q,
330 struct bio *bio)
331{
332 struct blkcg *blkcg;
333 struct blkcg_gq *blkg;
334
335 rcu_read_lock();
336
337 blkcg = bio_blkcg(bio);
338
339 /* bypass blkg lookup and use @q->root_rl directly for root */
340 if (blkcg == &blkcg_root)
341 goto root_rl;
342
343 /*
344 * Try to use blkg->rl. blkg lookup may fail under memory pressure
345 * or if either the blkcg or queue is going away. Fall back to
346 * root_rl in such cases.
347 */
348 blkg = blkg_lookup_create(blkcg, q);
349 if (unlikely(IS_ERR(blkg)))
350 goto root_rl;
351
352 blkg_get(blkg);
353 rcu_read_unlock();
354 return &blkg->rl;
355root_rl:
356 rcu_read_unlock();
357 return &q->root_rl;
358}
359
360/**
361 * blk_put_rl - put request_list
362 * @rl: request_list to put
363 *
364 * Put the reference acquired by blk_get_rl(). Should be called under
365 * queue_lock.
366 */
367static inline void blk_put_rl(struct request_list *rl)
368{
369 /* root_rl may not have blkg set */
370 if (rl->blkg && rl->blkg->blkcg != &blkcg_root)
371 blkg_put(rl->blkg);
372}
373
374/**
375 * blk_rq_set_rl - associate a request with a request_list
376 * @rq: request of interest
377 * @rl: target request_list
378 *
379 * Associate @rq with @rl so that accounting and freeing can know the
380 * request_list @rq came from.
381 */
382static inline void blk_rq_set_rl(struct request *rq, struct request_list *rl)
383{
384 rq->rl = rl;
385}
386
387/**
388 * blk_rq_rl - return the request_list a request came from
389 * @rq: request of interest
390 *
391 * Return the request_list @rq is allocated from.
392 */
393static inline struct request_list *blk_rq_rl(struct request *rq)
394{
395 return rq->rl;
396}
397
398struct request_list *__blk_queue_next_rl(struct request_list *rl,
399 struct request_queue *q);
400/**
401 * blk_queue_for_each_rl - iterate through all request_lists of a request_queue
402 *
403 * Should be used under queue_lock.
404 */
405#define blk_queue_for_each_rl(rl, q) \
406 for ((rl) = &(q)->root_rl; (rl); (rl) = __blk_queue_next_rl((rl), (q)))
407
408/**
Tejun Heoedcb0722012-04-01 14:38:42 -0700409 * blkg_stat_add - add a value to a blkg_stat
410 * @stat: target blkg_stat
411 * @val: value to add
412 *
413 * Add @val to @stat. The caller is responsible for synchronizing calls to
414 * this function.
415 */
416static inline void blkg_stat_add(struct blkg_stat *stat, uint64_t val)
417{
418 u64_stats_update_begin(&stat->syncp);
419 stat->cnt += val;
420 u64_stats_update_end(&stat->syncp);
421}
422
423/**
424 * blkg_stat_read - read the current value of a blkg_stat
425 * @stat: blkg_stat to read
426 *
427 * Read the current value of @stat. This function can be called without
428 * synchroniztion and takes care of u64 atomicity.
429 */
430static inline uint64_t blkg_stat_read(struct blkg_stat *stat)
431{
432 unsigned int start;
433 uint64_t v;
434
435 do {
436 start = u64_stats_fetch_begin(&stat->syncp);
437 v = stat->cnt;
438 } while (u64_stats_fetch_retry(&stat->syncp, start));
439
440 return v;
441}
442
443/**
444 * blkg_stat_reset - reset a blkg_stat
445 * @stat: blkg_stat to reset
446 */
447static inline void blkg_stat_reset(struct blkg_stat *stat)
448{
449 stat->cnt = 0;
450}
451
452/**
Tejun Heo16b3de62013-01-09 08:05:12 -0800453 * blkg_stat_merge - merge a blkg_stat into another
454 * @to: the destination blkg_stat
455 * @from: the source
456 *
457 * Add @from's count to @to.
458 */
459static inline void blkg_stat_merge(struct blkg_stat *to, struct blkg_stat *from)
460{
461 blkg_stat_add(to, blkg_stat_read(from));
462}
463
464/**
Tejun Heoedcb0722012-04-01 14:38:42 -0700465 * blkg_rwstat_add - add a value to a blkg_rwstat
466 * @rwstat: target blkg_rwstat
467 * @rw: mask of REQ_{WRITE|SYNC}
468 * @val: value to add
469 *
470 * Add @val to @rwstat. The counters are chosen according to @rw. The
471 * caller is responsible for synchronizing calls to this function.
472 */
473static inline void blkg_rwstat_add(struct blkg_rwstat *rwstat,
474 int rw, uint64_t val)
475{
476 u64_stats_update_begin(&rwstat->syncp);
477
478 if (rw & REQ_WRITE)
479 rwstat->cnt[BLKG_RWSTAT_WRITE] += val;
480 else
481 rwstat->cnt[BLKG_RWSTAT_READ] += val;
482 if (rw & REQ_SYNC)
483 rwstat->cnt[BLKG_RWSTAT_SYNC] += val;
484 else
485 rwstat->cnt[BLKG_RWSTAT_ASYNC] += val;
486
487 u64_stats_update_end(&rwstat->syncp);
488}
489
490/**
491 * blkg_rwstat_read - read the current values of a blkg_rwstat
492 * @rwstat: blkg_rwstat to read
493 *
494 * Read the current snapshot of @rwstat and return it as the return value.
495 * This function can be called without synchronization and takes care of
496 * u64 atomicity.
497 */
Tejun Heoc94bed892012-04-16 13:57:22 -0700498static inline struct blkg_rwstat blkg_rwstat_read(struct blkg_rwstat *rwstat)
Tejun Heoedcb0722012-04-01 14:38:42 -0700499{
500 unsigned int start;
501 struct blkg_rwstat tmp;
502
503 do {
504 start = u64_stats_fetch_begin(&rwstat->syncp);
505 tmp = *rwstat;
506 } while (u64_stats_fetch_retry(&rwstat->syncp, start));
507
508 return tmp;
509}
510
511/**
Tejun Heo4d5e80a2013-01-09 08:05:12 -0800512 * blkg_rwstat_total - read the total count of a blkg_rwstat
Tejun Heoedcb0722012-04-01 14:38:42 -0700513 * @rwstat: blkg_rwstat to read
514 *
515 * Return the total count of @rwstat regardless of the IO direction. This
516 * function can be called without synchronization and takes care of u64
517 * atomicity.
518 */
Tejun Heo4d5e80a2013-01-09 08:05:12 -0800519static inline uint64_t blkg_rwstat_total(struct blkg_rwstat *rwstat)
Tejun Heoedcb0722012-04-01 14:38:42 -0700520{
521 struct blkg_rwstat tmp = blkg_rwstat_read(rwstat);
522
523 return tmp.cnt[BLKG_RWSTAT_READ] + tmp.cnt[BLKG_RWSTAT_WRITE];
524}
525
526/**
527 * blkg_rwstat_reset - reset a blkg_rwstat
528 * @rwstat: blkg_rwstat to reset
529 */
530static inline void blkg_rwstat_reset(struct blkg_rwstat *rwstat)
531{
532 memset(rwstat->cnt, 0, sizeof(rwstat->cnt));
533}
534
Tejun Heo16b3de62013-01-09 08:05:12 -0800535/**
536 * blkg_rwstat_merge - merge a blkg_rwstat into another
537 * @to: the destination blkg_rwstat
538 * @from: the source
539 *
540 * Add @from's counts to @to.
541 */
542static inline void blkg_rwstat_merge(struct blkg_rwstat *to,
543 struct blkg_rwstat *from)
544{
545 struct blkg_rwstat v = blkg_rwstat_read(from);
546 int i;
547
548 u64_stats_update_begin(&to->syncp);
549 for (i = 0; i < BLKG_RWSTAT_NR; i++)
550 to->cnt[i] += v.cnt[i];
551 u64_stats_update_end(&to->syncp);
552}
553
Tejun Heo36558c82012-04-16 13:57:24 -0700554#else /* CONFIG_BLK_CGROUP */
555
556struct cgroup;
Tejun Heob1208b52012-06-04 20:40:57 -0700557struct blkcg;
Jens Axboe2f5ea472009-12-03 21:06:43 +0100558
Tejun Heof95a04a2012-04-16 13:57:26 -0700559struct blkg_policy_data {
560};
561
Tejun Heo3c798392012-04-16 13:57:25 -0700562struct blkcg_gq {
Jens Axboe2f5ea472009-12-03 21:06:43 +0100563};
564
Tejun Heo3c798392012-04-16 13:57:25 -0700565struct blkcg_policy {
Vivek Goyal3e252062009-12-04 10:36:42 -0500566};
567
Tejun Heo3c798392012-04-16 13:57:25 -0700568static inline struct blkcg_gq *blkg_lookup(struct blkcg *blkcg, void *key) { return NULL; }
Tejun Heo5efd6112012-03-05 13:15:12 -0800569static inline int blkcg_init_queue(struct request_queue *q) { return 0; }
570static inline void blkcg_drain_queue(struct request_queue *q) { }
571static inline void blkcg_exit_queue(struct request_queue *q) { }
Tejun Heo3c798392012-04-16 13:57:25 -0700572static inline int blkcg_policy_register(struct blkcg_policy *pol) { return 0; }
573static inline void blkcg_policy_unregister(struct blkcg_policy *pol) { }
Tejun Heoa2b16932012-04-13 13:11:33 -0700574static inline int blkcg_activate_policy(struct request_queue *q,
Tejun Heo3c798392012-04-16 13:57:25 -0700575 const struct blkcg_policy *pol) { return 0; }
Tejun Heoa2b16932012-04-13 13:11:33 -0700576static inline void blkcg_deactivate_policy(struct request_queue *q,
Tejun Heo3c798392012-04-16 13:57:25 -0700577 const struct blkcg_policy *pol) { }
Vivek Goyal3e252062009-12-04 10:36:42 -0500578
Tejun Heob1208b52012-06-04 20:40:57 -0700579static inline struct blkcg *cgroup_to_blkcg(struct cgroup *cgroup) { return NULL; }
580static inline struct blkcg *bio_blkcg(struct bio *bio) { return NULL; }
Tejun Heoa0516612012-06-26 15:05:44 -0700581
Tejun Heof95a04a2012-04-16 13:57:26 -0700582static inline struct blkg_policy_data *blkg_to_pd(struct blkcg_gq *blkg,
583 struct blkcg_policy *pol) { return NULL; }
584static inline struct blkcg_gq *pd_to_blkg(struct blkg_policy_data *pd) { return NULL; }
Tejun Heo3c798392012-04-16 13:57:25 -0700585static inline char *blkg_path(struct blkcg_gq *blkg) { return NULL; }
586static inline void blkg_get(struct blkcg_gq *blkg) { }
587static inline void blkg_put(struct blkcg_gq *blkg) { }
Vivek Goyalafc24d42010-04-26 19:27:56 +0200588
Tejun Heoa0516612012-06-26 15:05:44 -0700589static inline struct request_list *blk_get_rl(struct request_queue *q,
590 struct bio *bio) { return &q->root_rl; }
591static inline void blk_put_rl(struct request_list *rl) { }
592static inline void blk_rq_set_rl(struct request *rq, struct request_list *rl) { }
593static inline struct request_list *blk_rq_rl(struct request *rq) { return &rq->q->root_rl; }
594
595#define blk_queue_for_each_rl(rl, q) \
596 for ((rl) = &(q)->root_rl; (rl); (rl) = NULL)
597
Tejun Heo36558c82012-04-16 13:57:24 -0700598#endif /* CONFIG_BLK_CGROUP */
599#endif /* _BLK_CGROUP_H */