diff options
| author | Daniel Mack | 2017-01-21 17:26:11 +0100 |
|---|---|---|
| committer | David S. Miller | 2017-01-23 22:10:38 +0100 |
| commit | b95a5c4db09bc7c253636cb84dc9b12c577fd5a0 (patch) | |
| tree | a8c872a2412680a6a670d10d3d16df68b4587272 /kernel/bpf/Makefile | |
| parent | net: xilinx: constify net_device_ops structure (diff) | |
| download | kernel-qcow2-linux-b95a5c4db09bc7c253636cb84dc9b12c577fd5a0.tar.gz kernel-qcow2-linux-b95a5c4db09bc7c253636cb84dc9b12c577fd5a0.tar.xz kernel-qcow2-linux-b95a5c4db09bc7c253636cb84dc9b12c577fd5a0.zip | |
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>
Diffstat (limited to 'kernel/bpf/Makefile')
| -rw-r--r-- | kernel/bpf/Makefile | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/kernel/bpf/Makefile b/kernel/bpf/Makefile index 1276474ac3cd..e1ce4f4fd7fd 100644 --- a/kernel/bpf/Makefile +++ b/kernel/bpf/Makefile @@ -1,7 +1,7 @@ obj-y := core.o obj-$(CONFIG_BPF_SYSCALL) += syscall.o verifier.o inode.o helpers.o -obj-$(CONFIG_BPF_SYSCALL) += hashtab.o arraymap.o percpu_freelist.o bpf_lru_list.o +obj-$(CONFIG_BPF_SYSCALL) += hashtab.o arraymap.o percpu_freelist.o bpf_lru_list.o lpm_trie.o ifeq ($(CONFIG_PERF_EVENTS),y) obj-$(CONFIG_BPF_SYSCALL) += stackmap.o endif |