Home
last modified time | relevance | path

Searched refs:bkey_next (Results 1 – 7 of 7) sorted by relevance

/drivers/md/bcache/
A Dbset.c26 next = bkey_next(k); in bch_dump_bset()
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()
725 k = bkey_next(k); in bch_bset_build_written_tree()
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()
[all …]
A Dbset.h516 l->top = bkey_next(k); in bch_keylist_init_single()
521 l->top = bkey_next(l->top); in bch_keylist_push()
A Dextents.c33 i->k = bkey_next(i->k); in sort_key_next()
430 top = bkey_next(k); in bch_extent_insert_fixup()
A Dbcache_ondisk.h118 static inline struct bkey *bkey_next(const struct bkey *k) in bkey_next() function
A Djournal.c326 k = bkey_next(k)) in bch_journal_mark()
376 k = bkey_next(k)) { in bch_journal_replay()
A Drequest.c155 struct bkey *n = bkey_next(src); in CLOSURE_CALLBACK()
160 dst = bkey_next(dst); in CLOSURE_CALLBACK()
A Dbtree.c1413 k = bkey_next(k)) { in btree_gc_coalesce()

Completed in 26 milliseconds