Home
last modified time | relevance | path

Searched refs:bpf_rbtree_remove (Results 1 – 6 of 6) sorted by relevance

/linux-6.3-rc2/tools/testing/selftests/bpf/progs/
A Drbtree_fail.c59 bpf_rbtree_remove(&groot, &n->node); in rbtree_api_nolock_remove()
92 res = bpf_rbtree_remove(&groot, &n->node); in rbtree_api_remove_unadded_node()
96 res = bpf_rbtree_remove(&groot, &m->node); in rbtree_api_remove_unadded_node()
119 res = bpf_rbtree_remove(&groot, res); in rbtree_api_remove_no_drop()
170 bpf_rbtree_remove(&groot, &n->node); in rbtree_api_add_release_unlock_escape()
205 bpf_rbtree_remove(&groot, &m->node); in rbtree_api_release_aliasing()
220 bpf_rbtree_remove(&groot, &o->node); in rbtree_api_release_aliasing()
244 bpf_rbtree_remove(&groot, &n->node); in rbtree_api_first_release_unlock_escape()
268 bpf_rbtree_remove(&groot, &node_a->node); in less__bad_fn_call_remove()
A Drbtree.c93 res = bpf_rbtree_remove(&groot, &n->node); in rbtree_add_and_remove()
148 res = bpf_rbtree_remove(&groot, &o->node); in rbtree_first_and_remove()
/linux-6.3-rc2/tools/testing/selftests/bpf/
A Dbpf_experimental.h73 extern struct bpf_rb_node *bpf_rbtree_remove(struct bpf_rb_root *root,
/linux-6.3-rc2/Documentation/bpf/
A Dgraph_ds_impl.rst222 o = bpf_rbtree_remove(&tree, n); /* 4 */
223 p = bpf_rbtree_remove(&tree, m); /* 5 */
257 ``bpf_rbtree_remove``. The logic here being that any graph API kfunc which:
/linux-6.3-rc2/kernel/bpf/
A Dhelpers.c1887 __bpf_kfunc struct bpf_rb_node *bpf_rbtree_remove(struct bpf_rb_root *root, in bpf_rbtree_remove() function
2161 BTF_ID_FLAGS(func, bpf_rbtree_remove, KF_ACQUIRE)
A Dverifier.c8891 BTF_ID(func, bpf_rbtree_remove) in BTF_ID()
8907 BTF_ID(func, bpf_rbtree_remove) in BTF_ID()

Completed in 34 milliseconds