23 #define for_each_written_bset(b, start, i)				\  argument
25 	     (void *) i < (void *) (start) + (KEY_SIZE(&b->key) << 9) &&\
27 	     i = (void *) i + set_blocks(i, block_bytes(b->c)) *	\
28 		 block_bytes(b->c))
30 void bch_btree_verify(struct btree *b)  in bch_btree_verify()  argument
32 	struct btree *v = b->c->verify_data;  in bch_btree_verify()
36 	if (!b->c->verify || !b->c->verify_ondisk)  in bch_btree_verify()
39 	down(&b->io_mutex);  in bch_btree_verify()
40 	mutex_lock(&b->c->verify_lock);  in bch_btree_verify()
42 	ondisk = b->c->verify_ondisk;  in bch_btree_verify()
43 	sorted = b->c->verify_data->keys.set->data;  in bch_btree_verify()
44 	inmemory = b->keys.set->data;  in bch_btree_verify()
46 	bkey_copy(&v->key, &b->key);  in bch_btree_verify()
48 	v->level = b->level;  in bch_btree_verify()
49 	v->keys.ops = b->keys.ops;  in bch_btree_verify()
51 	bio = bch_bbio_alloc(b->c);  in bch_btree_verify()
52 	bio->bi_bdev		= PTR_CACHE(b->c, &b->key, 0)->bdev;  in bch_btree_verify()
53 	bio->bi_iter.bi_sector	= PTR_OFFSET(&b->key, 0);  in bch_btree_verify()
58 	bch_bbio_free(bio, b->c);  in bch_btree_verify()
75 		bch_dump_bset(&b->keys, inmemory, 0);  in bch_btree_verify()
80 		for_each_written_bset(b, ondisk, i) {  in bch_btree_verify()
82 				block_bytes(b->c);  in bch_btree_verify()
85 			bch_dump_bset(&b->keys, i, block);  in bch_btree_verify()
89 		       ((void *) i - (void *) ondisk) / block_bytes(b->c));  in bch_btree_verify()
95 		printk(KERN_ERR "b->written %u\n", b->written);  in bch_btree_verify()
101 	mutex_unlock(&b->c->verify_lock);  in bch_btree_verify()
102 	up(&b->io_mutex);  in bch_btree_verify()