23 	u64 key[2] = {k1, k2};  in btree_lookup128()  local
24 	return btree_lookup(&head->h, &btree_geo128, (unsigned long *)&key);  in btree_lookup128()
30 	u64 key[2] = {*k1, *k2};  in btree_get_prev128()  local
34 			     (unsigned long *)&key);  in btree_get_prev128()
35 	*k1 = key[0];  in btree_get_prev128()
36 	*k2 = key[1];  in btree_get_prev128()
43 	u64 key[2] = {k1, k2};  in btree_insert128()  local
45 			    (unsigned long *)&key, val, gfp);  in btree_insert128()
51 	u64 key[2] = {k1, k2};  in btree_update128()  local
53 			    (unsigned long *)&key, val);  in btree_update128()
58 	u64 key[2] = {k1, k2};  in btree_remove128()  local
59 	return btree_remove(&head->h, &btree_geo128, (unsigned long *)&key);  in btree_remove128()
64 	u64 key[2];  in btree_last128()  local
67 	val = btree_last(&head->h, &btree_geo128, (unsigned long *)&key[0]);  in btree_last128()
69 		*k1 = key[0];  in btree_last128()
70 		*k2 = key[1];  in btree_last128()