Home
last modified time | relevance | path

Searched refs:bpf_rbtree_add (Results 1 – 7 of 7) sorted by relevance

/openbmc/linux/tools/testing/selftests/bpf/progs/
H A Drbtree.c53 bpf_rbtree_add(&groot, &n->node, less); in __add_three()
54 bpf_rbtree_add(&groot, &m->node, less); in __add_three()
63 bpf_rbtree_add(&groot, &n->node, less); in __add_three()
91 bpf_rbtree_add(&groot, &n->node, less); in rbtree_add_and_remove()
92 bpf_rbtree_add(&groot, &m->node, less); in rbtree_add_and_remove()
137 bpf_rbtree_add(&groot, &n->node, less); in rbtree_first_and_remove()
138 bpf_rbtree_add(&groot, &m->node, less); in rbtree_first_and_remove()
139 bpf_rbtree_add(&groot, &o->node, less); in rbtree_first_and_remove()
193 bpf_rbtree_add(&groot, &n->node, less); in rbtree_api_release_aliasing()
H A Drbtree_fail.c41 bpf_rbtree_add(&groot, &n->node, less); in rbtree_api_nolock_add()
56 bpf_rbtree_add(&groot, &n->node, less); in rbtree_api_nolock_remove()
89 bpf_rbtree_add(&groot, &n->node, less); in rbtree_api_remove_unadded_node()
146 bpf_rbtree_add(&groot, &n->node, less); in rbtree_api_add_to_multiple_trees()
149 bpf_rbtree_add(&groot2, &n->node, less); in rbtree_api_add_to_multiple_trees()
171 bpf_rbtree_add(&groot, res, less); in rbtree_api_use_unchecked_remove_retval()
191 bpf_rbtree_add(&groot, &n->node, less); in rbtree_api_add_release_unlock_escape()
237 bpf_rbtree_add(&groot, &node_a->node, less); in less__bad_fn_call_add()
277 bpf_rbtree_add(&groot, &n->node, cb); in add_with_cb()
H A Drefcounted_kptr_fail.c45 bpf_rbtree_add(&groot, &n->node, less); in rbtree_refcounted_node_ref_escapes()
71 bpf_rbtree_add(&groot, &n->node, less); in rbtree_refcounted_node_ref_escapes_owning_input()
92 bpf_rbtree_add(&groot, &n->node, less); in BPF_PROG()
H A Drefcounted_kptr.c88 if (bpf_rbtree_add(root, &n->r, less)) { in __insert_in_tree_and_list()
131 if (bpf_rbtree_add(root, &m->r, less)) { in __stash_map_insert_tree()
381 bpf_rbtree_add(&aroot, &n->node, less_a); in rbtree_refcounted_node_ref_escapes()
406 bpf_rbtree_add(&aroot, &n->node, less_a); in rbtree_refcounted_node_ref_escapes_owning_input()
468 bpf_rbtree_add(&broot, &n->r, less); in rbtree_wrong_owner_remove_fail_b()
518 bpf_rbtree_add(&root, &n->r, less); in BPF_PROG()
552 bpf_rbtree_add(&root, &n->r, less); in BPF_PROG()
H A Drbtree_btf_fail__add_wrong_type.c47 bpf_rbtree_add(&groot, &n->node, less2); in rbtree_api_add__add_wrong_type()
/openbmc/linux/Documentation/bpf/
H A Dgraph_ds_impl.rst94 bpf_rbtree_add(&tree, n); /* PASSED */
104 ``bpf_rbtree_add``.
115 When ownership is passed to ``tree`` via ``bpf_rbtree_add`` the answer is less
127 bpf_rbtree_add(&tree, n); /* PASSED */
219 bpf_rbtree_add(&tree, n); /* 2 */
/openbmc/linux/tools/testing/selftests/bpf/
H A Dbpf_experimental.h124 #define bpf_rbtree_add(head, node, less) bpf_rbtree_add_impl(head, node, less, NULL, 0) macro