21 struct lpm_trie_node;
23 struct lpm_trie_node {  struct
25 	struct lpm_trie_node __rcu	*child[2];  argument
33 	struct lpm_trie_node __rcu	*root;  argument
165 				   const struct lpm_trie_node *node,  in longest_prefix_match()
171 	BUILD_BUG_ON(offsetof(struct lpm_trie_node, data) % sizeof(u32));  in longest_prefix_match()
230 	struct lpm_trie_node *node, *found = NULL;  in trie_lookup_elem()
278 static struct lpm_trie_node *lpm_trie_node_alloc(const struct lpm_trie *trie,  in lpm_trie_node_alloc()
281 	struct lpm_trie_node *node;  in lpm_trie_node_alloc()
282 	size_t size = sizeof(struct lpm_trie_node) + trie->data_size;  in lpm_trie_node_alloc()
306 	struct lpm_trie_node *node, *im_node = NULL, *new_node = NULL;  in trie_update_elem()
307 	struct lpm_trie_node __rcu **slot;  in trie_update_elem()
437 	struct lpm_trie_node __rcu **trim, **trim2;  in trie_delete_elem()
438 	struct lpm_trie_node *node, *parent;  in trie_delete_elem()
532 				 sizeof(struct lpm_trie_node))
578 	struct lpm_trie_node __rcu **slot;  in trie_free()
579 	struct lpm_trie_node *node;  in trie_free()
616 	struct lpm_trie_node *node, *next_node = NULL, *parent, *search_root;  in trie_get_next_key()
619 	struct lpm_trie_node **node_stack = NULL;  in trie_get_next_key()
645 				   sizeof(struct lpm_trie_node *),  in trie_get_next_key()