blk-cgroup.c 26.4 KB
Newer Older
1
2
3
4
5
6
7
8
9
10
11
12
13
/*
 * Common Block IO controller cgroup interface
 *
 * Based on ideas and code from CFQ, CFS and BFQ:
 * Copyright (C) 2003 Jens Axboe <axboe@kernel.dk>
 *
 * Copyright (C) 2008 Fabio Checconi <fabio@gandalf.sssup.it>
 *		      Paolo Valente <paolo.valente@unimore.it>
 *
 * Copyright (C) 2009 Vivek Goyal <vgoyal@redhat.com>
 * 	              Nauman Rafique <nauman@google.com>
 */
#include <linux/ioprio.h>
14
#include <linux/kdev_t.h>
15
#include <linux/module.h>
16
#include <linux/err.h>
17
#include <linux/blkdev.h>
18
#include <linux/slab.h>
19
#include <linux/genhd.h>
20
#include <linux/delay.h>
Tejun Heo's avatar
Tejun Heo committed
21
#include <linux/atomic.h>
22
#include "blk-cgroup.h"
23
#include "blk.h"
24

25
26
#define MAX_KEY_LEN 100

27
static DEFINE_MUTEX(blkcg_pol_mutex);
28

Tejun Heo's avatar
Tejun Heo committed
29
30
struct blkcg blkcg_root = { .cfq_weight = 2 * CFQ_WEIGHT_DEFAULT,
			    .cfq_leaf_weight = 2 * CFQ_WEIGHT_DEFAULT, };
Tejun Heo's avatar
Tejun Heo committed
31
EXPORT_SYMBOL_GPL(blkcg_root);
32

Tejun Heo's avatar
Tejun Heo committed
33
static struct blkcg_policy *blkcg_policy[BLKCG_MAX_POLS];
34

35
static bool blkcg_policy_enabled(struct request_queue *q,
Tejun Heo's avatar
Tejun Heo committed
36
				 const struct blkcg_policy *pol)
37
38
39
40
{
	return pol && test_bit(pol->plid, q->blkcg_pols);
}

41
42
43
44
45
46
/**
 * blkg_free - free a blkg
 * @blkg: blkg to free
 *
 * Free @blkg which may be partially allocated.
 */
Tejun Heo's avatar
Tejun Heo committed
47
static void blkg_free(struct blkcg_gq *blkg)
48
{
49
	int i;
50
51
52
53

	if (!blkg)
		return;

54
	for (i = 0; i < BLKCG_MAX_POLS; i++) {
Tejun Heo's avatar
Tejun Heo committed
55
		struct blkcg_policy *pol = blkcg_policy[i];
56
57
		struct blkg_policy_data *pd = blkg->pd[i];

58
59
60
		if (!pd)
			continue;

61
62
		if (pol && pol->pd_exit_fn)
			pol->pd_exit_fn(blkg);
63
64

		kfree(pd);
65
	}
66

67
	blk_exit_rl(&blkg->rl);
68
	kfree(blkg);
69
70
71
72
73
74
}

/**
 * blkg_alloc - allocate a blkg
 * @blkcg: block cgroup the new blkg is associated with
 * @q: request_queue the new blkg is associated with
75
 * @gfp_mask: allocation mask to use
76
 *
77
 * Allocate a new blkg assocating @blkcg and @q.
78
 */
79
80
static struct blkcg_gq *blkg_alloc(struct blkcg *blkcg, struct request_queue *q,
				   gfp_t gfp_mask)
81
{
Tejun Heo's avatar
Tejun Heo committed
82
	struct blkcg_gq *blkg;
83
	int i;
84
85

	/* alloc and init base part */
86
	blkg = kzalloc_node(sizeof(*blkg), gfp_mask, q->node);
87
88
89
	if (!blkg)
		return NULL;

90
	blkg->q = q;
91
	INIT_LIST_HEAD(&blkg->q_node);
92
	blkg->blkcg = blkcg;
Tejun Heo's avatar
Tejun Heo committed
93
	blkg->refcnt = 1;
94

95
96
97
98
99
100
101
	/* root blkg uses @q->root_rl, init rl only for !root blkgs */
	if (blkcg != &blkcg_root) {
		if (blk_init_rl(&blkg->rl, q, gfp_mask))
			goto err_free;
		blkg->rl.blkg = blkg;
	}

102
	for (i = 0; i < BLKCG_MAX_POLS; i++) {
Tejun Heo's avatar
Tejun Heo committed
103
		struct blkcg_policy *pol = blkcg_policy[i];
104
		struct blkg_policy_data *pd;
105

106
		if (!blkcg_policy_enabled(q, pol))
107
108
109
			continue;

		/* alloc per-policy data and attach it to blkg */
110
		pd = kzalloc_node(pol->pd_size, gfp_mask, q->node);
111
112
		if (!pd)
			goto err_free;
113

114
115
		blkg->pd[i] = pd;
		pd->blkg = blkg;
Tejun Heo's avatar
Tejun Heo committed
116
		pd->plid = i;
117

118
		/* invoke per-policy init */
119
		if (pol->pd_init_fn)
120
			pol->pd_init_fn(blkg);
121
122
	}

123
	return blkg;
124
125
126
127

err_free:
	blkg_free(blkg);
	return NULL;
128
129
}

