2 * Generic process-grouping system.
4 * Based originally on the cpuset system, extracted by Paul Menage
5 * Copyright (C) 2006 Google, Inc
7 * Notifications support
8 * Copyright (C) 2009 Nokia Corporation
9 * Author: Kirill A. Shutemov
11 * Copyright notices from the original cpuset code:
12 * --------------------------------------------------
13 * Copyright (C) 2003 BULL SA.
14 * Copyright (C) 2004-2006 Silicon Graphics, Inc.
16 * Portions derived from Patrick Mochel's sysfs code.
17 * sysfs is Copyright (c) 2001-3 Patrick Mochel
19 * 2003-10-10 Written by Simon Derr.
20 * 2003-10-22 Updates by Stephen Hemminger.
21 * 2004 May-July Rework by Paul Jackson.
22 * ---------------------------------------------------
24 * This file is subject to the terms and conditions of the GNU General Public
25 * License. See the file COPYING in the main directory of the Linux
26 * distribution for more details.
29 #include <linux/cgroup.h>
30 #include <linux/cred.h>
31 #include <linux/ctype.h>
32 #include <linux/errno.h>
33 #include <linux/init_task.h>
34 #include <linux/kernel.h>
35 #include <linux/list.h>
37 #include <linux/mutex.h>
38 #include <linux/mount.h>
39 #include <linux/pagemap.h>
40 #include <linux/proc_fs.h>
41 #include <linux/rcupdate.h>
42 #include <linux/sched.h>
43 #include <linux/slab.h>
44 #include <linux/spinlock.h>
45 #include <linux/string.h>
46 #include <linux/sort.h>
47 #include <linux/kmod.h>
48 #include <linux/delayacct.h>
49 #include <linux/cgroupstats.h>
50 #include <linux/hashtable.h>
51 #include <linux/pid_namespace.h>
52 #include <linux/idr.h>
53 #include <linux/vmalloc.h> /* TODO: replace with more sophisticated array */
54 #include <linux/flex_array.h> /* used in cgroup_attach_task */
55 #include <linux/kthread.h>
56 #include <linux/delay.h>
58 #include <linux/atomic.h>
61 * pidlists linger the following amount before being destroyed. The goal
62 * is avoiding frequent destruction in the middle of consecutive read calls
63 * Expiring in the middle is a performance problem not a correctness one.
64 * 1 sec should be enough.
66 #define CGROUP_PIDLIST_DESTROY_DELAY HZ
68 #define CGROUP_FILE_NAME_MAX (MAX_CGROUP_TYPE_NAMELEN + \
72 * cgroup_tree_mutex nests above cgroup_mutex and protects cftypes, file
73 * creation/removal and hierarchy changing operations including cgroup
74 * creation, removal, css association and controller rebinding. This outer
75 * lock is needed mainly to resolve the circular dependency between kernfs
76 * active ref and cgroup_mutex. cgroup_tree_mutex nests above both.
78 static DEFINE_MUTEX(cgroup_tree_mutex);
81 * cgroup_mutex is the master lock. Any modification to cgroup or its
82 * hierarchy must be performed while holding it.
84 #ifdef CONFIG_PROVE_RCU
85 DEFINE_MUTEX(cgroup_mutex);
86 EXPORT_SYMBOL_GPL(cgroup_mutex); /* only for lockdep */
88 static DEFINE_MUTEX(cgroup_mutex);
92 * Protects cgroup_subsys->release_agent_path. Modifying it also requires
93 * cgroup_mutex. Reading requires either cgroup_mutex or this spinlock.
95 static DEFINE_SPINLOCK(release_agent_path_lock);
97 #define cgroup_assert_mutexes_or_rcu_locked() \
98 rcu_lockdep_assert(rcu_read_lock_held() || \
99 lockdep_is_held(&cgroup_tree_mutex) || \
100 lockdep_is_held(&cgroup_mutex), \
101 "cgroup_[tree_]mutex or RCU read lock required");
104 * cgroup destruction makes heavy use of work items and there can be a lot
105 * of concurrent destructions. Use a separate workqueue so that cgroup
106 * destruction work items don't end up filling up max_active of system_wq
107 * which may lead to deadlock.
109 static struct workqueue_struct *cgroup_destroy_wq;
112 * pidlist destructions need to be flushed on cgroup destruction. Use a
113 * separate workqueue as flush domain.
115 static struct workqueue_struct *cgroup_pidlist_destroy_wq;
117 /* generate an array of cgroup subsystem pointers */
118 #define SUBSYS(_x) [_x ## _cgrp_id] = &_x ## _cgrp_subsys,
119 static struct cgroup_subsys *cgroup_subsys[] = {
120 #include <linux/cgroup_subsys.h>
124 /* array of cgroup subsystem names */
125 #define SUBSYS(_x) [_x ## _cgrp_id] = #_x,
126 static const char *cgroup_subsys_name[] = {
127 #include <linux/cgroup_subsys.h>
132 * The dummy hierarchy, reserved for the subsystems that are otherwise
133 * unattached - it never has more than a single cgroup, and all tasks are
134 * part of that cgroup.
136 static struct cgroupfs_root cgroup_dummy_root;
138 /* dummy_top is a shorthand for the dummy hierarchy's top cgroup */
139 static struct cgroup * const cgroup_dummy_top = &cgroup_dummy_root.top_cgroup;
141 /* The list of hierarchy roots */
143 static LIST_HEAD(cgroup_roots);
144 static int cgroup_root_count;
146 /* hierarchy ID allocation and mapping, protected by cgroup_mutex */
147 static DEFINE_IDR(cgroup_hierarchy_idr);
150 * Assign a monotonically increasing serial number to cgroups. It
151 * guarantees cgroups with bigger numbers are newer than those with smaller
152 * numbers. Also, as cgroups are always appended to the parent's
153 * ->children list, it guarantees that sibling cgroups are always sorted in
154 * the ascending serial number order on the list. Protected by
157 static u64 cgroup_serial_nr_next = 1;
159 /* This flag indicates whether tasks in the fork and exit paths should
160 * check for fork/exit handlers to call. This avoids us having to do
161 * extra work in the fork/exit path if none of the subsystems need to
164 static int need_forkexit_callback __read_mostly;
166 static struct cftype cgroup_base_files[];
168 static void cgroup_put(struct cgroup *cgrp);
169 static int rebind_subsystems(struct cgroupfs_root *root,
170 unsigned long added_mask, unsigned removed_mask);
171 static void cgroup_destroy_css_killed(struct cgroup *cgrp);
172 static int cgroup_destroy_locked(struct cgroup *cgrp);
173 static int cgroup_addrm_files(struct cgroup *cgrp, struct cftype cfts[],
175 static void cgroup_pidlist_destroy_all(struct cgroup *cgrp);
178 * cgroup_css - obtain a cgroup's css for the specified subsystem
179 * @cgrp: the cgroup of interest
180 * @ss: the subsystem of interest (%NULL returns the dummy_css)
182 * Return @cgrp's css (cgroup_subsys_state) associated with @ss. This
183 * function must be called either under cgroup_mutex or rcu_read_lock() and
184 * the caller is responsible for pinning the returned css if it wants to
185 * keep accessing it outside the said locks. This function may return
186 * %NULL if @cgrp doesn't have @subsys_id enabled.
188 static struct cgroup_subsys_state *cgroup_css(struct cgroup *cgrp,
189 struct cgroup_subsys *ss)
192 return rcu_dereference_check(cgrp->subsys[ss->id],
193 lockdep_is_held(&cgroup_tree_mutex) ||
194 lockdep_is_held(&cgroup_mutex));
196 return &cgrp->dummy_css;
199 /* convenient tests for these bits */
200 static inline bool cgroup_is_dead(const struct cgroup *cgrp)
202 return test_bit(CGRP_DEAD, &cgrp->flags);
205 struct cgroup_subsys_state *seq_css(struct seq_file *seq)
207 struct kernfs_open_file *of = seq->private;
208 struct cgroup *cgrp = of->kn->parent->priv;
209 struct cftype *cft = seq_cft(seq);
212 * This is open and unprotected implementation of cgroup_css().
213 * seq_css() is only called from a kernfs file operation which has
214 * an active reference on the file. Because all the subsystem
215 * files are drained before a css is disassociated with a cgroup,
216 * the matching css from the cgroup's subsys table is guaranteed to
217 * be and stay valid until the enclosing operation is complete.
220 return rcu_dereference_raw(cgrp->subsys[cft->ss->id]);
222 return &cgrp->dummy_css;
224 EXPORT_SYMBOL_GPL(seq_css);
227 * cgroup_is_descendant - test ancestry
228 * @cgrp: the cgroup to be tested
229 * @ancestor: possible ancestor of @cgrp
231 * Test whether @cgrp is a descendant of @ancestor. It also returns %true
232 * if @cgrp == @ancestor. This function is safe to call as long as @cgrp
233 * and @ancestor are accessible.
235 bool cgroup_is_descendant(struct cgroup *cgrp, struct cgroup *ancestor)
238 if (cgrp == ancestor)
244 EXPORT_SYMBOL_GPL(cgroup_is_descendant);
246 static int cgroup_is_releasable(const struct cgroup *cgrp)
249 (1 << CGRP_RELEASABLE) |
250 (1 << CGRP_NOTIFY_ON_RELEASE);
251 return (cgrp->flags & bits) == bits;
254 static int notify_on_release(const struct cgroup *cgrp)
256 return test_bit(CGRP_NOTIFY_ON_RELEASE, &cgrp->flags);
260 * for_each_css - iterate all css's of a cgroup
261 * @css: the iteration cursor
262 * @ssid: the index of the subsystem, CGROUP_SUBSYS_COUNT after reaching the end
263 * @cgrp: the target cgroup to iterate css's of
265 * Should be called under cgroup_mutex.
267 #define for_each_css(css, ssid, cgrp) \
268 for ((ssid) = 0; (ssid) < CGROUP_SUBSYS_COUNT; (ssid)++) \
269 if (!((css) = rcu_dereference_check( \
270 (cgrp)->subsys[(ssid)], \
271 lockdep_is_held(&cgroup_tree_mutex) || \
272 lockdep_is_held(&cgroup_mutex)))) { } \
276 * for_each_subsys - iterate all enabled cgroup subsystems
277 * @ss: the iteration cursor
278 * @ssid: the index of @ss, CGROUP_SUBSYS_COUNT after reaching the end
280 #define for_each_subsys(ss, ssid) \
281 for ((ssid) = 0; (ssid) < CGROUP_SUBSYS_COUNT && \
282 (((ss) = cgroup_subsys[ssid]) || true); (ssid)++)
284 /* iterate across the active hierarchies */
285 #define for_each_active_root(root) \
286 list_for_each_entry((root), &cgroup_roots, root_list)
289 * cgroup_lock_live_group - take cgroup_mutex and check that cgrp is alive.
290 * @cgrp: the cgroup to be checked for liveness
292 * On success, returns true; the mutex should be later unlocked. On
293 * failure returns false with no lock held.
295 static bool cgroup_lock_live_group(struct cgroup *cgrp)
297 mutex_lock(&cgroup_mutex);
298 if (cgroup_is_dead(cgrp)) {
299 mutex_unlock(&cgroup_mutex);
305 /* the list of cgroups eligible for automatic release. Protected by
306 * release_list_lock */
307 static LIST_HEAD(release_list);
308 static DEFINE_RAW_SPINLOCK(release_list_lock);
309 static void cgroup_release_agent(struct work_struct *work);
310 static DECLARE_WORK(release_agent_work, cgroup_release_agent);
311 static void check_for_release(struct cgroup *cgrp);
314 * A cgroup can be associated with multiple css_sets as different tasks may
315 * belong to different cgroups on different hierarchies. In the other
316 * direction, a css_set is naturally associated with multiple cgroups.
317 * This M:N relationship is represented by the following link structure
318 * which exists for each association and allows traversing the associations
321 struct cgrp_cset_link {
322 /* the cgroup and css_set this link associates */
324 struct css_set *cset;
326 /* list of cgrp_cset_links anchored at cgrp->cset_links */
327 struct list_head cset_link;
329 /* list of cgrp_cset_links anchored at css_set->cgrp_links */
330 struct list_head cgrp_link;
333 /* The default css_set - used by init and its children prior to any
334 * hierarchies being mounted. It contains a pointer to the root state
335 * for each subsystem. Also used to anchor the list of css_sets. Not
336 * reference-counted, to improve performance when child cgroups
337 * haven't been created.
340 static struct css_set init_css_set;
341 static struct cgrp_cset_link init_cgrp_cset_link;
344 * css_set_lock protects the list of css_set objects, and the chain of
345 * tasks off each css_set. Nests outside task->alloc_lock due to
346 * css_task_iter_start().
348 static DEFINE_RWLOCK(css_set_lock);
349 static int css_set_count;
352 * hash table for cgroup groups. This improves the performance to find
353 * an existing css_set. This hash doesn't (currently) take into
354 * account cgroups in empty hierarchies.
356 #define CSS_SET_HASH_BITS 7
357 static DEFINE_HASHTABLE(css_set_table, CSS_SET_HASH_BITS);
359 static unsigned long css_set_hash(struct cgroup_subsys_state *css[])
361 unsigned long key = 0UL;
362 struct cgroup_subsys *ss;
365 for_each_subsys(ss, i)
366 key += (unsigned long)css[i];
367 key = (key >> 16) ^ key;
373 * We don't maintain the lists running through each css_set to its task
374 * until after the first call to css_task_iter_start(). This reduces the
375 * fork()/exit() overhead for people who have cgroups compiled into their
376 * kernel but not actually in use.
378 static int use_task_css_set_links __read_mostly;
380 static void __put_css_set(struct css_set *cset, int taskexit)
382 struct cgrp_cset_link *link, *tmp_link;
385 * Ensure that the refcount doesn't hit zero while any readers
386 * can see it. Similar to atomic_dec_and_lock(), but for an
389 if (atomic_add_unless(&cset->refcount, -1, 1))
391 write_lock(&css_set_lock);
392 if (!atomic_dec_and_test(&cset->refcount)) {
393 write_unlock(&css_set_lock);
397 /* This css_set is dead. unlink it and release cgroup refcounts */
398 hash_del(&cset->hlist);
401 list_for_each_entry_safe(link, tmp_link, &cset->cgrp_links, cgrp_link) {
402 struct cgroup *cgrp = link->cgrp;
404 list_del(&link->cset_link);
405 list_del(&link->cgrp_link);
407 /* @cgrp can't go away while we're holding css_set_lock */
408 if (list_empty(&cgrp->cset_links) && notify_on_release(cgrp)) {
410 set_bit(CGRP_RELEASABLE, &cgrp->flags);
411 check_for_release(cgrp);
417 write_unlock(&css_set_lock);
418 kfree_rcu(cset, rcu_head);
422 * refcounted get/put for css_set objects
424 static inline void get_css_set(struct css_set *cset)
426 atomic_inc(&cset->refcount);
429 static inline void put_css_set(struct css_set *cset)
431 __put_css_set(cset, 0);
434 static inline void put_css_set_taskexit(struct css_set *cset)
436 __put_css_set(cset, 1);
440 * compare_css_sets - helper function for find_existing_css_set().
441 * @cset: candidate css_set being tested
442 * @old_cset: existing css_set for a task
443 * @new_cgrp: cgroup that's being entered by the task
444 * @template: desired set of css pointers in css_set (pre-calculated)
446 * Returns true if "cset" matches "old_cset" except for the hierarchy
447 * which "new_cgrp" belongs to, for which it should match "new_cgrp".
449 static bool compare_css_sets(struct css_set *cset,
450 struct css_set *old_cset,
451 struct cgroup *new_cgrp,
452 struct cgroup_subsys_state *template[])
454 struct list_head *l1, *l2;
456 if (memcmp(template, cset->subsys, sizeof(cset->subsys))) {
457 /* Not all subsystems matched */
462 * Compare cgroup pointers in order to distinguish between
463 * different cgroups in heirarchies with no subsystems. We
464 * could get by with just this check alone (and skip the
465 * memcmp above) but on most setups the memcmp check will
466 * avoid the need for this more expensive check on almost all
470 l1 = &cset->cgrp_links;
471 l2 = &old_cset->cgrp_links;
473 struct cgrp_cset_link *link1, *link2;
474 struct cgroup *cgrp1, *cgrp2;
478 /* See if we reached the end - both lists are equal length. */
479 if (l1 == &cset->cgrp_links) {
480 BUG_ON(l2 != &old_cset->cgrp_links);
483 BUG_ON(l2 == &old_cset->cgrp_links);
485 /* Locate the cgroups associated with these links. */
486 link1 = list_entry(l1, struct cgrp_cset_link, cgrp_link);
487 link2 = list_entry(l2, struct cgrp_cset_link, cgrp_link);
490 /* Hierarchies should be linked in the same order. */
491 BUG_ON(cgrp1->root != cgrp2->root);
494 * If this hierarchy is the hierarchy of the cgroup
495 * that's changing, then we need to check that this
496 * css_set points to the new cgroup; if it's any other
497 * hierarchy, then this css_set should point to the
498 * same cgroup as the old css_set.
500 if (cgrp1->root == new_cgrp->root) {
501 if (cgrp1 != new_cgrp)
512 * find_existing_css_set - init css array and find the matching css_set
513 * @old_cset: the css_set that we're using before the cgroup transition
514 * @cgrp: the cgroup that we're moving into
515 * @template: out param for the new set of csses, should be clear on entry
517 static struct css_set *find_existing_css_set(struct css_set *old_cset,
519 struct cgroup_subsys_state *template[])
521 struct cgroupfs_root *root = cgrp->root;
522 struct cgroup_subsys *ss;
523 struct css_set *cset;
528 * Build the set of subsystem state objects that we want to see in the
529 * new css_set. while subsystems can change globally, the entries here
530 * won't change, so no need for locking.
532 for_each_subsys(ss, i) {
533 if (root->subsys_mask & (1UL << i)) {
534 /* Subsystem is in this hierarchy. So we want
535 * the subsystem state from the new
537 template[i] = cgroup_css(cgrp, ss);
539 /* Subsystem is not in this hierarchy, so we
540 * don't want to change the subsystem state */
541 template[i] = old_cset->subsys[i];
545 key = css_set_hash(template);
546 hash_for_each_possible(css_set_table, cset, hlist, key) {
547 if (!compare_css_sets(cset, old_cset, cgrp, template))
550 /* This css_set matches what we need */
554 /* No existing cgroup group matched */
558 static void free_cgrp_cset_links(struct list_head *links_to_free)
560 struct cgrp_cset_link *link, *tmp_link;
562 list_for_each_entry_safe(link, tmp_link, links_to_free, cset_link) {
563 list_del(&link->cset_link);
569 * allocate_cgrp_cset_links - allocate cgrp_cset_links
570 * @count: the number of links to allocate
571 * @tmp_links: list_head the allocated links are put on
573 * Allocate @count cgrp_cset_link structures and chain them on @tmp_links
574 * through ->cset_link. Returns 0 on success or -errno.
576 static int allocate_cgrp_cset_links(int count, struct list_head *tmp_links)
578 struct cgrp_cset_link *link;
581 INIT_LIST_HEAD(tmp_links);
583 for (i = 0; i < count; i++) {
584 link = kzalloc(sizeof(*link), GFP_KERNEL);
586 free_cgrp_cset_links(tmp_links);
589 list_add(&link->cset_link, tmp_links);
595 * link_css_set - a helper function to link a css_set to a cgroup
596 * @tmp_links: cgrp_cset_link objects allocated by allocate_cgrp_cset_links()
597 * @cset: the css_set to be linked
598 * @cgrp: the destination cgroup
600 static void link_css_set(struct list_head *tmp_links, struct css_set *cset,
603 struct cgrp_cset_link *link;
605 BUG_ON(list_empty(tmp_links));
606 link = list_first_entry(tmp_links, struct cgrp_cset_link, cset_link);
609 list_move(&link->cset_link, &cgrp->cset_links);
611 * Always add links to the tail of the list so that the list
612 * is sorted by order of hierarchy creation
614 list_add_tail(&link->cgrp_link, &cset->cgrp_links);
618 * find_css_set - return a new css_set with one cgroup updated
619 * @old_cset: the baseline css_set
620 * @cgrp: the cgroup to be updated
622 * Return a new css_set that's equivalent to @old_cset, but with @cgrp
623 * substituted into the appropriate hierarchy.
625 static struct css_set *find_css_set(struct css_set *old_cset,
628 struct cgroup_subsys_state *template[CGROUP_SUBSYS_COUNT] = { };
629 struct css_set *cset;
630 struct list_head tmp_links;
631 struct cgrp_cset_link *link;
634 lockdep_assert_held(&cgroup_mutex);
636 /* First see if we already have a cgroup group that matches
638 read_lock(&css_set_lock);
639 cset = find_existing_css_set(old_cset, cgrp, template);
642 read_unlock(&css_set_lock);
647 cset = kzalloc(sizeof(*cset), GFP_KERNEL);
651 /* Allocate all the cgrp_cset_link objects that we'll need */
652 if (allocate_cgrp_cset_links(cgroup_root_count, &tmp_links) < 0) {
657 atomic_set(&cset->refcount, 1);
658 INIT_LIST_HEAD(&cset->cgrp_links);
659 INIT_LIST_HEAD(&cset->tasks);
660 INIT_HLIST_NODE(&cset->hlist);
662 /* Copy the set of subsystem state objects generated in
663 * find_existing_css_set() */
664 memcpy(cset->subsys, template, sizeof(cset->subsys));
666 write_lock(&css_set_lock);
667 /* Add reference counts and links from the new css_set. */
668 list_for_each_entry(link, &old_cset->cgrp_links, cgrp_link) {
669 struct cgroup *c = link->cgrp;
671 if (c->root == cgrp->root)
673 link_css_set(&tmp_links, cset, c);
676 BUG_ON(!list_empty(&tmp_links));
680 /* Add this cgroup group to the hash table */
681 key = css_set_hash(cset->subsys);
682 hash_add(css_set_table, &cset->hlist, key);
684 write_unlock(&css_set_lock);
689 static struct cgroupfs_root *cgroup_root_from_kf(struct kernfs_root *kf_root)
691 struct cgroup *top_cgrp = kf_root->kn->priv;
693 return top_cgrp->root;
696 static int cgroup_init_root_id(struct cgroupfs_root *root, int start, int end)
700 lockdep_assert_held(&cgroup_mutex);
702 id = idr_alloc_cyclic(&cgroup_hierarchy_idr, root, start, end,
707 root->hierarchy_id = id;
711 static void cgroup_exit_root_id(struct cgroupfs_root *root)
713 lockdep_assert_held(&cgroup_mutex);
715 if (root->hierarchy_id) {
716 idr_remove(&cgroup_hierarchy_idr, root->hierarchy_id);
717 root->hierarchy_id = 0;
721 static void cgroup_free_root(struct cgroupfs_root *root)
724 /* hierarhcy ID shoulid already have been released */
725 WARN_ON_ONCE(root->hierarchy_id);
727 idr_destroy(&root->cgroup_idr);
732 static void cgroup_destroy_root(struct cgroupfs_root *root)
734 struct cgroup *cgrp = &root->top_cgroup;
735 struct cgrp_cset_link *link, *tmp_link;
738 mutex_lock(&cgroup_tree_mutex);
739 mutex_lock(&cgroup_mutex);
741 BUG_ON(atomic_read(&root->nr_cgrps));
742 BUG_ON(!list_empty(&cgrp->children));
744 /* Rebind all subsystems back to the default hierarchy */
745 if (root->flags & CGRP_ROOT_SUBSYS_BOUND) {
746 ret = rebind_subsystems(root, 0, root->subsys_mask);
747 /* Shouldn't be able to fail ... */
752 * Release all the links from cset_links to this hierarchy's
755 write_lock(&css_set_lock);
757 list_for_each_entry_safe(link, tmp_link, &cgrp->cset_links, cset_link) {
758 list_del(&link->cset_link);
759 list_del(&link->cgrp_link);
762 write_unlock(&css_set_lock);
764 if (!list_empty(&root->root_list)) {
765 list_del(&root->root_list);
769 cgroup_exit_root_id(root);
771 mutex_unlock(&cgroup_mutex);
772 mutex_unlock(&cgroup_tree_mutex);
774 kernfs_destroy_root(root->kf_root);
775 cgroup_free_root(root);
779 * Return the cgroup for "task" from the given hierarchy. Must be
780 * called with cgroup_mutex held.
782 static struct cgroup *task_cgroup_from_root(struct task_struct *task,
783 struct cgroupfs_root *root)
785 struct css_set *cset;
786 struct cgroup *res = NULL;
788 BUG_ON(!mutex_is_locked(&cgroup_mutex));
789 read_lock(&css_set_lock);
791 * No need to lock the task - since we hold cgroup_mutex the
792 * task can't change groups, so the only thing that can happen
793 * is that it exits and its css is set back to init_css_set.
795 cset = task_css_set(task);
796 if (cset == &init_css_set) {
797 res = &root->top_cgroup;
799 struct cgrp_cset_link *link;
801 list_for_each_entry(link, &cset->cgrp_links, cgrp_link) {
802 struct cgroup *c = link->cgrp;
804 if (c->root == root) {
810 read_unlock(&css_set_lock);
816 * There is one global cgroup mutex. We also require taking
817 * task_lock() when dereferencing a task's cgroup subsys pointers.
818 * See "The task_lock() exception", at the end of this comment.
820 * A task must hold cgroup_mutex to modify cgroups.
822 * Any task can increment and decrement the count field without lock.
823 * So in general, code holding cgroup_mutex can't rely on the count
824 * field not changing. However, if the count goes to zero, then only
825 * cgroup_attach_task() can increment it again. Because a count of zero
826 * means that no tasks are currently attached, therefore there is no
827 * way a task attached to that cgroup can fork (the other way to
828 * increment the count). So code holding cgroup_mutex can safely
829 * assume that if the count is zero, it will stay zero. Similarly, if
830 * a task holds cgroup_mutex on a cgroup with zero count, it
831 * knows that the cgroup won't be removed, as cgroup_rmdir()
834 * The fork and exit callbacks cgroup_fork() and cgroup_exit(), don't
835 * (usually) take cgroup_mutex. These are the two most performance
836 * critical pieces of code here. The exception occurs on cgroup_exit(),
837 * when a task in a notify_on_release cgroup exits. Then cgroup_mutex
838 * is taken, and if the cgroup count is zero, a usermode call made
839 * to the release agent with the name of the cgroup (path relative to
840 * the root of cgroup file system) as the argument.
842 * A cgroup can only be deleted if both its 'count' of using tasks
843 * is zero, and its list of 'children' cgroups is empty. Since all
844 * tasks in the system use _some_ cgroup, and since there is always at
845 * least one task in the system (init, pid == 1), therefore, top_cgroup
846 * always has either children cgroups and/or using tasks. So we don't
847 * need a special hack to ensure that top_cgroup cannot be deleted.
849 * The task_lock() exception
851 * The need for this exception arises from the action of
852 * cgroup_attach_task(), which overwrites one task's cgroup pointer with
853 * another. It does so using cgroup_mutex, however there are
854 * several performance critical places that need to reference
855 * task->cgroup without the expense of grabbing a system global
856 * mutex. Therefore except as noted below, when dereferencing or, as
857 * in cgroup_attach_task(), modifying a task's cgroup pointer we use
858 * task_lock(), which acts on a spinlock (task->alloc_lock) already in
859 * the task_struct routinely used for such matters.
861 * P.S. One more locking exception. RCU is used to guard the
862 * update of a tasks cgroup pointer by cgroup_attach_task()
865 static int cgroup_populate_dir(struct cgroup *cgrp, unsigned long subsys_mask);
866 static struct kernfs_syscall_ops cgroup_kf_syscall_ops;
867 static const struct file_operations proc_cgroupstats_operations;
869 static char *cgroup_file_name(struct cgroup *cgrp, const struct cftype *cft,
872 if (cft->ss && !(cft->flags & CFTYPE_NO_PREFIX) &&
873 !(cgrp->root->flags & CGRP_ROOT_NOPREFIX))
874 snprintf(buf, CGROUP_FILE_NAME_MAX, "%s.%s",
875 cft->ss->name, cft->name);
877 strncpy(buf, cft->name, CGROUP_FILE_NAME_MAX);
882 * cgroup_file_mode - deduce file mode of a control file
883 * @cft: the control file in question
885 * returns cft->mode if ->mode is not 0
886 * returns S_IRUGO|S_IWUSR if it has both a read and a write handler
887 * returns S_IRUGO if it has only a read handler
888 * returns S_IWUSR if it has only a write hander
890 static umode_t cgroup_file_mode(const struct cftype *cft)
897 if (cft->read_u64 || cft->read_s64 || cft->seq_show)
900 if (cft->write_u64 || cft->write_s64 || cft->write_string ||
907 static void cgroup_free_fn(struct work_struct *work)
909 struct cgroup *cgrp = container_of(work, struct cgroup, destroy_work);
911 atomic_dec(&cgrp->root->nr_cgrps);
912 cgroup_pidlist_destroy_all(cgrp);
916 * We get a ref to the parent, and put the ref when this
917 * cgroup is being freed, so it's guaranteed that the
918 * parent won't be destroyed before its children.
920 cgroup_put(cgrp->parent);
921 kernfs_put(cgrp->kn);
925 * This is top cgroup's refcnt reaching zero, which
926 * indicates that the root should be released.
928 cgroup_destroy_root(cgrp->root);
932 static void cgroup_free_rcu(struct rcu_head *head)
934 struct cgroup *cgrp = container_of(head, struct cgroup, rcu_head);
936 INIT_WORK(&cgrp->destroy_work, cgroup_free_fn);
937 queue_work(cgroup_destroy_wq, &cgrp->destroy_work);
940 static void cgroup_get(struct cgroup *cgrp)
942 WARN_ON_ONCE(cgroup_is_dead(cgrp));
943 WARN_ON_ONCE(atomic_read(&cgrp->refcnt) <= 0);
944 atomic_inc(&cgrp->refcnt);
947 static void cgroup_put(struct cgroup *cgrp)
949 if (!atomic_dec_and_test(&cgrp->refcnt))
951 if (WARN_ON_ONCE(cgrp->parent && !cgroup_is_dead(cgrp)))
955 * XXX: cgrp->id is only used to look up css's. As cgroup and
956 * css's lifetimes will be decoupled, it should be made
957 * per-subsystem and moved to css->id so that lookups are
958 * successful until the target css is released.
960 mutex_lock(&cgroup_mutex);
961 idr_remove(&cgrp->root->cgroup_idr, cgrp->id);
962 mutex_unlock(&cgroup_mutex);
965 call_rcu(&cgrp->rcu_head, cgroup_free_rcu);
968 static void cgroup_rm_file(struct cgroup *cgrp, const struct cftype *cft)
970 char name[CGROUP_FILE_NAME_MAX];
972 lockdep_assert_held(&cgroup_tree_mutex);
973 kernfs_remove_by_name(cgrp->kn, cgroup_file_name(cgrp, cft, name));
977 * cgroup_clear_dir - remove subsys files in a cgroup directory
978 * @cgrp: target cgroup
979 * @subsys_mask: mask of the subsystem ids whose files should be removed
981 static void cgroup_clear_dir(struct cgroup *cgrp, unsigned long subsys_mask)
983 struct cgroup_subsys *ss;
986 for_each_subsys(ss, i) {
989 if (!test_bit(i, &subsys_mask))
991 list_for_each_entry(cfts, &ss->cfts, node)
992 cgroup_addrm_files(cgrp, cfts, false);
996 static int rebind_subsystems(struct cgroupfs_root *root,
997 unsigned long added_mask, unsigned removed_mask)
999 struct cgroup *cgrp = &root->top_cgroup;
1000 struct cgroup_subsys *ss;
1003 lockdep_assert_held(&cgroup_tree_mutex);
1004 lockdep_assert_held(&cgroup_mutex);
1006 /* Check that any added subsystems are currently free */
1007 for_each_subsys(ss, i)
1008 if ((added_mask & (1 << i)) && ss->root != &cgroup_dummy_root)
1011 ret = cgroup_populate_dir(cgrp, added_mask);
1016 * Nothing can fail from this point on. Remove files for the
1017 * removed subsystems and rebind each subsystem.
1019 mutex_unlock(&cgroup_mutex);
1020 cgroup_clear_dir(cgrp, removed_mask);
1021 mutex_lock(&cgroup_mutex);
1023 for_each_subsys(ss, i) {
1024 unsigned long bit = 1UL << i;
1026 if (bit & added_mask) {
1027 /* We're binding this subsystem to this hierarchy */
1028 BUG_ON(cgroup_css(cgrp, ss));
1029 BUG_ON(!cgroup_css(cgroup_dummy_top, ss));
1030 BUG_ON(cgroup_css(cgroup_dummy_top, ss)->cgroup != cgroup_dummy_top);
1032 rcu_assign_pointer(cgrp->subsys[i],
1033 cgroup_css(cgroup_dummy_top, ss));
1034 cgroup_css(cgrp, ss)->cgroup = cgrp;
1038 ss->bind(cgroup_css(cgrp, ss));
1040 /* refcount was already taken, and we're keeping it */
1041 root->subsys_mask |= bit;
1042 } else if (bit & removed_mask) {
1043 /* We're removing this subsystem */
1044 BUG_ON(cgroup_css(cgrp, ss) != cgroup_css(cgroup_dummy_top, ss));
1045 BUG_ON(cgroup_css(cgrp, ss)->cgroup != cgrp);
1048 ss->bind(cgroup_css(cgroup_dummy_top, ss));
1050 cgroup_css(cgroup_dummy_top, ss)->cgroup = cgroup_dummy_top;
1051 RCU_INIT_POINTER(cgrp->subsys[i], NULL);
1053 cgroup_subsys[i]->root = &cgroup_dummy_root;
1054 root->subsys_mask &= ~bit;
1059 * Mark @root has finished binding subsystems. @root->subsys_mask
1060 * now matches the bound subsystems.
1062 root->flags |= CGRP_ROOT_SUBSYS_BOUND;
1063 kernfs_activate(cgrp->kn);
1068 static int cgroup_show_options(struct seq_file *seq,
1069 struct kernfs_root *kf_root)
1071 struct cgroupfs_root *root = cgroup_root_from_kf(kf_root);
1072 struct cgroup_subsys *ss;
1075 for_each_subsys(ss, ssid)
1076 if (root->subsys_mask & (1 << ssid))
1077 seq_printf(seq, ",%s", ss->name);
1078 if (root->flags & CGRP_ROOT_SANE_BEHAVIOR)
1079 seq_puts(seq, ",sane_behavior");
1080 if (root->flags & CGRP_ROOT_NOPREFIX)
1081 seq_puts(seq, ",noprefix");
1082 if (root->flags & CGRP_ROOT_XATTR)
1083 seq_puts(seq, ",xattr");
1085 spin_lock(&release_agent_path_lock);
1086 if (strlen(root->release_agent_path))
1087 seq_printf(seq, ",release_agent=%s", root->release_agent_path);
1088 spin_unlock(&release_agent_path_lock);
1090 if (test_bit(CGRP_CPUSET_CLONE_CHILDREN, &root->top_cgroup.flags))
1091 seq_puts(seq, ",clone_children");
1092 if (strlen(root->name))
1093 seq_printf(seq, ",name=%s", root->name);
1097 struct cgroup_sb_opts {
1098 unsigned long subsys_mask;
1099 unsigned long flags;
1100 char *release_agent;
1101 bool cpuset_clone_children;
1103 /* User explicitly requested empty subsystem */
1108 * Convert a hierarchy specifier into a bitmask of subsystems and
1109 * flags. Call with cgroup_mutex held to protect the cgroup_subsys[]
1110 * array. This function takes refcounts on subsystems to be used, unless it
1111 * returns error, in which case no refcounts are taken.
1113 static int parse_cgroupfs_options(char *data, struct cgroup_sb_opts *opts)
1115 char *token, *o = data;
1116 bool all_ss = false, one_ss = false;
1117 unsigned long mask = (unsigned long)-1;
1118 struct cgroup_subsys *ss;
1121 BUG_ON(!mutex_is_locked(&cgroup_mutex));
1123 #ifdef CONFIG_CPUSETS
1124 mask = ~(1UL << cpuset_cgrp_id);
1127 memset(opts, 0, sizeof(*opts));
1129 while ((token = strsep(&o, ",")) != NULL) {
1132 if (!strcmp(token, "none")) {
1133 /* Explicitly have no subsystems */
1137 if (!strcmp(token, "all")) {
1138 /* Mutually exclusive option 'all' + subsystem name */
1144 if (!strcmp(token, "__DEVEL__sane_behavior")) {
1145 opts->flags |= CGRP_ROOT_SANE_BEHAVIOR;
1148 if (!strcmp(token, "noprefix")) {
1149 opts->flags |= CGRP_ROOT_NOPREFIX;
1152 if (!strcmp(token, "clone_children")) {
1153 opts->cpuset_clone_children = true;
1156 if (!strcmp(token, "xattr")) {
1157 opts->flags |= CGRP_ROOT_XATTR;
1160 if (!strncmp(token, "release_agent=", 14)) {
1161 /* Specifying two release agents is forbidden */
1162 if (opts->release_agent)
1164 opts->release_agent =
1165 kstrndup(token + 14, PATH_MAX - 1, GFP_KERNEL);
1166 if (!opts->release_agent)
1170 if (!strncmp(token, "name=", 5)) {
1171 const char *name = token + 5;
1172 /* Can't specify an empty name */
1175 /* Must match [\w.-]+ */
1176 for (i = 0; i < strlen(name); i++) {
1180 if ((c == '.') || (c == '-') || (c == '_'))
1184 /* Specifying two names is forbidden */
1187 opts->name = kstrndup(name,
1188 MAX_CGROUP_ROOT_NAMELEN - 1,
1196 for_each_subsys(ss, i) {
1197 if (strcmp(token, ss->name))
1202 /* Mutually exclusive option 'all' + subsystem name */
1205 set_bit(i, &opts->subsys_mask);
1210 if (i == CGROUP_SUBSYS_COUNT)
1215 * If the 'all' option was specified select all the subsystems,
1216 * otherwise if 'none', 'name=' and a subsystem name options
1217 * were not specified, let's default to 'all'
1219 if (all_ss || (!one_ss && !opts->none && !opts->name))
1220 for_each_subsys(ss, i)
1222 set_bit(i, &opts->subsys_mask);
1224 /* Consistency checks */
1226 if (opts->flags & CGRP_ROOT_SANE_BEHAVIOR) {
1227 pr_warning("cgroup: sane_behavior: this is still under development and its behaviors will change, proceed at your own risk\n");
1229 if (opts->flags & CGRP_ROOT_NOPREFIX) {
1230 pr_err("cgroup: sane_behavior: noprefix is not allowed\n");
1234 if (opts->cpuset_clone_children) {
1235 pr_err("cgroup: sane_behavior: clone_children is not allowed\n");
1239 if (opts->flags & CGRP_ROOT_XATTR)
1240 pr_warning("cgroup: sane_behavior: xattr is always available, flag unnecessary\n");
1244 * Option noprefix was introduced just for backward compatibility
1245 * with the old cpuset, so we allow noprefix only if mounting just
1246 * the cpuset subsystem.
1248 if ((opts->flags & CGRP_ROOT_NOPREFIX) && (opts->subsys_mask & mask))
1252 /* Can't specify "none" and some subsystems */
1253 if (opts->subsys_mask && opts->none)
1257 * We either have to specify by name or by subsystems. (So all
1258 * empty hierarchies must have a name).
1260 if (!opts->subsys_mask && !opts->name)
1266 static int cgroup_remount(struct kernfs_root *kf_root, int *flags, char *data)
1269 struct cgroupfs_root *root = cgroup_root_from_kf(kf_root);
1270 struct cgroup_sb_opts opts;
1271 unsigned long added_mask, removed_mask;
1273 if (root->flags & CGRP_ROOT_SANE_BEHAVIOR) {
1274 pr_err("cgroup: sane_behavior: remount is not allowed\n");
1278 mutex_lock(&cgroup_tree_mutex);
1279 mutex_lock(&cgroup_mutex);
1281 /* See what subsystems are wanted */
1282 ret = parse_cgroupfs_options(data, &opts);
1286 if (opts.subsys_mask != root->subsys_mask || opts.release_agent)
1287 pr_warning("cgroup: option changes via remount are deprecated (pid=%d comm=%s)\n",
1288 task_tgid_nr(current), current->comm);
1290 added_mask = opts.subsys_mask & ~root->subsys_mask;
1291 removed_mask = root->subsys_mask & ~opts.subsys_mask;
1293 /* Don't allow flags or name to change at remount */
1294 if (((opts.flags ^ root->flags) & CGRP_ROOT_OPTION_MASK) ||
1295 (opts.name && strcmp(opts.name, root->name))) {
1296 pr_err("cgroup: option or name mismatch, new: 0x%lx \"%s\", old: 0x%lx \"%s\"\n",
1297 opts.flags & CGRP_ROOT_OPTION_MASK, opts.name ?: "",
1298 root->flags & CGRP_ROOT_OPTION_MASK, root->name);
1303 /* remounting is not allowed for populated hierarchies */
1304 if (!list_empty(&root->top_cgroup.children)) {
1309 ret = rebind_subsystems(root, added_mask, removed_mask);
1313 if (opts.release_agent) {
1314 spin_lock(&release_agent_path_lock);
1315 strcpy(root->release_agent_path, opts.release_agent);
1316 spin_unlock(&release_agent_path_lock);
1319 kfree(opts.release_agent);
1321 mutex_unlock(&cgroup_mutex);
1322 mutex_unlock(&cgroup_tree_mutex);
1326 static void init_cgroup_housekeeping(struct cgroup *cgrp)
1328 atomic_set(&cgrp->refcnt, 1);
1329 INIT_LIST_HEAD(&cgrp->sibling);
1330 INIT_LIST_HEAD(&cgrp->children);
1331 INIT_LIST_HEAD(&cgrp->cset_links);
1332 INIT_LIST_HEAD(&cgrp->release_list);
1333 INIT_LIST_HEAD(&cgrp->pidlists);
1334 mutex_init(&cgrp->pidlist_mutex);
1335 cgrp->dummy_css.cgroup = cgrp;
1338 static void init_cgroup_root(struct cgroupfs_root *root)
1340 struct cgroup *cgrp = &root->top_cgroup;
1342 INIT_LIST_HEAD(&root->root_list);
1343 atomic_set(&root->nr_cgrps, 1);
1345 init_cgroup_housekeeping(cgrp);
1346 idr_init(&root->cgroup_idr);
1349 static struct cgroupfs_root *cgroup_root_from_opts(struct cgroup_sb_opts *opts)
1351 struct cgroupfs_root *root;
1353 if (!opts->subsys_mask && !opts->none)
1354 return ERR_PTR(-EINVAL);
1356 root = kzalloc(sizeof(*root), GFP_KERNEL);
1358 return ERR_PTR(-ENOMEM);
1360 init_cgroup_root(root);
1363 * We need to set @root->subsys_mask now so that @root can be
1364 * matched by cgroup_test_super() before it finishes
1365 * initialization; otherwise, competing mounts with the same
1366 * options may try to bind the same subsystems instead of waiting
1367 * for the first one leading to unexpected mount errors.
1368 * SUBSYS_BOUND will be set once actual binding is complete.
1370 root->subsys_mask = opts->subsys_mask;
1371 root->flags = opts->flags;
1372 if (opts->release_agent)
1373 strcpy(root->release_agent_path, opts->release_agent);
1375 strcpy(root->name, opts->name);
1376 if (opts->cpuset_clone_children)
1377 set_bit(CGRP_CPUSET_CLONE_CHILDREN, &root->top_cgroup.flags);
1381 static int cgroup_setup_root(struct cgroupfs_root *root)
1383 LIST_HEAD(tmp_links);
1384 struct cgroup *root_cgrp = &root->top_cgroup;
1385 struct css_set *cset;
1388 lockdep_assert_held(&cgroup_tree_mutex);
1389 lockdep_assert_held(&cgroup_mutex);
1391 ret = idr_alloc(&root->cgroup_idr, root_cgrp, 0, 1, GFP_KERNEL);
1394 root_cgrp->id = ret;
1397 * We're accessing css_set_count without locking css_set_lock here,
1398 * but that's OK - it can only be increased by someone holding
1399 * cgroup_lock, and that's us. The worst that can happen is that we
1400 * have some link structures left over
1402 ret = allocate_cgrp_cset_links(css_set_count, &tmp_links);
1406 /* ID 0 is reserved for dummy root, 1 for unified hierarchy */
1407 ret = cgroup_init_root_id(root, 2, 0);
1411 root->kf_root = kernfs_create_root(&cgroup_kf_syscall_ops,
1412 KERNFS_ROOT_CREATE_DEACTIVATED,
1414 if (IS_ERR(root->kf_root)) {
1415 ret = PTR_ERR(root->kf_root);
1418 root_cgrp->kn = root->kf_root->kn;
1420 ret = cgroup_addrm_files(root_cgrp, cgroup_base_files, true);
1424 ret = rebind_subsystems(root, root->subsys_mask, 0);
1429 * There must be no failure case after here, since rebinding takes
1430 * care of subsystems' refcounts, which are explicitly dropped in
1431 * the failure exit path.
1433 list_add(&root->root_list, &cgroup_roots);
1434 cgroup_root_count++;
1437 * Link the top cgroup in this hierarchy into all the css_set
1440 write_lock(&css_set_lock);
1441 hash_for_each(css_set_table, i, cset, hlist)
1442 link_css_set(&tmp_links, cset, root_cgrp);
1443 write_unlock(&css_set_lock);
1445 BUG_ON(!list_empty(&root_cgrp->children));
1446 BUG_ON(atomic_read(&root->nr_cgrps) != 1);
1448 kernfs_activate(root_cgrp->kn);
1453 kernfs_destroy_root(root->kf_root);
1454 root->kf_root = NULL;
1456 cgroup_exit_root_id(root);
1458 free_cgrp_cset_links(&tmp_links);
1462 static struct dentry *cgroup_mount(struct file_system_type *fs_type,
1463 int flags, const char *unused_dev_name,
1466 struct cgroupfs_root *root;
1467 struct cgroup_sb_opts opts;
1468 struct dentry *dentry;
1471 mutex_lock(&cgroup_tree_mutex);
1472 mutex_lock(&cgroup_mutex);
1474 /* First find the desired set of subsystems */
1475 ret = parse_cgroupfs_options(data, &opts);
1479 /* look for a matching existing root */
1480 for_each_active_root(root) {
1481 bool name_match = false;
1484 * If we asked for a name then it must match. Also, if
1485 * name matches but sybsys_mask doesn't, we should fail.
1486 * Remember whether name matched.
1489 if (strcmp(opts.name, root->name))
1495 * If we asked for subsystems (or explicitly for no
1496 * subsystems) then they must match.
1498 if ((opts.subsys_mask || opts.none) &&
1499 (opts.subsys_mask != root->subsys_mask)) {
1506 if ((root->flags ^ opts.flags) & CGRP_ROOT_OPTION_MASK) {
1507 if ((root->flags | opts.flags) & CGRP_ROOT_SANE_BEHAVIOR) {
1508 pr_err("cgroup: sane_behavior: new mount options should match the existing superblock\n");
1512 pr_warning("cgroup: new mount options do not match the existing superblock, will be ignored\n");
1517 * A root's lifetime is governed by its top cgroup. Zero
1518 * ref indicate that the root is being destroyed. Wait for
1519 * destruction to complete so that the subsystems are free.
1520 * We can use wait_queue for the wait but this path is
1521 * super cold. Let's just sleep for a bit and retry.
1523 if (!atomic_inc_not_zero(&root->top_cgroup.refcnt)) {
1524 mutex_unlock(&cgroup_mutex);
1525 mutex_unlock(&cgroup_tree_mutex);
1534 /* no such thing, create a new one */
1535 root = cgroup_root_from_opts(&opts);
1537 ret = PTR_ERR(root);
1541 ret = cgroup_setup_root(root);
1543 cgroup_free_root(root);
1546 mutex_unlock(&cgroup_mutex);
1547 mutex_unlock(&cgroup_tree_mutex);
1549 kfree(opts.release_agent);
1553 return ERR_PTR(ret);
1555 dentry = kernfs_mount(fs_type, flags, root->kf_root);
1557 cgroup_put(&root->top_cgroup);
1561 static void cgroup_kill_sb(struct super_block *sb)
1563 struct kernfs_root *kf_root = kernfs_root_from_sb(sb);
1564 struct cgroupfs_root *root = cgroup_root_from_kf(kf_root);
1566 cgroup_put(&root->top_cgroup);
1570 static struct file_system_type cgroup_fs_type = {
1572 .mount = cgroup_mount,
1573 .kill_sb = cgroup_kill_sb,
1576 static struct kobject *cgroup_kobj;
1579 * task_cgroup_path - cgroup path of a task in the first cgroup hierarchy
1580 * @task: target task
1581 * @buf: the buffer to write the path into
1582 * @buflen: the length of the buffer
1584 * Determine @task's cgroup on the first (the one with the lowest non-zero
1585 * hierarchy_id) cgroup hierarchy and copy its path into @buf. This
1586 * function grabs cgroup_mutex and shouldn't be used inside locks used by
1587 * cgroup controller callbacks.
1589 * Return value is the same as kernfs_path().
1591 char *task_cgroup_path(struct task_struct *task, char *buf, size_t buflen)
1593 struct cgroupfs_root *root;
1594 struct cgroup *cgrp;
1595 int hierarchy_id = 1;
1598 mutex_lock(&cgroup_mutex);
1600 root = idr_get_next(&cgroup_hierarchy_idr, &hierarchy_id);
1603 cgrp = task_cgroup_from_root(task, root);
1604 path = cgroup_path(cgrp, buf, buflen);
1606 /* if no hierarchy exists, everyone is in "/" */
1607 if (strlcpy(buf, "/", buflen) < buflen)
1611 mutex_unlock(&cgroup_mutex);
1614 EXPORT_SYMBOL_GPL(task_cgroup_path);
1617 * Control Group taskset
1619 struct task_and_cgroup {
1620 struct task_struct *task;
1621 struct cgroup *cgrp;
1622 struct css_set *cset;
1625 struct cgroup_taskset {
1626 struct task_and_cgroup single;
1627 struct flex_array *tc_array;
1630 struct cgroup *cur_cgrp;
1634 * cgroup_taskset_first - reset taskset and return the first task
1635 * @tset: taskset of interest
1637 * @tset iteration is initialized and the first task is returned.
1639 struct task_struct *cgroup_taskset_first(struct cgroup_taskset *tset)
1641 if (tset->tc_array) {
1643 return cgroup_taskset_next(tset);
1645 tset->cur_cgrp = tset->single.cgrp;
1646 return tset->single.task;
1649 EXPORT_SYMBOL_GPL(cgroup_taskset_first);
1652 * cgroup_taskset_next - iterate to the next task in taskset
1653 * @tset: taskset of interest
1655 * Return the next task in @tset. Iteration must have been initialized
1656 * with cgroup_taskset_first().
1658 struct task_struct *cgroup_taskset_next(struct cgroup_taskset *tset)
1660 struct task_and_cgroup *tc;
1662 if (!tset->tc_array || tset->idx >= tset->tc_array_len)
1665 tc = flex_array_get(tset->tc_array, tset->idx++);
1666 tset->cur_cgrp = tc->cgrp;
1669 EXPORT_SYMBOL_GPL(cgroup_taskset_next);
1672 * cgroup_taskset_cur_css - return the matching css for the current task
1673 * @tset: taskset of interest
1674 * @subsys_id: the ID of the target subsystem
1676 * Return the css for the current (last returned) task of @tset for
1677 * subsystem specified by @subsys_id. This function must be preceded by
1678 * either cgroup_taskset_first() or cgroup_taskset_next().
1680 struct cgroup_subsys_state *cgroup_taskset_cur_css(struct cgroup_taskset *tset,
1683 return cgroup_css(tset->cur_cgrp, cgroup_subsys[subsys_id]);
1685 EXPORT_SYMBOL_GPL(cgroup_taskset_cur_css);
1688 * cgroup_taskset_size - return the number of tasks in taskset
1689 * @tset: taskset of interest
1691 int cgroup_taskset_size(struct cgroup_taskset *tset)
1693 return tset->tc_array ? tset->tc_array_len : 1;
1695 EXPORT_SYMBOL_GPL(cgroup_taskset_size);
1699 * cgroup_task_migrate - move a task from one cgroup to another.
1701 * Must be called with cgroup_mutex and threadgroup locked.
1703 static void cgroup_task_migrate(struct cgroup *old_cgrp,
1704 struct task_struct *tsk,
1705 struct css_set *new_cset)
1707 struct css_set *old_cset;
1710 * We are synchronized through threadgroup_lock() against PF_EXITING
1711 * setting such that we can't race against cgroup_exit() changing the
1712 * css_set to init_css_set and dropping the old one.
1714 WARN_ON_ONCE(tsk->flags & PF_EXITING);
1715 old_cset = task_css_set(tsk);
1718 rcu_assign_pointer(tsk->cgroups, new_cset);
1721 /* Update the css_set linked lists if we're using them */
1722 write_lock(&css_set_lock);
1723 if (!list_empty(&tsk->cg_list))
1724 list_move(&tsk->cg_list, &new_cset->tasks);
1725 write_unlock(&css_set_lock);
1728 * We just gained a reference on old_cset by taking it from the
1729 * task. As trading it for new_cset is protected by cgroup_mutex,
1730 * we're safe to drop it here; it will be freed under RCU.
1732 set_bit(CGRP_RELEASABLE, &old_cgrp->flags);
1733 put_css_set(old_cset);
1737 * cgroup_attach_task - attach a task or a whole threadgroup to a cgroup
1738 * @cgrp: the cgroup to attach to
1739 * @tsk: the task or the leader of the threadgroup to be attached
1740 * @threadgroup: attach the whole threadgroup?
1742 * Call holding cgroup_mutex and the group_rwsem of the leader. Will take
1743 * task_lock of @tsk or each thread in the threadgroup individually in turn.
1745 static int cgroup_attach_task(struct cgroup *cgrp, struct task_struct *tsk,
1748 int retval, i, group_size;
1749 struct cgroupfs_root *root = cgrp->root;
1750 struct cgroup_subsys_state *css, *failed_css = NULL;
1751 /* threadgroup list cursor and array */
1752 struct task_struct *leader = tsk;
1753 struct task_and_cgroup *tc;
1754 struct flex_array *group;
1755 struct cgroup_taskset tset = { };
1758 * step 0: in order to do expensive, possibly blocking operations for
1759 * every thread, we cannot iterate the thread group list, since it needs
1760 * rcu or tasklist locked. instead, build an array of all threads in the
1761 * group - group_rwsem prevents new threads from appearing, and if
1762 * threads exit, this will just be an over-estimate.
1765 group_size = get_nr_threads(tsk);
1768 /* flex_array supports very large thread-groups better than kmalloc. */
1769 group = flex_array_alloc(sizeof(*tc), group_size, GFP_KERNEL);
1772 /* pre-allocate to guarantee space while iterating in rcu read-side. */
1773 retval = flex_array_prealloc(group, 0, group_size, GFP_KERNEL);
1775 goto out_free_group_list;
1779 * Prevent freeing of tasks while we take a snapshot. Tasks that are
1780 * already PF_EXITING could be freed from underneath us unless we
1781 * take an rcu_read_lock.
1785 struct task_and_cgroup ent;
1787 /* @tsk either already exited or can't exit until the end */
1788 if (tsk->flags & PF_EXITING)
1791 /* as per above, nr_threads may decrease, but not increase. */
1792 BUG_ON(i >= group_size);
1794 ent.cgrp = task_cgroup_from_root(tsk, root);
1795 /* nothing to do if this task is already in the cgroup */
1796 if (ent.cgrp == cgrp)
1799 * saying GFP_ATOMIC has no effect here because we did prealloc
1800 * earlier, but it's good form to communicate our expectations.
1802 retval = flex_array_put(group, i, &ent, GFP_ATOMIC);
1803 BUG_ON(retval != 0);
1808 } while_each_thread(leader, tsk);
1810 /* remember the number of threads in the array for later. */
1812 tset.tc_array = group;
1813 tset.tc_array_len = group_size;
1815 /* methods shouldn't be called if no task is actually migrating */
1818 goto out_free_group_list;
1821 * step 1: check that we can legitimately attach to the cgroup.
1823 for_each_css(css, i, cgrp) {
1824 if (css->ss->can_attach) {
1825 retval = css->ss->can_attach(css, &tset);
1828 goto out_cancel_attach;
1834 * step 2: make sure css_sets exist for all threads to be migrated.
1835 * we use find_css_set, which allocates a new one if necessary.
1837 for (i = 0; i < group_size; i++) {
1838 struct css_set *old_cset;
1840 tc = flex_array_get(group, i);
1841 old_cset = task_css_set(tc->task);
1842 tc->cset = find_css_set(old_cset, cgrp);
1845 goto out_put_css_set_refs;
1850 * step 3: now that we're guaranteed success wrt the css_sets,
1851 * proceed to move all tasks to the new cgroup. There are no
1852 * failure cases after here, so this is the commit point.
1854 for (i = 0; i < group_size; i++) {
1855 tc = flex_array_get(group, i);
1856 cgroup_task_migrate(tc->cgrp, tc->task, tc->cset);
1858 /* nothing is sensitive to fork() after this point. */
1861 * step 4: do subsystem attach callbacks.
1863 for_each_css(css, i, cgrp)
1864 if (css->ss->attach)
1865 css->ss->attach(css, &tset);
1868 * step 5: success! and cleanup
1871 out_put_css_set_refs:
1873 for (i = 0; i < group_size; i++) {
1874 tc = flex_array_get(group, i);
1877 put_css_set(tc->cset);
1882 for_each_css(css, i, cgrp) {
1883 if (css == failed_css)
1885 if (css->ss->cancel_attach)
1886 css->ss->cancel_attach(css, &tset);
1889 out_free_group_list:
1890 flex_array_free(group);
1895 * Find the task_struct of the task to attach by vpid and pass it along to the
1896 * function to attach either it or all tasks in its threadgroup. Will lock
1897 * cgroup_mutex and threadgroup; may take task_lock of task.
1899 static int attach_task_by_pid(struct cgroup *cgrp, u64 pid, bool threadgroup)
1901 struct task_struct *tsk;
1902 const struct cred *cred = current_cred(), *tcred;
1905 if (!cgroup_lock_live_group(cgrp))
1911 tsk = find_task_by_vpid(pid);
1915 goto out_unlock_cgroup;
1918 * even if we're attaching all tasks in the thread group, we
1919 * only need to check permissions on one of them.
1921 tcred = __task_cred(tsk);
1922 if (!uid_eq(cred->euid, GLOBAL_ROOT_UID) &&
1923 !uid_eq(cred->euid, tcred->uid) &&
1924 !uid_eq(cred->euid, tcred->suid)) {
1927 goto out_unlock_cgroup;
1933 tsk = tsk->group_leader;
1936 * Workqueue threads may acquire PF_NO_SETAFFINITY and become
1937 * trapped in a cpuset, or RT worker may be born in a cgroup
1938 * with no rt_runtime allocated. Just say no.
1940 if (tsk == kthreadd_task || (tsk->flags & PF_NO_SETAFFINITY)) {
1943 goto out_unlock_cgroup;
1946 get_task_struct(tsk);
1949 threadgroup_lock(tsk);
1951 if (!thread_group_leader(tsk)) {
1953 * a race with de_thread from another thread's exec()
1954 * may strip us of our leadership, if this happens,
1955 * there is no choice but to throw this task away and
1956 * try again; this is
1957 * "double-double-toil-and-trouble-check locking".
1959 threadgroup_unlock(tsk);
1960 put_task_struct(tsk);
1961 goto retry_find_task;
1965 ret = cgroup_attach_task(cgrp, tsk, threadgroup);
1967 threadgroup_unlock(tsk);
1969 put_task_struct(tsk);
1971 mutex_unlock(&cgroup_mutex);
1976 * cgroup_attach_task_all - attach task 'tsk' to all cgroups of task 'from'
1977 * @from: attach to all cgroups of a given task
1978 * @tsk: the task to be attached
1980 int cgroup_attach_task_all(struct task_struct *from, struct task_struct *tsk)
1982 struct cgroupfs_root *root;
1985 mutex_lock(&cgroup_mutex);
1986 for_each_active_root(root) {
1987 struct cgroup *from_cgrp = task_cgroup_from_root(from, root);
1989 retval = cgroup_attach_task(from_cgrp, tsk, false);
1993 mutex_unlock(&cgroup_mutex);
1997 EXPORT_SYMBOL_GPL(cgroup_attach_task_all);
1999 static int cgroup_tasks_write(struct cgroup_subsys_state *css,
2000 struct cftype *cft, u64 pid)
2002 return attach_task_by_pid(css->cgroup, pid, false);
2005 static int cgroup_procs_write(struct cgroup_subsys_state *css,
2006 struct cftype *cft, u64 tgid)
2008 return attach_task_by_pid(css->cgroup, tgid, true);
2011 static int cgroup_release_agent_write(struct cgroup_subsys_state *css,
2012 struct cftype *cft, const char *buffer)
2014 struct cgroupfs_root *root = css->cgroup->root;
2016 BUILD_BUG_ON(sizeof(root->release_agent_path) < PATH_MAX);
2017 if (!cgroup_lock_live_group(css->cgroup))
2019 spin_lock(&release_agent_path_lock);
2020 strlcpy(root->release_agent_path, buffer,
2021 sizeof(root->release_agent_path));
2022 spin_unlock(&release_agent_path_lock);
2023 mutex_unlock(&cgroup_mutex);
2027 static int cgroup_release_agent_show(struct seq_file *seq, void *v)
2029 struct cgroup *cgrp = seq_css(seq)->cgroup;
2031 if (!cgroup_lock_live_group(cgrp))
2033 seq_puts(seq, cgrp->root->release_agent_path);
2034 seq_putc(seq, '\n');
2035 mutex_unlock(&cgroup_mutex);
2039 static int cgroup_sane_behavior_show(struct seq_file *seq, void *v)
2041 struct cgroup *cgrp = seq_css(seq)->cgroup;
2043 seq_printf(seq, "%d\n", cgroup_sane_behavior(cgrp));
2047 static ssize_t cgroup_file_write(struct kernfs_open_file *of, char *buf,
2048 size_t nbytes, loff_t off)
2050 struct cgroup *cgrp = of->kn->parent->priv;
2051 struct cftype *cft = of->kn->priv;
2052 struct cgroup_subsys_state *css;
2056 * kernfs guarantees that a file isn't deleted with operations in
2057 * flight, which means that the matching css is and stays alive and
2058 * doesn't need to be pinned. The RCU locking is not necessary
2059 * either. It's just for the convenience of using cgroup_css().
2062 css = cgroup_css(cgrp, cft->ss);
2065 if (cft->write_string) {
2066 ret = cft->write_string(css, cft, strstrip(buf));
2067 } else if (cft->write_u64) {
2068 unsigned long long v;
2069 ret = kstrtoull(buf, 0, &v);
2071 ret = cft->write_u64(css, cft, v);
2072 } else if (cft->write_s64) {
2074 ret = kstrtoll(buf, 0, &v);
2076 ret = cft->write_s64(css, cft, v);
2077 } else if (cft->trigger) {
2078 ret = cft->trigger(css, (unsigned int)cft->private);
2083 return ret ?: nbytes;
2086 static void *cgroup_seqfile_start(struct seq_file *seq, loff_t *ppos)
2088 return seq_cft(seq)->seq_start(seq, ppos);
2091 static void *cgroup_seqfile_next(struct seq_file *seq, void *v, loff_t *ppos)
2093 return seq_cft(seq)->seq_next(seq, v, ppos);
2096 static void cgroup_seqfile_stop(struct seq_file *seq, void *v)
2098 seq_cft(seq)->seq_stop(seq, v);
2101 static int cgroup_seqfile_show(struct seq_file *m, void *arg)
2103 struct cftype *cft = seq_cft(m);
2104 struct cgroup_subsys_state *css = seq_css(m);
2107 return cft->seq_show(m, arg);
2110 seq_printf(m, "%llu\n", cft->read_u64(css, cft));
2111 else if (cft->read_s64)
2112 seq_printf(m, "%lld\n", cft->read_s64(css, cft));
2118 static struct kernfs_ops cgroup_kf_single_ops = {
2119 .atomic_write_len = PAGE_SIZE,
2120 .write = cgroup_file_write,
2121 .seq_show = cgroup_seqfile_show,
2124 static struct kernfs_ops cgroup_kf_ops = {
2125 .atomic_write_len = PAGE_SIZE,
2126 .write = cgroup_file_write,
2127 .seq_start = cgroup_seqfile_start,
2128 .seq_next = cgroup_seqfile_next,
2129 .seq_stop = cgroup_seqfile_stop,
2130 .seq_show = cgroup_seqfile_show,
2134 * cgroup_rename - Only allow simple rename of directories in place.
2136 static int cgroup_rename(struct kernfs_node *kn, struct kernfs_node *new_parent,
2137 const char *new_name_str)
2139 struct cgroup *cgrp = kn->priv;
2142 if (kernfs_type(kn) != KERNFS_DIR)
2144 if (kn->parent != new_parent)
2148 * This isn't a proper migration and its usefulness is very
2149 * limited. Disallow if sane_behavior.
2151 if (cgroup_sane_behavior(cgrp))
2154 mutex_lock(&cgroup_tree_mutex);
2155 mutex_lock(&cgroup_mutex);
2157 ret = kernfs_rename(kn, new_parent, new_name_str);
2159 mutex_unlock(&cgroup_mutex);
2160 mutex_unlock(&cgroup_tree_mutex);
2164 static int cgroup_add_file(struct cgroup *cgrp, struct cftype *cft)
2166 char name[CGROUP_FILE_NAME_MAX];
2167 struct kernfs_node *kn;
2168 struct lock_class_key *key = NULL;
2170 #ifdef CONFIG_DEBUG_LOCK_ALLOC
2171 key = &cft->lockdep_key;
2173 kn = __kernfs_create_file(cgrp->kn, cgroup_file_name(cgrp, cft, name),
2174 cgroup_file_mode(cft), 0, cft->kf_ops, cft,
2182 * cgroup_addrm_files - add or remove files to a cgroup directory
2183 * @cgrp: the target cgroup
2184 * @cfts: array of cftypes to be added
2185 * @is_add: whether to add or remove
2187 * Depending on @is_add, add or remove files defined by @cfts on @cgrp.
2188 * For removals, this function never fails. If addition fails, this
2189 * function doesn't remove files already added. The caller is responsible
2192 static int cgroup_addrm_files(struct cgroup *cgrp, struct cftype cfts[],
2198 lockdep_assert_held(&cgroup_tree_mutex);
2200 for (cft = cfts; cft->name[0] != '\0'; cft++) {
2201 /* does cft->flags tell us to skip this file on @cgrp? */
2202 if ((cft->flags & CFTYPE_INSANE) && cgroup_sane_behavior(cgrp))
2204 if ((cft->flags & CFTYPE_NOT_ON_ROOT) && !cgrp->parent)
2206 if ((cft->flags & CFTYPE_ONLY_ON_ROOT) && cgrp->parent)
2210 ret = cgroup_add_file(cgrp, cft);
2212 pr_warn("cgroup_addrm_files: failed to add %s, err=%d\n",
2217 cgroup_rm_file(cgrp, cft);
2223 static int cgroup_apply_cftypes(struct cftype *cfts, bool is_add)
2226 struct cgroup_subsys *ss = cfts[0].ss;
2227 struct cgroup *root = &ss->root->top_cgroup;
2228 struct cgroup_subsys_state *css;
2231 lockdep_assert_held(&cgroup_tree_mutex);
2233 /* don't bother if @ss isn't attached */
2234 if (ss->root == &cgroup_dummy_root)
2237 /* add/rm files for all cgroups created before */
2238 css_for_each_descendant_pre(css, cgroup_css(root, ss)) {
2239 struct cgroup *cgrp = css->cgroup;
2241 if (cgroup_is_dead(cgrp))
2244 ret = cgroup_addrm_files(cgrp, cfts, is_add);
2250 kernfs_activate(root->kn);
2254 static void cgroup_exit_cftypes(struct cftype *cfts)
2258 for (cft = cfts; cft->name[0] != '\0'; cft++) {
2259 /* free copy for custom atomic_write_len, see init_cftypes() */
2260 if (cft->max_write_len && cft->max_write_len != PAGE_SIZE)
2267 static int cgroup_init_cftypes(struct cgroup_subsys *ss, struct cftype *cfts)
2271 for (cft = cfts; cft->name[0] != '\0'; cft++) {
2272 struct kernfs_ops *kf_ops;
2274 WARN_ON(cft->ss || cft->kf_ops);
2277 kf_ops = &cgroup_kf_ops;
2279 kf_ops = &cgroup_kf_single_ops;
2282 * Ugh... if @cft wants a custom max_write_len, we need to
2283 * make a copy of kf_ops to set its atomic_write_len.
2285 if (cft->max_write_len && cft->max_write_len != PAGE_SIZE) {
2286 kf_ops = kmemdup(kf_ops, sizeof(*kf_ops), GFP_KERNEL);
2288 cgroup_exit_cftypes(cfts);
2291 kf_ops->atomic_write_len = cft->max_write_len;
2294 cft->kf_ops = kf_ops;
2301 static int cgroup_rm_cftypes_locked(struct cftype *cfts)
2303 lockdep_assert_held(&cgroup_tree_mutex);
2305 if (!cfts || !cfts[0].ss)
2308 list_del(&cfts->node);
2309 cgroup_apply_cftypes(cfts, false);
2310 cgroup_exit_cftypes(cfts);
2315 * cgroup_rm_cftypes - remove an array of cftypes from a subsystem
2316 * @cfts: zero-length name terminated array of cftypes
2318 * Unregister @cfts. Files described by @cfts are removed from all
2319 * existing cgroups and all future cgroups won't have them either. This
2320 * function can be called anytime whether @cfts' subsys is attached or not.
2322 * Returns 0 on successful unregistration, -ENOENT if @cfts is not
2325 int cgroup_rm_cftypes(struct cftype *cfts)
2329 mutex_lock(&cgroup_tree_mutex);
2330 ret = cgroup_rm_cftypes_locked(cfts);
2331 mutex_unlock(&cgroup_tree_mutex);
2336 * cgroup_add_cftypes - add an array of cftypes to a subsystem
2337 * @ss: target cgroup subsystem
2338 * @cfts: zero-length name terminated array of cftypes
2340 * Register @cfts to @ss. Files described by @cfts are created for all
2341 * existing cgroups to which @ss is attached and all future cgroups will
2342 * have them too. This function can be called anytime whether @ss is
2345 * Returns 0 on successful registration, -errno on failure. Note that this
2346 * function currently returns 0 as long as @cfts registration is successful
2347 * even if some file creation attempts on existing cgroups fail.
2349 int cgroup_add_cftypes(struct cgroup_subsys *ss, struct cftype *cfts)
2353 ret = cgroup_init_cftypes(ss, cfts);
2357 mutex_lock(&cgroup_tree_mutex);
2359 list_add_tail(&cfts->node, &ss->cfts);
2360 ret = cgroup_apply_cftypes(cfts, true);
2362 cgroup_rm_cftypes_locked(cfts);
2364 mutex_unlock(&cgroup_tree_mutex);
2367 EXPORT_SYMBOL_GPL(cgroup_add_cftypes);
2370 * cgroup_task_count - count the number of tasks in a cgroup.
2371 * @cgrp: the cgroup in question
2373 * Return the number of tasks in the cgroup.
2375 int cgroup_task_count(const struct cgroup *cgrp)
2378 struct cgrp_cset_link *link;
2380 read_lock(&css_set_lock);
2381 list_for_each_entry(link, &cgrp->cset_links, cset_link)
2382 count += atomic_read(&link->cset->refcount);
2383 read_unlock(&css_set_lock);
2388 * To reduce the fork() overhead for systems that are not actually using
2389 * their cgroups capability, we don't maintain the lists running through
2390 * each css_set to its tasks until we see the list actually used - in other
2391 * words after the first call to css_task_iter_start().
2393 static void cgroup_enable_task_cg_lists(void)
2395 struct task_struct *p, *g;
2396 write_lock(&css_set_lock);
2397 use_task_css_set_links = 1;
2399 * We need tasklist_lock because RCU is not safe against
2400 * while_each_thread(). Besides, a forking task that has passed
2401 * cgroup_post_fork() without seeing use_task_css_set_links = 1
2402 * is not guaranteed to have its child immediately visible in the
2403 * tasklist if we walk through it with RCU.
2405 read_lock(&tasklist_lock);
2406 do_each_thread(g, p) {
2409 * We should check if the process is exiting, otherwise
2410 * it will race with cgroup_exit() in that the list
2411 * entry won't be deleted though the process has exited.
2413 if (!(p->flags & PF_EXITING) && list_empty(&p->cg_list))
2414 list_add(&p->cg_list, &task_css_set(p)->tasks);
2416 } while_each_thread(g, p);
2417 read_unlock(&tasklist_lock);
2418 write_unlock(&css_set_lock);
2422 * css_next_child - find the next child of a given css
2423 * @pos_css: the current position (%NULL to initiate traversal)
2424 * @parent_css: css whose children to walk
2426 * This function returns the next child of @parent_css and should be called
2427 * under either cgroup_mutex or RCU read lock. The only requirement is
2428 * that @parent_css and @pos_css are accessible. The next sibling is
2429 * guaranteed to be returned regardless of their states.
2431 struct cgroup_subsys_state *
2432 css_next_child(struct cgroup_subsys_state *pos_css,
2433 struct cgroup_subsys_state *parent_css)
2435 struct cgroup *pos = pos_css ? pos_css->cgroup : NULL;
2436 struct cgroup *cgrp = parent_css->cgroup;
2437 struct cgroup *next;
2439 cgroup_assert_mutexes_or_rcu_locked();
2442 * @pos could already have been removed. Once a cgroup is removed,
2443 * its ->sibling.next is no longer updated when its next sibling
2444 * changes. As CGRP_DEAD assertion is serialized and happens
2445 * before the cgroup is taken off the ->sibling list, if we see it
2446 * unasserted, it's guaranteed that the next sibling hasn't
2447 * finished its grace period even if it's already removed, and thus
2448 * safe to dereference from this RCU critical section. If
2449 * ->sibling.next is inaccessible, cgroup_is_dead() is guaranteed
2450 * to be visible as %true here.
2452 * If @pos is dead, its next pointer can't be dereferenced;
2453 * however, as each cgroup is given a monotonically increasing
2454 * unique serial number and always appended to the sibling list,
2455 * the next one can be found by walking the parent's children until
2456 * we see a cgroup with higher serial number than @pos's. While
2457 * this path can be slower, it's taken only when either the current
2458 * cgroup is removed or iteration and removal race.
2461 next = list_entry_rcu(cgrp->children.next, struct cgroup, sibling);
2462 } else if (likely(!cgroup_is_dead(pos))) {
2463 next = list_entry_rcu(pos->sibling.next, struct cgroup, sibling);
2465 list_for_each_entry_rcu(next, &cgrp->children, sibling)
2466 if (next->serial_nr > pos->serial_nr)
2470 if (&next->sibling == &cgrp->children)
2473 return cgroup_css(next, parent_css->ss);
2475 EXPORT_SYMBOL_GPL(css_next_child);
2478 * css_next_descendant_pre - find the next descendant for pre-order walk
2479 * @pos: the current position (%NULL to initiate traversal)
2480 * @root: css whose descendants to walk
2482 * To be used by css_for_each_descendant_pre(). Find the next descendant
2483 * to visit for pre-order traversal of @root's descendants. @root is
2484 * included in the iteration and the first node to be visited.
2486 * While this function requires cgroup_mutex or RCU read locking, it
2487 * doesn't require the whole traversal to be contained in a single critical
2488 * section. This function will return the correct next descendant as long
2489 * as both @pos and @root are accessible and @pos is a descendant of @root.
2491 struct cgroup_subsys_state *
2492 css_next_descendant_pre(struct cgroup_subsys_state *pos,
2493 struct cgroup_subsys_state *root)
2495 struct cgroup_subsys_state *next;
2497 cgroup_assert_mutexes_or_rcu_locked();
2499 /* if first iteration, visit @root */
2503 /* visit the first child if exists */
2504 next = css_next_child(NULL, pos);
2508 /* no child, visit my or the closest ancestor's next sibling */
2509 while (pos != root) {
2510 next = css_next_child(pos, css_parent(pos));
2513 pos = css_parent(pos);
2518 EXPORT_SYMBOL_GPL(css_next_descendant_pre);
2521 * css_rightmost_descendant - return the rightmost descendant of a css
2522 * @pos: css of interest
2524 * Return the rightmost descendant of @pos. If there's no descendant, @pos
2525 * is returned. This can be used during pre-order traversal to skip
2528 * While this function requires cgroup_mutex or RCU read locking, it
2529 * doesn't require the whole traversal to be contained in a single critical
2530 * section. This function will return the correct rightmost descendant as
2531 * long as @pos is accessible.
2533 struct cgroup_subsys_state *
2534 css_rightmost_descendant(struct cgroup_subsys_state *pos)
2536 struct cgroup_subsys_state *last, *tmp;
2538 cgroup_assert_mutexes_or_rcu_locked();
2542 /* ->prev isn't RCU safe, walk ->next till the end */
2544 css_for_each_child(tmp, last)
2550 EXPORT_SYMBOL_GPL(css_rightmost_descendant);
2552 static struct cgroup_subsys_state *
2553 css_leftmost_descendant(struct cgroup_subsys_state *pos)
2555 struct cgroup_subsys_state *last;
2559 pos = css_next_child(NULL, pos);
2566 * css_next_descendant_post - find the next descendant for post-order walk
2567 * @pos: the current position (%NULL to initiate traversal)
2568 * @root: css whose descendants to walk
2570 * To be used by css_for_each_descendant_post(). Find the next descendant
2571 * to visit for post-order traversal of @root's descendants. @root is
2572 * included in the iteration and the last node to be visited.
2574 * While this function requires cgroup_mutex or RCU read locking, it
2575 * doesn't require the whole traversal to be contained in a single critical
2576 * section. This function will return the correct next descendant as long
2577 * as both @pos and @cgroup are accessible and @pos is a descendant of
2580 struct cgroup_subsys_state *
2581 css_next_descendant_post(struct cgroup_subsys_state *pos,
2582 struct cgroup_subsys_state *root)
2584 struct cgroup_subsys_state *next;
2586 cgroup_assert_mutexes_or_rcu_locked();
2588 /* if first iteration, visit leftmost descendant which may be @root */
2590 return css_leftmost_descendant(root);
2592 /* if we visited @root, we're done */
2596 /* if there's an unvisited sibling, visit its leftmost descendant */
2597 next = css_next_child(pos, css_parent(pos));
2599 return css_leftmost_descendant(next);
2601 /* no sibling left, visit parent */
2602 return css_parent(pos);
2604 EXPORT_SYMBOL_GPL(css_next_descendant_post);
2607 * css_advance_task_iter - advance a task itererator to the next css_set
2608 * @it: the iterator to advance
2610 * Advance @it to the next css_set to walk.
2612 static void css_advance_task_iter(struct css_task_iter *it)
2614 struct list_head *l = it->cset_link;
2615 struct cgrp_cset_link *link;
2616 struct css_set *cset;
2618 /* Advance to the next non-empty css_set */
2621 if (l == &it->origin_css->cgroup->cset_links) {
2622 it->cset_link = NULL;
2625 link = list_entry(l, struct cgrp_cset_link, cset_link);
2627 } while (list_empty(&cset->tasks));
2629 it->task = cset->tasks.next;
2633 * css_task_iter_start - initiate task iteration
2634 * @css: the css to walk tasks of
2635 * @it: the task iterator to use
2637 * Initiate iteration through the tasks of @css. The caller can call
2638 * css_task_iter_next() to walk through the tasks until the function
2639 * returns NULL. On completion of iteration, css_task_iter_end() must be
2642 * Note that this function acquires a lock which is released when the
2643 * iteration finishes. The caller can't sleep while iteration is in
2646 void css_task_iter_start(struct cgroup_subsys_state *css,
2647 struct css_task_iter *it)
2648 __acquires(css_set_lock)
2651 * The first time anyone tries to iterate across a css, we need to
2652 * enable the list linking each css_set to its tasks, and fix up
2653 * all existing tasks.
2655 if (!use_task_css_set_links)
2656 cgroup_enable_task_cg_lists();
2658 read_lock(&css_set_lock);
2660 it->origin_css = css;
2661 it->cset_link = &css->cgroup->cset_links;
2663 css_advance_task_iter(it);
2667 * css_task_iter_next - return the next task for the iterator
2668 * @it: the task iterator being iterated
2670 * The "next" function for task iteration. @it should have been
2671 * initialized via css_task_iter_start(). Returns NULL when the iteration
2674 struct task_struct *css_task_iter_next(struct css_task_iter *it)
2676 struct task_struct *res;
2677 struct list_head *l = it->task;
2678 struct cgrp_cset_link *link;
2680 /* If the iterator cg is NULL, we have no tasks */
2683 res = list_entry(l, struct task_struct, cg_list);
2684 /* Advance iterator to find next entry */
2686 link = list_entry(it->cset_link, struct cgrp_cset_link, cset_link);
2687 if (l == &link->cset->tasks) {
2689 * We reached the end of this task list - move on to the
2690 * next cgrp_cset_link.
2692 css_advance_task_iter(it);
2700 * css_task_iter_end - finish task iteration
2701 * @it: the task iterator to finish
2703 * Finish task iteration started by css_task_iter_start().
2705 void css_task_iter_end(struct css_task_iter *it)
2706 __releases(css_set_lock)
2708 read_unlock(&css_set_lock);
2711 static inline int started_after_time(struct task_struct *t1,
2712 struct timespec *time,
2713 struct task_struct *t2)
2715 int start_diff = timespec_compare(&t1->start_time, time);
2716 if (start_diff > 0) {
2718 } else if (start_diff < 0) {
2722 * Arbitrarily, if two processes started at the same
2723 * time, we'll say that the lower pointer value
2724 * started first. Note that t2 may have exited by now
2725 * so this may not be a valid pointer any longer, but
2726 * that's fine - it still serves to distinguish
2727 * between two tasks started (effectively) simultaneously.
2734 * This function is a callback from heap_insert() and is used to order
2736 * In this case we order the heap in descending task start time.
2738 static inline int started_after(void *p1, void *p2)
2740 struct task_struct *t1 = p1;
2741 struct task_struct *t2 = p2;
2742 return started_after_time(t1, &t2->start_time, t2);
2746 * css_scan_tasks - iterate though all the tasks in a css
2747 * @css: the css to iterate tasks of
2748 * @test: optional test callback
2749 * @process: process callback
2750 * @data: data passed to @test and @process
2751 * @heap: optional pre-allocated heap used for task iteration
2753 * Iterate through all the tasks in @css, calling @test for each, and if it
2754 * returns %true, call @process for it also.
2756 * @test may be NULL, meaning always true (select all tasks), which
2757 * effectively duplicates css_task_iter_{start,next,end}() but does not
2758 * lock css_set_lock for the call to @process.
2760 * It is guaranteed that @process will act on every task that is a member
2761 * of @css for the duration of this call. This function may or may not
2762 * call @process for tasks that exit or move to a different css during the
2763 * call, or are forked or move into the css during the call.
2765 * Note that @test may be called with locks held, and may in some
2766 * situations be called multiple times for the same task, so it should be
2769 * If @heap is non-NULL, a heap has been pre-allocated and will be used for
2770 * heap operations (and its "gt" member will be overwritten), else a
2771 * temporary heap will be used (allocation of which may cause this function
2774 int css_scan_tasks(struct cgroup_subsys_state *css,
2775 bool (*test)(struct task_struct *, void *),
2776 void (*process)(struct task_struct *, void *),
2777 void *data, struct ptr_heap *heap)
2780 struct css_task_iter it;
2781 struct task_struct *p, *dropped;
2782 /* Never dereference latest_task, since it's not refcounted */
2783 struct task_struct *latest_task = NULL;
2784 struct ptr_heap tmp_heap;
2785 struct timespec latest_time = { 0, 0 };
2788 /* The caller supplied our heap and pre-allocated its memory */
2789 heap->gt = &started_after;
2791 /* We need to allocate our own heap memory */
2793 retval = heap_init(heap, PAGE_SIZE, GFP_KERNEL, &started_after);
2795 /* cannot allocate the heap */
2801 * Scan tasks in the css, using the @test callback to determine
2802 * which are of interest, and invoking @process callback on the
2803 * ones which need an update. Since we don't want to hold any
2804 * locks during the task updates, gather tasks to be processed in a
2805 * heap structure. The heap is sorted by descending task start
2806 * time. If the statically-sized heap fills up, we overflow tasks
2807 * that started later, and in future iterations only consider tasks
2808 * that started after the latest task in the previous pass. This
2809 * guarantees forward progress and that we don't miss any tasks.
2812 css_task_iter_start(css, &it);
2813 while ((p = css_task_iter_next(&it))) {
2815 * Only affect tasks that qualify per the caller's callback,
2816 * if he provided one
2818 if (test && !test(p, data))
2821 * Only process tasks that started after the last task
2824 if (!started_after_time(p, &latest_time, latest_task))
2826 dropped = heap_insert(heap, p);
2827 if (dropped == NULL) {
2829 * The new task was inserted; the heap wasn't
2833 } else if (dropped != p) {
2835 * The new task was inserted, and pushed out a
2839 put_task_struct(dropped);
2842 * Else the new task was newer than anything already in
2843 * the heap and wasn't inserted
2846 css_task_iter_end(&it);
2849 for (i = 0; i < heap->size; i++) {
2850 struct task_struct *q = heap->ptrs[i];
2852 latest_time = q->start_time;
2855 /* Process the task per the caller's callback */
2860 * If we had to process any tasks at all, scan again
2861 * in case some of them were in the middle of forking
2862 * children that didn't get processed.
2863 * Not the most efficient way to do it, but it avoids
2864 * having to take callback_mutex in the fork path
2868 if (heap == &tmp_heap)
2869 heap_free(&tmp_heap);
2873 static void cgroup_transfer_one_task(struct task_struct *task, void *data)
2875 struct cgroup *new_cgroup = data;
2877 mutex_lock(&cgroup_mutex);
2878 cgroup_attach_task(new_cgroup, task, false);
2879 mutex_unlock(&cgroup_mutex);
2883 * cgroup_trasnsfer_tasks - move tasks from one cgroup to another
2884 * @to: cgroup to which the tasks will be moved
2885 * @from: cgroup in which the tasks currently reside
2887 int cgroup_transfer_tasks(struct cgroup *to, struct cgroup *from)
2889 return css_scan_tasks(&from->dummy_css, NULL, cgroup_transfer_one_task,
2894 * Stuff for reading the 'tasks'/'procs' files.
2896 * Reading this file can return large amounts of data if a cgroup has
2897 * *lots* of attached tasks. So it may need several calls to read(),
2898 * but we cannot guarantee that the information we produce is correct
2899 * unless we produce it entirely atomically.
2903 /* which pidlist file are we talking about? */
2904 enum cgroup_filetype {
2910 * A pidlist is a list of pids that virtually represents the contents of one
2911 * of the cgroup files ("procs" or "tasks"). We keep a list of such pidlists,
2912 * a pair (one each for procs, tasks) for each pid namespace that's relevant
2915 struct cgroup_pidlist {
2917 * used to find which pidlist is wanted. doesn't change as long as
2918 * this particular list stays in the list.
2920 struct { enum cgroup_filetype type; struct pid_namespace *ns; } key;
2923 /* how many elements the above list has */
2925 /* each of these stored in a list by its cgroup */
2926 struct list_head links;
2927 /* pointer to the cgroup we belong to, for list removal purposes */
2928 struct cgroup *owner;
2929 /* for delayed destruction */
2930 struct delayed_work destroy_dwork;
2934 * The following two functions "fix" the issue where there are more pids
2935 * than kmalloc will give memory for; in such cases, we use vmalloc/vfree.
2936 * TODO: replace with a kernel-wide solution to this problem
2938 #define PIDLIST_TOO_LARGE(c) ((c) * sizeof(pid_t) > (PAGE_SIZE * 2))
2939 static void *pidlist_allocate(int count)
2941 if (PIDLIST_TOO_LARGE(count))
2942 return vmalloc(count * sizeof(pid_t));
2944 return kmalloc(count * sizeof(pid_t), GFP_KERNEL);
2947 static void pidlist_free(void *p)
2949 if (is_vmalloc_addr(p))
2956 * Used to destroy all pidlists lingering waiting for destroy timer. None
2957 * should be left afterwards.
2959 static void cgroup_pidlist_destroy_all(struct cgroup *cgrp)
2961 struct cgroup_pidlist *l, *tmp_l;
2963 mutex_lock(&cgrp->pidlist_mutex);
2964 list_for_each_entry_safe(l, tmp_l, &cgrp->pidlists, links)
2965 mod_delayed_work(cgroup_pidlist_destroy_wq, &l->destroy_dwork, 0);
2966 mutex_unlock(&cgrp->pidlist_mutex);
2968 flush_workqueue(cgroup_pidlist_destroy_wq);
2969 BUG_ON(!list_empty(&cgrp->pidlists));
2972 static void cgroup_pidlist_destroy_work_fn(struct work_struct *work)
2974 struct delayed_work *dwork = to_delayed_work(work);
2975 struct cgroup_pidlist *l = container_of(dwork, struct cgroup_pidlist,
2977 struct cgroup_pidlist *tofree = NULL;
2979 mutex_lock(&l->owner->pidlist_mutex);
2982 * Destroy iff we didn't get queued again. The state won't change
2983 * as destroy_dwork can only be queued while locked.
2985 if (!delayed_work_pending(dwork)) {
2986 list_del(&l->links);
2987 pidlist_free(l->list);
2988 put_pid_ns(l->key.ns);
2992 mutex_unlock(&l->owner->pidlist_mutex);
2997 * pidlist_uniq - given a kmalloc()ed list, strip out all duplicate entries
2998 * Returns the number of unique elements.
3000 static int pidlist_uniq(pid_t *list, int length)
3005 * we presume the 0th element is unique, so i starts at 1. trivial
3006 * edge cases first; no work needs to be done for either
3008 if (length == 0 || length == 1)
3010 /* src and dest walk down the list; dest counts unique elements */
3011 for (src = 1; src < length; src++) {
3012 /* find next unique element */
3013 while (list[src] == list[src-1]) {
3018 /* dest always points to where the next unique element goes */
3019 list[dest] = list[src];
3027 * The two pid files - task and cgroup.procs - guaranteed that the result
3028 * is sorted, which forced this whole pidlist fiasco. As pid order is
3029 * different per namespace, each namespace needs differently sorted list,
3030 * making it impossible to use, for example, single rbtree of member tasks
3031 * sorted by task pointer. As pidlists can be fairly large, allocating one
3032 * per open file is dangerous, so cgroup had to implement shared pool of
3033 * pidlists keyed by cgroup and namespace.
3035 * All this extra complexity was caused by the original implementation
3036 * committing to an entirely unnecessary property. In the long term, we
3037 * want to do away with it. Explicitly scramble sort order if
3038 * sane_behavior so that no such expectation exists in the new interface.
3040 * Scrambling is done by swapping every two consecutive bits, which is
3041 * non-identity one-to-one mapping which disturbs sort order sufficiently.
3043 static pid_t pid_fry(pid_t pid)
3045 unsigned a = pid & 0x55555555;
3046 unsigned b = pid & 0xAAAAAAAA;
3048 return (a << 1) | (b >> 1);
3051 static pid_t cgroup_pid_fry(struct cgroup *cgrp, pid_t pid)
3053 if (cgroup_sane_behavior(cgrp))
3054 return pid_fry(pid);
3059 static int cmppid(const void *a, const void *b)
3061 return *(pid_t *)a - *(pid_t *)b;
3064 static int fried_cmppid(const void *a, const void *b)
3066 return pid_fry(*(pid_t *)a) - pid_fry(*(pid_t *)b);
3069 static struct cgroup_pidlist *cgroup_pidlist_find(struct cgroup *cgrp,
3070 enum cgroup_filetype type)
3072 struct cgroup_pidlist *l;
3073 /* don't need task_nsproxy() if we're looking at ourself */
3074 struct pid_namespace *ns = task_active_pid_ns(current);
3076 lockdep_assert_held(&cgrp->pidlist_mutex);
3078 list_for_each_entry(l, &cgrp->pidlists, links)
3079 if (l->key.type == type && l->key.ns == ns)
3085 * find the appropriate pidlist for our purpose (given procs vs tasks)
3086 * returns with the lock on that pidlist already held, and takes care
3087 * of the use count, or returns NULL with no locks held if we're out of
3090 static struct cgroup_pidlist *cgroup_pidlist_find_create(struct cgroup *cgrp,
3091 enum cgroup_filetype type)
3093 struct cgroup_pidlist *l;
3095 lockdep_assert_held(&cgrp->pidlist_mutex);
3097 l = cgroup_pidlist_find(cgrp, type);
3101 /* entry not found; create a new one */
3102 l = kzalloc(sizeof(struct cgroup_pidlist), GFP_KERNEL);
3106 INIT_DELAYED_WORK(&l->destroy_dwork, cgroup_pidlist_destroy_work_fn);
3108 /* don't need task_nsproxy() if we're looking at ourself */
3109 l->key.ns = get_pid_ns(task_active_pid_ns(current));
3111 list_add(&l->links, &cgrp->pidlists);
3116 * Load a cgroup's pidarray with either procs' tgids or tasks' pids
3118 static int pidlist_array_load(struct cgroup *cgrp, enum cgroup_filetype type,
3119 struct cgroup_pidlist **lp)
3123 int pid, n = 0; /* used for populating the array */
3124 struct css_task_iter it;
3125 struct task_struct *tsk;
3126 struct cgroup_pidlist *l;
3128 lockdep_assert_held(&cgrp->pidlist_mutex);
3131 * If cgroup gets more users after we read count, we won't have
3132 * enough space - tough. This race is indistinguishable to the
3133 * caller from the case that the additional cgroup users didn't
3134 * show up until sometime later on.
3136 length = cgroup_task_count(cgrp);
3137 array = pidlist_allocate(length);
3140 /* now, populate the array */
3141 css_task_iter_start(&cgrp->dummy_css, &it);
3142 while ((tsk = css_task_iter_next(&it))) {
3143 if (unlikely(n == length))
3145 /* get tgid or pid for procs or tasks file respectively */
3146 if (type == CGROUP_FILE_PROCS)
3147 pid = task_tgid_vnr(tsk);
3149 pid = task_pid_vnr(tsk);
3150 if (pid > 0) /* make sure to only use valid results */
3153 css_task_iter_end(&it);
3155 /* now sort & (if procs) strip out duplicates */
3156 if (cgroup_sane_behavior(cgrp))
3157 sort(array, length, sizeof(pid_t), fried_cmppid, NULL);
3159 sort(array, length, sizeof(pid_t), cmppid, NULL);
3160 if (type == CGROUP_FILE_PROCS)
3161 length = pidlist_uniq(array, length);
3163 l = cgroup_pidlist_find_create(cgrp, type);
3165 mutex_unlock(&cgrp->pidlist_mutex);
3166 pidlist_free(array);
3170 /* store array, freeing old if necessary */
3171 pidlist_free(l->list);
3179 * cgroupstats_build - build and fill cgroupstats
3180 * @stats: cgroupstats to fill information into
3181 * @dentry: A dentry entry belonging to the cgroup for which stats have
3184 * Build and fill cgroupstats so that taskstats can export it to user
3187 int cgroupstats_build(struct cgroupstats *stats, struct dentry *dentry)
3189 struct kernfs_node *kn = kernfs_node_from_dentry(dentry);
3190 struct cgroup *cgrp;
3191 struct css_task_iter it;
3192 struct task_struct *tsk;
3194 /* it should be kernfs_node belonging to cgroupfs and is a directory */
3195 if (dentry->d_sb->s_type != &cgroup_fs_type || !kn ||
3196 kernfs_type(kn) != KERNFS_DIR)
3200 * We aren't being called from kernfs and there's no guarantee on
3201 * @kn->priv's validity. For this and css_tryget_from_dir(),
3202 * @kn->priv is RCU safe. Let's do the RCU dancing.
3205 cgrp = rcu_dereference(kn->priv);
3211 css_task_iter_start(&cgrp->dummy_css, &it);
3212 while ((tsk = css_task_iter_next(&it))) {
3213 switch (tsk->state) {
3215 stats->nr_running++;
3217 case TASK_INTERRUPTIBLE:
3218 stats->nr_sleeping++;
3220 case TASK_UNINTERRUPTIBLE:
3221 stats->nr_uninterruptible++;
3224 stats->nr_stopped++;
3227 if (delayacct_is_task_waiting_on_io(tsk))
3228 stats->nr_io_wait++;
3232 css_task_iter_end(&it);
3240 * seq_file methods for the tasks/procs files. The seq_file position is the
3241 * next pid to display; the seq_file iterator is a pointer to the pid
3242 * in the cgroup->l->list array.
3245 static void *cgroup_pidlist_start(struct seq_file *s, loff_t *pos)
3248 * Initially we receive a position value that corresponds to
3249 * one more than the last pid shown (or 0 on the first call or
3250 * after a seek to the start). Use a binary-search to find the
3251 * next pid to display, if any
3253 struct kernfs_open_file *of = s->private;
3254 struct cgroup *cgrp = seq_css(s)->cgroup;
3255 struct cgroup_pidlist *l;
3256 enum cgroup_filetype type = seq_cft(s)->private;
3257 int index = 0, pid = *pos;
3260 mutex_lock(&cgrp->pidlist_mutex);
3263 * !NULL @of->priv indicates that this isn't the first start()
3264 * after open. If the matching pidlist is around, we can use that.
3265 * Look for it. Note that @of->priv can't be used directly. It
3266 * could already have been destroyed.
3269 of->priv = cgroup_pidlist_find(cgrp, type);
3272 * Either this is the first start() after open or the matching
3273 * pidlist has been destroyed inbetween. Create a new one.
3276 ret = pidlist_array_load(cgrp, type,
3277 (struct cgroup_pidlist **)&of->priv);
3279 return ERR_PTR(ret);
3284 int end = l->length;
3286 while (index < end) {
3287 int mid = (index + end) / 2;
3288 if (cgroup_pid_fry(cgrp, l->list[mid]) == pid) {
3291 } else if (cgroup_pid_fry(cgrp, l->list[mid]) <= pid)
3297 /* If we're off the end of the array, we're done */
3298 if (index >= l->length)
3300 /* Update the abstract position to be the actual pid that we found */
3301 iter = l->list + index;
3302 *pos = cgroup_pid_fry(cgrp, *iter);
3306 static void cgroup_pidlist_stop(struct seq_file *s, void *v)
3308 struct kernfs_open_file *of = s->private;
3309 struct cgroup_pidlist *l = of->priv;
3312 mod_delayed_work(cgroup_pidlist_destroy_wq, &l->destroy_dwork,
3313 CGROUP_PIDLIST_DESTROY_DELAY);
3314 mutex_unlock(&seq_css(s)->cgroup->pidlist_mutex);
3317 static void *cgroup_pidlist_next(struct seq_file *s, void *v, loff_t *pos)
3319 struct kernfs_open_file *of = s->private;
3320 struct cgroup_pidlist *l = of->priv;
3322 pid_t *end = l->list + l->length;
3324 * Advance to the next pid in the array. If this goes off the
3331 *pos = cgroup_pid_fry(seq_css(s)->cgroup, *p);
3336 static int cgroup_pidlist_show(struct seq_file *s, void *v)
3338 return seq_printf(s, "%d\n", *(int *)v);
3342 * seq_operations functions for iterating on pidlists through seq_file -
3343 * independent of whether it's tasks or procs
3345 static const struct seq_operations cgroup_pidlist_seq_operations = {
3346 .start = cgroup_pidlist_start,
3347 .stop = cgroup_pidlist_stop,
3348 .next = cgroup_pidlist_next,
3349 .show = cgroup_pidlist_show,
3352 static u64 cgroup_read_notify_on_release(struct cgroup_subsys_state *css,
3355 return notify_on_release(css->cgroup);
3358 static int cgroup_write_notify_on_release(struct cgroup_subsys_state *css,
3359 struct cftype *cft, u64 val)
3361 clear_bit(CGRP_RELEASABLE, &css->cgroup->flags);
3363 set_bit(CGRP_NOTIFY_ON_RELEASE, &css->cgroup->flags);
3365 clear_bit(CGRP_NOTIFY_ON_RELEASE, &css->cgroup->flags);
3369 static u64 cgroup_clone_children_read(struct cgroup_subsys_state *css,
3372 return test_bit(CGRP_CPUSET_CLONE_CHILDREN, &css->cgroup->flags);
3375 static int cgroup_clone_children_write(struct cgroup_subsys_state *css,
3376 struct cftype *cft, u64 val)
3379 set_bit(CGRP_CPUSET_CLONE_CHILDREN, &css->cgroup->flags);
3381 clear_bit(CGRP_CPUSET_CLONE_CHILDREN, &css->cgroup->flags);
3385 static struct cftype cgroup_base_files[] = {
3387 .name = "cgroup.procs",
3388 .seq_start = cgroup_pidlist_start,
3389 .seq_next = cgroup_pidlist_next,
3390 .seq_stop = cgroup_pidlist_stop,
3391 .seq_show = cgroup_pidlist_show,
3392 .private = CGROUP_FILE_PROCS,
3393 .write_u64 = cgroup_procs_write,
3394 .mode = S_IRUGO | S_IWUSR,
3397 .name = "cgroup.clone_children",
3398 .flags = CFTYPE_INSANE,
3399 .read_u64 = cgroup_clone_children_read,
3400 .write_u64 = cgroup_clone_children_write,
3403 .name = "cgroup.sane_behavior",
3404 .flags = CFTYPE_ONLY_ON_ROOT,
3405 .seq_show = cgroup_sane_behavior_show,
3409 * Historical crazy stuff. These don't have "cgroup." prefix and
3410 * don't exist if sane_behavior. If you're depending on these, be
3411 * prepared to be burned.
3415 .flags = CFTYPE_INSANE, /* use "procs" instead */
3416 .seq_start = cgroup_pidlist_start,
3417 .seq_next = cgroup_pidlist_next,
3418 .seq_stop = cgroup_pidlist_stop,
3419 .seq_show = cgroup_pidlist_show,
3420 .private = CGROUP_FILE_TASKS,
3421 .write_u64 = cgroup_tasks_write,
3422 .mode = S_IRUGO | S_IWUSR,
3425 .name = "notify_on_release",
3426 .flags = CFTYPE_INSANE,
3427 .read_u64 = cgroup_read_notify_on_release,
3428 .write_u64 = cgroup_write_notify_on_release,
3431 .name = "release_agent",
3432 .flags = CFTYPE_INSANE | CFTYPE_ONLY_ON_ROOT,
3433 .seq_show = cgroup_release_agent_show,
3434 .write_string = cgroup_release_agent_write,
3435 .max_write_len = PATH_MAX - 1,
3441 * cgroup_populate_dir - create subsys files in a cgroup directory
3442 * @cgrp: target cgroup
3443 * @subsys_mask: mask of the subsystem ids whose files should be added
3445 * On failure, no file is added.
3447 static int cgroup_populate_dir(struct cgroup *cgrp, unsigned long subsys_mask)
3449 struct cgroup_subsys *ss;
3452 /* process cftsets of each subsystem */
3453 for_each_subsys(ss, i) {
3454 struct cftype *cfts;
3456 if (!test_bit(i, &subsys_mask))
3459 list_for_each_entry(cfts, &ss->cfts, node) {
3460 ret = cgroup_addrm_files(cgrp, cfts, true);
3467 cgroup_clear_dir(cgrp, subsys_mask);
3472 * css destruction is four-stage process.
3474 * 1. Destruction starts. Killing of the percpu_ref is initiated.
3475 * Implemented in kill_css().
3477 * 2. When the percpu_ref is confirmed to be visible as killed on all CPUs
3478 * and thus css_tryget() is guaranteed to fail, the css can be offlined
3479 * by invoking offline_css(). After offlining, the base ref is put.
3480 * Implemented in css_killed_work_fn().
3482 * 3. When the percpu_ref reaches zero, the only possible remaining
3483 * accessors are inside RCU read sections. css_release() schedules the
3486 * 4. After the grace period, the css can be freed. Implemented in
3487 * css_free_work_fn().
3489 * It is actually hairier because both step 2 and 4 require process context
3490 * and thus involve punting to css->destroy_work adding two additional
3491 * steps to the already complex sequence.
3493 static void css_free_work_fn(struct work_struct *work)
3495 struct cgroup_subsys_state *css =
3496 container_of(work, struct cgroup_subsys_state, destroy_work);
3497 struct cgroup *cgrp = css->cgroup;
3500 css_put(css->parent);
3502 css->ss->css_free(css);
3506 static void css_free_rcu_fn(struct rcu_head *rcu_head)
3508 struct cgroup_subsys_state *css =
3509 container_of(rcu_head, struct cgroup_subsys_state, rcu_head);
3511 INIT_WORK(&css->destroy_work, css_free_work_fn);
3512 queue_work(cgroup_destroy_wq, &css->destroy_work);
3515 static void css_release(struct percpu_ref *ref)
3517 struct cgroup_subsys_state *css =
3518 container_of(ref, struct cgroup_subsys_state, refcnt);
3520 rcu_assign_pointer(css->cgroup->subsys[css->ss->id], NULL);
3521 call_rcu(&css->rcu_head, css_free_rcu_fn);
3524 static void init_css(struct cgroup_subsys_state *css, struct cgroup_subsys *ss,
3525 struct cgroup *cgrp)
3532 css->parent = cgroup_css(cgrp->parent, ss);
3534 css->flags |= CSS_ROOT;
3536 BUG_ON(cgroup_css(cgrp, ss));
3539 /* invoke ->css_online() on a new CSS and mark it online if successful */
3540 static int online_css(struct cgroup_subsys_state *css)
3542 struct cgroup_subsys *ss = css->ss;
3545 lockdep_assert_held(&cgroup_tree_mutex);
3546 lockdep_assert_held(&cgroup_mutex);
3549 ret = ss->css_online(css);
3551 css->flags |= CSS_ONLINE;
3552 css->cgroup->nr_css++;
3553 rcu_assign_pointer(css->cgroup->subsys[ss->id], css);
3558 /* if the CSS is online, invoke ->css_offline() on it and mark it offline */
3559 static void offline_css(struct cgroup_subsys_state *css)
3561 struct cgroup_subsys *ss = css->ss;
3563 lockdep_assert_held(&cgroup_tree_mutex);
3564 lockdep_assert_held(&cgroup_mutex);
3566 if (!(css->flags & CSS_ONLINE))
3569 if (ss->css_offline)
3570 ss->css_offline(css);
3572 css->flags &= ~CSS_ONLINE;
3573 css->cgroup->nr_css--;
3574 RCU_INIT_POINTER(css->cgroup->subsys[ss->id], css);
3578 * create_css - create a cgroup_subsys_state
3579 * @cgrp: the cgroup new css will be associated with
3580 * @ss: the subsys of new css
3582 * Create a new css associated with @cgrp - @ss pair. On success, the new
3583 * css is online and installed in @cgrp with all interface files created.
3584 * Returns 0 on success, -errno on failure.
3586 static int create_css(struct cgroup *cgrp, struct cgroup_subsys *ss)
3588 struct cgroup *parent = cgrp->parent;
3589 struct cgroup_subsys_state *css;
3592 lockdep_assert_held(&cgroup_mutex);
3594 css = ss->css_alloc(cgroup_css(parent, ss));
3596 return PTR_ERR(css);
3598 err = percpu_ref_init(&css->refcnt, css_release);
3602 init_css(css, ss, cgrp);
3604 err = cgroup_populate_dir(cgrp, 1 << ss->id);
3608 err = online_css(css);
3613 css_get(css->parent);
3615 if (ss->broken_hierarchy && !ss->warned_broken_hierarchy &&
3617 pr_warning("cgroup: %s (%d) created nested cgroup for controller \"%s\" which has incomplete hierarchy support. Nested cgroups may change behavior in the future.\n",
3618 current->comm, current->pid, ss->name);
3619 if (!strcmp(ss->name, "memory"))
3620 pr_warning("cgroup: \"memory\" requires setting use_hierarchy to 1 on the root.\n");
3621 ss->warned_broken_hierarchy = true;
3627 percpu_ref_cancel_init(&css->refcnt);
3633 * cgroup_create - create a cgroup
3634 * @parent: cgroup that will be parent of the new cgroup
3635 * @name: name of the new cgroup
3636 * @mode: mode to set on new cgroup
3638 static long cgroup_create(struct cgroup *parent, const char *name,
3641 struct cgroup *cgrp;
3642 struct cgroupfs_root *root = parent->root;
3644 struct cgroup_subsys *ss;
3645 struct kernfs_node *kn;
3647 /* allocate the cgroup and its ID, 0 is reserved for the root */
3648 cgrp = kzalloc(sizeof(*cgrp), GFP_KERNEL);
3652 mutex_lock(&cgroup_tree_mutex);
3655 * Only live parents can have children. Note that the liveliness
3656 * check isn't strictly necessary because cgroup_mkdir() and
3657 * cgroup_rmdir() are fully synchronized by i_mutex; however, do it
3658 * anyway so that locking is contained inside cgroup proper and we
3659 * don't get nasty surprises if we ever grow another caller.
3661 if (!cgroup_lock_live_group(parent)) {
3663 goto err_unlock_tree;
3667 * Temporarily set the pointer to NULL, so idr_find() won't return
3668 * a half-baked cgroup.
3670 cgrp->id = idr_alloc(&root->cgroup_idr, NULL, 1, 0, GFP_KERNEL);
3676 init_cgroup_housekeeping(cgrp);
3678 cgrp->parent = parent;
3679 cgrp->dummy_css.parent = &parent->dummy_css;
3680 cgrp->root = parent->root;
3682 if (notify_on_release(parent))
3683 set_bit(CGRP_NOTIFY_ON_RELEASE, &cgrp->flags);
3685 if (test_bit(CGRP_CPUSET_CLONE_CHILDREN, &parent->flags))
3686 set_bit(CGRP_CPUSET_CLONE_CHILDREN, &cgrp->flags);
3688 /* create the directory */
3689 kn = kernfs_create_dir(parent->kn, name, mode, cgrp);
3697 * This extra ref will be put in cgroup_free_fn() and guarantees
3698 * that @cgrp->kn is always accessible.
3702 cgrp->serial_nr = cgroup_serial_nr_next++;
3704 /* allocation complete, commit to creation */
3705 list_add_tail_rcu(&cgrp->sibling, &cgrp->parent->children);
3706 atomic_inc(&root->nr_cgrps);
3710 * @cgrp is now fully operational. If something fails after this
3711 * point, it'll be released via the normal destruction path.
3713 idr_replace(&root->cgroup_idr, cgrp, cgrp->id);
3715 err = cgroup_addrm_files(cgrp, cgroup_base_files, true);
3719 /* let's create and online css's */
3720 for_each_subsys(ss, ssid) {
3721 if (root->subsys_mask & (1 << ssid)) {
3722 err = create_css(cgrp, ss);
3728 kernfs_activate(kn);
3730 mutex_unlock(&cgroup_mutex);
3731 mutex_unlock(&cgroup_tree_mutex);
3736 idr_remove(&root->cgroup_idr, cgrp->id);
3738 mutex_unlock(&cgroup_mutex);
3740 mutex_unlock(&cgroup_tree_mutex);
3745 cgroup_destroy_locked(cgrp);
3746 mutex_unlock(&cgroup_mutex);
3747 mutex_unlock(&cgroup_tree_mutex);
3751 static int cgroup_mkdir(struct kernfs_node *parent_kn, const char *name,
3754 struct cgroup *parent = parent_kn->priv;
3756 return cgroup_create(parent, name, mode);
3760 * This is called when the refcnt of a css is confirmed to be killed.
3761 * css_tryget() is now guaranteed to fail.
3763 static void css_killed_work_fn(struct work_struct *work)
3765 struct cgroup_subsys_state *css =
3766 container_of(work, struct cgroup_subsys_state, destroy_work);
3767 struct cgroup *cgrp = css->cgroup;
3769 mutex_lock(&cgroup_tree_mutex);
3770 mutex_lock(&cgroup_mutex);
3773 * css_tryget() is guaranteed to fail now. Tell subsystems to
3774 * initate destruction.
3779 * If @cgrp is marked dead, it's waiting for refs of all css's to
3780 * be disabled before proceeding to the second phase of cgroup
3781 * destruction. If we are the last one, kick it off.
3783 if (!cgrp->nr_css && cgroup_is_dead(cgrp))
3784 cgroup_destroy_css_killed(cgrp);
3786 mutex_unlock(&cgroup_mutex);
3787 mutex_unlock(&cgroup_tree_mutex);
3790 * Put the css refs from kill_css(). Each css holds an extra
3791 * reference to the cgroup's dentry and cgroup removal proceeds
3792 * regardless of css refs. On the last put of each css, whenever
3793 * that may be, the extra dentry ref is put so that dentry
3794 * destruction happens only after all css's are released.
3799 /* css kill confirmation processing requires process context, bounce */
3800 static void css_killed_ref_fn(struct percpu_ref *ref)
3802 struct cgroup_subsys_state *css =
3803 container_of(ref, struct cgroup_subsys_state, refcnt);
3805 INIT_WORK(&css->destroy_work, css_killed_work_fn);
3806 queue_work(cgroup_destroy_wq, &css->destroy_work);
3810 * kill_css - destroy a css
3811 * @css: css to destroy
3813 * This function initiates destruction of @css by removing cgroup interface
3814 * files and putting its base reference. ->css_offline() will be invoked
3815 * asynchronously once css_tryget() is guaranteed to fail and when the
3816 * reference count reaches zero, @css will be released.
3818 static void kill_css(struct cgroup_subsys_state *css)
3821 * This must happen before css is disassociated with its cgroup.
3822 * See seq_css() for details.
3824 cgroup_clear_dir(css->cgroup, 1 << css->ss->id);
3827 * Killing would put the base ref, but we need to keep it alive
3828 * until after ->css_offline().
3833 * cgroup core guarantees that, by the time ->css_offline() is
3834 * invoked, no new css reference will be given out via
3835 * css_tryget(). We can't simply call percpu_ref_kill() and
3836 * proceed to offlining css's because percpu_ref_kill() doesn't
3837 * guarantee that the ref is seen as killed on all CPUs on return.
3839 * Use percpu_ref_kill_and_confirm() to get notifications as each
3840 * css is confirmed to be seen as killed on all CPUs.
3842 percpu_ref_kill_and_confirm(&css->refcnt, css_killed_ref_fn);
3846 * cgroup_destroy_locked - the first stage of cgroup destruction
3847 * @cgrp: cgroup to be destroyed
3849 * css's make use of percpu refcnts whose killing latency shouldn't be
3850 * exposed to userland and are RCU protected. Also, cgroup core needs to
3851 * guarantee that css_tryget() won't succeed by the time ->css_offline() is
3852 * invoked. To satisfy all the requirements, destruction is implemented in
3853 * the following two steps.
3855 * s1. Verify @cgrp can be destroyed and mark it dying. Remove all
3856 * userland visible parts and start killing the percpu refcnts of
3857 * css's. Set up so that the next stage will be kicked off once all
3858 * the percpu refcnts are confirmed to be killed.
3860 * s2. Invoke ->css_offline(), mark the cgroup dead and proceed with the
3861 * rest of destruction. Once all cgroup references are gone, the
3862 * cgroup is RCU-freed.
3864 * This function implements s1. After this step, @cgrp is gone as far as
3865 * the userland is concerned and a new cgroup with the same name may be
3866 * created. As cgroup doesn't care about the names internally, this
3867 * doesn't cause any problem.
3869 static int cgroup_destroy_locked(struct cgroup *cgrp)
3870 __releases(&cgroup_mutex) __acquires(&cgroup_mutex)
3872 struct cgroup *child;
3873 struct cgroup_subsys_state *css;
3877 lockdep_assert_held(&cgroup_tree_mutex);
3878 lockdep_assert_held(&cgroup_mutex);
3881 * css_set_lock synchronizes access to ->cset_links and prevents
3882 * @cgrp from being removed while __put_css_set() is in progress.
3884 read_lock(&css_set_lock);
3885 empty = list_empty(&cgrp->cset_links);
3886 read_unlock(&css_set_lock);
3891 * Make sure there's no live children. We can't test ->children
3892 * emptiness as dead children linger on it while being destroyed;
3893 * otherwise, "rmdir parent/child parent" may fail with -EBUSY.
3897 list_for_each_entry_rcu(child, &cgrp->children, sibling) {
3898 empty = cgroup_is_dead(child);
3907 * Initiate massacre of all css's. cgroup_destroy_css_killed()
3908 * will be invoked to perform the rest of destruction once the
3909 * percpu refs of all css's are confirmed to be killed. This
3910 * involves removing the subsystem's files, drop cgroup_mutex.
3912 mutex_unlock(&cgroup_mutex);
3913 for_each_css(css, ssid, cgrp)
3915 mutex_lock(&cgroup_mutex);
3918 * Mark @cgrp dead. This prevents further task migration and child
3919 * creation by disabling cgroup_lock_live_group(). Note that
3920 * CGRP_DEAD assertion is depended upon by css_next_child() to
3921 * resume iteration after dropping RCU read lock. See
3922 * css_next_child() for details.
3924 set_bit(CGRP_DEAD, &cgrp->flags);
3926 /* CGRP_DEAD is set, remove from ->release_list for the last time */
3927 raw_spin_lock(&release_list_lock);
3928 if (!list_empty(&cgrp->release_list))
3929 list_del_init(&cgrp->release_list);
3930 raw_spin_unlock(&release_list_lock);
3933 * If @cgrp has css's attached, the second stage of cgroup
3934 * destruction is kicked off from css_killed_work_fn() after the
3935 * refs of all attached css's are killed. If @cgrp doesn't have
3936 * any css, we kick it off here.
3939 cgroup_destroy_css_killed(cgrp);
3941 /* remove @cgrp directory along with the base files */
3942 mutex_unlock(&cgroup_mutex);
3945 * There are two control paths which try to determine cgroup from
3946 * dentry without going through kernfs - cgroupstats_build() and
3947 * css_tryget_from_dir(). Those are supported by RCU protecting
3948 * clearing of cgrp->kn->priv backpointer, which should happen
3949 * after all files under it have been removed.
3951 kernfs_remove(cgrp->kn); /* @cgrp has an extra ref on its kn */
3952 RCU_INIT_POINTER(*(void __rcu __force **)&cgrp->kn->priv, NULL);
3954 mutex_lock(&cgroup_mutex);
3960 * cgroup_destroy_css_killed - the second step of cgroup destruction
3961 * @work: cgroup->destroy_free_work
3963 * This function is invoked from a work item for a cgroup which is being
3964 * destroyed after all css's are offlined and performs the rest of
3965 * destruction. This is the second step of destruction described in the
3966 * comment above cgroup_destroy_locked().
3968 static void cgroup_destroy_css_killed(struct cgroup *cgrp)
3970 struct cgroup *parent = cgrp->parent;
3972 lockdep_assert_held(&cgroup_tree_mutex);
3973 lockdep_assert_held(&cgroup_mutex);
3975 /* delete this cgroup from parent->children */
3976 list_del_rcu(&cgrp->sibling);
3980 set_bit(CGRP_RELEASABLE, &parent->flags);
3981 check_for_release(parent);
3984 static int cgroup_rmdir(struct kernfs_node *kn)
3986 struct cgroup *cgrp = kn->priv;
3990 * This is self-destruction but @kn can't be removed while this
3991 * callback is in progress. Let's break active protection. Once
3992 * the protection is broken, @cgrp can be destroyed at any point.
3993 * Pin it so that it stays accessible.
3996 kernfs_break_active_protection(kn);
3998 mutex_lock(&cgroup_tree_mutex);
3999 mutex_lock(&cgroup_mutex);
4002 * @cgrp might already have been destroyed while we're trying to
4005 if (!cgroup_is_dead(cgrp))
4006 ret = cgroup_destroy_locked(cgrp);
4008 mutex_unlock(&cgroup_mutex);
4009 mutex_unlock(&cgroup_tree_mutex);
4011 kernfs_unbreak_active_protection(kn);
4016 static struct kernfs_syscall_ops cgroup_kf_syscall_ops = {
4017 .remount_fs = cgroup_remount,
4018 .show_options = cgroup_show_options,
4019 .mkdir = cgroup_mkdir,
4020 .rmdir = cgroup_rmdir,
4021 .rename = cgroup_rename,
4024 static void __init cgroup_init_subsys(struct cgroup_subsys *ss)
4026 struct cgroup_subsys_state *css;
4028 printk(KERN_INFO "Initializing cgroup subsys %s\n", ss->name);
4030 mutex_lock(&cgroup_tree_mutex);
4031 mutex_lock(&cgroup_mutex);
4033 INIT_LIST_HEAD(&ss->cfts);
4035 /* Create the top cgroup state for this subsystem */
4036 ss->root = &cgroup_dummy_root;
4037 css = ss->css_alloc(cgroup_css(cgroup_dummy_top, ss));
4038 /* We don't handle early failures gracefully */
4039 BUG_ON(IS_ERR(css));
4040 init_css(css, ss, cgroup_dummy_top);
4042 /* Update the init_css_set to contain a subsys
4043 * pointer to this state - since the subsystem is
4044 * newly registered, all tasks and hence the
4045 * init_css_set is in the subsystem's top cgroup. */
4046 init_css_set.subsys[ss->id] = css;
4048 need_forkexit_callback |= ss->fork || ss->exit;
4050 /* At system boot, before all subsystems have been
4051 * registered, no tasks have been forked, so we don't
4052 * need to invoke fork callbacks here. */
4053 BUG_ON(!list_empty(&init_task.tasks));
4055 BUG_ON(online_css(css));
4057 mutex_unlock(&cgroup_mutex);
4058 mutex_unlock(&cgroup_tree_mutex);
4062 * cgroup_init_early - cgroup initialization at system boot
4064 * Initialize cgroups at system boot, and initialize any
4065 * subsystems that request early init.
4067 int __init cgroup_init_early(void)
4069 struct cgroup_subsys *ss;
4072 atomic_set(&init_css_set.refcount, 1);
4073 INIT_LIST_HEAD(&init_css_set.cgrp_links);
4074 INIT_LIST_HEAD(&init_css_set.tasks);
4075 INIT_HLIST_NODE(&init_css_set.hlist);
4077 init_cgroup_root(&cgroup_dummy_root);
4078 cgroup_root_count = 1;
4079 RCU_INIT_POINTER(init_task.cgroups, &init_css_set);
4081 init_cgrp_cset_link.cset = &init_css_set;
4082 init_cgrp_cset_link.cgrp = cgroup_dummy_top;
4083 list_add(&init_cgrp_cset_link.cset_link, &cgroup_dummy_top->cset_links);
4084 list_add(&init_cgrp_cset_link.cgrp_link, &init_css_set.cgrp_links);
4086 for_each_subsys(ss, i) {
4087 WARN(!ss->css_alloc || !ss->css_free || ss->name || ss->id,
4088 "invalid cgroup_subsys %d:%s css_alloc=%p css_free=%p name:id=%d:%s\n",
4089 i, cgroup_subsys_name[i], ss->css_alloc, ss->css_free,
4091 WARN(strlen(cgroup_subsys_name[i]) > MAX_CGROUP_TYPE_NAMELEN,
4092 "cgroup_subsys_name %s too long\n", cgroup_subsys_name[i]);
4095 ss->name = cgroup_subsys_name[i];
4098 cgroup_init_subsys(ss);
4104 * cgroup_init - cgroup initialization
4106 * Register cgroup filesystem and /proc file, and initialize
4107 * any subsystems that didn't request early init.
4109 int __init cgroup_init(void)
4111 struct cgroup_subsys *ss;
4115 BUG_ON(cgroup_init_cftypes(NULL, cgroup_base_files));
4117 for_each_subsys(ss, i) {
4118 if (!ss->early_init)
4119 cgroup_init_subsys(ss);
4122 * cftype registration needs kmalloc and can't be done
4123 * during early_init. Register base cftypes separately.
4125 if (ss->base_cftypes)
4126 WARN_ON(cgroup_add_cftypes(ss, ss->base_cftypes));
4129 /* allocate id for the dummy hierarchy */
4130 mutex_lock(&cgroup_mutex);
4132 /* Add init_css_set to the hash table */
4133 key = css_set_hash(init_css_set.subsys);
4134 hash_add(css_set_table, &init_css_set.hlist, key);
4136 BUG_ON(cgroup_init_root_id(&cgroup_dummy_root, 0, 1));
4138 err = idr_alloc(&cgroup_dummy_root.cgroup_idr, cgroup_dummy_top,
4142 mutex_unlock(&cgroup_mutex);
4144 cgroup_kobj = kobject_create_and_add("cgroup", fs_kobj);
4148 err = register_filesystem(&cgroup_fs_type);
4150 kobject_put(cgroup_kobj);
4154 proc_create("cgroups", 0, NULL, &proc_cgroupstats_operations);
4158 static int __init cgroup_wq_init(void)
4161 * There isn't much point in executing destruction path in
4162 * parallel. Good chunk is serialized with cgroup_mutex anyway.
4164 * XXX: Must be ordered to make sure parent is offlined after
4165 * children. The ordering requirement is for memcg where a
4166 * parent's offline may wait for a child's leading to deadlock. In
4167 * the long term, this should be fixed from memcg side.
4169 * We would prefer to do this in cgroup_init() above, but that
4170 * is called before init_workqueues(): so leave this until after.
4172 cgroup_destroy_wq = alloc_ordered_workqueue("cgroup_destroy", 0);
4173 BUG_ON(!cgroup_destroy_wq);
4176 * Used to destroy pidlists and separate to serve as flush domain.
4177 * Cap @max_active to 1 too.
4179 cgroup_pidlist_destroy_wq = alloc_workqueue("cgroup_pidlist_destroy",
4181 BUG_ON(!cgroup_pidlist_destroy_wq);
4185 core_initcall(cgroup_wq_init);
4188 * proc_cgroup_show()
4189 * - Print task's cgroup paths into seq_file, one line for each hierarchy
4190 * - Used for /proc/<pid>/cgroup.
4191 * - No need to task_lock(tsk) on this tsk->cgroup reference, as it
4192 * doesn't really matter if tsk->cgroup changes after we read it,
4193 * and we take cgroup_mutex, keeping cgroup_attach_task() from changing it
4194 * anyway. No need to check that tsk->cgroup != NULL, thanks to
4195 * the_top_cgroup_hack in cgroup_exit(), which sets an exiting tasks
4196 * cgroup to top_cgroup.
4199 /* TODO: Use a proper seq_file iterator */
4200 int proc_cgroup_show(struct seq_file *m, void *v)
4203 struct task_struct *tsk;
4206 struct cgroupfs_root *root;
4209 buf = kmalloc(PATH_MAX, GFP_KERNEL);
4215 tsk = get_pid_task(pid, PIDTYPE_PID);
4221 mutex_lock(&cgroup_mutex);
4223 for_each_active_root(root) {
4224 struct cgroup_subsys *ss;
4225 struct cgroup *cgrp;
4226 int ssid, count = 0;
4228 seq_printf(m, "%d:", root->hierarchy_id);
4229 for_each_subsys(ss, ssid)
4230 if (root->subsys_mask & (1 << ssid))
4231 seq_printf(m, "%s%s", count++ ? "," : "", ss->name);
4232 if (strlen(root->name))
4233 seq_printf(m, "%sname=%s", count ? "," : "",
4236 cgrp = task_cgroup_from_root(tsk, root);
4237 path = cgroup_path(cgrp, buf, PATH_MAX);
4239 retval = -ENAMETOOLONG;
4247 mutex_unlock(&cgroup_mutex);
4248 put_task_struct(tsk);
4255 /* Display information about each subsystem and each hierarchy */
4256 static int proc_cgroupstats_show(struct seq_file *m, void *v)
4258 struct cgroup_subsys *ss;
4261 seq_puts(m, "#subsys_name\thierarchy\tnum_cgroups\tenabled\n");
4263 * ideally we don't want subsystems moving around while we do this.
4264 * cgroup_mutex is also necessary to guarantee an atomic snapshot of
4265 * subsys/hierarchy state.
4267 mutex_lock(&cgroup_mutex);
4269 for_each_subsys(ss, i)
4270 seq_printf(m, "%s\t%d\t%d\t%d\n",
4271 ss->name, ss->root->hierarchy_id,
4272 atomic_read(&ss->root->nr_cgrps), !ss->disabled);
4274 mutex_unlock(&cgroup_mutex);
4278 static int cgroupstats_open(struct inode *inode, struct file *file)
4280 return single_open(file, proc_cgroupstats_show, NULL);
4283 static const struct file_operations proc_cgroupstats_operations = {
4284 .open = cgroupstats_open,
4286 .llseek = seq_lseek,
4287 .release = single_release,
4291 * cgroup_fork - attach newly forked task to its parents cgroup.
4292 * @child: pointer to task_struct of forking parent process.
4294 * Description: A task inherits its parent's cgroup at fork().
4296 * A pointer to the shared css_set was automatically copied in
4297 * fork.c by dup_task_struct(). However, we ignore that copy, since
4298 * it was not made under the protection of RCU or cgroup_mutex, so
4299 * might no longer be a valid cgroup pointer. cgroup_attach_task() might
4300 * have already changed current->cgroups, allowing the previously
4301 * referenced cgroup group to be removed and freed.
4303 * At the point that cgroup_fork() is called, 'current' is the parent
4304 * task, and the passed argument 'child' points to the child task.
4306 void cgroup_fork(struct task_struct *child)
4309 get_css_set(task_css_set(current));
4310 child->cgroups = current->cgroups;
4311 task_unlock(current);
4312 INIT_LIST_HEAD(&child->cg_list);
4316 * cgroup_post_fork - called on a new task after adding it to the task list
4317 * @child: the task in question
4319 * Adds the task to the list running through its css_set if necessary and
4320 * call the subsystem fork() callbacks. Has to be after the task is
4321 * visible on the task list in case we race with the first call to
4322 * cgroup_task_iter_start() - to guarantee that the new task ends up on its
4325 void cgroup_post_fork(struct task_struct *child)
4327 struct cgroup_subsys *ss;
4331 * use_task_css_set_links is set to 1 before we walk the tasklist
4332 * under the tasklist_lock and we read it here after we added the child
4333 * to the tasklist under the tasklist_lock as well. If the child wasn't
4334 * yet in the tasklist when we walked through it from
4335 * cgroup_enable_task_cg_lists(), then use_task_css_set_links value
4336 * should be visible now due to the paired locking and barriers implied
4337 * by LOCK/UNLOCK: it is written before the tasklist_lock unlock
4338 * in cgroup_enable_task_cg_lists() and read here after the tasklist_lock
4341 if (use_task_css_set_links) {
4342 write_lock(&css_set_lock);
4344 if (list_empty(&child->cg_list))
4345 list_add(&child->cg_list, &task_css_set(child)->tasks);
4347 write_unlock(&css_set_lock);
4351 * Call ss->fork(). This must happen after @child is linked on
4352 * css_set; otherwise, @child might change state between ->fork()
4353 * and addition to css_set.
4355 if (need_forkexit_callback) {
4356 for_each_subsys(ss, i)
4363 * cgroup_exit - detach cgroup from exiting task
4364 * @tsk: pointer to task_struct of exiting process
4365 * @run_callback: run exit callbacks?
4367 * Description: Detach cgroup from @tsk and release it.
4369 * Note that cgroups marked notify_on_release force every task in
4370 * them to take the global cgroup_mutex mutex when exiting.
4371 * This could impact scaling on very large systems. Be reluctant to
4372 * use notify_on_release cgroups where very high task exit scaling
4373 * is required on large systems.
4375 * the_top_cgroup_hack:
4377 * Set the exiting tasks cgroup to the root cgroup (top_cgroup).
4379 * We call cgroup_exit() while the task is still competent to
4380 * handle notify_on_release(), then leave the task attached to the
4381 * root cgroup in each hierarchy for the remainder of its exit.
4383 * To do this properly, we would increment the reference count on
4384 * top_cgroup, and near the very end of the kernel/exit.c do_exit()
4385 * code we would add a second cgroup function call, to drop that
4386 * reference. This would just create an unnecessary hot spot on
4387 * the top_cgroup reference count, to no avail.
4389 * Normally, holding a reference to a cgroup without bumping its
4390 * count is unsafe. The cgroup could go away, or someone could
4391 * attach us to a different cgroup, decrementing the count on
4392 * the first cgroup that we never incremented. But in this case,
4393 * top_cgroup isn't going away, and either task has PF_EXITING set,
4394 * which wards off any cgroup_attach_task() attempts, or task is a failed
4395 * fork, never visible to cgroup_attach_task.
4397 void cgroup_exit(struct task_struct *tsk, int run_callbacks)
4399 struct cgroup_subsys *ss;
4400 struct css_set *cset;
4404 * Unlink from the css_set task list if necessary.
4405 * Optimistically check cg_list before taking
4408 if (!list_empty(&tsk->cg_list)) {
4409 write_lock(&css_set_lock);
4410 if (!list_empty(&tsk->cg_list))
4411 list_del_init(&tsk->cg_list);
4412 write_unlock(&css_set_lock);
4415 /* Reassign the task to the init_css_set. */
4417 cset = task_css_set(tsk);
4418 RCU_INIT_POINTER(tsk->cgroups, &init_css_set);
4420 if (run_callbacks && need_forkexit_callback) {
4421 /* see cgroup_post_fork() for details */
4422 for_each_subsys(ss, i) {
4424 struct cgroup_subsys_state *old_css = cset->subsys[i];
4425 struct cgroup_subsys_state *css = task_css(tsk, i);
4427 ss->exit(css, old_css, tsk);
4433 put_css_set_taskexit(cset);
4436 static void check_for_release(struct cgroup *cgrp)
4438 if (cgroup_is_releasable(cgrp) &&
4439 list_empty(&cgrp->cset_links) && list_empty(&cgrp->children)) {
4441 * Control Group is currently removeable. If it's not
4442 * already queued for a userspace notification, queue
4445 int need_schedule_work = 0;
4447 raw_spin_lock(&release_list_lock);
4448 if (!cgroup_is_dead(cgrp) &&
4449 list_empty(&cgrp->release_list)) {
4450 list_add(&cgrp->release_list, &release_list);
4451 need_schedule_work = 1;
4453 raw_spin_unlock(&release_list_lock);
4454 if (need_schedule_work)
4455 schedule_work(&release_agent_work);
4460 * Notify userspace when a cgroup is released, by running the
4461 * configured release agent with the name of the cgroup (path
4462 * relative to the root of cgroup file system) as the argument.
4464 * Most likely, this user command will try to rmdir this cgroup.
4466 * This races with the possibility that some other task will be
4467 * attached to this cgroup before it is removed, or that some other
4468 * user task will 'mkdir' a child cgroup of this cgroup. That's ok.
4469 * The presumed 'rmdir' will fail quietly if this cgroup is no longer
4470 * unused, and this cgroup will be reprieved from its death sentence,
4471 * to continue to serve a useful existence. Next time it's released,
4472 * we will get notified again, if it still has 'notify_on_release' set.
4474 * The final arg to call_usermodehelper() is UMH_WAIT_EXEC, which
4475 * means only wait until the task is successfully execve()'d. The
4476 * separate release agent task is forked by call_usermodehelper(),
4477 * then control in this thread returns here, without waiting for the
4478 * release agent task. We don't bother to wait because the caller of
4479 * this routine has no use for the exit status of the release agent
4480 * task, so no sense holding our caller up for that.
4482 static void cgroup_release_agent(struct work_struct *work)
4484 BUG_ON(work != &release_agent_work);
4485 mutex_lock(&cgroup_mutex);
4486 raw_spin_lock(&release_list_lock);
4487 while (!list_empty(&release_list)) {
4488 char *argv[3], *envp[3];
4490 char *pathbuf = NULL, *agentbuf = NULL, *path;
4491 struct cgroup *cgrp = list_entry(release_list.next,
4494 list_del_init(&cgrp->release_list);
4495 raw_spin_unlock(&release_list_lock);
4496 pathbuf = kmalloc(PATH_MAX, GFP_KERNEL);
4499 path = cgroup_path(cgrp, pathbuf, PATH_MAX);
4502 agentbuf = kstrdup(cgrp->root->release_agent_path, GFP_KERNEL);
4507 argv[i++] = agentbuf;
4512 /* minimal command environment */
4513 envp[i++] = "HOME=/";
4514 envp[i++] = "PATH=/sbin:/bin:/usr/sbin:/usr/bin";
4517 /* Drop the lock while we invoke the usermode helper,
4518 * since the exec could involve hitting disk and hence
4519 * be a slow process */
4520 mutex_unlock(&cgroup_mutex);
4521 call_usermodehelper(argv[0], argv, envp, UMH_WAIT_EXEC);
4522 mutex_lock(&cgroup_mutex);
4526 raw_spin_lock(&release_list_lock);
4528 raw_spin_unlock(&release_list_lock);
4529 mutex_unlock(&cgroup_mutex);
4532 static int __init cgroup_disable(char *str)
4534 struct cgroup_subsys *ss;
4538 while ((token = strsep(&str, ",")) != NULL) {
4542 for_each_subsys(ss, i) {
4543 if (!strcmp(token, ss->name)) {
4545 printk(KERN_INFO "Disabling %s control group"
4546 " subsystem\n", ss->name);
4553 __setup("cgroup_disable=", cgroup_disable);
4556 * css_tryget_from_dir - get corresponding css from the dentry of a cgroup dir
4557 * @dentry: directory dentry of interest
4558 * @ss: subsystem of interest
4560 * If @dentry is a directory for a cgroup which has @ss enabled on it, try
4561 * to get the corresponding css and return it. If such css doesn't exist
4562 * or can't be pinned, an ERR_PTR value is returned.
4564 struct cgroup_subsys_state *css_tryget_from_dir(struct dentry *dentry,
4565 struct cgroup_subsys *ss)
4567 struct kernfs_node *kn = kernfs_node_from_dentry(dentry);
4568 struct cgroup_subsys_state *css = NULL;
4569 struct cgroup *cgrp;
4571 /* is @dentry a cgroup dir? */
4572 if (dentry->d_sb->s_type != &cgroup_fs_type || !kn ||
4573 kernfs_type(kn) != KERNFS_DIR)
4574 return ERR_PTR(-EBADF);
4579 * This path doesn't originate from kernfs and @kn could already
4580 * have been or be removed at any point. @kn->priv is RCU
4581 * protected for this access. See destroy_locked() for details.
4583 cgrp = rcu_dereference(kn->priv);
4585 css = cgroup_css(cgrp, ss);
4587 if (!css || !css_tryget(css))
4588 css = ERR_PTR(-ENOENT);
4595 * css_from_id - lookup css by id
4596 * @id: the cgroup id
4597 * @ss: cgroup subsys to be looked into
4599 * Returns the css if there's valid one with @id, otherwise returns NULL.
4600 * Should be called under rcu_read_lock().
4602 struct cgroup_subsys_state *css_from_id(int id, struct cgroup_subsys *ss)
4604 struct cgroup *cgrp;
4606 cgroup_assert_mutexes_or_rcu_locked();
4608 cgrp = idr_find(&ss->root->cgroup_idr, id);
4610 return cgroup_css(cgrp, ss);
4614 #ifdef CONFIG_CGROUP_DEBUG
4615 static struct cgroup_subsys_state *
4616 debug_css_alloc(struct cgroup_subsys_state *parent_css)
4618 struct cgroup_subsys_state *css = kzalloc(sizeof(*css), GFP_KERNEL);
4621 return ERR_PTR(-ENOMEM);
4626 static void debug_css_free(struct cgroup_subsys_state *css)
4631 static u64 debug_taskcount_read(struct cgroup_subsys_state *css,
4634 return cgroup_task_count(css->cgroup);
4637 static u64 current_css_set_read(struct cgroup_subsys_state *css,
4640 return (u64)(unsigned long)current->cgroups;
4643 static u64 current_css_set_refcount_read(struct cgroup_subsys_state *css,
4649 count = atomic_read(&task_css_set(current)->refcount);
4654 static int current_css_set_cg_links_read(struct seq_file *seq, void *v)
4656 struct cgrp_cset_link *link;
4657 struct css_set *cset;
4660 name_buf = kmalloc(NAME_MAX + 1, GFP_KERNEL);
4664 read_lock(&css_set_lock);
4666 cset = rcu_dereference(current->cgroups);
4667 list_for_each_entry(link, &cset->cgrp_links, cgrp_link) {
4668 struct cgroup *c = link->cgrp;
4669 const char *name = "?";
4671 if (c != cgroup_dummy_top) {
4672 cgroup_name(c, name_buf, NAME_MAX + 1);
4676 seq_printf(seq, "Root %d group %s\n",
4677 c->root->hierarchy_id, name);
4680 read_unlock(&css_set_lock);
4685 #define MAX_TASKS_SHOWN_PER_CSS 25
4686 static int cgroup_css_links_read(struct seq_file *seq, void *v)
4688 struct cgroup_subsys_state *css = seq_css(seq);
4689 struct cgrp_cset_link *link;
4691 read_lock(&css_set_lock);
4692 list_for_each_entry(link, &css->cgroup->cset_links, cset_link) {
4693 struct css_set *cset = link->cset;
4694 struct task_struct *task;
4696 seq_printf(seq, "css_set %p\n", cset);
4697 list_for_each_entry(task, &cset->tasks, cg_list) {
4698 if (count++ > MAX_TASKS_SHOWN_PER_CSS) {
4699 seq_puts(seq, " ...\n");
4702 seq_printf(seq, " task %d\n",
4703 task_pid_vnr(task));
4707 read_unlock(&css_set_lock);
4711 static u64 releasable_read(struct cgroup_subsys_state *css, struct cftype *cft)
4713 return test_bit(CGRP_RELEASABLE, &css->cgroup->flags);
4716 static struct cftype debug_files[] = {
4718 .name = "taskcount",
4719 .read_u64 = debug_taskcount_read,
4723 .name = "current_css_set",
4724 .read_u64 = current_css_set_read,
4728 .name = "current_css_set_refcount",
4729 .read_u64 = current_css_set_refcount_read,
4733 .name = "current_css_set_cg_links",
4734 .seq_show = current_css_set_cg_links_read,
4738 .name = "cgroup_css_links",
4739 .seq_show = cgroup_css_links_read,
4743 .name = "releasable",
4744 .read_u64 = releasable_read,
4750 struct cgroup_subsys debug_cgrp_subsys = {
4751 .css_alloc = debug_css_alloc,
4752 .css_free = debug_css_free,
4753 .base_cftypes = debug_files,
4755 #endif /* CONFIG_CGROUP_DEBUG */