Lines Matching refs:n
77 struct node_data *n, *m; in __insert_in_tree_and_list() local
79 n = bpf_obj_new(typeof(*n)); in __insert_in_tree_and_list()
80 if (!n) in __insert_in_tree_and_list()
83 m = bpf_refcount_acquire(n); in __insert_in_tree_and_list()
88 if (bpf_rbtree_add(root, &n->r, less)) { in __insert_in_tree_and_list()
110 struct node_data *n, *m; in __stash_map_insert_tree() local
116 n = bpf_obj_new(typeof(*n)); in __stash_map_insert_tree()
117 if (!n) in __stash_map_insert_tree()
120 n->key = val; in __stash_map_insert_tree()
121 m = bpf_refcount_acquire(n); in __stash_map_insert_tree()
123 n = bpf_kptr_xchg(&mapval->node, n); in __stash_map_insert_tree()
124 if (n) { in __stash_map_insert_tree()
125 bpf_obj_drop(n); in __stash_map_insert_tree()
145 struct node_data *n; in __read_from_tree() local
156 n = container_of(rb, struct node_data, r); in __read_from_tree()
157 res = n->key; in __read_from_tree()
168 n = container_of(rb, struct node_data, r); in __read_from_tree()
169 bpf_obj_drop(n); in __read_from_tree()
178 struct node_data *n; in __read_from_list() local
189 n = container_of(l, struct node_data, l); in __read_from_list()
190 res = n->list_data; in __read_from_list()
193 if (bpf_list_push_back(head, &n->l)) { in __read_from_list()
202 bpf_obj_drop(n); in __read_from_list()
208 struct node_data *n = NULL; in __read_from_unstash() local
216 n = bpf_kptr_xchg(&mapval->node, n); in __read_from_unstash()
217 if (!n) in __read_from_unstash()
220 val = n->key; in __read_from_unstash()
221 bpf_obj_drop(n); in __read_from_unstash()
374 struct node_acquire *n, *m; in rbtree_refcounted_node_ref_escapes() local
376 n = bpf_obj_new(typeof(*n)); in rbtree_refcounted_node_ref_escapes()
377 if (!n) in rbtree_refcounted_node_ref_escapes()
381 bpf_rbtree_add(&aroot, &n->node, less_a); in rbtree_refcounted_node_ref_escapes()
382 m = bpf_refcount_acquire(n); in rbtree_refcounted_node_ref_escapes()
396 struct node_acquire *n, *m; in rbtree_refcounted_node_ref_escapes_owning_input() local
398 n = bpf_obj_new(typeof(*n)); in rbtree_refcounted_node_ref_escapes_owning_input()
399 if (!n) in rbtree_refcounted_node_ref_escapes_owning_input()
402 m = bpf_refcount_acquire(n); in rbtree_refcounted_node_ref_escapes_owning_input()
406 bpf_rbtree_add(&aroot, &n->node, less_a); in rbtree_refcounted_node_ref_escapes_owning_input()
414 static long __stash_map_empty_xchg(struct node_data *n, int idx) in __stash_map_empty_xchg() argument
419 bpf_obj_drop(n); in __stash_map_empty_xchg()
422 n = bpf_kptr_xchg(&mapval->node, n); in __stash_map_empty_xchg()
423 if (n) { in __stash_map_empty_xchg()
424 bpf_obj_drop(n); in __stash_map_empty_xchg()
433 struct node_data *n, *m; in rbtree_wrong_owner_remove_fail_a1() local
435 n = bpf_obj_new(typeof(*n)); in rbtree_wrong_owner_remove_fail_a1()
436 if (!n) in rbtree_wrong_owner_remove_fail_a1()
438 m = bpf_refcount_acquire(n); in rbtree_wrong_owner_remove_fail_a1()
440 if (__stash_map_empty_xchg(n, 0)) { in rbtree_wrong_owner_remove_fail_a1()
455 struct node_data *n; in rbtree_wrong_owner_remove_fail_b() local
462 n = bpf_kptr_xchg(&mapval->node, NULL); in rbtree_wrong_owner_remove_fail_b()
463 if (!n) in rbtree_wrong_owner_remove_fail_b()
468 bpf_rbtree_add(&broot, &n->r, less); in rbtree_wrong_owner_remove_fail_b()
510 struct node_data *n, *m = NULL; in BPF_PROG() local
512 n = bpf_obj_new(typeof(*n)); in BPF_PROG()
513 if (!n) in BPF_PROG()
518 bpf_rbtree_add(&root, &n->r, less); in BPF_PROG()
544 struct node_data *n, *m = NULL; in BPF_PROG() local
546 n = bpf_obj_new(typeof(*n)); in BPF_PROG()
547 if (!n) in BPF_PROG()
552 bpf_rbtree_add(&root, &n->r, less); in BPF_PROG()