Tejun Heo's avatar
Tejun Heo committed
130
static struct blkcg_gq *__blkg_lookup(struct blkcg *blkcg,
131
				      struct request_queue *q, bool update_hint)
132
{
Tejun Heo's avatar
Tejun Heo committed
133
	struct blkcg_gq *blkg;
134

135
136
137
138
139
	blkg = rcu_dereference(blkcg->blkg_hint);
	if (blkg && blkg->q == q)
		return blkg;

	/*
140
141
142
143
	 * Hint didn't match.  Look up from the radix tree.  Note that the
	 * hint can only be updated under queue_lock as otherwise @blkg
	 * could have already been removed from blkg_tree.  The caller is
	 * responsible for grabbing queue_lock if @update_hint.
144
145
	 */
	blkg = radix_tree_lookup(&blkcg->blkg_tree, q->id);
146
147
148
149
150
	if (blkg && blkg->q == q) {
		if (update_hint) {
			lockdep_assert_held(q->queue_lock);
			rcu_assign_pointer(blkcg->blkg_hint, blkg);
		}
151
		return blkg;
152
	}
153

154
155
156
157
158
159
160
161
162
163
164
165
	return NULL;
}

/**
 * blkg_lookup - lookup blkg for the specified blkcg - q pair
 * @blkcg: blkcg of interest
 * @q: request_queue of interest
 *
 * Lookup blkg for the @blkcg - @q pair.  This function should be called
 * under RCU read lock and is guaranteed to return %NULL if @q is bypassing
 * - see blk_queue_bypass_start() for details.
 */
Tejun Heo's avatar
Tejun Heo committed
166
struct blkcg_gq *blkg_lookup(struct blkcg *blkcg, struct request_queue *q)
167
168
169
170
171
{
	WARN_ON_ONCE(!rcu_read_lock_held());

	if (unlikely(blk_queue_bypass(q)))
		return NULL;
172
	return __blkg_lookup(blkcg, q, false);
173
174
175
}
EXPORT_SYMBOL_GPL(blkg_lookup);

176
177
178
179
/*
 * If @new_blkg is %NULL, this function tries to allocate a new one as
 * necessary using %GFP_ATOMIC.  @new_blkg is always consumed on return.
 */
180
181
182
static struct blkcg_gq *blkg_create(struct blkcg *blkcg,
				    struct request_queue *q,
				    struct blkcg_gq *new_blkg)
183
{
Tejun Heo's avatar
Tejun Heo committed
184
	struct blkcg_gq *blkg;
185
	int i, ret;
186

187
188
189
	WARN_ON_ONCE(!rcu_read_lock_held());
	lockdep_assert_held(q->queue_lock);

190
	/* blkg holds a reference to blkcg */
191
	if (!css_tryget(&blkcg->css)) {
192
193
		ret = -EINVAL;
		goto err_free_blkg;
194
	}
195

196
	/* allocate */
197
198
199
	if (!new_blkg) {
		new_blkg = blkg_alloc(blkcg, q, GFP_ATOMIC);
		if (unlikely(!new_blkg)) {
200
201
			ret = -ENOMEM;
			goto err_put_css;
202
203
204
		}
	}
	blkg = new_blkg;
205

206
207
208
209
210
211
212
213
214
215
	/* link parent and insert */
	if (blkcg_parent(blkcg)) {
		blkg->parent = __blkg_lookup(blkcg_parent(blkcg), q, false);
		if (WARN_ON_ONCE(!blkg->parent)) {
			blkg = ERR_PTR(-EINVAL);
			goto err_put_css;
		}
		blkg_get(blkg->parent);
	}

216
	spin_lock(&blkcg->lock);
217
218
219
220
	ret = radix_tree_insert(&blkcg->blkg_tree, q->id, blkg);
	if (likely(!ret)) {
		hlist_add_head_rcu(&blkg->blkcg_node, &blkcg->blkg_list);
		list_add(&blkg->q_node, &q->blkg_list);
221
222
223
224
225
226
227

		for (i = 0; i < BLKCG_MAX_POLS; i++) {
			struct blkcg_policy *pol = blkcg_policy[i];

			if (blkg->pd[i] && pol->pd_online_fn)
				pol->pd_online_fn(blkg);
		}
228
	}
229
	blkg->online = true;
230
	spin_unlock(&blkcg->lock);
231

232
233
	if (!ret)
		return blkg;
234

235
236
237
238
	/* @blkg failed fully initialized, use the usual release path */
	blkg_put(blkg);
	return ERR_PTR(ret);

239
err_put_css:
240
	css_put(&blkcg->css);
241
err_free_blkg:
242
	blkg_free(new_blkg);
243
	return ERR_PTR(ret);
244
}
245

246
247
248
249
250
251
/**
 * blkg_lookup_create - lookup blkg, try to create one if not there
 * @blkcg: blkcg of interest
 * @q: request_queue of interest
 *
 * Lookup blkg for the @blkcg - @q pair.  If it doesn't exist, try to
252
253
254
 * create one.  blkg creation is performed recursively from blkcg_root such
 * that all non-root blkg's have access to the parent blkg.  This function
 * should be called under RCU read lock and @q->queue_lock.
255
256
257
258
259
 *
 * Returns pointer to the looked up or created blkg on success, ERR_PTR()
 * value on error.  If @q is dead, returns ERR_PTR(-EINVAL).  If @q is not
 * dead and bypassing, returns ERR_PTR(-EBUSY).
 */
