Lines Matching refs:node
12 struct bpf_rb_node node; member
17 private(A) struct bpf_rb_root groot __contains(node_data, node);
18 private(A) struct bpf_rb_root groot2 __contains(node_data, node);
25 node_a = container_of(a, struct node_data, node); in less()
26 node_b = container_of(b, struct node_data, node); in less()
41 bpf_rbtree_add(&groot, &n->node, less); in rbtree_api_nolock_add()
56 bpf_rbtree_add(&groot, &n->node, less); in rbtree_api_nolock_remove()
59 bpf_rbtree_remove(&groot, &n->node); in rbtree_api_nolock_remove()
89 bpf_rbtree_add(&groot, &n->node, less); in rbtree_api_remove_unadded_node()
92 res = bpf_rbtree_remove(&groot, &n->node); in rbtree_api_remove_unadded_node()
93 n = container_of(res, struct node_data, node); in rbtree_api_remove_unadded_node()
96 res = bpf_rbtree_remove(&groot, &m->node); in rbtree_api_remove_unadded_node()
97 m = container_of(res, struct node_data, node); in rbtree_api_remove_unadded_node()
122 n = container_of(res, struct node_data, node); in rbtree_api_remove_no_drop()
146 bpf_rbtree_add(&groot, &n->node, less); in rbtree_api_add_to_multiple_trees()
149 bpf_rbtree_add(&groot2, &n->node, less); in rbtree_api_add_to_multiple_trees()
191 bpf_rbtree_add(&groot, &n->node, less); in rbtree_api_add_release_unlock_escape()
199 bpf_rbtree_remove(&groot, &n->node); in rbtree_api_add_release_unlock_escape()
217 n = container_of(res, struct node_data, node); in rbtree_api_first_release_unlock_escape()
225 bpf_rbtree_remove(&groot, &n->node); in rbtree_api_first_release_unlock_escape()
235 node_a = container_of(a, struct node_data, node); in less__bad_fn_call_add()
236 node_b = container_of(b, struct node_data, node); in less__bad_fn_call_add()
237 bpf_rbtree_add(&groot, &node_a->node, less); in less__bad_fn_call_add()
247 node_a = container_of(a, struct node_data, node); in less__bad_fn_call_remove()
248 node_b = container_of(b, struct node_data, node); in less__bad_fn_call_remove()
249 bpf_rbtree_remove(&groot, &node_a->node); in less__bad_fn_call_remove()
259 node_a = container_of(a, struct node_data, node); in less__bad_fn_call_first_unlock_after()
260 node_b = container_of(b, struct node_data, node); in less__bad_fn_call_first_unlock_after()
277 bpf_rbtree_add(&groot, &n->node, cb); in add_with_cb()