89 #define KEYLENGTH	(8*sizeof(t_key))
90 #define KEY_MAX		((t_key)~0)
92 typedef unsigned int t_key;  typedef
99 	t_key key;
113 	t_key empty_children;		/* KEYLENGTH bits needed */
114 	t_key full_children;		/* KEYLENGTH bits needed */
196 static inline unsigned long get_index(t_key key, struct key_vector *kv)  in get_index()
327 static struct key_vector *leaf_new(t_key key, struct fib_alias *fa)  in leaf_new()
350 static struct key_vector *tnode_new(t_key key, int pos, int bits)  in tnode_new()
442 static inline void put_child_root(struct key_vector *tp, t_key key,  in put_child_root()
515 	t_key m;  in inflate()
996 			   struct fib_alias *new, t_key key)  in fib_insert_node()
1046 			    struct fib_alias *fa, t_key key)  in fib_insert_alias()
1261 static inline t_key prefix_mismatch(t_key key, struct key_vector *n)  in prefix_mismatch()
1263 	t_key prefix = n->key;  in prefix_mismatch()
1276 	const t_key key = ntohl(flp->daddr);  in fib_table_lookup()
1280 	t_key cindex;  in fib_table_lookup()
1366 				t_key pkey = pn->key;  in fib_table_lookup()
1563 static struct key_vector *leaf_walk_rcu(struct key_vector **tn, t_key key)  in leaf_walk_rcu()
1591 			t_key pkey = pn->key;  in leaf_walk_rcu()
1633 			t_key pkey = pn->key;  in fib_trie_free()
1685 	t_key key = 0;  in fib_trie_unmerge()
1749 			t_key pkey = pn->key;  in fib_table_flush_external()
1824 			t_key pkey = pn->key;  in fib_table_flush()
1948 	t_key key = cb->args[3];  in fib_table_dump()
2033 	t_key pkey;  in fib_trie_get_next()
2450 	t_key	key;
2459 	t_key key;  in fib_route_get_idx()
2524 	t_key key = iter->key;  in fib_route_seq_next()