Tejun Heo's avatar
Tejun Heo committed
260
261
struct blkcg_gq *blkg_lookup_create(struct blkcg *blkcg,
				    struct request_queue *q)
262
{
263
264
265
266
267
	struct blkcg_gq *blkg;

	WARN_ON_ONCE(!rcu_read_lock_held());
	lockdep_assert_held(q->queue_lock);

268
269
270
271
272
	/*
	 * This could be the first entry point of blkcg implementation and
	 * we shouldn't allow anything to go through for a bypassing queue.
	 */
	if (unlikely(blk_queue_bypass(q)))
273
		return ERR_PTR(blk_queue_dying(q) ? -EINVAL : -EBUSY);
274
275
276
277
278

	blkg = __blkg_lookup(blkcg, q, true);
	if (blkg)
		return blkg;

279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
	/*
	 * Create blkgs walking down from blkcg_root to @blkcg, so that all
	 * non-root blkgs have access to their parents.
	 */
	while (true) {
		struct blkcg *pos = blkcg;
		struct blkcg *parent = blkcg_parent(blkcg);

		while (parent && !__blkg_lookup(parent, q, false)) {
			pos = parent;
			parent = blkcg_parent(parent);
		}

		blkg = blkg_create(pos, q, NULL);
		if (pos == blkcg || IS_ERR(blkg))
			return blkg;
	}
296
}
297
EXPORT_SYMBOL_GPL(blkg_lookup_create);
298

Tejun Heo's avatar
Tejun Heo committed
299
static void blkg_destroy(struct blkcg_gq *blkg)
300
{
Tejun Heo's avatar
Tejun Heo committed
301
	struct blkcg *blkcg = blkg->blkcg;
302
	int i;
303

304
	lockdep_assert_held(blkg->q->queue_lock);
305
	lockdep_assert_held(&blkcg->lock);
306
307

	/* Something wrong if we are trying to remove same group twice */
308
	WARN_ON_ONCE(list_empty(&blkg->q_node));
309
	WARN_ON_ONCE(hlist_unhashed(&blkg->blkcg_node));
310

311
312
313
314
315
316
317
318
	for (i = 0; i < BLKCG_MAX_POLS; i++) {
		struct blkcg_policy *pol = blkcg_policy[i];

		if (blkg->pd[i] && pol->pd_offline_fn)
			pol->pd_offline_fn(blkg);
	}
	blkg->online = false;

319
	radix_tree_delete(&blkcg->blkg_tree, blkg->q->id);
320
	list_del_init(&blkg->q_node);
321
	hlist_del_init_rcu(&blkg->blkcg_node);
322

323
324
325
326
327
328
329
330
	/*
	 * Both setting lookup hint to and clearing it from @blkg are done
	 * under queue_lock.  If it's not pointing to @blkg now, it never
	 * will.  Hint assignment itself can race safely.
	 */
	if (rcu_dereference_raw(blkcg->blkg_hint) == blkg)
		rcu_assign_pointer(blkcg->blkg_hint, NULL);

331
332
333
334
335
336
337
	/*
	 * Put the reference taken at the time of creation so that when all
	 * queues are gone, group can be destroyed.
	 */
	blkg_put(blkg);
}

338
339
340
341
/**
 * blkg_destroy_all - destroy all blkgs associated with a request_queue
 * @q: request_queue of interest
 *
342
 * Destroy all blkgs associated with @q.
343
 */
344
static void blkg_destroy_all(struct request_queue *q)
345
{
Tejun Heo's avatar
Tejun Heo committed
346
	struct blkcg_gq *blkg, *n;
347

348
	lockdep_assert_held(q->queue_lock);
349

350
	list_for_each_entry_safe(blkg, n, &q->blkg_list, q_node) {
Tejun Heo's avatar
Tejun Heo committed
351
		struct blkcg *blkcg = blkg->blkcg;
352

353
354
355
		spin_lock(&blkcg->lock);
		blkg_destroy(blkg);
		spin_unlock(&blkcg->lock);
356
	}
357
358
359
360
361
362
363

	/*
	 * root blkg is destroyed.  Just clear the pointer since
	 * root_rl does not take reference on root blkg.
	 */
	q->root_blkg = NULL;
	q->root_rl.blkg = NULL;
364
365
}

Tejun Heo's avatar
Tejun Heo committed
366
367
static void blkg_rcu_free(struct rcu_head *rcu_head)
{
Tejun Heo's avatar
Tejun Heo committed
368
	blkg_free(container_of(rcu_head, struct blkcg_gq, rcu_head));
Tejun Heo's avatar
Tejun Heo committed
369
370
}

