Lines Matching refs:bset_bkey_last
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()
701 bkey_to_cacheline(t, bset_bkey_last(t->data)), in bch_bset_build_written_tree()
724 while (bkey_next(k) != bset_bkey_last(t->data)) in bch_bset_build_written_tree()
744 if (k < bset_bkey_last(t->data)) in bch_bset_fix_invalidated_key()
757 if (bkey_next(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()
869 (void *) bset_bkey_last(t->data) - (void *) where); in bch_bset_insert()
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()
955 ri < t->size ? table_to_bkey(t, ri) : bset_bkey_last(t->data) in bset_search_write_set()
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()
1055 t->size < bkey_to_cacheline(t, bset_bkey_last(t->data))); in __bch_bset_search()
1067 BUG_ON(i.r != bset_bkey_last(t->data) && in __bch_bset_search()
1119 bch_btree_iter_push(&iter->iter, ret, bset_bkey_last(start->data)); in __bch_btree_iter_stack_init()
1278 (void *) bset_bkey_last(out) - (void *) out->start); in __btree_sort()