bkey_next
i.l = bkey_next(i.l);
struct bkey *k = iter->data->k, *next = bkey_next(k);
iter->data->k = bkey_next(iter->data->k);
last = bkey_next(last);
out->keys = last ? (uint64_t *) bkey_next(last) - out->d : 0;
while (bkey_next(k) != l->top)
k = bkey_next(k);
bkey_next(l->keys),
next = bkey_next(k);
BUG_ON(bkey_next(p) != m);
k = bkey_next(k);
while (bkey_next(k) != bset_bkey_last(t->data))
k = bkey_next(k);
if (bkey_next(k) == bset_bkey_last(t->data)) {
k = bkey_next(k);
k = bkey_next(k))
m = bkey_next(m);
l->top = bkey_next(k);
l->top = bkey_next(l->top);
k = bkey_next(k)) {
i->k = bkey_next(i->k);
top = bkey_next(k);
k = bkey_next(k))
k = bkey_next(k)) {
struct bkey *n = bkey_next(src);
dst = bkey_next(dst);