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