Home
last modified time | relevance | path

Searched refs:bset_bkey_last (Results 1 – 6 of 6) sorted by relevance

/linux/drivers/md/bcache/
H A Dbset.c25 for (k = i->start; k < bset_bkey_last(i); k = next) { in bch_dump_bset()
36 if (next < bset_bkey_last(i) && in bch_dump_bset()
705 bkey_to_cacheline(t, bset_bkey_last(t->data)), in bch_bset_build_written_tree()
728 while (bkey_next(k) != bset_bkey_last(t->data)) in bch_bset_build_written_tree()
748 if (k < bset_bkey_last(t->data)) in bch_bset_fix_invalidated_key()
761 if (bkey_next(k) == bset_bkey_last(t->data)) { in bch_bset_fix_invalidated_key()
830 k != bset_bkey_last(t->data); in bch_bset_fix_lookup_table()
873 (void *) bset_bkey_last(t->data) - (void *) where); in bch_bset_insert()
911 while (m != bset_bkey_last(i) && in bch_btree_insert_key()
924 if (m != bset_bkey_last(i) && in bch_btree_insert_key()
[all …]
H A Djournal.c325 k < bset_bkey_last(&i->j); in bch_journal_mark()
375 k < bset_bkey_last(&i->j); in bch_journal_replay()
940 memcpy(bset_bkey_last(w->data), keys->keys, bch_keylist_bytes(keys)); in bch_journal()
H A Ddebug.c70 (void *) bset_bkey_last(inmemory) - in bch_btree_verify()
H A Dbtree.c142 void *data = (void *) i + 8, *end = bset_bkey_last(i); in btree_csum_set()
202 bch_btree_iter_push(&iter, i->start, bset_bkey_last(i)); in bch_btree_node_read_done()
1417 k < bset_bkey_last(n2); in btree_gc_coalesce()
1452 memcpy(bset_bkey_last(n1), in btree_gc_coalesce()
1461 (void *) bset_bkey_last(n2) - in btree_gc_coalesce()
2314 bset_bkey_last(btree_bset_first(n1)), in btree_split()
H A Dbset.h402 #define bset_bkey_last(i) bkey_idx((struct bkey *) (i)->d, \ macro
H A Dbcache.h854 ((void *) bset_bkey_last(i)) - \