10 struct node_data {  struct
18 	struct bpf_rb_root root __contains(node_data, node);  argument
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);
38 	struct node_data *node_a;  in less()
39 	struct node_data *node_b;  in less()
41 	node_a = container_of(a, struct node_data, node);  in less()
42 	node_b = container_of(b, struct node_data, node);  in less()
50 	struct node_data *n, *m;  in __add_three()
96 	struct node_data *n, *m = NULL;  in rbtree_add_and_remove()
117 	n = container_of(res, struct node_data, node);  in rbtree_add_and_remove()
134 	struct node_data *nodes[3][2] = {{NULL, NULL}, {NULL, NULL}, {NULL, NULL}};  in rbtree_add_and_remove_array()
135 	struct node_data *n;  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()
193 	struct node_data *n, *m, *o;  in rbtree_first_and_remove()
224 	o = container_of(res, struct node_data, 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()
260 	struct node_data *n, *m, *o;  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()
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()