blk-cgroup.c 22.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>
T
Tejun Heo 已提交
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

29
struct blkio_cgroup blkio_root_cgroup = { .cfq_weight = 2 * CFQ_WEIGHT_DEFAULT };
30 31
EXPORT_SYMBOL_GPL(blkio_root_cgroup);

T
Tejun Heo 已提交
32
static struct blkio_policy_type *blkio_policy[BLKCG_MAX_POLS];
33

34 35 36 37 38
struct blkio_cgroup *cgroup_to_blkio_cgroup(struct cgroup *cgroup)
{
	return container_of(cgroup_subsys_state(cgroup, blkio_subsys_id),
			    struct blkio_cgroup, css);
}
39
EXPORT_SYMBOL_GPL(cgroup_to_blkio_cgroup);
40

41
static struct blkio_cgroup *task_blkio_cgroup(struct task_struct *tsk)
42 43 44 45
{
	return container_of(task_subsys_state(tsk, blkio_subsys_id),
			    struct blkio_cgroup, css);
}
46 47 48 49 50 51 52 53

struct blkio_cgroup *bio_blkio_cgroup(struct bio *bio)
{
	if (bio && bio->bi_css)
		return container_of(bio->bi_css, struct blkio_cgroup, css);
	return task_blkio_cgroup(current);
}
EXPORT_SYMBOL_GPL(bio_blkio_cgroup);
54

55 56 57 58 59 60 61 62 63 64 65
static bool blkcg_policy_enabled(struct request_queue *q,
				 const struct blkio_policy_type *pol)
{
	return pol && test_bit(pol->plid, q->blkcg_pols);
}

static size_t blkg_pd_size(const struct blkio_policy_type *pol)
{
	return sizeof(struct blkg_policy_data) + pol->pdata_size;
}

66 67 68 69 70 71 72 73
/**
 * blkg_free - free a blkg
 * @blkg: blkg to free
 *
 * Free @blkg which may be partially allocated.
 */
static void blkg_free(struct blkio_group *blkg)
{
74
	int i;
75 76 77 78

	if (!blkg)
		return;

T
Tejun Heo 已提交
79
	for (i = 0; i < BLKCG_MAX_POLS; i++) {
80
		struct blkio_policy_type *pol = blkio_policy[i];
81 82
		struct blkg_policy_data *pd = blkg->pd[i];

83 84 85 86 87 88 89
		if (!pd)
			continue;

		if (pol && pol->ops.blkio_exit_group_fn)
			pol->ops.blkio_exit_group_fn(blkg);

		kfree(pd);
90
	}
91

92
	kfree(blkg);
93 94 95 96 97 98 99
}

/**
 * blkg_alloc - allocate a blkg
 * @blkcg: block cgroup the new blkg is associated with
 * @q: request_queue the new blkg is associated with
 *
100
 * Allocate a new blkg assocating @blkcg and @q.
101 102
 */
static struct blkio_group *blkg_alloc(struct blkio_cgroup *blkcg,
103
				      struct request_queue *q)
104 105
{
	struct blkio_group *blkg;
106
	int i;
107 108 109 110 111 112

	/* alloc and init base part */
	blkg = kzalloc_node(sizeof(*blkg), GFP_ATOMIC, q->node);
	if (!blkg)
		return NULL;

T
Tejun Heo 已提交
113
	blkg->q = q;
114
	INIT_LIST_HEAD(&blkg->q_node);
115
	blkg->blkcg = blkcg;
T
Tejun Heo 已提交
116
	blkg->refcnt = 1;
117 118
	cgroup_path(blkcg->css.cgroup, blkg->path, sizeof(blkg->path));

T
Tejun Heo 已提交
119
	for (i = 0; i < BLKCG_MAX_POLS; i++) {
120 121
		struct blkio_policy_type *pol = blkio_policy[i];
		struct blkg_policy_data *pd;
122

123
		if (!blkcg_policy_enabled(q, pol))
124 125 126
			continue;

		/* alloc per-policy data and attach it to blkg */
127
		pd = kzalloc_node(blkg_pd_size(pol), GFP_ATOMIC, q->node);
128 129 130 131
		if (!pd) {
			blkg_free(blkg);
			return NULL;
		}
132

133 134
		blkg->pd[i] = pd;
		pd->blkg = blkg;
135 136
	}

137
	/* invoke per-policy init */
T
Tejun Heo 已提交
138
	for (i = 0; i < BLKCG_MAX_POLS; i++) {
139 140
		struct blkio_policy_type *pol = blkio_policy[i];

141
		if (blkcg_policy_enabled(blkg->q, pol))
142 143 144
			pol->ops.blkio_init_group_fn(blkg);
	}

145 146 147
	return blkg;
}

