98 struct key_vector {  struct
107 		struct key_vector __rcu *tnode[0];  argument
115 	struct key_vector __rcu *parent;
116 	struct key_vector kv[1];
145 	struct key_vector kv[1];
151 static struct key_vector *resize(struct trie *t, struct key_vector *tn);
164 static inline struct tnode *tn_info(struct key_vector *kv)  in tn_info()
178 static inline void node_set_parent(struct key_vector *n, struct key_vector *tp)  in node_set_parent()
189 static inline unsigned long child_length(const struct key_vector *tn)  in child_length()
196 static inline unsigned long get_index(t_key key, struct key_vector *kv)  in get_index()
282 	ilog2((PAGE_SIZE - TNODE_SIZE(0)) / sizeof(struct key_vector *))
284 	ilog2((SIZE_MAX - TNODE_SIZE(0)) / sizeof(struct key_vector *))
317 static inline void empty_child_inc(struct key_vector *n)  in empty_child_inc()
322 static inline void empty_child_dec(struct key_vector *n)  in empty_child_dec()
327 static struct key_vector *leaf_new(t_key key, struct fib_alias *fa)  in leaf_new()
329 	struct key_vector *l;  in leaf_new()
350 static struct key_vector *tnode_new(t_key key, int pos, int bits)  in tnode_new()
353 	struct key_vector *tn;  in tnode_new()
364 		 sizeof(struct key_vector *) << bits);  in tnode_new()
383 static inline int tnode_full(struct key_vector *tn, struct key_vector *n)  in tnode_full()
391 static void put_child(struct key_vector *tn, unsigned long i,  in put_child()
392 		      struct key_vector *n)  in put_child()
394 	struct key_vector *chi = get_child(tn, i);  in put_child()
420 static void update_children(struct key_vector *tn)  in update_children()
426 		struct key_vector *inode = get_child(tn, --i);  in update_children()
442 static inline void put_child_root(struct key_vector *tp, t_key key,  in put_child_root()
443 				  struct key_vector *n)  in put_child_root()
451 static inline void tnode_free_init(struct key_vector *tn)  in tnode_free_init()
456 static inline void tnode_free_append(struct key_vector *tn,  in tnode_free_append()
457 				     struct key_vector *n)  in tnode_free_append()
463 static void tnode_free(struct key_vector *tn)  in tnode_free()
481 static struct key_vector *replace(struct trie *t,  in replace()
482 				  struct key_vector *oldtnode,  in replace()
483 				  struct key_vector *tn)  in replace()
485 	struct key_vector *tp = node_parent(oldtnode);  in replace()
500 		struct key_vector *inode = get_child(tn, --i);  in replace()
510 static struct key_vector *inflate(struct trie *t,  in inflate()
511 				  struct key_vector *oldtnode)  in inflate()
513 	struct key_vector *tn;  in inflate()
532 		struct key_vector *inode = get_child(oldtnode, --i);  in inflate()
533 		struct key_vector *node0, *node1;  in inflate()
606 static struct key_vector *halve(struct trie *t,  in halve()
607 				struct key_vector *oldtnode)  in halve()
609 	struct key_vector *tn;  in halve()
627 		struct key_vector *node1 = get_child(oldtnode, --i);  in halve()
628 		struct key_vector *node0 = get_child(oldtnode, --i);  in halve()
629 		struct key_vector *inode;  in halve()
661 static struct key_vector *collapse(struct trie *t,  in collapse()
662 				   struct key_vector *oldtnode)  in collapse()
664 	struct key_vector *n, *tp;  in collapse()
682 static unsigned char update_suffix(struct key_vector *tn)  in update_suffix()
693 		struct key_vector *n = get_child(tn, i);  in update_suffix()
774 static inline bool should_inflate(struct key_vector *tp, struct key_vector *tn)  in should_inflate()
789 static inline bool should_halve(struct key_vector *tp, struct key_vector *tn)  in should_halve()
803 static inline bool should_collapse(struct key_vector *tn)  in should_collapse()
818 static struct key_vector *resize(struct trie *t, struct key_vector *tn)  in resize()
823 	struct key_vector *tp = node_parent(tn);  in resize()
897 static void leaf_pull_suffix(struct key_vector *tp, struct key_vector *l)  in leaf_pull_suffix()
906 static void leaf_push_suffix(struct key_vector *tn, struct key_vector *l)  in leaf_push_suffix()
918 static struct key_vector *fib_find_node(struct trie *t,  in fib_find_node()
919 					struct key_vector **tp, u32 key)  in fib_find_node()
921 	struct key_vector *pn, *n = t->kv;  in fib_find_node()
989 static void trie_rebalance(struct trie *t, struct key_vector *tn)  in trie_rebalance()
995 static int fib_insert_node(struct trie *t, struct key_vector *tp,  in fib_insert_node()
998 	struct key_vector *n, *l;  in fib_insert_node()
1014 		struct key_vector *tn;  in fib_insert_node()
1044 static int fib_insert_alias(struct trie *t, struct key_vector *tp,  in fib_insert_alias()
1045 			    struct key_vector *l, struct fib_alias *new,  in fib_insert_alias()
1085 	struct key_vector *l, *tp;  in fib_table_insert()
1261 static inline t_key prefix_mismatch(t_key key, struct key_vector *n)  in prefix_mismatch()
1277 	struct key_vector *n, *pn;  in fib_table_lookup()
1336 		struct key_vector __rcu **cptr = n->tnode;  in fib_table_lookup()
1460 static void fib_remove_alias(struct trie *t, struct key_vector *tp,  in fib_remove_alias()
1461 			     struct key_vector *l, struct fib_alias *old)  in fib_remove_alias()
1494 	struct key_vector *l, *tp;  in fib_table_delete()
1563 static struct key_vector *leaf_walk_rcu(struct key_vector **tn, t_key key)  in leaf_walk_rcu()
1565 	struct key_vector *pn, *n = *tn;  in leaf_walk_rcu()
1623 	struct key_vector *pn = t->kv;  in fib_trie_free()
1630 		struct key_vector *n;  in fib_trie_free()
1681 	struct key_vector *l, *tp = ot->kv;  in fib_trie_unmerge()
1697 		struct key_vector *local_l = NULL, *local_tp;  in fib_trie_unmerge()
1738 	struct key_vector *pn = t->kv;  in fib_table_flush_external()
1746 		struct key_vector *n;  in fib_table_flush_external()
1812 	struct key_vector *pn = t->kv;  in fib_table_flush()
1821 		struct key_vector *n;  in fib_table_flush()
1897 static int fn_trie_dump_leaf(struct key_vector *l, struct fib_table *tb,  in fn_trie_dump_leaf()
1943 	struct key_vector *l, *tp = t->kv;  in fib_table_dump()
2024 	struct key_vector *tnode;
2029 static struct key_vector *fib_trie_get_next(struct fib_trie_iter *iter)  in fib_trie_get_next()
2032 	struct key_vector *pn = iter->tnode;  in fib_trie_get_next()
2040 			struct key_vector *n = get_child_rcu(pn, cindex++);  in fib_trie_get_next()
2072 static struct key_vector *fib_trie_get_first(struct fib_trie_iter *iter,  in fib_trie_get_first()
2075 	struct key_vector *n, *pn;  in fib_trie_get_first()
2100 	struct key_vector *n;  in trie_collect_stats()
2165 	bytes += sizeof(struct key_vector *) * pointers;  in trie_show_stats()
2258 static struct key_vector *fib_trie_get_idx(struct seq_file *seq, loff_t pos)  in fib_trie_get_idx()
2270 			struct key_vector *n;  in fib_trie_get_idx()
2299 	struct key_vector *n;  in fib_trie_seq_next()
2385 	struct key_vector *n = v;  in fib_trie_seq_show()
2448 	struct key_vector *tnode;
2453 static struct key_vector *fib_route_get_idx(struct fib_route_iter *iter,  in fib_route_get_idx()
2457 	struct key_vector *l, **tp = &iter->tnode;  in fib_route_get_idx()
2523 	struct key_vector *l = NULL;  in fib_route_seq_next()
2573 	struct key_vector *l = v;  in fib_route_seq_show()