bset_bkey_last
((void *) bset_bkey_last(i)) - \
r = bset_bkey_last(t->data);
i.r = bset_bkey_last(t->data);
return bset_bkey_last(t->data);
t->size < bkey_to_cacheline(t, bset_bkey_last(t->data)));
BUG_ON(i.r != bset_bkey_last(t->data) &&
bch_btree_iter_push(&iter->iter, ret, bset_bkey_last(start->data));
(void *) bset_bkey_last(out) - (void *) out->start);
for (k = i->start; k < bset_bkey_last(i); k = next) {
if (next < bset_bkey_last(i) &&
bkey_to_cacheline(t, bset_bkey_last(t->data)),
while (bkey_next(k) != bset_bkey_last(t->data))
if (k < bset_bkey_last(t->data))
if (bkey_next(k) == bset_bkey_last(t->data)) {
k != bset_bkey_last(t->data);
(void *) bset_bkey_last(t->data) - (void *) where);
while (m != bset_bkey_last(i) &&
if (m != bset_bkey_last(i) &&
if (m != bset_bkey_last(i) &&
ri < t->size ? table_to_bkey(t, ri) : bset_bkey_last(t->data)
k < bset_bkey_last(n2);
void *data = (void *) i + 8, *end = bset_bkey_last(i);
memcpy(bset_bkey_last(n1),
(void *) bset_bkey_last(n2) -
bch_btree_iter_push(iter, i->start, bset_bkey_last(i));
bset_bkey_last(btree_bset_first(n1)),
(void *) bset_bkey_last(inmemory) -
k < bset_bkey_last(&i->j);
k < bset_bkey_last(&i->j);
memcpy(bset_bkey_last(w->data), keys->keys, bch_keylist_bytes(keys));