148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179
static struct blkio_group *__blkg_lookup(struct blkio_cgroup *blkcg,
					 struct request_queue *q)
{
	struct blkio_group *blkg;
	struct hlist_node *n;

	hlist_for_each_entry_rcu(blkg, n, &blkcg->blkg_list, blkcg_node)
		if (blkg->q == q)
			return blkg;
	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.
 */
struct blkio_group *blkg_lookup(struct blkio_cgroup *blkcg,
				struct request_queue *q)
{
	WARN_ON_ONCE(!rcu_read_lock_held());

	if (unlikely(blk_queue_bypass(q)))
		return NULL;
	return __blkg_lookup(blkcg, q);
}
EXPORT_SYMBOL_GPL(blkg_lookup);

180 181
static struct blkio_group *__blkg_lookup_create(struct blkio_cgroup *blkcg,
						struct request_queue *q)
182
	__releases(q->queue_lock) __acquires(q->queue_lock)
183
{
184
	struct blkio_group *blkg;
185

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

189
	blkg = __blkg_lookup(blkcg, q);
190 191 192
	if (blkg)
		return blkg;

193
	/* blkg holds a reference to blkcg */
194 195 196 197 198 199
	if (!css_tryget(&blkcg->css))
		return ERR_PTR(-EINVAL);

	/*
	 * Allocate and initialize.
	 */
200
	blkg = blkg_alloc(blkcg, q);
201 202

	/* did alloc fail? */
203
	if (unlikely(!blkg)) {
204 205 206 207 208 209
		blkg = ERR_PTR(-ENOMEM);
		goto out;
	}

	/* insert */
	spin_lock(&blkcg->lock);
210
	hlist_add_head_rcu(&blkg->blkcg_node, &blkcg->blkg_list);
211
	list_add(&blkg->q_node, &q->blkg_list);
212 213 214
	spin_unlock(&blkcg->lock);
out:
	return blkg;
215
}
216 217 218 219 220 221 222 223 224 225 226 227

struct blkio_group *blkg_lookup_create(struct blkio_cgroup *blkcg,
				       struct request_queue *q)
{
	/*
	 * 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)))
		return ERR_PTR(blk_queue_dead(q) ? -EINVAL : -EBUSY);
	return __blkg_lookup_create(blkcg, q);
}
228
EXPORT_SYMBOL_GPL(blkg_lookup_create);
229

230
static void blkg_destroy(struct blkio_group *blkg)
231 232
{
	struct request_queue *q = blkg->q;
233
	struct blkio_cgroup *blkcg = blkg->blkcg;
234 235

	lockdep_assert_held(q->queue_lock);
236
	lockdep_assert_held(&blkcg->lock);
237 238

	/* Something wrong if we are trying to remove same group twice */
239
	WARN_ON_ONCE(list_empty(&blkg->q_node));
240
	WARN_ON_ONCE(hlist_unhashed(&blkg->blkcg_node));
241
	list_del_init(&blkg->q_node);
242
	hlist_del_init_rcu(&blkg->blkcg_node);
243 244 245 246 247 248 249 250

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

251 252 253 254
/**
 * blkg_destroy_all - destroy all blkgs associated with a request_queue
 * @q: request_queue of interest
 *
255
 * Destroy all blkgs associated with @q.
256
 */
257
static void blkg_destroy_all(struct request_queue *q)
258
{
259
	struct blkio_group *blkg, *n;
260

261
	lockdep_assert_held(q->queue_lock);
262

263 264
	list_for_each_entry_safe(blkg, n, &q->blkg_list, q_node) {
		struct blkio_cgroup *blkcg = blkg->blkcg;
265

266 267 268
		spin_lock(&blkcg->lock);
		blkg_destroy(blkg);
		spin_unlock(&blkcg->lock);
269 270 271
	}
}

T
Tejun Heo 已提交
272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294
static void blkg_rcu_free(struct rcu_head *rcu_head)
{
	blkg_free(container_of(rcu_head, struct blkio_group, rcu_head));
}

void __blkg_release(struct blkio_group *blkg)
{
	/* release the extra blkcg reference this blkg has been holding */
	css_put(&blkg->blkcg->css);

	/*
	 * 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);

295
static int
296
blkiocg_reset_stats(struct cgroup *cgroup, struct cftype *cftype, u64 val)
297
{
T
Tejun Heo 已提交
298
	struct blkio_cgroup *blkcg = cgroup_to_blkio_cgroup(cgroup);
299 300
	struct blkio_group *blkg;
	struct hlist_node *n;
301
	int i;
302

303
	mutex_lock(&blkcg_pol_mutex);
304
	spin_lock_irq(&blkcg->lock);
T
Tejun Heo 已提交
305 306 307 308 309 310

	/*
	 * 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.
	 */
311
	hlist_for_each_entry(blkg, n, &blkcg->blkg_list, blkcg_node) {
T
Tejun Heo 已提交
312
		for (i = 0; i < BLKCG_MAX_POLS; i++) {
313
			struct blkio_policy_type *pol = blkio_policy[i];
314

315 316
			if (blkcg_policy_enabled(blkg->q, pol) &&
			    pol->ops.blkio_reset_group_stats_fn)
317
				pol->ops.blkio_reset_group_stats_fn(blkg);
318
		}
319
	}
320

321
	spin_unlock_irq(&blkcg->lock);
322
	mutex_unlock(&blkcg_pol_mutex);
323 324 325
	return 0;
}

326
static const char *blkg_dev_name(struct blkio_group *blkg)
327
{
328 329 330 331
	/* 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;
332 333
}

334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350
/**
 * 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.
 */
351
void blkcg_print_blkgs(struct seq_file *sf, struct blkio_cgroup *blkcg,
352
		       u64 (*prfill)(struct seq_file *, void *, int),
353 354
		       const struct blkio_policy_type *pol, int data,
		       bool show_total)
355
{
356 357 358
	struct blkio_group *blkg;
	struct hlist_node *n;
	u64 total = 0;
359

360 361
	spin_lock_irq(&blkcg->lock);
	hlist_for_each_entry(blkg, n, &blkcg->blkg_list, blkcg_node)
362
		if (blkcg_policy_enabled(blkg->q, pol))
363
			total += prfill(sf, blkg->pd[pol->plid]->pdata, data);
364 365 366 367 368
	spin_unlock_irq(&blkcg->lock);

	if (show_total)
		seq_printf(sf, "Total %llu\n", (unsigned long long)total);
}
369
EXPORT_SYMBOL_GPL(blkcg_print_blkgs);
370 371 372 373

/**
 * __blkg_prfill_u64 - prfill helper for a single u64 value
 * @sf: seq_file to print to
374
 * @pdata: policy private data of interest
375 376
 * @v: value to print
 *
377
 * Print @v to @sf for the device assocaited with @pdata.
378
 */
379
u64 __blkg_prfill_u64(struct seq_file *sf, void *pdata, u64 v)
380
{
381
	const char *dname = blkg_dev_name(pdata_to_blkg(pdata));
382 383 384 385 386 387 388

	if (!dname)
		return 0;

	seq_printf(sf, "%s %llu\n", dname, (unsigned long long)v);
	return v;
}
389
EXPORT_SYMBOL_GPL(__blkg_prfill_u64);
390 391 392 393

/**
 * __blkg_prfill_rwstat - prfill helper for a blkg_rwstat
 * @sf: seq_file to print to
394
 * @pdata: policy private data of interest
395 396
 * @rwstat: rwstat to print
 *
397
 * Print @rwstat to @sf for the device assocaited with @pdata.
398
 */
399
u64 __blkg_prfill_rwstat(struct seq_file *sf, void *pdata,
400
			 const struct blkg_rwstat *rwstat)
401 402 403 404 405 406 407
{
	static const char *rwstr[] = {
		[BLKG_RWSTAT_READ]	= "Read",
		[BLKG_RWSTAT_WRITE]	= "Write",
		[BLKG_RWSTAT_SYNC]	= "Sync",
		[BLKG_RWSTAT_ASYNC]	= "Async",
	};
408
	const char *dname = blkg_dev_name(pdata_to_blkg(pdata));
409 410 411 412 413 414 415 416 417 418 419 420 421 422 423
	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;
}

424 425 426 427 428 429 430 431 432
/**
 * blkg_prfill_stat - prfill callback for blkg_stat
 * @sf: seq_file to print to
 * @pdata: policy private data of interest
 * @off: offset to the blkg_stat in @pdata
 *
 * prfill callback for printing a blkg_stat.
 */
u64 blkg_prfill_stat(struct seq_file *sf, void *pdata, int off)
433
{
434
	return __blkg_prfill_u64(sf, pdata, blkg_stat_read(pdata + off));
435
}
436
EXPORT_SYMBOL_GPL(blkg_prfill_stat);
437

438 439 440 441 442 443 444 445 446
/**
 * blkg_prfill_rwstat - prfill callback for blkg_rwstat
 * @sf: seq_file to print to
 * @pdata: policy private data of interest
 * @off: offset to the blkg_rwstat in @pdata
 *
 * prfill callback for printing a blkg_rwstat.
 */
u64 blkg_prfill_rwstat(struct seq_file *sf, void *pdata, int off)
447
{
448
	struct blkg_rwstat rwstat = blkg_rwstat_read(pdata + off);
449

450
	return __blkg_prfill_rwstat(sf, pdata, &rwstat);
451
}
452
EXPORT_SYMBOL_GPL(blkg_prfill_rwstat);
453

454 455 456
/**
 * blkg_conf_prep - parse and prepare for per-blkg config update
 * @blkcg: target block cgroup
457
 * @pol: target policy
458 459 460 461 462
 * @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
463 464
 * value.  This function returns with RCU read lock and queue lock held and
 * must be paired with blkg_conf_finish().
465
 */
466 467
int blkg_conf_prep(struct blkio_cgroup *blkcg,
		   const struct blkio_policy_type *pol, const char *input,
468
		   struct blkg_conf_ctx *ctx)
469
	__acquires(rcu) __acquires(disk->queue->queue_lock)
470
{
471 472
	struct gendisk *disk;
	struct blkio_group *blkg;
T
Tejun Heo 已提交
473 474 475
	unsigned int major, minor;
	unsigned long long v;
	int part, ret;
476

T
Tejun Heo 已提交
477 478
	if (sscanf(input, "%u:%u %llu", &major, &minor, &v) != 3)
		return -EINVAL;
479

T
Tejun Heo 已提交
480
	disk = get_gendisk(MKDEV(major, minor), &part);
T
Tejun Heo 已提交
481
	if (!disk || part)
T
Tejun Heo 已提交
482
		return -EINVAL;
483 484

	rcu_read_lock();
T
Tejun Heo 已提交
485
	spin_lock_irq(disk->queue->queue_lock);
486

487
	if (blkcg_policy_enabled(disk->queue, pol))
488
		blkg = blkg_lookup_create(blkcg, disk->queue);
489 490
	else
		blkg = ERR_PTR(-EINVAL);
491

T
Tejun Heo 已提交
492 493
	if (IS_ERR(blkg)) {
		ret = PTR_ERR(blkg);
494
		rcu_read_unlock();
495
		spin_unlock_irq(disk->queue->queue_lock);
496 497 498 499 500 501 502 503 504 505
		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();
506
		}
T
Tejun Heo 已提交
507
		return ret;
508
	}
509 510 511

	ctx->disk = disk;
	ctx->blkg = blkg;
T
Tejun Heo 已提交
512 513
	ctx->v = v;
	return 0;
514
}
515
EXPORT_SYMBOL_GPL(blkg_conf_prep);
516

517 518 519 520 521 522 523
/**
 * 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().
 */
524
void blkg_conf_finish(struct blkg_conf_ctx *ctx)
525
	__releases(ctx->disk->queue->queue_lock) __releases(rcu)
526
{
527
	spin_unlock_irq(ctx->disk->queue->queue_lock);
528 529
	rcu_read_unlock();
	put_disk(ctx->disk);
530
}
531
EXPORT_SYMBOL_GPL(blkg_conf_finish);
532

533
struct cftype blkio_files[] = {
534 535 536
	{
		.name = "reset_stats",
		.write_u64 = blkiocg_reset_stats,
537
	},
538
	{ }	/* terminate */
539 540
};

541 542 543 544 545 546 547 548 549 550 551
/**
 * blkiocg_pre_destroy - cgroup pre_destroy callback
 * @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().
 */
552
static int blkiocg_pre_destroy(struct cgroup *cgroup)
553 554
{
	struct blkio_cgroup *blkcg = cgroup_to_blkio_cgroup(cgroup);
555

556
	spin_lock_irq(&blkcg->lock);
557

558 559 560
	while (!hlist_empty(&blkcg->blkg_list)) {
		struct blkio_group *blkg = hlist_entry(blkcg->blkg_list.first,
						struct blkio_group, blkcg_node);
T
Tejun Heo 已提交
561
		struct request_queue *q = blkg->q;
562

563 564 565 566 567 568
		if (spin_trylock(q->queue_lock)) {
			blkg_destroy(blkg);
			spin_unlock(q->queue_lock);
		} else {
			spin_unlock_irq(&blkcg->lock);
			cpu_relax();
569
			spin_lock_irq(&blkcg->lock);
570
		}
571
	}
572

573
	spin_unlock_irq(&blkcg->lock);
574 575 576
	return 0;
}

577
static void blkiocg_destroy(struct cgroup *cgroup)
578 579 580
{
	struct blkio_cgroup *blkcg = cgroup_to_blkio_cgroup(cgroup);

B
Ben Blum 已提交
581 582
	if (blkcg != &blkio_root_cgroup)
		kfree(blkcg);
583 584
}

585
static struct cgroup_subsys_state *blkiocg_create(struct cgroup *cgroup)
586
{
T
Tejun Heo 已提交
587
	static atomic64_t id_seq = ATOMIC64_INIT(0);
588 589
	struct blkio_cgroup *blkcg;
	struct cgroup *parent = cgroup->parent;
590

591
	if (!parent) {
592 593 594 595 596 597 598 599
		blkcg = &blkio_root_cgroup;
		goto done;
	}

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

600
	blkcg->cfq_weight = CFQ_WEIGHT_DEFAULT;
T
Tejun Heo 已提交
601
	blkcg->id = atomic64_inc_return(&id_seq); /* root is 0, start from 1 */
602 603 604 605 606 607 608
done:
	spin_lock_init(&blkcg->lock);
	INIT_HLIST_HEAD(&blkcg->blkg_list);

	return &blkcg->css;
}

609 610 611 612 613 614 615 616 617 618 619 620 621 622
/**
 * 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();

623
	return blk_throtl_init(q);
624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646
}

/**
 * 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)
{
647
	spin_lock_irq(q->queue_lock);
648
	blkg_destroy_all(q);
649 650
	spin_unlock_irq(q->queue_lock);

651 652 653
	blk_throtl_exit(q);
}

654 655 656 657 658 659
/*
 * 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.
 */
660
static int blkiocg_can_attach(struct cgroup *cgrp, struct cgroup_taskset *tset)
661
{
662
	struct task_struct *task;
663 664 665 666
	struct io_context *ioc;
	int ret = 0;

	/* task_lock() is needed to avoid races with exit_io_context() */
667 668 669 670 671 672 673 674 675
	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;
	}
676 677 678
	return ret;
}

679 680 681 682
struct cgroup_subsys blkio_subsys = {
	.name = "blkio",
	.create = blkiocg_create,
	.can_attach = blkiocg_can_attach,
683
	.pre_destroy = blkiocg_pre_destroy,
684 685
	.destroy = blkiocg_destroy,
	.subsys_id = blkio_subsys_id,
686
	.base_cftypes = blkio_files,
687 688 689 690
	.module = THIS_MODULE,
};
EXPORT_SYMBOL_GPL(blkio_subsys);

691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723
/**
 * 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,
			  const struct blkio_policy_type *pol)
{
	LIST_HEAD(pds);
	struct blkio_group *blkg;
	struct blkg_policy_data *pd, *n;
	int cnt = 0, ret;

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

	blk_queue_bypass_start(q);

	/* make sure the root blkg exists and count the existing blkgs */
	spin_lock_irq(q->queue_lock);

