110 #define KEYLENGTH	(8*sizeof(t_key))  macro
115 #define IS_TRIE(n)	((n)->pos >= KEYLENGTH)
223 	if ((BITS_PER_LONG <= KEYLENGTH) && (KEYLENGTH == kv->pos))  in get_index()
382 	BUG_ON(!bits || (shift > KEYLENGTH));  in tnode_new()
391 	if (bits == KEYLENGTH)  in tnode_new()
397 	tn->key = (shift < KEYLENGTH) ? (key >> shift) << shift : 0;  in tnode_new()
838 	if ((tn->bits == KEYLENGTH) && tn_info(tn)->full_children)  in should_collapse()
1013 	u8 slen = KEYLENGTH - fri->dst_len;  in fib_find_matching_alias()
1150 	if (plen > KEYLENGTH) {  in fib_valid_key_len()
1155 	if ((plen < KEYLENGTH) && (key << plen)) {  in fib_valid_key_len()
1177 	u8 slen = KEYLENGTH - plen;  in fib_table_insert()
1531 		if ((BITS_PER_LONG > KEYLENGTH) || (fa->fa_slen < KEYLENGTH)) {  in fib_table_lookup()
1577 			res->prefixlen = KEYLENGTH - fa->fa_slen;  in fib_table_lookup()
1658 	call_fib_entry_notifiers(net, fib_event, key, KEYLENGTH - slen,  in fib_notify_alias_delete()
1670 	u8 slen = KEYLENGTH - plen;  in fib_table_delete()
2103 				  KEYLENGTH - fa->fa_slen, tb->tb_id,  in __fib_info_notify_update()
2112 						 KEYLENGTH - fa->fa_slen, fa,  in __fib_info_notify_update()
2157 					      l->key, KEYLENGTH - fa->fa_slen,  in fib_leaf_notify()
2271 				fri.dst_len = KEYLENGTH - fa->fa_slen;  in fn_trie_dump_leaf()
2384 	t->kv[0].pos = KEYLENGTH;  in fib_trie_table()
2385 	t->kv[0].slen = KEYLENGTH;  in fib_trie_table()
2763 			   &prf, KEYLENGTH - n->pos - n->bits, n->bits,  in fib_trie_seq_show()
2778 				   KEYLENGTH - fa->fa_slen,  in fib_trie_seq_show()
2938 		__be32 mask = inet_make_mask(KEYLENGTH - fa->fa_slen);  in fib_route_seq_show()