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