96 struct key_vector {  struct
105 		struct key_vector __rcu *tnode[0];  argument
113 	struct key_vector __rcu *parent;
114 	struct key_vector kv[1];
143 	struct key_vector kv[1];
149 static struct key_vector *resize(struct trie *t, struct key_vector *tn);
162 static inline struct tnode *tn_info(struct key_vector *kv)  in tn_info()
176 static inline void node_set_parent(struct key_vector *n, struct key_vector *tp)  in node_set_parent()
187 static inline unsigned long child_length(const struct key_vector *tn)  in child_length()
194 static inline unsigned long get_index(t_key key, struct key_vector *kv)  in get_index()
280 	ilog2((PAGE_SIZE - TNODE_SIZE(0)) / sizeof(struct key_vector *))
282 	ilog2((SIZE_MAX - TNODE_SIZE(0)) / sizeof(struct key_vector *))
315 static inline void empty_child_inc(struct key_vector *n)  in empty_child_inc()
320 static inline void empty_child_dec(struct key_vector *n)  in empty_child_dec()
325 static struct key_vector *leaf_new(t_key key, struct fib_alias *fa)  in leaf_new()
328 	struct key_vector *l = kv->kv;  in leaf_new()
346 static struct key_vector *tnode_new(t_key key, int pos, int bits)  in tnode_new()
350 	struct key_vector *tn = tnode->kv;  in tnode_new()
356 		 sizeof(struct key_vector *) << bits);  in tnode_new()
377 static inline int tnode_full(struct key_vector *tn, struct key_vector *n)  in tnode_full()
385 static void put_child(struct key_vector *tn, unsigned long i,  in put_child()
386 		      struct key_vector *n)  in put_child()
388 	struct key_vector *chi = get_child(tn, i);  in put_child()
414 static void update_children(struct key_vector *tn)  in update_children()
420 		struct key_vector *inode = get_child(tn, --i);  in update_children()
436 static inline void put_child_root(struct key_vector *tp, t_key key,  in put_child_root()
437 				  struct key_vector *n)  in put_child_root()
445 static inline void tnode_free_init(struct key_vector *tn)  in tnode_free_init()
450 static inline void tnode_free_append(struct key_vector *tn,  in tnode_free_append()
451 				     struct key_vector *n)  in tnode_free_append()
457 static void tnode_free(struct key_vector *tn)  in tnode_free()
475 static struct key_vector *replace(struct trie *t,  in replace()
476 				  struct key_vector *oldtnode,  in replace()
477 				  struct key_vector *tn)  in replace()
479 	struct key_vector *tp = node_parent(oldtnode);  in replace()
494 		struct key_vector *inode = get_child(tn, --i);  in replace()
504 static struct key_vector *inflate(struct trie *t,  in inflate()
505 				  struct key_vector *oldtnode)  in inflate()
507 	struct key_vector *tn;  in inflate()
526 		struct key_vector *inode = get_child(oldtnode, --i);  in inflate()
527 		struct key_vector *node0, *node1;  in inflate()
600 static struct key_vector *halve(struct trie *t,  in halve()
601 				struct key_vector *oldtnode)  in halve()
603 	struct key_vector *tn;  in halve()
621 		struct key_vector *node1 = get_child(oldtnode, --i);  in halve()
622 		struct key_vector *node0 = get_child(oldtnode, --i);  in halve()
623 		struct key_vector *inode;  in halve()
655 static struct key_vector *collapse(struct trie *t,  in collapse()
656 				   struct key_vector *oldtnode)  in collapse()
658 	struct key_vector *n, *tp;  in collapse()
676 static unsigned char update_suffix(struct key_vector *tn)  in update_suffix()
687 		struct key_vector *n = get_child(tn, i);  in update_suffix()
768 static inline bool should_inflate(struct key_vector *tp, struct key_vector *tn)  in should_inflate()
783 static inline bool should_halve(struct key_vector *tp, struct key_vector *tn)  in should_halve()
797 static inline bool should_collapse(struct key_vector *tn)  in should_collapse()
812 static struct key_vector *resize(struct trie *t, struct key_vector *tn)  in resize()
817 	struct key_vector *tp = node_parent(tn);  in resize()
891 static void leaf_pull_suffix(struct key_vector *tp, struct key_vector *l)  in leaf_pull_suffix()
900 static void leaf_push_suffix(struct key_vector *tn, struct key_vector *l)  in leaf_push_suffix()
912 static struct key_vector *fib_find_node(struct trie *t,  in fib_find_node()
913 					struct key_vector **tp, u32 key)  in fib_find_node()
915 	struct key_vector *pn, *n = t->kv;  in fib_find_node()
983 static void trie_rebalance(struct trie *t, struct key_vector *tn)  in trie_rebalance()
989 static int fib_insert_node(struct trie *t, struct key_vector *tp,  in fib_insert_node()
992 	struct key_vector *n, *l;  in fib_insert_node()
1008 		struct key_vector *tn;  in fib_insert_node()
1038 static int fib_insert_alias(struct trie *t, struct key_vector *tp,  in fib_insert_alias()
1039 			    struct key_vector *l, struct fib_alias *new,  in fib_insert_alias()
1079 	struct key_vector *l, *tp;  in fib_table_insert()
1252 static inline t_key prefix_mismatch(t_key key, struct key_vector *n)  in prefix_mismatch()
1268 	struct key_vector *n, *pn;  in fib_table_lookup()
1325 		struct key_vector __rcu **cptr = n->tnode;  in fib_table_lookup()
1438 static void fib_remove_alias(struct trie *t, struct key_vector *tp,  in fib_remove_alias()
1439 			     struct key_vector *l, struct fib_alias *old)  in fib_remove_alias()
1472 	struct key_vector *l, *tp;  in fib_table_delete()
1541 static struct key_vector *leaf_walk_rcu(struct key_vector **tn, t_key key)  in leaf_walk_rcu()
1543 	struct key_vector *pn, *n = *tn;  in leaf_walk_rcu()
1601 	struct key_vector *pn = t->kv;  in fib_trie_free()
1608 		struct key_vector *n;  in fib_trie_free()
1659 	struct key_vector *l, *tp = ot->kv;  in fib_trie_unmerge()
1675 		struct key_vector *local_l = NULL, *local_tp;  in fib_trie_unmerge()
1716 	struct key_vector *pn = t->kv;  in fib_table_flush_external()
1724 		struct key_vector *n;  in fib_table_flush_external()
1791 	struct key_vector *pn = t->kv;  in fib_table_flush()
1800 		struct key_vector *n;  in fib_table_flush()
1877 static int fn_trie_dump_leaf(struct key_vector *l, struct fib_table *tb,  in fn_trie_dump_leaf()
1923 	struct key_vector *l, *tp = t->kv;  in fib_table_dump()
2005 	struct key_vector *tnode;
2010 static struct key_vector *fib_trie_get_next(struct fib_trie_iter *iter)  in fib_trie_get_next()
2013 	struct key_vector *pn = iter->tnode;  in fib_trie_get_next()
2021 			struct key_vector *n = get_child_rcu(pn, cindex++);  in fib_trie_get_next()
2053 static struct key_vector *fib_trie_get_first(struct fib_trie_iter *iter,  in fib_trie_get_first()
2056 	struct key_vector *n, *pn = t->kv;  in fib_trie_get_first()
2080 	struct key_vector *n;  in trie_collect_stats()
2145 	bytes += sizeof(struct key_vector *) * pointers;  in trie_show_stats()
2238 static struct key_vector *fib_trie_get_idx(struct seq_file *seq, loff_t pos)  in fib_trie_get_idx()
2250 			struct key_vector *n;  in fib_trie_get_idx()
2279 	struct key_vector *n;  in fib_trie_seq_next()
2365 	struct key_vector *n = v;  in fib_trie_seq_show()
2428 	struct key_vector *tnode;
2433 static struct key_vector *fib_route_get_idx(struct fib_route_iter *iter,  in fib_route_get_idx()
2437 	struct key_vector *l, **tp = &iter->tnode;  in fib_route_get_idx()
2503 	struct key_vector *l = NULL;  in fib_route_seq_next()
2553 	struct key_vector *l = v;  in fib_route_seq_show()