24 		next = bkey_next(k);  in bch_dump_bset()
111 	struct bkey *k = iter->data->k, *next = bkey_next(k);  in bch_btree_iter_next_check()
163 	while (bkey_next(k) != l->top)  in bch_keylist_pop()
164 		k = bkey_next(k);  in bch_keylist_pop()
174 		bkey_next(l->keys),  in bch_keylist_pop_front()
569 	BUG_ON(bkey_next(p) != m);  in make_bfloat()
660 			prev = k, k = bkey_next(k);  in bch_bset_build_written_tree()
666 	while (bkey_next(k) != bset_bkey_last(t->data))  in bch_bset_build_written_tree()
667 		k = bkey_next(k);  in bch_bset_build_written_tree()
700 	if (bkey_next(k) == bset_bkey_last(t->data)) {  in bch_bset_fix_invalidated_key()
756 				k = bkey_next(k);  in bch_bset_fix_lookup_table()
769 	     k = bkey_next(k))  in bch_bset_fix_lookup_table()
840 		prev = m, m = bkey_next(m);  in bch_btree_insert_key()
1010 		i.l = bkey_next(i.l);  in __bch_bset_search()
1080 		iter->data->k = bkey_next(iter->data->k);  in __bch_btree_iter_next()
1169 			last = bkey_next(last);  in btree_mergesort()
1174 	out->keys = last ? (uint64_t *) bkey_next(last) - out->d : 0;  in btree_mergesort()