Home
last modified time | relevance | path

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

/linux/tools/testing/selftests/bpf/progs/
H A Drbtree_fail.c22 struct node_data *node_a; in less() local
25 node_a = container_of(a, struct node_data, node); in less()
28 return node_a->key < node_b->key; in less()
233 struct node_data *node_a; in less__bad_fn_call_add()
236 node_a = container_of(a, struct node_data, node); in less__bad_fn_call_add()
238 bpf_rbtree_add(&groot, &node_a->node, less); in less__bad_fn_call_add()
240 return node_a->key < node_b->key; in less__bad_fn_call_add()
245 struct node_data *node_a; in less__bad_fn_call_remove()
248 node_a = container_of(a, struct node_data, node); in less__bad_fn_call_remove()
250 bpf_rbtree_remove(&groot, &node_a in less__bad_fn_call_remove()
232 struct node_data *node_a; less__bad_fn_call_add() local
244 struct node_data *node_a; less__bad_fn_call_remove() local
256 struct node_data *node_a; less__bad_fn_call_first_unlock_after() local
[all...]
H A Drbtree_btf_fail__add_wrong_type.c24 struct node_data2 *node_a; in less2() local
27 node_a = container_of(a, struct node_data2, node); in less2()
30 return node_a->key < node_b->key; in less2()
H A Drefcounted_kptr_fail.c25 struct node_acquire *node_a; in less() local
28 node_a = container_of(a, struct node_acquire, node); in less()
31 return node_a->key < node_b->key; in less()
H A Dlocal_kptr_stash.c80 struct node_data *node_a; in less() local
83 node_a = container_of(a, struct node_data, node); in less()
86 return node_a->key < node_b->key; in less()
H A Drefcounted_kptr.c51 static bool less(struct bpf_rb_node *node_a, const struct bpf_rb_node *node_b) in less() argument
56 a = container_of(node_a, struct node_data, r); in less()
64 struct node_acquire *node_a; in less_a() local
67 node_a = container_of(a, struct node_acquire, node); in less_a()
70 return node_a->key < node_b->key; in less_a()
H A Drbtree.c38 struct node_data *node_a; in less() local
41 node_a = container_of(a, struct node_data, node); in less()
45 return node_a->key < node_b->key; in less()
/linux/drivers/infiniband/hw/usnic/
H A Dusnic_uiom_interval_tree.c89 struct usnic_uiom_interval_node *node_a, *node_b; in interval_cmp() local
91 node_a = list_entry(a, 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/drivers/tty/serial/
H A 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()
1565 node_a = of_node_get(np); in pmz_probe()
1569 if (!node_a && !node_b) { in pmz_probe()
1570 of_node_put(node_a); in pmz_probe()
1573 (!node_a) ? 'a' : 'b', node_p); in pmz_probe()
1585 pmz_ports[count].node = node_a; in pmz_probe()
1597 of_node_put(node_a); in pmz_probe()
/linux/tools/perf/util/
H A Dannotate-data.c211 static bool data_type_less(struct rb_node *node_a, const struct rb_node *node_b) in data_type_less() argument
215 a = rb_entry(node_a, struct annotated_data_type, node); in data_type_less()
657 static bool global_var_less(struct rb_node *node_a, const struct rb_node *node_b) in global_var_less() argument
661 gvar_a = rb_entry(node_a, struct global_var_entry, node); in global_var_less()
/linux/drivers/gpu/drm/amd/amdkfd/
H A Dkfd_svm.c1203 svm_nodes_in_same_hive(struct kfd_node *node_a, struct kfd_node *node_b) in svm_nodes_in_same_hive() argument
1205 return (node_a->adev == node_b->adev || in svm_nodes_in_same_hive()
1206 amdgpu_xgmi_same_hive(node_a->adev, node_b->adev)); in svm_nodes_in_same_hive()
/linux/kernel/sched/
H A Dext.c962 static bool scx_dsq_priq_less(struct rb_node *node_a, in scx_dsq_priq_less() argument
966 container_of(node_a, struct task_struct, scx.dsq_priq); in scx_dsq_priq_less()
/linux/tools/testing/radix-tree/
H A Dmaple.c35536 struct maple_node *node_a, *node_b; in compare_node() local
35549 node_a = mte_to_node(enode_a); in compare_node()
35551 a = *node_a; in compare_node()
35555 if (ma_is_root(node_a) || ma_is_root(node_b)) { in compare_node()