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