Home
last modified time | relevance | path

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

/linux-6.12.1/tools/testing/selftests/bpf/progs/
Drbtree_fail.c23 struct node_data *node_b; in less() local
26 node_b = container_of(b, struct node_data, node); in less()
28 return node_a->key < node_b->key; in less()
233 struct node_data *node_b; in less__bad_fn_call_add() local
236 node_b = container_of(b, struct node_data, node); in less__bad_fn_call_add()
239 return node_a->key < node_b->key; in less__bad_fn_call_add()
245 struct node_data *node_b; in less__bad_fn_call_remove() local
248 node_b = container_of(b, struct node_data, node); in less__bad_fn_call_remove()
251 return node_a->key < node_b->key; in less__bad_fn_call_remove()
257 struct node_data *node_b; in less__bad_fn_call_first_unlock_after() local
[all …]
Drbtree_btf_fail__add_wrong_type.c25 struct node_data2 *node_b; in less2() local
28 node_b = container_of(b, struct node_data2, node); in less2()
30 return node_a->key < node_b->key; in less2()
Drefcounted_kptr_fail.c26 struct node_acquire *node_b; in less() local
29 node_b = container_of(b, struct node_acquire, node); in less()
31 return node_a->key < node_b->key; in less()
Dlocal_kptr_stash.c81 struct node_data *node_b; in less() local
84 node_b = container_of(b, struct node_data, node); in less()
86 return node_a->key < node_b->key; in less()
Drefcounted_kptr.c51 static bool less(struct bpf_rb_node *node_a, const struct bpf_rb_node *node_b) in less() argument
57 b = container_of(node_b, struct node_data, r); in less()
65 struct node_acquire *node_b; in less_a() local
68 node_b = container_of(b, struct node_acquire, node); in less_a()
70 return node_a->key < node_b->key; in less_a()
Drbtree.c39 struct node_data *node_b; in less() local
42 node_b = container_of(b, struct node_data, node); in less()
45 return node_a->key < node_b->key; in less()
/linux-6.12.1/drivers/infiniband/hw/usnic/
Dusnic_uiom_interval_tree.c89 struct usnic_uiom_interval_node *node_a, *node_b; in interval_cmp() local
92 node_b = list_entry(b, struct usnic_uiom_interval_node, link); in interval_cmp()
95 if (node_a->start < node_b->start) in interval_cmp()
97 else if (node_a->start > node_b->start) in interval_cmp()
/linux-6.12.1/drivers/tty/serial/
Dpmac_zilog.c1549 struct device_node *node_p, *node_a, *node_b, *np; in pmz_probe() local
1562 node_a = node_b = NULL; in pmz_probe()
1567 node_b = of_node_get(np); in pmz_probe()
1569 if (!node_a && !node_b) { in pmz_probe()
1571 of_node_put(node_b); in pmz_probe()
1580 if (node_b != NULL) { in pmz_probe()
1586 pmz_ports[count+1].node = node_b; in pmz_probe()
1594 if (rc == 0 && node_b != NULL) in pmz_probe()
1598 of_node_put(node_b); in pmz_probe()
/linux-6.12.1/tools/perf/util/
Dannotate-data.c207 static bool data_type_less(struct rb_node *node_a, const struct rb_node *node_b) in data_type_less() argument
212 b = rb_entry(node_b, struct annotated_data_type, node); in data_type_less()
608 static bool global_var_less(struct rb_node *node_a, const struct rb_node *node_b) in global_var_less() argument
613 gvar_b = rb_entry(node_b, struct global_var_entry, node); in global_var_less()
/linux-6.12.1/drivers/gpu/drm/amd/amdkfd/
Dkfd_svm.c1185 svm_nodes_in_same_hive(struct kfd_node *node_a, struct kfd_node *node_b) in svm_nodes_in_same_hive() argument
1187 return (node_a->adev == node_b->adev || in svm_nodes_in_same_hive()
1188 amdgpu_xgmi_same_hive(node_a->adev, node_b->adev)); in svm_nodes_in_same_hive()
/linux-6.12.1/kernel/sched/
Dext.c1655 const struct rb_node *node_b) in scx_dsq_priq_less() argument
1660 container_of(node_b, struct task_struct, scx.dsq_priq); in scx_dsq_priq_less()
/linux-6.12.1/tools/testing/radix-tree/
Dmaple.c35877 struct maple_node *node_a, *node_b; in compare_node() local
35891 node_b = mte_to_node(enode_b); in compare_node()
35893 b = *node_b; in compare_node()
35896 if (ma_is_root(node_a) || ma_is_root(node_b)) { in compare_node()