Tejun Heo's avatar
Tejun Heo committed
371
void __blkg_release(struct blkcg_gq *blkg)
Tejun Heo's avatar
Tejun Heo committed
372
{
373
	/* release the blkcg and parent blkg refs this blkg has been holding */
Tejun Heo's avatar
Tejun Heo committed
374
	css_put(&blkg->blkcg->css);
375
376
	if (blkg->parent)
		blkg_put(blkg->parent);
Tejun Heo's avatar
Tejun Heo committed
377
378
379
380
381
382
383
384
385
386
387
388
389
390

	/*
	 * A group is freed in rcu manner. But having an rcu lock does not
	 * mean that one can access all the fields of blkg and assume these
	 * are valid. For example, don't try to follow throtl_data and
	 * request queue links.
	 *
	 * Having a reference to blkg under an rcu allows acess to only
	 * values local to groups like group stats and group rate limits
	 */
	call_rcu(&blkg->rcu_head, blkg_rcu_free);
}
EXPORT_SYMBOL_GPL(__blkg_release);

391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
/*
 * The next function used by blk_queue_for_each_rl().  It's a bit tricky
 * because the root blkg uses @q->root_rl instead of its own rl.
 */
struct request_list *__blk_queue_next_rl(struct request_list *rl,
					 struct request_queue *q)
{
	struct list_head *ent;
	struct blkcg_gq *blkg;

	/*
	 * Determine the current blkg list_head.  The first entry is
	 * root_rl which is off @q->blkg_list and mapped to the head.
	 */
	if (rl == &q->root_rl) {
		ent = &q->blkg_list;
407
408
409
		/* There are no more block groups, hence no request lists */
		if (list_empty(ent))
			return NULL;
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
	} else {
		blkg = container_of(rl, struct blkcg_gq, rl);
		ent = &blkg->q_node;
	}

	/* walk to the next list_head, skip root blkcg */
	ent = ent->next;
	if (ent == &q->root_blkg->q_node)
		ent = ent->next;
	if (ent == &q->blkg_list)
		return NULL;

	blkg = container_of(ent, struct blkcg_gq, q_node);
	return &blkg->rl;
}

Tejun Heo's avatar
Tejun Heo committed
426
427
static int blkcg_reset_stats(struct cgroup *cgroup, struct cftype *cftype,
			     u64 val)
428
{
Tejun Heo's avatar
Tejun Heo committed
429
430
	struct blkcg *blkcg = cgroup_to_blkcg(cgroup);
	struct blkcg_gq *blkg;
431
	struct hlist_node *n;
432
	int i;
433

434
	mutex_lock(&blkcg_pol_mutex);
435
	spin_lock_irq(&blkcg->lock);
Tejun Heo's avatar
Tejun Heo committed
436
437
438
439
440
441

	/*
	 * Note that stat reset is racy - it doesn't synchronize against
	 * stat updates.  This is a debug feature which shouldn't exist
	 * anyway.  If you get hit by a race, retry.
	 */
442
	hlist_for_each_entry(blkg, n, &blkcg->blkg_list, blkcg_node) {
443
		for (i = 0; i < BLKCG_MAX_POLS; i++) {
Tejun Heo's avatar
Tejun Heo committed
444
			struct blkcg_policy *pol = blkcg_policy[i];
445

446
			if (blkcg_policy_enabled(blkg->q, pol) &&
447
448
			    pol->pd_reset_stats_fn)
				pol->pd_reset_stats_fn(blkg);
449
		}
450
	}
451

452
	spin_unlock_irq(&blkcg->lock);
453
	mutex_unlock(&blkcg_pol_mutex);
454
455
456
	return 0;
}

Tejun Heo's avatar
Tejun Heo committed
457
static const char *blkg_dev_name(struct blkcg_gq *blkg)
458
{
459
460
461
462
	/* some drivers (floppy) instantiate a queue w/o disk registered */
	if (blkg->q->backing_dev_info.dev)
		return dev_name(blkg->q->backing_dev_info.dev);
	return NULL;
463
464
}

465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
/**
 * blkcg_print_blkgs - helper for printing per-blkg data
 * @sf: seq_file to print to
 * @blkcg: blkcg of interest
 * @prfill: fill function to print out a blkg
 * @pol: policy in question
 * @data: data to be passed to @prfill
 * @show_total: to print out sum of prfill return values or not
 *
 * This function invokes @prfill on each blkg of @blkcg if pd for the
 * policy specified by @pol exists.  @prfill is invoked with @sf, the
 * policy data and @data.  If @show_total is %true, the sum of the return
 * values from @prfill is printed with "Total" label at the end.
 *
 * This is to be used to construct print functions for
 * cftype->read_seq_string method.
 */
Tejun Heo's avatar
Tejun Heo committed
482
void blkcg_print_blkgs(struct seq_file *sf, struct blkcg *blkcg,
483
484
		       u64 (*prfill)(struct seq_file *,
				     struct blkg_policy_data *, int),
Tejun Heo's avatar
Tejun Heo committed
485
		       const struct blkcg_policy *pol, int data,
486
		       bool show_total)
487
{
Tejun Heo's avatar
Tejun Heo committed
488
	struct blkcg_gq *blkg;
489
490
	struct hlist_node *n;
	u64 total = 0;
491

492
493
	spin_lock_irq(&blkcg->lock);
	hlist_for_each_entry(blkg, n, &blkcg->blkg_list, blkcg_node)
494
		if (blkcg_policy_enabled(blkg->q, pol))
495
			total += prfill(sf, blkg->pd[pol->plid], data);
496
497
498
499
500
	spin_unlock_irq(&blkcg->lock);

	if (show_total)
		seq_printf(sf, "Total %llu\n", (unsigned long long)total);
}
501
EXPORT_SYMBOL_GPL(blkcg_print_blkgs);
502
503
504
505

