From: Daniel Mack <dan...@zonque.org> Date: Thu, 29 Dec 2016 18:28:53 +0100
> This patch set adds a longest prefix match algorithm that can be used > to match IP addresses to a stored set of ranges. It is exposed as a > bpf map type. > > Internally, data is stored in an unbalanced tree of nodes that has a > maximum height of n, where n is the prefixlen the trie was created > with. > > Not that this has nothing to do with fib or fib6 and is in no way meant > to replace or share code with it. It's rather a much simpler > implementation that is specifically written with bpf maps in mind. > > Patch 1/2 adds the implementation, and 2/2 an extensive test suite. > > Feedback is much appreciated. I'll give Alexei and Daniel time to provide feedback on this series.
