Searched refs:bkey_next (Results 1 – 7 of 7) sorted by relevance
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()165 while (bkey_next(k) != l->top) in bch_keylist_pop()166 k = bkey_next(k); in bch_keylist_pop()176 bkey_next(l->keys), in bch_keylist_pop_front()611 BUG_ON(bkey_next(p) != m); in make_bfloat()721 prev = k, k = bkey_next(k); in bch_bset_build_written_tree()727 while (bkey_next(k) != bset_bkey_last(t->data)) in bch_bset_build_written_tree()728 k = bkey_next(k); in bch_bset_build_written_tree()761 if (bkey_next(k) == bset_bkey_last(t->data)) { in bch_bset_fix_invalidated_key()[all …]
501 l->top = bkey_next(k); in bch_keylist_init_single()506 l->top = bkey_next(l->top); in bch_keylist_push()
33 i->k = bkey_next(i->k); in sort_key_next()430 top = bkey_next(k); in bch_extent_insert_fixup()
307 k = bkey_next(k)) in bch_journal_mark()339 k = bkey_next(k)) { in bch_journal_replay()
167 struct bkey *n = bkey_next(src); in bch_data_insert_error()172 dst = bkey_next(dst); in bch_data_insert_error()
1375 k = bkey_next(k)) { in btree_gc_coalesce()
117 static inline struct bkey *bkey_next(const struct bkey *k) in bkey_next() function
