1 /*
2 * CDDL HEADER START
3 *
4 * The contents of this file are subject to the terms of the
5 * Common Development and Distribution License (the "License").
6 * You may not use this file except in compliance with the License.
7 *
8 * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
9 * or http://www.opensolaris.org/os/licensing.
10 * See the License for the specific language governing permissions
11 * and limitations under the License.
12 *
13 * When distributing Covered Code, include this CDDL HEADER in each
14 * file and include the License file at usr/src/OPENSOLARIS.LICENSE.
15 * If applicable, add the following below this CDDL HEADER, with the
16 * fields enclosed by brackets "[]" replaced with your own identifying
17 * information: Portions Copyright [yyyy] [name of copyright owner]
18 *
19 * CDDL HEADER END
20 */
21
22 /*
23 * Copyright (c) 2005, 2010, Oracle and/or its affiliates. All rights reserved.
24 * Copyright (c) 2011, 2019 by Delphix. All rights reserved.
25 * Copyright (c) 2014 Integros [integros.com]
26 * Copyright 2017 Nexenta Systems, Inc.
27 * Copyright (c) 2017, 2018 Lawrence Livermore National Security, LLC.
28 * Copyright 2017 RackTop Systems.
29 * Copyright 2026 Edgecast Cloud LLC.
30 */
31
32 #include <stdio.h>
33 #include <unistd.h>
34 #include <stdio_ext.h>
35 #include <stdlib.h>
36 #include <ctype.h>
37 #include <sys/zfs_context.h>
38 #include <sys/spa.h>
39 #include <sys/spa_impl.h>
40 #include <sys/dmu.h>
41 #include <sys/zap.h>
42 #include <sys/fs/zfs.h>
43 #include <sys/zfs_znode.h>
44 #include <sys/zfs_sa.h>
45 #include <sys/sa.h>
46 #include <sys/sa_impl.h>
47 #include <sys/vdev.h>
48 #include <sys/vdev_impl.h>
49 #include <sys/metaslab_impl.h>
50 #include <sys/dmu_objset.h>
51 #include <sys/dsl_dir.h>
52 #include <sys/dsl_dataset.h>
53 #include <sys/dsl_pool.h>
54 #include <sys/dbuf.h>
55 #include <sys/zil.h>
56 #include <sys/zil_impl.h>
57 #include <sys/stat.h>
58 #include <sys/resource.h>
59 #include <sys/dmu_traverse.h>
60 #include <sys/zio_checksum.h>
61 #include <sys/zio_compress.h>
62 #include <zfs_fletcher.h>
63 #include <sys/zfs_fuid.h>
64 #include <sys/arc.h>
65 #include <sys/arc_impl.h>
66 #include <sys/ddt.h>
67 #include <sys/zfeature.h>
68 #include <sys/abd.h>
69 #include <sys/blkptr.h>
70 #include <sys/dsl_scan.h>
71 #include <sys/dsl_crypt.h>
72 #include <zfs_comutil.h>
73 #include <libcmdutils.h>
74 #undef verify
75 #include <libzfs.h>
76
77 #include <libnvpair.h>
78 #include <libzutil.h>
79
80 #include "zdb.h"
81
82 #define ZDB_COMPRESS_NAME(idx) ((idx) < ZIO_COMPRESS_FUNCTIONS ? \
83 zio_compress_table[(idx)].ci_name : "UNKNOWN")
84 #define ZDB_CHECKSUM_NAME(idx) ((idx) < ZIO_CHECKSUM_FUNCTIONS ? \
85 zio_checksum_table[(idx)].ci_name : "UNKNOWN")
86 #define ZDB_OT_NAME(idx) ((idx) < DMU_OT_NUMTYPES ? \
87 dmu_ot[(idx)].ot_name : DMU_OT_IS_VALID(idx) ? \
88 dmu_ot_byteswap[DMU_OT_BYTESWAP(idx)].ob_name : "UNKNOWN")
89 #define ZDB_OT_TYPE(idx) ((idx) < DMU_OT_NUMTYPES ? (idx) : \
90 (idx) == DMU_OTN_ZAP_DATA || (idx) == DMU_OTN_ZAP_METADATA ? \
91 DMU_OT_ZAP_OTHER : \
92 (idx) == DMU_OTN_UINT64_DATA || (idx) == DMU_OTN_UINT64_METADATA ? \
93 DMU_OT_UINT64_OTHER : DMU_OT_NUMTYPES)
94
95 extern int reference_tracking_enable;
96 extern boolean_t zfs_recover;
97 extern uint64_t zfs_arc_max, zfs_arc_meta_limit;
98 extern int zfs_vdev_async_read_max_active;
99 extern int aok;
100 extern boolean_t spa_load_verify_dryrun;
101 extern int zfs_btree_verify_intensity;
102
103 static const char cmdname[] = "zdb";
104 uint8_t dump_opt[256];
105
106 typedef void object_viewer_t(objset_t *, uint64_t, void *data, size_t size);
107
108 uint64_t *zopt_object = NULL;
109 static unsigned zopt_objects = 0;
110 uint64_t max_inflight = 1000;
111 static int leaked_objects = 0;
112
113 static void snprintf_blkptr_compact(char *, size_t, const blkptr_t *);
114 static void mos_obj_refd(uint64_t);
115
116 /*
117 * These libumem hooks provide a reasonable set of defaults for the allocator's
118 * debugging facilities.
119 */
120 const char *
_umem_debug_init()121 _umem_debug_init()
122 {
123 return ("default,verbose"); /* $UMEM_DEBUG setting */
124 }
125
126 const char *
_umem_logging_init(void)127 _umem_logging_init(void)
128 {
129 return ("fail,contents"); /* $UMEM_LOGGING setting */
130 }
131
132 static void
usage(void)133 usage(void)
134 {
135 (void) fprintf(stderr,
136 "Usage:\t%s [-AbcdDFGhikLMPsvX] [-e [-V] [-p <path> ...]] "
137 "[-I <inflight I/Os>]\n"
138 "\t\t[-o <var>=<value>]... [-t <txg>] [-U <cache>] [-x <dumpdir>]\n"
139 "\t\t[<poolname> [<object> ...]]\n"
140 "\t%s [-AdiPv] [-e [-V] [-p <path> ...]] [-U <cache>] <dataset> "
141 "[<object> ...]\n"
142 "\t%s -C [-A] [-U <cache>]\n"
143 "\t%s -l [-Aqu] <device>\n"
144 "\t%s -m [-AFLPX] [-e [-V] [-p <path> ...]] [-t <txg>] "
145 "[-U <cache>]\n\t\t<poolname> [<vdev> [<metaslab> ...]]\n"
146 "\t%s -O <dataset> <path>\n"
147 "\t%s -R [-A] [-e [-V] [-p <path> ...]] [-U <cache>]\n"
148 "\t\t<poolname> <vdev>:<offset>:<size>[:<flags>]\n"
149 "\t%s -E [-A] word0:word1:...:word15\n"
150 "\t%s -S [-AP] [-e [-V] [-p <path> ...]] [-U <cache>] "
151 "<poolname>\n\n",
152 cmdname, cmdname, cmdname, cmdname, cmdname, cmdname, cmdname,
153 cmdname, cmdname);
154
155 (void) fprintf(stderr, " Dataset name must include at least one "
156 "separator character '/' or '@'\n");
157 (void) fprintf(stderr, " If dataset name is specified, only that "
158 "dataset is dumped\n");
159 (void) fprintf(stderr, " If object numbers are specified, only "
160 "those objects are dumped\n\n");
161 (void) fprintf(stderr, " Options to control amount of output:\n");
162 (void) fprintf(stderr, " -b block statistics\n");
163 (void) fprintf(stderr, " -c checksum all metadata (twice for "
164 "all data) blocks\n");
165 (void) fprintf(stderr, " -C config (or cachefile if alone)\n");
166 (void) fprintf(stderr, " -d dataset(s)\n");
167 (void) fprintf(stderr, " -D dedup statistics\n");
168 (void) fprintf(stderr, " -E decode and display block from an "
169 "embedded block pointer\n");
170 (void) fprintf(stderr, " -h pool history\n");
171 (void) fprintf(stderr, " -i intent logs\n");
172 (void) fprintf(stderr, " -l read label contents\n");
173 (void) fprintf(stderr, " -k examine the checkpointed state "
174 "of the pool\n");
175 (void) fprintf(stderr, " -L disable leak tracking (do not "
176 "load spacemaps)\n");
177 (void) fprintf(stderr, " -m metaslabs\n");
178 (void) fprintf(stderr, " -M metaslab groups\n");
179 (void) fprintf(stderr, " -O perform object lookups by path\n");
180 (void) fprintf(stderr, " -R read and display block from a "
181 "device\n");
182 (void) fprintf(stderr, " -s report stats on zdb's I/O\n");
183 (void) fprintf(stderr, " -S simulate dedup to measure effect\n");
184 (void) fprintf(stderr, " -v verbose (applies to all "
185 "others)\n\n");
186 (void) fprintf(stderr, " Below options are intended for use "
187 "with other options:\n");
188 (void) fprintf(stderr, " -A ignore assertions (-A), enable "
189 "panic recovery (-AA) or both (-AAA)\n");
190 (void) fprintf(stderr, " -e pool is exported/destroyed/"
191 "has altroot/not in a cachefile\n");
192 (void) fprintf(stderr, " -F attempt automatic rewind within "
193 "safe range of transaction groups\n");
194 (void) fprintf(stderr, " -G dump zfs_dbgmsg buffer before "
195 "exiting\n");
196 (void) fprintf(stderr, " -I <number of inflight I/Os> -- "
197 "specify the maximum number of "
198 "checksumming I/Os [default is 200]\n");
199 (void) fprintf(stderr, " -o <variable>=<value> set global "
200 "variable to an unsigned 32-bit integer value\n");
201 (void) fprintf(stderr, " -p <path> -- use one or more with "
202 "-e to specify path to vdev dir\n");
203 (void) fprintf(stderr, " -P print numbers in parseable form\n");
204 (void) fprintf(stderr, " -q don't print label contents\n");
205 (void) fprintf(stderr, " -t <txg> -- highest txg to use when "
206 "searching for uberblocks\n");
207 (void) fprintf(stderr, " -u uberblock\n");
208 (void) fprintf(stderr, " -U <cachefile_path> -- use alternate "
209 "cachefile\n");
210 (void) fprintf(stderr, " -V do verbatim import\n");
211 (void) fprintf(stderr, " -x <dumpdir> -- "
212 "dump all read blocks into specified directory\n");
213 (void) fprintf(stderr, " -X attempt extreme rewind (does not "
214 "work with dataset)\n\n");
215 (void) fprintf(stderr, "Specify an option more than once (e.g. -bb) "
216 "to make only that option verbose\n");
217 (void) fprintf(stderr, "Default is to dump everything non-verbosely\n");
218 exit(1);
219 }
220
221 static void
dump_debug_buffer()222 dump_debug_buffer()
223 {
224 if (dump_opt['G']) {
225 (void) printf("\n");
226 zfs_dbgmsg_print("zdb");
227 }
228 }
229
230 /*
231 * Called for usage errors that are discovered after a call to spa_open(),
232 * dmu_bonus_hold(), or pool_match(). abort() is called for other errors.
233 */
234
235 static void
fatal(const char * fmt,...)236 fatal(const char *fmt, ...)
237 {
238 va_list ap;
239
240 va_start(ap, fmt);
241 (void) fprintf(stderr, "%s: ", cmdname);
242 (void) vfprintf(stderr, fmt, ap);
243 va_end(ap);
244 (void) fprintf(stderr, "\n");
245
246 dump_debug_buffer();
247
248 exit(1);
249 }
250
251 /* ARGSUSED */
252 static void
dump_packed_nvlist(objset_t * os,uint64_t object,void * data,size_t size)253 dump_packed_nvlist(objset_t *os, uint64_t object, void *data, size_t size)
254 {
255 nvlist_t *nv;
256 size_t nvsize = *(uint64_t *)data;
257 char *packed = umem_alloc(nvsize, UMEM_NOFAIL);
258
259 VERIFY(0 == dmu_read(os, object, 0, nvsize, packed, DMU_READ_PREFETCH));
260
261 VERIFY(nvlist_unpack(packed, nvsize, &nv, 0) == 0);
262
263 umem_free(packed, nvsize);
264
265 dump_nvlist(nv, 8);
266
267 nvlist_free(nv);
268 }
269
270 /* ARGSUSED */
271 static void
dump_history_offsets(objset_t * os,uint64_t object,void * data,size_t size)272 dump_history_offsets(objset_t *os, uint64_t object, void *data, size_t size)
273 {
274 spa_history_phys_t *shp = data;
275
276 if (shp == NULL)
277 return;
278
279 (void) printf("\t\tpool_create_len = %llu\n",
280 (u_longlong_t)shp->sh_pool_create_len);
281 (void) printf("\t\tphys_max_off = %llu\n",
282 (u_longlong_t)shp->sh_phys_max_off);
283 (void) printf("\t\tbof = %llu\n",
284 (u_longlong_t)shp->sh_bof);
285 (void) printf("\t\teof = %llu\n",
286 (u_longlong_t)shp->sh_eof);
287 (void) printf("\t\trecords_lost = %llu\n",
288 (u_longlong_t)shp->sh_records_lost);
289 }
290
291 static void
zdb_nicenum(uint64_t num,char * buf,size_t buflen)292 zdb_nicenum(uint64_t num, char *buf, size_t buflen)
293 {
294 if (dump_opt['P'])
295 (void) snprintf(buf, buflen, "%llu", (longlong_t)num);
296 else
297 nicenum(num, buf, sizeof (buf));
298 }
299
300 static const char histo_stars[] = "****************************************";
301 static const uint64_t histo_width = sizeof (histo_stars) - 1;
302
303 static void
dump_histogram(const uint64_t * histo,int size,int offset)304 dump_histogram(const uint64_t *histo, int size, int offset)
305 {
306 int i;
307 int minidx = size - 1;
308 int maxidx = 0;
309 uint64_t max = 0;
310
311 for (i = 0; i < size; i++) {
312 if (histo[i] > max)
313 max = histo[i];
314 if (histo[i] > 0 && i > maxidx)
315 maxidx = i;
316 if (histo[i] > 0 && i < minidx)
317 minidx = i;
318 }
319
320 if (max < histo_width)
321 max = histo_width;
322
323 for (i = minidx; i <= maxidx; i++) {
324 (void) printf("\t\t\t%3u: %6llu %s\n",
325 i + offset, (u_longlong_t)histo[i],
326 &histo_stars[(max - histo[i]) * histo_width / max]);
327 }
328 }
329
330 static void
dump_zap_stats(objset_t * os,uint64_t object)331 dump_zap_stats(objset_t *os, uint64_t object)
332 {
333 int error;
334 zap_stats_t zs;
335
336 error = zap_get_stats(os, object, &zs);
337 if (error)
338 return;
339
340 if (zs.zs_ptrtbl_len == 0) {
341 ASSERT(zs.zs_num_blocks == 1);
342 (void) printf("\tmicrozap: %llu bytes, %llu entries\n",
343 (u_longlong_t)zs.zs_blocksize,
344 (u_longlong_t)zs.zs_num_entries);
345 return;
346 }
347
348 (void) printf("\tFat ZAP stats:\n");
349
350 (void) printf("\t\tPointer table:\n");
351 (void) printf("\t\t\t%llu elements\n",
352 (u_longlong_t)zs.zs_ptrtbl_len);
353 (void) printf("\t\t\tzt_blk: %llu\n",
354 (u_longlong_t)zs.zs_ptrtbl_zt_blk);
355 (void) printf("\t\t\tzt_numblks: %llu\n",
356 (u_longlong_t)zs.zs_ptrtbl_zt_numblks);
357 (void) printf("\t\t\tzt_shift: %llu\n",
358 (u_longlong_t)zs.zs_ptrtbl_zt_shift);
359 (void) printf("\t\t\tzt_blks_copied: %llu\n",
360 (u_longlong_t)zs.zs_ptrtbl_blks_copied);
361 (void) printf("\t\t\tzt_nextblk: %llu\n",
362 (u_longlong_t)zs.zs_ptrtbl_nextblk);
363
364 (void) printf("\t\tZAP entries: %llu\n",
365 (u_longlong_t)zs.zs_num_entries);
366 (void) printf("\t\tLeaf blocks: %llu\n",
367 (u_longlong_t)zs.zs_num_leafs);
368 (void) printf("\t\tTotal blocks: %llu\n",
369 (u_longlong_t)zs.zs_num_blocks);
370 (void) printf("\t\tzap_block_type: 0x%llx\n",
371 (u_longlong_t)zs.zs_block_type);
372 (void) printf("\t\tzap_magic: 0x%llx\n",
373 (u_longlong_t)zs.zs_magic);
374 (void) printf("\t\tzap_salt: 0x%llx\n",
375 (u_longlong_t)zs.zs_salt);
376
377 (void) printf("\t\tLeafs with 2^n pointers:\n");
378 dump_histogram(zs.zs_leafs_with_2n_pointers, ZAP_HISTOGRAM_SIZE, 0);
379
380 (void) printf("\t\tBlocks with n*5 entries:\n");
381 dump_histogram(zs.zs_blocks_with_n5_entries, ZAP_HISTOGRAM_SIZE, 0);
382
383 (void) printf("\t\tBlocks n/10 full:\n");
384 dump_histogram(zs.zs_blocks_n_tenths_full, ZAP_HISTOGRAM_SIZE, 0);
385
386 (void) printf("\t\tEntries with n chunks:\n");
387 dump_histogram(zs.zs_entries_using_n_chunks, ZAP_HISTOGRAM_SIZE, 0);
388
389 (void) printf("\t\tBuckets with n entries:\n");
390 dump_histogram(zs.zs_buckets_with_n_entries, ZAP_HISTOGRAM_SIZE, 0);
391 }
392
393 /*ARGSUSED*/
394 static void
dump_none(objset_t * os,uint64_t object,void * data,size_t size)395 dump_none(objset_t *os, uint64_t object, void *data, size_t size)
396 {
397 }
398
399 /*ARGSUSED*/
400 static void
dump_unknown(objset_t * os,uint64_t object,void * data,size_t size)401 dump_unknown(objset_t *os, uint64_t object, void *data, size_t size)
402 {
403 (void) printf("\tUNKNOWN OBJECT TYPE\n");
404 }
405
406 /*ARGSUSED*/
407 static void
dump_uint8(objset_t * os,uint64_t object,void * data,size_t size)408 dump_uint8(objset_t *os, uint64_t object, void *data, size_t size)
409 {
410 }
411
412 /*ARGSUSED*/
413 static void
dump_uint64(objset_t * os,uint64_t object,void * data,size_t size)414 dump_uint64(objset_t *os, uint64_t object, void *data, size_t size)
415 {
416 }
417
418 /*ARGSUSED*/
419 static void
dump_zap(objset_t * os,uint64_t object,void * data,size_t size)420 dump_zap(objset_t *os, uint64_t object, void *data, size_t size)
421 {
422 zap_cursor_t zc;
423 zap_attribute_t attr;
424 void *prop;
425 unsigned i;
426
427 dump_zap_stats(os, object);
428 (void) printf("\n");
429
430 for (zap_cursor_init(&zc, os, object);
431 zap_cursor_retrieve(&zc, &attr) == 0;
432 zap_cursor_advance(&zc)) {
433 (void) printf("\t\t%s = ", attr.za_name);
434 if (attr.za_num_integers == 0) {
435 (void) printf("\n");
436 continue;
437 }
438 prop = umem_zalloc(attr.za_num_integers *
439 attr.za_integer_length, UMEM_NOFAIL);
440 (void) zap_lookup(os, object, attr.za_name,
441 attr.za_integer_length, attr.za_num_integers, prop);
442 if (attr.za_integer_length == 1) {
443 if (strcmp(attr.za_name,
444 DSL_CRYPTO_KEY_MASTER_KEY) == 0 ||
445 strcmp(attr.za_name,
446 DSL_CRYPTO_KEY_HMAC_KEY) == 0 ||
447 strcmp(attr.za_name, DSL_CRYPTO_KEY_IV) == 0 ||
448 strcmp(attr.za_name, DSL_CRYPTO_KEY_MAC) == 0 ||
449 strcmp(attr.za_name, DMU_POOL_CHECKSUM_SALT) == 0) {
450 uint8_t *u8 = prop;
451
452 for (i = 0; i < attr.za_num_integers; i++) {
453 (void) printf("%02x", u8[i]);
454 }
455 } else {
456 (void) printf("%s", (char *)prop);
457 }
458 } else {
459 for (i = 0; i < attr.za_num_integers; i++) {
460 switch (attr.za_integer_length) {
461 case 2:
462 (void) printf("%u ",
463 ((uint16_t *)prop)[i]);
464 break;
465 case 4:
466 (void) printf("%u ",
467 ((uint32_t *)prop)[i]);
468 break;
469 case 8:
470 (void) printf("%lld ",
471 (u_longlong_t)((int64_t *)prop)[i]);
472 break;
473 }
474 }
475 }
476 (void) printf("\n");
477 umem_free(prop, attr.za_num_integers * attr.za_integer_length);
478 }
479 zap_cursor_fini(&zc);
480 }
481
482 static void
dump_bpobj(objset_t * os,uint64_t object,void * data,size_t size)483 dump_bpobj(objset_t *os, uint64_t object, void *data, size_t size)
484 {
485 bpobj_phys_t *bpop = data;
486 char bytes[32], comp[32], uncomp[32];
487
488 /* make sure the output won't get truncated */
489 CTASSERT(sizeof (bytes) >= NN_NUMBUF_SZ);
490 CTASSERT(sizeof (comp) >= NN_NUMBUF_SZ);
491 CTASSERT(sizeof (uncomp) >= NN_NUMBUF_SZ);
492
493 if (bpop == NULL)
494 return;
495
496 zdb_nicenum(bpop->bpo_bytes, bytes, sizeof (bytes));
497 zdb_nicenum(bpop->bpo_comp, comp, sizeof (comp));
498 zdb_nicenum(bpop->bpo_uncomp, uncomp, sizeof (uncomp));
499
500 (void) printf("\t\tnum_blkptrs = %llu\n",
501 (u_longlong_t)bpop->bpo_num_blkptrs);
502 (void) printf("\t\tbytes = %s\n", bytes);
503 if (size >= BPOBJ_SIZE_V1) {
504 (void) printf("\t\tcomp = %s\n", comp);
505 (void) printf("\t\tuncomp = %s\n", uncomp);
506 }
507 if (size >= sizeof (*bpop)) {
508 (void) printf("\t\tsubobjs = %llu\n",
509 (u_longlong_t)bpop->bpo_subobjs);
510 (void) printf("\t\tnum_subobjs = %llu\n",
511 (u_longlong_t)bpop->bpo_num_subobjs);
512 }
513
514 if (dump_opt['d'] < 5)
515 return;
516
517 for (uint64_t i = 0; i < bpop->bpo_num_blkptrs; i++) {
518 char blkbuf[BP_SPRINTF_LEN];
519 blkptr_t bp;
520
521 int err = dmu_read(os, object,
522 i * sizeof (bp), sizeof (bp), &bp, 0);
523 if (err != 0) {
524 (void) printf("got error %u from dmu_read\n", err);
525 break;
526 }
527 snprintf_blkptr_compact(blkbuf, sizeof (blkbuf), &bp);
528 (void) printf("\t%s\n", blkbuf);
529 }
530 }
531
532 /* ARGSUSED */
533 static void
dump_bpobj_subobjs(objset_t * os,uint64_t object,void * data,size_t size)534 dump_bpobj_subobjs(objset_t *os, uint64_t object, void *data, size_t size)
535 {
536 dmu_object_info_t doi;
537
538 VERIFY0(dmu_object_info(os, object, &doi));
539 uint64_t *subobjs = kmem_alloc(doi.doi_max_offset, KM_SLEEP);
540
541 int err = dmu_read(os, object, 0, doi.doi_max_offset, subobjs, 0);
542 if (err != 0) {
543 (void) printf("got error %u from dmu_read\n", err);
544 kmem_free(subobjs, doi.doi_max_offset);
545 return;
546 }
547
548 int64_t last_nonzero = -1;
549 for (uint64_t i = 0; i < doi.doi_max_offset / 8; i++) {
550 if (subobjs[i] != 0)
551 last_nonzero = i;
552 }
553
554 for (int64_t i = 0; i <= last_nonzero; i++) {
555 (void) printf("\t%llu\n", (longlong_t)subobjs[i]);
556 }
557 kmem_free(subobjs, doi.doi_max_offset);
558 }
559
560 /*ARGSUSED*/
561 static void
dump_ddt_zap(objset_t * os,uint64_t object,void * data,size_t size)562 dump_ddt_zap(objset_t *os, uint64_t object, void *data, size_t size)
563 {
564 dump_zap_stats(os, object);
565 /* contents are printed elsewhere, properly decoded */
566 }
567
568 /*ARGSUSED*/
569 static void
dump_sa_attrs(objset_t * os,uint64_t object,void * data,size_t size)570 dump_sa_attrs(objset_t *os, uint64_t object, void *data, size_t size)
571 {
572 zap_cursor_t zc;
573 zap_attribute_t attr;
574
575 dump_zap_stats(os, object);
576 (void) printf("\n");
577
578 for (zap_cursor_init(&zc, os, object);
579 zap_cursor_retrieve(&zc, &attr) == 0;
580 zap_cursor_advance(&zc)) {
581 (void) printf("\t\t%s = ", attr.za_name);
582 if (attr.za_num_integers == 0) {
583 (void) printf("\n");
584 continue;
585 }
586 (void) printf(" %llx : [%d:%d:%d]\n",
587 (u_longlong_t)attr.za_first_integer,
588 (int)ATTR_LENGTH(attr.za_first_integer),
589 (int)ATTR_BSWAP(attr.za_first_integer),
590 (int)ATTR_NUM(attr.za_first_integer));
591 }
592 zap_cursor_fini(&zc);
593 }
594
595 /*ARGSUSED*/
596 static void
dump_sa_layouts(objset_t * os,uint64_t object,void * data,size_t size)597 dump_sa_layouts(objset_t *os, uint64_t object, void *data, size_t size)
598 {
599 zap_cursor_t zc;
600 zap_attribute_t attr;
601 uint16_t *layout_attrs;
602 unsigned i;
603
604 dump_zap_stats(os, object);
605 (void) printf("\n");
606
607 for (zap_cursor_init(&zc, os, object);
608 zap_cursor_retrieve(&zc, &attr) == 0;
609 zap_cursor_advance(&zc)) {
610 (void) printf("\t\t%s = [", attr.za_name);
611 if (attr.za_num_integers == 0) {
612 (void) printf("\n");
613 continue;
614 }
615
616 VERIFY(attr.za_integer_length == 2);
617 layout_attrs = umem_zalloc(attr.za_num_integers *
618 attr.za_integer_length, UMEM_NOFAIL);
619
620 VERIFY(zap_lookup(os, object, attr.za_name,
621 attr.za_integer_length,
622 attr.za_num_integers, layout_attrs) == 0);
623
624 for (i = 0; i != attr.za_num_integers; i++)
625 (void) printf(" %d ", (int)layout_attrs[i]);
626 (void) printf("]\n");
627 umem_free(layout_attrs,
628 attr.za_num_integers * attr.za_integer_length);
629 }
630 zap_cursor_fini(&zc);
631 }
632
633 /*ARGSUSED*/
634 static void
dump_zpldir(objset_t * os,uint64_t object,void * data,size_t size)635 dump_zpldir(objset_t *os, uint64_t object, void *data, size_t size)
636 {
637 zap_cursor_t zc;
638 zap_attribute_t attr;
639 const char *typenames[] = {
640 /* 0 */ "not specified",
641 /* 1 */ "FIFO",
642 /* 2 */ "Character Device",
643 /* 3 */ "3 (invalid)",
644 /* 4 */ "Directory",
645 /* 5 */ "5 (invalid)",
646 /* 6 */ "Block Device",
647 /* 7 */ "7 (invalid)",
648 /* 8 */ "Regular File",
649 /* 9 */ "9 (invalid)",
650 /* 10 */ "Symbolic Link",
651 /* 11 */ "11 (invalid)",
652 /* 12 */ "Socket",
653 /* 13 */ "Door",
654 /* 14 */ "Event Port",
655 /* 15 */ "15 (invalid)",
656 };
657
658 dump_zap_stats(os, object);
659 (void) printf("\n");
660
661 for (zap_cursor_init(&zc, os, object);
662 zap_cursor_retrieve(&zc, &attr) == 0;
663 zap_cursor_advance(&zc)) {
664 (void) printf("\t\t%s = %lld (type: %s)\n",
665 attr.za_name, ZFS_DIRENT_OBJ(attr.za_first_integer),
666 typenames[ZFS_DIRENT_TYPE(attr.za_first_integer)]);
667 }
668 zap_cursor_fini(&zc);
669 }
670
671 static uint64_t
get_dtl_refcount(vdev_t * vd)672 get_dtl_refcount(vdev_t *vd)
673 {
674 uint64_t refcount = 0;
675
676 if (vd->vdev_ops->vdev_op_leaf) {
677 space_map_t *sm = vd->vdev_dtl_sm;
678
679 if (sm != NULL &&
680 sm->sm_dbuf->db_size == sizeof (space_map_phys_t))
681 return (1);
682 return (0);
683 }
684
685 for (unsigned c = 0; c < vd->vdev_children; c++)
686 refcount += get_dtl_refcount(vd->vdev_child[c]);
687 return (refcount);
688 }
689
690 static uint64_t
get_metaslab_refcount(vdev_t * vd)691 get_metaslab_refcount(vdev_t *vd)
692 {
693 uint64_t refcount = 0;
694
695 if (vd->vdev_top == vd) {
696 for (uint64_t m = 0; m < vd->vdev_ms_count; m++) {
697 space_map_t *sm = vd->vdev_ms[m]->ms_sm;
698
699 if (sm != NULL &&
700 sm->sm_dbuf->db_size == sizeof (space_map_phys_t))
701 refcount++;
702 }
703 }
704 for (unsigned c = 0; c < vd->vdev_children; c++)
705 refcount += get_metaslab_refcount(vd->vdev_child[c]);
706
707 return (refcount);
708 }
709
710 static uint64_t
get_obsolete_refcount(vdev_t * vd)711 get_obsolete_refcount(vdev_t *vd)
712 {
713 uint64_t refcount = 0;
714
715 uint64_t obsolete_sm_obj = vdev_obsolete_sm_object(vd);
716 if (vd->vdev_top == vd && obsolete_sm_obj != 0) {
717 dmu_object_info_t doi;
718 VERIFY0(dmu_object_info(vd->vdev_spa->spa_meta_objset,
719 obsolete_sm_obj, &doi));
720 if (doi.doi_bonus_size == sizeof (space_map_phys_t)) {
721 refcount++;
722 }
723 } else {
724 ASSERT3P(vd->vdev_obsolete_sm, ==, NULL);
725 ASSERT3U(obsolete_sm_obj, ==, 0);
726 }
727 for (unsigned c = 0; c < vd->vdev_children; c++) {
728 refcount += get_obsolete_refcount(vd->vdev_child[c]);
729 }
730
731 return (refcount);
732 }
733
734 static uint64_t
get_prev_obsolete_spacemap_refcount(spa_t * spa)735 get_prev_obsolete_spacemap_refcount(spa_t *spa)
736 {
737 uint64_t prev_obj =
738 spa->spa_condensing_indirect_phys.scip_prev_obsolete_sm_object;
739 if (prev_obj != 0) {
740 dmu_object_info_t doi;
741 VERIFY0(dmu_object_info(spa->spa_meta_objset, prev_obj, &doi));
742 if (doi.doi_bonus_size == sizeof (space_map_phys_t)) {
743 return (1);
744 }
745 }
746 return (0);
747 }
748
749 static uint64_t
get_checkpoint_refcount(vdev_t * vd)750 get_checkpoint_refcount(vdev_t *vd)
751 {
752 uint64_t refcount = 0;
753
754 if (vd->vdev_top == vd && vd->vdev_top_zap != 0 &&
755 zap_contains(spa_meta_objset(vd->vdev_spa),
756 vd->vdev_top_zap, VDEV_TOP_ZAP_POOL_CHECKPOINT_SM) == 0)
757 refcount++;
758
759 for (uint64_t c = 0; c < vd->vdev_children; c++)
760 refcount += get_checkpoint_refcount(vd->vdev_child[c]);
761
762 return (refcount);
763 }
764
765 static uint64_t
get_log_spacemap_refcount(spa_t * spa)766 get_log_spacemap_refcount(spa_t *spa)
767 {
768 return (avl_numnodes(&spa->spa_sm_logs_by_txg));
769 }
770
771 static int
verify_spacemap_refcounts(spa_t * spa)772 verify_spacemap_refcounts(spa_t *spa)
773 {
774 uint64_t expected_refcount = 0;
775 uint64_t actual_refcount = 0;
776 uint64_t dtl_refcount, metaslab_refcount, obsolete_refcount,
777 prev_obsolete_refcount, checkpoint_refcount, log_spacemap_refcount;
778
779 (void) feature_get_refcount(spa,
780 &spa_feature_table[SPA_FEATURE_SPACEMAP_HISTOGRAM],
781 &expected_refcount);
782 dtl_refcount = get_dtl_refcount(spa->spa_root_vdev);
783 metaslab_refcount = get_metaslab_refcount(spa->spa_root_vdev);
784 obsolete_refcount = get_obsolete_refcount(spa->spa_root_vdev);
785 prev_obsolete_refcount = get_prev_obsolete_spacemap_refcount(spa);
786 checkpoint_refcount = get_checkpoint_refcount(spa->spa_root_vdev);
787 log_spacemap_refcount = get_log_spacemap_refcount(spa);
788 actual_refcount = dtl_refcount + metaslab_refcount +
789 obsolete_refcount + prev_obsolete_refcount +
790 checkpoint_refcount + log_spacemap_refcount;
791
792 if (expected_refcount != actual_refcount) {
793 (void) printf("space map refcount mismatch: expected %llu != "
794 "actual %llu\n",
795 (u_longlong_t)expected_refcount,
796 (u_longlong_t)actual_refcount);
797 (void) printf("\tDTL: %llu, metaslab: %llu, obsolete: %llu, "
798 "prev obsolete: %llu, checkpoint: %llu, "
799 "log spacemap: %llu\n",
800 (u_longlong_t)dtl_refcount,
801 (u_longlong_t)metaslab_refcount,
802 (u_longlong_t)obsolete_refcount,
803 (u_longlong_t)prev_obsolete_refcount,
804 (u_longlong_t)checkpoint_refcount,
805 (u_longlong_t)log_spacemap_refcount);
806 return (2);
807 }
808 return (0);
809 }
810
811 static void
dump_spacemap(objset_t * os,space_map_t * sm)812 dump_spacemap(objset_t *os, space_map_t *sm)
813 {
814 char *ddata[] = { "ALLOC", "FREE", "CONDENSE", "INVALID",
815 "INVALID", "INVALID", "INVALID", "INVALID" };
816
817 if (sm == NULL)
818 return;
819
820 (void) printf("space map object %llu:\n",
821 (longlong_t)sm->sm_object);
822 (void) printf(" smp_length = 0x%llx\n",
823 (longlong_t)sm->sm_phys->smp_length);
824 (void) printf(" smp_alloc = 0x%llx\n",
825 (longlong_t)sm->sm_phys->smp_alloc);
826
827 if (dump_opt['d'] < 6 && dump_opt['m'] < 4)
828 return;
829
830 /*
831 * Print out the freelist entries in both encoded and decoded form.
832 */
833 uint8_t mapshift = sm->sm_shift;
834 int64_t alloc = 0;
835 uint64_t word, entry_id = 0;
836 for (uint64_t offset = 0; offset < space_map_length(sm);
837 offset += sizeof (word)) {
838
839 VERIFY0(dmu_read(os, space_map_object(sm), offset,
840 sizeof (word), &word, DMU_READ_PREFETCH));
841
842 if (sm_entry_is_debug(word)) {
843 (void) printf("\t [%6llu] %s: txg %llu pass %llu\n",
844 (u_longlong_t)entry_id,
845 ddata[SM_DEBUG_ACTION_DECODE(word)],
846 (u_longlong_t)SM_DEBUG_TXG_DECODE(word),
847 (u_longlong_t)SM_DEBUG_SYNCPASS_DECODE(word));
848 entry_id++;
849 continue;
850 }
851
852 uint8_t words;
853 char entry_type;
854 uint64_t entry_off, entry_run, entry_vdev = SM_NO_VDEVID;
855
856 if (sm_entry_is_single_word(word)) {
857 entry_type = (SM_TYPE_DECODE(word) == SM_ALLOC) ?
858 'A' : 'F';
859 entry_off = (SM_OFFSET_DECODE(word) << mapshift) +
860 sm->sm_start;
861 entry_run = SM_RUN_DECODE(word) << mapshift;
862 words = 1;
863 } else {
864 /* it is a two-word entry so we read another word */
865 ASSERT(sm_entry_is_double_word(word));
866
867 uint64_t extra_word;
868 offset += sizeof (extra_word);
869 VERIFY0(dmu_read(os, space_map_object(sm), offset,
870 sizeof (extra_word), &extra_word,
871 DMU_READ_PREFETCH));
872
873 ASSERT3U(offset, <=, space_map_length(sm));
874
875 entry_run = SM2_RUN_DECODE(word) << mapshift;
876 entry_vdev = SM2_VDEV_DECODE(word);
877 entry_type = (SM2_TYPE_DECODE(extra_word) == SM_ALLOC) ?
878 'A' : 'F';
879 entry_off = (SM2_OFFSET_DECODE(extra_word) <<
880 mapshift) + sm->sm_start;
881 words = 2;
882 }
883
884 (void) printf("\t [%6llu] %c range:"
885 " %010llx-%010llx size: %06llx vdev: %06llu words: %u\n",
886 (u_longlong_t)entry_id,
887 entry_type, (u_longlong_t)entry_off,
888 (u_longlong_t)(entry_off + entry_run),
889 (u_longlong_t)entry_run,
890 (u_longlong_t)entry_vdev, words);
891
892 if (entry_type == 'A')
893 alloc += entry_run;
894 else
895 alloc -= entry_run;
896 entry_id++;
897 }
898 if (alloc != space_map_allocated(sm)) {
899 (void) printf("space_map_object alloc (%lld) INCONSISTENT "
900 "with space map summary (%lld)\n",
901 (longlong_t)space_map_allocated(sm), (longlong_t)alloc);
902 }
903 }
904
905 static void
dump_metaslab_stats(metaslab_t * msp)906 dump_metaslab_stats(metaslab_t *msp)
907 {
908 char maxbuf[32];
909 range_tree_t *rt = msp->ms_allocatable;
910 zfs_btree_t *t = &msp->ms_allocatable_by_size;
911 int free_pct = range_tree_space(rt) * 100 / msp->ms_size;
912
913 /* max sure nicenum has enough space */
914 CTASSERT(sizeof (maxbuf) >= NN_NUMBUF_SZ);
915
916 zdb_nicenum(metaslab_largest_allocatable(msp), maxbuf, sizeof (maxbuf));
917
918 (void) printf("\t %25s %10lu %7s %6s %4s %4d%%\n",
919 "segments", zfs_btree_numnodes(t), "maxsize", maxbuf,
920 "freepct", free_pct);
921 (void) printf("\tIn-memory histogram:\n");
922 dump_histogram(rt->rt_histogram, RANGE_TREE_HISTOGRAM_SIZE, 0);
923 }
924
925 static void
dump_metaslab(metaslab_t * msp)926 dump_metaslab(metaslab_t *msp)
927 {
928 vdev_t *vd = msp->ms_group->mg_vd;
929 spa_t *spa = vd->vdev_spa;
930 space_map_t *sm = msp->ms_sm;
931 char freebuf[32];
932
933 zdb_nicenum(msp->ms_size - space_map_allocated(sm), freebuf,
934 sizeof (freebuf));
935
936 (void) printf(
937 "\tmetaslab %6llu offset %12llx spacemap %6llu free %5s\n",
938 (u_longlong_t)msp->ms_id, (u_longlong_t)msp->ms_start,
939 (u_longlong_t)space_map_object(sm), freebuf);
940
941 if (dump_opt['m'] > 2 && !dump_opt['L']) {
942 mutex_enter(&msp->ms_lock);
943 VERIFY0(metaslab_load(msp));
944 range_tree_stat_verify(msp->ms_allocatable);
945 dump_metaslab_stats(msp);
946 metaslab_unload(msp);
947 mutex_exit(&msp->ms_lock);
948 }
949
950 if (dump_opt['m'] > 1 && sm != NULL &&
951 spa_feature_is_active(spa, SPA_FEATURE_SPACEMAP_HISTOGRAM)) {
952 /*
953 * The space map histogram represents free space in chunks
954 * of sm_shift (i.e. bucket 0 refers to 2^sm_shift).
955 */
956 (void) printf("\tOn-disk histogram:\t\tfragmentation %llu\n",
957 (u_longlong_t)msp->ms_fragmentation);
958 dump_histogram(sm->sm_phys->smp_histogram,
959 SPACE_MAP_HISTOGRAM_SIZE, sm->sm_shift);
960 }
961
962 ASSERT(msp->ms_size == (1ULL << vd->vdev_ms_shift));
963 dump_spacemap(spa->spa_meta_objset, msp->ms_sm);
964
965 if (spa_feature_is_active(spa, SPA_FEATURE_LOG_SPACEMAP)) {
966 (void) printf("\tFlush data:\n\tunflushed txg=%llu\n\n",
967 (u_longlong_t)metaslab_unflushed_txg(msp));
968 }
969 }
970
971 static void
print_vdev_metaslab_header(vdev_t * vd)972 print_vdev_metaslab_header(vdev_t *vd)
973 {
974 vdev_alloc_bias_t alloc_bias = vd->vdev_alloc_bias;
975 const char *bias_str = "";
976
977 if (alloc_bias == VDEV_BIAS_LOG || vd->vdev_islog) {
978 bias_str = VDEV_ALLOC_BIAS_LOG;
979 } else if (alloc_bias == VDEV_BIAS_SPECIAL) {
980 bias_str = VDEV_ALLOC_BIAS_SPECIAL;
981 } else if (alloc_bias == VDEV_BIAS_DEDUP) {
982 bias_str = VDEV_ALLOC_BIAS_DEDUP;
983 }
984
985 uint64_t ms_flush_data_obj = 0;
986 if (vd->vdev_top_zap != 0) {
987 int error = zap_lookup(spa_meta_objset(vd->vdev_spa),
988 vd->vdev_top_zap, VDEV_TOP_ZAP_MS_UNFLUSHED_PHYS_TXGS,
989 sizeof (uint64_t), 1, &ms_flush_data_obj);
990 if (error != ENOENT) {
991 ASSERT0(error);
992 }
993 }
994
995 (void) printf("\tvdev %10llu %s",
996 (u_longlong_t)vd->vdev_id, bias_str);
997
998 if (ms_flush_data_obj != 0) {
999 (void) printf(" ms_unflushed_phys object %llu",
1000 (u_longlong_t)ms_flush_data_obj);
1001 }
1002
1003 (void) printf("\n\t%-10s%5llu %-19s %-15s %-12s\n",
1004 "metaslabs", (u_longlong_t)vd->vdev_ms_count,
1005 "offset", "spacemap", "free");
1006 (void) printf("\t%15s %19s %15s %12s\n",
1007 "---------------", "-------------------",
1008 "---------------", "------------");
1009 }
1010
1011 static void
dump_metaslab_groups(spa_t * spa)1012 dump_metaslab_groups(spa_t *spa)
1013 {
1014 vdev_t *rvd = spa->spa_root_vdev;
1015 metaslab_class_t *mc = spa_normal_class(spa);
1016 uint64_t fragmentation;
1017
1018 metaslab_class_histogram_verify(mc);
1019
1020 for (unsigned c = 0; c < rvd->vdev_children; c++) {
1021 vdev_t *tvd = rvd->vdev_child[c];
1022 metaslab_group_t *mg = tvd->vdev_mg;
1023
1024 if (mg == NULL || mg->mg_class != mc)
1025 continue;
1026
1027 metaslab_group_histogram_verify(mg);
1028 mg->mg_fragmentation = metaslab_group_fragmentation(mg);
1029
1030 (void) printf("\tvdev %10llu\t\tmetaslabs%5llu\t\t"
1031 "fragmentation",
1032 (u_longlong_t)tvd->vdev_id,
1033 (u_longlong_t)tvd->vdev_ms_count);
1034 if (mg->mg_fragmentation == ZFS_FRAG_INVALID) {
1035 (void) printf("%3s\n", "-");
1036 } else {
1037 (void) printf("%3llu%%\n",
1038 (u_longlong_t)mg->mg_fragmentation);
1039 }
1040 dump_histogram(mg->mg_histogram, RANGE_TREE_HISTOGRAM_SIZE, 0);
1041 }
1042
1043 (void) printf("\tpool %s\tfragmentation", spa_name(spa));
1044 fragmentation = metaslab_class_fragmentation(mc);
1045 if (fragmentation == ZFS_FRAG_INVALID)
1046 (void) printf("\t%3s\n", "-");
1047 else
1048 (void) printf("\t%3llu%%\n", (u_longlong_t)fragmentation);
1049 dump_histogram(mc->mc_histogram, RANGE_TREE_HISTOGRAM_SIZE, 0);
1050 }
1051
1052 static void
print_vdev_indirect(vdev_t * vd)1053 print_vdev_indirect(vdev_t *vd)
1054 {
1055 vdev_indirect_config_t *vic = &vd->vdev_indirect_config;
1056 vdev_indirect_mapping_t *vim = vd->vdev_indirect_mapping;
1057 vdev_indirect_births_t *vib = vd->vdev_indirect_births;
1058
1059 if (vim == NULL) {
1060 ASSERT3P(vib, ==, NULL);
1061 return;
1062 }
1063
1064 ASSERT3U(vdev_indirect_mapping_object(vim), ==,
1065 vic->vic_mapping_object);
1066 ASSERT3U(vdev_indirect_births_object(vib), ==,
1067 vic->vic_births_object);
1068
1069 (void) printf("indirect births obj %llu:\n",
1070 (longlong_t)vic->vic_births_object);
1071 (void) printf(" vib_count = %llu\n",
1072 (longlong_t)vdev_indirect_births_count(vib));
1073 for (uint64_t i = 0; i < vdev_indirect_births_count(vib); i++) {
1074 vdev_indirect_birth_entry_phys_t *cur_vibe =
1075 &vib->vib_entries[i];
1076 (void) printf("\toffset %llx -> txg %llu\n",
1077 (longlong_t)cur_vibe->vibe_offset,
1078 (longlong_t)cur_vibe->vibe_phys_birth_txg);
1079 }
1080 (void) printf("\n");
1081
1082 (void) printf("indirect mapping obj %llu:\n",
1083 (longlong_t)vic->vic_mapping_object);
1084 (void) printf(" vim_max_offset = 0x%llx\n",
1085 (longlong_t)vdev_indirect_mapping_max_offset(vim));
1086 (void) printf(" vim_bytes_mapped = 0x%llx\n",
1087 (longlong_t)vdev_indirect_mapping_bytes_mapped(vim));
1088 (void) printf(" vim_count = %llu\n",
1089 (longlong_t)vdev_indirect_mapping_num_entries(vim));
1090
1091 if (dump_opt['d'] <= 5 && dump_opt['m'] <= 3)
1092 return;
1093
1094 uint32_t *counts = vdev_indirect_mapping_load_obsolete_counts(vim);
1095
1096 for (uint64_t i = 0; i < vdev_indirect_mapping_num_entries(vim); i++) {
1097 vdev_indirect_mapping_entry_phys_t *vimep =
1098 &vim->vim_entries[i];
1099 (void) printf("\t<%llx:%llx:%llx> -> "
1100 "<%llx:%llx:%llx> (%x obsolete)\n",
1101 (longlong_t)vd->vdev_id,
1102 (longlong_t)DVA_MAPPING_GET_SRC_OFFSET(vimep),
1103 (longlong_t)DVA_GET_ASIZE(&vimep->vimep_dst),
1104 (longlong_t)DVA_GET_VDEV(&vimep->vimep_dst),
1105 (longlong_t)DVA_GET_OFFSET(&vimep->vimep_dst),
1106 (longlong_t)DVA_GET_ASIZE(&vimep->vimep_dst),
1107 counts[i]);
1108 }
1109 (void) printf("\n");
1110
1111 uint64_t obsolete_sm_object = vdev_obsolete_sm_object(vd);
1112 if (obsolete_sm_object != 0) {
1113 objset_t *mos = vd->vdev_spa->spa_meta_objset;
1114 (void) printf("obsolete space map object %llu:\n",
1115 (u_longlong_t)obsolete_sm_object);
1116 ASSERT(vd->vdev_obsolete_sm != NULL);
1117 ASSERT3U(space_map_object(vd->vdev_obsolete_sm), ==,
1118 obsolete_sm_object);
1119 dump_spacemap(mos, vd->vdev_obsolete_sm);
1120 (void) printf("\n");
1121 }
1122 }
1123
1124 static void
dump_metaslabs(spa_t * spa)1125 dump_metaslabs(spa_t *spa)
1126 {
1127 vdev_t *vd, *rvd = spa->spa_root_vdev;
1128 uint64_t m, c = 0, children = rvd->vdev_children;
1129
1130 (void) printf("\nMetaslabs:\n");
1131
1132 if (!dump_opt['d'] && zopt_objects > 0) {
1133 c = zopt_object[0];
1134
1135 if (c >= children)
1136 (void) fatal("bad vdev id: %llu", (u_longlong_t)c);
1137
1138 if (zopt_objects > 1) {
1139 vd = rvd->vdev_child[c];
1140 print_vdev_metaslab_header(vd);
1141
1142 for (m = 1; m < zopt_objects; m++) {
1143 if (zopt_object[m] < vd->vdev_ms_count)
1144 dump_metaslab(
1145 vd->vdev_ms[zopt_object[m]]);
1146 else
1147 (void) fprintf(stderr, "bad metaslab "
1148 "number %llu\n",
1149 (u_longlong_t)zopt_object[m]);
1150 }
1151 (void) printf("\n");
1152 return;
1153 }
1154 children = c + 1;
1155 }
1156 for (; c < children; c++) {
1157 vd = rvd->vdev_child[c];
1158 print_vdev_metaslab_header(vd);
1159
1160 print_vdev_indirect(vd);
1161
1162 for (m = 0; m < vd->vdev_ms_count; m++)
1163 dump_metaslab(vd->vdev_ms[m]);
1164 (void) printf("\n");
1165 }
1166 }
1167
1168 static void
dump_log_spacemaps(spa_t * spa)1169 dump_log_spacemaps(spa_t *spa)
1170 {
1171 if (!spa_feature_is_active(spa, SPA_FEATURE_LOG_SPACEMAP))
1172 return;
1173
1174 (void) printf("\nLog Space Maps in Pool:\n");
1175 for (spa_log_sm_t *sls = avl_first(&spa->spa_sm_logs_by_txg);
1176 sls; sls = AVL_NEXT(&spa->spa_sm_logs_by_txg, sls)) {
1177 space_map_t *sm = NULL;
1178 VERIFY0(space_map_open(&sm, spa_meta_objset(spa),
1179 sls->sls_sm_obj, 0, UINT64_MAX, SPA_MINBLOCKSHIFT));
1180
1181 (void) printf("Log Spacemap object %llu txg %llu\n",
1182 (u_longlong_t)sls->sls_sm_obj, (u_longlong_t)sls->sls_txg);
1183 dump_spacemap(spa->spa_meta_objset, sm);
1184 space_map_close(sm);
1185 }
1186 (void) printf("\n");
1187 }
1188
1189 static void
dump_dde(const ddt_t * ddt,const ddt_entry_t * dde,uint64_t index)1190 dump_dde(const ddt_t *ddt, const ddt_entry_t *dde, uint64_t index)
1191 {
1192 const ddt_phys_t *ddp = dde->dde_phys;
1193 const ddt_key_t *ddk = &dde->dde_key;
1194 const char *types[4] = { "ditto", "single", "double", "triple" };
1195 char blkbuf[BP_SPRINTF_LEN];
1196 blkptr_t blk;
1197
1198 for (int p = 0; p < DDT_PHYS_TYPES; p++, ddp++) {
1199 if (ddp->ddp_phys_birth == 0)
1200 continue;
1201 ddt_bp_create(ddt->ddt_checksum, ddk, ddp, &blk);
1202 snprintf_blkptr(blkbuf, sizeof (blkbuf), &blk);
1203 (void) printf("index %llx refcnt %llu %s %s\n",
1204 (u_longlong_t)index, (u_longlong_t)ddp->ddp_refcnt,
1205 types[p], blkbuf);
1206 }
1207 }
1208
1209 static void
dump_dedup_ratio(const ddt_stat_t * dds)1210 dump_dedup_ratio(const ddt_stat_t *dds)
1211 {
1212 double rL, rP, rD, D, dedup, compress, copies;
1213
1214 if (dds->dds_blocks == 0)
1215 return;
1216
1217 rL = (double)dds->dds_ref_lsize;
1218 rP = (double)dds->dds_ref_psize;
1219 rD = (double)dds->dds_ref_dsize;
1220 D = (double)dds->dds_dsize;
1221
1222 dedup = rD / D;
1223 compress = rL / rP;
1224 copies = rD / rP;
1225
1226 (void) printf("dedup = %.2f, compress = %.2f, copies = %.2f, "
1227 "dedup * compress / copies = %.2f\n\n",
1228 dedup, compress, copies, dedup * compress / copies);
1229 }
1230
1231 static void
dump_ddt(ddt_t * ddt,enum ddt_type type,enum ddt_class class)1232 dump_ddt(ddt_t *ddt, enum ddt_type type, enum ddt_class class)
1233 {
1234 char name[DDT_NAMELEN];
1235 ddt_entry_t dde;
1236 uint64_t walk = 0;
1237 dmu_object_info_t doi;
1238 uint64_t count, dspace, mspace;
1239 int error;
1240
1241 error = ddt_object_info(ddt, type, class, &doi);
1242
1243 if (error == ENOENT)
1244 return;
1245 ASSERT(error == 0);
1246
1247 if ((count = ddt_object_count(ddt, type, class)) == 0)
1248 return;
1249
1250 dspace = doi.doi_physical_blocks_512 << 9;
1251 mspace = doi.doi_fill_count * doi.doi_data_block_size;
1252
1253 ddt_object_name(ddt, type, class, name);
1254
1255 (void) printf("%s: %llu entries, size %llu on disk, %llu in core\n",
1256 name,
1257 (u_longlong_t)count,
1258 (u_longlong_t)(dspace / count),
1259 (u_longlong_t)(mspace / count));
1260
1261 if (dump_opt['D'] < 3)
1262 return;
1263
1264 zpool_dump_ddt(NULL, &ddt->ddt_histogram[type][class]);
1265
1266 if (dump_opt['D'] < 4)
1267 return;
1268
1269 if (dump_opt['D'] < 5 && class == DDT_CLASS_UNIQUE)
1270 return;
1271
1272 (void) printf("%s contents:\n\n", name);
1273
1274 while ((error = ddt_object_walk(ddt, type, class, &walk, &dde)) == 0)
1275 dump_dde(ddt, &dde, walk);
1276
1277 ASSERT3U(error, ==, ENOENT);
1278
1279 (void) printf("\n");
1280 }
1281
1282 static void
dump_all_ddts(spa_t * spa)1283 dump_all_ddts(spa_t *spa)
1284 {
1285 ddt_histogram_t ddh_total;
1286 ddt_stat_t dds_total;
1287
1288 bzero(&ddh_total, sizeof (ddh_total));
1289 bzero(&dds_total, sizeof (dds_total));
1290
1291 for (enum zio_checksum c = 0; c < ZIO_CHECKSUM_FUNCTIONS; c++) {
1292 ddt_t *ddt = spa->spa_ddt[c];
1293 for (enum ddt_type type = 0; type < DDT_TYPES; type++) {
1294 for (enum ddt_class class = 0; class < DDT_CLASSES;
1295 class++) {
1296 dump_ddt(ddt, type, class);
1297 }
1298 }
1299 }
1300
1301 ddt_get_dedup_stats(spa, &dds_total);
1302
1303 if (dds_total.dds_blocks == 0) {
1304 (void) printf("All DDTs are empty\n");
1305 return;
1306 }
1307
1308 (void) printf("\n");
1309
1310 if (dump_opt['D'] > 1) {
1311 (void) printf("DDT histogram (aggregated over all DDTs):\n");
1312 ddt_get_dedup_histogram(spa, &ddh_total);
1313 zpool_dump_ddt(&dds_total, &ddh_total);
1314 }
1315
1316 dump_dedup_ratio(&dds_total);
1317 }
1318
1319 static void
dump_dtl_seg(void * arg,uint64_t start,uint64_t size)1320 dump_dtl_seg(void *arg, uint64_t start, uint64_t size)
1321 {
1322 char *prefix = arg;
1323
1324 (void) printf("%s [%llu,%llu) length %llu\n",
1325 prefix,
1326 (u_longlong_t)start,
1327 (u_longlong_t)(start + size),
1328 (u_longlong_t)(size));
1329 }
1330
1331 static void
dump_dtl(vdev_t * vd,int indent)1332 dump_dtl(vdev_t *vd, int indent)
1333 {
1334 spa_t *spa = vd->vdev_spa;
1335 boolean_t required;
1336 const char *name[DTL_TYPES] = { "missing", "partial", "scrub",
1337 "outage" };
1338 char prefix[256];
1339
1340 spa_vdev_state_enter(spa, SCL_NONE);
1341 required = vdev_dtl_required(vd);
1342 (void) spa_vdev_state_exit(spa, NULL, 0);
1343
1344 if (indent == 0)
1345 (void) printf("\nDirty time logs:\n\n");
1346
1347 (void) printf("\t%*s%s [%s]\n", indent, "",
1348 vd->vdev_path ? vd->vdev_path :
1349 vd->vdev_parent ? vd->vdev_ops->vdev_op_type : spa_name(spa),
1350 required ? "DTL-required" : "DTL-expendable");
1351
1352 for (int t = 0; t < DTL_TYPES; t++) {
1353 range_tree_t *rt = vd->vdev_dtl[t];
1354 if (range_tree_space(rt) == 0)
1355 continue;
1356 (void) snprintf(prefix, sizeof (prefix), "\t%*s%s",
1357 indent + 2, "", name[t]);
1358 range_tree_walk(rt, dump_dtl_seg, prefix);
1359 if (dump_opt['d'] > 5 && vd->vdev_children == 0)
1360 dump_spacemap(spa->spa_meta_objset, vd->vdev_dtl_sm);
1361 }
1362
1363 for (unsigned c = 0; c < vd->vdev_children; c++)
1364 dump_dtl(vd->vdev_child[c], indent + 4);
1365 }
1366
1367 static void
dump_history(spa_t * spa)1368 dump_history(spa_t *spa)
1369 {
1370 nvlist_t **events = NULL;
1371 uint64_t resid, len, off = 0;
1372 uint_t num = 0;
1373 int error;
1374 char tbuf[30];
1375
1376 char *buf = umem_alloc(SPA_MAXBLOCKSIZE, UMEM_NOFAIL);
1377 do {
1378 len = SPA_MAXBLOCKSIZE;
1379
1380 if ((error = spa_history_get(spa, &off, &len, buf)) != 0) {
1381 (void) fprintf(stderr, "Unable to read history: "
1382 "error %d\n", error);
1383 umem_free(buf, SPA_MAXBLOCKSIZE);
1384 return;
1385 }
1386
1387 if (zpool_history_unpack(buf, len, &resid, &events, &num) != 0)
1388 break;
1389
1390 off -= resid;
1391 } while (len != 0);
1392 umem_free(buf, SPA_MAXBLOCKSIZE);
1393
1394 (void) printf("\nHistory:\n");
1395 for (unsigned i = 0; i < num; i++) {
1396 boolean_t printed = B_FALSE;
1397
1398 if (nvlist_exists(events[i], ZPOOL_HIST_TIME)) {
1399 time_t tsec;
1400 struct tm t;
1401
1402 tsec = fnvlist_lookup_uint64(events[i],
1403 ZPOOL_HIST_TIME);
1404 (void) localtime_r(&tsec, &t);
1405 (void) strftime(tbuf, sizeof (tbuf), "%F.%T", &t);
1406 } else {
1407 tbuf[0] = '\0';
1408 }
1409
1410 if (nvlist_exists(events[i], ZPOOL_HIST_CMD)) {
1411 (void) printf("%s %s\n", tbuf,
1412 fnvlist_lookup_string(events[i], ZPOOL_HIST_CMD));
1413 } else if (nvlist_exists(events[i], ZPOOL_HIST_INT_EVENT)) {
1414 uint64_t ievent;
1415
1416 ievent = fnvlist_lookup_uint64(events[i],
1417 ZPOOL_HIST_INT_EVENT);
1418 if (ievent >= ZFS_NUM_LEGACY_HISTORY_EVENTS)
1419 goto next;
1420
1421 (void) printf(" %s [internal %s txg:%ju] %s\n",
1422 tbuf,
1423 zfs_history_event_names[ievent],
1424 fnvlist_lookup_uint64(events[i],
1425 ZPOOL_HIST_TXG),
1426 fnvlist_lookup_string(events[i],
1427 ZPOOL_HIST_INT_STR));
1428 } else if (nvlist_exists(events[i], ZPOOL_HIST_INT_NAME)) {
1429 (void) printf("%s [txg:%ju] %s", tbuf,
1430 fnvlist_lookup_uint64(events[i],
1431 ZPOOL_HIST_TXG),
1432 fnvlist_lookup_string(events[i],
1433 ZPOOL_HIST_INT_NAME));
1434
1435 if (nvlist_exists(events[i], ZPOOL_HIST_DSNAME)) {
1436 (void) printf(" %s (%llu)",
1437 fnvlist_lookup_string(events[i],
1438 ZPOOL_HIST_DSNAME),
1439 (u_longlong_t)fnvlist_lookup_uint64(
1440 events[i],
1441 ZPOOL_HIST_DSID));
1442 }
1443
1444 (void) printf(" %s\n", fnvlist_lookup_string(events[i],
1445 ZPOOL_HIST_INT_STR));
1446 } else if (nvlist_exists(events[i], ZPOOL_HIST_IOCTL)) {
1447 (void) printf("%s ioctl %s\n", tbuf,
1448 fnvlist_lookup_string(events[i],
1449 ZPOOL_HIST_IOCTL));
1450
1451 if (nvlist_exists(events[i], ZPOOL_HIST_INPUT_NVL)) {
1452 (void) printf(" input:\n");
1453 dump_nvlist(fnvlist_lookup_nvlist(events[i],
1454 ZPOOL_HIST_INPUT_NVL), 8);
1455 }
1456 if (nvlist_exists(events[i], ZPOOL_HIST_OUTPUT_NVL)) {
1457 (void) printf(" output:\n");
1458 dump_nvlist(fnvlist_lookup_nvlist(events[i],
1459 ZPOOL_HIST_OUTPUT_NVL), 8);
1460 }
1461 if (nvlist_exists(events[i], ZPOOL_HIST_ERRNO)) {
1462 (void) printf(" errno: %lld\n",
1463 (longlong_t)fnvlist_lookup_int64(events[i],
1464 ZPOOL_HIST_ERRNO));
1465 }
1466 } else {
1467 goto next;
1468 }
1469
1470 printed = B_TRUE;
1471 next:
1472 if (dump_opt['h'] > 1) {
1473 if (!printed)
1474 (void) printf("unrecognized record:\n");
1475 dump_nvlist(events[i], 2);
1476 }
1477 }
1478 }
1479
1480 /*ARGSUSED*/
1481 static void
dump_dnode(objset_t * os,uint64_t object,void * data,size_t size)1482 dump_dnode(objset_t *os, uint64_t object, void *data, size_t size)
1483 {
1484 }
1485
1486 static uint64_t
blkid2offset(const dnode_phys_t * dnp,const blkptr_t * bp,const zbookmark_phys_t * zb)1487 blkid2offset(const dnode_phys_t *dnp, const blkptr_t *bp,
1488 const zbookmark_phys_t *zb)
1489 {
1490 if (dnp == NULL) {
1491 ASSERT(zb->zb_level < 0);
1492 if (zb->zb_object == 0)
1493 return (zb->zb_blkid);
1494 return (zb->zb_blkid * BP_GET_LSIZE(bp));
1495 }
1496
1497 ASSERT(zb->zb_level >= 0);
1498
1499 return ((zb->zb_blkid <<
1500 (zb->zb_level * (dnp->dn_indblkshift - SPA_BLKPTRSHIFT))) *
1501 dnp->dn_datablkszsec << SPA_MINBLOCKSHIFT);
1502 }
1503
1504 static void
snprintf_blkptr_compact(char * blkbuf,size_t buflen,const blkptr_t * bp)1505 snprintf_blkptr_compact(char *blkbuf, size_t buflen, const blkptr_t *bp)
1506 {
1507 const dva_t *dva = bp->blk_dva;
1508 unsigned int ndvas = dump_opt['d'] > 5 ? BP_GET_NDVAS(bp) : 1;
1509
1510 if (dump_opt['b'] >= 6) {
1511 snprintf_blkptr(blkbuf, buflen, bp);
1512 return;
1513 }
1514
1515 if (BP_IS_EMBEDDED(bp)) {
1516 (void) sprintf(blkbuf,
1517 "EMBEDDED et=%u %llxL/%llxP B=%llu",
1518 (int)BPE_GET_ETYPE(bp),
1519 (u_longlong_t)BPE_GET_LSIZE(bp),
1520 (u_longlong_t)BPE_GET_PSIZE(bp),
1521 (u_longlong_t)bp->blk_birth);
1522 return;
1523 }
1524
1525 blkbuf[0] = '\0';
1526 for (unsigned int i = 0; i < ndvas; i++)
1527 (void) snprintf(blkbuf + strlen(blkbuf),
1528 buflen - strlen(blkbuf), "%llu:%llx:%llx ",
1529 (u_longlong_t)DVA_GET_VDEV(&dva[i]),
1530 (u_longlong_t)DVA_GET_OFFSET(&dva[i]),
1531 (u_longlong_t)DVA_GET_ASIZE(&dva[i]));
1532
1533 if (BP_IS_HOLE(bp)) {
1534 (void) snprintf(blkbuf + strlen(blkbuf),
1535 buflen - strlen(blkbuf),
1536 "%llxL B=%llu",
1537 (u_longlong_t)BP_GET_LSIZE(bp),
1538 (u_longlong_t)bp->blk_birth);
1539 } else {
1540 (void) snprintf(blkbuf + strlen(blkbuf),
1541 buflen - strlen(blkbuf),
1542 "%llxL/%llxP F=%llu B=%llu/%llu",
1543 (u_longlong_t)BP_GET_LSIZE(bp),
1544 (u_longlong_t)BP_GET_PSIZE(bp),
1545 (u_longlong_t)BP_GET_FILL(bp),
1546 (u_longlong_t)bp->blk_birth,
1547 (u_longlong_t)BP_PHYSICAL_BIRTH(bp));
1548 }
1549 }
1550
1551 static void
print_indirect(blkptr_t * bp,const zbookmark_phys_t * zb,const dnode_phys_t * dnp)1552 print_indirect(blkptr_t *bp, const zbookmark_phys_t *zb,
1553 const dnode_phys_t *dnp)
1554 {
1555 char blkbuf[BP_SPRINTF_LEN];
1556 int l;
1557
1558 if (!BP_IS_EMBEDDED(bp)) {
1559 ASSERT3U(BP_GET_TYPE(bp), ==, dnp->dn_type);
1560 ASSERT3U(BP_GET_LEVEL(bp), ==, zb->zb_level);
1561 }
1562
1563 (void) printf("%16llx ", (u_longlong_t)blkid2offset(dnp, bp, zb));
1564
1565 ASSERT(zb->zb_level >= 0);
1566
1567 for (l = dnp->dn_nlevels - 1; l >= -1; l--) {
1568 if (l == zb->zb_level) {
1569 (void) printf("L%llx", (u_longlong_t)zb->zb_level);
1570 } else {
1571 (void) printf(" ");
1572 }
1573 }
1574
1575 snprintf_blkptr_compact(blkbuf, sizeof (blkbuf), bp);
1576 (void) printf("%s\n", blkbuf);
1577 }
1578
1579 static int
visit_indirect(spa_t * spa,const dnode_phys_t * dnp,blkptr_t * bp,const zbookmark_phys_t * zb)1580 visit_indirect(spa_t *spa, const dnode_phys_t *dnp,
1581 blkptr_t *bp, const zbookmark_phys_t *zb)
1582 {
1583 int err = 0;
1584
1585 if (bp->blk_birth == 0)
1586 return (0);
1587
1588 print_indirect(bp, zb, dnp);
1589
1590 if (BP_GET_LEVEL(bp) > 0 && !BP_IS_HOLE(bp)) {
1591 arc_flags_t flags = ARC_FLAG_WAIT;
1592 int i;
1593 blkptr_t *cbp;
1594 int epb = BP_GET_LSIZE(bp) >> SPA_BLKPTRSHIFT;
1595 arc_buf_t *buf;
1596 uint64_t fill = 0;
1597
1598 err = arc_read(NULL, spa, bp, arc_getbuf_func, &buf,
1599 ZIO_PRIORITY_ASYNC_READ, ZIO_FLAG_CANFAIL, &flags, zb);
1600 if (err)
1601 return (err);
1602 ASSERT(buf->b_data);
1603
1604 /* recursively visit blocks below this */
1605 cbp = buf->b_data;
1606 for (i = 0; i < epb; i++, cbp++) {
1607 zbookmark_phys_t czb;
1608
1609 SET_BOOKMARK(&czb, zb->zb_objset, zb->zb_object,
1610 zb->zb_level - 1,
1611 zb->zb_blkid * epb + i);
1612 err = visit_indirect(spa, dnp, cbp, &czb);
1613 if (err)
1614 break;
1615 fill += BP_GET_FILL(cbp);
1616 }
1617 if (!err)
1618 ASSERT3U(fill, ==, BP_GET_FILL(bp));
1619 arc_buf_destroy(buf, &buf);
1620 }
1621
1622 return (err);
1623 }
1624
1625 /*ARGSUSED*/
1626 static void
dump_indirect(dnode_t * dn)1627 dump_indirect(dnode_t *dn)
1628 {
1629 dnode_phys_t *dnp = dn->dn_phys;
1630 int j;
1631 zbookmark_phys_t czb;
1632
1633 (void) printf("Indirect blocks:\n");
1634
1635 SET_BOOKMARK(&czb, dmu_objset_id(dn->dn_objset),
1636 dn->dn_object, dnp->dn_nlevels - 1, 0);
1637 for (j = 0; j < dnp->dn_nblkptr; j++) {
1638 czb.zb_blkid = j;
1639 (void) visit_indirect(dmu_objset_spa(dn->dn_objset), dnp,
1640 &dnp->dn_blkptr[j], &czb);
1641 }
1642
1643 (void) printf("\n");
1644 }
1645
1646 /*ARGSUSED*/
1647 static void
dump_dsl_dir(objset_t * os,uint64_t object,void * data,size_t size)1648 dump_dsl_dir(objset_t *os, uint64_t object, void *data, size_t size)
1649 {
1650 dsl_dir_phys_t *dd = data;
1651 time_t crtime;
1652 char nice[32];
1653
1654 /* make sure nicenum has enough space */
1655 CTASSERT(sizeof (nice) >= NN_NUMBUF_SZ);
1656
1657 if (dd == NULL)
1658 return;
1659
1660 ASSERT3U(size, >=, sizeof (dsl_dir_phys_t));
1661
1662 crtime = dd->dd_creation_time;
1663 (void) printf("\t\tcreation_time = %s", ctime(&crtime));
1664 (void) printf("\t\thead_dataset_obj = %llu\n",
1665 (u_longlong_t)dd->dd_head_dataset_obj);
1666 (void) printf("\t\tparent_dir_obj = %llu\n",
1667 (u_longlong_t)dd->dd_parent_obj);
1668 (void) printf("\t\torigin_obj = %llu\n",
1669 (u_longlong_t)dd->dd_origin_obj);
1670 (void) printf("\t\tchild_dir_zapobj = %llu\n",
1671 (u_longlong_t)dd->dd_child_dir_zapobj);
1672 zdb_nicenum(dd->dd_used_bytes, nice, sizeof (nice));
1673 (void) printf("\t\tused_bytes = %s\n", nice);
1674 zdb_nicenum(dd->dd_compressed_bytes, nice, sizeof (nice));
1675 (void) printf("\t\tcompressed_bytes = %s\n", nice);
1676 zdb_nicenum(dd->dd_uncompressed_bytes, nice, sizeof (nice));
1677 (void) printf("\t\tuncompressed_bytes = %s\n", nice);
1678 zdb_nicenum(dd->dd_quota, nice, sizeof (nice));
1679 (void) printf("\t\tquota = %s\n", nice);
1680 zdb_nicenum(dd->dd_reserved, nice, sizeof (nice));
1681 (void) printf("\t\treserved = %s\n", nice);
1682 (void) printf("\t\tprops_zapobj = %llu\n",
1683 (u_longlong_t)dd->dd_props_zapobj);
1684 (void) printf("\t\tdeleg_zapobj = %llu\n",
1685 (u_longlong_t)dd->dd_deleg_zapobj);
1686 (void) printf("\t\tflags = %llx\n",
1687 (u_longlong_t)dd->dd_flags);
1688
1689 #define DO(which) \
1690 zdb_nicenum(dd->dd_used_breakdown[DD_USED_ ## which], nice, \
1691 sizeof (nice)); \
1692 (void) printf("\t\tused_breakdown[" #which "] = %s\n", nice)
1693 DO(HEAD);
1694 DO(SNAP);
1695 DO(CHILD);
1696 DO(CHILD_RSRV);
1697 DO(REFRSRV);
1698 #undef DO
1699 (void) printf("\t\tclones = %llu\n",
1700 (u_longlong_t)dd->dd_clones);
1701 }
1702
1703 /*ARGSUSED*/
1704 static void
dump_dsl_dataset(objset_t * os,uint64_t object,void * data,size_t size)1705 dump_dsl_dataset(objset_t *os, uint64_t object, void *data, size_t size)
1706 {
1707 dsl_dataset_phys_t *ds = data;
1708 time_t crtime;
1709 char used[32], compressed[32], uncompressed[32], unique[32];
1710 char blkbuf[BP_SPRINTF_LEN];
1711
1712 /* make sure nicenum has enough space */
1713 CTASSERT(sizeof (used) >= NN_NUMBUF_SZ);
1714 CTASSERT(sizeof (compressed) >= NN_NUMBUF_SZ);
1715 CTASSERT(sizeof (uncompressed) >= NN_NUMBUF_SZ);
1716 CTASSERT(sizeof (unique) >= NN_NUMBUF_SZ);
1717
1718 if (ds == NULL)
1719 return;
1720
1721 ASSERT(size == sizeof (*ds));
1722 crtime = ds->ds_creation_time;
1723 zdb_nicenum(ds->ds_referenced_bytes, used, sizeof (used));
1724 zdb_nicenum(ds->ds_compressed_bytes, compressed, sizeof (compressed));
1725 zdb_nicenum(ds->ds_uncompressed_bytes, uncompressed,
1726 sizeof (uncompressed));
1727 zdb_nicenum(ds->ds_unique_bytes, unique, sizeof (unique));
1728 snprintf_blkptr(blkbuf, sizeof (blkbuf), &ds->ds_bp);
1729
1730 (void) printf("\t\tdir_obj = %llu\n",
1731 (u_longlong_t)ds->ds_dir_obj);
1732 (void) printf("\t\tprev_snap_obj = %llu\n",
1733 (u_longlong_t)ds->ds_prev_snap_obj);
1734 (void) printf("\t\tprev_snap_txg = %llu\n",
1735 (u_longlong_t)ds->ds_prev_snap_txg);
1736 (void) printf("\t\tnext_snap_obj = %llu\n",
1737 (u_longlong_t)ds->ds_next_snap_obj);
1738 (void) printf("\t\tsnapnames_zapobj = %llu\n",
1739 (u_longlong_t)ds->ds_snapnames_zapobj);
1740 (void) printf("\t\tnum_children = %llu\n",
1741 (u_longlong_t)ds->ds_num_children);
1742 (void) printf("\t\tuserrefs_obj = %llu\n",
1743 (u_longlong_t)ds->ds_userrefs_obj);
1744 (void) printf("\t\tcreation_time = %s", ctime(&crtime));
1745 (void) printf("\t\tcreation_txg = %llu\n",
1746 (u_longlong_t)ds->ds_creation_txg);
1747 (void) printf("\t\tdeadlist_obj = %llu\n",
1748 (u_longlong_t)ds->ds_deadlist_obj);
1749 (void) printf("\t\tused_bytes = %s\n", used);
1750 (void) printf("\t\tcompressed_bytes = %s\n", compressed);
1751 (void) printf("\t\tuncompressed_bytes = %s\n", uncompressed);
1752 (void) printf("\t\tunique = %s\n", unique);
1753 (void) printf("\t\tfsid_guid = %llu\n",
1754 (u_longlong_t)ds->ds_fsid_guid);
1755 (void) printf("\t\tguid = %llu\n",
1756 (u_longlong_t)ds->ds_guid);
1757 (void) printf("\t\tflags = %llx\n",
1758 (u_longlong_t)ds->ds_flags);
1759 (void) printf("\t\tnext_clones_obj = %llu\n",
1760 (u_longlong_t)ds->ds_next_clones_obj);
1761 (void) printf("\t\tprops_obj = %llu\n",
1762 (u_longlong_t)ds->ds_props_obj);
1763 (void) printf("\t\tbp = %s\n", blkbuf);
1764 }
1765
1766 /* ARGSUSED */
1767 static int
dump_bptree_cb(void * arg,const blkptr_t * bp,dmu_tx_t * tx)1768 dump_bptree_cb(void *arg, const blkptr_t *bp, dmu_tx_t *tx)
1769 {
1770 char blkbuf[BP_SPRINTF_LEN];
1771
1772 if (bp->blk_birth != 0) {
1773 snprintf_blkptr(blkbuf, sizeof (blkbuf), bp);
1774 (void) printf("\t%s\n", blkbuf);
1775 }
1776 return (0);
1777 }
1778
1779 static void
dump_bptree(objset_t * os,uint64_t obj,const char * name)1780 dump_bptree(objset_t *os, uint64_t obj, const char *name)
1781 {
1782 char bytes[32];
1783 bptree_phys_t *bt;
1784 dmu_buf_t *db;
1785
1786 /* make sure nicenum has enough space */
1787 CTASSERT(sizeof (bytes) >= NN_NUMBUF_SZ);
1788
1789 if (dump_opt['d'] < 3)
1790 return;
1791
1792 VERIFY3U(0, ==, dmu_bonus_hold(os, obj, FTAG, &db));
1793 bt = db->db_data;
1794 zdb_nicenum(bt->bt_bytes, bytes, sizeof (bytes));
1795 (void) printf("\n %s: %llu datasets, %s\n",
1796 name, (unsigned long long)(bt->bt_end - bt->bt_begin), bytes);
1797 dmu_buf_rele(db, FTAG);
1798
1799 if (dump_opt['d'] < 5)
1800 return;
1801
1802 (void) printf("\n");
1803
1804 (void) bptree_iterate(os, obj, B_FALSE, dump_bptree_cb, NULL, NULL);
1805 }
1806
1807 /* ARGSUSED */
1808 static int
dump_bpobj_cb(void * arg,const blkptr_t * bp,dmu_tx_t * tx)1809 dump_bpobj_cb(void *arg, const blkptr_t *bp, dmu_tx_t *tx)
1810 {
1811 char blkbuf[BP_SPRINTF_LEN];
1812
1813 ASSERT(bp->blk_birth != 0);
1814 snprintf_blkptr_compact(blkbuf, sizeof (blkbuf), bp);
1815 (void) printf("\t%s\n", blkbuf);
1816 return (0);
1817 }
1818
1819 static void
dump_full_bpobj(bpobj_t * bpo,const char * name,int indent)1820 dump_full_bpobj(bpobj_t *bpo, const char *name, int indent)
1821 {
1822 char bytes[32];
1823 char comp[32];
1824 char uncomp[32];
1825
1826 /* make sure nicenum has enough space */
1827 CTASSERT(sizeof (bytes) >= NN_NUMBUF_SZ);
1828 CTASSERT(sizeof (comp) >= NN_NUMBUF_SZ);
1829 CTASSERT(sizeof (uncomp) >= NN_NUMBUF_SZ);
1830
1831 if (dump_opt['d'] < 3)
1832 return;
1833
1834 zdb_nicenum(bpo->bpo_phys->bpo_bytes, bytes, sizeof (bytes));
1835 if (bpo->bpo_havesubobj && bpo->bpo_phys->bpo_subobjs != 0) {
1836 zdb_nicenum(bpo->bpo_phys->bpo_comp, comp, sizeof (comp));
1837 zdb_nicenum(bpo->bpo_phys->bpo_uncomp, uncomp, sizeof (uncomp));
1838 (void) printf(" %*s: object %llu, %llu local blkptrs, "
1839 "%llu subobjs in object %llu, %s (%s/%s comp)\n",
1840 indent * 8, name,
1841 (u_longlong_t)bpo->bpo_object,
1842 (u_longlong_t)bpo->bpo_phys->bpo_num_blkptrs,
1843 (u_longlong_t)bpo->bpo_phys->bpo_num_subobjs,
1844 (u_longlong_t)bpo->bpo_phys->bpo_subobjs,
1845 bytes, comp, uncomp);
1846
1847 for (uint64_t i = 0; i < bpo->bpo_phys->bpo_num_subobjs; i++) {
1848 uint64_t subobj;
1849 bpobj_t subbpo;
1850 int error;
1851 VERIFY0(dmu_read(bpo->bpo_os,
1852 bpo->bpo_phys->bpo_subobjs,
1853 i * sizeof (subobj), sizeof (subobj), &subobj, 0));
1854 error = bpobj_open(&subbpo, bpo->bpo_os, subobj);
1855 if (error != 0) {
1856 (void) printf("ERROR %u while trying to open "
1857 "subobj id %llu\n",
1858 error, (u_longlong_t)subobj);
1859 continue;
1860 }
1861 dump_full_bpobj(&subbpo, "subobj", indent + 1);
1862 bpobj_close(&subbpo);
1863 }
1864 } else {
1865 (void) printf(" %*s: object %llu, %llu blkptrs, %s\n",
1866 indent * 8, name,
1867 (u_longlong_t)bpo->bpo_object,
1868 (u_longlong_t)bpo->bpo_phys->bpo_num_blkptrs,
1869 bytes);
1870 }
1871
1872 if (dump_opt['d'] < 5)
1873 return;
1874
1875
1876 if (indent == 0) {
1877 (void) bpobj_iterate_nofree(bpo, dump_bpobj_cb, NULL, NULL);
1878 (void) printf("\n");
1879 }
1880 }
1881
1882 static void
bpobj_count_refd(bpobj_t * bpo)1883 bpobj_count_refd(bpobj_t *bpo)
1884 {
1885 mos_obj_refd(bpo->bpo_object);
1886
1887 if (bpo->bpo_havesubobj && bpo->bpo_phys->bpo_subobjs != 0) {
1888 mos_obj_refd(bpo->bpo_phys->bpo_subobjs);
1889 for (uint64_t i = 0; i < bpo->bpo_phys->bpo_num_subobjs; i++) {
1890 uint64_t subobj;
1891 bpobj_t subbpo;
1892 int error;
1893 VERIFY0(dmu_read(bpo->bpo_os,
1894 bpo->bpo_phys->bpo_subobjs,
1895 i * sizeof (subobj), sizeof (subobj), &subobj, 0));
1896 error = bpobj_open(&subbpo, bpo->bpo_os, subobj);
1897 if (error != 0) {
1898 (void) printf("ERROR %u while trying to open "
1899 "subobj id %llu\n",
1900 error, (u_longlong_t)subobj);
1901 continue;
1902 }
1903 bpobj_count_refd(&subbpo);
1904 bpobj_close(&subbpo);
1905 }
1906 }
1907 }
1908
1909 static void
dump_deadlist(dsl_deadlist_t * dl)1910 dump_deadlist(dsl_deadlist_t *dl)
1911 {
1912 dsl_deadlist_entry_t *dle;
1913 uint64_t unused;
1914 char bytes[32];
1915 char comp[32];
1916 char uncomp[32];
1917 uint64_t empty_bpobj =
1918 dmu_objset_spa(dl->dl_os)->spa_dsl_pool->dp_empty_bpobj;
1919
1920 /* force the tree to be loaded */
1921 dsl_deadlist_space_range(dl, 0, UINT64_MAX, &unused, &unused, &unused);
1922
1923 if (dl->dl_oldfmt) {
1924 if (dl->dl_bpobj.bpo_object != empty_bpobj)
1925 bpobj_count_refd(&dl->dl_bpobj);
1926 } else {
1927 mos_obj_refd(dl->dl_object);
1928 for (dle = avl_first(&dl->dl_tree); dle;
1929 dle = AVL_NEXT(&dl->dl_tree, dle)) {
1930 if (dle->dle_bpobj.bpo_object != empty_bpobj)
1931 bpobj_count_refd(&dle->dle_bpobj);
1932 }
1933 }
1934
1935 /* make sure nicenum has enough space */
1936 CTASSERT(sizeof (bytes) >= NN_NUMBUF_SZ);
1937 CTASSERT(sizeof (comp) >= NN_NUMBUF_SZ);
1938 CTASSERT(sizeof (uncomp) >= NN_NUMBUF_SZ);
1939
1940 if (dump_opt['d'] < 3)
1941 return;
1942
1943 if (dl->dl_oldfmt) {
1944 dump_full_bpobj(&dl->dl_bpobj, "old-format deadlist", 0);
1945 return;
1946 }
1947
1948 zdb_nicenum(dl->dl_phys->dl_used, bytes, sizeof (bytes));
1949 zdb_nicenum(dl->dl_phys->dl_comp, comp, sizeof (comp));
1950 zdb_nicenum(dl->dl_phys->dl_uncomp, uncomp, sizeof (uncomp));
1951 (void) printf("\n Deadlist: %s (%s/%s comp)\n",
1952 bytes, comp, uncomp);
1953
1954 if (dump_opt['d'] < 4)
1955 return;
1956
1957 (void) printf("\n");
1958
1959 for (dle = avl_first(&dl->dl_tree); dle;
1960 dle = AVL_NEXT(&dl->dl_tree, dle)) {
1961 if (dump_opt['d'] >= 5) {
1962 char buf[128];
1963 (void) snprintf(buf, sizeof (buf),
1964 "mintxg %llu -> obj %llu",
1965 (longlong_t)dle->dle_mintxg,
1966 (longlong_t)dle->dle_bpobj.bpo_object);
1967
1968 dump_full_bpobj(&dle->dle_bpobj, buf, 0);
1969 } else {
1970 (void) printf("mintxg %llu -> obj %llu\n",
1971 (longlong_t)dle->dle_mintxg,
1972 (longlong_t)dle->dle_bpobj.bpo_object);
1973 }
1974 }
1975 }
1976
1977 static avl_tree_t idx_tree;
1978 static avl_tree_t domain_tree;
1979 static boolean_t fuid_table_loaded;
1980 static objset_t *sa_os = NULL;
1981 static sa_attr_type_t *sa_attr_table = NULL;
1982
1983 static int
open_objset(const char * path,dmu_objset_type_t type,void * tag,objset_t ** osp)1984 open_objset(const char *path, dmu_objset_type_t type, void *tag, objset_t **osp)
1985 {
1986 int err;
1987 uint64_t sa_attrs = 0;
1988 uint64_t version = 0;
1989
1990 VERIFY3P(sa_os, ==, NULL);
1991 err = dmu_objset_own(path, type, B_TRUE, B_FALSE, tag, osp);
1992 if (err != 0) {
1993 (void) fprintf(stderr, "failed to own dataset '%s': %s\n", path,
1994 strerror(err));
1995 return (err);
1996 }
1997
1998 if (dmu_objset_type(*osp) == DMU_OST_ZFS && !(*osp)->os_encrypted) {
1999 (void) zap_lookup(*osp, MASTER_NODE_OBJ, ZPL_VERSION_STR,
2000 8, 1, &version);
2001 if (version >= ZPL_VERSION_SA) {
2002 (void) zap_lookup(*osp, MASTER_NODE_OBJ, ZFS_SA_ATTRS,
2003 8, 1, &sa_attrs);
2004 }
2005 err = sa_setup(*osp, sa_attrs, zfs_attr_table, ZPL_END,
2006 &sa_attr_table);
2007 if (err != 0) {
2008 (void) fprintf(stderr, "sa_setup failed: %s\n",
2009 strerror(err));
2010 dmu_objset_disown(*osp, B_FALSE, tag);
2011 *osp = NULL;
2012 }
2013 }
2014 sa_os = *osp;
2015
2016 return (0);
2017 }
2018
2019 static void
close_objset(objset_t * os,void * tag)2020 close_objset(objset_t *os, void *tag)
2021 {
2022 VERIFY3P(os, ==, sa_os);
2023 if (os->os_sa != NULL)
2024 sa_tear_down(os);
2025 dmu_objset_disown(os, B_FALSE, tag);
2026 sa_attr_table = NULL;
2027 sa_os = NULL;
2028 }
2029
2030 static void
fuid_table_destroy()2031 fuid_table_destroy()
2032 {
2033 if (fuid_table_loaded) {
2034 zfs_fuid_table_destroy(&idx_tree, &domain_tree);
2035 fuid_table_loaded = B_FALSE;
2036 }
2037 }
2038
2039 /*
2040 * print uid or gid information.
2041 * For normal POSIX id just the id is printed in decimal format.
2042 * For CIFS files with FUID the fuid is printed in hex followed by
2043 * the domain-rid string.
2044 */
2045 static void
print_idstr(uint64_t id,const char * id_type)2046 print_idstr(uint64_t id, const char *id_type)
2047 {
2048 if (FUID_INDEX(id)) {
2049 char *domain;
2050
2051 domain = zfs_fuid_idx_domain(&idx_tree, FUID_INDEX(id));
2052 (void) printf("\t%s %llx [%s-%d]\n", id_type,
2053 (u_longlong_t)id, domain, (int)FUID_RID(id));
2054 } else {
2055 (void) printf("\t%s %llu\n", id_type, (u_longlong_t)id);
2056 }
2057
2058 }
2059
2060 static void
dump_uidgid(objset_t * os,uint64_t uid,uint64_t gid)2061 dump_uidgid(objset_t *os, uint64_t uid, uint64_t gid)
2062 {
2063 uint32_t uid_idx, gid_idx;
2064
2065 uid_idx = FUID_INDEX(uid);
2066 gid_idx = FUID_INDEX(gid);
2067
2068 /* Load domain table, if not already loaded */
2069 if (!fuid_table_loaded && (uid_idx || gid_idx)) {
2070 uint64_t fuid_obj;
2071
2072 /* first find the fuid object. It lives in the master node */
2073 VERIFY(zap_lookup(os, MASTER_NODE_OBJ, ZFS_FUID_TABLES,
2074 8, 1, &fuid_obj) == 0);
2075 zfs_fuid_avl_tree_create(&idx_tree, &domain_tree);
2076 (void) zfs_fuid_table_load(os, fuid_obj,
2077 &idx_tree, &domain_tree);
2078 fuid_table_loaded = B_TRUE;
2079 }
2080
2081 print_idstr(uid, "uid");
2082 print_idstr(gid, "gid");
2083 }
2084
2085 /*ARGSUSED*/
2086 static void
dump_znode(objset_t * os,uint64_t object,void * data,size_t size)2087 dump_znode(objset_t *os, uint64_t object, void *data, size_t size)
2088 {
2089 char path[MAXPATHLEN * 2]; /* allow for xattr and failure prefix */
2090 sa_handle_t *hdl;
2091 uint64_t xattr, rdev, gen;
2092 uint64_t uid, gid, mode, fsize, parent, links;
2093 uint64_t pflags;
2094 uint64_t acctm[2], modtm[2], chgtm[2], crtm[2];
2095 time_t z_crtime, z_atime, z_mtime, z_ctime;
2096 sa_bulk_attr_t bulk[12];
2097 int idx = 0;
2098 int error;
2099
2100 VERIFY3P(os, ==, sa_os);
2101 if (sa_handle_get(os, object, NULL, SA_HDL_PRIVATE, &hdl)) {
2102 (void) printf("Failed to get handle for SA znode\n");
2103 return;
2104 }
2105
2106 SA_ADD_BULK_ATTR(bulk, idx, sa_attr_table[ZPL_UID], NULL, &uid, 8);
2107 SA_ADD_BULK_ATTR(bulk, idx, sa_attr_table[ZPL_GID], NULL, &gid, 8);
2108 SA_ADD_BULK_ATTR(bulk, idx, sa_attr_table[ZPL_LINKS], NULL,
2109 &links, 8);
2110 SA_ADD_BULK_ATTR(bulk, idx, sa_attr_table[ZPL_GEN], NULL, &gen, 8);
2111 SA_ADD_BULK_ATTR(bulk, idx, sa_attr_table[ZPL_MODE], NULL,
2112 &mode, 8);
2113 SA_ADD_BULK_ATTR(bulk, idx, sa_attr_table[ZPL_PARENT],
2114 NULL, &parent, 8);
2115 SA_ADD_BULK_ATTR(bulk, idx, sa_attr_table[ZPL_SIZE], NULL,
2116 &fsize, 8);
2117 SA_ADD_BULK_ATTR(bulk, idx, sa_attr_table[ZPL_ATIME], NULL,
2118 acctm, 16);
2119 SA_ADD_BULK_ATTR(bulk, idx, sa_attr_table[ZPL_MTIME], NULL,
2120 modtm, 16);
2121 SA_ADD_BULK_ATTR(bulk, idx, sa_attr_table[ZPL_CRTIME], NULL,
2122 crtm, 16);
2123 SA_ADD_BULK_ATTR(bulk, idx, sa_attr_table[ZPL_CTIME], NULL,
2124 chgtm, 16);
2125 SA_ADD_BULK_ATTR(bulk, idx, sa_attr_table[ZPL_FLAGS], NULL,
2126 &pflags, 8);
2127
2128 if (sa_bulk_lookup(hdl, bulk, idx)) {
2129 (void) sa_handle_destroy(hdl);
2130 return;
2131 }
2132
2133 z_crtime = (time_t)crtm[0];
2134 z_atime = (time_t)acctm[0];
2135 z_mtime = (time_t)modtm[0];
2136 z_ctime = (time_t)chgtm[0];
2137
2138 if (dump_opt['d'] > 4) {
2139 error = zfs_obj_to_path(os, object, path, sizeof (path));
2140 if (error == ESTALE) {
2141 (void) snprintf(path, sizeof (path), "on delete queue");
2142 } else if (error != 0) {
2143 leaked_objects++;
2144 (void) snprintf(path, sizeof (path),
2145 "path not found, possibly leaked");
2146 }
2147 (void) printf("\tpath %s\n", path);
2148 }
2149 dump_uidgid(os, uid, gid);
2150 (void) printf("\tatime %s", ctime(&z_atime));
2151 (void) printf("\tmtime %s", ctime(&z_mtime));
2152 (void) printf("\tctime %s", ctime(&z_ctime));
2153 (void) printf("\tcrtime %s", ctime(&z_crtime));
2154 (void) printf("\tgen %llu\n", (u_longlong_t)gen);
2155 (void) printf("\tmode %llo\n", (u_longlong_t)mode);
2156 (void) printf("\tsize %llu\n", (u_longlong_t)fsize);
2157 (void) printf("\tparent %llu\n", (u_longlong_t)parent);
2158 (void) printf("\tlinks %llu\n", (u_longlong_t)links);
2159 (void) printf("\tpflags %llx\n", (u_longlong_t)pflags);
2160 if (dmu_objset_projectquota_enabled(os) && (pflags & ZFS_PROJID)) {
2161 uint64_t projid;
2162
2163 if (sa_lookup(hdl, sa_attr_table[ZPL_PROJID], &projid,
2164 sizeof (uint64_t)) == 0)
2165 (void) printf("\tprojid %llu\n", (u_longlong_t)projid);
2166 }
2167 if (sa_lookup(hdl, sa_attr_table[ZPL_XATTR], &xattr,
2168 sizeof (uint64_t)) == 0)
2169 (void) printf("\txattr %llu\n", (u_longlong_t)xattr);
2170 if (sa_lookup(hdl, sa_attr_table[ZPL_RDEV], &rdev,
2171 sizeof (uint64_t)) == 0)
2172 (void) printf("\trdev 0x%016llx\n", (u_longlong_t)rdev);
2173 sa_handle_destroy(hdl);
2174 }
2175
2176 /*ARGSUSED*/
2177 static void
dump_acl(objset_t * os,uint64_t object,void * data,size_t size)2178 dump_acl(objset_t *os, uint64_t object, void *data, size_t size)
2179 {
2180 }
2181
2182 /*ARGSUSED*/
2183 static void
dump_dmu_objset(objset_t * os,uint64_t object,void * data,size_t size)2184 dump_dmu_objset(objset_t *os, uint64_t object, void *data, size_t size)
2185 {
2186 }
2187
2188
2189 static object_viewer_t *object_viewer[DMU_OT_NUMTYPES + 1] = {
2190 dump_none, /* unallocated */
2191 dump_zap, /* object directory */
2192 dump_uint64, /* object array */
2193 dump_none, /* packed nvlist */
2194 dump_packed_nvlist, /* packed nvlist size */
2195 dump_none, /* bpobj */
2196 dump_bpobj, /* bpobj header */
2197 dump_none, /* SPA space map header */
2198 dump_none, /* SPA space map */
2199 dump_none, /* ZIL intent log */
2200 dump_dnode, /* DMU dnode */
2201 dump_dmu_objset, /* DMU objset */
2202 dump_dsl_dir, /* DSL directory */
2203 dump_zap, /* DSL directory child map */
2204 dump_zap, /* DSL dataset snap map */
2205 dump_zap, /* DSL props */
2206 dump_dsl_dataset, /* DSL dataset */
2207 dump_znode, /* ZFS znode */
2208 dump_acl, /* ZFS V0 ACL */
2209 dump_uint8, /* ZFS plain file */
2210 dump_zpldir, /* ZFS directory */
2211 dump_zap, /* ZFS master node */
2212 dump_zap, /* ZFS delete queue */
2213 dump_uint8, /* zvol object */
2214 dump_zap, /* zvol prop */
2215 dump_uint8, /* other uint8[] */
2216 dump_uint64, /* other uint64[] */
2217 dump_zap, /* other ZAP */
2218 dump_zap, /* persistent error log */
2219 dump_uint8, /* SPA history */
2220 dump_history_offsets, /* SPA history offsets */
2221 dump_zap, /* Pool properties */
2222 dump_zap, /* DSL permissions */
2223 dump_acl, /* ZFS ACL */
2224 dump_uint8, /* ZFS SYSACL */
2225 dump_none, /* FUID nvlist */
2226 dump_packed_nvlist, /* FUID nvlist size */
2227 dump_zap, /* DSL dataset next clones */
2228 dump_zap, /* DSL scrub queue */
2229 dump_zap, /* ZFS user/group/project used */
2230 dump_zap, /* ZFS user/group/project quota */
2231 dump_zap, /* snapshot refcount tags */
2232 dump_ddt_zap, /* DDT ZAP object */
2233 dump_zap, /* DDT statistics */
2234 dump_znode, /* SA object */
2235 dump_zap, /* SA Master Node */
2236 dump_sa_attrs, /* SA attribute registration */
2237 dump_sa_layouts, /* SA attribute layouts */
2238 dump_zap, /* DSL scrub translations */
2239 dump_none, /* fake dedup BP */
2240 dump_zap, /* deadlist */
2241 dump_none, /* deadlist hdr */
2242 dump_zap, /* dsl clones */
2243 dump_bpobj_subobjs, /* bpobj subobjs */
2244 dump_unknown, /* Unknown type, must be last */
2245 };
2246
2247 static void
dump_object(objset_t * os,uint64_t object,int verbosity,int * print_header,uint64_t * dnode_slots_used)2248 dump_object(objset_t *os, uint64_t object, int verbosity, int *print_header,
2249 uint64_t *dnode_slots_used)
2250 {
2251 dmu_buf_t *db = NULL;
2252 dmu_object_info_t doi;
2253 dnode_t *dn;
2254 boolean_t dnode_held = B_FALSE;
2255 void *bonus = NULL;
2256 size_t bsize = 0;
2257 char iblk[32], dblk[32], lsize[32], asize[32], fill[32], dnsize[32];
2258 char bonus_size[32];
2259 char aux[50];
2260 int error;
2261
2262 /* make sure nicenum has enough space */
2263 CTASSERT(sizeof (iblk) >= NN_NUMBUF_SZ);
2264 CTASSERT(sizeof (dblk) >= NN_NUMBUF_SZ);
2265 CTASSERT(sizeof (lsize) >= NN_NUMBUF_SZ);
2266 CTASSERT(sizeof (asize) >= NN_NUMBUF_SZ);
2267 CTASSERT(sizeof (bonus_size) >= NN_NUMBUF_SZ);
2268
2269 if (*print_header) {
2270 (void) printf("\n%10s %3s %5s %5s %5s %6s %5s %6s %s\n",
2271 "Object", "lvl", "iblk", "dblk", "dsize", "dnsize",
2272 "lsize", "%full", "type");
2273 *print_header = 0;
2274 }
2275
2276 if (object == 0) {
2277 dn = DMU_META_DNODE(os);
2278 dmu_object_info_from_dnode(dn, &doi);
2279 } else {
2280 /*
2281 * Encrypted datasets will have sensitive bonus buffers
2282 * encrypted. Therefore we cannot hold the bonus buffer and
2283 * must hold the dnode itself instead.
2284 */
2285 error = dmu_object_info(os, object, &doi);
2286 if (error)
2287 fatal("dmu_object_info() failed, errno %u", error);
2288
2289 if (os->os_encrypted &&
2290 DMU_OT_IS_ENCRYPTED(doi.doi_bonus_type)) {
2291 error = dnode_hold(os, object, FTAG, &dn);
2292 if (error)
2293 fatal("dnode_hold() failed, errno %u", error);
2294 dnode_held = B_TRUE;
2295 } else {
2296 error = dmu_bonus_hold(os, object, FTAG, &db);
2297 if (error)
2298 fatal("dmu_bonus_hold(%llu) failed, errno %u",
2299 object, error);
2300 bonus = db->db_data;
2301 bsize = db->db_size;
2302 dn = DB_DNODE((dmu_buf_impl_t *)db);
2303 }
2304 }
2305
2306 if (dnode_slots_used != NULL)
2307 *dnode_slots_used = doi.doi_dnodesize / DNODE_MIN_SIZE;
2308
2309 zdb_nicenum(doi.doi_metadata_block_size, iblk, sizeof (iblk));
2310 zdb_nicenum(doi.doi_data_block_size, dblk, sizeof (dblk));
2311 zdb_nicenum(doi.doi_max_offset, lsize, sizeof (lsize));
2312 zdb_nicenum(doi.doi_physical_blocks_512 << 9, asize, sizeof (asize));
2313 zdb_nicenum(doi.doi_bonus_size, bonus_size, sizeof (bonus_size));
2314 zdb_nicenum(doi.doi_dnodesize, dnsize, sizeof (dnsize));
2315 (void) sprintf(fill, "%6.2f", 100.0 * doi.doi_fill_count *
2316 doi.doi_data_block_size / (object == 0 ? DNODES_PER_BLOCK : 1) /
2317 doi.doi_max_offset);
2318
2319 aux[0] = '\0';
2320
2321 if (doi.doi_checksum != ZIO_CHECKSUM_INHERIT || verbosity >= 6) {
2322 (void) snprintf(aux + strlen(aux), sizeof (aux), " (K=%s)",
2323 ZDB_CHECKSUM_NAME(doi.doi_checksum));
2324 }
2325
2326 if (doi.doi_compress != ZIO_COMPRESS_INHERIT || verbosity >= 6) {
2327 (void) snprintf(aux + strlen(aux), sizeof (aux), " (Z=%s)",
2328 ZDB_COMPRESS_NAME(doi.doi_compress));
2329 }
2330
2331 (void) printf("%10" PRIu64
2332 " %3u %5s %5s %5s %5s %5s %6s %s%s\n",
2333 object, doi.doi_indirection, iblk, dblk,
2334 asize, dnsize, lsize, fill, ZDB_OT_NAME(doi.doi_type), aux);
2335
2336 if (doi.doi_bonus_type != DMU_OT_NONE && verbosity > 3) {
2337 (void) printf("%10s %3s %5s %5s %5s %5s %5s %6s %s\n",
2338 "", "", "", "", "", "", bonus_size, "bonus",
2339 ZDB_OT_NAME(doi.doi_bonus_type));
2340 }
2341
2342 if (verbosity >= 4) {
2343 (void) printf("\tdnode flags: %s%s%s%s\n",
2344 (dn->dn_phys->dn_flags & DNODE_FLAG_USED_BYTES) ?
2345 "USED_BYTES " : "",
2346 (dn->dn_phys->dn_flags & DNODE_FLAG_USERUSED_ACCOUNTED) ?
2347 "USERUSED_ACCOUNTED " : "",
2348 (dn->dn_phys->dn_flags & DNODE_FLAG_USEROBJUSED_ACCOUNTED) ?
2349 "USEROBJUSED_ACCOUNTED " : "",
2350 (dn->dn_phys->dn_flags & DNODE_FLAG_SPILL_BLKPTR) ?
2351 "SPILL_BLKPTR" : "");
2352 (void) printf("\tdnode maxblkid: %llu\n",
2353 (longlong_t)dn->dn_phys->dn_maxblkid);
2354
2355 if (!dnode_held) {
2356 object_viewer[ZDB_OT_TYPE(doi.doi_bonus_type)](os,
2357 object, bonus, bsize);
2358 } else {
2359 (void) printf("\t\t(bonus encrypted)\n");
2360 }
2361
2362 if (!os->os_encrypted || !DMU_OT_IS_ENCRYPTED(doi.doi_type)) {
2363 object_viewer[ZDB_OT_TYPE(doi.doi_type)](os, object,
2364 NULL, 0);
2365 } else {
2366 (void) printf("\t\t(object encrypted)\n");
2367 }
2368
2369 *print_header = 1;
2370 }
2371
2372 if (verbosity >= 5)
2373 dump_indirect(dn);
2374
2375 if (verbosity >= 5) {
2376 /*
2377 * Report the list of segments that comprise the object.
2378 */
2379 uint64_t start = 0;
2380 uint64_t end;
2381 uint64_t blkfill = 1;
2382 int minlvl = 1;
2383
2384 if (dn->dn_type == DMU_OT_DNODE) {
2385 minlvl = 0;
2386 blkfill = DNODES_PER_BLOCK;
2387 }
2388
2389 for (;;) {
2390 char segsize[32];
2391 /* make sure nicenum has enough space */
2392 CTASSERT(sizeof (segsize) >= NN_NUMBUF_SZ);
2393 error = dnode_next_offset(dn,
2394 0, &start, minlvl, blkfill, 0);
2395 if (error)
2396 break;
2397 end = start;
2398 error = dnode_next_offset(dn,
2399 DNODE_FIND_HOLE, &end, minlvl, blkfill, 0);
2400 zdb_nicenum(end - start, segsize, sizeof (segsize));
2401 (void) printf("\t\tsegment [%016llx, %016llx)"
2402 " size %5s\n", (u_longlong_t)start,
2403 (u_longlong_t)end, segsize);
2404 if (error)
2405 break;
2406 start = end;
2407 }
2408 }
2409
2410 if (db != NULL)
2411 dmu_buf_rele(db, FTAG);
2412 if (dnode_held)
2413 dnode_rele(dn, FTAG);
2414 }
2415
2416 static void
count_dir_mos_objects(dsl_dir_t * dd)2417 count_dir_mos_objects(dsl_dir_t *dd)
2418 {
2419 mos_obj_refd(dd->dd_object);
2420 mos_obj_refd(dsl_dir_phys(dd)->dd_child_dir_zapobj);
2421 mos_obj_refd(dsl_dir_phys(dd)->dd_deleg_zapobj);
2422 mos_obj_refd(dsl_dir_phys(dd)->dd_props_zapobj);
2423 mos_obj_refd(dsl_dir_phys(dd)->dd_clones);
2424 }
2425
2426 static void
count_ds_mos_objects(dsl_dataset_t * ds)2427 count_ds_mos_objects(dsl_dataset_t *ds)
2428 {
2429 mos_obj_refd(ds->ds_object);
2430 mos_obj_refd(dsl_dataset_phys(ds)->ds_next_clones_obj);
2431 mos_obj_refd(dsl_dataset_phys(ds)->ds_props_obj);
2432 mos_obj_refd(dsl_dataset_phys(ds)->ds_userrefs_obj);
2433 mos_obj_refd(dsl_dataset_phys(ds)->ds_snapnames_zapobj);
2434
2435 if (!dsl_dataset_is_snapshot(ds)) {
2436 count_dir_mos_objects(ds->ds_dir);
2437 }
2438 }
2439
2440 static const char *objset_types[DMU_OST_NUMTYPES] = {
2441 "NONE", "META", "ZPL", "ZVOL", "OTHER", "ANY" };
2442
2443 static void
dump_dir(objset_t * os)2444 dump_dir(objset_t *os)
2445 {
2446 dmu_objset_stats_t dds;
2447 uint64_t object, object_count;
2448 uint64_t refdbytes, usedobjs, scratch;
2449 char numbuf[32];
2450 char blkbuf[BP_SPRINTF_LEN + 20];
2451 char osname[ZFS_MAX_DATASET_NAME_LEN];
2452 const char *type = "UNKNOWN";
2453 int verbosity = dump_opt['d'];
2454 int print_header = 1;
2455 unsigned i;
2456 int error;
2457 uint64_t total_slots_used = 0;
2458 uint64_t max_slot_used = 0;
2459 uint64_t dnode_slots;
2460
2461 /* make sure nicenum has enough space */
2462 CTASSERT(sizeof (numbuf) >= NN_NUMBUF_SZ);
2463
2464 dsl_pool_config_enter(dmu_objset_pool(os), FTAG);
2465 dmu_objset_fast_stat(os, &dds);
2466 dsl_pool_config_exit(dmu_objset_pool(os), FTAG);
2467
2468 if (dds.dds_type < DMU_OST_NUMTYPES)
2469 type = objset_types[dds.dds_type];
2470
2471 if (dds.dds_type == DMU_OST_META) {
2472 dds.dds_creation_txg = TXG_INITIAL;
2473 usedobjs = BP_GET_FILL(os->os_rootbp);
2474 refdbytes = dsl_dir_phys(os->os_spa->spa_dsl_pool->dp_mos_dir)->
2475 dd_used_bytes;
2476 } else {
2477 dmu_objset_space(os, &refdbytes, &scratch, &usedobjs, &scratch);
2478 }
2479
2480 ASSERT3U(usedobjs, ==, BP_GET_FILL(os->os_rootbp));
2481
2482 zdb_nicenum(refdbytes, numbuf, sizeof (numbuf));
2483
2484 if (verbosity >= 4) {
2485 (void) snprintf(blkbuf, sizeof (blkbuf), ", rootbp ");
2486 (void) snprintf_blkptr(blkbuf + strlen(blkbuf),
2487 sizeof (blkbuf) - strlen(blkbuf), os->os_rootbp);
2488 } else {
2489 blkbuf[0] = '\0';
2490 }
2491
2492 dmu_objset_name(os, osname);
2493
2494 (void) printf("Dataset %s [%s], ID %llu, cr_txg %llu, "
2495 "%s, %llu objects%s%s\n",
2496 osname, type, (u_longlong_t)dmu_objset_id(os),
2497 (u_longlong_t)dds.dds_creation_txg,
2498 numbuf, (u_longlong_t)usedobjs, blkbuf,
2499 (dds.dds_inconsistent) ? " (inconsistent)" : "");
2500
2501 if (zopt_objects != 0) {
2502 for (i = 0; i < zopt_objects; i++)
2503 dump_object(os, zopt_object[i], verbosity,
2504 &print_header, NULL);
2505 (void) printf("\n");
2506 return;
2507 }
2508
2509 if (dump_opt['i'] != 0 || verbosity >= 2)
2510 dump_intent_log(dmu_objset_zil(os));
2511
2512 if (dmu_objset_ds(os) != NULL) {
2513 dsl_dataset_t *ds = dmu_objset_ds(os);
2514 dump_deadlist(&ds->ds_deadlist);
2515
2516 if (dsl_dataset_remap_deadlist_exists(ds)) {
2517 (void) printf("ds_remap_deadlist:\n");
2518 dump_deadlist(&ds->ds_remap_deadlist);
2519 }
2520 count_ds_mos_objects(ds);
2521 }
2522
2523 if (verbosity < 2)
2524 return;
2525
2526 if (BP_IS_HOLE(os->os_rootbp))
2527 return;
2528
2529 dump_object(os, 0, verbosity, &print_header, NULL);
2530 object_count = 0;
2531 if (DMU_USERUSED_DNODE(os) != NULL &&
2532 DMU_USERUSED_DNODE(os)->dn_type != 0) {
2533 dump_object(os, DMU_USERUSED_OBJECT, verbosity, &print_header,
2534 NULL);
2535 dump_object(os, DMU_GROUPUSED_OBJECT, verbosity, &print_header,
2536 NULL);
2537 }
2538
2539 if (DMU_PROJECTUSED_DNODE(os) != NULL &&
2540 DMU_PROJECTUSED_DNODE(os)->dn_type != 0)
2541 dump_object(os, DMU_PROJECTUSED_OBJECT, verbosity,
2542 &print_header, NULL);
2543
2544 object = 0;
2545 while ((error = dmu_object_next(os, &object, B_FALSE, 0)) == 0) {
2546 dump_object(os, object, verbosity, &print_header, &dnode_slots);
2547 object_count++;
2548 total_slots_used += dnode_slots;
2549 max_slot_used = object + dnode_slots - 1;
2550 }
2551
2552 (void) printf("\n");
2553
2554 (void) printf(" Dnode slots:\n");
2555 (void) printf("\tTotal used: %10llu\n",
2556 (u_longlong_t)total_slots_used);
2557 (void) printf("\tMax used: %10llu\n",
2558 (u_longlong_t)max_slot_used);
2559 (void) printf("\tPercent empty: %10lf\n",
2560 (double)(max_slot_used - total_slots_used)*100 /
2561 (double)max_slot_used);
2562
2563 (void) printf("\n");
2564
2565 if (error != ESRCH) {
2566 (void) fprintf(stderr, "dmu_object_next() = %d\n", error);
2567 abort();
2568 }
2569 if (leaked_objects != 0) {
2570 (void) printf("%d potentially leaked objects detected\n",
2571 leaked_objects);
2572 leaked_objects = 0;
2573 }
2574
2575 ASSERT3U(object_count, ==, usedobjs);
2576 }
2577
2578 static void
dump_uberblock(uberblock_t * ub,const char * header,const char * footer)2579 dump_uberblock(uberblock_t *ub, const char *header, const char *footer)
2580 {
2581 time_t timestamp = ub->ub_timestamp;
2582
2583 (void) printf("%s", header ? header : "");
2584 (void) printf("\tmagic = %016llx\n", (u_longlong_t)ub->ub_magic);
2585 (void) printf("\tversion = %llu\n", (u_longlong_t)ub->ub_version);
2586 (void) printf("\ttxg = %llu\n", (u_longlong_t)ub->ub_txg);
2587 (void) printf("\tguid_sum = %llu\n", (u_longlong_t)ub->ub_guid_sum);
2588 (void) printf("\ttimestamp = %llu UTC = %s",
2589 (u_longlong_t)ub->ub_timestamp, asctime(localtime(×tamp)));
2590
2591 (void) printf("\tmmp_magic = %016llx\n",
2592 (u_longlong_t)ub->ub_mmp_magic);
2593 if (MMP_VALID(ub)) {
2594 (void) printf("\tmmp_delay = %0llu\n",
2595 (u_longlong_t)ub->ub_mmp_delay);
2596 if (MMP_SEQ_VALID(ub))
2597 (void) printf("\tmmp_seq = %u\n",
2598 (unsigned int) MMP_SEQ(ub));
2599 if (MMP_FAIL_INT_VALID(ub))
2600 (void) printf("\tmmp_fail = %u\n",
2601 (unsigned int) MMP_FAIL_INT(ub));
2602 if (MMP_INTERVAL_VALID(ub))
2603 (void) printf("\tmmp_write = %u\n",
2604 (unsigned int) MMP_INTERVAL(ub));
2605 /* After MMP_* to make summarize_uberblock_mmp cleaner */
2606 (void) printf("\tmmp_valid = %x\n",
2607 (unsigned int) ub->ub_mmp_config & 0xFF);
2608 }
2609
2610 if (dump_opt['u'] >= 4) {
2611 char blkbuf[BP_SPRINTF_LEN];
2612 snprintf_blkptr(blkbuf, sizeof (blkbuf), &ub->ub_rootbp);
2613 (void) printf("\trootbp = %s\n", blkbuf);
2614 }
2615 (void) printf("\tcheckpoint_txg = %llu\n",
2616 (u_longlong_t)ub->ub_checkpoint_txg);
2617 (void) printf("%s", footer ? footer : "");
2618 }
2619
2620 static void
dump_config(spa_t * spa)2621 dump_config(spa_t *spa)
2622 {
2623 dmu_buf_t *db;
2624 size_t nvsize = 0;
2625 int error = 0;
2626
2627
2628 error = dmu_bonus_hold(spa->spa_meta_objset,
2629 spa->spa_config_object, FTAG, &db);
2630
2631 if (error == 0) {
2632 nvsize = *(uint64_t *)db->db_data;
2633 dmu_buf_rele(db, FTAG);
2634
2635 (void) printf("\nMOS Configuration:\n");
2636 dump_packed_nvlist(spa->spa_meta_objset,
2637 spa->spa_config_object, (void *)&nvsize, 1);
2638 } else {
2639 (void) fprintf(stderr, "dmu_bonus_hold(%llu) failed, errno %d",
2640 (u_longlong_t)spa->spa_config_object, error);
2641 }
2642 }
2643
2644 static void
dump_cachefile(const char * cachefile)2645 dump_cachefile(const char *cachefile)
2646 {
2647 int fd;
2648 struct stat64 statbuf;
2649 char *buf;
2650 nvlist_t *config;
2651
2652 if ((fd = open64(cachefile, O_RDONLY)) < 0) {
2653 (void) printf("cannot open '%s': %s\n", cachefile,
2654 strerror(errno));
2655 exit(1);
2656 }
2657
2658 if (fstat64(fd, &statbuf) != 0) {
2659 (void) printf("failed to stat '%s': %s\n", cachefile,
2660 strerror(errno));
2661 exit(1);
2662 }
2663
2664 if ((buf = malloc(statbuf.st_size)) == NULL) {
2665 (void) fprintf(stderr, "failed to allocate %llu bytes\n",
2666 (u_longlong_t)statbuf.st_size);
2667 exit(1);
2668 }
2669
2670 if (read(fd, buf, statbuf.st_size) != statbuf.st_size) {
2671 (void) fprintf(stderr, "failed to read %llu bytes\n",
2672 (u_longlong_t)statbuf.st_size);
2673 exit(1);
2674 }
2675
2676 (void) close(fd);
2677
2678 if (nvlist_unpack(buf, statbuf.st_size, &config, 0) != 0) {
2679 (void) fprintf(stderr, "failed to unpack nvlist\n");
2680 exit(1);
2681 }
2682
2683 free(buf);
2684
2685 dump_nvlist(config, 0);
2686
2687 nvlist_free(config);
2688 }
2689
2690 static void
print_l2arc_header(void)2691 print_l2arc_header(void)
2692 {
2693 (void) printf("------------------------------------\n");
2694 (void) printf("L2ARC device header\n");
2695 (void) printf("------------------------------------\n");
2696 }
2697
2698 static void
print_l2arc_log_blocks(void)2699 print_l2arc_log_blocks(void)
2700 {
2701 (void) printf("------------------------------------\n");
2702 (void) printf("L2ARC device log blocks\n");
2703 (void) printf("------------------------------------\n");
2704 }
2705
2706 static void
dump_l2arc_log_entries(uint64_t log_entries,l2arc_log_ent_phys_t * le,uint64_t i)2707 dump_l2arc_log_entries(uint64_t log_entries,
2708 l2arc_log_ent_phys_t *le, uint64_t i)
2709 {
2710 for (uint64_t j = 0; j < log_entries; j++) {
2711 dva_t dva = le[j].le_dva;
2712 (void) printf("lb[%4llu]\tle[%4d]\tDVA asize: %llu, "
2713 "vdev: %llu, offset: %llu\n",
2714 (u_longlong_t)i, j + 1,
2715 (u_longlong_t)DVA_GET_ASIZE(&dva),
2716 (u_longlong_t)DVA_GET_VDEV(&dva),
2717 (u_longlong_t)DVA_GET_OFFSET(&dva));
2718 (void) printf("|\t\t\t\tbirth: %llu\n",
2719 (u_longlong_t)le[j].le_birth);
2720 (void) printf("|\t\t\t\tlsize: %llu\n",
2721 (u_longlong_t)L2BLK_GET_LSIZE((&le[j])->le_prop));
2722 (void) printf("|\t\t\t\tpsize: %llu\n",
2723 (u_longlong_t)L2BLK_GET_PSIZE((&le[j])->le_prop));
2724 (void) printf("|\t\t\t\tcompr: %llu\n",
2725 (u_longlong_t)L2BLK_GET_COMPRESS((&le[j])->le_prop));
2726 (void) printf("|\t\t\t\ttype: %llu\n",
2727 (u_longlong_t)L2BLK_GET_TYPE((&le[j])->le_prop));
2728 (void) printf("|\t\t\t\tprotected: %llu\n",
2729 (u_longlong_t)L2BLK_GET_PROTECTED((&le[j])->le_prop));
2730 (void) printf("|\t\t\t\tprefetch: %llu\n",
2731 (u_longlong_t)L2BLK_GET_PREFETCH((&le[j])->le_prop));
2732 (void) printf("|\t\t\t\taddress: %llu\n",
2733 (u_longlong_t)le[j].le_daddr);
2734 (void) printf("|\t\t\t\tARC state: %llu\n",
2735 (u_longlong_t)L2BLK_GET_STATE((&le[j])->le_prop));
2736 (void) printf("|\n");
2737 }
2738 (void) printf("\n");
2739 }
2740
2741 static void
dump_l2arc_log_blkptr(l2arc_log_blkptr_t lbps)2742 dump_l2arc_log_blkptr(l2arc_log_blkptr_t lbps)
2743 {
2744 (void) printf("|\t\tdaddr: %llu\n", (u_longlong_t)lbps.lbp_daddr);
2745 (void) printf("|\t\tpayload_asize: %llu\n",
2746 (u_longlong_t)lbps.lbp_payload_asize);
2747 (void) printf("|\t\tpayload_start: %llu\n",
2748 (u_longlong_t)lbps.lbp_payload_start);
2749 (void) printf("|\t\tlsize: %llu\n",
2750 (u_longlong_t)L2BLK_GET_LSIZE((&lbps)->lbp_prop));
2751 (void) printf("|\t\tasize: %llu\n",
2752 (u_longlong_t)L2BLK_GET_PSIZE((&lbps)->lbp_prop));
2753 (void) printf("|\t\tcompralgo: %llu\n",
2754 (u_longlong_t)L2BLK_GET_COMPRESS((&lbps)->lbp_prop));
2755 (void) printf("|\t\tcksumalgo: %llu\n",
2756 (u_longlong_t)L2BLK_GET_CHECKSUM((&lbps)->lbp_prop));
2757 (void) printf("|\n\n");
2758 }
2759
2760 static void
dump_l2arc_log_blocks(int fd,l2arc_dev_hdr_phys_t l2dhdr,l2arc_dev_hdr_phys_t * rebuild)2761 dump_l2arc_log_blocks(int fd, l2arc_dev_hdr_phys_t l2dhdr,
2762 l2arc_dev_hdr_phys_t *rebuild)
2763 {
2764 l2arc_log_blk_phys_t this_lb;
2765 uint64_t asize;
2766 l2arc_log_blkptr_t lbps[2];
2767 abd_t *abd;
2768 zio_cksum_t cksum;
2769 int failed = 0;
2770 l2arc_dev_t dev;
2771
2772 if (!dump_opt['q'])
2773 print_l2arc_log_blocks();
2774 bcopy((&l2dhdr)->dh_start_lbps, lbps, sizeof (lbps));
2775
2776 dev.l2ad_evict = l2dhdr.dh_evict;
2777 dev.l2ad_start = l2dhdr.dh_start;
2778 dev.l2ad_end = l2dhdr.dh_end;
2779
2780 if (l2dhdr.dh_start_lbps[0].lbp_daddr == 0) {
2781 /* no log blocks to read */
2782 if (!dump_opt['q']) {
2783 (void) printf("No log blocks to read\n");
2784 (void) printf("\n");
2785 }
2786 return;
2787 } else {
2788 dev.l2ad_hand = lbps[0].lbp_daddr +
2789 L2BLK_GET_PSIZE((&lbps[0])->lbp_prop);
2790 }
2791
2792 dev.l2ad_first = !!(l2dhdr.dh_flags & L2ARC_DEV_HDR_EVICT_FIRST);
2793
2794 for (;;) {
2795 if (!l2arc_log_blkptr_valid(&dev, &lbps[0]))
2796 break;
2797
2798 /* L2BLK_GET_PSIZE returns aligned size for log blocks */
2799 asize = L2BLK_GET_PSIZE((&lbps[0])->lbp_prop);
2800 if (pread64(fd, &this_lb, asize, lbps[0].lbp_daddr) !=
2801 (ssize_t)asize) {
2802 if (!dump_opt['q']) {
2803 (void) printf("Error while reading next log "
2804 "block\n\n");
2805 }
2806 break;
2807 }
2808
2809 fletcher_4_native(&this_lb, asize, NULL, &cksum);
2810 if (!ZIO_CHECKSUM_EQUAL(cksum, lbps[0].lbp_cksum)) {
2811 failed++;
2812 if (!dump_opt['q']) {
2813 (void) printf("Invalid cksum\n");
2814 dump_l2arc_log_blkptr(lbps[0]);
2815 }
2816 break;
2817 }
2818
2819 switch (L2BLK_GET_COMPRESS((&lbps[0])->lbp_prop)) {
2820 case ZIO_COMPRESS_OFF:
2821 break;
2822 case ZIO_COMPRESS_LZ4:
2823 abd = abd_alloc_for_io(asize, B_TRUE);
2824 abd_copy_from_buf_off(abd, &this_lb, 0, asize);
2825 zio_decompress_data(L2BLK_GET_COMPRESS(
2826 (&lbps[0])->lbp_prop), abd, &this_lb,
2827 asize, sizeof (this_lb));
2828 abd_free(abd);
2829 break;
2830 default:
2831 break;
2832 }
2833
2834 if (this_lb.lb_magic == BSWAP_64(L2ARC_LOG_BLK_MAGIC))
2835 byteswap_uint64_array(&this_lb, sizeof (this_lb));
2836 if (this_lb.lb_magic != L2ARC_LOG_BLK_MAGIC) {
2837 if (!dump_opt['q'])
2838 (void) printf("Invalid log block magic\n\n");
2839 break;
2840 }
2841
2842 rebuild->dh_lb_count++;
2843 rebuild->dh_lb_asize += asize;
2844 if (dump_opt['l'] > 1 && !dump_opt['q']) {
2845 (void) printf("lb[%4llu]\tmagic: %llu\n",
2846 (u_longlong_t)rebuild->dh_lb_count,
2847 (u_longlong_t)this_lb.lb_magic);
2848 dump_l2arc_log_blkptr(lbps[0]);
2849 }
2850
2851 if (dump_opt['l'] > 2 && !dump_opt['q'])
2852 dump_l2arc_log_entries(l2dhdr.dh_log_entries,
2853 this_lb.lb_entries,
2854 rebuild->dh_lb_count);
2855
2856 if (l2arc_range_check_overlap(lbps[1].lbp_payload_start,
2857 lbps[0].lbp_payload_start, dev.l2ad_evict) &&
2858 !dev.l2ad_first)
2859 break;
2860
2861 lbps[0] = lbps[1];
2862 lbps[1] = this_lb.lb_prev_lbp;
2863 }
2864
2865 if (!dump_opt['q']) {
2866 (void) printf("log_blk_count:\t %llu with valid cksum\n",
2867 (u_longlong_t)rebuild->dh_lb_count);
2868 (void) printf("\t\t %d with invalid cksum\n", failed);
2869 (void) printf("log_blk_asize:\t %llu\n\n",
2870 (u_longlong_t)rebuild->dh_lb_asize);
2871 }
2872 }
2873
2874 static int
dump_l2arc_header(int fd)2875 dump_l2arc_header(int fd)
2876 {
2877 l2arc_dev_hdr_phys_t l2dhdr, rebuild;
2878 int error = B_FALSE;
2879
2880 bzero(&l2dhdr, sizeof (l2dhdr));
2881 bzero(&rebuild, sizeof (rebuild));
2882
2883 if (pread64(fd, &l2dhdr, sizeof (l2dhdr),
2884 VDEV_LABEL_START_SIZE) != sizeof (l2dhdr)) {
2885 error = B_TRUE;
2886 } else {
2887 if (l2dhdr.dh_magic == BSWAP_64(L2ARC_DEV_HDR_MAGIC))
2888 byteswap_uint64_array(&l2dhdr, sizeof (l2dhdr));
2889
2890 if (l2dhdr.dh_magic != L2ARC_DEV_HDR_MAGIC)
2891 error = B_TRUE;
2892 }
2893
2894 if (error) {
2895 (void) printf("L2ARC device header not found\n\n");
2896 /* Do not return an error here for backward compatibility */
2897 return (0);
2898 } else if (!dump_opt['q']) {
2899 print_l2arc_header();
2900
2901 (void) printf(" magic: %llu\n",
2902 (u_longlong_t)l2dhdr.dh_magic);
2903 (void) printf(" version: %llu\n",
2904 (u_longlong_t)l2dhdr.dh_version);
2905 (void) printf(" pool_guid: %llu\n",
2906 (u_longlong_t)l2dhdr.dh_spa_guid);
2907 (void) printf(" flags: %llu\n",
2908 (u_longlong_t)l2dhdr.dh_flags);
2909 (void) printf(" start_lbps[0]: %llu\n",
2910 (u_longlong_t)
2911 l2dhdr.dh_start_lbps[0].lbp_daddr);
2912 (void) printf(" start_lbps[1]: %llu\n",
2913 (u_longlong_t)
2914 l2dhdr.dh_start_lbps[1].lbp_daddr);
2915 (void) printf(" log_blk_ent: %llu\n",
2916 (u_longlong_t)l2dhdr.dh_log_entries);
2917 (void) printf(" start: %llu\n",
2918 (u_longlong_t)l2dhdr.dh_start);
2919 (void) printf(" end: %llu\n",
2920 (u_longlong_t)l2dhdr.dh_end);
2921 (void) printf(" evict: %llu\n",
2922 (u_longlong_t)l2dhdr.dh_evict);
2923 (void) printf(" lb_asize_refcount: %llu\n",
2924 (u_longlong_t)l2dhdr.dh_lb_asize);
2925 (void) printf(" lb_count_refcount: %llu\n\n",
2926 (u_longlong_t)l2dhdr.dh_lb_count);
2927 }
2928
2929 dump_l2arc_log_blocks(fd, l2dhdr, &rebuild);
2930 /*
2931 * The total aligned size of log blocks and the number of log blocks
2932 * reported in the header of the device may be less than what zdb
2933 * reports by dump_l2arc_log_blocks() which emulates l2arc_rebuild().
2934 * This happens because dump_l2arc_log_blocks() lacks the memory
2935 * pressure valve that l2arc_rebuild() has. Thus, if we are on a system
2936 * with low memory, l2arc_rebuild will exit prematurely and dh_lb_asize
2937 * and dh_lb_count will be lower to begin with than what exists on the
2938 * device. This is normal and zdb should not exit with an error. The
2939 * opposite case should never happen though, the values reported in the
2940 * header should never be higher than what dump_l2arc_log_blocks() and
2941 * l2arc_rebuild() report. If this happens there is a leak in the
2942 * accounting of log blocks.
2943 */
2944 if (l2dhdr.dh_lb_asize > rebuild.dh_lb_asize ||
2945 l2dhdr.dh_lb_count > rebuild.dh_lb_count)
2946 return (1);
2947
2948 return (0);
2949 }
2950
2951 static char curpath[PATH_MAX];
2952
2953 /*
2954 * Iterate through the path components, recursively passing
2955 * current one's obj and remaining path until we find the obj
2956 * for the last one.
2957 */
2958 static int
dump_path_impl(objset_t * os,uint64_t obj,char * name)2959 dump_path_impl(objset_t *os, uint64_t obj, char *name)
2960 {
2961 int err;
2962 int header = 1;
2963 uint64_t child_obj;
2964 char *s;
2965 dmu_buf_t *db;
2966 dmu_object_info_t doi;
2967
2968 if ((s = strchr(name, '/')) != NULL)
2969 *s = '\0';
2970 err = zap_lookup(os, obj, name, 8, 1, &child_obj);
2971
2972 (void) strlcat(curpath, name, sizeof (curpath));
2973
2974 if (err != 0) {
2975 (void) fprintf(stderr, "failed to lookup %s: %s\n",
2976 curpath, strerror(err));
2977 return (err);
2978 }
2979
2980 child_obj = ZFS_DIRENT_OBJ(child_obj);
2981 err = sa_buf_hold(os, child_obj, FTAG, &db);
2982 if (err != 0) {
2983 (void) fprintf(stderr,
2984 "failed to get SA dbuf for obj %llu: %s\n",
2985 (u_longlong_t)child_obj, strerror(err));
2986 return (EINVAL);
2987 }
2988 dmu_object_info_from_db(db, &doi);
2989 sa_buf_rele(db, FTAG);
2990
2991 if (doi.doi_bonus_type != DMU_OT_SA &&
2992 doi.doi_bonus_type != DMU_OT_ZNODE) {
2993 (void) fprintf(stderr, "invalid bonus type %d for obj %llu\n",
2994 doi.doi_bonus_type, (u_longlong_t)child_obj);
2995 return (EINVAL);
2996 }
2997
2998 if (dump_opt['v'] > 6) {
2999 (void) printf("obj=%llu %s type=%d bonustype=%d\n",
3000 (u_longlong_t)child_obj, curpath, doi.doi_type,
3001 doi.doi_bonus_type);
3002 }
3003
3004 (void) strlcat(curpath, "/", sizeof (curpath));
3005
3006 switch (doi.doi_type) {
3007 case DMU_OT_DIRECTORY_CONTENTS:
3008 if (s != NULL && *(s + 1) != '\0')
3009 return (dump_path_impl(os, child_obj, s + 1));
3010 /*FALLTHROUGH*/
3011 case DMU_OT_PLAIN_FILE_CONTENTS:
3012 dump_object(os, child_obj, dump_opt['v'], &header, NULL);
3013 return (0);
3014 default:
3015 (void) fprintf(stderr, "object %llu has non-file/directory "
3016 "type %d\n", (u_longlong_t)obj, doi.doi_type);
3017 break;
3018 }
3019
3020 return (EINVAL);
3021 }
3022
3023 /*
3024 * Dump the blocks for the object specified by path inside the dataset.
3025 */
3026 static int
dump_path(char * ds,char * path)3027 dump_path(char *ds, char *path)
3028 {
3029 int err;
3030 objset_t *os;
3031 uint64_t root_obj;
3032
3033 err = open_objset(ds, DMU_OST_ZFS, FTAG, &os);
3034 if (err != 0)
3035 return (err);
3036
3037 err = zap_lookup(os, MASTER_NODE_OBJ, ZFS_ROOT_OBJ, 8, 1, &root_obj);
3038 if (err != 0) {
3039 (void) fprintf(stderr, "can't lookup root znode: %s\n",
3040 strerror(err));
3041 dmu_objset_disown(os, B_FALSE, FTAG);
3042 return (EINVAL);
3043 }
3044
3045 (void) snprintf(curpath, sizeof (curpath), "dataset=%s path=/", ds);
3046
3047 err = dump_path_impl(os, root_obj, path);
3048
3049 close_objset(os, FTAG);
3050 return (err);
3051 }
3052
3053 typedef struct cksum_record {
3054 zio_cksum_t cksum;
3055 boolean_t labels[VDEV_LABELS];
3056 avl_node_t link;
3057 } cksum_record_t;
3058
3059 static int
cksum_record_compare(const void * x1,const void * x2)3060 cksum_record_compare(const void *x1, const void *x2)
3061 {
3062 const cksum_record_t *l = (cksum_record_t *)x1;
3063 const cksum_record_t *r = (cksum_record_t *)x2;
3064 int arraysize = ARRAY_SIZE(l->cksum.zc_word);
3065 int difference;
3066
3067 for (int i = 0; i < arraysize; i++) {
3068 difference = AVL_CMP(l->cksum.zc_word[i], r->cksum.zc_word[i]);
3069 if (difference)
3070 break;
3071 }
3072
3073 return (difference);
3074 }
3075
3076 static cksum_record_t *
cksum_record_alloc(zio_cksum_t * cksum,int l)3077 cksum_record_alloc(zio_cksum_t *cksum, int l)
3078 {
3079 cksum_record_t *rec;
3080
3081 rec = umem_zalloc(sizeof (*rec), UMEM_NOFAIL);
3082 rec->cksum = *cksum;
3083 rec->labels[l] = B_TRUE;
3084
3085 return (rec);
3086 }
3087
3088 static cksum_record_t *
cksum_record_lookup(avl_tree_t * tree,zio_cksum_t * cksum)3089 cksum_record_lookup(avl_tree_t *tree, zio_cksum_t *cksum)
3090 {
3091 cksum_record_t lookup = { .cksum = *cksum };
3092 avl_index_t where;
3093
3094 return (avl_find(tree, &lookup, &where));
3095 }
3096
3097 static cksum_record_t *
cksum_record_insert(avl_tree_t * tree,zio_cksum_t * cksum,int l)3098 cksum_record_insert(avl_tree_t *tree, zio_cksum_t *cksum, int l)
3099 {
3100 cksum_record_t *rec;
3101
3102 rec = cksum_record_lookup(tree, cksum);
3103 if (rec) {
3104 rec->labels[l] = B_TRUE;
3105 } else {
3106 rec = cksum_record_alloc(cksum, l);
3107 avl_add(tree, rec);
3108 }
3109
3110 return (rec);
3111 }
3112
3113 static int
first_label(cksum_record_t * rec)3114 first_label(cksum_record_t *rec)
3115 {
3116 for (int i = 0; i < VDEV_LABELS; i++)
3117 if (rec->labels[i])
3118 return (i);
3119
3120 return (-1);
3121 }
3122
3123 static void
print_label_numbers(char * prefix,cksum_record_t * rec)3124 print_label_numbers(char *prefix, cksum_record_t *rec)
3125 {
3126 printf("%s", prefix);
3127 for (int i = 0; i < VDEV_LABELS; i++)
3128 if (rec->labels[i] == B_TRUE)
3129 printf("%d ", i);
3130 printf("\n");
3131 }
3132
3133 #define MAX_UBERBLOCK_COUNT (VDEV_UBERBLOCK_RING >> UBERBLOCK_SHIFT)
3134
3135 typedef struct zdb_label {
3136 vdev_label_t label;
3137 nvlist_t *config_nv;
3138 cksum_record_t *config;
3139 cksum_record_t *uberblocks[MAX_UBERBLOCK_COUNT];
3140 boolean_t header_printed;
3141 boolean_t read_failed;
3142 } zdb_label_t;
3143
3144 static void
print_label_header(zdb_label_t * label,int l)3145 print_label_header(zdb_label_t *label, int l)
3146 {
3147
3148 if (dump_opt['q'])
3149 return;
3150
3151 if (label->header_printed == B_TRUE)
3152 return;
3153
3154 (void) printf("------------------------------------\n");
3155 (void) printf("LABEL %d\n", l);
3156 (void) printf("------------------------------------\n");
3157
3158 label->header_printed = B_TRUE;
3159 }
3160
3161 static void
dump_config_from_label(zdb_label_t * label,size_t buflen,int l)3162 dump_config_from_label(zdb_label_t *label, size_t buflen, int l)
3163 {
3164 if (dump_opt['q'])
3165 return;
3166
3167 if ((dump_opt['l'] < 3) && (first_label(label->config) != l))
3168 return;
3169
3170 print_label_header(label, l);
3171 dump_nvlist(label->config_nv, 4);
3172 print_label_numbers(" labels = ", label->config);
3173 }
3174
3175 #define ZDB_MAX_UB_HEADER_SIZE 32
3176
3177 static void
dump_label_uberblocks(zdb_label_t * label,uint64_t ashift,int label_num)3178 dump_label_uberblocks(zdb_label_t *label, uint64_t ashift, int label_num)
3179 {
3180 vdev_t vd;
3181 char header[ZDB_MAX_UB_HEADER_SIZE];
3182
3183 vd.vdev_ashift = ashift;
3184 vd.vdev_top = &vd;
3185
3186 for (int i = 0; i < VDEV_UBERBLOCK_COUNT(&vd); i++) {
3187 uint64_t uoff = VDEV_UBERBLOCK_OFFSET(&vd, i);
3188 uberblock_t *ub = (void *)((char *)&label->label + uoff);
3189 cksum_record_t *rec = label->uberblocks[i];
3190
3191 if (rec == NULL) {
3192 if (dump_opt['u'] >= 2) {
3193 print_label_header(label, label_num);
3194 (void) printf(" Uberblock[%d] invalid\n", i);
3195 }
3196 continue;
3197 }
3198
3199 if ((dump_opt['u'] < 3) && (first_label(rec) != label_num))
3200 continue;
3201
3202 print_label_header(label, label_num);
3203 (void) snprintf(header, ZDB_MAX_UB_HEADER_SIZE,
3204 " Uberblock[%d]\n", i);
3205 dump_uberblock(ub, header, "");
3206 print_label_numbers(" labels = ", rec);
3207 }
3208 }
3209
3210 static int
dump_label(const char * dev)3211 dump_label(const char *dev)
3212 {
3213 char path[MAXPATHLEN];
3214 zdb_label_t labels[VDEV_LABELS];
3215 uint64_t psize, ashift, l2cache;
3216 struct stat64 statbuf;
3217 boolean_t config_found = B_FALSE;
3218 boolean_t error = B_FALSE;
3219 boolean_t read_l2arc_header = B_FALSE;
3220 avl_tree_t config_tree;
3221 avl_tree_t uberblock_tree;
3222 void *node, *cookie;
3223 int fd;
3224
3225 bzero(labels, sizeof (labels));
3226
3227 (void) strlcpy(path, dev, sizeof (path));
3228 if (dev[0] == '/') {
3229 if (strncmp(dev, ZFS_DISK_ROOTD,
3230 strlen(ZFS_DISK_ROOTD)) == 0) {
3231 (void) snprintf(path, sizeof (path), "%s%s",
3232 ZFS_RDISK_ROOTD, dev + strlen(ZFS_DISK_ROOTD));
3233 }
3234 } else if (stat64(path, &statbuf) != 0) {
3235 char *s;
3236
3237 (void) snprintf(path, sizeof (path), "%s%s", ZFS_RDISK_ROOTD,
3238 dev);
3239 if (((s = strrchr(dev, 's')) == NULL &&
3240 (s = strchr(dev, 'p')) == NULL) ||
3241 !isdigit(*(s + 1)))
3242 (void) strlcat(path, "s0", sizeof (path));
3243 }
3244
3245 if ((fd = open64(path, O_RDONLY)) < 0) {
3246 (void) fprintf(stderr, "cannot open '%s': %s\n", path,
3247 strerror(errno));
3248 exit(1);
3249 }
3250
3251 if (fstat64(fd, &statbuf) != 0) {
3252 (void) fprintf(stderr, "failed to stat '%s': %s\n", path,
3253 strerror(errno));
3254 (void) close(fd);
3255 exit(1);
3256 }
3257
3258 if (S_ISBLK(statbuf.st_mode)) {
3259 (void) fprintf(stderr,
3260 "cannot use '%s': character device required\n", path);
3261 (void) close(fd);
3262 exit(1);
3263 }
3264
3265 avl_create(&config_tree, cksum_record_compare,
3266 sizeof (cksum_record_t), offsetof(cksum_record_t, link));
3267 avl_create(&uberblock_tree, cksum_record_compare,
3268 sizeof (cksum_record_t), offsetof(cksum_record_t, link));
3269
3270 psize = statbuf.st_size;
3271 psize = P2ALIGN(psize, (uint64_t)sizeof (vdev_label_t));
3272 ashift = SPA_MINBLOCKSHIFT;
3273
3274 /*
3275 * 1. Read the label from disk
3276 * 2. Unpack the configuration and insert in config tree.
3277 * 3. Traverse all uberblocks and insert in uberblock tree.
3278 */
3279 for (int l = 0; l < VDEV_LABELS; l++) {
3280 zdb_label_t *label = &labels[l];
3281 char *buf = label->label.vl_vdev_phys.vp_nvlist;
3282 size_t buflen = sizeof (label->label.vl_vdev_phys.vp_nvlist);
3283 nvlist_t *config;
3284 cksum_record_t *rec;
3285 zio_cksum_t cksum;
3286 vdev_t vd;
3287
3288 if (pread64(fd, &label->label, sizeof (label->label),
3289 vdev_label_offset(psize, l, 0)) != sizeof (label->label)) {
3290 if (!dump_opt['q'])
3291 (void) printf("failed to read label %d\n", l);
3292 label->read_failed = B_TRUE;
3293 error = B_TRUE;
3294 continue;
3295 }
3296
3297 label->read_failed = B_FALSE;
3298
3299 if (nvlist_unpack(buf, buflen, &config, 0) == 0) {
3300 nvlist_t *vdev_tree = NULL;
3301 size_t size;
3302
3303 if ((nvlist_lookup_nvlist(config,
3304 ZPOOL_CONFIG_VDEV_TREE, &vdev_tree) != 0) ||
3305 (nvlist_lookup_uint64(vdev_tree,
3306 ZPOOL_CONFIG_ASHIFT, &ashift) != 0))
3307 ashift = SPA_MINBLOCKSHIFT;
3308
3309 /* If the device is a cache device clear the header. */
3310 if (!read_l2arc_header) {
3311 if (nvlist_lookup_uint64(config,
3312 ZPOOL_CONFIG_POOL_STATE, &l2cache) == 0 &&
3313 l2cache == POOL_STATE_L2CACHE) {
3314 read_l2arc_header = B_TRUE;
3315 }
3316 }
3317
3318 if (nvlist_size(config, &size, NV_ENCODE_XDR) != 0)
3319 size = buflen;
3320
3321 fletcher_4_native(buf, size, NULL, &cksum);
3322 rec = cksum_record_insert(&config_tree, &cksum, l);
3323
3324 label->config = rec;
3325 label->config_nv = config;
3326 config_found = B_TRUE;
3327 } else {
3328 error = B_TRUE;
3329 }
3330
3331 vd.vdev_ashift = ashift;
3332 vd.vdev_top = &vd;
3333
3334 for (int i = 0; i < VDEV_UBERBLOCK_COUNT(&vd); i++) {
3335 uint64_t uoff = VDEV_UBERBLOCK_OFFSET(&vd, i);
3336 uberblock_t *ub = (void *)((char *)label + uoff);
3337
3338 if (uberblock_verify(ub))
3339 continue;
3340
3341 fletcher_4_native(ub, sizeof (*ub), NULL, &cksum);
3342 rec = cksum_record_insert(&uberblock_tree, &cksum, l);
3343
3344 label->uberblocks[i] = rec;
3345 }
3346 }
3347
3348 /*
3349 * Dump the label and uberblocks.
3350 */
3351 for (int l = 0; l < VDEV_LABELS; l++) {
3352 zdb_label_t *label = &labels[l];
3353 size_t buflen = sizeof (label->label.vl_vdev_phys.vp_nvlist);
3354
3355 if (label->read_failed == B_TRUE)
3356 continue;
3357
3358 if (label->config_nv) {
3359 dump_config_from_label(label, buflen, l);
3360 } else {
3361 if (!dump_opt['q'])
3362 (void) printf("failed to unpack label %d\n", l);
3363 }
3364
3365 if (dump_opt['u'])
3366 dump_label_uberblocks(label, ashift, l);
3367
3368 nvlist_free(label->config_nv);
3369 }
3370
3371 /*
3372 * Dump the L2ARC header, if existent.
3373 */
3374 if (read_l2arc_header)
3375 error |= dump_l2arc_header(fd);
3376
3377 cookie = NULL;
3378 while ((node = avl_destroy_nodes(&config_tree, &cookie)) != NULL)
3379 umem_free(node, sizeof (cksum_record_t));
3380
3381 cookie = NULL;
3382 while ((node = avl_destroy_nodes(&uberblock_tree, &cookie)) != NULL)
3383 umem_free(node, sizeof (cksum_record_t));
3384
3385 avl_destroy(&config_tree);
3386 avl_destroy(&uberblock_tree);
3387
3388 (void) close(fd);
3389
3390 return (config_found == B_FALSE ? 2 :
3391 (error == B_TRUE ? 1 : 0));
3392 }
3393
3394 static uint64_t dataset_feature_count[SPA_FEATURES];
3395 static uint64_t remap_deadlist_count = 0;
3396
3397 static int
dump_one_dir(const char * dsname,void * arg __unused)3398 dump_one_dir(const char *dsname, void *arg __unused)
3399 {
3400 int error;
3401 objset_t *os;
3402
3403 error = open_objset(dsname, DMU_OST_ANY, FTAG, &os);
3404 if (error != 0)
3405 return (0);
3406
3407 for (spa_feature_t f = 0; f < SPA_FEATURES; f++) {
3408 if (!dsl_dataset_feature_is_active(dmu_objset_ds(os), f))
3409 continue;
3410 ASSERT(spa_feature_table[f].fi_flags &
3411 ZFEATURE_FLAG_PER_DATASET);
3412 dataset_feature_count[f]++;
3413 }
3414
3415 if (dsl_dataset_remap_deadlist_exists(dmu_objset_ds(os))) {
3416 remap_deadlist_count++;
3417 }
3418
3419 dump_dir(os);
3420 close_objset(os, FTAG);
3421 fuid_table_destroy();
3422 return (0);
3423 }
3424
3425 /*
3426 * Block statistics.
3427 */
3428 #define PSIZE_HISTO_SIZE (SPA_OLD_MAXBLOCKSIZE / SPA_MINBLOCKSIZE + 2)
3429 typedef struct zdb_blkstats {
3430 uint64_t zb_asize;
3431 uint64_t zb_lsize;
3432 uint64_t zb_psize;
3433 uint64_t zb_count;
3434 uint64_t zb_gangs;
3435 uint64_t zb_ditto_samevdev;
3436 uint64_t zb_ditto_same_ms;
3437 uint64_t zb_psize_histogram[PSIZE_HISTO_SIZE];
3438 } zdb_blkstats_t;
3439
3440 /*
3441 * Extended object types to report deferred frees and dedup auto-ditto blocks.
3442 */
3443 #define ZDB_OT_DEFERRED (DMU_OT_NUMTYPES + 0)
3444 #define ZDB_OT_DITTO (DMU_OT_NUMTYPES + 1)
3445 #define ZDB_OT_OTHER (DMU_OT_NUMTYPES + 2)
3446 #define ZDB_OT_TOTAL (DMU_OT_NUMTYPES + 3)
3447
3448 static const char *zdb_ot_extname[] = {
3449 "deferred free",
3450 "dedup ditto",
3451 "other",
3452 "Total",
3453 };
3454
3455 #define ZB_TOTAL DN_MAX_LEVELS
3456
3457 typedef struct zdb_cb {
3458 zdb_blkstats_t zcb_type[ZB_TOTAL + 1][ZDB_OT_TOTAL + 1];
3459 uint64_t zcb_removing_size;
3460 uint64_t zcb_checkpoint_size;
3461 uint64_t zcb_dedup_asize;
3462 uint64_t zcb_dedup_blocks;
3463 uint64_t zcb_embedded_blocks[NUM_BP_EMBEDDED_TYPES];
3464 uint64_t zcb_embedded_histogram[NUM_BP_EMBEDDED_TYPES]
3465 [BPE_PAYLOAD_SIZE];
3466 uint64_t zcb_start;
3467 hrtime_t zcb_lastprint;
3468 uint64_t zcb_totalasize;
3469 uint64_t zcb_errors[256];
3470 int zcb_readfails;
3471 int zcb_haderrors;
3472 spa_t *zcb_spa;
3473 uint32_t **zcb_vd_obsolete_counts;
3474 } zdb_cb_t;
3475
3476 /* test if two DVA offsets from same vdev are within the same metaslab */
3477 static boolean_t
same_metaslab(spa_t * spa,uint64_t vdev,uint64_t off1,uint64_t off2)3478 same_metaslab(spa_t *spa, uint64_t vdev, uint64_t off1, uint64_t off2)
3479 {
3480 vdev_t *vd = vdev_lookup_top(spa, vdev);
3481 uint64_t ms_shift = vd->vdev_ms_shift;
3482
3483 return ((off1 >> ms_shift) == (off2 >> ms_shift));
3484 }
3485
3486 static void
zdb_count_block(zdb_cb_t * zcb,zilog_t * zilog,const blkptr_t * bp,dmu_object_type_t type)3487 zdb_count_block(zdb_cb_t *zcb, zilog_t *zilog, const blkptr_t *bp,
3488 dmu_object_type_t type)
3489 {
3490 uint64_t refcnt = 0;
3491
3492 ASSERT(type < ZDB_OT_TOTAL);
3493
3494 if (zilog && zil_bp_tree_add(zilog, bp) != 0)
3495 return;
3496
3497 spa_config_enter(zcb->zcb_spa, SCL_CONFIG, FTAG, RW_READER);
3498
3499 for (int i = 0; i < 4; i++) {
3500 int l = (i < 2) ? BP_GET_LEVEL(bp) : ZB_TOTAL;
3501 int t = (i & 1) ? type : ZDB_OT_TOTAL;
3502 int equal;
3503 zdb_blkstats_t *zb = &zcb->zcb_type[l][t];
3504
3505 zb->zb_asize += BP_GET_ASIZE(bp);
3506 zb->zb_lsize += BP_GET_LSIZE(bp);
3507 zb->zb_psize += BP_GET_PSIZE(bp);
3508 zb->zb_count++;
3509
3510 /*
3511 * The histogram is only big enough to record blocks up to
3512 * SPA_OLD_MAXBLOCKSIZE; larger blocks go into the last,
3513 * "other", bucket.
3514 */
3515 unsigned idx = BP_GET_PSIZE(bp) >> SPA_MINBLOCKSHIFT;
3516 idx = MIN(idx, SPA_OLD_MAXBLOCKSIZE / SPA_MINBLOCKSIZE + 1);
3517 zb->zb_psize_histogram[idx]++;
3518
3519 zb->zb_gangs += BP_COUNT_GANG(bp);
3520
3521 switch (BP_GET_NDVAS(bp)) {
3522 case 2:
3523 if (DVA_GET_VDEV(&bp->blk_dva[0]) ==
3524 DVA_GET_VDEV(&bp->blk_dva[1])) {
3525 zb->zb_ditto_samevdev++;
3526
3527 if (same_metaslab(zcb->zcb_spa,
3528 DVA_GET_VDEV(&bp->blk_dva[0]),
3529 DVA_GET_OFFSET(&bp->blk_dva[0]),
3530 DVA_GET_OFFSET(&bp->blk_dva[1])))
3531 zb->zb_ditto_same_ms++;
3532 }
3533 break;
3534 case 3:
3535 equal = (DVA_GET_VDEV(&bp->blk_dva[0]) ==
3536 DVA_GET_VDEV(&bp->blk_dva[1])) +
3537 (DVA_GET_VDEV(&bp->blk_dva[0]) ==
3538 DVA_GET_VDEV(&bp->blk_dva[2])) +
3539 (DVA_GET_VDEV(&bp->blk_dva[1]) ==
3540 DVA_GET_VDEV(&bp->blk_dva[2]));
3541 if (equal != 0) {
3542 zb->zb_ditto_samevdev++;
3543
3544 if (DVA_GET_VDEV(&bp->blk_dva[0]) ==
3545 DVA_GET_VDEV(&bp->blk_dva[1]) &&
3546 same_metaslab(zcb->zcb_spa,
3547 DVA_GET_VDEV(&bp->blk_dva[0]),
3548 DVA_GET_OFFSET(&bp->blk_dva[0]),
3549 DVA_GET_OFFSET(&bp->blk_dva[1])))
3550 zb->zb_ditto_same_ms++;
3551 else if (DVA_GET_VDEV(&bp->blk_dva[0]) ==
3552 DVA_GET_VDEV(&bp->blk_dva[2]) &&
3553 same_metaslab(zcb->zcb_spa,
3554 DVA_GET_VDEV(&bp->blk_dva[0]),
3555 DVA_GET_OFFSET(&bp->blk_dva[0]),
3556 DVA_GET_OFFSET(&bp->blk_dva[2])))
3557 zb->zb_ditto_same_ms++;
3558 else if (DVA_GET_VDEV(&bp->blk_dva[1]) ==
3559 DVA_GET_VDEV(&bp->blk_dva[2]) &&
3560 same_metaslab(zcb->zcb_spa,
3561 DVA_GET_VDEV(&bp->blk_dva[1]),
3562 DVA_GET_OFFSET(&bp->blk_dva[1]),
3563 DVA_GET_OFFSET(&bp->blk_dva[2])))
3564 zb->zb_ditto_same_ms++;
3565 }
3566 break;
3567 }
3568 }
3569
3570 spa_config_exit(zcb->zcb_spa, SCL_CONFIG, FTAG);
3571
3572 if (BP_IS_EMBEDDED(bp)) {
3573 zcb->zcb_embedded_blocks[BPE_GET_ETYPE(bp)]++;
3574 zcb->zcb_embedded_histogram[BPE_GET_ETYPE(bp)]
3575 [BPE_GET_PSIZE(bp)]++;
3576 return;
3577 }
3578
3579 if (dump_opt['L'])
3580 return;
3581
3582 if (BP_GET_DEDUP(bp)) {
3583 ddt_t *ddt;
3584 ddt_entry_t *dde;
3585
3586 ddt = ddt_select(zcb->zcb_spa, bp);
3587 ddt_enter(ddt);
3588 dde = ddt_lookup(ddt, bp, B_FALSE);
3589
3590 if (dde == NULL) {
3591 refcnt = 0;
3592 } else {
3593 ddt_phys_t *ddp = ddt_phys_select(dde, bp);
3594 ddt_phys_decref(ddp);
3595 refcnt = ddp->ddp_refcnt;
3596 if (ddt_phys_total_refcnt(dde) == 0)
3597 ddt_remove(ddt, dde);
3598 }
3599 ddt_exit(ddt);
3600 }
3601
3602 VERIFY3U(zio_wait(zio_claim(NULL, zcb->zcb_spa,
3603 refcnt ? 0 : spa_min_claim_txg(zcb->zcb_spa),
3604 bp, NULL, NULL, ZIO_FLAG_CANFAIL)), ==, 0);
3605 }
3606
3607 static void
zdb_blkptr_done(zio_t * zio)3608 zdb_blkptr_done(zio_t *zio)
3609 {
3610 spa_t *spa = zio->io_spa;
3611 blkptr_t *bp = zio->io_bp;
3612 int ioerr = zio->io_error;
3613 zdb_cb_t *zcb = zio->io_private;
3614 zbookmark_phys_t *zb = &zio->io_bookmark;
3615
3616 abd_free(zio->io_abd);
3617
3618 mutex_enter(&spa->spa_scrub_lock);
3619 spa->spa_load_verify_ios--;
3620 cv_broadcast(&spa->spa_scrub_io_cv);
3621
3622 if (ioerr && !(zio->io_flags & ZIO_FLAG_SPECULATIVE)) {
3623 char blkbuf[BP_SPRINTF_LEN];
3624
3625 zcb->zcb_haderrors = 1;
3626 zcb->zcb_errors[ioerr]++;
3627
3628 if (dump_opt['b'] >= 2)
3629 snprintf_blkptr(blkbuf, sizeof (blkbuf), bp);
3630 else
3631 blkbuf[0] = '\0';
3632
3633 (void) printf("zdb_blkptr_cb: "
3634 "Got error %d reading "
3635 "<%llu, %llu, %lld, %llx> %s -- skipping\n",
3636 ioerr,
3637 (u_longlong_t)zb->zb_objset,
3638 (u_longlong_t)zb->zb_object,
3639 (u_longlong_t)zb->zb_level,
3640 (u_longlong_t)zb->zb_blkid,
3641 blkbuf);
3642 }
3643 mutex_exit(&spa->spa_scrub_lock);
3644 }
3645
3646 static int
zdb_blkptr_cb(spa_t * spa,zilog_t * zilog,const blkptr_t * bp,const zbookmark_phys_t * zb,const dnode_phys_t * dnp,void * arg)3647 zdb_blkptr_cb(spa_t *spa, zilog_t *zilog, const blkptr_t *bp,
3648 const zbookmark_phys_t *zb, const dnode_phys_t *dnp, void *arg)
3649 {
3650 zdb_cb_t *zcb = arg;
3651 dmu_object_type_t type;
3652 boolean_t is_metadata;
3653
3654 if (bp == NULL)
3655 return (0);
3656
3657 if (dump_opt['b'] >= 5 && bp->blk_birth > 0) {
3658 char blkbuf[BP_SPRINTF_LEN];
3659 snprintf_blkptr(blkbuf, sizeof (blkbuf), bp);
3660 (void) printf("objset %llu object %llu "
3661 "level %lld offset 0x%llx %s\n",
3662 (u_longlong_t)zb->zb_objset,
3663 (u_longlong_t)zb->zb_object,
3664 (longlong_t)zb->zb_level,
3665 (u_longlong_t)blkid2offset(dnp, bp, zb),
3666 blkbuf);
3667 }
3668
3669 if (BP_IS_HOLE(bp))
3670 return (0);
3671
3672 type = BP_GET_TYPE(bp);
3673
3674 zdb_count_block(zcb, zilog, bp,
3675 (type & DMU_OT_NEWTYPE) ? ZDB_OT_OTHER : type);
3676
3677 is_metadata = (BP_GET_LEVEL(bp) != 0 || DMU_OT_IS_METADATA(type));
3678
3679 if (!BP_IS_EMBEDDED(bp) &&
3680 (dump_opt['c'] > 1 || (dump_opt['c'] && is_metadata))) {
3681 size_t size = BP_GET_PSIZE(bp);
3682 abd_t *abd = abd_alloc(size, B_FALSE);
3683 int flags = ZIO_FLAG_CANFAIL | ZIO_FLAG_SCRUB | ZIO_FLAG_RAW;
3684
3685 /* If it's an intent log block, failure is expected. */
3686 if (zb->zb_level == ZB_ZIL_LEVEL)
3687 flags |= ZIO_FLAG_SPECULATIVE;
3688
3689 mutex_enter(&spa->spa_scrub_lock);
3690 while (spa->spa_load_verify_ios > max_inflight)
3691 cv_wait(&spa->spa_scrub_io_cv, &spa->spa_scrub_lock);
3692 spa->spa_load_verify_ios++;
3693 mutex_exit(&spa->spa_scrub_lock);
3694
3695 zio_nowait(zio_read(NULL, spa, bp, abd, size,
3696 zdb_blkptr_done, zcb, ZIO_PRIORITY_ASYNC_READ, flags, zb));
3697 }
3698
3699 zcb->zcb_readfails = 0;
3700
3701 /* only call gethrtime() every 100 blocks */
3702 static int iters;
3703 if (++iters > 100)
3704 iters = 0;
3705 else
3706 return (0);
3707
3708 if (dump_opt['b'] < 5 && gethrtime() > zcb->zcb_lastprint + NANOSEC) {
3709 uint64_t now = gethrtime();
3710 char buf[10];
3711 uint64_t bytes = zcb->zcb_type[ZB_TOTAL][ZDB_OT_TOTAL].zb_asize;
3712 int kb_per_sec =
3713 1 + bytes / (1 + ((now - zcb->zcb_start) / 1000 / 1000));
3714 int sec_remaining =
3715 (zcb->zcb_totalasize - bytes) / 1024 / kb_per_sec;
3716
3717 /* make sure nicenum has enough space */
3718 CTASSERT(sizeof (buf) >= NN_NUMBUF_SZ);
3719
3720 zfs_nicebytes(bytes, buf, sizeof (buf));
3721 (void) fprintf(stderr,
3722 "\r%5s completed (%4dMB/s) "
3723 "estimated time remaining: %uhr %02umin %02usec ",
3724 buf, kb_per_sec / 1024,
3725 sec_remaining / 60 / 60,
3726 sec_remaining / 60 % 60,
3727 sec_remaining % 60);
3728
3729 zcb->zcb_lastprint = now;
3730 }
3731
3732 return (0);
3733 }
3734
3735 static void
zdb_leak(void * arg,uint64_t start,uint64_t size)3736 zdb_leak(void *arg, uint64_t start, uint64_t size)
3737 {
3738 vdev_t *vd = arg;
3739
3740 (void) printf("leaked space: vdev %llu, offset 0x%llx, size %llu\n",
3741 (u_longlong_t)vd->vdev_id, (u_longlong_t)start, (u_longlong_t)size);
3742 }
3743
3744 static metaslab_ops_t zdb_metaslab_ops = {
3745 NULL /* alloc */
3746 };
3747
3748 typedef int (*zdb_log_sm_cb_t)(spa_t *spa, space_map_entry_t *sme,
3749 uint64_t txg, void *arg);
3750
3751 typedef struct unflushed_iter_cb_arg {
3752 spa_t *uic_spa;
3753 uint64_t uic_txg;
3754 void *uic_arg;
3755 zdb_log_sm_cb_t uic_cb;
3756 } unflushed_iter_cb_arg_t;
3757
3758 static int
iterate_through_spacemap_logs_cb(space_map_entry_t * sme,void * arg)3759 iterate_through_spacemap_logs_cb(space_map_entry_t *sme, void *arg)
3760 {
3761 unflushed_iter_cb_arg_t *uic = arg;
3762
3763 return (uic->uic_cb(uic->uic_spa, sme, uic->uic_txg, uic->uic_arg));
3764 }
3765
3766 static void
iterate_through_spacemap_logs(spa_t * spa,zdb_log_sm_cb_t cb,void * arg)3767 iterate_through_spacemap_logs(spa_t *spa, zdb_log_sm_cb_t cb, void *arg)
3768 {
3769 if (!spa_feature_is_active(spa, SPA_FEATURE_LOG_SPACEMAP))
3770 return;
3771
3772 spa_config_enter(spa, SCL_CONFIG, FTAG, RW_READER);
3773 for (spa_log_sm_t *sls = avl_first(&spa->spa_sm_logs_by_txg);
3774 sls; sls = AVL_NEXT(&spa->spa_sm_logs_by_txg, sls)) {
3775 space_map_t *sm = NULL;
3776 VERIFY0(space_map_open(&sm, spa_meta_objset(spa),
3777 sls->sls_sm_obj, 0, UINT64_MAX, SPA_MINBLOCKSHIFT));
3778
3779 unflushed_iter_cb_arg_t uic = {
3780 .uic_spa = spa,
3781 .uic_txg = sls->sls_txg,
3782 .uic_arg = arg,
3783 .uic_cb = cb
3784 };
3785
3786 VERIFY0(space_map_iterate(sm, space_map_length(sm),
3787 iterate_through_spacemap_logs_cb, &uic));
3788 space_map_close(sm);
3789 }
3790 spa_config_exit(spa, SCL_CONFIG, FTAG);
3791 }
3792
3793 /* ARGSUSED */
3794 static int
load_unflushed_svr_segs_cb(spa_t * spa,space_map_entry_t * sme,uint64_t txg,void * arg)3795 load_unflushed_svr_segs_cb(spa_t *spa, space_map_entry_t *sme,
3796 uint64_t txg, void *arg)
3797 {
3798 spa_vdev_removal_t *svr = arg;
3799
3800 uint64_t offset = sme->sme_offset;
3801 uint64_t size = sme->sme_run;
3802
3803 /* skip vdevs we don't care about */
3804 if (sme->sme_vdev != svr->svr_vdev_id)
3805 return (0);
3806
3807 vdev_t *vd = vdev_lookup_top(spa, sme->sme_vdev);
3808 metaslab_t *ms = vd->vdev_ms[offset >> vd->vdev_ms_shift];
3809 ASSERT(sme->sme_type == SM_ALLOC || sme->sme_type == SM_FREE);
3810
3811 if (txg < metaslab_unflushed_txg(ms))
3812 return (0);
3813
3814 vdev_indirect_mapping_t *vim = vd->vdev_indirect_mapping;
3815 ASSERT(vim != NULL);
3816 if (offset >= vdev_indirect_mapping_max_offset(vim))
3817 return (0);
3818
3819 if (sme->sme_type == SM_ALLOC)
3820 range_tree_add(svr->svr_allocd_segs, offset, size);
3821 else
3822 range_tree_remove(svr->svr_allocd_segs, offset, size);
3823
3824 return (0);
3825 }
3826
3827 static void
zdb_ddt_leak_init(spa_t * spa,zdb_cb_t * zcb)3828 zdb_ddt_leak_init(spa_t *spa, zdb_cb_t *zcb)
3829 {
3830 ddt_bookmark_t ddb;
3831 ddt_entry_t dde;
3832 int error;
3833
3834 ASSERT(!dump_opt['L']);
3835
3836 bzero(&ddb, sizeof (ddb));
3837 while ((error = ddt_walk(spa, &ddb, &dde)) == 0) {
3838 blkptr_t blk;
3839 ddt_phys_t *ddp = dde.dde_phys;
3840
3841 if (ddb.ddb_class == DDT_CLASS_UNIQUE)
3842 return;
3843
3844 ASSERT(ddt_phys_total_refcnt(&dde) > 1);
3845
3846 for (int p = 0; p < DDT_PHYS_TYPES; p++, ddp++) {
3847 if (ddp->ddp_phys_birth == 0)
3848 continue;
3849 ddt_bp_create(ddb.ddb_checksum,
3850 &dde.dde_key, ddp, &blk);
3851 if (p == DDT_PHYS_DITTO) {
3852 zdb_count_block(zcb, NULL, &blk, ZDB_OT_DITTO);
3853 } else {
3854 zcb->zcb_dedup_asize +=
3855 BP_GET_ASIZE(&blk) * (ddp->ddp_refcnt - 1);
3856 zcb->zcb_dedup_blocks++;
3857 }
3858 }
3859 ddt_t *ddt = spa->spa_ddt[ddb.ddb_checksum];
3860 ddt_enter(ddt);
3861 VERIFY(ddt_lookup(ddt, &blk, B_TRUE) != NULL);
3862 ddt_exit(ddt);
3863 }
3864
3865 ASSERT(error == ENOENT);
3866 }
3867
3868 /* ARGSUSED */
3869 static void
claim_segment_impl_cb(uint64_t inner_offset,vdev_t * vd,uint64_t offset,uint64_t size,void * arg)3870 claim_segment_impl_cb(uint64_t inner_offset, vdev_t *vd, uint64_t offset,
3871 uint64_t size, void *arg)
3872 {
3873 /*
3874 * This callback was called through a remap from
3875 * a device being removed. Therefore, the vdev that
3876 * this callback is applied to is a concrete
3877 * vdev.
3878 */
3879 ASSERT(vdev_is_concrete(vd));
3880
3881 VERIFY0(metaslab_claim_impl(vd, offset, size,
3882 spa_min_claim_txg(vd->vdev_spa)));
3883 }
3884
3885 static void
claim_segment_cb(void * arg,uint64_t offset,uint64_t size)3886 claim_segment_cb(void *arg, uint64_t offset, uint64_t size)
3887 {
3888 vdev_t *vd = arg;
3889
3890 vdev_indirect_ops.vdev_op_remap(vd, offset, size,
3891 claim_segment_impl_cb, NULL);
3892 }
3893
3894 /*
3895 * After accounting for all allocated blocks that are directly referenced,
3896 * we might have missed a reference to a block from a partially complete
3897 * (and thus unused) indirect mapping object. We perform a secondary pass
3898 * through the metaslabs we have already mapped and claim the destination
3899 * blocks.
3900 */
3901 static void
zdb_claim_removing(spa_t * spa,zdb_cb_t * zcb)3902 zdb_claim_removing(spa_t *spa, zdb_cb_t *zcb)
3903 {
3904 if (dump_opt['L'])
3905 return;
3906
3907 if (spa->spa_vdev_removal == NULL)
3908 return;
3909
3910 spa_config_enter(spa, SCL_CONFIG, FTAG, RW_READER);
3911
3912 spa_vdev_removal_t *svr = spa->spa_vdev_removal;
3913 vdev_t *vd = vdev_lookup_top(spa, svr->svr_vdev_id);
3914 vdev_indirect_mapping_t *vim = vd->vdev_indirect_mapping;
3915
3916 ASSERT0(range_tree_space(svr->svr_allocd_segs));
3917
3918 range_tree_t *allocs = range_tree_create(NULL, RANGE_SEG64, NULL, 0, 0);
3919 for (uint64_t msi = 0; msi < vd->vdev_ms_count; msi++) {
3920 metaslab_t *msp = vd->vdev_ms[msi];
3921
3922 if (msp->ms_start >= vdev_indirect_mapping_max_offset(vim))
3923 break;
3924
3925 ASSERT0(range_tree_space(allocs));
3926 if (msp->ms_sm != NULL)
3927 VERIFY0(space_map_load(msp->ms_sm, allocs, SM_ALLOC));
3928 range_tree_vacate(allocs, range_tree_add, svr->svr_allocd_segs);
3929 }
3930 range_tree_destroy(allocs);
3931
3932 iterate_through_spacemap_logs(spa, load_unflushed_svr_segs_cb, svr);
3933
3934 /*
3935 * Clear everything past what has been synced,
3936 * because we have not allocated mappings for
3937 * it yet.
3938 */
3939 range_tree_clear(svr->svr_allocd_segs,
3940 vdev_indirect_mapping_max_offset(vim),
3941 vd->vdev_asize - vdev_indirect_mapping_max_offset(vim));
3942
3943 zcb->zcb_removing_size += range_tree_space(svr->svr_allocd_segs);
3944 range_tree_vacate(svr->svr_allocd_segs, claim_segment_cb, vd);
3945
3946 spa_config_exit(spa, SCL_CONFIG, FTAG);
3947 }
3948
3949 /* ARGSUSED */
3950 static int
increment_indirect_mapping_cb(void * arg,const blkptr_t * bp,dmu_tx_t * tx)3951 increment_indirect_mapping_cb(void *arg, const blkptr_t *bp, dmu_tx_t *tx)
3952 {
3953 zdb_cb_t *zcb = arg;
3954 spa_t *spa = zcb->zcb_spa;
3955 vdev_t *vd;
3956 const dva_t *dva = &bp->blk_dva[0];
3957
3958 ASSERT(!dump_opt['L']);
3959 ASSERT3U(BP_GET_NDVAS(bp), ==, 1);
3960
3961 spa_config_enter(spa, SCL_VDEV, FTAG, RW_READER);
3962 vd = vdev_lookup_top(zcb->zcb_spa, DVA_GET_VDEV(dva));
3963 ASSERT3P(vd, !=, NULL);
3964 spa_config_exit(spa, SCL_VDEV, FTAG);
3965
3966 ASSERT(vd->vdev_indirect_config.vic_mapping_object != 0);
3967 ASSERT3P(zcb->zcb_vd_obsolete_counts[vd->vdev_id], !=, NULL);
3968
3969 vdev_indirect_mapping_increment_obsolete_count(
3970 vd->vdev_indirect_mapping,
3971 DVA_GET_OFFSET(dva), DVA_GET_ASIZE(dva),
3972 zcb->zcb_vd_obsolete_counts[vd->vdev_id]);
3973
3974 return (0);
3975 }
3976
3977 static uint32_t *
zdb_load_obsolete_counts(vdev_t * vd)3978 zdb_load_obsolete_counts(vdev_t *vd)
3979 {
3980 vdev_indirect_mapping_t *vim = vd->vdev_indirect_mapping;
3981 spa_t *spa = vd->vdev_spa;
3982 spa_condensing_indirect_phys_t *scip =
3983 &spa->spa_condensing_indirect_phys;
3984 uint32_t *counts;
3985
3986 EQUIV(vdev_obsolete_sm_object(vd) != 0, vd->vdev_obsolete_sm != NULL);
3987 counts = vdev_indirect_mapping_load_obsolete_counts(vim);
3988 if (vd->vdev_obsolete_sm != NULL) {
3989 vdev_indirect_mapping_load_obsolete_spacemap(vim, counts,
3990 vd->vdev_obsolete_sm);
3991 }
3992 if (scip->scip_vdev == vd->vdev_id &&
3993 scip->scip_prev_obsolete_sm_object != 0) {
3994 space_map_t *prev_obsolete_sm = NULL;
3995 VERIFY0(space_map_open(&prev_obsolete_sm, spa->spa_meta_objset,
3996 scip->scip_prev_obsolete_sm_object, 0, vd->vdev_asize, 0));
3997 vdev_indirect_mapping_load_obsolete_spacemap(vim, counts,
3998 prev_obsolete_sm);
3999 space_map_close(prev_obsolete_sm);
4000 }
4001 return (counts);
4002 }
4003
4004 typedef struct checkpoint_sm_exclude_entry_arg {
4005 vdev_t *cseea_vd;
4006 uint64_t cseea_checkpoint_size;
4007 } checkpoint_sm_exclude_entry_arg_t;
4008
4009 static int
checkpoint_sm_exclude_entry_cb(space_map_entry_t * sme,void * arg)4010 checkpoint_sm_exclude_entry_cb(space_map_entry_t *sme, void *arg)
4011 {
4012 checkpoint_sm_exclude_entry_arg_t *cseea = arg;
4013 vdev_t *vd = cseea->cseea_vd;
4014 metaslab_t *ms = vd->vdev_ms[sme->sme_offset >> vd->vdev_ms_shift];
4015 uint64_t end = sme->sme_offset + sme->sme_run;
4016
4017 ASSERT(sme->sme_type == SM_FREE);
4018
4019 /*
4020 * Since the vdev_checkpoint_sm exists in the vdev level
4021 * and the ms_sm space maps exist in the metaslab level,
4022 * an entry in the checkpoint space map could theoretically
4023 * cross the boundaries of the metaslab that it belongs.
4024 *
4025 * In reality, because of the way that we populate and
4026 * manipulate the checkpoint's space maps currently,
4027 * there shouldn't be any entries that cross metaslabs.
4028 * Hence the assertion below.
4029 *
4030 * That said, there is no fundamental requirement that
4031 * the checkpoint's space map entries should not cross
4032 * metaslab boundaries. So if needed we could add code
4033 * that handles metaslab-crossing segments in the future.
4034 */
4035 VERIFY3U(sme->sme_offset, >=, ms->ms_start);
4036 VERIFY3U(end, <=, ms->ms_start + ms->ms_size);
4037
4038 /*
4039 * By removing the entry from the allocated segments we
4040 * also verify that the entry is there to begin with.
4041 */
4042 mutex_enter(&ms->ms_lock);
4043 range_tree_remove(ms->ms_allocatable, sme->sme_offset, sme->sme_run);
4044 mutex_exit(&ms->ms_lock);
4045
4046 cseea->cseea_checkpoint_size += sme->sme_run;
4047 return (0);
4048 }
4049
4050 static void
zdb_leak_init_vdev_exclude_checkpoint(vdev_t * vd,zdb_cb_t * zcb)4051 zdb_leak_init_vdev_exclude_checkpoint(vdev_t *vd, zdb_cb_t *zcb)
4052 {
4053 spa_t *spa = vd->vdev_spa;
4054 space_map_t *checkpoint_sm = NULL;
4055 uint64_t checkpoint_sm_obj;
4056
4057 /*
4058 * If there is no vdev_top_zap, we are in a pool whose
4059 * version predates the pool checkpoint feature.
4060 */
4061 if (vd->vdev_top_zap == 0)
4062 return;
4063
4064 /*
4065 * If there is no reference of the vdev_checkpoint_sm in
4066 * the vdev_top_zap, then one of the following scenarios
4067 * is true:
4068 *
4069 * 1] There is no checkpoint
4070 * 2] There is a checkpoint, but no checkpointed blocks
4071 * have been freed yet
4072 * 3] The current vdev is indirect
4073 *
4074 * In these cases we return immediately.
4075 */
4076 if (zap_contains(spa_meta_objset(spa), vd->vdev_top_zap,
4077 VDEV_TOP_ZAP_POOL_CHECKPOINT_SM) != 0)
4078 return;
4079
4080 VERIFY0(zap_lookup(spa_meta_objset(spa), vd->vdev_top_zap,
4081 VDEV_TOP_ZAP_POOL_CHECKPOINT_SM, sizeof (uint64_t), 1,
4082 &checkpoint_sm_obj));
4083
4084 checkpoint_sm_exclude_entry_arg_t cseea;
4085 cseea.cseea_vd = vd;
4086 cseea.cseea_checkpoint_size = 0;
4087
4088 VERIFY0(space_map_open(&checkpoint_sm, spa_meta_objset(spa),
4089 checkpoint_sm_obj, 0, vd->vdev_asize, vd->vdev_ashift));
4090
4091 VERIFY0(space_map_iterate(checkpoint_sm,
4092 space_map_length(checkpoint_sm),
4093 checkpoint_sm_exclude_entry_cb, &cseea));
4094 space_map_close(checkpoint_sm);
4095
4096 zcb->zcb_checkpoint_size += cseea.cseea_checkpoint_size;
4097 }
4098
4099 static void
zdb_leak_init_exclude_checkpoint(spa_t * spa,zdb_cb_t * zcb)4100 zdb_leak_init_exclude_checkpoint(spa_t *spa, zdb_cb_t *zcb)
4101 {
4102 ASSERT(!dump_opt['L']);
4103
4104 vdev_t *rvd = spa->spa_root_vdev;
4105 for (uint64_t c = 0; c < rvd->vdev_children; c++) {
4106 ASSERT3U(c, ==, rvd->vdev_child[c]->vdev_id);
4107 zdb_leak_init_vdev_exclude_checkpoint(rvd->vdev_child[c], zcb);
4108 }
4109 }
4110
4111 static int
count_unflushed_space_cb(spa_t * spa,space_map_entry_t * sme,uint64_t txg,void * arg)4112 count_unflushed_space_cb(spa_t *spa, space_map_entry_t *sme,
4113 uint64_t txg, void *arg)
4114 {
4115 int64_t *ualloc_space = arg;
4116 uint64_t offset = sme->sme_offset;
4117 uint64_t vdev_id = sme->sme_vdev;
4118
4119 vdev_t *vd = vdev_lookup_top(spa, vdev_id);
4120 if (!vdev_is_concrete(vd))
4121 return (0);
4122
4123 metaslab_t *ms = vd->vdev_ms[offset >> vd->vdev_ms_shift];
4124 ASSERT(sme->sme_type == SM_ALLOC || sme->sme_type == SM_FREE);
4125
4126 if (txg < metaslab_unflushed_txg(ms))
4127 return (0);
4128
4129 if (sme->sme_type == SM_ALLOC)
4130 *ualloc_space += sme->sme_run;
4131 else
4132 *ualloc_space -= sme->sme_run;
4133
4134 return (0);
4135 }
4136
4137 static int64_t
get_unflushed_alloc_space(spa_t * spa)4138 get_unflushed_alloc_space(spa_t *spa)
4139 {
4140 if (dump_opt['L'])
4141 return (0);
4142
4143 int64_t ualloc_space = 0;
4144 iterate_through_spacemap_logs(spa, count_unflushed_space_cb,
4145 &ualloc_space);
4146 return (ualloc_space);
4147 }
4148
4149 static int
load_unflushed_cb(spa_t * spa,space_map_entry_t * sme,uint64_t txg,void * arg)4150 load_unflushed_cb(spa_t *spa, space_map_entry_t *sme, uint64_t txg, void *arg)
4151 {
4152 maptype_t *uic_maptype = arg;
4153 uint64_t offset = sme->sme_offset;
4154 uint64_t size = sme->sme_run;
4155 uint64_t vdev_id = sme->sme_vdev;
4156 vdev_t *vd = vdev_lookup_top(spa, vdev_id);
4157
4158 /* skip indirect vdevs */
4159 if (!vdev_is_concrete(vd))
4160 return (0);
4161
4162 metaslab_t *ms = vd->vdev_ms[offset >> vd->vdev_ms_shift];
4163
4164 ASSERT(sme->sme_type == SM_ALLOC || sme->sme_type == SM_FREE);
4165 ASSERT(*uic_maptype == SM_ALLOC || *uic_maptype == SM_FREE);
4166
4167 if (txg < metaslab_unflushed_txg(ms))
4168 return (0);
4169
4170 if (*uic_maptype == sme->sme_type)
4171 range_tree_add(ms->ms_allocatable, offset, size);
4172 else
4173 range_tree_remove(ms->ms_allocatable, offset, size);
4174
4175 return (0);
4176 }
4177
4178 static void
load_unflushed_to_ms_allocatables(spa_t * spa,maptype_t maptype)4179 load_unflushed_to_ms_allocatables(spa_t *spa, maptype_t maptype)
4180 {
4181 iterate_through_spacemap_logs(spa, load_unflushed_cb, &maptype);
4182 }
4183
4184 static void
load_concrete_ms_allocatable_trees(spa_t * spa,maptype_t maptype)4185 load_concrete_ms_allocatable_trees(spa_t *spa, maptype_t maptype)
4186 {
4187 vdev_t *rvd = spa->spa_root_vdev;
4188 for (uint64_t i = 0; i < rvd->vdev_children; i++) {
4189 vdev_t *vd = rvd->vdev_child[i];
4190
4191 ASSERT3U(i, ==, vd->vdev_id);
4192
4193 if (vd->vdev_ops == &vdev_indirect_ops)
4194 continue;
4195
4196 for (uint64_t m = 0; m < vd->vdev_ms_count; m++) {
4197 metaslab_t *msp = vd->vdev_ms[m];
4198
4199 (void) fprintf(stderr,
4200 "\rloading concrete vdev %llu, "
4201 "metaslab %llu of %llu ...",
4202 (longlong_t)vd->vdev_id,
4203 (longlong_t)msp->ms_id,
4204 (longlong_t)vd->vdev_ms_count);
4205
4206 mutex_enter(&msp->ms_lock);
4207 range_tree_vacate(msp->ms_allocatable, NULL, NULL);
4208
4209 /*
4210 * We don't want to spend the CPU manipulating the
4211 * size-ordered tree, so clear the range_tree ops.
4212 */
4213 msp->ms_allocatable->rt_ops = NULL;
4214
4215 if (msp->ms_sm != NULL) {
4216 VERIFY0(space_map_load(msp->ms_sm,
4217 msp->ms_allocatable, maptype));
4218 }
4219 if (!msp->ms_loaded)
4220 msp->ms_loaded = B_TRUE;
4221 mutex_exit(&msp->ms_lock);
4222 }
4223 }
4224
4225 load_unflushed_to_ms_allocatables(spa, maptype);
4226 }
4227
4228 /*
4229 * vm_idxp is an in-out parameter which (for indirect vdevs) is the
4230 * index in vim_entries that has the first entry in this metaslab.
4231 * On return, it will be set to the first entry after this metaslab.
4232 */
4233 static void
load_indirect_ms_allocatable_tree(vdev_t * vd,metaslab_t * msp,uint64_t * vim_idxp)4234 load_indirect_ms_allocatable_tree(vdev_t *vd, metaslab_t *msp,
4235 uint64_t *vim_idxp)
4236 {
4237 vdev_indirect_mapping_t *vim = vd->vdev_indirect_mapping;
4238
4239 mutex_enter(&msp->ms_lock);
4240 range_tree_vacate(msp->ms_allocatable, NULL, NULL);
4241
4242 /*
4243 * We don't want to spend the CPU manipulating the
4244 * size-ordered tree, so clear the range_tree ops.
4245 */
4246 msp->ms_allocatable->rt_ops = NULL;
4247
4248 for (; *vim_idxp < vdev_indirect_mapping_num_entries(vim);
4249 (*vim_idxp)++) {
4250 vdev_indirect_mapping_entry_phys_t *vimep =
4251 &vim->vim_entries[*vim_idxp];
4252 uint64_t ent_offset = DVA_MAPPING_GET_SRC_OFFSET(vimep);
4253 uint64_t ent_len = DVA_GET_ASIZE(&vimep->vimep_dst);
4254 ASSERT3U(ent_offset, >=, msp->ms_start);
4255 if (ent_offset >= msp->ms_start + msp->ms_size)
4256 break;
4257
4258 /*
4259 * Mappings do not cross metaslab boundaries,
4260 * because we create them by walking the metaslabs.
4261 */
4262 ASSERT3U(ent_offset + ent_len, <=,
4263 msp->ms_start + msp->ms_size);
4264 range_tree_add(msp->ms_allocatable, ent_offset, ent_len);
4265 }
4266
4267 if (!msp->ms_loaded)
4268 msp->ms_loaded = B_TRUE;
4269 mutex_exit(&msp->ms_lock);
4270 }
4271
4272 static void
zdb_leak_init_prepare_indirect_vdevs(spa_t * spa,zdb_cb_t * zcb)4273 zdb_leak_init_prepare_indirect_vdevs(spa_t *spa, zdb_cb_t *zcb)
4274 {
4275 ASSERT(!dump_opt['L']);
4276
4277 vdev_t *rvd = spa->spa_root_vdev;
4278 for (uint64_t c = 0; c < rvd->vdev_children; c++) {
4279 vdev_t *vd = rvd->vdev_child[c];
4280
4281 ASSERT3U(c, ==, vd->vdev_id);
4282
4283 if (vd->vdev_ops != &vdev_indirect_ops)
4284 continue;
4285
4286 /*
4287 * Note: we don't check for mapping leaks on
4288 * removing vdevs because their ms_allocatable's
4289 * are used to look for leaks in allocated space.
4290 */
4291 zcb->zcb_vd_obsolete_counts[c] = zdb_load_obsolete_counts(vd);
4292
4293 /*
4294 * Normally, indirect vdevs don't have any
4295 * metaslabs. We want to set them up for
4296 * zio_claim().
4297 */
4298 VERIFY0(vdev_metaslab_init(vd, 0));
4299
4300 #if defined(DEBUG)
4301 vdev_indirect_mapping_t *vim = vd->vdev_indirect_mapping;
4302 #endif
4303 uint64_t vim_idx = 0;
4304 for (uint64_t m = 0; m < vd->vdev_ms_count; m++) {
4305
4306 (void) fprintf(stderr,
4307 "\rloading indirect vdev %llu, "
4308 "metaslab %llu of %llu ...",
4309 (longlong_t)vd->vdev_id,
4310 (longlong_t)vd->vdev_ms[m]->ms_id,
4311 (longlong_t)vd->vdev_ms_count);
4312
4313 load_indirect_ms_allocatable_tree(vd, vd->vdev_ms[m],
4314 &vim_idx);
4315 }
4316 ASSERT3U(vim_idx, ==, vdev_indirect_mapping_num_entries(vim));
4317 }
4318 }
4319
4320 static void
zdb_leak_init(spa_t * spa,zdb_cb_t * zcb)4321 zdb_leak_init(spa_t *spa, zdb_cb_t *zcb)
4322 {
4323 zcb->zcb_spa = spa;
4324
4325 if (dump_opt['L'])
4326 return;
4327
4328 dsl_pool_t *dp = spa->spa_dsl_pool;
4329 vdev_t *rvd = spa->spa_root_vdev;
4330
4331 /*
4332 * We are going to be changing the meaning of the metaslab's
4333 * ms_allocatable. Ensure that the allocator doesn't try to
4334 * use the tree.
4335 */
4336 spa->spa_normal_class->mc_ops = &zdb_metaslab_ops;
4337 spa->spa_log_class->mc_ops = &zdb_metaslab_ops;
4338
4339 zcb->zcb_vd_obsolete_counts =
4340 umem_zalloc(rvd->vdev_children * sizeof (uint32_t *),
4341 UMEM_NOFAIL);
4342
4343 /*
4344 * For leak detection, we overload the ms_allocatable trees
4345 * to contain allocated segments instead of free segments.
4346 * As a result, we can't use the normal metaslab_load/unload
4347 * interfaces.
4348 */
4349 zdb_leak_init_prepare_indirect_vdevs(spa, zcb);
4350 load_concrete_ms_allocatable_trees(spa, SM_ALLOC);
4351
4352 /*
4353 * On load_concrete_ms_allocatable_trees() we loaded all the
4354 * allocated entries from the ms_sm to the ms_allocatable for
4355 * each metaslab. If the pool has a checkpoint or is in the
4356 * middle of discarding a checkpoint, some of these blocks
4357 * may have been freed but their ms_sm may not have been
4358 * updated because they are referenced by the checkpoint. In
4359 * order to avoid false-positives during leak-detection, we
4360 * go through the vdev's checkpoint space map and exclude all
4361 * its entries from their relevant ms_allocatable.
4362 *
4363 * We also aggregate the space held by the checkpoint and add
4364 * it to zcb_checkpoint_size.
4365 *
4366 * Note that at this point we are also verifying that all the
4367 * entries on the checkpoint_sm are marked as allocated in
4368 * the ms_sm of their relevant metaslab.
4369 * [see comment in checkpoint_sm_exclude_entry_cb()]
4370 */
4371 zdb_leak_init_exclude_checkpoint(spa, zcb);
4372 ASSERT3U(zcb->zcb_checkpoint_size, ==, spa_get_checkpoint_space(spa));
4373
4374 /* for cleaner progress output */
4375 (void) fprintf(stderr, "\n");
4376
4377 if (bpobj_is_open(&dp->dp_obsolete_bpobj)) {
4378 ASSERT(spa_feature_is_enabled(spa,
4379 SPA_FEATURE_DEVICE_REMOVAL));
4380 (void) bpobj_iterate_nofree(&dp->dp_obsolete_bpobj,
4381 increment_indirect_mapping_cb, zcb, NULL);
4382 }
4383
4384 spa_config_enter(spa, SCL_CONFIG, FTAG, RW_READER);
4385 zdb_ddt_leak_init(spa, zcb);
4386 spa_config_exit(spa, SCL_CONFIG, FTAG);
4387 }
4388
4389 static boolean_t
zdb_check_for_obsolete_leaks(vdev_t * vd,zdb_cb_t * zcb)4390 zdb_check_for_obsolete_leaks(vdev_t *vd, zdb_cb_t *zcb)
4391 {
4392 boolean_t leaks = B_FALSE;
4393 vdev_indirect_mapping_t *vim = vd->vdev_indirect_mapping;
4394 uint64_t total_leaked = 0;
4395
4396 ASSERT(vim != NULL);
4397
4398 for (uint64_t i = 0; i < vdev_indirect_mapping_num_entries(vim); i++) {
4399 vdev_indirect_mapping_entry_phys_t *vimep =
4400 &vim->vim_entries[i];
4401 uint64_t obsolete_bytes = 0;
4402 uint64_t offset = DVA_MAPPING_GET_SRC_OFFSET(vimep);
4403 metaslab_t *msp = vd->vdev_ms[offset >> vd->vdev_ms_shift];
4404
4405 /*
4406 * This is not very efficient but it's easy to
4407 * verify correctness.
4408 */
4409 for (uint64_t inner_offset = 0;
4410 inner_offset < DVA_GET_ASIZE(&vimep->vimep_dst);
4411 inner_offset += 1 << vd->vdev_ashift) {
4412 if (range_tree_contains(msp->ms_allocatable,
4413 offset + inner_offset, 1 << vd->vdev_ashift)) {
4414 obsolete_bytes += 1 << vd->vdev_ashift;
4415 }
4416 }
4417
4418 int64_t bytes_leaked = obsolete_bytes -
4419 zcb->zcb_vd_obsolete_counts[vd->vdev_id][i];
4420 ASSERT3U(DVA_GET_ASIZE(&vimep->vimep_dst), >=,
4421 zcb->zcb_vd_obsolete_counts[vd->vdev_id][i]);
4422 if (bytes_leaked != 0 &&
4423 (vdev_obsolete_counts_are_precise(vd) ||
4424 dump_opt['d'] >= 5)) {
4425 (void) printf("obsolete indirect mapping count "
4426 "mismatch on %llu:%llx:%llx : %llx bytes leaked\n",
4427 (u_longlong_t)vd->vdev_id,
4428 (u_longlong_t)DVA_MAPPING_GET_SRC_OFFSET(vimep),
4429 (u_longlong_t)DVA_GET_ASIZE(&vimep->vimep_dst),
4430 (u_longlong_t)bytes_leaked);
4431 }
4432 total_leaked += ABS(bytes_leaked);
4433 }
4434
4435 if (!vdev_obsolete_counts_are_precise(vd) && total_leaked > 0) {
4436 int pct_leaked = total_leaked * 100 /
4437 vdev_indirect_mapping_bytes_mapped(vim);
4438 (void) printf("cannot verify obsolete indirect mapping "
4439 "counts of vdev %llu because precise feature was not "
4440 "enabled when it was removed: %d%% (%llx bytes) of mapping"
4441 "unreferenced\n",
4442 (u_longlong_t)vd->vdev_id, pct_leaked,
4443 (u_longlong_t)total_leaked);
4444 } else if (total_leaked > 0) {
4445 (void) printf("obsolete indirect mapping count mismatch "
4446 "for vdev %llu -- %llx total bytes mismatched\n",
4447 (u_longlong_t)vd->vdev_id,
4448 (u_longlong_t)total_leaked);
4449 leaks |= B_TRUE;
4450 }
4451
4452 vdev_indirect_mapping_free_obsolete_counts(vim,
4453 zcb->zcb_vd_obsolete_counts[vd->vdev_id]);
4454 zcb->zcb_vd_obsolete_counts[vd->vdev_id] = NULL;
4455
4456 return (leaks);
4457 }
4458
4459 static boolean_t
zdb_leak_fini(spa_t * spa,zdb_cb_t * zcb)4460 zdb_leak_fini(spa_t *spa, zdb_cb_t *zcb)
4461 {
4462 if (dump_opt['L'])
4463 return (B_FALSE);
4464
4465 boolean_t leaks = B_FALSE;
4466
4467 vdev_t *rvd = spa->spa_root_vdev;
4468 for (unsigned c = 0; c < rvd->vdev_children; c++) {
4469 vdev_t *vd = rvd->vdev_child[c];
4470 #if DEBUG
4471 metaslab_group_t *mg = vd->vdev_mg;
4472 #endif
4473
4474 if (zcb->zcb_vd_obsolete_counts[c] != NULL) {
4475 leaks |= zdb_check_for_obsolete_leaks(vd, zcb);
4476 }
4477
4478 for (uint64_t m = 0; m < vd->vdev_ms_count; m++) {
4479 metaslab_t *msp = vd->vdev_ms[m];
4480 ASSERT3P(mg, ==, msp->ms_group);
4481
4482 /*
4483 * ms_allocatable has been overloaded
4484 * to contain allocated segments. Now that
4485 * we finished traversing all blocks, any
4486 * block that remains in the ms_allocatable
4487 * represents an allocated block that we
4488 * did not claim during the traversal.
4489 * Claimed blocks would have been removed
4490 * from the ms_allocatable. For indirect
4491 * vdevs, space remaining in the tree
4492 * represents parts of the mapping that are
4493 * not referenced, which is not a bug.
4494 */
4495 if (vd->vdev_ops == &vdev_indirect_ops) {
4496 range_tree_vacate(msp->ms_allocatable,
4497 NULL, NULL);
4498 } else {
4499 range_tree_vacate(msp->ms_allocatable,
4500 zdb_leak, vd);
4501 }
4502 if (msp->ms_loaded) {
4503 msp->ms_loaded = B_FALSE;
4504 }
4505 }
4506
4507 }
4508
4509 umem_free(zcb->zcb_vd_obsolete_counts,
4510 rvd->vdev_children * sizeof (uint32_t *));
4511 zcb->zcb_vd_obsolete_counts = NULL;
4512
4513 return (leaks);
4514 }
4515
4516 /* ARGSUSED */
4517 static int
count_block_cb(void * arg,const blkptr_t * bp,dmu_tx_t * tx)4518 count_block_cb(void *arg, const blkptr_t *bp, dmu_tx_t *tx)
4519 {
4520 zdb_cb_t *zcb = arg;
4521
4522 if (dump_opt['b'] >= 5) {
4523 char blkbuf[BP_SPRINTF_LEN];
4524 snprintf_blkptr(blkbuf, sizeof (blkbuf), bp);
4525 (void) printf("[%s] %s\n",
4526 "deferred free", blkbuf);
4527 }
4528 zdb_count_block(zcb, NULL, bp, ZDB_OT_DEFERRED);
4529 return (0);
4530 }
4531
4532 static int
dump_block_stats(spa_t * spa)4533 dump_block_stats(spa_t *spa)
4534 {
4535 zdb_cb_t zcb;
4536 zdb_blkstats_t *zb, *tzb;
4537 uint64_t norm_alloc, norm_space, total_alloc, total_found;
4538 int flags = TRAVERSE_PRE | TRAVERSE_PREFETCH_METADATA |
4539 TRAVERSE_NO_DECRYPT | TRAVERSE_HARD;
4540 boolean_t leaks = B_FALSE;
4541 int err;
4542
4543 bzero(&zcb, sizeof (zcb));
4544 (void) printf("\nTraversing all blocks %s%s%s%s%s...\n\n",
4545 (dump_opt['c'] || !dump_opt['L']) ? "to verify " : "",
4546 (dump_opt['c'] == 1) ? "metadata " : "",
4547 dump_opt['c'] ? "checksums " : "",
4548 (dump_opt['c'] && !dump_opt['L']) ? "and verify " : "",
4549 !dump_opt['L'] ? "nothing leaked " : "");
4550
4551 /*
4552 * When leak detection is enabled we load all space maps as SM_ALLOC
4553 * maps, then traverse the pool claiming each block we discover. If
4554 * the pool is perfectly consistent, the segment trees will be empty
4555 * when we're done. Anything left over is a leak; any block we can't
4556 * claim (because it's not part of any space map) is a double
4557 * allocation, reference to a freed block, or an unclaimed log block.
4558 *
4559 * When leak detection is disabled (-L option) we still traverse the
4560 * pool claiming each block we discover, but we skip opening any space
4561 * maps.
4562 */
4563 bzero(&zcb, sizeof (zdb_cb_t));
4564 zdb_leak_init(spa, &zcb);
4565
4566 /*
4567 * If there's a deferred-free bplist, process that first.
4568 */
4569 (void) bpobj_iterate_nofree(&spa->spa_deferred_bpobj,
4570 count_block_cb, &zcb, NULL);
4571
4572 if (spa_version(spa) >= SPA_VERSION_DEADLISTS) {
4573 (void) bpobj_iterate_nofree(&spa->spa_dsl_pool->dp_free_bpobj,
4574 count_block_cb, &zcb, NULL);
4575 }
4576
4577 zdb_claim_removing(spa, &zcb);
4578
4579 if (spa_feature_is_active(spa, SPA_FEATURE_ASYNC_DESTROY)) {
4580 VERIFY3U(0, ==, bptree_iterate(spa->spa_meta_objset,
4581 spa->spa_dsl_pool->dp_bptree_obj, B_FALSE, count_block_cb,
4582 &zcb, NULL));
4583 }
4584
4585 if (dump_opt['c'] > 1)
4586 flags |= TRAVERSE_PREFETCH_DATA;
4587
4588 zcb.zcb_totalasize = metaslab_class_get_alloc(spa_normal_class(spa));
4589 zcb.zcb_totalasize += metaslab_class_get_alloc(spa_special_class(spa));
4590 zcb.zcb_totalasize += metaslab_class_get_alloc(spa_dedup_class(spa));
4591 zcb.zcb_start = zcb.zcb_lastprint = gethrtime();
4592 err = traverse_pool(spa, 0, flags, zdb_blkptr_cb, &zcb);
4593
4594 /*
4595 * If we've traversed the data blocks then we need to wait for those
4596 * I/Os to complete. We leverage "The Godfather" zio to wait on
4597 * all async I/Os to complete.
4598 */
4599 if (dump_opt['c']) {
4600 for (int i = 0; i < max_ncpus; i++) {
4601 (void) zio_wait(spa->spa_async_zio_root[i]);
4602 spa->spa_async_zio_root[i] = zio_root(spa, NULL, NULL,
4603 ZIO_FLAG_CANFAIL | ZIO_FLAG_SPECULATIVE |
4604 ZIO_FLAG_GODFATHER);
4605 }
4606 }
4607
4608 /*
4609 * Done after zio_wait() since zcb_haderrors is modified in
4610 * zdb_blkptr_done()
4611 */
4612 zcb.zcb_haderrors |= err;
4613
4614 if (zcb.zcb_haderrors) {
4615 (void) printf("\nError counts:\n\n");
4616 (void) printf("\t%5s %s\n", "errno", "count");
4617 for (int e = 0; e < 256; e++) {
4618 if (zcb.zcb_errors[e] != 0) {
4619 (void) printf("\t%5d %llu\n",
4620 e, (u_longlong_t)zcb.zcb_errors[e]);
4621 }
4622 }
4623 }
4624
4625 /*
4626 * Report any leaked segments.
4627 */
4628 leaks |= zdb_leak_fini(spa, &zcb);
4629
4630 tzb = &zcb.zcb_type[ZB_TOTAL][ZDB_OT_TOTAL];
4631
4632 norm_alloc = metaslab_class_get_alloc(spa_normal_class(spa));
4633 norm_space = metaslab_class_get_space(spa_normal_class(spa));
4634
4635 total_alloc = norm_alloc +
4636 metaslab_class_get_alloc(spa_log_class(spa)) +
4637 metaslab_class_get_alloc(spa_special_class(spa)) +
4638 metaslab_class_get_alloc(spa_dedup_class(spa)) +
4639 get_unflushed_alloc_space(spa);
4640 total_found = tzb->zb_asize - zcb.zcb_dedup_asize +
4641 zcb.zcb_removing_size + zcb.zcb_checkpoint_size;
4642
4643 if (total_found == total_alloc && !dump_opt['L']) {
4644 (void) printf("\n\tNo leaks (block sum matches space"
4645 " maps exactly)\n");
4646 } else if (!dump_opt['L']) {
4647 (void) printf("block traversal size %llu != alloc %llu "
4648 "(%s %lld)\n",
4649 (u_longlong_t)total_found,
4650 (u_longlong_t)total_alloc,
4651 (dump_opt['L']) ? "unreachable" : "leaked",
4652 (longlong_t)(total_alloc - total_found));
4653 leaks = B_TRUE;
4654 }
4655
4656 if (tzb->zb_count == 0)
4657 return (2);
4658
4659 (void) printf("\n");
4660 (void) printf("\t%-16s %14llu\n", "bp count:",
4661 (u_longlong_t)tzb->zb_count);
4662 (void) printf("\t%-16s %14llu\n", "ganged count:",
4663 (longlong_t)tzb->zb_gangs);
4664 (void) printf("\t%-16s %14llu avg: %6llu\n", "bp logical:",
4665 (u_longlong_t)tzb->zb_lsize,
4666 (u_longlong_t)(tzb->zb_lsize / tzb->zb_count));
4667 (void) printf("\t%-16s %14llu avg: %6llu compression: %6.2f\n",
4668 "bp physical:", (u_longlong_t)tzb->zb_psize,
4669 (u_longlong_t)(tzb->zb_psize / tzb->zb_count),
4670 (double)tzb->zb_lsize / tzb->zb_psize);
4671 (void) printf("\t%-16s %14llu avg: %6llu compression: %6.2f\n",
4672 "bp allocated:", (u_longlong_t)tzb->zb_asize,
4673 (u_longlong_t)(tzb->zb_asize / tzb->zb_count),
4674 (double)tzb->zb_lsize / tzb->zb_asize);
4675 (void) printf("\t%-16s %14llu ref>1: %6llu deduplication: %6.2f\n",
4676 "bp deduped:", (u_longlong_t)zcb.zcb_dedup_asize,
4677 (u_longlong_t)zcb.zcb_dedup_blocks,
4678 (double)zcb.zcb_dedup_asize / tzb->zb_asize + 1.0);
4679 (void) printf("\t%-16s %14llu used: %5.2f%%\n", "Normal class:",
4680 (u_longlong_t)norm_alloc, 100.0 * norm_alloc / norm_space);
4681
4682 if (spa_special_class(spa)->mc_rotor != NULL) {
4683 uint64_t alloc = metaslab_class_get_alloc(
4684 spa_special_class(spa));
4685 uint64_t space = metaslab_class_get_space(
4686 spa_special_class(spa));
4687
4688 (void) printf("\t%-16s %14llu used: %5.2f%%\n",
4689 "Special class", (u_longlong_t)alloc,
4690 100.0 * alloc / space);
4691 }
4692
4693 if (spa_dedup_class(spa)->mc_rotor != NULL) {
4694 uint64_t alloc = metaslab_class_get_alloc(
4695 spa_dedup_class(spa));
4696 uint64_t space = metaslab_class_get_space(
4697 spa_dedup_class(spa));
4698
4699 (void) printf("\t%-16s %14llu used: %5.2f%%\n",
4700 "Dedup class", (u_longlong_t)alloc,
4701 100.0 * alloc / space);
4702 }
4703
4704 for (bp_embedded_type_t i = 0; i < NUM_BP_EMBEDDED_TYPES; i++) {
4705 if (zcb.zcb_embedded_blocks[i] == 0)
4706 continue;
4707 (void) printf("\n");
4708 (void) printf("\tadditional, non-pointer bps of type %u: "
4709 "%10llu\n",
4710 i, (u_longlong_t)zcb.zcb_embedded_blocks[i]);
4711
4712 if (dump_opt['b'] >= 3) {
4713 (void) printf("\t number of (compressed) bytes: "
4714 "number of bps\n");
4715 dump_histogram(zcb.zcb_embedded_histogram[i],
4716 sizeof (zcb.zcb_embedded_histogram[i]) /
4717 sizeof (zcb.zcb_embedded_histogram[i][0]), 0);
4718 }
4719 }
4720
4721 if (tzb->zb_ditto_samevdev != 0) {
4722 (void) printf("\tDittoed blocks on same vdev: %llu\n",
4723 (longlong_t)tzb->zb_ditto_samevdev);
4724 }
4725 if (tzb->zb_ditto_same_ms != 0) {
4726 (void) printf("\tDittoed blocks in same metaslab: %llu\n",
4727 (longlong_t)tzb->zb_ditto_same_ms);
4728 }
4729
4730 for (uint64_t v = 0; v < spa->spa_root_vdev->vdev_children; v++) {
4731 vdev_t *vd = spa->spa_root_vdev->vdev_child[v];
4732 vdev_indirect_mapping_t *vim = vd->vdev_indirect_mapping;
4733
4734 if (vim == NULL) {
4735 continue;
4736 }
4737
4738 char mem[32];
4739 zdb_nicenum(vdev_indirect_mapping_num_entries(vim),
4740 mem, vdev_indirect_mapping_size(vim));
4741
4742 (void) printf("\tindirect vdev id %llu has %llu segments "
4743 "(%s in memory)\n",
4744 (longlong_t)vd->vdev_id,
4745 (longlong_t)vdev_indirect_mapping_num_entries(vim), mem);
4746 }
4747
4748 if (dump_opt['b'] >= 2) {
4749 int l, t, level;
4750 (void) printf("\nBlocks\tLSIZE\tPSIZE\tASIZE"
4751 "\t avg\t comp\t%%Total\tType\n");
4752
4753 for (t = 0; t <= ZDB_OT_TOTAL; t++) {
4754 char csize[32], lsize[32], psize[32], asize[32];
4755 char avg[32], gang[32];
4756 const char *typename;
4757
4758 /* make sure nicenum has enough space */
4759 CTASSERT(sizeof (csize) >= NN_NUMBUF_SZ);
4760 CTASSERT(sizeof (lsize) >= NN_NUMBUF_SZ);
4761 CTASSERT(sizeof (psize) >= NN_NUMBUF_SZ);
4762 CTASSERT(sizeof (asize) >= NN_NUMBUF_SZ);
4763 CTASSERT(sizeof (avg) >= NN_NUMBUF_SZ);
4764 CTASSERT(sizeof (gang) >= NN_NUMBUF_SZ);
4765
4766 if (t < DMU_OT_NUMTYPES)
4767 typename = dmu_ot[t].ot_name;
4768 else
4769 typename = zdb_ot_extname[t - DMU_OT_NUMTYPES];
4770
4771 if (zcb.zcb_type[ZB_TOTAL][t].zb_asize == 0) {
4772 (void) printf("%6s\t%5s\t%5s\t%5s"
4773 "\t%5s\t%5s\t%6s\t%s\n",
4774 "-",
4775 "-",
4776 "-",
4777 "-",
4778 "-",
4779 "-",
4780 "-",
4781 typename);
4782 continue;
4783 }
4784
4785 for (l = ZB_TOTAL - 1; l >= -1; l--) {
4786 level = (l == -1 ? ZB_TOTAL : l);
4787 zb = &zcb.zcb_type[level][t];
4788
4789 if (zb->zb_asize == 0)
4790 continue;
4791
4792 if (dump_opt['b'] < 3 && level != ZB_TOTAL)
4793 continue;
4794
4795 if (level == 0 && zb->zb_asize ==
4796 zcb.zcb_type[ZB_TOTAL][t].zb_asize)
4797 continue;
4798
4799 zdb_nicenum(zb->zb_count, csize,
4800 sizeof (csize));
4801 zdb_nicenum(zb->zb_lsize, lsize,
4802 sizeof (lsize));
4803 zdb_nicenum(zb->zb_psize, psize,
4804 sizeof (psize));
4805 zdb_nicenum(zb->zb_asize, asize,
4806 sizeof (asize));
4807 zdb_nicenum(zb->zb_asize / zb->zb_count, avg,
4808 sizeof (avg));
4809 zdb_nicenum(zb->zb_gangs, gang, sizeof (gang));
4810
4811 (void) printf("%6s\t%5s\t%5s\t%5s\t%5s"
4812 "\t%5.2f\t%6.2f\t",
4813 csize, lsize, psize, asize, avg,
4814 (double)zb->zb_lsize / zb->zb_psize,
4815 100.0 * zb->zb_asize / tzb->zb_asize);
4816
4817 if (level == ZB_TOTAL)
4818 (void) printf("%s\n", typename);
4819 else
4820 (void) printf(" L%d %s\n",
4821 level, typename);
4822
4823 if (dump_opt['b'] >= 3 && zb->zb_gangs > 0) {
4824 (void) printf("\t number of ganged "
4825 "blocks: %s\n", gang);
4826 }
4827
4828 if (dump_opt['b'] >= 4) {
4829 (void) printf("psize "
4830 "(in 512-byte sectors): "
4831 "number of blocks\n");
4832 dump_histogram(zb->zb_psize_histogram,
4833 PSIZE_HISTO_SIZE, 0);
4834 }
4835 }
4836 }
4837 }
4838
4839 (void) printf("\n");
4840
4841 if (leaks)
4842 return (2);
4843
4844 if (zcb.zcb_haderrors)
4845 return (3);
4846
4847 return (0);
4848 }
4849
4850 typedef struct zdb_ddt_entry {
4851 ddt_key_t zdde_key;
4852 uint64_t zdde_ref_blocks;
4853 uint64_t zdde_ref_lsize;
4854 uint64_t zdde_ref_psize;
4855 uint64_t zdde_ref_dsize;
4856 avl_node_t zdde_node;
4857 } zdb_ddt_entry_t;
4858
4859 /* ARGSUSED */
4860 static int
zdb_ddt_add_cb(spa_t * spa,zilog_t * zilog,const blkptr_t * bp,const zbookmark_phys_t * zb,const dnode_phys_t * dnp,void * arg)4861 zdb_ddt_add_cb(spa_t *spa, zilog_t *zilog, const blkptr_t *bp,
4862 const zbookmark_phys_t *zb, const dnode_phys_t *dnp, void *arg)
4863 {
4864 avl_tree_t *t = arg;
4865 avl_index_t where;
4866 zdb_ddt_entry_t *zdde, zdde_search;
4867
4868 if (bp == NULL || BP_IS_HOLE(bp) || BP_IS_EMBEDDED(bp))
4869 return (0);
4870
4871 if (dump_opt['S'] > 1 && zb->zb_level == ZB_ROOT_LEVEL) {
4872 (void) printf("traversing objset %llu, %llu objects, "
4873 "%lu blocks so far\n",
4874 (u_longlong_t)zb->zb_objset,
4875 (u_longlong_t)BP_GET_FILL(bp),
4876 avl_numnodes(t));
4877 }
4878
4879 if (BP_IS_HOLE(bp) || BP_GET_CHECKSUM(bp) == ZIO_CHECKSUM_OFF ||
4880 BP_GET_LEVEL(bp) > 0 || DMU_OT_IS_METADATA(BP_GET_TYPE(bp)))
4881 return (0);
4882
4883 ddt_key_fill(&zdde_search.zdde_key, bp);
4884
4885 zdde = avl_find(t, &zdde_search, &where);
4886
4887 if (zdde == NULL) {
4888 zdde = umem_zalloc(sizeof (*zdde), UMEM_NOFAIL);
4889 zdde->zdde_key = zdde_search.zdde_key;
4890 avl_insert(t, zdde, where);
4891 }
4892
4893 zdde->zdde_ref_blocks += 1;
4894 zdde->zdde_ref_lsize += BP_GET_LSIZE(bp);
4895 zdde->zdde_ref_psize += BP_GET_PSIZE(bp);
4896 zdde->zdde_ref_dsize += bp_get_dsize_sync(spa, bp);
4897
4898 return (0);
4899 }
4900
4901 static void
dump_simulated_ddt(spa_t * spa)4902 dump_simulated_ddt(spa_t *spa)
4903 {
4904 avl_tree_t t;
4905 void *cookie = NULL;
4906 zdb_ddt_entry_t *zdde;
4907 ddt_histogram_t ddh_total;
4908 ddt_stat_t dds_total;
4909
4910 bzero(&ddh_total, sizeof (ddh_total));
4911 bzero(&dds_total, sizeof (dds_total));
4912 avl_create(&t, ddt_entry_compare,
4913 sizeof (zdb_ddt_entry_t), offsetof(zdb_ddt_entry_t, zdde_node));
4914
4915 spa_config_enter(spa, SCL_CONFIG, FTAG, RW_READER);
4916
4917 (void) traverse_pool(spa, 0, TRAVERSE_PRE | TRAVERSE_PREFETCH_METADATA |
4918 TRAVERSE_NO_DECRYPT, zdb_ddt_add_cb, &t);
4919
4920 spa_config_exit(spa, SCL_CONFIG, FTAG);
4921
4922 while ((zdde = avl_destroy_nodes(&t, &cookie)) != NULL) {
4923 ddt_stat_t dds;
4924 uint64_t refcnt = zdde->zdde_ref_blocks;
4925 ASSERT(refcnt != 0);
4926
4927 dds.dds_blocks = zdde->zdde_ref_blocks / refcnt;
4928 dds.dds_lsize = zdde->zdde_ref_lsize / refcnt;
4929 dds.dds_psize = zdde->zdde_ref_psize / refcnt;
4930 dds.dds_dsize = zdde->zdde_ref_dsize / refcnt;
4931
4932 dds.dds_ref_blocks = zdde->zdde_ref_blocks;
4933 dds.dds_ref_lsize = zdde->zdde_ref_lsize;
4934 dds.dds_ref_psize = zdde->zdde_ref_psize;
4935 dds.dds_ref_dsize = zdde->zdde_ref_dsize;
4936
4937 ddt_stat_add(&ddh_total.ddh_stat[highbit64(refcnt) - 1],
4938 &dds, 0);
4939
4940 umem_free(zdde, sizeof (*zdde));
4941 }
4942
4943 avl_destroy(&t);
4944
4945 ddt_histogram_stat(&dds_total, &ddh_total);
4946
4947 (void) printf("Simulated DDT histogram:\n");
4948
4949 zpool_dump_ddt(&dds_total, &ddh_total);
4950
4951 dump_dedup_ratio(&dds_total);
4952 }
4953
4954 static int
verify_device_removal_feature_counts(spa_t * spa)4955 verify_device_removal_feature_counts(spa_t *spa)
4956 {
4957 uint64_t dr_feature_refcount = 0;
4958 uint64_t oc_feature_refcount = 0;
4959 uint64_t indirect_vdev_count = 0;
4960 uint64_t precise_vdev_count = 0;
4961 uint64_t obsolete_counts_object_count = 0;
4962 uint64_t obsolete_sm_count = 0;
4963 uint64_t obsolete_counts_count = 0;
4964 uint64_t scip_count = 0;
4965 uint64_t obsolete_bpobj_count = 0;
4966 int ret = 0;
4967
4968 spa_condensing_indirect_phys_t *scip =
4969 &spa->spa_condensing_indirect_phys;
4970 if (scip->scip_next_mapping_object != 0) {
4971 vdev_t *vd = spa->spa_root_vdev->vdev_child[scip->scip_vdev];
4972 ASSERT(scip->scip_prev_obsolete_sm_object != 0);
4973 ASSERT3P(vd->vdev_ops, ==, &vdev_indirect_ops);
4974
4975 (void) printf("Condensing indirect vdev %llu: new mapping "
4976 "object %llu, prev obsolete sm %llu\n",
4977 (u_longlong_t)scip->scip_vdev,
4978 (u_longlong_t)scip->scip_next_mapping_object,
4979 (u_longlong_t)scip->scip_prev_obsolete_sm_object);
4980 if (scip->scip_prev_obsolete_sm_object != 0) {
4981 space_map_t *prev_obsolete_sm = NULL;
4982 VERIFY0(space_map_open(&prev_obsolete_sm,
4983 spa->spa_meta_objset,
4984 scip->scip_prev_obsolete_sm_object,
4985 0, vd->vdev_asize, 0));
4986 dump_spacemap(spa->spa_meta_objset, prev_obsolete_sm);
4987 (void) printf("\n");
4988 space_map_close(prev_obsolete_sm);
4989 }
4990
4991 scip_count += 2;
4992 }
4993
4994 for (uint64_t i = 0; i < spa->spa_root_vdev->vdev_children; i++) {
4995 vdev_t *vd = spa->spa_root_vdev->vdev_child[i];
4996 vdev_indirect_config_t *vic = &vd->vdev_indirect_config;
4997
4998 if (vic->vic_mapping_object != 0) {
4999 ASSERT(vd->vdev_ops == &vdev_indirect_ops ||
5000 vd->vdev_removing);
5001 indirect_vdev_count++;
5002
5003 if (vd->vdev_indirect_mapping->vim_havecounts) {
5004 obsolete_counts_count++;
5005 }
5006 }
5007 if (vdev_obsolete_counts_are_precise(vd)) {
5008 ASSERT(vic->vic_mapping_object != 0);
5009 precise_vdev_count++;
5010 }
5011 if (vdev_obsolete_sm_object(vd) != 0) {
5012 ASSERT(vic->vic_mapping_object != 0);
5013 obsolete_sm_count++;
5014 }
5015 }
5016
5017 (void) feature_get_refcount(spa,
5018 &spa_feature_table[SPA_FEATURE_DEVICE_REMOVAL],
5019 &dr_feature_refcount);
5020 (void) feature_get_refcount(spa,
5021 &spa_feature_table[SPA_FEATURE_OBSOLETE_COUNTS],
5022 &oc_feature_refcount);
5023
5024 if (dr_feature_refcount != indirect_vdev_count) {
5025 ret = 1;
5026 (void) printf("Number of indirect vdevs (%llu) " \
5027 "does not match feature count (%llu)\n",
5028 (u_longlong_t)indirect_vdev_count,
5029 (u_longlong_t)dr_feature_refcount);
5030 } else {
5031 (void) printf("Verified device_removal feature refcount " \
5032 "of %llu is correct\n",
5033 (u_longlong_t)dr_feature_refcount);
5034 }
5035
5036 if (zap_contains(spa_meta_objset(spa), DMU_POOL_DIRECTORY_OBJECT,
5037 DMU_POOL_OBSOLETE_BPOBJ) == 0) {
5038 obsolete_bpobj_count++;
5039 }
5040
5041
5042 obsolete_counts_object_count = precise_vdev_count;
5043 obsolete_counts_object_count += obsolete_sm_count;
5044 obsolete_counts_object_count += obsolete_counts_count;
5045 obsolete_counts_object_count += scip_count;
5046 obsolete_counts_object_count += obsolete_bpobj_count;
5047 obsolete_counts_object_count += remap_deadlist_count;
5048
5049 if (oc_feature_refcount != obsolete_counts_object_count) {
5050 ret = 1;
5051 (void) printf("Number of obsolete counts objects (%llu) " \
5052 "does not match feature count (%llu)\n",
5053 (u_longlong_t)obsolete_counts_object_count,
5054 (u_longlong_t)oc_feature_refcount);
5055 (void) printf("pv:%llu os:%llu oc:%llu sc:%llu "
5056 "ob:%llu rd:%llu\n",
5057 (u_longlong_t)precise_vdev_count,
5058 (u_longlong_t)obsolete_sm_count,
5059 (u_longlong_t)obsolete_counts_count,
5060 (u_longlong_t)scip_count,
5061 (u_longlong_t)obsolete_bpobj_count,
5062 (u_longlong_t)remap_deadlist_count);
5063 } else {
5064 (void) printf("Verified indirect_refcount feature refcount " \
5065 "of %llu is correct\n",
5066 (u_longlong_t)oc_feature_refcount);
5067 }
5068 return (ret);
5069 }
5070
5071 static void
zdb_set_skip_mmp(char * target)5072 zdb_set_skip_mmp(char *target)
5073 {
5074 spa_t *spa;
5075
5076 /*
5077 * Disable the activity check to allow examination of
5078 * active pools.
5079 */
5080 mutex_enter(&spa_namespace_lock);
5081 if ((spa = spa_lookup(target)) != NULL) {
5082 spa->spa_import_flags |= ZFS_IMPORT_SKIP_MMP;
5083 }
5084 mutex_exit(&spa_namespace_lock);
5085 }
5086
5087 #define BOGUS_SUFFIX "_CHECKPOINTED_UNIVERSE"
5088 /*
5089 * Import the checkpointed state of the pool specified by the target
5090 * parameter as readonly. The function also accepts a pool config
5091 * as an optional parameter, else it attempts to infer the config by
5092 * the name of the target pool.
5093 *
5094 * Note that the checkpointed state's pool name will be the name of
5095 * the original pool with the above suffix appened to it. In addition,
5096 * if the target is not a pool name (e.g. a path to a dataset) then
5097 * the new_path parameter is populated with the updated path to
5098 * reflect the fact that we are looking into the checkpointed state.
5099 *
5100 * The function returns a newly-allocated copy of the name of the
5101 * pool containing the checkpointed state. When this copy is no
5102 * longer needed it should be freed with free(3C). Same thing
5103 * applies to the new_path parameter if allocated.
5104 */
5105 static char *
import_checkpointed_state(char * target,nvlist_t * cfg,char ** new_path)5106 import_checkpointed_state(char *target, nvlist_t *cfg, char **new_path)
5107 {
5108 int error = 0;
5109 char *poolname, *bogus_name;
5110
5111 /* If the target is not a pool, the extract the pool name */
5112 char *path_start = strchr(target, '/');
5113 if (path_start != NULL) {
5114 size_t poolname_len = path_start - target;
5115 poolname = strndup(target, poolname_len);
5116 } else {
5117 poolname = target;
5118 }
5119
5120 if (cfg == NULL) {
5121 zdb_set_skip_mmp(poolname);
5122 error = spa_get_stats(poolname, &cfg, NULL, 0);
5123 if (error != 0) {
5124 fatal("Tried to read config of pool \"%s\" but "
5125 "spa_get_stats() failed with error %d\n",
5126 poolname, error);
5127 }
5128 }
5129
5130 (void) asprintf(&bogus_name, "%s%s", poolname, BOGUS_SUFFIX);
5131 fnvlist_add_string(cfg, ZPOOL_CONFIG_POOL_NAME, bogus_name);
5132
5133 error = spa_import(bogus_name, cfg, NULL,
5134 ZFS_IMPORT_MISSING_LOG | ZFS_IMPORT_CHECKPOINT |
5135 ZFS_IMPORT_SKIP_MMP);
5136 if (error != 0) {
5137 fatal("Tried to import pool \"%s\" but spa_import() failed "
5138 "with error %d\n", bogus_name, error);
5139 }
5140
5141 if (new_path != NULL && path_start != NULL)
5142 (void) asprintf(new_path, "%s%s", bogus_name, path_start);
5143
5144 if (target != poolname)
5145 free(poolname);
5146
5147 return (bogus_name);
5148 }
5149
5150 typedef struct verify_checkpoint_sm_entry_cb_arg {
5151 vdev_t *vcsec_vd;
5152
5153 /* the following fields are only used for printing progress */
5154 uint64_t vcsec_entryid;
5155 uint64_t vcsec_num_entries;
5156 } verify_checkpoint_sm_entry_cb_arg_t;
5157
5158 #define ENTRIES_PER_PROGRESS_UPDATE 10000
5159
5160 static int
verify_checkpoint_sm_entry_cb(space_map_entry_t * sme,void * arg)5161 verify_checkpoint_sm_entry_cb(space_map_entry_t *sme, void *arg)
5162 {
5163 verify_checkpoint_sm_entry_cb_arg_t *vcsec = arg;
5164 vdev_t *vd = vcsec->vcsec_vd;
5165 metaslab_t *ms = vd->vdev_ms[sme->sme_offset >> vd->vdev_ms_shift];
5166 uint64_t end = sme->sme_offset + sme->sme_run;
5167
5168 ASSERT(sme->sme_type == SM_FREE);
5169
5170 if ((vcsec->vcsec_entryid % ENTRIES_PER_PROGRESS_UPDATE) == 0) {
5171 (void) fprintf(stderr,
5172 "\rverifying vdev %llu, space map entry %llu of %llu ...",
5173 (longlong_t)vd->vdev_id,
5174 (longlong_t)vcsec->vcsec_entryid,
5175 (longlong_t)vcsec->vcsec_num_entries);
5176 }
5177 vcsec->vcsec_entryid++;
5178
5179 /*
5180 * See comment in checkpoint_sm_exclude_entry_cb()
5181 */
5182 VERIFY3U(sme->sme_offset, >=, ms->ms_start);
5183 VERIFY3U(end, <=, ms->ms_start + ms->ms_size);
5184
5185 /*
5186 * The entries in the vdev_checkpoint_sm should be marked as
5187 * allocated in the checkpointed state of the pool, therefore
5188 * their respective ms_allocateable trees should not contain them.
5189 */
5190 mutex_enter(&ms->ms_lock);
5191 range_tree_verify_not_present(ms->ms_allocatable,
5192 sme->sme_offset, sme->sme_run);
5193 mutex_exit(&ms->ms_lock);
5194
5195 return (0);
5196 }
5197
5198 /*
5199 * Verify that all segments in the vdev_checkpoint_sm are allocated
5200 * according to the checkpoint's ms_sm (i.e. are not in the checkpoint's
5201 * ms_allocatable).
5202 *
5203 * Do so by comparing the checkpoint space maps (vdev_checkpoint_sm) of
5204 * each vdev in the current state of the pool to the metaslab space maps
5205 * (ms_sm) of the checkpointed state of the pool.
5206 *
5207 * Note that the function changes the state of the ms_allocatable
5208 * trees of the current spa_t. The entries of these ms_allocatable
5209 * trees are cleared out and then repopulated from with the free
5210 * entries of their respective ms_sm space maps.
5211 */
5212 static void
verify_checkpoint_vdev_spacemaps(spa_t * checkpoint,spa_t * current)5213 verify_checkpoint_vdev_spacemaps(spa_t *checkpoint, spa_t *current)
5214 {
5215 vdev_t *ckpoint_rvd = checkpoint->spa_root_vdev;
5216 vdev_t *current_rvd = current->spa_root_vdev;
5217
5218 load_concrete_ms_allocatable_trees(checkpoint, SM_FREE);
5219
5220 for (uint64_t c = 0; c < ckpoint_rvd->vdev_children; c++) {
5221 vdev_t *ckpoint_vd = ckpoint_rvd->vdev_child[c];
5222 vdev_t *current_vd = current_rvd->vdev_child[c];
5223
5224 space_map_t *checkpoint_sm = NULL;
5225 uint64_t checkpoint_sm_obj;
5226
5227 if (ckpoint_vd->vdev_ops == &vdev_indirect_ops) {
5228 /*
5229 * Since we don't allow device removal in a pool
5230 * that has a checkpoint, we expect that all removed
5231 * vdevs were removed from the pool before the
5232 * checkpoint.
5233 */
5234 ASSERT3P(current_vd->vdev_ops, ==, &vdev_indirect_ops);
5235 continue;
5236 }
5237
5238 /*
5239 * If the checkpoint space map doesn't exist, then nothing
5240 * here is checkpointed so there's nothing to verify.
5241 */
5242 if (current_vd->vdev_top_zap == 0 ||
5243 zap_contains(spa_meta_objset(current),
5244 current_vd->vdev_top_zap,
5245 VDEV_TOP_ZAP_POOL_CHECKPOINT_SM) != 0)
5246 continue;
5247
5248 VERIFY0(zap_lookup(spa_meta_objset(current),
5249 current_vd->vdev_top_zap, VDEV_TOP_ZAP_POOL_CHECKPOINT_SM,
5250 sizeof (uint64_t), 1, &checkpoint_sm_obj));
5251
5252 VERIFY0(space_map_open(&checkpoint_sm, spa_meta_objset(current),
5253 checkpoint_sm_obj, 0, current_vd->vdev_asize,
5254 current_vd->vdev_ashift));
5255
5256 verify_checkpoint_sm_entry_cb_arg_t vcsec;
5257 vcsec.vcsec_vd = ckpoint_vd;
5258 vcsec.vcsec_entryid = 0;
5259 vcsec.vcsec_num_entries =
5260 space_map_length(checkpoint_sm) / sizeof (uint64_t);
5261 VERIFY0(space_map_iterate(checkpoint_sm,
5262 space_map_length(checkpoint_sm),
5263 verify_checkpoint_sm_entry_cb, &vcsec));
5264 dump_spacemap(current->spa_meta_objset, checkpoint_sm);
5265 space_map_close(checkpoint_sm);
5266 }
5267
5268 /*
5269 * If we've added vdevs since we took the checkpoint, ensure
5270 * that their checkpoint space maps are empty.
5271 */
5272 if (ckpoint_rvd->vdev_children < current_rvd->vdev_children) {
5273 for (uint64_t c = ckpoint_rvd->vdev_children;
5274 c < current_rvd->vdev_children; c++) {
5275 vdev_t *current_vd = current_rvd->vdev_child[c];
5276 VERIFY3P(current_vd->vdev_checkpoint_sm, ==, NULL);
5277 }
5278 }
5279
5280 /* for cleaner progress output */
5281 (void) fprintf(stderr, "\n");
5282 }
5283
5284 /*
5285 * Verifies that all space that's allocated in the checkpoint is
5286 * still allocated in the current version, by checking that everything
5287 * in checkpoint's ms_allocatable (which is actually allocated, not
5288 * allocatable/free) is not present in current's ms_allocatable.
5289 *
5290 * Note that the function changes the state of the ms_allocatable
5291 * trees of both spas when called. The entries of all ms_allocatable
5292 * trees are cleared out and then repopulated from their respective
5293 * ms_sm space maps. In the checkpointed state we load the allocated
5294 * entries, and in the current state we load the free entries.
5295 */
5296 static void
verify_checkpoint_ms_spacemaps(spa_t * checkpoint,spa_t * current)5297 verify_checkpoint_ms_spacemaps(spa_t *checkpoint, spa_t *current)
5298 {
5299 vdev_t *ckpoint_rvd = checkpoint->spa_root_vdev;
5300 vdev_t *current_rvd = current->spa_root_vdev;
5301
5302 load_concrete_ms_allocatable_trees(checkpoint, SM_ALLOC);
5303 load_concrete_ms_allocatable_trees(current, SM_FREE);
5304
5305 for (uint64_t i = 0; i < ckpoint_rvd->vdev_children; i++) {
5306 vdev_t *ckpoint_vd = ckpoint_rvd->vdev_child[i];
5307 vdev_t *current_vd = current_rvd->vdev_child[i];
5308
5309 if (ckpoint_vd->vdev_ops == &vdev_indirect_ops) {
5310 /*
5311 * See comment in verify_checkpoint_vdev_spacemaps()
5312 */
5313 ASSERT3P(current_vd->vdev_ops, ==, &vdev_indirect_ops);
5314 continue;
5315 }
5316
5317 for (uint64_t m = 0; m < ckpoint_vd->vdev_ms_count; m++) {
5318 metaslab_t *ckpoint_msp = ckpoint_vd->vdev_ms[m];
5319 metaslab_t *current_msp = current_vd->vdev_ms[m];
5320
5321 (void) fprintf(stderr,
5322 "\rverifying vdev %llu of %llu, "
5323 "metaslab %llu of %llu ...",
5324 (longlong_t)current_vd->vdev_id,
5325 (longlong_t)current_rvd->vdev_children,
5326 (longlong_t)current_vd->vdev_ms[m]->ms_id,
5327 (longlong_t)current_vd->vdev_ms_count);
5328
5329 /*
5330 * We walk through the ms_allocatable trees that
5331 * are loaded with the allocated blocks from the
5332 * ms_sm spacemaps of the checkpoint. For each
5333 * one of these ranges we ensure that none of them
5334 * exists in the ms_allocatable trees of the
5335 * current state which are loaded with the ranges
5336 * that are currently free.
5337 *
5338 * This way we ensure that none of the blocks that
5339 * are part of the checkpoint were freed by mistake.
5340 */
5341 range_tree_walk(ckpoint_msp->ms_allocatable,
5342 (range_tree_func_t *)range_tree_verify_not_present,
5343 current_msp->ms_allocatable);
5344 }
5345 }
5346
5347 /* for cleaner progress output */
5348 (void) fprintf(stderr, "\n");
5349 }
5350
5351 static void
verify_checkpoint_blocks(spa_t * spa)5352 verify_checkpoint_blocks(spa_t *spa)
5353 {
5354 ASSERT(!dump_opt['L']);
5355
5356 spa_t *checkpoint_spa;
5357 char *checkpoint_pool;
5358 nvlist_t *config = NULL;
5359 int error = 0;
5360
5361 /*
5362 * We import the checkpointed state of the pool (under a different
5363 * name) so we can do verification on it against the current state
5364 * of the pool.
5365 */
5366 checkpoint_pool = import_checkpointed_state(spa->spa_name, config,
5367 NULL);
5368 ASSERT(strcmp(spa->spa_name, checkpoint_pool) != 0);
5369
5370 error = spa_open(checkpoint_pool, &checkpoint_spa, FTAG);
5371 if (error != 0) {
5372 fatal("Tried to open pool \"%s\" but spa_open() failed with "
5373 "error %d\n", checkpoint_pool, error);
5374 }
5375
5376 /*
5377 * Ensure that ranges in the checkpoint space maps of each vdev
5378 * are allocated according to the checkpointed state's metaslab
5379 * space maps.
5380 */
5381 verify_checkpoint_vdev_spacemaps(checkpoint_spa, spa);
5382
5383 /*
5384 * Ensure that allocated ranges in the checkpoint's metaslab
5385 * space maps remain allocated in the metaslab space maps of
5386 * the current state.
5387 */
5388 verify_checkpoint_ms_spacemaps(checkpoint_spa, spa);
5389
5390 /*
5391 * Once we are done, we get rid of the checkpointed state.
5392 */
5393 spa_close(checkpoint_spa, FTAG);
5394 free(checkpoint_pool);
5395 }
5396
5397 static void
dump_leftover_checkpoint_blocks(spa_t * spa)5398 dump_leftover_checkpoint_blocks(spa_t *spa)
5399 {
5400 vdev_t *rvd = spa->spa_root_vdev;
5401
5402 for (uint64_t i = 0; i < rvd->vdev_children; i++) {
5403 vdev_t *vd = rvd->vdev_child[i];
5404
5405 space_map_t *checkpoint_sm = NULL;
5406 uint64_t checkpoint_sm_obj;
5407
5408 if (vd->vdev_top_zap == 0)
5409 continue;
5410
5411 if (zap_contains(spa_meta_objset(spa), vd->vdev_top_zap,
5412 VDEV_TOP_ZAP_POOL_CHECKPOINT_SM) != 0)
5413 continue;
5414
5415 VERIFY0(zap_lookup(spa_meta_objset(spa), vd->vdev_top_zap,
5416 VDEV_TOP_ZAP_POOL_CHECKPOINT_SM,
5417 sizeof (uint64_t), 1, &checkpoint_sm_obj));
5418
5419 VERIFY0(space_map_open(&checkpoint_sm, spa_meta_objset(spa),
5420 checkpoint_sm_obj, 0, vd->vdev_asize, vd->vdev_ashift));
5421 dump_spacemap(spa->spa_meta_objset, checkpoint_sm);
5422 space_map_close(checkpoint_sm);
5423 }
5424 }
5425
5426 static int
verify_checkpoint(spa_t * spa)5427 verify_checkpoint(spa_t *spa)
5428 {
5429 uberblock_t checkpoint;
5430 int error;
5431
5432 if (!spa_feature_is_active(spa, SPA_FEATURE_POOL_CHECKPOINT))
5433 return (0);
5434
5435 error = zap_lookup(spa->spa_meta_objset, DMU_POOL_DIRECTORY_OBJECT,
5436 DMU_POOL_ZPOOL_CHECKPOINT, sizeof (uint64_t),
5437 sizeof (uberblock_t) / sizeof (uint64_t), &checkpoint);
5438
5439 if (error == ENOENT && !dump_opt['L']) {
5440 /*
5441 * If the feature is active but the uberblock is missing
5442 * then we must be in the middle of discarding the
5443 * checkpoint.
5444 */
5445 (void) printf("\nPartially discarded checkpoint "
5446 "state found:\n");
5447 dump_leftover_checkpoint_blocks(spa);
5448 return (0);
5449 } else if (error != 0) {
5450 (void) printf("lookup error %d when looking for "
5451 "checkpointed uberblock in MOS\n", error);
5452 return (error);
5453 }
5454 dump_uberblock(&checkpoint, "\nCheckpointed uberblock found:\n", "\n");
5455
5456 if (checkpoint.ub_checkpoint_txg == 0) {
5457 (void) printf("\nub_checkpoint_txg not set in checkpointed "
5458 "uberblock\n");
5459 error = 3;
5460 }
5461
5462 if (error == 0 && !dump_opt['L'])
5463 verify_checkpoint_blocks(spa);
5464
5465 return (error);
5466 }
5467
5468 /* ARGSUSED */
5469 static void
mos_leaks_cb(void * arg,uint64_t start,uint64_t size)5470 mos_leaks_cb(void *arg, uint64_t start, uint64_t size)
5471 {
5472 for (uint64_t i = start; i < size; i++) {
5473 (void) printf("MOS object %llu referenced but not allocated\n",
5474 (u_longlong_t)i);
5475 }
5476 }
5477
5478 static range_tree_t *mos_refd_objs;
5479
5480 static void
mos_obj_refd(uint64_t obj)5481 mos_obj_refd(uint64_t obj)
5482 {
5483 if (obj != 0 && mos_refd_objs != NULL)
5484 range_tree_add(mos_refd_objs, obj, 1);
5485 }
5486
5487 static void
mos_leak_vdev_top_zap(vdev_t * vd)5488 mos_leak_vdev_top_zap(vdev_t *vd)
5489 {
5490 uint64_t ms_flush_data_obj;
5491
5492 int error = zap_lookup(spa_meta_objset(vd->vdev_spa),
5493 vd->vdev_top_zap, VDEV_TOP_ZAP_MS_UNFLUSHED_PHYS_TXGS,
5494 sizeof (ms_flush_data_obj), 1, &ms_flush_data_obj);
5495 if (error == ENOENT)
5496 return;
5497 ASSERT0(error);
5498
5499 mos_obj_refd(ms_flush_data_obj);
5500 }
5501
5502 static void
mos_leak_vdev(vdev_t * vd)5503 mos_leak_vdev(vdev_t *vd)
5504 {
5505 mos_obj_refd(vd->vdev_dtl_object);
5506 mos_obj_refd(vd->vdev_ms_array);
5507 mos_obj_refd(vd->vdev_indirect_config.vic_births_object);
5508 mos_obj_refd(vd->vdev_indirect_config.vic_mapping_object);
5509 mos_obj_refd(vd->vdev_leaf_zap);
5510 if (vd->vdev_checkpoint_sm != NULL)
5511 mos_obj_refd(vd->vdev_checkpoint_sm->sm_object);
5512 if (vd->vdev_indirect_mapping != NULL) {
5513 mos_obj_refd(vd->vdev_indirect_mapping->
5514 vim_phys->vimp_counts_object);
5515 }
5516 if (vd->vdev_obsolete_sm != NULL)
5517 mos_obj_refd(vd->vdev_obsolete_sm->sm_object);
5518
5519 for (uint64_t m = 0; m < vd->vdev_ms_count; m++) {
5520 metaslab_t *ms = vd->vdev_ms[m];
5521 mos_obj_refd(space_map_object(ms->ms_sm));
5522 }
5523
5524 if (vd->vdev_top_zap != 0) {
5525 mos_obj_refd(vd->vdev_top_zap);
5526 mos_leak_vdev_top_zap(vd);
5527 }
5528
5529 for (uint64_t c = 0; c < vd->vdev_children; c++) {
5530 mos_leak_vdev(vd->vdev_child[c]);
5531 }
5532 }
5533
5534 static void
mos_leak_log_spacemaps(spa_t * spa)5535 mos_leak_log_spacemaps(spa_t *spa)
5536 {
5537 uint64_t spacemap_zap;
5538
5539 int error = zap_lookup(spa_meta_objset(spa),
5540 DMU_POOL_DIRECTORY_OBJECT, DMU_POOL_LOG_SPACEMAP_ZAP,
5541 sizeof (spacemap_zap), 1, &spacemap_zap);
5542 if (error == ENOENT)
5543 return;
5544 ASSERT0(error);
5545
5546 mos_obj_refd(spacemap_zap);
5547 for (spa_log_sm_t *sls = avl_first(&spa->spa_sm_logs_by_txg);
5548 sls; sls = AVL_NEXT(&spa->spa_sm_logs_by_txg, sls))
5549 mos_obj_refd(sls->sls_sm_obj);
5550 }
5551
5552 static int
dump_mos_leaks(spa_t * spa)5553 dump_mos_leaks(spa_t *spa)
5554 {
5555 int rv = 0;
5556 objset_t *mos = spa->spa_meta_objset;
5557 dsl_pool_t *dp = spa->spa_dsl_pool;
5558
5559 /* Visit and mark all referenced objects in the MOS */
5560
5561 mos_obj_refd(DMU_POOL_DIRECTORY_OBJECT);
5562 mos_obj_refd(spa->spa_pool_props_object);
5563 mos_obj_refd(spa->spa_config_object);
5564 mos_obj_refd(spa->spa_ddt_stat_object);
5565 mos_obj_refd(spa->spa_feat_desc_obj);
5566 mos_obj_refd(spa->spa_feat_enabled_txg_obj);
5567 mos_obj_refd(spa->spa_feat_for_read_obj);
5568 mos_obj_refd(spa->spa_feat_for_write_obj);
5569 mos_obj_refd(spa->spa_history);
5570 mos_obj_refd(spa->spa_errlog_last);
5571 mos_obj_refd(spa->spa_errlog_scrub);
5572 mos_obj_refd(spa->spa_all_vdev_zaps);
5573 mos_obj_refd(spa->spa_dsl_pool->dp_bptree_obj);
5574 mos_obj_refd(spa->spa_dsl_pool->dp_tmp_userrefs_obj);
5575 mos_obj_refd(spa->spa_dsl_pool->dp_scan->scn_phys.scn_queue_obj);
5576 bpobj_count_refd(&spa->spa_deferred_bpobj);
5577 mos_obj_refd(dp->dp_empty_bpobj);
5578 bpobj_count_refd(&dp->dp_obsolete_bpobj);
5579 bpobj_count_refd(&dp->dp_free_bpobj);
5580 mos_obj_refd(spa->spa_l2cache.sav_object);
5581 mos_obj_refd(spa->spa_spares.sav_object);
5582
5583 if (spa->spa_syncing_log_sm != NULL)
5584 mos_obj_refd(spa->spa_syncing_log_sm->sm_object);
5585 mos_leak_log_spacemaps(spa);
5586
5587 mos_obj_refd(spa->spa_condensing_indirect_phys.
5588 scip_next_mapping_object);
5589 mos_obj_refd(spa->spa_condensing_indirect_phys.
5590 scip_prev_obsolete_sm_object);
5591 if (spa->spa_condensing_indirect_phys.scip_next_mapping_object != 0) {
5592 vdev_indirect_mapping_t *vim =
5593 vdev_indirect_mapping_open(mos,
5594 spa->spa_condensing_indirect_phys.scip_next_mapping_object);
5595 mos_obj_refd(vim->vim_phys->vimp_counts_object);
5596 vdev_indirect_mapping_close(vim);
5597 }
5598
5599 if (dp->dp_origin_snap != NULL) {
5600 dsl_dataset_t *ds;
5601
5602 dsl_pool_config_enter(dp, FTAG);
5603 VERIFY0(dsl_dataset_hold_obj(dp,
5604 dsl_dataset_phys(dp->dp_origin_snap)->ds_next_snap_obj,
5605 FTAG, &ds));
5606 count_ds_mos_objects(ds);
5607 dump_deadlist(&ds->ds_deadlist);
5608 dsl_dataset_rele(ds, FTAG);
5609 dsl_pool_config_exit(dp, FTAG);
5610
5611 count_ds_mos_objects(dp->dp_origin_snap);
5612 dump_deadlist(&dp->dp_origin_snap->ds_deadlist);
5613 }
5614 count_dir_mos_objects(dp->dp_mos_dir);
5615 if (dp->dp_free_dir != NULL)
5616 count_dir_mos_objects(dp->dp_free_dir);
5617 if (dp->dp_leak_dir != NULL)
5618 count_dir_mos_objects(dp->dp_leak_dir);
5619
5620 mos_leak_vdev(spa->spa_root_vdev);
5621
5622 for (uint64_t class = 0; class < DDT_CLASSES; class++) {
5623 for (uint64_t type = 0; type < DDT_TYPES; type++) {
5624 for (uint64_t cksum = 0;
5625 cksum < ZIO_CHECKSUM_FUNCTIONS; cksum++) {
5626 ddt_t *ddt = spa->spa_ddt[cksum];
5627 mos_obj_refd(ddt->ddt_object[type][class]);
5628 }
5629 }
5630 }
5631
5632 /*
5633 * Visit all allocated objects and make sure they are referenced.
5634 */
5635 uint64_t object = 0;
5636 while (dmu_object_next(mos, &object, B_FALSE, 0) == 0) {
5637 if (range_tree_contains(mos_refd_objs, object, 1)) {
5638 range_tree_remove(mos_refd_objs, object, 1);
5639 } else {
5640 dmu_object_info_t doi;
5641 const char *name;
5642 dmu_object_info(mos, object, &doi);
5643 if (doi.doi_type & DMU_OT_NEWTYPE) {
5644 dmu_object_byteswap_t bswap =
5645 DMU_OT_BYTESWAP(doi.doi_type);
5646 name = dmu_ot_byteswap[bswap].ob_name;
5647 } else {
5648 name = dmu_ot[doi.doi_type].ot_name;
5649 }
5650
5651 (void) printf("MOS object %llu (%s) leaked\n",
5652 (u_longlong_t)object, name);
5653 rv = 2;
5654 }
5655 }
5656 (void) range_tree_walk(mos_refd_objs, mos_leaks_cb, NULL);
5657 if (!range_tree_is_empty(mos_refd_objs))
5658 rv = 2;
5659 range_tree_vacate(mos_refd_objs, NULL, NULL);
5660 range_tree_destroy(mos_refd_objs);
5661 return (rv);
5662 }
5663
5664 typedef struct log_sm_obsolete_stats_arg {
5665 uint64_t lsos_current_txg;
5666
5667 uint64_t lsos_total_entries;
5668 uint64_t lsos_valid_entries;
5669
5670 uint64_t lsos_sm_entries;
5671 uint64_t lsos_valid_sm_entries;
5672 } log_sm_obsolete_stats_arg_t;
5673
5674 static int
log_spacemap_obsolete_stats_cb(spa_t * spa,space_map_entry_t * sme,uint64_t txg,void * arg)5675 log_spacemap_obsolete_stats_cb(spa_t *spa, space_map_entry_t *sme,
5676 uint64_t txg, void *arg)
5677 {
5678 log_sm_obsolete_stats_arg_t *lsos = arg;
5679 uint64_t offset = sme->sme_offset;
5680 uint64_t vdev_id = sme->sme_vdev;
5681
5682 if (lsos->lsos_current_txg == 0) {
5683 /* this is the first log */
5684 lsos->lsos_current_txg = txg;
5685 } else if (lsos->lsos_current_txg < txg) {
5686 /* we just changed log - print stats and reset */
5687 (void) printf("%-8llu valid entries out of %-8llu - txg %llu\n",
5688 (u_longlong_t)lsos->lsos_valid_sm_entries,
5689 (u_longlong_t)lsos->lsos_sm_entries,
5690 (u_longlong_t)lsos->lsos_current_txg);
5691 lsos->lsos_valid_sm_entries = 0;
5692 lsos->lsos_sm_entries = 0;
5693 lsos->lsos_current_txg = txg;
5694 }
5695 ASSERT3U(lsos->lsos_current_txg, ==, txg);
5696
5697 lsos->lsos_sm_entries++;
5698 lsos->lsos_total_entries++;
5699
5700 vdev_t *vd = vdev_lookup_top(spa, vdev_id);
5701 if (!vdev_is_concrete(vd))
5702 return (0);
5703
5704 metaslab_t *ms = vd->vdev_ms[offset >> vd->vdev_ms_shift];
5705 ASSERT(sme->sme_type == SM_ALLOC || sme->sme_type == SM_FREE);
5706
5707 if (txg < metaslab_unflushed_txg(ms))
5708 return (0);
5709 lsos->lsos_valid_sm_entries++;
5710 lsos->lsos_valid_entries++;
5711 return (0);
5712 }
5713
5714 static void
dump_log_spacemap_obsolete_stats(spa_t * spa)5715 dump_log_spacemap_obsolete_stats(spa_t *spa)
5716 {
5717 if (!spa_feature_is_active(spa, SPA_FEATURE_LOG_SPACEMAP))
5718 return;
5719
5720 log_sm_obsolete_stats_arg_t lsos;
5721 bzero(&lsos, sizeof (lsos));
5722
5723 (void) printf("Log Space Map Obsolete Entry Statistics:\n");
5724
5725 iterate_through_spacemap_logs(spa,
5726 log_spacemap_obsolete_stats_cb, &lsos);
5727
5728 /* print stats for latest log */
5729 (void) printf("%-8llu valid entries out of %-8llu - txg %llu\n",
5730 (u_longlong_t)lsos.lsos_valid_sm_entries,
5731 (u_longlong_t)lsos.lsos_sm_entries,
5732 (u_longlong_t)lsos.lsos_current_txg);
5733
5734 (void) printf("%-8llu valid entries out of %-8llu - total\n\n",
5735 (u_longlong_t)lsos.lsos_valid_entries,
5736 (u_longlong_t)lsos.lsos_total_entries);
5737 }
5738
5739 static void
dump_zpool(spa_t * spa)5740 dump_zpool(spa_t *spa)
5741 {
5742 dsl_pool_t *dp = spa_get_dsl(spa);
5743 int rc = 0;
5744
5745 if (dump_opt['S']) {
5746 dump_simulated_ddt(spa);
5747 return;
5748 }
5749
5750 if (!dump_opt['e'] && dump_opt['C'] > 1) {
5751 (void) printf("\nCached configuration:\n");
5752 dump_nvlist(spa->spa_config, 8);
5753 }
5754
5755 if (dump_opt['C'])
5756 dump_config(spa);
5757
5758 if (dump_opt['u'])
5759 dump_uberblock(&spa->spa_uberblock, "\nUberblock:\n", "\n");
5760
5761 if (dump_opt['D'])
5762 dump_all_ddts(spa);
5763
5764 if (dump_opt['d'] > 2 || dump_opt['m'])
5765 dump_metaslabs(spa);
5766 if (dump_opt['M'])
5767 dump_metaslab_groups(spa);
5768 if (dump_opt['d'] > 2 || dump_opt['m']) {
5769 dump_log_spacemaps(spa);
5770 dump_log_spacemap_obsolete_stats(spa);
5771 }
5772
5773 if (dump_opt['d'] || dump_opt['i']) {
5774 mos_refd_objs = range_tree_create(NULL, RANGE_SEG64, NULL, 0,
5775 0);
5776 dump_dir(dp->dp_meta_objset);
5777
5778 if (dump_opt['d'] >= 3) {
5779 dsl_pool_t *dp = spa->spa_dsl_pool;
5780 dump_full_bpobj(&spa->spa_deferred_bpobj,
5781 "Deferred frees", 0);
5782 if (spa_version(spa) >= SPA_VERSION_DEADLISTS) {
5783 dump_full_bpobj(&dp->dp_free_bpobj,
5784 "Pool snapshot frees", 0);
5785 }
5786 if (bpobj_is_open(&dp->dp_obsolete_bpobj)) {
5787 ASSERT(spa_feature_is_enabled(spa,
5788 SPA_FEATURE_DEVICE_REMOVAL));
5789 dump_full_bpobj(&dp->dp_obsolete_bpobj,
5790 "Pool obsolete blocks", 0);
5791 }
5792
5793 if (spa_feature_is_active(spa,
5794 SPA_FEATURE_ASYNC_DESTROY)) {
5795 dump_bptree(spa->spa_meta_objset,
5796 dp->dp_bptree_obj,
5797 "Pool dataset frees");
5798 }
5799 dump_dtl(spa->spa_root_vdev, 0);
5800 }
5801 (void) dmu_objset_find(spa_name(spa), dump_one_dir,
5802 NULL, DS_FIND_SNAPSHOTS | DS_FIND_CHILDREN);
5803
5804 if (rc == 0 && !dump_opt['L'])
5805 rc = dump_mos_leaks(spa);
5806
5807 for (spa_feature_t f = 0; f < SPA_FEATURES; f++) {
5808 uint64_t refcount;
5809
5810 if (!(spa_feature_table[f].fi_flags &
5811 ZFEATURE_FLAG_PER_DATASET) ||
5812 !spa_feature_is_enabled(spa, f)) {
5813 ASSERT0(dataset_feature_count[f]);
5814 continue;
5815 }
5816 (void) feature_get_refcount(spa,
5817 &spa_feature_table[f], &refcount);
5818 if (dataset_feature_count[f] != refcount) {
5819 (void) printf("%s feature refcount mismatch: "
5820 "%lld datasets != %lld refcount\n",
5821 spa_feature_table[f].fi_uname,
5822 (longlong_t)dataset_feature_count[f],
5823 (longlong_t)refcount);
5824 rc = 2;
5825 } else {
5826 (void) printf("Verified %s feature refcount "
5827 "of %llu is correct\n",
5828 spa_feature_table[f].fi_uname,
5829 (longlong_t)refcount);
5830 }
5831 }
5832
5833 if (rc == 0)
5834 rc = verify_device_removal_feature_counts(spa);
5835 }
5836
5837 if (rc == 0 && (dump_opt['b'] || dump_opt['c']))
5838 rc = dump_block_stats(spa);
5839
5840 if (rc == 0)
5841 rc = verify_spacemap_refcounts(spa);
5842
5843 if (dump_opt['s'])
5844 show_pool_stats(spa);
5845
5846 if (dump_opt['h'])
5847 dump_history(spa);
5848
5849 if (rc == 0)
5850 rc = verify_checkpoint(spa);
5851
5852 if (rc != 0) {
5853 dump_debug_buffer();
5854 exit(rc);
5855 }
5856 }
5857
5858 #define ZDB_FLAG_CHECKSUM 0x0001
5859 #define ZDB_FLAG_DECOMPRESS 0x0002
5860 #define ZDB_FLAG_BSWAP 0x0004
5861 #define ZDB_FLAG_GBH 0x0008
5862 #define ZDB_FLAG_INDIRECT 0x0010
5863 #define ZDB_FLAG_PHYS 0x0020
5864 #define ZDB_FLAG_RAW 0x0040
5865 #define ZDB_FLAG_PRINT_BLKPTR 0x0080
5866
5867 static int flagbits[256];
5868
5869 static void
zdb_print_blkptr(blkptr_t * bp,int flags)5870 zdb_print_blkptr(blkptr_t *bp, int flags)
5871 {
5872 char blkbuf[BP_SPRINTF_LEN];
5873
5874 if (flags & ZDB_FLAG_BSWAP)
5875 byteswap_uint64_array((void *)bp, sizeof (blkptr_t));
5876
5877 snprintf_blkptr(blkbuf, sizeof (blkbuf), bp);
5878 (void) printf("%s\n", blkbuf);
5879 }
5880
5881 static void
zdb_dump_indirect(blkptr_t * bp,int nbps,int flags)5882 zdb_dump_indirect(blkptr_t *bp, int nbps, int flags)
5883 {
5884 int i;
5885
5886 for (i = 0; i < nbps; i++)
5887 zdb_print_blkptr(&bp[i], flags);
5888 }
5889
5890 static void
zdb_dump_gbh(void * buf,int flags)5891 zdb_dump_gbh(void *buf, int flags)
5892 {
5893 zdb_dump_indirect((blkptr_t *)buf, SPA_GBH_NBLKPTRS, flags);
5894 }
5895
5896 static void
zdb_dump_block_raw(void * buf,uint64_t size,int flags)5897 zdb_dump_block_raw(void *buf, uint64_t size, int flags)
5898 {
5899 if (flags & ZDB_FLAG_BSWAP)
5900 byteswap_uint64_array(buf, size);
5901 (void) write(1, buf, size);
5902 }
5903
5904 static void
zdb_dump_block(char * label,void * buf,uint64_t size,int flags)5905 zdb_dump_block(char *label, void *buf, uint64_t size, int flags)
5906 {
5907 uint64_t *d = (uint64_t *)buf;
5908 unsigned nwords = size / sizeof (uint64_t);
5909 int do_bswap = !!(flags & ZDB_FLAG_BSWAP);
5910 unsigned i, j;
5911 const char *hdr;
5912 char *c;
5913
5914
5915 if (do_bswap)
5916 hdr = " 7 6 5 4 3 2 1 0 f e d c b a 9 8";
5917 else
5918 hdr = " 0 1 2 3 4 5 6 7 8 9 a b c d e f";
5919
5920 (void) printf("\n%s\n%6s %s 0123456789abcdef\n", label, "", hdr);
5921
5922 for (i = 0; i < nwords; i += 2) {
5923 (void) printf("%06llx: %016llx %016llx ",
5924 (u_longlong_t)(i * sizeof (uint64_t)),
5925 (u_longlong_t)(do_bswap ? BSWAP_64(d[i]) : d[i]),
5926 (u_longlong_t)(do_bswap ? BSWAP_64(d[i + 1]) : d[i + 1]));
5927
5928 c = (char *)&d[i];
5929 for (j = 0; j < 2 * sizeof (uint64_t); j++)
5930 (void) printf("%c", isprint(c[j]) ? c[j] : '.');
5931 (void) printf("\n");
5932 }
5933 }
5934
5935 /*
5936 * There are two acceptable formats:
5937 * leaf_name - For example: c1t0d0 or /tmp/ztest.0a
5938 * child[.child]* - For example: 0.1.1
5939 *
5940 * The second form can be used to specify arbitrary vdevs anywhere
5941 * in the heirarchy. For example, in a pool with a mirror of
5942 * RAID-Zs, you can specify either RAID-Z vdev with 0.0 or 0.1 .
5943 */
5944 static vdev_t *
zdb_vdev_lookup(vdev_t * vdev,const char * path)5945 zdb_vdev_lookup(vdev_t *vdev, const char *path)
5946 {
5947 char *s, *p, *q;
5948 unsigned i;
5949
5950 if (vdev == NULL)
5951 return (NULL);
5952
5953 /* First, assume the x.x.x.x format */
5954 i = strtoul(path, &s, 10);
5955 if (s == path || (s && *s != '.' && *s != '\0'))
5956 goto name;
5957 if (i >= vdev->vdev_children)
5958 return (NULL);
5959
5960 vdev = vdev->vdev_child[i];
5961 if (*s == '\0')
5962 return (vdev);
5963 return (zdb_vdev_lookup(vdev, s+1));
5964
5965 name:
5966 for (i = 0; i < vdev->vdev_children; i++) {
5967 vdev_t *vc = vdev->vdev_child[i];
5968
5969 if (vc->vdev_path == NULL) {
5970 vc = zdb_vdev_lookup(vc, path);
5971 if (vc == NULL)
5972 continue;
5973 else
5974 return (vc);
5975 }
5976
5977 p = strrchr(vc->vdev_path, '/');
5978 p = p ? p + 1 : vc->vdev_path;
5979 q = &vc->vdev_path[strlen(vc->vdev_path) - 2];
5980
5981 if (strcmp(vc->vdev_path, path) == 0)
5982 return (vc);
5983 if (strcmp(p, path) == 0)
5984 return (vc);
5985 if (strcmp(q, "s0") == 0 && strncmp(p, path, q - p) == 0)
5986 return (vc);
5987 }
5988
5989 return (NULL);
5990 }
5991
5992 /* ARGSUSED */
5993 static int
random_get_pseudo_bytes_cb(void * buf,size_t len,void * unused)5994 random_get_pseudo_bytes_cb(void *buf, size_t len, void *unused)
5995 {
5996 return (random_get_pseudo_bytes(buf, len));
5997 }
5998
5999 /*
6000 * Read a block from a pool and print it out. The syntax of the
6001 * block descriptor is:
6002 *
6003 * pool:vdev_specifier:offset:size[:flags]
6004 *
6005 * pool - The name of the pool you wish to read from
6006 * vdev_specifier - Which vdev (see comment for zdb_vdev_lookup)
6007 * offset - offset, in hex, in bytes
6008 * size - Amount of data to read, in hex, in bytes
6009 * flags - A string of characters specifying options
6010 * b: Decode a blkptr at given offset within block
6011 * *c: Calculate and display checksums
6012 * d: Decompress data before dumping
6013 * e: Byteswap data before dumping
6014 * g: Display data as a gang block header
6015 * i: Display as an indirect block
6016 * p: Do I/O to physical offset
6017 * r: Dump raw data to stdout
6018 *
6019 * * = not yet implemented
6020 */
6021 static void
zdb_read_block(char * thing,spa_t * spa)6022 zdb_read_block(char *thing, spa_t *spa)
6023 {
6024 blkptr_t blk, *bp = &blk;
6025 dva_t *dva = bp->blk_dva;
6026 int flags = 0;
6027 uint64_t offset = 0, size = 0, psize = 0, lsize = 0, blkptr_offset = 0;
6028 zio_t *zio;
6029 vdev_t *vd;
6030 abd_t *pabd;
6031 void *lbuf, *buf;
6032 const char *s, *vdev;
6033 char *p, *dup, *flagstr;
6034 int i, error;
6035
6036 dup = strdup(thing);
6037 s = strtok(dup, ":");
6038 vdev = s ? s : "";
6039 s = strtok(NULL, ":");
6040 offset = strtoull(s ? s : "", NULL, 16);
6041 s = strtok(NULL, ":");
6042 size = strtoull(s ? s : "", NULL, 16);
6043 s = strtok(NULL, ":");
6044 if (s)
6045 flagstr = strdup(s);
6046 else
6047 flagstr = strdup("");
6048
6049 s = NULL;
6050 if (size == 0)
6051 s = "size must not be zero";
6052 if (!IS_P2ALIGNED(size, DEV_BSIZE))
6053 s = "size must be a multiple of sector size";
6054 if (!IS_P2ALIGNED(offset, DEV_BSIZE))
6055 s = "offset must be a multiple of sector size";
6056 if (s) {
6057 (void) printf("Invalid block specifier: %s - %s\n", thing, s);
6058 free(dup);
6059 return;
6060 }
6061
6062 for (s = strtok(flagstr, ":"); s; s = strtok(NULL, ":")) {
6063 for (i = 0; flagstr[i]; i++) {
6064 int bit = flagbits[(uchar_t)flagstr[i]];
6065
6066 if (bit == 0) {
6067 (void) printf("***Invalid flag: %c\n",
6068 flagstr[i]);
6069 continue;
6070 }
6071 flags |= bit;
6072
6073 /* If it's not something with an argument, keep going */
6074 if ((bit & (ZDB_FLAG_CHECKSUM |
6075 ZDB_FLAG_PRINT_BLKPTR)) == 0)
6076 continue;
6077
6078 p = &flagstr[i + 1];
6079 if (bit == ZDB_FLAG_PRINT_BLKPTR)
6080 blkptr_offset = strtoull(p, &p, 16);
6081 if (*p != ':' && *p != '\0') {
6082 (void) printf("***Invalid flag arg: '%s'\n", s);
6083 free(dup);
6084 return;
6085 }
6086 }
6087 }
6088 free(flagstr);
6089
6090 vd = zdb_vdev_lookup(spa->spa_root_vdev, vdev);
6091 if (vd == NULL) {
6092 (void) printf("***Invalid vdev: %s\n", vdev);
6093 free(dup);
6094 return;
6095 } else {
6096 if (vd->vdev_path)
6097 (void) fprintf(stderr, "Found vdev: %s\n",
6098 vd->vdev_path);
6099 else
6100 (void) fprintf(stderr, "Found vdev type: %s\n",
6101 vd->vdev_ops->vdev_op_type);
6102 }
6103
6104 psize = size;
6105 lsize = size;
6106
6107 pabd = abd_alloc_linear(SPA_MAXBLOCKSIZE, B_FALSE);
6108 lbuf = umem_alloc(SPA_MAXBLOCKSIZE, UMEM_NOFAIL);
6109
6110 BP_ZERO(bp);
6111
6112 DVA_SET_VDEV(&dva[0], vd->vdev_id);
6113 DVA_SET_OFFSET(&dva[0], offset);
6114 DVA_SET_GANG(&dva[0], !!(flags & ZDB_FLAG_GBH));
6115 DVA_SET_ASIZE(&dva[0], vdev_psize_to_asize(vd, psize));
6116
6117 BP_SET_BIRTH(bp, TXG_INITIAL, TXG_INITIAL);
6118
6119 BP_SET_LSIZE(bp, lsize);
6120 BP_SET_PSIZE(bp, psize);
6121 BP_SET_COMPRESS(bp, ZIO_COMPRESS_OFF);
6122 BP_SET_CHECKSUM(bp, ZIO_CHECKSUM_OFF);
6123 BP_SET_TYPE(bp, DMU_OT_NONE);
6124 BP_SET_LEVEL(bp, 0);
6125 BP_SET_DEDUP(bp, 0);
6126 BP_SET_BYTEORDER(bp, ZFS_HOST_BYTEORDER);
6127
6128 spa_config_enter(spa, SCL_STATE, FTAG, RW_READER);
6129 zio = zio_root(spa, NULL, NULL, 0);
6130
6131 if (vd == vd->vdev_top) {
6132 /*
6133 * Treat this as a normal block read.
6134 */
6135 zio_nowait(zio_read(zio, spa, bp, pabd, psize, NULL, NULL,
6136 ZIO_PRIORITY_SYNC_READ,
6137 ZIO_FLAG_CANFAIL | ZIO_FLAG_RAW, NULL));
6138 } else {
6139 /*
6140 * Treat this as a vdev child I/O.
6141 */
6142 zio_nowait(zio_vdev_child_io(zio, bp, vd, offset, pabd,
6143 psize, ZIO_TYPE_READ, ZIO_PRIORITY_SYNC_READ,
6144 ZIO_FLAG_DONT_CACHE | ZIO_FLAG_DONT_QUEUE |
6145 ZIO_FLAG_DONT_PROPAGATE | ZIO_FLAG_DONT_RETRY |
6146 ZIO_FLAG_CANFAIL | ZIO_FLAG_RAW | ZIO_FLAG_OPTIONAL,
6147 NULL, NULL));
6148 }
6149
6150 error = zio_wait(zio);
6151 spa_config_exit(spa, SCL_STATE, FTAG);
6152
6153 if (error) {
6154 (void) printf("Read of %s failed, error: %d\n", thing, error);
6155 goto out;
6156 }
6157
6158 if (flags & ZDB_FLAG_DECOMPRESS) {
6159 /*
6160 * We don't know how the data was compressed, so just try
6161 * every decompress function at every inflated blocksize.
6162 */
6163 enum zio_compress c;
6164 void *pbuf2 = umem_alloc(SPA_MAXBLOCKSIZE, UMEM_NOFAIL);
6165 void *lbuf2 = umem_alloc(SPA_MAXBLOCKSIZE, UMEM_NOFAIL);
6166
6167 abd_copy_to_buf(pbuf2, pabd, psize);
6168
6169 VERIFY0(abd_iterate_func(pabd, psize, SPA_MAXBLOCKSIZE - psize,
6170 random_get_pseudo_bytes_cb, NULL));
6171
6172 VERIFY0(random_get_pseudo_bytes((uint8_t *)pbuf2 + psize,
6173 SPA_MAXBLOCKSIZE - psize));
6174
6175 for (lsize = SPA_MAXBLOCKSIZE; lsize > psize;
6176 lsize -= SPA_MINBLOCKSIZE) {
6177 for (c = 0; c < ZIO_COMPRESS_FUNCTIONS; c++) {
6178 if (zio_decompress_data(c, pabd,
6179 lbuf, psize, lsize) == 0 &&
6180 zio_decompress_data_buf(c, pbuf2,
6181 lbuf2, psize, lsize) == 0 &&
6182 bcmp(lbuf, lbuf2, lsize) == 0)
6183 break;
6184 }
6185 if (c != ZIO_COMPRESS_FUNCTIONS)
6186 break;
6187 lsize -= SPA_MINBLOCKSIZE;
6188 }
6189
6190 umem_free(pbuf2, SPA_MAXBLOCKSIZE);
6191 umem_free(lbuf2, SPA_MAXBLOCKSIZE);
6192
6193 if (lsize <= psize) {
6194 (void) printf("Decompress of %s failed\n", thing);
6195 goto out;
6196 }
6197 buf = lbuf;
6198 size = lsize;
6199 } else {
6200 buf = abd_to_buf(pabd);
6201 size = psize;
6202 }
6203
6204 if (flags & ZDB_FLAG_PRINT_BLKPTR)
6205 zdb_print_blkptr((blkptr_t *)(void *)
6206 ((uintptr_t)buf + (uintptr_t)blkptr_offset), flags);
6207 else if (flags & ZDB_FLAG_RAW)
6208 zdb_dump_block_raw(buf, size, flags);
6209 else if (flags & ZDB_FLAG_INDIRECT)
6210 zdb_dump_indirect((blkptr_t *)buf, size / sizeof (blkptr_t),
6211 flags);
6212 else if (flags & ZDB_FLAG_GBH)
6213 zdb_dump_gbh(buf, flags);
6214 else
6215 zdb_dump_block(thing, buf, size, flags);
6216
6217 out:
6218 abd_free(pabd);
6219 umem_free(lbuf, SPA_MAXBLOCKSIZE);
6220 free(dup);
6221 }
6222
6223 static void
zdb_embedded_block(char * thing)6224 zdb_embedded_block(char *thing)
6225 {
6226 blkptr_t bp;
6227 unsigned long long *words = (void *)&bp;
6228 char *buf;
6229 int err;
6230
6231 bzero(&bp, sizeof (bp));
6232 err = sscanf(thing, "%llx:%llx:%llx:%llx:%llx:%llx:%llx:%llx:"
6233 "%llx:%llx:%llx:%llx:%llx:%llx:%llx:%llx",
6234 words + 0, words + 1, words + 2, words + 3,
6235 words + 4, words + 5, words + 6, words + 7,
6236 words + 8, words + 9, words + 10, words + 11,
6237 words + 12, words + 13, words + 14, words + 15);
6238 if (err != 16) {
6239 (void) fprintf(stderr, "invalid input format\n");
6240 exit(1);
6241 }
6242 ASSERT3U(BPE_GET_LSIZE(&bp), <=, SPA_MAXBLOCKSIZE);
6243 buf = malloc(SPA_MAXBLOCKSIZE);
6244 if (buf == NULL) {
6245 (void) fprintf(stderr, "out of memory\n");
6246 exit(1);
6247 }
6248 err = decode_embedded_bp(&bp, buf, BPE_GET_LSIZE(&bp));
6249 if (err != 0) {
6250 (void) fprintf(stderr, "decode failed: %u\n", err);
6251 exit(1);
6252 }
6253 zdb_dump_block_raw(buf, BPE_GET_LSIZE(&bp), 0);
6254 free(buf);
6255 }
6256
6257 int
main(int argc,char ** argv)6258 main(int argc, char **argv)
6259 {
6260 int c;
6261 struct rlimit rl = { 1024, 1024 };
6262 spa_t *spa = NULL;
6263 objset_t *os = NULL;
6264 int dump_all = 1;
6265 int verbose = 0;
6266 int error = 0;
6267 char **searchdirs = NULL;
6268 int nsearch = 0;
6269 char *target, *target_pool;
6270 nvlist_t *policy = NULL;
6271 uint64_t max_txg = UINT64_MAX;
6272 int flags = ZFS_IMPORT_MISSING_LOG;
6273 int rewind = ZPOOL_NEVER_REWIND;
6274 char *spa_config_path_env;
6275 boolean_t target_is_spa = B_TRUE;
6276 nvlist_t *cfg = NULL;
6277
6278 (void) setrlimit(RLIMIT_NOFILE, &rl);
6279 (void) enable_extended_FILE_stdio(-1, -1);
6280
6281 dprintf_setup(&argc, argv);
6282
6283 /*
6284 * If there is an environment variable SPA_CONFIG_PATH it overrides
6285 * default spa_config_path setting. If -U flag is specified it will
6286 * override this environment variable settings once again.
6287 */
6288 spa_config_path_env = getenv("SPA_CONFIG_PATH");
6289 if (spa_config_path_env != NULL)
6290 spa_config_path = spa_config_path_env;
6291
6292 /*
6293 * For performance reasons, we set this tunable down. We do so before
6294 * the arg parsing section so that the user can override this value if
6295 * they choose.
6296 */
6297 zfs_btree_verify_intensity = 3;
6298
6299 while ((c = getopt(argc, argv,
6300 "AbcCdDeEFGhiI:klLmMo:Op:PqRsSt:uU:vVx:X")) != -1) {
6301 switch (c) {
6302 case 'b':
6303 case 'c':
6304 case 'C':
6305 case 'd':
6306 case 'D':
6307 case 'E':
6308 case 'G':
6309 case 'h':
6310 case 'i':
6311 case 'l':
6312 case 'm':
6313 case 'M':
6314 case 'O':
6315 case 'R':
6316 case 's':
6317 case 'S':
6318 case 'u':
6319 dump_opt[c]++;
6320 dump_all = 0;
6321 break;
6322 case 'A':
6323 case 'e':
6324 case 'F':
6325 case 'k':
6326 case 'L':
6327 case 'P':
6328 case 'q':
6329 case 'X':
6330 dump_opt[c]++;
6331 break;
6332 /* NB: Sort single match options below. */
6333 case 'I':
6334 max_inflight = strtoull(optarg, NULL, 0);
6335 if (max_inflight == 0) {
6336 (void) fprintf(stderr, "maximum number "
6337 "of inflight I/Os must be greater "
6338 "than 0\n");
6339 usage();
6340 }
6341 break;
6342 case 'o':
6343 error = set_global_var(optarg);
6344 if (error != 0)
6345 usage();
6346 break;
6347 case 'p':
6348 if (searchdirs == NULL) {
6349 searchdirs = umem_alloc(sizeof (char *),
6350 UMEM_NOFAIL);
6351 } else {
6352 char **tmp = umem_alloc((nsearch + 1) *
6353 sizeof (char *), UMEM_NOFAIL);
6354 bcopy(searchdirs, tmp, nsearch *
6355 sizeof (char *));
6356 umem_free(searchdirs,
6357 nsearch * sizeof (char *));
6358 searchdirs = tmp;
6359 }
6360 searchdirs[nsearch++] = optarg;
6361 break;
6362 case 't':
6363 max_txg = strtoull(optarg, NULL, 0);
6364 if (max_txg < TXG_INITIAL) {
6365 (void) fprintf(stderr, "incorrect txg "
6366 "specified: %s\n", optarg);
6367 usage();
6368 }
6369 break;
6370 case 'U':
6371 spa_config_path = optarg;
6372 if (spa_config_path[0] != '/') {
6373 (void) fprintf(stderr,
6374 "cachefile must be an absolute path "
6375 "(i.e. start with a slash)\n");
6376 usage();
6377 }
6378 break;
6379 case 'v':
6380 verbose++;
6381 break;
6382 case 'V':
6383 flags = ZFS_IMPORT_VERBATIM;
6384 break;
6385 case 'x':
6386 vn_dumpdir = optarg;
6387 break;
6388 default:
6389 usage();
6390 break;
6391 }
6392 }
6393
6394 if (!dump_opt['e'] && searchdirs != NULL) {
6395 (void) fprintf(stderr, "-p option requires use of -e\n");
6396 usage();
6397 }
6398
6399 /*
6400 * ZDB does not typically re-read blocks; therefore limit the ARC
6401 * to 256 MB, which can be used entirely for metadata.
6402 */
6403 zfs_arc_max = zfs_arc_meta_limit = 256 * 1024 * 1024;
6404
6405 /*
6406 * "zdb -c" uses checksum-verifying scrub i/os which are async reads.
6407 * "zdb -b" uses traversal prefetch which uses async reads.
6408 * For good performance, let several of them be active at once.
6409 */
6410 zfs_vdev_async_read_max_active = 10;
6411
6412 /*
6413 * Disable reference tracking for better performance.
6414 */
6415 reference_tracking_enable = B_FALSE;
6416
6417 /*
6418 * Do not fail spa_load when spa_load_verify fails. This is needed
6419 * to load non-idle pools.
6420 */
6421 spa_load_verify_dryrun = B_TRUE;
6422
6423 kernel_init(FREAD);
6424
6425 if (dump_all)
6426 verbose = MAX(verbose, 1);
6427
6428 for (c = 0; c < 256; c++) {
6429 if (dump_all && strchr("AeEFklLOPRSX", c) == NULL)
6430 dump_opt[c] = 1;
6431 if (dump_opt[c])
6432 dump_opt[c] += verbose;
6433 }
6434
6435 aok = (dump_opt['A'] == 1) || (dump_opt['A'] > 2);
6436 zfs_recover = (dump_opt['A'] > 1);
6437
6438 argc -= optind;
6439 argv += optind;
6440
6441 if (argc < 2 && dump_opt['R'])
6442 usage();
6443
6444 if (dump_opt['E']) {
6445 if (argc != 1)
6446 usage();
6447 zdb_embedded_block(argv[0]);
6448 return (0);
6449 }
6450
6451 if (argc < 1) {
6452 if (!dump_opt['e'] && dump_opt['C']) {
6453 dump_cachefile(spa_config_path);
6454 return (0);
6455 }
6456 usage();
6457 }
6458
6459 if (dump_opt['l'])
6460 return (dump_label(argv[0]));
6461
6462 if (dump_opt['O']) {
6463 if (argc != 2)
6464 usage();
6465 dump_opt['v'] = verbose + 3;
6466 return (dump_path(argv[0], argv[1]));
6467 }
6468
6469 if (dump_opt['X'] || dump_opt['F'])
6470 rewind = ZPOOL_DO_REWIND |
6471 (dump_opt['X'] ? ZPOOL_EXTREME_REWIND : 0);
6472
6473 if (nvlist_alloc(&policy, NV_UNIQUE_NAME_TYPE, 0) != 0 ||
6474 nvlist_add_uint64(policy, ZPOOL_LOAD_REQUEST_TXG, max_txg) != 0 ||
6475 nvlist_add_uint32(policy, ZPOOL_LOAD_REWIND_POLICY, rewind) != 0)
6476 fatal("internal error: %s", strerror(ENOMEM));
6477
6478 error = 0;
6479 target = argv[0];
6480
6481 if (strpbrk(target, "/@") != NULL) {
6482 size_t targetlen;
6483
6484 target_pool = strdup(target);
6485 *strpbrk(target_pool, "/@") = '\0';
6486
6487 target_is_spa = B_FALSE;
6488 targetlen = strlen(target);
6489 if (targetlen && target[targetlen - 1] == '/')
6490 target[targetlen - 1] = '\0';
6491 } else {
6492 target_pool = target;
6493 }
6494
6495 if (dump_opt['e']) {
6496 importargs_t args = { 0 };
6497
6498 args.paths = nsearch;
6499 args.path = searchdirs;
6500 args.can_be_active = B_TRUE;
6501
6502 error = zpool_find_config(NULL, target_pool, &cfg, &args,
6503 &libzpool_config_ops);
6504
6505 if (error == 0) {
6506
6507 if (nvlist_add_nvlist(cfg,
6508 ZPOOL_LOAD_POLICY, policy) != 0) {
6509 fatal("can't open '%s': %s",
6510 target, strerror(ENOMEM));
6511 }
6512
6513 if (dump_opt['C'] > 1) {
6514 (void) printf("\nConfiguration for import:\n");
6515 dump_nvlist(cfg, 8);
6516 }
6517
6518 /*
6519 * Disable the activity check to allow examination of
6520 * active pools.
6521 */
6522 error = spa_import(target_pool, cfg, NULL,
6523 flags | ZFS_IMPORT_SKIP_MMP);
6524 }
6525 }
6526
6527 char *checkpoint_pool = NULL;
6528 char *checkpoint_target = NULL;
6529 if (dump_opt['k']) {
6530 checkpoint_pool = import_checkpointed_state(target, cfg,
6531 &checkpoint_target);
6532
6533 if (checkpoint_target != NULL)
6534 target = checkpoint_target;
6535
6536 }
6537
6538 if (error == 0) {
6539 if (dump_opt['k'] && (target_is_spa || dump_opt['R'])) {
6540 ASSERT(checkpoint_pool != NULL);
6541 ASSERT(checkpoint_target == NULL);
6542
6543 error = spa_open(checkpoint_pool, &spa, FTAG);
6544 if (error != 0) {
6545 fatal("Tried to open pool \"%s\" but "
6546 "spa_open() failed with error %d\n",
6547 checkpoint_pool, error);
6548 }
6549
6550 } else if (target_is_spa || dump_opt['R']) {
6551 zdb_set_skip_mmp(target);
6552 error = spa_open_rewind(target, &spa, FTAG, policy,
6553 NULL);
6554 if (error) {
6555 /*
6556 * If we're missing the log device then
6557 * try opening the pool after clearing the
6558 * log state.
6559 */
6560 mutex_enter(&spa_namespace_lock);
6561 if ((spa = spa_lookup(target)) != NULL &&
6562 spa->spa_log_state == SPA_LOG_MISSING) {
6563 spa->spa_log_state = SPA_LOG_CLEAR;
6564 error = 0;
6565 }
6566 mutex_exit(&spa_namespace_lock);
6567
6568 if (!error) {
6569 error = spa_open_rewind(target, &spa,
6570 FTAG, policy, NULL);
6571 }
6572 }
6573 } else {
6574 zdb_set_skip_mmp(target);
6575 error = open_objset(target, DMU_OST_ANY, FTAG, &os);
6576 }
6577 }
6578 nvlist_free(policy);
6579
6580 if (error)
6581 fatal("can't open '%s': %s", target, strerror(error));
6582
6583 argv++;
6584 argc--;
6585 if (!dump_opt['R']) {
6586 if (argc > 0) {
6587 zopt_objects = argc;
6588 zopt_object = calloc(zopt_objects, sizeof (uint64_t));
6589 for (unsigned i = 0; i < zopt_objects; i++) {
6590 errno = 0;
6591 zopt_object[i] = strtoull(argv[i], NULL, 0);
6592 if (zopt_object[i] == 0 && errno != 0)
6593 fatal("bad number %s: %s",
6594 argv[i], strerror(errno));
6595 }
6596 }
6597 if (os != NULL) {
6598 dump_dir(os);
6599 } else if (zopt_objects > 0 && !dump_opt['m']) {
6600 dump_dir(spa->spa_meta_objset);
6601 } else {
6602 dump_zpool(spa);
6603 }
6604 } else {
6605 flagbits['b'] = ZDB_FLAG_PRINT_BLKPTR;
6606 flagbits['c'] = ZDB_FLAG_CHECKSUM;
6607 flagbits['d'] = ZDB_FLAG_DECOMPRESS;
6608 flagbits['e'] = ZDB_FLAG_BSWAP;
6609 flagbits['g'] = ZDB_FLAG_GBH;
6610 flagbits['i'] = ZDB_FLAG_INDIRECT;
6611 flagbits['p'] = ZDB_FLAG_PHYS;
6612 flagbits['r'] = ZDB_FLAG_RAW;
6613
6614 for (int i = 0; i < argc; i++)
6615 zdb_read_block(argv[i], spa);
6616 }
6617
6618 if (dump_opt['k']) {
6619 free(checkpoint_pool);
6620 if (!target_is_spa)
6621 free(checkpoint_target);
6622 }
6623
6624 if (os != NULL)
6625 close_objset(os, FTAG);
6626 else
6627 spa_close(spa, FTAG);
6628
6629 fuid_table_destroy();
6630
6631 dump_debug_buffer();
6632
6633 kernel_fini();
6634
6635 return (error);
6636 }
6637