btree_keys_cachelines
return btree_keys_cachelines(b) * sizeof(struct bkey_float);
return btree_keys_cachelines(b) * sizeof(uint8_t);
if (t->tree != b->set->tree + btree_keys_cachelines(b)) {
b->set->tree + btree_keys_cachelines(b) - t->tree);
if (t->size == b->set->tree + btree_keys_cachelines(b) - t->tree)