Searched refs:node_a (Results 1 – 9 of 9) sorted by relevance
| /tools/testing/selftests/bpf/progs/ |
| 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
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
250 bpf_rbtree_remove(&groot, &node_a->node); in less__bad_fn_call_remove()
252 return node_a->key < node_b->key; in less__bad_fn_call_remove()
257 struct node_data *node_a; in less__bad_fn_call_first_unlock_after() local
[all …]
|
| 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()
|
| 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()
|
| 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()
|
| A D | local_kptr_stash.c | 80 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()
|
| A D | refcounted_kptr.c | 51 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()
|
| 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()
|
| /tools/perf/util/ |
| 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()
|
| /tools/testing/radix-tree/ |
| A D | maple.c | 35975 struct maple_node *node_a, *node_b; in compare_node() local
35988 node_a = mte_to_node(enode_a); in compare_node()
35990 a = *node_a; in compare_node()
35994 if (ma_is_root(node_a) || ma_is_root(node_b)) { in compare_node()
|
Completed in 47 milliseconds