2 * Assorted bcachefs debug code
4 * Copyright 2010, 2011 Kent Overstreet <kent.overstreet@gmail.com>
5 * Copyright 2012 Google, Inc.
9 #include "bkey_methods.h"
10 #include "btree_cache.h"
12 #include "btree_iter.h"
13 #include "btree_update.h"
23 #include <linux/console.h>
24 #include <linux/debugfs.h>
25 #include <linux/module.h>
26 #include <linux/random.h>
27 #include <linux/seq_file.h>
29 static struct dentry *bch_debug;
31 #ifdef CONFIG_BCACHEFS_DEBUG
33 void __bch2_btree_verify(struct bch_fs *c, struct btree *b)
35 struct btree *v = c->verify_data;
36 struct btree_node *n_ondisk, *n_sorted, *n_inmemory;
37 struct bset *sorted, *inmemory;
38 struct extent_ptr_decoded pick;
42 if (c->opts.nochanges)
45 btree_node_io_lock(b);
46 mutex_lock(&c->verify_lock);
48 n_ondisk = c->verify_ondisk;
49 n_sorted = c->verify_data->data;
52 bkey_copy(&v->key, &b->key);
55 v->btree_id = b->btree_id;
56 bch2_btree_keys_init(v, &c->expensive_debug_checks);
58 if (bch2_btree_pick_ptr(c, b, NULL, &pick) <= 0)
61 ca = bch_dev_bkey_exists(c, pick.ptr.dev);
62 if (!bch2_dev_get_ioref(ca, READ))
65 bio = bio_alloc_bioset(GFP_NOIO,
66 buf_pages(n_sorted, btree_bytes(c)),
68 bio_set_dev(bio, ca->disk_sb.bdev);
69 bio->bi_opf = REQ_OP_READ|REQ_META;
70 bio->bi_iter.bi_sector = pick.ptr.offset;
71 bio->bi_iter.bi_size = btree_bytes(c);
72 bch2_bio_map(bio, n_sorted);
77 percpu_ref_put(&ca->io_ref);
79 memcpy(n_ondisk, n_sorted, btree_bytes(c));
81 if (bch2_btree_node_read_done(c, v, false))
84 n_sorted = c->verify_data->data;
85 sorted = &n_sorted->keys;
86 inmemory = &n_inmemory->keys;
88 if (inmemory->u64s != sorted->u64s ||
89 memcmp(inmemory->start,
91 vstruct_end(inmemory) - (void *) inmemory->start)) {
92 unsigned offset = 0, sectors;
98 printk(KERN_ERR "*** in memory:\n");
99 bch2_dump_bset(b, inmemory, 0);
101 printk(KERN_ERR "*** read back in:\n");
102 bch2_dump_bset(v, sorted, 0);
104 while (offset < b->written) {
107 sectors = vstruct_blocks(n_ondisk, c->block_bits) <<
110 struct btree_node_entry *bne =
111 (void *) n_ondisk + (offset << 9);
114 sectors = vstruct_blocks(bne, c->block_bits) <<
118 printk(KERN_ERR "*** on disk block %u:\n", offset);
119 bch2_dump_bset(b, i, offset);
124 printk(KERN_ERR "*** block %u/%u not written\n",
125 offset >> c->block_bits, btree_blocks(c));
127 for (j = 0; j < le16_to_cpu(inmemory->u64s); j++)
128 if (inmemory->_data[j] != sorted->_data[j])
131 printk(KERN_ERR "b->written %u\n", b->written);
134 panic("verify failed at %u\n", j);
137 mutex_unlock(&c->verify_lock);
138 btree_node_io_unlock(b);
143 #ifdef CONFIG_DEBUG_FS
145 /* XXX: bch_fs refcounting */
153 size_t bytes; /* what's currently in buf */
155 char __user *ubuf; /* destination user buffer */
156 size_t size; /* size of requested read */
157 ssize_t ret; /* bytes read so far */
160 static int flush_buf(struct dump_iter *i)
163 size_t bytes = min(i->bytes, i->size);
164 int err = copy_to_user(i->ubuf, i->buf, bytes);
173 memmove(i->buf, i->buf + bytes, i->bytes);
179 static int bch2_dump_open(struct inode *inode, struct file *file)
181 struct btree_debug *bd = inode->i_private;
184 i = kzalloc(sizeof(struct dump_iter), GFP_KERNEL);
188 file->private_data = i;
190 i->c = container_of(bd, struct bch_fs, btree_debug[bd->id]);
196 static int bch2_dump_release(struct inode *inode, struct file *file)
198 kfree(file->private_data);
202 static ssize_t bch2_read_btree(struct file *file, char __user *buf,
203 size_t size, loff_t *ppos)
205 struct dump_iter *i = file->private_data;
206 struct btree_iter iter;
221 bch2_btree_iter_init(&iter, i->c, i->id, i->from, BTREE_ITER_PREFETCH);
222 k = bch2_btree_iter_peek(&iter);
224 while (k.k && !(err = btree_iter_err(k))) {
225 bch2_bkey_val_to_text(&PBUF(i->buf), i->c,
226 bkey_type(0, i->id), k);
227 i->bytes = strlen(i->buf);
228 BUG_ON(i->bytes >= PAGE_SIZE);
229 i->buf[i->bytes] = '\n';
232 k = bch2_btree_iter_next(&iter);
242 bch2_btree_iter_unlock(&iter);
244 return err < 0 ? err : i->ret;
247 static const struct file_operations btree_debug_ops = {
248 .owner = THIS_MODULE,
249 .open = bch2_dump_open,
250 .release = bch2_dump_release,
251 .read = bch2_read_btree,
254 static ssize_t bch2_read_btree_formats(struct file *file, char __user *buf,
255 size_t size, loff_t *ppos)
257 struct dump_iter *i = file->private_data;
258 struct btree_iter iter;
270 if (!i->size || !bkey_cmp(POS_MAX, i->from))
273 for_each_btree_node(&iter, i->c, i->id, i->from, 0, b) {
274 bch2_btree_node_to_text(&PBUF(i->buf), i->c, b);
275 i->bytes = strlen(i->buf);
281 * can't easily correctly restart a btree node traversal across
284 i->from = bkey_cmp(POS_MAX, b->key.k.p)
285 ? bkey_successor(b->key.k.p)
291 bch2_btree_iter_unlock(&iter);
293 return err < 0 ? err : i->ret;
296 static const struct file_operations btree_format_debug_ops = {
297 .owner = THIS_MODULE,
298 .open = bch2_dump_open,
299 .release = bch2_dump_release,
300 .read = bch2_read_btree_formats,
303 static ssize_t bch2_read_bfloat_failed(struct file *file, char __user *buf,
304 size_t size, loff_t *ppos)
306 struct dump_iter *i = file->private_data;
307 struct btree_iter iter;
309 struct btree *prev_node = NULL;
323 bch2_btree_iter_init(&iter, i->c, i->id, i->from, BTREE_ITER_PREFETCH);
325 while ((k = bch2_btree_iter_peek(&iter)).k &&
326 !(err = btree_iter_err(k))) {
327 struct btree_iter_level *l = &iter.l[0];
328 struct bkey_packed *_k =
329 bch2_btree_node_iter_peek(&l->iter, l->b);
331 if (l->b != prev_node) {
332 bch2_btree_node_to_text(&PBUF(i->buf), i->c, l->b);
333 i->bytes = strlen(i->buf);
340 bch2_bfloat_to_text(&PBUF(i->buf), l->b, _k);
341 i->bytes = strlen(i->buf);
346 bch2_btree_iter_next(&iter);
356 bch2_btree_iter_unlock(&iter);
358 return err < 0 ? err : i->ret;
361 static const struct file_operations bfloat_failed_debug_ops = {
362 .owner = THIS_MODULE,
363 .open = bch2_dump_open,
364 .release = bch2_dump_release,
365 .read = bch2_read_bfloat_failed,
368 void bch2_fs_debug_exit(struct bch_fs *c)
370 if (!IS_ERR_OR_NULL(c->debug))
371 debugfs_remove_recursive(c->debug);
374 void bch2_fs_debug_init(struct bch_fs *c)
376 struct btree_debug *bd;
379 if (IS_ERR_OR_NULL(bch_debug))
382 snprintf(name, sizeof(name), "%pU", c->sb.user_uuid.b);
383 c->debug = debugfs_create_dir(name, bch_debug);
384 if (IS_ERR_OR_NULL(c->debug))
387 for (bd = c->btree_debug;
388 bd < c->btree_debug + ARRAY_SIZE(c->btree_debug);
390 bd->id = bd - c->btree_debug;
391 bd->btree = debugfs_create_file(bch2_btree_ids[bd->id],
395 snprintf(name, sizeof(name), "%s-formats",
396 bch2_btree_ids[bd->id]);
398 bd->btree_format = debugfs_create_file(name, 0400, c->debug, bd,
399 &btree_format_debug_ops);
401 snprintf(name, sizeof(name), "%s-bfloat-failed",
402 bch2_btree_ids[bd->id]);
404 bd->failed = debugfs_create_file(name, 0400, c->debug, bd,
405 &bfloat_failed_debug_ops);
411 void bch2_debug_exit(void)
413 if (!IS_ERR_OR_NULL(bch_debug))
414 debugfs_remove_recursive(bch_debug);
417 int __init bch2_debug_init(void)
421 bch_debug = debugfs_create_dir("bcachefs", NULL);