Commit | Line | Data |
---|---|---|
ddbcc7e8 | 1 | /* |
ddbcc7e8 PM |
2 | * Generic process-grouping system. |
3 | * | |
4 | * Based originally on the cpuset system, extracted by Paul Menage | |
5 | * Copyright (C) 2006 Google, Inc | |
6 | * | |
0dea1168 KS |
7 | * Notifications support |
8 | * Copyright (C) 2009 Nokia Corporation | |
9 | * Author: Kirill A. Shutemov | |
10 | * | |
ddbcc7e8 PM |
11 | * Copyright notices from the original cpuset code: |
12 | * -------------------------------------------------- | |
13 | * Copyright (C) 2003 BULL SA. | |
14 | * Copyright (C) 2004-2006 Silicon Graphics, Inc. | |
15 | * | |
16 | * Portions derived from Patrick Mochel's sysfs code. | |
17 | * sysfs is Copyright (c) 2001-3 Patrick Mochel | |
18 | * | |
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 | * --------------------------------------------------- | |
23 | * | |
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. | |
27 | */ | |
28 | ||
29 | #include <linux/cgroup.h> | |
2ce9738b | 30 | #include <linux/cred.h> |
c6d57f33 | 31 | #include <linux/ctype.h> |
ddbcc7e8 PM |
32 | #include <linux/errno.h> |
33 | #include <linux/fs.h> | |
2ce9738b | 34 | #include <linux/init_task.h> |
ddbcc7e8 PM |
35 | #include <linux/kernel.h> |
36 | #include <linux/list.h> | |
37 | #include <linux/mm.h> | |
38 | #include <linux/mutex.h> | |
39 | #include <linux/mount.h> | |
40 | #include <linux/pagemap.h> | |
a424316c | 41 | #include <linux/proc_fs.h> |
ddbcc7e8 PM |
42 | #include <linux/rcupdate.h> |
43 | #include <linux/sched.h> | |
817929ec | 44 | #include <linux/backing-dev.h> |
ddbcc7e8 PM |
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> | |
bbcb81d0 | 50 | #include <linux/sort.h> |
81a6a5cd | 51 | #include <linux/kmod.h> |
e6a1105b | 52 | #include <linux/module.h> |
846c7bb0 BS |
53 | #include <linux/delayacct.h> |
54 | #include <linux/cgroupstats.h> | |
472b1053 | 55 | #include <linux/hash.h> |
3f8206d4 | 56 | #include <linux/namei.h> |
096b7fe0 | 57 | #include <linux/pid_namespace.h> |
2c6ab6d2 | 58 | #include <linux/idr.h> |
d1d9fd33 | 59 | #include <linux/vmalloc.h> /* TODO: replace with more sophisticated array */ |
0dea1168 KS |
60 | #include <linux/eventfd.h> |
61 | #include <linux/poll.h> | |
d846687d | 62 | #include <linux/flex_array.h> /* used in cgroup_attach_proc */ |
c4c27fbd | 63 | #include <linux/kthread.h> |
846c7bb0 | 64 | |
60063497 | 65 | #include <linux/atomic.h> |
ddbcc7e8 | 66 | |
28b4c27b TH |
67 | /* css deactivation bias, makes css->refcnt negative to deny new trygets */ |
68 | #define CSS_DEACT_BIAS INT_MIN | |
69 | ||
e25e2cbb TH |
70 | /* |
71 | * cgroup_mutex is the master lock. Any modification to cgroup or its | |
72 | * hierarchy must be performed while holding it. | |
73 | * | |
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. | |
79 | * | |
80 | * A. cgroup_mutex -> cred_guard_mutex -> s_type->i_mutex_key -> namespace_sem | |
81 | * B. namespace_sem -> cgroup_mutex | |
82 | * | |
83 | * B happens only through cgroup_show_options() and using cgroup_root_mutex | |
84 | * breaks it. | |
85 | */ | |
81a6a5cd | 86 | static DEFINE_MUTEX(cgroup_mutex); |
e25e2cbb | 87 | static DEFINE_MUTEX(cgroup_root_mutex); |
81a6a5cd | 88 | |
aae8aab4 BB |
89 | /* |
90 | * Generate an array of cgroup subsystem pointers. At boot time, this is | |
be45c900 | 91 | * populated with the built in subsystems, and modular subsystems are |
aae8aab4 BB |
92 | * registered after that. The mutable section of this array is protected by |
93 | * cgroup_mutex. | |
94 | */ | |
80f4c877 | 95 | #define SUBSYS(_x) [_x ## _subsys_id] = &_x ## _subsys, |
5fc0b025 | 96 | #define IS_SUBSYS_ENABLED(option) IS_BUILTIN(option) |
aae8aab4 | 97 | static struct cgroup_subsys *subsys[CGROUP_SUBSYS_COUNT] = { |
ddbcc7e8 PM |
98 | #include <linux/cgroup_subsys.h> |
99 | }; | |
100 | ||
c6d57f33 PM |
101 | #define MAX_CGROUP_ROOT_NAMELEN 64 |
102 | ||
ddbcc7e8 PM |
103 | /* |
104 | * A cgroupfs_root represents the root of a cgroup hierarchy, | |
105 | * and may be associated with a superblock to form an active | |
106 | * hierarchy | |
107 | */ | |
108 | struct cgroupfs_root { | |
109 | struct super_block *sb; | |
110 | ||
111 | /* | |
112 | * The bitmask of subsystems intended to be attached to this | |
113 | * hierarchy | |
114 | */ | |
a1a71b45 | 115 | unsigned long subsys_mask; |
ddbcc7e8 | 116 | |
2c6ab6d2 PM |
117 | /* Unique id for this hierarchy. */ |
118 | int hierarchy_id; | |
119 | ||
ddbcc7e8 | 120 | /* The bitmask of subsystems currently attached to this hierarchy */ |
a1a71b45 | 121 | unsigned long actual_subsys_mask; |
ddbcc7e8 PM |
122 | |
123 | /* A list running through the attached subsystems */ | |
124 | struct list_head subsys_list; | |
125 | ||
126 | /* The root cgroup for this hierarchy */ | |
127 | struct cgroup top_cgroup; | |
128 | ||
129 | /* Tracks how many cgroups are currently defined in hierarchy.*/ | |
130 | int number_of_cgroups; | |
131 | ||
e5f6a860 | 132 | /* A list running through the active hierarchies */ |
ddbcc7e8 PM |
133 | struct list_head root_list; |
134 | ||
b0ca5a84 TH |
135 | /* All cgroups on this root, cgroup_mutex protected */ |
136 | struct list_head allcg_list; | |
137 | ||
ddbcc7e8 PM |
138 | /* Hierarchy-specific flags */ |
139 | unsigned long flags; | |
81a6a5cd | 140 | |
0a950f65 TH |
141 | /* IDs for cgroups in this hierarchy */ |
142 | struct ida cgroup_ida; | |
143 | ||
e788e066 | 144 | /* The path to use for release notifications. */ |
81a6a5cd | 145 | char release_agent_path[PATH_MAX]; |
c6d57f33 PM |
146 | |
147 | /* The name for this hierarchy - may be empty */ | |
148 | char name[MAX_CGROUP_ROOT_NAMELEN]; | |
ddbcc7e8 PM |
149 | }; |
150 | ||
ddbcc7e8 PM |
151 | /* |
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. | |
155 | */ | |
156 | static struct cgroupfs_root rootnode; | |
157 | ||
05ef1d7c TH |
158 | /* |
159 | * cgroupfs file entry, pointed to from leaf dentry->d_fsdata. | |
160 | */ | |
161 | struct cfent { | |
162 | struct list_head node; | |
163 | struct dentry *dentry; | |
164 | struct cftype *type; | |
165 | }; | |
166 | ||
38460b48 KH |
167 | /* |
168 | * CSS ID -- ID per subsys's Cgroup Subsys State(CSS). used only when | |
169 | * cgroup_subsys->use_id != 0. | |
170 | */ | |
171 | #define CSS_ID_MAX (65535) | |
172 | struct css_id { | |
173 | /* | |
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() | |
e9316080 TH |
177 | * is called after synchronize_rcu(). But for safe use, css_tryget() |
178 | * should be used for avoiding race. | |
38460b48 | 179 | */ |
2c392b8c | 180 | struct cgroup_subsys_state __rcu *css; |
38460b48 KH |
181 | /* |
182 | * ID of this css. | |
183 | */ | |
184 | unsigned short id; | |
185 | /* | |
186 | * Depth in hierarchy which this ID belongs to. | |
187 | */ | |
188 | unsigned short depth; | |
189 | /* | |
190 | * ID is freed by RCU. (and lookup routine is RCU safe.) | |
191 | */ | |
192 | struct rcu_head rcu_head; | |
193 | /* | |
194 | * Hierarchy of CSS ID belongs to. | |
195 | */ | |
196 | unsigned short stack[0]; /* Array of Length (depth+1) */ | |
197 | }; | |
198 | ||
0dea1168 | 199 | /* |
25985edc | 200 | * cgroup_event represents events which userspace want to receive. |
0dea1168 KS |
201 | */ |
202 | struct cgroup_event { | |
203 | /* | |
204 | * Cgroup which the event belongs to. | |
205 | */ | |
206 | struct cgroup *cgrp; | |
207 | /* | |
208 | * Control file which the event associated. | |
209 | */ | |
210 | struct cftype *cft; | |
211 | /* | |
212 | * eventfd to signal userspace about the event. | |
213 | */ | |
214 | struct eventfd_ctx *eventfd; | |
215 | /* | |
216 | * Each of these stored in a list by the cgroup. | |
217 | */ | |
218 | struct list_head list; | |
219 | /* | |
220 | * All fields below needed to unregister event when | |
221 | * userspace closes eventfd. | |
222 | */ | |
223 | poll_table pt; | |
224 | wait_queue_head_t *wqh; | |
225 | wait_queue_t wait; | |
226 | struct work_struct remove; | |
227 | }; | |
38460b48 | 228 | |
ddbcc7e8 PM |
229 | /* The list of hierarchy roots */ |
230 | ||
231 | static LIST_HEAD(roots); | |
817929ec | 232 | static int root_count; |
ddbcc7e8 | 233 | |
2c6ab6d2 PM |
234 | static DEFINE_IDA(hierarchy_ida); |
235 | static int next_hierarchy_id; | |
236 | static DEFINE_SPINLOCK(hierarchy_id_lock); | |
237 | ||
ddbcc7e8 PM |
238 | /* dummytop is a shorthand for the dummy hierarchy's top cgroup */ |
239 | #define dummytop (&rootnode.top_cgroup) | |
240 | ||
241 | /* This flag indicates whether tasks in the fork and exit paths should | |
a043e3b2 LZ |
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 | |
244 | * be called. | |
ddbcc7e8 | 245 | */ |
8947f9d5 | 246 | static int need_forkexit_callback __read_mostly; |
ddbcc7e8 | 247 | |
42809dd4 | 248 | static int cgroup_destroy_locked(struct cgroup *cgrp); |
879a3d9d G |
249 | static int cgroup_addrm_files(struct cgroup *cgrp, struct cgroup_subsys *subsys, |
250 | struct cftype cfts[], bool is_add); | |
42809dd4 | 251 | |
d11c563d PM |
252 | #ifdef CONFIG_PROVE_LOCKING |
253 | int cgroup_lock_is_held(void) | |
254 | { | |
255 | return lockdep_is_held(&cgroup_mutex); | |
256 | } | |
257 | #else /* #ifdef CONFIG_PROVE_LOCKING */ | |
258 | int cgroup_lock_is_held(void) | |
259 | { | |
260 | return mutex_is_locked(&cgroup_mutex); | |
261 | } | |
262 | #endif /* #else #ifdef CONFIG_PROVE_LOCKING */ | |
263 | ||
264 | EXPORT_SYMBOL_GPL(cgroup_lock_is_held); | |
265 | ||
8e3bbf42 SQ |
266 | static int css_unbias_refcnt(int refcnt) |
267 | { | |
268 | return refcnt >= 0 ? refcnt : refcnt - CSS_DEACT_BIAS; | |
269 | } | |
270 | ||
28b4c27b TH |
271 | /* the current nr of refs, always >= 0 whether @css is deactivated or not */ |
272 | static int css_refcnt(struct cgroup_subsys_state *css) | |
273 | { | |
274 | int v = atomic_read(&css->refcnt); | |
275 | ||
8e3bbf42 | 276 | return css_unbias_refcnt(v); |
28b4c27b TH |
277 | } |
278 | ||
ddbcc7e8 | 279 | /* convenient tests for these bits */ |
bd89aabc | 280 | inline int cgroup_is_removed(const struct cgroup *cgrp) |
ddbcc7e8 | 281 | { |
bd89aabc | 282 | return test_bit(CGRP_REMOVED, &cgrp->flags); |
ddbcc7e8 PM |
283 | } |
284 | ||
285 | /* bits in struct cgroupfs_root flags field */ | |
286 | enum { | |
03b1cde6 AR |
287 | ROOT_NOPREFIX, /* mounted subsystems have no named prefix */ |
288 | ROOT_XATTR, /* supports extended attributes */ | |
ddbcc7e8 PM |
289 | }; |
290 | ||
e9685a03 | 291 | static int cgroup_is_releasable(const struct cgroup *cgrp) |
81a6a5cd PM |
292 | { |
293 | const int bits = | |
bd89aabc PM |
294 | (1 << CGRP_RELEASABLE) | |
295 | (1 << CGRP_NOTIFY_ON_RELEASE); | |
296 | return (cgrp->flags & bits) == bits; | |
81a6a5cd PM |
297 | } |
298 | ||
e9685a03 | 299 | static int notify_on_release(const struct cgroup *cgrp) |
81a6a5cd | 300 | { |
bd89aabc | 301 | return test_bit(CGRP_NOTIFY_ON_RELEASE, &cgrp->flags); |
81a6a5cd PM |
302 | } |
303 | ||
ddbcc7e8 PM |
304 | /* |
305 | * for_each_subsys() allows you to iterate on each subsystem attached to | |
306 | * an active hierarchy | |
307 | */ | |
308 | #define for_each_subsys(_root, _ss) \ | |
309 | list_for_each_entry(_ss, &_root->subsys_list, sibling) | |
310 | ||
e5f6a860 LZ |
311 | /* for_each_active_root() allows you to iterate across the active hierarchies */ |
312 | #define for_each_active_root(_root) \ | |
ddbcc7e8 PM |
313 | list_for_each_entry(_root, &roots, root_list) |
314 | ||
f6ea9372 TH |
315 | static inline struct cgroup *__d_cgrp(struct dentry *dentry) |
316 | { | |
317 | return dentry->d_fsdata; | |
318 | } | |
319 | ||
05ef1d7c | 320 | static inline struct cfent *__d_cfe(struct dentry *dentry) |
f6ea9372 TH |
321 | { |
322 | return dentry->d_fsdata; | |
323 | } | |
324 | ||
05ef1d7c TH |
325 | static inline struct cftype *__d_cft(struct dentry *dentry) |
326 | { | |
327 | return __d_cfe(dentry)->type; | |
328 | } | |
329 | ||
81a6a5cd PM |
330 | /* the list of cgroups eligible for automatic release. Protected by |
331 | * release_list_lock */ | |
332 | static LIST_HEAD(release_list); | |
cdcc136f | 333 | static DEFINE_RAW_SPINLOCK(release_list_lock); |
81a6a5cd PM |
334 | static void cgroup_release_agent(struct work_struct *work); |
335 | static DECLARE_WORK(release_agent_work, cgroup_release_agent); | |
bd89aabc | 336 | static void check_for_release(struct cgroup *cgrp); |
81a6a5cd | 337 | |
817929ec PM |
338 | /* Link structure for associating css_set objects with cgroups */ |
339 | struct cg_cgroup_link { | |
340 | /* | |
341 | * List running through cg_cgroup_links associated with a | |
342 | * cgroup, anchored on cgroup->css_sets | |
343 | */ | |
bd89aabc | 344 | struct list_head cgrp_link_list; |
7717f7ba | 345 | struct cgroup *cgrp; |
817929ec PM |
346 | /* |
347 | * List running through cg_cgroup_links pointing at a | |
348 | * single css_set object, anchored on css_set->cg_links | |
349 | */ | |
350 | struct list_head cg_link_list; | |
351 | struct css_set *cg; | |
352 | }; | |
353 | ||
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. | |
359 | */ | |
360 | ||
361 | static struct css_set init_css_set; | |
362 | static struct cg_cgroup_link init_css_set_link; | |
363 | ||
e6a1105b BB |
364 | static int cgroup_init_idr(struct cgroup_subsys *ss, |
365 | struct cgroup_subsys_state *css); | |
38460b48 | 366 | |
817929ec PM |
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; | |
372 | ||
7717f7ba PM |
373 | /* |
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. | |
377 | */ | |
472b1053 LZ |
378 | #define CSS_SET_HASH_BITS 7 |
379 | #define CSS_SET_TABLE_SIZE (1 << CSS_SET_HASH_BITS) | |
380 | static struct hlist_head css_set_table[CSS_SET_TABLE_SIZE]; | |
381 | ||
382 | static struct hlist_head *css_set_hash(struct cgroup_subsys_state *css[]) | |
383 | { | |
384 | int i; | |
385 | int index; | |
386 | unsigned long tmp = 0UL; | |
387 | ||
388 | for (i = 0; i < CGROUP_SUBSYS_COUNT; i++) | |
389 | tmp += (unsigned long)css[i]; | |
390 | tmp = (tmp >> 16) ^ tmp; | |
391 | ||
392 | index = hash_long(tmp, CSS_SET_HASH_BITS); | |
393 | ||
394 | return &css_set_table[index]; | |
395 | } | |
396 | ||
817929ec PM |
397 | /* We don't maintain the lists running through each css_set to its |
398 | * task until after the first call to cgroup_iter_start(). This | |
399 | * reduces the fork()/exit() overhead for people who have cgroups | |
400 | * compiled into their kernel but not actually in use */ | |
8947f9d5 | 401 | static int use_task_css_set_links __read_mostly; |
817929ec | 402 | |
2c6ab6d2 | 403 | static void __put_css_set(struct css_set *cg, int taskexit) |
b4f48b63 | 404 | { |
71cbb949 KM |
405 | struct cg_cgroup_link *link; |
406 | struct cg_cgroup_link *saved_link; | |
146aa1bd LJ |
407 | /* |
408 | * Ensure that the refcount doesn't hit zero while any readers | |
409 | * can see it. Similar to atomic_dec_and_lock(), but for an | |
410 | * rwlock | |
411 | */ | |
412 | if (atomic_add_unless(&cg->refcount, -1, 1)) | |
413 | return; | |
414 | write_lock(&css_set_lock); | |
415 | if (!atomic_dec_and_test(&cg->refcount)) { | |
416 | write_unlock(&css_set_lock); | |
417 | return; | |
418 | } | |
81a6a5cd | 419 | |
2c6ab6d2 PM |
420 | /* This css_set is dead. unlink it and release cgroup refcounts */ |
421 | hlist_del(&cg->hlist); | |
422 | css_set_count--; | |
423 | ||
424 | list_for_each_entry_safe(link, saved_link, &cg->cg_links, | |
425 | cg_link_list) { | |
426 | struct cgroup *cgrp = link->cgrp; | |
427 | list_del(&link->cg_link_list); | |
428 | list_del(&link->cgrp_link_list); | |
bd89aabc PM |
429 | if (atomic_dec_and_test(&cgrp->count) && |
430 | notify_on_release(cgrp)) { | |
81a6a5cd | 431 | if (taskexit) |
bd89aabc PM |
432 | set_bit(CGRP_RELEASABLE, &cgrp->flags); |
433 | check_for_release(cgrp); | |
81a6a5cd | 434 | } |
2c6ab6d2 PM |
435 | |
436 | kfree(link); | |
81a6a5cd | 437 | } |
2c6ab6d2 PM |
438 | |
439 | write_unlock(&css_set_lock); | |
30088ad8 | 440 | kfree_rcu(cg, rcu_head); |
b4f48b63 PM |
441 | } |
442 | ||
817929ec PM |
443 | /* |
444 | * refcounted get/put for css_set objects | |
445 | */ | |
446 | static inline void get_css_set(struct css_set *cg) | |
447 | { | |
146aa1bd | 448 | atomic_inc(&cg->refcount); |
817929ec PM |
449 | } |
450 | ||
451 | static inline void put_css_set(struct css_set *cg) | |
452 | { | |
146aa1bd | 453 | __put_css_set(cg, 0); |
817929ec PM |
454 | } |
455 | ||
81a6a5cd PM |
456 | static inline void put_css_set_taskexit(struct css_set *cg) |
457 | { | |
146aa1bd | 458 | __put_css_set(cg, 1); |
81a6a5cd PM |
459 | } |
460 | ||
7717f7ba PM |
461 | /* |
462 | * compare_css_sets - helper function for find_existing_css_set(). | |
463 | * @cg: candidate css_set being tested | |
464 | * @old_cg: existing css_set for a task | |
465 | * @new_cgrp: cgroup that's being entered by the task | |
466 | * @template: desired set of css pointers in css_set (pre-calculated) | |
467 | * | |
468 | * Returns true if "cg" matches "old_cg" except for the hierarchy | |
469 | * which "new_cgrp" belongs to, for which it should match "new_cgrp". | |
470 | */ | |
471 | static bool compare_css_sets(struct css_set *cg, | |
472 | struct css_set *old_cg, | |
473 | struct cgroup *new_cgrp, | |
474 | struct cgroup_subsys_state *template[]) | |
475 | { | |
476 | struct list_head *l1, *l2; | |
477 | ||
478 | if (memcmp(template, cg->subsys, sizeof(cg->subsys))) { | |
479 | /* Not all subsystems matched */ | |
480 | return false; | |
481 | } | |
482 | ||
483 | /* | |
484 | * Compare cgroup pointers in order to distinguish between | |
485 | * different cgroups in heirarchies with no subsystems. We | |
486 | * could get by with just this check alone (and skip the | |
487 | * memcmp above) but on most setups the memcmp check will | |
488 | * avoid the need for this more expensive check on almost all | |
489 | * candidates. | |
490 | */ | |
491 | ||
492 | l1 = &cg->cg_links; | |
493 | l2 = &old_cg->cg_links; | |
494 | while (1) { | |
495 | struct cg_cgroup_link *cgl1, *cgl2; | |
496 | struct cgroup *cg1, *cg2; | |
497 | ||
498 | l1 = l1->next; | |
499 | l2 = l2->next; | |
500 | /* See if we reached the end - both lists are equal length. */ | |
501 | if (l1 == &cg->cg_links) { | |
502 | BUG_ON(l2 != &old_cg->cg_links); | |
503 | break; | |
504 | } else { | |
505 | BUG_ON(l2 == &old_cg->cg_links); | |
506 | } | |
507 | /* Locate the cgroups associated with these links. */ | |
508 | cgl1 = list_entry(l1, struct cg_cgroup_link, cg_link_list); | |
509 | cgl2 = list_entry(l2, struct cg_cgroup_link, cg_link_list); | |
510 | cg1 = cgl1->cgrp; | |
511 | cg2 = cgl2->cgrp; | |
512 | /* Hierarchies should be linked in the same order. */ | |
513 | BUG_ON(cg1->root != cg2->root); | |
514 | ||
515 | /* | |
516 | * If this hierarchy is the hierarchy of the cgroup | |
517 | * that's changing, then we need to check that this | |
518 | * css_set points to the new cgroup; if it's any other | |
519 | * hierarchy, then this css_set should point to the | |
520 | * same cgroup as the old css_set. | |
521 | */ | |
522 | if (cg1->root == new_cgrp->root) { | |
523 | if (cg1 != new_cgrp) | |
524 | return false; | |
525 | } else { | |
526 | if (cg1 != cg2) | |
527 | return false; | |
528 | } | |
529 | } | |
530 | return true; | |
531 | } | |
532 | ||
817929ec PM |
533 | /* |
534 | * find_existing_css_set() is a helper for | |
535 | * find_css_set(), and checks to see whether an existing | |
472b1053 | 536 | * css_set is suitable. |
817929ec PM |
537 | * |
538 | * oldcg: the cgroup group that we're using before the cgroup | |
539 | * transition | |
540 | * | |
bd89aabc | 541 | * cgrp: the cgroup that we're moving into |
817929ec PM |
542 | * |
543 | * template: location in which to build the desired set of subsystem | |
544 | * state objects for the new cgroup group | |
545 | */ | |
817929ec PM |
546 | static struct css_set *find_existing_css_set( |
547 | struct css_set *oldcg, | |
bd89aabc | 548 | struct cgroup *cgrp, |
817929ec | 549 | struct cgroup_subsys_state *template[]) |
b4f48b63 PM |
550 | { |
551 | int i; | |
bd89aabc | 552 | struct cgroupfs_root *root = cgrp->root; |
472b1053 LZ |
553 | struct hlist_head *hhead; |
554 | struct hlist_node *node; | |
555 | struct css_set *cg; | |
817929ec | 556 | |
aae8aab4 BB |
557 | /* |
558 | * Build the set of subsystem state objects that we want to see in the | |
559 | * new css_set. while subsystems can change globally, the entries here | |
560 | * won't change, so no need for locking. | |
561 | */ | |
817929ec | 562 | for (i = 0; i < CGROUP_SUBSYS_COUNT; i++) { |
a1a71b45 | 563 | if (root->subsys_mask & (1UL << i)) { |
817929ec PM |
564 | /* Subsystem is in this hierarchy. So we want |
565 | * the subsystem state from the new | |
566 | * cgroup */ | |
bd89aabc | 567 | template[i] = cgrp->subsys[i]; |
817929ec PM |
568 | } else { |
569 | /* Subsystem is not in this hierarchy, so we | |
570 | * don't want to change the subsystem state */ | |
571 | template[i] = oldcg->subsys[i]; | |
572 | } | |
573 | } | |
574 | ||
472b1053 LZ |
575 | hhead = css_set_hash(template); |
576 | hlist_for_each_entry(cg, node, hhead, hlist) { | |
7717f7ba PM |
577 | if (!compare_css_sets(cg, oldcg, cgrp, template)) |
578 | continue; | |
579 | ||
580 | /* This css_set matches what we need */ | |
581 | return cg; | |
472b1053 | 582 | } |
817929ec PM |
583 | |
584 | /* No existing cgroup group matched */ | |
585 | return NULL; | |
586 | } | |
587 | ||
36553434 LZ |
588 | static void free_cg_links(struct list_head *tmp) |
589 | { | |
590 | struct cg_cgroup_link *link; | |
591 | struct cg_cgroup_link *saved_link; | |
592 | ||
593 | list_for_each_entry_safe(link, saved_link, tmp, cgrp_link_list) { | |
594 | list_del(&link->cgrp_link_list); | |
595 | kfree(link); | |
596 | } | |
597 | } | |
598 | ||
817929ec PM |
599 | /* |
600 | * allocate_cg_links() allocates "count" cg_cgroup_link structures | |
bd89aabc | 601 | * and chains them on tmp through their cgrp_link_list fields. Returns 0 on |
817929ec PM |
602 | * success or a negative error |
603 | */ | |
817929ec PM |
604 | static int allocate_cg_links(int count, struct list_head *tmp) |
605 | { | |
606 | struct cg_cgroup_link *link; | |
607 | int i; | |
608 | INIT_LIST_HEAD(tmp); | |
609 | for (i = 0; i < count; i++) { | |
610 | link = kmalloc(sizeof(*link), GFP_KERNEL); | |
611 | if (!link) { | |
36553434 | 612 | free_cg_links(tmp); |
817929ec PM |
613 | return -ENOMEM; |
614 | } | |
bd89aabc | 615 | list_add(&link->cgrp_link_list, tmp); |
817929ec PM |
616 | } |
617 | return 0; | |
618 | } | |
619 | ||
c12f65d4 LZ |
620 | /** |
621 | * link_css_set - a helper function to link a css_set to a cgroup | |
622 | * @tmp_cg_links: cg_cgroup_link objects allocated by allocate_cg_links() | |
623 | * @cg: the css_set to be linked | |
624 | * @cgrp: the destination cgroup | |
625 | */ | |
626 | static void link_css_set(struct list_head *tmp_cg_links, | |
627 | struct css_set *cg, struct cgroup *cgrp) | |
628 | { | |
629 | struct cg_cgroup_link *link; | |
630 | ||
631 | BUG_ON(list_empty(tmp_cg_links)); | |
632 | link = list_first_entry(tmp_cg_links, struct cg_cgroup_link, | |
633 | cgrp_link_list); | |
634 | link->cg = cg; | |
7717f7ba | 635 | link->cgrp = cgrp; |
2c6ab6d2 | 636 | atomic_inc(&cgrp->count); |
c12f65d4 | 637 | list_move(&link->cgrp_link_list, &cgrp->css_sets); |
7717f7ba PM |
638 | /* |
639 | * Always add links to the tail of the list so that the list | |
640 | * is sorted by order of hierarchy creation | |
641 | */ | |
642 | list_add_tail(&link->cg_link_list, &cg->cg_links); | |
c12f65d4 LZ |
643 | } |
644 | ||
817929ec PM |
645 | /* |
646 | * find_css_set() takes an existing cgroup group and a | |
647 | * cgroup object, and returns a css_set object that's | |
648 | * equivalent to the old group, but with the given cgroup | |
649 | * substituted into the appropriate hierarchy. Must be called with | |
650 | * cgroup_mutex held | |
651 | */ | |
817929ec | 652 | static struct css_set *find_css_set( |
bd89aabc | 653 | struct css_set *oldcg, struct cgroup *cgrp) |
817929ec PM |
654 | { |
655 | struct css_set *res; | |
656 | struct cgroup_subsys_state *template[CGROUP_SUBSYS_COUNT]; | |
817929ec PM |
657 | |
658 | struct list_head tmp_cg_links; | |
817929ec | 659 | |
472b1053 | 660 | struct hlist_head *hhead; |
7717f7ba | 661 | struct cg_cgroup_link *link; |
472b1053 | 662 | |
817929ec PM |
663 | /* First see if we already have a cgroup group that matches |
664 | * the desired set */ | |
7e9abd89 | 665 | read_lock(&css_set_lock); |
bd89aabc | 666 | res = find_existing_css_set(oldcg, cgrp, template); |
817929ec PM |
667 | if (res) |
668 | get_css_set(res); | |
7e9abd89 | 669 | read_unlock(&css_set_lock); |
817929ec PM |
670 | |
671 | if (res) | |
672 | return res; | |
673 | ||
674 | res = kmalloc(sizeof(*res), GFP_KERNEL); | |
675 | if (!res) | |
676 | return NULL; | |
677 | ||
678 | /* Allocate all the cg_cgroup_link objects that we'll need */ | |
679 | if (allocate_cg_links(root_count, &tmp_cg_links) < 0) { | |
680 | kfree(res); | |
681 | return NULL; | |
682 | } | |
683 | ||
146aa1bd | 684 | atomic_set(&res->refcount, 1); |
817929ec PM |
685 | INIT_LIST_HEAD(&res->cg_links); |
686 | INIT_LIST_HEAD(&res->tasks); | |
472b1053 | 687 | INIT_HLIST_NODE(&res->hlist); |
817929ec PM |
688 | |
689 | /* Copy the set of subsystem state objects generated in | |
690 | * find_existing_css_set() */ | |
691 | memcpy(res->subsys, template, sizeof(res->subsys)); | |
692 | ||
693 | write_lock(&css_set_lock); | |
694 | /* Add reference counts and links from the new css_set. */ | |
7717f7ba PM |
695 | list_for_each_entry(link, &oldcg->cg_links, cg_link_list) { |
696 | struct cgroup *c = link->cgrp; | |
697 | if (c->root == cgrp->root) | |
698 | c = cgrp; | |
699 | link_css_set(&tmp_cg_links, res, c); | |
700 | } | |
817929ec PM |
701 | |
702 | BUG_ON(!list_empty(&tmp_cg_links)); | |
703 | ||
817929ec | 704 | css_set_count++; |
472b1053 LZ |
705 | |
706 | /* Add this cgroup group to the hash table */ | |
707 | hhead = css_set_hash(res->subsys); | |
708 | hlist_add_head(&res->hlist, hhead); | |
709 | ||
817929ec PM |
710 | write_unlock(&css_set_lock); |
711 | ||
712 | return res; | |
b4f48b63 PM |
713 | } |
714 | ||
7717f7ba PM |
715 | /* |
716 | * Return the cgroup for "task" from the given hierarchy. Must be | |
717 | * called with cgroup_mutex held. | |
718 | */ | |
719 | static struct cgroup *task_cgroup_from_root(struct task_struct *task, | |
720 | struct cgroupfs_root *root) | |
721 | { | |
722 | struct css_set *css; | |
723 | struct cgroup *res = NULL; | |
724 | ||
725 | BUG_ON(!mutex_is_locked(&cgroup_mutex)); | |
726 | read_lock(&css_set_lock); | |
727 | /* | |
728 | * No need to lock the task - since we hold cgroup_mutex the | |
729 | * task can't change groups, so the only thing that can happen | |
730 | * is that it exits and its css is set back to init_css_set. | |
731 | */ | |
732 | css = task->cgroups; | |
733 | if (css == &init_css_set) { | |
734 | res = &root->top_cgroup; | |
735 | } else { | |
736 | struct cg_cgroup_link *link; | |
737 | list_for_each_entry(link, &css->cg_links, cg_link_list) { | |
738 | struct cgroup *c = link->cgrp; | |
739 | if (c->root == root) { | |
740 | res = c; | |
741 | break; | |
742 | } | |
743 | } | |
744 | } | |
745 | read_unlock(&css_set_lock); | |
746 | BUG_ON(!res); | |
747 | return res; | |
748 | } | |
749 | ||
ddbcc7e8 PM |
750 | /* |
751 | * There is one global cgroup mutex. We also require taking | |
752 | * task_lock() when dereferencing a task's cgroup subsys pointers. | |
753 | * See "The task_lock() exception", at the end of this comment. | |
754 | * | |
755 | * A task must hold cgroup_mutex to modify cgroups. | |
756 | * | |
757 | * Any task can increment and decrement the count field without lock. | |
758 | * So in general, code holding cgroup_mutex can't rely on the count | |
759 | * field not changing. However, if the count goes to zero, then only | |
956db3ca | 760 | * cgroup_attach_task() can increment it again. Because a count of zero |
ddbcc7e8 PM |
761 | * means that no tasks are currently attached, therefore there is no |
762 | * way a task attached to that cgroup can fork (the other way to | |
763 | * increment the count). So code holding cgroup_mutex can safely | |
764 | * assume that if the count is zero, it will stay zero. Similarly, if | |
765 | * a task holds cgroup_mutex on a cgroup with zero count, it | |
766 | * knows that the cgroup won't be removed, as cgroup_rmdir() | |
767 | * needs that mutex. | |
768 | * | |
ddbcc7e8 PM |
769 | * The fork and exit callbacks cgroup_fork() and cgroup_exit(), don't |
770 | * (usually) take cgroup_mutex. These are the two most performance | |
771 | * critical pieces of code here. The exception occurs on cgroup_exit(), | |
772 | * when a task in a notify_on_release cgroup exits. Then cgroup_mutex | |
773 | * is taken, and if the cgroup count is zero, a usermode call made | |
a043e3b2 LZ |
774 | * to the release agent with the name of the cgroup (path relative to |
775 | * the root of cgroup file system) as the argument. | |
ddbcc7e8 PM |
776 | * |
777 | * A cgroup can only be deleted if both its 'count' of using tasks | |
778 | * is zero, and its list of 'children' cgroups is empty. Since all | |
779 | * tasks in the system use _some_ cgroup, and since there is always at | |
780 | * least one task in the system (init, pid == 1), therefore, top_cgroup | |
781 | * always has either children cgroups and/or using tasks. So we don't | |
782 | * need a special hack to ensure that top_cgroup cannot be deleted. | |
783 | * | |
784 | * The task_lock() exception | |
785 | * | |
786 | * The need for this exception arises from the action of | |
d0b2fdd2 | 787 | * cgroup_attach_task(), which overwrites one task's cgroup pointer with |
a043e3b2 | 788 | * another. It does so using cgroup_mutex, however there are |
ddbcc7e8 PM |
789 | * several performance critical places that need to reference |
790 | * task->cgroup without the expense of grabbing a system global | |
791 | * mutex. Therefore except as noted below, when dereferencing or, as | |
d0b2fdd2 | 792 | * in cgroup_attach_task(), modifying a task's cgroup pointer we use |
ddbcc7e8 PM |
793 | * task_lock(), which acts on a spinlock (task->alloc_lock) already in |
794 | * the task_struct routinely used for such matters. | |
795 | * | |
796 | * P.S. One more locking exception. RCU is used to guard the | |
956db3ca | 797 | * update of a tasks cgroup pointer by cgroup_attach_task() |
ddbcc7e8 PM |
798 | */ |
799 | ||
ddbcc7e8 PM |
800 | /** |
801 | * cgroup_lock - lock out any changes to cgroup structures | |
802 | * | |
803 | */ | |
ddbcc7e8 PM |
804 | void cgroup_lock(void) |
805 | { | |
806 | mutex_lock(&cgroup_mutex); | |
807 | } | |
67523c48 | 808 | EXPORT_SYMBOL_GPL(cgroup_lock); |
ddbcc7e8 PM |
809 | |
810 | /** | |
811 | * cgroup_unlock - release lock on cgroup changes | |
812 | * | |
813 | * Undo the lock taken in a previous cgroup_lock() call. | |
814 | */ | |
ddbcc7e8 PM |
815 | void cgroup_unlock(void) |
816 | { | |
817 | mutex_unlock(&cgroup_mutex); | |
818 | } | |
67523c48 | 819 | EXPORT_SYMBOL_GPL(cgroup_unlock); |
ddbcc7e8 PM |
820 | |
821 | /* | |
822 | * A couple of forward declarations required, due to cyclic reference loop: | |
823 | * cgroup_mkdir -> cgroup_create -> cgroup_populate_dir -> | |
824 | * cgroup_add_file -> cgroup_create_file -> cgroup_dir_inode_operations | |
825 | * -> cgroup_mkdir. | |
826 | */ | |
827 | ||
18bb1db3 | 828 | static int cgroup_mkdir(struct inode *dir, struct dentry *dentry, umode_t mode); |
00cd8dd3 | 829 | static struct dentry *cgroup_lookup(struct inode *, struct dentry *, unsigned int); |
ddbcc7e8 | 830 | static int cgroup_rmdir(struct inode *unused_dir, struct dentry *dentry); |
13af07df AR |
831 | static int cgroup_populate_dir(struct cgroup *cgrp, bool base_files, |
832 | unsigned long subsys_mask); | |
6e1d5dcc | 833 | static const struct inode_operations cgroup_dir_inode_operations; |
828c0950 | 834 | static const struct file_operations proc_cgroupstats_operations; |
a424316c PM |
835 | |
836 | static struct backing_dev_info cgroup_backing_dev_info = { | |
d993831f | 837 | .name = "cgroup", |
e4ad08fe | 838 | .capabilities = BDI_CAP_NO_ACCT_AND_WRITEBACK, |
a424316c | 839 | }; |
ddbcc7e8 | 840 | |
38460b48 KH |
841 | static int alloc_css_id(struct cgroup_subsys *ss, |
842 | struct cgroup *parent, struct cgroup *child); | |
843 | ||
a5e7ed32 | 844 | static struct inode *cgroup_new_inode(umode_t mode, struct super_block *sb) |
ddbcc7e8 PM |
845 | { |
846 | struct inode *inode = new_inode(sb); | |
ddbcc7e8 PM |
847 | |
848 | if (inode) { | |
85fe4025 | 849 | inode->i_ino = get_next_ino(); |
ddbcc7e8 | 850 | inode->i_mode = mode; |
76aac0e9 DH |
851 | inode->i_uid = current_fsuid(); |
852 | inode->i_gid = current_fsgid(); | |
ddbcc7e8 PM |
853 | inode->i_atime = inode->i_mtime = inode->i_ctime = CURRENT_TIME; |
854 | inode->i_mapping->backing_dev_info = &cgroup_backing_dev_info; | |
855 | } | |
856 | return inode; | |
857 | } | |
858 | ||
859 | static void cgroup_diput(struct dentry *dentry, struct inode *inode) | |
860 | { | |
861 | /* is dentry a directory ? if so, kfree() associated cgroup */ | |
862 | if (S_ISDIR(inode->i_mode)) { | |
bd89aabc | 863 | struct cgroup *cgrp = dentry->d_fsdata; |
8dc4f3e1 | 864 | struct cgroup_subsys *ss; |
bd89aabc | 865 | BUG_ON(!(cgroup_is_removed(cgrp))); |
81a6a5cd PM |
866 | /* It's possible for external users to be holding css |
867 | * reference counts on a cgroup; css_put() needs to | |
868 | * be able to access the cgroup after decrementing | |
869 | * the reference count in order to know if it needs to | |
870 | * queue the cgroup to be handled by the release | |
871 | * agent */ | |
872 | synchronize_rcu(); | |
8dc4f3e1 PM |
873 | |
874 | mutex_lock(&cgroup_mutex); | |
875 | /* | |
876 | * Release the subsystem state objects. | |
877 | */ | |
75139b82 | 878 | for_each_subsys(cgrp->root, ss) |
92fb9748 | 879 | ss->css_free(cgrp); |
8dc4f3e1 PM |
880 | |
881 | cgrp->root->number_of_cgroups--; | |
882 | mutex_unlock(&cgroup_mutex); | |
883 | ||
a47295e6 | 884 | /* |
7db5b3ca TH |
885 | * Drop the active superblock reference that we took when we |
886 | * created the cgroup | |
a47295e6 | 887 | */ |
7db5b3ca | 888 | deactivate_super(cgrp->root->sb); |
8dc4f3e1 | 889 | |
72a8cb30 BB |
890 | /* |
891 | * if we're getting rid of the cgroup, refcount should ensure | |
892 | * that there are no pidlists left. | |
893 | */ | |
894 | BUG_ON(!list_empty(&cgrp->pidlists)); | |
895 | ||
03b1cde6 AR |
896 | simple_xattrs_free(&cgrp->xattrs); |
897 | ||
0a950f65 | 898 | ida_simple_remove(&cgrp->root->cgroup_ida, cgrp->id); |
f2da1c40 | 899 | kfree_rcu(cgrp, rcu_head); |
05ef1d7c TH |
900 | } else { |
901 | struct cfent *cfe = __d_cfe(dentry); | |
902 | struct cgroup *cgrp = dentry->d_parent->d_fsdata; | |
03b1cde6 | 903 | struct cftype *cft = cfe->type; |
05ef1d7c TH |
904 | |
905 | WARN_ONCE(!list_empty(&cfe->node) && | |
906 | cgrp != &cgrp->root->top_cgroup, | |
907 | "cfe still linked for %s\n", cfe->type->name); | |
908 | kfree(cfe); | |
03b1cde6 | 909 | simple_xattrs_free(&cft->xattrs); |
ddbcc7e8 PM |
910 | } |
911 | iput(inode); | |
912 | } | |
913 | ||
c72a04e3 AV |
914 | static int cgroup_delete(const struct dentry *d) |
915 | { | |
916 | return 1; | |
917 | } | |
918 | ||
ddbcc7e8 PM |
919 | static void remove_dir(struct dentry *d) |
920 | { | |
921 | struct dentry *parent = dget(d->d_parent); | |
922 | ||
923 | d_delete(d); | |
924 | simple_rmdir(parent->d_inode, d); | |
925 | dput(parent); | |
926 | } | |
927 | ||
05ef1d7c TH |
928 | static int cgroup_rm_file(struct cgroup *cgrp, const struct cftype *cft) |
929 | { | |
930 | struct cfent *cfe; | |
931 | ||
932 | lockdep_assert_held(&cgrp->dentry->d_inode->i_mutex); | |
933 | lockdep_assert_held(&cgroup_mutex); | |
934 | ||
935 | list_for_each_entry(cfe, &cgrp->files, node) { | |
936 | struct dentry *d = cfe->dentry; | |
937 | ||
938 | if (cft && cfe->type != cft) | |
939 | continue; | |
940 | ||
941 | dget(d); | |
942 | d_delete(d); | |
ce27e317 | 943 | simple_unlink(cgrp->dentry->d_inode, d); |
05ef1d7c TH |
944 | list_del_init(&cfe->node); |
945 | dput(d); | |
946 | ||
947 | return 0; | |
ddbcc7e8 | 948 | } |
05ef1d7c TH |
949 | return -ENOENT; |
950 | } | |
951 | ||
13af07df AR |
952 | /** |
953 | * cgroup_clear_directory - selective removal of base and subsystem files | |
954 | * @dir: directory containing the files | |
955 | * @base_files: true if the base files should be removed | |
956 | * @subsys_mask: mask of the subsystem ids whose files should be removed | |
957 | */ | |
958 | static void cgroup_clear_directory(struct dentry *dir, bool base_files, | |
959 | unsigned long subsys_mask) | |
05ef1d7c TH |
960 | { |
961 | struct cgroup *cgrp = __d_cgrp(dir); | |
13af07df | 962 | struct cgroup_subsys *ss; |
05ef1d7c | 963 | |
13af07df AR |
964 | for_each_subsys(cgrp->root, ss) { |
965 | struct cftype_set *set; | |
966 | if (!test_bit(ss->subsys_id, &subsys_mask)) | |
967 | continue; | |
968 | list_for_each_entry(set, &ss->cftsets, node) | |
879a3d9d | 969 | cgroup_addrm_files(cgrp, NULL, set->cfts, false); |
13af07df AR |
970 | } |
971 | if (base_files) { | |
972 | while (!list_empty(&cgrp->files)) | |
973 | cgroup_rm_file(cgrp, NULL); | |
974 | } | |
ddbcc7e8 PM |
975 | } |
976 | ||
977 | /* | |
978 | * NOTE : the dentry must have been dget()'ed | |
979 | */ | |
980 | static void cgroup_d_remove_dir(struct dentry *dentry) | |
981 | { | |
2fd6b7f5 | 982 | struct dentry *parent; |
13af07df | 983 | struct cgroupfs_root *root = dentry->d_sb->s_fs_info; |
2fd6b7f5 | 984 | |
a1a71b45 | 985 | cgroup_clear_directory(dentry, true, root->subsys_mask); |
ddbcc7e8 | 986 | |
2fd6b7f5 NP |
987 | parent = dentry->d_parent; |
988 | spin_lock(&parent->d_lock); | |
3ec762ad | 989 | spin_lock_nested(&dentry->d_lock, DENTRY_D_LOCK_NESTED); |
ddbcc7e8 | 990 | list_del_init(&dentry->d_u.d_child); |
2fd6b7f5 NP |
991 | spin_unlock(&dentry->d_lock); |
992 | spin_unlock(&parent->d_lock); | |
ddbcc7e8 PM |
993 | remove_dir(dentry); |
994 | } | |
995 | ||
aae8aab4 | 996 | /* |
cf5d5941 BB |
997 | * Call with cgroup_mutex held. Drops reference counts on modules, including |
998 | * any duplicate ones that parse_cgroupfs_options took. If this function | |
999 | * returns an error, no reference counts are touched. | |
aae8aab4 | 1000 | */ |
ddbcc7e8 | 1001 | static int rebind_subsystems(struct cgroupfs_root *root, |
a1a71b45 | 1002 | unsigned long final_subsys_mask) |
ddbcc7e8 | 1003 | { |
a1a71b45 | 1004 | unsigned long added_mask, removed_mask; |
bd89aabc | 1005 | struct cgroup *cgrp = &root->top_cgroup; |
ddbcc7e8 PM |
1006 | int i; |
1007 | ||
aae8aab4 | 1008 | BUG_ON(!mutex_is_locked(&cgroup_mutex)); |
e25e2cbb | 1009 | BUG_ON(!mutex_is_locked(&cgroup_root_mutex)); |
aae8aab4 | 1010 | |
a1a71b45 AR |
1011 | removed_mask = root->actual_subsys_mask & ~final_subsys_mask; |
1012 | added_mask = final_subsys_mask & ~root->actual_subsys_mask; | |
ddbcc7e8 PM |
1013 | /* Check that any added subsystems are currently free */ |
1014 | for (i = 0; i < CGROUP_SUBSYS_COUNT; i++) { | |
8d53d55d | 1015 | unsigned long bit = 1UL << i; |
ddbcc7e8 | 1016 | struct cgroup_subsys *ss = subsys[i]; |
a1a71b45 | 1017 | if (!(bit & added_mask)) |
ddbcc7e8 | 1018 | continue; |
aae8aab4 BB |
1019 | /* |
1020 | * Nobody should tell us to do a subsys that doesn't exist: | |
1021 | * parse_cgroupfs_options should catch that case and refcounts | |
1022 | * ensure that subsystems won't disappear once selected. | |
1023 | */ | |
1024 | BUG_ON(ss == NULL); | |
ddbcc7e8 PM |
1025 | if (ss->root != &rootnode) { |
1026 | /* Subsystem isn't free */ | |
1027 | return -EBUSY; | |
1028 | } | |
1029 | } | |
1030 | ||
1031 | /* Currently we don't handle adding/removing subsystems when | |
1032 | * any child cgroups exist. This is theoretically supportable | |
1033 | * but involves complex error handling, so it's being left until | |
1034 | * later */ | |
307257cf | 1035 | if (root->number_of_cgroups > 1) |
ddbcc7e8 PM |
1036 | return -EBUSY; |
1037 | ||
1038 | /* Process each subsystem */ | |
1039 | for (i = 0; i < CGROUP_SUBSYS_COUNT; i++) { | |
1040 | struct cgroup_subsys *ss = subsys[i]; | |
1041 | unsigned long bit = 1UL << i; | |
a1a71b45 | 1042 | if (bit & added_mask) { |
ddbcc7e8 | 1043 | /* We're binding this subsystem to this hierarchy */ |
aae8aab4 | 1044 | BUG_ON(ss == NULL); |
bd89aabc | 1045 | BUG_ON(cgrp->subsys[i]); |
ddbcc7e8 PM |
1046 | BUG_ON(!dummytop->subsys[i]); |
1047 | BUG_ON(dummytop->subsys[i]->cgroup != dummytop); | |
bd89aabc PM |
1048 | cgrp->subsys[i] = dummytop->subsys[i]; |
1049 | cgrp->subsys[i]->cgroup = cgrp; | |
33a68ac1 | 1050 | list_move(&ss->sibling, &root->subsys_list); |
b2aa30f7 | 1051 | ss->root = root; |
ddbcc7e8 | 1052 | if (ss->bind) |
761b3ef5 | 1053 | ss->bind(cgrp); |
cf5d5941 | 1054 | /* refcount was already taken, and we're keeping it */ |
a1a71b45 | 1055 | } else if (bit & removed_mask) { |
ddbcc7e8 | 1056 | /* We're removing this subsystem */ |
aae8aab4 | 1057 | BUG_ON(ss == NULL); |
bd89aabc PM |
1058 | BUG_ON(cgrp->subsys[i] != dummytop->subsys[i]); |
1059 | BUG_ON(cgrp->subsys[i]->cgroup != cgrp); | |
ddbcc7e8 | 1060 | if (ss->bind) |
761b3ef5 | 1061 | ss->bind(dummytop); |
ddbcc7e8 | 1062 | dummytop->subsys[i]->cgroup = dummytop; |
bd89aabc | 1063 | cgrp->subsys[i] = NULL; |
b2aa30f7 | 1064 | subsys[i]->root = &rootnode; |
33a68ac1 | 1065 | list_move(&ss->sibling, &rootnode.subsys_list); |
cf5d5941 BB |
1066 | /* subsystem is now free - drop reference on module */ |
1067 | module_put(ss->module); | |
a1a71b45 | 1068 | } else if (bit & final_subsys_mask) { |
ddbcc7e8 | 1069 | /* Subsystem state should already exist */ |
aae8aab4 | 1070 | BUG_ON(ss == NULL); |
bd89aabc | 1071 | BUG_ON(!cgrp->subsys[i]); |
cf5d5941 BB |
1072 | /* |
1073 | * a refcount was taken, but we already had one, so | |
1074 | * drop the extra reference. | |
1075 | */ | |
1076 | module_put(ss->module); | |
1077 | #ifdef CONFIG_MODULE_UNLOAD | |
1078 | BUG_ON(ss->module && !module_refcount(ss->module)); | |
1079 | #endif | |
ddbcc7e8 PM |
1080 | } else { |
1081 | /* Subsystem state shouldn't exist */ | |
bd89aabc | 1082 | BUG_ON(cgrp->subsys[i]); |
ddbcc7e8 PM |
1083 | } |
1084 | } | |
a1a71b45 | 1085 | root->subsys_mask = root->actual_subsys_mask = final_subsys_mask; |
ddbcc7e8 PM |
1086 | synchronize_rcu(); |
1087 | ||
1088 | return 0; | |
1089 | } | |
1090 | ||
34c80b1d | 1091 | static int cgroup_show_options(struct seq_file *seq, struct dentry *dentry) |
ddbcc7e8 | 1092 | { |
34c80b1d | 1093 | struct cgroupfs_root *root = dentry->d_sb->s_fs_info; |
ddbcc7e8 PM |
1094 | struct cgroup_subsys *ss; |
1095 | ||
e25e2cbb | 1096 | mutex_lock(&cgroup_root_mutex); |
ddbcc7e8 PM |
1097 | for_each_subsys(root, ss) |
1098 | seq_printf(seq, ",%s", ss->name); | |
1099 | if (test_bit(ROOT_NOPREFIX, &root->flags)) | |
1100 | seq_puts(seq, ",noprefix"); | |
03b1cde6 AR |
1101 | if (test_bit(ROOT_XATTR, &root->flags)) |
1102 | seq_puts(seq, ",xattr"); | |
81a6a5cd PM |
1103 | if (strlen(root->release_agent_path)) |
1104 | seq_printf(seq, ",release_agent=%s", root->release_agent_path); | |
2260e7fc | 1105 | if (test_bit(CGRP_CPUSET_CLONE_CHILDREN, &root->top_cgroup.flags)) |
97978e6d | 1106 | seq_puts(seq, ",clone_children"); |
c6d57f33 PM |
1107 | if (strlen(root->name)) |
1108 | seq_printf(seq, ",name=%s", root->name); | |
e25e2cbb | 1109 | mutex_unlock(&cgroup_root_mutex); |
ddbcc7e8 PM |
1110 | return 0; |
1111 | } | |
1112 | ||
1113 | struct cgroup_sb_opts { | |
a1a71b45 | 1114 | unsigned long subsys_mask; |
ddbcc7e8 | 1115 | unsigned long flags; |
81a6a5cd | 1116 | char *release_agent; |
2260e7fc | 1117 | bool cpuset_clone_children; |
c6d57f33 | 1118 | char *name; |
2c6ab6d2 PM |
1119 | /* User explicitly requested empty subsystem */ |
1120 | bool none; | |
c6d57f33 PM |
1121 | |
1122 | struct cgroupfs_root *new_root; | |
2c6ab6d2 | 1123 | |
ddbcc7e8 PM |
1124 | }; |
1125 | ||
aae8aab4 BB |
1126 | /* |
1127 | * Convert a hierarchy specifier into a bitmask of subsystems and flags. Call | |
cf5d5941 BB |
1128 | * with cgroup_mutex held to protect the subsys[] array. This function takes |
1129 | * refcounts on subsystems to be used, unless it returns error, in which case | |
1130 | * no refcounts are taken. | |
aae8aab4 | 1131 | */ |
cf5d5941 | 1132 | static int parse_cgroupfs_options(char *data, struct cgroup_sb_opts *opts) |
ddbcc7e8 | 1133 | { |
32a8cf23 DL |
1134 | char *token, *o = data; |
1135 | bool all_ss = false, one_ss = false; | |
f9ab5b5b | 1136 | unsigned long mask = (unsigned long)-1; |
cf5d5941 BB |
1137 | int i; |
1138 | bool module_pin_failed = false; | |
f9ab5b5b | 1139 | |
aae8aab4 BB |
1140 | BUG_ON(!mutex_is_locked(&cgroup_mutex)); |
1141 | ||
f9ab5b5b LZ |
1142 | #ifdef CONFIG_CPUSETS |
1143 | mask = ~(1UL << cpuset_subsys_id); | |
1144 | #endif | |
ddbcc7e8 | 1145 | |
c6d57f33 | 1146 | memset(opts, 0, sizeof(*opts)); |
ddbcc7e8 PM |
1147 | |
1148 | while ((token = strsep(&o, ",")) != NULL) { | |
1149 | if (!*token) | |
1150 | return -EINVAL; | |
32a8cf23 | 1151 | if (!strcmp(token, "none")) { |
2c6ab6d2 PM |
1152 | /* Explicitly have no subsystems */ |
1153 | opts->none = true; | |
32a8cf23 DL |
1154 | continue; |
1155 | } | |
1156 | if (!strcmp(token, "all")) { | |
1157 | /* Mutually exclusive option 'all' + subsystem name */ | |
1158 | if (one_ss) | |
1159 | return -EINVAL; | |
1160 | all_ss = true; | |
1161 | continue; | |
1162 | } | |
1163 | if (!strcmp(token, "noprefix")) { | |
ddbcc7e8 | 1164 | set_bit(ROOT_NOPREFIX, &opts->flags); |
32a8cf23 DL |
1165 | continue; |
1166 | } | |
1167 | if (!strcmp(token, "clone_children")) { | |
2260e7fc | 1168 | opts->cpuset_clone_children = true; |
32a8cf23 DL |
1169 | continue; |
1170 | } | |
03b1cde6 AR |
1171 | if (!strcmp(token, "xattr")) { |
1172 | set_bit(ROOT_XATTR, &opts->flags); | |
1173 | continue; | |
1174 | } | |
32a8cf23 | 1175 | if (!strncmp(token, "release_agent=", 14)) { |
81a6a5cd PM |
1176 | /* Specifying two release agents is forbidden */ |
1177 | if (opts->release_agent) | |
1178 | return -EINVAL; | |
c6d57f33 | 1179 | opts->release_agent = |
e400c285 | 1180 | kstrndup(token + 14, PATH_MAX - 1, GFP_KERNEL); |
81a6a5cd PM |
1181 | if (!opts->release_agent) |
1182 | return -ENOMEM; | |
32a8cf23 DL |
1183 | continue; |
1184 | } | |
1185 | if (!strncmp(token, "name=", 5)) { | |
c6d57f33 PM |
1186 | const char *name = token + 5; |
1187 | /* Can't specify an empty name */ | |
1188 | if (!strlen(name)) | |
1189 | return -EINVAL; | |
1190 | /* Must match [\w.-]+ */ | |
1191 | for (i = 0; i < strlen(name); i++) { | |
1192 | char c = name[i]; | |
1193 | if (isalnum(c)) | |
1194 | continue; | |
1195 | if ((c == '.') || (c == '-') || (c == '_')) | |
1196 | continue; | |
1197 | return -EINVAL; | |
1198 | } | |
1199 | /* Specifying two names is forbidden */ | |
1200 | if (opts->name) | |
1201 | return -EINVAL; | |
1202 | opts->name = kstrndup(name, | |
e400c285 | 1203 | MAX_CGROUP_ROOT_NAMELEN - 1, |
c6d57f33 PM |
1204 | GFP_KERNEL); |
1205 | if (!opts->name) | |
1206 | return -ENOMEM; | |
32a8cf23 DL |
1207 | |
1208 | continue; | |
1209 | } | |
1210 | ||
1211 | for (i = 0; i < CGROUP_SUBSYS_COUNT; i++) { | |
1212 | struct cgroup_subsys *ss = subsys[i]; | |
1213 | if (ss == NULL) | |
1214 | continue; | |
1215 | if (strcmp(token, ss->name)) | |
1216 | continue; | |
1217 | if (ss->disabled) | |
1218 | continue; | |
1219 | ||
1220 | /* Mutually exclusive option 'all' + subsystem name */ | |
1221 | if (all_ss) | |
1222 | return -EINVAL; | |
a1a71b45 | 1223 | set_bit(i, &opts->subsys_mask); |
32a8cf23 DL |
1224 | one_ss = true; |
1225 | ||
1226 | break; | |
1227 | } | |
1228 | if (i == CGROUP_SUBSYS_COUNT) | |
1229 | return -ENOENT; | |
1230 | } | |
1231 | ||
1232 | /* | |
1233 | * If the 'all' option was specified select all the subsystems, | |
0d19ea86 LZ |
1234 | * otherwise if 'none', 'name=' and a subsystem name options |
1235 | * were not specified, let's default to 'all' | |
32a8cf23 | 1236 | */ |
0d19ea86 | 1237 | if (all_ss || (!one_ss && !opts->none && !opts->name)) { |
32a8cf23 DL |
1238 | for (i = 0; i < CGROUP_SUBSYS_COUNT; i++) { |
1239 | struct cgroup_subsys *ss = subsys[i]; | |
1240 | if (ss == NULL) | |
1241 | continue; | |
1242 | if (ss->disabled) | |
1243 | continue; | |
a1a71b45 | 1244 | set_bit(i, &opts->subsys_mask); |
ddbcc7e8 PM |
1245 | } |
1246 | } | |
1247 | ||
2c6ab6d2 PM |
1248 | /* Consistency checks */ |
1249 | ||
f9ab5b5b LZ |
1250 | /* |
1251 | * Option noprefix was introduced just for backward compatibility | |
1252 | * with the old cpuset, so we allow noprefix only if mounting just | |
1253 | * the cpuset subsystem. | |
1254 | */ | |
1255 | if (test_bit(ROOT_NOPREFIX, &opts->flags) && | |
a1a71b45 | 1256 | (opts->subsys_mask & mask)) |
f9ab5b5b LZ |
1257 | return -EINVAL; |
1258 | ||
2c6ab6d2 PM |
1259 | |
1260 | /* Can't specify "none" and some subsystems */ | |
a1a71b45 | 1261 | if (opts->subsys_mask && opts->none) |
2c6ab6d2 PM |
1262 | return -EINVAL; |
1263 | ||
1264 | /* | |
1265 | * We either have to specify by name or by subsystems. (So all | |
1266 | * empty hierarchies must have a name). | |
1267 | */ | |
a1a71b45 | 1268 | if (!opts->subsys_mask && !opts->name) |
ddbcc7e8 PM |
1269 | return -EINVAL; |
1270 | ||
cf5d5941 BB |
1271 | /* |
1272 | * Grab references on all the modules we'll need, so the subsystems | |
1273 | * don't dance around before rebind_subsystems attaches them. This may | |
1274 | * take duplicate reference counts on a subsystem that's already used, | |
1275 | * but rebind_subsystems handles this case. | |
1276 | */ | |
be45c900 | 1277 | for (i = 0; i < CGROUP_SUBSYS_COUNT; i++) { |
cf5d5941 BB |
1278 | unsigned long bit = 1UL << i; |
1279 | ||
a1a71b45 | 1280 | if (!(bit & opts->subsys_mask)) |
cf5d5941 BB |
1281 | continue; |
1282 | if (!try_module_get(subsys[i]->module)) { | |
1283 | module_pin_failed = true; | |
1284 | break; | |
1285 | } | |
1286 | } | |
1287 | if (module_pin_failed) { | |
1288 | /* | |
1289 | * oops, one of the modules was going away. this means that we | |
1290 | * raced with a module_delete call, and to the user this is | |
1291 | * essentially a "subsystem doesn't exist" case. | |
1292 | */ | |
be45c900 | 1293 | for (i--; i >= 0; i--) { |
cf5d5941 BB |
1294 | /* drop refcounts only on the ones we took */ |
1295 | unsigned long bit = 1UL << i; | |
1296 | ||
a1a71b45 | 1297 | if (!(bit & opts->subsys_mask)) |
cf5d5941 BB |
1298 | continue; |
1299 | module_put(subsys[i]->module); | |
1300 | } | |
1301 | return -ENOENT; | |
1302 | } | |
1303 | ||
ddbcc7e8 PM |
1304 | return 0; |
1305 | } | |
1306 | ||
a1a71b45 | 1307 | static void drop_parsed_module_refcounts(unsigned long subsys_mask) |
cf5d5941 BB |
1308 | { |
1309 | int i; | |
be45c900 | 1310 | for (i = 0; i < CGROUP_SUBSYS_COUNT; i++) { |
cf5d5941 BB |
1311 | unsigned long bit = 1UL << i; |
1312 | ||
a1a71b45 | 1313 | if (!(bit & subsys_mask)) |
cf5d5941 BB |
1314 | continue; |
1315 | module_put(subsys[i]->module); | |
1316 | } | |
1317 | } | |
1318 | ||
ddbcc7e8 PM |
1319 | static int cgroup_remount(struct super_block *sb, int *flags, char *data) |
1320 | { | |
1321 | int ret = 0; | |
1322 | struct cgroupfs_root *root = sb->s_fs_info; | |
bd89aabc | 1323 | struct cgroup *cgrp = &root->top_cgroup; |
ddbcc7e8 | 1324 | struct cgroup_sb_opts opts; |
a1a71b45 | 1325 | unsigned long added_mask, removed_mask; |
ddbcc7e8 | 1326 | |
bd89aabc | 1327 | mutex_lock(&cgrp->dentry->d_inode->i_mutex); |
ddbcc7e8 | 1328 | mutex_lock(&cgroup_mutex); |
e25e2cbb | 1329 | mutex_lock(&cgroup_root_mutex); |
ddbcc7e8 PM |
1330 | |
1331 | /* See what subsystems are wanted */ | |
1332 | ret = parse_cgroupfs_options(data, &opts); | |
1333 | if (ret) | |
1334 | goto out_unlock; | |
1335 | ||
8b5a5a9d | 1336 | /* See feature-removal-schedule.txt */ |
a1a71b45 | 1337 | if (opts.subsys_mask != root->actual_subsys_mask || opts.release_agent) |
8b5a5a9d TH |
1338 | pr_warning("cgroup: option changes via remount are deprecated (pid=%d comm=%s)\n", |
1339 | task_tgid_nr(current), current->comm); | |
1340 | ||
a1a71b45 AR |
1341 | added_mask = opts.subsys_mask & ~root->subsys_mask; |
1342 | removed_mask = root->subsys_mask & ~opts.subsys_mask; | |
13af07df | 1343 | |
cf5d5941 BB |
1344 | /* Don't allow flags or name to change at remount */ |
1345 | if (opts.flags != root->flags || | |
1346 | (opts.name && strcmp(opts.name, root->name))) { | |
c6d57f33 | 1347 | ret = -EINVAL; |
a1a71b45 | 1348 | drop_parsed_module_refcounts(opts.subsys_mask); |
c6d57f33 PM |
1349 | goto out_unlock; |
1350 | } | |
1351 | ||
7083d037 G |
1352 | /* |
1353 | * Clear out the files of subsystems that should be removed, do | |
1354 | * this before rebind_subsystems, since rebind_subsystems may | |
1355 | * change this hierarchy's subsys_list. | |
1356 | */ | |
1357 | cgroup_clear_directory(cgrp->dentry, false, removed_mask); | |
1358 | ||
a1a71b45 | 1359 | ret = rebind_subsystems(root, opts.subsys_mask); |
cf5d5941 | 1360 | if (ret) { |
7083d037 G |
1361 | /* rebind_subsystems failed, re-populate the removed files */ |
1362 | cgroup_populate_dir(cgrp, false, removed_mask); | |
a1a71b45 | 1363 | drop_parsed_module_refcounts(opts.subsys_mask); |
0670e08b | 1364 | goto out_unlock; |
cf5d5941 | 1365 | } |
ddbcc7e8 | 1366 | |
13af07df | 1367 | /* re-populate subsystem files */ |
a1a71b45 | 1368 | cgroup_populate_dir(cgrp, false, added_mask); |
ddbcc7e8 | 1369 | |
81a6a5cd PM |
1370 | if (opts.release_agent) |
1371 | strcpy(root->release_agent_path, opts.release_agent); | |
ddbcc7e8 | 1372 | out_unlock: |
66bdc9cf | 1373 | kfree(opts.release_agent); |
c6d57f33 | 1374 | kfree(opts.name); |
e25e2cbb | 1375 | mutex_unlock(&cgroup_root_mutex); |
ddbcc7e8 | 1376 | mutex_unlock(&cgroup_mutex); |
bd89aabc | 1377 | mutex_unlock(&cgrp->dentry->d_inode->i_mutex); |
ddbcc7e8 PM |
1378 | return ret; |
1379 | } | |
1380 | ||
b87221de | 1381 | static const struct super_operations cgroup_ops = { |
ddbcc7e8 PM |
1382 | .statfs = simple_statfs, |
1383 | .drop_inode = generic_delete_inode, | |
1384 | .show_options = cgroup_show_options, | |
1385 | .remount_fs = cgroup_remount, | |
1386 | }; | |
1387 | ||
cc31edce PM |
1388 | static void init_cgroup_housekeeping(struct cgroup *cgrp) |
1389 | { | |
1390 | INIT_LIST_HEAD(&cgrp->sibling); | |
1391 | INIT_LIST_HEAD(&cgrp->children); | |
05ef1d7c | 1392 | INIT_LIST_HEAD(&cgrp->files); |
cc31edce | 1393 | INIT_LIST_HEAD(&cgrp->css_sets); |
2243076a | 1394 | INIT_LIST_HEAD(&cgrp->allcg_node); |
cc31edce | 1395 | INIT_LIST_HEAD(&cgrp->release_list); |
72a8cb30 BB |
1396 | INIT_LIST_HEAD(&cgrp->pidlists); |
1397 | mutex_init(&cgrp->pidlist_mutex); | |
0dea1168 KS |
1398 | INIT_LIST_HEAD(&cgrp->event_list); |
1399 | spin_lock_init(&cgrp->event_list_lock); | |
03b1cde6 | 1400 | simple_xattrs_init(&cgrp->xattrs); |
cc31edce | 1401 | } |
c6d57f33 | 1402 | |
ddbcc7e8 PM |
1403 | static void init_cgroup_root(struct cgroupfs_root *root) |
1404 | { | |
bd89aabc | 1405 | struct cgroup *cgrp = &root->top_cgroup; |
b0ca5a84 | 1406 | |
ddbcc7e8 PM |
1407 | INIT_LIST_HEAD(&root->subsys_list); |
1408 | INIT_LIST_HEAD(&root->root_list); | |
b0ca5a84 | 1409 | INIT_LIST_HEAD(&root->allcg_list); |
ddbcc7e8 | 1410 | root->number_of_cgroups = 1; |
bd89aabc PM |
1411 | cgrp->root = root; |
1412 | cgrp->top_cgroup = cgrp; | |
cc31edce | 1413 | init_cgroup_housekeeping(cgrp); |
fddfb02a | 1414 | list_add_tail(&cgrp->allcg_node, &root->allcg_list); |
ddbcc7e8 PM |
1415 | } |
1416 | ||
2c6ab6d2 PM |
1417 | static bool init_root_id(struct cgroupfs_root *root) |
1418 | { | |
1419 | int ret = 0; | |
1420 | ||
1421 | do { | |
1422 | if (!ida_pre_get(&hierarchy_ida, GFP_KERNEL)) | |
1423 | return false; | |
1424 | spin_lock(&hierarchy_id_lock); | |
1425 | /* Try to allocate the next unused ID */ | |
1426 | ret = ida_get_new_above(&hierarchy_ida, next_hierarchy_id, | |
1427 | &root->hierarchy_id); | |
1428 | if (ret == -ENOSPC) | |
1429 | /* Try again starting from 0 */ | |
1430 | ret = ida_get_new(&hierarchy_ida, &root->hierarchy_id); | |
1431 | if (!ret) { | |
1432 | next_hierarchy_id = root->hierarchy_id + 1; | |
1433 | } else if (ret != -EAGAIN) { | |
1434 | /* Can only get here if the 31-bit IDR is full ... */ | |
1435 | BUG_ON(ret); | |
1436 | } | |
1437 | spin_unlock(&hierarchy_id_lock); | |
1438 | } while (ret); | |
1439 | return true; | |
1440 | } | |
1441 | ||
ddbcc7e8 PM |
1442 | static int cgroup_test_super(struct super_block *sb, void *data) |
1443 | { | |
c6d57f33 | 1444 | struct cgroup_sb_opts *opts = data; |
ddbcc7e8 PM |
1445 | struct cgroupfs_root *root = sb->s_fs_info; |
1446 | ||
c6d57f33 PM |
1447 | /* If we asked for a name then it must match */ |
1448 | if (opts->name && strcmp(opts->name, root->name)) | |
1449 | return 0; | |
ddbcc7e8 | 1450 | |
2c6ab6d2 PM |
1451 | /* |
1452 | * If we asked for subsystems (or explicitly for no | |
1453 | * subsystems) then they must match | |
1454 | */ | |
a1a71b45 AR |
1455 | if ((opts->subsys_mask || opts->none) |
1456 | && (opts->subsys_mask != root->subsys_mask)) | |
ddbcc7e8 PM |
1457 | return 0; |
1458 | ||
1459 | return 1; | |
1460 | } | |
1461 | ||
c6d57f33 PM |
1462 | static struct cgroupfs_root *cgroup_root_from_opts(struct cgroup_sb_opts *opts) |
1463 | { | |
1464 | struct cgroupfs_root *root; | |
1465 | ||
a1a71b45 | 1466 | if (!opts->subsys_mask && !opts->none) |
c6d57f33 PM |
1467 | return NULL; |
1468 | ||
1469 | root = kzalloc(sizeof(*root), GFP_KERNEL); | |
1470 | if (!root) | |
1471 | return ERR_PTR(-ENOMEM); | |
1472 | ||
2c6ab6d2 PM |
1473 | if (!init_root_id(root)) { |
1474 | kfree(root); | |
1475 | return ERR_PTR(-ENOMEM); | |
1476 | } | |
c6d57f33 | 1477 | init_cgroup_root(root); |
2c6ab6d2 | 1478 | |
a1a71b45 | 1479 | root->subsys_mask = opts->subsys_mask; |
c6d57f33 | 1480 | root->flags = opts->flags; |
0a950f65 | 1481 | ida_init(&root->cgroup_ida); |
c6d57f33 PM |
1482 | if (opts->release_agent) |
1483 | strcpy(root->release_agent_path, opts->release_agent); | |
1484 | if (opts->name) | |
1485 | strcpy(root->name, opts->name); | |
2260e7fc TH |
1486 | if (opts->cpuset_clone_children) |
1487 | set_bit(CGRP_CPUSET_CLONE_CHILDREN, &root->top_cgroup.flags); | |
c6d57f33 PM |
1488 | return root; |
1489 | } | |
1490 | ||
2c6ab6d2 PM |
1491 | static void cgroup_drop_root(struct cgroupfs_root *root) |
1492 | { | |
1493 | if (!root) | |
1494 | return; | |
1495 | ||
1496 | BUG_ON(!root->hierarchy_id); | |
1497 | spin_lock(&hierarchy_id_lock); | |
1498 | ida_remove(&hierarchy_ida, root->hierarchy_id); | |
1499 | spin_unlock(&hierarchy_id_lock); | |
0a950f65 | 1500 | ida_destroy(&root->cgroup_ida); |
2c6ab6d2 PM |
1501 | kfree(root); |
1502 | } | |
1503 | ||
ddbcc7e8 PM |
1504 | static int cgroup_set_super(struct super_block *sb, void *data) |
1505 | { | |
1506 | int ret; | |
c6d57f33 PM |
1507 | struct cgroup_sb_opts *opts = data; |
1508 | ||
1509 | /* If we don't have a new root, we can't set up a new sb */ | |
1510 | if (!opts->new_root) | |
1511 | return -EINVAL; | |
1512 | ||
a1a71b45 | 1513 | BUG_ON(!opts->subsys_mask && !opts->none); |
ddbcc7e8 PM |
1514 | |
1515 | ret = set_anon_super(sb, NULL); | |
1516 | if (ret) | |
1517 | return ret; | |
1518 | ||
c6d57f33 PM |
1519 | sb->s_fs_info = opts->new_root; |
1520 | opts->new_root->sb = sb; | |
ddbcc7e8 PM |
1521 | |
1522 | sb->s_blocksize = PAGE_CACHE_SIZE; | |
1523 | sb->s_blocksize_bits = PAGE_CACHE_SHIFT; | |
1524 | sb->s_magic = CGROUP_SUPER_MAGIC; | |
1525 | sb->s_op = &cgroup_ops; | |
1526 | ||
1527 | return 0; | |
1528 | } | |
1529 | ||
1530 | static int cgroup_get_rootdir(struct super_block *sb) | |
1531 | { | |
0df6a63f AV |
1532 | static const struct dentry_operations cgroup_dops = { |
1533 | .d_iput = cgroup_diput, | |
c72a04e3 | 1534 | .d_delete = cgroup_delete, |
0df6a63f AV |
1535 | }; |
1536 | ||
ddbcc7e8 PM |
1537 | struct inode *inode = |
1538 | cgroup_new_inode(S_IFDIR | S_IRUGO | S_IXUGO | S_IWUSR, sb); | |
ddbcc7e8 PM |
1539 | |
1540 | if (!inode) | |
1541 | return -ENOMEM; | |
1542 | ||
ddbcc7e8 PM |
1543 | inode->i_fop = &simple_dir_operations; |
1544 | inode->i_op = &cgroup_dir_inode_operations; | |
1545 | /* directories start off with i_nlink == 2 (for "." entry) */ | |
1546 | inc_nlink(inode); | |
48fde701 AV |
1547 | sb->s_root = d_make_root(inode); |
1548 | if (!sb->s_root) | |
ddbcc7e8 | 1549 | return -ENOMEM; |
0df6a63f AV |
1550 | /* for everything else we want ->d_op set */ |
1551 | sb->s_d_op = &cgroup_dops; | |
ddbcc7e8 PM |
1552 | return 0; |
1553 | } | |
1554 | ||
f7e83571 | 1555 | static struct dentry *cgroup_mount(struct file_system_type *fs_type, |
ddbcc7e8 | 1556 | int flags, const char *unused_dev_name, |
f7e83571 | 1557 | void *data) |
ddbcc7e8 PM |
1558 | { |
1559 | struct cgroup_sb_opts opts; | |
c6d57f33 | 1560 | struct cgroupfs_root *root; |
ddbcc7e8 PM |
1561 | int ret = 0; |
1562 | struct super_block *sb; | |
c6d57f33 | 1563 | struct cgroupfs_root *new_root; |
e25e2cbb | 1564 | struct inode *inode; |
ddbcc7e8 PM |
1565 | |
1566 | /* First find the desired set of subsystems */ | |
aae8aab4 | 1567 | mutex_lock(&cgroup_mutex); |
ddbcc7e8 | 1568 | ret = parse_cgroupfs_options(data, &opts); |
aae8aab4 | 1569 | mutex_unlock(&cgroup_mutex); |
c6d57f33 PM |
1570 | if (ret) |
1571 | goto out_err; | |
ddbcc7e8 | 1572 | |
c6d57f33 PM |
1573 | /* |
1574 | * Allocate a new cgroup root. We may not need it if we're | |
1575 | * reusing an existing hierarchy. | |
1576 | */ | |
1577 | new_root = cgroup_root_from_opts(&opts); | |
1578 | if (IS_ERR(new_root)) { | |
1579 | ret = PTR_ERR(new_root); | |
cf5d5941 | 1580 | goto drop_modules; |
81a6a5cd | 1581 | } |
c6d57f33 | 1582 | opts.new_root = new_root; |
ddbcc7e8 | 1583 | |
c6d57f33 | 1584 | /* Locate an existing or new sb for this hierarchy */ |
9249e17f | 1585 | sb = sget(fs_type, cgroup_test_super, cgroup_set_super, 0, &opts); |
ddbcc7e8 | 1586 | if (IS_ERR(sb)) { |
c6d57f33 | 1587 | ret = PTR_ERR(sb); |
2c6ab6d2 | 1588 | cgroup_drop_root(opts.new_root); |
cf5d5941 | 1589 | goto drop_modules; |
ddbcc7e8 PM |
1590 | } |
1591 | ||
c6d57f33 PM |
1592 | root = sb->s_fs_info; |
1593 | BUG_ON(!root); | |
1594 | if (root == opts.new_root) { | |
1595 | /* We used the new root structure, so this is a new hierarchy */ | |
1596 | struct list_head tmp_cg_links; | |
c12f65d4 | 1597 | struct cgroup *root_cgrp = &root->top_cgroup; |
c6d57f33 | 1598 | struct cgroupfs_root *existing_root; |
2ce9738b | 1599 | const struct cred *cred; |
28fd5dfc | 1600 | int i; |
ddbcc7e8 PM |
1601 | |
1602 | BUG_ON(sb->s_root != NULL); | |
1603 | ||
1604 | ret = cgroup_get_rootdir(sb); | |
1605 | if (ret) | |
1606 | goto drop_new_super; | |
817929ec | 1607 | inode = sb->s_root->d_inode; |
ddbcc7e8 | 1608 | |
817929ec | 1609 | mutex_lock(&inode->i_mutex); |
ddbcc7e8 | 1610 | mutex_lock(&cgroup_mutex); |
e25e2cbb | 1611 | mutex_lock(&cgroup_root_mutex); |
ddbcc7e8 | 1612 | |
e25e2cbb TH |
1613 | /* Check for name clashes with existing mounts */ |
1614 | ret = -EBUSY; | |
1615 | if (strlen(root->name)) | |
1616 | for_each_active_root(existing_root) | |
1617 | if (!strcmp(existing_root->name, root->name)) | |
1618 | goto unlock_drop; | |
c6d57f33 | 1619 | |
817929ec PM |
1620 | /* |
1621 | * We're accessing css_set_count without locking | |
1622 | * css_set_lock here, but that's OK - it can only be | |
1623 | * increased by someone holding cgroup_lock, and | |
1624 | * that's us. The worst that can happen is that we | |
1625 | * have some link structures left over | |
1626 | */ | |
1627 | ret = allocate_cg_links(css_set_count, &tmp_cg_links); | |
e25e2cbb TH |
1628 | if (ret) |
1629 | goto unlock_drop; | |
817929ec | 1630 | |
a1a71b45 | 1631 | ret = rebind_subsystems(root, root->subsys_mask); |
ddbcc7e8 | 1632 | if (ret == -EBUSY) { |
c6d57f33 | 1633 | free_cg_links(&tmp_cg_links); |
e25e2cbb | 1634 | goto unlock_drop; |
ddbcc7e8 | 1635 | } |
cf5d5941 BB |
1636 | /* |
1637 | * There must be no failure case after here, since rebinding | |
1638 | * takes care of subsystems' refcounts, which are explicitly | |
1639 | * dropped in the failure exit path. | |
1640 | */ | |
ddbcc7e8 PM |
1641 | |
1642 | /* EBUSY should be the only error here */ | |
1643 | BUG_ON(ret); | |
1644 | ||
1645 | list_add(&root->root_list, &roots); | |
817929ec | 1646 | root_count++; |
ddbcc7e8 | 1647 | |
c12f65d4 | 1648 | sb->s_root->d_fsdata = root_cgrp; |
ddbcc7e8 PM |
1649 | root->top_cgroup.dentry = sb->s_root; |
1650 | ||
817929ec PM |
1651 | /* Link the top cgroup in this hierarchy into all |
1652 | * the css_set objects */ | |
1653 | write_lock(&css_set_lock); | |
28fd5dfc LZ |
1654 | for (i = 0; i < CSS_SET_TABLE_SIZE; i++) { |
1655 | struct hlist_head *hhead = &css_set_table[i]; | |
1656 | struct hlist_node *node; | |
817929ec | 1657 | struct css_set *cg; |
28fd5dfc | 1658 | |
c12f65d4 LZ |
1659 | hlist_for_each_entry(cg, node, hhead, hlist) |
1660 | link_css_set(&tmp_cg_links, cg, root_cgrp); | |
28fd5dfc | 1661 | } |
817929ec PM |
1662 | write_unlock(&css_set_lock); |
1663 | ||
1664 | free_cg_links(&tmp_cg_links); | |
1665 | ||
c12f65d4 | 1666 | BUG_ON(!list_empty(&root_cgrp->children)); |
ddbcc7e8 PM |
1667 | BUG_ON(root->number_of_cgroups != 1); |
1668 | ||
2ce9738b | 1669 | cred = override_creds(&init_cred); |
a1a71b45 | 1670 | cgroup_populate_dir(root_cgrp, true, root->subsys_mask); |
2ce9738b | 1671 | revert_creds(cred); |
e25e2cbb | 1672 | mutex_unlock(&cgroup_root_mutex); |
ddbcc7e8 | 1673 | mutex_unlock(&cgroup_mutex); |
34f77a90 | 1674 | mutex_unlock(&inode->i_mutex); |
c6d57f33 PM |
1675 | } else { |
1676 | /* | |
1677 | * We re-used an existing hierarchy - the new root (if | |
1678 | * any) is not needed | |
1679 | */ | |
2c6ab6d2 | 1680 | cgroup_drop_root(opts.new_root); |
cf5d5941 | 1681 | /* no subsys rebinding, so refcounts don't change */ |
a1a71b45 | 1682 | drop_parsed_module_refcounts(opts.subsys_mask); |
ddbcc7e8 PM |
1683 | } |
1684 | ||
c6d57f33 PM |
1685 | kfree(opts.release_agent); |
1686 | kfree(opts.name); | |
f7e83571 | 1687 | return dget(sb->s_root); |
ddbcc7e8 | 1688 | |
e25e2cbb TH |
1689 | unlock_drop: |
1690 | mutex_unlock(&cgroup_root_mutex); | |
1691 | mutex_unlock(&cgroup_mutex); | |
1692 | mutex_unlock(&inode->i_mutex); | |
ddbcc7e8 | 1693 | drop_new_super: |
6f5bbff9 | 1694 | deactivate_locked_super(sb); |
cf5d5941 | 1695 | drop_modules: |
a1a71b45 | 1696 | drop_parsed_module_refcounts(opts.subsys_mask); |
c6d57f33 PM |
1697 | out_err: |
1698 | kfree(opts.release_agent); | |
1699 | kfree(opts.name); | |
f7e83571 | 1700 | return ERR_PTR(ret); |
ddbcc7e8 PM |
1701 | } |
1702 | ||
1703 | static void cgroup_kill_sb(struct super_block *sb) { | |
1704 | struct cgroupfs_root *root = sb->s_fs_info; | |
bd89aabc | 1705 | struct cgroup *cgrp = &root->top_cgroup; |
ddbcc7e8 | 1706 | int ret; |
71cbb949 KM |
1707 | struct cg_cgroup_link *link; |
1708 | struct cg_cgroup_link *saved_link; | |
ddbcc7e8 PM |
1709 | |
1710 | BUG_ON(!root); | |
1711 | ||
1712 | BUG_ON(root->number_of_cgroups != 1); | |
bd89aabc | 1713 | BUG_ON(!list_empty(&cgrp->children)); |
ddbcc7e8 PM |
1714 | |
1715 | mutex_lock(&cgroup_mutex); | |
e25e2cbb | 1716 | mutex_lock(&cgroup_root_mutex); |
ddbcc7e8 PM |
1717 | |
1718 | /* Rebind all subsystems back to the default hierarchy */ | |
1719 | ret = rebind_subsystems(root, 0); | |
1720 | /* Shouldn't be able to fail ... */ | |
1721 | BUG_ON(ret); | |
1722 | ||
817929ec PM |
1723 | /* |
1724 | * Release all the links from css_sets to this hierarchy's | |
1725 | * root cgroup | |
1726 | */ | |
1727 | write_lock(&css_set_lock); | |
71cbb949 KM |
1728 | |
1729 | list_for_each_entry_safe(link, saved_link, &cgrp->css_sets, | |
1730 | cgrp_link_list) { | |
817929ec | 1731 | list_del(&link->cg_link_list); |
bd89aabc | 1732 | list_del(&link->cgrp_link_list); |
817929ec PM |
1733 | kfree(link); |
1734 | } | |
1735 | write_unlock(&css_set_lock); | |
1736 | ||
839ec545 PM |
1737 | if (!list_empty(&root->root_list)) { |
1738 | list_del(&root->root_list); | |
1739 | root_count--; | |
1740 | } | |
e5f6a860 | 1741 | |
e25e2cbb | 1742 | mutex_unlock(&cgroup_root_mutex); |
ddbcc7e8 PM |
1743 | mutex_unlock(&cgroup_mutex); |
1744 | ||
03b1cde6 AR |
1745 | simple_xattrs_free(&cgrp->xattrs); |
1746 | ||
ddbcc7e8 | 1747 | kill_litter_super(sb); |
2c6ab6d2 | 1748 | cgroup_drop_root(root); |
ddbcc7e8 PM |
1749 | } |
1750 | ||
1751 | static struct file_system_type cgroup_fs_type = { | |
1752 | .name = "cgroup", | |
f7e83571 | 1753 | .mount = cgroup_mount, |
ddbcc7e8 PM |
1754 | .kill_sb = cgroup_kill_sb, |
1755 | }; | |
1756 | ||
676db4af GK |
1757 | static struct kobject *cgroup_kobj; |
1758 | ||
a043e3b2 LZ |
1759 | /** |
1760 | * cgroup_path - generate the path of a cgroup | |
1761 | * @cgrp: the cgroup in question | |
1762 | * @buf: the buffer to write the path into | |
1763 | * @buflen: the length of the buffer | |
1764 | * | |
a47295e6 PM |
1765 | * Called with cgroup_mutex held or else with an RCU-protected cgroup |
1766 | * reference. Writes path of cgroup into buf. Returns 0 on success, | |
1767 | * -errno on error. | |
ddbcc7e8 | 1768 | */ |
bd89aabc | 1769 | int cgroup_path(const struct cgroup *cgrp, char *buf, int buflen) |
ddbcc7e8 | 1770 | { |
febfcef6 | 1771 | struct dentry *dentry = cgrp->dentry; |
ddbcc7e8 | 1772 | char *start; |
febfcef6 TH |
1773 | |
1774 | rcu_lockdep_assert(rcu_read_lock_held() || cgroup_lock_is_held(), | |
1775 | "cgroup_path() called without proper locking"); | |
ddbcc7e8 | 1776 | |
a47295e6 | 1777 | if (!dentry || cgrp == dummytop) { |
ddbcc7e8 PM |
1778 | /* |
1779 | * Inactive subsystems have no dentry for their root | |
1780 | * cgroup | |
1781 | */ | |
1782 | strcpy(buf, "/"); | |
1783 | return 0; | |
1784 | } | |
1785 | ||
316eb661 | 1786 | start = buf + buflen - 1; |
ddbcc7e8 | 1787 | |
316eb661 | 1788 | *start = '\0'; |
ddbcc7e8 | 1789 | for (;;) { |
a47295e6 | 1790 | int len = dentry->d_name.len; |
9a9686b6 | 1791 | |
ddbcc7e8 PM |
1792 | if ((start -= len) < buf) |
1793 | return -ENAMETOOLONG; | |
9a9686b6 | 1794 | memcpy(start, dentry->d_name.name, len); |
bd89aabc PM |
1795 | cgrp = cgrp->parent; |
1796 | if (!cgrp) | |
ddbcc7e8 | 1797 | break; |
9a9686b6 | 1798 | |
febfcef6 | 1799 | dentry = cgrp->dentry; |
bd89aabc | 1800 | if (!cgrp->parent) |
ddbcc7e8 PM |
1801 | continue; |
1802 | if (--start < buf) | |
1803 | return -ENAMETOOLONG; | |
1804 | *start = '/'; | |
1805 | } | |
1806 | memmove(buf, start, buf + buflen - start); | |
1807 | return 0; | |
1808 | } | |
67523c48 | 1809 | EXPORT_SYMBOL_GPL(cgroup_path); |
ddbcc7e8 | 1810 | |
2f7ee569 TH |
1811 | /* |
1812 | * Control Group taskset | |
1813 | */ | |
134d3373 TH |
1814 | struct task_and_cgroup { |
1815 | struct task_struct *task; | |
1816 | struct cgroup *cgrp; | |
61d1d219 | 1817 | struct css_set *cg; |
134d3373 TH |
1818 | }; |
1819 | ||
2f7ee569 TH |
1820 | struct cgroup_taskset { |
1821 | struct task_and_cgroup single; | |
1822 | struct flex_array *tc_array; | |
1823 | int tc_array_len; | |
1824 | int idx; | |
1825 | struct cgroup *cur_cgrp; | |
1826 | }; | |
1827 | ||
1828 | /** | |
1829 | * cgroup_taskset_first - reset taskset and return the first task | |
1830 | * @tset: taskset of interest | |
1831 | * | |
1832 | * @tset iteration is initialized and the first task is returned. | |
1833 | */ | |
1834 | struct task_struct *cgroup_taskset_first(struct cgroup_taskset *tset) | |
1835 | { | |
1836 | if (tset->tc_array) { | |
1837 | tset->idx = 0; | |
1838 | return cgroup_taskset_next(tset); | |
1839 | } else { | |
1840 | tset->cur_cgrp = tset->single.cgrp; | |
1841 | return tset->single.task; | |
1842 | } | |
1843 | } | |
1844 | EXPORT_SYMBOL_GPL(cgroup_taskset_first); | |
1845 | ||
1846 | /** | |
1847 | * cgroup_taskset_next - iterate to the next task in taskset | |
1848 | * @tset: taskset of interest | |
1849 | * | |
1850 | * Return the next task in @tset. Iteration must have been initialized | |
1851 | * with cgroup_taskset_first(). | |
1852 | */ | |
1853 | struct task_struct *cgroup_taskset_next(struct cgroup_taskset *tset) | |
1854 | { | |
1855 | struct task_and_cgroup *tc; | |
1856 | ||
1857 | if (!tset->tc_array || tset->idx >= tset->tc_array_len) | |
1858 | return NULL; | |
1859 | ||
1860 | tc = flex_array_get(tset->tc_array, tset->idx++); | |
1861 | tset->cur_cgrp = tc->cgrp; | |
1862 | return tc->task; | |
1863 | } | |
1864 | EXPORT_SYMBOL_GPL(cgroup_taskset_next); | |
1865 | ||
1866 | /** | |
1867 | * cgroup_taskset_cur_cgroup - return the matching cgroup for the current task | |
1868 | * @tset: taskset of interest | |
1869 | * | |
1870 | * Return the cgroup for the current (last returned) task of @tset. This | |
1871 | * function must be preceded by either cgroup_taskset_first() or | |
1872 | * cgroup_taskset_next(). | |
1873 | */ | |
1874 | struct cgroup *cgroup_taskset_cur_cgroup(struct cgroup_taskset *tset) | |
1875 | { | |
1876 | return tset->cur_cgrp; | |
1877 | } | |
1878 | EXPORT_SYMBOL_GPL(cgroup_taskset_cur_cgroup); | |
1879 | ||
1880 | /** | |
1881 | * cgroup_taskset_size - return the number of tasks in taskset | |
1882 | * @tset: taskset of interest | |
1883 | */ | |
1884 | int cgroup_taskset_size(struct cgroup_taskset *tset) | |
1885 | { | |
1886 | return tset->tc_array ? tset->tc_array_len : 1; | |
1887 | } | |
1888 | EXPORT_SYMBOL_GPL(cgroup_taskset_size); | |
1889 | ||
1890 | ||
74a1166d BB |
1891 | /* |
1892 | * cgroup_task_migrate - move a task from one cgroup to another. | |
1893 | * | |
d0b2fdd2 | 1894 | * Must be called with cgroup_mutex and threadgroup locked. |
74a1166d | 1895 | */ |
61d1d219 MSB |
1896 | static void cgroup_task_migrate(struct cgroup *cgrp, struct cgroup *oldcgrp, |
1897 | struct task_struct *tsk, struct css_set *newcg) | |
74a1166d BB |
1898 | { |
1899 | struct css_set *oldcg; | |
74a1166d BB |
1900 | |
1901 | /* | |
026085ef MSB |
1902 | * We are synchronized through threadgroup_lock() against PF_EXITING |
1903 | * setting such that we can't race against cgroup_exit() changing the | |
1904 | * css_set to init_css_set and dropping the old one. | |
74a1166d | 1905 | */ |
c84cdf75 | 1906 | WARN_ON_ONCE(tsk->flags & PF_EXITING); |
74a1166d | 1907 | oldcg = tsk->cgroups; |
74a1166d | 1908 | |
74a1166d | 1909 | task_lock(tsk); |
74a1166d BB |
1910 | rcu_assign_pointer(tsk->cgroups, newcg); |
1911 | task_unlock(tsk); | |
1912 | ||
1913 | /* Update the css_set linked lists if we're using them */ | |
1914 | write_lock(&css_set_lock); | |
1915 | if (!list_empty(&tsk->cg_list)) | |
1916 | list_move(&tsk->cg_list, &newcg->tasks); | |
1917 | write_unlock(&css_set_lock); | |
1918 | ||
1919 | /* | |
1920 | * We just gained a reference on oldcg by taking it from the task. As | |
1921 | * trading it for newcg is protected by cgroup_mutex, we're safe to drop | |
1922 | * it here; it will be freed under RCU. | |
1923 | */ | |
74a1166d | 1924 | set_bit(CGRP_RELEASABLE, &oldcgrp->flags); |
1f5320d5 | 1925 | put_css_set(oldcg); |
74a1166d BB |
1926 | } |
1927 | ||
a043e3b2 LZ |
1928 | /** |
1929 | * cgroup_attach_task - attach task 'tsk' to cgroup 'cgrp' | |
1930 | * @cgrp: the cgroup the task is attaching to | |
1931 | * @tsk: the task to be attached | |
bbcb81d0 | 1932 | * |
cd3d0952 TH |
1933 | * Call with cgroup_mutex and threadgroup locked. May take task_lock of |
1934 | * @tsk during call. | |
bbcb81d0 | 1935 | */ |
956db3ca | 1936 | int cgroup_attach_task(struct cgroup *cgrp, struct task_struct *tsk) |
bbcb81d0 | 1937 | { |
8f121918 | 1938 | int retval = 0; |
2468c723 | 1939 | struct cgroup_subsys *ss, *failed_ss = NULL; |
bd89aabc | 1940 | struct cgroup *oldcgrp; |
bd89aabc | 1941 | struct cgroupfs_root *root = cgrp->root; |
2f7ee569 | 1942 | struct cgroup_taskset tset = { }; |
61d1d219 | 1943 | struct css_set *newcg; |
bbcb81d0 | 1944 | |
cd3d0952 TH |
1945 | /* @tsk either already exited or can't exit until the end */ |
1946 | if (tsk->flags & PF_EXITING) | |
1947 | return -ESRCH; | |
bbcb81d0 PM |
1948 | |
1949 | /* Nothing to do if the task is already in that cgroup */ | |
7717f7ba | 1950 | oldcgrp = task_cgroup_from_root(tsk, root); |
bd89aabc | 1951 | if (cgrp == oldcgrp) |
bbcb81d0 PM |
1952 | return 0; |
1953 | ||
2f7ee569 TH |
1954 | tset.single.task = tsk; |
1955 | tset.single.cgrp = oldcgrp; | |
1956 | ||
bbcb81d0 PM |
1957 | for_each_subsys(root, ss) { |
1958 | if (ss->can_attach) { | |
761b3ef5 | 1959 | retval = ss->can_attach(cgrp, &tset); |
2468c723 DN |
1960 | if (retval) { |
1961 | /* | |
1962 | * Remember on which subsystem the can_attach() | |
1963 | * failed, so that we only call cancel_attach() | |
1964 | * against the subsystems whose can_attach() | |
1965 | * succeeded. (See below) | |
1966 | */ | |
1967 | failed_ss = ss; | |
1968 | goto out; | |
1969 | } | |
bbcb81d0 PM |
1970 | } |
1971 | } | |
1972 | ||
61d1d219 MSB |
1973 | newcg = find_css_set(tsk->cgroups, cgrp); |
1974 | if (!newcg) { | |
1975 | retval = -ENOMEM; | |
2468c723 | 1976 | goto out; |
61d1d219 MSB |
1977 | } |
1978 | ||
1979 | cgroup_task_migrate(cgrp, oldcgrp, tsk, newcg); | |
817929ec | 1980 | |
bbcb81d0 | 1981 | for_each_subsys(root, ss) { |
e18f6318 | 1982 | if (ss->attach) |
761b3ef5 | 1983 | ss->attach(cgrp, &tset); |
bbcb81d0 | 1984 | } |
74a1166d | 1985 | |
bbcb81d0 | 1986 | synchronize_rcu(); |
2468c723 DN |
1987 | out: |
1988 | if (retval) { | |
1989 | for_each_subsys(root, ss) { | |
1990 | if (ss == failed_ss) | |
1991 | /* | |
1992 | * This subsystem was the one that failed the | |
1993 | * can_attach() check earlier, so we don't need | |
1994 | * to call cancel_attach() against it or any | |
1995 | * remaining subsystems. | |
1996 | */ | |
1997 | break; | |
1998 | if (ss->cancel_attach) | |
761b3ef5 | 1999 | ss->cancel_attach(cgrp, &tset); |
2468c723 DN |
2000 | } |
2001 | } | |
2002 | return retval; | |
bbcb81d0 PM |
2003 | } |
2004 | ||
d7926ee3 | 2005 | /** |
31583bb0 MT |
2006 | * cgroup_attach_task_all - attach task 'tsk' to all cgroups of task 'from' |
2007 | * @from: attach to all cgroups of a given task | |
d7926ee3 SS |
2008 | * @tsk: the task to be attached |
2009 | */ | |
31583bb0 | 2010 | int cgroup_attach_task_all(struct task_struct *from, struct task_struct *tsk) |
d7926ee3 SS |
2011 | { |
2012 | struct cgroupfs_root *root; | |
d7926ee3 SS |
2013 | int retval = 0; |
2014 | ||
2015 | cgroup_lock(); | |
2016 | for_each_active_root(root) { | |
31583bb0 MT |
2017 | struct cgroup *from_cg = task_cgroup_from_root(from, root); |
2018 | ||
2019 | retval = cgroup_attach_task(from_cg, tsk); | |
d7926ee3 SS |
2020 | if (retval) |
2021 | break; | |
2022 | } | |
2023 | cgroup_unlock(); | |
2024 | ||
2025 | return retval; | |
2026 | } | |
31583bb0 | 2027 | EXPORT_SYMBOL_GPL(cgroup_attach_task_all); |
d7926ee3 | 2028 | |
74a1166d BB |
2029 | /** |
2030 | * cgroup_attach_proc - attach all threads in a threadgroup to a cgroup | |
2031 | * @cgrp: the cgroup to attach to | |
2032 | * @leader: the threadgroup leader task_struct of the group to be attached | |
2033 | * | |
257058ae TH |
2034 | * Call holding cgroup_mutex and the group_rwsem of the leader. Will take |
2035 | * task_lock of each thread in leader's threadgroup individually in turn. | |
74a1166d | 2036 | */ |
1c6c3fad | 2037 | static int cgroup_attach_proc(struct cgroup *cgrp, struct task_struct *leader) |
74a1166d BB |
2038 | { |
2039 | int retval, i, group_size; | |
2040 | struct cgroup_subsys *ss, *failed_ss = NULL; | |
74a1166d | 2041 | /* guaranteed to be initialized later, but the compiler needs this */ |
74a1166d BB |
2042 | struct cgroupfs_root *root = cgrp->root; |
2043 | /* threadgroup list cursor and array */ | |
2044 | struct task_struct *tsk; | |
134d3373 | 2045 | struct task_and_cgroup *tc; |
d846687d | 2046 | struct flex_array *group; |
2f7ee569 | 2047 | struct cgroup_taskset tset = { }; |
74a1166d BB |
2048 | |
2049 | /* | |
2050 | * step 0: in order to do expensive, possibly blocking operations for | |
2051 | * every thread, we cannot iterate the thread group list, since it needs | |
2052 | * rcu or tasklist locked. instead, build an array of all threads in the | |
257058ae TH |
2053 | * group - group_rwsem prevents new threads from appearing, and if |
2054 | * threads exit, this will just be an over-estimate. | |
74a1166d BB |
2055 | */ |
2056 | group_size = get_nr_threads(leader); | |
d846687d | 2057 | /* flex_array supports very large thread-groups better than kmalloc. */ |
134d3373 | 2058 | group = flex_array_alloc(sizeof(*tc), group_size, GFP_KERNEL); |
74a1166d BB |
2059 | if (!group) |
2060 | return -ENOMEM; | |
d846687d BB |
2061 | /* pre-allocate to guarantee space while iterating in rcu read-side. */ |
2062 | retval = flex_array_prealloc(group, 0, group_size - 1, GFP_KERNEL); | |
2063 | if (retval) | |
2064 | goto out_free_group_list; | |
74a1166d | 2065 | |
74a1166d BB |
2066 | tsk = leader; |
2067 | i = 0; | |
fb5d2b4c MSB |
2068 | /* |
2069 | * Prevent freeing of tasks while we take a snapshot. Tasks that are | |
2070 | * already PF_EXITING could be freed from underneath us unless we | |
2071 | * take an rcu_read_lock. | |
2072 | */ | |
2073 | rcu_read_lock(); | |
74a1166d | 2074 | do { |
134d3373 TH |
2075 | struct task_and_cgroup ent; |
2076 | ||
cd3d0952 TH |
2077 | /* @tsk either already exited or can't exit until the end */ |
2078 | if (tsk->flags & PF_EXITING) | |
2079 | continue; | |
2080 | ||
74a1166d BB |
2081 | /* as per above, nr_threads may decrease, but not increase. */ |
2082 | BUG_ON(i >= group_size); | |
134d3373 TH |
2083 | ent.task = tsk; |
2084 | ent.cgrp = task_cgroup_from_root(tsk, root); | |
892a2b90 MSB |
2085 | /* nothing to do if this task is already in the cgroup */ |
2086 | if (ent.cgrp == cgrp) | |
2087 | continue; | |
61d1d219 MSB |
2088 | /* |
2089 | * saying GFP_ATOMIC has no effect here because we did prealloc | |
2090 | * earlier, but it's good form to communicate our expectations. | |
2091 | */ | |
134d3373 | 2092 | retval = flex_array_put(group, i, &ent, GFP_ATOMIC); |
d846687d | 2093 | BUG_ON(retval != 0); |
74a1166d BB |
2094 | i++; |
2095 | } while_each_thread(leader, tsk); | |
fb5d2b4c | 2096 | rcu_read_unlock(); |
74a1166d BB |
2097 | /* remember the number of threads in the array for later. */ |
2098 | group_size = i; | |
2f7ee569 TH |
2099 | tset.tc_array = group; |
2100 | tset.tc_array_len = group_size; | |
74a1166d | 2101 | |
134d3373 TH |
2102 | /* methods shouldn't be called if no task is actually migrating */ |
2103 | retval = 0; | |
892a2b90 | 2104 | if (!group_size) |
b07ef774 | 2105 | goto out_free_group_list; |
134d3373 | 2106 | |
74a1166d BB |
2107 | /* |
2108 | * step 1: check that we can legitimately attach to the cgroup. | |
2109 | */ | |
2110 | for_each_subsys(root, ss) { | |
2111 | if (ss->can_attach) { | |
761b3ef5 | 2112 | retval = ss->can_attach(cgrp, &tset); |
74a1166d BB |
2113 | if (retval) { |
2114 | failed_ss = ss; | |
2115 | goto out_cancel_attach; | |
2116 | } | |
2117 | } | |
74a1166d BB |
2118 | } |
2119 | ||
2120 | /* | |
2121 | * step 2: make sure css_sets exist for all threads to be migrated. | |
2122 | * we use find_css_set, which allocates a new one if necessary. | |
2123 | */ | |
74a1166d | 2124 | for (i = 0; i < group_size; i++) { |
134d3373 | 2125 | tc = flex_array_get(group, i); |
61d1d219 MSB |
2126 | tc->cg = find_css_set(tc->task->cgroups, cgrp); |
2127 | if (!tc->cg) { | |
2128 | retval = -ENOMEM; | |
2129 | goto out_put_css_set_refs; | |
74a1166d BB |
2130 | } |
2131 | } | |
2132 | ||
2133 | /* | |
494c167c TH |
2134 | * step 3: now that we're guaranteed success wrt the css_sets, |
2135 | * proceed to move all tasks to the new cgroup. There are no | |
2136 | * failure cases after here, so this is the commit point. | |
74a1166d | 2137 | */ |
74a1166d | 2138 | for (i = 0; i < group_size; i++) { |
134d3373 | 2139 | tc = flex_array_get(group, i); |
61d1d219 | 2140 | cgroup_task_migrate(cgrp, tc->cgrp, tc->task, tc->cg); |
74a1166d BB |
2141 | } |
2142 | /* nothing is sensitive to fork() after this point. */ | |
2143 | ||
2144 | /* | |
494c167c | 2145 | * step 4: do subsystem attach callbacks. |
74a1166d BB |
2146 | */ |
2147 | for_each_subsys(root, ss) { | |
2148 | if (ss->attach) | |
761b3ef5 | 2149 | ss->attach(cgrp, &tset); |
74a1166d BB |
2150 | } |
2151 | ||
2152 | /* | |
2153 | * step 5: success! and cleanup | |
2154 | */ | |
2155 | synchronize_rcu(); | |
74a1166d | 2156 | retval = 0; |
61d1d219 MSB |
2157 | out_put_css_set_refs: |
2158 | if (retval) { | |
2159 | for (i = 0; i < group_size; i++) { | |
2160 | tc = flex_array_get(group, i); | |
2161 | if (!tc->cg) | |
2162 | break; | |
2163 | put_css_set(tc->cg); | |
2164 | } | |
74a1166d BB |
2165 | } |
2166 | out_cancel_attach: | |
74a1166d BB |
2167 | if (retval) { |
2168 | for_each_subsys(root, ss) { | |
494c167c | 2169 | if (ss == failed_ss) |
74a1166d | 2170 | break; |
74a1166d | 2171 | if (ss->cancel_attach) |
761b3ef5 | 2172 | ss->cancel_attach(cgrp, &tset); |
74a1166d BB |
2173 | } |
2174 | } | |
74a1166d | 2175 | out_free_group_list: |
d846687d | 2176 | flex_array_free(group); |
74a1166d BB |
2177 | return retval; |
2178 | } | |
2179 | ||
2180 | /* | |
2181 | * Find the task_struct of the task to attach by vpid and pass it along to the | |
cd3d0952 TH |
2182 | * function to attach either it or all tasks in its threadgroup. Will lock |
2183 | * cgroup_mutex and threadgroup; may take task_lock of task. | |
bbcb81d0 | 2184 | */ |
74a1166d | 2185 | static int attach_task_by_pid(struct cgroup *cgrp, u64 pid, bool threadgroup) |
bbcb81d0 | 2186 | { |
bbcb81d0 | 2187 | struct task_struct *tsk; |
c69e8d9c | 2188 | const struct cred *cred = current_cred(), *tcred; |
bbcb81d0 PM |
2189 | int ret; |
2190 | ||
74a1166d BB |
2191 | if (!cgroup_lock_live_group(cgrp)) |
2192 | return -ENODEV; | |
2193 | ||
b78949eb MSB |
2194 | retry_find_task: |
2195 | rcu_read_lock(); | |
bbcb81d0 | 2196 | if (pid) { |
73507f33 | 2197 | tsk = find_task_by_vpid(pid); |
74a1166d BB |
2198 | if (!tsk) { |
2199 | rcu_read_unlock(); | |
b78949eb MSB |
2200 | ret= -ESRCH; |
2201 | goto out_unlock_cgroup; | |
bbcb81d0 | 2202 | } |
74a1166d BB |
2203 | /* |
2204 | * even if we're attaching all tasks in the thread group, we | |
2205 | * only need to check permissions on one of them. | |
2206 | */ | |
c69e8d9c | 2207 | tcred = __task_cred(tsk); |
14a590c3 EB |
2208 | if (!uid_eq(cred->euid, GLOBAL_ROOT_UID) && |
2209 | !uid_eq(cred->euid, tcred->uid) && | |
2210 | !uid_eq(cred->euid, tcred->suid)) { | |
c69e8d9c | 2211 | rcu_read_unlock(); |
b78949eb MSB |
2212 | ret = -EACCES; |
2213 | goto out_unlock_cgroup; | |
bbcb81d0 | 2214 | } |
b78949eb MSB |
2215 | } else |
2216 | tsk = current; | |
cd3d0952 TH |
2217 | |
2218 | if (threadgroup) | |
b78949eb | 2219 | tsk = tsk->group_leader; |
c4c27fbd MG |
2220 | |
2221 | /* | |
2222 | * Workqueue threads may acquire PF_THREAD_BOUND and become | |
2223 | * trapped in a cpuset, or RT worker may be born in a cgroup | |
2224 | * with no rt_runtime allocated. Just say no. | |
2225 | */ | |
2226 | if (tsk == kthreadd_task || (tsk->flags & PF_THREAD_BOUND)) { | |
2227 | ret = -EINVAL; | |
2228 | rcu_read_unlock(); | |
2229 | goto out_unlock_cgroup; | |
2230 | } | |
2231 | ||
b78949eb MSB |
2232 | get_task_struct(tsk); |
2233 | rcu_read_unlock(); | |
2234 | ||
2235 | threadgroup_lock(tsk); | |
2236 | if (threadgroup) { | |
2237 | if (!thread_group_leader(tsk)) { | |
2238 | /* | |
2239 | * a race with de_thread from another thread's exec() | |
2240 | * may strip us of our leadership, if this happens, | |
2241 | * there is no choice but to throw this task away and | |
2242 | * try again; this is | |
2243 | * "double-double-toil-and-trouble-check locking". | |
2244 | */ | |
2245 | threadgroup_unlock(tsk); | |
2246 | put_task_struct(tsk); | |
2247 | goto retry_find_task; | |
2248 | } | |
74a1166d | 2249 | ret = cgroup_attach_proc(cgrp, tsk); |
b78949eb | 2250 | } else |
74a1166d | 2251 | ret = cgroup_attach_task(cgrp, tsk); |
cd3d0952 TH |
2252 | threadgroup_unlock(tsk); |
2253 | ||
bbcb81d0 | 2254 | put_task_struct(tsk); |
b78949eb | 2255 | out_unlock_cgroup: |
74a1166d | 2256 | cgroup_unlock(); |
bbcb81d0 PM |
2257 | return ret; |
2258 | } | |
2259 | ||
af351026 | 2260 | static int cgroup_tasks_write(struct cgroup *cgrp, struct cftype *cft, u64 pid) |
74a1166d BB |
2261 | { |
2262 | return attach_task_by_pid(cgrp, pid, false); | |
2263 | } | |
2264 | ||
2265 | static int cgroup_procs_write(struct cgroup *cgrp, struct cftype *cft, u64 tgid) | |
af351026 | 2266 | { |
b78949eb | 2267 | return attach_task_by_pid(cgrp, tgid, true); |
af351026 PM |
2268 | } |
2269 | ||
e788e066 PM |
2270 | /** |
2271 | * cgroup_lock_live_group - take cgroup_mutex and check that cgrp is alive. | |
2272 | * @cgrp: the cgroup to be checked for liveness | |
2273 | * | |
84eea842 PM |
2274 | * On success, returns true; the lock should be later released with |
2275 | * cgroup_unlock(). On failure returns false with no lock held. | |
e788e066 | 2276 | */ |
84eea842 | 2277 | bool cgroup_lock_live_group(struct cgroup *cgrp) |
e788e066 PM |
2278 | { |
2279 | mutex_lock(&cgroup_mutex); | |
2280 | if (cgroup_is_removed(cgrp)) { | |
2281 | mutex_unlock(&cgroup_mutex); | |
2282 | return false; | |
2283 | } | |
2284 | return true; | |
2285 | } | |
67523c48 | 2286 | EXPORT_SYMBOL_GPL(cgroup_lock_live_group); |
e788e066 PM |
2287 | |
2288 | static int cgroup_release_agent_write(struct cgroup *cgrp, struct cftype *cft, | |
2289 | const char *buffer) | |
2290 | { | |
2291 | BUILD_BUG_ON(sizeof(cgrp->root->release_agent_path) < PATH_MAX); | |
f4a2589f EK |
2292 | if (strlen(buffer) >= PATH_MAX) |
2293 | return -EINVAL; | |
e788e066 PM |
2294 | if (!cgroup_lock_live_group(cgrp)) |
2295 | return -ENODEV; | |
e25e2cbb | 2296 | mutex_lock(&cgroup_root_mutex); |
e788e066 | 2297 | strcpy(cgrp->root->release_agent_path, buffer); |
e25e2cbb | 2298 | mutex_unlock(&cgroup_root_mutex); |
84eea842 | 2299 | cgroup_unlock(); |
e788e066 PM |
2300 | return 0; |
2301 | } | |
2302 | ||
2303 | static int cgroup_release_agent_show(struct cgroup *cgrp, struct cftype *cft, | |
2304 | struct seq_file *seq) | |
2305 | { | |
2306 | if (!cgroup_lock_live_group(cgrp)) | |
2307 | return -ENODEV; | |
2308 | seq_puts(seq, cgrp->root->release_agent_path); | |
2309 | seq_putc(seq, '\n'); | |
84eea842 | 2310 | cgroup_unlock(); |
e788e066 PM |
2311 | return 0; |
2312 | } | |
2313 | ||
84eea842 PM |
2314 | /* A buffer size big enough for numbers or short strings */ |
2315 | #define CGROUP_LOCAL_BUFFER_SIZE 64 | |
2316 | ||
e73d2c61 | 2317 | static ssize_t cgroup_write_X64(struct cgroup *cgrp, struct cftype *cft, |
f4c753b7 PM |
2318 | struct file *file, |
2319 | const char __user *userbuf, | |
2320 | size_t nbytes, loff_t *unused_ppos) | |
355e0c48 | 2321 | { |
84eea842 | 2322 | char buffer[CGROUP_LOCAL_BUFFER_SIZE]; |
355e0c48 | 2323 | int retval = 0; |
355e0c48 PM |
2324 | char *end; |
2325 | ||
2326 | if (!nbytes) | |
2327 | return -EINVAL; | |
2328 | if (nbytes >= sizeof(buffer)) | |
2329 | return -E2BIG; | |
2330 | if (copy_from_user(buffer, userbuf, nbytes)) | |
2331 | return -EFAULT; | |
2332 | ||
2333 | buffer[nbytes] = 0; /* nul-terminate */ | |
e73d2c61 | 2334 | if (cft->write_u64) { |
478988d3 | 2335 | u64 val = simple_strtoull(strstrip(buffer), &end, 0); |
e73d2c61 PM |
2336 | if (*end) |
2337 | return -EINVAL; | |
2338 | retval = cft->write_u64(cgrp, cft, val); | |
2339 | } else { | |
478988d3 | 2340 | s64 val = simple_strtoll(strstrip(buffer), &end, 0); |
e73d2c61 PM |
2341 | if (*end) |
2342 | return -EINVAL; | |
2343 | retval = cft->write_s64(cgrp, cft, val); | |
2344 | } | |
355e0c48 PM |
2345 | if (!retval) |
2346 | retval = nbytes; | |
2347 | return retval; | |
2348 | } | |
2349 | ||
db3b1497 PM |
2350 | static ssize_t cgroup_write_string(struct cgroup *cgrp, struct cftype *cft, |
2351 | struct file *file, | |
2352 | const char __user *userbuf, | |
2353 | size_t nbytes, loff_t *unused_ppos) | |
2354 | { | |
84eea842 | 2355 | char local_buffer[CGROUP_LOCAL_BUFFER_SIZE]; |
db3b1497 PM |
2356 | int retval = 0; |
2357 | size_t max_bytes = cft->max_write_len; | |
2358 | char *buffer = local_buffer; | |
2359 | ||
2360 | if (!max_bytes) | |
2361 | max_bytes = sizeof(local_buffer) - 1; | |
2362 | if (nbytes >= max_bytes) | |
2363 | return -E2BIG; | |
2364 | /* Allocate a dynamic buffer if we need one */ | |
2365 | if (nbytes >= sizeof(local_buffer)) { | |
2366 | buffer = kmalloc(nbytes + 1, GFP_KERNEL); | |
2367 | if (buffer == NULL) | |
2368 | return -ENOMEM; | |
2369 | } | |
5a3eb9f6 LZ |
2370 | if (nbytes && copy_from_user(buffer, userbuf, nbytes)) { |
2371 | retval = -EFAULT; | |
2372 | goto out; | |
2373 | } | |
db3b1497 PM |
2374 | |
2375 | buffer[nbytes] = 0; /* nul-terminate */ | |
478988d3 | 2376 | retval = cft->write_string(cgrp, cft, strstrip(buffer)); |
db3b1497 PM |
2377 | if (!retval) |
2378 | retval = nbytes; | |
5a3eb9f6 | 2379 | out: |
db3b1497 PM |
2380 | if (buffer != local_buffer) |
2381 | kfree(buffer); | |
2382 | return retval; | |
2383 | } | |
2384 | ||
ddbcc7e8 PM |
2385 | static ssize_t cgroup_file_write(struct file *file, const char __user *buf, |
2386 | size_t nbytes, loff_t *ppos) | |
2387 | { | |
2388 | struct cftype *cft = __d_cft(file->f_dentry); | |
bd89aabc | 2389 | struct cgroup *cgrp = __d_cgrp(file->f_dentry->d_parent); |
ddbcc7e8 | 2390 | |
75139b82 | 2391 | if (cgroup_is_removed(cgrp)) |
ddbcc7e8 | 2392 | return -ENODEV; |
355e0c48 | 2393 | if (cft->write) |
bd89aabc | 2394 | return cft->write(cgrp, cft, file, buf, nbytes, ppos); |
e73d2c61 PM |
2395 | if (cft->write_u64 || cft->write_s64) |
2396 | return cgroup_write_X64(cgrp, cft, file, buf, nbytes, ppos); | |
db3b1497 PM |
2397 | if (cft->write_string) |
2398 | return cgroup_write_string(cgrp, cft, file, buf, nbytes, ppos); | |
d447ea2f PE |
2399 | if (cft->trigger) { |
2400 | int ret = cft->trigger(cgrp, (unsigned int)cft->private); | |
2401 | return ret ? ret : nbytes; | |
2402 | } | |
355e0c48 | 2403 | return -EINVAL; |
ddbcc7e8 PM |
2404 | } |
2405 | ||
f4c753b7 PM |
2406 | static ssize_t cgroup_read_u64(struct cgroup *cgrp, struct cftype *cft, |
2407 | struct file *file, | |
2408 | char __user *buf, size_t nbytes, | |
2409 | loff_t *ppos) | |
ddbcc7e8 | 2410 | { |
84eea842 | 2411 | char tmp[CGROUP_LOCAL_BUFFER_SIZE]; |
f4c753b7 | 2412 | u64 val = cft->read_u64(cgrp, cft); |
ddbcc7e8 PM |
2413 | int len = sprintf(tmp, "%llu\n", (unsigned long long) val); |
2414 | ||
2415 | return simple_read_from_buffer(buf, nbytes, ppos, tmp, len); | |
2416 | } | |
2417 | ||
e73d2c61 PM |
2418 | static ssize_t cgroup_read_s64(struct cgroup *cgrp, struct cftype *cft, |
2419 | struct file *file, | |
2420 | char __user *buf, size_t nbytes, | |
2421 | loff_t *ppos) | |
2422 | { | |
84eea842 | 2423 | char tmp[CGROUP_LOCAL_BUFFER_SIZE]; |
e73d2c61 PM |
2424 | s64 val = cft->read_s64(cgrp, cft); |
2425 | int len = sprintf(tmp, "%lld\n", (long long) val); | |
2426 | ||
2427 | return simple_read_from_buffer(buf, nbytes, ppos, tmp, len); | |
2428 | } | |
2429 | ||
ddbcc7e8 PM |
2430 | static ssize_t cgroup_file_read(struct file *file, char __user *buf, |
2431 | size_t nbytes, loff_t *ppos) | |
2432 | { | |
2433 | struct cftype *cft = __d_cft(file->f_dentry); | |
bd89aabc | 2434 | struct cgroup *cgrp = __d_cgrp(file->f_dentry->d_parent); |
ddbcc7e8 | 2435 | |
75139b82 | 2436 | if (cgroup_is_removed(cgrp)) |
ddbcc7e8 PM |
2437 | return -ENODEV; |
2438 | ||
2439 | if (cft->read) | |
bd89aabc | 2440 | return cft->read(cgrp, cft, file, buf, nbytes, ppos); |
f4c753b7 PM |
2441 | if (cft->read_u64) |
2442 | return cgroup_read_u64(cgrp, cft, file, buf, nbytes, ppos); | |
e73d2c61 PM |
2443 | if (cft->read_s64) |
2444 | return cgroup_read_s64(cgrp, cft, file, buf, nbytes, ppos); | |
ddbcc7e8 PM |
2445 | return -EINVAL; |
2446 | } | |
2447 | ||
91796569 PM |
2448 | /* |
2449 | * seqfile ops/methods for returning structured data. Currently just | |
2450 | * supports string->u64 maps, but can be extended in future. | |
2451 | */ | |
2452 | ||
2453 | struct cgroup_seqfile_state { | |
2454 | struct cftype *cft; | |
2455 | struct cgroup *cgroup; | |
2456 | }; | |
2457 | ||
2458 | static int cgroup_map_add(struct cgroup_map_cb *cb, const char *key, u64 value) | |
2459 | { | |
2460 | struct seq_file *sf = cb->state; | |
2461 | return seq_printf(sf, "%s %llu\n", key, (unsigned long long)value); | |
2462 | } | |
2463 | ||
2464 | static int cgroup_seqfile_show(struct seq_file *m, void *arg) | |
2465 | { | |
2466 | struct cgroup_seqfile_state *state = m->private; | |
2467 | struct cftype *cft = state->cft; | |
29486df3 SH |
2468 | if (cft->read_map) { |
2469 | struct cgroup_map_cb cb = { | |
2470 | .fill = cgroup_map_add, | |
2471 | .state = m, | |
2472 | }; | |
2473 | return cft->read_map(state->cgroup, cft, &cb); | |
2474 | } | |
2475 | return cft->read_seq_string(state->cgroup, cft, m); | |
91796569 PM |
2476 | } |
2477 | ||
96930a63 | 2478 | static int cgroup_seqfile_release(struct inode *inode, struct file *file) |
91796569 PM |
2479 | { |
2480 | struct seq_file *seq = file->private_data; | |
2481 | kfree(seq->private); | |
2482 | return single_release(inode, file); | |
2483 | } | |
2484 | ||
828c0950 | 2485 | static const struct file_operations cgroup_seqfile_operations = { |
91796569 | 2486 | .read = seq_read, |
e788e066 | 2487 | .write = cgroup_file_write, |
91796569 PM |
2488 | .llseek = seq_lseek, |
2489 | .release = cgroup_seqfile_release, | |
2490 | }; | |
2491 | ||
ddbcc7e8 PM |
2492 | static int cgroup_file_open(struct inode *inode, struct file *file) |
2493 | { | |
2494 | int err; | |
2495 | struct cftype *cft; | |
2496 | ||
2497 | err = generic_file_open(inode, file); | |
2498 | if (err) | |
2499 | return err; | |
ddbcc7e8 | 2500 | cft = __d_cft(file->f_dentry); |
75139b82 | 2501 | |
29486df3 | 2502 | if (cft->read_map || cft->read_seq_string) { |
91796569 PM |
2503 | struct cgroup_seqfile_state *state = |
2504 | kzalloc(sizeof(*state), GFP_USER); | |
2505 | if (!state) | |
2506 | return -ENOMEM; | |
2507 | state->cft = cft; | |
2508 | state->cgroup = __d_cgrp(file->f_dentry->d_parent); | |
2509 | file->f_op = &cgroup_seqfile_operations; | |
2510 | err = single_open(file, cgroup_seqfile_show, state); | |
2511 | if (err < 0) | |
2512 | kfree(state); | |
2513 | } else if (cft->open) | |
ddbcc7e8 PM |
2514 | err = cft->open(inode, file); |
2515 | else | |
2516 | err = 0; | |
2517 | ||
2518 | return err; | |
2519 | } | |
2520 | ||
2521 | static int cgroup_file_release(struct inode *inode, struct file *file) | |
2522 | { | |
2523 | struct cftype *cft = __d_cft(file->f_dentry); | |
2524 | if (cft->release) | |
2525 | return cft->release(inode, file); | |
2526 | return 0; | |
2527 | } | |
2528 | ||
2529 | /* | |
2530 | * cgroup_rename - Only allow simple rename of directories in place. | |
2531 | */ | |
2532 | static int cgroup_rename(struct inode *old_dir, struct dentry *old_dentry, | |
2533 | struct inode *new_dir, struct dentry *new_dentry) | |
2534 | { | |
2535 | if (!S_ISDIR(old_dentry->d_inode->i_mode)) | |
2536 | return -ENOTDIR; | |
2537 | if (new_dentry->d_inode) | |
2538 | return -EEXIST; | |
2539 | if (old_dir != new_dir) | |
2540 | return -EIO; | |
2541 | return simple_rename(old_dir, old_dentry, new_dir, new_dentry); | |
2542 | } | |
2543 | ||
03b1cde6 AR |
2544 | static struct simple_xattrs *__d_xattrs(struct dentry *dentry) |
2545 | { | |
2546 | if (S_ISDIR(dentry->d_inode->i_mode)) | |
2547 | return &__d_cgrp(dentry)->xattrs; | |
2548 | else | |
2549 | return &__d_cft(dentry)->xattrs; | |
2550 | } | |
2551 | ||
2552 | static inline int xattr_enabled(struct dentry *dentry) | |
2553 | { | |
2554 | struct cgroupfs_root *root = dentry->d_sb->s_fs_info; | |
2555 | return test_bit(ROOT_XATTR, &root->flags); | |
2556 | } | |
2557 | ||
2558 | static bool is_valid_xattr(const char *name) | |
2559 | { | |
2560 | if (!strncmp(name, XATTR_TRUSTED_PREFIX, XATTR_TRUSTED_PREFIX_LEN) || | |
2561 | !strncmp(name, XATTR_SECURITY_PREFIX, XATTR_SECURITY_PREFIX_LEN)) | |
2562 | return true; | |
2563 | return false; | |
2564 | } | |
2565 | ||
2566 | static int cgroup_setxattr(struct dentry *dentry, const char *name, | |
2567 | const void *val, size_t size, int flags) | |
2568 | { | |
2569 | if (!xattr_enabled(dentry)) | |
2570 | return -EOPNOTSUPP; | |
2571 | if (!is_valid_xattr(name)) | |
2572 | return -EINVAL; | |
2573 | return simple_xattr_set(__d_xattrs(dentry), name, val, size, flags); | |
2574 | } | |
2575 | ||
2576 | static int cgroup_removexattr(struct dentry *dentry, const char *name) | |
2577 | { | |
2578 | if (!xattr_enabled(dentry)) | |
2579 | return -EOPNOTSUPP; | |
2580 | if (!is_valid_xattr(name)) | |
2581 | return -EINVAL; | |
2582 | return simple_xattr_remove(__d_xattrs(dentry), name); | |
2583 | } | |
2584 | ||
2585 | static ssize_t cgroup_getxattr(struct dentry *dentry, const char *name, | |
2586 | void *buf, size_t size) | |
2587 | { | |
2588 | if (!xattr_enabled(dentry)) | |
2589 | return -EOPNOTSUPP; | |
2590 | if (!is_valid_xattr(name)) | |
2591 | return -EINVAL; | |
2592 | return simple_xattr_get(__d_xattrs(dentry), name, buf, size); | |
2593 | } | |
2594 | ||
2595 | static ssize_t cgroup_listxattr(struct dentry *dentry, char *buf, size_t size) | |
2596 | { | |
2597 | if (!xattr_enabled(dentry)) | |
2598 | return -EOPNOTSUPP; | |
2599 | return simple_xattr_list(__d_xattrs(dentry), buf, size); | |
2600 | } | |
2601 | ||
828c0950 | 2602 | static const struct file_operations cgroup_file_operations = { |
ddbcc7e8 PM |
2603 | .read = cgroup_file_read, |
2604 | .write = cgroup_file_write, | |
2605 | .llseek = generic_file_llseek, | |
2606 | .open = cgroup_file_open, | |
2607 | .release = cgroup_file_release, | |
2608 | }; | |
2609 | ||
03b1cde6 AR |
2610 | static const struct inode_operations cgroup_file_inode_operations = { |
2611 | .setxattr = cgroup_setxattr, | |
2612 | .getxattr = cgroup_getxattr, | |
2613 | .listxattr = cgroup_listxattr, | |
2614 | .removexattr = cgroup_removexattr, | |
2615 | }; | |
2616 | ||
6e1d5dcc | 2617 | static const struct inode_operations cgroup_dir_inode_operations = { |
c72a04e3 | 2618 | .lookup = cgroup_lookup, |
ddbcc7e8 PM |
2619 | .mkdir = cgroup_mkdir, |
2620 | .rmdir = cgroup_rmdir, | |
2621 | .rename = cgroup_rename, | |
03b1cde6 AR |
2622 | .setxattr = cgroup_setxattr, |
2623 | .getxattr = cgroup_getxattr, | |
2624 | .listxattr = cgroup_listxattr, | |
2625 | .removexattr = cgroup_removexattr, | |
ddbcc7e8 PM |
2626 | }; |
2627 | ||
00cd8dd3 | 2628 | static struct dentry *cgroup_lookup(struct inode *dir, struct dentry *dentry, unsigned int flags) |
c72a04e3 AV |
2629 | { |
2630 | if (dentry->d_name.len > NAME_MAX) | |
2631 | return ERR_PTR(-ENAMETOOLONG); | |
2632 | d_add(dentry, NULL); | |
2633 | return NULL; | |
2634 | } | |
2635 | ||
0dea1168 KS |
2636 | /* |
2637 | * Check if a file is a control file | |
2638 | */ | |
2639 | static inline struct cftype *__file_cft(struct file *file) | |
2640 | { | |
2641 | if (file->f_dentry->d_inode->i_fop != &cgroup_file_operations) | |
2642 | return ERR_PTR(-EINVAL); | |
2643 | return __d_cft(file->f_dentry); | |
2644 | } | |
2645 | ||
a5e7ed32 | 2646 | static int cgroup_create_file(struct dentry *dentry, umode_t mode, |
5adcee1d NP |
2647 | struct super_block *sb) |
2648 | { | |
ddbcc7e8 PM |
2649 | struct inode *inode; |
2650 | ||
2651 | if (!dentry) | |
2652 | return -ENOENT; | |
2653 | if (dentry->d_inode) | |
2654 | return -EEXIST; | |
2655 | ||
2656 | inode = cgroup_new_inode(mode, sb); | |
2657 | if (!inode) | |
2658 | return -ENOMEM; | |
2659 | ||
2660 | if (S_ISDIR(mode)) { | |
2661 | inode->i_op = &cgroup_dir_inode_operations; | |
2662 | inode->i_fop = &simple_dir_operations; | |
2663 | ||
2664 | /* start off with i_nlink == 2 (for "." entry) */ | |
2665 | inc_nlink(inode); | |
28fd6f30 | 2666 | inc_nlink(dentry->d_parent->d_inode); |
ddbcc7e8 | 2667 | |
b8a2df6a TH |
2668 | /* |
2669 | * Control reaches here with cgroup_mutex held. | |
2670 | * @inode->i_mutex should nest outside cgroup_mutex but we | |
2671 | * want to populate it immediately without releasing | |
2672 | * cgroup_mutex. As @inode isn't visible to anyone else | |
2673 | * yet, trylock will always succeed without affecting | |
2674 | * lockdep checks. | |
2675 | */ | |
2676 | WARN_ON_ONCE(!mutex_trylock(&inode->i_mutex)); | |
ddbcc7e8 PM |
2677 | } else if (S_ISREG(mode)) { |
2678 | inode->i_size = 0; | |
2679 | inode->i_fop = &cgroup_file_operations; | |
03b1cde6 | 2680 | inode->i_op = &cgroup_file_inode_operations; |
ddbcc7e8 | 2681 | } |
ddbcc7e8 PM |
2682 | d_instantiate(dentry, inode); |
2683 | dget(dentry); /* Extra count - pin the dentry in core */ | |
2684 | return 0; | |
2685 | } | |
2686 | ||
099fca32 LZ |
2687 | /** |
2688 | * cgroup_file_mode - deduce file mode of a control file | |
2689 | * @cft: the control file in question | |
2690 | * | |
2691 | * returns cft->mode if ->mode is not 0 | |
2692 | * returns S_IRUGO|S_IWUSR if it has both a read and a write handler | |
2693 | * returns S_IRUGO if it has only a read handler | |
2694 | * returns S_IWUSR if it has only a write hander | |
2695 | */ | |
a5e7ed32 | 2696 | static umode_t cgroup_file_mode(const struct cftype *cft) |
099fca32 | 2697 | { |
a5e7ed32 | 2698 | umode_t mode = 0; |
099fca32 LZ |
2699 | |
2700 | if (cft->mode) | |
2701 | return cft->mode; | |
2702 | ||
2703 | if (cft->read || cft->read_u64 || cft->read_s64 || | |
2704 | cft->read_map || cft->read_seq_string) | |
2705 | mode |= S_IRUGO; | |
2706 | ||
2707 | if (cft->write || cft->write_u64 || cft->write_s64 || | |
2708 | cft->write_string || cft->trigger) | |
2709 | mode |= S_IWUSR; | |
2710 | ||
2711 | return mode; | |
2712 | } | |
2713 | ||
db0416b6 | 2714 | static int cgroup_add_file(struct cgroup *cgrp, struct cgroup_subsys *subsys, |
03b1cde6 | 2715 | struct cftype *cft) |
ddbcc7e8 | 2716 | { |
bd89aabc | 2717 | struct dentry *dir = cgrp->dentry; |
05ef1d7c | 2718 | struct cgroup *parent = __d_cgrp(dir); |
ddbcc7e8 | 2719 | struct dentry *dentry; |
05ef1d7c | 2720 | struct cfent *cfe; |
ddbcc7e8 | 2721 | int error; |
a5e7ed32 | 2722 | umode_t mode; |
ddbcc7e8 | 2723 | char name[MAX_CGROUP_TYPE_NAMELEN + MAX_CFTYPE_NAME + 2] = { 0 }; |
8e3f6541 | 2724 | |
03b1cde6 AR |
2725 | simple_xattrs_init(&cft->xattrs); |
2726 | ||
bd89aabc | 2727 | if (subsys && !test_bit(ROOT_NOPREFIX, &cgrp->root->flags)) { |
ddbcc7e8 PM |
2728 | strcpy(name, subsys->name); |
2729 | strcat(name, "."); | |
2730 | } | |
2731 | strcat(name, cft->name); | |
05ef1d7c | 2732 | |
ddbcc7e8 | 2733 | BUG_ON(!mutex_is_locked(&dir->d_inode->i_mutex)); |
05ef1d7c TH |
2734 | |
2735 | cfe = kzalloc(sizeof(*cfe), GFP_KERNEL); | |
2736 | if (!cfe) | |
2737 | return -ENOMEM; | |
2738 | ||
ddbcc7e8 | 2739 | dentry = lookup_one_len(name, dir, strlen(name)); |
05ef1d7c | 2740 | if (IS_ERR(dentry)) { |
ddbcc7e8 | 2741 | error = PTR_ERR(dentry); |
05ef1d7c TH |
2742 | goto out; |
2743 | } | |
2744 | ||
2745 | mode = cgroup_file_mode(cft); | |
2746 | error = cgroup_create_file(dentry, mode | S_IFREG, cgrp->root->sb); | |
2747 | if (!error) { | |
2748 | cfe->type = (void *)cft; | |
2749 | cfe->dentry = dentry; | |
2750 | dentry->d_fsdata = cfe; | |
2751 | list_add_tail(&cfe->node, &parent->files); | |
2752 | cfe = NULL; | |
2753 | } | |
2754 | dput(dentry); | |
2755 | out: | |
2756 | kfree(cfe); | |
ddbcc7e8 PM |
2757 | return error; |
2758 | } | |
2759 | ||
79578621 | 2760 | static int cgroup_addrm_files(struct cgroup *cgrp, struct cgroup_subsys *subsys, |
03b1cde6 | 2761 | struct cftype cfts[], bool is_add) |
ddbcc7e8 | 2762 | { |
03b1cde6 | 2763 | struct cftype *cft; |
db0416b6 TH |
2764 | int err, ret = 0; |
2765 | ||
2766 | for (cft = cfts; cft->name[0] != '\0'; cft++) { | |
f33fddc2 G |
2767 | /* does cft->flags tell us to skip this file on @cgrp? */ |
2768 | if ((cft->flags & CFTYPE_NOT_ON_ROOT) && !cgrp->parent) | |
2769 | continue; | |
2770 | if ((cft->flags & CFTYPE_ONLY_ON_ROOT) && cgrp->parent) | |
2771 | continue; | |
2772 | ||
79578621 TH |
2773 | if (is_add) |
2774 | err = cgroup_add_file(cgrp, subsys, cft); | |
2775 | else | |
2776 | err = cgroup_rm_file(cgrp, cft); | |
db0416b6 | 2777 | if (err) { |
79578621 TH |
2778 | pr_warning("cgroup_addrm_files: failed to %s %s, err=%d\n", |
2779 | is_add ? "add" : "remove", cft->name, err); | |
db0416b6 TH |
2780 | ret = err; |
2781 | } | |
ddbcc7e8 | 2782 | } |
db0416b6 | 2783 | return ret; |
ddbcc7e8 PM |
2784 | } |
2785 | ||
8e3f6541 TH |
2786 | static DEFINE_MUTEX(cgroup_cft_mutex); |
2787 | ||
2788 | static void cgroup_cfts_prepare(void) | |
2789 | __acquires(&cgroup_cft_mutex) __acquires(&cgroup_mutex) | |
2790 | { | |
2791 | /* | |
2792 | * Thanks to the entanglement with vfs inode locking, we can't walk | |
2793 | * the existing cgroups under cgroup_mutex and create files. | |
2794 | * Instead, we increment reference on all cgroups and build list of | |
2795 | * them using @cgrp->cft_q_node. Grab cgroup_cft_mutex to ensure | |
2796 | * exclusive access to the field. | |
2797 | */ | |
2798 | mutex_lock(&cgroup_cft_mutex); | |
2799 | mutex_lock(&cgroup_mutex); | |
2800 | } | |
2801 | ||
2802 | static void cgroup_cfts_commit(struct cgroup_subsys *ss, | |
03b1cde6 | 2803 | struct cftype *cfts, bool is_add) |
8e3f6541 TH |
2804 | __releases(&cgroup_mutex) __releases(&cgroup_cft_mutex) |
2805 | { | |
2806 | LIST_HEAD(pending); | |
2807 | struct cgroup *cgrp, *n; | |
8e3f6541 TH |
2808 | |
2809 | /* %NULL @cfts indicates abort and don't bother if @ss isn't attached */ | |
2810 | if (cfts && ss->root != &rootnode) { | |
2811 | list_for_each_entry(cgrp, &ss->root->allcg_list, allcg_node) { | |
2812 | dget(cgrp->dentry); | |
2813 | list_add_tail(&cgrp->cft_q_node, &pending); | |
2814 | } | |
2815 | } | |
2816 | ||
2817 | mutex_unlock(&cgroup_mutex); | |
2818 | ||
2819 | /* | |
2820 | * All new cgroups will see @cfts update on @ss->cftsets. Add/rm | |
2821 | * files for all cgroups which were created before. | |
2822 | */ | |
2823 | list_for_each_entry_safe(cgrp, n, &pending, cft_q_node) { | |
2824 | struct inode *inode = cgrp->dentry->d_inode; | |
2825 | ||
2826 | mutex_lock(&inode->i_mutex); | |
2827 | mutex_lock(&cgroup_mutex); | |
2828 | if (!cgroup_is_removed(cgrp)) | |
79578621 | 2829 | cgroup_addrm_files(cgrp, ss, cfts, is_add); |
8e3f6541 TH |
2830 | mutex_unlock(&cgroup_mutex); |
2831 | mutex_unlock(&inode->i_mutex); | |
2832 | ||
2833 | list_del_init(&cgrp->cft_q_node); | |
2834 | dput(cgrp->dentry); | |
2835 | } | |
2836 | ||
2837 | mutex_unlock(&cgroup_cft_mutex); | |
2838 | } | |
2839 | ||
2840 | /** | |
2841 | * cgroup_add_cftypes - add an array of cftypes to a subsystem | |
2842 | * @ss: target cgroup subsystem | |
2843 | * @cfts: zero-length name terminated array of cftypes | |
2844 | * | |
2845 | * Register @cfts to @ss. Files described by @cfts are created for all | |
2846 | * existing cgroups to which @ss is attached and all future cgroups will | |
2847 | * have them too. This function can be called anytime whether @ss is | |
2848 | * attached or not. | |
2849 | * | |
2850 | * Returns 0 on successful registration, -errno on failure. Note that this | |
2851 | * function currently returns 0 as long as @cfts registration is successful | |
2852 | * even if some file creation attempts on existing cgroups fail. | |
2853 | */ | |
03b1cde6 | 2854 | int cgroup_add_cftypes(struct cgroup_subsys *ss, struct cftype *cfts) |
8e3f6541 TH |
2855 | { |
2856 | struct cftype_set *set; | |
2857 | ||
2858 | set = kzalloc(sizeof(*set), GFP_KERNEL); | |
2859 | if (!set) | |
2860 | return -ENOMEM; | |
2861 | ||
2862 | cgroup_cfts_prepare(); | |
2863 | set->cfts = cfts; | |
2864 | list_add_tail(&set->node, &ss->cftsets); | |
79578621 | 2865 | cgroup_cfts_commit(ss, cfts, true); |
8e3f6541 TH |
2866 | |
2867 | return 0; | |
2868 | } | |
2869 | EXPORT_SYMBOL_GPL(cgroup_add_cftypes); | |
2870 | ||
79578621 TH |
2871 | /** |
2872 | * cgroup_rm_cftypes - remove an array of cftypes from a subsystem | |
2873 | * @ss: target cgroup subsystem | |
2874 | * @cfts: zero-length name terminated array of cftypes | |
2875 | * | |
2876 | * Unregister @cfts from @ss. Files described by @cfts are removed from | |
2877 | * all existing cgroups to which @ss is attached and all future cgroups | |
2878 | * won't have them either. This function can be called anytime whether @ss | |
2879 | * is attached or not. | |
2880 | * | |
2881 | * Returns 0 on successful unregistration, -ENOENT if @cfts is not | |
2882 | * registered with @ss. | |
2883 | */ | |
03b1cde6 | 2884 | int cgroup_rm_cftypes(struct cgroup_subsys *ss, struct cftype *cfts) |
79578621 TH |
2885 | { |
2886 | struct cftype_set *set; | |
2887 | ||
2888 | cgroup_cfts_prepare(); | |
2889 | ||
2890 | list_for_each_entry(set, &ss->cftsets, node) { | |
2891 | if (set->cfts == cfts) { | |
2892 | list_del_init(&set->node); | |
2893 | cgroup_cfts_commit(ss, cfts, false); | |
2894 | return 0; | |
2895 | } | |
2896 | } | |
2897 | ||
2898 | cgroup_cfts_commit(ss, NULL, false); | |
2899 | return -ENOENT; | |
2900 | } | |
2901 | ||
a043e3b2 LZ |
2902 | /** |
2903 | * cgroup_task_count - count the number of tasks in a cgroup. | |
2904 | * @cgrp: the cgroup in question | |
2905 | * | |
2906 | * Return the number of tasks in the cgroup. | |
2907 | */ | |
bd89aabc | 2908 | int cgroup_task_count(const struct cgroup *cgrp) |
bbcb81d0 PM |
2909 | { |
2910 | int count = 0; | |
71cbb949 | 2911 | struct cg_cgroup_link *link; |
817929ec PM |
2912 | |
2913 | read_lock(&css_set_lock); | |
71cbb949 | 2914 | list_for_each_entry(link, &cgrp->css_sets, cgrp_link_list) { |
146aa1bd | 2915 | count += atomic_read(&link->cg->refcount); |
817929ec PM |
2916 | } |
2917 | read_unlock(&css_set_lock); | |
bbcb81d0 PM |
2918 | return count; |
2919 | } | |
2920 | ||
817929ec PM |
2921 | /* |
2922 | * Advance a list_head iterator. The iterator should be positioned at | |
2923 | * the start of a css_set | |
2924 | */ | |
bd89aabc | 2925 | static void cgroup_advance_iter(struct cgroup *cgrp, |
7717f7ba | 2926 | struct cgroup_iter *it) |
817929ec PM |
2927 | { |
2928 | struct list_head *l = it->cg_link; | |
2929 | struct cg_cgroup_link *link; | |
2930 | struct css_set *cg; | |
2931 | ||
2932 | /* Advance to the next non-empty css_set */ | |
2933 | do { | |
2934 | l = l->next; | |
bd89aabc | 2935 | if (l == &cgrp->css_sets) { |
817929ec PM |
2936 | it->cg_link = NULL; |
2937 | return; | |
2938 | } | |
bd89aabc | 2939 | link = list_entry(l, struct cg_cgroup_link, cgrp_link_list); |
817929ec PM |
2940 | cg = link->cg; |
2941 | } while (list_empty(&cg->tasks)); | |
2942 | it->cg_link = l; | |
2943 | it->task = cg->tasks.next; | |
2944 | } | |
2945 | ||
31a7df01 CW |
2946 | /* |
2947 | * To reduce the fork() overhead for systems that are not actually | |
2948 | * using their cgroups capability, we don't maintain the lists running | |
2949 | * through each css_set to its tasks until we see the list actually | |
2950 | * used - in other words after the first call to cgroup_iter_start(). | |
31a7df01 | 2951 | */ |
3df91fe3 | 2952 | static void cgroup_enable_task_cg_lists(void) |
31a7df01 CW |
2953 | { |
2954 | struct task_struct *p, *g; | |
2955 | write_lock(&css_set_lock); | |
2956 | use_task_css_set_links = 1; | |
3ce3230a FW |
2957 | /* |
2958 | * We need tasklist_lock because RCU is not safe against | |
2959 | * while_each_thread(). Besides, a forking task that has passed | |
2960 | * cgroup_post_fork() without seeing use_task_css_set_links = 1 | |
2961 | * is not guaranteed to have its child immediately visible in the | |
2962 | * tasklist if we walk through it with RCU. | |
2963 | */ | |
2964 | read_lock(&tasklist_lock); | |
31a7df01 CW |
2965 | do_each_thread(g, p) { |
2966 | task_lock(p); | |
0e04388f LZ |
2967 | /* |
2968 | * We should check if the process is exiting, otherwise | |
2969 | * it will race with cgroup_exit() in that the list | |
2970 | * entry won't be deleted though the process has exited. | |
2971 | */ | |
2972 | if (!(p->flags & PF_EXITING) && list_empty(&p->cg_list)) | |
31a7df01 CW |
2973 | list_add(&p->cg_list, &p->cgroups->tasks); |
2974 | task_unlock(p); | |
2975 | } while_each_thread(g, p); | |
3ce3230a | 2976 | read_unlock(&tasklist_lock); |
31a7df01 CW |
2977 | write_unlock(&css_set_lock); |
2978 | } | |
2979 | ||
574bd9f7 TH |
2980 | /** |
2981 | * cgroup_next_descendant_pre - find the next descendant for pre-order walk | |
2982 | * @pos: the current position (%NULL to initiate traversal) | |
2983 | * @cgroup: cgroup whose descendants to walk | |
2984 | * | |
2985 | * To be used by cgroup_for_each_descendant_pre(). Find the next | |
2986 | * descendant to visit for pre-order traversal of @cgroup's descendants. | |
2987 | */ | |
2988 | struct cgroup *cgroup_next_descendant_pre(struct cgroup *pos, | |
2989 | struct cgroup *cgroup) | |
2990 | { | |
2991 | struct cgroup *next; | |
2992 | ||
2993 | WARN_ON_ONCE(!rcu_read_lock_held()); | |
2994 | ||
2995 | /* if first iteration, pretend we just visited @cgroup */ | |
2996 | if (!pos) { | |
2997 | if (list_empty(&cgroup->children)) | |
2998 | return NULL; | |
2999 | pos = cgroup; | |
3000 | } | |
3001 | ||
3002 | /* visit the first child if exists */ | |
3003 | next = list_first_or_null_rcu(&pos->children, struct cgroup, sibling); | |
3004 | if (next) | |
3005 | return next; | |
3006 | ||
3007 | /* no child, visit my or the closest ancestor's next sibling */ | |
3008 | do { | |
3009 | next = list_entry_rcu(pos->sibling.next, struct cgroup, | |
3010 | sibling); | |
3011 | if (&next->sibling != &pos->parent->children) | |
3012 | return next; | |
3013 | ||
3014 | pos = pos->parent; | |
3015 | } while (pos != cgroup); | |
3016 | ||
3017 | return NULL; | |
3018 | } | |
3019 | EXPORT_SYMBOL_GPL(cgroup_next_descendant_pre); | |
3020 | ||
3021 | static struct cgroup *cgroup_leftmost_descendant(struct cgroup *pos) | |
3022 | { | |
3023 | struct cgroup *last; | |
3024 | ||
3025 | do { | |
3026 | last = pos; | |
3027 | pos = list_first_or_null_rcu(&pos->children, struct cgroup, | |
3028 | sibling); | |
3029 | } while (pos); | |
3030 | ||
3031 | return last; | |
3032 | } | |
3033 | ||
3034 | /** | |
3035 | * cgroup_next_descendant_post - find the next descendant for post-order walk | |
3036 | * @pos: the current position (%NULL to initiate traversal) | |
3037 | * @cgroup: cgroup whose descendants to walk | |
3038 | * | |
3039 | * To be used by cgroup_for_each_descendant_post(). Find the next | |
3040 | * descendant to visit for post-order traversal of @cgroup's descendants. | |
3041 | */ | |
3042 | struct cgroup *cgroup_next_descendant_post(struct cgroup *pos, | |
3043 | struct cgroup *cgroup) | |
3044 | { | |
3045 | struct cgroup *next; | |
3046 | ||
3047 | WARN_ON_ONCE(!rcu_read_lock_held()); | |
3048 | ||
3049 | /* if first iteration, visit the leftmost descendant */ | |
3050 | if (!pos) { | |
3051 | next = cgroup_leftmost_descendant(cgroup); | |
3052 | return next != cgroup ? next : NULL; | |
3053 | } | |
3054 | ||
3055 | /* if there's an unvisited sibling, visit its leftmost descendant */ | |
3056 | next = list_entry_rcu(pos->sibling.next, struct cgroup, sibling); | |
3057 | if (&next->sibling != &pos->parent->children) | |
3058 | return cgroup_leftmost_descendant(next); | |
3059 | ||
3060 | /* no sibling left, visit parent */ | |
3061 | next = pos->parent; | |
3062 | return next != cgroup ? next : NULL; | |
3063 | } | |
3064 | EXPORT_SYMBOL_GPL(cgroup_next_descendant_post); | |
3065 | ||
bd89aabc | 3066 | void cgroup_iter_start(struct cgroup *cgrp, struct cgroup_iter *it) |
c6ca5750 | 3067 | __acquires(css_set_lock) |
817929ec PM |
3068 | { |
3069 | /* | |
3070 | * The first time anyone tries to iterate across a cgroup, | |
3071 | * we need to enable the list linking each css_set to its | |
3072 | * tasks, and fix up all existing tasks. | |
3073 | */ | |
31a7df01 CW |
3074 | if (!use_task_css_set_links) |
3075 | cgroup_enable_task_cg_lists(); | |
3076 | ||
817929ec | 3077 | read_lock(&css_set_lock); |
bd89aabc PM |
3078 | it->cg_link = &cgrp->css_sets; |
3079 | cgroup_advance_iter(cgrp, it); | |
817929ec PM |
3080 | } |
3081 | ||
bd89aabc | 3082 | struct task_struct *cgroup_iter_next(struct cgroup *cgrp, |
817929ec PM |
3083 | struct cgroup_iter *it) |
3084 | { | |
3085 | struct task_struct *res; | |
3086 | struct list_head *l = it->task; | |
2019f634 | 3087 | struct cg_cgroup_link *link; |
817929ec PM |
3088 | |
3089 | /* If the iterator cg is NULL, we have no tasks */ | |
3090 | if (!it->cg_link) | |
3091 | return NULL; | |
3092 | res = list_entry(l, struct task_struct, cg_list); | |
3093 | /* Advance iterator to find next entry */ | |
3094 | l = l->next; | |
2019f634 LJ |
3095 | link = list_entry(it->cg_link, struct cg_cgroup_link, cgrp_link_list); |
3096 | if (l == &link->cg->tasks) { | |
817929ec PM |
3097 | /* We reached the end of this task list - move on to |
3098 | * the next cg_cgroup_link */ | |
bd89aabc | 3099 | cgroup_advance_iter(cgrp, it); |
817929ec PM |
3100 | } else { |
3101 | it->task = l; | |
3102 | } | |
3103 | return res; | |
3104 | } | |
3105 | ||
bd89aabc | 3106 | void cgroup_iter_end(struct cgroup *cgrp, struct cgroup_iter *it) |
c6ca5750 | 3107 | __releases(css_set_lock) |
817929ec PM |
3108 | { |
3109 | read_unlock(&css_set_lock); | |
3110 | } | |
3111 | ||
31a7df01 CW |
3112 | static inline int started_after_time(struct task_struct *t1, |
3113 | struct timespec *time, | |
3114 | struct task_struct *t2) | |
3115 | { | |
3116 | int start_diff = timespec_compare(&t1->start_time, time); | |
3117 | if (start_diff > 0) { | |
3118 | return 1; | |
3119 | } else if (start_diff < 0) { | |
3120 | return 0; | |
3121 | } else { | |
3122 | /* | |
3123 | * Arbitrarily, if two processes started at the same | |
3124 | * time, we'll say that the lower pointer value | |
3125 | * started first. Note that t2 may have exited by now | |
3126 | * so this may not be a valid pointer any longer, but | |
3127 | * that's fine - it still serves to distinguish | |
3128 | * between two tasks started (effectively) simultaneously. | |
3129 | */ | |
3130 | return t1 > t2; | |
3131 | } | |
3132 | } | |
3133 | ||
3134 | /* | |
3135 | * This function is a callback from heap_insert() and is used to order | |
3136 | * the heap. | |
3137 | * In this case we order the heap in descending task start time. | |
3138 | */ | |
3139 | static inline int started_after(void *p1, void *p2) | |
3140 | { | |
3141 | struct task_struct *t1 = p1; | |
3142 | struct task_struct *t2 = p2; | |
3143 | return started_after_time(t1, &t2->start_time, t2); | |
3144 | } | |
3145 | ||
3146 | /** | |
3147 | * cgroup_scan_tasks - iterate though all the tasks in a cgroup | |
3148 | * @scan: struct cgroup_scanner containing arguments for the scan | |
3149 | * | |
3150 | * Arguments include pointers to callback functions test_task() and | |
3151 | * process_task(). | |
3152 | * Iterate through all the tasks in a cgroup, calling test_task() for each, | |
3153 | * and if it returns true, call process_task() for it also. | |
3154 | * The test_task pointer may be NULL, meaning always true (select all tasks). | |
3155 | * Effectively duplicates cgroup_iter_{start,next,end}() | |
3156 | * but does not lock css_set_lock for the call to process_task(). | |
3157 | * The struct cgroup_scanner may be embedded in any structure of the caller's | |
3158 | * creation. | |
3159 | * It is guaranteed that process_task() will act on every task that | |
3160 | * is a member of the cgroup for the duration of this call. This | |
3161 | * function may or may not call process_task() for tasks that exit | |
3162 | * or move to a different cgroup during the call, or are forked or | |
3163 | * move into the cgroup during the call. | |
3164 | * | |
3165 | * Note that test_task() may be called with locks held, and may in some | |
3166 | * situations be called multiple times for the same task, so it should | |
3167 | * be cheap. | |
3168 | * If the heap pointer in the struct cgroup_scanner is non-NULL, a heap has been | |
3169 | * pre-allocated and will be used for heap operations (and its "gt" member will | |
3170 | * be overwritten), else a temporary heap will be used (allocation of which | |
3171 | * may cause this function to fail). | |
3172 | */ | |
3173 | int cgroup_scan_tasks(struct cgroup_scanner *scan) | |
3174 | { | |
3175 | int retval, i; | |
3176 | struct cgroup_iter it; | |
3177 | struct task_struct *p, *dropped; | |
3178 | /* Never dereference latest_task, since it's not refcounted */ | |
3179 | struct task_struct *latest_task = NULL; | |
3180 | struct ptr_heap tmp_heap; | |
3181 | struct ptr_heap *heap; | |
3182 | struct timespec latest_time = { 0, 0 }; | |
3183 | ||
3184 | if (scan->heap) { | |
3185 | /* The caller supplied our heap and pre-allocated its memory */ | |
3186 | heap = scan->heap; | |
3187 | heap->gt = &started_after; | |
3188 | } else { | |
3189 | /* We need to allocate our own heap memory */ | |
3190 | heap = &tmp_heap; | |
3191 | retval = heap_init(heap, PAGE_SIZE, GFP_KERNEL, &started_after); | |
3192 | if (retval) | |
3193 | /* cannot allocate the heap */ | |
3194 | return retval; | |
3195 | } | |
3196 | ||
3197 | again: | |
3198 | /* | |
3199 | * Scan tasks in the cgroup, using the scanner's "test_task" callback | |
3200 | * to determine which are of interest, and using the scanner's | |
3201 | * "process_task" callback to process any of them that need an update. | |
3202 | * Since we don't want to hold any locks during the task updates, | |
3203 | * gather tasks to be processed in a heap structure. | |
3204 | * The heap is sorted by descending task start time. | |
3205 | * If the statically-sized heap fills up, we overflow tasks that | |
3206 | * started later, and in future iterations only consider tasks that | |
3207 | * started after the latest task in the previous pass. This | |
3208 | * guarantees forward progress and that we don't miss any tasks. | |
3209 | */ | |
3210 | heap->size = 0; | |
3211 | cgroup_iter_start(scan->cg, &it); | |
3212 | while ((p = cgroup_iter_next(scan->cg, &it))) { | |
3213 | /* | |
3214 | * Only affect tasks that qualify per the caller's callback, | |
3215 | * if he provided one | |
3216 | */ | |
3217 | if (scan->test_task && !scan->test_task(p, scan)) | |
3218 | continue; | |
3219 | /* | |
3220 | * Only process tasks that started after the last task | |
3221 | * we processed | |
3222 | */ | |
3223 | if (!started_after_time(p, &latest_time, latest_task)) | |
3224 | continue; | |
3225 | dropped = heap_insert(heap, p); | |
3226 | if (dropped == NULL) { | |
3227 | /* | |
3228 | * The new task was inserted; the heap wasn't | |
3229 | * previously full | |
3230 | */ | |
3231 | get_task_struct(p); | |
3232 | } else if (dropped != p) { | |
3233 | /* | |
3234 | * The new task was inserted, and pushed out a | |
3235 | * different task | |
3236 | */ | |
3237 | get_task_struct(p); | |
3238 | put_task_struct(dropped); | |
3239 | } | |
3240 | /* | |
3241 | * Else the new task was newer than anything already in | |
3242 | * the heap and wasn't inserted | |
3243 | */ | |
3244 | } | |
3245 | cgroup_iter_end(scan->cg, &it); | |
3246 | ||
3247 | if (heap->size) { | |
3248 | for (i = 0; i < heap->size; i++) { | |
4fe91d51 | 3249 | struct task_struct *q = heap->ptrs[i]; |
31a7df01 | 3250 | if (i == 0) { |
4fe91d51 PJ |
3251 | latest_time = q->start_time; |
3252 | latest_task = q; | |
31a7df01 CW |
3253 | } |
3254 | /* Process the task per the caller's callback */ | |
4fe91d51 PJ |
3255 | scan->process_task(q, scan); |
3256 | put_task_struct(q); | |
31a7df01 CW |
3257 | } |
3258 | /* | |
3259 | * If we had to process any tasks at all, scan again | |
3260 | * in case some of them were in the middle of forking | |
3261 | * children that didn't get processed. | |
3262 | * Not the most efficient way to do it, but it avoids | |
3263 | * having to take callback_mutex in the fork path | |
3264 | */ | |
3265 | goto again; | |
3266 | } | |
3267 | if (heap == &tmp_heap) | |
3268 | heap_free(&tmp_heap); | |
3269 | return 0; | |
3270 | } | |
3271 | ||
bbcb81d0 | 3272 | /* |
102a775e | 3273 | * Stuff for reading the 'tasks'/'procs' files. |
bbcb81d0 PM |
3274 | * |
3275 | * Reading this file can return large amounts of data if a cgroup has | |
3276 | * *lots* of attached tasks. So it may need several calls to read(), | |
3277 | * but we cannot guarantee that the information we produce is correct | |
3278 | * unless we produce it entirely atomically. | |
3279 | * | |
bbcb81d0 | 3280 | */ |
bbcb81d0 | 3281 | |
24528255 LZ |
3282 | /* which pidlist file are we talking about? */ |
3283 | enum cgroup_filetype { | |
3284 | CGROUP_FILE_PROCS, | |
3285 | CGROUP_FILE_TASKS, | |
3286 | }; | |
3287 | ||
3288 | /* | |
3289 | * A pidlist is a list of pids that virtually represents the contents of one | |
3290 | * of the cgroup files ("procs" or "tasks"). We keep a list of such pidlists, | |
3291 | * a pair (one each for procs, tasks) for each pid namespace that's relevant | |
3292 | * to the cgroup. | |
3293 | */ | |
3294 | struct cgroup_pidlist { | |
3295 | /* | |
3296 | * used to find which pidlist is wanted. doesn't change as long as | |
3297 | * this particular list stays in the list. | |
3298 | */ | |
3299 | struct { enum cgroup_filetype type; struct pid_namespace *ns; } key; | |
3300 | /* array of xids */ | |
3301 | pid_t *list; | |
3302 | /* how many elements the above list has */ | |
3303 | int length; | |
3304 | /* how many files are using the current array */ | |
3305 | int use_count; | |
3306 | /* each of these stored in a list by its cgroup */ | |
3307 | struct list_head links; | |
3308 | /* pointer to the cgroup we belong to, for list removal purposes */ | |
3309 | struct cgroup *owner; | |
3310 | /* protects the other fields */ | |
3311 | struct rw_semaphore mutex; | |
3312 | }; | |
3313 | ||
d1d9fd33 BB |
3314 | /* |
3315 | * The following two functions "fix" the issue where there are more pids | |
3316 | * than kmalloc will give memory for; in such cases, we use vmalloc/vfree. | |
3317 | * TODO: replace with a kernel-wide solution to this problem | |
3318 | */ | |
3319 | #define PIDLIST_TOO_LARGE(c) ((c) * sizeof(pid_t) > (PAGE_SIZE * 2)) | |
3320 | static void *pidlist_allocate(int count) | |
3321 | { | |
3322 | if (PIDLIST_TOO_LARGE(count)) | |
3323 | return vmalloc(count * sizeof(pid_t)); | |
3324 | else | |
3325 | return kmalloc(count * sizeof(pid_t), GFP_KERNEL); | |
3326 | } | |
3327 | static void pidlist_free(void *p) | |
3328 | { | |
3329 | if (is_vmalloc_addr(p)) | |
3330 | vfree(p); | |
3331 | else | |
3332 | kfree(p); | |
3333 | } | |
3334 | static void *pidlist_resize(void *p, int newcount) | |
3335 | { | |
3336 | void *newlist; | |
3337 | /* note: if new alloc fails, old p will still be valid either way */ | |
3338 | if (is_vmalloc_addr(p)) { | |
3339 | newlist = vmalloc(newcount * sizeof(pid_t)); | |
3340 | if (!newlist) | |
3341 | return NULL; | |
3342 | memcpy(newlist, p, newcount * sizeof(pid_t)); | |
3343 | vfree(p); | |
3344 | } else { | |
3345 | newlist = krealloc(p, newcount * sizeof(pid_t), GFP_KERNEL); | |
3346 | } | |
3347 | return newlist; | |
3348 | } | |
3349 | ||
bbcb81d0 | 3350 | /* |
102a775e BB |
3351 | * pidlist_uniq - given a kmalloc()ed list, strip out all duplicate entries |
3352 | * If the new stripped list is sufficiently smaller and there's enough memory | |
3353 | * to allocate a new buffer, will let go of the unneeded memory. Returns the | |
3354 | * number of unique elements. | |
bbcb81d0 | 3355 | */ |
102a775e BB |
3356 | /* is the size difference enough that we should re-allocate the array? */ |
3357 | #define PIDLIST_REALLOC_DIFFERENCE(old, new) ((old) - PAGE_SIZE >= (new)) | |
3358 | static int pidlist_uniq(pid_t **p, int length) | |
bbcb81d0 | 3359 | { |
102a775e BB |
3360 | int src, dest = 1; |
3361 | pid_t *list = *p; | |
3362 | pid_t *newlist; | |
3363 | ||
3364 | /* | |
3365 | * we presume the 0th element is unique, so i starts at 1. trivial | |
3366 | * edge cases first; no work needs to be done for either | |
3367 | */ | |
3368 | if (length == 0 || length == 1) | |
3369 | return length; | |
3370 | /* src and dest walk down the list; dest counts unique elements */ | |
3371 | for (src = 1; src < length; src++) { | |
3372 | /* find next unique element */ | |
3373 | while (list[src] == list[src-1]) { | |
3374 | src++; | |
3375 | if (src == length) | |
3376 | goto after; | |
3377 | } | |
3378 | /* dest always points to where the next unique element goes */ | |
3379 | list[dest] = list[src]; | |
3380 | dest++; | |
3381 | } | |
3382 | after: | |
3383 | /* | |
3384 | * if the length difference is large enough, we want to allocate a | |
3385 | * smaller buffer to save memory. if this fails due to out of memory, | |
3386 | * we'll just stay with what we've got. | |
3387 | */ | |
3388 | if (PIDLIST_REALLOC_DIFFERENCE(length, dest)) { | |
d1d9fd33 | 3389 | newlist = pidlist_resize(list, dest); |
102a775e BB |
3390 | if (newlist) |
3391 | *p = newlist; | |
3392 | } | |
3393 | return dest; | |
3394 | } | |
3395 | ||
3396 | static int cmppid(const void *a, const void *b) | |
3397 | { | |
3398 | return *(pid_t *)a - *(pid_t *)b; | |
3399 | } | |
3400 | ||
72a8cb30 BB |
3401 | /* |
3402 | * find the appropriate pidlist for our purpose (given procs vs tasks) | |
3403 | * returns with the lock on that pidlist already held, and takes care | |
3404 | * of the use count, or returns NULL with no locks held if we're out of | |
3405 | * memory. | |
3406 | */ | |
3407 | static struct cgroup_pidlist *cgroup_pidlist_find(struct cgroup *cgrp, | |
3408 | enum cgroup_filetype type) | |
3409 | { | |
3410 | struct cgroup_pidlist *l; | |
3411 | /* don't need task_nsproxy() if we're looking at ourself */ | |
b70cc5fd LZ |
3412 | struct pid_namespace *ns = current->nsproxy->pid_ns; |
3413 | ||
72a8cb30 BB |
3414 | /* |
3415 | * We can't drop the pidlist_mutex before taking the l->mutex in case | |
3416 | * the last ref-holder is trying to remove l from the list at the same | |
3417 | * time. Holding the pidlist_mutex precludes somebody taking whichever | |
3418 | * list we find out from under us - compare release_pid_array(). | |
3419 | */ | |
3420 | mutex_lock(&cgrp->pidlist_mutex); | |
3421 | list_for_each_entry(l, &cgrp->pidlists, links) { | |
3422 | if (l->key.type == type && l->key.ns == ns) { | |
72a8cb30 BB |
3423 | /* make sure l doesn't vanish out from under us */ |
3424 | down_write(&l->mutex); | |
3425 | mutex_unlock(&cgrp->pidlist_mutex); | |
72a8cb30 BB |
3426 | return l; |
3427 | } | |
3428 | } | |
3429 | /* entry not found; create a new one */ | |
3430 | l = kmalloc(sizeof(struct cgroup_pidlist), GFP_KERNEL); | |
3431 | if (!l) { | |
3432 | mutex_unlock(&cgrp->pidlist_mutex); | |
72a8cb30 BB |
3433 | return l; |
3434 | } | |
3435 | init_rwsem(&l->mutex); | |
3436 | down_write(&l->mutex); | |
3437 | l->key.type = type; | |
b70cc5fd | 3438 | l->key.ns = get_pid_ns(ns); |
72a8cb30 BB |
3439 | l->use_count = 0; /* don't increment here */ |
3440 | l->list = NULL; | |
3441 | l->owner = cgrp; | |
3442 | list_add(&l->links, &cgrp->pidlists); | |
3443 | mutex_unlock(&cgrp->pidlist_mutex); | |
3444 | return l; | |
3445 | } | |
3446 | ||
102a775e BB |
3447 | /* |
3448 | * Load a cgroup's pidarray with either procs' tgids or tasks' pids | |
3449 | */ | |
72a8cb30 BB |
3450 | static int pidlist_array_load(struct cgroup *cgrp, enum cgroup_filetype type, |
3451 | struct cgroup_pidlist **lp) | |
102a775e BB |
3452 | { |
3453 | pid_t *array; | |
3454 | int length; | |
3455 | int pid, n = 0; /* used for populating the array */ | |
817929ec PM |
3456 | struct cgroup_iter it; |
3457 | struct task_struct *tsk; | |
102a775e BB |
3458 | struct cgroup_pidlist *l; |
3459 | ||
3460 | /* | |
3461 | * If cgroup gets more users after we read count, we won't have | |
3462 | * enough space - tough. This race is indistinguishable to the | |
3463 | * caller from the case that the additional cgroup users didn't | |
3464 | * show up until sometime later on. | |
3465 | */ | |
3466 | length = cgroup_task_count(cgrp); | |
d1d9fd33 | 3467 | array = pidlist_allocate(length); |
102a775e BB |
3468 | if (!array) |
3469 | return -ENOMEM; | |
3470 | /* now, populate the array */ | |
bd89aabc PM |
3471 | cgroup_iter_start(cgrp, &it); |
3472 | while ((tsk = cgroup_iter_next(cgrp, &it))) { | |
102a775e | 3473 | if (unlikely(n == length)) |
817929ec | 3474 | break; |
102a775e | 3475 | /* get tgid or pid for procs or tasks file respectively */ |
72a8cb30 BB |
3476 | if (type == CGROUP_FILE_PROCS) |
3477 | pid = task_tgid_vnr(tsk); | |
3478 | else | |
3479 | pid = task_pid_vnr(tsk); | |
102a775e BB |
3480 | if (pid > 0) /* make sure to only use valid results */ |
3481 | array[n++] = pid; | |
817929ec | 3482 | } |
bd89aabc | 3483 | cgroup_iter_end(cgrp, &it); |
102a775e BB |
3484 | length = n; |
3485 | /* now sort & (if procs) strip out duplicates */ | |
3486 | sort(array, length, sizeof(pid_t), cmppid, NULL); | |
72a8cb30 | 3487 | if (type == CGROUP_FILE_PROCS) |
102a775e | 3488 | length = pidlist_uniq(&array, length); |
72a8cb30 BB |
3489 | l = cgroup_pidlist_find(cgrp, type); |
3490 | if (!l) { | |
d1d9fd33 | 3491 | pidlist_free(array); |
72a8cb30 | 3492 | return -ENOMEM; |
102a775e | 3493 | } |
72a8cb30 | 3494 | /* store array, freeing old if necessary - lock already held */ |
d1d9fd33 | 3495 | pidlist_free(l->list); |
102a775e BB |
3496 | l->list = array; |
3497 | l->length = length; | |
3498 | l->use_count++; | |
3499 | up_write(&l->mutex); | |
72a8cb30 | 3500 | *lp = l; |
102a775e | 3501 | return 0; |
bbcb81d0 PM |
3502 | } |
3503 | ||
846c7bb0 | 3504 | /** |
a043e3b2 | 3505 | * cgroupstats_build - build and fill cgroupstats |
846c7bb0 BS |
3506 | * @stats: cgroupstats to fill information into |
3507 | * @dentry: A dentry entry belonging to the cgroup for which stats have | |
3508 | * been requested. | |
a043e3b2 LZ |
3509 | * |
3510 | * Build and fill cgroupstats so that taskstats can export it to user | |
3511 | * space. | |
846c7bb0 BS |
3512 | */ |
3513 | int cgroupstats_build(struct cgroupstats *stats, struct dentry *dentry) | |
3514 | { | |
3515 | int ret = -EINVAL; | |
bd89aabc | 3516 | struct cgroup *cgrp; |
846c7bb0 BS |
3517 | struct cgroup_iter it; |
3518 | struct task_struct *tsk; | |
33d283be | 3519 | |
846c7bb0 | 3520 | /* |
33d283be LZ |
3521 | * Validate dentry by checking the superblock operations, |
3522 | * and make sure it's a directory. | |
846c7bb0 | 3523 | */ |
33d283be LZ |
3524 | if (dentry->d_sb->s_op != &cgroup_ops || |
3525 | !S_ISDIR(dentry->d_inode->i_mode)) | |
846c7bb0 BS |
3526 | goto err; |
3527 | ||
3528 | ret = 0; | |
bd89aabc | 3529 | cgrp = dentry->d_fsdata; |
846c7bb0 | 3530 | |
bd89aabc PM |
3531 | cgroup_iter_start(cgrp, &it); |
3532 | while ((tsk = cgroup_iter_next(cgrp, &it))) { | |
846c7bb0 BS |
3533 | switch (tsk->state) { |
3534 | case TASK_RUNNING: | |
3535 | stats->nr_running++; | |
3536 | break; | |
3537 | case TASK_INTERRUPTIBLE: | |
3538 | stats->nr_sleeping++; | |
3539 | break; | |
3540 | case TASK_UNINTERRUPTIBLE: | |
3541 | stats->nr_uninterruptible++; | |
3542 | break; | |
3543 | case TASK_STOPPED: | |
3544 | stats->nr_stopped++; | |
3545 | break; | |
3546 | default: | |
3547 | if (delayacct_is_task_waiting_on_io(tsk)) | |
3548 | stats->nr_io_wait++; | |
3549 | break; | |
3550 | } | |
3551 | } | |
bd89aabc | 3552 | cgroup_iter_end(cgrp, &it); |
846c7bb0 | 3553 | |
846c7bb0 BS |
3554 | err: |
3555 | return ret; | |
3556 | } | |
3557 | ||
8f3ff208 | 3558 | |
bbcb81d0 | 3559 | /* |
102a775e | 3560 | * seq_file methods for the tasks/procs files. The seq_file position is the |
cc31edce | 3561 | * next pid to display; the seq_file iterator is a pointer to the pid |
102a775e | 3562 | * in the cgroup->l->list array. |
bbcb81d0 | 3563 | */ |
cc31edce | 3564 | |
102a775e | 3565 | static void *cgroup_pidlist_start(struct seq_file *s, loff_t *pos) |
bbcb81d0 | 3566 | { |
cc31edce PM |
3567 | /* |
3568 | * Initially we receive a position value that corresponds to | |
3569 | * one more than the last pid shown (or 0 on the first call or | |
3570 | * after a seek to the start). Use a binary-search to find the | |
3571 | * next pid to display, if any | |
3572 | */ | |
102a775e | 3573 | struct cgroup_pidlist *l = s->private; |
cc31edce PM |
3574 | int index = 0, pid = *pos; |
3575 | int *iter; | |
3576 | ||
102a775e | 3577 | down_read(&l->mutex); |
cc31edce | 3578 | if (pid) { |
102a775e | 3579 | int end = l->length; |
20777766 | 3580 | |
cc31edce PM |
3581 | while (index < end) { |
3582 | int mid = (index + end) / 2; | |
102a775e | 3583 | if (l->list[mid] == pid) { |
cc31edce PM |
3584 | index = mid; |
3585 | break; | |
102a775e | 3586 | } else if (l->list[mid] <= pid) |
cc31edce PM |
3587 | index = mid + 1; |
3588 | else | |
3589 | end = mid; | |
3590 | } | |
3591 | } | |
3592 | /* If we're off the end of the array, we're done */ | |
102a775e | 3593 | if (index >= l->length) |
cc31edce PM |
3594 | return NULL; |
3595 | /* Update the abstract position to be the actual pid that we found */ | |
102a775e | 3596 | iter = l->list + index; |
cc31edce PM |
3597 | *pos = *iter; |
3598 | return iter; | |
3599 | } | |
3600 | ||
102a775e | 3601 | static void cgroup_pidlist_stop(struct seq_file *s, void *v) |
cc31edce | 3602 | { |
102a775e BB |
3603 | struct cgroup_pidlist *l = s->private; |
3604 | up_read(&l->mutex); | |
cc31edce PM |
3605 | } |
3606 | ||
102a775e | 3607 | static void *cgroup_pidlist_next(struct seq_file *s, void *v, loff_t *pos) |
cc31edce | 3608 | { |
102a775e BB |
3609 | struct cgroup_pidlist *l = s->private; |
3610 | pid_t *p = v; | |
3611 | pid_t *end = l->list + l->length; | |
cc31edce PM |
3612 | /* |
3613 | * Advance to the next pid in the array. If this goes off the | |
3614 | * end, we're done | |
3615 | */ | |
3616 | p++; | |
3617 | if (p >= end) { | |
3618 | return NULL; | |
3619 | } else { | |
3620 | *pos = *p; | |
3621 | return p; | |
3622 | } | |
3623 | } | |
3624 | ||
102a775e | 3625 | static int cgroup_pidlist_show(struct seq_file *s, void *v) |
cc31edce PM |
3626 | { |
3627 | return seq_printf(s, "%d\n", *(int *)v); | |
3628 | } | |
bbcb81d0 | 3629 | |
102a775e BB |
3630 | /* |
3631 | * seq_operations functions for iterating on pidlists through seq_file - | |
3632 | * independent of whether it's tasks or procs | |
3633 | */ | |
3634 | static const struct seq_operations cgroup_pidlist_seq_operations = { | |
3635 | .start = cgroup_pidlist_start, | |
3636 | .stop = cgroup_pidlist_stop, | |
3637 | .next = cgroup_pidlist_next, | |
3638 | .show = cgroup_pidlist_show, | |
cc31edce PM |
3639 | }; |
3640 | ||
102a775e | 3641 | static void cgroup_release_pid_array(struct cgroup_pidlist *l) |
cc31edce | 3642 | { |
72a8cb30 BB |
3643 | /* |
3644 | * the case where we're the last user of this particular pidlist will | |
3645 | * have us remove it from the cgroup's list, which entails taking the | |
3646 | * mutex. since in pidlist_find the pidlist->lock depends on cgroup-> | |
3647 | * pidlist_mutex, we have to take pidlist_mutex first. | |
3648 | */ | |
3649 | mutex_lock(&l->owner->pidlist_mutex); | |
102a775e BB |
3650 | down_write(&l->mutex); |
3651 | BUG_ON(!l->use_count); | |
3652 | if (!--l->use_count) { | |
72a8cb30 BB |
3653 | /* we're the last user if refcount is 0; remove and free */ |
3654 | list_del(&l->links); | |
3655 | mutex_unlock(&l->owner->pidlist_mutex); | |
d1d9fd33 | 3656 | pidlist_free(l->list); |
72a8cb30 BB |
3657 | put_pid_ns(l->key.ns); |
3658 | up_write(&l->mutex); | |
3659 | kfree(l); | |
3660 | return; | |
cc31edce | 3661 | } |
72a8cb30 | 3662 | mutex_unlock(&l->owner->pidlist_mutex); |
102a775e | 3663 | up_write(&l->mutex); |
bbcb81d0 PM |
3664 | } |
3665 | ||
102a775e | 3666 | static int cgroup_pidlist_release(struct inode *inode, struct file *file) |
cc31edce | 3667 | { |
102a775e | 3668 | struct cgroup_pidlist *l; |
cc31edce PM |
3669 | if (!(file->f_mode & FMODE_READ)) |
3670 | return 0; | |
102a775e BB |
3671 | /* |
3672 | * the seq_file will only be initialized if the file was opened for | |
3673 | * reading; hence we check if it's not null only in that case. | |
3674 | */ | |
3675 | l = ((struct seq_file *)file->private_data)->private; | |
3676 | cgroup_release_pid_array(l); | |
cc31edce PM |
3677 | return seq_release(inode, file); |
3678 | } | |
3679 | ||
102a775e | 3680 | static const struct file_operations cgroup_pidlist_operations = { |
cc31edce PM |
3681 | .read = seq_read, |
3682 | .llseek = seq_lseek, | |
3683 | .write = cgroup_file_write, | |
102a775e | 3684 | .release = cgroup_pidlist_release, |
cc31edce PM |
3685 | }; |
3686 | ||
bbcb81d0 | 3687 | /* |
102a775e BB |
3688 | * The following functions handle opens on a file that displays a pidlist |
3689 | * (tasks or procs). Prepare an array of the process/thread IDs of whoever's | |
3690 | * in the cgroup. | |
bbcb81d0 | 3691 | */ |
102a775e | 3692 | /* helper function for the two below it */ |
72a8cb30 | 3693 | static int cgroup_pidlist_open(struct file *file, enum cgroup_filetype type) |
bbcb81d0 | 3694 | { |
bd89aabc | 3695 | struct cgroup *cgrp = __d_cgrp(file->f_dentry->d_parent); |
72a8cb30 | 3696 | struct cgroup_pidlist *l; |
cc31edce | 3697 | int retval; |
bbcb81d0 | 3698 | |
cc31edce | 3699 | /* Nothing to do for write-only files */ |
bbcb81d0 PM |
3700 | if (!(file->f_mode & FMODE_READ)) |
3701 | return 0; | |
3702 | ||
102a775e | 3703 | /* have the array populated */ |
72a8cb30 | 3704 | retval = pidlist_array_load(cgrp, type, &l); |
102a775e BB |
3705 | if (retval) |
3706 | return retval; | |
3707 | /* configure file information */ | |
3708 | file->f_op = &cgroup_pidlist_operations; | |
cc31edce | 3709 | |
102a775e | 3710 | retval = seq_open(file, &cgroup_pidlist_seq_operations); |
cc31edce | 3711 | if (retval) { |
102a775e | 3712 | cgroup_release_pid_array(l); |
cc31edce | 3713 | return retval; |
bbcb81d0 | 3714 | } |
102a775e | 3715 | ((struct seq_file *)file->private_data)->private = l; |
bbcb81d0 PM |
3716 | return 0; |
3717 | } | |
102a775e BB |
3718 | static int cgroup_tasks_open(struct inode *unused, struct file *file) |
3719 | { | |
72a8cb30 | 3720 | return cgroup_pidlist_open(file, CGROUP_FILE_TASKS); |
102a775e BB |
3721 | } |
3722 | static int cgroup_procs_open(struct inode *unused, struct file *file) | |
3723 | { | |
72a8cb30 | 3724 | return cgroup_pidlist_open(file, CGROUP_FILE_PROCS); |
102a775e | 3725 | } |
bbcb81d0 | 3726 | |
bd89aabc | 3727 | static u64 cgroup_read_notify_on_release(struct cgroup *cgrp, |
81a6a5cd PM |
3728 | struct cftype *cft) |
3729 | { | |
bd89aabc | 3730 | return notify_on_release(cgrp); |
81a6a5cd PM |
3731 | } |
3732 | ||
6379c106 PM |
3733 | static int cgroup_write_notify_on_release(struct cgroup *cgrp, |
3734 | struct cftype *cft, | |
3735 | u64 val) | |
3736 | { | |
3737 | clear_bit(CGRP_RELEASABLE, &cgrp->flags); | |
3738 | if (val) | |
3739 | set_bit(CGRP_NOTIFY_ON_RELEASE, &cgrp->flags); | |
3740 | else | |
3741 | clear_bit(CGRP_NOTIFY_ON_RELEASE, &cgrp->flags); | |
3742 | return 0; | |
3743 | } | |
3744 | ||
0dea1168 KS |
3745 | /* |
3746 | * Unregister event and free resources. | |
3747 | * | |
3748 | * Gets called from workqueue. | |
3749 | */ | |
3750 | static void cgroup_event_remove(struct work_struct *work) | |
3751 | { | |
3752 | struct cgroup_event *event = container_of(work, struct cgroup_event, | |
3753 | remove); | |
3754 | struct cgroup *cgrp = event->cgrp; | |
3755 | ||
0dea1168 KS |
3756 | event->cft->unregister_event(cgrp, event->cft, event->eventfd); |
3757 | ||
3758 | eventfd_ctx_put(event->eventfd); | |
0dea1168 | 3759 | kfree(event); |
a0a4db54 | 3760 | dput(cgrp->dentry); |
0dea1168 KS |
3761 | } |
3762 | ||
3763 | /* | |
3764 | * Gets called on POLLHUP on eventfd when user closes it. | |
3765 | * | |
3766 | * Called with wqh->lock held and interrupts disabled. | |
3767 | */ | |
3768 | static int cgroup_event_wake(wait_queue_t *wait, unsigned mode, | |
3769 | int sync, void *key) | |
3770 | { | |
3771 | struct cgroup_event *event = container_of(wait, | |
3772 | struct cgroup_event, wait); | |
3773 | struct cgroup *cgrp = event->cgrp; | |
3774 | unsigned long flags = (unsigned long)key; | |
3775 | ||
3776 | if (flags & POLLHUP) { | |
a93d2f17 | 3777 | __remove_wait_queue(event->wqh, &event->wait); |
0dea1168 | 3778 | spin_lock(&cgrp->event_list_lock); |
9718ceb3 | 3779 | list_del_init(&event->list); |
0dea1168 KS |
3780 | spin_unlock(&cgrp->event_list_lock); |
3781 | /* | |
3782 | * We are in atomic context, but cgroup_event_remove() may | |
3783 | * sleep, so we have to call it in workqueue. | |
3784 | */ | |
3785 | schedule_work(&event->remove); | |
3786 | } | |
3787 | ||
3788 | return 0; | |
3789 | } | |
3790 | ||
3791 | static void cgroup_event_ptable_queue_proc(struct file *file, | |
3792 | wait_queue_head_t *wqh, poll_table *pt) | |
3793 | { | |
3794 | struct cgroup_event *event = container_of(pt, | |
3795 | struct cgroup_event, pt); | |
3796 | ||
3797 | event->wqh = wqh; | |
3798 | add_wait_queue(wqh, &event->wait); | |
3799 | } | |
3800 | ||
3801 | /* | |
3802 | * Parse input and register new cgroup event handler. | |
3803 | * | |
3804 | * Input must be in format '<event_fd> <control_fd> <args>'. | |
3805 | * Interpretation of args is defined by control file implementation. | |
3806 | */ | |
3807 | static int cgroup_write_event_control(struct cgroup *cgrp, struct cftype *cft, | |
3808 | const char *buffer) | |
3809 | { | |
3810 | struct cgroup_event *event = NULL; | |
3811 | unsigned int efd, cfd; | |
3812 | struct file *efile = NULL; | |
3813 | struct file *cfile = NULL; | |
3814 | char *endp; | |
3815 | int ret; | |
3816 | ||
3817 | efd = simple_strtoul(buffer, &endp, 10); | |
3818 | if (*endp != ' ') | |
3819 | return -EINVAL; | |
3820 | buffer = endp + 1; | |
3821 | ||
3822 | cfd = simple_strtoul(buffer, &endp, 10); | |
3823 | if ((*endp != ' ') && (*endp != '\0')) | |
3824 | return -EINVAL; | |
3825 | buffer = endp + 1; | |
3826 | ||
3827 | event = kzalloc(sizeof(*event), GFP_KERNEL); | |
3828 | if (!event) | |
3829 | return -ENOMEM; | |
3830 | event->cgrp = cgrp; | |
3831 | INIT_LIST_HEAD(&event->list); | |
3832 | init_poll_funcptr(&event->pt, cgroup_event_ptable_queue_proc); | |
3833 | init_waitqueue_func_entry(&event->wait, cgroup_event_wake); | |
3834 | INIT_WORK(&event->remove, cgroup_event_remove); | |
3835 | ||
3836 | efile = eventfd_fget(efd); | |
3837 | if (IS_ERR(efile)) { | |
3838 | ret = PTR_ERR(efile); | |
3839 | goto fail; | |
3840 | } | |
3841 | ||
3842 | event->eventfd = eventfd_ctx_fileget(efile); | |
3843 | if (IS_ERR(event->eventfd)) { | |
3844 | ret = PTR_ERR(event->eventfd); | |
3845 | goto fail; | |
3846 | } | |
3847 | ||
3848 | cfile = fget(cfd); | |
3849 | if (!cfile) { | |
3850 | ret = -EBADF; | |
3851 | goto fail; | |
3852 | } | |
3853 | ||
3854 | /* the process need read permission on control file */ | |
3bfa784a AV |
3855 | /* AV: shouldn't we check that it's been opened for read instead? */ |
3856 | ret = inode_permission(cfile->f_path.dentry->d_inode, MAY_READ); | |
0dea1168 KS |
3857 | if (ret < 0) |
3858 | goto fail; | |
3859 | ||
3860 | event->cft = __file_cft(cfile); | |
3861 | if (IS_ERR(event->cft)) { | |
3862 | ret = PTR_ERR(event->cft); | |
3863 | goto fail; | |
3864 | } | |
3865 | ||
3866 | if (!event->cft->register_event || !event->cft->unregister_event) { | |
3867 | ret = -EINVAL; | |
3868 | goto fail; | |
3869 | } | |
3870 | ||
3871 | ret = event->cft->register_event(cgrp, event->cft, | |
3872 | event->eventfd, buffer); | |
3873 | if (ret) | |
3874 | goto fail; | |
3875 | ||
3876 | if (efile->f_op->poll(efile, &event->pt) & POLLHUP) { | |
3877 | event->cft->unregister_event(cgrp, event->cft, event->eventfd); | |
3878 | ret = 0; | |
3879 | goto fail; | |
3880 | } | |
3881 | ||
a0a4db54 KS |
3882 | /* |
3883 | * Events should be removed after rmdir of cgroup directory, but before | |
3884 | * destroying subsystem state objects. Let's take reference to cgroup | |
3885 | * directory dentry to do that. | |
3886 | */ | |
3887 | dget(cgrp->dentry); | |
3888 | ||
0dea1168 KS |
3889 | spin_lock(&cgrp->event_list_lock); |
3890 | list_add(&event->list, &cgrp->event_list); | |
3891 | spin_unlock(&cgrp->event_list_lock); | |
3892 | ||
3893 | fput(cfile); | |
3894 | fput(efile); | |
3895 | ||
3896 | return 0; | |
3897 | ||
3898 | fail: | |
3899 | if (cfile) | |
3900 | fput(cfile); | |
3901 | ||
3902 | if (event && event->eventfd && !IS_ERR(event->eventfd)) | |
3903 | eventfd_ctx_put(event->eventfd); | |
3904 | ||
3905 | if (!IS_ERR_OR_NULL(efile)) | |
3906 | fput(efile); | |
3907 | ||
3908 | kfree(event); | |
3909 | ||
3910 | return ret; | |
3911 | } | |
3912 | ||
97978e6d DL |
3913 | static u64 cgroup_clone_children_read(struct cgroup *cgrp, |
3914 | struct cftype *cft) | |
3915 | { | |
2260e7fc | 3916 | return test_bit(CGRP_CPUSET_CLONE_CHILDREN, &cgrp->flags); |
97978e6d DL |
3917 | } |
3918 | ||
3919 | static int cgroup_clone_children_write(struct cgroup *cgrp, | |
3920 | struct cftype *cft, | |
3921 | u64 val) | |
3922 | { | |
3923 | if (val) | |
2260e7fc | 3924 | set_bit(CGRP_CPUSET_CLONE_CHILDREN, &cgrp->flags); |
97978e6d | 3925 | else |
2260e7fc | 3926 | clear_bit(CGRP_CPUSET_CLONE_CHILDREN, &cgrp->flags); |
97978e6d DL |
3927 | return 0; |
3928 | } | |
3929 | ||
bbcb81d0 PM |
3930 | /* |
3931 | * for the common functions, 'private' gives the type of file | |
3932 | */ | |
102a775e BB |
3933 | /* for hysterical raisins, we can't put this on the older files */ |
3934 | #define CGROUP_FILE_GENERIC_PREFIX "cgroup." | |
81a6a5cd PM |
3935 | static struct cftype files[] = { |
3936 | { | |
3937 | .name = "tasks", | |
3938 | .open = cgroup_tasks_open, | |
af351026 | 3939 | .write_u64 = cgroup_tasks_write, |
102a775e | 3940 | .release = cgroup_pidlist_release, |
099fca32 | 3941 | .mode = S_IRUGO | S_IWUSR, |
81a6a5cd | 3942 | }, |
102a775e BB |
3943 | { |
3944 | .name = CGROUP_FILE_GENERIC_PREFIX "procs", | |
3945 | .open = cgroup_procs_open, | |
74a1166d | 3946 | .write_u64 = cgroup_procs_write, |
102a775e | 3947 | .release = cgroup_pidlist_release, |
74a1166d | 3948 | .mode = S_IRUGO | S_IWUSR, |
102a775e | 3949 | }, |
81a6a5cd PM |
3950 | { |
3951 | .name = "notify_on_release", | |
f4c753b7 | 3952 | .read_u64 = cgroup_read_notify_on_release, |
6379c106 | 3953 | .write_u64 = cgroup_write_notify_on_release, |
81a6a5cd | 3954 | }, |
0dea1168 KS |
3955 | { |
3956 | .name = CGROUP_FILE_GENERIC_PREFIX "event_control", | |
3957 | .write_string = cgroup_write_event_control, | |
3958 | .mode = S_IWUGO, | |
3959 | }, | |
97978e6d DL |
3960 | { |
3961 | .name = "cgroup.clone_children", | |
3962 | .read_u64 = cgroup_clone_children_read, | |
3963 | .write_u64 = cgroup_clone_children_write, | |
3964 | }, | |
6e6ff25b TH |
3965 | { |
3966 | .name = "release_agent", | |
3967 | .flags = CFTYPE_ONLY_ON_ROOT, | |
3968 | .read_seq_string = cgroup_release_agent_show, | |
3969 | .write_string = cgroup_release_agent_write, | |
3970 | .max_write_len = PATH_MAX, | |
3971 | }, | |
db0416b6 | 3972 | { } /* terminate */ |
bbcb81d0 PM |
3973 | }; |
3974 | ||
13af07df AR |
3975 | /** |
3976 | * cgroup_populate_dir - selectively creation of files in a directory | |
3977 | * @cgrp: target cgroup | |
3978 | * @base_files: true if the base files should be added | |
3979 | * @subsys_mask: mask of the subsystem ids whose files should be added | |
3980 | */ | |
3981 | static int cgroup_populate_dir(struct cgroup *cgrp, bool base_files, | |
3982 | unsigned long subsys_mask) | |
ddbcc7e8 PM |
3983 | { |
3984 | int err; | |
3985 | struct cgroup_subsys *ss; | |
3986 | ||
13af07df AR |
3987 | if (base_files) { |
3988 | err = cgroup_addrm_files(cgrp, NULL, files, true); | |
3989 | if (err < 0) | |
3990 | return err; | |
3991 | } | |
bbcb81d0 | 3992 | |
8e3f6541 | 3993 | /* process cftsets of each subsystem */ |
bd89aabc | 3994 | for_each_subsys(cgrp->root, ss) { |
8e3f6541 | 3995 | struct cftype_set *set; |
13af07df AR |
3996 | if (!test_bit(ss->subsys_id, &subsys_mask)) |
3997 | continue; | |
8e3f6541 | 3998 | |
db0416b6 | 3999 | list_for_each_entry(set, &ss->cftsets, node) |
79578621 | 4000 | cgroup_addrm_files(cgrp, ss, set->cfts, true); |
ddbcc7e8 | 4001 | } |
8e3f6541 | 4002 | |
38460b48 KH |
4003 | /* This cgroup is ready now */ |
4004 | for_each_subsys(cgrp->root, ss) { | |
4005 | struct cgroup_subsys_state *css = cgrp->subsys[ss->subsys_id]; | |
4006 | /* | |
4007 | * Update id->css pointer and make this css visible from | |
4008 | * CSS ID functions. This pointer will be dereferened | |
4009 | * from RCU-read-side without locks. | |
4010 | */ | |
4011 | if (css->id) | |
4012 | rcu_assign_pointer(css->id->css, css); | |
4013 | } | |
ddbcc7e8 PM |
4014 | |
4015 | return 0; | |
4016 | } | |
4017 | ||
48ddbe19 TH |
4018 | static void css_dput_fn(struct work_struct *work) |
4019 | { | |
4020 | struct cgroup_subsys_state *css = | |
4021 | container_of(work, struct cgroup_subsys_state, dput_work); | |
5db9a4d9 TH |
4022 | struct dentry *dentry = css->cgroup->dentry; |
4023 | struct super_block *sb = dentry->d_sb; | |
48ddbe19 | 4024 | |
5db9a4d9 TH |
4025 | atomic_inc(&sb->s_active); |
4026 | dput(dentry); | |
4027 | deactivate_super(sb); | |
48ddbe19 TH |
4028 | } |
4029 | ||
ddbcc7e8 PM |
4030 | static void init_cgroup_css(struct cgroup_subsys_state *css, |
4031 | struct cgroup_subsys *ss, | |
bd89aabc | 4032 | struct cgroup *cgrp) |
ddbcc7e8 | 4033 | { |
bd89aabc | 4034 | css->cgroup = cgrp; |
e7c5ec91 | 4035 | atomic_set(&css->refcnt, 1); |
ddbcc7e8 | 4036 | css->flags = 0; |
38460b48 | 4037 | css->id = NULL; |
bd89aabc | 4038 | if (cgrp == dummytop) |
38b53aba | 4039 | css->flags |= CSS_ROOT; |
bd89aabc PM |
4040 | BUG_ON(cgrp->subsys[ss->subsys_id]); |
4041 | cgrp->subsys[ss->subsys_id] = css; | |
48ddbe19 TH |
4042 | |
4043 | /* | |
ed957793 TH |
4044 | * css holds an extra ref to @cgrp->dentry which is put on the last |
4045 | * css_put(). dput() requires process context, which css_put() may | |
4046 | * be called without. @css->dput_work will be used to invoke | |
4047 | * dput() asynchronously from css_put(). | |
48ddbe19 TH |
4048 | */ |
4049 | INIT_WORK(&css->dput_work, css_dput_fn); | |
ddbcc7e8 PM |
4050 | } |
4051 | ||
b1929db4 TH |
4052 | /* invoke ->post_create() on a new CSS and mark it online if successful */ |
4053 | static int online_css(struct cgroup_subsys *ss, struct cgroup *cgrp) | |
a31f2d3f | 4054 | { |
b1929db4 TH |
4055 | int ret = 0; |
4056 | ||
a31f2d3f TH |
4057 | lockdep_assert_held(&cgroup_mutex); |
4058 | ||
92fb9748 TH |
4059 | if (ss->css_online) |
4060 | ret = ss->css_online(cgrp); | |
b1929db4 TH |
4061 | if (!ret) |
4062 | cgrp->subsys[ss->subsys_id]->flags |= CSS_ONLINE; | |
4063 | return ret; | |
a31f2d3f TH |
4064 | } |
4065 | ||
4066 | /* if the CSS is online, invoke ->pre_destory() on it and mark it offline */ | |
4067 | static void offline_css(struct cgroup_subsys *ss, struct cgroup *cgrp) | |
4068 | __releases(&cgroup_mutex) __acquires(&cgroup_mutex) | |
4069 | { | |
4070 | struct cgroup_subsys_state *css = cgrp->subsys[ss->subsys_id]; | |
4071 | ||
4072 | lockdep_assert_held(&cgroup_mutex); | |
4073 | ||
4074 | if (!(css->flags & CSS_ONLINE)) | |
4075 | return; | |
4076 | ||
4077 | /* | |
92fb9748 | 4078 | * css_offline() should be called with cgroup_mutex unlocked. See |
a31f2d3f TH |
4079 | * 3fa59dfbc3 ("cgroup: fix potential deadlock in pre_destroy") for |
4080 | * details. This temporary unlocking should go away once | |
4081 | * cgroup_mutex is unexported from controllers. | |
4082 | */ | |
92fb9748 | 4083 | if (ss->css_offline) { |
a31f2d3f | 4084 | mutex_unlock(&cgroup_mutex); |
92fb9748 | 4085 | ss->css_offline(cgrp); |
a31f2d3f TH |
4086 | mutex_lock(&cgroup_mutex); |
4087 | } | |
4088 | ||
4089 | cgrp->subsys[ss->subsys_id]->flags &= ~CSS_ONLINE; | |
4090 | } | |
4091 | ||
ddbcc7e8 | 4092 | /* |
a043e3b2 LZ |
4093 | * cgroup_create - create a cgroup |
4094 | * @parent: cgroup that will be parent of the new cgroup | |
4095 | * @dentry: dentry of the new cgroup | |
4096 | * @mode: mode to set on new inode | |
ddbcc7e8 | 4097 | * |
a043e3b2 | 4098 | * Must be called with the mutex on the parent inode held |
ddbcc7e8 | 4099 | */ |
ddbcc7e8 | 4100 | static long cgroup_create(struct cgroup *parent, struct dentry *dentry, |
a5e7ed32 | 4101 | umode_t mode) |
ddbcc7e8 | 4102 | { |
bd89aabc | 4103 | struct cgroup *cgrp; |
ddbcc7e8 PM |
4104 | struct cgroupfs_root *root = parent->root; |
4105 | int err = 0; | |
4106 | struct cgroup_subsys *ss; | |
4107 | struct super_block *sb = root->sb; | |
4108 | ||
0a950f65 | 4109 | /* allocate the cgroup and its ID, 0 is reserved for the root */ |
bd89aabc PM |
4110 | cgrp = kzalloc(sizeof(*cgrp), GFP_KERNEL); |
4111 | if (!cgrp) | |
ddbcc7e8 PM |
4112 | return -ENOMEM; |
4113 | ||
0a950f65 TH |
4114 | cgrp->id = ida_simple_get(&root->cgroup_ida, 1, 0, GFP_KERNEL); |
4115 | if (cgrp->id < 0) | |
4116 | goto err_free_cgrp; | |
4117 | ||
976c06bc TH |
4118 | /* |
4119 | * Only live parents can have children. Note that the liveliness | |
4120 | * check isn't strictly necessary because cgroup_mkdir() and | |
4121 | * cgroup_rmdir() are fully synchronized by i_mutex; however, do it | |
4122 | * anyway so that locking is contained inside cgroup proper and we | |
4123 | * don't get nasty surprises if we ever grow another caller. | |
4124 | */ | |
4125 | if (!cgroup_lock_live_group(parent)) { | |
4126 | err = -ENODEV; | |
0a950f65 | 4127 | goto err_free_id; |
976c06bc TH |
4128 | } |
4129 | ||
ddbcc7e8 PM |
4130 | /* Grab a reference on the superblock so the hierarchy doesn't |
4131 | * get deleted on unmount if there are child cgroups. This | |
4132 | * can be done outside cgroup_mutex, since the sb can't | |
4133 | * disappear while someone has an open control file on the | |
4134 | * fs */ | |
4135 | atomic_inc(&sb->s_active); | |
4136 | ||
cc31edce | 4137 | init_cgroup_housekeeping(cgrp); |
ddbcc7e8 | 4138 | |
bd89aabc PM |
4139 | cgrp->parent = parent; |
4140 | cgrp->root = parent->root; | |
4141 | cgrp->top_cgroup = parent->top_cgroup; | |
ddbcc7e8 | 4142 | |
b6abdb0e LZ |
4143 | if (notify_on_release(parent)) |
4144 | set_bit(CGRP_NOTIFY_ON_RELEASE, &cgrp->flags); | |
4145 | ||
2260e7fc TH |
4146 | if (test_bit(CGRP_CPUSET_CLONE_CHILDREN, &parent->flags)) |
4147 | set_bit(CGRP_CPUSET_CLONE_CHILDREN, &cgrp->flags); | |
97978e6d | 4148 | |
ddbcc7e8 | 4149 | for_each_subsys(root, ss) { |
8c7f6edb | 4150 | struct cgroup_subsys_state *css; |
4528fd05 | 4151 | |
92fb9748 | 4152 | css = ss->css_alloc(cgrp); |
ddbcc7e8 PM |
4153 | if (IS_ERR(css)) { |
4154 | err = PTR_ERR(css); | |
4b8b47eb | 4155 | goto err_free_all; |
ddbcc7e8 | 4156 | } |
bd89aabc | 4157 | init_cgroup_css(css, ss, cgrp); |
4528fd05 LZ |
4158 | if (ss->use_id) { |
4159 | err = alloc_css_id(ss, parent, cgrp); | |
4160 | if (err) | |
4b8b47eb | 4161 | goto err_free_all; |
4528fd05 | 4162 | } |
ddbcc7e8 PM |
4163 | } |
4164 | ||
4e139afc TH |
4165 | /* |
4166 | * Create directory. cgroup_create_file() returns with the new | |
4167 | * directory locked on success so that it can be populated without | |
4168 | * dropping cgroup_mutex. | |
4169 | */ | |
28fd6f30 | 4170 | err = cgroup_create_file(dentry, S_IFDIR | mode, sb); |
ddbcc7e8 | 4171 | if (err < 0) |
4b8b47eb | 4172 | goto err_free_all; |
4e139afc | 4173 | lockdep_assert_held(&dentry->d_inode->i_mutex); |
ddbcc7e8 | 4174 | |
4e139afc | 4175 | /* allocation complete, commit to creation */ |
28fd6f30 | 4176 | dentry->d_fsdata = cgrp; |
febfcef6 | 4177 | cgrp->dentry = dentry; |
4e139afc TH |
4178 | list_add_tail(&cgrp->allcg_node, &root->allcg_list); |
4179 | list_add_tail_rcu(&cgrp->sibling, &cgrp->parent->children); | |
4180 | root->number_of_cgroups++; | |
28fd6f30 | 4181 | |
b1929db4 TH |
4182 | /* each css holds a ref to the cgroup's dentry */ |
4183 | for_each_subsys(root, ss) | |
ed957793 | 4184 | dget(dentry); |
48ddbe19 | 4185 | |
b1929db4 TH |
4186 | /* creation succeeded, notify subsystems */ |
4187 | for_each_subsys(root, ss) { | |
4188 | err = online_css(ss, cgrp); | |
4189 | if (err) | |
4190 | goto err_destroy; | |
1f869e87 GC |
4191 | |
4192 | if (ss->broken_hierarchy && !ss->warned_broken_hierarchy && | |
4193 | parent->parent) { | |
4194 | 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", | |
4195 | current->comm, current->pid, ss->name); | |
4196 | if (!strcmp(ss->name, "memory")) | |
4197 | pr_warning("cgroup: \"memory\" requires setting use_hierarchy to 1 on the root.\n"); | |
4198 | ss->warned_broken_hierarchy = true; | |
4199 | } | |
a8638030 TH |
4200 | } |
4201 | ||
a1a71b45 | 4202 | err = cgroup_populate_dir(cgrp, true, root->subsys_mask); |
4b8b47eb TH |
4203 | if (err) |
4204 | goto err_destroy; | |
ddbcc7e8 PM |
4205 | |
4206 | mutex_unlock(&cgroup_mutex); | |
bd89aabc | 4207 | mutex_unlock(&cgrp->dentry->d_inode->i_mutex); |
ddbcc7e8 PM |
4208 | |
4209 | return 0; | |
4210 | ||
4b8b47eb | 4211 | err_free_all: |
ddbcc7e8 | 4212 | for_each_subsys(root, ss) { |
bd89aabc | 4213 | if (cgrp->subsys[ss->subsys_id]) |
92fb9748 | 4214 | ss->css_free(cgrp); |
ddbcc7e8 | 4215 | } |
ddbcc7e8 | 4216 | mutex_unlock(&cgroup_mutex); |
ddbcc7e8 PM |
4217 | /* Release the reference count that we took on the superblock */ |
4218 | deactivate_super(sb); | |
0a950f65 TH |
4219 | err_free_id: |
4220 | ida_simple_remove(&root->cgroup_ida, cgrp->id); | |
4b8b47eb | 4221 | err_free_cgrp: |
bd89aabc | 4222 | kfree(cgrp); |
ddbcc7e8 | 4223 | return err; |
4b8b47eb TH |
4224 | |
4225 | err_destroy: | |
4226 | cgroup_destroy_locked(cgrp); | |
4227 | mutex_unlock(&cgroup_mutex); | |
4228 | mutex_unlock(&dentry->d_inode->i_mutex); | |
4229 | return err; | |
ddbcc7e8 PM |
4230 | } |
4231 | ||
18bb1db3 | 4232 | static int cgroup_mkdir(struct inode *dir, struct dentry *dentry, umode_t mode) |
ddbcc7e8 PM |
4233 | { |
4234 | struct cgroup *c_parent = dentry->d_parent->d_fsdata; | |
4235 | ||
4236 | /* the vfs holds inode->i_mutex already */ | |
4237 | return cgroup_create(c_parent, dentry, mode | S_IFDIR); | |
4238 | } | |
4239 | ||
28b4c27b TH |
4240 | /* |
4241 | * Check the reference count on each subsystem. Since we already | |
4242 | * established that there are no tasks in the cgroup, if the css refcount | |
4243 | * is also 1, then there should be no outstanding references, so the | |
4244 | * subsystem is safe to destroy. We scan across all subsystems rather than | |
4245 | * using the per-hierarchy linked list of mounted subsystems since we can | |
4246 | * be called via check_for_release() with no synchronization other than | |
4247 | * RCU, and the subsystem linked list isn't RCU-safe. | |
4248 | */ | |
55b6fd01 | 4249 | static int cgroup_has_css_refs(struct cgroup *cgrp) |
81a6a5cd | 4250 | { |
81a6a5cd | 4251 | int i; |
28b4c27b | 4252 | |
aae8aab4 BB |
4253 | /* |
4254 | * We won't need to lock the subsys array, because the subsystems | |
4255 | * we're concerned about aren't going anywhere since our cgroup root | |
4256 | * has a reference on them. | |
4257 | */ | |
81a6a5cd PM |
4258 | for (i = 0; i < CGROUP_SUBSYS_COUNT; i++) { |
4259 | struct cgroup_subsys *ss = subsys[i]; | |
4260 | struct cgroup_subsys_state *css; | |
28b4c27b | 4261 | |
aae8aab4 BB |
4262 | /* Skip subsystems not present or not in this hierarchy */ |
4263 | if (ss == NULL || ss->root != cgrp->root) | |
81a6a5cd | 4264 | continue; |
28b4c27b | 4265 | |
bd89aabc | 4266 | css = cgrp->subsys[ss->subsys_id]; |
28b4c27b TH |
4267 | /* |
4268 | * When called from check_for_release() it's possible | |
81a6a5cd PM |
4269 | * that by this point the cgroup has been removed |
4270 | * and the css deleted. But a false-positive doesn't | |
4271 | * matter, since it can only happen if the cgroup | |
4272 | * has been deleted and hence no longer needs the | |
28b4c27b TH |
4273 | * release agent to be called anyway. |
4274 | */ | |
4275 | if (css && css_refcnt(css) > 1) | |
81a6a5cd | 4276 | return 1; |
81a6a5cd PM |
4277 | } |
4278 | return 0; | |
4279 | } | |
4280 | ||
42809dd4 TH |
4281 | static int cgroup_destroy_locked(struct cgroup *cgrp) |
4282 | __releases(&cgroup_mutex) __acquires(&cgroup_mutex) | |
ddbcc7e8 | 4283 | { |
42809dd4 TH |
4284 | struct dentry *d = cgrp->dentry; |
4285 | struct cgroup *parent = cgrp->parent; | |
ec64f515 | 4286 | DEFINE_WAIT(wait); |
4ab78683 | 4287 | struct cgroup_event *event, *tmp; |
ed957793 | 4288 | struct cgroup_subsys *ss; |
205a872b | 4289 | LIST_HEAD(tmp_list); |
ddbcc7e8 | 4290 | |
42809dd4 TH |
4291 | lockdep_assert_held(&d->d_inode->i_mutex); |
4292 | lockdep_assert_held(&cgroup_mutex); | |
4293 | ||
4294 | if (atomic_read(&cgrp->count) || !list_empty(&cgrp->children)) | |
ddbcc7e8 | 4295 | return -EBUSY; |
a043e3b2 | 4296 | |
88703267 | 4297 | /* |
1a90dd50 TH |
4298 | * Block new css_tryget() by deactivating refcnt and mark @cgrp |
4299 | * removed. This makes future css_tryget() and child creation | |
4300 | * attempts fail thus maintaining the removal conditions verified | |
4301 | * above. | |
88703267 | 4302 | */ |
ed957793 TH |
4303 | for_each_subsys(cgrp->root, ss) { |
4304 | struct cgroup_subsys_state *css = cgrp->subsys[ss->subsys_id]; | |
88703267 | 4305 | |
ed957793 TH |
4306 | WARN_ON(atomic_read(&css->refcnt) < 0); |
4307 | atomic_add(CSS_DEACT_BIAS, &css->refcnt); | |
88703267 | 4308 | } |
1a90dd50 | 4309 | set_bit(CGRP_REMOVED, &cgrp->flags); |
ddbcc7e8 | 4310 | |
a31f2d3f | 4311 | /* tell subsystems to initate destruction */ |
1a90dd50 | 4312 | for_each_subsys(cgrp->root, ss) |
a31f2d3f | 4313 | offline_css(ss, cgrp); |
ed957793 TH |
4314 | |
4315 | /* | |
ed957793 TH |
4316 | * Put all the base refs. Each css holds an extra reference to the |
4317 | * cgroup's dentry and cgroup removal proceeds regardless of css | |
4318 | * refs. On the last put of each css, whenever that may be, the | |
4319 | * extra dentry ref is put so that dentry destruction happens only | |
4320 | * after all css's are released. | |
4321 | */ | |
e9316080 TH |
4322 | for_each_subsys(cgrp->root, ss) |
4323 | css_put(cgrp->subsys[ss->subsys_id]); | |
ddbcc7e8 | 4324 | |
cdcc136f | 4325 | raw_spin_lock(&release_list_lock); |
bd89aabc | 4326 | if (!list_empty(&cgrp->release_list)) |
8d258797 | 4327 | list_del_init(&cgrp->release_list); |
cdcc136f | 4328 | raw_spin_unlock(&release_list_lock); |
999cd8a4 | 4329 | |
999cd8a4 | 4330 | /* delete this cgroup from parent->children */ |
eb6fd504 | 4331 | list_del_rcu(&cgrp->sibling); |
b0ca5a84 TH |
4332 | list_del_init(&cgrp->allcg_node); |
4333 | ||
42809dd4 | 4334 | dget(d); |
ddbcc7e8 PM |
4335 | cgroup_d_remove_dir(d); |
4336 | dput(d); | |
ddbcc7e8 | 4337 | |
bd89aabc | 4338 | set_bit(CGRP_RELEASABLE, &parent->flags); |
81a6a5cd PM |
4339 | check_for_release(parent); |
4340 | ||
4ab78683 KS |
4341 | /* |
4342 | * Unregister events and notify userspace. | |
4343 | * Notify userspace about cgroup removing only after rmdir of cgroup | |
205a872b GT |
4344 | * directory to avoid race between userspace and kernelspace. Use |
4345 | * a temporary list to avoid a deadlock with cgroup_event_wake(). Since | |
4346 | * cgroup_event_wake() is called with the wait queue head locked, | |
4347 | * remove_wait_queue() cannot be called while holding event_list_lock. | |
4ab78683 KS |
4348 | */ |
4349 | spin_lock(&cgrp->event_list_lock); | |
205a872b GT |
4350 | list_splice_init(&cgrp->event_list, &tmp_list); |
4351 | spin_unlock(&cgrp->event_list_lock); | |
4352 | list_for_each_entry_safe(event, tmp, &tmp_list, list) { | |
9718ceb3 | 4353 | list_del_init(&event->list); |
4ab78683 KS |
4354 | remove_wait_queue(event->wqh, &event->wait); |
4355 | eventfd_signal(event->eventfd, 1); | |
4356 | schedule_work(&event->remove); | |
4357 | } | |
4ab78683 | 4358 | |
ddbcc7e8 PM |
4359 | return 0; |
4360 | } | |
4361 | ||
42809dd4 TH |
4362 | static int cgroup_rmdir(struct inode *unused_dir, struct dentry *dentry) |
4363 | { | |
4364 | int ret; | |
4365 | ||
4366 | mutex_lock(&cgroup_mutex); | |
4367 | ret = cgroup_destroy_locked(dentry->d_fsdata); | |
4368 | mutex_unlock(&cgroup_mutex); | |
4369 | ||
4370 | return ret; | |
4371 | } | |
4372 | ||
8e3f6541 TH |
4373 | static void __init_or_module cgroup_init_cftsets(struct cgroup_subsys *ss) |
4374 | { | |
4375 | INIT_LIST_HEAD(&ss->cftsets); | |
4376 | ||
4377 | /* | |
4378 | * base_cftset is embedded in subsys itself, no need to worry about | |
4379 | * deregistration. | |
4380 | */ | |
4381 | if (ss->base_cftypes) { | |
4382 | ss->base_cftset.cfts = ss->base_cftypes; | |
4383 | list_add_tail(&ss->base_cftset.node, &ss->cftsets); | |
4384 | } | |
4385 | } | |
4386 | ||
06a11920 | 4387 | static void __init cgroup_init_subsys(struct cgroup_subsys *ss) |
ddbcc7e8 | 4388 | { |
ddbcc7e8 | 4389 | struct cgroup_subsys_state *css; |
cfe36bde DC |
4390 | |
4391 | printk(KERN_INFO "Initializing cgroup subsys %s\n", ss->name); | |
ddbcc7e8 | 4392 | |
648bb56d TH |
4393 | mutex_lock(&cgroup_mutex); |
4394 | ||
8e3f6541 TH |
4395 | /* init base cftset */ |
4396 | cgroup_init_cftsets(ss); | |
4397 | ||
ddbcc7e8 | 4398 | /* Create the top cgroup state for this subsystem */ |
33a68ac1 | 4399 | list_add(&ss->sibling, &rootnode.subsys_list); |
ddbcc7e8 | 4400 | ss->root = &rootnode; |
92fb9748 | 4401 | css = ss->css_alloc(dummytop); |
ddbcc7e8 PM |
4402 | /* We don't handle early failures gracefully */ |
4403 | BUG_ON(IS_ERR(css)); | |
4404 | init_cgroup_css(css, ss, dummytop); | |
4405 | ||
e8d55fde | 4406 | /* Update the init_css_set to contain a subsys |
817929ec | 4407 | * pointer to this state - since the subsystem is |
e8d55fde LZ |
4408 | * newly registered, all tasks and hence the |
4409 | * init_css_set is in the subsystem's top cgroup. */ | |
b48c6a80 | 4410 | init_css_set.subsys[ss->subsys_id] = css; |
ddbcc7e8 PM |
4411 | |
4412 | need_forkexit_callback |= ss->fork || ss->exit; | |
4413 | ||
e8d55fde LZ |
4414 | /* At system boot, before all subsystems have been |
4415 | * registered, no tasks have been forked, so we don't | |
4416 | * need to invoke fork callbacks here. */ | |
4417 | BUG_ON(!list_empty(&init_task.tasks)); | |
4418 | ||
ddbcc7e8 | 4419 | ss->active = 1; |
b1929db4 | 4420 | BUG_ON(online_css(ss, dummytop)); |
a8638030 | 4421 | |
648bb56d TH |
4422 | mutex_unlock(&cgroup_mutex); |
4423 | ||
e6a1105b BB |
4424 | /* this function shouldn't be used with modular subsystems, since they |
4425 | * need to register a subsys_id, among other things */ | |
4426 | BUG_ON(ss->module); | |
4427 | } | |
4428 | ||
4429 | /** | |
4430 | * cgroup_load_subsys: load and register a modular subsystem at runtime | |
4431 | * @ss: the subsystem to load | |
4432 | * | |
4433 | * This function should be called in a modular subsystem's initcall. If the | |
88393161 | 4434 | * subsystem is built as a module, it will be assigned a new subsys_id and set |
e6a1105b BB |
4435 | * up for use. If the subsystem is built-in anyway, work is delegated to the |
4436 | * simpler cgroup_init_subsys. | |
4437 | */ | |
4438 | int __init_or_module cgroup_load_subsys(struct cgroup_subsys *ss) | |
4439 | { | |
e6a1105b | 4440 | struct cgroup_subsys_state *css; |
d19e19de | 4441 | int i, ret; |
e6a1105b BB |
4442 | |
4443 | /* check name and function validity */ | |
4444 | if (ss->name == NULL || strlen(ss->name) > MAX_CGROUP_TYPE_NAMELEN || | |
92fb9748 | 4445 | ss->css_alloc == NULL || ss->css_free == NULL) |
e6a1105b BB |
4446 | return -EINVAL; |
4447 | ||
4448 | /* | |
4449 | * we don't support callbacks in modular subsystems. this check is | |
4450 | * before the ss->module check for consistency; a subsystem that could | |
4451 | * be a module should still have no callbacks even if the user isn't | |
4452 | * compiling it as one. | |
4453 | */ | |
4454 | if (ss->fork || ss->exit) | |
4455 | return -EINVAL; | |
4456 | ||
4457 | /* | |
4458 | * an optionally modular subsystem is built-in: we want to do nothing, | |
4459 | * since cgroup_init_subsys will have already taken care of it. | |
4460 | */ | |
4461 | if (ss->module == NULL) { | |
be45c900 | 4462 | /* a sanity check */ |
e6a1105b BB |
4463 | BUG_ON(subsys[ss->subsys_id] != ss); |
4464 | return 0; | |
4465 | } | |
4466 | ||
8e3f6541 TH |
4467 | /* init base cftset */ |
4468 | cgroup_init_cftsets(ss); | |
4469 | ||
e6a1105b | 4470 | mutex_lock(&cgroup_mutex); |
8a8e04df | 4471 | subsys[ss->subsys_id] = ss; |
e6a1105b BB |
4472 | |
4473 | /* | |
92fb9748 TH |
4474 | * no ss->css_alloc seems to need anything important in the ss |
4475 | * struct, so this can happen first (i.e. before the rootnode | |
4476 | * attachment). | |
e6a1105b | 4477 | */ |
92fb9748 | 4478 | css = ss->css_alloc(dummytop); |
e6a1105b BB |
4479 | if (IS_ERR(css)) { |
4480 | /* failure case - need to deassign the subsys[] slot. */ | |
8a8e04df | 4481 | subsys[ss->subsys_id] = NULL; |
e6a1105b BB |
4482 | mutex_unlock(&cgroup_mutex); |
4483 | return PTR_ERR(css); | |
4484 | } | |
4485 | ||
4486 | list_add(&ss->sibling, &rootnode.subsys_list); | |
4487 | ss->root = &rootnode; | |
4488 | ||
4489 | /* our new subsystem will be attached to the dummy hierarchy. */ | |
4490 | init_cgroup_css(css, ss, dummytop); | |
4491 | /* init_idr must be after init_cgroup_css because it sets css->id. */ | |
4492 | if (ss->use_id) { | |
d19e19de TH |
4493 | ret = cgroup_init_idr(ss, css); |
4494 | if (ret) | |
4495 | goto err_unload; | |
e6a1105b BB |
4496 | } |
4497 | ||
4498 | /* | |
4499 | * Now we need to entangle the css into the existing css_sets. unlike | |
4500 | * in cgroup_init_subsys, there are now multiple css_sets, so each one | |
4501 | * will need a new pointer to it; done by iterating the css_set_table. | |
4502 | * furthermore, modifying the existing css_sets will corrupt the hash | |
4503 | * table state, so each changed css_set will need its hash recomputed. | |
4504 | * this is all done under the css_set_lock. | |
4505 | */ | |
4506 | write_lock(&css_set_lock); | |
4507 | for (i = 0; i < CSS_SET_TABLE_SIZE; i++) { | |
4508 | struct css_set *cg; | |
4509 | struct hlist_node *node, *tmp; | |
4510 | struct hlist_head *bucket = &css_set_table[i], *new_bucket; | |
4511 | ||
4512 | hlist_for_each_entry_safe(cg, node, tmp, bucket, hlist) { | |
4513 | /* skip entries that we already rehashed */ | |
4514 | if (cg->subsys[ss->subsys_id]) | |
4515 | continue; | |
4516 | /* remove existing entry */ | |
4517 | hlist_del(&cg->hlist); | |
4518 | /* set new value */ | |
4519 | cg->subsys[ss->subsys_id] = css; | |
4520 | /* recompute hash and restore entry */ | |
4521 | new_bucket = css_set_hash(cg->subsys); | |
4522 | hlist_add_head(&cg->hlist, new_bucket); | |
4523 | } | |
4524 | } | |
4525 | write_unlock(&css_set_lock); | |
4526 | ||
e6a1105b | 4527 | ss->active = 1; |
b1929db4 TH |
4528 | ret = online_css(ss, dummytop); |
4529 | if (ret) | |
4530 | goto err_unload; | |
a8638030 | 4531 | |
e6a1105b BB |
4532 | /* success! */ |
4533 | mutex_unlock(&cgroup_mutex); | |
4534 | return 0; | |
d19e19de TH |
4535 | |
4536 | err_unload: | |
4537 | mutex_unlock(&cgroup_mutex); | |
4538 | /* @ss can't be mounted here as try_module_get() would fail */ | |
4539 | cgroup_unload_subsys(ss); | |
4540 | return ret; | |
ddbcc7e8 | 4541 | } |
e6a1105b | 4542 | EXPORT_SYMBOL_GPL(cgroup_load_subsys); |
ddbcc7e8 | 4543 | |
cf5d5941 BB |
4544 | /** |
4545 | * cgroup_unload_subsys: unload a modular subsystem | |
4546 | * @ss: the subsystem to unload | |
4547 | * | |
4548 | * This function should be called in a modular subsystem's exitcall. When this | |
4549 | * function is invoked, the refcount on the subsystem's module will be 0, so | |
4550 | * the subsystem will not be attached to any hierarchy. | |
4551 | */ | |
4552 | void cgroup_unload_subsys(struct cgroup_subsys *ss) | |
4553 | { | |
4554 | struct cg_cgroup_link *link; | |
4555 | struct hlist_head *hhead; | |
4556 | ||
4557 | BUG_ON(ss->module == NULL); | |
4558 | ||
4559 | /* | |
4560 | * we shouldn't be called if the subsystem is in use, and the use of | |
4561 | * try_module_get in parse_cgroupfs_options should ensure that it | |
4562 | * doesn't start being used while we're killing it off. | |
4563 | */ | |
4564 | BUG_ON(ss->root != &rootnode); | |
4565 | ||
4566 | mutex_lock(&cgroup_mutex); | |
02ae7486 | 4567 | |
a31f2d3f | 4568 | offline_css(ss, dummytop); |
02ae7486 TH |
4569 | ss->active = 0; |
4570 | ||
4571 | if (ss->use_id) { | |
4572 | idr_remove_all(&ss->idr); | |
4573 | idr_destroy(&ss->idr); | |
4574 | } | |
4575 | ||
cf5d5941 | 4576 | /* deassign the subsys_id */ |
cf5d5941 BB |
4577 | subsys[ss->subsys_id] = NULL; |
4578 | ||
4579 | /* remove subsystem from rootnode's list of subsystems */ | |
8d258797 | 4580 | list_del_init(&ss->sibling); |
cf5d5941 BB |
4581 | |
4582 | /* | |
4583 | * disentangle the css from all css_sets attached to the dummytop. as | |
4584 | * in loading, we need to pay our respects to the hashtable gods. | |
4585 | */ | |
4586 | write_lock(&css_set_lock); | |
4587 | list_for_each_entry(link, &dummytop->css_sets, cgrp_link_list) { | |
4588 | struct css_set *cg = link->cg; | |
4589 | ||
4590 | hlist_del(&cg->hlist); | |
cf5d5941 BB |
4591 | cg->subsys[ss->subsys_id] = NULL; |
4592 | hhead = css_set_hash(cg->subsys); | |
4593 | hlist_add_head(&cg->hlist, hhead); | |
4594 | } | |
4595 | write_unlock(&css_set_lock); | |
4596 | ||
4597 | /* | |
92fb9748 TH |
4598 | * remove subsystem's css from the dummytop and free it - need to |
4599 | * free before marking as null because ss->css_free needs the | |
4600 | * cgrp->subsys pointer to find their state. note that this also | |
4601 | * takes care of freeing the css_id. | |
cf5d5941 | 4602 | */ |
92fb9748 | 4603 | ss->css_free(dummytop); |
cf5d5941 BB |
4604 | dummytop->subsys[ss->subsys_id] = NULL; |
4605 | ||
4606 | mutex_unlock(&cgroup_mutex); | |
4607 | } | |
4608 | EXPORT_SYMBOL_GPL(cgroup_unload_subsys); | |
4609 | ||
ddbcc7e8 | 4610 | /** |
a043e3b2 LZ |
4611 | * cgroup_init_early - cgroup initialization at system boot |
4612 | * | |
4613 | * Initialize cgroups at system boot, and initialize any | |
4614 | * subsystems that request early init. | |
ddbcc7e8 PM |
4615 | */ |
4616 | int __init cgroup_init_early(void) | |
4617 | { | |
4618 | int i; | |
146aa1bd | 4619 | atomic_set(&init_css_set.refcount, 1); |
817929ec PM |
4620 | INIT_LIST_HEAD(&init_css_set.cg_links); |
4621 | INIT_LIST_HEAD(&init_css_set.tasks); | |
472b1053 | 4622 | INIT_HLIST_NODE(&init_css_set.hlist); |
817929ec | 4623 | css_set_count = 1; |
ddbcc7e8 | 4624 | init_cgroup_root(&rootnode); |
817929ec PM |
4625 | root_count = 1; |
4626 | init_task.cgroups = &init_css_set; | |
4627 | ||
4628 | init_css_set_link.cg = &init_css_set; | |
7717f7ba | 4629 | init_css_set_link.cgrp = dummytop; |
bd89aabc | 4630 | list_add(&init_css_set_link.cgrp_link_list, |
817929ec PM |
4631 | &rootnode.top_cgroup.css_sets); |
4632 | list_add(&init_css_set_link.cg_link_list, | |
4633 | &init_css_set.cg_links); | |
ddbcc7e8 | 4634 | |
472b1053 LZ |
4635 | for (i = 0; i < CSS_SET_TABLE_SIZE; i++) |
4636 | INIT_HLIST_HEAD(&css_set_table[i]); | |
4637 | ||
be45c900 | 4638 | for (i = 0; i < CGROUP_SUBSYS_COUNT; i++) { |
ddbcc7e8 PM |
4639 | struct cgroup_subsys *ss = subsys[i]; |
4640 | ||
be45c900 DW |
4641 | /* at bootup time, we don't worry about modular subsystems */ |
4642 | if (!ss || ss->module) | |
4643 | continue; | |
4644 | ||
ddbcc7e8 PM |
4645 | BUG_ON(!ss->name); |
4646 | BUG_ON(strlen(ss->name) > MAX_CGROUP_TYPE_NAMELEN); | |
92fb9748 TH |
4647 | BUG_ON(!ss->css_alloc); |
4648 | BUG_ON(!ss->css_free); | |
ddbcc7e8 | 4649 | if (ss->subsys_id != i) { |
cfe36bde | 4650 | printk(KERN_ERR "cgroup: Subsys %s id == %d\n", |
ddbcc7e8 PM |
4651 | ss->name, ss->subsys_id); |
4652 | BUG(); | |
4653 | } | |
4654 | ||
4655 | if (ss->early_init) | |
4656 | cgroup_init_subsys(ss); | |
4657 | } | |
4658 | return 0; | |
4659 | } | |
4660 | ||
4661 | /** | |
a043e3b2 LZ |
4662 | * cgroup_init - cgroup initialization |
4663 | * | |
4664 | * Register cgroup filesystem and /proc file, and initialize | |
4665 | * any subsystems that didn't request early init. | |
ddbcc7e8 PM |
4666 | */ |
4667 | int __init cgroup_init(void) | |
4668 | { | |
4669 | int err; | |
4670 | int i; | |
472b1053 | 4671 | struct hlist_head *hhead; |
a424316c PM |
4672 | |
4673 | err = bdi_init(&cgroup_backing_dev_info); | |
4674 | if (err) | |
4675 | return err; | |
ddbcc7e8 | 4676 | |
be45c900 | 4677 | for (i = 0; i < CGROUP_SUBSYS_COUNT; i++) { |
ddbcc7e8 | 4678 | struct cgroup_subsys *ss = subsys[i]; |
be45c900 DW |
4679 | |
4680 | /* at bootup time, we don't worry about modular subsystems */ | |
4681 | if (!ss || ss->module) | |
4682 | continue; | |
ddbcc7e8 PM |
4683 | if (!ss->early_init) |
4684 | cgroup_init_subsys(ss); | |
38460b48 | 4685 | if (ss->use_id) |
e6a1105b | 4686 | cgroup_init_idr(ss, init_css_set.subsys[ss->subsys_id]); |
ddbcc7e8 PM |
4687 | } |
4688 | ||
472b1053 LZ |
4689 | /* Add init_css_set to the hash table */ |
4690 | hhead = css_set_hash(init_css_set.subsys); | |
4691 | hlist_add_head(&init_css_set.hlist, hhead); | |
2c6ab6d2 | 4692 | BUG_ON(!init_root_id(&rootnode)); |
676db4af GK |
4693 | |
4694 | cgroup_kobj = kobject_create_and_add("cgroup", fs_kobj); | |
4695 | if (!cgroup_kobj) { | |
4696 | err = -ENOMEM; | |
4697 | goto out; | |
4698 | } | |
4699 | ||
ddbcc7e8 | 4700 | err = register_filesystem(&cgroup_fs_type); |
676db4af GK |
4701 | if (err < 0) { |
4702 | kobject_put(cgroup_kobj); | |
ddbcc7e8 | 4703 | goto out; |
676db4af | 4704 | } |
ddbcc7e8 | 4705 | |
46ae220b | 4706 | proc_create("cgroups", 0, NULL, &proc_cgroupstats_operations); |
a424316c | 4707 | |
ddbcc7e8 | 4708 | out: |
a424316c PM |
4709 | if (err) |
4710 | bdi_destroy(&cgroup_backing_dev_info); | |
4711 | ||
ddbcc7e8 PM |
4712 | return err; |
4713 | } | |
b4f48b63 | 4714 | |
a424316c PM |
4715 | /* |
4716 | * proc_cgroup_show() | |
4717 | * - Print task's cgroup paths into seq_file, one line for each hierarchy | |
4718 | * - Used for /proc/<pid>/cgroup. | |
4719 | * - No need to task_lock(tsk) on this tsk->cgroup reference, as it | |
4720 | * doesn't really matter if tsk->cgroup changes after we read it, | |
956db3ca | 4721 | * and we take cgroup_mutex, keeping cgroup_attach_task() from changing it |
a424316c PM |
4722 | * anyway. No need to check that tsk->cgroup != NULL, thanks to |
4723 | * the_top_cgroup_hack in cgroup_exit(), which sets an exiting tasks | |
4724 | * cgroup to top_cgroup. | |
4725 | */ | |
4726 | ||
4727 | /* TODO: Use a proper seq_file iterator */ | |
4728 | static int proc_cgroup_show(struct seq_file *m, void *v) | |
4729 | { | |
4730 | struct pid *pid; | |
4731 | struct task_struct *tsk; | |
4732 | char *buf; | |
4733 | int retval; | |
4734 | struct cgroupfs_root *root; | |
4735 | ||
4736 | retval = -ENOMEM; | |
4737 | buf = kmalloc(PAGE_SIZE, GFP_KERNEL); | |
4738 | if (!buf) | |
4739 | goto out; | |
4740 | ||
4741 | retval = -ESRCH; | |
4742 | pid = m->private; | |
4743 | tsk = get_pid_task(pid, PIDTYPE_PID); | |
4744 | if (!tsk) | |
4745 | goto out_free; | |
4746 | ||
4747 | retval = 0; | |
4748 | ||
4749 | mutex_lock(&cgroup_mutex); | |
4750 | ||
e5f6a860 | 4751 | for_each_active_root(root) { |
a424316c | 4752 | struct cgroup_subsys *ss; |
bd89aabc | 4753 | struct cgroup *cgrp; |
a424316c PM |
4754 | int count = 0; |
4755 | ||
2c6ab6d2 | 4756 | seq_printf(m, "%d:", root->hierarchy_id); |
a424316c PM |
4757 | for_each_subsys(root, ss) |
4758 | seq_printf(m, "%s%s", count++ ? "," : "", ss->name); | |
c6d57f33 PM |
4759 | if (strlen(root->name)) |
4760 | seq_printf(m, "%sname=%s", count ? "," : "", | |
4761 | root->name); | |
a424316c | 4762 | seq_putc(m, ':'); |
7717f7ba | 4763 | cgrp = task_cgroup_from_root(tsk, root); |
bd89aabc | 4764 | retval = cgroup_path(cgrp, buf, PAGE_SIZE); |
a424316c PM |
4765 | if (retval < 0) |
4766 | goto out_unlock; | |
4767 | seq_puts(m, buf); | |
4768 | seq_putc(m, '\n'); | |
4769 | } | |
4770 | ||
4771 | out_unlock: | |
4772 | mutex_unlock(&cgroup_mutex); | |
4773 | put_task_struct(tsk); | |
4774 | out_free: | |
4775 | kfree(buf); | |
4776 | out: | |
4777 | return retval; | |
4778 | } | |
4779 | ||
4780 | static int cgroup_open(struct inode *inode, struct file *file) | |
4781 | { | |
4782 | struct pid *pid = PROC_I(inode)->pid; | |
4783 | return single_open(file, proc_cgroup_show, pid); | |
4784 | } | |
4785 | ||
828c0950 | 4786 | const struct file_operations proc_cgroup_operations = { |
a424316c PM |
4787 | .open = cgroup_open, |
4788 | .read = seq_read, | |
4789 | .llseek = seq_lseek, | |
4790 | .release = single_release, | |
4791 | }; | |
4792 | ||
4793 | /* Display information about each subsystem and each hierarchy */ | |
4794 | static int proc_cgroupstats_show(struct seq_file *m, void *v) | |
4795 | { | |
4796 | int i; | |
a424316c | 4797 | |
8bab8dde | 4798 | seq_puts(m, "#subsys_name\thierarchy\tnum_cgroups\tenabled\n"); |
aae8aab4 BB |
4799 | /* |
4800 | * ideally we don't want subsystems moving around while we do this. | |
4801 | * cgroup_mutex is also necessary to guarantee an atomic snapshot of | |
4802 | * subsys/hierarchy state. | |
4803 | */ | |
a424316c | 4804 | mutex_lock(&cgroup_mutex); |
a424316c PM |
4805 | for (i = 0; i < CGROUP_SUBSYS_COUNT; i++) { |
4806 | struct cgroup_subsys *ss = subsys[i]; | |
aae8aab4 BB |
4807 | if (ss == NULL) |
4808 | continue; | |
2c6ab6d2 PM |
4809 | seq_printf(m, "%s\t%d\t%d\t%d\n", |
4810 | ss->name, ss->root->hierarchy_id, | |
8bab8dde | 4811 | ss->root->number_of_cgroups, !ss->disabled); |
a424316c PM |
4812 | } |
4813 | mutex_unlock(&cgroup_mutex); | |
4814 | return 0; | |
4815 | } | |
4816 | ||
4817 | static int cgroupstats_open(struct inode *inode, struct file *file) | |
4818 | { | |
9dce07f1 | 4819 | return single_open(file, proc_cgroupstats_show, NULL); |
a424316c PM |
4820 | } |
4821 | ||
828c0950 | 4822 | static const struct file_operations proc_cgroupstats_operations = { |
a424316c PM |
4823 | .open = cgroupstats_open, |
4824 | .read = seq_read, | |
4825 | .llseek = seq_lseek, | |
4826 | .release = single_release, | |
4827 | }; | |
4828 | ||
b4f48b63 PM |
4829 | /** |
4830 | * cgroup_fork - attach newly forked task to its parents cgroup. | |
a043e3b2 | 4831 | * @child: pointer to task_struct of forking parent process. |
b4f48b63 PM |
4832 | * |
4833 | * Description: A task inherits its parent's cgroup at fork(). | |
4834 | * | |
4835 | * A pointer to the shared css_set was automatically copied in | |
4836 | * fork.c by dup_task_struct(). However, we ignore that copy, since | |
9bb71308 TH |
4837 | * it was not made under the protection of RCU or cgroup_mutex, so |
4838 | * might no longer be a valid cgroup pointer. cgroup_attach_task() might | |
4839 | * have already changed current->cgroups, allowing the previously | |
4840 | * referenced cgroup group to be removed and freed. | |
b4f48b63 PM |
4841 | * |
4842 | * At the point that cgroup_fork() is called, 'current' is the parent | |
4843 | * task, and the passed argument 'child' points to the child task. | |
4844 | */ | |
4845 | void cgroup_fork(struct task_struct *child) | |
4846 | { | |
9bb71308 | 4847 | task_lock(current); |
817929ec PM |
4848 | child->cgroups = current->cgroups; |
4849 | get_css_set(child->cgroups); | |
9bb71308 | 4850 | task_unlock(current); |
817929ec | 4851 | INIT_LIST_HEAD(&child->cg_list); |
b4f48b63 PM |
4852 | } |
4853 | ||
817929ec | 4854 | /** |
a043e3b2 LZ |
4855 | * cgroup_post_fork - called on a new task after adding it to the task list |
4856 | * @child: the task in question | |
4857 | * | |
5edee61e TH |
4858 | * Adds the task to the list running through its css_set if necessary and |
4859 | * call the subsystem fork() callbacks. Has to be after the task is | |
4860 | * visible on the task list in case we race with the first call to | |
4861 | * cgroup_iter_start() - to guarantee that the new task ends up on its | |
4862 | * list. | |
a043e3b2 | 4863 | */ |
817929ec PM |
4864 | void cgroup_post_fork(struct task_struct *child) |
4865 | { | |
5edee61e TH |
4866 | int i; |
4867 | ||
3ce3230a FW |
4868 | /* |
4869 | * use_task_css_set_links is set to 1 before we walk the tasklist | |
4870 | * under the tasklist_lock and we read it here after we added the child | |
4871 | * to the tasklist under the tasklist_lock as well. If the child wasn't | |
4872 | * yet in the tasklist when we walked through it from | |
4873 | * cgroup_enable_task_cg_lists(), then use_task_css_set_links value | |
4874 | * should be visible now due to the paired locking and barriers implied | |
4875 | * by LOCK/UNLOCK: it is written before the tasklist_lock unlock | |
4876 | * in cgroup_enable_task_cg_lists() and read here after the tasklist_lock | |
4877 | * lock on fork. | |
4878 | */ | |
817929ec PM |
4879 | if (use_task_css_set_links) { |
4880 | write_lock(&css_set_lock); | |
d8783832 TH |
4881 | task_lock(child); |
4882 | if (list_empty(&child->cg_list)) | |
817929ec | 4883 | list_add(&child->cg_list, &child->cgroups->tasks); |
d8783832 | 4884 | task_unlock(child); |
817929ec PM |
4885 | write_unlock(&css_set_lock); |
4886 | } | |
5edee61e TH |
4887 | |
4888 | /* | |
4889 | * Call ss->fork(). This must happen after @child is linked on | |
4890 | * css_set; otherwise, @child might change state between ->fork() | |
4891 | * and addition to css_set. | |
4892 | */ | |
4893 | if (need_forkexit_callback) { | |
4894 | for (i = 0; i < CGROUP_SUBSYS_COUNT; i++) { | |
4895 | struct cgroup_subsys *ss = subsys[i]; | |
4896 | ||
4897 | /* | |
4898 | * fork/exit callbacks are supported only for | |
4899 | * builtin subsystems and we don't need further | |
4900 | * synchronization as they never go away. | |
4901 | */ | |
4902 | if (!ss || ss->module) | |
4903 | continue; | |
4904 | ||
4905 | if (ss->fork) | |
4906 | ss->fork(child); | |
4907 | } | |
4908 | } | |
817929ec | 4909 | } |
5edee61e | 4910 | |
b4f48b63 PM |
4911 | /** |
4912 | * cgroup_exit - detach cgroup from exiting task | |
4913 | * @tsk: pointer to task_struct of exiting process | |
a043e3b2 | 4914 | * @run_callback: run exit callbacks? |
b4f48b63 PM |
4915 | * |
4916 | * Description: Detach cgroup from @tsk and release it. | |
4917 | * | |
4918 | * Note that cgroups marked notify_on_release force every task in | |
4919 | * them to take the global cgroup_mutex mutex when exiting. | |
4920 | * This could impact scaling on very large systems. Be reluctant to | |
4921 | * use notify_on_release cgroups where very high task exit scaling | |
4922 | * is required on large systems. | |
4923 | * | |
4924 | * the_top_cgroup_hack: | |
4925 | * | |
4926 | * Set the exiting tasks cgroup to the root cgroup (top_cgroup). | |
4927 | * | |
4928 | * We call cgroup_exit() while the task is still competent to | |
4929 | * handle notify_on_release(), then leave the task attached to the | |
4930 | * root cgroup in each hierarchy for the remainder of its exit. | |
4931 | * | |
4932 | * To do this properly, we would increment the reference count on | |
4933 | * top_cgroup, and near the very end of the kernel/exit.c do_exit() | |
4934 | * code we would add a second cgroup function call, to drop that | |
4935 | * reference. This would just create an unnecessary hot spot on | |
4936 | * the top_cgroup reference count, to no avail. | |
4937 | * | |
4938 | * Normally, holding a reference to a cgroup without bumping its | |
4939 | * count is unsafe. The cgroup could go away, or someone could | |
4940 | * attach us to a different cgroup, decrementing the count on | |
4941 | * the first cgroup that we never incremented. But in this case, | |
4942 | * top_cgroup isn't going away, and either task has PF_EXITING set, | |
956db3ca CW |
4943 | * which wards off any cgroup_attach_task() attempts, or task is a failed |
4944 | * fork, never visible to cgroup_attach_task. | |
b4f48b63 PM |
4945 | */ |
4946 | void cgroup_exit(struct task_struct *tsk, int run_callbacks) | |
4947 | { | |
817929ec | 4948 | struct css_set *cg; |
d41d5a01 | 4949 | int i; |
817929ec PM |
4950 | |
4951 | /* | |
4952 | * Unlink from the css_set task list if necessary. | |
4953 | * Optimistically check cg_list before taking | |
4954 | * css_set_lock | |
4955 | */ | |
4956 | if (!list_empty(&tsk->cg_list)) { | |
4957 | write_lock(&css_set_lock); | |
4958 | if (!list_empty(&tsk->cg_list)) | |
8d258797 | 4959 | list_del_init(&tsk->cg_list); |
817929ec PM |
4960 | write_unlock(&css_set_lock); |
4961 | } | |
4962 | ||
b4f48b63 PM |
4963 | /* Reassign the task to the init_css_set. */ |
4964 | task_lock(tsk); | |
817929ec PM |
4965 | cg = tsk->cgroups; |
4966 | tsk->cgroups = &init_css_set; | |
d41d5a01 PZ |
4967 | |
4968 | if (run_callbacks && need_forkexit_callback) { | |
be45c900 | 4969 | for (i = 0; i < CGROUP_SUBSYS_COUNT; i++) { |
d41d5a01 | 4970 | struct cgroup_subsys *ss = subsys[i]; |
be45c900 DW |
4971 | |
4972 | /* modular subsystems can't use callbacks */ | |
4973 | if (!ss || ss->module) | |
4974 | continue; | |
4975 | ||
d41d5a01 PZ |
4976 | if (ss->exit) { |
4977 | struct cgroup *old_cgrp = | |
4978 | rcu_dereference_raw(cg->subsys[i])->cgroup; | |
4979 | struct cgroup *cgrp = task_cgroup(tsk, i); | |
761b3ef5 | 4980 | ss->exit(cgrp, old_cgrp, tsk); |
d41d5a01 PZ |
4981 | } |
4982 | } | |
4983 | } | |
b4f48b63 | 4984 | task_unlock(tsk); |
d41d5a01 | 4985 | |
817929ec | 4986 | if (cg) |
81a6a5cd | 4987 | put_css_set_taskexit(cg); |
b4f48b63 | 4988 | } |
697f4161 | 4989 | |
a043e3b2 | 4990 | /** |
313e924c | 4991 | * cgroup_is_descendant - see if @cgrp is a descendant of @task's cgrp |
a043e3b2 | 4992 | * @cgrp: the cgroup in question |
313e924c | 4993 | * @task: the task in question |
a043e3b2 | 4994 | * |
313e924c GN |
4995 | * See if @cgrp is a descendant of @task's cgroup in the appropriate |
4996 | * hierarchy. | |
697f4161 PM |
4997 | * |
4998 | * If we are sending in dummytop, then presumably we are creating | |
4999 | * the top cgroup in the subsystem. | |
5000 | * | |
5001 | * Called only by the ns (nsproxy) cgroup. | |
5002 | */ | |
313e924c | 5003 | int cgroup_is_descendant(const struct cgroup *cgrp, struct task_struct *task) |
697f4161 PM |
5004 | { |
5005 | int ret; | |
5006 | struct cgroup *target; | |
697f4161 | 5007 | |
bd89aabc | 5008 | if (cgrp == dummytop) |
697f4161 PM |
5009 | return 1; |
5010 | ||
7717f7ba | 5011 | target = task_cgroup_from_root(task, cgrp->root); |
bd89aabc PM |
5012 | while (cgrp != target && cgrp!= cgrp->top_cgroup) |
5013 | cgrp = cgrp->parent; | |
5014 | ret = (cgrp == target); | |
697f4161 PM |
5015 | return ret; |
5016 | } | |
81a6a5cd | 5017 | |
bd89aabc | 5018 | static void check_for_release(struct cgroup *cgrp) |
81a6a5cd PM |
5019 | { |
5020 | /* All of these checks rely on RCU to keep the cgroup | |
5021 | * structure alive */ | |
bd89aabc PM |
5022 | if (cgroup_is_releasable(cgrp) && !atomic_read(&cgrp->count) |
5023 | && list_empty(&cgrp->children) && !cgroup_has_css_refs(cgrp)) { | |
81a6a5cd PM |
5024 | /* Control Group is currently removeable. If it's not |
5025 | * already queued for a userspace notification, queue | |
5026 | * it now */ | |
5027 | int need_schedule_work = 0; | |
cdcc136f | 5028 | raw_spin_lock(&release_list_lock); |
bd89aabc PM |
5029 | if (!cgroup_is_removed(cgrp) && |
5030 | list_empty(&cgrp->release_list)) { | |
5031 | list_add(&cgrp->release_list, &release_list); | |
81a6a5cd PM |
5032 | need_schedule_work = 1; |
5033 | } | |
cdcc136f | 5034 | raw_spin_unlock(&release_list_lock); |
81a6a5cd PM |
5035 | if (need_schedule_work) |
5036 | schedule_work(&release_agent_work); | |
5037 | } | |
5038 | } | |
5039 | ||
d7b9fff7 | 5040 | /* Caller must verify that the css is not for root cgroup */ |
28b4c27b TH |
5041 | bool __css_tryget(struct cgroup_subsys_state *css) |
5042 | { | |
e9316080 TH |
5043 | while (true) { |
5044 | int t, v; | |
28b4c27b | 5045 | |
e9316080 TH |
5046 | v = css_refcnt(css); |
5047 | t = atomic_cmpxchg(&css->refcnt, v, v + 1); | |
5048 | if (likely(t == v)) | |
28b4c27b | 5049 | return true; |
e9316080 TH |
5050 | else if (t < 0) |
5051 | return false; | |
28b4c27b | 5052 | cpu_relax(); |
e9316080 | 5053 | } |
28b4c27b TH |
5054 | } |
5055 | EXPORT_SYMBOL_GPL(__css_tryget); | |
5056 | ||
5057 | /* Caller must verify that the css is not for root cgroup */ | |
5058 | void __css_put(struct cgroup_subsys_state *css) | |
81a6a5cd | 5059 | { |
bd89aabc | 5060 | struct cgroup *cgrp = css->cgroup; |
8e3bbf42 | 5061 | int v; |
28b4c27b | 5062 | |
81a6a5cd | 5063 | rcu_read_lock(); |
8e3bbf42 SQ |
5064 | v = css_unbias_refcnt(atomic_dec_return(&css->refcnt)); |
5065 | ||
5066 | switch (v) { | |
48ddbe19 | 5067 | case 1: |
ec64f515 KH |
5068 | if (notify_on_release(cgrp)) { |
5069 | set_bit(CGRP_RELEASABLE, &cgrp->flags); | |
5070 | check_for_release(cgrp); | |
5071 | } | |
48ddbe19 TH |
5072 | break; |
5073 | case 0: | |
ed957793 | 5074 | schedule_work(&css->dput_work); |
48ddbe19 | 5075 | break; |
81a6a5cd PM |
5076 | } |
5077 | rcu_read_unlock(); | |
5078 | } | |
67523c48 | 5079 | EXPORT_SYMBOL_GPL(__css_put); |
81a6a5cd PM |
5080 | |
5081 | /* | |
5082 | * Notify userspace when a cgroup is released, by running the | |
5083 | * configured release agent with the name of the cgroup (path | |
5084 | * relative to the root of cgroup file system) as the argument. | |
5085 | * | |
5086 | * Most likely, this user command will try to rmdir this cgroup. | |
5087 | * | |
5088 | * This races with the possibility that some other task will be | |
5089 | * attached to this cgroup before it is removed, or that some other | |
5090 | * user task will 'mkdir' a child cgroup of this cgroup. That's ok. | |
5091 | * The presumed 'rmdir' will fail quietly if this cgroup is no longer | |
5092 | * unused, and this cgroup will be reprieved from its death sentence, | |
5093 | * to continue to serve a useful existence. Next time it's released, | |
5094 | * we will get notified again, if it still has 'notify_on_release' set. | |
5095 | * | |
5096 | * The final arg to call_usermodehelper() is UMH_WAIT_EXEC, which | |
5097 | * means only wait until the task is successfully execve()'d. The | |
5098 | * separate release agent task is forked by call_usermodehelper(), | |
5099 | * then control in this thread returns here, without waiting for the | |
5100 | * release agent task. We don't bother to wait because the caller of | |
5101 | * this routine has no use for the exit status of the release agent | |
5102 | * task, so no sense holding our caller up for that. | |
81a6a5cd | 5103 | */ |
81a6a5cd PM |
5104 | static void cgroup_release_agent(struct work_struct *work) |
5105 | { | |
5106 | BUG_ON(work != &release_agent_work); | |
5107 | mutex_lock(&cgroup_mutex); | |
cdcc136f | 5108 | raw_spin_lock(&release_list_lock); |
81a6a5cd PM |
5109 | while (!list_empty(&release_list)) { |
5110 | char *argv[3], *envp[3]; | |
5111 | int i; | |
e788e066 | 5112 | char *pathbuf = NULL, *agentbuf = NULL; |
bd89aabc | 5113 | struct cgroup *cgrp = list_entry(release_list.next, |
81a6a5cd PM |
5114 | struct cgroup, |
5115 | release_list); | |
bd89aabc | 5116 | list_del_init(&cgrp->release_list); |
cdcc136f | 5117 | raw_spin_unlock(&release_list_lock); |
81a6a5cd | 5118 | pathbuf = kmalloc(PAGE_SIZE, GFP_KERNEL); |
e788e066 PM |
5119 | if (!pathbuf) |
5120 | goto continue_free; | |
5121 | if (cgroup_path(cgrp, pathbuf, PAGE_SIZE) < 0) | |
5122 | goto continue_free; | |
5123 | agentbuf = kstrdup(cgrp->root->release_agent_path, GFP_KERNEL); | |
5124 | if (!agentbuf) | |
5125 | goto continue_free; | |
81a6a5cd PM |
5126 | |
5127 | i = 0; | |
e788e066 PM |
5128 | argv[i++] = agentbuf; |
5129 | argv[i++] = pathbuf; | |
81a6a5cd PM |
5130 | argv[i] = NULL; |
5131 | ||
5132 | i = 0; | |
5133 | /* minimal command environment */ | |
5134 | envp[i++] = "HOME=/"; | |
5135 | envp[i++] = "PATH=/sbin:/bin:/usr/sbin:/usr/bin"; | |
5136 | envp[i] = NULL; | |
5137 | ||
5138 | /* Drop the lock while we invoke the usermode helper, | |
5139 | * since the exec could involve hitting disk and hence | |
5140 | * be a slow process */ | |
5141 | mutex_unlock(&cgroup_mutex); | |
5142 | call_usermodehelper(argv[0], argv, envp, UMH_WAIT_EXEC); | |
81a6a5cd | 5143 | mutex_lock(&cgroup_mutex); |
e788e066 PM |
5144 | continue_free: |
5145 | kfree(pathbuf); | |
5146 | kfree(agentbuf); | |
cdcc136f | 5147 | raw_spin_lock(&release_list_lock); |
81a6a5cd | 5148 | } |
cdcc136f | 5149 | raw_spin_unlock(&release_list_lock); |
81a6a5cd PM |
5150 | mutex_unlock(&cgroup_mutex); |
5151 | } | |
8bab8dde PM |
5152 | |
5153 | static int __init cgroup_disable(char *str) | |
5154 | { | |
5155 | int i; | |
5156 | char *token; | |
5157 | ||
5158 | while ((token = strsep(&str, ",")) != NULL) { | |
5159 | if (!*token) | |
5160 | continue; | |
be45c900 | 5161 | for (i = 0; i < CGROUP_SUBSYS_COUNT; i++) { |
8bab8dde PM |
5162 | struct cgroup_subsys *ss = subsys[i]; |
5163 | ||
be45c900 DW |
5164 | /* |
5165 | * cgroup_disable, being at boot time, can't | |
5166 | * know about module subsystems, so we don't | |
5167 | * worry about them. | |
5168 | */ | |
5169 | if (!ss || ss->module) | |
5170 | continue; | |
5171 | ||
8bab8dde PM |
5172 | if (!strcmp(token, ss->name)) { |
5173 | ss->disabled = 1; | |
5174 | printk(KERN_INFO "Disabling %s control group" | |
5175 | " subsystem\n", ss->name); | |
5176 | break; | |
5177 | } | |
5178 | } | |
5179 | } | |
5180 | return 1; | |
5181 | } | |
5182 | __setup("cgroup_disable=", cgroup_disable); | |
38460b48 KH |
5183 | |
5184 | /* | |
5185 | * Functons for CSS ID. | |
5186 | */ | |
5187 | ||
5188 | /* | |
5189 | *To get ID other than 0, this should be called when !cgroup_is_removed(). | |
5190 | */ | |
5191 | unsigned short css_id(struct cgroup_subsys_state *css) | |
5192 | { | |
7f0f1546 KH |
5193 | struct css_id *cssid; |
5194 | ||
5195 | /* | |
5196 | * This css_id() can return correct value when somone has refcnt | |
5197 | * on this or this is under rcu_read_lock(). Once css->id is allocated, | |
5198 | * it's unchanged until freed. | |
5199 | */ | |
28b4c27b | 5200 | cssid = rcu_dereference_check(css->id, css_refcnt(css)); |
38460b48 KH |
5201 | |
5202 | if (cssid) | |
5203 | return cssid->id; | |
5204 | return 0; | |
5205 | } | |
67523c48 | 5206 | EXPORT_SYMBOL_GPL(css_id); |
38460b48 KH |
5207 | |
5208 | unsigned short css_depth(struct cgroup_subsys_state *css) | |
5209 | { | |
7f0f1546 KH |
5210 | struct css_id *cssid; |
5211 | ||
28b4c27b | 5212 | cssid = rcu_dereference_check(css->id, css_refcnt(css)); |
38460b48 KH |
5213 | |
5214 | if (cssid) | |
5215 | return cssid->depth; | |
5216 | return 0; | |
5217 | } | |
67523c48 | 5218 | EXPORT_SYMBOL_GPL(css_depth); |
38460b48 | 5219 | |
747388d7 KH |
5220 | /** |
5221 | * css_is_ancestor - test "root" css is an ancestor of "child" | |
5222 | * @child: the css to be tested. | |
5223 | * @root: the css supporsed to be an ancestor of the child. | |
5224 | * | |
5225 | * Returns true if "root" is an ancestor of "child" in its hierarchy. Because | |
91c63734 | 5226 | * this function reads css->id, the caller must hold rcu_read_lock(). |
747388d7 KH |
5227 | * But, considering usual usage, the csses should be valid objects after test. |
5228 | * Assuming that the caller will do some action to the child if this returns | |
5229 | * returns true, the caller must take "child";s reference count. | |
5230 | * If "child" is valid object and this returns true, "root" is valid, too. | |
5231 | */ | |
5232 | ||
38460b48 | 5233 | bool css_is_ancestor(struct cgroup_subsys_state *child, |
0b7f569e | 5234 | const struct cgroup_subsys_state *root) |
38460b48 | 5235 | { |
747388d7 KH |
5236 | struct css_id *child_id; |
5237 | struct css_id *root_id; | |
38460b48 | 5238 | |
747388d7 | 5239 | child_id = rcu_dereference(child->id); |
91c63734 JW |
5240 | if (!child_id) |
5241 | return false; | |
747388d7 | 5242 | root_id = rcu_dereference(root->id); |
91c63734 JW |
5243 | if (!root_id) |
5244 | return false; | |
5245 | if (child_id->depth < root_id->depth) | |
5246 | return false; | |
5247 | if (child_id->stack[root_id->depth] != root_id->id) | |
5248 | return false; | |
5249 | return true; | |
38460b48 KH |
5250 | } |
5251 | ||
38460b48 KH |
5252 | void free_css_id(struct cgroup_subsys *ss, struct cgroup_subsys_state *css) |
5253 | { | |
5254 | struct css_id *id = css->id; | |
5255 | /* When this is called before css_id initialization, id can be NULL */ | |
5256 | if (!id) | |
5257 | return; | |
5258 | ||
5259 | BUG_ON(!ss->use_id); | |
5260 | ||
5261 | rcu_assign_pointer(id->css, NULL); | |
5262 | rcu_assign_pointer(css->id, NULL); | |
42aee6c4 | 5263 | spin_lock(&ss->id_lock); |
38460b48 | 5264 | idr_remove(&ss->idr, id->id); |
42aee6c4 | 5265 | spin_unlock(&ss->id_lock); |
025cea99 | 5266 | kfree_rcu(id, rcu_head); |
38460b48 | 5267 | } |
67523c48 | 5268 | EXPORT_SYMBOL_GPL(free_css_id); |
38460b48 KH |
5269 | |
5270 | /* | |
5271 | * This is called by init or create(). Then, calls to this function are | |
5272 | * always serialized (By cgroup_mutex() at create()). | |
5273 | */ | |
5274 | ||
5275 | static struct css_id *get_new_cssid(struct cgroup_subsys *ss, int depth) | |
5276 | { | |
5277 | struct css_id *newid; | |
5278 | int myid, error, size; | |
5279 | ||
5280 | BUG_ON(!ss->use_id); | |
5281 | ||
5282 | size = sizeof(*newid) + sizeof(unsigned short) * (depth + 1); | |
5283 | newid = kzalloc(size, GFP_KERNEL); | |
5284 | if (!newid) | |
5285 | return ERR_PTR(-ENOMEM); | |
5286 | /* get id */ | |
5287 | if (unlikely(!idr_pre_get(&ss->idr, GFP_KERNEL))) { | |
5288 | error = -ENOMEM; | |
5289 | goto err_out; | |
5290 | } | |
42aee6c4 | 5291 | spin_lock(&ss->id_lock); |
38460b48 KH |
5292 | /* Don't use 0. allocates an ID of 1-65535 */ |
5293 | error = idr_get_new_above(&ss->idr, newid, 1, &myid); | |
42aee6c4 | 5294 | spin_unlock(&ss->id_lock); |
38460b48 KH |
5295 | |
5296 | /* Returns error when there are no free spaces for new ID.*/ | |
5297 | if (error) { | |
5298 | error = -ENOSPC; | |
5299 | goto err_out; | |
5300 | } | |
5301 | if (myid > CSS_ID_MAX) | |
5302 | goto remove_idr; | |
5303 | ||
5304 | newid->id = myid; | |
5305 | newid->depth = depth; | |
5306 | return newid; | |
5307 | remove_idr: | |
5308 | error = -ENOSPC; | |
42aee6c4 | 5309 | spin_lock(&ss->id_lock); |
38460b48 | 5310 | idr_remove(&ss->idr, myid); |
42aee6c4 | 5311 | spin_unlock(&ss->id_lock); |
38460b48 KH |
5312 | err_out: |
5313 | kfree(newid); | |
5314 | return ERR_PTR(error); | |
5315 | ||
5316 | } | |
5317 | ||
e6a1105b BB |
5318 | static int __init_or_module cgroup_init_idr(struct cgroup_subsys *ss, |
5319 | struct cgroup_subsys_state *rootcss) | |
38460b48 KH |
5320 | { |
5321 | struct css_id *newid; | |
38460b48 | 5322 | |
42aee6c4 | 5323 | spin_lock_init(&ss->id_lock); |
38460b48 KH |
5324 | idr_init(&ss->idr); |
5325 | ||
38460b48 KH |
5326 | newid = get_new_cssid(ss, 0); |
5327 | if (IS_ERR(newid)) | |
5328 | return PTR_ERR(newid); | |
5329 | ||
5330 | newid->stack[0] = newid->id; | |
5331 | newid->css = rootcss; | |
5332 | rootcss->id = newid; | |
5333 | return 0; | |
5334 | } | |
5335 | ||
5336 | static int alloc_css_id(struct cgroup_subsys *ss, struct cgroup *parent, | |
5337 | struct cgroup *child) | |
5338 | { | |
5339 | int subsys_id, i, depth = 0; | |
5340 | struct cgroup_subsys_state *parent_css, *child_css; | |
fae9c791 | 5341 | struct css_id *child_id, *parent_id; |
38460b48 KH |
5342 | |
5343 | subsys_id = ss->subsys_id; | |
5344 | parent_css = parent->subsys[subsys_id]; | |
5345 | child_css = child->subsys[subsys_id]; | |
38460b48 | 5346 | parent_id = parent_css->id; |
94b3dd0f | 5347 | depth = parent_id->depth + 1; |
38460b48 KH |
5348 | |
5349 | child_id = get_new_cssid(ss, depth); | |
5350 | if (IS_ERR(child_id)) | |
5351 | return PTR_ERR(child_id); | |
5352 | ||
5353 | for (i = 0; i < depth; i++) | |
5354 | child_id->stack[i] = parent_id->stack[i]; | |
5355 | child_id->stack[depth] = child_id->id; | |
5356 | /* | |
5357 | * child_id->css pointer will be set after this cgroup is available | |
5358 | * see cgroup_populate_dir() | |
5359 | */ | |
5360 | rcu_assign_pointer(child_css->id, child_id); | |
5361 | ||
5362 | return 0; | |
5363 | } | |
5364 | ||
5365 | /** | |
5366 | * css_lookup - lookup css by id | |
5367 | * @ss: cgroup subsys to be looked into. | |
5368 | * @id: the id | |
5369 | * | |
5370 | * Returns pointer to cgroup_subsys_state if there is valid one with id. | |
5371 | * NULL if not. Should be called under rcu_read_lock() | |
5372 | */ | |
5373 | struct cgroup_subsys_state *css_lookup(struct cgroup_subsys *ss, int id) | |
5374 | { | |
5375 | struct css_id *cssid = NULL; | |
5376 | ||
5377 | BUG_ON(!ss->use_id); | |
5378 | cssid = idr_find(&ss->idr, id); | |
5379 | ||
5380 | if (unlikely(!cssid)) | |
5381 | return NULL; | |
5382 | ||
5383 | return rcu_dereference(cssid->css); | |
5384 | } | |
67523c48 | 5385 | EXPORT_SYMBOL_GPL(css_lookup); |
38460b48 KH |
5386 | |
5387 | /** | |
5388 | * css_get_next - lookup next cgroup under specified hierarchy. | |
5389 | * @ss: pointer to subsystem | |
5390 | * @id: current position of iteration. | |
5391 | * @root: pointer to css. search tree under this. | |
5392 | * @foundid: position of found object. | |
5393 | * | |
5394 | * Search next css under the specified hierarchy of rootid. Calling under | |
5395 | * rcu_read_lock() is necessary. Returns NULL if it reaches the end. | |
5396 | */ | |
5397 | struct cgroup_subsys_state * | |
5398 | css_get_next(struct cgroup_subsys *ss, int id, | |
5399 | struct cgroup_subsys_state *root, int *foundid) | |
5400 | { | |
5401 | struct cgroup_subsys_state *ret = NULL; | |
5402 | struct css_id *tmp; | |
5403 | int tmpid; | |
5404 | int rootid = css_id(root); | |
5405 | int depth = css_depth(root); | |
5406 | ||
5407 | if (!rootid) | |
5408 | return NULL; | |
5409 | ||
5410 | BUG_ON(!ss->use_id); | |
ca464d69 HD |
5411 | WARN_ON_ONCE(!rcu_read_lock_held()); |
5412 | ||
38460b48 KH |
5413 | /* fill start point for scan */ |
5414 | tmpid = id; | |
5415 | while (1) { | |
5416 | /* | |
5417 | * scan next entry from bitmap(tree), tmpid is updated after | |
5418 | * idr_get_next(). | |
5419 | */ | |
38460b48 | 5420 | tmp = idr_get_next(&ss->idr, &tmpid); |
38460b48 KH |
5421 | if (!tmp) |
5422 | break; | |
5423 | if (tmp->depth >= depth && tmp->stack[depth] == rootid) { | |
5424 | ret = rcu_dereference(tmp->css); | |
5425 | if (ret) { | |
5426 | *foundid = tmpid; | |
5427 | break; | |
5428 | } | |
5429 | } | |
5430 | /* continue to scan from next id */ | |
5431 | tmpid = tmpid + 1; | |
5432 | } | |
5433 | return ret; | |
5434 | } | |
5435 | ||
e5d1367f SE |
5436 | /* |
5437 | * get corresponding css from file open on cgroupfs directory | |
5438 | */ | |
5439 | struct cgroup_subsys_state *cgroup_css_from_dir(struct file *f, int id) | |
5440 | { | |
5441 | struct cgroup *cgrp; | |
5442 | struct inode *inode; | |
5443 | struct cgroup_subsys_state *css; | |
5444 | ||
5445 | inode = f->f_dentry->d_inode; | |
5446 | /* check in cgroup filesystem dir */ | |
5447 | if (inode->i_op != &cgroup_dir_inode_operations) | |
5448 | return ERR_PTR(-EBADF); | |
5449 | ||
5450 | if (id < 0 || id >= CGROUP_SUBSYS_COUNT) | |
5451 | return ERR_PTR(-EINVAL); | |
5452 | ||
5453 | /* get cgroup */ | |
5454 | cgrp = __d_cgrp(f->f_dentry); | |
5455 | css = cgrp->subsys[id]; | |
5456 | return css ? css : ERR_PTR(-ENOENT); | |
5457 | } | |
5458 | ||
fe693435 | 5459 | #ifdef CONFIG_CGROUP_DEBUG |
92fb9748 | 5460 | static struct cgroup_subsys_state *debug_css_alloc(struct cgroup *cont) |
fe693435 PM |
5461 | { |
5462 | struct cgroup_subsys_state *css = kzalloc(sizeof(*css), GFP_KERNEL); | |
5463 | ||
5464 | if (!css) | |
5465 | return ERR_PTR(-ENOMEM); | |
5466 | ||
5467 | return css; | |
5468 | } | |
5469 | ||
92fb9748 | 5470 | static void debug_css_free(struct cgroup *cont) |
fe693435 PM |
5471 | { |
5472 | kfree(cont->subsys[debug_subsys_id]); | |
5473 | } | |
5474 | ||
5475 | static u64 cgroup_refcount_read(struct cgroup *cont, struct cftype *cft) | |
5476 | { | |
5477 | return atomic_read(&cont->count); | |
5478 | } | |
5479 | ||
5480 | static u64 debug_taskcount_read(struct cgroup *cont, struct cftype *cft) | |
5481 | { | |
5482 | return cgroup_task_count(cont); | |
5483 | } | |
5484 | ||
5485 | static u64 current_css_set_read(struct cgroup *cont, struct cftype *cft) | |
5486 | { | |
5487 | return (u64)(unsigned long)current->cgroups; | |
5488 | } | |
5489 | ||
5490 | static u64 current_css_set_refcount_read(struct cgroup *cont, | |
5491 | struct cftype *cft) | |
5492 | { | |
5493 | u64 count; | |
5494 | ||
5495 | rcu_read_lock(); | |
5496 | count = atomic_read(¤t->cgroups->refcount); | |
5497 | rcu_read_unlock(); | |
5498 | return count; | |
5499 | } | |
5500 | ||
7717f7ba PM |
5501 | static int current_css_set_cg_links_read(struct cgroup *cont, |
5502 | struct cftype *cft, | |
5503 | struct seq_file *seq) | |
5504 | { | |
5505 | struct cg_cgroup_link *link; | |
5506 | struct css_set *cg; | |
5507 | ||
5508 | read_lock(&css_set_lock); | |
5509 | rcu_read_lock(); | |
5510 | cg = rcu_dereference(current->cgroups); | |
5511 | list_for_each_entry(link, &cg->cg_links, cg_link_list) { | |
5512 | struct cgroup *c = link->cgrp; | |
5513 | const char *name; | |
5514 | ||
5515 | if (c->dentry) | |
5516 | name = c->dentry->d_name.name; | |
5517 | else | |
5518 | name = "?"; | |
2c6ab6d2 PM |
5519 | seq_printf(seq, "Root %d group %s\n", |
5520 | c->root->hierarchy_id, name); | |
7717f7ba PM |
5521 | } |
5522 | rcu_read_unlock(); | |
5523 | read_unlock(&css_set_lock); | |
5524 | return 0; | |
5525 | } | |
5526 | ||
5527 | #define MAX_TASKS_SHOWN_PER_CSS 25 | |
5528 | static int cgroup_css_links_read(struct cgroup *cont, | |
5529 | struct cftype *cft, | |
5530 | struct seq_file *seq) | |
5531 | { | |
5532 | struct cg_cgroup_link *link; | |
5533 | ||
5534 | read_lock(&css_set_lock); | |
5535 | list_for_each_entry(link, &cont->css_sets, cgrp_link_list) { | |
5536 | struct css_set *cg = link->cg; | |
5537 | struct task_struct *task; | |
5538 | int count = 0; | |
5539 | seq_printf(seq, "css_set %p\n", cg); | |
5540 | list_for_each_entry(task, &cg->tasks, cg_list) { | |
5541 | if (count++ > MAX_TASKS_SHOWN_PER_CSS) { | |
5542 | seq_puts(seq, " ...\n"); | |
5543 | break; | |
5544 | } else { | |
5545 | seq_printf(seq, " task %d\n", | |
5546 | task_pid_vnr(task)); | |
5547 | } | |
5548 | } | |
5549 | } | |
5550 | read_unlock(&css_set_lock); | |
5551 | return 0; | |
5552 | } | |
5553 | ||
fe693435 PM |
5554 | static u64 releasable_read(struct cgroup *cgrp, struct cftype *cft) |
5555 | { | |
5556 | return test_bit(CGRP_RELEASABLE, &cgrp->flags); | |
5557 | } | |
5558 | ||
5559 | static struct cftype debug_files[] = { | |
5560 | { | |
5561 | .name = "cgroup_refcount", | |
5562 | .read_u64 = cgroup_refcount_read, | |
5563 | }, | |
5564 | { | |
5565 | .name = "taskcount", | |
5566 | .read_u64 = debug_taskcount_read, | |
5567 | }, | |
5568 | ||
5569 | { | |
5570 | .name = "current_css_set", | |
5571 | .read_u64 = current_css_set_read, | |
5572 | }, | |
5573 | ||
5574 | { | |
5575 | .name = "current_css_set_refcount", | |
5576 | .read_u64 = current_css_set_refcount_read, | |
5577 | }, | |
5578 | ||
7717f7ba PM |
5579 | { |
5580 | .name = "current_css_set_cg_links", | |
5581 | .read_seq_string = current_css_set_cg_links_read, | |
5582 | }, | |
5583 | ||
5584 | { | |
5585 | .name = "cgroup_css_links", | |
5586 | .read_seq_string = cgroup_css_links_read, | |
5587 | }, | |
5588 | ||
fe693435 PM |
5589 | { |
5590 | .name = "releasable", | |
5591 | .read_u64 = releasable_read, | |
5592 | }, | |
fe693435 | 5593 | |
4baf6e33 TH |
5594 | { } /* terminate */ |
5595 | }; | |
fe693435 PM |
5596 | |
5597 | struct cgroup_subsys debug_subsys = { | |
5598 | .name = "debug", | |
92fb9748 TH |
5599 | .css_alloc = debug_css_alloc, |
5600 | .css_free = debug_css_free, | |
fe693435 | 5601 | .subsys_id = debug_subsys_id, |
4baf6e33 | 5602 | .base_cftypes = debug_files, |
fe693435 PM |
5603 | }; |
5604 | #endif /* CONFIG_CGROUP_DEBUG */ |