Daniel Mack b95a5c4db0 bpf: add a longest prefix match trie map implementation
This trie implements a longest prefix match algorithm that can be used
to match IP addresses to a stored set of ranges.

Internally, data is stored in an unbalanced trie of nodes that has a
maximum height of n, where n is the prefixlen the trie was created
with.

Tries may be created with prefix lengths that are multiples of 8, in
the range from 8 to 2048. The key used for lookup and update operations
is a struct bpf_lpm_trie_key, and the value is a uint64_t.

The code carries more information about the internal implementation.

Signed-off-by: Daniel Mack <daniel@zonque.org>
Reviewed-by: David Herrmann <dh.herrmann@gmail.com>
Acked-by: Alexei Starovoitov <ast@kernel.org>
Signed-off-by: David S. Miller <davem@davemloft.net>
2017-01-23 16:10:38 -05:00
..
2016-12-25 17:21:22 +01:00
2017-01-20 12:08:43 -05:00
2017-01-12 07:01:56 -07:00
2016-11-25 16:25:52 -05:00
2016-12-26 17:30:24 -08:00
2016-12-25 17:21:22 +01:00
2016-12-12 18:55:06 -08:00
2016-05-27 15:26:11 -07:00
2016-12-22 22:58:37 -05:00
2016-09-22 20:00:36 -05:00