bkey_to_cacheline

1055

t->size < bkey_to_cacheline(t, bset_bkey_last(t->data)));

1064

inorder_to_tree(bkey_to_cacheline(t, i.l), t)),

701

bkey_to_cacheline(t, bset_bkey_last(t->data)),

715

while (bkey_to_cacheline(t, k) < cacheline) {

752

inorder = bkey_to_cacheline(t, k);

788

unsigned int j = bkey_to_cacheline(t, k);

828

if (t->size == bkey_to_cacheline(t, k)) {