| /linux/tools/testing/selftests/bpf/progs/ |
| H A D | rbtree.c | 65 bpf_rbtree_add(&groot, &n->node, less); in __add_three()
66 bpf_rbtree_add(&groot, &m->node, less); in __add_three()
75 bpf_rbtree_add(&groot, &n->node, less); in __add_three()
109 bpf_rbtree_add(&groot, &n->node, less); in rbtree_add_and_remove()
110 bpf_rbtree_add(&groot, &m->node, less); in rbtree_add_and_remove()
151 bpf_rbtree_add(&groot_array[i], &nodes[i][j]->node, less); in rbtree_add_and_remove_array()
153 bpf_rbtree_add(&groot_array_one[0], &nodes[2][j]->node, less); in rbtree_add_and_remove_array()
214 bpf_rbtree_add(&groot, &n->node, less); in rbtree_first_and_remove()
215 bpf_rbtree_add(&groot, &m->node, less); in rbtree_first_and_remove()
216 bpf_rbtree_add(&groot, &o->node, less); in rbtree_first_and_remove()
[all …]
|
| H A D | rbtree_fail.c | 41 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 D | refcounted_kptr_fail.c | 45 bpf_rbtree_add(&groot, &n->node, less); in rbtree_refcounted_node_ref_escapes()
90 bpf_rbtree_add(&groot, &n->node, less); in rbtree_refcounted_node_ref_escapes_owning_input()
111 bpf_rbtree_add(&groot, &n->node, less); in BPF_PROG()
|
| H A D | refcounted_kptr.c | 88 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 D | rbtree_btf_fail__add_wrong_type.c | 47 bpf_rbtree_add(&groot, &n->node, less2); in rbtree_api_add__add_wrong_type()
|
| H A D | local_kptr_stash.c | 176 bpf_rbtree_add(&res->r, &n->node, less); in stash_local_with_root()
|
| H A D | exceptions_fail.c | 173 bpf_rbtree_add(&rbtree, &f->node, rbless); in reject_with_rbtree_add_throw()
|
| /linux/Documentation/bpf/ |
| H A D | graph_ds_impl.rst | 94 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 */
|
| /linux/tools/testing/selftests/bpf/ |
| H A D | bpf_experimental.h | 124 #define bpf_rbtree_add(head, node, less) bpf_rbtree_add_impl(head, node, less, NULL, 0) macro
|
| /linux/tools/sched_ext/include/scx/ |
| H A D | common.bpf.h | 290 #define bpf_rbtree_add(head, node, less) bpf_rbtree_add_impl(head, node, less, NULL, 0) macro
|