]> git.proxmox.com Git - mirror_ubuntu-focal-kernel.git/blame - include/linux/cgroup.h
kernfs: implement kernfs_walk_and_get()
[mirror_ubuntu-focal-kernel.git] / include / linux / cgroup.h
CommitLineData
ddbcc7e8
PM
1#ifndef _LINUX_CGROUP_H
2#define _LINUX_CGROUP_H
3/*
4 * cgroup interface
5 *
6 * Copyright (C) 2003 BULL SA
7 * Copyright (C) 2004-2006 Silicon Graphics, Inc.
8 *
9 */
10
11#include <linux/sched.h>
ddbcc7e8
PM
12#include <linux/cpumask.h>
13#include <linux/nodemask.h>
eb6fd504 14#include <linux/rculist.h>
846c7bb0 15#include <linux/cgroupstats.h>
25a7e684 16#include <linux/fs.h>
7da11279 17#include <linux/seq_file.h>
2bd59d48 18#include <linux/kernfs.h>
49d1dc4b 19#include <linux/jump_label.h>
ddbcc7e8 20
b4a04ab7 21#include <linux/cgroup-defs.h>
ddbcc7e8
PM
22
23#ifdef CONFIG_CGROUPS
24
6abc8ca1
TH
25/*
26 * All weight knobs on the default hierarhcy should use the following min,
27 * default and max values. The default value is the logarithmic center of
28 * MIN and MAX and allows 100x to be expressed in both directions.
29 */
30#define CGROUP_WEIGHT_MIN 1
31#define CGROUP_WEIGHT_DFL 100
32#define CGROUP_WEIGHT_MAX 10000
33
c326aa2b
TH
34/* a css_task_iter should be treated as an opaque object */
35struct css_task_iter {
36 struct cgroup_subsys *ss;
37
38 struct list_head *cset_pos;
39 struct list_head *cset_head;
ddbcc7e8 40
c326aa2b
TH
41 struct list_head *task_pos;
42 struct list_head *tasks_head;
43 struct list_head *mg_tasks_head;
ed27b9f7
TH
44
45 struct css_set *cur_cset;
46 struct task_struct *cur_task;
47 struct list_head iters_node; /* css_set->task_iters */
c326aa2b 48};
ddbcc7e8 49
c326aa2b
TH
50extern struct cgroup_root cgrp_dfl_root;
51extern struct css_set init_css_set;
a424316c 52
c326aa2b 53#define SUBSYS(_x) extern struct cgroup_subsys _x ## _cgrp_subsys;
817929ec 54#include <linux/cgroup_subsys.h>
817929ec
PM
55#undef SUBSYS
56
49d1dc4b
TH
57#define SUBSYS(_x) \
58 extern struct static_key_true _x ## _cgrp_subsys_enabled_key; \
59 extern struct static_key_true _x ## _cgrp_subsys_on_dfl_key;
60#include <linux/cgroup_subsys.h>
61#undef SUBSYS
62
63/**
64 * cgroup_subsys_enabled - fast test on whether a subsys is enabled
65 * @ss: subsystem in question
66 */
67#define cgroup_subsys_enabled(ss) \
68 static_branch_likely(&ss ## _enabled_key)
69
70/**
71 * cgroup_subsys_on_dfl - fast test on whether a subsys is on default hierarchy
72 * @ss: subsystem in question
73 */
74#define cgroup_subsys_on_dfl(ss) \
75 static_branch_likely(&ss ## _on_dfl_key)
76
c326aa2b
TH
77bool css_has_online_children(struct cgroup_subsys_state *css);
78struct cgroup_subsys_state *css_from_id(int id, struct cgroup_subsys *ss);
79struct cgroup_subsys_state *cgroup_get_e_css(struct cgroup *cgroup,
80 struct cgroup_subsys *ss);
81struct cgroup_subsys_state *css_tryget_online_from_dir(struct dentry *dentry,
82 struct cgroup_subsys *ss);
83
c326aa2b
TH
84int cgroup_attach_task_all(struct task_struct *from, struct task_struct *);
85int cgroup_transfer_tasks(struct cgroup *to, struct cgroup *from);
86
87int cgroup_add_dfl_cftypes(struct cgroup_subsys *ss, struct cftype *cfts);
88int cgroup_add_legacy_cftypes(struct cgroup_subsys *ss, struct cftype *cfts);
89int cgroup_rm_cftypes(struct cftype *cfts);
90
91char *task_cgroup_path(struct task_struct *task, char *buf, size_t buflen);
92int cgroupstats_build(struct cgroupstats *stats, struct dentry *dentry);
93int proc_cgroup_show(struct seq_file *m, struct pid_namespace *ns,
94 struct pid *pid, struct task_struct *tsk);
95
96void cgroup_fork(struct task_struct *p);
7e47682e
AS
97extern int cgroup_can_fork(struct task_struct *p,
98 void *ss_priv[CGROUP_CANFORK_COUNT]);
99extern void cgroup_cancel_fork(struct task_struct *p,
100 void *ss_priv[CGROUP_CANFORK_COUNT]);
101extern void cgroup_post_fork(struct task_struct *p,
102 void *old_ss_priv[CGROUP_CANFORK_COUNT]);
c326aa2b 103void cgroup_exit(struct task_struct *p);
2e91fa7f 104void cgroup_free(struct task_struct *p);
c326aa2b
TH
105
106int cgroup_init_early(void);
107int cgroup_init(void);
108
5c9d535b 109/*
c326aa2b
TH
110 * Iteration helpers and macros.
111 */
112
113struct cgroup_subsys_state *css_next_child(struct cgroup_subsys_state *pos,
114 struct cgroup_subsys_state *parent);
115struct cgroup_subsys_state *css_next_descendant_pre(struct cgroup_subsys_state *pos,
116 struct cgroup_subsys_state *css);
117struct cgroup_subsys_state *css_rightmost_descendant(struct cgroup_subsys_state *pos);
118struct cgroup_subsys_state *css_next_descendant_post(struct cgroup_subsys_state *pos,
119 struct cgroup_subsys_state *css);
120
121struct task_struct *cgroup_taskset_first(struct cgroup_taskset *tset);
122struct task_struct *cgroup_taskset_next(struct cgroup_taskset *tset);
123
124void css_task_iter_start(struct cgroup_subsys_state *css,
125 struct css_task_iter *it);
126struct task_struct *css_task_iter_next(struct css_task_iter *it);
127void css_task_iter_end(struct css_task_iter *it);
128
129/**
130 * css_for_each_child - iterate through children of a css
131 * @pos: the css * to use as the loop cursor
132 * @parent: css whose children to walk
133 *
134 * Walk @parent's children. Must be called under rcu_read_lock().
135 *
136 * If a subsystem synchronizes ->css_online() and the start of iteration, a
137 * css which finished ->css_online() is guaranteed to be visible in the
138 * future iterations and will stay visible until the last reference is put.
139 * A css which hasn't finished ->css_online() or already finished
140 * ->css_offline() may show up during traversal. It's each subsystem's
141 * responsibility to synchronize against on/offlining.
5c9d535b 142 *
c326aa2b
TH
143 * It is allowed to temporarily drop RCU read lock during iteration. The
144 * caller is responsible for ensuring that @pos remains accessible until
145 * the start of the next iteration by, for example, bumping the css refcnt.
5c9d535b 146 */
c326aa2b
TH
147#define css_for_each_child(pos, parent) \
148 for ((pos) = css_next_child(NULL, (parent)); (pos); \
149 (pos) = css_next_child((pos), (parent)))
ddbcc7e8 150
c326aa2b
TH
151/**
152 * css_for_each_descendant_pre - pre-order walk of a css's descendants
153 * @pos: the css * to use as the loop cursor
154 * @root: css whose descendants to walk
155 *
156 * Walk @root's descendants. @root is included in the iteration and the
157 * first node to be visited. Must be called under rcu_read_lock().
158 *
159 * If a subsystem synchronizes ->css_online() and the start of iteration, a
160 * css which finished ->css_online() is guaranteed to be visible in the
161 * future iterations and will stay visible until the last reference is put.
162 * A css which hasn't finished ->css_online() or already finished
163 * ->css_offline() may show up during traversal. It's each subsystem's
164 * responsibility to synchronize against on/offlining.
165 *
166 * For example, the following guarantees that a descendant can't escape
167 * state updates of its ancestors.
168 *
169 * my_online(@css)
170 * {
171 * Lock @css's parent and @css;
172 * Inherit state from the parent;
173 * Unlock both.
174 * }
175 *
176 * my_update_state(@css)
177 * {
178 * css_for_each_descendant_pre(@pos, @css) {
179 * Lock @pos;
180 * if (@pos == @css)
181 * Update @css's state;
182 * else
183 * Verify @pos is alive and inherit state from its parent;
184 * Unlock @pos;
185 * }
186 * }
187 *
188 * As long as the inheriting step, including checking the parent state, is
189 * enclosed inside @pos locking, double-locking the parent isn't necessary
190 * while inheriting. The state update to the parent is guaranteed to be
191 * visible by walking order and, as long as inheriting operations to the
192 * same @pos are atomic to each other, multiple updates racing each other
193 * still result in the correct state. It's guaranateed that at least one
194 * inheritance happens for any css after the latest update to its parent.
195 *
196 * If checking parent's state requires locking the parent, each inheriting
197 * iteration should lock and unlock both @pos->parent and @pos.
198 *
199 * Alternatively, a subsystem may choose to use a single global lock to
200 * synchronize ->css_online() and ->css_offline() against tree-walking
201 * operations.
202 *
203 * It is allowed to temporarily drop RCU read lock during iteration. The
204 * caller is responsible for ensuring that @pos remains accessible until
205 * the start of the next iteration by, for example, bumping the css refcnt.
206 */
207#define css_for_each_descendant_pre(pos, css) \
208 for ((pos) = css_next_descendant_pre(NULL, (css)); (pos); \
209 (pos) = css_next_descendant_pre((pos), (css)))
210
211/**
212 * css_for_each_descendant_post - post-order walk of a css's descendants
213 * @pos: the css * to use as the loop cursor
214 * @css: css whose descendants to walk
215 *
216 * Similar to css_for_each_descendant_pre() but performs post-order
217 * traversal instead. @root is included in the iteration and the last
218 * node to be visited.
219 *
220 * If a subsystem synchronizes ->css_online() and the start of iteration, a
221 * css which finished ->css_online() is guaranteed to be visible in the
222 * future iterations and will stay visible until the last reference is put.
223 * A css which hasn't finished ->css_online() or already finished
224 * ->css_offline() may show up during traversal. It's each subsystem's
225 * responsibility to synchronize against on/offlining.
226 *
227 * Note that the walk visibility guarantee example described in pre-order
228 * walk doesn't apply the same to post-order walks.
229 */
230#define css_for_each_descendant_post(pos, css) \
231 for ((pos) = css_next_descendant_post(NULL, (css)); (pos); \
232 (pos) = css_next_descendant_post((pos), (css)))
233
234/**
235 * cgroup_taskset_for_each - iterate cgroup_taskset
236 * @task: the loop cursor
237 * @tset: taskset to iterate
4530eddb
TH
238 *
239 * @tset may contain multiple tasks and they may belong to multiple
240 * processes. When there are multiple tasks in @tset, if a task of a
241 * process is in @tset, all tasks of the process are in @tset. Also, all
242 * are guaranteed to share the same source and destination csses.
243 *
244 * Iteration is not in any specific order.
c326aa2b
TH
245 */
246#define cgroup_taskset_for_each(task, tset) \
247 for ((task) = cgroup_taskset_first((tset)); (task); \
248 (task) = cgroup_taskset_next((tset)))
ddbcc7e8 249
4530eddb
TH
250/**
251 * cgroup_taskset_for_each_leader - iterate group leaders in a cgroup_taskset
252 * @leader: the loop cursor
253 * @tset: takset to iterate
254 *
255 * Iterate threadgroup leaders of @tset. For single-task migrations, @tset
256 * may not contain any.
257 */
258#define cgroup_taskset_for_each_leader(leader, tset) \
259 for ((leader) = cgroup_taskset_first((tset)); (leader); \
260 (leader) = cgroup_taskset_next((tset))) \
261 if ((leader) != (leader)->group_leader) \
262 ; \
263 else
264
c326aa2b
TH
265/*
266 * Inline functions.
267 */
ddbcc7e8 268
5de0107e
TH
269/**
270 * css_get - obtain a reference on the specified css
271 * @css: target css
272 *
273 * The caller must already have a reference.
ddbcc7e8 274 */
ddbcc7e8
PM
275static inline void css_get(struct cgroup_subsys_state *css)
276{
3b514d24
TH
277 if (!(css->flags & CSS_NO_REF))
278 percpu_ref_get(&css->refcnt);
ddbcc7e8 279}
e7c5ec91 280
e8ea14cc
JW
281/**
282 * css_get_many - obtain references on the specified css
283 * @css: target css
284 * @n: number of references to get
285 *
286 * The caller must already have a reference.
287 */
288static inline void css_get_many(struct cgroup_subsys_state *css, unsigned int n)
289{
290 if (!(css->flags & CSS_NO_REF))
291 percpu_ref_get_many(&css->refcnt, n);
292}
293
6f4524d3
TH
294/**
295 * css_tryget - try to obtain a reference on the specified css
296 * @css: target css
297 *
298 * Obtain a reference on @css unless it already has reached zero and is
299 * being released. This function doesn't care whether @css is on or
300 * offline. The caller naturally needs to ensure that @css is accessible
301 * but doesn't have to be holding a reference on it - IOW, RCU protected
302 * access is good enough for this function. Returns %true if a reference
303 * count was successfully obtained; %false otherwise.
304 */
305static inline bool css_tryget(struct cgroup_subsys_state *css)
306{
307 if (!(css->flags & CSS_NO_REF))
308 return percpu_ref_tryget(&css->refcnt);
309 return true;
310}
311
5de0107e 312/**
ec903c0c 313 * css_tryget_online - try to obtain a reference on the specified css if online
5de0107e
TH
314 * @css: target css
315 *
ec903c0c
TH
316 * Obtain a reference on @css if it's online. The caller naturally needs
317 * to ensure that @css is accessible but doesn't have to be holding a
5de0107e
TH
318 * reference on it - IOW, RCU protected access is good enough for this
319 * function. Returns %true if a reference count was successfully obtained;
320 * %false otherwise.
321 */
ec903c0c 322static inline bool css_tryget_online(struct cgroup_subsys_state *css)
e7c5ec91 323{
3b514d24
TH
324 if (!(css->flags & CSS_NO_REF))
325 return percpu_ref_tryget_live(&css->refcnt);
326 return true;
e7c5ec91 327}
2f7ee569
TH
328
329/**
5de0107e
TH
330 * css_put - put a css reference
331 * @css: target css
332 *
ec903c0c 333 * Put a reference obtained via css_get() and css_tryget_online().
2f7ee569 334 */
ddbcc7e8
PM
335static inline void css_put(struct cgroup_subsys_state *css)
336{
3b514d24
TH
337 if (!(css->flags & CSS_NO_REF))
338 percpu_ref_put(&css->refcnt);
ddbcc7e8 339}
2f7ee569 340
e8ea14cc
JW
341/**
342 * css_put_many - put css references
343 * @css: target css
344 * @n: number of references to put
345 *
346 * Put references obtained via css_get() and css_tryget_online().
21acb9ca 347 */
e8ea14cc
JW
348static inline void css_put_many(struct cgroup_subsys_state *css, unsigned int n)
349{
350 if (!(css->flags & CSS_NO_REF))
351 percpu_ref_put_many(&css->refcnt, n);
352}
ddbcc7e8 353
14611e51
TH
354/**
355 * task_css_set_check - obtain a task's css_set with extra access conditions
356 * @task: the task to obtain css_set for
357 * @__c: extra condition expression to be passed to rcu_dereference_check()
358 *
359 * A task's css_set is RCU protected, initialized and exited while holding
360 * task_lock(), and can only be modified while holding both cgroup_mutex
361 * and task_lock() while the task is alive. This macro verifies that the
362 * caller is inside proper critical section and returns @task's css_set.
363 *
364 * The caller can also specify additional allowed conditions via @__c, such
365 * as locks used during the cgroup_subsys::attach() methods.
dc61b1d6 366 */
2219449a
TH
367#ifdef CONFIG_PROVE_RCU
368extern struct mutex cgroup_mutex;
f0d9a5f1 369extern spinlock_t css_set_lock;
14611e51
TH
370#define task_css_set_check(task, __c) \
371 rcu_dereference_check((task)->cgroups, \
0e1d768f 372 lockdep_is_held(&cgroup_mutex) || \
f0d9a5f1 373 lockdep_is_held(&css_set_lock) || \
0e1d768f 374 ((task)->flags & PF_EXITING) || (__c))
2219449a 375#else
14611e51
TH
376#define task_css_set_check(task, __c) \
377 rcu_dereference((task)->cgroups)
2219449a 378#endif
dc61b1d6 379
14611e51 380/**
8af01f56 381 * task_css_check - obtain css for (task, subsys) w/ extra access conds
14611e51
TH
382 * @task: the target task
383 * @subsys_id: the target subsystem ID
384 * @__c: extra condition expression to be passed to rcu_dereference_check()
385 *
386 * Return the cgroup_subsys_state for the (@task, @subsys_id) pair. The
387 * synchronization rules are the same as task_css_set_check().
388 */
8af01f56 389#define task_css_check(task, subsys_id, __c) \
14611e51
TH
390 task_css_set_check((task), (__c))->subsys[(subsys_id)]
391
392/**
393 * task_css_set - obtain a task's css_set
394 * @task: the task to obtain css_set for
395 *
396 * See task_css_set_check().
397 */
398static inline struct css_set *task_css_set(struct task_struct *task)
399{
400 return task_css_set_check(task, false);
401}
402
403/**
8af01f56 404 * task_css - obtain css for (task, subsys)
14611e51
TH
405 * @task: the target task
406 * @subsys_id: the target subsystem ID
407 *
8af01f56 408 * See task_css_check().
14611e51 409 */
8af01f56
TH
410static inline struct cgroup_subsys_state *task_css(struct task_struct *task,
411 int subsys_id)
ddbcc7e8 412{
8af01f56 413 return task_css_check(task, subsys_id, false);
ddbcc7e8
PM
414}
415
ec438699
TH
416/**
417 * task_get_css - find and get the css for (task, subsys)
418 * @task: the target task
419 * @subsys_id: the target subsystem ID
420 *
421 * Find the css for the (@task, @subsys_id) combination, increment a
422 * reference on and return it. This function is guaranteed to return a
423 * valid css.
424 */
425static inline struct cgroup_subsys_state *
426task_get_css(struct task_struct *task, int subsys_id)
427{
428 struct cgroup_subsys_state *css;
429
430 rcu_read_lock();
431 while (true) {
432 css = task_css(task, subsys_id);
433 if (likely(css_tryget_online(css)))
434 break;
435 cpu_relax();
436 }
437 rcu_read_unlock();
438 return css;
439}
440
5024ae29
TH
441/**
442 * task_css_is_root - test whether a task belongs to the root css
443 * @task: the target task
444 * @subsys_id: the target subsystem ID
445 *
446 * Test whether @task belongs to the root css on the specified subsystem.
447 * May be invoked in any context.
448 */
449static inline bool task_css_is_root(struct task_struct *task, int subsys_id)
450{
451 return task_css_check(task, subsys_id, true) ==
452 init_css_set.subsys[subsys_id];
453}
454
8af01f56
TH
455static inline struct cgroup *task_cgroup(struct task_struct *task,
456 int subsys_id)
ddbcc7e8 457{
8af01f56 458 return task_css(task, subsys_id)->cgroup;
ddbcc7e8
PM
459}
460
b11cfb58
TH
461/**
462 * cgroup_is_descendant - test ancestry
463 * @cgrp: the cgroup to be tested
464 * @ancestor: possible ancestor of @cgrp
465 *
466 * Test whether @cgrp is a descendant of @ancestor. It also returns %true
467 * if @cgrp == @ancestor. This function is safe to call as long as @cgrp
468 * and @ancestor are accessible.
469 */
470static inline bool cgroup_is_descendant(struct cgroup *cgrp,
471 struct cgroup *ancestor)
472{
473 if (cgrp->root != ancestor->root || cgrp->level < ancestor->level)
474 return false;
475 return cgrp->ancestor_ids[ancestor->level] == ancestor->id;
476}
477
07bc356e 478/* no synchronization, the result can only be used as a hint */
27bd4dbb 479static inline bool cgroup_is_populated(struct cgroup *cgrp)
07bc356e 480{
27bd4dbb 481 return cgrp->populated_cnt;
07bc356e 482}
f3d46500 483
f29374b1 484/* returns ino associated with a cgroup */
b1664924
TH
485static inline ino_t cgroup_ino(struct cgroup *cgrp)
486{
f29374b1 487 return cgrp->kn->ino;
b1664924 488}
3ebb2b6e 489
b4168640
TH
490/* cft/css accessors for cftype->write() operation */
491static inline struct cftype *of_cft(struct kernfs_open_file *of)
7da11279 492{
2bd59d48 493 return of->kn->priv;
7da11279 494}
0f0a2b4f 495
b4168640 496struct cgroup_subsys_state *of_css(struct kernfs_open_file *of);
817929ec 497
b4168640
TH
498/* cft/css accessors for cftype->seq_*() operations */
499static inline struct cftype *seq_cft(struct seq_file *seq)
500{
501 return of_cft(seq->private);
502}
e535837b 503
b4168640
TH
504static inline struct cgroup_subsys_state *seq_css(struct seq_file *seq)
505{
506 return of_css(seq->private);
507}
31583bb0 508
e61734c5
TH
509/*
510 * Name / path handling functions. All are thin wrappers around the kernfs
511 * counterparts and can be called under any context.
512 */
38460b48 513
e61734c5
TH
514static inline int cgroup_name(struct cgroup *cgrp, char *buf, size_t buflen)
515{
fdce6bf8 516 return kernfs_name(cgrp->kn, buf, buflen);
e61734c5 517}
ddbcc7e8 518
e61734c5
TH
519static inline char * __must_check cgroup_path(struct cgroup *cgrp, char *buf,
520 size_t buflen)
521{
fdce6bf8 522 return kernfs_path(cgrp->kn, buf, buflen);
e61734c5 523}
f3ba5380 524
e61734c5
TH
525static inline void pr_cont_cgroup_name(struct cgroup *cgrp)
526{
fdce6bf8 527 pr_cont_kernfs_name(cgrp->kn);
e61734c5 528}
ddbcc7e8 529
e61734c5 530static inline void pr_cont_cgroup_path(struct cgroup *cgrp)
846c7bb0 531{
fdce6bf8 532 pr_cont_kernfs_path(cgrp->kn);
846c7bb0 533}
ddbcc7e8 534
6f60eade
TH
535/**
536 * cgroup_file_notify - generate a file modified event for a cgroup_file
537 * @cfile: target cgroup_file
538 *
539 * @cfile must have been obtained by setting cftype->file_offset.
540 */
541static inline void cgroup_file_notify(struct cgroup_file *cfile)
542{
543 /* might not have been created due to one of the CFTYPE selector flags */
544 if (cfile->kn)
545 kernfs_notify(cfile->kn);
546}
547
ddbcc7e8
PM
548#else /* !CONFIG_CGROUPS */
549
f3ba5380 550struct cgroup_subsys_state;
f3ba5380 551
c326aa2b 552static inline void css_put(struct cgroup_subsys_state *css) {}
31583bb0 553static inline int cgroup_attach_task_all(struct task_struct *from,
c326aa2b
TH
554 struct task_struct *t) { return 0; }
555static inline int cgroupstats_build(struct cgroupstats *stats,
556 struct dentry *dentry) { return -EINVAL; }
557
b4f48b63 558static inline void cgroup_fork(struct task_struct *p) {}
7e47682e
AS
559static inline int cgroup_can_fork(struct task_struct *p,
560 void *ss_priv[CGROUP_CANFORK_COUNT])
561{ return 0; }
562static inline void cgroup_cancel_fork(struct task_struct *p,
563 void *ss_priv[CGROUP_CANFORK_COUNT]) {}
564static inline void cgroup_post_fork(struct task_struct *p,
565 void *ss_priv[CGROUP_CANFORK_COUNT]) {}
1ec41830 566static inline void cgroup_exit(struct task_struct *p) {}
2e91fa7f 567static inline void cgroup_free(struct task_struct *p) {}
ddbcc7e8 568
c326aa2b
TH
569static inline int cgroup_init_early(void) { return 0; }
570static inline int cgroup_init(void) { return 0; }
d7926ee3 571
ddbcc7e8
PM
572#endif /* !CONFIG_CGROUPS */
573
574#endif /* _LINUX_CGROUP_H */