Re: Performance demonstration?
Tom Herbert <[email protected]> Tue, 23 Sep 2025 13:13:31 -0700
| Newsgroups | dev.linux.lists.xdp2 |
|---|---|
| Message-ID | <CALx6S371NcbZQSNuLUYUAVQ7HyTgf9b=iH=OAKgcqoMH2ebirg@mail.gmail.com> |
On Tue, Sep 23, 2025 at 8:57=E2=80=AFAM dave seddon <[email protected]= om> wrote: > > Hi Tom, > > I watched your FLOSS video > ([https://hackaday.com/2025/09/17/floss-weekly-episode-847-this-is-networ= king/](https://hackaday.com/2025/09/17/floss-weekly-episode-847-this-is-net= working/)) > on xdp2, and I'm very interested in your claim that the code-generated > parser outperforms a hand-coded one. > Hi Dave, It can be done via parser test. We compare flow dissector versus optimized XDP2 parser. Haven't done it since the last rebase, so we'll need to reproduce the numbers. On it. Tom Tom > Could you provide an example to demonstrate this? This would be a > great addition to the xdp2 README.md > ([https://github.com/xdp2-dev/xdp2/blob/main/README.md](https://github.co= m/xdp2-dev/xdp2/blob/main/README.md)). > > Demonstrating that xdp2 generates a faster parser than a widely used > parser, like your protobuf example, would significantly boost its > visibility. > > -- > Regards, > Dave Seddon > +1 415 857 5102 >