Searched refs:bkey_next (Results 1 – 6 of 6) sorted by relevance
70 while (bkey_next(k) != l->top) in bch_keylist_pop()71 k = bkey_next(k); in bch_keylist_pop()488 BUG_ON(bkey_next(p) != m); in make_bfloat()558 k = bkey_next(k); in bset_build_written_tree()561 k = bkey_next(k); in bset_build_written_tree()566 while (bkey_next(k) != end(t->data)) in bset_build_written_tree()567 k = bkey_next(k); in bset_build_written_tree()597 if (bkey_next(k) == end(t->data)) { in bch_bset_fix_invalidated_key()651 k = bkey_next(k); in bch_bset_fix_lookup_table()664 k = bkey_next(k)) in bch_bset_fix_lookup_table()[all …]
95 ? &START_KEY(bkey_next(k)) in skipped_backwards()96 : bkey_next(k)) > 0; in skipped_backwards()104 for (k = i->start; k < end(i); k = bkey_next(k)) { in dump_bset()119 if (bkey_next(k) < end(i) && in dump_bset()276 for (k = i->start; bkey_next(k) < end(i); k = bkey_next(k)) in bch_check_key_order_msg()527 k = bkey_next(k), l = bkey_next(l))
217 static inline struct bkey *bkey_next(const struct bkey *k) in bkey_next() function244 l->top = bkey_next(l->top); in bch_keylist_push()
265 k = bkey_next(k)) { in bch_journal_mark()302 k = bkey_next(k)) { in bch_journal_replay()
445 struct bkey *n = bkey_next(src); in bch_insert_data_error()450 dst = bkey_next(dst); in bch_insert_data_error()
1245 k = bkey_next(k)) { in btree_gc_coalesce()1753 top = bkey_next(k); in fix_overlapping_extents()1828 prev = m, m = bkey_next(m); in btree_insert_key()