Documentation/bpf/map_queue_stack.rst

36    long bpf_map_push_elem(struct bpf_map *map, const void *value, u64 flags)
38 An element ``value`` can be added to a queue or stack using the
42 make room for ``value`` to be added. Returns ``0`` on success, or
50    long bpf_map_peek_elem(struct bpf_map *map, void *value)
52 This helper fetches an element ``value`` from a queue or stack without
61    long bpf_map_pop_elem(struct bpf_map *map, void *value)
63 This helper removes an element into ``value`` from a queue or
75    int bpf_map_update_elem (int fd, const void *key, const void *value, __u64 flags)
77 A userspace program can push ``value`` onto a queue or stack using libbpf's
88    int bpf_map_lookup_elem (int fd, const void *key, void *value)
90 A userspace program can peek at the ``value`` at the head of a queue or stack
100    int bpf_map_lookup_and_delete_elem (int fd, const void *key, void *value)
102 A userspace program can pop a ``value`` from the head of a queue or stack using
119             __type(value, __u32);
137                                   sizeof(__u32),  /* value size */