/**
 * __blkg_prfill_u64 - prfill helper for a single u64 value
 * @sf: seq_file to print to
506
 * @pd: policy private data of interest
507
508
 * @v: value to print
 *
509
 * Print @v to @sf for the device assocaited with @pd.
510
 */
511
u64 __blkg_prfill_u64(struct seq_file *sf, struct blkg_policy_data *pd, u64 v)
512
{
513
	const char *dname = blkg_dev_name(pd->blkg);
514
515
516
517
518
519
520

	if (!dname)
		return 0;

	seq_printf(sf, "%s %llu\n", dname, (unsigned long long)v);
	return v;
}
521
EXPORT_SYMBOL_GPL(__blkg_prfill_u64);
522
523
524
525

/**
 * __blkg_prfill_rwstat - prfill helper for a blkg_rwstat
 * @sf: seq_file to print to
526
 * @pd: policy private data of interest
527
528
 * @rwstat: rwstat to print
 *
529
 * Print @rwstat to @sf for the device assocaited with @pd.
530
 */
531
u64 __blkg_prfill_rwstat(struct seq_file *sf, struct blkg_policy_data *pd,
532
			 const struct blkg_rwstat *rwstat)
533
534
535
536
537
538
539
{
	static const char *rwstr[] = {
		[BLKG_RWSTAT_READ]	= "Read",
		[BLKG_RWSTAT_WRITE]	= "Write",
		[BLKG_RWSTAT_SYNC]	= "Sync",
		[BLKG_RWSTAT_ASYNC]	= "Async",
	};
540
	const char *dname = blkg_dev_name(pd->blkg);
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
	u64 v;
	int i;

	if (!dname)
		return 0;

	for (i = 0; i < BLKG_RWSTAT_NR; i++)
		seq_printf(sf, "%s %s %llu\n", dname, rwstr[i],
			   (unsigned long long)rwstat->cnt[i]);

	v = rwstat->cnt[BLKG_RWSTAT_READ] + rwstat->cnt[BLKG_RWSTAT_WRITE];
	seq_printf(sf, "%s Total %llu\n", dname, (unsigned long long)v);
	return v;
}

556
557
558
/**
 * blkg_prfill_stat - prfill callback for blkg_stat
 * @sf: seq_file to print to
559
560
 * @pd: policy private data of interest
 * @off: offset to the blkg_stat in @pd
561
562
563
 *
 * prfill callback for printing a blkg_stat.
 */
564
u64 blkg_prfill_stat(struct seq_file *sf, struct blkg_policy_data *pd, int off)
565
{
566
	return __blkg_prfill_u64(sf, pd, blkg_stat_read((void *)pd + off));
567
}
568
EXPORT_SYMBOL_GPL(blkg_prfill_stat);
569

570
571
572
/**
 * blkg_prfill_rwstat - prfill callback for blkg_rwstat
 * @sf: seq_file to print to
573
574
 * @pd: policy private data of interest
 * @off: offset to the blkg_rwstat in @pd
575
576
577
 *
 * prfill callback for printing a blkg_rwstat.
 */
578
579
u64 blkg_prfill_rwstat(struct seq_file *sf, struct blkg_policy_data *pd,
		       int off)
580
{
581
	struct blkg_rwstat rwstat = blkg_rwstat_read((void *)pd + off);
582

583
	return __blkg_prfill_rwstat(sf, pd, &rwstat);
584
}
585
EXPORT_SYMBOL_GPL(blkg_prfill_rwstat);
586

587
588
589
/**
 * blkg_conf_prep - parse and prepare for per-blkg config update
 * @blkcg: target block cgroup
590
 * @pol: target policy
591
592
593
594
595
 * @input: input string
 * @ctx: blkg_conf_ctx to be filled
 *
 * Parse per-blkg config update from @input and initialize @ctx with the
 * result.  @ctx->blkg points to the blkg to be updated and @ctx->v the new
596
597
 * value.  This function returns with RCU read lock and queue lock held and
 * must be paired with blkg_conf_finish().
598
 */
Tejun Heo's avatar
Tejun Heo committed
599
600
int blkg_conf_prep(struct blkcg *blkcg, const struct blkcg_policy *pol,
		   const char *input, struct blkg_conf_ctx *ctx)
601
	__acquires(rcu) __acquires(disk->queue->queue_lock)
