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