26 		next = bkey_next(k);  in bch_dump_bset()
117 	struct bkey *k = iter->heap.data->k, *next = bkey_next(k);  in bch_btree_iter_next_check()
170 	while (bkey_next(k) != l->top)  in bch_keylist_pop()
171 		k = bkey_next(k);  in bch_keylist_pop()
182 		bkey_next(l->keys),  in bch_keylist_pop_front()
611 	BUG_ON(bkey_next(p) != m);  in make_bfloat()
721 			k = bkey_next(k);  in bch_bset_build_written_tree()
728 	while (bkey_next(k) != bset_bkey_last(t->data))  in bch_bset_build_written_tree()
729 		k = bkey_next(k);  in bch_bset_build_written_tree()
761 	if (bkey_next(k) == bset_bkey_last(t->data)) {  in bch_bset_fix_invalidated_key()
818 				k = bkey_next(k);  in bch_bset_fix_lookup_table()
831 	     k = bkey_next(k))  in bch_bset_fix_lookup_table()
914 		m = bkey_next(m);  in bch_btree_insert_key()
1079 		i.l = bkey_next(i.l);  in __bch_bset_search()
1167 		iter->heap.data->k = bkey_next(iter->heap.data->k);  in __bch_btree_iter_next()
1256 			last = bkey_next(last);  in btree_mergesort()
1261 	out->keys = last ? (uint64_t *) bkey_next(last) - out->d : 0;  in btree_mergesort()