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()
722 	while (bkey_next(k) != bset_bkey_last(t->data))  in bch_bset_build_written_tree()
742 		if (k < bset_bkey_last(t->data))  in bch_bset_fix_invalidated_key()
755 	if (bkey_next(k) == bset_bkey_last(t->data)) {  in bch_bset_fix_invalidated_key()
824 	     k != bset_bkey_last(t->data);  in bch_bset_fix_lookup_table()
867 		(void *) bset_bkey_last(t->data) - (void *) where);  in bch_bset_insert()
903 	while (m != bset_bkey_last(i) &&  in bch_btree_insert_key()
914 	if (m != bset_bkey_last(i) &&  in bch_btree_insert_key()
919 	if (m != bset_bkey_last(i) &&  in bch_btree_insert_key()
951 		ri < t->size ? table_to_bkey(t, ri) : bset_bkey_last(t->data)  in bset_search_write_set()
997 			r = bset_bkey_last(t->data);  in bset_search_tree()
1033 		i.r = bset_bkey_last(t->data);  in __bch_bset_search()
1043 			return bset_bkey_last(t->data);  in __bch_bset_search()
1051 		       t->size < bkey_to_cacheline(t, bset_bkey_last(t->data)));  in __bch_bset_search()
1063 		BUG_ON(i.r != bset_bkey_last(t->data) &&  in __bch_bset_search()
1115 		bch_btree_iter_push(iter, ret, bset_bkey_last(start->data));  in __bch_btree_iter_init()
1274 		       (void *) bset_bkey_last(out) - (void *) out->start);  in __btree_sort()