	rcu_read_lock();
724
	blkg = __blkg_lookup_create(&blkio_root_cgroup, q);
725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805
	rcu_read_unlock();

	if (IS_ERR(blkg)) {
		ret = PTR_ERR(blkg);
		goto out_unlock;
	}
	q->root_blkg = blkg;

	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--) {
		pd = kzalloc_node(blkg_pd_size(pol), GFP_KERNEL, q->node);
		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;
		pol->ops.blkio_init_group_fn(blkg);

		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,
			     const struct blkio_policy_type *pol)
{
	struct blkio_group *blkg;

	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);

806 807 808 809
	/* 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);

810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827
	list_for_each_entry(blkg, &q->blkg_list, q_node) {
		/* grab blkcg lock too while removing @pd from @blkg */
		spin_lock(&blkg->blkcg->lock);

		if (pol->ops.blkio_exit_group_fn)
			pol->ops.blkio_exit_group_fn(blkg);

		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);

T
Tejun Heo 已提交
828 829 830 831 832 833 834 835 836
/**
 * blkio_policy_register - register a blkcg policy
 * @blkiop: blkcg policy to register
 *
 * Register @blkiop with blkcg core.  Might sleep and @blkiop may be
 * modified on successful registration.  Returns 0 on success and -errno on
 * failure.
 */
