52 	int keylen;  member
58 	.keylen = 1,
66 	.keylen = LONG_PER_U64,
73 	.keylen = 2 * LONG_PER_U64,
140 	for (i = geo->keylen - 1; i >= 0; i--) {  in dec_key()
150 	return &node[n * geo->keylen];  in bkey()
161 	longcpy(bkey(geo, node, n), key, geo->keylen);  in setkey()
172 	longset(bkey(geo, node, n), 0, geo->keylen);  in clearpair()
219 	longcpy(key, bkey(geo, node, 0), geo->keylen);  in btree_last()
227 	return longcmp(bkey(geo, node, pos), key, geo->keylen);  in keycmp()
234 	for (i = 0; i < geo->keylen; i++)  in keyzero()
316 	unsigned long *retry_key = NULL, key[geo->keylen];  in btree_get_prev()
323 	longcpy(key, __key, geo->keylen);  in btree_get_prev()
347 				longcpy(__key, bkey(geo, node, i), geo->keylen);  in btree_get_prev()
355 		longcpy(key, retry_key, geo->keylen);  in btree_get_prev()
642 	unsigned long key[geo->keylen];  in btree_merge()
643 	unsigned long dup[geo->keylen];  in btree_merge()
669 		longcpy(dup, key, geo->keylen);  in btree_merge()