On 11/22/2018 06:39 AM, Eric Dumazet wrote: > At LPC 2018 in Vancouver, Vlad Dumitrescu mentioned that > longest_prefix_match() > has a high cost [1]. > > One reason for that cost is a loop handling one byte at a time. > > We can handle more bytes at a time, if enough attention is paid > to endianness. > > I was able to remove ~55 % of longest_prefix_match() cpu costs. > > [1] > https://linuxplumbersconf.org/event/2/contributions/88/attachments/76/87/lpc-bpf-2018-shaping.pdf > > Signed-off-by: Eric Dumazet <eduma...@google.com> > Cc: Vlad Dumitrescu <vla...@google.com> > Cc: Alexei Starovoitov <a...@kernel.org> > Cc: Daniel Borkmann <dan...@iogearbox.net>
Looks good, applied to bpf-next, thanks!
