1
0
Files
linux/include/uapi/linux
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-11-29 09:00:30 +01:00
2016-10-18 10:05:42 -06:00
2016-10-03 18:52:14 +02:00
2016-10-01 07:32:32 +02:00
2016-11-03 15:41:11 -04:00
2016-11-03 15:41:11 -04:00
2016-03-22 15:36:02 -07:00
2016-06-27 16:31:25 +01:00
2016-04-12 19:54:58 +01:00
2016-12-10 23:29:11 -05:00
2017-01-17 14:38:43 -05:00
2016-11-03 10:56:17 +01:00
2016-05-17 17:14:21 -06:00
2016-09-27 21:52:00 -04:00
2016-09-27 21:52:00 -04:00
2016-05-08 23:46:14 -04:00
2016-04-26 12:00:48 -04:00
2017-01-09 16:07:38 -05:00
2016-04-04 22:11:20 -04:00
2017-01-10 18:31:55 -08:00
2016-05-20 17:58:30 -07:00
2016-11-17 08:33:20 -07:00
2016-12-16 00:13:38 +02:00
2016-12-16 00:13:32 +02:00
2016-04-30 09:26:55 -07:00