int blkio_policy_register(struct blkio_policy_type *blkiop)
837
{
T
Tejun Heo 已提交
838
	int i, ret;
839

840 841
	mutex_lock(&blkcg_pol_mutex);

T
Tejun Heo 已提交
842 843 844 845 846 847 848
	/* find an empty slot */
	ret = -ENOSPC;
	for (i = 0; i < BLKCG_MAX_POLS; i++)
		if (!blkio_policy[i])
			break;
	if (i >= BLKCG_MAX_POLS)
		goto out_unlock;
849

T
Tejun Heo 已提交
850 851 852 853 854
	/* register and update blkgs */
	blkiop->plid = i;
	blkio_policy[i] = blkiop;

	/* everything is in place, add intf files for the new policy */
855 856
	if (blkiop->cftypes)
		WARN_ON(cgroup_add_cftypes(&blkio_subsys, blkiop->cftypes));
T
Tejun Heo 已提交
857 858
	ret = 0;
out_unlock:
859
	mutex_unlock(&blkcg_pol_mutex);
T
Tejun Heo 已提交
860
	return ret;
861 862 863
}
EXPORT_SYMBOL_GPL(blkio_policy_register);

T
Tejun Heo 已提交
864 865 866 867 868 869
/**
 * blkiop_policy_unregister - unregister a blkcg policy
 * @blkiop: blkcg policy to unregister
 *
 * Undo blkio_policy_register(@blkiop).  Might sleep.
 */
870 871
void blkio_policy_unregister(struct blkio_policy_type *blkiop)
{
872 873
	mutex_lock(&blkcg_pol_mutex);

T
Tejun Heo 已提交
874 875 876 877
	if (WARN_ON(blkio_policy[blkiop->plid] != blkiop))
		goto out_unlock;

	/* kill the intf files first */
878 879 880
	if (blkiop->cftypes)
		cgroup_rm_cftypes(&blkio_subsys, blkiop->cftypes);

T
Tejun Heo 已提交
881
	/* unregister and update blkgs */
882
	blkio_policy[blkiop->plid] = NULL;
T
Tejun Heo 已提交
883
out_unlock:
884
	mutex_unlock(&blkcg_pol_mutex);
885 886
}
EXPORT_SYMBOL_GPL(blkio_policy_unregister);