7 #include "libbcachefs.h"
9 #include "tools-util.h"
11 #include "libbcachefs/bcachefs.h"
12 #include "libbcachefs/btree_cache.h"
13 #include "libbcachefs/btree_io.h"
14 #include "libbcachefs/btree_iter.h"
15 #include "libbcachefs/checksum.h"
16 #include "libbcachefs/error.h"
17 #include "libbcachefs/extents.h"
18 #include "libbcachefs/super.h"
20 static void list_keys(struct bch_fs *c, enum btree_id btree_id,
21 struct bpos start, struct bpos end)
23 struct btree_trans trans;
24 struct btree_iter iter;
26 struct printbuf buf = PRINTBUF;
29 bch2_trans_init(&trans, c, 0, 0);
31 for_each_btree_key(&trans, iter, btree_id, start,
32 BTREE_ITER_ALL_SNAPSHOTS|
33 BTREE_ITER_PREFETCH, k, ret) {
34 if (bkey_cmp(k.k->p, end) > 0)
38 bch2_bkey_val_to_text(&buf, c, k);
41 bch2_trans_iter_exit(&trans, &iter);
43 bch2_trans_exit(&trans);
48 static void list_btree_formats(struct bch_fs *c, enum btree_id btree_id, unsigned level,
49 struct bpos start, struct bpos end)
51 struct btree_trans trans;
52 struct btree_iter iter;
54 struct printbuf buf = PRINTBUF;
57 bch2_trans_init(&trans, c, 0, 0);
59 __for_each_btree_node(&trans, iter, btree_id, start, 0, level, 0, b, ret) {
60 if (bkey_cmp(b->key.k.p, end) > 0)
64 bch2_btree_node_to_text(&buf, c, b);
67 bch2_trans_iter_exit(&trans, &iter);
70 die("error %s walking btree nodes", strerror(-ret));
72 bch2_trans_exit(&trans);
76 static void list_nodes(struct bch_fs *c, enum btree_id btree_id, unsigned level,
77 struct bpos start, struct bpos end)
79 struct btree_trans trans;
80 struct btree_iter iter;
82 struct printbuf buf = PRINTBUF;
85 bch2_trans_init(&trans, c, 0, 0);
87 __for_each_btree_node(&trans, iter, btree_id, start, 0, level, 0, b, ret) {
88 if (bkey_cmp(b->key.k.p, end) > 0)
92 bch2_bkey_val_to_text(&buf, c, bkey_i_to_s_c(&b->key));
93 fputs(buf.buf, stdout);
96 bch2_trans_iter_exit(&trans, &iter);
99 die("error %s walking btree nodes", strerror(-ret));
101 bch2_trans_exit(&trans);
105 static void print_node_ondisk(struct bch_fs *c, struct btree *b)
107 struct btree_node *n_ondisk;
108 struct extent_ptr_decoded pick;
113 if (bch2_bkey_pick_read_device(c, bkey_i_to_s_c(&b->key), NULL, &pick) <= 0) {
114 printf("error getting device to read from\n");
118 ca = bch_dev_bkey_exists(c, pick.ptr.dev);
119 if (!bch2_dev_get_ioref(ca, READ)) {
120 printf("error getting device to read from\n");
124 n_ondisk = malloc(btree_bytes(c));
126 bio = bio_alloc_bioset(ca->disk_sb.bdev,
127 buf_pages(n_ondisk, btree_bytes(c)),
128 REQ_OP_READ|REQ_META,
131 bio->bi_iter.bi_sector = pick.ptr.offset;
132 bch2_bio_map(bio, n_ondisk, btree_bytes(c));
134 submit_bio_wait(bio);
137 percpu_ref_put(&ca->io_ref);
139 while (offset < btree_sectors(c)) {
142 struct bch_csum csum;
143 struct bkey_packed *k;
149 if (!bch2_checksum_type_valid(c, BSET_CSUM_TYPE(i)))
150 die("unknown checksum type");
152 nonce = btree_nonce(i, offset << 9);
153 csum = csum_vstruct(c, BSET_CSUM_TYPE(i), nonce, n_ondisk);
155 if (bch2_crc_cmp(csum, n_ondisk->csum))
156 die("invalid checksum\n");
158 bset_encrypt(c, i, offset << 9);
160 sectors = vstruct_sectors(n_ondisk, c->block_bits);
162 struct btree_node_entry *bne = (void *) n_ondisk + (offset << 9);
166 if (i->seq != n_ondisk->keys.seq)
169 if (!bch2_checksum_type_valid(c, BSET_CSUM_TYPE(i)))
170 die("unknown checksum type");
172 nonce = btree_nonce(i, offset << 9);
173 csum = csum_vstruct(c, BSET_CSUM_TYPE(i), nonce, bne);
175 if (bch2_crc_cmp(csum, bne->csum))
176 die("invalid checksum");
178 bset_encrypt(c, i, offset << 9);
180 sectors = vstruct_sectors(bne, c->block_bits);
183 fprintf(stdout, " offset %u version %u, journal seq %llu\n",
185 le16_to_cpu(i->version),
186 le64_to_cpu(i->journal_seq));
189 for (k = i->start; k != vstruct_last(i); k = bkey_next(k)) {
191 struct printbuf buf = PRINTBUF;
193 bch2_bkey_val_to_text(&buf, c, bkey_disassemble(b, k, &u));
194 fprintf(stdout, " %s\n", buf.buf);
203 static void list_nodes_ondisk(struct bch_fs *c, enum btree_id btree_id, unsigned level,
204 struct bpos start, struct bpos end)
206 struct btree_trans trans;
207 struct btree_iter iter;
209 struct printbuf buf = PRINTBUF;
212 bch2_trans_init(&trans, c, 0, 0);
214 __for_each_btree_node(&trans, iter, btree_id, start, 0, level, 0, b, ret) {
215 if (bkey_cmp(b->key.k.p, end) > 0)
218 printbuf_reset(&buf);
219 bch2_bkey_val_to_text(&buf, c, bkey_i_to_s_c(&b->key));
220 fputs(buf.buf, stdout);
223 print_node_ondisk(c, b);
225 bch2_trans_iter_exit(&trans, &iter);
228 die("error %s walking btree nodes", strerror(-ret));
230 bch2_trans_exit(&trans);
234 static void list_nodes_keys(struct bch_fs *c, enum btree_id btree_id, unsigned level,
235 struct bpos start, struct bpos end)
237 struct btree_trans trans;
238 struct btree_iter iter;
239 struct btree_node_iter node_iter;
240 struct bkey unpacked;
243 struct printbuf buf = PRINTBUF;
246 bch2_trans_init(&trans, c, 0, 0);
248 __for_each_btree_node(&trans, iter, btree_id, start, 0, level, 0, b, ret) {
249 if (bkey_cmp(b->key.k.p, end) > 0)
252 printbuf_reset(&buf);
253 bch2_btree_node_to_text(&buf, c, b);
254 fputs(buf.buf, stdout);
256 for_each_btree_node_key_unpack(b, k, &node_iter, &unpacked) {
257 printbuf_reset(&buf);
258 bch2_bkey_val_to_text(&buf, c, k);
263 bch2_trans_iter_exit(&trans, &iter);
266 die("error %s walking btree nodes", strerror(-ret));
268 bch2_trans_exit(&trans);
272 static void list_keys_usage(void)
274 puts("bcachefs list - list filesystem metadata to stdout\n"
275 "Usage: bcachefs list [OPTION]... <devices>\n"
278 " -b (extents|inodes|dirents|xattrs) Btree to list from\n"
279 " -l level Btree depth to descend to (0 == leaves)\n"
280 " -s inode:offset Start position to list from\n"
281 " -e inode:offset End position\n"
282 " -i inode List keys for a given inode number\n"
283 " -m (keys|formats|nodes|nodes_ondisk|nodes_keys)\n"
285 " -f Check (fsck) the filesystem first\n"
287 " -h Display this help and exit\n"
288 "Report bugs to <linux-bcachefs@vger.kernel.org>");
291 #define LIST_MODES() \
299 #define x(n) LIST_MODE_##n,
304 static const char * const list_modes[] = {
311 int cmd_list(int argc, char *argv[])
313 struct bch_opts opts = bch2_opts_empty();
314 enum btree_id btree_id_start = 0;
315 enum btree_id btree_id_end = BTREE_ID_NR;
316 enum btree_id btree_id;
318 struct bpos start = POS_MIN, end = POS_MAX;
322 opt_set(opts, nochanges, true);
323 opt_set(opts, norecovery, true);
324 opt_set(opts, degraded, true);
325 opt_set(opts, errors, BCH_ON_ERROR_continue);
327 while ((opt = getopt(argc, argv, "b:l:s:e:i:m:fvh")) != -1)
330 btree_id_start = read_string_list_or_die(optarg,
331 bch2_btree_ids, "btree id");
332 btree_id_end = btree_id_start + 1;
335 if (kstrtouint(optarg, 10, &level) || level >= BTREE_MAX_DEPTH)
336 die("invalid level");
339 start = bpos_parse(optarg);
342 end = bpos_parse(optarg);
345 if (kstrtoull(optarg, 10, &inum))
346 die("invalid inode %s", optarg);
347 start = POS(inum, 0);
348 end = POS(inum + 1, 0);
351 mode = read_string_list_or_die(optarg,
352 list_modes, "list mode");
355 opt_set(opts, fix_errors, FSCK_OPT_YES);
356 opt_set(opts, norecovery, false);
359 opt_set(opts, verbose, true);
368 die("Please supply device(s)");
370 struct bch_fs *c = bch2_fs_open(argv, argc, opts);
372 die("error opening %s: %s", argv[0], strerror(-PTR_ERR(c)));
375 for (btree_id = btree_id_start;
376 btree_id < btree_id_end;
380 list_keys(c, btree_id, start, end);
382 case LIST_MODE_formats:
383 list_btree_formats(c, btree_id, level, start, end);
385 case LIST_MODE_nodes:
386 list_nodes(c, btree_id, level, start, end);
388 case LIST_MODE_nodes_ondisk:
389 list_nodes_ondisk(c, btree_id, level, start, end);
391 case LIST_MODE_nodes_keys:
392 list_nodes_keys(c, btree_id, level, start, end);