24 struct lpm_trie_node;
26 struct lpm_trie_node {  struct
28 	struct lpm_trie_node __rcu	*child[2];  argument
36 	struct lpm_trie_node __rcu	*root;  argument
168 				   const struct lpm_trie_node *node,  in longest_prefix_match()
194 	struct lpm_trie_node *node, *found = NULL;  in trie_lookup_elem()
240 static struct lpm_trie_node *lpm_trie_node_alloc(const struct lpm_trie *trie,  in lpm_trie_node_alloc()
243 	struct lpm_trie_node *node;  in lpm_trie_node_alloc()
244 	size_t size = sizeof(struct lpm_trie_node) + trie->data_size;  in lpm_trie_node_alloc()
268 	struct lpm_trie_node *node, *im_node = NULL, *new_node = NULL;  in trie_update_elem()
269 	struct lpm_trie_node __rcu **slot;  in trie_update_elem()
399 	struct lpm_trie_node __rcu **trim, **trim2;  in trie_delete_elem()
400 	struct lpm_trie_node *node, *parent;  in trie_delete_elem()
493 				 sizeof(struct lpm_trie_node))
532 	cost_per_node = sizeof(struct lpm_trie_node) +  in trie_alloc()
557 	struct lpm_trie_node __rcu **slot;  in trie_free()
558 	struct lpm_trie_node *node;  in trie_free()
600 	struct lpm_trie_node *node, *next_node = NULL, *parent, *search_root;  in trie_get_next_key()
603 	struct lpm_trie_node **node_stack = NULL;  in trie_get_next_key()
629 				   sizeof(struct lpm_trie_node *),  in trie_get_next_key()