| /linux-6.6.21/tools/testing/selftests/bpf/prog_tests/ |
| D | cgroup_hierarchical_stats.c | 54 } cgroups[] = { variable
64 #define N_CGROUPS ARRAY_SIZE(cgroups)
133 fd = create_and_get_cgroup(cgroups[i].path); in setup_cgroups()
137 cgroups[i].fd = fd; in setup_cgroups()
138 cgroups[i].id = get_cgroup_id(cgroups[i].path); in setup_cgroups()
147 close(cgroups[i].fd); in cleanup_cgroups()
175 if (join_parent_cgroup(cgroups[i].path)) in attach_processes()
220 attach_counters[i] = get_attach_counter(cgroups[i].id, in check_attach_counters()
221 cgroups[i].name); in check_attach_counters()
288 err = setup_cgroup_iter(*skel, cgroups[i].fd, cgroups[i].name); in setup_progs()
[all …]
|
| /linux-6.6.21/tools/testing/selftests/bpf/progs/ |
| D | cgrp_ls_recursion.c | 29 bpf_cgrp_storage_delete(&map_a, task->cgroups->dfl_cgrp); in BPF_PROG()
30 bpf_cgrp_storage_delete(&map_b, task->cgroups->dfl_cgrp); in BPF_PROG()
40 ptr = bpf_cgrp_storage_get(&map_a, task->cgroups->dfl_cgrp, 0, in BPF_PROG()
45 ptr = bpf_cgrp_storage_get(&map_b, task->cgroups->dfl_cgrp, 0, in BPF_PROG()
60 ptr = bpf_cgrp_storage_get(&map_a, task->cgroups->dfl_cgrp, 0, in BPF_PROG()
65 ptr = bpf_cgrp_storage_get(&map_b, task->cgroups->dfl_cgrp, 0, in BPF_PROG()
|
| D | cgrp_ls_tp_btf.c | 43 ptr = bpf_cgrp_storage_get(&map_a, task->cgroups->dfl_cgrp, 0, in BPF_PROG()
49 err = bpf_cgrp_storage_delete(&map_a, task->cgroups->dfl_cgrp); in BPF_PROG()
54 ptr = bpf_cgrp_storage_get(&map_a, task->cgroups->dfl_cgrp, 0, 0); in BPF_PROG()
59 ptr = bpf_cgrp_storage_get(&map_a, task->cgroups->dfl_cgrp, 0, in BPF_PROG()
79 ptr = bpf_cgrp_storage_get(&map_a, task->cgroups->dfl_cgrp, 0, in BPF_PROG()
|
| D | rcu_read_lock.c | 33 struct css_set *cgroups; in get_cgroup_id() local
41 cgroups = task->cgroups; in get_cgroup_id()
42 if (!cgroups) in get_cgroup_id()
44 cgroup_id = cgroups->dfl_cgrp->kn->id; in get_cgroup_id()
|
| D | cgrp_ls_sleepable.c | 52 cgrp = task->cgroups->dfl_cgrp; in no_rcu_lock()
72 cgrp = task->cgroups->dfl_cgrp; in yes_rcu_lock()
|
| /linux-6.6.21/tools/cgroup/ |
| D | memcg_shrinker.py | 11 cgroups = {}
17 cgroups[ino] = path
20 return cgroups
44 cgroups = scan_cgroups("/sys/fs/cgroup/")
58 cg = cgroups[ino]
|
| /linux-6.6.21/Documentation/admin-guide/cgroup-v1/ |
| D | cgroups.rst | 21 1.1 What are cgroups ?
22 1.2 Why are cgroups needed ?
23 1.3 How are cgroups implemented ?
26 1.6 How do I use cgroups ?
41 1.1 What are cgroups ?
54 facilities provided by cgroups to treat groups of tasks in
60 A *hierarchy* is a set of cgroups arranged in a tree, such that
61 every task in the system is in exactly one of the cgroups in the
67 cgroups. Each hierarchy is a partition of all tasks in the system.
69 User-level code may create and destroy cgroups by name in an
[all …]
|
| D | net_cls.rst | 9 different priorities to packets from different cgroups.
13 Creating a net_cls cgroups instance creates a net_cls.classid file.
|
| D | devices.rst | 43 Any task can move itself between cgroups. This clearly won't
60 device cgroups maintain hierarchy by making sure a cgroup never has more
121 not be possible once the device cgroups has children.
126 device cgroups is implemented internally using a behavior (ALLOW, DENY) and a
|
| D | freezer-subsystem.rst | 9 whole. The cgroup freezer uses cgroups to describe the set of tasks to
57 tasks belonging to the cgroup and all its descendant cgroups. Each
73 to the cgroup or one of its descendant cgroups until the new task is
79 descendant cgroups.
|
| D | index.rst | 10 cgroups
|
| D | memory.rst | 284 The reclaim algorithm has not been modified for cgroups, except that
323 Kernel memory accounting is enabled for all memory cgroups by default. But
400 2. Prepare the cgroups (see :ref:`Why are cgroups needed?
401 <cgroups-why-needed>` for the background information)::
603 (Note: file and shmem may be shared among other cgroups. In that case,
667 The hierarchy is created by creating the appropriate cgroups in the
729 reclaiming memory for balancing between memory cgroups
744 cgroups to allow fine-grained policy adjustments without having to
818 Memory cgroup implements memory thresholds using the cgroups notification
819 API (see cgroups.txt). It allows to register multiple memory and memsw
[all …]
|
| /linux-6.6.21/tools/perf/util/ |
| D | cgroup.c | 559 down_write(&env->cgroups.lock); in cgroup__findnew()
560 cgrp = __cgroup__findnew(&env->cgroups.tree, id, true, path); in cgroup__findnew()
561 up_write(&env->cgroups.lock); in cgroup__findnew()
569 down_read(&env->cgroups.lock); in cgroup__find()
570 cgrp = __cgroup__findnew(&env->cgroups.tree, id, false, NULL); in cgroup__find()
571 up_read(&env->cgroups.lock); in cgroup__find()
580 down_write(&env->cgroups.lock); in perf_env__purge_cgroups()
581 while (!RB_EMPTY_ROOT(&env->cgroups.tree)) { in perf_env__purge_cgroups()
582 node = rb_first(&env->cgroups.tree); in perf_env__purge_cgroups()
585 rb_erase(node, &env->cgroups.tree); in perf_env__purge_cgroups()
[all …]
|
| D | cgroup.h | 30 int evlist__expand_cgroup(struct evlist *evlist, const char *cgroups,
|
| D | env.h | 115 } cgroups; member
|
| /linux-6.6.21/Documentation/admin-guide/ |
| D | cgroup-v2.rst | 103 multiple individual control groups, the plural form "cgroups" is used.
120 cgroups form a tree structure and every process in the system belongs
130 processes which belong to the cgroups consisting the inclusive
206 propagation into leaf cgroups. This allows protecting entire
225 A given cgroup may have multiple child cgroups forming a tree
291 different cgroups and are not subject to the no internal process
292 constraint - threaded controllers can be enabled on non-leaf cgroups
298 can't have populated child cgroups which aren't threaded. Because the
300 serve both as a threaded domain and a parent to domain cgroups.
364 between threads in a non-leaf cgroup and its child cgroups. Each
[all …]
|
| /linux-6.6.21/block/ |
| D | Kconfig.iosched | 38 (cgroups-v1) or io (cgroups-v2) controller.
|
| D | Kconfig | 99 cgroups and specifying per device IO rate policies.
108 effort limit to prioritize cgroups. Depending on the setting, the limit
109 can be used to protect cgroups in terms of bandwidth/iops and better
|
| /linux-6.6.21/tools/perf/util/bpf_skel/ |
| D | off_cpu.bpf.c | 125 return BPF_CORE_READ(t, cgroups, dfl_cgrp, kn, id); in get_cgroup_id()
136 cgrp = BPF_CORE_READ(t, cgroups, subsys[perf_subsys_id], cgroup); in get_cgroup_id()
|
| /linux-6.6.21/include/linux/ |
| D | psi.h | 63 rcu_assign_pointer(p->cgroups, to); in cgroup_move_task()
|
| /linux-6.6.21/Documentation/bpf/ |
| D | map_cgrp_storage.rst | 9 storage for cgroups. It is only available with ``CONFIG_CGROUPS``.
56 ptr = bpf_cgrp_storage_get(&cgrp_storage, task->cgroups->dfl_cgrp, 0,
|
| D | map_cgroup_storage.rst | 10 attach to cgroups; the programs are made available by the same Kconfig. The
16 cgroups on their own.
132 that uses the map. A program may be attached to multiple cgroups or have
|
| /linux-6.6.21/tools/perf/util/bpf_skel/vmlinux/ |
| D | vmlinux.h | 99 struct css_set *cgroups; member
|
| /linux-6.6.21/Documentation/accounting/ |
| D | cgroupstats.rst | 11 and attributes specific to cgroups. It should be very easy to
|
| /linux-6.6.21/Documentation/translations/zh_CN/scheduler/ |
| D | sched-design-CFS.rst | 183 关于该文件系统的更多信息，参见Documentation/admin-guide/cgroup-v1/cgroups.rst
|