Searched refs:bkey_next (Results 1 – 13 of 13) sorted by relevance
39 bkey_next(l->keys), in bch2_keylist_pop_front()47 BUG_ON(bkey_next(k) != l->top && in bch2_verify_keylist_sorted()48 bpos_ge(k->k.p, bkey_next(k)->k.p)); in bch2_verify_keylist_sorted()
23 l->top = bkey_next(l->top); in bch2_keylist_push()55 _k = bkey_next(_k))
58 _k = bkey_next(_k))
15 static inline struct bkey_i *bkey_next(struct bkey_i *k) in bkey_next() function
346 if (journal_entry_err_on((void *) bkey_next(k) > in journal_validate_key()361 memmove(k, bkey_next(k), next - (void *) bkey_next(k)); in journal_validate_key()374 memmove(k, bkey_next(k), next - (void *) bkey_next(k)); in journal_validate_key()407 k = bkey_next(k); in journal_entry_btree_keys_validate()
486 n = bkey_next(src); in bch2_write_drop_io_error_ptrs()498 dst = bkey_next(dst); in bch2_write_drop_io_error_ptrs()
26 next = bkey_next(k); in bch_dump_bset()117 struct bkey *k = iter->heap.data->k, *next = bkey_next(k); in bch_btree_iter_next_check()170 while (bkey_next(k) != l->top) in bch_keylist_pop()171 k = bkey_next(k); in bch_keylist_pop()182 bkey_next(l->keys), in bch_keylist_pop_front()611 BUG_ON(bkey_next(p) != m); in make_bfloat()721 k = bkey_next(k); in bch_bset_build_written_tree()728 while (bkey_next(k) != bset_bkey_last(t->data)) in bch_bset_build_written_tree()729 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 …]
510 l->top = bkey_next(k); in bch_keylist_init_single()515 l->top = bkey_next(l->top); in bch_keylist_push()
33 i->k = bkey_next(i->k); in sort_key_next()445 top = bkey_next(k); in bch_extent_insert_fixup()
118 static inline struct bkey *bkey_next(const struct bkey *k) in bkey_next() function
326 k = bkey_next(k)) in bch_journal_mark()376 k = bkey_next(k)) { in bch_journal_replay()
155 struct bkey *n = bkey_next(src); in CLOSURE_CALLBACK()160 dst = bkey_next(dst); in CLOSURE_CALLBACK()
1418 k = bkey_next(k)) { in btree_gc_coalesce()