87 #define KEYLENGTH	(8*sizeof(t_key))
88 #define KEY_MAX		((t_key)~0)
90 typedef unsigned int t_key;  typedef
97 	t_key key;
111 	t_key empty_children;		/* KEYLENGTH bits needed */
112 	t_key full_children;		/* KEYLENGTH bits needed */
194 static inline unsigned long get_index(t_key key, struct key_vector *kv)  in get_index()
325 static struct key_vector *leaf_new(t_key key, struct fib_alias *fa)  in leaf_new()
346 static struct key_vector *tnode_new(t_key key, int pos, int bits)  in tnode_new()
436 static inline void put_child_root(struct key_vector *tp, t_key key,  in put_child_root()
509 	t_key m;  in inflate()
990 			   struct fib_alias *new, t_key key)  in fib_insert_node()
1040 			    struct fib_alias *fa, t_key key)  in fib_insert_alias()
1252 static inline t_key prefix_mismatch(t_key key, struct key_vector *n)  in prefix_mismatch()
1254 	t_key prefix = n->key;  in prefix_mismatch()
1267 	const t_key key = ntohl(flp->daddr);  in fib_table_lookup()
1271 	t_key cindex;  in fib_table_lookup()
1355 				t_key pkey = pn->key;  in fib_table_lookup()
1541 static struct key_vector *leaf_walk_rcu(struct key_vector **tn, t_key key)  in leaf_walk_rcu()
1569 			t_key pkey = pn->key;  in leaf_walk_rcu()
1611 			t_key pkey = pn->key;  in fib_trie_free()
1663 	t_key key = 0;  in fib_trie_unmerge()
1727 			t_key pkey = pn->key;  in fib_table_flush_external()
1803 			t_key pkey = pn->key;  in fib_table_flush()
1928 	t_key key = cb->args[3];  in fib_table_dump()
2014 	t_key pkey;  in fib_trie_get_next()
2430 	t_key	key;
2439 	t_key key;  in fib_route_get_idx()
2504 	t_key key = iter->key;  in fib_route_seq_next()