Searched refs:bkey_next (Results 1 – 7 of 7) sorted by relevance
24 next = bkey_next(k); in bch_dump_bset()111 struct bkey *k = iter->data->k, *next = bkey_next(k); in bch_btree_iter_next_check()163 while (bkey_next(k) != l->top) in bch_keylist_pop()164 k = bkey_next(k); in bch_keylist_pop()174 bkey_next(l->keys), in bch_keylist_pop_front()569 BUG_ON(bkey_next(p) != m); in make_bfloat()660 prev = k, k = bkey_next(k); in bch_bset_build_written_tree()666 while (bkey_next(k) != bset_bkey_last(t->data)) in bch_bset_build_written_tree()667 k = bkey_next(k); in bch_bset_build_written_tree()700 if (bkey_next(k) == bset_bkey_last(t->data)) { in bch_bset_fix_invalidated_key()[all …]
484 l->top = bkey_next(k); in bch_keylist_init_single()489 l->top = bkey_next(l->top); in bch_keylist_push()
32 i->k = bkey_next(i->k); in sort_key_next()427 top = bkey_next(k); in bch_extent_insert_fixup()
299 k = bkey_next(k)) in bch_journal_mark()331 k = bkey_next(k)) { in bch_journal_replay()
162 struct bkey *n = bkey_next(src); in bch_data_insert_error()167 dst = bkey_next(dst); in bch_data_insert_error()
1352 k = bkey_next(k)) { in btree_gc_coalesce()
116 static inline struct bkey *bkey_next(const struct bkey *k) in bkey_next() function