132 struct key_vector {  struct
141 		struct key_vector __rcu *tnode[0];  argument
149 	struct key_vector __rcu *parent;
150 	struct key_vector kv[1];
179 	struct key_vector kv[1];
185 static struct key_vector *resize(struct trie *t, struct key_vector *tn);
198 static inline struct tnode *tn_info(struct key_vector *kv)  in tn_info()
212 static inline void node_set_parent(struct key_vector *n, struct key_vector *tp)  in node_set_parent()
223 static inline unsigned long child_length(const struct key_vector *tn)  in child_length()
230 static inline unsigned long get_index(t_key key, struct key_vector *kv)  in get_index()
316 	ilog2((PAGE_SIZE - TNODE_SIZE(0)) / sizeof(struct key_vector *))
318 	ilog2((SIZE_MAX - TNODE_SIZE(0)) / sizeof(struct key_vector *))
349 static inline void empty_child_inc(struct key_vector *n)  in empty_child_inc()
354 static inline void empty_child_dec(struct key_vector *n)  in empty_child_dec()
359 static struct key_vector *leaf_new(t_key key, struct fib_alias *fa)  in leaf_new()
361 	struct key_vector *l;  in leaf_new()
382 static struct key_vector *tnode_new(t_key key, int pos, int bits)  in tnode_new()
385 	struct key_vector *tn;  in tnode_new()
396 		 sizeof(struct key_vector *) << bits);  in tnode_new()
415 static inline int tnode_full(struct key_vector *tn, struct key_vector *n)  in tnode_full()
423 static void put_child(struct key_vector *tn, unsigned long i,  in put_child()
424 		      struct key_vector *n)  in put_child()
426 	struct key_vector *chi = get_child(tn, i);  in put_child()
452 static void update_children(struct key_vector *tn)  in update_children()
458 		struct key_vector *inode = get_child(tn, --i);  in update_children()
474 static inline void put_child_root(struct key_vector *tp, t_key key,  in put_child_root()
475 				  struct key_vector *n)  in put_child_root()
483 static inline void tnode_free_init(struct key_vector *tn)  in tnode_free_init()
488 static inline void tnode_free_append(struct key_vector *tn,  in tnode_free_append()
489 				     struct key_vector *n)  in tnode_free_append()
495 static void tnode_free(struct key_vector *tn)  in tnode_free()
513 static struct key_vector *replace(struct trie *t,  in replace()
514 				  struct key_vector *oldtnode,  in replace()
515 				  struct key_vector *tn)  in replace()
517 	struct key_vector *tp = node_parent(oldtnode);  in replace()
532 		struct key_vector *inode = get_child(tn, --i);  in replace()
542 static struct key_vector *inflate(struct trie *t,  in inflate()
543 				  struct key_vector *oldtnode)  in inflate()
545 	struct key_vector *tn;  in inflate()
564 		struct key_vector *inode = get_child(oldtnode, --i);  in inflate()
565 		struct key_vector *node0, *node1;  in inflate()
638 static struct key_vector *halve(struct trie *t,  in halve()
639 				struct key_vector *oldtnode)  in halve()
641 	struct key_vector *tn;  in halve()
659 		struct key_vector *node1 = get_child(oldtnode, --i);  in halve()
660 		struct key_vector *node0 = get_child(oldtnode, --i);  in halve()
661 		struct key_vector *inode;  in halve()
693 static struct key_vector *collapse(struct trie *t,  in collapse()
694 				   struct key_vector *oldtnode)  in collapse()
696 	struct key_vector *n, *tp;  in collapse()
714 static unsigned char update_suffix(struct key_vector *tn)  in update_suffix()
732 		struct key_vector *n = get_child(tn, i);  in update_suffix()
809 static inline bool should_inflate(struct key_vector *tp, struct key_vector *tn)  in should_inflate()
824 static inline bool should_halve(struct key_vector *tp, struct key_vector *tn)  in should_halve()
838 static inline bool should_collapse(struct key_vector *tn)  in should_collapse()
853 static struct key_vector *resize(struct trie *t, struct key_vector *tn)  in resize()
858 	struct key_vector *tp = node_parent(tn);  in resize()
918 static void node_pull_suffix(struct key_vector *tn, unsigned char slen)  in node_pull_suffix()
932 static void node_push_suffix(struct key_vector *tn, unsigned char slen)  in node_push_suffix()
941 static struct key_vector *fib_find_node(struct trie *t,  in fib_find_node()
942 					struct key_vector **tp, u32 key)  in fib_find_node()
944 	struct key_vector *pn, *n = t->kv;  in fib_find_node()
1012 static void trie_rebalance(struct trie *t, struct key_vector *tn)  in trie_rebalance()
1018 static int fib_insert_node(struct trie *t, struct key_vector *tp,  in fib_insert_node()
1021 	struct key_vector *n, *l;  in fib_insert_node()
1037 		struct key_vector *tn;  in fib_insert_node()
1071 static int fib_insert_alias(struct trie *t, struct key_vector *tp,  in fib_insert_alias()
1072 			    struct key_vector *l, struct fib_alias *new,  in fib_insert_alias()
1130 	struct key_vector *l, *tp;  in fib_table_insert()
1308 static inline t_key prefix_mismatch(t_key key, struct key_vector *n)  in prefix_mismatch()
1324 	struct key_vector *n, *pn;  in fib_table_lookup()
1383 		struct key_vector __rcu **cptr = n->tnode;  in fib_table_lookup()
1513 static void fib_remove_alias(struct trie *t, struct key_vector *tp,  in fib_remove_alias()
1514 			     struct key_vector *l, struct fib_alias *old)  in fib_remove_alias()
1550 	struct key_vector *l, *tp;  in fib_table_delete()
1616 static struct key_vector *leaf_walk_rcu(struct key_vector **tn, t_key key)  in leaf_walk_rcu()
1618 	struct key_vector *pn, *n = *tn;  in leaf_walk_rcu()
1676 	struct key_vector *pn = t->kv;  in fib_trie_free()
1683 		struct key_vector *n;  in fib_trie_free()
1734 	struct key_vector *l, *tp = ot->kv;  in fib_trie_unmerge()
1750 		struct key_vector *local_l = NULL, *local_tp;  in fib_trie_unmerge()
1793 	struct key_vector *pn = t->kv;  in fib_table_flush_external()
1801 		struct key_vector *n;  in fib_table_flush_external()
1862 	struct key_vector *pn = t->kv;  in fib_table_flush()
1871 		struct key_vector *n;  in fib_table_flush()
1936 static void fib_leaf_notify(struct net *net, struct key_vector *l,  in fib_leaf_notify()
1962 	struct key_vector *l, *tp = t->kv;  in fib_table_notify()
2005 static int fn_trie_dump_leaf(struct key_vector *l, struct fib_table *tb,  in fn_trie_dump_leaf()
2050 	struct key_vector *l, *tp = t->kv;  in fib_table_dump()
2134 	struct key_vector *tnode;
2139 static struct key_vector *fib_trie_get_next(struct fib_trie_iter *iter)  in fib_trie_get_next()
2142 	struct key_vector *pn = iter->tnode;  in fib_trie_get_next()
2150 			struct key_vector *n = get_child_rcu(pn, cindex++);  in fib_trie_get_next()
2182 static struct key_vector *fib_trie_get_first(struct fib_trie_iter *iter,  in fib_trie_get_first()
2185 	struct key_vector *n, *pn;  in fib_trie_get_first()
2210 	struct key_vector *n;  in trie_collect_stats()
2275 	bytes += sizeof(struct key_vector *) * pointers;  in trie_show_stats()
2355 static struct key_vector *fib_trie_get_idx(struct seq_file *seq, loff_t pos)  in fib_trie_get_idx()
2367 			struct key_vector *n;  in fib_trie_get_idx()
2396 	struct key_vector *n;  in fib_trie_seq_next()
2482 	struct key_vector *n = v;  in fib_trie_seq_show()
2531 	struct key_vector *tnode;
2536 static struct key_vector *fib_route_get_idx(struct fib_route_iter *iter,  in fib_route_get_idx()
2539 	struct key_vector *l, **tp = &iter->tnode;  in fib_route_get_idx()
2599 	struct key_vector *l = NULL;  in fib_route_seq_next()
2649 	struct key_vector *l = v;  in fib_route_seq_show()