44 	sorted = b->c->verify_data->keys.set->data;  in bch_btree_verify()
45 	inmemory = b->keys.set->data;  in bch_btree_verify()
50 	v->keys.ops = b->keys.ops;  in bch_btree_verify()
65 	sorted = v->keys.set->data;  in bch_btree_verify()
67 	if (inmemory->keys != sorted->keys ||  in bch_btree_verify()
78 		bch_dump_bset(&b->keys, inmemory, 0);  in bch_btree_verify()
81 		bch_dump_bset(&v->keys, sorted, 0);  in bch_btree_verify()
88 			bch_dump_bset(&b->keys, i, block);  in bch_btree_verify()
94 		for (j = 0; j < inmemory->keys; j++)  in bch_btree_verify()
164 	struct keybuf		keys;  member
195 		w = bch_keybuf_next_rescan(i->c, &i->keys, &MAX_KEY, dump_pred);  in bch_dump_read()
201 		bch_keybuf_del(&i->keys, w);  in bch_dump_read()
218 	bch_keybuf_init(&i->keys);  in bch_dump_open()
219 	i->keys.last_scanned = KEY(0, 0, 0);  in bch_dump_open()