| H A D | lpm_trie.c | 43 /* This trie implements a longest prefix match algorithm that can be used to
55 * For instance, let's start with a trie that was created with a prefix length
61 * As the trie is empty initially, the new node (1) will be places as root
143 * example above, (4) would be re-used if 192.168.0.0/23 is added to the trie.
145 * A fully populated trie would have a height of 32 nodes, as the trie was
149 * is a child that can be used to become more specific, the trie is traversed
161 * @trie: The trie to get internal sizes from
168 size_t __longest_prefix_match(const struct lpm_trie *trie, in __longest_prefix_match()
167 __longest_prefix_match(const struct lpm_trie * trie,const struct lpm_trie_node * node,const struct bpf_lpm_trie_key_u8 * key) __longest_prefix_match() argument
229 longest_prefix_match(const struct lpm_trie * trie,const struct lpm_trie_node * node,const struct bpf_lpm_trie_key_u8 * key) longest_prefix_match() argument
239 struct lpm_trie *trie = container_of(map, struct lpm_trie, map); trie_lookup_elem() local
291 lpm_trie_node_alloc(struct lpm_trie * trie,const void * value) lpm_trie_node_alloc() argument
310 trie_check_add_elem(struct lpm_trie * trie,u64 flags) trie_check_add_elem() argument
324 struct lpm_trie *trie = container_of(map, struct lpm_trie, map); trie_update_elem() local
457 struct lpm_trie *trie = container_of(map, struct lpm_trie, map); trie_delete_elem() local
570 struct lpm_trie *trie; trie_alloc() local
612 struct lpm_trie *trie = container_of(map, struct lpm_trie, map); trie_free() local
656 struct lpm_trie *trie = container_of(map, struct lpm_trie, map); trie_get_next_key() local
763 struct lpm_trie *trie = container_of(map, struct lpm_trie, map); trie_mem_usage() local
[all...] |