132 	struct map_value_refcount_only *mapval;  in refcount_acquire_rcu_map_kptr_unchecked_drop()  local
142 	mapval = bpf_map_lookup_elem(&stashed_refcount_only, &idx);  in refcount_acquire_rcu_map_kptr_unchecked_drop()
143 	if (!mapval)  in refcount_acquire_rcu_map_kptr_unchecked_drop()
147 	n = mapval->node;  in refcount_acquire_rcu_map_kptr_unchecked_drop()
166 	struct map_value_rcu_graph *mapval;  in rbtree_remove_after_rcu_unlock()  local
171 	mapval = bpf_map_lookup_elem(&stashed_rcu_graph, &idx);  in rbtree_remove_after_rcu_unlock()
172 	if (!mapval)  in rbtree_remove_after_rcu_unlock()
176 	node = mapval->node;  in rbtree_remove_after_rcu_unlock()
196 	struct map_value_refcount_only *mapval;  in refcount_acquire_after_rcu_unlock()  local
200 	mapval = bpf_map_lookup_elem(&stashed_refcount_only, &idx);  in refcount_acquire_after_rcu_unlock()
201 	if (!mapval)  in refcount_acquire_after_rcu_unlock()
205 	node = mapval->node;  in refcount_acquire_after_rcu_unlock()
223 	struct map_value_rcu_graph *mapval;  in graph_kptr_after_spin_unlock()  local
227 	mapval = bpf_map_lookup_elem(&stashed_rcu_graph, &idx);  in graph_kptr_after_spin_unlock()
228 	if (!mapval)  in graph_kptr_after_spin_unlock()
232 	node = mapval->node;  in graph_kptr_after_spin_unlock()