120 struct key_vector {  struct
129 		struct key_vector __rcu *tnode[0];  argument
137 	struct key_vector __rcu *parent;
138 	struct key_vector kv[1];
167 	struct key_vector kv[1];
173 static struct key_vector *resize(struct trie *t, struct key_vector *tn);
188 static inline struct tnode *tn_info(struct key_vector *kv)  in tn_info()
202 static inline void node_set_parent(struct key_vector *n, struct key_vector *tp)  in node_set_parent()
213 static inline unsigned long child_length(const struct key_vector *tn)  in child_length()
220 static inline unsigned long get_index(t_key key, struct key_vector *kv)  in get_index()
306 	ilog2((PAGE_SIZE - TNODE_SIZE(0)) / sizeof(struct key_vector *))
308 	ilog2((SIZE_MAX - TNODE_SIZE(0)) / sizeof(struct key_vector *))
339 static inline void empty_child_inc(struct key_vector *n)  in empty_child_inc()
347 static inline void empty_child_dec(struct key_vector *n)  in empty_child_dec()
355 static struct key_vector *leaf_new(t_key key, struct fib_alias *fa)  in leaf_new()
357 	struct key_vector *l;  in leaf_new()
378 static struct key_vector *tnode_new(t_key key, int pos, int bits)  in tnode_new()
381 	struct key_vector *tn;  in tnode_new()
392 		 sizeof(struct key_vector *) << bits);  in tnode_new()
411 static inline int tnode_full(struct key_vector *tn, struct key_vector *n)  in tnode_full()
419 static void put_child(struct key_vector *tn, unsigned long i,  in put_child()
420 		      struct key_vector *n)  in put_child()
422 	struct key_vector *chi = get_child(tn, i);  in put_child()
448 static void update_children(struct key_vector *tn)  in update_children()
454 		struct key_vector *inode = get_child(tn, --i);  in update_children()
470 static inline void put_child_root(struct key_vector *tp, t_key key,  in put_child_root()
471 				  struct key_vector *n)  in put_child_root()
479 static inline void tnode_free_init(struct key_vector *tn)  in tnode_free_init()
484 static inline void tnode_free_append(struct key_vector *tn,  in tnode_free_append()
485 				     struct key_vector *n)  in tnode_free_append()
491 static void tnode_free(struct key_vector *tn)  in tnode_free()
509 static struct key_vector *replace(struct trie *t,  in replace()
510 				  struct key_vector *oldtnode,  in replace()
511 				  struct key_vector *tn)  in replace()
513 	struct key_vector *tp = node_parent(oldtnode);  in replace()
528 		struct key_vector *inode = get_child(tn, --i);  in replace()
538 static struct key_vector *inflate(struct trie *t,  in inflate()
539 				  struct key_vector *oldtnode)  in inflate()
541 	struct key_vector *tn;  in inflate()
560 		struct key_vector *inode = get_child(oldtnode, --i);  in inflate()
561 		struct key_vector *node0, *node1;  in inflate()
634 static struct key_vector *halve(struct trie *t,  in halve()
635 				struct key_vector *oldtnode)  in halve()
637 	struct key_vector *tn;  in halve()
655 		struct key_vector *node1 = get_child(oldtnode, --i);  in halve()
656 		struct key_vector *node0 = get_child(oldtnode, --i);  in halve()
657 		struct key_vector *inode;  in halve()
689 static struct key_vector *collapse(struct trie *t,  in collapse()
690 				   struct key_vector *oldtnode)  in collapse()
692 	struct key_vector *n, *tp;  in collapse()
710 static unsigned char update_suffix(struct key_vector *tn)  in update_suffix()
728 		struct key_vector *n = get_child(tn, i);  in update_suffix()
805 static inline bool should_inflate(struct key_vector *tp, struct key_vector *tn)  in should_inflate()
820 static inline bool should_halve(struct key_vector *tp, struct key_vector *tn)  in should_halve()
834 static inline bool should_collapse(struct key_vector *tn)  in should_collapse()
849 static struct key_vector *resize(struct trie *t, struct key_vector *tn)  in resize()
854 	struct key_vector *tp = node_parent(tn);  in resize()
914 static void node_pull_suffix(struct key_vector *tn, unsigned char slen)  in node_pull_suffix()
928 static void node_push_suffix(struct key_vector *tn, unsigned char slen)  in node_push_suffix()
937 static struct key_vector *fib_find_node(struct trie *t,  in fib_find_node()
938 					struct key_vector **tp, u32 key)  in fib_find_node()
940 	struct key_vector *pn, *n = t->kv;  in fib_find_node()
1008 static void trie_rebalance(struct trie *t, struct key_vector *tn)  in trie_rebalance()
1014 static int fib_insert_node(struct trie *t, struct key_vector *tp,  in fib_insert_node()
1017 	struct key_vector *n, *l;  in fib_insert_node()
1033 		struct key_vector *tn;  in fib_insert_node()
1067 static int fib_insert_alias(struct trie *t, struct key_vector *tp,  in fib_insert_alias()
1068 			    struct key_vector *l, struct fib_alias *new,  in fib_insert_alias()
1126 	struct key_vector *l, *tp;  in fib_table_insert()
1304 static inline t_key prefix_mismatch(t_key key, struct key_vector *n)  in prefix_mismatch()
1320 	struct key_vector *n, *pn;  in fib_table_lookup()
1379 		struct key_vector __rcu **cptr = n->tnode;  in fib_table_lookup()
1515 static void fib_remove_alias(struct trie *t, struct key_vector *tp,  in fib_remove_alias()
1516 			     struct key_vector *l, struct fib_alias *old)  in fib_remove_alias()
1552 	struct key_vector *l, *tp;  in fib_table_delete()
1618 static struct key_vector *leaf_walk_rcu(struct key_vector **tn, t_key key)  in leaf_walk_rcu()
1620 	struct key_vector *pn, *n = *tn;  in leaf_walk_rcu()
1678 	struct key_vector *pn = t->kv;  in fib_trie_free()
1685 		struct key_vector *n;  in fib_trie_free()
1736 	struct key_vector *l, *tp = ot->kv;  in fib_trie_unmerge()
1752 		struct key_vector *local_l = NULL, *local_tp;  in fib_trie_unmerge()
1795 	struct key_vector *pn = t->kv;  in fib_table_flush_external()
1803 		struct key_vector *n;  in fib_table_flush_external()
1864 	struct key_vector *pn = t->kv;  in fib_table_flush()
1873 		struct key_vector *n;  in fib_table_flush()
1952 	struct key_vector *pn = t->kv;  in __fib_info_notify_update()
1957 		struct key_vector *n;  in __fib_info_notify_update()
2018 static void fib_leaf_notify(struct net *net, struct key_vector *l,  in fib_leaf_notify()
2044 	struct key_vector *l, *tp = t->kv;  in fib_table_notify()
2087 static int fn_trie_dump_leaf(struct key_vector *l, struct fib_table *tb,  in fn_trie_dump_leaf()
2171 	struct key_vector *l, *tp = t->kv;  in fib_table_dump()
2255 	struct key_vector *tnode;
2260 static struct key_vector *fib_trie_get_next(struct fib_trie_iter *iter)  in fib_trie_get_next()
2263 	struct key_vector *pn = iter->tnode;  in fib_trie_get_next()
2271 			struct key_vector *n = get_child_rcu(pn, cindex++);  in fib_trie_get_next()
2303 static struct key_vector *fib_trie_get_first(struct fib_trie_iter *iter,  in fib_trie_get_first()
2306 	struct key_vector *n, *pn;  in fib_trie_get_first()
2331 	struct key_vector *n;  in trie_collect_stats()
2396 	bytes += sizeof(struct key_vector *) * pointers;  in trie_show_stats()
2476 static struct key_vector *fib_trie_get_idx(struct seq_file *seq, loff_t pos)  in fib_trie_get_idx()
2488 			struct key_vector *n;  in fib_trie_get_idx()
2517 	struct key_vector *n;  in fib_trie_seq_next()
2603 	struct key_vector *n = v;  in fib_trie_seq_show()
2652 	struct key_vector *tnode;
2657 static struct key_vector *fib_route_get_idx(struct fib_route_iter *iter,  in fib_route_get_idx()
2660 	struct key_vector *l, **tp = &iter->tnode;  in fib_route_get_idx()
2720 	struct key_vector *l = NULL;  in fib_route_seq_next()
2774 	struct key_vector *l = v;  in fib_route_seq_show()