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>
34 #include <linux/init_task.h>
35 #include <linux/kernel.h>
36 #include <linux/list.h>
38 #include <linux/mutex.h>
39 #include <linux/mount.h>
40 #include <linux/pagemap.h>
41 #include <linux/proc_fs.h>
42 #include <linux/rcupdate.h>
43 #include <linux/sched.h>
44 #include <linux/backing-dev.h>
45 #include <linux/seq_file.h>
46 #include <linux/slab.h>
47 #include <linux/magic.h>
48 #include <linux/spinlock.h>
49 #include <linux/string.h>
50 #include <linux/sort.h>
51 #include <linux/kmod.h>
52 #include <linux/module.h>
53 #include <linux/delayacct.h>
54 #include <linux/cgroupstats.h>
55 #include <linux/hashtable.h>
56 #include <linux/namei.h>
57 #include <linux/pid_namespace.h>
58 #include <linux/idr.h>
59 #include <linux/vmalloc.h> /* TODO: replace with more sophisticated array */
60 #include <linux/eventfd.h>
61 #include <linux/poll.h>
62 #include <linux/flex_array.h> /* used in cgroup_attach_proc */
63 #include <linux/kthread.h>
65 #include <linux/atomic.h>
67 /* css deactivation bias, makes css->refcnt negative to deny new trygets */
68 #define CSS_DEACT_BIAS INT_MIN
71 * cgroup_mutex is the master lock. Any modification to cgroup or its
72 * hierarchy must be performed while holding it.
74 * cgroup_root_mutex nests inside cgroup_mutex and should be held to modify
75 * cgroupfs_root of any cgroup hierarchy - subsys list, flags,
76 * release_agent_path and so on. Modifying requires both cgroup_mutex and
77 * cgroup_root_mutex. Readers can acquire either of the two. This is to
78 * break the following locking order cycle.
80 * A. cgroup_mutex -> cred_guard_mutex -> s_type->i_mutex_key -> namespace_sem
81 * B. namespace_sem -> cgroup_mutex
83 * B happens only through cgroup_show_options() and using cgroup_root_mutex
86 static DEFINE_MUTEX(cgroup_mutex);
87 static DEFINE_MUTEX(cgroup_root_mutex);
90 * Generate an array of cgroup subsystem pointers. At boot time, this is
91 * populated with the built in subsystems, and modular subsystems are
92 * registered after that. The mutable section of this array is protected by
95 #define SUBSYS(_x) [_x ## _subsys_id] = &_x ## _subsys,
96 #define IS_SUBSYS_ENABLED(option) IS_BUILTIN(option)
97 static struct cgroup_subsys *subsys[CGROUP_SUBSYS_COUNT] = {
98 #include <linux/cgroup_subsys.h>
101 #define MAX_CGROUP_ROOT_NAMELEN 64
104 * A cgroupfs_root represents the root of a cgroup hierarchy,
105 * and may be associated with a superblock to form an active
108 struct cgroupfs_root {
109 struct super_block *sb;
112 * The bitmask of subsystems intended to be attached to this
115 unsigned long subsys_mask;
117 /* Unique id for this hierarchy. */
120 /* The bitmask of subsystems currently attached to this hierarchy */
121 unsigned long actual_subsys_mask;
123 /* A list running through the attached subsystems */
124 struct list_head subsys_list;
126 /* The root cgroup for this hierarchy */
127 struct cgroup top_cgroup;
129 /* Tracks how many cgroups are currently defined in hierarchy.*/
130 int number_of_cgroups;
132 /* A list running through the active hierarchies */
133 struct list_head root_list;
135 /* All cgroups on this root, cgroup_mutex protected */
136 struct list_head allcg_list;
138 /* Hierarchy-specific flags */
141 /* IDs for cgroups in this hierarchy */
142 struct ida cgroup_ida;
144 /* The path to use for release notifications. */
145 char release_agent_path[PATH_MAX];
147 /* The name for this hierarchy - may be empty */
148 char name[MAX_CGROUP_ROOT_NAMELEN];
152 * The "rootnode" hierarchy is the "dummy hierarchy", reserved for the
153 * subsystems that are otherwise unattached - it never has more than a
154 * single cgroup, and all tasks are part of that cgroup.
156 static struct cgroupfs_root rootnode;
159 * cgroupfs file entry, pointed to from leaf dentry->d_fsdata.
162 struct list_head node;
163 struct dentry *dentry;
168 * CSS ID -- ID per subsys's Cgroup Subsys State(CSS). used only when
169 * cgroup_subsys->use_id != 0.
171 #define CSS_ID_MAX (65535)
174 * The css to which this ID points. This pointer is set to valid value
175 * after cgroup is populated. If cgroup is removed, this will be NULL.
176 * This pointer is expected to be RCU-safe because destroy()
177 * is called after synchronize_rcu(). But for safe use, css_tryget()
178 * should be used for avoiding race.
180 struct cgroup_subsys_state __rcu *css;
186 * Depth in hierarchy which this ID belongs to.
188 unsigned short depth;
190 * ID is freed by RCU. (and lookup routine is RCU safe.)
192 struct rcu_head rcu_head;
194 * Hierarchy of CSS ID belongs to.
196 unsigned short stack[0]; /* Array of Length (depth+1) */
200 * cgroup_event represents events which userspace want to receive.
202 struct cgroup_event {
204 * Cgroup which the event belongs to.
208 * Control file which the event associated.
212 * eventfd to signal userspace about the event.
214 struct eventfd_ctx *eventfd;
216 * Each of these stored in a list by the cgroup.
218 struct list_head list;
220 * All fields below needed to unregister event when
221 * userspace closes eventfd.
224 wait_queue_head_t *wqh;
226 struct work_struct remove;
229 /* The list of hierarchy roots */
231 static LIST_HEAD(roots);
232 static int root_count;
234 static DEFINE_IDA(hierarchy_ida);
235 static int next_hierarchy_id;
236 static DEFINE_SPINLOCK(hierarchy_id_lock);
238 /* dummytop is a shorthand for the dummy hierarchy's top cgroup */
239 #define dummytop (&rootnode.top_cgroup)
241 /* This flag indicates whether tasks in the fork and exit paths should
242 * check for fork/exit handlers to call. This avoids us having to do
243 * extra work in the fork/exit path if none of the subsystems need to
246 static int need_forkexit_callback __read_mostly;
248 static int cgroup_destroy_locked(struct cgroup *cgrp);
249 static int cgroup_addrm_files(struct cgroup *cgrp, struct cgroup_subsys *subsys,
250 struct cftype cfts[], bool is_add);
252 #ifdef CONFIG_PROVE_LOCKING
253 int cgroup_lock_is_held(void)
255 return lockdep_is_held(&cgroup_mutex);
257 #else /* #ifdef CONFIG_PROVE_LOCKING */
258 int cgroup_lock_is_held(void)
260 return mutex_is_locked(&cgroup_mutex);
262 #endif /* #else #ifdef CONFIG_PROVE_LOCKING */
264 EXPORT_SYMBOL_GPL(cgroup_lock_is_held);
266 static int css_unbias_refcnt(int refcnt)
268 return refcnt >= 0 ? refcnt : refcnt - CSS_DEACT_BIAS;
271 /* the current nr of refs, always >= 0 whether @css is deactivated or not */
272 static int css_refcnt(struct cgroup_subsys_state *css)
274 int v = atomic_read(&css->refcnt);
276 return css_unbias_refcnt(v);
279 /* convenient tests for these bits */
280 inline int cgroup_is_removed(const struct cgroup *cgrp)
282 return test_bit(CGRP_REMOVED, &cgrp->flags);
285 /* bits in struct cgroupfs_root flags field */
287 ROOT_NOPREFIX, /* mounted subsystems have no named prefix */
288 ROOT_XATTR, /* supports extended attributes */
291 static int cgroup_is_releasable(const struct cgroup *cgrp)
294 (1 << CGRP_RELEASABLE) |
295 (1 << CGRP_NOTIFY_ON_RELEASE);
296 return (cgrp->flags & bits) == bits;
299 static int notify_on_release(const struct cgroup *cgrp)
301 return test_bit(CGRP_NOTIFY_ON_RELEASE, &cgrp->flags);
305 * for_each_subsys() allows you to iterate on each subsystem attached to
306 * an active hierarchy
308 #define for_each_subsys(_root, _ss) \
309 list_for_each_entry(_ss, &_root->subsys_list, sibling)
311 /* for_each_active_root() allows you to iterate across the active hierarchies */
312 #define for_each_active_root(_root) \
313 list_for_each_entry(_root, &roots, root_list)
315 static inline struct cgroup *__d_cgrp(struct dentry *dentry)
317 return dentry->d_fsdata;
320 static inline struct cfent *__d_cfe(struct dentry *dentry)
322 return dentry->d_fsdata;
325 static inline struct cftype *__d_cft(struct dentry *dentry)
327 return __d_cfe(dentry)->type;
330 /* the list of cgroups eligible for automatic release. Protected by
331 * release_list_lock */
332 static LIST_HEAD(release_list);
333 static DEFINE_RAW_SPINLOCK(release_list_lock);
334 static void cgroup_release_agent(struct work_struct *work);
335 static DECLARE_WORK(release_agent_work, cgroup_release_agent);
336 static void check_for_release(struct cgroup *cgrp);
338 /* Link structure for associating css_set objects with cgroups */
339 struct cg_cgroup_link {
341 * List running through cg_cgroup_links associated with a
342 * cgroup, anchored on cgroup->css_sets
344 struct list_head cgrp_link_list;
347 * List running through cg_cgroup_links pointing at a
348 * single css_set object, anchored on css_set->cg_links
350 struct list_head cg_link_list;
354 /* The default css_set - used by init and its children prior to any
355 * hierarchies being mounted. It contains a pointer to the root state
356 * for each subsystem. Also used to anchor the list of css_sets. Not
357 * reference-counted, to improve performance when child cgroups
358 * haven't been created.
361 static struct css_set init_css_set;
362 static struct cg_cgroup_link init_css_set_link;
364 static int cgroup_init_idr(struct cgroup_subsys *ss,
365 struct cgroup_subsys_state *css);
367 /* css_set_lock protects the list of css_set objects, and the
368 * chain of tasks off each css_set. Nests outside task->alloc_lock
369 * due to cgroup_iter_start() */
370 static DEFINE_RWLOCK(css_set_lock);
371 static int css_set_count;
374 * hash table for cgroup groups. This improves the performance to find
375 * an existing css_set. This hash doesn't (currently) take into
376 * account cgroups in empty hierarchies.
378 #define CSS_SET_HASH_BITS 7
379 static DEFINE_HASHTABLE(css_set_table, CSS_SET_HASH_BITS);
381 static unsigned long css_set_hash(struct cgroup_subsys_state *css[])
384 unsigned long key = 0UL;
386 for (i = 0; i < CGROUP_SUBSYS_COUNT; i++)
387 key += (unsigned long)css[i];
388 key = (key >> 16) ^ key;
393 /* We don't maintain the lists running through each css_set to its
394 * task until after the first call to cgroup_iter_start(). This
395 * reduces the fork()/exit() overhead for people who have cgroups
396 * compiled into their kernel but not actually in use */
397 static int use_task_css_set_links __read_mostly;
399 static void __put_css_set(struct css_set *cg, int taskexit)
401 struct cg_cgroup_link *link;
402 struct cg_cgroup_link *saved_link;
404 * Ensure that the refcount doesn't hit zero while any readers
405 * can see it. Similar to atomic_dec_and_lock(), but for an
408 if (atomic_add_unless(&cg->refcount, -1, 1))
410 write_lock(&css_set_lock);
411 if (!atomic_dec_and_test(&cg->refcount)) {
412 write_unlock(&css_set_lock);
416 /* This css_set is dead. unlink it and release cgroup refcounts */
417 hash_del(&cg->hlist);
420 list_for_each_entry_safe(link, saved_link, &cg->cg_links,
422 struct cgroup *cgrp = link->cgrp;
423 list_del(&link->cg_link_list);
424 list_del(&link->cgrp_link_list);
425 if (atomic_dec_and_test(&cgrp->count) &&
426 notify_on_release(cgrp)) {
428 set_bit(CGRP_RELEASABLE, &cgrp->flags);
429 check_for_release(cgrp);
435 write_unlock(&css_set_lock);
436 kfree_rcu(cg, rcu_head);
440 * refcounted get/put for css_set objects
442 static inline void get_css_set(struct css_set *cg)
444 atomic_inc(&cg->refcount);
447 static inline void put_css_set(struct css_set *cg)
449 __put_css_set(cg, 0);
452 static inline void put_css_set_taskexit(struct css_set *cg)
454 __put_css_set(cg, 1);
458 * compare_css_sets - helper function for find_existing_css_set().
459 * @cg: candidate css_set being tested
460 * @old_cg: existing css_set for a task
461 * @new_cgrp: cgroup that's being entered by the task
462 * @template: desired set of css pointers in css_set (pre-calculated)
464 * Returns true if "cg" matches "old_cg" except for the hierarchy
465 * which "new_cgrp" belongs to, for which it should match "new_cgrp".
467 static bool compare_css_sets(struct css_set *cg,
468 struct css_set *old_cg,
469 struct cgroup *new_cgrp,
470 struct cgroup_subsys_state *template[])
472 struct list_head *l1, *l2;
474 if (memcmp(template, cg->subsys, sizeof(cg->subsys))) {
475 /* Not all subsystems matched */
480 * Compare cgroup pointers in order to distinguish between
481 * different cgroups in heirarchies with no subsystems. We
482 * could get by with just this check alone (and skip the
483 * memcmp above) but on most setups the memcmp check will
484 * avoid the need for this more expensive check on almost all
489 l2 = &old_cg->cg_links;
491 struct cg_cgroup_link *cgl1, *cgl2;
492 struct cgroup *cg1, *cg2;
496 /* See if we reached the end - both lists are equal length. */
497 if (l1 == &cg->cg_links) {
498 BUG_ON(l2 != &old_cg->cg_links);
501 BUG_ON(l2 == &old_cg->cg_links);
503 /* Locate the cgroups associated with these links. */
504 cgl1 = list_entry(l1, struct cg_cgroup_link, cg_link_list);
505 cgl2 = list_entry(l2, struct cg_cgroup_link, cg_link_list);
508 /* Hierarchies should be linked in the same order. */
509 BUG_ON(cg1->root != cg2->root);
512 * If this hierarchy is the hierarchy of the cgroup
513 * that's changing, then we need to check that this
514 * css_set points to the new cgroup; if it's any other
515 * hierarchy, then this css_set should point to the
516 * same cgroup as the old css_set.
518 if (cg1->root == new_cgrp->root) {
530 * find_existing_css_set() is a helper for
531 * find_css_set(), and checks to see whether an existing
532 * css_set is suitable.
534 * oldcg: the cgroup group that we're using before the cgroup
537 * cgrp: the cgroup that we're moving into
539 * template: location in which to build the desired set of subsystem
540 * state objects for the new cgroup group
542 static struct css_set *find_existing_css_set(
543 struct css_set *oldcg,
545 struct cgroup_subsys_state *template[])
548 struct cgroupfs_root *root = cgrp->root;
549 struct hlist_node *node;
554 * Build the set of subsystem state objects that we want to see in the
555 * new css_set. while subsystems can change globally, the entries here
556 * won't change, so no need for locking.
558 for (i = 0; i < CGROUP_SUBSYS_COUNT; i++) {
559 if (root->subsys_mask & (1UL << i)) {
560 /* Subsystem is in this hierarchy. So we want
561 * the subsystem state from the new
563 template[i] = cgrp->subsys[i];
565 /* Subsystem is not in this hierarchy, so we
566 * don't want to change the subsystem state */
567 template[i] = oldcg->subsys[i];
571 key = css_set_hash(template);
572 hash_for_each_possible(css_set_table, cg, node, hlist, key) {
573 if (!compare_css_sets(cg, oldcg, cgrp, template))
576 /* This css_set matches what we need */
580 /* No existing cgroup group matched */
584 static void free_cg_links(struct list_head *tmp)
586 struct cg_cgroup_link *link;
587 struct cg_cgroup_link *saved_link;
589 list_for_each_entry_safe(link, saved_link, tmp, cgrp_link_list) {
590 list_del(&link->cgrp_link_list);
596 * allocate_cg_links() allocates "count" cg_cgroup_link structures
597 * and chains them on tmp through their cgrp_link_list fields. Returns 0 on
598 * success or a negative error
600 static int allocate_cg_links(int count, struct list_head *tmp)
602 struct cg_cgroup_link *link;
605 for (i = 0; i < count; i++) {
606 link = kmalloc(sizeof(*link), GFP_KERNEL);
611 list_add(&link->cgrp_link_list, tmp);
617 * link_css_set - a helper function to link a css_set to a cgroup
618 * @tmp_cg_links: cg_cgroup_link objects allocated by allocate_cg_links()
619 * @cg: the css_set to be linked
620 * @cgrp: the destination cgroup
622 static void link_css_set(struct list_head *tmp_cg_links,
623 struct css_set *cg, struct cgroup *cgrp)
625 struct cg_cgroup_link *link;
627 BUG_ON(list_empty(tmp_cg_links));
628 link = list_first_entry(tmp_cg_links, struct cg_cgroup_link,
632 atomic_inc(&cgrp->count);
633 list_move(&link->cgrp_link_list, &cgrp->css_sets);
635 * Always add links to the tail of the list so that the list
636 * is sorted by order of hierarchy creation
638 list_add_tail(&link->cg_link_list, &cg->cg_links);
642 * find_css_set() takes an existing cgroup group and a
643 * cgroup object, and returns a css_set object that's
644 * equivalent to the old group, but with the given cgroup
645 * substituted into the appropriate hierarchy. Must be called with
648 static struct css_set *find_css_set(
649 struct css_set *oldcg, struct cgroup *cgrp)
652 struct cgroup_subsys_state *template[CGROUP_SUBSYS_COUNT];
654 struct list_head tmp_cg_links;
656 struct cg_cgroup_link *link;
659 /* First see if we already have a cgroup group that matches
661 read_lock(&css_set_lock);
662 res = find_existing_css_set(oldcg, cgrp, template);
665 read_unlock(&css_set_lock);
670 res = kmalloc(sizeof(*res), GFP_KERNEL);
674 /* Allocate all the cg_cgroup_link objects that we'll need */
675 if (allocate_cg_links(root_count, &tmp_cg_links) < 0) {
680 atomic_set(&res->refcount, 1);
681 INIT_LIST_HEAD(&res->cg_links);
682 INIT_LIST_HEAD(&res->tasks);
683 INIT_HLIST_NODE(&res->hlist);
685 /* Copy the set of subsystem state objects generated in
686 * find_existing_css_set() */
687 memcpy(res->subsys, template, sizeof(res->subsys));
689 write_lock(&css_set_lock);
690 /* Add reference counts and links from the new css_set. */
691 list_for_each_entry(link, &oldcg->cg_links, cg_link_list) {
692 struct cgroup *c = link->cgrp;
693 if (c->root == cgrp->root)
695 link_css_set(&tmp_cg_links, res, c);
698 BUG_ON(!list_empty(&tmp_cg_links));
702 /* Add this cgroup group to the hash table */
703 key = css_set_hash(res->subsys);
704 hash_add(css_set_table, &res->hlist, key);
706 write_unlock(&css_set_lock);
712 * Return the cgroup for "task" from the given hierarchy. Must be
713 * called with cgroup_mutex held.
715 static struct cgroup *task_cgroup_from_root(struct task_struct *task,
716 struct cgroupfs_root *root)
719 struct cgroup *res = NULL;
721 BUG_ON(!mutex_is_locked(&cgroup_mutex));
722 read_lock(&css_set_lock);
724 * No need to lock the task - since we hold cgroup_mutex the
725 * task can't change groups, so the only thing that can happen
726 * is that it exits and its css is set back to init_css_set.
729 if (css == &init_css_set) {
730 res = &root->top_cgroup;
732 struct cg_cgroup_link *link;
733 list_for_each_entry(link, &css->cg_links, cg_link_list) {
734 struct cgroup *c = link->cgrp;
735 if (c->root == root) {
741 read_unlock(&css_set_lock);
747 * There is one global cgroup mutex. We also require taking
748 * task_lock() when dereferencing a task's cgroup subsys pointers.
749 * See "The task_lock() exception", at the end of this comment.
751 * A task must hold cgroup_mutex to modify cgroups.
753 * Any task can increment and decrement the count field without lock.
754 * So in general, code holding cgroup_mutex can't rely on the count
755 * field not changing. However, if the count goes to zero, then only
756 * cgroup_attach_task() can increment it again. Because a count of zero
757 * means that no tasks are currently attached, therefore there is no
758 * way a task attached to that cgroup can fork (the other way to
759 * increment the count). So code holding cgroup_mutex can safely
760 * assume that if the count is zero, it will stay zero. Similarly, if
761 * a task holds cgroup_mutex on a cgroup with zero count, it
762 * knows that the cgroup won't be removed, as cgroup_rmdir()
765 * The fork and exit callbacks cgroup_fork() and cgroup_exit(), don't
766 * (usually) take cgroup_mutex. These are the two most performance
767 * critical pieces of code here. The exception occurs on cgroup_exit(),
768 * when a task in a notify_on_release cgroup exits. Then cgroup_mutex
769 * is taken, and if the cgroup count is zero, a usermode call made
770 * to the release agent with the name of the cgroup (path relative to
771 * the root of cgroup file system) as the argument.
773 * A cgroup can only be deleted if both its 'count' of using tasks
774 * is zero, and its list of 'children' cgroups is empty. Since all
775 * tasks in the system use _some_ cgroup, and since there is always at
776 * least one task in the system (init, pid == 1), therefore, top_cgroup
777 * always has either children cgroups and/or using tasks. So we don't
778 * need a special hack to ensure that top_cgroup cannot be deleted.
780 * The task_lock() exception
782 * The need for this exception arises from the action of
783 * cgroup_attach_task(), which overwrites one task's cgroup pointer with
784 * another. It does so using cgroup_mutex, however there are
785 * several performance critical places that need to reference
786 * task->cgroup without the expense of grabbing a system global
787 * mutex. Therefore except as noted below, when dereferencing or, as
788 * in cgroup_attach_task(), modifying a task's cgroup pointer we use
789 * task_lock(), which acts on a spinlock (task->alloc_lock) already in
790 * the task_struct routinely used for such matters.
792 * P.S. One more locking exception. RCU is used to guard the
793 * update of a tasks cgroup pointer by cgroup_attach_task()
797 * cgroup_lock - lock out any changes to cgroup structures
800 void cgroup_lock(void)
802 mutex_lock(&cgroup_mutex);
804 EXPORT_SYMBOL_GPL(cgroup_lock);
807 * cgroup_unlock - release lock on cgroup changes
809 * Undo the lock taken in a previous cgroup_lock() call.
811 void cgroup_unlock(void)
813 mutex_unlock(&cgroup_mutex);
815 EXPORT_SYMBOL_GPL(cgroup_unlock);
818 * A couple of forward declarations required, due to cyclic reference loop:
819 * cgroup_mkdir -> cgroup_create -> cgroup_populate_dir ->
820 * cgroup_add_file -> cgroup_create_file -> cgroup_dir_inode_operations
824 static int cgroup_mkdir(struct inode *dir, struct dentry *dentry, umode_t mode);
825 static struct dentry *cgroup_lookup(struct inode *, struct dentry *, unsigned int);
826 static int cgroup_rmdir(struct inode *unused_dir, struct dentry *dentry);
827 static int cgroup_populate_dir(struct cgroup *cgrp, bool base_files,
828 unsigned long subsys_mask);
829 static const struct inode_operations cgroup_dir_inode_operations;
830 static const struct file_operations proc_cgroupstats_operations;
832 static struct backing_dev_info cgroup_backing_dev_info = {
834 .capabilities = BDI_CAP_NO_ACCT_AND_WRITEBACK,
837 static int alloc_css_id(struct cgroup_subsys *ss,
838 struct cgroup *parent, struct cgroup *child);
840 static struct inode *cgroup_new_inode(umode_t mode, struct super_block *sb)
842 struct inode *inode = new_inode(sb);
845 inode->i_ino = get_next_ino();
846 inode->i_mode = mode;
847 inode->i_uid = current_fsuid();
848 inode->i_gid = current_fsgid();
849 inode->i_atime = inode->i_mtime = inode->i_ctime = CURRENT_TIME;
850 inode->i_mapping->backing_dev_info = &cgroup_backing_dev_info;
855 static void cgroup_free_fn(struct work_struct *work)
857 struct cgroup *cgrp = container_of(work, struct cgroup, free_work);
858 struct cgroup_subsys *ss;
860 mutex_lock(&cgroup_mutex);
862 * Release the subsystem state objects.
864 for_each_subsys(cgrp->root, ss)
867 cgrp->root->number_of_cgroups--;
868 mutex_unlock(&cgroup_mutex);
871 * Drop the active superblock reference that we took when we
874 deactivate_super(cgrp->root->sb);
877 * if we're getting rid of the cgroup, refcount should ensure
878 * that there are no pidlists left.
880 BUG_ON(!list_empty(&cgrp->pidlists));
882 simple_xattrs_free(&cgrp->xattrs);
884 ida_simple_remove(&cgrp->root->cgroup_ida, cgrp->id);
888 static void cgroup_free_rcu(struct rcu_head *head)
890 struct cgroup *cgrp = container_of(head, struct cgroup, rcu_head);
892 schedule_work(&cgrp->free_work);
895 static void cgroup_diput(struct dentry *dentry, struct inode *inode)
897 /* is dentry a directory ? if so, kfree() associated cgroup */
898 if (S_ISDIR(inode->i_mode)) {
899 struct cgroup *cgrp = dentry->d_fsdata;
901 BUG_ON(!(cgroup_is_removed(cgrp)));
902 /* It's possible for external users to be holding css
903 * reference counts on a cgroup; css_put() needs to
904 * be able to access the cgroup after decrementing
905 * the reference count in order to know if it needs to
906 * queue the cgroup to be handled by the release
908 call_rcu(&cgrp->rcu_head, cgroup_free_rcu);
910 struct cfent *cfe = __d_cfe(dentry);
911 struct cgroup *cgrp = dentry->d_parent->d_fsdata;
912 struct cftype *cft = cfe->type;
914 WARN_ONCE(!list_empty(&cfe->node) &&
915 cgrp != &cgrp->root->top_cgroup,
916 "cfe still linked for %s\n", cfe->type->name);
918 simple_xattrs_free(&cft->xattrs);
923 static int cgroup_delete(const struct dentry *d)
928 static void remove_dir(struct dentry *d)
930 struct dentry *parent = dget(d->d_parent);
933 simple_rmdir(parent->d_inode, d);
937 static void cgroup_rm_file(struct cgroup *cgrp, const struct cftype *cft)
941 lockdep_assert_held(&cgrp->dentry->d_inode->i_mutex);
942 lockdep_assert_held(&cgroup_mutex);
945 * If we're doing cleanup due to failure of cgroup_create(),
946 * the corresponding @cfe may not exist.
948 list_for_each_entry(cfe, &cgrp->files, node) {
949 struct dentry *d = cfe->dentry;
951 if (cft && cfe->type != cft)
956 simple_unlink(cgrp->dentry->d_inode, d);
957 list_del_init(&cfe->node);
965 * cgroup_clear_directory - selective removal of base and subsystem files
966 * @dir: directory containing the files
967 * @base_files: true if the base files should be removed
968 * @subsys_mask: mask of the subsystem ids whose files should be removed
970 static void cgroup_clear_directory(struct dentry *dir, bool base_files,
971 unsigned long subsys_mask)
973 struct cgroup *cgrp = __d_cgrp(dir);
974 struct cgroup_subsys *ss;
976 for_each_subsys(cgrp->root, ss) {
977 struct cftype_set *set;
978 if (!test_bit(ss->subsys_id, &subsys_mask))
980 list_for_each_entry(set, &ss->cftsets, node)
981 cgroup_addrm_files(cgrp, NULL, set->cfts, false);
984 while (!list_empty(&cgrp->files))
985 cgroup_rm_file(cgrp, NULL);
990 * NOTE : the dentry must have been dget()'ed
992 static void cgroup_d_remove_dir(struct dentry *dentry)
994 struct dentry *parent;
995 struct cgroupfs_root *root = dentry->d_sb->s_fs_info;
997 cgroup_clear_directory(dentry, true, root->subsys_mask);
999 parent = dentry->d_parent;
1000 spin_lock(&parent->d_lock);
1001 spin_lock_nested(&dentry->d_lock, DENTRY_D_LOCK_NESTED);
1002 list_del_init(&dentry->d_u.d_child);
1003 spin_unlock(&dentry->d_lock);
1004 spin_unlock(&parent->d_lock);
1009 * Call with cgroup_mutex held. Drops reference counts on modules, including
1010 * any duplicate ones that parse_cgroupfs_options took. If this function
1011 * returns an error, no reference counts are touched.
1013 static int rebind_subsystems(struct cgroupfs_root *root,
1014 unsigned long final_subsys_mask)
1016 unsigned long added_mask, removed_mask;
1017 struct cgroup *cgrp = &root->top_cgroup;
1020 BUG_ON(!mutex_is_locked(&cgroup_mutex));
1021 BUG_ON(!mutex_is_locked(&cgroup_root_mutex));
1023 removed_mask = root->actual_subsys_mask & ~final_subsys_mask;
1024 added_mask = final_subsys_mask & ~root->actual_subsys_mask;
1025 /* Check that any added subsystems are currently free */
1026 for (i = 0; i < CGROUP_SUBSYS_COUNT; i++) {
1027 unsigned long bit = 1UL << i;
1028 struct cgroup_subsys *ss = subsys[i];
1029 if (!(bit & added_mask))
1032 * Nobody should tell us to do a subsys that doesn't exist:
1033 * parse_cgroupfs_options should catch that case and refcounts
1034 * ensure that subsystems won't disappear once selected.
1037 if (ss->root != &rootnode) {
1038 /* Subsystem isn't free */
1043 /* Currently we don't handle adding/removing subsystems when
1044 * any child cgroups exist. This is theoretically supportable
1045 * but involves complex error handling, so it's being left until
1047 if (root->number_of_cgroups > 1)
1050 /* Process each subsystem */
1051 for (i = 0; i < CGROUP_SUBSYS_COUNT; i++) {
1052 struct cgroup_subsys *ss = subsys[i];
1053 unsigned long bit = 1UL << i;
1054 if (bit & added_mask) {
1055 /* We're binding this subsystem to this hierarchy */
1057 BUG_ON(cgrp->subsys[i]);
1058 BUG_ON(!dummytop->subsys[i]);
1059 BUG_ON(dummytop->subsys[i]->cgroup != dummytop);
1060 cgrp->subsys[i] = dummytop->subsys[i];
1061 cgrp->subsys[i]->cgroup = cgrp;
1062 list_move(&ss->sibling, &root->subsys_list);
1066 /* refcount was already taken, and we're keeping it */
1067 } else if (bit & removed_mask) {
1068 /* We're removing this subsystem */
1070 BUG_ON(cgrp->subsys[i] != dummytop->subsys[i]);
1071 BUG_ON(cgrp->subsys[i]->cgroup != cgrp);
1074 dummytop->subsys[i]->cgroup = dummytop;
1075 cgrp->subsys[i] = NULL;
1076 subsys[i]->root = &rootnode;
1077 list_move(&ss->sibling, &rootnode.subsys_list);
1078 /* subsystem is now free - drop reference on module */
1079 module_put(ss->module);
1080 } else if (bit & final_subsys_mask) {
1081 /* Subsystem state should already exist */
1083 BUG_ON(!cgrp->subsys[i]);
1085 * a refcount was taken, but we already had one, so
1086 * drop the extra reference.
1088 module_put(ss->module);
1089 #ifdef CONFIG_MODULE_UNLOAD
1090 BUG_ON(ss->module && !module_refcount(ss->module));
1093 /* Subsystem state shouldn't exist */
1094 BUG_ON(cgrp->subsys[i]);
1097 root->subsys_mask = root->actual_subsys_mask = final_subsys_mask;
1102 static int cgroup_show_options(struct seq_file *seq, struct dentry *dentry)
1104 struct cgroupfs_root *root = dentry->d_sb->s_fs_info;
1105 struct cgroup_subsys *ss;
1107 mutex_lock(&cgroup_root_mutex);
1108 for_each_subsys(root, ss)
1109 seq_printf(seq, ",%s", ss->name);
1110 if (test_bit(ROOT_NOPREFIX, &root->flags))
1111 seq_puts(seq, ",noprefix");
1112 if (test_bit(ROOT_XATTR, &root->flags))
1113 seq_puts(seq, ",xattr");
1114 if (strlen(root->release_agent_path))
1115 seq_printf(seq, ",release_agent=%s", root->release_agent_path);
1116 if (test_bit(CGRP_CPUSET_CLONE_CHILDREN, &root->top_cgroup.flags))
1117 seq_puts(seq, ",clone_children");
1118 if (strlen(root->name))
1119 seq_printf(seq, ",name=%s", root->name);
1120 mutex_unlock(&cgroup_root_mutex);
1124 struct cgroup_sb_opts {
1125 unsigned long subsys_mask;
1126 unsigned long flags;
1127 char *release_agent;
1128 bool cpuset_clone_children;
1130 /* User explicitly requested empty subsystem */
1133 struct cgroupfs_root *new_root;
1138 * Convert a hierarchy specifier into a bitmask of subsystems and flags. Call
1139 * with cgroup_mutex held to protect the subsys[] array. This function takes
1140 * refcounts on subsystems to be used, unless it returns error, in which case
1141 * no refcounts are taken.
1143 static int parse_cgroupfs_options(char *data, struct cgroup_sb_opts *opts)
1145 char *token, *o = data;
1146 bool all_ss = false, one_ss = false;
1147 unsigned long mask = (unsigned long)-1;
1149 bool module_pin_failed = false;
1151 BUG_ON(!mutex_is_locked(&cgroup_mutex));
1153 #ifdef CONFIG_CPUSETS
1154 mask = ~(1UL << cpuset_subsys_id);
1157 memset(opts, 0, sizeof(*opts));
1159 while ((token = strsep(&o, ",")) != NULL) {
1162 if (!strcmp(token, "none")) {
1163 /* Explicitly have no subsystems */
1167 if (!strcmp(token, "all")) {
1168 /* Mutually exclusive option 'all' + subsystem name */
1174 if (!strcmp(token, "noprefix")) {
1175 set_bit(ROOT_NOPREFIX, &opts->flags);
1178 if (!strcmp(token, "clone_children")) {
1179 opts->cpuset_clone_children = true;
1182 if (!strcmp(token, "xattr")) {
1183 set_bit(ROOT_XATTR, &opts->flags);
1186 if (!strncmp(token, "release_agent=", 14)) {
1187 /* Specifying two release agents is forbidden */
1188 if (opts->release_agent)
1190 opts->release_agent =
1191 kstrndup(token + 14, PATH_MAX - 1, GFP_KERNEL);
1192 if (!opts->release_agent)
1196 if (!strncmp(token, "name=", 5)) {
1197 const char *name = token + 5;
1198 /* Can't specify an empty name */
1201 /* Must match [\w.-]+ */
1202 for (i = 0; i < strlen(name); i++) {
1206 if ((c == '.') || (c == '-') || (c == '_'))
1210 /* Specifying two names is forbidden */
1213 opts->name = kstrndup(name,
1214 MAX_CGROUP_ROOT_NAMELEN - 1,
1222 for (i = 0; i < CGROUP_SUBSYS_COUNT; i++) {
1223 struct cgroup_subsys *ss = subsys[i];
1226 if (strcmp(token, ss->name))
1231 /* Mutually exclusive option 'all' + subsystem name */
1234 set_bit(i, &opts->subsys_mask);
1239 if (i == CGROUP_SUBSYS_COUNT)
1244 * If the 'all' option was specified select all the subsystems,
1245 * otherwise if 'none', 'name=' and a subsystem name options
1246 * were not specified, let's default to 'all'
1248 if (all_ss || (!one_ss && !opts->none && !opts->name)) {
1249 for (i = 0; i < CGROUP_SUBSYS_COUNT; i++) {
1250 struct cgroup_subsys *ss = subsys[i];
1255 set_bit(i, &opts->subsys_mask);
1259 /* Consistency checks */
1262 * Option noprefix was introduced just for backward compatibility
1263 * with the old cpuset, so we allow noprefix only if mounting just
1264 * the cpuset subsystem.
1266 if (test_bit(ROOT_NOPREFIX, &opts->flags) &&
1267 (opts->subsys_mask & mask))
1271 /* Can't specify "none" and some subsystems */
1272 if (opts->subsys_mask && opts->none)
1276 * We either have to specify by name or by subsystems. (So all
1277 * empty hierarchies must have a name).
1279 if (!opts->subsys_mask && !opts->name)
1283 * Grab references on all the modules we'll need, so the subsystems
1284 * don't dance around before rebind_subsystems attaches them. This may
1285 * take duplicate reference counts on a subsystem that's already used,
1286 * but rebind_subsystems handles this case.
1288 for (i = 0; i < CGROUP_SUBSYS_COUNT; i++) {
1289 unsigned long bit = 1UL << i;
1291 if (!(bit & opts->subsys_mask))
1293 if (!try_module_get(subsys[i]->module)) {
1294 module_pin_failed = true;
1298 if (module_pin_failed) {
1300 * oops, one of the modules was going away. this means that we
1301 * raced with a module_delete call, and to the user this is
1302 * essentially a "subsystem doesn't exist" case.
1304 for (i--; i >= 0; i--) {
1305 /* drop refcounts only on the ones we took */
1306 unsigned long bit = 1UL << i;
1308 if (!(bit & opts->subsys_mask))
1310 module_put(subsys[i]->module);
1318 static void drop_parsed_module_refcounts(unsigned long subsys_mask)
1321 for (i = 0; i < CGROUP_SUBSYS_COUNT; i++) {
1322 unsigned long bit = 1UL << i;
1324 if (!(bit & subsys_mask))
1326 module_put(subsys[i]->module);
1330 static int cgroup_remount(struct super_block *sb, int *flags, char *data)
1333 struct cgroupfs_root *root = sb->s_fs_info;
1334 struct cgroup *cgrp = &root->top_cgroup;
1335 struct cgroup_sb_opts opts;
1336 unsigned long added_mask, removed_mask;
1338 mutex_lock(&cgrp->dentry->d_inode->i_mutex);
1339 mutex_lock(&cgroup_mutex);
1340 mutex_lock(&cgroup_root_mutex);
1342 /* See what subsystems are wanted */
1343 ret = parse_cgroupfs_options(data, &opts);
1347 if (opts.subsys_mask != root->actual_subsys_mask || opts.release_agent)
1348 pr_warning("cgroup: option changes via remount are deprecated (pid=%d comm=%s)\n",
1349 task_tgid_nr(current), current->comm);
1351 added_mask = opts.subsys_mask & ~root->subsys_mask;
1352 removed_mask = root->subsys_mask & ~opts.subsys_mask;
1354 /* Don't allow flags or name to change at remount */
1355 if (opts.flags != root->flags ||
1356 (opts.name && strcmp(opts.name, root->name))) {
1358 drop_parsed_module_refcounts(opts.subsys_mask);
1363 * Clear out the files of subsystems that should be removed, do
1364 * this before rebind_subsystems, since rebind_subsystems may
1365 * change this hierarchy's subsys_list.
1367 cgroup_clear_directory(cgrp->dentry, false, removed_mask);
1369 ret = rebind_subsystems(root, opts.subsys_mask);
1371 /* rebind_subsystems failed, re-populate the removed files */
1372 cgroup_populate_dir(cgrp, false, removed_mask);
1373 drop_parsed_module_refcounts(opts.subsys_mask);
1377 /* re-populate subsystem files */
1378 cgroup_populate_dir(cgrp, false, added_mask);
1380 if (opts.release_agent)
1381 strcpy(root->release_agent_path, opts.release_agent);
1383 kfree(opts.release_agent);
1385 mutex_unlock(&cgroup_root_mutex);
1386 mutex_unlock(&cgroup_mutex);
1387 mutex_unlock(&cgrp->dentry->d_inode->i_mutex);
1391 static const struct super_operations cgroup_ops = {
1392 .statfs = simple_statfs,
1393 .drop_inode = generic_delete_inode,
1394 .show_options = cgroup_show_options,
1395 .remount_fs = cgroup_remount,
1398 static void init_cgroup_housekeeping(struct cgroup *cgrp)
1400 INIT_LIST_HEAD(&cgrp->sibling);
1401 INIT_LIST_HEAD(&cgrp->children);
1402 INIT_LIST_HEAD(&cgrp->files);
1403 INIT_LIST_HEAD(&cgrp->css_sets);
1404 INIT_LIST_HEAD(&cgrp->allcg_node);
1405 INIT_LIST_HEAD(&cgrp->release_list);
1406 INIT_LIST_HEAD(&cgrp->pidlists);
1407 INIT_WORK(&cgrp->free_work, cgroup_free_fn);
1408 mutex_init(&cgrp->pidlist_mutex);
1409 INIT_LIST_HEAD(&cgrp->event_list);
1410 spin_lock_init(&cgrp->event_list_lock);
1411 simple_xattrs_init(&cgrp->xattrs);
1414 static void init_cgroup_root(struct cgroupfs_root *root)
1416 struct cgroup *cgrp = &root->top_cgroup;
1418 INIT_LIST_HEAD(&root->subsys_list);
1419 INIT_LIST_HEAD(&root->root_list);
1420 INIT_LIST_HEAD(&root->allcg_list);
1421 root->number_of_cgroups = 1;
1423 cgrp->top_cgroup = cgrp;
1424 init_cgroup_housekeeping(cgrp);
1425 list_add_tail(&cgrp->allcg_node, &root->allcg_list);
1428 static bool init_root_id(struct cgroupfs_root *root)
1433 if (!ida_pre_get(&hierarchy_ida, GFP_KERNEL))
1435 spin_lock(&hierarchy_id_lock);
1436 /* Try to allocate the next unused ID */
1437 ret = ida_get_new_above(&hierarchy_ida, next_hierarchy_id,
1438 &root->hierarchy_id);
1440 /* Try again starting from 0 */
1441 ret = ida_get_new(&hierarchy_ida, &root->hierarchy_id);
1443 next_hierarchy_id = root->hierarchy_id + 1;
1444 } else if (ret != -EAGAIN) {
1445 /* Can only get here if the 31-bit IDR is full ... */
1448 spin_unlock(&hierarchy_id_lock);
1453 static int cgroup_test_super(struct super_block *sb, void *data)
1455 struct cgroup_sb_opts *opts = data;
1456 struct cgroupfs_root *root = sb->s_fs_info;
1458 /* If we asked for a name then it must match */
1459 if (opts->name && strcmp(opts->name, root->name))
1463 * If we asked for subsystems (or explicitly for no
1464 * subsystems) then they must match
1466 if ((opts->subsys_mask || opts->none)
1467 && (opts->subsys_mask != root->subsys_mask))
1473 static struct cgroupfs_root *cgroup_root_from_opts(struct cgroup_sb_opts *opts)
1475 struct cgroupfs_root *root;
1477 if (!opts->subsys_mask && !opts->none)
1480 root = kzalloc(sizeof(*root), GFP_KERNEL);
1482 return ERR_PTR(-ENOMEM);
1484 if (!init_root_id(root)) {
1486 return ERR_PTR(-ENOMEM);
1488 init_cgroup_root(root);
1490 root->subsys_mask = opts->subsys_mask;
1491 root->flags = opts->flags;
1492 ida_init(&root->cgroup_ida);
1493 if (opts->release_agent)
1494 strcpy(root->release_agent_path, opts->release_agent);
1496 strcpy(root->name, opts->name);
1497 if (opts->cpuset_clone_children)
1498 set_bit(CGRP_CPUSET_CLONE_CHILDREN, &root->top_cgroup.flags);
1502 static void cgroup_drop_root(struct cgroupfs_root *root)
1507 BUG_ON(!root->hierarchy_id);
1508 spin_lock(&hierarchy_id_lock);
1509 ida_remove(&hierarchy_ida, root->hierarchy_id);
1510 spin_unlock(&hierarchy_id_lock);
1511 ida_destroy(&root->cgroup_ida);
1515 static int cgroup_set_super(struct super_block *sb, void *data)
1518 struct cgroup_sb_opts *opts = data;
1520 /* If we don't have a new root, we can't set up a new sb */
1521 if (!opts->new_root)
1524 BUG_ON(!opts->subsys_mask && !opts->none);
1526 ret = set_anon_super(sb, NULL);
1530 sb->s_fs_info = opts->new_root;
1531 opts->new_root->sb = sb;
1533 sb->s_blocksize = PAGE_CACHE_SIZE;
1534 sb->s_blocksize_bits = PAGE_CACHE_SHIFT;
1535 sb->s_magic = CGROUP_SUPER_MAGIC;
1536 sb->s_op = &cgroup_ops;
1541 static int cgroup_get_rootdir(struct super_block *sb)
1543 static const struct dentry_operations cgroup_dops = {
1544 .d_iput = cgroup_diput,
1545 .d_delete = cgroup_delete,
1548 struct inode *inode =
1549 cgroup_new_inode(S_IFDIR | S_IRUGO | S_IXUGO | S_IWUSR, sb);
1554 inode->i_fop = &simple_dir_operations;
1555 inode->i_op = &cgroup_dir_inode_operations;
1556 /* directories start off with i_nlink == 2 (for "." entry) */
1558 sb->s_root = d_make_root(inode);
1561 /* for everything else we want ->d_op set */
1562 sb->s_d_op = &cgroup_dops;
1566 static struct dentry *cgroup_mount(struct file_system_type *fs_type,
1567 int flags, const char *unused_dev_name,
1570 struct cgroup_sb_opts opts;
1571 struct cgroupfs_root *root;
1573 struct super_block *sb;
1574 struct cgroupfs_root *new_root;
1575 struct inode *inode;
1577 /* First find the desired set of subsystems */
1578 mutex_lock(&cgroup_mutex);
1579 ret = parse_cgroupfs_options(data, &opts);
1580 mutex_unlock(&cgroup_mutex);
1585 * Allocate a new cgroup root. We may not need it if we're
1586 * reusing an existing hierarchy.
1588 new_root = cgroup_root_from_opts(&opts);
1589 if (IS_ERR(new_root)) {
1590 ret = PTR_ERR(new_root);
1593 opts.new_root = new_root;
1595 /* Locate an existing or new sb for this hierarchy */
1596 sb = sget(fs_type, cgroup_test_super, cgroup_set_super, 0, &opts);
1599 cgroup_drop_root(opts.new_root);
1603 root = sb->s_fs_info;
1605 if (root == opts.new_root) {
1606 /* We used the new root structure, so this is a new hierarchy */
1607 struct list_head tmp_cg_links;
1608 struct cgroup *root_cgrp = &root->top_cgroup;
1609 struct cgroupfs_root *existing_root;
1610 const struct cred *cred;
1612 struct hlist_node *node;
1615 BUG_ON(sb->s_root != NULL);
1617 ret = cgroup_get_rootdir(sb);
1619 goto drop_new_super;
1620 inode = sb->s_root->d_inode;
1622 mutex_lock(&inode->i_mutex);
1623 mutex_lock(&cgroup_mutex);
1624 mutex_lock(&cgroup_root_mutex);
1626 /* Check for name clashes with existing mounts */
1628 if (strlen(root->name))
1629 for_each_active_root(existing_root)
1630 if (!strcmp(existing_root->name, root->name))
1634 * We're accessing css_set_count without locking
1635 * css_set_lock here, but that's OK - it can only be
1636 * increased by someone holding cgroup_lock, and
1637 * that's us. The worst that can happen is that we
1638 * have some link structures left over
1640 ret = allocate_cg_links(css_set_count, &tmp_cg_links);
1644 ret = rebind_subsystems(root, root->subsys_mask);
1645 if (ret == -EBUSY) {
1646 free_cg_links(&tmp_cg_links);
1650 * There must be no failure case after here, since rebinding
1651 * takes care of subsystems' refcounts, which are explicitly
1652 * dropped in the failure exit path.
1655 /* EBUSY should be the only error here */
1658 list_add(&root->root_list, &roots);
1661 sb->s_root->d_fsdata = root_cgrp;
1662 root->top_cgroup.dentry = sb->s_root;
1664 /* Link the top cgroup in this hierarchy into all
1665 * the css_set objects */
1666 write_lock(&css_set_lock);
1667 hash_for_each(css_set_table, i, node, cg, hlist)
1668 link_css_set(&tmp_cg_links, cg, root_cgrp);
1669 write_unlock(&css_set_lock);
1671 free_cg_links(&tmp_cg_links);
1673 BUG_ON(!list_empty(&root_cgrp->children));
1674 BUG_ON(root->number_of_cgroups != 1);
1676 cred = override_creds(&init_cred);
1677 cgroup_populate_dir(root_cgrp, true, root->subsys_mask);
1679 mutex_unlock(&cgroup_root_mutex);
1680 mutex_unlock(&cgroup_mutex);
1681 mutex_unlock(&inode->i_mutex);
1684 * We re-used an existing hierarchy - the new root (if
1685 * any) is not needed
1687 cgroup_drop_root(opts.new_root);
1688 /* no subsys rebinding, so refcounts don't change */
1689 drop_parsed_module_refcounts(opts.subsys_mask);
1692 kfree(opts.release_agent);
1694 return dget(sb->s_root);
1697 mutex_unlock(&cgroup_root_mutex);
1698 mutex_unlock(&cgroup_mutex);
1699 mutex_unlock(&inode->i_mutex);
1701 deactivate_locked_super(sb);
1703 drop_parsed_module_refcounts(opts.subsys_mask);
1705 kfree(opts.release_agent);
1707 return ERR_PTR(ret);
1710 static void cgroup_kill_sb(struct super_block *sb) {
1711 struct cgroupfs_root *root = sb->s_fs_info;
1712 struct cgroup *cgrp = &root->top_cgroup;
1714 struct cg_cgroup_link *link;
1715 struct cg_cgroup_link *saved_link;
1719 BUG_ON(root->number_of_cgroups != 1);
1720 BUG_ON(!list_empty(&cgrp->children));
1722 mutex_lock(&cgroup_mutex);
1723 mutex_lock(&cgroup_root_mutex);
1725 /* Rebind all subsystems back to the default hierarchy */
1726 ret = rebind_subsystems(root, 0);
1727 /* Shouldn't be able to fail ... */
1731 * Release all the links from css_sets to this hierarchy's
1734 write_lock(&css_set_lock);
1736 list_for_each_entry_safe(link, saved_link, &cgrp->css_sets,
1738 list_del(&link->cg_link_list);
1739 list_del(&link->cgrp_link_list);
1742 write_unlock(&css_set_lock);
1744 if (!list_empty(&root->root_list)) {
1745 list_del(&root->root_list);
1749 mutex_unlock(&cgroup_root_mutex);
1750 mutex_unlock(&cgroup_mutex);
1752 simple_xattrs_free(&cgrp->xattrs);
1754 kill_litter_super(sb);
1755 cgroup_drop_root(root);
1758 static struct file_system_type cgroup_fs_type = {
1760 .mount = cgroup_mount,
1761 .kill_sb = cgroup_kill_sb,
1764 static struct kobject *cgroup_kobj;
1767 * cgroup_path - generate the path of a cgroup
1768 * @cgrp: the cgroup in question
1769 * @buf: the buffer to write the path into
1770 * @buflen: the length of the buffer
1772 * Called with cgroup_mutex held or else with an RCU-protected cgroup
1773 * reference. Writes path of cgroup into buf. Returns 0 on success,
1776 int cgroup_path(const struct cgroup *cgrp, char *buf, int buflen)
1778 struct dentry *dentry = cgrp->dentry;
1781 rcu_lockdep_assert(rcu_read_lock_held() || cgroup_lock_is_held(),
1782 "cgroup_path() called without proper locking");
1784 if (cgrp == dummytop) {
1786 * Inactive subsystems have no dentry for their root
1793 start = buf + buflen - 1;
1797 int len = dentry->d_name.len;
1799 if ((start -= len) < buf)
1800 return -ENAMETOOLONG;
1801 memcpy(start, dentry->d_name.name, len);
1802 cgrp = cgrp->parent;
1806 dentry = cgrp->dentry;
1810 return -ENAMETOOLONG;
1813 memmove(buf, start, buf + buflen - start);
1816 EXPORT_SYMBOL_GPL(cgroup_path);
1819 * Control Group taskset
1821 struct task_and_cgroup {
1822 struct task_struct *task;
1823 struct cgroup *cgrp;
1827 struct cgroup_taskset {
1828 struct task_and_cgroup single;
1829 struct flex_array *tc_array;
1832 struct cgroup *cur_cgrp;
1836 * cgroup_taskset_first - reset taskset and return the first task
1837 * @tset: taskset of interest
1839 * @tset iteration is initialized and the first task is returned.
1841 struct task_struct *cgroup_taskset_first(struct cgroup_taskset *tset)
1843 if (tset->tc_array) {
1845 return cgroup_taskset_next(tset);
1847 tset->cur_cgrp = tset->single.cgrp;
1848 return tset->single.task;
1851 EXPORT_SYMBOL_GPL(cgroup_taskset_first);
1854 * cgroup_taskset_next - iterate to the next task in taskset
1855 * @tset: taskset of interest
1857 * Return the next task in @tset. Iteration must have been initialized
1858 * with cgroup_taskset_first().
1860 struct task_struct *cgroup_taskset_next(struct cgroup_taskset *tset)
1862 struct task_and_cgroup *tc;
1864 if (!tset->tc_array || tset->idx >= tset->tc_array_len)
1867 tc = flex_array_get(tset->tc_array, tset->idx++);
1868 tset->cur_cgrp = tc->cgrp;
1871 EXPORT_SYMBOL_GPL(cgroup_taskset_next);
1874 * cgroup_taskset_cur_cgroup - return the matching cgroup for the current task
1875 * @tset: taskset of interest
1877 * Return the cgroup for the current (last returned) task of @tset. This
1878 * function must be preceded by either cgroup_taskset_first() or
1879 * cgroup_taskset_next().
1881 struct cgroup *cgroup_taskset_cur_cgroup(struct cgroup_taskset *tset)
1883 return tset->cur_cgrp;
1885 EXPORT_SYMBOL_GPL(cgroup_taskset_cur_cgroup);
1888 * cgroup_taskset_size - return the number of tasks in taskset
1889 * @tset: taskset of interest
1891 int cgroup_taskset_size(struct cgroup_taskset *tset)
1893 return tset->tc_array ? tset->tc_array_len : 1;
1895 EXPORT_SYMBOL_GPL(cgroup_taskset_size);
1899 * cgroup_task_migrate - move a task from one cgroup to another.
1901 * Must be called with cgroup_mutex and threadgroup locked.
1903 static void cgroup_task_migrate(struct cgroup *cgrp, struct cgroup *oldcgrp,
1904 struct task_struct *tsk, struct css_set *newcg)
1906 struct css_set *oldcg;
1909 * We are synchronized through threadgroup_lock() against PF_EXITING
1910 * setting such that we can't race against cgroup_exit() changing the
1911 * css_set to init_css_set and dropping the old one.
1913 WARN_ON_ONCE(tsk->flags & PF_EXITING);
1914 oldcg = tsk->cgroups;
1917 rcu_assign_pointer(tsk->cgroups, newcg);
1920 /* Update the css_set linked lists if we're using them */
1921 write_lock(&css_set_lock);
1922 if (!list_empty(&tsk->cg_list))
1923 list_move(&tsk->cg_list, &newcg->tasks);
1924 write_unlock(&css_set_lock);
1927 * We just gained a reference on oldcg by taking it from the task. As
1928 * trading it for newcg is protected by cgroup_mutex, we're safe to drop
1929 * it here; it will be freed under RCU.
1931 set_bit(CGRP_RELEASABLE, &oldcgrp->flags);
1936 * cgroup_attach_task - attach task 'tsk' to cgroup 'cgrp'
1937 * @cgrp: the cgroup the task is attaching to
1938 * @tsk: the task to be attached
1940 * Call with cgroup_mutex and threadgroup locked. May take task_lock of
1943 int cgroup_attach_task(struct cgroup *cgrp, struct task_struct *tsk)
1946 struct cgroup_subsys *ss, *failed_ss = NULL;
1947 struct cgroup *oldcgrp;
1948 struct cgroupfs_root *root = cgrp->root;
1949 struct cgroup_taskset tset = { };
1950 struct css_set *newcg;
1952 /* @tsk either already exited or can't exit until the end */
1953 if (tsk->flags & PF_EXITING)
1956 /* Nothing to do if the task is already in that cgroup */
1957 oldcgrp = task_cgroup_from_root(tsk, root);
1958 if (cgrp == oldcgrp)
1961 tset.single.task = tsk;
1962 tset.single.cgrp = oldcgrp;
1964 for_each_subsys(root, ss) {
1965 if (ss->can_attach) {
1966 retval = ss->can_attach(cgrp, &tset);
1969 * Remember on which subsystem the can_attach()
1970 * failed, so that we only call cancel_attach()
1971 * against the subsystems whose can_attach()
1972 * succeeded. (See below)
1980 newcg = find_css_set(tsk->cgroups, cgrp);
1986 cgroup_task_migrate(cgrp, oldcgrp, tsk, newcg);
1988 for_each_subsys(root, ss) {
1990 ss->attach(cgrp, &tset);
1995 for_each_subsys(root, ss) {
1996 if (ss == failed_ss)
1998 * This subsystem was the one that failed the
1999 * can_attach() check earlier, so we don't need
2000 * to call cancel_attach() against it or any
2001 * remaining subsystems.
2004 if (ss->cancel_attach)
2005 ss->cancel_attach(cgrp, &tset);
2012 * cgroup_attach_task_all - attach task 'tsk' to all cgroups of task 'from'
2013 * @from: attach to all cgroups of a given task
2014 * @tsk: the task to be attached
2016 int cgroup_attach_task_all(struct task_struct *from, struct task_struct *tsk)
2018 struct cgroupfs_root *root;
2022 for_each_active_root(root) {
2023 struct cgroup *from_cg = task_cgroup_from_root(from, root);
2025 retval = cgroup_attach_task(from_cg, tsk);
2033 EXPORT_SYMBOL_GPL(cgroup_attach_task_all);
2036 * cgroup_attach_proc - attach all threads in a threadgroup to a cgroup
2037 * @cgrp: the cgroup to attach to
2038 * @leader: the threadgroup leader task_struct of the group to be attached
2040 * Call holding cgroup_mutex and the group_rwsem of the leader. Will take
2041 * task_lock of each thread in leader's threadgroup individually in turn.
2043 static int cgroup_attach_proc(struct cgroup *cgrp, struct task_struct *leader)
2045 int retval, i, group_size;
2046 struct cgroup_subsys *ss, *failed_ss = NULL;
2047 /* guaranteed to be initialized later, but the compiler needs this */
2048 struct cgroupfs_root *root = cgrp->root;
2049 /* threadgroup list cursor and array */
2050 struct task_struct *tsk;
2051 struct task_and_cgroup *tc;
2052 struct flex_array *group;
2053 struct cgroup_taskset tset = { };
2056 * step 0: in order to do expensive, possibly blocking operations for
2057 * every thread, we cannot iterate the thread group list, since it needs
2058 * rcu or tasklist locked. instead, build an array of all threads in the
2059 * group - group_rwsem prevents new threads from appearing, and if
2060 * threads exit, this will just be an over-estimate.
2062 group_size = get_nr_threads(leader);
2063 /* flex_array supports very large thread-groups better than kmalloc. */
2064 group = flex_array_alloc(sizeof(*tc), group_size, GFP_KERNEL);
2067 /* pre-allocate to guarantee space while iterating in rcu read-side. */
2068 retval = flex_array_prealloc(group, 0, group_size - 1, GFP_KERNEL);
2070 goto out_free_group_list;
2075 * Prevent freeing of tasks while we take a snapshot. Tasks that are
2076 * already PF_EXITING could be freed from underneath us unless we
2077 * take an rcu_read_lock.
2081 struct task_and_cgroup ent;
2083 /* @tsk either already exited or can't exit until the end */
2084 if (tsk->flags & PF_EXITING)
2087 /* as per above, nr_threads may decrease, but not increase. */
2088 BUG_ON(i >= group_size);
2090 ent.cgrp = task_cgroup_from_root(tsk, root);
2091 /* nothing to do if this task is already in the cgroup */
2092 if (ent.cgrp == cgrp)
2095 * saying GFP_ATOMIC has no effect here because we did prealloc
2096 * earlier, but it's good form to communicate our expectations.
2098 retval = flex_array_put(group, i, &ent, GFP_ATOMIC);
2099 BUG_ON(retval != 0);
2101 } while_each_thread(leader, tsk);
2103 /* remember the number of threads in the array for later. */
2105 tset.tc_array = group;
2106 tset.tc_array_len = group_size;
2108 /* methods shouldn't be called if no task is actually migrating */
2111 goto out_free_group_list;
2114 * step 1: check that we can legitimately attach to the cgroup.
2116 for_each_subsys(root, ss) {
2117 if (ss->can_attach) {
2118 retval = ss->can_attach(cgrp, &tset);
2121 goto out_cancel_attach;
2127 * step 2: make sure css_sets exist for all threads to be migrated.
2128 * we use find_css_set, which allocates a new one if necessary.
2130 for (i = 0; i < group_size; i++) {
2131 tc = flex_array_get(group, i);
2132 tc->cg = find_css_set(tc->task->cgroups, cgrp);
2135 goto out_put_css_set_refs;
2140 * step 3: now that we're guaranteed success wrt the css_sets,
2141 * proceed to move all tasks to the new cgroup. There are no
2142 * failure cases after here, so this is the commit point.
2144 for (i = 0; i < group_size; i++) {
2145 tc = flex_array_get(group, i);
2146 cgroup_task_migrate(cgrp, tc->cgrp, tc->task, tc->cg);
2148 /* nothing is sensitive to fork() after this point. */
2151 * step 4: do subsystem attach callbacks.
2153 for_each_subsys(root, ss) {
2155 ss->attach(cgrp, &tset);
2159 * step 5: success! and cleanup
2162 out_put_css_set_refs:
2164 for (i = 0; i < group_size; i++) {
2165 tc = flex_array_get(group, i);
2168 put_css_set(tc->cg);
2173 for_each_subsys(root, ss) {
2174 if (ss == failed_ss)
2176 if (ss->cancel_attach)
2177 ss->cancel_attach(cgrp, &tset);
2180 out_free_group_list:
2181 flex_array_free(group);
2186 * Find the task_struct of the task to attach by vpid and pass it along to the
2187 * function to attach either it or all tasks in its threadgroup. Will lock
2188 * cgroup_mutex and threadgroup; may take task_lock of task.
2190 static int attach_task_by_pid(struct cgroup *cgrp, u64 pid, bool threadgroup)
2192 struct task_struct *tsk;
2193 const struct cred *cred = current_cred(), *tcred;
2196 if (!cgroup_lock_live_group(cgrp))
2202 tsk = find_task_by_vpid(pid);
2206 goto out_unlock_cgroup;
2209 * even if we're attaching all tasks in the thread group, we
2210 * only need to check permissions on one of them.
2212 tcred = __task_cred(tsk);
2213 if (!uid_eq(cred->euid, GLOBAL_ROOT_UID) &&
2214 !uid_eq(cred->euid, tcred->uid) &&
2215 !uid_eq(cred->euid, tcred->suid)) {
2218 goto out_unlock_cgroup;
2224 tsk = tsk->group_leader;
2227 * Workqueue threads may acquire PF_THREAD_BOUND and become
2228 * trapped in a cpuset, or RT worker may be born in a cgroup
2229 * with no rt_runtime allocated. Just say no.
2231 if (tsk == kthreadd_task || (tsk->flags & PF_THREAD_BOUND)) {
2234 goto out_unlock_cgroup;
2237 get_task_struct(tsk);
2240 threadgroup_lock(tsk);
2242 if (!thread_group_leader(tsk)) {
2244 * a race with de_thread from another thread's exec()
2245 * may strip us of our leadership, if this happens,
2246 * there is no choice but to throw this task away and
2247 * try again; this is
2248 * "double-double-toil-and-trouble-check locking".
2250 threadgroup_unlock(tsk);
2251 put_task_struct(tsk);
2252 goto retry_find_task;
2254 ret = cgroup_attach_proc(cgrp, tsk);
2256 ret = cgroup_attach_task(cgrp, tsk);
2257 threadgroup_unlock(tsk);
2259 put_task_struct(tsk);
2265 static int cgroup_tasks_write(struct cgroup *cgrp, struct cftype *cft, u64 pid)
2267 return attach_task_by_pid(cgrp, pid, false);
2270 static int cgroup_procs_write(struct cgroup *cgrp, struct cftype *cft, u64 tgid)
2272 return attach_task_by_pid(cgrp, tgid, true);
2276 * cgroup_lock_live_group - take cgroup_mutex and check that cgrp is alive.
2277 * @cgrp: the cgroup to be checked for liveness
2279 * On success, returns true; the lock should be later released with
2280 * cgroup_unlock(). On failure returns false with no lock held.
2282 bool cgroup_lock_live_group(struct cgroup *cgrp)
2284 mutex_lock(&cgroup_mutex);
2285 if (cgroup_is_removed(cgrp)) {
2286 mutex_unlock(&cgroup_mutex);
2291 EXPORT_SYMBOL_GPL(cgroup_lock_live_group);
2293 static int cgroup_release_agent_write(struct cgroup *cgrp, struct cftype *cft,
2296 BUILD_BUG_ON(sizeof(cgrp->root->release_agent_path) < PATH_MAX);
2297 if (strlen(buffer) >= PATH_MAX)
2299 if (!cgroup_lock_live_group(cgrp))
2301 mutex_lock(&cgroup_root_mutex);
2302 strcpy(cgrp->root->release_agent_path, buffer);
2303 mutex_unlock(&cgroup_root_mutex);
2308 static int cgroup_release_agent_show(struct cgroup *cgrp, struct cftype *cft,
2309 struct seq_file *seq)
2311 if (!cgroup_lock_live_group(cgrp))
2313 seq_puts(seq, cgrp->root->release_agent_path);
2314 seq_putc(seq, '\n');
2319 /* A buffer size big enough for numbers or short strings */
2320 #define CGROUP_LOCAL_BUFFER_SIZE 64
2322 static ssize_t cgroup_write_X64(struct cgroup *cgrp, struct cftype *cft,
2324 const char __user *userbuf,
2325 size_t nbytes, loff_t *unused_ppos)
2327 char buffer[CGROUP_LOCAL_BUFFER_SIZE];
2333 if (nbytes >= sizeof(buffer))
2335 if (copy_from_user(buffer, userbuf, nbytes))
2338 buffer[nbytes] = 0; /* nul-terminate */
2339 if (cft->write_u64) {
2340 u64 val = simple_strtoull(strstrip(buffer), &end, 0);
2343 retval = cft->write_u64(cgrp, cft, val);
2345 s64 val = simple_strtoll(strstrip(buffer), &end, 0);
2348 retval = cft->write_s64(cgrp, cft, val);
2355 static ssize_t cgroup_write_string(struct cgroup *cgrp, struct cftype *cft,
2357 const char __user *userbuf,
2358 size_t nbytes, loff_t *unused_ppos)
2360 char local_buffer[CGROUP_LOCAL_BUFFER_SIZE];
2362 size_t max_bytes = cft->max_write_len;
2363 char *buffer = local_buffer;
2366 max_bytes = sizeof(local_buffer) - 1;
2367 if (nbytes >= max_bytes)
2369 /* Allocate a dynamic buffer if we need one */
2370 if (nbytes >= sizeof(local_buffer)) {
2371 buffer = kmalloc(nbytes + 1, GFP_KERNEL);
2375 if (nbytes && copy_from_user(buffer, userbuf, nbytes)) {
2380 buffer[nbytes] = 0; /* nul-terminate */
2381 retval = cft->write_string(cgrp, cft, strstrip(buffer));
2385 if (buffer != local_buffer)
2390 static ssize_t cgroup_file_write(struct file *file, const char __user *buf,
2391 size_t nbytes, loff_t *ppos)
2393 struct cftype *cft = __d_cft(file->f_dentry);
2394 struct cgroup *cgrp = __d_cgrp(file->f_dentry->d_parent);
2396 if (cgroup_is_removed(cgrp))
2399 return cft->write(cgrp, cft, file, buf, nbytes, ppos);
2400 if (cft->write_u64 || cft->write_s64)
2401 return cgroup_write_X64(cgrp, cft, file, buf, nbytes, ppos);
2402 if (cft->write_string)
2403 return cgroup_write_string(cgrp, cft, file, buf, nbytes, ppos);
2405 int ret = cft->trigger(cgrp, (unsigned int)cft->private);
2406 return ret ? ret : nbytes;
2411 static ssize_t cgroup_read_u64(struct cgroup *cgrp, struct cftype *cft,
2413 char __user *buf, size_t nbytes,
2416 char tmp[CGROUP_LOCAL_BUFFER_SIZE];
2417 u64 val = cft->read_u64(cgrp, cft);
2418 int len = sprintf(tmp, "%llu\n", (unsigned long long) val);
2420 return simple_read_from_buffer(buf, nbytes, ppos, tmp, len);
2423 static ssize_t cgroup_read_s64(struct cgroup *cgrp, struct cftype *cft,
2425 char __user *buf, size_t nbytes,
2428 char tmp[CGROUP_LOCAL_BUFFER_SIZE];
2429 s64 val = cft->read_s64(cgrp, cft);
2430 int len = sprintf(tmp, "%lld\n", (long long) val);
2432 return simple_read_from_buffer(buf, nbytes, ppos, tmp, len);
2435 static ssize_t cgroup_file_read(struct file *file, char __user *buf,
2436 size_t nbytes, loff_t *ppos)
2438 struct cftype *cft = __d_cft(file->f_dentry);
2439 struct cgroup *cgrp = __d_cgrp(file->f_dentry->d_parent);
2441 if (cgroup_is_removed(cgrp))
2445 return cft->read(cgrp, cft, file, buf, nbytes, ppos);
2447 return cgroup_read_u64(cgrp, cft, file, buf, nbytes, ppos);
2449 return cgroup_read_s64(cgrp, cft, file, buf, nbytes, ppos);
2454 * seqfile ops/methods for returning structured data. Currently just
2455 * supports string->u64 maps, but can be extended in future.
2458 struct cgroup_seqfile_state {
2460 struct cgroup *cgroup;
2463 static int cgroup_map_add(struct cgroup_map_cb *cb, const char *key, u64 value)
2465 struct seq_file *sf = cb->state;
2466 return seq_printf(sf, "%s %llu\n", key, (unsigned long long)value);
2469 static int cgroup_seqfile_show(struct seq_file *m, void *arg)
2471 struct cgroup_seqfile_state *state = m->private;
2472 struct cftype *cft = state->cft;
2473 if (cft->read_map) {
2474 struct cgroup_map_cb cb = {
2475 .fill = cgroup_map_add,
2478 return cft->read_map(state->cgroup, cft, &cb);
2480 return cft->read_seq_string(state->cgroup, cft, m);
2483 static int cgroup_seqfile_release(struct inode *inode, struct file *file)
2485 struct seq_file *seq = file->private_data;
2486 kfree(seq->private);
2487 return single_release(inode, file);
2490 static const struct file_operations cgroup_seqfile_operations = {
2492 .write = cgroup_file_write,
2493 .llseek = seq_lseek,
2494 .release = cgroup_seqfile_release,
2497 static int cgroup_file_open(struct inode *inode, struct file *file)
2502 err = generic_file_open(inode, file);
2505 cft = __d_cft(file->f_dentry);
2507 if (cft->read_map || cft->read_seq_string) {
2508 struct cgroup_seqfile_state *state =
2509 kzalloc(sizeof(*state), GFP_USER);
2513 state->cgroup = __d_cgrp(file->f_dentry->d_parent);
2514 file->f_op = &cgroup_seqfile_operations;
2515 err = single_open(file, cgroup_seqfile_show, state);
2518 } else if (cft->open)
2519 err = cft->open(inode, file);
2526 static int cgroup_file_release(struct inode *inode, struct file *file)
2528 struct cftype *cft = __d_cft(file->f_dentry);
2530 return cft->release(inode, file);
2535 * cgroup_rename - Only allow simple rename of directories in place.
2537 static int cgroup_rename(struct inode *old_dir, struct dentry *old_dentry,
2538 struct inode *new_dir, struct dentry *new_dentry)
2540 if (!S_ISDIR(old_dentry->d_inode->i_mode))
2542 if (new_dentry->d_inode)
2544 if (old_dir != new_dir)
2546 return simple_rename(old_dir, old_dentry, new_dir, new_dentry);
2549 static struct simple_xattrs *__d_xattrs(struct dentry *dentry)
2551 if (S_ISDIR(dentry->d_inode->i_mode))
2552 return &__d_cgrp(dentry)->xattrs;
2554 return &__d_cft(dentry)->xattrs;
2557 static inline int xattr_enabled(struct dentry *dentry)
2559 struct cgroupfs_root *root = dentry->d_sb->s_fs_info;
2560 return test_bit(ROOT_XATTR, &root->flags);
2563 static bool is_valid_xattr(const char *name)
2565 if (!strncmp(name, XATTR_TRUSTED_PREFIX, XATTR_TRUSTED_PREFIX_LEN) ||
2566 !strncmp(name, XATTR_SECURITY_PREFIX, XATTR_SECURITY_PREFIX_LEN))
2571 static int cgroup_setxattr(struct dentry *dentry, const char *name,
2572 const void *val, size_t size, int flags)
2574 if (!xattr_enabled(dentry))
2576 if (!is_valid_xattr(name))
2578 return simple_xattr_set(__d_xattrs(dentry), name, val, size, flags);
2581 static int cgroup_removexattr(struct dentry *dentry, const char *name)
2583 if (!xattr_enabled(dentry))
2585 if (!is_valid_xattr(name))
2587 return simple_xattr_remove(__d_xattrs(dentry), name);
2590 static ssize_t cgroup_getxattr(struct dentry *dentry, const char *name,
2591 void *buf, size_t size)
2593 if (!xattr_enabled(dentry))
2595 if (!is_valid_xattr(name))
2597 return simple_xattr_get(__d_xattrs(dentry), name, buf, size);
2600 static ssize_t cgroup_listxattr(struct dentry *dentry, char *buf, size_t size)
2602 if (!xattr_enabled(dentry))
2604 return simple_xattr_list(__d_xattrs(dentry), buf, size);
2607 static const struct file_operations cgroup_file_operations = {
2608 .read = cgroup_file_read,
2609 .write = cgroup_file_write,
2610 .llseek = generic_file_llseek,
2611 .open = cgroup_file_open,
2612 .release = cgroup_file_release,
2615 static const struct inode_operations cgroup_file_inode_operations = {
2616 .setxattr = cgroup_setxattr,
2617 .getxattr = cgroup_getxattr,
2618 .listxattr = cgroup_listxattr,
2619 .removexattr = cgroup_removexattr,
2622 static const struct inode_operations cgroup_dir_inode_operations = {
2623 .lookup = cgroup_lookup,
2624 .mkdir = cgroup_mkdir,
2625 .rmdir = cgroup_rmdir,
2626 .rename = cgroup_rename,
2627 .setxattr = cgroup_setxattr,
2628 .getxattr = cgroup_getxattr,
2629 .listxattr = cgroup_listxattr,
2630 .removexattr = cgroup_removexattr,
2633 static struct dentry *cgroup_lookup(struct inode *dir, struct dentry *dentry, unsigned int flags)
2635 if (dentry->d_name.len > NAME_MAX)
2636 return ERR_PTR(-ENAMETOOLONG);
2637 d_add(dentry, NULL);
2642 * Check if a file is a control file
2644 static inline struct cftype *__file_cft(struct file *file)
2646 if (file->f_dentry->d_inode->i_fop != &cgroup_file_operations)
2647 return ERR_PTR(-EINVAL);
2648 return __d_cft(file->f_dentry);
2651 static int cgroup_create_file(struct dentry *dentry, umode_t mode,
2652 struct super_block *sb)
2654 struct inode *inode;
2658 if (dentry->d_inode)
2661 inode = cgroup_new_inode(mode, sb);
2665 if (S_ISDIR(mode)) {
2666 inode->i_op = &cgroup_dir_inode_operations;
2667 inode->i_fop = &simple_dir_operations;
2669 /* start off with i_nlink == 2 (for "." entry) */
2671 inc_nlink(dentry->d_parent->d_inode);
2674 * Control reaches here with cgroup_mutex held.
2675 * @inode->i_mutex should nest outside cgroup_mutex but we
2676 * want to populate it immediately without releasing
2677 * cgroup_mutex. As @inode isn't visible to anyone else
2678 * yet, trylock will always succeed without affecting
2681 WARN_ON_ONCE(!mutex_trylock(&inode->i_mutex));
2682 } else if (S_ISREG(mode)) {
2684 inode->i_fop = &cgroup_file_operations;
2685 inode->i_op = &cgroup_file_inode_operations;
2687 d_instantiate(dentry, inode);
2688 dget(dentry); /* Extra count - pin the dentry in core */
2693 * cgroup_file_mode - deduce file mode of a control file
2694 * @cft: the control file in question
2696 * returns cft->mode if ->mode is not 0
2697 * returns S_IRUGO|S_IWUSR if it has both a read and a write handler
2698 * returns S_IRUGO if it has only a read handler
2699 * returns S_IWUSR if it has only a write hander
2701 static umode_t cgroup_file_mode(const struct cftype *cft)
2708 if (cft->read || cft->read_u64 || cft->read_s64 ||
2709 cft->read_map || cft->read_seq_string)
2712 if (cft->write || cft->write_u64 || cft->write_s64 ||
2713 cft->write_string || cft->trigger)
2719 static int cgroup_add_file(struct cgroup *cgrp, struct cgroup_subsys *subsys,
2722 struct dentry *dir = cgrp->dentry;
2723 struct cgroup *parent = __d_cgrp(dir);
2724 struct dentry *dentry;
2728 char name[MAX_CGROUP_TYPE_NAMELEN + MAX_CFTYPE_NAME + 2] = { 0 };
2730 simple_xattrs_init(&cft->xattrs);
2732 if (subsys && !test_bit(ROOT_NOPREFIX, &cgrp->root->flags)) {
2733 strcpy(name, subsys->name);
2736 strcat(name, cft->name);
2738 BUG_ON(!mutex_is_locked(&dir->d_inode->i_mutex));
2740 cfe = kzalloc(sizeof(*cfe), GFP_KERNEL);
2744 dentry = lookup_one_len(name, dir, strlen(name));
2745 if (IS_ERR(dentry)) {
2746 error = PTR_ERR(dentry);
2750 mode = cgroup_file_mode(cft);
2751 error = cgroup_create_file(dentry, mode | S_IFREG, cgrp->root->sb);
2753 cfe->type = (void *)cft;
2754 cfe->dentry = dentry;
2755 dentry->d_fsdata = cfe;
2756 list_add_tail(&cfe->node, &parent->files);
2765 static int cgroup_addrm_files(struct cgroup *cgrp, struct cgroup_subsys *subsys,
2766 struct cftype cfts[], bool is_add)
2771 for (cft = cfts; cft->name[0] != '\0'; cft++) {
2772 /* does cft->flags tell us to skip this file on @cgrp? */
2773 if ((cft->flags & CFTYPE_NOT_ON_ROOT) && !cgrp->parent)
2775 if ((cft->flags & CFTYPE_ONLY_ON_ROOT) && cgrp->parent)
2779 err = cgroup_add_file(cgrp, subsys, cft);
2781 pr_warn("cgroup_addrm_files: failed to add %s, err=%d\n",
2785 cgroup_rm_file(cgrp, cft);
2791 static DEFINE_MUTEX(cgroup_cft_mutex);
2793 static void cgroup_cfts_prepare(void)
2794 __acquires(&cgroup_cft_mutex) __acquires(&cgroup_mutex)
2797 * Thanks to the entanglement with vfs inode locking, we can't walk
2798 * the existing cgroups under cgroup_mutex and create files.
2799 * Instead, we increment reference on all cgroups and build list of
2800 * them using @cgrp->cft_q_node. Grab cgroup_cft_mutex to ensure
2801 * exclusive access to the field.
2803 mutex_lock(&cgroup_cft_mutex);
2804 mutex_lock(&cgroup_mutex);
2807 static void cgroup_cfts_commit(struct cgroup_subsys *ss,
2808 struct cftype *cfts, bool is_add)
2809 __releases(&cgroup_mutex) __releases(&cgroup_cft_mutex)
2812 struct cgroup *cgrp, *n;
2814 /* %NULL @cfts indicates abort and don't bother if @ss isn't attached */
2815 if (cfts && ss->root != &rootnode) {
2816 list_for_each_entry(cgrp, &ss->root->allcg_list, allcg_node) {
2818 list_add_tail(&cgrp->cft_q_node, &pending);
2822 mutex_unlock(&cgroup_mutex);
2825 * All new cgroups will see @cfts update on @ss->cftsets. Add/rm
2826 * files for all cgroups which were created before.
2828 list_for_each_entry_safe(cgrp, n, &pending, cft_q_node) {
2829 struct inode *inode = cgrp->dentry->d_inode;
2831 mutex_lock(&inode->i_mutex);
2832 mutex_lock(&cgroup_mutex);
2833 if (!cgroup_is_removed(cgrp))
2834 cgroup_addrm_files(cgrp, ss, cfts, is_add);
2835 mutex_unlock(&cgroup_mutex);
2836 mutex_unlock(&inode->i_mutex);
2838 list_del_init(&cgrp->cft_q_node);
2842 mutex_unlock(&cgroup_cft_mutex);
2846 * cgroup_add_cftypes - add an array of cftypes to a subsystem
2847 * @ss: target cgroup subsystem
2848 * @cfts: zero-length name terminated array of cftypes
2850 * Register @cfts to @ss. Files described by @cfts are created for all
2851 * existing cgroups to which @ss is attached and all future cgroups will
2852 * have them too. This function can be called anytime whether @ss is
2855 * Returns 0 on successful registration, -errno on failure. Note that this
2856 * function currently returns 0 as long as @cfts registration is successful
2857 * even if some file creation attempts on existing cgroups fail.
2859 int cgroup_add_cftypes(struct cgroup_subsys *ss, struct cftype *cfts)
2861 struct cftype_set *set;
2863 set = kzalloc(sizeof(*set), GFP_KERNEL);
2867 cgroup_cfts_prepare();
2869 list_add_tail(&set->node, &ss->cftsets);
2870 cgroup_cfts_commit(ss, cfts, true);
2874 EXPORT_SYMBOL_GPL(cgroup_add_cftypes);
2877 * cgroup_rm_cftypes - remove an array of cftypes from a subsystem
2878 * @ss: target cgroup subsystem
2879 * @cfts: zero-length name terminated array of cftypes
2881 * Unregister @cfts from @ss. Files described by @cfts are removed from
2882 * all existing cgroups to which @ss is attached and all future cgroups
2883 * won't have them either. This function can be called anytime whether @ss
2884 * is attached or not.
2886 * Returns 0 on successful unregistration, -ENOENT if @cfts is not
2887 * registered with @ss.
2889 int cgroup_rm_cftypes(struct cgroup_subsys *ss, struct cftype *cfts)
2891 struct cftype_set *set;
2893 cgroup_cfts_prepare();
2895 list_for_each_entry(set, &ss->cftsets, node) {
2896 if (set->cfts == cfts) {
2897 list_del_init(&set->node);
2898 cgroup_cfts_commit(ss, cfts, false);
2903 cgroup_cfts_commit(ss, NULL, false);
2908 * cgroup_task_count - count the number of tasks in a cgroup.
2909 * @cgrp: the cgroup in question
2911 * Return the number of tasks in the cgroup.
2913 int cgroup_task_count(const struct cgroup *cgrp)
2916 struct cg_cgroup_link *link;
2918 read_lock(&css_set_lock);
2919 list_for_each_entry(link, &cgrp->css_sets, cgrp_link_list) {
2920 count += atomic_read(&link->cg->refcount);
2922 read_unlock(&css_set_lock);
2927 * Advance a list_head iterator. The iterator should be positioned at
2928 * the start of a css_set
2930 static void cgroup_advance_iter(struct cgroup *cgrp,
2931 struct cgroup_iter *it)
2933 struct list_head *l = it->cg_link;
2934 struct cg_cgroup_link *link;
2937 /* Advance to the next non-empty css_set */
2940 if (l == &cgrp->css_sets) {
2944 link = list_entry(l, struct cg_cgroup_link, cgrp_link_list);
2946 } while (list_empty(&cg->tasks));
2948 it->task = cg->tasks.next;
2952 * To reduce the fork() overhead for systems that are not actually
2953 * using their cgroups capability, we don't maintain the lists running
2954 * through each css_set to its tasks until we see the list actually
2955 * used - in other words after the first call to cgroup_iter_start().
2957 static void cgroup_enable_task_cg_lists(void)
2959 struct task_struct *p, *g;
2960 write_lock(&css_set_lock);
2961 use_task_css_set_links = 1;
2963 * We need tasklist_lock because RCU is not safe against
2964 * while_each_thread(). Besides, a forking task that has passed
2965 * cgroup_post_fork() without seeing use_task_css_set_links = 1
2966 * is not guaranteed to have its child immediately visible in the
2967 * tasklist if we walk through it with RCU.
2969 read_lock(&tasklist_lock);
2970 do_each_thread(g, p) {
2973 * We should check if the process is exiting, otherwise
2974 * it will race with cgroup_exit() in that the list
2975 * entry won't be deleted though the process has exited.
2977 if (!(p->flags & PF_EXITING) && list_empty(&p->cg_list))
2978 list_add(&p->cg_list, &p->cgroups->tasks);
2980 } while_each_thread(g, p);
2981 read_unlock(&tasklist_lock);
2982 write_unlock(&css_set_lock);
2986 * cgroup_next_descendant_pre - find the next descendant for pre-order walk
2987 * @pos: the current position (%NULL to initiate traversal)
2988 * @cgroup: cgroup whose descendants to walk
2990 * To be used by cgroup_for_each_descendant_pre(). Find the next
2991 * descendant to visit for pre-order traversal of @cgroup's descendants.
2993 struct cgroup *cgroup_next_descendant_pre(struct cgroup *pos,
2994 struct cgroup *cgroup)
2996 struct cgroup *next;
2998 WARN_ON_ONCE(!rcu_read_lock_held());
3000 /* if first iteration, pretend we just visited @cgroup */
3002 if (list_empty(&cgroup->children))
3007 /* visit the first child if exists */
3008 next = list_first_or_null_rcu(&pos->children, struct cgroup, sibling);
3012 /* no child, visit my or the closest ancestor's next sibling */
3014 next = list_entry_rcu(pos->sibling.next, struct cgroup,
3016 if (&next->sibling != &pos->parent->children)
3020 } while (pos != cgroup);
3024 EXPORT_SYMBOL_GPL(cgroup_next_descendant_pre);
3027 * cgroup_rightmost_descendant - return the rightmost descendant of a cgroup
3028 * @pos: cgroup of interest
3030 * Return the rightmost descendant of @pos. If there's no descendant,
3031 * @pos is returned. This can be used during pre-order traversal to skip
3034 struct cgroup *cgroup_rightmost_descendant(struct cgroup *pos)
3036 struct cgroup *last, *tmp;
3038 WARN_ON_ONCE(!rcu_read_lock_held());
3042 /* ->prev isn't RCU safe, walk ->next till the end */
3044 list_for_each_entry_rcu(tmp, &last->children, sibling)
3050 EXPORT_SYMBOL_GPL(cgroup_rightmost_descendant);
3052 static struct cgroup *cgroup_leftmost_descendant(struct cgroup *pos)
3054 struct cgroup *last;
3058 pos = list_first_or_null_rcu(&pos->children, struct cgroup,
3066 * cgroup_next_descendant_post - find the next descendant for post-order walk
3067 * @pos: the current position (%NULL to initiate traversal)
3068 * @cgroup: cgroup whose descendants to walk
3070 * To be used by cgroup_for_each_descendant_post(). Find the next
3071 * descendant to visit for post-order traversal of @cgroup's descendants.
3073 struct cgroup *cgroup_next_descendant_post(struct cgroup *pos,
3074 struct cgroup *cgroup)
3076 struct cgroup *next;
3078 WARN_ON_ONCE(!rcu_read_lock_held());
3080 /* if first iteration, visit the leftmost descendant */
3082 next = cgroup_leftmost_descendant(cgroup);
3083 return next != cgroup ? next : NULL;
3086 /* if there's an unvisited sibling, visit its leftmost descendant */
3087 next = list_entry_rcu(pos->sibling.next, struct cgroup, sibling);
3088 if (&next->sibling != &pos->parent->children)
3089 return cgroup_leftmost_descendant(next);
3091 /* no sibling left, visit parent */
3093 return next != cgroup ? next : NULL;
3095 EXPORT_SYMBOL_GPL(cgroup_next_descendant_post);
3097 void cgroup_iter_start(struct cgroup *cgrp, struct cgroup_iter *it)
3098 __acquires(css_set_lock)
3101 * The first time anyone tries to iterate across a cgroup,
3102 * we need to enable the list linking each css_set to its
3103 * tasks, and fix up all existing tasks.
3105 if (!use_task_css_set_links)
3106 cgroup_enable_task_cg_lists();
3108 read_lock(&css_set_lock);
3109 it->cg_link = &cgrp->css_sets;
3110 cgroup_advance_iter(cgrp, it);
3113 struct task_struct *cgroup_iter_next(struct cgroup *cgrp,
3114 struct cgroup_iter *it)
3116 struct task_struct *res;
3117 struct list_head *l = it->task;
3118 struct cg_cgroup_link *link;
3120 /* If the iterator cg is NULL, we have no tasks */
3123 res = list_entry(l, struct task_struct, cg_list);
3124 /* Advance iterator to find next entry */
3126 link = list_entry(it->cg_link, struct cg_cgroup_link, cgrp_link_list);
3127 if (l == &link->cg->tasks) {
3128 /* We reached the end of this task list - move on to
3129 * the next cg_cgroup_link */
3130 cgroup_advance_iter(cgrp, it);
3137 void cgroup_iter_end(struct cgroup *cgrp, struct cgroup_iter *it)
3138 __releases(css_set_lock)
3140 read_unlock(&css_set_lock);
3143 static inline int started_after_time(struct task_struct *t1,
3144 struct timespec *time,
3145 struct task_struct *t2)
3147 int start_diff = timespec_compare(&t1->start_time, time);
3148 if (start_diff > 0) {
3150 } else if (start_diff < 0) {
3154 * Arbitrarily, if two processes started at the same
3155 * time, we'll say that the lower pointer value
3156 * started first. Note that t2 may have exited by now
3157 * so this may not be a valid pointer any longer, but
3158 * that's fine - it still serves to distinguish
3159 * between two tasks started (effectively) simultaneously.
3166 * This function is a callback from heap_insert() and is used to order
3168 * In this case we order the heap in descending task start time.
3170 static inline int started_after(void *p1, void *p2)
3172 struct task_struct *t1 = p1;
3173 struct task_struct *t2 = p2;
3174 return started_after_time(t1, &t2->start_time, t2);
3178 * cgroup_scan_tasks - iterate though all the tasks in a cgroup
3179 * @scan: struct cgroup_scanner containing arguments for the scan
3181 * Arguments include pointers to callback functions test_task() and
3183 * Iterate through all the tasks in a cgroup, calling test_task() for each,
3184 * and if it returns true, call process_task() for it also.
3185 * The test_task pointer may be NULL, meaning always true (select all tasks).
3186 * Effectively duplicates cgroup_iter_{start,next,end}()
3187 * but does not lock css_set_lock for the call to process_task().
3188 * The struct cgroup_scanner may be embedded in any structure of the caller's
3190 * It is guaranteed that process_task() will act on every task that
3191 * is a member of the cgroup for the duration of this call. This
3192 * function may or may not call process_task() for tasks that exit
3193 * or move to a different cgroup during the call, or are forked or
3194 * move into the cgroup during the call.
3196 * Note that test_task() may be called with locks held, and may in some
3197 * situations be called multiple times for the same task, so it should
3199 * If the heap pointer in the struct cgroup_scanner is non-NULL, a heap has been
3200 * pre-allocated and will be used for heap operations (and its "gt" member will
3201 * be overwritten), else a temporary heap will be used (allocation of which
3202 * may cause this function to fail).
3204 int cgroup_scan_tasks(struct cgroup_scanner *scan)
3207 struct cgroup_iter it;
3208 struct task_struct *p, *dropped;
3209 /* Never dereference latest_task, since it's not refcounted */
3210 struct task_struct *latest_task = NULL;
3211 struct ptr_heap tmp_heap;
3212 struct ptr_heap *heap;
3213 struct timespec latest_time = { 0, 0 };
3216 /* The caller supplied our heap and pre-allocated its memory */
3218 heap->gt = &started_after;
3220 /* We need to allocate our own heap memory */
3222 retval = heap_init(heap, PAGE_SIZE, GFP_KERNEL, &started_after);
3224 /* cannot allocate the heap */
3230 * Scan tasks in the cgroup, using the scanner's "test_task" callback
3231 * to determine which are of interest, and using the scanner's
3232 * "process_task" callback to process any of them that need an update.
3233 * Since we don't want to hold any locks during the task updates,
3234 * gather tasks to be processed in a heap structure.
3235 * The heap is sorted by descending task start time.
3236 * If the statically-sized heap fills up, we overflow tasks that
3237 * started later, and in future iterations only consider tasks that
3238 * started after the latest task in the previous pass. This
3239 * guarantees forward progress and that we don't miss any tasks.
3242 cgroup_iter_start(scan->cg, &it);
3243 while ((p = cgroup_iter_next(scan->cg, &it))) {
3245 * Only affect tasks that qualify per the caller's callback,
3246 * if he provided one
3248 if (scan->test_task && !scan->test_task(p, scan))
3251 * Only process tasks that started after the last task
3254 if (!started_after_time(p, &latest_time, latest_task))
3256 dropped = heap_insert(heap, p);
3257 if (dropped == NULL) {
3259 * The new task was inserted; the heap wasn't
3263 } else if (dropped != p) {
3265 * The new task was inserted, and pushed out a
3269 put_task_struct(dropped);
3272 * Else the new task was newer than anything already in
3273 * the heap and wasn't inserted
3276 cgroup_iter_end(scan->cg, &it);
3279 for (i = 0; i < heap->size; i++) {
3280 struct task_struct *q = heap->ptrs[i];
3282 latest_time = q->start_time;
3285 /* Process the task per the caller's callback */
3286 scan->process_task(q, scan);
3290 * If we had to process any tasks at all, scan again
3291 * in case some of them were in the middle of forking
3292 * children that didn't get processed.
3293 * Not the most efficient way to do it, but it avoids
3294 * having to take callback_mutex in the fork path
3298 if (heap == &tmp_heap)
3299 heap_free(&tmp_heap);
3304 * Stuff for reading the 'tasks'/'procs' files.
3306 * Reading this file can return large amounts of data if a cgroup has
3307 * *lots* of attached tasks. So it may need several calls to read(),
3308 * but we cannot guarantee that the information we produce is correct
3309 * unless we produce it entirely atomically.
3313 /* which pidlist file are we talking about? */
3314 enum cgroup_filetype {
3320 * A pidlist is a list of pids that virtually represents the contents of one
3321 * of the cgroup files ("procs" or "tasks"). We keep a list of such pidlists,
3322 * a pair (one each for procs, tasks) for each pid namespace that's relevant
3325 struct cgroup_pidlist {
3327 * used to find which pidlist is wanted. doesn't change as long as
3328 * this particular list stays in the list.
3330 struct { enum cgroup_filetype type; struct pid_namespace *ns; } key;
3333 /* how many elements the above list has */
3335 /* how many files are using the current array */
3337 /* each of these stored in a list by its cgroup */
3338 struct list_head links;
3339 /* pointer to the cgroup we belong to, for list removal purposes */
3340 struct cgroup *owner;
3341 /* protects the other fields */
3342 struct rw_semaphore mutex;
3346 * The following two functions "fix" the issue where there are more pids
3347 * than kmalloc will give memory for; in such cases, we use vmalloc/vfree.
3348 * TODO: replace with a kernel-wide solution to this problem
3350 #define PIDLIST_TOO_LARGE(c) ((c) * sizeof(pid_t) > (PAGE_SIZE * 2))
3351 static void *pidlist_allocate(int count)
3353 if (PIDLIST_TOO_LARGE(count))
3354 return vmalloc(count * sizeof(pid_t));
3356 return kmalloc(count * sizeof(pid_t), GFP_KERNEL);
3358 static void pidlist_free(void *p)
3360 if (is_vmalloc_addr(p))
3365 static void *pidlist_resize(void *p, int newcount)
3368 /* note: if new alloc fails, old p will still be valid either way */
3369 if (is_vmalloc_addr(p)) {
3370 newlist = vmalloc(newcount * sizeof(pid_t));
3373 memcpy(newlist, p, newcount * sizeof(pid_t));
3376 newlist = krealloc(p, newcount * sizeof(pid_t), GFP_KERNEL);
3382 * pidlist_uniq - given a kmalloc()ed list, strip out all duplicate entries
3383 * If the new stripped list is sufficiently smaller and there's enough memory
3384 * to allocate a new buffer, will let go of the unneeded memory. Returns the
3385 * number of unique elements.
3387 /* is the size difference enough that we should re-allocate the array? */
3388 #define PIDLIST_REALLOC_DIFFERENCE(old, new) ((old) - PAGE_SIZE >= (new))
3389 static int pidlist_uniq(pid_t **p, int length)
3396 * we presume the 0th element is unique, so i starts at 1. trivial
3397 * edge cases first; no work needs to be done for either
3399 if (length == 0 || length == 1)
3401 /* src and dest walk down the list; dest counts unique elements */
3402 for (src = 1; src < length; src++) {
3403 /* find next unique element */
3404 while (list[src] == list[src-1]) {
3409 /* dest always points to where the next unique element goes */
3410 list[dest] = list[src];
3415 * if the length difference is large enough, we want to allocate a
3416 * smaller buffer to save memory. if this fails due to out of memory,
3417 * we'll just stay with what we've got.
3419 if (PIDLIST_REALLOC_DIFFERENCE(length, dest)) {
3420 newlist = pidlist_resize(list, dest);
3427 static int cmppid(const void *a, const void *b)
3429 return *(pid_t *)a - *(pid_t *)b;
3433 * find the appropriate pidlist for our purpose (given procs vs tasks)
3434 * returns with the lock on that pidlist already held, and takes care
3435 * of the use count, or returns NULL with no locks held if we're out of
3438 static struct cgroup_pidlist *cgroup_pidlist_find(struct cgroup *cgrp,
3439 enum cgroup_filetype type)
3441 struct cgroup_pidlist *l;
3442 /* don't need task_nsproxy() if we're looking at ourself */
3443 struct pid_namespace *ns = task_active_pid_ns(current);
3446 * We can't drop the pidlist_mutex before taking the l->mutex in case
3447 * the last ref-holder is trying to remove l from the list at the same
3448 * time. Holding the pidlist_mutex precludes somebody taking whichever
3449 * list we find out from under us - compare release_pid_array().
3451 mutex_lock(&cgrp->pidlist_mutex);
3452 list_for_each_entry(l, &cgrp->pidlists, links) {
3453 if (l->key.type == type && l->key.ns == ns) {
3454 /* make sure l doesn't vanish out from under us */
3455 down_write(&l->mutex);
3456 mutex_unlock(&cgrp->pidlist_mutex);
3460 /* entry not found; create a new one */
3461 l = kmalloc(sizeof(struct cgroup_pidlist), GFP_KERNEL);
3463 mutex_unlock(&cgrp->pidlist_mutex);
3466 init_rwsem(&l->mutex);
3467 down_write(&l->mutex);
3469 l->key.ns = get_pid_ns(ns);
3470 l->use_count = 0; /* don't increment here */
3473 list_add(&l->links, &cgrp->pidlists);
3474 mutex_unlock(&cgrp->pidlist_mutex);
3479 * Load a cgroup's pidarray with either procs' tgids or tasks' pids
3481 static int pidlist_array_load(struct cgroup *cgrp, enum cgroup_filetype type,
3482 struct cgroup_pidlist **lp)
3486 int pid, n = 0; /* used for populating the array */
3487 struct cgroup_iter it;
3488 struct task_struct *tsk;
3489 struct cgroup_pidlist *l;
3492 * If cgroup gets more users after we read count, we won't have
3493 * enough space - tough. This race is indistinguishable to the
3494 * caller from the case that the additional cgroup users didn't
3495 * show up until sometime later on.
3497 length = cgroup_task_count(cgrp);
3498 array = pidlist_allocate(length);
3501 /* now, populate the array */
3502 cgroup_iter_start(cgrp, &it);
3503 while ((tsk = cgroup_iter_next(cgrp, &it))) {
3504 if (unlikely(n == length))
3506 /* get tgid or pid for procs or tasks file respectively */
3507 if (type == CGROUP_FILE_PROCS)
3508 pid = task_tgid_vnr(tsk);
3510 pid = task_pid_vnr(tsk);
3511 if (pid > 0) /* make sure to only use valid results */
3514 cgroup_iter_end(cgrp, &it);
3516 /* now sort & (if procs) strip out duplicates */
3517 sort(array, length, sizeof(pid_t), cmppid, NULL);
3518 if (type == CGROUP_FILE_PROCS)
3519 length = pidlist_uniq(&array, length);
3520 l = cgroup_pidlist_find(cgrp, type);
3522 pidlist_free(array);
3525 /* store array, freeing old if necessary - lock already held */
3526 pidlist_free(l->list);
3530 up_write(&l->mutex);
3536 * cgroupstats_build - build and fill cgroupstats
3537 * @stats: cgroupstats to fill information into
3538 * @dentry: A dentry entry belonging to the cgroup for which stats have
3541 * Build and fill cgroupstats so that taskstats can export it to user
3544 int cgroupstats_build(struct cgroupstats *stats, struct dentry *dentry)
3547 struct cgroup *cgrp;
3548 struct cgroup_iter it;
3549 struct task_struct *tsk;
3552 * Validate dentry by checking the superblock operations,
3553 * and make sure it's a directory.
3555 if (dentry->d_sb->s_op != &cgroup_ops ||
3556 !S_ISDIR(dentry->d_inode->i_mode))
3560 cgrp = dentry->d_fsdata;
3562 cgroup_iter_start(cgrp, &it);
3563 while ((tsk = cgroup_iter_next(cgrp, &it))) {
3564 switch (tsk->state) {
3566 stats->nr_running++;
3568 case TASK_INTERRUPTIBLE:
3569 stats->nr_sleeping++;
3571 case TASK_UNINTERRUPTIBLE:
3572 stats->nr_uninterruptible++;
3575 stats->nr_stopped++;
3578 if (delayacct_is_task_waiting_on_io(tsk))
3579 stats->nr_io_wait++;
3583 cgroup_iter_end(cgrp, &it);
3591 * seq_file methods for the tasks/procs files. The seq_file position is the
3592 * next pid to display; the seq_file iterator is a pointer to the pid
3593 * in the cgroup->l->list array.
3596 static void *cgroup_pidlist_start(struct seq_file *s, loff_t *pos)
3599 * Initially we receive a position value that corresponds to
3600 * one more than the last pid shown (or 0 on the first call or
3601 * after a seek to the start). Use a binary-search to find the
3602 * next pid to display, if any
3604 struct cgroup_pidlist *l = s->private;
3605 int index = 0, pid = *pos;
3608 down_read(&l->mutex);
3610 int end = l->length;
3612 while (index < end) {
3613 int mid = (index + end) / 2;
3614 if (l->list[mid] == pid) {
3617 } else if (l->list[mid] <= pid)
3623 /* If we're off the end of the array, we're done */
3624 if (index >= l->length)
3626 /* Update the abstract position to be the actual pid that we found */
3627 iter = l->list + index;
3632 static void cgroup_pidlist_stop(struct seq_file *s, void *v)
3634 struct cgroup_pidlist *l = s->private;
3638 static void *cgroup_pidlist_next(struct seq_file *s, void *v, loff_t *pos)
3640 struct cgroup_pidlist *l = s->private;
3642 pid_t *end = l->list + l->length;
3644 * Advance to the next pid in the array. If this goes off the
3656 static int cgroup_pidlist_show(struct seq_file *s, void *v)
3658 return seq_printf(s, "%d\n", *(int *)v);
3662 * seq_operations functions for iterating on pidlists through seq_file -
3663 * independent of whether it's tasks or procs
3665 static const struct seq_operations cgroup_pidlist_seq_operations = {
3666 .start = cgroup_pidlist_start,
3667 .stop = cgroup_pidlist_stop,
3668 .next = cgroup_pidlist_next,
3669 .show = cgroup_pidlist_show,
3672 static void cgroup_release_pid_array(struct cgroup_pidlist *l)
3675 * the case where we're the last user of this particular pidlist will
3676 * have us remove it from the cgroup's list, which entails taking the
3677 * mutex. since in pidlist_find the pidlist->lock depends on cgroup->
3678 * pidlist_mutex, we have to take pidlist_mutex first.
3680 mutex_lock(&l->owner->pidlist_mutex);
3681 down_write(&l->mutex);
3682 BUG_ON(!l->use_count);
3683 if (!--l->use_count) {
3684 /* we're the last user if refcount is 0; remove and free */
3685 list_del(&l->links);
3686 mutex_unlock(&l->owner->pidlist_mutex);
3687 pidlist_free(l->list);
3688 put_pid_ns(l->key.ns);
3689 up_write(&l->mutex);
3693 mutex_unlock(&l->owner->pidlist_mutex);
3694 up_write(&l->mutex);
3697 static int cgroup_pidlist_release(struct inode *inode, struct file *file)
3699 struct cgroup_pidlist *l;
3700 if (!(file->f_mode & FMODE_READ))
3703 * the seq_file will only be initialized if the file was opened for
3704 * reading; hence we check if it's not null only in that case.
3706 l = ((struct seq_file *)file->private_data)->private;
3707 cgroup_release_pid_array(l);
3708 return seq_release(inode, file);
3711 static const struct file_operations cgroup_pidlist_operations = {
3713 .llseek = seq_lseek,
3714 .write = cgroup_file_write,
3715 .release = cgroup_pidlist_release,
3719 * The following functions handle opens on a file that displays a pidlist
3720 * (tasks or procs). Prepare an array of the process/thread IDs of whoever's
3723 /* helper function for the two below it */
3724 static int cgroup_pidlist_open(struct file *file, enum cgroup_filetype type)
3726 struct cgroup *cgrp = __d_cgrp(file->f_dentry->d_parent);
3727 struct cgroup_pidlist *l;
3730 /* Nothing to do for write-only files */
3731 if (!(file->f_mode & FMODE_READ))
3734 /* have the array populated */
3735 retval = pidlist_array_load(cgrp, type, &l);
3738 /* configure file information */
3739 file->f_op = &cgroup_pidlist_operations;
3741 retval = seq_open(file, &cgroup_pidlist_seq_operations);
3743 cgroup_release_pid_array(l);
3746 ((struct seq_file *)file->private_data)->private = l;
3749 static int cgroup_tasks_open(struct inode *unused, struct file *file)
3751 return cgroup_pidlist_open(file, CGROUP_FILE_TASKS);
3753 static int cgroup_procs_open(struct inode *unused, struct file *file)
3755 return cgroup_pidlist_open(file, CGROUP_FILE_PROCS);
3758 static u64 cgroup_read_notify_on_release(struct cgroup *cgrp,
3761 return notify_on_release(cgrp);
3764 static int cgroup_write_notify_on_release(struct cgroup *cgrp,
3768 clear_bit(CGRP_RELEASABLE, &cgrp->flags);
3770 set_bit(CGRP_NOTIFY_ON_RELEASE, &cgrp->flags);
3772 clear_bit(CGRP_NOTIFY_ON_RELEASE, &cgrp->flags);
3777 * Unregister event and free resources.
3779 * Gets called from workqueue.
3781 static void cgroup_event_remove(struct work_struct *work)
3783 struct cgroup_event *event = container_of(work, struct cgroup_event,
3785 struct cgroup *cgrp = event->cgrp;
3787 event->cft->unregister_event(cgrp, event->cft, event->eventfd);
3789 eventfd_ctx_put(event->eventfd);
3795 * Gets called on POLLHUP on eventfd when user closes it.
3797 * Called with wqh->lock held and interrupts disabled.
3799 static int cgroup_event_wake(wait_queue_t *wait, unsigned mode,
3800 int sync, void *key)
3802 struct cgroup_event *event = container_of(wait,
3803 struct cgroup_event, wait);
3804 struct cgroup *cgrp = event->cgrp;
3805 unsigned long flags = (unsigned long)key;
3807 if (flags & POLLHUP) {
3808 __remove_wait_queue(event->wqh, &event->wait);
3809 spin_lock(&cgrp->event_list_lock);
3810 list_del_init(&event->list);
3811 spin_unlock(&cgrp->event_list_lock);
3813 * We are in atomic context, but cgroup_event_remove() may
3814 * sleep, so we have to call it in workqueue.
3816 schedule_work(&event->remove);
3822 static void cgroup_event_ptable_queue_proc(struct file *file,
3823 wait_queue_head_t *wqh, poll_table *pt)
3825 struct cgroup_event *event = container_of(pt,
3826 struct cgroup_event, pt);
3829 add_wait_queue(wqh, &event->wait);
3833 * Parse input and register new cgroup event handler.
3835 * Input must be in format '<event_fd> <control_fd> <args>'.
3836 * Interpretation of args is defined by control file implementation.
3838 static int cgroup_write_event_control(struct cgroup *cgrp, struct cftype *cft,
3841 struct cgroup_event *event = NULL;
3842 unsigned int efd, cfd;
3843 struct file *efile = NULL;
3844 struct file *cfile = NULL;
3848 efd = simple_strtoul(buffer, &endp, 10);
3853 cfd = simple_strtoul(buffer, &endp, 10);
3854 if ((*endp != ' ') && (*endp != '\0'))
3858 event = kzalloc(sizeof(*event), GFP_KERNEL);
3862 INIT_LIST_HEAD(&event->list);
3863 init_poll_funcptr(&event->pt, cgroup_event_ptable_queue_proc);
3864 init_waitqueue_func_entry(&event->wait, cgroup_event_wake);
3865 INIT_WORK(&event->remove, cgroup_event_remove);
3867 efile = eventfd_fget(efd);
3868 if (IS_ERR(efile)) {
3869 ret = PTR_ERR(efile);
3873 event->eventfd = eventfd_ctx_fileget(efile);
3874 if (IS_ERR(event->eventfd)) {
3875 ret = PTR_ERR(event->eventfd);
3885 /* the process need read permission on control file */
3886 /* AV: shouldn't we check that it's been opened for read instead? */
3887 ret = inode_permission(cfile->f_path.dentry->d_inode, MAY_READ);
3891 event->cft = __file_cft(cfile);
3892 if (IS_ERR(event->cft)) {
3893 ret = PTR_ERR(event->cft);
3897 if (!event->cft->register_event || !event->cft->unregister_event) {
3902 ret = event->cft->register_event(cgrp, event->cft,
3903 event->eventfd, buffer);
3907 if (efile->f_op->poll(efile, &event->pt) & POLLHUP) {
3908 event->cft->unregister_event(cgrp, event->cft, event->eventfd);
3914 * Events should be removed after rmdir of cgroup directory, but before
3915 * destroying subsystem state objects. Let's take reference to cgroup
3916 * directory dentry to do that.
3920 spin_lock(&cgrp->event_list_lock);
3921 list_add(&event->list, &cgrp->event_list);
3922 spin_unlock(&cgrp->event_list_lock);
3933 if (event && event->eventfd && !IS_ERR(event->eventfd))
3934 eventfd_ctx_put(event->eventfd);
3936 if (!IS_ERR_OR_NULL(efile))
3944 static u64 cgroup_clone_children_read(struct cgroup *cgrp,
3947 return test_bit(CGRP_CPUSET_CLONE_CHILDREN, &cgrp->flags);
3950 static int cgroup_clone_children_write(struct cgroup *cgrp,
3955 set_bit(CGRP_CPUSET_CLONE_CHILDREN, &cgrp->flags);
3957 clear_bit(CGRP_CPUSET_CLONE_CHILDREN, &cgrp->flags);
3962 * for the common functions, 'private' gives the type of file
3964 /* for hysterical raisins, we can't put this on the older files */
3965 #define CGROUP_FILE_GENERIC_PREFIX "cgroup."
3966 static struct cftype files[] = {
3969 .open = cgroup_tasks_open,
3970 .write_u64 = cgroup_tasks_write,
3971 .release = cgroup_pidlist_release,
3972 .mode = S_IRUGO | S_IWUSR,
3975 .name = CGROUP_FILE_GENERIC_PREFIX "procs",
3976 .open = cgroup_procs_open,
3977 .write_u64 = cgroup_procs_write,
3978 .release = cgroup_pidlist_release,
3979 .mode = S_IRUGO | S_IWUSR,
3982 .name = "notify_on_release",
3983 .read_u64 = cgroup_read_notify_on_release,
3984 .write_u64 = cgroup_write_notify_on_release,
3987 .name = CGROUP_FILE_GENERIC_PREFIX "event_control",
3988 .write_string = cgroup_write_event_control,
3992 .name = "cgroup.clone_children",
3993 .read_u64 = cgroup_clone_children_read,
3994 .write_u64 = cgroup_clone_children_write,
3997 .name = "release_agent",
3998 .flags = CFTYPE_ONLY_ON_ROOT,
3999 .read_seq_string = cgroup_release_agent_show,
4000 .write_string = cgroup_release_agent_write,
4001 .max_write_len = PATH_MAX,
4007 * cgroup_populate_dir - selectively creation of files in a directory
4008 * @cgrp: target cgroup
4009 * @base_files: true if the base files should be added
4010 * @subsys_mask: mask of the subsystem ids whose files should be added
4012 static int cgroup_populate_dir(struct cgroup *cgrp, bool base_files,
4013 unsigned long subsys_mask)
4016 struct cgroup_subsys *ss;
4019 err = cgroup_addrm_files(cgrp, NULL, files, true);
4024 /* process cftsets of each subsystem */
4025 for_each_subsys(cgrp->root, ss) {
4026 struct cftype_set *set;
4027 if (!test_bit(ss->subsys_id, &subsys_mask))
4030 list_for_each_entry(set, &ss->cftsets, node)
4031 cgroup_addrm_files(cgrp, ss, set->cfts, true);
4034 /* This cgroup is ready now */
4035 for_each_subsys(cgrp->root, ss) {
4036 struct cgroup_subsys_state *css = cgrp->subsys[ss->subsys_id];
4038 * Update id->css pointer and make this css visible from
4039 * CSS ID functions. This pointer will be dereferened
4040 * from RCU-read-side without locks.
4043 rcu_assign_pointer(css->id->css, css);
4049 static void css_dput_fn(struct work_struct *work)
4051 struct cgroup_subsys_state *css =
4052 container_of(work, struct cgroup_subsys_state, dput_work);
4053 struct dentry *dentry = css->cgroup->dentry;
4054 struct super_block *sb = dentry->d_sb;
4056 atomic_inc(&sb->s_active);
4058 deactivate_super(sb);
4061 static void init_cgroup_css(struct cgroup_subsys_state *css,
4062 struct cgroup_subsys *ss,
4063 struct cgroup *cgrp)
4066 atomic_set(&css->refcnt, 1);
4069 if (cgrp == dummytop)
4070 css->flags |= CSS_ROOT;
4071 BUG_ON(cgrp->subsys[ss->subsys_id]);
4072 cgrp->subsys[ss->subsys_id] = css;
4075 * css holds an extra ref to @cgrp->dentry which is put on the last
4076 * css_put(). dput() requires process context, which css_put() may
4077 * be called without. @css->dput_work will be used to invoke
4078 * dput() asynchronously from css_put().
4080 INIT_WORK(&css->dput_work, css_dput_fn);
4083 /* invoke ->post_create() on a new CSS and mark it online if successful */
4084 static int online_css(struct cgroup_subsys *ss, struct cgroup *cgrp)
4088 lockdep_assert_held(&cgroup_mutex);
4091 ret = ss->css_online(cgrp);
4093 cgrp->subsys[ss->subsys_id]->flags |= CSS_ONLINE;
4097 /* if the CSS is online, invoke ->pre_destory() on it and mark it offline */
4098 static void offline_css(struct cgroup_subsys *ss, struct cgroup *cgrp)
4099 __releases(&cgroup_mutex) __acquires(&cgroup_mutex)
4101 struct cgroup_subsys_state *css = cgrp->subsys[ss->subsys_id];
4103 lockdep_assert_held(&cgroup_mutex);
4105 if (!(css->flags & CSS_ONLINE))
4109 * css_offline() should be called with cgroup_mutex unlocked. See
4110 * 3fa59dfbc3 ("cgroup: fix potential deadlock in pre_destroy") for
4111 * details. This temporary unlocking should go away once
4112 * cgroup_mutex is unexported from controllers.
4114 if (ss->css_offline) {
4115 mutex_unlock(&cgroup_mutex);
4116 ss->css_offline(cgrp);
4117 mutex_lock(&cgroup_mutex);
4120 cgrp->subsys[ss->subsys_id]->flags &= ~CSS_ONLINE;
4124 * cgroup_create - create a cgroup
4125 * @parent: cgroup that will be parent of the new cgroup
4126 * @dentry: dentry of the new cgroup
4127 * @mode: mode to set on new inode
4129 * Must be called with the mutex on the parent inode held
4131 static long cgroup_create(struct cgroup *parent, struct dentry *dentry,
4134 struct cgroup *cgrp;
4135 struct cgroupfs_root *root = parent->root;
4137 struct cgroup_subsys *ss;
4138 struct super_block *sb = root->sb;
4140 /* allocate the cgroup and its ID, 0 is reserved for the root */
4141 cgrp = kzalloc(sizeof(*cgrp), GFP_KERNEL);
4145 cgrp->id = ida_simple_get(&root->cgroup_ida, 1, 0, GFP_KERNEL);
4150 * Only live parents can have children. Note that the liveliness
4151 * check isn't strictly necessary because cgroup_mkdir() and
4152 * cgroup_rmdir() are fully synchronized by i_mutex; however, do it
4153 * anyway so that locking is contained inside cgroup proper and we
4154 * don't get nasty surprises if we ever grow another caller.
4156 if (!cgroup_lock_live_group(parent)) {
4161 /* Grab a reference on the superblock so the hierarchy doesn't
4162 * get deleted on unmount if there are child cgroups. This
4163 * can be done outside cgroup_mutex, since the sb can't
4164 * disappear while someone has an open control file on the
4166 atomic_inc(&sb->s_active);
4168 init_cgroup_housekeeping(cgrp);
4170 dentry->d_fsdata = cgrp;
4171 cgrp->dentry = dentry;
4173 cgrp->parent = parent;
4174 cgrp->root = parent->root;
4175 cgrp->top_cgroup = parent->top_cgroup;
4177 if (notify_on_release(parent))
4178 set_bit(CGRP_NOTIFY_ON_RELEASE, &cgrp->flags);
4180 if (test_bit(CGRP_CPUSET_CLONE_CHILDREN, &parent->flags))
4181 set_bit(CGRP_CPUSET_CLONE_CHILDREN, &cgrp->flags);
4183 for_each_subsys(root, ss) {
4184 struct cgroup_subsys_state *css;
4186 css = ss->css_alloc(cgrp);
4191 init_cgroup_css(css, ss, cgrp);
4193 err = alloc_css_id(ss, parent, cgrp);
4200 * Create directory. cgroup_create_file() returns with the new
4201 * directory locked on success so that it can be populated without
4202 * dropping cgroup_mutex.
4204 err = cgroup_create_file(dentry, S_IFDIR | mode, sb);
4207 lockdep_assert_held(&dentry->d_inode->i_mutex);
4209 /* allocation complete, commit to creation */
4210 list_add_tail(&cgrp->allcg_node, &root->allcg_list);
4211 list_add_tail_rcu(&cgrp->sibling, &cgrp->parent->children);
4212 root->number_of_cgroups++;
4214 /* each css holds a ref to the cgroup's dentry */
4215 for_each_subsys(root, ss)
4218 /* creation succeeded, notify subsystems */
4219 for_each_subsys(root, ss) {
4220 err = online_css(ss, cgrp);
4224 if (ss->broken_hierarchy && !ss->warned_broken_hierarchy &&
4226 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",
4227 current->comm, current->pid, ss->name);
4228 if (!strcmp(ss->name, "memory"))
4229 pr_warning("cgroup: \"memory\" requires setting use_hierarchy to 1 on the root.\n");
4230 ss->warned_broken_hierarchy = true;
4234 err = cgroup_populate_dir(cgrp, true, root->subsys_mask);
4238 mutex_unlock(&cgroup_mutex);
4239 mutex_unlock(&cgrp->dentry->d_inode->i_mutex);
4244 for_each_subsys(root, ss) {
4245 if (cgrp->subsys[ss->subsys_id])
4248 mutex_unlock(&cgroup_mutex);
4249 /* Release the reference count that we took on the superblock */
4250 deactivate_super(sb);
4252 ida_simple_remove(&root->cgroup_ida, cgrp->id);
4258 cgroup_destroy_locked(cgrp);
4259 mutex_unlock(&cgroup_mutex);
4260 mutex_unlock(&dentry->d_inode->i_mutex);
4264 static int cgroup_mkdir(struct inode *dir, struct dentry *dentry, umode_t mode)
4266 struct cgroup *c_parent = dentry->d_parent->d_fsdata;
4268 /* the vfs holds inode->i_mutex already */
4269 return cgroup_create(c_parent, dentry, mode | S_IFDIR);
4273 * Check the reference count on each subsystem. Since we already
4274 * established that there are no tasks in the cgroup, if the css refcount
4275 * is also 1, then there should be no outstanding references, so the
4276 * subsystem is safe to destroy. We scan across all subsystems rather than
4277 * using the per-hierarchy linked list of mounted subsystems since we can
4278 * be called via check_for_release() with no synchronization other than
4279 * RCU, and the subsystem linked list isn't RCU-safe.
4281 static int cgroup_has_css_refs(struct cgroup *cgrp)
4286 * We won't need to lock the subsys array, because the subsystems
4287 * we're concerned about aren't going anywhere since our cgroup root
4288 * has a reference on them.
4290 for (i = 0; i < CGROUP_SUBSYS_COUNT; i++) {
4291 struct cgroup_subsys *ss = subsys[i];
4292 struct cgroup_subsys_state *css;
4294 /* Skip subsystems not present or not in this hierarchy */
4295 if (ss == NULL || ss->root != cgrp->root)
4298 css = cgrp->subsys[ss->subsys_id];
4300 * When called from check_for_release() it's possible
4301 * that by this point the cgroup has been removed
4302 * and the css deleted. But a false-positive doesn't
4303 * matter, since it can only happen if the cgroup
4304 * has been deleted and hence no longer needs the
4305 * release agent to be called anyway.
4307 if (css && css_refcnt(css) > 1)
4313 static int cgroup_destroy_locked(struct cgroup *cgrp)
4314 __releases(&cgroup_mutex) __acquires(&cgroup_mutex)
4316 struct dentry *d = cgrp->dentry;
4317 struct cgroup *parent = cgrp->parent;
4319 struct cgroup_event *event, *tmp;
4320 struct cgroup_subsys *ss;
4321 LIST_HEAD(tmp_list);
4323 lockdep_assert_held(&d->d_inode->i_mutex);
4324 lockdep_assert_held(&cgroup_mutex);
4326 if (atomic_read(&cgrp->count) || !list_empty(&cgrp->children))
4330 * Block new css_tryget() by deactivating refcnt and mark @cgrp
4331 * removed. This makes future css_tryget() and child creation
4332 * attempts fail thus maintaining the removal conditions verified
4335 for_each_subsys(cgrp->root, ss) {
4336 struct cgroup_subsys_state *css = cgrp->subsys[ss->subsys_id];
4338 WARN_ON(atomic_read(&css->refcnt) < 0);
4339 atomic_add(CSS_DEACT_BIAS, &css->refcnt);
4341 set_bit(CGRP_REMOVED, &cgrp->flags);
4343 /* tell subsystems to initate destruction */
4344 for_each_subsys(cgrp->root, ss)
4345 offline_css(ss, cgrp);
4348 * Put all the base refs. Each css holds an extra reference to the
4349 * cgroup's dentry and cgroup removal proceeds regardless of css
4350 * refs. On the last put of each css, whenever that may be, the
4351 * extra dentry ref is put so that dentry destruction happens only
4352 * after all css's are released.
4354 for_each_subsys(cgrp->root, ss)
4355 css_put(cgrp->subsys[ss->subsys_id]);
4357 raw_spin_lock(&release_list_lock);
4358 if (!list_empty(&cgrp->release_list))
4359 list_del_init(&cgrp->release_list);
4360 raw_spin_unlock(&release_list_lock);
4362 /* delete this cgroup from parent->children */
4363 list_del_rcu(&cgrp->sibling);
4364 list_del_init(&cgrp->allcg_node);
4367 cgroup_d_remove_dir(d);
4370 set_bit(CGRP_RELEASABLE, &parent->flags);
4371 check_for_release(parent);
4374 * Unregister events and notify userspace.
4375 * Notify userspace about cgroup removing only after rmdir of cgroup
4376 * directory to avoid race between userspace and kernelspace. Use
4377 * a temporary list to avoid a deadlock with cgroup_event_wake(). Since
4378 * cgroup_event_wake() is called with the wait queue head locked,
4379 * remove_wait_queue() cannot be called while holding event_list_lock.
4381 spin_lock(&cgrp->event_list_lock);
4382 list_splice_init(&cgrp->event_list, &tmp_list);
4383 spin_unlock(&cgrp->event_list_lock);
4384 list_for_each_entry_safe(event, tmp, &tmp_list, list) {
4385 list_del_init(&event->list);
4386 remove_wait_queue(event->wqh, &event->wait);
4387 eventfd_signal(event->eventfd, 1);
4388 schedule_work(&event->remove);
4394 static int cgroup_rmdir(struct inode *unused_dir, struct dentry *dentry)
4398 mutex_lock(&cgroup_mutex);
4399 ret = cgroup_destroy_locked(dentry->d_fsdata);
4400 mutex_unlock(&cgroup_mutex);
4405 static void __init_or_module cgroup_init_cftsets(struct cgroup_subsys *ss)
4407 INIT_LIST_HEAD(&ss->cftsets);
4410 * base_cftset is embedded in subsys itself, no need to worry about
4413 if (ss->base_cftypes) {
4414 ss->base_cftset.cfts = ss->base_cftypes;
4415 list_add_tail(&ss->base_cftset.node, &ss->cftsets);
4419 static void __init cgroup_init_subsys(struct cgroup_subsys *ss)
4421 struct cgroup_subsys_state *css;
4423 printk(KERN_INFO "Initializing cgroup subsys %s\n", ss->name);
4425 mutex_lock(&cgroup_mutex);
4427 /* init base cftset */
4428 cgroup_init_cftsets(ss);
4430 /* Create the top cgroup state for this subsystem */
4431 list_add(&ss->sibling, &rootnode.subsys_list);
4432 ss->root = &rootnode;
4433 css = ss->css_alloc(dummytop);
4434 /* We don't handle early failures gracefully */
4435 BUG_ON(IS_ERR(css));
4436 init_cgroup_css(css, ss, dummytop);
4438 /* Update the init_css_set to contain a subsys
4439 * pointer to this state - since the subsystem is
4440 * newly registered, all tasks and hence the
4441 * init_css_set is in the subsystem's top cgroup. */
4442 init_css_set.subsys[ss->subsys_id] = css;
4444 need_forkexit_callback |= ss->fork || ss->exit;
4446 /* At system boot, before all subsystems have been
4447 * registered, no tasks have been forked, so we don't
4448 * need to invoke fork callbacks here. */
4449 BUG_ON(!list_empty(&init_task.tasks));
4452 BUG_ON(online_css(ss, dummytop));
4454 mutex_unlock(&cgroup_mutex);
4456 /* this function shouldn't be used with modular subsystems, since they
4457 * need to register a subsys_id, among other things */
4462 * cgroup_load_subsys: load and register a modular subsystem at runtime
4463 * @ss: the subsystem to load
4465 * This function should be called in a modular subsystem's initcall. If the
4466 * subsystem is built as a module, it will be assigned a new subsys_id and set
4467 * up for use. If the subsystem is built-in anyway, work is delegated to the
4468 * simpler cgroup_init_subsys.
4470 int __init_or_module cgroup_load_subsys(struct cgroup_subsys *ss)
4472 struct cgroup_subsys_state *css;
4474 struct hlist_node *node, *tmp;
4478 /* check name and function validity */
4479 if (ss->name == NULL || strlen(ss->name) > MAX_CGROUP_TYPE_NAMELEN ||
4480 ss->css_alloc == NULL || ss->css_free == NULL)
4484 * we don't support callbacks in modular subsystems. this check is
4485 * before the ss->module check for consistency; a subsystem that could
4486 * be a module should still have no callbacks even if the user isn't
4487 * compiling it as one.
4489 if (ss->fork || ss->exit)
4493 * an optionally modular subsystem is built-in: we want to do nothing,
4494 * since cgroup_init_subsys will have already taken care of it.
4496 if (ss->module == NULL) {
4497 /* a sanity check */
4498 BUG_ON(subsys[ss->subsys_id] != ss);
4502 /* init base cftset */
4503 cgroup_init_cftsets(ss);
4505 mutex_lock(&cgroup_mutex);
4506 subsys[ss->subsys_id] = ss;
4509 * no ss->css_alloc seems to need anything important in the ss
4510 * struct, so this can happen first (i.e. before the rootnode
4513 css = ss->css_alloc(dummytop);
4515 /* failure case - need to deassign the subsys[] slot. */
4516 subsys[ss->subsys_id] = NULL;
4517 mutex_unlock(&cgroup_mutex);
4518 return PTR_ERR(css);
4521 list_add(&ss->sibling, &rootnode.subsys_list);
4522 ss->root = &rootnode;
4524 /* our new subsystem will be attached to the dummy hierarchy. */
4525 init_cgroup_css(css, ss, dummytop);
4526 /* init_idr must be after init_cgroup_css because it sets css->id. */
4528 ret = cgroup_init_idr(ss, css);
4534 * Now we need to entangle the css into the existing css_sets. unlike
4535 * in cgroup_init_subsys, there are now multiple css_sets, so each one
4536 * will need a new pointer to it; done by iterating the css_set_table.
4537 * furthermore, modifying the existing css_sets will corrupt the hash
4538 * table state, so each changed css_set will need its hash recomputed.
4539 * this is all done under the css_set_lock.
4541 write_lock(&css_set_lock);
4542 hash_for_each_safe(css_set_table, i, node, tmp, cg, hlist) {
4543 /* skip entries that we already rehashed */
4544 if (cg->subsys[ss->subsys_id])
4546 /* remove existing entry */
4547 hash_del(&cg->hlist);
4549 cg->subsys[ss->subsys_id] = css;
4550 /* recompute hash and restore entry */
4551 key = css_set_hash(cg->subsys);
4552 hash_add(css_set_table, node, key);
4554 write_unlock(&css_set_lock);
4557 ret = online_css(ss, dummytop);
4562 mutex_unlock(&cgroup_mutex);
4566 mutex_unlock(&cgroup_mutex);
4567 /* @ss can't be mounted here as try_module_get() would fail */
4568 cgroup_unload_subsys(ss);
4571 EXPORT_SYMBOL_GPL(cgroup_load_subsys);
4574 * cgroup_unload_subsys: unload a modular subsystem
4575 * @ss: the subsystem to unload
4577 * This function should be called in a modular subsystem's exitcall. When this
4578 * function is invoked, the refcount on the subsystem's module will be 0, so
4579 * the subsystem will not be attached to any hierarchy.
4581 void cgroup_unload_subsys(struct cgroup_subsys *ss)
4583 struct cg_cgroup_link *link;
4585 BUG_ON(ss->module == NULL);
4588 * we shouldn't be called if the subsystem is in use, and the use of
4589 * try_module_get in parse_cgroupfs_options should ensure that it
4590 * doesn't start being used while we're killing it off.
4592 BUG_ON(ss->root != &rootnode);
4594 mutex_lock(&cgroup_mutex);
4596 offline_css(ss, dummytop);
4600 idr_remove_all(&ss->idr);
4601 idr_destroy(&ss->idr);
4604 /* deassign the subsys_id */
4605 subsys[ss->subsys_id] = NULL;
4607 /* remove subsystem from rootnode's list of subsystems */
4608 list_del_init(&ss->sibling);
4611 * disentangle the css from all css_sets attached to the dummytop. as
4612 * in loading, we need to pay our respects to the hashtable gods.
4614 write_lock(&css_set_lock);
4615 list_for_each_entry(link, &dummytop->css_sets, cgrp_link_list) {
4616 struct css_set *cg = link->cg;
4619 hash_del(&cg->hlist);
4620 cg->subsys[ss->subsys_id] = NULL;
4621 key = css_set_hash(cg->subsys);
4622 hash_add(css_set_table, &cg->hlist, key);
4624 write_unlock(&css_set_lock);
4627 * remove subsystem's css from the dummytop and free it - need to
4628 * free before marking as null because ss->css_free needs the
4629 * cgrp->subsys pointer to find their state. note that this also
4630 * takes care of freeing the css_id.
4632 ss->css_free(dummytop);
4633 dummytop->subsys[ss->subsys_id] = NULL;
4635 mutex_unlock(&cgroup_mutex);
4637 EXPORT_SYMBOL_GPL(cgroup_unload_subsys);
4640 * cgroup_init_early - cgroup initialization at system boot
4642 * Initialize cgroups at system boot, and initialize any
4643 * subsystems that request early init.
4645 int __init cgroup_init_early(void)
4648 atomic_set(&init_css_set.refcount, 1);
4649 INIT_LIST_HEAD(&init_css_set.cg_links);
4650 INIT_LIST_HEAD(&init_css_set.tasks);
4651 INIT_HLIST_NODE(&init_css_set.hlist);
4653 init_cgroup_root(&rootnode);
4655 init_task.cgroups = &init_css_set;
4657 init_css_set_link.cg = &init_css_set;
4658 init_css_set_link.cgrp = dummytop;
4659 list_add(&init_css_set_link.cgrp_link_list,
4660 &rootnode.top_cgroup.css_sets);
4661 list_add(&init_css_set_link.cg_link_list,
4662 &init_css_set.cg_links);
4664 for (i = 0; i < CGROUP_SUBSYS_COUNT; i++) {
4665 struct cgroup_subsys *ss = subsys[i];
4667 /* at bootup time, we don't worry about modular subsystems */
4668 if (!ss || ss->module)
4672 BUG_ON(strlen(ss->name) > MAX_CGROUP_TYPE_NAMELEN);
4673 BUG_ON(!ss->css_alloc);
4674 BUG_ON(!ss->css_free);
4675 if (ss->subsys_id != i) {
4676 printk(KERN_ERR "cgroup: Subsys %s id == %d\n",
4677 ss->name, ss->subsys_id);
4682 cgroup_init_subsys(ss);
4688 * cgroup_init - cgroup initialization
4690 * Register cgroup filesystem and /proc file, and initialize
4691 * any subsystems that didn't request early init.
4693 int __init cgroup_init(void)
4699 err = bdi_init(&cgroup_backing_dev_info);
4703 for (i = 0; i < CGROUP_SUBSYS_COUNT; i++) {
4704 struct cgroup_subsys *ss = subsys[i];
4706 /* at bootup time, we don't worry about modular subsystems */
4707 if (!ss || ss->module)
4709 if (!ss->early_init)
4710 cgroup_init_subsys(ss);
4712 cgroup_init_idr(ss, init_css_set.subsys[ss->subsys_id]);
4715 /* Add init_css_set to the hash table */
4716 key = css_set_hash(init_css_set.subsys);
4717 hash_add(css_set_table, &init_css_set.hlist, key);
4718 BUG_ON(!init_root_id(&rootnode));
4720 cgroup_kobj = kobject_create_and_add("cgroup", fs_kobj);
4726 err = register_filesystem(&cgroup_fs_type);
4728 kobject_put(cgroup_kobj);
4732 proc_create("cgroups", 0, NULL, &proc_cgroupstats_operations);
4736 bdi_destroy(&cgroup_backing_dev_info);
4742 * proc_cgroup_show()
4743 * - Print task's cgroup paths into seq_file, one line for each hierarchy
4744 * - Used for /proc/<pid>/cgroup.
4745 * - No need to task_lock(tsk) on this tsk->cgroup reference, as it
4746 * doesn't really matter if tsk->cgroup changes after we read it,
4747 * and we take cgroup_mutex, keeping cgroup_attach_task() from changing it
4748 * anyway. No need to check that tsk->cgroup != NULL, thanks to
4749 * the_top_cgroup_hack in cgroup_exit(), which sets an exiting tasks
4750 * cgroup to top_cgroup.
4753 /* TODO: Use a proper seq_file iterator */
4754 static int proc_cgroup_show(struct seq_file *m, void *v)
4757 struct task_struct *tsk;
4760 struct cgroupfs_root *root;
4763 buf = kmalloc(PAGE_SIZE, GFP_KERNEL);
4769 tsk = get_pid_task(pid, PIDTYPE_PID);
4775 mutex_lock(&cgroup_mutex);
4777 for_each_active_root(root) {
4778 struct cgroup_subsys *ss;
4779 struct cgroup *cgrp;
4782 seq_printf(m, "%d:", root->hierarchy_id);
4783 for_each_subsys(root, ss)
4784 seq_printf(m, "%s%s", count++ ? "," : "", ss->name);
4785 if (strlen(root->name))
4786 seq_printf(m, "%sname=%s", count ? "," : "",
4789 cgrp = task_cgroup_from_root(tsk, root);
4790 retval = cgroup_path(cgrp, buf, PAGE_SIZE);
4798 mutex_unlock(&cgroup_mutex);
4799 put_task_struct(tsk);
4806 static int cgroup_open(struct inode *inode, struct file *file)
4808 struct pid *pid = PROC_I(inode)->pid;
4809 return single_open(file, proc_cgroup_show, pid);
4812 const struct file_operations proc_cgroup_operations = {
4813 .open = cgroup_open,
4815 .llseek = seq_lseek,
4816 .release = single_release,
4819 /* Display information about each subsystem and each hierarchy */
4820 static int proc_cgroupstats_show(struct seq_file *m, void *v)
4824 seq_puts(m, "#subsys_name\thierarchy\tnum_cgroups\tenabled\n");
4826 * ideally we don't want subsystems moving around while we do this.
4827 * cgroup_mutex is also necessary to guarantee an atomic snapshot of
4828 * subsys/hierarchy state.
4830 mutex_lock(&cgroup_mutex);
4831 for (i = 0; i < CGROUP_SUBSYS_COUNT; i++) {
4832 struct cgroup_subsys *ss = subsys[i];
4835 seq_printf(m, "%s\t%d\t%d\t%d\n",
4836 ss->name, ss->root->hierarchy_id,
4837 ss->root->number_of_cgroups, !ss->disabled);
4839 mutex_unlock(&cgroup_mutex);
4843 static int cgroupstats_open(struct inode *inode, struct file *file)
4845 return single_open(file, proc_cgroupstats_show, NULL);
4848 static const struct file_operations proc_cgroupstats_operations = {
4849 .open = cgroupstats_open,
4851 .llseek = seq_lseek,
4852 .release = single_release,
4856 * cgroup_fork - attach newly forked task to its parents cgroup.
4857 * @child: pointer to task_struct of forking parent process.
4859 * Description: A task inherits its parent's cgroup at fork().
4861 * A pointer to the shared css_set was automatically copied in
4862 * fork.c by dup_task_struct(). However, we ignore that copy, since
4863 * it was not made under the protection of RCU or cgroup_mutex, so
4864 * might no longer be a valid cgroup pointer. cgroup_attach_task() might
4865 * have already changed current->cgroups, allowing the previously
4866 * referenced cgroup group to be removed and freed.
4868 * At the point that cgroup_fork() is called, 'current' is the parent
4869 * task, and the passed argument 'child' points to the child task.
4871 void cgroup_fork(struct task_struct *child)
4874 child->cgroups = current->cgroups;
4875 get_css_set(child->cgroups);
4876 task_unlock(current);
4877 INIT_LIST_HEAD(&child->cg_list);
4881 * cgroup_post_fork - called on a new task after adding it to the task list
4882 * @child: the task in question
4884 * Adds the task to the list running through its css_set if necessary and
4885 * call the subsystem fork() callbacks. Has to be after the task is
4886 * visible on the task list in case we race with the first call to
4887 * cgroup_iter_start() - to guarantee that the new task ends up on its
4890 void cgroup_post_fork(struct task_struct *child)
4895 * use_task_css_set_links is set to 1 before we walk the tasklist
4896 * under the tasklist_lock and we read it here after we added the child
4897 * to the tasklist under the tasklist_lock as well. If the child wasn't
4898 * yet in the tasklist when we walked through it from
4899 * cgroup_enable_task_cg_lists(), then use_task_css_set_links value
4900 * should be visible now due to the paired locking and barriers implied
4901 * by LOCK/UNLOCK: it is written before the tasklist_lock unlock
4902 * in cgroup_enable_task_cg_lists() and read here after the tasklist_lock
4905 if (use_task_css_set_links) {
4906 write_lock(&css_set_lock);
4908 if (list_empty(&child->cg_list))
4909 list_add(&child->cg_list, &child->cgroups->tasks);
4911 write_unlock(&css_set_lock);
4915 * Call ss->fork(). This must happen after @child is linked on
4916 * css_set; otherwise, @child might change state between ->fork()
4917 * and addition to css_set.
4919 if (need_forkexit_callback) {
4920 for (i = 0; i < CGROUP_SUBSYS_COUNT; i++) {
4921 struct cgroup_subsys *ss = subsys[i];
4924 * fork/exit callbacks are supported only for
4925 * builtin subsystems and we don't need further
4926 * synchronization as they never go away.
4928 if (!ss || ss->module)
4938 * cgroup_exit - detach cgroup from exiting task
4939 * @tsk: pointer to task_struct of exiting process
4940 * @run_callback: run exit callbacks?
4942 * Description: Detach cgroup from @tsk and release it.
4944 * Note that cgroups marked notify_on_release force every task in
4945 * them to take the global cgroup_mutex mutex when exiting.
4946 * This could impact scaling on very large systems. Be reluctant to
4947 * use notify_on_release cgroups where very high task exit scaling
4948 * is required on large systems.
4950 * the_top_cgroup_hack:
4952 * Set the exiting tasks cgroup to the root cgroup (top_cgroup).
4954 * We call cgroup_exit() while the task is still competent to
4955 * handle notify_on_release(), then leave the task attached to the
4956 * root cgroup in each hierarchy for the remainder of its exit.
4958 * To do this properly, we would increment the reference count on
4959 * top_cgroup, and near the very end of the kernel/exit.c do_exit()
4960 * code we would add a second cgroup function call, to drop that
4961 * reference. This would just create an unnecessary hot spot on
4962 * the top_cgroup reference count, to no avail.
4964 * Normally, holding a reference to a cgroup without bumping its
4965 * count is unsafe. The cgroup could go away, or someone could
4966 * attach us to a different cgroup, decrementing the count on
4967 * the first cgroup that we never incremented. But in this case,
4968 * top_cgroup isn't going away, and either task has PF_EXITING set,
4969 * which wards off any cgroup_attach_task() attempts, or task is a failed
4970 * fork, never visible to cgroup_attach_task.
4972 void cgroup_exit(struct task_struct *tsk, int run_callbacks)
4978 * Unlink from the css_set task list if necessary.
4979 * Optimistically check cg_list before taking
4982 if (!list_empty(&tsk->cg_list)) {
4983 write_lock(&css_set_lock);
4984 if (!list_empty(&tsk->cg_list))
4985 list_del_init(&tsk->cg_list);
4986 write_unlock(&css_set_lock);
4989 /* Reassign the task to the init_css_set. */
4992 tsk->cgroups = &init_css_set;
4994 if (run_callbacks && need_forkexit_callback) {
4995 for (i = 0; i < CGROUP_SUBSYS_COUNT; i++) {
4996 struct cgroup_subsys *ss = subsys[i];
4998 /* modular subsystems can't use callbacks */
4999 if (!ss || ss->module)
5003 struct cgroup *old_cgrp =
5004 rcu_dereference_raw(cg->subsys[i])->cgroup;
5005 struct cgroup *cgrp = task_cgroup(tsk, i);
5006 ss->exit(cgrp, old_cgrp, tsk);
5012 put_css_set_taskexit(cg);
5016 * cgroup_is_descendant - see if @cgrp is a descendant of @task's cgrp
5017 * @cgrp: the cgroup in question
5018 * @task: the task in question
5020 * See if @cgrp is a descendant of @task's cgroup in the appropriate
5023 * If we are sending in dummytop, then presumably we are creating
5024 * the top cgroup in the subsystem.
5026 * Called only by the ns (nsproxy) cgroup.
5028 int cgroup_is_descendant(const struct cgroup *cgrp, struct task_struct *task)
5031 struct cgroup *target;
5033 if (cgrp == dummytop)
5036 target = task_cgroup_from_root(task, cgrp->root);
5037 while (cgrp != target && cgrp!= cgrp->top_cgroup)
5038 cgrp = cgrp->parent;
5039 ret = (cgrp == target);
5043 static void check_for_release(struct cgroup *cgrp)
5045 /* All of these checks rely on RCU to keep the cgroup
5046 * structure alive */
5047 if (cgroup_is_releasable(cgrp) && !atomic_read(&cgrp->count)
5048 && list_empty(&cgrp->children) && !cgroup_has_css_refs(cgrp)) {
5049 /* Control Group is currently removeable. If it's not
5050 * already queued for a userspace notification, queue
5052 int need_schedule_work = 0;
5053 raw_spin_lock(&release_list_lock);
5054 if (!cgroup_is_removed(cgrp) &&
5055 list_empty(&cgrp->release_list)) {
5056 list_add(&cgrp->release_list, &release_list);
5057 need_schedule_work = 1;
5059 raw_spin_unlock(&release_list_lock);
5060 if (need_schedule_work)
5061 schedule_work(&release_agent_work);
5065 /* Caller must verify that the css is not for root cgroup */
5066 bool __css_tryget(struct cgroup_subsys_state *css)
5071 v = css_refcnt(css);
5072 t = atomic_cmpxchg(&css->refcnt, v, v + 1);
5080 EXPORT_SYMBOL_GPL(__css_tryget);
5082 /* Caller must verify that the css is not for root cgroup */
5083 void __css_put(struct cgroup_subsys_state *css)
5085 struct cgroup *cgrp = css->cgroup;
5089 v = css_unbias_refcnt(atomic_dec_return(&css->refcnt));
5093 if (notify_on_release(cgrp)) {
5094 set_bit(CGRP_RELEASABLE, &cgrp->flags);
5095 check_for_release(cgrp);
5099 schedule_work(&css->dput_work);
5104 EXPORT_SYMBOL_GPL(__css_put);
5107 * Notify userspace when a cgroup is released, by running the
5108 * configured release agent with the name of the cgroup (path
5109 * relative to the root of cgroup file system) as the argument.
5111 * Most likely, this user command will try to rmdir this cgroup.
5113 * This races with the possibility that some other task will be
5114 * attached to this cgroup before it is removed, or that some other
5115 * user task will 'mkdir' a child cgroup of this cgroup. That's ok.
5116 * The presumed 'rmdir' will fail quietly if this cgroup is no longer
5117 * unused, and this cgroup will be reprieved from its death sentence,
5118 * to continue to serve a useful existence. Next time it's released,
5119 * we will get notified again, if it still has 'notify_on_release' set.
5121 * The final arg to call_usermodehelper() is UMH_WAIT_EXEC, which
5122 * means only wait until the task is successfully execve()'d. The
5123 * separate release agent task is forked by call_usermodehelper(),
5124 * then control in this thread returns here, without waiting for the
5125 * release agent task. We don't bother to wait because the caller of
5126 * this routine has no use for the exit status of the release agent
5127 * task, so no sense holding our caller up for that.
5129 static void cgroup_release_agent(struct work_struct *work)
5131 BUG_ON(work != &release_agent_work);
5132 mutex_lock(&cgroup_mutex);
5133 raw_spin_lock(&release_list_lock);
5134 while (!list_empty(&release_list)) {
5135 char *argv[3], *envp[3];
5137 char *pathbuf = NULL, *agentbuf = NULL;
5138 struct cgroup *cgrp = list_entry(release_list.next,
5141 list_del_init(&cgrp->release_list);
5142 raw_spin_unlock(&release_list_lock);
5143 pathbuf = kmalloc(PAGE_SIZE, GFP_KERNEL);
5146 if (cgroup_path(cgrp, pathbuf, PAGE_SIZE) < 0)
5148 agentbuf = kstrdup(cgrp->root->release_agent_path, GFP_KERNEL);
5153 argv[i++] = agentbuf;
5154 argv[i++] = pathbuf;
5158 /* minimal command environment */
5159 envp[i++] = "HOME=/";
5160 envp[i++] = "PATH=/sbin:/bin:/usr/sbin:/usr/bin";
5163 /* Drop the lock while we invoke the usermode helper,
5164 * since the exec could involve hitting disk and hence
5165 * be a slow process */
5166 mutex_unlock(&cgroup_mutex);
5167 call_usermodehelper(argv[0], argv, envp, UMH_WAIT_EXEC);
5168 mutex_lock(&cgroup_mutex);
5172 raw_spin_lock(&release_list_lock);
5174 raw_spin_unlock(&release_list_lock);
5175 mutex_unlock(&cgroup_mutex);
5178 static int __init cgroup_disable(char *str)
5183 while ((token = strsep(&str, ",")) != NULL) {
5186 for (i = 0; i < CGROUP_SUBSYS_COUNT; i++) {
5187 struct cgroup_subsys *ss = subsys[i];
5190 * cgroup_disable, being at boot time, can't
5191 * know about module subsystems, so we don't
5194 if (!ss || ss->module)
5197 if (!strcmp(token, ss->name)) {
5199 printk(KERN_INFO "Disabling %s control group"
5200 " subsystem\n", ss->name);
5207 __setup("cgroup_disable=", cgroup_disable);
5210 * Functons for CSS ID.
5214 *To get ID other than 0, this should be called when !cgroup_is_removed().
5216 unsigned short css_id(struct cgroup_subsys_state *css)
5218 struct css_id *cssid;
5221 * This css_id() can return correct value when somone has refcnt
5222 * on this or this is under rcu_read_lock(). Once css->id is allocated,
5223 * it's unchanged until freed.
5225 cssid = rcu_dereference_check(css->id, css_refcnt(css));
5231 EXPORT_SYMBOL_GPL(css_id);
5233 unsigned short css_depth(struct cgroup_subsys_state *css)
5235 struct css_id *cssid;
5237 cssid = rcu_dereference_check(css->id, css_refcnt(css));
5240 return cssid->depth;
5243 EXPORT_SYMBOL_GPL(css_depth);
5246 * css_is_ancestor - test "root" css is an ancestor of "child"
5247 * @child: the css to be tested.
5248 * @root: the css supporsed to be an ancestor of the child.
5250 * Returns true if "root" is an ancestor of "child" in its hierarchy. Because
5251 * this function reads css->id, the caller must hold rcu_read_lock().
5252 * But, considering usual usage, the csses should be valid objects after test.
5253 * Assuming that the caller will do some action to the child if this returns
5254 * returns true, the caller must take "child";s reference count.
5255 * If "child" is valid object and this returns true, "root" is valid, too.
5258 bool css_is_ancestor(struct cgroup_subsys_state *child,
5259 const struct cgroup_subsys_state *root)
5261 struct css_id *child_id;
5262 struct css_id *root_id;
5264 child_id = rcu_dereference(child->id);
5267 root_id = rcu_dereference(root->id);
5270 if (child_id->depth < root_id->depth)
5272 if (child_id->stack[root_id->depth] != root_id->id)
5277 void free_css_id(struct cgroup_subsys *ss, struct cgroup_subsys_state *css)
5279 struct css_id *id = css->id;
5280 /* When this is called before css_id initialization, id can be NULL */
5284 BUG_ON(!ss->use_id);
5286 rcu_assign_pointer(id->css, NULL);
5287 rcu_assign_pointer(css->id, NULL);
5288 spin_lock(&ss->id_lock);
5289 idr_remove(&ss->idr, id->id);
5290 spin_unlock(&ss->id_lock);
5291 kfree_rcu(id, rcu_head);
5293 EXPORT_SYMBOL_GPL(free_css_id);
5296 * This is called by init or create(). Then, calls to this function are
5297 * always serialized (By cgroup_mutex() at create()).
5300 static struct css_id *get_new_cssid(struct cgroup_subsys *ss, int depth)
5302 struct css_id *newid;
5303 int myid, error, size;
5305 BUG_ON(!ss->use_id);
5307 size = sizeof(*newid) + sizeof(unsigned short) * (depth + 1);
5308 newid = kzalloc(size, GFP_KERNEL);
5310 return ERR_PTR(-ENOMEM);
5312 if (unlikely(!idr_pre_get(&ss->idr, GFP_KERNEL))) {
5316 spin_lock(&ss->id_lock);
5317 /* Don't use 0. allocates an ID of 1-65535 */
5318 error = idr_get_new_above(&ss->idr, newid, 1, &myid);
5319 spin_unlock(&ss->id_lock);
5321 /* Returns error when there are no free spaces for new ID.*/
5326 if (myid > CSS_ID_MAX)
5330 newid->depth = depth;
5334 spin_lock(&ss->id_lock);
5335 idr_remove(&ss->idr, myid);
5336 spin_unlock(&ss->id_lock);
5339 return ERR_PTR(error);
5343 static int __init_or_module cgroup_init_idr(struct cgroup_subsys *ss,
5344 struct cgroup_subsys_state *rootcss)
5346 struct css_id *newid;
5348 spin_lock_init(&ss->id_lock);
5351 newid = get_new_cssid(ss, 0);
5353 return PTR_ERR(newid);
5355 newid->stack[0] = newid->id;
5356 newid->css = rootcss;
5357 rootcss->id = newid;
5361 static int alloc_css_id(struct cgroup_subsys *ss, struct cgroup *parent,
5362 struct cgroup *child)
5364 int subsys_id, i, depth = 0;
5365 struct cgroup_subsys_state *parent_css, *child_css;
5366 struct css_id *child_id, *parent_id;
5368 subsys_id = ss->subsys_id;
5369 parent_css = parent->subsys[subsys_id];
5370 child_css = child->subsys[subsys_id];
5371 parent_id = parent_css->id;
5372 depth = parent_id->depth + 1;
5374 child_id = get_new_cssid(ss, depth);
5375 if (IS_ERR(child_id))
5376 return PTR_ERR(child_id);
5378 for (i = 0; i < depth; i++)
5379 child_id->stack[i] = parent_id->stack[i];
5380 child_id->stack[depth] = child_id->id;
5382 * child_id->css pointer will be set after this cgroup is available
5383 * see cgroup_populate_dir()
5385 rcu_assign_pointer(child_css->id, child_id);
5391 * css_lookup - lookup css by id
5392 * @ss: cgroup subsys to be looked into.
5395 * Returns pointer to cgroup_subsys_state if there is valid one with id.
5396 * NULL if not. Should be called under rcu_read_lock()
5398 struct cgroup_subsys_state *css_lookup(struct cgroup_subsys *ss, int id)
5400 struct css_id *cssid = NULL;
5402 BUG_ON(!ss->use_id);
5403 cssid = idr_find(&ss->idr, id);
5405 if (unlikely(!cssid))
5408 return rcu_dereference(cssid->css);
5410 EXPORT_SYMBOL_GPL(css_lookup);
5413 * css_get_next - lookup next cgroup under specified hierarchy.
5414 * @ss: pointer to subsystem
5415 * @id: current position of iteration.
5416 * @root: pointer to css. search tree under this.
5417 * @foundid: position of found object.
5419 * Search next css under the specified hierarchy of rootid. Calling under
5420 * rcu_read_lock() is necessary. Returns NULL if it reaches the end.
5422 struct cgroup_subsys_state *
5423 css_get_next(struct cgroup_subsys *ss, int id,
5424 struct cgroup_subsys_state *root, int *foundid)
5426 struct cgroup_subsys_state *ret = NULL;
5429 int rootid = css_id(root);
5430 int depth = css_depth(root);
5435 BUG_ON(!ss->use_id);
5436 WARN_ON_ONCE(!rcu_read_lock_held());
5438 /* fill start point for scan */
5442 * scan next entry from bitmap(tree), tmpid is updated after
5445 tmp = idr_get_next(&ss->idr, &tmpid);
5448 if (tmp->depth >= depth && tmp->stack[depth] == rootid) {
5449 ret = rcu_dereference(tmp->css);
5455 /* continue to scan from next id */
5462 * get corresponding css from file open on cgroupfs directory
5464 struct cgroup_subsys_state *cgroup_css_from_dir(struct file *f, int id)
5466 struct cgroup *cgrp;
5467 struct inode *inode;
5468 struct cgroup_subsys_state *css;
5470 inode = f->f_dentry->d_inode;
5471 /* check in cgroup filesystem dir */
5472 if (inode->i_op != &cgroup_dir_inode_operations)
5473 return ERR_PTR(-EBADF);
5475 if (id < 0 || id >= CGROUP_SUBSYS_COUNT)
5476 return ERR_PTR(-EINVAL);
5479 cgrp = __d_cgrp(f->f_dentry);
5480 css = cgrp->subsys[id];
5481 return css ? css : ERR_PTR(-ENOENT);
5484 #ifdef CONFIG_CGROUP_DEBUG
5485 static struct cgroup_subsys_state *debug_css_alloc(struct cgroup *cont)
5487 struct cgroup_subsys_state *css = kzalloc(sizeof(*css), GFP_KERNEL);
5490 return ERR_PTR(-ENOMEM);
5495 static void debug_css_free(struct cgroup *cont)
5497 kfree(cont->subsys[debug_subsys_id]);
5500 static u64 cgroup_refcount_read(struct cgroup *cont, struct cftype *cft)
5502 return atomic_read(&cont->count);
5505 static u64 debug_taskcount_read(struct cgroup *cont, struct cftype *cft)
5507 return cgroup_task_count(cont);
5510 static u64 current_css_set_read(struct cgroup *cont, struct cftype *cft)
5512 return (u64)(unsigned long)current->cgroups;
5515 static u64 current_css_set_refcount_read(struct cgroup *cont,
5521 count = atomic_read(¤t->cgroups->refcount);
5526 static int current_css_set_cg_links_read(struct cgroup *cont,
5528 struct seq_file *seq)
5530 struct cg_cgroup_link *link;
5533 read_lock(&css_set_lock);
5535 cg = rcu_dereference(current->cgroups);
5536 list_for_each_entry(link, &cg->cg_links, cg_link_list) {
5537 struct cgroup *c = link->cgrp;
5541 name = c->dentry->d_name.name;
5544 seq_printf(seq, "Root %d group %s\n",
5545 c->root->hierarchy_id, name);
5548 read_unlock(&css_set_lock);
5552 #define MAX_TASKS_SHOWN_PER_CSS 25
5553 static int cgroup_css_links_read(struct cgroup *cont,
5555 struct seq_file *seq)
5557 struct cg_cgroup_link *link;
5559 read_lock(&css_set_lock);
5560 list_for_each_entry(link, &cont->css_sets, cgrp_link_list) {
5561 struct css_set *cg = link->cg;
5562 struct task_struct *task;
5564 seq_printf(seq, "css_set %p\n", cg);
5565 list_for_each_entry(task, &cg->tasks, cg_list) {
5566 if (count++ > MAX_TASKS_SHOWN_PER_CSS) {
5567 seq_puts(seq, " ...\n");
5570 seq_printf(seq, " task %d\n",
5571 task_pid_vnr(task));
5575 read_unlock(&css_set_lock);
5579 static u64 releasable_read(struct cgroup *cgrp, struct cftype *cft)
5581 return test_bit(CGRP_RELEASABLE, &cgrp->flags);
5584 static struct cftype debug_files[] = {
5586 .name = "cgroup_refcount",
5587 .read_u64 = cgroup_refcount_read,
5590 .name = "taskcount",
5591 .read_u64 = debug_taskcount_read,
5595 .name = "current_css_set",
5596 .read_u64 = current_css_set_read,
5600 .name = "current_css_set_refcount",
5601 .read_u64 = current_css_set_refcount_read,
5605 .name = "current_css_set_cg_links",
5606 .read_seq_string = current_css_set_cg_links_read,
5610 .name = "cgroup_css_links",
5611 .read_seq_string = cgroup_css_links_read,
5615 .name = "releasable",
5616 .read_u64 = releasable_read,
5622 struct cgroup_subsys debug_subsys = {
5624 .css_alloc = debug_css_alloc,
5625 .css_free = debug_css_free,
5626 .subsys_id = debug_subsys_id,
5627 .base_cftypes = debug_files,
5629 #endif /* CONFIG_CGROUP_DEBUG */