Home
last modified time | relevance | path

Searched refs:bpf_obj_drop (Results 1 – 11 of 11) sorted by relevance

/openbmc/linux/tools/testing/selftests/bpf/progs/
H A Dlinked_list.c29 bpf_obj_drop(f); in list_push_pop()
38 bpf_obj_drop(f); in list_push_pop()
56 bpf_obj_drop(f); in list_push_pop()
71 bpf_obj_drop(f); in list_push_pop()
74 bpf_obj_drop(f); in list_push_pop()
157 bpf_obj_drop(pf); in list_push_pop_multiple()
191 bpf_obj_drop(f); in list_in_list()
215 bpf_obj_drop(f); in list_in_list()
233 bpf_obj_drop(b); in list_in_list()
239 bpf_obj_drop(f); in list_in_list()
[all …]
H A Drbtree.c47 bpf_obj_drop(n); in __add_three()
101 bpf_obj_drop(n); in rbtree_add_and_remove()
106 bpf_obj_drop(n); in rbtree_add_and_remove()
108 bpf_obj_drop(m); in rbtree_add_and_remove()
158 bpf_obj_drop(o); in rbtree_first_and_remove()
174 bpf_obj_drop(n); in rbtree_first_and_remove()
176 bpf_obj_drop(m); in rbtree_first_and_remove()
229 bpf_obj_drop(o); in rbtree_api_release_aliasing()
237 bpf_obj_drop(m); in rbtree_api_release_aliasing()
H A Drefcounted_kptr.c91 bpf_obj_drop(m); in __insert_in_tree_and_list()
125 bpf_obj_drop(n); in __stash_map_insert_tree()
126 bpf_obj_drop(m); in __stash_map_insert_tree()
169 bpf_obj_drop(n); in __read_from_tree()
202 bpf_obj_drop(n); in __read_from_list()
221 bpf_obj_drop(n); in __read_from_unstash()
388 bpf_obj_drop(m); in rbtree_refcounted_node_ref_escapes()
409 bpf_obj_drop(m); in rbtree_refcounted_node_ref_escapes_owning_input()
419 bpf_obj_drop(n); in __stash_map_empty_xchg()
424 bpf_obj_drop(n); in __stash_map_empty_xchg()
[all …]
H A Dlocal_kptr_stash.c65 bpf_obj_drop(res); in create_and_stash()
93 bpf_obj_drop(res); in stash_plain()
112 bpf_obj_drop(res); in unstash_rb_node()
H A Dlocal_kptr_stash_fail.c61 bpf_obj_drop(res); in stash_rb_nodes()
81 bpf_obj_drop(&res->node); in drop_rb_node_off()
H A Dtest_bpf_ma.c63 bpf_obj_drop(old); in batch_alloc_free()
80 bpf_obj_drop(old); in batch_alloc_free()
H A Dlinked_list_fail.c37 bpf_obj_drop(f1); \
42 bpf_obj_drop(f2); \
43 bpf_obj_drop(f1); \
242 bpf_obj_drop(f+1); in obj_drop_non_zero_off()
267 bpf_obj_drop(f); in use_after_drop()
551 bpf_obj_drop(f); in incorrect_head_off1()
H A Drbtree_fail.c84 bpf_obj_drop(n); in rbtree_api_remove_unadded_node()
101 bpf_obj_drop(n); in rbtree_api_remove_unadded_node()
103 bpf_obj_drop(m); in rbtree_api_remove_unadded_node()
H A Dtest_spin_lock_fail.c105 bpf_obj_drop(f1); \
/openbmc/linux/Documentation/bpf/
H A Dgraph_ds_impl.rst103 ``bpf_obj_drop``, which ``free``'s the object, or by adding it to ``tree`` with
110 object was ``free``'d with ``bpf_obj_drop`` the answer is obvious: the verifier
111 should reject programs which attempt to access ``n`` after ``bpf_obj_drop`` as
116 obvious. The verifier could enforce the same semantics as for ``bpf_obj_drop``,
166 kfunc, or via ``bpf_obj_drop``, which ``free``'s the pointee
177 ``bpf_obj_drop``
187 via bpf_obj_drop. A non-owning ref to some chunk of memory that was remove'd,
196 Currently ``bpf_obj_drop`` is not allowed in the critical section, so
227 bpf_obj_drop(o);
228 bpf_obj_drop(p); /* 6 */
/openbmc/linux/tools/testing/selftests/bpf/
H A Dbpf_experimental.h40 #define bpf_obj_drop(kptr) bpf_obj_drop_impl(kptr, NULL) macro