Lines Matching refs:node
13 struct bpf_rb_node node; member
18 struct bpf_rb_root root __contains(node_data, node);
31 private(A) struct bpf_rb_root groot __contains(node_data, node);
32 private(A) struct bpf_rb_root groot_array[2] __contains(node_data, node);
33 private(A) struct bpf_rb_root groot_array_one[1] __contains(node_data, node);
41 node_a = container_of(a, struct node_data, node); in less()
42 node_b = container_of(b, struct node_data, node); in less()
65 bpf_rbtree_add(root, &n->node, less); in __add_three()
66 bpf_rbtree_add(root, &m->node, less); in __add_three()
75 bpf_rbtree_add(root, &n->node, less); in __add_three()
109 bpf_rbtree_add(&groot, &n->node, less); in rbtree_add_and_remove()
110 bpf_rbtree_add(&groot, &m->node, less); in rbtree_add_and_remove()
111 res = bpf_rbtree_remove(&groot, &n->node); in rbtree_add_and_remove()
117 n = container_of(res, struct node_data, node); in rbtree_add_and_remove()
151 bpf_rbtree_add(&groot_array[i], &nodes[i][j]->node, less); in rbtree_add_and_remove_array()
153 bpf_rbtree_add(&groot_array_one[0], &nodes[2][j]->node, less); in rbtree_add_and_remove_array()
154 res1 = bpf_rbtree_remove(&groot_array[0], &nodes[0][0]->node); in rbtree_add_and_remove_array()
155 res2 = bpf_rbtree_remove(&groot_array[1], &nodes[1][0]->node); in rbtree_add_and_remove_array()
156 res3 = bpf_rbtree_remove(&groot_array_one[0], &nodes[2][0]->node); in rbtree_add_and_remove_array()
160 n = container_of(res1, struct node_data, node); in rbtree_add_and_remove_array()
165 n = container_of(res2, struct node_data, node); in rbtree_add_and_remove_array()
170 n = container_of(res3, struct node_data, node); in rbtree_add_and_remove_array()
214 bpf_rbtree_add(&groot, &n->node, less); in rbtree_first_and_remove()
215 bpf_rbtree_add(&groot, &m->node, less); in rbtree_first_and_remove()
216 bpf_rbtree_add(&groot, &o->node, less); in rbtree_first_and_remove()
224 o = container_of(res, struct node_data, node); in rbtree_first_and_remove()
227 res = bpf_rbtree_remove(&groot, &o->node); in rbtree_first_and_remove()
233 o = container_of(res, struct node_data, node); in rbtree_first_and_remove()
244 o = container_of(res, struct node_data, node); in rbtree_first_and_remove()
270 bpf_rbtree_add(&groot, &n->node, less); in rbtree_api_release_aliasing()
281 o = container_of(res, struct node_data, node); in rbtree_api_release_aliasing()
286 m = container_of(res, struct node_data, node); in rbtree_api_release_aliasing()
288 res = bpf_rbtree_remove(&groot, &m->node); in rbtree_api_release_aliasing()
299 res2 = bpf_rbtree_remove(&groot, &o->node); in rbtree_api_release_aliasing()
304 o = container_of(res, struct node_data, node); in rbtree_api_release_aliasing()
312 m = container_of(res2, struct node_data, node); in rbtree_api_release_aliasing()