[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <20181129041948.pepdcksplt6xppk3@ast-mbp>
Date: Wed, 28 Nov 2018 20:19:50 -0800
From: Alexei Starovoitov <alexei.starovoitov@...il.com>
To: Aaron Conole <aconole@...hat.com>
Cc: netdev@...r.kernel.org, linux-kernel@...r.kernel.org,
netfilter-devel@...r.kernel.org, coreteam@...filter.org,
Alexei Starovoitov <ast@...nel.org>,
Daniel Borkmann <daniel@...earbox.net>,
Pablo Neira Ayuso <pablo@...filter.org>,
Jozsef Kadlecsik <kadlec@...ckhole.kfki.hu>,
Florian Westphal <fw@...len.de>,
John Fastabend <john.fastabend@...il.com>,
Jesper Brouer <brouer@...hat.com>,
"David S . Miller" <davem@...emloft.net>,
Andy Gospodarek <andy@...yhouse.net>,
Rony Efraim <ronye@...lanox.com>,
Simon Horman <horms@...ge.net.au>,
Marcelo Leitner <marcelo.leitner@...il.com>
Subject: Re: [RFC -next v0 1/3] bpf: modular maps
On Wed, Nov 28, 2018 at 01:51:42PM -0500, Aaron Conole wrote:
> Alexei Starovoitov <alexei.starovoitov@...il.com> writes:
>
> > On Tue, Nov 27, 2018 at 09:24:05AM -0500, Aaron Conole wrote:
> >>
> >> 1. Introduce flowmap again, this time, basically having it close to a
> >> copy of the hashmap. Introduce a few function calls that allow an
> >> external module to easily manipulate all maps of that type to insert
> >> / remove / update entries. This makes it similar to, for example,
> >> devmap.
> >
> > what is a flowmap?
> > How is this flowmap different from existing hash, lpm and lru maps?
>
> The biggest difference is how relationship works. Normal map would
> have single key and single value. Flow map needs to have two keys
> "single-value," because there are two sets of flow tuples to track
> (forward and reverse direction). That means that when updating the k-v
> pairs, we need to ensure that the data is always consistent and up to
> date. Probably we could do that with the existing maps if we had some
> kind of allocation mechanism, too (so, keep a pointer to data from two
> keys - not sure if there's a way to do that in ebpf)?
just swap the src/dst ips inside bpf program depending on direction
and use the same hash map.
That's what xdp/bpf users already do pretty successfully.
bpf hash map is already offloaded into hw too.
> forward direction addresses could be different from reverse direction so
> just swapping addresses / ports will not match).
That makes no sense to me. What would be an example of such flow?
Certainly not a tcp flow.
> That lets us use xdp as a fast forwarding path for
> connections, getting all of the advantage of helper modules to do the
> control / parsing, and all the advantage of xdp for packet movement.
>From 10k feet view it sounds correct, but details make no sense.
You're saying doing nat in the stack, but that _is_ the packet movement
where you wanted to use xdp.
Powered by blists - more mailing lists