/linux/drivers/gpu/drm/ci/ |
H A D | check-patch.py | 28 ancestor = subprocess.check_output(["git", "merge-base", variable 32 ancestor = ancestor.strip() variable 35 ancestor + "..."], 41 print("\nNo commits since %s, skipping checks\n" % ancestor) 46 print("\nChecking all commits since %s...\n" % ancestor, flush=True) 51 "--git", ancestor + "..."])
|
/linux/tools/testing/selftests/bpf/progs/ |
H A D | test_cgroup1_hierarchy.c | 19 struct cgroup *cgrp, *ancestor; in bpf_link_create_verify() local 40 ancestor = bpf_cgroup_ancestor(cgrp, target_ancestor_level); in bpf_link_create_verify() 41 if (!ancestor) in bpf_link_create_verify() 44 if (ancestor->kn->id == target_ancestor_cgid) in bpf_link_create_verify() 46 bpf_cgroup_release(ancestor); in bpf_link_create_verify()
|
H A D | test_task_under_cgroup.c | 11 long bpf_task_under_cgroup(struct task_struct *task, struct cgroup *ancestor) __ksym;
|
/linux/net/netfilter/ |
H A D | xt_cgroup.c | 117 struct cgroup *ancestor = info->priv; in cgroup_mt_v1() local 123 if (ancestor) in cgroup_mt_v1() 124 return cgroup_is_descendant(sock_cgroup_ptr(skcd), ancestor) ^ in cgroup_mt_v1() 135 struct cgroup *ancestor = info->priv; in cgroup_mt_v2() local 141 if (ancestor) in cgroup_mt_v2() 142 return cgroup_is_descendant(sock_cgroup_ptr(skcd), ancestor) ^ in cgroup_mt_v2()
|
/linux/drivers/base/power/ |
H A D | qos.c | 632 struct device *ancestor = dev->parent; in dev_pm_qos_add_ancestor_request() local 637 while (ancestor && !ancestor->power.ignore_children) in dev_pm_qos_add_ancestor_request() 638 ancestor = ancestor->parent; in dev_pm_qos_add_ancestor_request() 642 while (ancestor && !ancestor->power.set_latency_tolerance) in dev_pm_qos_add_ancestor_request() 643 ancestor = ancestor->parent; in dev_pm_qos_add_ancestor_request() 647 ancestor = NULL; in dev_pm_qos_add_ancestor_request() 649 if (ancestor) in dev_pm_qos_add_ancestor_request() 650 ret = dev_pm_qos_add_request(ancestor, req, type, value); in dev_pm_qos_add_ancestor_request()
|
/linux/kernel/ |
H A D | pid_namespace.c | 376 struct pid_namespace *ancestor, *new = to_pid_ns(ns); in pidns_install() local 393 ancestor = new; in pidns_install() 394 while (ancestor->level > active->level) in pidns_install() 395 ancestor = ancestor->parent; in pidns_install() 396 if (ancestor != active) in pidns_install()
|
H A D | user_namespace.c | 876 * will be able to write fscaps that are valid in ancestor user namespaces. 1300 * @ancestor. 1302 bool in_userns(const struct user_namespace *ancestor, 1306 for (ns = child; ns->level > ancestor->level; ns = ns->parent) in in_userns() 1308 return (ns == ancestor); in in_userns() 1303 in_userns(const struct user_namespace * ancestor,const struct user_namespace * child) in_userns() argument
|
/linux/mm/ |
H A D | vmpressure.c | 159 bool ancestor, bool signalled) in vmpressure_event() argument 166 if (ancestor && ev->mode == VMPRESSURE_LOCAL) in vmpressure_event() 186 bool ancestor = false; in vmpressure_work_fn() local 212 if (vmpressure_event(vmpr, level, ancestor, signalled)) in vmpressure_work_fn() 214 ancestor = true; in vmpressure_work_fn()
|
/linux/fs/bcachefs/ |
H A D | snapshot.c | 94 static bool __bch2_snapshot_is_ancestor_early(struct snapshot_table *t, u32 id, u32 ancestor) in __bch2_snapshot_is_ancestor_early() argument 96 while (id && id < ancestor) { in __bch2_snapshot_is_ancestor_early() 100 return id == ancestor; in __bch2_snapshot_is_ancestor_early() 103 static bool bch2_snapshot_is_ancestor_early(struct bch_fs *c, u32 id, u32 ancestor) in bch2_snapshot_is_ancestor_early() argument 106 bool ret = __bch2_snapshot_is_ancestor_early(rcu_dereference(c->snapshots), id, ancestor); in bch2_snapshot_is_ancestor_early() 112 static inline u32 get_ancestor_below(struct snapshot_table *t, u32 id, u32 ancestor) in get_ancestor_below() argument 118 if (s->skip[2] <= ancestor) in get_ancestor_below() 120 if (s->skip[1] <= ancestor) in get_ancestor_below() 122 if (s->skip[0] <= ancestor) in get_ancestor_below() 127 static bool test_ancestor_bitmap(struct snapshot_table *t, u32 id, u32 ancestor) in test_ancestor_bitmap() argument [all …]
|
H A D | snapshot.h | 169 static inline bool bch2_snapshot_is_ancestor(struct bch_fs *c, u32 id, u32 ancestor) in bch2_snapshot_is_ancestor() argument 171 return id == ancestor in bch2_snapshot_is_ancestor() 173 : __bch2_snapshot_is_ancestor(c, id, ancestor); in bch2_snapshot_is_ancestor()
|
H A D | fsck.c | 554 u32 id, u32 ancestor) in key_visible_in_snapshot() argument 558 EBUG_ON(id > ancestor); in key_visible_in_snapshot() 561 EBUG_ON(ancestor != seen->pos.snapshot); in key_visible_in_snapshot() 562 EBUG_ON(ancestor != darray_last(seen->ids)); in key_visible_in_snapshot() 564 if (id == ancestor) in key_visible_in_snapshot() 567 if (!bch2_snapshot_is_ancestor(c, id, ancestor)) in key_visible_in_snapshot()
|
/linux/Documentation/filesystems/ |
H A D | directory-locking.rst | 56 * if the parents don't have a common ancestor, fail the operation. 58 ancestor of the other, lock the parent of source first. 95 First of all, we verify that it is *not* an ancestor of our directory 106 if two dentries have been found to have a common ancestor after taking 111 parents have a common ancestor. 133 If no directory is its own ancestor, the scheme above is deadlock-free. 210 a common ancestor, which guarantees that ancestry relationships between 218 It can't be the parents - indeed, since D1 is an ancestor of Dn, 239 Note that the check for having a common ancestor in cross-directory 243 an unrelated lookup splice a distant ancestor of source to some distant [all …]
|
/linux/fs/overlayfs/ |
H A D | export.c | 491 struct dentry *ancestor = ERR_PTR(-EIO); in ovl_lookup_real_ancestor() local 505 ancestor = ovl_lookup_real_inode(sb, next, layer); in ovl_lookup_real_ancestor() 506 if (ancestor) in ovl_lookup_real_ancestor() 510 ancestor = dget(sb->s_root); in ovl_lookup_real_ancestor() 520 ancestor = ERR_PTR(-EXDEV); in ovl_lookup_real_ancestor() 531 return ancestor; in ovl_lookup_real_ancestor()
|
/linux/tools/testing/selftests/cgroup/ |
H A D | test_cpu.c | 443 const char *ancestor; in run_cpucg_nested_weight_test() 447 ancestor = parent; in run_cpucg_nested_weight_test() 450 ancestor = child; in run_cpucg_nested_weight_test() 453 leaf[i].cgroup = cg_name_indexed(ancestor, "cpucg_leaf", i); in run_cpucg_nested_weight_test() 441 const char *ancestor; run_cpucg_nested_weight_test() local
|
/linux/include/linux/ |
H A D | user_namespace.h | 188 extern bool in_userns(const struct user_namespace *ancestor, 221 static inline bool in_userns(const struct user_namespace *ancestor, in in_userns() argument
|
/linux/drivers/gpu/drm/amd/amdgpu/ |
H A D | amdgpu_vm_pt.c | 365 struct amdgpu_bo *ancestor = &vmbo->bo; in amdgpu_vm_pt_clear() local 372 if (ancestor->parent) { in amdgpu_vm_pt_clear() 374 while (ancestor->parent->parent) { in amdgpu_vm_pt_clear() 376 ancestor = ancestor->parent; in amdgpu_vm_pt_clear()
|
/linux/kernel/bpf/ |
H A D | helpers.c | 425 struct cgroup *ancestor; in BPF_CALL_1() 430 ancestor = cgroup_ancestor(cgrp, ancestor_level); in BPF_CALL_1() 431 cgrp_id = ancestor ? cgroup_id(ancestor) : 0; in BPF_CALL_1() 2405 * bpf_cgroup_ancestor - Perform a lookup on an entry in a cgroup's ancestor 2409 * @level: The level of ancestor to look up. in bpf_cgroup_ancestor() 2413 struct cgroup *ancestor; in bpf_cgroup_ancestor() 2419 ancestor = cgrp->ancestors[level]; in bpf_cgroup_ancestor() 2420 if (!cgroup_tryget(ancestor)) in bpf_cgroup_ancestor() 2422 return ancestor; 424 struct cgroup *ancestor; BPF_CALL_1() local 2411 struct cgroup *ancestor; bpf_cgroup_ancestor() local 2450 bpf_task_under_cgroup(struct task_struct * task,struct cgroup * ancestor) bpf_task_under_cgroup() argument [all...] |
/linux/scripts/ |
H A D | check-uapi.sh | 27 will use BASE_REF^1. Must be an ancestor of BASE_REF. Only headers 463 if ! git merge-base --is-ancestor "$past_ref" "$base_ref" > /dev/null 2>&1; then
|
/linux/drivers/hv/ |
H A D | vmbus_drv.c | 2282 struct acpi_device *ancestor; in vmbus_acpi_add() local 2311 for (ancestor = acpi_dev_parent(device); in vmbus_acpi_add() 2312 ancestor && ancestor->handle != ACPI_ROOT_OBJECT; in vmbus_acpi_add() 2313 ancestor = acpi_dev_parent(ancestor)) { in vmbus_acpi_add() 2314 result = acpi_walk_resources(ancestor->handle, METHOD_NAME__CRS, in vmbus_acpi_add()
|
/linux/Documentation/arch/arm64/ |
H A D | asymmetric-32bit.rst | 83 ancestor is found containing at least one 32-bit-capable CPU. The
|
/linux/Documentation/admin-guide/ |
H A D | cgroup-v2.rst | 322 of a threaded subtree, that is, the nearest ancestor which is not 570 common ancestor of the source and destination cgroups. 587 file; however, the common ancestor of the source cgroup C10 and the 886 common ancestor of the source and destination cgroups. 915 common ancestor of the source and destination cgroups. 1007 of any ancestor cgroups. If any of ancestor cgroups is frozen, the 1247 all ancestor cgroups. If there is memory.min overcommitment 1273 all ancestor cgroups. If there is memory.low overcommitment 1371 memory.oom.group values of ancestor cgroups. 2313 setting as the nearest cgroup ancestor with a non-empty [all …]
|
/linux/Documentation/power/ |
H A D | pm_qos_interface.rst | 141 Add a PM QoS request for the first direct ancestor of the given device whose
|
/linux/lib/ |
H A D | maple_tree.c | 3124 struct maple_enode *ancestor; in mas_split_final_node() local 3137 ancestor = mas_new_ma_node(mas, mast->bn); in mas_split_final_node() 3138 mas_set_parent(mas, mast->l->node, ancestor, mast->l->offset); in mas_split_final_node() 3139 mas_set_parent(mas, mast->r->node, ancestor, mast->r->offset); in mas_split_final_node() 3140 mte_to_node(ancestor)->parent = mas_mn(mas)->parent; in mas_split_final_node() 3142 mast->l->node = ancestor; in mas_split_final_node()
|
/linux/Documentation/firmware-guide/acpi/ |
H A D | enumeration.rst | 569 configuration information to the driver of the composite ancestor device. 573 the _DSD of the device object itself or the _DSD of its ancestor in the
|
/linux/include/net/ |
H A D | sock.h | 1378 struct cgroup *ancestor) in sk_under_cgroup_hierarchy() argument 1382 ancestor); in sk_under_cgroup_hierarchy()
|