Searched refs:bset_bkey_last (Results 1 – 6 of 6) sorted by relevance
25 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()744 if (k < bset_bkey_last(t->data)) in bch_bset_fix_invalidated_key()826 k != bset_bkey_last(t->data); in bch_bset_fix_lookup_table()905 while (m != bset_bkey_last(i) && in bch_btree_insert_key()918 if (m != bset_bkey_last(i) && in bch_btree_insert_key()923 if (m != bset_bkey_last(i) && in bch_btree_insert_key()1001 r = bset_bkey_last(t->data); in bset_search_tree()1037 i.r = bset_bkey_last(t->data); in __bch_bset_search()1047 return bset_bkey_last(t->data); in __bch_bset_search()[all …]
325 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()
70 (void *) bset_bkey_last(inmemory) - in bch_btree_verify()
142 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()1410 k < bset_bkey_last(n2); in btree_gc_coalesce()1445 memcpy(bset_bkey_last(n1), in btree_gc_coalesce()1454 (void *) bset_bkey_last(n2) - in btree_gc_coalesce()2294 bset_bkey_last(btree_bset_first(n1)), in btree_split()
408 #define bset_bkey_last(i) bkey_idx((struct bkey *) (i)->d, \ macro
851 ((void *) bset_bkey_last(i)) - \