Lines Matching refs:list
37 #include <linux/list.h>
78 * css_set_rwsem protects task->cgroups pointer, the list of css_set
161 /* The list of hierarchy roots */
172 * Also, as csses are always appended to the parent's ->children list, it
174 * number order on the list. Protected by cgroup_mutex.
403 /* list of cgrp_cset_links anchored at cgrp->cset_links */
406 /* list of cgrp_cset_links anchored at css_set->cgrp_links */
413 * for each subsystem. Also used to anchor the list of css_sets. Not
727 * Always add links to the tail of the list so that the list
954 * is zero, and its list of 'children' cgroups is empty. Since all
1506 * each css_set to its tasks until we see the list actually used - in other
1536 * it will race with cgroup_exit() in that the list
1701 * The first time anyone tries to mount a cgroup, enable the list
1922 /* the src and dst cset list running through cset->mg_node */
2020 * tset's dst_csets list.
2034 * @preloaded_csets: list of preloaded css_sets
2059 * @preloaded_csets: list of preloaded css_sets
2096 * @preloaded_csets: list of preloaded source css_sets
2704 * Parse input - space separated list of subsystem names prefixed
3363 * @pos could already have been unlinked from the sibling list.
3366 * @pos is taken off list, at which time its next pointer is valid,
3377 * sibling list, the next one can be found by walking the parent's
3758 * A pidlist is a list of pids that virtually represents the contents of one
3759 * of the cgroup files ("procs" or "tasks"). We keep a list of such pidlists,
3766 * this particular list stays in the list.
3770 pid_t *list;
3771 /* how many elements the above list has */
3773 /* each of these stored in a list by its cgroup */
3775 /* pointer to the cgroup we belong to, for list removal purposes */
3835 pidlist_free(l->list);
3845 * pidlist_uniq - given a kmalloc()ed list, strip out all duplicate entries
3848 static int pidlist_uniq(pid_t *list, int length)
3858 /* src and dest walk down the list; dest counts unique elements */
3861 while (list[src] == list[src-1]) {
3867 list[dest] = list[src];
3877 * different per namespace, each namespace needs differently sorted list,
4019 pidlist_free(l->list);
4020 l->list = array;
4094 * in the cgroup->l->list array.
4140 if (cgroup_pid_fry(cgrp, l->list[mid]) == pid) {
4143 } else if (cgroup_pid_fry(cgrp, l->list[mid]) <= pid)
4153 iter = l->list + index;
4174 pid_t *end = l->list + l->length;
5171 * cgroup_post_fork - called on a new task after adding it to the task list
5174 * Adds the task to the list running through its css_set if necessary and
5176 * visible on the task list in case we race with the first call to
5178 * list.