26 		next = bkey_next(k);  in bch_dump_bset()
113 	struct bkey *k = iter->data->k, *next = bkey_next(k);  in bch_btree_iter_next_check()
166 	while (bkey_next(k) != l->top)  in bch_keylist_pop()
167 		k = bkey_next(k);  in bch_keylist_pop()
178 		bkey_next(l->keys),  in bch_keylist_pop_front()
607 	BUG_ON(bkey_next(p) != m);  in make_bfloat()
716 			prev = k, k = bkey_next(k);  in bch_bset_build_written_tree()
722 	while (bkey_next(k) != bset_bkey_last(t->data))  in bch_bset_build_written_tree()
723 		k = bkey_next(k);  in bch_bset_build_written_tree()
755 	if (bkey_next(k) == bset_bkey_last(t->data)) {  in bch_bset_fix_invalidated_key()
812 				k = bkey_next(k);  in bch_bset_fix_lookup_table()
825 	     k = bkey_next(k))  in bch_bset_fix_lookup_table()
905 		prev = m, m = bkey_next(m);  in bch_btree_insert_key()
1069 		i.l = bkey_next(i.l);  in __bch_bset_search()
1138 		iter->data->k = bkey_next(iter->data->k);  in __bch_btree_iter_next()
1221 			last = bkey_next(last);  in btree_mergesort()
1226 	out->keys = last ? (uint64_t *) bkey_next(last) - out->d : 0;  in btree_mergesort()