Searched refs:bpf_list_push_front (Results 1 – 5 of 5) sorted by relevance
| /linux/tools/testing/selftests/bpf/progs/ |
| A D | linked_list_fail.c | 173 bpf_list_push_front(&ghead, NULL); in map_compat_kprobe()
180 bpf_list_push_front(&ghead, NULL); in map_compat_kretprobe()
187 bpf_list_push_front(&ghead, NULL); in map_compat_tp()
194 bpf_list_push_front(&ghead, NULL); in map_compat_perf()
201 bpf_list_push_front(&ghead, NULL); in map_compat_raw_tp()
208 bpf_list_push_front(&ghead, NULL); in map_compat_raw_tp_w()
367 bpf_list_push_front(&ghead, &f->node2); in use_after_unlock()
429 bpf_list_push_front(&ghead, p); in no_node_value_type()
444 bpf_list_push_front(&ghead, &b->node); in incorrect_value_type()
489 bpf_list_push_front(&ghead, &f->node); in incorrect_node_off2()
[all …]
|
| A D | linked_list.c | 58 bpf_list_push_front(head, &f->node2); in list_push_pop()
75 bpf_list_push_front(head, &f->node2); in list_push_pop()
135 bpf_list_push_front(head, &f[i]->node2); in list_push_pop_multiple()
136 bpf_list_push_front(head, &f[i + 1]->node2); in list_push_pop_multiple()
215 bpf_list_push_front(head, &f->node2); in list_in_list()
|
| A D | refcounted_kptr.c | 97 if (bpf_list_push_front(head, &m->l)) { in __insert_in_tree_and_list()
|
| /linux/tools/testing/selftests/bpf/ |
| A D | bpf_experimental.h | 70 #define bpf_list_push_front(head, node) bpf_list_push_front_impl(head, node, NULL, 0) macro
|
| /linux/tools/sched_ext/include/scx/ |
| A D | common.bpf.h | 254 void bpf_list_push_front(struct bpf_list_head *head, struct bpf_list_node *node) __ksym;
|
Completed in 14 milliseconds