602
{
603
	struct gendisk *disk;
Tejun Heo's avatar
Tejun Heo committed
604
	struct blkcg_gq *blkg;
Tejun Heo's avatar
Tejun Heo committed
605
606
607
	unsigned int major, minor;
	unsigned long long v;
	int part, ret;
608

Tejun Heo's avatar
Tejun Heo committed
609
610
	if (sscanf(input, "%u:%u %llu", &major, &minor, &v) != 3)
		return -EINVAL;
611

Tejun Heo's avatar
Tejun Heo committed
612
	disk = get_gendisk(MKDEV(major, minor), &part);
Tejun Heo's avatar
Tejun Heo committed
613
	if (!disk || part)
Tejun Heo's avatar
Tejun Heo committed
614
		return -EINVAL;
615
616

	rcu_read_lock();
Tejun Heo's avatar
Tejun Heo committed
617
	spin_lock_irq(disk->queue->queue_lock);
618

619
	if (blkcg_policy_enabled(disk->queue, pol))
620
		blkg = blkg_lookup_create(blkcg, disk->queue);
621
622
	else
		blkg = ERR_PTR(-EINVAL);
623

Tejun Heo's avatar
Tejun Heo committed
624
625
	if (IS_ERR(blkg)) {
		ret = PTR_ERR(blkg);
626
		rcu_read_unlock();
627
		spin_unlock_irq(disk->queue->queue_lock);
628
629
630
631
632
633
634
635
636
637
		put_disk(disk);
		/*
		 * If queue was bypassing, we should retry.  Do so after a
		 * short msleep().  It isn't strictly necessary but queue
		 * can be bypassing for some time and it's always nice to
		 * avoid busy looping.
		 */
		if (ret == -EBUSY) {
			msleep(10);
			ret = restart_syscall();
638
		}
Tejun Heo's avatar
Tejun Heo committed
639
		return ret;
640
	}
641
642
643

	ctx->disk = disk;
	ctx->blkg = blkg;
Tejun Heo's avatar
Tejun Heo committed
644
645
	ctx->v = v;
	return 0;
646
}
647
EXPORT_SYMBOL_GPL(blkg_conf_prep);
648

649
650
651
652
653
654
655
/**
 * blkg_conf_finish - finish up per-blkg config update
 * @ctx: blkg_conf_ctx intiailized by blkg_conf_prep()
 *
 * Finish up after per-blkg config update.  This function must be paired
 * with blkg_conf_prep().
 */
656
void blkg_conf_finish(struct blkg_conf_ctx *ctx)
657
	__releases(ctx->disk->queue->queue_lock) __releases(rcu)
658
{
659
	spin_unlock_irq(ctx->disk->queue->queue_lock);
660
661
	rcu_read_unlock();
	put_disk(ctx->disk);
662
}
663
EXPORT_SYMBOL_GPL(blkg_conf_finish);
664

Tejun Heo's avatar
Tejun Heo committed
665
struct cftype blkcg_files[] = {
666
667
	{
		.name = "reset_stats",
Tejun Heo's avatar
Tejun Heo committed
668
		.write_u64 = blkcg_reset_stats,
669
	},
670
	{ }	/* terminate */
671
672
};

673
/**
674
 * blkcg_css_offline - cgroup css_offline callback
675
676
677
678
679
680
681
682
683
 * @cgroup: cgroup of interest
 *
 * This function is called when @cgroup is about to go away and responsible
 * for shooting down all blkgs associated with @cgroup.  blkgs should be
 * removed while holding both q and blkcg locks.  As blkcg lock is nested
 * inside q lock, this function performs reverse double lock dancing.
 *
 * This is the blkcg counterpart of ioc_release_fn().
 */
684
static void blkcg_css_offline(struct cgroup *cgroup)
685
{
Tejun Heo's avatar
Tejun Heo committed
686
	struct blkcg *blkcg = cgroup_to_blkcg(cgroup);
687

688
	spin_lock_irq(&blkcg->lock);
689

690
	while (!hlist_empty(&blkcg->blkg_list)) {
Tejun Heo's avatar
Tejun Heo committed
691
692
		struct blkcg_gq *blkg = hlist_entry(blkcg->blkg_list.first,
						struct blkcg_gq, blkcg_node);
693
		struct request_queue *q = blkg->q;
694

695
696
697
698
699
700
		if (spin_trylock(q->queue_lock)) {
			blkg_destroy(blkg);
			spin_unlock(q->queue_lock);
		} else {
			spin_unlock_irq(&blkcg->lock);
			cpu_relax();
701
			spin_lock_irq(&blkcg->lock);
702
		}
703
	}
704

705
	spin_unlock_irq(&blkcg->lock);
706
707
}

708
static void blkcg_css_free(struct cgroup *cgroup)
709
{
Tejun Heo's avatar
Tejun Heo committed
710
	struct blkcg *blkcg = cgroup_to_blkcg(cgroup);
711

Tejun Heo's avatar
Tejun Heo committed
712
	if (blkcg != &blkcg_root)
Ben Blum's avatar
Ben Blum committed
713
		kfree(blkcg);
714
715
}

716
static struct cgroup_subsys_state *blkcg_css_alloc(struct cgroup *cgroup)
717
{
Tejun Heo's avatar
Tejun Heo committed
718
	static atomic64_t id_seq = ATOMIC64_INIT(0);
Tejun Heo's avatar
Tejun Heo committed
719
	struct blkcg *blkcg;
720
	struct cgroup *parent = cgroup->parent;
721

722
	if (!parent) {
Tejun Heo's avatar
Tejun Heo committed
723
		blkcg = &blkcg_root;
724
725
726
727
728
729
730
		goto done;
	}

	blkcg = kzalloc(sizeof(*blkcg), GFP_KERNEL);
	if (!blkcg)
		return ERR_PTR(-ENOMEM);

731
	blkcg->cfq_weight = CFQ_WEIGHT_DEFAULT;
Tejun Heo's avatar
Tejun Heo committed
732
	blkcg->cfq_leaf_weight = CFQ_WEIGHT_DEFAULT;
Tejun Heo's avatar
Tejun Heo committed
733
	blkcg->id = atomic64_inc_return(&id_seq); /* root is 0, start from 1 */
734
735
done:
	spin_lock_init(&blkcg->lock);
736
	INIT_RADIX_TREE(&blkcg->blkg_tree, GFP_ATOMIC);
737
738
739
740
741
	INIT_HLIST_HEAD(&blkcg->blkg_list);

	return &blkcg->css;
}

