| /linux/tools/testing/selftests/bpf/progs/ |
| H A D | rbtree_fail.c | 22 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() local
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() local
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()
257 struct node_data *node_a; less__bad_fn_call_first_unlock_after() local
[all...] |
| H A D | rbtree_search.c | 31 struct node_data *node_a; in less0() local
34 node_a = rb_entry(a, struct node_data, r0); in less0()
37 return node_a->key0 < node_b->key0; in less0()
42 struct node_data *node_a; in less1() local
45 node_a = rb_entry(a, struct node_data, r1); in less1()
48 return node_a->key1 < node_b->key1; in less1()
|
| H A D | rbtree_btf_fail__add_wrong_type.c | 24 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 D | refcounted_kptr_fail.c | 25 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 D | rbtree.c | 38 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 D | usnic_uiom_interval_tree.c | 89 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/tools/perf/util/ |
| H A D | annotate-data.c | 207 static bool data_type_less(struct rb_node *node_a, const struct rb_node *node_b) in data_type_less() argument
211 a = rb_entry(node_a, struct annotated_data_type, node); in data_type_less()
642 static bool global_var_less(struct rb_node *node_a, const struct rb_node *node_b) in global_var_less() argument
646 gvar_a = rb_entry(node_a, struct global_var_entry, node); in global_var_less()
|
| /linux/kernel/sched/ |
| H A D | ext.c | 1928 static bool scx_dsq_priq_less(struct rb_node *node_a, in scx_dsq_priq_less() argument
1932 container_of(node_a, struct task_struct, scx.dsq_priq); in scx_dsq_priq_less()
|
| /linux/tools/testing/radix-tree/ |
| H A D | maple.c | 35975 struct maple_node *node_a, *node_b; compare_node() local
[all...] |