Home
last modified time | relevance | path

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

/linux/tools/testing/selftests/bpf/progs/
H A Drbtree_fail.c60 bpf_rbtree_remove(&groot, &n->node); in rbtree_api_nolock_remove()
92 res_n = bpf_rbtree_remove(&groot, &n->node); in rbtree_api_remove_unadded_node()
94 res_m = bpf_rbtree_remove(&groot, &m->node); in rbtree_api_remove_unadded_node()
121 res = bpf_rbtree_remove(&groot, res); in rbtree_api_remove_no_drop()
167 res = bpf_rbtree_remove(&groot, res); in rbtree_api_use_unchecked_remove_retval()
201 bpf_rbtree_remove(&groot, &n->node); in rbtree_api_add_release_unlock_escape()
227 bpf_rbtree_remove(&groot, &n->node); in rbtree_api_first_release_unlock_escape()
251 bpf_rbtree_remove(&groot, &node_a->node); in less__bad_fn_call_remove()
H A Drbtree.c111 res = bpf_rbtree_remove(&groot, &n->node); in rbtree_add_and_remove()
154 res1 = bpf_rbtree_remove(&groot_array[0], &nodes[0][0]->node); in rbtree_add_and_remove_array()
155 res2 = bpf_rbtree_remove(&groot_array[1], &nodes[1][0]->node); in rbtree_add_and_remove_array()
156 res3 = bpf_rbtree_remove(&groot_array_one[0], &nodes[2][0]->node); in rbtree_add_and_remove_array()
227 res = bpf_rbtree_remove(&groot, &o->node); in rbtree_first_and_remove()
288 res = bpf_rbtree_remove(&groot, &m->node); in rbtree_api_release_aliasing()
299 res2 = bpf_rbtree_remove(&groot, &o->node); in rbtree_api_release_aliasing()
H A Drefcounted_kptr.c180 rb = bpf_rbtree_remove(root, rb); in __read_from_tree()
598 rb = bpf_rbtree_remove(&root, rb); in list_del_test2()
975 res = bpf_rbtree_remove(&root, &m->r); in rbtree_wrong_owner_remove_fail_a2()
1005 rb = bpf_rbtree_remove(&root, rb); in BPF_PROG()
1039 rb = bpf_rbtree_remove(&root, rb); in BPF_PROG()
H A Drefcounted_kptr_fail.c184 rb_node = bpf_rbtree_remove(&graph_root, &node->node); in rbtree_remove_after_rcu_unlock()
/linux/Documentation/bpf/
H 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/tools/sched_ext/
H A Dscx_flatcg.bpf.c633 rb_node = bpf_rbtree_remove(&cgv_tree, rb_node); in try_pick_next_cgroup()
/linux/tools/sched_ext/include/scx/
H A Dcommon.bpf.h402 struct bpf_rb_node *bpf_rbtree_remove(struct bpf_rb_root *root,
/linux/kernel/bpf/
H A Dhelpers.c2703 __bpf_kfunc struct bpf_rb_node *bpf_rbtree_remove(struct bpf_rb_root *root, in bpf_rbtree_remove() function
4836 BTF_ID_FLAGS(func, bpf_rbtree_remove, KF_ACQUIRE | KF_RET_NULL | KF_SPINLOCK_SAFE)
H A Dverifier.c11800 BTF_ID(func, bpf_rbtree_remove) in BTF_ID()