blob: 65f0c178fd041bdc471287ed734b7cc4fa3bc3eb [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>
Tejun Heoa5049a82014-06-19 17:42:57 -040021#include <linux/atomic.h>
Vivek Goyal31e4c282009-12-03 12:59:42 -050022
Vivek Goyal9355aed2010-10-01 21:16:41 +020023/* Max limits for throttle policy */
24#define THROTL_IOPS_MAX UINT_MAX
25
Tejun Heo3381cb82012-04-01 14:38:44 -070026/* CFQ specific, out here for blkcg->cfq_weight */
27#define CFQ_WEIGHT_MIN 10
28#define CFQ_WEIGHT_MAX 1000
29#define CFQ_WEIGHT_DEFAULT 500
30
Tejun Heof48ec1d2012-04-13 13:11:25 -070031#ifdef CONFIG_BLK_CGROUP
32
Tejun Heoedcb0722012-04-01 14:38:42 -070033enum blkg_rwstat_type {
34 BLKG_RWSTAT_READ,
35 BLKG_RWSTAT_WRITE,
36 BLKG_RWSTAT_SYNC,
37 BLKG_RWSTAT_ASYNC,
38
39 BLKG_RWSTAT_NR,
40 BLKG_RWSTAT_TOTAL = BLKG_RWSTAT_NR,
Divyesh Shah303a3ac2010-04-01 15:01:24 -070041};
42
Tejun Heoa6371202012-04-19 16:29:24 -070043struct blkcg_gq;
44
Tejun Heo3c798392012-04-16 13:57:25 -070045struct blkcg {
Tejun Heo36558c82012-04-16 13:57:24 -070046 struct cgroup_subsys_state css;
47 spinlock_t lock;
Tejun Heoa6371202012-04-19 16:29:24 -070048
49 struct radix_tree_root blkg_tree;
50 struct blkcg_gq *blkg_hint;
Tejun Heo36558c82012-04-16 13:57:24 -070051 struct hlist_head blkg_list;
Tejun Heo9a9e8a22012-03-19 15:10:56 -070052
Tejun Heo3c798392012-04-16 13:57:25 -070053 /* TODO: per-policy storage in blkcg */
Tejun Heo36558c82012-04-16 13:57:24 -070054 unsigned int cfq_weight; /* belongs to cfq */
Tejun Heoe71357e2013-01-09 08:05:10 -080055 unsigned int cfq_leaf_weight;
Vivek Goyal31e4c282009-12-03 12:59:42 -050056};
57
Tejun Heoedcb0722012-04-01 14:38:42 -070058struct blkg_stat {
59 struct u64_stats_sync syncp;
60 uint64_t cnt;
61};
62
63struct blkg_rwstat {
64 struct u64_stats_sync syncp;
65 uint64_t cnt[BLKG_RWSTAT_NR];
66};
67
Tejun Heof95a04a2012-04-16 13:57:26 -070068/*
69 * A blkcg_gq (blkg) is association between a block cgroup (blkcg) and a
70 * request_queue (q). This is used by blkcg policies which need to track
71 * information per blkcg - q pair.
72 *
73 * There can be multiple active blkcg policies and each has its private
74 * data on each blkg, the size of which is determined by
75 * blkcg_policy->pd_size. blkcg core allocates and frees such areas
76 * together with blkg and invokes pd_init/exit_fn() methods.
77 *
78 * Such private data must embed struct blkg_policy_data (pd) at the
79 * beginning and pd_size can't be smaller than pd.
80 */
Tejun Heo03814112012-03-05 13:15:14 -080081struct blkg_policy_data {
Tejun Heob276a872013-01-09 08:05:12 -080082 /* the blkg and policy id this per-policy data belongs to */
Tejun Heo3c798392012-04-16 13:57:25 -070083 struct blkcg_gq *blkg;
Tejun Heob276a872013-01-09 08:05:12 -080084 int plid;
Tejun Heo03814112012-03-05 13:15:14 -080085
Tejun Heoa2b16932012-04-13 13:11:33 -070086 /* used during policy activation */
Tejun Heo36558c82012-04-16 13:57:24 -070087 struct list_head alloc_node;
Tejun Heo03814112012-03-05 13:15:14 -080088};
89
Tejun Heo3c798392012-04-16 13:57:25 -070090/* association between a blk cgroup and a request queue */
91struct blkcg_gq {
Tejun Heoc875f4d2012-03-05 13:15:22 -080092 /* Pointer to the associated request_queue */
Tejun Heo36558c82012-04-16 13:57:24 -070093 struct request_queue *q;
94 struct list_head q_node;
95 struct hlist_node blkcg_node;
Tejun Heo3c798392012-04-16 13:57:25 -070096 struct blkcg *blkcg;
Tejun Heo3c547862013-01-09 08:05:10 -080097
98 /* all non-root blkcg_gq's are guaranteed to have access to parent */
99 struct blkcg_gq *parent;
100
Tejun Heoa0516612012-06-26 15:05:44 -0700101 /* request allocation list for this blkcg-q pair */
102 struct request_list rl;
Tejun Heo3c547862013-01-09 08:05:10 -0800103
Tejun Heo1adaf3d2012-03-05 13:15:15 -0800104 /* reference count */
Tejun Heoa5049a82014-06-19 17:42:57 -0400105 atomic_t refcnt;
Vivek Goyal22084192009-12-03 12:59:49 -0500106
Tejun Heof427d902013-01-09 08:05:12 -0800107 /* is this blkg online? protected by both blkcg and q locks */
108 bool online;
109
Tejun Heo36558c82012-04-16 13:57:24 -0700110 struct blkg_policy_data *pd[BLKCG_MAX_POLS];
Tejun Heo1adaf3d2012-03-05 13:15:15 -0800111
Tejun Heo36558c82012-04-16 13:57:24 -0700112 struct rcu_head rcu_head;
Vivek Goyal31e4c282009-12-03 12:59:42 -0500113};
114
Tejun Heo3c798392012-04-16 13:57:25 -0700115typedef void (blkcg_pol_init_pd_fn)(struct blkcg_gq *blkg);
Tejun Heof427d902013-01-09 08:05:12 -0800116typedef void (blkcg_pol_online_pd_fn)(struct blkcg_gq *blkg);
117typedef void (blkcg_pol_offline_pd_fn)(struct blkcg_gq *blkg);
Tejun Heo3c798392012-04-16 13:57:25 -0700118typedef void (blkcg_pol_exit_pd_fn)(struct blkcg_gq *blkg);
119typedef void (blkcg_pol_reset_pd_stats_fn)(struct blkcg_gq *blkg);
Vivek Goyal3e252062009-12-04 10:36:42 -0500120
Tejun Heo3c798392012-04-16 13:57:25 -0700121struct blkcg_policy {
Tejun Heo36558c82012-04-16 13:57:24 -0700122 int plid;
123 /* policy specific private data size */
Tejun Heof95a04a2012-04-16 13:57:26 -0700124 size_t pd_size;
Tejun Heo36558c82012-04-16 13:57:24 -0700125 /* cgroup files for the policy */
126 struct cftype *cftypes;
Tejun Heof9fcc2d2012-04-16 13:57:27 -0700127
128 /* operations */
129 blkcg_pol_init_pd_fn *pd_init_fn;
Tejun Heof427d902013-01-09 08:05:12 -0800130 blkcg_pol_online_pd_fn *pd_online_fn;
131 blkcg_pol_offline_pd_fn *pd_offline_fn;
Tejun Heof9fcc2d2012-04-16 13:57:27 -0700132 blkcg_pol_exit_pd_fn *pd_exit_fn;
133 blkcg_pol_reset_pd_stats_fn *pd_reset_stats_fn;
Vivek Goyal3e252062009-12-04 10:36:42 -0500134};
135
Tejun Heo3c798392012-04-16 13:57:25 -0700136extern struct blkcg blkcg_root;
Tejun Heo496d5e72015-05-22 17:13:21 -0400137extern struct cgroup_subsys_state * const blkcg_root_css;
Tejun Heo36558c82012-04-16 13:57:24 -0700138
Tejun Heo3c798392012-04-16 13:57:25 -0700139struct blkcg_gq *blkg_lookup(struct blkcg *blkcg, struct request_queue *q);
140struct blkcg_gq *blkg_lookup_create(struct blkcg *blkcg,
141 struct request_queue *q);
Tejun Heo36558c82012-04-16 13:57:24 -0700142int blkcg_init_queue(struct request_queue *q);
143void blkcg_drain_queue(struct request_queue *q);
144void blkcg_exit_queue(struct request_queue *q);
Tejun Heo5efd6112012-03-05 13:15:12 -0800145
Vivek Goyal3e252062009-12-04 10:36:42 -0500146/* Blkio controller policy registration */
Jens Axboed5bf0292014-06-22 16:31:56 -0600147int blkcg_policy_register(struct blkcg_policy *pol);
Tejun Heo3c798392012-04-16 13:57:25 -0700148void blkcg_policy_unregister(struct blkcg_policy *pol);
Tejun Heo36558c82012-04-16 13:57:24 -0700149int blkcg_activate_policy(struct request_queue *q,
Tejun Heo3c798392012-04-16 13:57:25 -0700150 const struct blkcg_policy *pol);
Tejun Heo36558c82012-04-16 13:57:24 -0700151void blkcg_deactivate_policy(struct request_queue *q,
Tejun Heo3c798392012-04-16 13:57:25 -0700152 const struct blkcg_policy *pol);
Vivek Goyal3e252062009-12-04 10:36:42 -0500153
Tejun Heo3c798392012-04-16 13:57:25 -0700154void blkcg_print_blkgs(struct seq_file *sf, struct blkcg *blkcg,
Tejun Heof95a04a2012-04-16 13:57:26 -0700155 u64 (*prfill)(struct seq_file *,
156 struct blkg_policy_data *, int),
Tejun Heo3c798392012-04-16 13:57:25 -0700157 const struct blkcg_policy *pol, int data,
Tejun Heoec399342012-04-13 13:11:27 -0700158 bool show_total);
Tejun Heof95a04a2012-04-16 13:57:26 -0700159u64 __blkg_prfill_u64(struct seq_file *sf, struct blkg_policy_data *pd, u64 v);
160u64 __blkg_prfill_rwstat(struct seq_file *sf, struct blkg_policy_data *pd,
Tejun Heo829fdb52012-04-01 14:38:43 -0700161 const struct blkg_rwstat *rwstat);
Tejun Heof95a04a2012-04-16 13:57:26 -0700162u64 blkg_prfill_stat(struct seq_file *sf, struct blkg_policy_data *pd, int off);
163u64 blkg_prfill_rwstat(struct seq_file *sf, struct blkg_policy_data *pd,
164 int off);
Tejun Heo829fdb52012-04-01 14:38:43 -0700165
Tejun Heo16b3de62013-01-09 08:05:12 -0800166u64 blkg_stat_recursive_sum(struct blkg_policy_data *pd, int off);
167struct blkg_rwstat blkg_rwstat_recursive_sum(struct blkg_policy_data *pd,
168 int off);
169
Tejun Heo829fdb52012-04-01 14:38:43 -0700170struct blkg_conf_ctx {
Tejun Heo36558c82012-04-16 13:57:24 -0700171 struct gendisk *disk;
Tejun Heo3c798392012-04-16 13:57:25 -0700172 struct blkcg_gq *blkg;
Tejun Heo36558c82012-04-16 13:57:24 -0700173 u64 v;
Tejun Heo829fdb52012-04-01 14:38:43 -0700174};
175
Tejun Heo3c798392012-04-16 13:57:25 -0700176int blkg_conf_prep(struct blkcg *blkcg, const struct blkcg_policy *pol,
177 const char *input, struct blkg_conf_ctx *ctx);
Tejun Heo829fdb52012-04-01 14:38:43 -0700178void blkg_conf_finish(struct blkg_conf_ctx *ctx);
179
180
Tejun Heoa7c6d552013-08-08 20:11:23 -0400181static inline struct blkcg *css_to_blkcg(struct cgroup_subsys_state *css)
182{
183 return css ? container_of(css, struct blkcg, css) : NULL;
184}
185
Tejun Heob1208b52012-06-04 20:40:57 -0700186static inline struct blkcg *task_blkcg(struct task_struct *tsk)
187{
Tejun Heo073219e2014-02-08 10:36:58 -0500188 return css_to_blkcg(task_css(tsk, blkio_cgrp_id));
Tejun Heob1208b52012-06-04 20:40:57 -0700189}
190
191static inline struct blkcg *bio_blkcg(struct bio *bio)
192{
193 if (bio && bio->bi_css)
Tejun Heoa7c6d552013-08-08 20:11:23 -0400194 return css_to_blkcg(bio->bi_css);
Tejun Heob1208b52012-06-04 20:40:57 -0700195 return task_blkcg(current);
196}
197
Tejun Heo03814112012-03-05 13:15:14 -0800198/**
Tejun Heo3c547862013-01-09 08:05:10 -0800199 * blkcg_parent - get the parent of a blkcg
200 * @blkcg: blkcg of interest
201 *
202 * Return the parent blkcg of @blkcg. Can be called anytime.
203 */
204static inline struct blkcg *blkcg_parent(struct blkcg *blkcg)
205{
Tejun Heo5c9d5352014-05-16 13:22:48 -0400206 return css_to_blkcg(blkcg->css.parent);
Tejun Heo3c547862013-01-09 08:05:10 -0800207}
208
209/**
Tejun Heo03814112012-03-05 13:15:14 -0800210 * blkg_to_pdata - get policy private data
211 * @blkg: blkg of interest
212 * @pol: policy of interest
213 *
214 * Return pointer to private data associated with the @blkg-@pol pair.
215 */
Tejun Heof95a04a2012-04-16 13:57:26 -0700216static inline struct blkg_policy_data *blkg_to_pd(struct blkcg_gq *blkg,
217 struct blkcg_policy *pol)
Tejun Heo03814112012-03-05 13:15:14 -0800218{
Tejun Heof95a04a2012-04-16 13:57:26 -0700219 return blkg ? blkg->pd[pol->plid] : NULL;
Tejun Heo03814112012-03-05 13:15:14 -0800220}
221
222/**
223 * pdata_to_blkg - get blkg associated with policy private data
Tejun Heof95a04a2012-04-16 13:57:26 -0700224 * @pd: policy private data of interest
Tejun Heo03814112012-03-05 13:15:14 -0800225 *
Tejun Heof95a04a2012-04-16 13:57:26 -0700226 * @pd is policy private data. Determine the blkg it's associated with.
Tejun Heo03814112012-03-05 13:15:14 -0800227 */
Tejun Heof95a04a2012-04-16 13:57:26 -0700228static inline struct blkcg_gq *pd_to_blkg(struct blkg_policy_data *pd)
Tejun Heo03814112012-03-05 13:15:14 -0800229{
Tejun Heof95a04a2012-04-16 13:57:26 -0700230 return pd ? pd->blkg : NULL;
Tejun Heo03814112012-03-05 13:15:14 -0800231}
232
Tejun Heo54e7ed12012-04-16 13:57:23 -0700233/**
234 * blkg_path - format cgroup path of blkg
235 * @blkg: blkg of interest
236 * @buf: target buffer
237 * @buflen: target buffer length
238 *
239 * Format the path of the cgroup of @blkg into @buf.
240 */
Tejun Heo3c798392012-04-16 13:57:25 -0700241static inline int blkg_path(struct blkcg_gq *blkg, char *buf, int buflen)
Vivek Goyalafc24d42010-04-26 19:27:56 +0200242{
Tejun Heoe61734c2014-02-12 09:29:50 -0500243 char *p;
Tejun Heo54e7ed12012-04-16 13:57:23 -0700244
Tejun Heoe61734c2014-02-12 09:29:50 -0500245 p = cgroup_path(blkg->blkcg->css.cgroup, buf, buflen);
246 if (!p) {
Tejun Heo54e7ed12012-04-16 13:57:23 -0700247 strncpy(buf, "<unavailable>", buflen);
Tejun Heoe61734c2014-02-12 09:29:50 -0500248 return -ENAMETOOLONG;
249 }
250
251 memmove(buf, p, buf + buflen - p);
252 return 0;
Vivek Goyalafc24d42010-04-26 19:27:56 +0200253}
254
Tejun Heo1adaf3d2012-03-05 13:15:15 -0800255/**
256 * blkg_get - get a blkg reference
257 * @blkg: blkg to get
258 *
Tejun Heoa5049a82014-06-19 17:42:57 -0400259 * The caller should be holding an existing reference.
Tejun Heo1adaf3d2012-03-05 13:15:15 -0800260 */
Tejun Heo3c798392012-04-16 13:57:25 -0700261static inline void blkg_get(struct blkcg_gq *blkg)
Tejun Heo1adaf3d2012-03-05 13:15:15 -0800262{
Tejun Heoa5049a82014-06-19 17:42:57 -0400263 WARN_ON_ONCE(atomic_read(&blkg->refcnt) <= 0);
264 atomic_inc(&blkg->refcnt);
Tejun Heo1adaf3d2012-03-05 13:15:15 -0800265}
266
Tejun Heo2a4fd072013-05-14 13:52:31 -0700267void __blkg_release_rcu(struct rcu_head *rcu);
Tejun Heo1adaf3d2012-03-05 13:15:15 -0800268
269/**
270 * blkg_put - put a blkg reference
271 * @blkg: blkg to put
Tejun Heo1adaf3d2012-03-05 13:15:15 -0800272 */
Tejun Heo3c798392012-04-16 13:57:25 -0700273static inline void blkg_put(struct blkcg_gq *blkg)
Tejun Heo1adaf3d2012-03-05 13:15:15 -0800274{
Tejun Heoa5049a82014-06-19 17:42:57 -0400275 WARN_ON_ONCE(atomic_read(&blkg->refcnt) <= 0);
276 if (atomic_dec_and_test(&blkg->refcnt))
Tejun Heo2a4fd072013-05-14 13:52:31 -0700277 call_rcu(&blkg->rcu_head, __blkg_release_rcu);
Tejun Heo1adaf3d2012-03-05 13:15:15 -0800278}
279
Tejun Heodd4a4ff2013-05-14 13:52:30 -0700280struct blkcg_gq *__blkg_lookup(struct blkcg *blkcg, struct request_queue *q,
281 bool update_hint);
282
283/**
284 * blkg_for_each_descendant_pre - pre-order walk of a blkg's descendants
285 * @d_blkg: loop cursor pointing to the current descendant
Tejun Heo492eb212013-08-08 20:11:25 -0400286 * @pos_css: used for iteration
Tejun Heodd4a4ff2013-05-14 13:52:30 -0700287 * @p_blkg: target blkg to walk descendants of
288 *
289 * Walk @c_blkg through the descendants of @p_blkg. Must be used with RCU
290 * read locked. If called under either blkcg or queue lock, the iteration
291 * is guaranteed to include all and only online blkgs. The caller may
Tejun Heo492eb212013-08-08 20:11:25 -0400292 * update @pos_css by calling css_rightmost_descendant() to skip subtree.
Tejun Heobd8815a2013-08-08 20:11:27 -0400293 * @p_blkg is included in the iteration and the first node to be visited.
Tejun Heodd4a4ff2013-05-14 13:52:30 -0700294 */
Tejun Heo492eb212013-08-08 20:11:25 -0400295#define blkg_for_each_descendant_pre(d_blkg, pos_css, p_blkg) \
296 css_for_each_descendant_pre((pos_css), &(p_blkg)->blkcg->css) \
297 if (((d_blkg) = __blkg_lookup(css_to_blkcg(pos_css), \
Tejun Heodd4a4ff2013-05-14 13:52:30 -0700298 (p_blkg)->q, false)))
299
Tejun Heoedcb0722012-04-01 14:38:42 -0700300/**
Tejun Heoaa539cb2013-05-14 13:52:31 -0700301 * blkg_for_each_descendant_post - post-order walk of a blkg's descendants
302 * @d_blkg: loop cursor pointing to the current descendant
Tejun Heo492eb212013-08-08 20:11:25 -0400303 * @pos_css: used for iteration
Tejun Heoaa539cb2013-05-14 13:52:31 -0700304 * @p_blkg: target blkg to walk descendants of
305 *
306 * Similar to blkg_for_each_descendant_pre() but performs post-order
Tejun Heobd8815a2013-08-08 20:11:27 -0400307 * traversal instead. Synchronization rules are the same. @p_blkg is
308 * included in the iteration and the last node to be visited.
Tejun Heoaa539cb2013-05-14 13:52:31 -0700309 */
Tejun Heo492eb212013-08-08 20:11:25 -0400310#define blkg_for_each_descendant_post(d_blkg, pos_css, p_blkg) \
311 css_for_each_descendant_post((pos_css), &(p_blkg)->blkcg->css) \
312 if (((d_blkg) = __blkg_lookup(css_to_blkcg(pos_css), \
Tejun Heoaa539cb2013-05-14 13:52:31 -0700313 (p_blkg)->q, false)))
314
315/**
Tejun Heoa0516612012-06-26 15:05:44 -0700316 * blk_get_rl - get request_list to use
317 * @q: request_queue of interest
318 * @bio: bio which will be attached to the allocated request (may be %NULL)
319 *
320 * The caller wants to allocate a request from @q to use for @bio. Find
321 * the request_list to use and obtain a reference on it. Should be called
322 * under queue_lock. This function is guaranteed to return non-%NULL
323 * request_list.
324 */
325static inline struct request_list *blk_get_rl(struct request_queue *q,
326 struct bio *bio)
327{
328 struct blkcg *blkcg;
329 struct blkcg_gq *blkg;
330
331 rcu_read_lock();
332
333 blkcg = bio_blkcg(bio);
334
335 /* bypass blkg lookup and use @q->root_rl directly for root */
336 if (blkcg == &blkcg_root)
337 goto root_rl;
338
339 /*
340 * Try to use blkg->rl. blkg lookup may fail under memory pressure
341 * or if either the blkcg or queue is going away. Fall back to
342 * root_rl in such cases.
343 */
344 blkg = blkg_lookup_create(blkcg, q);
345 if (unlikely(IS_ERR(blkg)))
346 goto root_rl;
347
348 blkg_get(blkg);
349 rcu_read_unlock();
350 return &blkg->rl;
351root_rl:
352 rcu_read_unlock();
353 return &q->root_rl;
354}
355
356/**
357 * blk_put_rl - put request_list
358 * @rl: request_list to put
359 *
360 * Put the reference acquired by blk_get_rl(). Should be called under
361 * queue_lock.
362 */
363static inline void blk_put_rl(struct request_list *rl)
364{
365 /* root_rl may not have blkg set */
366 if (rl->blkg && rl->blkg->blkcg != &blkcg_root)
367 blkg_put(rl->blkg);
368}
369
370/**
371 * blk_rq_set_rl - associate a request with a request_list
372 * @rq: request of interest
373 * @rl: target request_list
374 *
375 * Associate @rq with @rl so that accounting and freeing can know the
376 * request_list @rq came from.
377 */
378static inline void blk_rq_set_rl(struct request *rq, struct request_list *rl)
379{
380 rq->rl = rl;
381}
382
383/**
384 * blk_rq_rl - return the request_list a request came from
385 * @rq: request of interest
386 *
387 * Return the request_list @rq is allocated from.
388 */
389static inline struct request_list *blk_rq_rl(struct request *rq)
390{
391 return rq->rl;
392}
393
394struct request_list *__blk_queue_next_rl(struct request_list *rl,
395 struct request_queue *q);
396/**
397 * blk_queue_for_each_rl - iterate through all request_lists of a request_queue
398 *
399 * Should be used under queue_lock.
400 */
401#define blk_queue_for_each_rl(rl, q) \
402 for ((rl) = &(q)->root_rl; (rl); (rl) = __blk_queue_next_rl((rl), (q)))
403
Peter Zijlstra90d38392013-11-12 19:42:14 -0800404static inline void blkg_stat_init(struct blkg_stat *stat)
405{
406 u64_stats_init(&stat->syncp);
407}
408
Tejun Heoa0516612012-06-26 15:05:44 -0700409/**
Tejun Heoedcb0722012-04-01 14:38:42 -0700410 * blkg_stat_add - add a value to a blkg_stat
411 * @stat: target blkg_stat
412 * @val: value to add
413 *
414 * Add @val to @stat. The caller is responsible for synchronizing calls to
415 * this function.
416 */
417static inline void blkg_stat_add(struct blkg_stat *stat, uint64_t val)
418{
419 u64_stats_update_begin(&stat->syncp);
420 stat->cnt += val;
421 u64_stats_update_end(&stat->syncp);
422}
423
424/**
425 * blkg_stat_read - read the current value of a blkg_stat
426 * @stat: blkg_stat to read
427 *
428 * Read the current value of @stat. This function can be called without
429 * synchroniztion and takes care of u64 atomicity.
430 */
431static inline uint64_t blkg_stat_read(struct blkg_stat *stat)
432{
433 unsigned int start;
434 uint64_t v;
435
436 do {
Eric W. Biederman57a77442014-03-13 21:26:42 -0700437 start = u64_stats_fetch_begin_irq(&stat->syncp);
Tejun Heoedcb0722012-04-01 14:38:42 -0700438 v = stat->cnt;
Eric W. Biederman57a77442014-03-13 21:26:42 -0700439 } while (u64_stats_fetch_retry_irq(&stat->syncp, start));
Tejun Heoedcb0722012-04-01 14:38:42 -0700440
441 return v;
442}
443
444/**
445 * blkg_stat_reset - reset a blkg_stat
446 * @stat: blkg_stat to reset
447 */
448static inline void blkg_stat_reset(struct blkg_stat *stat)
449{
450 stat->cnt = 0;
451}
452
453/**
Tejun Heo16b3de62013-01-09 08:05:12 -0800454 * blkg_stat_merge - merge a blkg_stat into another
455 * @to: the destination blkg_stat
456 * @from: the source
457 *
458 * Add @from's count to @to.
459 */
460static inline void blkg_stat_merge(struct blkg_stat *to, struct blkg_stat *from)
461{
462 blkg_stat_add(to, blkg_stat_read(from));
463}
464
Peter Zijlstra90d38392013-11-12 19:42:14 -0800465static inline void blkg_rwstat_init(struct blkg_rwstat *rwstat)
466{
467 u64_stats_init(&rwstat->syncp);
468}
469
Tejun Heo16b3de62013-01-09 08:05:12 -0800470/**
Tejun Heoedcb0722012-04-01 14:38:42 -0700471 * blkg_rwstat_add - add a value to a blkg_rwstat
472 * @rwstat: target blkg_rwstat
473 * @rw: mask of REQ_{WRITE|SYNC}
474 * @val: value to add
475 *
476 * Add @val to @rwstat. The counters are chosen according to @rw. The
477 * caller is responsible for synchronizing calls to this function.
478 */
479static inline void blkg_rwstat_add(struct blkg_rwstat *rwstat,
480 int rw, uint64_t val)
481{
482 u64_stats_update_begin(&rwstat->syncp);
483
484 if (rw & REQ_WRITE)
485 rwstat->cnt[BLKG_RWSTAT_WRITE] += val;
486 else
487 rwstat->cnt[BLKG_RWSTAT_READ] += val;
488 if (rw & REQ_SYNC)
489 rwstat->cnt[BLKG_RWSTAT_SYNC] += val;
490 else
491 rwstat->cnt[BLKG_RWSTAT_ASYNC] += val;
492
493 u64_stats_update_end(&rwstat->syncp);
494}
495
496/**
497 * blkg_rwstat_read - read the current values of a blkg_rwstat
498 * @rwstat: blkg_rwstat to read
499 *
500 * Read the current snapshot of @rwstat and return it as the return value.
501 * This function can be called without synchronization and takes care of
502 * u64 atomicity.
503 */
Tejun Heoc94bed892012-04-16 13:57:22 -0700504static inline struct blkg_rwstat blkg_rwstat_read(struct blkg_rwstat *rwstat)
Tejun Heoedcb0722012-04-01 14:38:42 -0700505{
506 unsigned int start;
507 struct blkg_rwstat tmp;
508
509 do {
Eric W. Biederman57a77442014-03-13 21:26:42 -0700510 start = u64_stats_fetch_begin_irq(&rwstat->syncp);
Tejun Heoedcb0722012-04-01 14:38:42 -0700511 tmp = *rwstat;
Eric W. Biederman57a77442014-03-13 21:26:42 -0700512 } while (u64_stats_fetch_retry_irq(&rwstat->syncp, start));
Tejun Heoedcb0722012-04-01 14:38:42 -0700513
514 return tmp;
515}
516
517/**
Tejun Heo4d5e80a2013-01-09 08:05:12 -0800518 * blkg_rwstat_total - read the total count of a blkg_rwstat
Tejun Heoedcb0722012-04-01 14:38:42 -0700519 * @rwstat: blkg_rwstat to read
520 *
521 * Return the total count of @rwstat regardless of the IO direction. This
522 * function can be called without synchronization and takes care of u64
523 * atomicity.
524 */
Tejun Heo4d5e80a2013-01-09 08:05:12 -0800525static inline uint64_t blkg_rwstat_total(struct blkg_rwstat *rwstat)
Tejun Heoedcb0722012-04-01 14:38:42 -0700526{
527 struct blkg_rwstat tmp = blkg_rwstat_read(rwstat);
528
529 return tmp.cnt[BLKG_RWSTAT_READ] + tmp.cnt[BLKG_RWSTAT_WRITE];
530}
531
532/**
533 * blkg_rwstat_reset - reset a blkg_rwstat
534 * @rwstat: blkg_rwstat to reset
535 */
536static inline void blkg_rwstat_reset(struct blkg_rwstat *rwstat)
537{
538 memset(rwstat->cnt, 0, sizeof(rwstat->cnt));
539}
540
Tejun Heo16b3de62013-01-09 08:05:12 -0800541/**
542 * blkg_rwstat_merge - merge a blkg_rwstat into another
543 * @to: the destination blkg_rwstat
544 * @from: the source
545 *
546 * Add @from's counts to @to.
547 */
548static inline void blkg_rwstat_merge(struct blkg_rwstat *to,
549 struct blkg_rwstat *from)
550{
551 struct blkg_rwstat v = blkg_rwstat_read(from);
552 int i;
553
554 u64_stats_update_begin(&to->syncp);
555 for (i = 0; i < BLKG_RWSTAT_NR; i++)
556 to->cnt[i] += v.cnt[i];
557 u64_stats_update_end(&to->syncp);
558}
559
Tejun Heo36558c82012-04-16 13:57:24 -0700560#else /* CONFIG_BLK_CGROUP */
561
Tejun Heoefa7d1c2015-05-22 17:13:18 -0400562struct blkcg {
563};
Jens Axboe2f5ea472009-12-03 21:06:43 +0100564
Tejun Heof95a04a2012-04-16 13:57:26 -0700565struct blkg_policy_data {
566};
567
Tejun Heo3c798392012-04-16 13:57:25 -0700568struct blkcg_gq {
Jens Axboe2f5ea472009-12-03 21:06:43 +0100569};
570
Tejun Heo3c798392012-04-16 13:57:25 -0700571struct blkcg_policy {
Vivek Goyal3e252062009-12-04 10:36:42 -0500572};
573
Tejun Heo496d5e72015-05-22 17:13:21 -0400574#define blkcg_root_css ((struct cgroup_subsys_state *)ERR_PTR(-EINVAL))
575
Tejun Heoefa7d1c2015-05-22 17:13:18 -0400576#ifdef CONFIG_BLOCK
577
Tejun Heo3c798392012-04-16 13:57:25 -0700578static inline struct blkcg_gq *blkg_lookup(struct blkcg *blkcg, void *key) { return NULL; }
Tejun Heo5efd6112012-03-05 13:15:12 -0800579static inline int blkcg_init_queue(struct request_queue *q) { return 0; }
580static inline void blkcg_drain_queue(struct request_queue *q) { }
581static inline void blkcg_exit_queue(struct request_queue *q) { }
Jens Axboed5bf0292014-06-22 16:31:56 -0600582static inline int blkcg_policy_register(struct blkcg_policy *pol) { return 0; }
Tejun Heo3c798392012-04-16 13:57:25 -0700583static inline void blkcg_policy_unregister(struct blkcg_policy *pol) { }
Tejun Heoa2b16932012-04-13 13:11:33 -0700584static inline int blkcg_activate_policy(struct request_queue *q,
Tejun Heo3c798392012-04-16 13:57:25 -0700585 const struct blkcg_policy *pol) { return 0; }
Tejun Heoa2b16932012-04-13 13:11:33 -0700586static inline void blkcg_deactivate_policy(struct request_queue *q,
Tejun Heo3c798392012-04-16 13:57:25 -0700587 const struct blkcg_policy *pol) { }
Vivek Goyal3e252062009-12-04 10:36:42 -0500588
Tejun Heob1208b52012-06-04 20:40:57 -0700589static inline struct blkcg *bio_blkcg(struct bio *bio) { return NULL; }
Tejun Heoa0516612012-06-26 15:05:44 -0700590
Tejun Heof95a04a2012-04-16 13:57:26 -0700591static inline struct blkg_policy_data *blkg_to_pd(struct blkcg_gq *blkg,
592 struct blkcg_policy *pol) { return NULL; }
593static inline struct blkcg_gq *pd_to_blkg(struct blkg_policy_data *pd) { return NULL; }
Tejun Heo3c798392012-04-16 13:57:25 -0700594static inline char *blkg_path(struct blkcg_gq *blkg) { return NULL; }
595static inline void blkg_get(struct blkcg_gq *blkg) { }
596static inline void blkg_put(struct blkcg_gq *blkg) { }
Vivek Goyalafc24d42010-04-26 19:27:56 +0200597
Tejun Heoa0516612012-06-26 15:05:44 -0700598static inline struct request_list *blk_get_rl(struct request_queue *q,
599 struct bio *bio) { return &q->root_rl; }
600static inline void blk_put_rl(struct request_list *rl) { }
601static inline void blk_rq_set_rl(struct request *rq, struct request_list *rl) { }
602static inline struct request_list *blk_rq_rl(struct request *rq) { return &rq->q->root_rl; }
603
604#define blk_queue_for_each_rl(rl, q) \
605 for ((rl) = &(q)->root_rl; (rl); (rl) = NULL)
606
Tejun Heoefa7d1c2015-05-22 17:13:18 -0400607#endif /* CONFIG_BLOCK */
Tejun Heo36558c82012-04-16 13:57:24 -0700608#endif /* CONFIG_BLK_CGROUP */
609#endif /* _BLK_CGROUP_H */