On 09/10/2018 08:04 PM, Alexei Starovoitov wrote:
On Fri, Sep 7, 2018 at 1:40 PM, Mauricio Vasquez
wrote:
I read the Joe's proposal and using that for this problem looks like a nice
solution.
I think a good trade-off for now would be to go ahead with a queue/stack map
without preallocating
On Fri, Sep 7, 2018 at 1:40 PM, Mauricio Vasquez
wrote:
>
> I read the Joe's proposal and using that for this problem looks like a nice
> solution.
>
> I think a good trade-off for now would be to go ahead with a queue/stack map
> without preallocating support (or maybe include it having always in
On 09/06/2018 07:13 PM, Alexei Starovoitov wrote:
On Fri, Aug 31, 2018 at 11:25:48PM +0200, Mauricio Vasquez B wrote:
In some applications this is needed have a pool of free elements, like for
example the list of free L4 ports in a SNAT. None of the current maps allow
to do it as it is not p
On Thu, 6 Sep 2018 at 17:13, Alexei Starovoitov
wrote:
> bpf_map_pop_elem() is trying to do lookup_and_delete and preserve
> validity of value without races.
> With pcpu_freelist I don't think there is a solution.
> We can have this queue/stack map without prealloc and use kmalloc/kfree
> back and
On Fri, Aug 31, 2018 at 11:25:48PM +0200, Mauricio Vasquez B wrote:
> In some applications this is needed have a pool of free elements, like for
> example the list of free L4 ports in a SNAT. None of the current maps allow
> to do it as it is not possibleto get an any element without having they k
In some applications this is needed have a pool of free elements, like for
example the list of free L4 ports in a SNAT. None of the current maps allow
to do it as it is not possibleto get an any element without having they key
it is associated to.
This patchset implements two new kind of eBPF map
