Home
last modified time | relevance | path

Searched refs:ancestors (Results 1 – 12 of 12) sorted by relevance

/linux/tools/perf/util/bpf_skel/
H A Dbperf_cgroup.bpf.c47 struct cgroup *ancestors[]; member
68 if (bpf_core_field_exists(cgrp_new->ancestors)) { in get_cgroup_v1_ancestor_id()
69 return BPF_CORE_READ(cgrp_new, ancestors[level], kn, id); in get_cgroup_v1_ancestor_id()
/linux/block/
H A Dblk-iocost.c550 struct ioc_gq *ancestors[]; member
1099 struct ioc_gq *parent = iocg->ancestors[lvl]; in __propagate_weights()
1100 struct ioc_gq *child = iocg->ancestors[lvl + 1]; in __propagate_weights()
1179 struct ioc_gq *parent = iocg->ancestors[lvl]; in current_hweight()
1180 struct ioc_gq *child = iocg->ancestors[lvl + 1]; in current_hweight()
1221 struct ioc_gq *parent = iocg->ancestors[lvl]; in current_hweight_max()
1222 struct ioc_gq *child = iocg->ancestors[lvl + 1]; in current_hweight_max()
1284 if (!list_empty(&iocg->ancestors[i]->active_list)) in iocg_activate()
1660 if (!list_empty(&iocg->ancestors[lvl]->walk_list)) in iocg_build_inner_walk()
1666 struct ioc_gq *inner = iocg->ancestors[lvl]; in iocg_build_inner_walk()
[all …]
/linux/Documentation/filesystems/
H A Ddirectory-locking.rst57 * lock the parents in "ancestors first" order (exclusive). If neither is an
261 been ancestors of each other. Therefore the chain of ancestors starting
263 vice versa. On the other hand, the chain of ancestors of any node could
267 chains of ancestors of (ex-)parents of source and target. In particular,
273 ancestors of that parent. But as we have just shown, that chain must
/linux/Documentation/admin-guide/cgroup-v1/
H A Dpids.rst40 self or ancestors.
/linux/include/linux/
H A Dcgroup-defs.h645 DECLARE_FLEX_ARRAY(struct cgroup *, ancestors);
/linux/kernel/sched/ext/
H A Dinternal.h1644 struct scx_sched *ancestors[]; member
2447 return sch->ancestors[sch->level - 1]; in scx_parent()
H A Dext.c302 return sch->ancestors[ancestor->level] == ancestor; in scx_is_descendant()
3493 struct scx_sched *anc = sch_a->ancestors[level]; in scx_prio_less()
3495 if (anc == sch_b->ancestors[level] && in scx_prio_less()
7134 sch = kzalloc_flex(*sch, ancestors, level + 1); in scx_alloc_and_add_sched()
7209 memcpy(sch->ancestors, parent->ancestors, in scx_alloc_and_add_sched()
7210 level * sizeof(parent->ancestors[0])); in scx_alloc_and_add_sched()
7211 sch->ancestors[level] = sch; in scx_alloc_and_add_sched()
7425 !(sch->ancestors[0]->ops.flags & SCX_OPS_TID_TO_TASK)) { in scx_validate_ops()
H A Dsub.c937 scx_kick_cpu(sch->ancestors[0], cpu, 0); in queue_sync_ecaps()
/linux/Documentation/driver-api/
H A Ddevice_link.rst224 all its ancestors. That is achieved by traversing the ACPI namespace
/linux/kernel/cgroup/
H A Dcgroup.c2195 root_cgrp->ancestors[0] = root_cgrp; in cgroup_setup_root()
6011 cgrp->ancestors[tcgrp->level] = tcgrp; in cgroup_create()
6049 tcgrp = cgrp->ancestors[i]; in cgroup_create()
/linux/Documentation/admin-guide/
H A Dcgroup-v2.rst707 as long as the usages of all its ancestors are under their
1075 and doesn't need pass enablement via ancestors from root.
1981 When the reclaim targets ancestors of A, the effective protection of B is
1983 ancestors between A and the target).
2704 partition. All the ancestors of a remote partition root except
/linux/kernel/bpf/
H A Dhelpers.c2897 ancestor = cgrp->ancestors[level]; in bpf_cgroup_ancestor()