24 struct lpm_trie_node;
26 struct lpm_trie_node {  struct
27 	struct lpm_trie_node __rcu	*child[2];  argument
35 	struct lpm_trie_node __rcu	*root;  argument
169 			      const struct lpm_trie_node *node,  in __longest_prefix_match()
175 	BUILD_BUG_ON(offsetof(struct lpm_trie_node, data) % sizeof(u32));  in __longest_prefix_match()
231 				   const struct lpm_trie_node *node,  in longest_prefix_match()
241 	struct lpm_trie_node *node, *found = NULL;  in trie_lookup_elem()
292 static struct lpm_trie_node *lpm_trie_node_alloc(struct lpm_trie *trie,  in lpm_trie_node_alloc()
295 	struct lpm_trie_node *node;  in lpm_trie_node_alloc()
326 	struct lpm_trie_node *node, *im_node, *new_node;  in trie_update_elem()
327 	struct lpm_trie_node *free_node = NULL;  in trie_update_elem()
328 	struct lpm_trie_node __rcu **slot;  in trie_update_elem()
460 	struct lpm_trie_node *free_node = NULL, *free_parent = NULL;  in trie_delete_elem()
462 	struct lpm_trie_node __rcu **trim, **trim2;  in trie_delete_elem()
463 	struct lpm_trie_node *node, *parent;  in trie_delete_elem()
561 				 sizeof(struct lpm_trie_node))
601 	leaf_size = sizeof(struct lpm_trie_node) + trie->data_size +  in trie_alloc()
616 	struct lpm_trie_node __rcu **slot;  in trie_free()
617 	struct lpm_trie_node *node;  in trie_free()
658 	struct lpm_trie_node *node, *next_node = NULL, *parent, *search_root;  in trie_get_next_key()
661 	struct lpm_trie_node **node_stack = NULL;  in trie_get_next_key()
686 	node_stack = kmalloc_objs(struct lpm_trie_node *,  in trie_get_next_key()
769 	elem_size = sizeof(struct lpm_trie_node) + trie->data_size +  in trie_mem_usage()