Lines Matching refs:bkey_next
26 next = bkey_next(k); in bch_dump_bset()
113 struct bkey *k = iter->data->k, *next = bkey_next(k); in bch_btree_iter_next_check()
166 while (bkey_next(k) != l->top) in bch_keylist_pop()
167 k = bkey_next(k); in bch_keylist_pop()
178 bkey_next(l->keys), in bch_keylist_pop_front()
607 BUG_ON(bkey_next(p) != m); in make_bfloat()
717 k = bkey_next(k); in bch_bset_build_written_tree()
724 while (bkey_next(k) != bset_bkey_last(t->data)) in bch_bset_build_written_tree()
725 k = bkey_next(k); in bch_bset_build_written_tree()
757 if (bkey_next(k) == bset_bkey_last(t->data)) { in bch_bset_fix_invalidated_key()
814 k = bkey_next(k); in bch_bset_fix_lookup_table()
827 k = bkey_next(k)) in bch_bset_fix_lookup_table()
908 m = bkey_next(m); in bch_btree_insert_key()
1073 i.l = bkey_next(i.l); in __bch_bset_search()
1142 iter->data->k = bkey_next(iter->data->k); in __bch_btree_iter_next()
1225 last = bkey_next(last); in btree_mergesort()
1230 out->keys = last ? (uint64_t *) bkey_next(last) - out->d : 0; in btree_mergesort()