742
743
744
745
746
747
748
749
750
751
752
753
754
755
/**
 * blkcg_init_queue - initialize blkcg part of request queue
 * @q: request_queue to initialize
 *
 * Called from blk_alloc_queue_node(). Responsible for initializing blkcg
 * part of new request_queue @q.
 *
 * RETURNS:
 * 0 on success, -errno on failure.
 */
int blkcg_init_queue(struct request_queue *q)
{
	might_sleep();

756
	return blk_throtl_init(q);
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
}

/**
 * blkcg_drain_queue - drain blkcg part of request_queue
 * @q: request_queue to drain
 *
 * Called from blk_drain_queue().  Responsible for draining blkcg part.
 */
void blkcg_drain_queue(struct request_queue *q)
{
	lockdep_assert_held(q->queue_lock);

	blk_throtl_drain(q);
}

/**
 * blkcg_exit_queue - exit and release blkcg part of request_queue
 * @q: request_queue being released
 *
 * Called from blk_release_queue().  Responsible for exiting blkcg part.
 */
void blkcg_exit_queue(struct request_queue *q)
{
780
	spin_lock_irq(q->queue_lock);
781
	blkg_destroy_all(q);
782
783
	spin_unlock_irq(q->queue_lock);

784
785
786
	blk_throtl_exit(q);
}

787
788
789
790
791
792
/*
 * We cannot support shared io contexts, as we have no mean to support
 * two tasks with the same ioc in two different groups without major rework
 * of the main cic data structures.  For now we allow a task to change
 * its cgroup only if it's the only owner of its ioc.
 */
Tejun Heo's avatar
Tejun Heo committed
793
static int blkcg_can_attach(struct cgroup *cgrp, struct cgroup_taskset *tset)
794
{
795
	struct task_struct *task;
796
797
798
799
	struct io_context *ioc;
	int ret = 0;

	/* task_lock() is needed to avoid races with exit_io_context() */
800
801
802
803
804
805
806
807
808
	cgroup_taskset_for_each(task, cgrp, tset) {
		task_lock(task);
		ioc = task->io_context;
		if (ioc && atomic_read(&ioc->nr_tasks) > 1)
			ret = -EINVAL;
		task_unlock(task);
		if (ret)
			break;
	}
809
810
811
	return ret;
}

812
813
struct cgroup_subsys blkio_subsys = {
	.name = "blkio",
814
815
816
	.css_alloc = blkcg_css_alloc,
	.css_offline = blkcg_css_offline,
	.css_free = blkcg_css_free,
Tejun Heo's avatar
Tejun Heo committed
817
	.can_attach = blkcg_can_attach,
818
	.subsys_id = blkio_subsys_id,
Tejun Heo's avatar
Tejun Heo committed
819
	.base_cftypes = blkcg_files,
820
	.module = THIS_MODULE,
821
822
823
824
825
826
827
828

	/*
	 * blkio subsystem is utterly broken in terms of hierarchy support.
	 * It treats all cgroups equally regardless of where they're
	 * located in the hierarchy - all cgroups are treated as if they're
	 * right below the root.  Fix it and remove the following.
	 */
	.broken_hierarchy = true,
829
830
831
};
EXPORT_SYMBOL_GPL(blkio_subsys);

832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
/**
 * blkcg_activate_policy - activate a blkcg policy on a request_queue
 * @q: request_queue of interest
 * @pol: blkcg policy to activate
 *
 * Activate @pol on @q.  Requires %GFP_KERNEL context.  @q goes through
 * bypass mode to populate its blkgs with policy_data for @pol.
 *
 * Activation happens with @q bypassed, so nobody would be accessing blkgs
 * from IO path.  Update of each blkg is protected by both queue and blkcg
 * locks so that holding either lock and testing blkcg_policy_enabled() is
 * always enough for dereferencing policy data.
 *
 * The caller is responsible for synchronizing [de]activations and policy
 * [un]registerations.  Returns 0 on success, -errno on failure.
 */
int blkcg_activate_policy(struct request_queue *q,
Tejun Heo's avatar
Tejun Heo committed
849
			  const struct blkcg_policy *pol)
