Home
last modified time | relevance | path

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

/linux/tools/testing/selftests/bpf/progs/
H A 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()
366 bpf_list_push_front(&ghead, &f->node2); in use_after_unlock()
396 bpf_list_push_front(&ghead, &f->node2); in list_double_add()
397 bpf_list_push_front(&ghead, &f->node2); in list_double_add()
428 bpf_list_push_front(&ghead, p); in no_node_value_type()
[all …]
H A 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()
H A Drefcounted_kptr.c97 if (bpf_list_push_front(head, &m->l)) { in __insert_in_tree_and_list()
599 bpf_list_push_front(head, &node_ref->l);
/linux/tools/testing/selftests/bpf/
H A Dbpf_experimental.h70 #define bpf_list_push_front(head, node) bpf_list_push_front_ global() macro
/linux/tools/sched_ext/include/scx/
H A Dcommon.bpf.h355 #define bpf_list_push_front(head, node) bpf_list_push_front_impl(head, node, NULL, 0)
311 #define bpf_list_push_front(head, node) bpf_list_push_front_ global() macro
/linux/kernel/bpf/
H A Dhelpers.c2507 __bpf_kfunc int bpf_list_push_front(struct bpf_list_head *head, in bpf_list_push_front() function
2521 return bpf_list_push_front(head, node, meta__ign, off); in bpf_list_push_front_impl()
4717 BTF_ID_FLAGS(func, bpf_list_push_front, KF_IMPLICIT_ARGS)
H A Dverifier.c11204 BTF_ID(func, bpf_list_push_front) in BTF_ID()