22 struct lpm_trie_node;
24 struct lpm_trie_node {  struct
26 	struct lpm_trie_node __rcu	*child[2];  argument
34 	struct lpm_trie_node __rcu	*root;  argument
166 				   const struct lpm_trie_node *node,  in longest_prefix_match()
172 	BUILD_BUG_ON(offsetof(struct lpm_trie_node, data) % sizeof(u32));  in longest_prefix_match()
231 	struct lpm_trie_node *node, *found = NULL;  in trie_lookup_elem()
279 static struct lpm_trie_node *lpm_trie_node_alloc(const struct lpm_trie *trie,  in lpm_trie_node_alloc()
282 	struct lpm_trie_node *node;  in lpm_trie_node_alloc()
283 	size_t size = sizeof(struct lpm_trie_node) + trie->data_size;  in lpm_trie_node_alloc()
307 	struct lpm_trie_node *node, *im_node = NULL, *new_node = NULL;  in trie_update_elem()
308 	struct lpm_trie_node __rcu **slot;  in trie_update_elem()
438 	struct lpm_trie_node __rcu **trim, **trim2;  in trie_delete_elem()
439 	struct lpm_trie_node *node, *parent;  in trie_delete_elem()
533 				 sizeof(struct lpm_trie_node))
576 	struct lpm_trie_node __rcu **slot;  in trie_free()
577 	struct lpm_trie_node *node;  in trie_free()
614 	struct lpm_trie_node *node, *next_node = NULL, *parent, *search_root;  in trie_get_next_key()
617 	struct lpm_trie_node **node_stack = NULL;  in trie_get_next_key()
643 				   sizeof(struct lpm_trie_node *),  in trie_get_next_key()
725 	elem_size = sizeof(struct lpm_trie_node) + trie->data_size +  in trie_mem_usage()