27 		       (unsigned) ((u64 *) k - i->d), i->keys);  in bch_dump_bset()
158 	struct bkey *k = l->keys;  in bch_keylist_pop()
171 	l->top_p -= bkey_u64s(l->keys);  in bch_keylist_pop_front()
173 	memmove(l->keys,  in bch_keylist_pop_front()
174 		bkey_next(l->keys),  in bch_keylist_pop_front()
565 		? bset_bkey_idx(t->data, t->data->keys - bkey_u64s(&t->end))  in make_bfloat()
628 	i->keys		= 0;  in bch_bset_init_next()
806 	       __set_bytes(t->data, t->data->keys + bkey_u64s(insert)) >  in bch_bset_insert()
813 	t->data->keys += bkey_u64s(insert);  in bch_bset_insert()
1174 	out->keys = last ? (uint64_t *) bkey_next(last) - out->d : 0;  in btree_mergesort()
1176 	pr_debug("sorted %i keys", out->keys);  in btree_mergesort()
1215 		b->set[start].data->keys = out->keys;  in __btree_sort()
1234 	size_t order = b->page_order, keys = 0;  in bch_btree_sort_partial()  local
1244 			keys += b->set[i].data->keys;  in bch_btree_sort_partial()
1246 		order = get_order(__set_bytes(b->set->data, keys));  in bch_btree_sort_partial()
1291 		if (b->set[i].data->keys < crit) {  in bch_btree_sort_lazy()
1314 		size_t bytes = t->data->keys * sizeof(uint64_t);  in bch_btree_keys_stats()