176 static inline void node_set_parent(struct key_vector *n, struct key_vector *tp)  in node_set_parent()
436 static inline void put_child_root(struct key_vector *tp, t_key key,  in put_child_root()
479 	struct key_vector *tp = node_parent(oldtnode);  in replace()  local
658 	struct key_vector *n, *tp;  in collapse()  local
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()
817 	struct key_vector *tp = node_parent(tn);  in resize()  local
891 static void leaf_pull_suffix(struct key_vector *tp, struct key_vector *l)  in leaf_pull_suffix()
913 					struct key_vector **tp, u32 key)  in fib_find_node()
989 static int fib_insert_node(struct trie *t, struct key_vector *tp,  in fib_insert_node()
1038 static int fib_insert_alias(struct trie *t, struct key_vector *tp,  in fib_insert_alias()
1079 	struct key_vector *l, *tp;  in fib_table_insert()  local
1438 static void fib_remove_alias(struct trie *t, struct key_vector *tp,  in fib_remove_alias()
1472 	struct key_vector *l, *tp;  in fib_table_delete()  local
1659 	struct key_vector *l, *tp = ot->kv;  in fib_trie_unmerge()  local
1923 	struct key_vector *l, *tp = t->kv;  in fib_table_dump()  local
2437 	struct key_vector *l, **tp = &iter->tnode;  in fib_route_get_idx()  local