850
851
{
	LIST_HEAD(pds);
852
	struct blkcg_gq *blkg, *new_blkg;
853
854
	struct blkg_policy_data *pd, *n;
	int cnt = 0, ret;
855
	bool preloaded;
856
857
858
859

	if (blkcg_policy_enabled(q, pol))
		return 0;

860
	/* preallocations for root blkg */
861
862
	new_blkg = blkg_alloc(&blkcg_root, q, GFP_KERNEL);
	if (!new_blkg)
863
864
865
866
		return -ENOMEM;

	preloaded = !radix_tree_preload(GFP_KERNEL);

867
868
	blk_queue_bypass_start(q);

869
870
871
872
873
	/*
	 * Make sure the root blkg exists and count the existing blkgs.  As
	 * @q is bypassing at this point, blkg_lookup_create() can't be
	 * used.  Open code it.
	 */
874
875
876
	spin_lock_irq(q->queue_lock);

	rcu_read_lock();
877
878
879
880
881
	blkg = __blkg_lookup(&blkcg_root, q, false);
	if (blkg)
		blkg_free(new_blkg);
	else
		blkg = blkg_create(&blkcg_root, q, new_blkg);
882
883
	rcu_read_unlock();

884
885
886
	if (preloaded)
		radix_tree_preload_end();

887
888
889
890
891
	if (IS_ERR(blkg)) {
		ret = PTR_ERR(blkg);
		goto out_unlock;
	}
	q->root_blkg = blkg;
892
	q->root_rl.blkg = blkg;
893
894
895
896
897
898
899
900

	list_for_each_entry(blkg, &q->blkg_list, q_node)
		cnt++;

	spin_unlock_irq(q->queue_lock);

	/* allocate policy_data for all existing blkgs */
	while (cnt--) {
901
		pd = kzalloc_node(pol->pd_size, GFP_KERNEL, q->node);
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
		if (!pd) {
			ret = -ENOMEM;
			goto out_free;
		}
		list_add_tail(&pd->alloc_node, &pds);
	}

	/*
	 * Install the allocated pds.  With @q bypassing, no new blkg
	 * should have been created while the queue lock was dropped.
	 */
	spin_lock_irq(q->queue_lock);

	list_for_each_entry(blkg, &q->blkg_list, q_node) {
		if (WARN_ON(list_empty(&pds))) {
			/* umm... this shouldn't happen, just abort */
			ret = -ENOMEM;
			goto out_unlock;
		}
		pd = list_first_entry(&pds, struct blkg_policy_data, alloc_node);
		list_del_init(&pd->alloc_node);

		/* grab blkcg lock too while installing @pd on @blkg */
		spin_lock(&blkg->blkcg->lock);

		blkg->pd[pol->plid] = pd;
		pd->blkg = blkg;
Tejun Heo's avatar
Tejun Heo committed
929
		pd->plid = pol->plid;
930
		pol->pd_init_fn(blkg);
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955

		spin_unlock(&blkg->blkcg->lock);
	}

	__set_bit(pol->plid, q->blkcg_pols);
	ret = 0;
out_unlock:
	spin_unlock_irq(q->queue_lock);
out_free:
	blk_queue_bypass_end(q);
	list_for_each_entry_safe(pd, n, &pds, alloc_node)
		kfree(pd);
	return ret;
}
EXPORT_SYMBOL_GPL(blkcg_activate_policy);

/**
 * blkcg_deactivate_policy - deactivate a blkcg policy on a request_queue
 * @q: request_queue of interest
 * @pol: blkcg policy to deactivate
 *
 * Deactivate @pol on @q.  Follows the same synchronization rules as
 * blkcg_activate_policy().
 */
void blkcg_deactivate_policy(struct request_queue *q,
Tejun Heo's avatar
Tejun Heo committed
956
			     const struct blkcg_policy *pol)
957
{
Tejun Heo's avatar
Tejun Heo committed
958
	struct blkcg_gq *blkg;
959
960
961
962
963
964
965
966
967

	if (!blkcg_policy_enabled(q, pol))
		return;

	blk_queue_bypass_start(q);
	spin_lock_irq(q->queue_lock);

	__clear_bit(pol->plid, q->blkcg_pols);

968
969
970
971
	/* if no policy is left, no need for blkgs - shoot them down */
	if (bitmap_empty(q->blkcg_pols, BLKCG_MAX_POLS))
		blkg_destroy_all(q);

972
973
974
975
	list_for_each_entry(blkg, &q->blkg_list, q_node) {
		/* grab blkcg lock too while removing @pd from @blkg */
		spin_lock(&blkg->blkcg->lock);

976
977
		if (pol->pd_offline_fn)
			pol->pd_offline_fn(blkg);
978
979
		if (pol->pd_exit_fn)
			pol->pd_exit_fn(blkg);
980
981
982
983
984
985
986
987
988
989
990
991

		kfree(blkg->pd[pol->plid]);
		blkg->pd[pol->plid] = NULL;

		spin_unlock(&blkg->blkcg->lock);
	}

	spin_unlock_irq(q->queue_lock);
	blk_queue_bypass_end(q);
}
EXPORT_SYMBOL_GPL(blkcg_deactivate_policy);

992
/**
Tejun Heo's avatar
Tejun Heo committed
993
994
 * blkcg_policy_register - register a blkcg policy
 * @pol: blkcg policy to register
995
 *
Tejun Heo's avatar
Tejun Heo committed
996
997
 * Register @pol with blkcg core.  Might sleep and @pol may be modified on
 * successful registration.  Returns 0 on success and -errno on failure.
998
 */
Tejun Heo's avatar
Tejun Heo committed
999
int blkcg_policy_register(struct blkcg_policy *pol)
1000
{