On Sat, Jan 21, 2017 at 05:26:12PM +0100, Daniel Mack wrote: > From: David Herrmann <dh.herrm...@gmail.com> > > The first part of this program runs randomized tests against the > lpm-bpf-map. It implements a "Trivial Longest Prefix Match" (tlpm) > based on simple, linear, single linked lists. The implementation > should be pretty straightforward. > > Based on tlpm, this inserts randomized data into bpf-lpm-maps and > verifies the trie-based bpf-map implementation behaves the same way > as tlpm. > > The second part uses 'real world' IPv4 and IPv6 addresses and tests > the trie with those. > > Signed-off-by: David Herrmann <dh.herrm...@gmail.com> > Signed-off-by: Daniel Mack <dan...@zonque.org>
Acked-by: Alexei Starovoitov <a...@kernel.org>
