9166 zfs storage pool checkpoint
[unleashed.git] / usr / src / uts / common / fs / zfs / dmu_traverse.c
blob050cd69811a6e82260a8f1ba21a16efc053e794b
1 /*
2 * CDDL HEADER START
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.
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.
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]
19 * CDDL HEADER END
22 * Copyright (c) 2005, 2010, Oracle and/or its affiliates. All rights reserved.
23 * Copyright (c) 2012, 2018 by Delphix. All rights reserved.
26 #include <sys/zfs_context.h>
27 #include <sys/dmu_objset.h>
28 #include <sys/dmu_traverse.h>
29 #include <sys/dsl_dataset.h>
30 #include <sys/dsl_dir.h>
31 #include <sys/dsl_pool.h>
32 #include <sys/dnode.h>
33 #include <sys/spa.h>
34 #include <sys/spa_impl.h>
35 #include <sys/zio.h>
36 #include <sys/dmu_impl.h>
37 #include <sys/sa.h>
38 #include <sys/sa_impl.h>
39 #include <sys/callb.h>
40 #include <sys/zfeature.h>
42 int32_t zfs_pd_bytes_max = 50 * 1024 * 1024; /* 50MB */
43 boolean_t send_holes_without_birth_time = B_TRUE;
45 typedef struct prefetch_data {
46 kmutex_t pd_mtx;
47 kcondvar_t pd_cv;
48 int32_t pd_bytes_fetched;
49 int pd_flags;
50 boolean_t pd_cancel;
51 boolean_t pd_exited;
52 zbookmark_phys_t pd_resume;
53 } prefetch_data_t;
55 typedef struct traverse_data {
56 spa_t *td_spa;
57 uint64_t td_objset;
58 blkptr_t *td_rootbp;
59 uint64_t td_min_txg;
60 zbookmark_phys_t *td_resume;
61 int td_flags;
62 prefetch_data_t *td_pfd;
63 boolean_t td_paused;
64 uint64_t td_hole_birth_enabled_txg;
65 blkptr_cb_t *td_func;
66 void *td_arg;
67 boolean_t td_realloc_possible;
68 } traverse_data_t;
70 static int traverse_dnode(traverse_data_t *td, const dnode_phys_t *dnp,
71 uint64_t objset, uint64_t object);
72 static void prefetch_dnode_metadata(traverse_data_t *td, const dnode_phys_t *,
73 uint64_t objset, uint64_t object);
75 static int
76 traverse_zil_block(zilog_t *zilog, blkptr_t *bp, void *arg, uint64_t claim_txg)
78 traverse_data_t *td = arg;
79 zbookmark_phys_t zb;
81 if (BP_IS_HOLE(bp))
82 return (0);
84 if (claim_txg == 0 && bp->blk_birth >= spa_min_claim_txg(td->td_spa))
85 return (-1);
87 SET_BOOKMARK(&zb, td->td_objset, ZB_ZIL_OBJECT, ZB_ZIL_LEVEL,
88 bp->blk_cksum.zc_word[ZIL_ZC_SEQ]);
90 (void) td->td_func(td->td_spa, zilog, bp, &zb, NULL, td->td_arg);
92 return (0);
95 static int
96 traverse_zil_record(zilog_t *zilog, lr_t *lrc, void *arg, uint64_t claim_txg)
98 traverse_data_t *td = arg;
100 if (lrc->lrc_txtype == TX_WRITE) {
101 lr_write_t *lr = (lr_write_t *)lrc;
102 blkptr_t *bp = &lr->lr_blkptr;
103 zbookmark_phys_t zb;
105 if (BP_IS_HOLE(bp))
106 return (0);
108 if (claim_txg == 0 || bp->blk_birth < claim_txg)
109 return (0);
111 SET_BOOKMARK(&zb, td->td_objset, lr->lr_foid,
112 ZB_ZIL_LEVEL, lr->lr_offset / BP_GET_LSIZE(bp));
114 (void) td->td_func(td->td_spa, zilog, bp, &zb, NULL,
115 td->td_arg);
117 return (0);
120 static void
121 traverse_zil(traverse_data_t *td, zil_header_t *zh)
123 uint64_t claim_txg = zh->zh_claim_txg;
126 * We only want to visit blocks that have been claimed but not yet
127 * replayed; plus blocks that are already stable in read-only mode.
129 if (claim_txg == 0 && spa_writeable(td->td_spa))
130 return;
132 zilog_t *zilog = zil_alloc(spa_get_dsl(td->td_spa)->dp_meta_objset, zh);
133 (void) zil_parse(zilog, traverse_zil_block, traverse_zil_record, td,
134 claim_txg);
135 zil_free(zilog);
138 typedef enum resume_skip {
139 RESUME_SKIP_ALL,
140 RESUME_SKIP_NONE,
141 RESUME_SKIP_CHILDREN
142 } resume_skip_t;
145 * Returns RESUME_SKIP_ALL if td indicates that we are resuming a traversal and
146 * the block indicated by zb does not need to be visited at all. Returns
147 * RESUME_SKIP_CHILDREN if we are resuming a post traversal and we reach the
148 * resume point. This indicates that this block should be visited but not its
149 * children (since they must have been visited in a previous traversal).
150 * Otherwise returns RESUME_SKIP_NONE.
152 static resume_skip_t
153 resume_skip_check(traverse_data_t *td, const dnode_phys_t *dnp,
154 const zbookmark_phys_t *zb)
156 if (td->td_resume != NULL && !ZB_IS_ZERO(td->td_resume)) {
158 * If we already visited this bp & everything below,
159 * don't bother doing it again.
161 if (zbookmark_subtree_completed(dnp, zb, td->td_resume))
162 return (RESUME_SKIP_ALL);
165 * If we found the block we're trying to resume from, zero
166 * the bookmark out to indicate that we have resumed.
168 if (bcmp(zb, td->td_resume, sizeof (*zb)) == 0) {
169 bzero(td->td_resume, sizeof (*zb));
170 if (td->td_flags & TRAVERSE_POST)
171 return (RESUME_SKIP_CHILDREN);
174 return (RESUME_SKIP_NONE);
177 static void
178 traverse_prefetch_metadata(traverse_data_t *td,
179 const blkptr_t *bp, const zbookmark_phys_t *zb)
181 arc_flags_t flags = ARC_FLAG_NOWAIT | ARC_FLAG_PREFETCH;
183 if (!(td->td_flags & TRAVERSE_PREFETCH_METADATA))
184 return;
186 * If we are in the process of resuming, don't prefetch, because
187 * some children will not be needed (and in fact may have already
188 * been freed).
190 if (td->td_resume != NULL && !ZB_IS_ZERO(td->td_resume))
191 return;
192 if (BP_IS_HOLE(bp) || bp->blk_birth <= td->td_min_txg)
193 return;
194 if (BP_GET_LEVEL(bp) == 0 && BP_GET_TYPE(bp) != DMU_OT_DNODE)
195 return;
197 (void) arc_read(NULL, td->td_spa, bp, NULL, NULL,
198 ZIO_PRIORITY_ASYNC_READ, ZIO_FLAG_CANFAIL, &flags, zb);
201 static boolean_t
202 prefetch_needed(prefetch_data_t *pfd, const blkptr_t *bp)
204 ASSERT(pfd->pd_flags & TRAVERSE_PREFETCH_DATA);
205 if (BP_IS_HOLE(bp) || BP_IS_EMBEDDED(bp) ||
206 BP_GET_TYPE(bp) == DMU_OT_INTENT_LOG)
207 return (B_FALSE);
208 return (B_TRUE);
211 static int
212 traverse_visitbp(traverse_data_t *td, const dnode_phys_t *dnp,
213 const blkptr_t *bp, const zbookmark_phys_t *zb)
215 zbookmark_phys_t czb;
216 int err = 0;
217 arc_buf_t *buf = NULL;
218 prefetch_data_t *pd = td->td_pfd;
219 boolean_t hard = td->td_flags & TRAVERSE_HARD;
221 switch (resume_skip_check(td, dnp, zb)) {
222 case RESUME_SKIP_ALL:
223 return (0);
224 case RESUME_SKIP_CHILDREN:
225 goto post;
226 case RESUME_SKIP_NONE:
227 break;
228 default:
229 ASSERT(0);
232 if (bp->blk_birth == 0) {
234 * Since this block has a birth time of 0 it must be one of
235 * two things: a hole created before the
236 * SPA_FEATURE_HOLE_BIRTH feature was enabled, or a hole
237 * which has always been a hole in an object.
239 * If a file is written sparsely, then the unwritten parts of
240 * the file were "always holes" -- that is, they have been
241 * holes since this object was allocated. However, we (and
242 * our callers) can not necessarily tell when an object was
243 * allocated. Therefore, if it's possible that this object
244 * was freed and then its object number reused, we need to
245 * visit all the holes with birth==0.
247 * If it isn't possible that the object number was reused,
248 * then if SPA_FEATURE_HOLE_BIRTH was enabled before we wrote
249 * all the blocks we will visit as part of this traversal,
250 * then this hole must have always existed, so we can skip
251 * it. We visit blocks born after (exclusive) td_min_txg.
253 * Note that the meta-dnode cannot be reallocated.
255 if (!send_holes_without_birth_time &&
256 (!td->td_realloc_possible ||
257 zb->zb_object == DMU_META_DNODE_OBJECT) &&
258 td->td_hole_birth_enabled_txg <= td->td_min_txg)
259 return (0);
260 } else if (bp->blk_birth <= td->td_min_txg) {
261 return (0);
264 if (pd != NULL && !pd->pd_exited && prefetch_needed(pd, bp)) {
265 uint64_t size = BP_GET_LSIZE(bp);
266 mutex_enter(&pd->pd_mtx);
267 ASSERT(pd->pd_bytes_fetched >= 0);
268 while (pd->pd_bytes_fetched < size && !pd->pd_exited)
269 cv_wait(&pd->pd_cv, &pd->pd_mtx);
270 pd->pd_bytes_fetched -= size;
271 cv_broadcast(&pd->pd_cv);
272 mutex_exit(&pd->pd_mtx);
275 if (BP_IS_HOLE(bp)) {
276 err = td->td_func(td->td_spa, NULL, bp, zb, dnp, td->td_arg);
277 if (err != 0)
278 goto post;
279 return (0);
282 if (td->td_flags & TRAVERSE_PRE) {
283 err = td->td_func(td->td_spa, NULL, bp, zb, dnp,
284 td->td_arg);
285 if (err == TRAVERSE_VISIT_NO_CHILDREN)
286 return (0);
287 if (err != 0)
288 goto post;
291 if (BP_GET_LEVEL(bp) > 0) {
292 arc_flags_t flags = ARC_FLAG_WAIT;
293 int i;
294 blkptr_t *cbp;
295 int epb = BP_GET_LSIZE(bp) >> SPA_BLKPTRSHIFT;
297 err = arc_read(NULL, td->td_spa, bp, arc_getbuf_func, &buf,
298 ZIO_PRIORITY_ASYNC_READ, ZIO_FLAG_CANFAIL, &flags, zb);
299 if (err != 0)
300 goto post;
301 cbp = buf->b_data;
303 for (i = 0; i < epb; i++) {
304 SET_BOOKMARK(&czb, zb->zb_objset, zb->zb_object,
305 zb->zb_level - 1,
306 zb->zb_blkid * epb + i);
307 traverse_prefetch_metadata(td, &cbp[i], &czb);
310 /* recursively visitbp() blocks below this */
311 for (i = 0; i < epb; i++) {
312 SET_BOOKMARK(&czb, zb->zb_objset, zb->zb_object,
313 zb->zb_level - 1,
314 zb->zb_blkid * epb + i);
315 err = traverse_visitbp(td, dnp, &cbp[i], &czb);
316 if (err != 0)
317 break;
319 } else if (BP_GET_TYPE(bp) == DMU_OT_DNODE) {
320 arc_flags_t flags = ARC_FLAG_WAIT;
321 int i;
322 int epb = BP_GET_LSIZE(bp) >> DNODE_SHIFT;
324 err = arc_read(NULL, td->td_spa, bp, arc_getbuf_func, &buf,
325 ZIO_PRIORITY_ASYNC_READ, ZIO_FLAG_CANFAIL, &flags, zb);
326 if (err != 0)
327 goto post;
328 dnode_phys_t *child_dnp = buf->b_data;
330 for (i = 0; i < epb; i++) {
331 prefetch_dnode_metadata(td, &child_dnp[i],
332 zb->zb_objset, zb->zb_blkid * epb + i);
335 /* recursively visitbp() blocks below this */
336 for (i = 0; i < epb; i++) {
337 err = traverse_dnode(td, &child_dnp[i],
338 zb->zb_objset, zb->zb_blkid * epb + i);
339 if (err != 0)
340 break;
342 } else if (BP_GET_TYPE(bp) == DMU_OT_OBJSET) {
343 arc_flags_t flags = ARC_FLAG_WAIT;
345 err = arc_read(NULL, td->td_spa, bp, arc_getbuf_func, &buf,
346 ZIO_PRIORITY_ASYNC_READ, ZIO_FLAG_CANFAIL, &flags, zb);
347 if (err != 0)
348 goto post;
350 objset_phys_t *osp = buf->b_data;
351 prefetch_dnode_metadata(td, &osp->os_meta_dnode, zb->zb_objset,
352 DMU_META_DNODE_OBJECT);
354 * See the block comment above for the goal of this variable.
355 * If the maxblkid of the meta-dnode is 0, then we know that
356 * we've never had more than DNODES_PER_BLOCK objects in the
357 * dataset, which means we can't have reused any object ids.
359 if (osp->os_meta_dnode.dn_maxblkid == 0)
360 td->td_realloc_possible = B_FALSE;
362 if (arc_buf_size(buf) >= sizeof (objset_phys_t)) {
363 prefetch_dnode_metadata(td, &osp->os_groupused_dnode,
364 zb->zb_objset, DMU_GROUPUSED_OBJECT);
365 prefetch_dnode_metadata(td, &osp->os_userused_dnode,
366 zb->zb_objset, DMU_USERUSED_OBJECT);
369 err = traverse_dnode(td, &osp->os_meta_dnode, zb->zb_objset,
370 DMU_META_DNODE_OBJECT);
371 if (err == 0 && arc_buf_size(buf) >= sizeof (objset_phys_t)) {
372 err = traverse_dnode(td, &osp->os_groupused_dnode,
373 zb->zb_objset, DMU_GROUPUSED_OBJECT);
375 if (err == 0 && arc_buf_size(buf) >= sizeof (objset_phys_t)) {
376 err = traverse_dnode(td, &osp->os_userused_dnode,
377 zb->zb_objset, DMU_USERUSED_OBJECT);
381 if (buf)
382 arc_buf_destroy(buf, &buf);
384 post:
385 if (err == 0 && (td->td_flags & TRAVERSE_POST))
386 err = td->td_func(td->td_spa, NULL, bp, zb, dnp, td->td_arg);
388 if (hard && (err == EIO || err == ECKSUM)) {
390 * Ignore this disk error as requested by the HARD flag,
391 * and continue traversal.
393 err = 0;
397 * If we are stopping here, set td_resume.
399 if (td->td_resume != NULL && err != 0 && !td->td_paused) {
400 td->td_resume->zb_objset = zb->zb_objset;
401 td->td_resume->zb_object = zb->zb_object;
402 td->td_resume->zb_level = 0;
404 * If we have stopped on an indirect block (e.g. due to
405 * i/o error), we have not visited anything below it.
406 * Set the bookmark to the first level-0 block that we need
407 * to visit. This way, the resuming code does not need to
408 * deal with resuming from indirect blocks.
410 * Note, if zb_level <= 0, dnp may be NULL, so we don't want
411 * to dereference it.
413 td->td_resume->zb_blkid = zb->zb_blkid;
414 if (zb->zb_level > 0) {
415 td->td_resume->zb_blkid <<= zb->zb_level *
416 (dnp->dn_indblkshift - SPA_BLKPTRSHIFT);
418 td->td_paused = B_TRUE;
421 return (err);
424 static void
425 prefetch_dnode_metadata(traverse_data_t *td, const dnode_phys_t *dnp,
426 uint64_t objset, uint64_t object)
428 int j;
429 zbookmark_phys_t czb;
431 for (j = 0; j < dnp->dn_nblkptr; j++) {
432 SET_BOOKMARK(&czb, objset, object, dnp->dn_nlevels - 1, j);
433 traverse_prefetch_metadata(td, &dnp->dn_blkptr[j], &czb);
436 if (dnp->dn_flags & DNODE_FLAG_SPILL_BLKPTR) {
437 SET_BOOKMARK(&czb, objset, object, 0, DMU_SPILL_BLKID);
438 traverse_prefetch_metadata(td, &dnp->dn_spill, &czb);
442 static int
443 traverse_dnode(traverse_data_t *td, const dnode_phys_t *dnp,
444 uint64_t objset, uint64_t object)
446 int j, err = 0;
447 zbookmark_phys_t czb;
449 if (object != DMU_META_DNODE_OBJECT && td->td_resume != NULL &&
450 object < td->td_resume->zb_object)
451 return (0);
453 if (td->td_flags & TRAVERSE_PRE) {
454 SET_BOOKMARK(&czb, objset, object, ZB_DNODE_LEVEL,
455 ZB_DNODE_BLKID);
456 err = td->td_func(td->td_spa, NULL, NULL, &czb, dnp,
457 td->td_arg);
458 if (err == TRAVERSE_VISIT_NO_CHILDREN)
459 return (0);
460 if (err != 0)
461 return (err);
464 for (j = 0; j < dnp->dn_nblkptr; j++) {
465 SET_BOOKMARK(&czb, objset, object, dnp->dn_nlevels - 1, j);
466 err = traverse_visitbp(td, dnp, &dnp->dn_blkptr[j], &czb);
467 if (err != 0)
468 break;
471 if (err == 0 && (dnp->dn_flags & DNODE_FLAG_SPILL_BLKPTR)) {
472 SET_BOOKMARK(&czb, objset, object, 0, DMU_SPILL_BLKID);
473 err = traverse_visitbp(td, dnp, &dnp->dn_spill, &czb);
476 if (err == 0 && (td->td_flags & TRAVERSE_POST)) {
477 SET_BOOKMARK(&czb, objset, object, ZB_DNODE_LEVEL,
478 ZB_DNODE_BLKID);
479 err = td->td_func(td->td_spa, NULL, NULL, &czb, dnp,
480 td->td_arg);
481 if (err == TRAVERSE_VISIT_NO_CHILDREN)
482 return (0);
483 if (err != 0)
484 return (err);
486 return (err);
489 /* ARGSUSED */
490 static int
491 traverse_prefetcher(spa_t *spa, zilog_t *zilog, const blkptr_t *bp,
492 const zbookmark_phys_t *zb, const dnode_phys_t *dnp, void *arg)
494 prefetch_data_t *pfd = arg;
495 arc_flags_t aflags = ARC_FLAG_NOWAIT | ARC_FLAG_PREFETCH;
497 ASSERT(pfd->pd_bytes_fetched >= 0);
498 if (bp == NULL)
499 return (0);
500 if (pfd->pd_cancel)
501 return (SET_ERROR(EINTR));
503 if (!prefetch_needed(pfd, bp))
504 return (0);
506 mutex_enter(&pfd->pd_mtx);
507 while (!pfd->pd_cancel && pfd->pd_bytes_fetched >= zfs_pd_bytes_max)
508 cv_wait(&pfd->pd_cv, &pfd->pd_mtx);
509 pfd->pd_bytes_fetched += BP_GET_LSIZE(bp);
510 cv_broadcast(&pfd->pd_cv);
511 mutex_exit(&pfd->pd_mtx);
513 (void) arc_read(NULL, spa, bp, NULL, NULL, ZIO_PRIORITY_ASYNC_READ,
514 ZIO_FLAG_CANFAIL | ZIO_FLAG_SPECULATIVE, &aflags, zb);
516 return (0);
519 static void
520 traverse_prefetch_thread(void *arg)
522 traverse_data_t *td_main = arg;
523 traverse_data_t td = *td_main;
524 zbookmark_phys_t czb;
526 td.td_func = traverse_prefetcher;
527 td.td_arg = td_main->td_pfd;
528 td.td_pfd = NULL;
529 td.td_resume = &td_main->td_pfd->pd_resume;
531 SET_BOOKMARK(&czb, td.td_objset,
532 ZB_ROOT_OBJECT, ZB_ROOT_LEVEL, ZB_ROOT_BLKID);
533 (void) traverse_visitbp(&td, NULL, td.td_rootbp, &czb);
535 mutex_enter(&td_main->td_pfd->pd_mtx);
536 td_main->td_pfd->pd_exited = B_TRUE;
537 cv_broadcast(&td_main->td_pfd->pd_cv);
538 mutex_exit(&td_main->td_pfd->pd_mtx);
542 * NB: dataset must not be changing on-disk (eg, is a snapshot or we are
543 * in syncing context).
545 static int
546 traverse_impl(spa_t *spa, dsl_dataset_t *ds, uint64_t objset, blkptr_t *rootbp,
547 uint64_t txg_start, zbookmark_phys_t *resume, int flags,
548 blkptr_cb_t func, void *arg)
550 traverse_data_t td;
551 prefetch_data_t pd = { 0 };
552 zbookmark_phys_t czb;
553 int err;
555 ASSERT(ds == NULL || objset == ds->ds_object);
556 ASSERT(!(flags & TRAVERSE_PRE) || !(flags & TRAVERSE_POST));
558 td.td_spa = spa;
559 td.td_objset = objset;
560 td.td_rootbp = rootbp;
561 td.td_min_txg = txg_start;
562 td.td_resume = resume;
563 td.td_func = func;
564 td.td_arg = arg;
565 td.td_pfd = &pd;
566 td.td_flags = flags;
567 td.td_paused = B_FALSE;
568 td.td_realloc_possible = (txg_start == 0 ? B_FALSE : B_TRUE);
570 if (spa_feature_is_active(spa, SPA_FEATURE_HOLE_BIRTH)) {
571 VERIFY(spa_feature_enabled_txg(spa,
572 SPA_FEATURE_HOLE_BIRTH, &td.td_hole_birth_enabled_txg));
573 } else {
574 td.td_hole_birth_enabled_txg = UINT64_MAX;
577 pd.pd_flags = flags;
578 if (resume != NULL)
579 pd.pd_resume = *resume;
580 mutex_init(&pd.pd_mtx, NULL, MUTEX_DEFAULT, NULL);
581 cv_init(&pd.pd_cv, NULL, CV_DEFAULT, NULL);
583 /* See comment on ZIL traversal in dsl_scan_visitds. */
584 if (ds != NULL && !ds->ds_is_snapshot && !BP_IS_HOLE(rootbp)) {
585 arc_flags_t flags = ARC_FLAG_WAIT;
586 objset_phys_t *osp;
587 arc_buf_t *buf;
589 err = arc_read(NULL, td.td_spa, rootbp,
590 arc_getbuf_func, &buf,
591 ZIO_PRIORITY_ASYNC_READ, ZIO_FLAG_CANFAIL, &flags, NULL);
592 if (err != 0)
593 return (err);
595 osp = buf->b_data;
596 traverse_zil(&td, &osp->os_zil_header);
597 arc_buf_destroy(buf, &buf);
600 if (!(flags & TRAVERSE_PREFETCH_DATA) ||
601 0 == taskq_dispatch(system_taskq, traverse_prefetch_thread,
602 &td, TQ_NOQUEUE))
603 pd.pd_exited = B_TRUE;
605 SET_BOOKMARK(&czb, td.td_objset,
606 ZB_ROOT_OBJECT, ZB_ROOT_LEVEL, ZB_ROOT_BLKID);
607 err = traverse_visitbp(&td, NULL, rootbp, &czb);
609 mutex_enter(&pd.pd_mtx);
610 pd.pd_cancel = B_TRUE;
611 cv_broadcast(&pd.pd_cv);
612 while (!pd.pd_exited)
613 cv_wait(&pd.pd_cv, &pd.pd_mtx);
614 mutex_exit(&pd.pd_mtx);
616 mutex_destroy(&pd.pd_mtx);
617 cv_destroy(&pd.pd_cv);
619 return (err);
623 * NB: dataset must not be changing on-disk (eg, is a snapshot or we are
624 * in syncing context).
627 traverse_dataset_resume(dsl_dataset_t *ds, uint64_t txg_start,
628 zbookmark_phys_t *resume,
629 int flags, blkptr_cb_t func, void *arg)
631 return (traverse_impl(ds->ds_dir->dd_pool->dp_spa, ds, ds->ds_object,
632 &dsl_dataset_phys(ds)->ds_bp, txg_start, resume, flags, func, arg));
636 traverse_dataset(dsl_dataset_t *ds, uint64_t txg_start,
637 int flags, blkptr_cb_t func, void *arg)
639 return (traverse_dataset_resume(ds, txg_start, NULL, flags, func, arg));
643 traverse_dataset_destroyed(spa_t *spa, blkptr_t *blkptr,
644 uint64_t txg_start, zbookmark_phys_t *resume, int flags,
645 blkptr_cb_t func, void *arg)
647 return (traverse_impl(spa, NULL, ZB_DESTROYED_OBJSET,
648 blkptr, txg_start, resume, flags, func, arg));
652 * NB: pool must not be changing on-disk (eg, from zdb or sync context).
655 traverse_pool(spa_t *spa, uint64_t txg_start, int flags,
656 blkptr_cb_t func, void *arg)
658 int err;
659 dsl_pool_t *dp = spa_get_dsl(spa);
660 objset_t *mos = dp->dp_meta_objset;
661 boolean_t hard = (flags & TRAVERSE_HARD);
663 /* visit the MOS */
664 err = traverse_impl(spa, NULL, 0, spa_get_rootblkptr(spa),
665 txg_start, NULL, flags, func, arg);
666 if (err != 0)
667 return (err);
669 /* visit each dataset */
670 for (uint64_t obj = 1; err == 0;
671 err = dmu_object_next(mos, &obj, B_FALSE, txg_start)) {
672 dmu_object_info_t doi;
674 err = dmu_object_info(mos, obj, &doi);
675 if (err != 0) {
676 if (hard)
677 continue;
678 break;
681 if (doi.doi_bonus_type == DMU_OT_DSL_DATASET) {
682 dsl_dataset_t *ds;
683 uint64_t txg = txg_start;
685 dsl_pool_config_enter(dp, FTAG);
686 err = dsl_dataset_hold_obj(dp, obj, FTAG, &ds);
687 dsl_pool_config_exit(dp, FTAG);
688 if (err != 0) {
689 if (hard)
690 continue;
691 break;
693 if (dsl_dataset_phys(ds)->ds_prev_snap_txg > txg)
694 txg = dsl_dataset_phys(ds)->ds_prev_snap_txg;
695 err = traverse_dataset(ds, txg, flags, func, arg);
696 dsl_dataset_rele(ds, FTAG);
697 if (err != 0)
698 break;
701 if (err == ESRCH)
702 err = 0;
703 return (err);