Home
last modified time | relevance | path

Searched refs:bpf_list_push_front (Results 1 – 5 of 5) sorted by relevance

/linux-6.12.1/tools/testing/selftests/bpf/progs/
Dlinked_list_fail.c173 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()
397 bpf_list_push_front(&ghead, &f->node2); in list_double_add()
398 bpf_list_push_front(&ghead, &f->node2); in list_double_add()
429 bpf_list_push_front(&ghead, p); in no_node_value_type()
[all …]
Dlinked_list.c58 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()
Drefcounted_kptr.c97 if (bpf_list_push_front(head, &m->l)) { in __insert_in_tree_and_list()
/linux-6.12.1/tools/testing/selftests/bpf/
Dbpf_experimental.h70 #define bpf_list_push_front(head, node) bpf_list_push_front_impl(head, node, NULL, 0) macro
/linux-6.12.1/tools/sched_ext/include/scx/
Dcommon.bpf.h254 void bpf_list_push_front(struct bpf_list_head *head, struct bpf_list_node *node) __ksym;