Re: [PATCH bpf-next v3 0/7] Implement queue/stack maps

On Fri, Oct 19, 2018 at 10:08:08PM +0200, Daniel Borkmann wrote:

On 10/18/2018 03:16 PM, Mauricio Vasquez B wrote:

quoted

In some applications this is needed have a pool of free elements, for
example the list of free L4 ports in a SNAT.  None of the current maps allow
to do it as it is not possible to get any element without having they key
it is associated to, even if it were possible, the lack of locking mecanishms in
eBPF would do it almost impossible to be implemented without data races.

This patchset implements two new kind of eBPF maps: queue and stack.
Those maps provide to eBPF programs the peek, push and pop operations, and for
userspace applications a new bpf_map_lookup_and_delete_elem() is added.

Signed-off-by: Mauricio Vasquez B <redacted>

Acked-by: Daniel Borkmann <daniel@iogearbox.net>

Applied, Thanks