I am sorry, I was not clear enough. If you attach the program in SKB mode you won't need to attach any XDP program on vbox1 and vbox2, on the other hand, if you use DRV mode you need to have an XDP pa

Hello Forrest, You're using veth interfaces, in this case you have to attach the program in SKB mode, to do it set flags = 1 << 1. Mauricio.

Thanks Yonghong by the info, to summarize my findings: "BPF memory model is equal to memory model of underlying architecture", cit Alexei [1], then atomicity of those kind of operations can only be gu

Exactly. Please consider this example based on BCC https://gist.github.com/mauriciovasquezbernal/73ade7609eadcf23fb254401ed945cb3. In this case the counter member is naturally aligned, so in x86_64 th

Hello folks, We have an eBPF program that shares a 64-bits integer with userspace using an array map. The eBPF program only reads the integer while the user-space application only writes it. We know t

eBPF programs are never preempted by the kernel, this allows to keep counters in per_cpu maps without need to use synchronized primitives on them. This is also guaranteed that there is not preemption

Will send to netdev. Thanks!

The example is made by two parts, a eBPF program that consumes elements from a FIFO queue and prints them in the screen and a user space application that inserts new elements into the queue each time

Signed-off-by: Mauricio Vasquez B <mauricio.vasquez@...> --- tools/include/uapi/linux/bpf.h | 5 ++ tools/testing/selftests/bpf/test_maps.c | 71 +++++++++++++++++++++++++++++++ 2 files changed, 7

Bpf queue implements a LIFO/FIFO data containers for ebpf programs. It allows to push an element to the queue by using the update operation and to pop an element from the queue by using the lookup ope

Bpf queue map is a new kind of map that provides a LIFO/FIFO queue implementation. In some applications, like a SNAT, it is necessary to keep track of a pool of free elemenets, network ports in this c

I am not sure, it is more an example than a test, real tests are already in tools/testing/selftests/bpf/test_maps.c. Maybe we can rename it to queue_map_sample or something similar, or remove it if yo

I have no any preference over that, will do that way. I missed that, will do. I realized that I totally missed the support for preallocating elements. In v2 I implemented a per cpu free list based sch

The example is made by two parts, a eBPF program that consumes elements from a FIFO queue and prints them in the screen and a user space application that inserts new elements into the queue each time

Signed-off-by: Mauricio Vasquez B <mauricio.vasquez@...> --- tools/include/uapi/linux/bpf.h | 5 ++ tools/testing/selftests/bpf/test_maps.c | 72 +++++++++++++++++++++++++++++++ 2 files changed, 7

Bpf queue implements a LIFO/FIFO data containers for ebpf programs. It allows to push an element to the queue by using the update operation and to pop an element from the queue by using the lookup ope

Bpf queue map is a new kind of map that provides a LIFO/FIFO queue implementation. In some applications, like a SNAT, it is necessary to keep track of a pool of free elemenets, network ports in this c

This solves the issue we have in our application. Thanks to both of you! Mauricio.

Dear All, One of our applications is giving errors because there are many file descriptors open. After some debugging we found that bcc appears to be leaking file descriptors. Please considerer the fo

Hello Teng, (Adding the list as dropped in last message) Unfortunately percpu would not work, the set of elements has to be shared across all cpus. We could think about using a synchronization primiti