Lines Matching refs:n
38 struct node_acquire *n, *m; in rbtree_refcounted_node_ref_escapes() local
40 n = bpf_obj_new(typeof(*n)); in rbtree_refcounted_node_ref_escapes()
41 if (!n) in rbtree_refcounted_node_ref_escapes()
45 bpf_rbtree_add(&groot, &n->node, less); in rbtree_refcounted_node_ref_escapes()
47 m = bpf_refcount_acquire(n); in rbtree_refcounted_node_ref_escapes()
60 struct node_acquire *n, *m; in refcount_acquire_maybe_null() local
62 n = bpf_obj_new(typeof(*n)); in refcount_acquire_maybe_null()
66 m = bpf_refcount_acquire(n); in refcount_acquire_maybe_null()
69 if (n) in refcount_acquire_maybe_null()
70 bpf_obj_drop(n); in refcount_acquire_maybe_null()
79 struct node_acquire *n, *m; in rbtree_refcounted_node_ref_escapes_owning_input() local
81 n = bpf_obj_new(typeof(*n)); in rbtree_refcounted_node_ref_escapes_owning_input()
82 if (!n) in rbtree_refcounted_node_ref_escapes_owning_input()
86 m = bpf_refcount_acquire(n); in rbtree_refcounted_node_ref_escapes_owning_input()
90 bpf_rbtree_add(&groot, &n->node, less); in rbtree_refcounted_node_ref_escapes_owning_input()
102 struct node_acquire *n; in BPF_PROG() local
104 n = bpf_obj_new(typeof(*n)); in BPF_PROG()
105 if (!n) in BPF_PROG()
111 bpf_rbtree_add(&groot, &n->node, less); in BPF_PROG()