Home
last modified time | relevance | path

Searched refs:bpf_queue_stack (Results 1 – 2 of 2) sorted by relevance

/linux/kernel/bpf/
A Dqueue_stack_maps.c16 struct bpf_queue_stack { struct
25 static struct bpf_queue_stack *bpf_queue_stack(struct bpf_map *map) in bpf_queue_stack() argument
27 return container_of(map, struct bpf_queue_stack, map); in bpf_queue_stack()
30 static bool queue_stack_map_is_empty(struct bpf_queue_stack *qs) in queue_stack_map_is_empty()
35 static bool queue_stack_map_is_full(struct bpf_queue_stack *qs) in queue_stack_map_is_full()
70 struct bpf_queue_stack *qs; in queue_stack_map_alloc()
94 struct bpf_queue_stack *qs = bpf_queue_stack(map); in queue_stack_map_free()
101 struct bpf_queue_stack *qs = bpf_queue_stack(map); in __queue_map_get()
130 struct bpf_queue_stack *qs = bpf_queue_stack(map); in __stack_map_get()
187 struct bpf_queue_stack *qs = bpf_queue_stack(map); in queue_stack_map_push_elem()
/linux/tools/testing/selftests/bpf/progs/
A Dmap_ptr_kern.c558 struct bpf_queue_stack { struct
570 struct bpf_queue_stack *queue = (struct bpf_queue_stack *)&m_queue; in check_queue() argument
586 struct bpf_queue_stack *stack = (struct bpf_queue_stack *)&m_stack; in check_stack()

Completed in 7 milliseconds