Searched refs:ancestors (Results 1 – 6 of 6) sorted by relevance
| /linux/tools/perf/util/bpf_skel/ |
| H A D | bperf_cgroup.bpf.c | 47 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/drivers/android/binder/ |
| H A D | thread.rs | 52 ancestors: KVec<usize>, field
154 .ancestors in validate_parent_fixup()
159 let sg_idx = self.ancestors[ancestors_i]; in validate_parent_fixup()
750 sg_state.ancestors.clear(); in translate_object()
751 sg_state.ancestors.push(sg_state_idx, GFP_KERNEL)?; in translate_object()
765 sg_state.ancestors.truncate(info.num_ancestors); in translate_object()
766 sg_state.ancestors.push(sg_state_idx, GFP_KERNEL)?; in translate_object()
813 sg_state.ancestors.truncate(info.num_ancestors); in translate_object()
1030 ancestors: KVec::new(), in copy_transaction_data()
|
| /linux/Documentation/filesystems/ |
| H A D | directory-locking.rst | 57 * 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 D | pids.rst | 40 self or ancestors.
|
| H A D | cpusets.rst | 137 cpuset (except direct ancestors and descendants) may contain
|
| /linux/Documentation/driver-api/ |
| H A D | device_link.rst | 224 all its ancestors. That is achieved by traversing the ACPI namespace
|