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
167 			      const struct lpm_trie_node *node,  in __longest_prefix_match()
173 	BUILD_BUG_ON(offsetof(struct lpm_trie_node, data) % sizeof(u32));  in __longest_prefix_match()
229 				   const struct lpm_trie_node *node,  in longest_prefix_match()
239 	struct lpm_trie_node *node, *found = NULL;  in trie_lookup_elem()
290 static struct lpm_trie_node *lpm_trie_node_alloc(const struct lpm_trie *trie,  in lpm_trie_node_alloc()
293 	struct lpm_trie_node *node;  in lpm_trie_node_alloc()
294 	size_t size = sizeof(struct lpm_trie_node) + trie->data_size;  in lpm_trie_node_alloc()
318 	struct lpm_trie_node *node, *im_node = NULL, *new_node = NULL;  in trie_update_elem()
319 	struct lpm_trie_node *free_node = NULL;  in trie_update_elem()
320 	struct lpm_trie_node __rcu **slot;  in trie_update_elem()
450 	struct lpm_trie_node *free_node = NULL, *free_parent = NULL;  in trie_delete_elem()
452 	struct lpm_trie_node __rcu **trim, **trim2;  in trie_delete_elem()
453 	struct lpm_trie_node *node, *parent;  in trie_delete_elem()
549 				 sizeof(struct lpm_trie_node))
592 	struct lpm_trie_node __rcu **slot;  in trie_free()
593 	struct lpm_trie_node *node;  in trie_free()
630 	struct lpm_trie_node *node, *next_node = NULL, *parent, *search_root;  in trie_get_next_key()
633 	struct lpm_trie_node **node_stack = NULL;  in trie_get_next_key()
659 				   sizeof(struct lpm_trie_node *),  in trie_get_next_key()
741 	elem_size = sizeof(struct lpm_trie_node) + trie->data_size +  in trie_mem_usage()