]> git.proxmox.com Git - mirror_zfs.git/blob - module/zfs/dsl_scan.c
Fedora 28: Fix misc bounds check compiler warnings
[mirror_zfs.git] / module / zfs / dsl_scan.c
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 * Copyright (c) 2008, 2010, Oracle and/or its affiliates. All rights reserved.
23 * Copyright (c) 2011, 2016 by Delphix. All rights reserved.
24 * Copyright 2016 Gary Mills
25 * Copyright (c) 2017 Datto Inc.
26 * Copyright 2017 Joyent, Inc.
27 */
28
29 #include <sys/dsl_scan.h>
30 #include <sys/dsl_pool.h>
31 #include <sys/dsl_dataset.h>
32 #include <sys/dsl_prop.h>
33 #include <sys/dsl_dir.h>
34 #include <sys/dsl_synctask.h>
35 #include <sys/dnode.h>
36 #include <sys/dmu_tx.h>
37 #include <sys/dmu_objset.h>
38 #include <sys/arc.h>
39 #include <sys/zap.h>
40 #include <sys/zio.h>
41 #include <sys/zfs_context.h>
42 #include <sys/fs/zfs.h>
43 #include <sys/zfs_znode.h>
44 #include <sys/spa_impl.h>
45 #include <sys/vdev_impl.h>
46 #include <sys/zil_impl.h>
47 #include <sys/zio_checksum.h>
48 #include <sys/ddt.h>
49 #include <sys/sa.h>
50 #include <sys/sa_impl.h>
51 #include <sys/zfeature.h>
52 #include <sys/abd.h>
53 #include <sys/range_tree.h>
54 #ifdef _KERNEL
55 #include <sys/zfs_vfsops.h>
56 #endif
57
58 /*
59 * Grand theory statement on scan queue sorting
60 *
61 * Scanning is implemented by recursively traversing all indirection levels
62 * in an object and reading all blocks referenced from said objects. This
63 * results in us approximately traversing the object from lowest logical
64 * offset to the highest. For best performance, we would want the logical
65 * blocks to be physically contiguous. However, this is frequently not the
66 * case with pools given the allocation patterns of copy-on-write filesystems.
67 * So instead, we put the I/Os into a reordering queue and issue them in a
68 * way that will most benefit physical disks (LBA-order).
69 *
70 * Queue management:
71 *
72 * Ideally, we would want to scan all metadata and queue up all block I/O
73 * prior to starting to issue it, because that allows us to do an optimal
74 * sorting job. This can however consume large amounts of memory. Therefore
75 * we continuously monitor the size of the queues and constrain them to 5%
76 * (zfs_scan_mem_lim_fact) of physmem. If the queues grow larger than this
77 * limit, we clear out a few of the largest extents at the head of the queues
78 * to make room for more scanning. Hopefully, these extents will be fairly
79 * large and contiguous, allowing us to approach sequential I/O throughput
80 * even without a fully sorted tree.
81 *
82 * Metadata scanning takes place in dsl_scan_visit(), which is called from
83 * dsl_scan_sync() every spa_sync(). If we have either fully scanned all
84 * metadata on the pool, or we need to make room in memory because our
85 * queues are too large, dsl_scan_visit() is postponed and
86 * scan_io_queues_run() is called from dsl_scan_sync() instead. This implies
87 * that metadata scanning and queued I/O issuing are mutually exclusive. This
88 * allows us to provide maximum sequential I/O throughput for the majority of
89 * I/O's issued since sequential I/O performance is significantly negatively
90 * impacted if it is interleaved with random I/O.
91 *
92 * Implementation Notes
93 *
94 * One side effect of the queued scanning algorithm is that the scanning code
95 * needs to be notified whenever a block is freed. This is needed to allow
96 * the scanning code to remove these I/Os from the issuing queue. Additionally,
97 * we do not attempt to queue gang blocks to be issued sequentially since this
98 * is very hard to do and would have an extremely limited performance benefit.
99 * Instead, we simply issue gang I/Os as soon as we find them using the legacy
100 * algorithm.
101 *
102 * Backwards compatibility
103 *
104 * This new algorithm is backwards compatible with the legacy on-disk data
105 * structures (and therefore does not require a new feature flag).
106 * Periodically during scanning (see zfs_scan_checkpoint_intval), the scan
107 * will stop scanning metadata (in logical order) and wait for all outstanding
108 * sorted I/O to complete. Once this is done, we write out a checkpoint
109 * bookmark, indicating that we have scanned everything logically before it.
110 * If the pool is imported on a machine without the new sorting algorithm,
111 * the scan simply resumes from the last checkpoint using the legacy algorithm.
112 */
113
114 typedef int (scan_cb_t)(dsl_pool_t *, const blkptr_t *,
115 const zbookmark_phys_t *);
116
117 static scan_cb_t dsl_scan_scrub_cb;
118
119 static int scan_ds_queue_compare(const void *a, const void *b);
120 static int scan_prefetch_queue_compare(const void *a, const void *b);
121 static void scan_ds_queue_clear(dsl_scan_t *scn);
122 static boolean_t scan_ds_queue_contains(dsl_scan_t *scn, uint64_t dsobj,
123 uint64_t *txg);
124 static void scan_ds_queue_insert(dsl_scan_t *scn, uint64_t dsobj, uint64_t txg);
125 static void scan_ds_queue_remove(dsl_scan_t *scn, uint64_t dsobj);
126 static void scan_ds_queue_sync(dsl_scan_t *scn, dmu_tx_t *tx);
127 static uint64_t dsl_scan_count_leaves(vdev_t *vd);
128
129 extern int zfs_vdev_async_write_active_min_dirty_percent;
130
131 /*
132 * By default zfs will check to ensure it is not over the hard memory
133 * limit before each txg. If finer-grained control of this is needed
134 * this value can be set to 1 to enable checking before scanning each
135 * block.
136 */
137 int zfs_scan_strict_mem_lim = B_FALSE;
138
139 /*
140 * Maximum number of parallelly executed bytes per leaf vdev. We attempt
141 * to strike a balance here between keeping the vdev queues full of I/Os
142 * at all times and not overflowing the queues to cause long latency,
143 * which would cause long txg sync times. No matter what, we will not
144 * overload the drives with I/O, since that is protected by
145 * zfs_vdev_scrub_max_active.
146 */
147 unsigned long zfs_scan_vdev_limit = 4 << 20;
148
149 int zfs_scan_issue_strategy = 0;
150 int zfs_scan_legacy = B_FALSE; /* don't queue & sort zios, go direct */
151 unsigned long zfs_scan_max_ext_gap = 2 << 20; /* in bytes */
152
153 /*
154 * fill_weight is non-tunable at runtime, so we copy it at module init from
155 * zfs_scan_fill_weight. Runtime adjustments to zfs_scan_fill_weight would
156 * break queue sorting.
157 */
158 int zfs_scan_fill_weight = 3;
159 static uint64_t fill_weight;
160
161 /* See dsl_scan_should_clear() for details on the memory limit tunables */
162 uint64_t zfs_scan_mem_lim_min = 16 << 20; /* bytes */
163 uint64_t zfs_scan_mem_lim_soft_max = 128 << 20; /* bytes */
164 int zfs_scan_mem_lim_fact = 20; /* fraction of physmem */
165 int zfs_scan_mem_lim_soft_fact = 20; /* fraction of mem lim above */
166
167 int zfs_scrub_min_time_ms = 1000; /* min millisecs to scrub per txg */
168 int zfs_free_min_time_ms = 1000; /* min millisecs to free per txg */
169 int zfs_resilver_min_time_ms = 3000; /* min millisecs to resilver per txg */
170 int zfs_scan_checkpoint_intval = 7200; /* in seconds */
171 int zfs_no_scrub_io = B_FALSE; /* set to disable scrub i/o */
172 int zfs_no_scrub_prefetch = B_FALSE; /* set to disable scrub prefetch */
173 enum ddt_class zfs_scrub_ddt_class_max = DDT_CLASS_DUPLICATE;
174 /* max number of blocks to free in a single TXG */
175 unsigned long zfs_free_max_blocks = 100000;
176
177 /*
178 * We wait a few txgs after importing a pool to begin scanning so that
179 * the import / mounting code isn't held up by scrub / resilver IO.
180 * Unfortunately, it is a bit difficult to determine exactly how long
181 * this will take since userspace will trigger fs mounts asynchronously
182 * and the kernel will create zvol minors asynchronously. As a result,
183 * the value provided here is a bit arbitrary, but represents a
184 * reasonable estimate of how many txgs it will take to finish fully
185 * importing a pool
186 */
187 #define SCAN_IMPORT_WAIT_TXGS 5
188
189 #define DSL_SCAN_IS_SCRUB_RESILVER(scn) \
190 ((scn)->scn_phys.scn_func == POOL_SCAN_SCRUB || \
191 (scn)->scn_phys.scn_func == POOL_SCAN_RESILVER)
192
193 /*
194 * Enable/disable the processing of the free_bpobj object.
195 */
196 int zfs_free_bpobj_enabled = 1;
197
198 /* the order has to match pool_scan_type */
199 static scan_cb_t *scan_funcs[POOL_SCAN_FUNCS] = {
200 NULL,
201 dsl_scan_scrub_cb, /* POOL_SCAN_SCRUB */
202 dsl_scan_scrub_cb, /* POOL_SCAN_RESILVER */
203 };
204
205 /* In core node for the scn->scn_queue. Represents a dataset to be scanned */
206 typedef struct {
207 uint64_t sds_dsobj;
208 uint64_t sds_txg;
209 avl_node_t sds_node;
210 } scan_ds_t;
211
212 /*
213 * This controls what conditions are placed on dsl_scan_sync_state():
214 * SYNC_OPTIONAL) write out scn_phys iff scn_bytes_pending == 0
215 * SYNC_MANDATORY) write out scn_phys always. scn_bytes_pending must be 0.
216 * SYNC_CACHED) if scn_bytes_pending == 0, write out scn_phys. Otherwise
217 * write out the scn_phys_cached version.
218 * See dsl_scan_sync_state for details.
219 */
220 typedef enum {
221 SYNC_OPTIONAL,
222 SYNC_MANDATORY,
223 SYNC_CACHED
224 } state_sync_type_t;
225
226 /*
227 * This struct represents the minimum information needed to reconstruct a
228 * zio for sequential scanning. This is useful because many of these will
229 * accumulate in the sequential IO queues before being issued, so saving
230 * memory matters here.
231 */
232 typedef struct scan_io {
233 /* fields from blkptr_t */
234 uint64_t sio_offset;
235 uint64_t sio_blk_prop;
236 uint64_t sio_phys_birth;
237 uint64_t sio_birth;
238 zio_cksum_t sio_cksum;
239 uint32_t sio_asize;
240
241 /* fields from zio_t */
242 int sio_flags;
243 zbookmark_phys_t sio_zb;
244
245 /* members for queue sorting */
246 union {
247 avl_node_t sio_addr_node; /* link into issueing queue */
248 list_node_t sio_list_node; /* link for issuing to disk */
249 } sio_nodes;
250 } scan_io_t;
251
252 struct dsl_scan_io_queue {
253 dsl_scan_t *q_scn; /* associated dsl_scan_t */
254 vdev_t *q_vd; /* top-level vdev that this queue represents */
255
256 /* trees used for sorting I/Os and extents of I/Os */
257 range_tree_t *q_exts_by_addr;
258 avl_tree_t q_exts_by_size;
259 avl_tree_t q_sios_by_addr;
260
261 /* members for zio rate limiting */
262 uint64_t q_maxinflight_bytes;
263 uint64_t q_inflight_bytes;
264 kcondvar_t q_zio_cv; /* used under vd->vdev_scan_io_queue_lock */
265
266 /* per txg statistics */
267 uint64_t q_total_seg_size_this_txg;
268 uint64_t q_segs_this_txg;
269 uint64_t q_total_zio_size_this_txg;
270 uint64_t q_zios_this_txg;
271 };
272
273 /* private data for dsl_scan_prefetch_cb() */
274 typedef struct scan_prefetch_ctx {
275 refcount_t spc_refcnt; /* refcount for memory management */
276 dsl_scan_t *spc_scn; /* dsl_scan_t for the pool */
277 boolean_t spc_root; /* is this prefetch for an objset? */
278 uint8_t spc_indblkshift; /* dn_indblkshift of current dnode */
279 uint16_t spc_datablkszsec; /* dn_idatablkszsec of current dnode */
280 } scan_prefetch_ctx_t;
281
282 /* private data for dsl_scan_prefetch() */
283 typedef struct scan_prefetch_issue_ctx {
284 avl_node_t spic_avl_node; /* link into scn->scn_prefetch_queue */
285 scan_prefetch_ctx_t *spic_spc; /* spc for the callback */
286 blkptr_t spic_bp; /* bp to prefetch */
287 zbookmark_phys_t spic_zb; /* bookmark to prefetch */
288 } scan_prefetch_issue_ctx_t;
289
290 static void scan_exec_io(dsl_pool_t *dp, const blkptr_t *bp, int zio_flags,
291 const zbookmark_phys_t *zb, dsl_scan_io_queue_t *queue);
292 static void scan_io_queue_insert_impl(dsl_scan_io_queue_t *queue,
293 scan_io_t *sio);
294
295 static dsl_scan_io_queue_t *scan_io_queue_create(vdev_t *vd);
296 static void scan_io_queues_destroy(dsl_scan_t *scn);
297
298 static kmem_cache_t *sio_cache;
299
300 void
301 scan_init(void)
302 {
303 /*
304 * This is used in ext_size_compare() to weight segments
305 * based on how sparse they are. This cannot be changed
306 * mid-scan and the tree comparison functions don't currently
307 * have a mechanism for passing additional context to the
308 * compare functions. Thus we store this value globally and
309 * we only allow it to be set at module initialization time
310 */
311 fill_weight = zfs_scan_fill_weight;
312
313 sio_cache = kmem_cache_create("sio_cache",
314 sizeof (scan_io_t), 0, NULL, NULL, NULL, NULL, NULL, 0);
315 }
316
317 void
318 scan_fini(void)
319 {
320 kmem_cache_destroy(sio_cache);
321 }
322
323 static inline boolean_t
324 dsl_scan_is_running(const dsl_scan_t *scn)
325 {
326 return (scn->scn_phys.scn_state == DSS_SCANNING);
327 }
328
329 boolean_t
330 dsl_scan_resilvering(dsl_pool_t *dp)
331 {
332 return (dsl_scan_is_running(dp->dp_scan) &&
333 dp->dp_scan->scn_phys.scn_func == POOL_SCAN_RESILVER);
334 }
335
336 static inline void
337 sio2bp(const scan_io_t *sio, blkptr_t *bp, uint64_t vdev_id)
338 {
339 bzero(bp, sizeof (*bp));
340 DVA_SET_ASIZE(&bp->blk_dva[0], sio->sio_asize);
341 DVA_SET_VDEV(&bp->blk_dva[0], vdev_id);
342 DVA_SET_OFFSET(&bp->blk_dva[0], sio->sio_offset);
343 bp->blk_prop = sio->sio_blk_prop;
344 bp->blk_phys_birth = sio->sio_phys_birth;
345 bp->blk_birth = sio->sio_birth;
346 bp->blk_fill = 1; /* we always only work with data pointers */
347 bp->blk_cksum = sio->sio_cksum;
348 }
349
350 static inline void
351 bp2sio(const blkptr_t *bp, scan_io_t *sio, int dva_i)
352 {
353 /* we discard the vdev id, since we can deduce it from the queue */
354 sio->sio_offset = DVA_GET_OFFSET(&bp->blk_dva[dva_i]);
355 sio->sio_asize = DVA_GET_ASIZE(&bp->blk_dva[dva_i]);
356 sio->sio_blk_prop = bp->blk_prop;
357 sio->sio_phys_birth = bp->blk_phys_birth;
358 sio->sio_birth = bp->blk_birth;
359 sio->sio_cksum = bp->blk_cksum;
360 }
361
362 int
363 dsl_scan_init(dsl_pool_t *dp, uint64_t txg)
364 {
365 int err;
366 dsl_scan_t *scn;
367 spa_t *spa = dp->dp_spa;
368 uint64_t f;
369
370 scn = dp->dp_scan = kmem_zalloc(sizeof (dsl_scan_t), KM_SLEEP);
371 scn->scn_dp = dp;
372
373 /*
374 * It's possible that we're resuming a scan after a reboot so
375 * make sure that the scan_async_destroying flag is initialized
376 * appropriately.
377 */
378 ASSERT(!scn->scn_async_destroying);
379 scn->scn_async_destroying = spa_feature_is_active(dp->dp_spa,
380 SPA_FEATURE_ASYNC_DESTROY);
381
382 /*
383 * Calculate the max number of in-flight bytes for pool-wide
384 * scanning operations (minimum 1MB). Limits for the issuing
385 * phase are done per top-level vdev and are handled separately.
386 */
387 scn->scn_maxinflight_bytes = MAX(zfs_scan_vdev_limit *
388 dsl_scan_count_leaves(spa->spa_root_vdev), 1ULL << 20);
389
390 bcopy(&scn->scn_phys, &scn->scn_phys_cached, sizeof (scn->scn_phys));
391 avl_create(&scn->scn_queue, scan_ds_queue_compare, sizeof (scan_ds_t),
392 offsetof(scan_ds_t, sds_node));
393 avl_create(&scn->scn_prefetch_queue, scan_prefetch_queue_compare,
394 sizeof (scan_prefetch_issue_ctx_t),
395 offsetof(scan_prefetch_issue_ctx_t, spic_avl_node));
396
397 err = zap_lookup(dp->dp_meta_objset, DMU_POOL_DIRECTORY_OBJECT,
398 "scrub_func", sizeof (uint64_t), 1, &f);
399 if (err == 0) {
400 /*
401 * There was an old-style scrub in progress. Restart a
402 * new-style scrub from the beginning.
403 */
404 scn->scn_restart_txg = txg;
405 zfs_dbgmsg("old-style scrub was in progress; "
406 "restarting new-style scrub in txg %llu",
407 (longlong_t)scn->scn_restart_txg);
408
409 /*
410 * Load the queue obj from the old location so that it
411 * can be freed by dsl_scan_done().
412 */
413 (void) zap_lookup(dp->dp_meta_objset, DMU_POOL_DIRECTORY_OBJECT,
414 "scrub_queue", sizeof (uint64_t), 1,
415 &scn->scn_phys.scn_queue_obj);
416 } else {
417 err = zap_lookup(dp->dp_meta_objset, DMU_POOL_DIRECTORY_OBJECT,
418 DMU_POOL_SCAN, sizeof (uint64_t), SCAN_PHYS_NUMINTS,
419 &scn->scn_phys);
420 /*
421 * Detect if the pool contains the signature of #2094. If it
422 * does properly update the scn->scn_phys structure and notify
423 * the administrator by setting an errata for the pool.
424 */
425 if (err == EOVERFLOW) {
426 uint64_t zaptmp[SCAN_PHYS_NUMINTS + 1];
427 VERIFY3S(SCAN_PHYS_NUMINTS, ==, 24);
428 VERIFY3S(offsetof(dsl_scan_phys_t, scn_flags), ==,
429 (23 * sizeof (uint64_t)));
430
431 err = zap_lookup(dp->dp_meta_objset,
432 DMU_POOL_DIRECTORY_OBJECT, DMU_POOL_SCAN,
433 sizeof (uint64_t), SCAN_PHYS_NUMINTS + 1, &zaptmp);
434 if (err == 0) {
435 uint64_t overflow = zaptmp[SCAN_PHYS_NUMINTS];
436
437 if (overflow & ~DSL_SCAN_FLAGS_MASK ||
438 scn->scn_async_destroying) {
439 spa->spa_errata =
440 ZPOOL_ERRATA_ZOL_2094_ASYNC_DESTROY;
441 return (EOVERFLOW);
442 }
443
444 bcopy(zaptmp, &scn->scn_phys,
445 SCAN_PHYS_NUMINTS * sizeof (uint64_t));
446 scn->scn_phys.scn_flags = overflow;
447
448 /* Required scrub already in progress. */
449 if (scn->scn_phys.scn_state == DSS_FINISHED ||
450 scn->scn_phys.scn_state == DSS_CANCELED)
451 spa->spa_errata =
452 ZPOOL_ERRATA_ZOL_2094_SCRUB;
453 }
454 }
455
456 if (err == ENOENT)
457 return (0);
458 else if (err)
459 return (err);
460
461 /*
462 * We might be restarting after a reboot, so jump the issued
463 * counter to how far we've scanned. We know we're consistent
464 * up to here.
465 */
466 scn->scn_issued_before_pass = scn->scn_phys.scn_examined;
467
468 if (dsl_scan_is_running(scn) &&
469 spa_prev_software_version(dp->dp_spa) < SPA_VERSION_SCAN) {
470 /*
471 * A new-type scrub was in progress on an old
472 * pool, and the pool was accessed by old
473 * software. Restart from the beginning, since
474 * the old software may have changed the pool in
475 * the meantime.
476 */
477 scn->scn_restart_txg = txg;
478 zfs_dbgmsg("new-style scrub was modified "
479 "by old software; restarting in txg %llu",
480 (longlong_t)scn->scn_restart_txg);
481 }
482 }
483
484 /* reload the queue into the in-core state */
485 if (scn->scn_phys.scn_queue_obj != 0) {
486 zap_cursor_t zc;
487 zap_attribute_t za;
488
489 for (zap_cursor_init(&zc, dp->dp_meta_objset,
490 scn->scn_phys.scn_queue_obj);
491 zap_cursor_retrieve(&zc, &za) == 0;
492 (void) zap_cursor_advance(&zc)) {
493 scan_ds_queue_insert(scn,
494 zfs_strtonum(za.za_name, NULL),
495 za.za_first_integer);
496 }
497 zap_cursor_fini(&zc);
498 }
499
500 spa_scan_stat_init(spa);
501 return (0);
502 }
503
504 void
505 dsl_scan_fini(dsl_pool_t *dp)
506 {
507 if (dp->dp_scan != NULL) {
508 dsl_scan_t *scn = dp->dp_scan;
509
510 if (scn->scn_taskq != NULL)
511 taskq_destroy(scn->scn_taskq);
512 scan_ds_queue_clear(scn);
513 avl_destroy(&scn->scn_queue);
514 avl_destroy(&scn->scn_prefetch_queue);
515
516 kmem_free(dp->dp_scan, sizeof (dsl_scan_t));
517 dp->dp_scan = NULL;
518 }
519 }
520
521 static boolean_t
522 dsl_scan_restarting(dsl_scan_t *scn, dmu_tx_t *tx)
523 {
524 return (scn->scn_restart_txg != 0 &&
525 scn->scn_restart_txg <= tx->tx_txg);
526 }
527
528 boolean_t
529 dsl_scan_scrubbing(const dsl_pool_t *dp)
530 {
531 dsl_scan_phys_t *scn_phys = &dp->dp_scan->scn_phys;
532
533 return (scn_phys->scn_state == DSS_SCANNING &&
534 scn_phys->scn_func == POOL_SCAN_SCRUB);
535 }
536
537 boolean_t
538 dsl_scan_is_paused_scrub(const dsl_scan_t *scn)
539 {
540 return (dsl_scan_scrubbing(scn->scn_dp) &&
541 scn->scn_phys.scn_flags & DSF_SCRUB_PAUSED);
542 }
543
544 /*
545 * Writes out a persistent dsl_scan_phys_t record to the pool directory.
546 * Because we can be running in the block sorting algorithm, we do not always
547 * want to write out the record, only when it is "safe" to do so. This safety
548 * condition is achieved by making sure that the sorting queues are empty
549 * (scn_bytes_pending == 0). When this condition is not true, the sync'd state
550 * is inconsistent with how much actual scanning progress has been made. The
551 * kind of sync to be performed is specified by the sync_type argument. If the
552 * sync is optional, we only sync if the queues are empty. If the sync is
553 * mandatory, we do a hard ASSERT to make sure that the queues are empty. The
554 * third possible state is a "cached" sync. This is done in response to:
555 * 1) The dataset that was in the last sync'd dsl_scan_phys_t having been
556 * destroyed, so we wouldn't be able to restart scanning from it.
557 * 2) The snapshot that was in the last sync'd dsl_scan_phys_t having been
558 * superseded by a newer snapshot.
559 * 3) The dataset that was in the last sync'd dsl_scan_phys_t having been
560 * swapped with its clone.
561 * In all cases, a cached sync simply rewrites the last record we've written,
562 * just slightly modified. For the modifications that are performed to the
563 * last written dsl_scan_phys_t, see dsl_scan_ds_destroyed,
564 * dsl_scan_ds_snapshotted and dsl_scan_ds_clone_swapped.
565 */
566 static void
567 dsl_scan_sync_state(dsl_scan_t *scn, dmu_tx_t *tx, state_sync_type_t sync_type)
568 {
569 int i;
570 spa_t *spa = scn->scn_dp->dp_spa;
571
572 ASSERT(sync_type != SYNC_MANDATORY || scn->scn_bytes_pending == 0);
573 if (scn->scn_bytes_pending == 0) {
574 for (i = 0; i < spa->spa_root_vdev->vdev_children; i++) {
575 vdev_t *vd = spa->spa_root_vdev->vdev_child[i];
576 dsl_scan_io_queue_t *q = vd->vdev_scan_io_queue;
577
578 if (q == NULL)
579 continue;
580
581 mutex_enter(&vd->vdev_scan_io_queue_lock);
582 ASSERT3P(avl_first(&q->q_sios_by_addr), ==, NULL);
583 ASSERT3P(avl_first(&q->q_exts_by_size), ==, NULL);
584 ASSERT3P(range_tree_first(q->q_exts_by_addr), ==, NULL);
585 mutex_exit(&vd->vdev_scan_io_queue_lock);
586 }
587
588 if (scn->scn_phys.scn_queue_obj != 0)
589 scan_ds_queue_sync(scn, tx);
590 VERIFY0(zap_update(scn->scn_dp->dp_meta_objset,
591 DMU_POOL_DIRECTORY_OBJECT,
592 DMU_POOL_SCAN, sizeof (uint64_t), SCAN_PHYS_NUMINTS,
593 &scn->scn_phys, tx));
594 bcopy(&scn->scn_phys, &scn->scn_phys_cached,
595 sizeof (scn->scn_phys));
596
597 if (scn->scn_checkpointing)
598 zfs_dbgmsg("finish scan checkpoint");
599
600 scn->scn_checkpointing = B_FALSE;
601 scn->scn_last_checkpoint = ddi_get_lbolt();
602 } else if (sync_type == SYNC_CACHED) {
603 VERIFY0(zap_update(scn->scn_dp->dp_meta_objset,
604 DMU_POOL_DIRECTORY_OBJECT,
605 DMU_POOL_SCAN, sizeof (uint64_t), SCAN_PHYS_NUMINTS,
606 &scn->scn_phys_cached, tx));
607 }
608 }
609
610 /* ARGSUSED */
611 static int
612 dsl_scan_setup_check(void *arg, dmu_tx_t *tx)
613 {
614 dsl_scan_t *scn = dmu_tx_pool(tx)->dp_scan;
615
616 if (dsl_scan_is_running(scn))
617 return (SET_ERROR(EBUSY));
618
619 return (0);
620 }
621
622 static void
623 dsl_scan_setup_sync(void *arg, dmu_tx_t *tx)
624 {
625 dsl_scan_t *scn = dmu_tx_pool(tx)->dp_scan;
626 pool_scan_func_t *funcp = arg;
627 dmu_object_type_t ot = 0;
628 dsl_pool_t *dp = scn->scn_dp;
629 spa_t *spa = dp->dp_spa;
630
631 ASSERT(!dsl_scan_is_running(scn));
632 ASSERT(*funcp > POOL_SCAN_NONE && *funcp < POOL_SCAN_FUNCS);
633 bzero(&scn->scn_phys, sizeof (scn->scn_phys));
634 scn->scn_phys.scn_func = *funcp;
635 scn->scn_phys.scn_state = DSS_SCANNING;
636 scn->scn_phys.scn_min_txg = 0;
637 scn->scn_phys.scn_max_txg = tx->tx_txg;
638 scn->scn_phys.scn_ddt_class_max = DDT_CLASSES - 1; /* the entire DDT */
639 scn->scn_phys.scn_start_time = gethrestime_sec();
640 scn->scn_phys.scn_errors = 0;
641 scn->scn_phys.scn_to_examine = spa->spa_root_vdev->vdev_stat.vs_alloc;
642 scn->scn_issued_before_pass = 0;
643 scn->scn_restart_txg = 0;
644 scn->scn_done_txg = 0;
645 scn->scn_last_checkpoint = 0;
646 scn->scn_checkpointing = B_FALSE;
647 spa_scan_stat_init(spa);
648
649 if (DSL_SCAN_IS_SCRUB_RESILVER(scn)) {
650 scn->scn_phys.scn_ddt_class_max = zfs_scrub_ddt_class_max;
651
652 /* rewrite all disk labels */
653 vdev_config_dirty(spa->spa_root_vdev);
654
655 if (vdev_resilver_needed(spa->spa_root_vdev,
656 &scn->scn_phys.scn_min_txg, &scn->scn_phys.scn_max_txg)) {
657 spa_event_notify(spa, NULL, NULL,
658 ESC_ZFS_RESILVER_START);
659 } else {
660 spa_event_notify(spa, NULL, NULL, ESC_ZFS_SCRUB_START);
661 }
662
663 spa->spa_scrub_started = B_TRUE;
664 /*
665 * If this is an incremental scrub, limit the DDT scrub phase
666 * to just the auto-ditto class (for correctness); the rest
667 * of the scrub should go faster using top-down pruning.
668 */
669 if (scn->scn_phys.scn_min_txg > TXG_INITIAL)
670 scn->scn_phys.scn_ddt_class_max = DDT_CLASS_DITTO;
671
672 }
673
674 /* back to the generic stuff */
675
676 if (dp->dp_blkstats == NULL) {
677 dp->dp_blkstats =
678 vmem_alloc(sizeof (zfs_all_blkstats_t), KM_SLEEP);
679 mutex_init(&dp->dp_blkstats->zab_lock, NULL,
680 MUTEX_DEFAULT, NULL);
681 }
682 bzero(&dp->dp_blkstats->zab_type, sizeof (dp->dp_blkstats->zab_type));
683
684 if (spa_version(spa) < SPA_VERSION_DSL_SCRUB)
685 ot = DMU_OT_ZAP_OTHER;
686
687 scn->scn_phys.scn_queue_obj = zap_create(dp->dp_meta_objset,
688 ot ? ot : DMU_OT_SCAN_QUEUE, DMU_OT_NONE, 0, tx);
689
690 bcopy(&scn->scn_phys, &scn->scn_phys_cached, sizeof (scn->scn_phys));
691
692 dsl_scan_sync_state(scn, tx, SYNC_MANDATORY);
693
694 spa_history_log_internal(spa, "scan setup", tx,
695 "func=%u mintxg=%llu maxtxg=%llu",
696 *funcp, scn->scn_phys.scn_min_txg, scn->scn_phys.scn_max_txg);
697 }
698
699 /*
700 * Called by the ZFS_IOC_POOL_SCAN ioctl to start a scrub or resilver.
701 * Can also be called to resume a paused scrub.
702 */
703 int
704 dsl_scan(dsl_pool_t *dp, pool_scan_func_t func)
705 {
706 spa_t *spa = dp->dp_spa;
707 dsl_scan_t *scn = dp->dp_scan;
708
709 /*
710 * Purge all vdev caches and probe all devices. We do this here
711 * rather than in sync context because this requires a writer lock
712 * on the spa_config lock, which we can't do from sync context. The
713 * spa_scrub_reopen flag indicates that vdev_open() should not
714 * attempt to start another scrub.
715 */
716 spa_vdev_state_enter(spa, SCL_NONE);
717 spa->spa_scrub_reopen = B_TRUE;
718 vdev_reopen(spa->spa_root_vdev);
719 spa->spa_scrub_reopen = B_FALSE;
720 (void) spa_vdev_state_exit(spa, NULL, 0);
721
722 if (func == POOL_SCAN_SCRUB && dsl_scan_is_paused_scrub(scn)) {
723 /* got scrub start cmd, resume paused scrub */
724 int err = dsl_scrub_set_pause_resume(scn->scn_dp,
725 POOL_SCRUB_NORMAL);
726 if (err == 0) {
727 spa_event_notify(spa, NULL, NULL, ESC_ZFS_SCRUB_RESUME);
728 return (ECANCELED);
729 }
730
731 return (SET_ERROR(err));
732 }
733
734 return (dsl_sync_task(spa_name(spa), dsl_scan_setup_check,
735 dsl_scan_setup_sync, &func, 0, ZFS_SPACE_CHECK_NONE));
736 }
737
738 /* ARGSUSED */
739 static void
740 dsl_scan_done(dsl_scan_t *scn, boolean_t complete, dmu_tx_t *tx)
741 {
742 static const char *old_names[] = {
743 "scrub_bookmark",
744 "scrub_ddt_bookmark",
745 "scrub_ddt_class_max",
746 "scrub_queue",
747 "scrub_min_txg",
748 "scrub_max_txg",
749 "scrub_func",
750 "scrub_errors",
751 NULL
752 };
753
754 dsl_pool_t *dp = scn->scn_dp;
755 spa_t *spa = dp->dp_spa;
756 int i;
757
758 /* Remove any remnants of an old-style scrub. */
759 for (i = 0; old_names[i]; i++) {
760 (void) zap_remove(dp->dp_meta_objset,
761 DMU_POOL_DIRECTORY_OBJECT, old_names[i], tx);
762 }
763
764 if (scn->scn_phys.scn_queue_obj != 0) {
765 VERIFY0(dmu_object_free(dp->dp_meta_objset,
766 scn->scn_phys.scn_queue_obj, tx));
767 scn->scn_phys.scn_queue_obj = 0;
768 }
769 scan_ds_queue_clear(scn);
770
771 scn->scn_phys.scn_flags &= ~DSF_SCRUB_PAUSED;
772
773 /*
774 * If we were "restarted" from a stopped state, don't bother
775 * with anything else.
776 */
777 if (!dsl_scan_is_running(scn)) {
778 ASSERT(!scn->scn_is_sorted);
779 return;
780 }
781
782 if (scn->scn_is_sorted) {
783 scan_io_queues_destroy(scn);
784 scn->scn_is_sorted = B_FALSE;
785
786 if (scn->scn_taskq != NULL) {
787 taskq_destroy(scn->scn_taskq);
788 scn->scn_taskq = NULL;
789 }
790 }
791
792 scn->scn_phys.scn_state = complete ? DSS_FINISHED : DSS_CANCELED;
793
794 if (dsl_scan_restarting(scn, tx))
795 spa_history_log_internal(spa, "scan aborted, restarting", tx,
796 "errors=%llu", spa_get_errlog_size(spa));
797 else if (!complete)
798 spa_history_log_internal(spa, "scan cancelled", tx,
799 "errors=%llu", spa_get_errlog_size(spa));
800 else
801 spa_history_log_internal(spa, "scan done", tx,
802 "errors=%llu", spa_get_errlog_size(spa));
803
804 if (DSL_SCAN_IS_SCRUB_RESILVER(scn)) {
805 spa->spa_scrub_started = B_FALSE;
806 spa->spa_scrub_active = B_FALSE;
807
808 /*
809 * If the scrub/resilver completed, update all DTLs to
810 * reflect this. Whether it succeeded or not, vacate
811 * all temporary scrub DTLs.
812 */
813 vdev_dtl_reassess(spa->spa_root_vdev, tx->tx_txg,
814 complete ? scn->scn_phys.scn_max_txg : 0, B_TRUE);
815 if (complete) {
816 spa_event_notify(spa, NULL, NULL,
817 scn->scn_phys.scn_min_txg ?
818 ESC_ZFS_RESILVER_FINISH : ESC_ZFS_SCRUB_FINISH);
819 }
820 spa_errlog_rotate(spa);
821
822 /*
823 * We may have finished replacing a device.
824 * Let the async thread assess this and handle the detach.
825 */
826 spa_async_request(spa, SPA_ASYNC_RESILVER_DONE);
827 }
828
829 scn->scn_phys.scn_end_time = gethrestime_sec();
830
831 if (spa->spa_errata == ZPOOL_ERRATA_ZOL_2094_SCRUB)
832 spa->spa_errata = 0;
833
834 ASSERT(!dsl_scan_is_running(scn));
835 }
836
837 /* ARGSUSED */
838 static int
839 dsl_scan_cancel_check(void *arg, dmu_tx_t *tx)
840 {
841 dsl_scan_t *scn = dmu_tx_pool(tx)->dp_scan;
842
843 if (!dsl_scan_is_running(scn))
844 return (SET_ERROR(ENOENT));
845 return (0);
846 }
847
848 /* ARGSUSED */
849 static void
850 dsl_scan_cancel_sync(void *arg, dmu_tx_t *tx)
851 {
852 dsl_scan_t *scn = dmu_tx_pool(tx)->dp_scan;
853
854 dsl_scan_done(scn, B_FALSE, tx);
855 dsl_scan_sync_state(scn, tx, SYNC_MANDATORY);
856 spa_event_notify(scn->scn_dp->dp_spa, NULL, NULL, ESC_ZFS_SCRUB_ABORT);
857 }
858
859 int
860 dsl_scan_cancel(dsl_pool_t *dp)
861 {
862 return (dsl_sync_task(spa_name(dp->dp_spa), dsl_scan_cancel_check,
863 dsl_scan_cancel_sync, NULL, 3, ZFS_SPACE_CHECK_RESERVED));
864 }
865
866 static int
867 dsl_scrub_pause_resume_check(void *arg, dmu_tx_t *tx)
868 {
869 pool_scrub_cmd_t *cmd = arg;
870 dsl_pool_t *dp = dmu_tx_pool(tx);
871 dsl_scan_t *scn = dp->dp_scan;
872
873 if (*cmd == POOL_SCRUB_PAUSE) {
874 /* can't pause a scrub when there is no in-progress scrub */
875 if (!dsl_scan_scrubbing(dp))
876 return (SET_ERROR(ENOENT));
877
878 /* can't pause a paused scrub */
879 if (dsl_scan_is_paused_scrub(scn))
880 return (SET_ERROR(EBUSY));
881 } else if (*cmd != POOL_SCRUB_NORMAL) {
882 return (SET_ERROR(ENOTSUP));
883 }
884
885 return (0);
886 }
887
888 static void
889 dsl_scrub_pause_resume_sync(void *arg, dmu_tx_t *tx)
890 {
891 pool_scrub_cmd_t *cmd = arg;
892 dsl_pool_t *dp = dmu_tx_pool(tx);
893 spa_t *spa = dp->dp_spa;
894 dsl_scan_t *scn = dp->dp_scan;
895
896 if (*cmd == POOL_SCRUB_PAUSE) {
897 /* can't pause a scrub when there is no in-progress scrub */
898 spa->spa_scan_pass_scrub_pause = gethrestime_sec();
899 scn->scn_phys.scn_flags |= DSF_SCRUB_PAUSED;
900 dsl_scan_sync_state(scn, tx, SYNC_CACHED);
901 spa_event_notify(spa, NULL, NULL, ESC_ZFS_SCRUB_PAUSED);
902 } else {
903 ASSERT3U(*cmd, ==, POOL_SCRUB_NORMAL);
904 if (dsl_scan_is_paused_scrub(scn)) {
905 /*
906 * We need to keep track of how much time we spend
907 * paused per pass so that we can adjust the scrub rate
908 * shown in the output of 'zpool status'
909 */
910 spa->spa_scan_pass_scrub_spent_paused +=
911 gethrestime_sec() - spa->spa_scan_pass_scrub_pause;
912 spa->spa_scan_pass_scrub_pause = 0;
913 scn->scn_phys.scn_flags &= ~DSF_SCRUB_PAUSED;
914 dsl_scan_sync_state(scn, tx, SYNC_CACHED);
915 }
916 }
917 }
918
919 /*
920 * Set scrub pause/resume state if it makes sense to do so
921 */
922 int
923 dsl_scrub_set_pause_resume(const dsl_pool_t *dp, pool_scrub_cmd_t cmd)
924 {
925 return (dsl_sync_task(spa_name(dp->dp_spa),
926 dsl_scrub_pause_resume_check, dsl_scrub_pause_resume_sync, &cmd, 3,
927 ZFS_SPACE_CHECK_RESERVED));
928 }
929
930
931 /* start a new scan, or restart an existing one. */
932 void
933 dsl_resilver_restart(dsl_pool_t *dp, uint64_t txg)
934 {
935 if (txg == 0) {
936 dmu_tx_t *tx;
937 tx = dmu_tx_create_dd(dp->dp_mos_dir);
938 VERIFY(0 == dmu_tx_assign(tx, TXG_WAIT));
939
940 txg = dmu_tx_get_txg(tx);
941 dp->dp_scan->scn_restart_txg = txg;
942 dmu_tx_commit(tx);
943 } else {
944 dp->dp_scan->scn_restart_txg = txg;
945 }
946 zfs_dbgmsg("restarting resilver txg=%llu", (longlong_t)txg);
947 }
948
949 void
950 dsl_free(dsl_pool_t *dp, uint64_t txg, const blkptr_t *bp)
951 {
952 zio_free(dp->dp_spa, txg, bp);
953 }
954
955 void
956 dsl_free_sync(zio_t *pio, dsl_pool_t *dp, uint64_t txg, const blkptr_t *bpp)
957 {
958 ASSERT(dsl_pool_sync_context(dp));
959 zio_nowait(zio_free_sync(pio, dp->dp_spa, txg, bpp, pio->io_flags));
960 }
961
962 static int
963 scan_ds_queue_compare(const void *a, const void *b)
964 {
965 const scan_ds_t *sds_a = a, *sds_b = b;
966
967 if (sds_a->sds_dsobj < sds_b->sds_dsobj)
968 return (-1);
969 if (sds_a->sds_dsobj == sds_b->sds_dsobj)
970 return (0);
971 return (1);
972 }
973
974 static void
975 scan_ds_queue_clear(dsl_scan_t *scn)
976 {
977 void *cookie = NULL;
978 scan_ds_t *sds;
979 while ((sds = avl_destroy_nodes(&scn->scn_queue, &cookie)) != NULL) {
980 kmem_free(sds, sizeof (*sds));
981 }
982 }
983
984 static boolean_t
985 scan_ds_queue_contains(dsl_scan_t *scn, uint64_t dsobj, uint64_t *txg)
986 {
987 scan_ds_t srch, *sds;
988
989 srch.sds_dsobj = dsobj;
990 sds = avl_find(&scn->scn_queue, &srch, NULL);
991 if (sds != NULL && txg != NULL)
992 *txg = sds->sds_txg;
993 return (sds != NULL);
994 }
995
996 static void
997 scan_ds_queue_insert(dsl_scan_t *scn, uint64_t dsobj, uint64_t txg)
998 {
999 scan_ds_t *sds;
1000 avl_index_t where;
1001
1002 sds = kmem_zalloc(sizeof (*sds), KM_SLEEP);
1003 sds->sds_dsobj = dsobj;
1004 sds->sds_txg = txg;
1005
1006 VERIFY3P(avl_find(&scn->scn_queue, sds, &where), ==, NULL);
1007 avl_insert(&scn->scn_queue, sds, where);
1008 }
1009
1010 static void
1011 scan_ds_queue_remove(dsl_scan_t *scn, uint64_t dsobj)
1012 {
1013 scan_ds_t srch, *sds;
1014
1015 srch.sds_dsobj = dsobj;
1016
1017 sds = avl_find(&scn->scn_queue, &srch, NULL);
1018 VERIFY(sds != NULL);
1019 avl_remove(&scn->scn_queue, sds);
1020 kmem_free(sds, sizeof (*sds));
1021 }
1022
1023 static void
1024 scan_ds_queue_sync(dsl_scan_t *scn, dmu_tx_t *tx)
1025 {
1026 dsl_pool_t *dp = scn->scn_dp;
1027 spa_t *spa = dp->dp_spa;
1028 dmu_object_type_t ot = (spa_version(spa) >= SPA_VERSION_DSL_SCRUB) ?
1029 DMU_OT_SCAN_QUEUE : DMU_OT_ZAP_OTHER;
1030
1031 ASSERT0(scn->scn_bytes_pending);
1032 ASSERT(scn->scn_phys.scn_queue_obj != 0);
1033
1034 VERIFY0(dmu_object_free(dp->dp_meta_objset,
1035 scn->scn_phys.scn_queue_obj, tx));
1036 scn->scn_phys.scn_queue_obj = zap_create(dp->dp_meta_objset, ot,
1037 DMU_OT_NONE, 0, tx);
1038 for (scan_ds_t *sds = avl_first(&scn->scn_queue);
1039 sds != NULL; sds = AVL_NEXT(&scn->scn_queue, sds)) {
1040 VERIFY0(zap_add_int_key(dp->dp_meta_objset,
1041 scn->scn_phys.scn_queue_obj, sds->sds_dsobj,
1042 sds->sds_txg, tx));
1043 }
1044 }
1045
1046 /*
1047 * Computes the memory limit state that we're currently in. A sorted scan
1048 * needs quite a bit of memory to hold the sorting queue, so we need to
1049 * reasonably constrain the size so it doesn't impact overall system
1050 * performance. We compute two limits:
1051 * 1) Hard memory limit: if the amount of memory used by the sorting
1052 * queues on a pool gets above this value, we stop the metadata
1053 * scanning portion and start issuing the queued up and sorted
1054 * I/Os to reduce memory usage.
1055 * This limit is calculated as a fraction of physmem (by default 5%).
1056 * We constrain the lower bound of the hard limit to an absolute
1057 * minimum of zfs_scan_mem_lim_min (default: 16 MiB). We also constrain
1058 * the upper bound to 5% of the total pool size - no chance we'll
1059 * ever need that much memory, but just to keep the value in check.
1060 * 2) Soft memory limit: once we hit the hard memory limit, we start
1061 * issuing I/O to reduce queue memory usage, but we don't want to
1062 * completely empty out the queues, since we might be able to find I/Os
1063 * that will fill in the gaps of our non-sequential IOs at some point
1064 * in the future. So we stop the issuing of I/Os once the amount of
1065 * memory used drops below the soft limit (at which point we stop issuing
1066 * I/O and start scanning metadata again).
1067 *
1068 * This limit is calculated by subtracting a fraction of the hard
1069 * limit from the hard limit. By default this fraction is 5%, so
1070 * the soft limit is 95% of the hard limit. We cap the size of the
1071 * difference between the hard and soft limits at an absolute
1072 * maximum of zfs_scan_mem_lim_soft_max (default: 128 MiB) - this is
1073 * sufficient to not cause too frequent switching between the
1074 * metadata scan and I/O issue (even at 2k recordsize, 128 MiB's
1075 * worth of queues is about 1.2 GiB of on-pool data, so scanning
1076 * that should take at least a decent fraction of a second).
1077 */
1078 static boolean_t
1079 dsl_scan_should_clear(dsl_scan_t *scn)
1080 {
1081 vdev_t *rvd = scn->scn_dp->dp_spa->spa_root_vdev;
1082 uint64_t mlim_hard, mlim_soft, mused;
1083 uint64_t alloc = metaslab_class_get_alloc(spa_normal_class(
1084 scn->scn_dp->dp_spa));
1085
1086 mlim_hard = MAX((physmem / zfs_scan_mem_lim_fact) * PAGESIZE,
1087 zfs_scan_mem_lim_min);
1088 mlim_hard = MIN(mlim_hard, alloc / 20);
1089 mlim_soft = mlim_hard - MIN(mlim_hard / zfs_scan_mem_lim_soft_fact,
1090 zfs_scan_mem_lim_soft_max);
1091 mused = 0;
1092 for (uint64_t i = 0; i < rvd->vdev_children; i++) {
1093 vdev_t *tvd = rvd->vdev_child[i];
1094 dsl_scan_io_queue_t *queue;
1095
1096 mutex_enter(&tvd->vdev_scan_io_queue_lock);
1097 queue = tvd->vdev_scan_io_queue;
1098 if (queue != NULL) {
1099 /* #extents in exts_by_size = # in exts_by_addr */
1100 mused += avl_numnodes(&queue->q_exts_by_size) *
1101 sizeof (range_seg_t) +
1102 avl_numnodes(&queue->q_sios_by_addr) *
1103 sizeof (scan_io_t);
1104 }
1105 mutex_exit(&tvd->vdev_scan_io_queue_lock);
1106 }
1107
1108 dprintf("current scan memory usage: %llu bytes\n", (longlong_t)mused);
1109
1110 if (mused == 0)
1111 ASSERT0(scn->scn_bytes_pending);
1112
1113 /*
1114 * If we are above our hard limit, we need to clear out memory.
1115 * If we are below our soft limit, we need to accumulate sequential IOs.
1116 * Otherwise, we should keep doing whatever we are currently doing.
1117 */
1118 if (mused >= mlim_hard)
1119 return (B_TRUE);
1120 else if (mused < mlim_soft)
1121 return (B_FALSE);
1122 else
1123 return (scn->scn_clearing);
1124 }
1125
1126 static boolean_t
1127 dsl_scan_check_suspend(dsl_scan_t *scn, const zbookmark_phys_t *zb)
1128 {
1129 /* we never skip user/group accounting objects */
1130 if (zb && (int64_t)zb->zb_object < 0)
1131 return (B_FALSE);
1132
1133 if (scn->scn_suspending)
1134 return (B_TRUE); /* we're already suspending */
1135
1136 if (!ZB_IS_ZERO(&scn->scn_phys.scn_bookmark))
1137 return (B_FALSE); /* we're resuming */
1138
1139 /* We only know how to resume from level-0 blocks. */
1140 if (zb && zb->zb_level != 0)
1141 return (B_FALSE);
1142
1143 /*
1144 * We suspend if:
1145 * - we have scanned for at least the minimum time (default 1 sec
1146 * for scrub, 3 sec for resilver), and either we have sufficient
1147 * dirty data that we are starting to write more quickly
1148 * (default 30%), someone is explicitly waiting for this txg
1149 * to complete, or we have used up all of the time in the txg
1150 * timeout (default 5 sec).
1151 * or
1152 * - the spa is shutting down because this pool is being exported
1153 * or the machine is rebooting.
1154 * or
1155 * - the scan queue has reached its memory use limit
1156 */
1157 uint64_t curr_time_ns = gethrtime();
1158 uint64_t scan_time_ns = curr_time_ns - scn->scn_sync_start_time;
1159 uint64_t sync_time_ns = curr_time_ns -
1160 scn->scn_dp->dp_spa->spa_sync_starttime;
1161 int dirty_pct = scn->scn_dp->dp_dirty_total * 100 / zfs_dirty_data_max;
1162 int mintime = (scn->scn_phys.scn_func == POOL_SCAN_RESILVER) ?
1163 zfs_resilver_min_time_ms : zfs_scrub_min_time_ms;
1164
1165 if ((NSEC2MSEC(scan_time_ns) > mintime &&
1166 (dirty_pct >= zfs_vdev_async_write_active_min_dirty_percent ||
1167 txg_sync_waiting(scn->scn_dp) ||
1168 NSEC2SEC(sync_time_ns) >= zfs_txg_timeout)) ||
1169 spa_shutting_down(scn->scn_dp->dp_spa) ||
1170 (zfs_scan_strict_mem_lim && dsl_scan_should_clear(scn))) {
1171 if (zb) {
1172 dprintf("suspending at bookmark %llx/%llx/%llx/%llx\n",
1173 (longlong_t)zb->zb_objset,
1174 (longlong_t)zb->zb_object,
1175 (longlong_t)zb->zb_level,
1176 (longlong_t)zb->zb_blkid);
1177 scn->scn_phys.scn_bookmark = *zb;
1178 } else {
1179 #ifdef ZFS_DEBUG
1180 dsl_scan_phys_t *scnp = &scn->scn_phys;
1181 dprintf("suspending at at DDT bookmark "
1182 "%llx/%llx/%llx/%llx\n",
1183 (longlong_t)scnp->scn_ddt_bookmark.ddb_class,
1184 (longlong_t)scnp->scn_ddt_bookmark.ddb_type,
1185 (longlong_t)scnp->scn_ddt_bookmark.ddb_checksum,
1186 (longlong_t)scnp->scn_ddt_bookmark.ddb_cursor);
1187 #endif
1188 }
1189 scn->scn_suspending = B_TRUE;
1190 return (B_TRUE);
1191 }
1192 return (B_FALSE);
1193 }
1194
1195 typedef struct zil_scan_arg {
1196 dsl_pool_t *zsa_dp;
1197 zil_header_t *zsa_zh;
1198 } zil_scan_arg_t;
1199
1200 /* ARGSUSED */
1201 static int
1202 dsl_scan_zil_block(zilog_t *zilog, blkptr_t *bp, void *arg, uint64_t claim_txg)
1203 {
1204 zil_scan_arg_t *zsa = arg;
1205 dsl_pool_t *dp = zsa->zsa_dp;
1206 dsl_scan_t *scn = dp->dp_scan;
1207 zil_header_t *zh = zsa->zsa_zh;
1208 zbookmark_phys_t zb;
1209
1210 if (BP_IS_HOLE(bp) || bp->blk_birth <= scn->scn_phys.scn_cur_min_txg)
1211 return (0);
1212
1213 /*
1214 * One block ("stubby") can be allocated a long time ago; we
1215 * want to visit that one because it has been allocated
1216 * (on-disk) even if it hasn't been claimed (even though for
1217 * scrub there's nothing to do to it).
1218 */
1219 if (claim_txg == 0 && bp->blk_birth >= spa_first_txg(dp->dp_spa))
1220 return (0);
1221
1222 SET_BOOKMARK(&zb, zh->zh_log.blk_cksum.zc_word[ZIL_ZC_OBJSET],
1223 ZB_ZIL_OBJECT, ZB_ZIL_LEVEL, bp->blk_cksum.zc_word[ZIL_ZC_SEQ]);
1224
1225 VERIFY(0 == scan_funcs[scn->scn_phys.scn_func](dp, bp, &zb));
1226 return (0);
1227 }
1228
1229 /* ARGSUSED */
1230 static int
1231 dsl_scan_zil_record(zilog_t *zilog, lr_t *lrc, void *arg, uint64_t claim_txg)
1232 {
1233 if (lrc->lrc_txtype == TX_WRITE) {
1234 zil_scan_arg_t *zsa = arg;
1235 dsl_pool_t *dp = zsa->zsa_dp;
1236 dsl_scan_t *scn = dp->dp_scan;
1237 zil_header_t *zh = zsa->zsa_zh;
1238 lr_write_t *lr = (lr_write_t *)lrc;
1239 blkptr_t *bp = &lr->lr_blkptr;
1240 zbookmark_phys_t zb;
1241
1242 if (BP_IS_HOLE(bp) ||
1243 bp->blk_birth <= scn->scn_phys.scn_cur_min_txg)
1244 return (0);
1245
1246 /*
1247 * birth can be < claim_txg if this record's txg is
1248 * already txg sync'ed (but this log block contains
1249 * other records that are not synced)
1250 */
1251 if (claim_txg == 0 || bp->blk_birth < claim_txg)
1252 return (0);
1253
1254 SET_BOOKMARK(&zb, zh->zh_log.blk_cksum.zc_word[ZIL_ZC_OBJSET],
1255 lr->lr_foid, ZB_ZIL_LEVEL,
1256 lr->lr_offset / BP_GET_LSIZE(bp));
1257
1258 VERIFY(0 == scan_funcs[scn->scn_phys.scn_func](dp, bp, &zb));
1259 }
1260 return (0);
1261 }
1262
1263 static void
1264 dsl_scan_zil(dsl_pool_t *dp, zil_header_t *zh)
1265 {
1266 uint64_t claim_txg = zh->zh_claim_txg;
1267 zil_scan_arg_t zsa = { dp, zh };
1268 zilog_t *zilog;
1269
1270 /*
1271 * We only want to visit blocks that have been claimed but not yet
1272 * replayed (or, in read-only mode, blocks that *would* be claimed).
1273 */
1274 if (claim_txg == 0 && spa_writeable(dp->dp_spa))
1275 return;
1276
1277 zilog = zil_alloc(dp->dp_meta_objset, zh);
1278
1279 (void) zil_parse(zilog, dsl_scan_zil_block, dsl_scan_zil_record, &zsa,
1280 claim_txg, B_FALSE);
1281
1282 zil_free(zilog);
1283 }
1284
1285 /*
1286 * We compare scan_prefetch_issue_ctx_t's based on their bookmarks. The idea
1287 * here is to sort the AVL tree by the order each block will be needed.
1288 */
1289 static int
1290 scan_prefetch_queue_compare(const void *a, const void *b)
1291 {
1292 const scan_prefetch_issue_ctx_t *spic_a = a, *spic_b = b;
1293 const scan_prefetch_ctx_t *spc_a = spic_a->spic_spc;
1294 const scan_prefetch_ctx_t *spc_b = spic_b->spic_spc;
1295
1296 return (zbookmark_compare(spc_a->spc_datablkszsec,
1297 spc_a->spc_indblkshift, spc_b->spc_datablkszsec,
1298 spc_b->spc_indblkshift, &spic_a->spic_zb, &spic_b->spic_zb));
1299 }
1300
1301 static void
1302 scan_prefetch_ctx_rele(scan_prefetch_ctx_t *spc, void *tag)
1303 {
1304 if (refcount_remove(&spc->spc_refcnt, tag) == 0) {
1305 refcount_destroy(&spc->spc_refcnt);
1306 kmem_free(spc, sizeof (scan_prefetch_ctx_t));
1307 }
1308 }
1309
1310 static scan_prefetch_ctx_t *
1311 scan_prefetch_ctx_create(dsl_scan_t *scn, dnode_phys_t *dnp, void *tag)
1312 {
1313 scan_prefetch_ctx_t *spc;
1314
1315 spc = kmem_alloc(sizeof (scan_prefetch_ctx_t), KM_SLEEP);
1316 refcount_create(&spc->spc_refcnt);
1317 refcount_add(&spc->spc_refcnt, tag);
1318 spc->spc_scn = scn;
1319 if (dnp != NULL) {
1320 spc->spc_datablkszsec = dnp->dn_datablkszsec;
1321 spc->spc_indblkshift = dnp->dn_indblkshift;
1322 spc->spc_root = B_FALSE;
1323 } else {
1324 spc->spc_datablkszsec = 0;
1325 spc->spc_indblkshift = 0;
1326 spc->spc_root = B_TRUE;
1327 }
1328
1329 return (spc);
1330 }
1331
1332 static void
1333 scan_prefetch_ctx_add_ref(scan_prefetch_ctx_t *spc, void *tag)
1334 {
1335 refcount_add(&spc->spc_refcnt, tag);
1336 }
1337
1338 static boolean_t
1339 dsl_scan_check_prefetch_resume(scan_prefetch_ctx_t *spc,
1340 const zbookmark_phys_t *zb)
1341 {
1342 zbookmark_phys_t *last_zb = &spc->spc_scn->scn_prefetch_bookmark;
1343 dnode_phys_t tmp_dnp;
1344 dnode_phys_t *dnp = (spc->spc_root) ? NULL : &tmp_dnp;
1345
1346 if (zb->zb_objset != last_zb->zb_objset)
1347 return (B_TRUE);
1348 if ((int64_t)zb->zb_object < 0)
1349 return (B_FALSE);
1350
1351 tmp_dnp.dn_datablkszsec = spc->spc_datablkszsec;
1352 tmp_dnp.dn_indblkshift = spc->spc_indblkshift;
1353
1354 if (zbookmark_subtree_completed(dnp, zb, last_zb))
1355 return (B_TRUE);
1356
1357 return (B_FALSE);
1358 }
1359
1360 static void
1361 dsl_scan_prefetch(scan_prefetch_ctx_t *spc, blkptr_t *bp, zbookmark_phys_t *zb)
1362 {
1363 avl_index_t idx;
1364 dsl_scan_t *scn = spc->spc_scn;
1365 spa_t *spa = scn->scn_dp->dp_spa;
1366 scan_prefetch_issue_ctx_t *spic;
1367
1368 if (zfs_no_scrub_prefetch)
1369 return;
1370
1371 if (BP_IS_HOLE(bp) || bp->blk_birth <= scn->scn_phys.scn_cur_min_txg ||
1372 (BP_GET_LEVEL(bp) == 0 && BP_GET_TYPE(bp) != DMU_OT_DNODE &&
1373 BP_GET_TYPE(bp) != DMU_OT_OBJSET))
1374 return;
1375
1376 if (dsl_scan_check_prefetch_resume(spc, zb))
1377 return;
1378
1379 scan_prefetch_ctx_add_ref(spc, scn);
1380 spic = kmem_alloc(sizeof (scan_prefetch_issue_ctx_t), KM_SLEEP);
1381 spic->spic_spc = spc;
1382 spic->spic_bp = *bp;
1383 spic->spic_zb = *zb;
1384
1385 /*
1386 * Add the IO to the queue of blocks to prefetch. This allows us to
1387 * prioritize blocks that we will need first for the main traversal
1388 * thread.
1389 */
1390 mutex_enter(&spa->spa_scrub_lock);
1391 if (avl_find(&scn->scn_prefetch_queue, spic, &idx) != NULL) {
1392 /* this block is already queued for prefetch */
1393 kmem_free(spic, sizeof (scan_prefetch_issue_ctx_t));
1394 scan_prefetch_ctx_rele(spc, scn);
1395 mutex_exit(&spa->spa_scrub_lock);
1396 return;
1397 }
1398
1399 avl_insert(&scn->scn_prefetch_queue, spic, idx);
1400 cv_broadcast(&spa->spa_scrub_io_cv);
1401 mutex_exit(&spa->spa_scrub_lock);
1402 }
1403
1404 static void
1405 dsl_scan_prefetch_dnode(dsl_scan_t *scn, dnode_phys_t *dnp,
1406 uint64_t objset, uint64_t object)
1407 {
1408 int i;
1409 zbookmark_phys_t zb;
1410 scan_prefetch_ctx_t *spc;
1411
1412 if (dnp->dn_nblkptr == 0 && !(dnp->dn_flags & DNODE_FLAG_SPILL_BLKPTR))
1413 return;
1414
1415 SET_BOOKMARK(&zb, objset, object, 0, 0);
1416
1417 spc = scan_prefetch_ctx_create(scn, dnp, FTAG);
1418
1419 for (i = 0; i < dnp->dn_nblkptr; i++) {
1420 zb.zb_level = BP_GET_LEVEL(&dnp->dn_blkptr[i]);
1421 zb.zb_blkid = i;
1422 dsl_scan_prefetch(spc, &dnp->dn_blkptr[i], &zb);
1423 }
1424
1425 if (dnp->dn_flags & DNODE_FLAG_SPILL_BLKPTR) {
1426 zb.zb_level = 0;
1427 zb.zb_blkid = DMU_SPILL_BLKID;
1428 dsl_scan_prefetch(spc, DN_SPILL_BLKPTR(dnp), &zb);
1429 }
1430
1431 scan_prefetch_ctx_rele(spc, FTAG);
1432 }
1433
1434 void
1435 dsl_scan_prefetch_cb(zio_t *zio, const zbookmark_phys_t *zb, const blkptr_t *bp,
1436 arc_buf_t *buf, void *private)
1437 {
1438 scan_prefetch_ctx_t *spc = private;
1439 dsl_scan_t *scn = spc->spc_scn;
1440 spa_t *spa = scn->scn_dp->dp_spa;
1441
1442 /* broadcast that the IO has completed for rate limiting purposes */
1443 mutex_enter(&spa->spa_scrub_lock);
1444 ASSERT3U(spa->spa_scrub_inflight, >=, BP_GET_PSIZE(bp));
1445 spa->spa_scrub_inflight -= BP_GET_PSIZE(bp);
1446 cv_broadcast(&spa->spa_scrub_io_cv);
1447 mutex_exit(&spa->spa_scrub_lock);
1448
1449 /* if there was an error or we are done prefetching, just cleanup */
1450 if (buf == NULL || scn->scn_prefetch_stop)
1451 goto out;
1452
1453 if (BP_GET_LEVEL(bp) > 0) {
1454 int i;
1455 blkptr_t *cbp;
1456 int epb = BP_GET_LSIZE(bp) >> SPA_BLKPTRSHIFT;
1457 zbookmark_phys_t czb;
1458
1459 for (i = 0, cbp = buf->b_data; i < epb; i++, cbp++) {
1460 SET_BOOKMARK(&czb, zb->zb_objset, zb->zb_object,
1461 zb->zb_level - 1, zb->zb_blkid * epb + i);
1462 dsl_scan_prefetch(spc, cbp, &czb);
1463 }
1464 } else if (BP_GET_TYPE(bp) == DMU_OT_DNODE) {
1465 dnode_phys_t *cdnp;
1466 int i;
1467 int epb = BP_GET_LSIZE(bp) >> DNODE_SHIFT;
1468
1469 for (i = 0, cdnp = buf->b_data; i < epb;
1470 i += cdnp->dn_extra_slots + 1,
1471 cdnp += cdnp->dn_extra_slots + 1) {
1472 dsl_scan_prefetch_dnode(scn, cdnp,
1473 zb->zb_objset, zb->zb_blkid * epb + i);
1474 }
1475 } else if (BP_GET_TYPE(bp) == DMU_OT_OBJSET) {
1476 objset_phys_t *osp = buf->b_data;
1477
1478 dsl_scan_prefetch_dnode(scn, &osp->os_meta_dnode,
1479 zb->zb_objset, DMU_META_DNODE_OBJECT);
1480
1481 if (OBJSET_BUF_HAS_USERUSED(buf)) {
1482 dsl_scan_prefetch_dnode(scn,
1483 &osp->os_groupused_dnode, zb->zb_objset,
1484 DMU_GROUPUSED_OBJECT);
1485 dsl_scan_prefetch_dnode(scn,
1486 &osp->os_userused_dnode, zb->zb_objset,
1487 DMU_USERUSED_OBJECT);
1488 }
1489 }
1490
1491 out:
1492 if (buf != NULL)
1493 arc_buf_destroy(buf, private);
1494 scan_prefetch_ctx_rele(spc, scn);
1495 }
1496
1497 /* ARGSUSED */
1498 static void
1499 dsl_scan_prefetch_thread(void *arg)
1500 {
1501 dsl_scan_t *scn = arg;
1502 spa_t *spa = scn->scn_dp->dp_spa;
1503 scan_prefetch_issue_ctx_t *spic;
1504
1505 /* loop until we are told to stop */
1506 while (!scn->scn_prefetch_stop) {
1507 arc_flags_t flags = ARC_FLAG_NOWAIT |
1508 ARC_FLAG_PRESCIENT_PREFETCH | ARC_FLAG_PREFETCH;
1509 int zio_flags = ZIO_FLAG_CANFAIL | ZIO_FLAG_SCAN_THREAD;
1510
1511 mutex_enter(&spa->spa_scrub_lock);
1512
1513 /*
1514 * Wait until we have an IO to issue and are not above our
1515 * maximum in flight limit.
1516 */
1517 while (!scn->scn_prefetch_stop &&
1518 (avl_numnodes(&scn->scn_prefetch_queue) == 0 ||
1519 spa->spa_scrub_inflight >= scn->scn_maxinflight_bytes)) {
1520 cv_wait(&spa->spa_scrub_io_cv, &spa->spa_scrub_lock);
1521 }
1522
1523 /* recheck if we should stop since we waited for the cv */
1524 if (scn->scn_prefetch_stop) {
1525 mutex_exit(&spa->spa_scrub_lock);
1526 break;
1527 }
1528
1529 /* remove the prefetch IO from the tree */
1530 spic = avl_first(&scn->scn_prefetch_queue);
1531 spa->spa_scrub_inflight += BP_GET_PSIZE(&spic->spic_bp);
1532 avl_remove(&scn->scn_prefetch_queue, spic);
1533
1534 mutex_exit(&spa->spa_scrub_lock);
1535
1536 if (BP_IS_PROTECTED(&spic->spic_bp)) {
1537 ASSERT(BP_GET_TYPE(&spic->spic_bp) == DMU_OT_DNODE ||
1538 BP_GET_TYPE(&spic->spic_bp) == DMU_OT_OBJSET);
1539 ASSERT3U(BP_GET_LEVEL(&spic->spic_bp), ==, 0);
1540 zio_flags |= ZIO_FLAG_RAW;
1541 }
1542
1543 /* issue the prefetch asynchronously */
1544 (void) arc_read(scn->scn_zio_root, scn->scn_dp->dp_spa,
1545 &spic->spic_bp, dsl_scan_prefetch_cb, spic->spic_spc,
1546 ZIO_PRIORITY_SCRUB, zio_flags, &flags, &spic->spic_zb);
1547
1548 kmem_free(spic, sizeof (scan_prefetch_issue_ctx_t));
1549 }
1550
1551 ASSERT(scn->scn_prefetch_stop);
1552
1553 /* free any prefetches we didn't get to complete */
1554 mutex_enter(&spa->spa_scrub_lock);
1555 while ((spic = avl_first(&scn->scn_prefetch_queue)) != NULL) {
1556 avl_remove(&scn->scn_prefetch_queue, spic);
1557 scan_prefetch_ctx_rele(spic->spic_spc, scn);
1558 kmem_free(spic, sizeof (scan_prefetch_issue_ctx_t));
1559 }
1560 ASSERT0(avl_numnodes(&scn->scn_prefetch_queue));
1561 mutex_exit(&spa->spa_scrub_lock);
1562 }
1563
1564 static boolean_t
1565 dsl_scan_check_resume(dsl_scan_t *scn, const dnode_phys_t *dnp,
1566 const zbookmark_phys_t *zb)
1567 {
1568 /*
1569 * We never skip over user/group accounting objects (obj<0)
1570 */
1571 if (!ZB_IS_ZERO(&scn->scn_phys.scn_bookmark) &&
1572 (int64_t)zb->zb_object >= 0) {
1573 /*
1574 * If we already visited this bp & everything below (in
1575 * a prior txg sync), don't bother doing it again.
1576 */
1577 if (zbookmark_subtree_completed(dnp, zb,
1578 &scn->scn_phys.scn_bookmark))
1579 return (B_TRUE);
1580
1581 /*
1582 * If we found the block we're trying to resume from, or
1583 * we went past it to a different object, zero it out to
1584 * indicate that it's OK to start checking for suspending
1585 * again.
1586 */
1587 if (bcmp(zb, &scn->scn_phys.scn_bookmark, sizeof (*zb)) == 0 ||
1588 zb->zb_object > scn->scn_phys.scn_bookmark.zb_object) {
1589 dprintf("resuming at %llx/%llx/%llx/%llx\n",
1590 (longlong_t)zb->zb_objset,
1591 (longlong_t)zb->zb_object,
1592 (longlong_t)zb->zb_level,
1593 (longlong_t)zb->zb_blkid);
1594 bzero(&scn->scn_phys.scn_bookmark, sizeof (*zb));
1595 }
1596 }
1597 return (B_FALSE);
1598 }
1599
1600 static void dsl_scan_visitbp(blkptr_t *bp, const zbookmark_phys_t *zb,
1601 dnode_phys_t *dnp, dsl_dataset_t *ds, dsl_scan_t *scn,
1602 dmu_objset_type_t ostype, dmu_tx_t *tx);
1603 inline __attribute__((always_inline)) static void dsl_scan_visitdnode(
1604 dsl_scan_t *, dsl_dataset_t *ds, dmu_objset_type_t ostype,
1605 dnode_phys_t *dnp, uint64_t object, dmu_tx_t *tx);
1606
1607 /*
1608 * Return nonzero on i/o error.
1609 * Return new buf to write out in *bufp.
1610 */
1611 inline __attribute__((always_inline)) static int
1612 dsl_scan_recurse(dsl_scan_t *scn, dsl_dataset_t *ds, dmu_objset_type_t ostype,
1613 dnode_phys_t *dnp, const blkptr_t *bp,
1614 const zbookmark_phys_t *zb, dmu_tx_t *tx)
1615 {
1616 dsl_pool_t *dp = scn->scn_dp;
1617 int zio_flags = ZIO_FLAG_CANFAIL | ZIO_FLAG_SCAN_THREAD;
1618 int err;
1619
1620 if (BP_GET_LEVEL(bp) > 0) {
1621 arc_flags_t flags = ARC_FLAG_WAIT;
1622 int i;
1623 blkptr_t *cbp;
1624 int epb = BP_GET_LSIZE(bp) >> SPA_BLKPTRSHIFT;
1625 arc_buf_t *buf;
1626
1627 err = arc_read(NULL, dp->dp_spa, bp, arc_getbuf_func, &buf,
1628 ZIO_PRIORITY_SCRUB, zio_flags, &flags, zb);
1629 if (err) {
1630 scn->scn_phys.scn_errors++;
1631 return (err);
1632 }
1633 for (i = 0, cbp = buf->b_data; i < epb; i++, cbp++) {
1634 zbookmark_phys_t czb;
1635
1636 SET_BOOKMARK(&czb, zb->zb_objset, zb->zb_object,
1637 zb->zb_level - 1,
1638 zb->zb_blkid * epb + i);
1639 dsl_scan_visitbp(cbp, &czb, dnp,
1640 ds, scn, ostype, tx);
1641 }
1642 arc_buf_destroy(buf, &buf);
1643 } else if (BP_GET_TYPE(bp) == DMU_OT_DNODE) {
1644 arc_flags_t flags = ARC_FLAG_WAIT;
1645 dnode_phys_t *cdnp;
1646 int i;
1647 int epb = BP_GET_LSIZE(bp) >> DNODE_SHIFT;
1648 arc_buf_t *buf;
1649
1650 if (BP_IS_PROTECTED(bp)) {
1651 ASSERT3U(BP_GET_COMPRESS(bp), ==, ZIO_COMPRESS_OFF);
1652 zio_flags |= ZIO_FLAG_RAW;
1653 }
1654
1655 err = arc_read(NULL, dp->dp_spa, bp, arc_getbuf_func, &buf,
1656 ZIO_PRIORITY_SCRUB, zio_flags, &flags, zb);
1657 if (err) {
1658 scn->scn_phys.scn_errors++;
1659 return (err);
1660 }
1661 for (i = 0, cdnp = buf->b_data; i < epb;
1662 i += cdnp->dn_extra_slots + 1,
1663 cdnp += cdnp->dn_extra_slots + 1) {
1664 dsl_scan_visitdnode(scn, ds, ostype,
1665 cdnp, zb->zb_blkid * epb + i, tx);
1666 }
1667
1668 arc_buf_destroy(buf, &buf);
1669 } else if (BP_GET_TYPE(bp) == DMU_OT_OBJSET) {
1670 arc_flags_t flags = ARC_FLAG_WAIT;
1671 objset_phys_t *osp;
1672 arc_buf_t *buf;
1673
1674 err = arc_read(NULL, dp->dp_spa, bp, arc_getbuf_func, &buf,
1675 ZIO_PRIORITY_SCRUB, zio_flags, &flags, zb);
1676 if (err) {
1677 scn->scn_phys.scn_errors++;
1678 return (err);
1679 }
1680
1681 osp = buf->b_data;
1682
1683 dsl_scan_visitdnode(scn, ds, osp->os_type,
1684 &osp->os_meta_dnode, DMU_META_DNODE_OBJECT, tx);
1685
1686 if (OBJSET_BUF_HAS_USERUSED(buf)) {
1687 /*
1688 * We also always visit user/group/project accounting
1689 * objects, and never skip them, even if we are
1690 * suspending. This is necessary so that the
1691 * space deltas from this txg get integrated.
1692 */
1693 if (OBJSET_BUF_HAS_PROJECTUSED(buf))
1694 dsl_scan_visitdnode(scn, ds, osp->os_type,
1695 &osp->os_projectused_dnode,
1696 DMU_PROJECTUSED_OBJECT, tx);
1697 dsl_scan_visitdnode(scn, ds, osp->os_type,
1698 &osp->os_groupused_dnode,
1699 DMU_GROUPUSED_OBJECT, tx);
1700 dsl_scan_visitdnode(scn, ds, osp->os_type,
1701 &osp->os_userused_dnode,
1702 DMU_USERUSED_OBJECT, tx);
1703 }
1704 arc_buf_destroy(buf, &buf);
1705 }
1706
1707 return (0);
1708 }
1709
1710 inline __attribute__((always_inline)) static void
1711 dsl_scan_visitdnode(dsl_scan_t *scn, dsl_dataset_t *ds,
1712 dmu_objset_type_t ostype, dnode_phys_t *dnp,
1713 uint64_t object, dmu_tx_t *tx)
1714 {
1715 int j;
1716
1717 for (j = 0; j < dnp->dn_nblkptr; j++) {
1718 zbookmark_phys_t czb;
1719
1720 SET_BOOKMARK(&czb, ds ? ds->ds_object : 0, object,
1721 dnp->dn_nlevels - 1, j);
1722 dsl_scan_visitbp(&dnp->dn_blkptr[j],
1723 &czb, dnp, ds, scn, ostype, tx);
1724 }
1725
1726 if (dnp->dn_flags & DNODE_FLAG_SPILL_BLKPTR) {
1727 zbookmark_phys_t czb;
1728 SET_BOOKMARK(&czb, ds ? ds->ds_object : 0, object,
1729 0, DMU_SPILL_BLKID);
1730 dsl_scan_visitbp(DN_SPILL_BLKPTR(dnp),
1731 &czb, dnp, ds, scn, ostype, tx);
1732 }
1733 }
1734
1735 /*
1736 * The arguments are in this order because mdb can only print the
1737 * first 5; we want them to be useful.
1738 */
1739 static void
1740 dsl_scan_visitbp(blkptr_t *bp, const zbookmark_phys_t *zb,
1741 dnode_phys_t *dnp, dsl_dataset_t *ds, dsl_scan_t *scn,
1742 dmu_objset_type_t ostype, dmu_tx_t *tx)
1743 {
1744 dsl_pool_t *dp = scn->scn_dp;
1745 blkptr_t *bp_toread = NULL;
1746
1747 if (dsl_scan_check_suspend(scn, zb))
1748 return;
1749
1750 if (dsl_scan_check_resume(scn, dnp, zb))
1751 return;
1752
1753 scn->scn_visited_this_txg++;
1754
1755 /*
1756 * This debugging is commented out to conserve stack space. This
1757 * function is called recursively and the debugging addes several
1758 * bytes to the stack for each call. It can be commented back in
1759 * if required to debug an issue in dsl_scan_visitbp().
1760 *
1761 * dprintf_bp(bp,
1762 * "visiting ds=%p/%llu zb=%llx/%llx/%llx/%llx bp=%p",
1763 * ds, ds ? ds->ds_object : 0,
1764 * zb->zb_objset, zb->zb_object, zb->zb_level, zb->zb_blkid,
1765 * bp);
1766 */
1767
1768 if (BP_IS_HOLE(bp)) {
1769 scn->scn_holes_this_txg++;
1770 return;
1771 }
1772
1773 if (bp->blk_birth <= scn->scn_phys.scn_cur_min_txg) {
1774 scn->scn_lt_min_this_txg++;
1775 return;
1776 }
1777
1778 bp_toread = kmem_alloc(sizeof (blkptr_t), KM_SLEEP);
1779 *bp_toread = *bp;
1780
1781 if (dsl_scan_recurse(scn, ds, ostype, dnp, bp_toread, zb, tx) != 0)
1782 goto out;
1783
1784 /*
1785 * If dsl_scan_ddt() has already visited this block, it will have
1786 * already done any translations or scrubbing, so don't call the
1787 * callback again.
1788 */
1789 if (ddt_class_contains(dp->dp_spa,
1790 scn->scn_phys.scn_ddt_class_max, bp)) {
1791 scn->scn_ddt_contained_this_txg++;
1792 goto out;
1793 }
1794
1795 /*
1796 * If this block is from the future (after cur_max_txg), then we
1797 * are doing this on behalf of a deleted snapshot, and we will
1798 * revisit the future block on the next pass of this dataset.
1799 * Don't scan it now unless we need to because something
1800 * under it was modified.
1801 */
1802 if (BP_PHYSICAL_BIRTH(bp) > scn->scn_phys.scn_cur_max_txg) {
1803 scn->scn_gt_max_this_txg++;
1804 goto out;
1805 }
1806
1807 scan_funcs[scn->scn_phys.scn_func](dp, bp, zb);
1808
1809 out:
1810 kmem_free(bp_toread, sizeof (blkptr_t));
1811 }
1812
1813 static void
1814 dsl_scan_visit_rootbp(dsl_scan_t *scn, dsl_dataset_t *ds, blkptr_t *bp,
1815 dmu_tx_t *tx)
1816 {
1817 zbookmark_phys_t zb;
1818 scan_prefetch_ctx_t *spc;
1819
1820 SET_BOOKMARK(&zb, ds ? ds->ds_object : DMU_META_OBJSET,
1821 ZB_ROOT_OBJECT, ZB_ROOT_LEVEL, ZB_ROOT_BLKID);
1822
1823 if (ZB_IS_ZERO(&scn->scn_phys.scn_bookmark)) {
1824 SET_BOOKMARK(&scn->scn_prefetch_bookmark,
1825 zb.zb_objset, 0, 0, 0);
1826 } else {
1827 scn->scn_prefetch_bookmark = scn->scn_phys.scn_bookmark;
1828 }
1829
1830 scn->scn_objsets_visited_this_txg++;
1831
1832 spc = scan_prefetch_ctx_create(scn, NULL, FTAG);
1833 dsl_scan_prefetch(spc, bp, &zb);
1834 scan_prefetch_ctx_rele(spc, FTAG);
1835
1836 dsl_scan_visitbp(bp, &zb, NULL, ds, scn, DMU_OST_NONE, tx);
1837
1838 dprintf_ds(ds, "finished scan%s", "");
1839 }
1840
1841 static void
1842 ds_destroyed_scn_phys(dsl_dataset_t *ds, dsl_scan_phys_t *scn_phys)
1843 {
1844 if (scn_phys->scn_bookmark.zb_objset == ds->ds_object) {
1845 if (ds->ds_is_snapshot) {
1846 /*
1847 * Note:
1848 * - scn_cur_{min,max}_txg stays the same.
1849 * - Setting the flag is not really necessary if
1850 * scn_cur_max_txg == scn_max_txg, because there
1851 * is nothing after this snapshot that we care
1852 * about. However, we set it anyway and then
1853 * ignore it when we retraverse it in
1854 * dsl_scan_visitds().
1855 */
1856 scn_phys->scn_bookmark.zb_objset =
1857 dsl_dataset_phys(ds)->ds_next_snap_obj;
1858 zfs_dbgmsg("destroying ds %llu; currently traversing; "
1859 "reset zb_objset to %llu",
1860 (u_longlong_t)ds->ds_object,
1861 (u_longlong_t)dsl_dataset_phys(ds)->
1862 ds_next_snap_obj);
1863 scn_phys->scn_flags |= DSF_VISIT_DS_AGAIN;
1864 } else {
1865 SET_BOOKMARK(&scn_phys->scn_bookmark,
1866 ZB_DESTROYED_OBJSET, 0, 0, 0);
1867 zfs_dbgmsg("destroying ds %llu; currently traversing; "
1868 "reset bookmark to -1,0,0,0",
1869 (u_longlong_t)ds->ds_object);
1870 }
1871 }
1872 }
1873
1874 /*
1875 * Invoked when a dataset is destroyed. We need to make sure that:
1876 *
1877 * 1) If it is the dataset that was currently being scanned, we write
1878 * a new dsl_scan_phys_t and marking the objset reference in it
1879 * as destroyed.
1880 * 2) Remove it from the work queue, if it was present.
1881 *
1882 * If the dataset was actually a snapshot, instead of marking the dataset
1883 * as destroyed, we instead substitute the next snapshot in line.
1884 */
1885 void
1886 dsl_scan_ds_destroyed(dsl_dataset_t *ds, dmu_tx_t *tx)
1887 {
1888 dsl_pool_t *dp = ds->ds_dir->dd_pool;
1889 dsl_scan_t *scn = dp->dp_scan;
1890 uint64_t mintxg;
1891
1892 if (!dsl_scan_is_running(scn))
1893 return;
1894
1895 ds_destroyed_scn_phys(ds, &scn->scn_phys);
1896 ds_destroyed_scn_phys(ds, &scn->scn_phys_cached);
1897
1898 if (scan_ds_queue_contains(scn, ds->ds_object, &mintxg)) {
1899 scan_ds_queue_remove(scn, ds->ds_object);
1900 if (ds->ds_is_snapshot)
1901 scan_ds_queue_insert(scn,
1902 dsl_dataset_phys(ds)->ds_next_snap_obj, mintxg);
1903 }
1904
1905 if (zap_lookup_int_key(dp->dp_meta_objset, scn->scn_phys.scn_queue_obj,
1906 ds->ds_object, &mintxg) == 0) {
1907 ASSERT3U(dsl_dataset_phys(ds)->ds_num_children, <=, 1);
1908 VERIFY3U(0, ==, zap_remove_int(dp->dp_meta_objset,
1909 scn->scn_phys.scn_queue_obj, ds->ds_object, tx));
1910 if (ds->ds_is_snapshot) {
1911 /*
1912 * We keep the same mintxg; it could be >
1913 * ds_creation_txg if the previous snapshot was
1914 * deleted too.
1915 */
1916 VERIFY(zap_add_int_key(dp->dp_meta_objset,
1917 scn->scn_phys.scn_queue_obj,
1918 dsl_dataset_phys(ds)->ds_next_snap_obj,
1919 mintxg, tx) == 0);
1920 zfs_dbgmsg("destroying ds %llu; in queue; "
1921 "replacing with %llu",
1922 (u_longlong_t)ds->ds_object,
1923 (u_longlong_t)dsl_dataset_phys(ds)->
1924 ds_next_snap_obj);
1925 } else {
1926 zfs_dbgmsg("destroying ds %llu; in queue; removing",
1927 (u_longlong_t)ds->ds_object);
1928 }
1929 }
1930
1931 /*
1932 * dsl_scan_sync() should be called after this, and should sync
1933 * out our changed state, but just to be safe, do it here.
1934 */
1935 dsl_scan_sync_state(scn, tx, SYNC_CACHED);
1936 }
1937
1938 static void
1939 ds_snapshotted_bookmark(dsl_dataset_t *ds, zbookmark_phys_t *scn_bookmark)
1940 {
1941 if (scn_bookmark->zb_objset == ds->ds_object) {
1942 scn_bookmark->zb_objset =
1943 dsl_dataset_phys(ds)->ds_prev_snap_obj;
1944 zfs_dbgmsg("snapshotting ds %llu; currently traversing; "
1945 "reset zb_objset to %llu",
1946 (u_longlong_t)ds->ds_object,
1947 (u_longlong_t)dsl_dataset_phys(ds)->ds_prev_snap_obj);
1948 }
1949 }
1950
1951 /*
1952 * Called when a dataset is snapshotted. If we were currently traversing
1953 * this snapshot, we reset our bookmark to point at the newly created
1954 * snapshot. We also modify our work queue to remove the old snapshot and
1955 * replace with the new one.
1956 */
1957 void
1958 dsl_scan_ds_snapshotted(dsl_dataset_t *ds, dmu_tx_t *tx)
1959 {
1960 dsl_pool_t *dp = ds->ds_dir->dd_pool;
1961 dsl_scan_t *scn = dp->dp_scan;
1962 uint64_t mintxg;
1963
1964 if (!dsl_scan_is_running(scn))
1965 return;
1966
1967 ASSERT(dsl_dataset_phys(ds)->ds_prev_snap_obj != 0);
1968
1969 ds_snapshotted_bookmark(ds, &scn->scn_phys.scn_bookmark);
1970 ds_snapshotted_bookmark(ds, &scn->scn_phys_cached.scn_bookmark);
1971
1972 if (scan_ds_queue_contains(scn, ds->ds_object, &mintxg)) {
1973 scan_ds_queue_remove(scn, ds->ds_object);
1974 scan_ds_queue_insert(scn,
1975 dsl_dataset_phys(ds)->ds_prev_snap_obj, mintxg);
1976 }
1977
1978 if (zap_lookup_int_key(dp->dp_meta_objset, scn->scn_phys.scn_queue_obj,
1979 ds->ds_object, &mintxg) == 0) {
1980 VERIFY3U(0, ==, zap_remove_int(dp->dp_meta_objset,
1981 scn->scn_phys.scn_queue_obj, ds->ds_object, tx));
1982 VERIFY(zap_add_int_key(dp->dp_meta_objset,
1983 scn->scn_phys.scn_queue_obj,
1984 dsl_dataset_phys(ds)->ds_prev_snap_obj, mintxg, tx) == 0);
1985 zfs_dbgmsg("snapshotting ds %llu; in queue; "
1986 "replacing with %llu",
1987 (u_longlong_t)ds->ds_object,
1988 (u_longlong_t)dsl_dataset_phys(ds)->ds_prev_snap_obj);
1989 }
1990
1991 dsl_scan_sync_state(scn, tx, SYNC_CACHED);
1992 }
1993
1994 static void
1995 ds_clone_swapped_bookmark(dsl_dataset_t *ds1, dsl_dataset_t *ds2,
1996 zbookmark_phys_t *scn_bookmark)
1997 {
1998 if (scn_bookmark->zb_objset == ds1->ds_object) {
1999 scn_bookmark->zb_objset = ds2->ds_object;
2000 zfs_dbgmsg("clone_swap ds %llu; currently traversing; "
2001 "reset zb_objset to %llu",
2002 (u_longlong_t)ds1->ds_object,
2003 (u_longlong_t)ds2->ds_object);
2004 } else if (scn_bookmark->zb_objset == ds2->ds_object) {
2005 scn_bookmark->zb_objset = ds1->ds_object;
2006 zfs_dbgmsg("clone_swap ds %llu; currently traversing; "
2007 "reset zb_objset to %llu",
2008 (u_longlong_t)ds2->ds_object,
2009 (u_longlong_t)ds1->ds_object);
2010 }
2011 }
2012
2013 /*
2014 * Called when a parent dataset and its clone are swapped. If we were
2015 * currently traversing the dataset, we need to switch to traversing the
2016 * newly promoted parent.
2017 */
2018 void
2019 dsl_scan_ds_clone_swapped(dsl_dataset_t *ds1, dsl_dataset_t *ds2, dmu_tx_t *tx)
2020 {
2021 dsl_pool_t *dp = ds1->ds_dir->dd_pool;
2022 dsl_scan_t *scn = dp->dp_scan;
2023 uint64_t mintxg;
2024
2025 if (!dsl_scan_is_running(scn))
2026 return;
2027
2028 ds_clone_swapped_bookmark(ds1, ds2, &scn->scn_phys.scn_bookmark);
2029 ds_clone_swapped_bookmark(ds1, ds2, &scn->scn_phys_cached.scn_bookmark);
2030
2031 if (scan_ds_queue_contains(scn, ds1->ds_object, &mintxg)) {
2032 scan_ds_queue_remove(scn, ds1->ds_object);
2033 scan_ds_queue_insert(scn, ds2->ds_object, mintxg);
2034 }
2035 if (scan_ds_queue_contains(scn, ds2->ds_object, &mintxg)) {
2036 scan_ds_queue_remove(scn, ds2->ds_object);
2037 scan_ds_queue_insert(scn, ds1->ds_object, mintxg);
2038 }
2039
2040 if (zap_lookup_int_key(dp->dp_meta_objset, scn->scn_phys.scn_queue_obj,
2041 ds1->ds_object, &mintxg) == 0) {
2042 int err;
2043 ASSERT3U(mintxg, ==, dsl_dataset_phys(ds1)->ds_prev_snap_txg);
2044 ASSERT3U(mintxg, ==, dsl_dataset_phys(ds2)->ds_prev_snap_txg);
2045 VERIFY3U(0, ==, zap_remove_int(dp->dp_meta_objset,
2046 scn->scn_phys.scn_queue_obj, ds1->ds_object, tx));
2047 err = zap_add_int_key(dp->dp_meta_objset,
2048 scn->scn_phys.scn_queue_obj, ds2->ds_object, mintxg, tx);
2049 VERIFY(err == 0 || err == EEXIST);
2050 if (err == EEXIST) {
2051 /* Both were there to begin with */
2052 VERIFY(0 == zap_add_int_key(dp->dp_meta_objset,
2053 scn->scn_phys.scn_queue_obj,
2054 ds1->ds_object, mintxg, tx));
2055 }
2056 zfs_dbgmsg("clone_swap ds %llu; in queue; "
2057 "replacing with %llu",
2058 (u_longlong_t)ds1->ds_object,
2059 (u_longlong_t)ds2->ds_object);
2060 }
2061 if (zap_lookup_int_key(dp->dp_meta_objset, scn->scn_phys.scn_queue_obj,
2062 ds2->ds_object, &mintxg) == 0) {
2063 ASSERT3U(mintxg, ==, dsl_dataset_phys(ds1)->ds_prev_snap_txg);
2064 ASSERT3U(mintxg, ==, dsl_dataset_phys(ds2)->ds_prev_snap_txg);
2065 VERIFY3U(0, ==, zap_remove_int(dp->dp_meta_objset,
2066 scn->scn_phys.scn_queue_obj, ds2->ds_object, tx));
2067 VERIFY(0 == zap_add_int_key(dp->dp_meta_objset,
2068 scn->scn_phys.scn_queue_obj, ds1->ds_object, mintxg, tx));
2069 zfs_dbgmsg("clone_swap ds %llu; in queue; "
2070 "replacing with %llu",
2071 (u_longlong_t)ds2->ds_object,
2072 (u_longlong_t)ds1->ds_object);
2073 }
2074
2075 dsl_scan_sync_state(scn, tx, SYNC_CACHED);
2076 }
2077
2078 /* ARGSUSED */
2079 static int
2080 enqueue_clones_cb(dsl_pool_t *dp, dsl_dataset_t *hds, void *arg)
2081 {
2082 uint64_t originobj = *(uint64_t *)arg;
2083 dsl_dataset_t *ds;
2084 int err;
2085 dsl_scan_t *scn = dp->dp_scan;
2086
2087 if (dsl_dir_phys(hds->ds_dir)->dd_origin_obj != originobj)
2088 return (0);
2089
2090 err = dsl_dataset_hold_obj(dp, hds->ds_object, FTAG, &ds);
2091 if (err)
2092 return (err);
2093
2094 while (dsl_dataset_phys(ds)->ds_prev_snap_obj != originobj) {
2095 dsl_dataset_t *prev;
2096 err = dsl_dataset_hold_obj(dp,
2097 dsl_dataset_phys(ds)->ds_prev_snap_obj, FTAG, &prev);
2098
2099 dsl_dataset_rele(ds, FTAG);
2100 if (err)
2101 return (err);
2102 ds = prev;
2103 }
2104 scan_ds_queue_insert(scn, ds->ds_object,
2105 dsl_dataset_phys(ds)->ds_prev_snap_txg);
2106 dsl_dataset_rele(ds, FTAG);
2107 return (0);
2108 }
2109
2110 static void
2111 dsl_scan_visitds(dsl_scan_t *scn, uint64_t dsobj, dmu_tx_t *tx)
2112 {
2113 dsl_pool_t *dp = scn->scn_dp;
2114 dsl_dataset_t *ds;
2115 objset_t *os;
2116
2117 VERIFY3U(0, ==, dsl_dataset_hold_obj(dp, dsobj, FTAG, &ds));
2118
2119 if (scn->scn_phys.scn_cur_min_txg >=
2120 scn->scn_phys.scn_max_txg) {
2121 /*
2122 * This can happen if this snapshot was created after the
2123 * scan started, and we already completed a previous snapshot
2124 * that was created after the scan started. This snapshot
2125 * only references blocks with:
2126 *
2127 * birth < our ds_creation_txg
2128 * cur_min_txg is no less than ds_creation_txg.
2129 * We have already visited these blocks.
2130 * or
2131 * birth > scn_max_txg
2132 * The scan requested not to visit these blocks.
2133 *
2134 * Subsequent snapshots (and clones) can reference our
2135 * blocks, or blocks with even higher birth times.
2136 * Therefore we do not need to visit them either,
2137 * so we do not add them to the work queue.
2138 *
2139 * Note that checking for cur_min_txg >= cur_max_txg
2140 * is not sufficient, because in that case we may need to
2141 * visit subsequent snapshots. This happens when min_txg > 0,
2142 * which raises cur_min_txg. In this case we will visit
2143 * this dataset but skip all of its blocks, because the
2144 * rootbp's birth time is < cur_min_txg. Then we will
2145 * add the next snapshots/clones to the work queue.
2146 */
2147 char *dsname = kmem_alloc(ZFS_MAX_DATASET_NAME_LEN, KM_SLEEP);
2148 dsl_dataset_name(ds, dsname);
2149 zfs_dbgmsg("scanning dataset %llu (%s) is unnecessary because "
2150 "cur_min_txg (%llu) >= max_txg (%llu)",
2151 (longlong_t)dsobj, dsname,
2152 (longlong_t)scn->scn_phys.scn_cur_min_txg,
2153 (longlong_t)scn->scn_phys.scn_max_txg);
2154 kmem_free(dsname, MAXNAMELEN);
2155
2156 goto out;
2157 }
2158
2159 if (dmu_objset_from_ds(ds, &os))
2160 goto out;
2161
2162 /*
2163 * Only the ZIL in the head (non-snapshot) is valid. Even though
2164 * snapshots can have ZIL block pointers (which may be the same
2165 * BP as in the head), they must be ignored. So we traverse the
2166 * ZIL here, rather than in scan_recurse(), because the regular
2167 * snapshot block-sharing rules don't apply to it.
2168 */
2169 if (!ds->ds_is_snapshot)
2170 dsl_scan_zil(dp, &os->os_zil_header);
2171
2172 /*
2173 * Iterate over the bps in this ds.
2174 */
2175 dmu_buf_will_dirty(ds->ds_dbuf, tx);
2176 rrw_enter(&ds->ds_bp_rwlock, RW_READER, FTAG);
2177 dsl_scan_visit_rootbp(scn, ds, &dsl_dataset_phys(ds)->ds_bp, tx);
2178 rrw_exit(&ds->ds_bp_rwlock, FTAG);
2179
2180 char *dsname = kmem_alloc(ZFS_MAX_DATASET_NAME_LEN, KM_SLEEP);
2181 dsl_dataset_name(ds, dsname);
2182 zfs_dbgmsg("scanned dataset %llu (%s) with min=%llu max=%llu; "
2183 "suspending=%u",
2184 (longlong_t)dsobj, dsname,
2185 (longlong_t)scn->scn_phys.scn_cur_min_txg,
2186 (longlong_t)scn->scn_phys.scn_cur_max_txg,
2187 (int)scn->scn_suspending);
2188 kmem_free(dsname, ZFS_MAX_DATASET_NAME_LEN);
2189
2190 if (scn->scn_suspending)
2191 goto out;
2192
2193 /*
2194 * We've finished this pass over this dataset.
2195 */
2196
2197 /*
2198 * If we did not completely visit this dataset, do another pass.
2199 */
2200 if (scn->scn_phys.scn_flags & DSF_VISIT_DS_AGAIN) {
2201 zfs_dbgmsg("incomplete pass; visiting again");
2202 scn->scn_phys.scn_flags &= ~DSF_VISIT_DS_AGAIN;
2203 scan_ds_queue_insert(scn, ds->ds_object,
2204 scn->scn_phys.scn_cur_max_txg);
2205 goto out;
2206 }
2207
2208 /*
2209 * Add descendant datasets to work queue.
2210 */
2211 if (dsl_dataset_phys(ds)->ds_next_snap_obj != 0) {
2212 scan_ds_queue_insert(scn,
2213 dsl_dataset_phys(ds)->ds_next_snap_obj,
2214 dsl_dataset_phys(ds)->ds_creation_txg);
2215 }
2216 if (dsl_dataset_phys(ds)->ds_num_children > 1) {
2217 boolean_t usenext = B_FALSE;
2218 if (dsl_dataset_phys(ds)->ds_next_clones_obj != 0) {
2219 uint64_t count;
2220 /*
2221 * A bug in a previous version of the code could
2222 * cause upgrade_clones_cb() to not set
2223 * ds_next_snap_obj when it should, leading to a
2224 * missing entry. Therefore we can only use the
2225 * next_clones_obj when its count is correct.
2226 */
2227 int err = zap_count(dp->dp_meta_objset,
2228 dsl_dataset_phys(ds)->ds_next_clones_obj, &count);
2229 if (err == 0 &&
2230 count == dsl_dataset_phys(ds)->ds_num_children - 1)
2231 usenext = B_TRUE;
2232 }
2233
2234 if (usenext) {
2235 zap_cursor_t zc;
2236 zap_attribute_t za;
2237 for (zap_cursor_init(&zc, dp->dp_meta_objset,
2238 dsl_dataset_phys(ds)->ds_next_clones_obj);
2239 zap_cursor_retrieve(&zc, &za) == 0;
2240 (void) zap_cursor_advance(&zc)) {
2241 scan_ds_queue_insert(scn,
2242 zfs_strtonum(za.za_name, NULL),
2243 dsl_dataset_phys(ds)->ds_creation_txg);
2244 }
2245 zap_cursor_fini(&zc);
2246 } else {
2247 VERIFY0(dmu_objset_find_dp(dp, dp->dp_root_dir_obj,
2248 enqueue_clones_cb, &ds->ds_object,
2249 DS_FIND_CHILDREN));
2250 }
2251 }
2252
2253 out:
2254 dsl_dataset_rele(ds, FTAG);
2255 }
2256
2257 /* ARGSUSED */
2258 static int
2259 enqueue_cb(dsl_pool_t *dp, dsl_dataset_t *hds, void *arg)
2260 {
2261 dsl_dataset_t *ds;
2262 int err;
2263 dsl_scan_t *scn = dp->dp_scan;
2264
2265 err = dsl_dataset_hold_obj(dp, hds->ds_object, FTAG, &ds);
2266 if (err)
2267 return (err);
2268
2269 while (dsl_dataset_phys(ds)->ds_prev_snap_obj != 0) {
2270 dsl_dataset_t *prev;
2271 err = dsl_dataset_hold_obj(dp,
2272 dsl_dataset_phys(ds)->ds_prev_snap_obj, FTAG, &prev);
2273 if (err) {
2274 dsl_dataset_rele(ds, FTAG);
2275 return (err);
2276 }
2277
2278 /*
2279 * If this is a clone, we don't need to worry about it for now.
2280 */
2281 if (dsl_dataset_phys(prev)->ds_next_snap_obj != ds->ds_object) {
2282 dsl_dataset_rele(ds, FTAG);
2283 dsl_dataset_rele(prev, FTAG);
2284 return (0);
2285 }
2286 dsl_dataset_rele(ds, FTAG);
2287 ds = prev;
2288 }
2289
2290 scan_ds_queue_insert(scn, ds->ds_object,
2291 dsl_dataset_phys(ds)->ds_prev_snap_txg);
2292 dsl_dataset_rele(ds, FTAG);
2293 return (0);
2294 }
2295
2296 /* ARGSUSED */
2297 void
2298 dsl_scan_ddt_entry(dsl_scan_t *scn, enum zio_checksum checksum,
2299 ddt_entry_t *dde, dmu_tx_t *tx)
2300 {
2301 const ddt_key_t *ddk = &dde->dde_key;
2302 ddt_phys_t *ddp = dde->dde_phys;
2303 blkptr_t bp;
2304 zbookmark_phys_t zb = { 0 };
2305 int p;
2306
2307 if (!dsl_scan_is_running(scn))
2308 return;
2309
2310 for (p = 0; p < DDT_PHYS_TYPES; p++, ddp++) {
2311 if (ddp->ddp_phys_birth == 0 ||
2312 ddp->ddp_phys_birth > scn->scn_phys.scn_max_txg)
2313 continue;
2314 ddt_bp_create(checksum, ddk, ddp, &bp);
2315
2316 scn->scn_visited_this_txg++;
2317 scan_funcs[scn->scn_phys.scn_func](scn->scn_dp, &bp, &zb);
2318 }
2319 }
2320
2321 /*
2322 * Scrub/dedup interaction.
2323 *
2324 * If there are N references to a deduped block, we don't want to scrub it
2325 * N times -- ideally, we should scrub it exactly once.
2326 *
2327 * We leverage the fact that the dde's replication class (enum ddt_class)
2328 * is ordered from highest replication class (DDT_CLASS_DITTO) to lowest
2329 * (DDT_CLASS_UNIQUE) so that we may walk the DDT in that order.
2330 *
2331 * To prevent excess scrubbing, the scrub begins by walking the DDT
2332 * to find all blocks with refcnt > 1, and scrubs each of these once.
2333 * Since there are two replication classes which contain blocks with
2334 * refcnt > 1, we scrub the highest replication class (DDT_CLASS_DITTO) first.
2335 * Finally the top-down scrub begins, only visiting blocks with refcnt == 1.
2336 *
2337 * There would be nothing more to say if a block's refcnt couldn't change
2338 * during a scrub, but of course it can so we must account for changes
2339 * in a block's replication class.
2340 *
2341 * Here's an example of what can occur:
2342 *
2343 * If a block has refcnt > 1 during the DDT scrub phase, but has refcnt == 1
2344 * when visited during the top-down scrub phase, it will be scrubbed twice.
2345 * This negates our scrub optimization, but is otherwise harmless.
2346 *
2347 * If a block has refcnt == 1 during the DDT scrub phase, but has refcnt > 1
2348 * on each visit during the top-down scrub phase, it will never be scrubbed.
2349 * To catch this, ddt_sync_entry() notifies the scrub code whenever a block's
2350 * reference class transitions to a higher level (i.e DDT_CLASS_UNIQUE to
2351 * DDT_CLASS_DUPLICATE); if it transitions from refcnt == 1 to refcnt > 1
2352 * while a scrub is in progress, it scrubs the block right then.
2353 */
2354 static void
2355 dsl_scan_ddt(dsl_scan_t *scn, dmu_tx_t *tx)
2356 {
2357 ddt_bookmark_t *ddb = &scn->scn_phys.scn_ddt_bookmark;
2358 ddt_entry_t dde;
2359 int error;
2360 uint64_t n = 0;
2361
2362 bzero(&dde, sizeof (ddt_entry_t));
2363
2364 while ((error = ddt_walk(scn->scn_dp->dp_spa, ddb, &dde)) == 0) {
2365 ddt_t *ddt;
2366
2367 if (ddb->ddb_class > scn->scn_phys.scn_ddt_class_max)
2368 break;
2369 dprintf("visiting ddb=%llu/%llu/%llu/%llx\n",
2370 (longlong_t)ddb->ddb_class,
2371 (longlong_t)ddb->ddb_type,
2372 (longlong_t)ddb->ddb_checksum,
2373 (longlong_t)ddb->ddb_cursor);
2374
2375 /* There should be no pending changes to the dedup table */
2376 ddt = scn->scn_dp->dp_spa->spa_ddt[ddb->ddb_checksum];
2377 ASSERT(avl_first(&ddt->ddt_tree) == NULL);
2378
2379 dsl_scan_ddt_entry(scn, ddb->ddb_checksum, &dde, tx);
2380 n++;
2381
2382 if (dsl_scan_check_suspend(scn, NULL))
2383 break;
2384 }
2385
2386 zfs_dbgmsg("scanned %llu ddt entries with class_max = %u; "
2387 "suspending=%u", (longlong_t)n,
2388 (int)scn->scn_phys.scn_ddt_class_max, (int)scn->scn_suspending);
2389
2390 ASSERT(error == 0 || error == ENOENT);
2391 ASSERT(error != ENOENT ||
2392 ddb->ddb_class > scn->scn_phys.scn_ddt_class_max);
2393 }
2394
2395 static uint64_t
2396 dsl_scan_ds_maxtxg(dsl_dataset_t *ds)
2397 {
2398 uint64_t smt = ds->ds_dir->dd_pool->dp_scan->scn_phys.scn_max_txg;
2399 if (ds->ds_is_snapshot)
2400 return (MIN(smt, dsl_dataset_phys(ds)->ds_creation_txg));
2401 return (smt);
2402 }
2403
2404 static void
2405 dsl_scan_visit(dsl_scan_t *scn, dmu_tx_t *tx)
2406 {
2407 scan_ds_t *sds;
2408 dsl_pool_t *dp = scn->scn_dp;
2409
2410 if (scn->scn_phys.scn_ddt_bookmark.ddb_class <=
2411 scn->scn_phys.scn_ddt_class_max) {
2412 scn->scn_phys.scn_cur_min_txg = scn->scn_phys.scn_min_txg;
2413 scn->scn_phys.scn_cur_max_txg = scn->scn_phys.scn_max_txg;
2414 dsl_scan_ddt(scn, tx);
2415 if (scn->scn_suspending)
2416 return;
2417 }
2418
2419 if (scn->scn_phys.scn_bookmark.zb_objset == DMU_META_OBJSET) {
2420 /* First do the MOS & ORIGIN */
2421
2422 scn->scn_phys.scn_cur_min_txg = scn->scn_phys.scn_min_txg;
2423 scn->scn_phys.scn_cur_max_txg = scn->scn_phys.scn_max_txg;
2424 dsl_scan_visit_rootbp(scn, NULL,
2425 &dp->dp_meta_rootbp, tx);
2426 spa_set_rootblkptr(dp->dp_spa, &dp->dp_meta_rootbp);
2427 if (scn->scn_suspending)
2428 return;
2429
2430 if (spa_version(dp->dp_spa) < SPA_VERSION_DSL_SCRUB) {
2431 VERIFY0(dmu_objset_find_dp(dp, dp->dp_root_dir_obj,
2432 enqueue_cb, NULL, DS_FIND_CHILDREN));
2433 } else {
2434 dsl_scan_visitds(scn,
2435 dp->dp_origin_snap->ds_object, tx);
2436 }
2437 ASSERT(!scn->scn_suspending);
2438 } else if (scn->scn_phys.scn_bookmark.zb_objset !=
2439 ZB_DESTROYED_OBJSET) {
2440 uint64_t dsobj = scn->scn_phys.scn_bookmark.zb_objset;
2441 /*
2442 * If we were suspended, continue from here. Note if the
2443 * ds we were suspended on was deleted, the zb_objset may
2444 * be -1, so we will skip this and find a new objset
2445 * below.
2446 */
2447 dsl_scan_visitds(scn, dsobj, tx);
2448 if (scn->scn_suspending)
2449 return;
2450 }
2451
2452 /*
2453 * In case we suspended right at the end of the ds, zero the
2454 * bookmark so we don't think that we're still trying to resume.
2455 */
2456 bzero(&scn->scn_phys.scn_bookmark, sizeof (zbookmark_phys_t));
2457
2458 /*
2459 * Keep pulling things out of the dataset avl queue. Updates to the
2460 * persistent zap-object-as-queue happen only at checkpoints.
2461 */
2462 while ((sds = avl_first(&scn->scn_queue)) != NULL) {
2463 dsl_dataset_t *ds;
2464 uint64_t dsobj = sds->sds_dsobj;
2465 uint64_t txg = sds->sds_txg;
2466
2467 /* dequeue and free the ds from the queue */
2468 scan_ds_queue_remove(scn, dsobj);
2469 sds = NULL;
2470
2471 /* set up min / max txg */
2472 VERIFY3U(0, ==, dsl_dataset_hold_obj(dp, dsobj, FTAG, &ds));
2473 if (txg != 0) {
2474 scn->scn_phys.scn_cur_min_txg =
2475 MAX(scn->scn_phys.scn_min_txg, txg);
2476 } else {
2477 scn->scn_phys.scn_cur_min_txg =
2478 MAX(scn->scn_phys.scn_min_txg,
2479 dsl_dataset_phys(ds)->ds_prev_snap_txg);
2480 }
2481 scn->scn_phys.scn_cur_max_txg = dsl_scan_ds_maxtxg(ds);
2482 dsl_dataset_rele(ds, FTAG);
2483
2484 dsl_scan_visitds(scn, dsobj, tx);
2485 if (scn->scn_suspending)
2486 return;
2487 }
2488
2489 /* No more objsets to fetch, we're done */
2490 scn->scn_phys.scn_bookmark.zb_objset = ZB_DESTROYED_OBJSET;
2491 ASSERT0(scn->scn_suspending);
2492 }
2493
2494 static uint64_t
2495 dsl_scan_count_leaves(vdev_t *vd)
2496 {
2497 uint64_t i, leaves = 0;
2498
2499 /* we only count leaves that belong to the main pool and are readable */
2500 if (vd->vdev_islog || vd->vdev_isspare ||
2501 vd->vdev_isl2cache || !vdev_readable(vd))
2502 return (0);
2503
2504 if (vd->vdev_ops->vdev_op_leaf)
2505 return (1);
2506
2507 for (i = 0; i < vd->vdev_children; i++) {
2508 leaves += dsl_scan_count_leaves(vd->vdev_child[i]);
2509 }
2510
2511 return (leaves);
2512 }
2513
2514 static void
2515 scan_io_queues_update_zio_stats(dsl_scan_io_queue_t *q, const blkptr_t *bp)
2516 {
2517 int i;
2518 uint64_t cur_size = 0;
2519
2520 for (i = 0; i < BP_GET_NDVAS(bp); i++) {
2521 cur_size += DVA_GET_ASIZE(&bp->blk_dva[i]);
2522 }
2523
2524 q->q_total_zio_size_this_txg += cur_size;
2525 q->q_zios_this_txg++;
2526 }
2527
2528 static void
2529 scan_io_queues_update_seg_stats(dsl_scan_io_queue_t *q, uint64_t start,
2530 uint64_t end)
2531 {
2532 q->q_total_seg_size_this_txg += end - start;
2533 q->q_segs_this_txg++;
2534 }
2535
2536 static boolean_t
2537 scan_io_queue_check_suspend(dsl_scan_t *scn)
2538 {
2539 /* See comment in dsl_scan_check_suspend() */
2540 uint64_t curr_time_ns = gethrtime();
2541 uint64_t scan_time_ns = curr_time_ns - scn->scn_sync_start_time;
2542 uint64_t sync_time_ns = curr_time_ns -
2543 scn->scn_dp->dp_spa->spa_sync_starttime;
2544 int dirty_pct = scn->scn_dp->dp_dirty_total * 100 / zfs_dirty_data_max;
2545 int mintime = (scn->scn_phys.scn_func == POOL_SCAN_RESILVER) ?
2546 zfs_resilver_min_time_ms : zfs_scrub_min_time_ms;
2547
2548 return ((NSEC2MSEC(scan_time_ns) > mintime &&
2549 (dirty_pct >= zfs_vdev_async_write_active_min_dirty_percent ||
2550 txg_sync_waiting(scn->scn_dp) ||
2551 NSEC2SEC(sync_time_ns) >= zfs_txg_timeout)) ||
2552 spa_shutting_down(scn->scn_dp->dp_spa));
2553 }
2554
2555 /*
2556 * Given a list of scan_io_t's in io_list, this issues the I/Os out to
2557 * disk. This consumes the io_list and frees the scan_io_t's. This is
2558 * called when emptying queues, either when we're up against the memory
2559 * limit or when we have finished scanning. Returns B_TRUE if we stopped
2560 * processing the list before we finished. Any sios that were not issued
2561 * will remain in the io_list.
2562 */
2563 static boolean_t
2564 scan_io_queue_issue(dsl_scan_io_queue_t *queue, list_t *io_list)
2565 {
2566 dsl_scan_t *scn = queue->q_scn;
2567 scan_io_t *sio;
2568 int64_t bytes_issued = 0;
2569 boolean_t suspended = B_FALSE;
2570
2571 while ((sio = list_head(io_list)) != NULL) {
2572 blkptr_t bp;
2573
2574 if (scan_io_queue_check_suspend(scn)) {
2575 suspended = B_TRUE;
2576 break;
2577 }
2578
2579 sio2bp(sio, &bp, queue->q_vd->vdev_id);
2580 bytes_issued += sio->sio_asize;
2581 scan_exec_io(scn->scn_dp, &bp, sio->sio_flags,
2582 &sio->sio_zb, queue);
2583 (void) list_remove_head(io_list);
2584 scan_io_queues_update_zio_stats(queue, &bp);
2585 kmem_cache_free(sio_cache, sio);
2586 }
2587
2588 atomic_add_64(&scn->scn_bytes_pending, -bytes_issued);
2589
2590 return (suspended);
2591 }
2592
2593 /*
2594 * This function removes sios from an IO queue which reside within a given
2595 * range_seg_t and inserts them (in offset order) into a list. Note that
2596 * we only ever return a maximum of 32 sios at once. If there are more sios
2597 * to process within this segment that did not make it onto the list we
2598 * return B_TRUE and otherwise B_FALSE.
2599 */
2600 static boolean_t
2601 scan_io_queue_gather(dsl_scan_io_queue_t *queue, range_seg_t *rs, list_t *list)
2602 {
2603 scan_io_t srch_sio, *sio, *next_sio;
2604 avl_index_t idx;
2605 uint_t num_sios = 0;
2606 int64_t bytes_issued = 0;
2607
2608 ASSERT(rs != NULL);
2609 ASSERT(MUTEX_HELD(&queue->q_vd->vdev_scan_io_queue_lock));
2610
2611 srch_sio.sio_offset = rs->rs_start;
2612
2613 /*
2614 * The exact start of the extent might not contain any matching zios,
2615 * so if that's the case, examine the next one in the tree.
2616 */
2617 sio = avl_find(&queue->q_sios_by_addr, &srch_sio, &idx);
2618 if (sio == NULL)
2619 sio = avl_nearest(&queue->q_sios_by_addr, idx, AVL_AFTER);
2620
2621 while (sio != NULL && sio->sio_offset < rs->rs_end && num_sios <= 32) {
2622 ASSERT3U(sio->sio_offset, >=, rs->rs_start);
2623 ASSERT3U(sio->sio_offset + sio->sio_asize, <=, rs->rs_end);
2624
2625 next_sio = AVL_NEXT(&queue->q_sios_by_addr, sio);
2626 avl_remove(&queue->q_sios_by_addr, sio);
2627
2628 bytes_issued += sio->sio_asize;
2629 num_sios++;
2630 list_insert_tail(list, sio);
2631 sio = next_sio;
2632 }
2633
2634 /*
2635 * We limit the number of sios we process at once to 32 to avoid
2636 * biting off more than we can chew. If we didn't take everything
2637 * in the segment we update it to reflect the work we were able to
2638 * complete. Otherwise, we remove it from the range tree entirely.
2639 */
2640 if (sio != NULL && sio->sio_offset < rs->rs_end) {
2641 range_tree_adjust_fill(queue->q_exts_by_addr, rs,
2642 -bytes_issued);
2643 range_tree_resize_segment(queue->q_exts_by_addr, rs,
2644 sio->sio_offset, rs->rs_end - sio->sio_offset);
2645
2646 return (B_TRUE);
2647 } else {
2648 range_tree_remove(queue->q_exts_by_addr, rs->rs_start,
2649 rs->rs_end - rs->rs_start);
2650 return (B_FALSE);
2651 }
2652 }
2653
2654 /*
2655 * This is called from the queue emptying thread and selects the next
2656 * extent from which we are to issue I/Os. The behavior of this function
2657 * depends on the state of the scan, the current memory consumption and
2658 * whether or not we are performing a scan shutdown.
2659 * 1) We select extents in an elevator algorithm (LBA-order) if the scan
2660 * needs to perform a checkpoint
2661 * 2) We select the largest available extent if we are up against the
2662 * memory limit.
2663 * 3) Otherwise we don't select any extents.
2664 */
2665 static range_seg_t *
2666 scan_io_queue_fetch_ext(dsl_scan_io_queue_t *queue)
2667 {
2668 dsl_scan_t *scn = queue->q_scn;
2669
2670 ASSERT(MUTEX_HELD(&queue->q_vd->vdev_scan_io_queue_lock));
2671 ASSERT(scn->scn_is_sorted);
2672
2673 /* handle tunable overrides */
2674 if (scn->scn_checkpointing || scn->scn_clearing) {
2675 if (zfs_scan_issue_strategy == 1) {
2676 return (range_tree_first(queue->q_exts_by_addr));
2677 } else if (zfs_scan_issue_strategy == 2) {
2678 return (avl_first(&queue->q_exts_by_size));
2679 }
2680 }
2681
2682 /*
2683 * During normal clearing, we want to issue our largest segments
2684 * first, keeping IO as sequential as possible, and leaving the
2685 * smaller extents for later with the hope that they might eventually
2686 * grow to larger sequential segments. However, when the scan is
2687 * checkpointing, no new extents will be added to the sorting queue,
2688 * so the way we are sorted now is as good as it will ever get.
2689 * In this case, we instead switch to issuing extents in LBA order.
2690 */
2691 if (scn->scn_checkpointing) {
2692 return (range_tree_first(queue->q_exts_by_addr));
2693 } else if (scn->scn_clearing) {
2694 return (avl_first(&queue->q_exts_by_size));
2695 } else {
2696 return (NULL);
2697 }
2698 }
2699
2700 static void
2701 scan_io_queues_run_one(void *arg)
2702 {
2703 dsl_scan_io_queue_t *queue = arg;
2704 kmutex_t *q_lock = &queue->q_vd->vdev_scan_io_queue_lock;
2705 boolean_t suspended = B_FALSE;
2706 range_seg_t *rs = NULL;
2707 scan_io_t *sio = NULL;
2708 list_t sio_list;
2709 uint64_t bytes_per_leaf = zfs_scan_vdev_limit;
2710 uint64_t nr_leaves = dsl_scan_count_leaves(queue->q_vd);
2711
2712 ASSERT(queue->q_scn->scn_is_sorted);
2713
2714 list_create(&sio_list, sizeof (scan_io_t),
2715 offsetof(scan_io_t, sio_nodes.sio_list_node));
2716 mutex_enter(q_lock);
2717
2718 /* calculate maximum in-flight bytes for this txg (min 1MB) */
2719 queue->q_maxinflight_bytes =
2720 MAX(nr_leaves * bytes_per_leaf, 1ULL << 20);
2721
2722 /* reset per-queue scan statistics for this txg */
2723 queue->q_total_seg_size_this_txg = 0;
2724 queue->q_segs_this_txg = 0;
2725 queue->q_total_zio_size_this_txg = 0;
2726 queue->q_zios_this_txg = 0;
2727
2728 /* loop until we run out of time or sios */
2729 while ((rs = scan_io_queue_fetch_ext(queue)) != NULL) {
2730 uint64_t seg_start = 0, seg_end = 0;
2731 boolean_t more_left = B_TRUE;
2732
2733 ASSERT(list_is_empty(&sio_list));
2734
2735 /* loop while we still have sios left to process in this rs */
2736 while (more_left) {
2737 scan_io_t *first_sio, *last_sio;
2738
2739 /*
2740 * We have selected which extent needs to be
2741 * processed next. Gather up the corresponding sios.
2742 */
2743 more_left = scan_io_queue_gather(queue, rs, &sio_list);
2744 ASSERT(!list_is_empty(&sio_list));
2745 first_sio = list_head(&sio_list);
2746 last_sio = list_tail(&sio_list);
2747
2748 seg_end = last_sio->sio_offset + last_sio->sio_asize;
2749 if (seg_start == 0)
2750 seg_start = first_sio->sio_offset;
2751
2752 /*
2753 * Issuing sios can take a long time so drop the
2754 * queue lock. The sio queue won't be updated by
2755 * other threads since we're in syncing context so
2756 * we can be sure that our trees will remain exactly
2757 * as we left them.
2758 */
2759 mutex_exit(q_lock);
2760 suspended = scan_io_queue_issue(queue, &sio_list);
2761 mutex_enter(q_lock);
2762
2763 if (suspended)
2764 break;
2765 }
2766
2767 /* update statistics for debugging purposes */
2768 scan_io_queues_update_seg_stats(queue, seg_start, seg_end);
2769
2770 if (suspended)
2771 break;
2772 }
2773
2774 /*
2775 * If we were suspended in the middle of processing,
2776 * requeue any unfinished sios and exit.
2777 */
2778 while ((sio = list_head(&sio_list)) != NULL) {
2779 list_remove(&sio_list, sio);
2780 scan_io_queue_insert_impl(queue, sio);
2781 }
2782
2783 mutex_exit(q_lock);
2784 list_destroy(&sio_list);
2785 }
2786
2787 /*
2788 * Performs an emptying run on all scan queues in the pool. This just
2789 * punches out one thread per top-level vdev, each of which processes
2790 * only that vdev's scan queue. We can parallelize the I/O here because
2791 * we know that each queue's I/Os only affect its own top-level vdev.
2792 *
2793 * This function waits for the queue runs to complete, and must be
2794 * called from dsl_scan_sync (or in general, syncing context).
2795 */
2796 static void
2797 scan_io_queues_run(dsl_scan_t *scn)
2798 {
2799 spa_t *spa = scn->scn_dp->dp_spa;
2800
2801 ASSERT(scn->scn_is_sorted);
2802 ASSERT(spa_config_held(spa, SCL_CONFIG, RW_READER));
2803
2804 if (scn->scn_bytes_pending == 0)
2805 return;
2806
2807 if (scn->scn_taskq == NULL) {
2808 int nthreads = spa->spa_root_vdev->vdev_children;
2809
2810 /*
2811 * We need to make this taskq *always* execute as many
2812 * threads in parallel as we have top-level vdevs and no
2813 * less, otherwise strange serialization of the calls to
2814 * scan_io_queues_run_one can occur during spa_sync runs
2815 * and that significantly impacts performance.
2816 */
2817 scn->scn_taskq = taskq_create("dsl_scan_iss", nthreads,
2818 minclsyspri, nthreads, nthreads, TASKQ_PREPOPULATE);
2819 }
2820
2821 for (uint64_t i = 0; i < spa->spa_root_vdev->vdev_children; i++) {
2822 vdev_t *vd = spa->spa_root_vdev->vdev_child[i];
2823
2824 mutex_enter(&vd->vdev_scan_io_queue_lock);
2825 if (vd->vdev_scan_io_queue != NULL) {
2826 VERIFY(taskq_dispatch(scn->scn_taskq,
2827 scan_io_queues_run_one, vd->vdev_scan_io_queue,
2828 TQ_SLEEP) != TASKQID_INVALID);
2829 }
2830 mutex_exit(&vd->vdev_scan_io_queue_lock);
2831 }
2832
2833 /*
2834 * Wait for the queues to finish issuing their IOs for this run
2835 * before we return. There may still be IOs in flight at this
2836 * point.
2837 */
2838 taskq_wait(scn->scn_taskq);
2839 }
2840
2841 static boolean_t
2842 dsl_scan_free_should_suspend(dsl_scan_t *scn)
2843 {
2844 uint64_t elapsed_nanosecs;
2845
2846 if (zfs_recover)
2847 return (B_FALSE);
2848
2849 if (scn->scn_visited_this_txg >= zfs_free_max_blocks)
2850 return (B_TRUE);
2851
2852 elapsed_nanosecs = gethrtime() - scn->scn_sync_start_time;
2853 return (elapsed_nanosecs / NANOSEC > zfs_txg_timeout ||
2854 (NSEC2MSEC(elapsed_nanosecs) > zfs_free_min_time_ms &&
2855 txg_sync_waiting(scn->scn_dp)) ||
2856 spa_shutting_down(scn->scn_dp->dp_spa));
2857 }
2858
2859 static int
2860 dsl_scan_free_block_cb(void *arg, const blkptr_t *bp, dmu_tx_t *tx)
2861 {
2862 dsl_scan_t *scn = arg;
2863
2864 if (!scn->scn_is_bptree ||
2865 (BP_GET_LEVEL(bp) == 0 && BP_GET_TYPE(bp) != DMU_OT_OBJSET)) {
2866 if (dsl_scan_free_should_suspend(scn))
2867 return (SET_ERROR(ERESTART));
2868 }
2869
2870 zio_nowait(zio_free_sync(scn->scn_zio_root, scn->scn_dp->dp_spa,
2871 dmu_tx_get_txg(tx), bp, 0));
2872 dsl_dir_diduse_space(tx->tx_pool->dp_free_dir, DD_USED_HEAD,
2873 -bp_get_dsize_sync(scn->scn_dp->dp_spa, bp),
2874 -BP_GET_PSIZE(bp), -BP_GET_UCSIZE(bp), tx);
2875 scn->scn_visited_this_txg++;
2876 return (0);
2877 }
2878
2879 static void
2880 dsl_scan_update_stats(dsl_scan_t *scn)
2881 {
2882 spa_t *spa = scn->scn_dp->dp_spa;
2883 uint64_t i;
2884 uint64_t seg_size_total = 0, zio_size_total = 0;
2885 uint64_t seg_count_total = 0, zio_count_total = 0;
2886
2887 for (i = 0; i < spa->spa_root_vdev->vdev_children; i++) {
2888 vdev_t *vd = spa->spa_root_vdev->vdev_child[i];
2889 dsl_scan_io_queue_t *queue = vd->vdev_scan_io_queue;
2890
2891 if (queue == NULL)
2892 continue;
2893
2894 seg_size_total += queue->q_total_seg_size_this_txg;
2895 zio_size_total += queue->q_total_zio_size_this_txg;
2896 seg_count_total += queue->q_segs_this_txg;
2897 zio_count_total += queue->q_zios_this_txg;
2898 }
2899
2900 if (seg_count_total == 0 || zio_count_total == 0) {
2901 scn->scn_avg_seg_size_this_txg = 0;
2902 scn->scn_avg_zio_size_this_txg = 0;
2903 scn->scn_segs_this_txg = 0;
2904 scn->scn_zios_this_txg = 0;
2905 return;
2906 }
2907
2908 scn->scn_avg_seg_size_this_txg = seg_size_total / seg_count_total;
2909 scn->scn_avg_zio_size_this_txg = zio_size_total / zio_count_total;
2910 scn->scn_segs_this_txg = seg_count_total;
2911 scn->scn_zios_this_txg = zio_count_total;
2912 }
2913
2914 boolean_t
2915 dsl_scan_active(dsl_scan_t *scn)
2916 {
2917 spa_t *spa = scn->scn_dp->dp_spa;
2918 uint64_t used = 0, comp, uncomp;
2919
2920 if (spa->spa_load_state != SPA_LOAD_NONE)
2921 return (B_FALSE);
2922 if (spa_shutting_down(spa))
2923 return (B_FALSE);
2924 if ((dsl_scan_is_running(scn) && !dsl_scan_is_paused_scrub(scn)) ||
2925 (scn->scn_async_destroying && !scn->scn_async_stalled))
2926 return (B_TRUE);
2927
2928 if (spa_version(scn->scn_dp->dp_spa) >= SPA_VERSION_DEADLISTS) {
2929 (void) bpobj_space(&scn->scn_dp->dp_free_bpobj,
2930 &used, &comp, &uncomp);
2931 }
2932 return (used != 0);
2933 }
2934
2935 static boolean_t
2936 dsl_scan_need_resilver(spa_t *spa, const dva_t *dva, size_t psize,
2937 uint64_t phys_birth)
2938 {
2939 vdev_t *vd;
2940
2941 if (DVA_GET_GANG(dva)) {
2942 /*
2943 * Gang members may be spread across multiple
2944 * vdevs, so the best estimate we have is the
2945 * scrub range, which has already been checked.
2946 * XXX -- it would be better to change our
2947 * allocation policy to ensure that all
2948 * gang members reside on the same vdev.
2949 */
2950 return (B_TRUE);
2951 }
2952
2953 vd = vdev_lookup_top(spa, DVA_GET_VDEV(dva));
2954
2955 /*
2956 * Check if the txg falls within the range which must be
2957 * resilvered. DVAs outside this range can always be skipped.
2958 */
2959 if (!vdev_dtl_contains(vd, DTL_PARTIAL, phys_birth, 1))
2960 return (B_FALSE);
2961
2962 /*
2963 * Check if the top-level vdev must resilver this offset.
2964 * When the offset does not intersect with a dirty leaf DTL
2965 * then it may be possible to skip the resilver IO. The psize
2966 * is provided instead of asize to simplify the check for RAIDZ.
2967 */
2968 if (!vdev_dtl_need_resilver(vd, DVA_GET_OFFSET(dva), psize))
2969 return (B_FALSE);
2970
2971 return (B_TRUE);
2972 }
2973
2974 /*
2975 * This is the primary entry point for scans that is called from syncing
2976 * context. Scans must happen entirely during syncing context so that we
2977 * cna guarantee that blocks we are currently scanning will not change out
2978 * from under us. While a scan is active, this function controls how quickly
2979 * transaction groups proceed, instead of the normal handling provided by
2980 * txg_sync_thread().
2981 */
2982 void
2983 dsl_scan_sync(dsl_pool_t *dp, dmu_tx_t *tx)
2984 {
2985 int err = 0;
2986 dsl_scan_t *scn = dp->dp_scan;
2987 spa_t *spa = dp->dp_spa;
2988 state_sync_type_t sync_type = SYNC_OPTIONAL;
2989
2990 /*
2991 * Check for scn_restart_txg before checking spa_load_state, so
2992 * that we can restart an old-style scan while the pool is being
2993 * imported (see dsl_scan_init).
2994 */
2995 if (dsl_scan_restarting(scn, tx)) {
2996 pool_scan_func_t func = POOL_SCAN_SCRUB;
2997 dsl_scan_done(scn, B_FALSE, tx);
2998 if (vdev_resilver_needed(spa->spa_root_vdev, NULL, NULL))
2999 func = POOL_SCAN_RESILVER;
3000 zfs_dbgmsg("restarting scan func=%u txg=%llu",
3001 func, (longlong_t)tx->tx_txg);
3002 dsl_scan_setup_sync(&func, tx);
3003 }
3004
3005 /*
3006 * Only process scans in sync pass 1.
3007 */
3008 if (spa_sync_pass(spa) > 1)
3009 return;
3010
3011 /*
3012 * If the spa is shutting down, then stop scanning. This will
3013 * ensure that the scan does not dirty any new data during the
3014 * shutdown phase.
3015 */
3016 if (spa_shutting_down(spa))
3017 return;
3018
3019 /*
3020 * If the scan is inactive due to a stalled async destroy, try again.
3021 */
3022 if (!scn->scn_async_stalled && !dsl_scan_active(scn))
3023 return;
3024
3025 /* reset scan statistics */
3026 scn->scn_visited_this_txg = 0;
3027 scn->scn_holes_this_txg = 0;
3028 scn->scn_lt_min_this_txg = 0;
3029 scn->scn_gt_max_this_txg = 0;
3030 scn->scn_ddt_contained_this_txg = 0;
3031 scn->scn_objsets_visited_this_txg = 0;
3032 scn->scn_avg_seg_size_this_txg = 0;
3033 scn->scn_segs_this_txg = 0;
3034 scn->scn_avg_zio_size_this_txg = 0;
3035 scn->scn_zios_this_txg = 0;
3036 scn->scn_suspending = B_FALSE;
3037 scn->scn_sync_start_time = gethrtime();
3038 spa->spa_scrub_active = B_TRUE;
3039
3040 /*
3041 * First process the async destroys. If we suspend, don't do
3042 * any scrubbing or resilvering. This ensures that there are no
3043 * async destroys while we are scanning, so the scan code doesn't
3044 * have to worry about traversing it. It is also faster to free the
3045 * blocks than to scrub them.
3046 */
3047 if (zfs_free_bpobj_enabled &&
3048 spa_version(spa) >= SPA_VERSION_DEADLISTS) {
3049 scn->scn_is_bptree = B_FALSE;
3050 scn->scn_zio_root = zio_root(spa, NULL,
3051 NULL, ZIO_FLAG_MUSTSUCCEED);
3052 err = bpobj_iterate(&dp->dp_free_bpobj,
3053 dsl_scan_free_block_cb, scn, tx);
3054 VERIFY0(zio_wait(scn->scn_zio_root));
3055 scn->scn_zio_root = NULL;
3056
3057 if (err != 0 && err != ERESTART)
3058 zfs_panic_recover("error %u from bpobj_iterate()", err);
3059 }
3060
3061 if (err == 0 && spa_feature_is_active(spa, SPA_FEATURE_ASYNC_DESTROY)) {
3062 ASSERT(scn->scn_async_destroying);
3063 scn->scn_is_bptree = B_TRUE;
3064 scn->scn_zio_root = zio_root(spa, NULL,
3065 NULL, ZIO_FLAG_MUSTSUCCEED);
3066 err = bptree_iterate(dp->dp_meta_objset,
3067 dp->dp_bptree_obj, B_TRUE, dsl_scan_free_block_cb, scn, tx);
3068 VERIFY0(zio_wait(scn->scn_zio_root));
3069 scn->scn_zio_root = NULL;
3070
3071 if (err == EIO || err == ECKSUM) {
3072 err = 0;
3073 } else if (err != 0 && err != ERESTART) {
3074 zfs_panic_recover("error %u from "
3075 "traverse_dataset_destroyed()", err);
3076 }
3077
3078 if (bptree_is_empty(dp->dp_meta_objset, dp->dp_bptree_obj)) {
3079 /* finished; deactivate async destroy feature */
3080 spa_feature_decr(spa, SPA_FEATURE_ASYNC_DESTROY, tx);
3081 ASSERT(!spa_feature_is_active(spa,
3082 SPA_FEATURE_ASYNC_DESTROY));
3083 VERIFY0(zap_remove(dp->dp_meta_objset,
3084 DMU_POOL_DIRECTORY_OBJECT,
3085 DMU_POOL_BPTREE_OBJ, tx));
3086 VERIFY0(bptree_free(dp->dp_meta_objset,
3087 dp->dp_bptree_obj, tx));
3088 dp->dp_bptree_obj = 0;
3089 scn->scn_async_destroying = B_FALSE;
3090 scn->scn_async_stalled = B_FALSE;
3091 } else {
3092 /*
3093 * If we didn't make progress, mark the async
3094 * destroy as stalled, so that we will not initiate
3095 * a spa_sync() on its behalf. Note that we only
3096 * check this if we are not finished, because if the
3097 * bptree had no blocks for us to visit, we can
3098 * finish without "making progress".
3099 */
3100 scn->scn_async_stalled =
3101 (scn->scn_visited_this_txg == 0);
3102 }
3103 }
3104 if (scn->scn_visited_this_txg) {
3105 zfs_dbgmsg("freed %llu blocks in %llums from "
3106 "free_bpobj/bptree txg %llu; err=%u",
3107 (longlong_t)scn->scn_visited_this_txg,
3108 (longlong_t)
3109 NSEC2MSEC(gethrtime() - scn->scn_sync_start_time),
3110 (longlong_t)tx->tx_txg, err);
3111 scn->scn_visited_this_txg = 0;
3112
3113 /*
3114 * Write out changes to the DDT that may be required as a
3115 * result of the blocks freed. This ensures that the DDT
3116 * is clean when a scrub/resilver runs.
3117 */
3118 ddt_sync(spa, tx->tx_txg);
3119 }
3120 if (err != 0)
3121 return;
3122 if (dp->dp_free_dir != NULL && !scn->scn_async_destroying &&
3123 zfs_free_leak_on_eio &&
3124 (dsl_dir_phys(dp->dp_free_dir)->dd_used_bytes != 0 ||
3125 dsl_dir_phys(dp->dp_free_dir)->dd_compressed_bytes != 0 ||
3126 dsl_dir_phys(dp->dp_free_dir)->dd_uncompressed_bytes != 0)) {
3127 /*
3128 * We have finished background destroying, but there is still
3129 * some space left in the dp_free_dir. Transfer this leaked
3130 * space to the dp_leak_dir.
3131 */
3132 if (dp->dp_leak_dir == NULL) {
3133 rrw_enter(&dp->dp_config_rwlock, RW_WRITER, FTAG);
3134 (void) dsl_dir_create_sync(dp, dp->dp_root_dir,
3135 LEAK_DIR_NAME, tx);
3136 VERIFY0(dsl_pool_open_special_dir(dp,
3137 LEAK_DIR_NAME, &dp->dp_leak_dir));
3138 rrw_exit(&dp->dp_config_rwlock, FTAG);
3139 }
3140 dsl_dir_diduse_space(dp->dp_leak_dir, DD_USED_HEAD,
3141 dsl_dir_phys(dp->dp_free_dir)->dd_used_bytes,
3142 dsl_dir_phys(dp->dp_free_dir)->dd_compressed_bytes,
3143 dsl_dir_phys(dp->dp_free_dir)->dd_uncompressed_bytes, tx);
3144 dsl_dir_diduse_space(dp->dp_free_dir, DD_USED_HEAD,
3145 -dsl_dir_phys(dp->dp_free_dir)->dd_used_bytes,
3146 -dsl_dir_phys(dp->dp_free_dir)->dd_compressed_bytes,
3147 -dsl_dir_phys(dp->dp_free_dir)->dd_uncompressed_bytes, tx);
3148 }
3149 if (dp->dp_free_dir != NULL && !scn->scn_async_destroying) {
3150 /* finished; verify that space accounting went to zero */
3151 ASSERT0(dsl_dir_phys(dp->dp_free_dir)->dd_used_bytes);
3152 ASSERT0(dsl_dir_phys(dp->dp_free_dir)->dd_compressed_bytes);
3153 ASSERT0(dsl_dir_phys(dp->dp_free_dir)->dd_uncompressed_bytes);
3154 }
3155
3156 if (!dsl_scan_is_running(scn) || dsl_scan_is_paused_scrub(scn))
3157 return;
3158
3159 /*
3160 * Wait a few txgs after importing to begin scanning so that
3161 * we can get the pool imported quickly.
3162 */
3163 if (spa->spa_syncing_txg < spa->spa_first_txg + SCAN_IMPORT_WAIT_TXGS)
3164 return;
3165
3166 /*
3167 * It is possible to switch from unsorted to sorted at any time,
3168 * but afterwards the scan will remain sorted unless reloaded from
3169 * a checkpoint after a reboot.
3170 */
3171 if (!zfs_scan_legacy) {
3172 scn->scn_is_sorted = B_TRUE;
3173 if (scn->scn_last_checkpoint == 0)
3174 scn->scn_last_checkpoint = ddi_get_lbolt();
3175 }
3176
3177 /*
3178 * For sorted scans, determine what kind of work we will be doing
3179 * this txg based on our memory limitations and whether or not we
3180 * need to perform a checkpoint.
3181 */
3182 if (scn->scn_is_sorted) {
3183 /*
3184 * If we are over our checkpoint interval, set scn_clearing
3185 * so that we can begin checkpointing immediately. The
3186 * checkpoint allows us to save a consistent bookmark
3187 * representing how much data we have scrubbed so far.
3188 * Otherwise, use the memory limit to determine if we should
3189 * scan for metadata or start issue scrub IOs. We accumulate
3190 * metadata until we hit our hard memory limit at which point
3191 * we issue scrub IOs until we are at our soft memory limit.
3192 */
3193 if (scn->scn_checkpointing ||
3194 ddi_get_lbolt() - scn->scn_last_checkpoint >
3195 SEC_TO_TICK(zfs_scan_checkpoint_intval)) {
3196 if (!scn->scn_checkpointing)
3197 zfs_dbgmsg("begin scan checkpoint");
3198
3199 scn->scn_checkpointing = B_TRUE;
3200 scn->scn_clearing = B_TRUE;
3201 } else {
3202 boolean_t should_clear = dsl_scan_should_clear(scn);
3203 if (should_clear && !scn->scn_clearing) {
3204 zfs_dbgmsg("begin scan clearing");
3205 scn->scn_clearing = B_TRUE;
3206 } else if (!should_clear && scn->scn_clearing) {
3207 zfs_dbgmsg("finish scan clearing");
3208 scn->scn_clearing = B_FALSE;
3209 }
3210 }
3211 } else {
3212 ASSERT0(scn->scn_checkpointing);
3213 ASSERT0(scn->scn_clearing);
3214 }
3215
3216 if (!scn->scn_clearing && scn->scn_done_txg == 0) {
3217 /* Need to scan metadata for more blocks to scrub */
3218 dsl_scan_phys_t *scnp = &scn->scn_phys;
3219 taskqid_t prefetch_tqid;
3220 uint64_t bytes_per_leaf = zfs_scan_vdev_limit;
3221 uint64_t nr_leaves = dsl_scan_count_leaves(spa->spa_root_vdev);
3222
3223 /*
3224 * Recalculate the max number of in-flight bytes for pool-wide
3225 * scanning operations (minimum 1MB). Limits for the issuing
3226 * phase are done per top-level vdev and are handled separately.
3227 */
3228 scn->scn_maxinflight_bytes =
3229 MAX(nr_leaves * bytes_per_leaf, 1ULL << 20);
3230
3231 if (scnp->scn_ddt_bookmark.ddb_class <=
3232 scnp->scn_ddt_class_max) {
3233 ASSERT(ZB_IS_ZERO(&scnp->scn_bookmark));
3234 zfs_dbgmsg("doing scan sync txg %llu; "
3235 "ddt bm=%llu/%llu/%llu/%llx",
3236 (longlong_t)tx->tx_txg,
3237 (longlong_t)scnp->scn_ddt_bookmark.ddb_class,
3238 (longlong_t)scnp->scn_ddt_bookmark.ddb_type,
3239 (longlong_t)scnp->scn_ddt_bookmark.ddb_checksum,
3240 (longlong_t)scnp->scn_ddt_bookmark.ddb_cursor);
3241 } else {
3242 zfs_dbgmsg("doing scan sync txg %llu; "
3243 "bm=%llu/%llu/%llu/%llu",
3244 (longlong_t)tx->tx_txg,
3245 (longlong_t)scnp->scn_bookmark.zb_objset,
3246 (longlong_t)scnp->scn_bookmark.zb_object,
3247 (longlong_t)scnp->scn_bookmark.zb_level,
3248 (longlong_t)scnp->scn_bookmark.zb_blkid);
3249 }
3250
3251 scn->scn_zio_root = zio_root(dp->dp_spa, NULL,
3252 NULL, ZIO_FLAG_CANFAIL);
3253
3254 scn->scn_prefetch_stop = B_FALSE;
3255 prefetch_tqid = taskq_dispatch(dp->dp_sync_taskq,
3256 dsl_scan_prefetch_thread, scn, TQ_SLEEP);
3257 ASSERT(prefetch_tqid != TASKQID_INVALID);
3258
3259 dsl_pool_config_enter(dp, FTAG);
3260 dsl_scan_visit(scn, tx);
3261 dsl_pool_config_exit(dp, FTAG);
3262
3263 mutex_enter(&dp->dp_spa->spa_scrub_lock);
3264 scn->scn_prefetch_stop = B_TRUE;
3265 cv_broadcast(&spa->spa_scrub_io_cv);
3266 mutex_exit(&dp->dp_spa->spa_scrub_lock);
3267
3268 taskq_wait_id(dp->dp_sync_taskq, prefetch_tqid);
3269 (void) zio_wait(scn->scn_zio_root);
3270 scn->scn_zio_root = NULL;
3271
3272 zfs_dbgmsg("scan visited %llu blocks in %llums "
3273 "(%llu os's, %llu holes, %llu < mintxg, "
3274 "%llu in ddt, %llu > maxtxg)",
3275 (longlong_t)scn->scn_visited_this_txg,
3276 (longlong_t)NSEC2MSEC(gethrtime() -
3277 scn->scn_sync_start_time),
3278 (longlong_t)scn->scn_objsets_visited_this_txg,
3279 (longlong_t)scn->scn_holes_this_txg,
3280 (longlong_t)scn->scn_lt_min_this_txg,
3281 (longlong_t)scn->scn_ddt_contained_this_txg,
3282 (longlong_t)scn->scn_gt_max_this_txg);
3283
3284 if (!scn->scn_suspending) {
3285 ASSERT0(avl_numnodes(&scn->scn_queue));
3286 scn->scn_done_txg = tx->tx_txg + 1;
3287 if (scn->scn_is_sorted) {
3288 scn->scn_checkpointing = B_TRUE;
3289 scn->scn_clearing = B_TRUE;
3290 }
3291 zfs_dbgmsg("scan complete txg %llu",
3292 (longlong_t)tx->tx_txg);
3293 }
3294 } else if (scn->scn_is_sorted && scn->scn_bytes_pending != 0) {
3295 /* need to issue scrubbing IOs from per-vdev queues */
3296 scn->scn_zio_root = zio_root(dp->dp_spa, NULL,
3297 NULL, ZIO_FLAG_CANFAIL);
3298 scan_io_queues_run(scn);
3299 (void) zio_wait(scn->scn_zio_root);
3300 scn->scn_zio_root = NULL;
3301
3302 /* calculate and dprintf the current memory usage */
3303 (void) dsl_scan_should_clear(scn);
3304 dsl_scan_update_stats(scn);
3305
3306 zfs_dbgmsg("scan issued %llu blocks (%llu segs) in %llums "
3307 "(avg_block_size = %llu, avg_seg_size = %llu)",
3308 (longlong_t)scn->scn_zios_this_txg,
3309 (longlong_t)scn->scn_segs_this_txg,
3310 (longlong_t)NSEC2MSEC(gethrtime() -
3311 scn->scn_sync_start_time),
3312 (longlong_t)scn->scn_avg_zio_size_this_txg,
3313 (longlong_t)scn->scn_avg_seg_size_this_txg);
3314 } else if (scn->scn_done_txg != 0 && scn->scn_done_txg <= tx->tx_txg) {
3315 /* Finished with everything. Mark the scrub as complete */
3316 zfs_dbgmsg("scan issuing complete txg %llu",
3317 (longlong_t)tx->tx_txg);
3318 ASSERT3U(scn->scn_done_txg, !=, 0);
3319 ASSERT0(spa->spa_scrub_inflight);
3320 ASSERT0(scn->scn_bytes_pending);
3321 dsl_scan_done(scn, B_TRUE, tx);
3322 sync_type = SYNC_MANDATORY;
3323 }
3324
3325 dsl_scan_sync_state(scn, tx, sync_type);
3326 }
3327
3328 static void
3329 count_block(dsl_scan_t *scn, zfs_all_blkstats_t *zab, const blkptr_t *bp)
3330 {
3331 int i;
3332
3333 /* update the spa's stats on how many bytes we have issued */
3334 for (i = 0; i < BP_GET_NDVAS(bp); i++) {
3335 atomic_add_64(&scn->scn_dp->dp_spa->spa_scan_pass_issued,
3336 DVA_GET_ASIZE(&bp->blk_dva[i]));
3337 }
3338
3339 /*
3340 * If we resume after a reboot, zab will be NULL; don't record
3341 * incomplete stats in that case.
3342 */
3343 if (zab == NULL)
3344 return;
3345
3346 mutex_enter(&zab->zab_lock);
3347
3348 for (i = 0; i < 4; i++) {
3349 int l = (i < 2) ? BP_GET_LEVEL(bp) : DN_MAX_LEVELS;
3350 int t = (i & 1) ? BP_GET_TYPE(bp) : DMU_OT_TOTAL;
3351
3352 if (t & DMU_OT_NEWTYPE)
3353 t = DMU_OT_OTHER;
3354 zfs_blkstat_t *zb = &zab->zab_type[l][t];
3355 int equal;
3356
3357 zb->zb_count++;
3358 zb->zb_asize += BP_GET_ASIZE(bp);
3359 zb->zb_lsize += BP_GET_LSIZE(bp);
3360 zb->zb_psize += BP_GET_PSIZE(bp);
3361 zb->zb_gangs += BP_COUNT_GANG(bp);
3362
3363 switch (BP_GET_NDVAS(bp)) {
3364 case 2:
3365 if (DVA_GET_VDEV(&bp->blk_dva[0]) ==
3366 DVA_GET_VDEV(&bp->blk_dva[1]))
3367 zb->zb_ditto_2_of_2_samevdev++;
3368 break;
3369 case 3:
3370 equal = (DVA_GET_VDEV(&bp->blk_dva[0]) ==
3371 DVA_GET_VDEV(&bp->blk_dva[1])) +
3372 (DVA_GET_VDEV(&bp->blk_dva[0]) ==
3373 DVA_GET_VDEV(&bp->blk_dva[2])) +
3374 (DVA_GET_VDEV(&bp->blk_dva[1]) ==
3375 DVA_GET_VDEV(&bp->blk_dva[2]));
3376 if (equal == 1)
3377 zb->zb_ditto_2_of_3_samevdev++;
3378 else if (equal == 3)
3379 zb->zb_ditto_3_of_3_samevdev++;
3380 break;
3381 }
3382 }
3383
3384 mutex_exit(&zab->zab_lock);
3385 }
3386
3387 static void
3388 scan_io_queue_insert_impl(dsl_scan_io_queue_t *queue, scan_io_t *sio)
3389 {
3390 avl_index_t idx;
3391 int64_t asize = sio->sio_asize;
3392 dsl_scan_t *scn = queue->q_scn;
3393
3394 ASSERT(MUTEX_HELD(&queue->q_vd->vdev_scan_io_queue_lock));
3395
3396 if (avl_find(&queue->q_sios_by_addr, sio, &idx) != NULL) {
3397 /* block is already scheduled for reading */
3398 atomic_add_64(&scn->scn_bytes_pending, -asize);
3399 kmem_cache_free(sio_cache, sio);
3400 return;
3401 }
3402 avl_insert(&queue->q_sios_by_addr, sio, idx);
3403 range_tree_add(queue->q_exts_by_addr, sio->sio_offset, asize);
3404 }
3405
3406 /*
3407 * Given all the info we got from our metadata scanning process, we
3408 * construct a scan_io_t and insert it into the scan sorting queue. The
3409 * I/O must already be suitable for us to process. This is controlled
3410 * by dsl_scan_enqueue().
3411 */
3412 static void
3413 scan_io_queue_insert(dsl_scan_io_queue_t *queue, const blkptr_t *bp, int dva_i,
3414 int zio_flags, const zbookmark_phys_t *zb)
3415 {
3416 dsl_scan_t *scn = queue->q_scn;
3417 scan_io_t *sio = kmem_cache_alloc(sio_cache, KM_SLEEP);
3418
3419 ASSERT0(BP_IS_GANG(bp));
3420 ASSERT(MUTEX_HELD(&queue->q_vd->vdev_scan_io_queue_lock));
3421
3422 bp2sio(bp, sio, dva_i);
3423 sio->sio_flags = zio_flags;
3424 sio->sio_zb = *zb;
3425
3426 /*
3427 * Increment the bytes pending counter now so that we can't
3428 * get an integer underflow in case the worker processes the
3429 * zio before we get to incrementing this counter.
3430 */
3431 atomic_add_64(&scn->scn_bytes_pending, sio->sio_asize);
3432
3433 scan_io_queue_insert_impl(queue, sio);
3434 }
3435
3436 /*
3437 * Given a set of I/O parameters as discovered by the metadata traversal
3438 * process, attempts to place the I/O into the sorted queues (if allowed),
3439 * or immediately executes the I/O.
3440 */
3441 static void
3442 dsl_scan_enqueue(dsl_pool_t *dp, const blkptr_t *bp, int zio_flags,
3443 const zbookmark_phys_t *zb)
3444 {
3445 spa_t *spa = dp->dp_spa;
3446
3447 ASSERT(!BP_IS_EMBEDDED(bp));
3448
3449 /*
3450 * Gang blocks are hard to issue sequentially, so we just issue them
3451 * here immediately instead of queuing them.
3452 */
3453 if (!dp->dp_scan->scn_is_sorted || BP_IS_GANG(bp)) {
3454 scan_exec_io(dp, bp, zio_flags, zb, NULL);
3455 return;
3456 }
3457
3458 for (int i = 0; i < BP_GET_NDVAS(bp); i++) {
3459 dva_t dva;
3460 vdev_t *vdev;
3461
3462 dva = bp->blk_dva[i];
3463 vdev = vdev_lookup_top(spa, DVA_GET_VDEV(&dva));
3464 ASSERT(vdev != NULL);
3465
3466 mutex_enter(&vdev->vdev_scan_io_queue_lock);
3467 if (vdev->vdev_scan_io_queue == NULL)
3468 vdev->vdev_scan_io_queue = scan_io_queue_create(vdev);
3469 ASSERT(dp->dp_scan != NULL);
3470 scan_io_queue_insert(vdev->vdev_scan_io_queue, bp,
3471 i, zio_flags, zb);
3472 mutex_exit(&vdev->vdev_scan_io_queue_lock);
3473 }
3474 }
3475
3476 static int
3477 dsl_scan_scrub_cb(dsl_pool_t *dp,
3478 const blkptr_t *bp, const zbookmark_phys_t *zb)
3479 {
3480 dsl_scan_t *scn = dp->dp_scan;
3481 spa_t *spa = dp->dp_spa;
3482 uint64_t phys_birth = BP_PHYSICAL_BIRTH(bp);
3483 size_t psize = BP_GET_PSIZE(bp);
3484 boolean_t needs_io = B_FALSE;
3485 int zio_flags = ZIO_FLAG_SCAN_THREAD | ZIO_FLAG_RAW | ZIO_FLAG_CANFAIL;
3486
3487 if (phys_birth <= scn->scn_phys.scn_min_txg ||
3488 phys_birth >= scn->scn_phys.scn_max_txg)
3489 return (0);
3490
3491 if (BP_IS_EMBEDDED(bp)) {
3492 count_block(scn, dp->dp_blkstats, bp);
3493 return (0);
3494 }
3495
3496 ASSERT(DSL_SCAN_IS_SCRUB_RESILVER(scn));
3497 if (scn->scn_phys.scn_func == POOL_SCAN_SCRUB) {
3498 zio_flags |= ZIO_FLAG_SCRUB;
3499 needs_io = B_TRUE;
3500 } else {
3501 ASSERT3U(scn->scn_phys.scn_func, ==, POOL_SCAN_RESILVER);
3502 zio_flags |= ZIO_FLAG_RESILVER;
3503 needs_io = B_FALSE;
3504 }
3505
3506 /* If it's an intent log block, failure is expected. */
3507 if (zb->zb_level == ZB_ZIL_LEVEL)
3508 zio_flags |= ZIO_FLAG_SPECULATIVE;
3509
3510 for (int d = 0; d < BP_GET_NDVAS(bp); d++) {
3511 const dva_t *dva = &bp->blk_dva[d];
3512
3513 /*
3514 * Keep track of how much data we've examined so that
3515 * zpool(1M) status can make useful progress reports.
3516 */
3517 scn->scn_phys.scn_examined += DVA_GET_ASIZE(dva);
3518 spa->spa_scan_pass_exam += DVA_GET_ASIZE(dva);
3519
3520 /* if it's a resilver, this may not be in the target range */
3521 if (!needs_io)
3522 needs_io = dsl_scan_need_resilver(spa, dva, psize,
3523 phys_birth);
3524 }
3525
3526 if (needs_io && !zfs_no_scrub_io) {
3527 dsl_scan_enqueue(dp, bp, zio_flags, zb);
3528 } else {
3529 count_block(scn, dp->dp_blkstats, bp);
3530 }
3531
3532 /* do not relocate this block */
3533 return (0);
3534 }
3535
3536 static void
3537 dsl_scan_scrub_done(zio_t *zio)
3538 {
3539 spa_t *spa = zio->io_spa;
3540 blkptr_t *bp = zio->io_bp;
3541 dsl_scan_io_queue_t *queue = zio->io_private;
3542
3543 abd_free(zio->io_abd);
3544
3545 if (queue == NULL) {
3546 mutex_enter(&spa->spa_scrub_lock);
3547 ASSERT3U(spa->spa_scrub_inflight, >=, BP_GET_PSIZE(bp));
3548 spa->spa_scrub_inflight -= BP_GET_PSIZE(bp);
3549 cv_broadcast(&spa->spa_scrub_io_cv);
3550 mutex_exit(&spa->spa_scrub_lock);
3551 } else {
3552 mutex_enter(&queue->q_vd->vdev_scan_io_queue_lock);
3553 ASSERT3U(queue->q_inflight_bytes, >=, BP_GET_PSIZE(bp));
3554 queue->q_inflight_bytes -= BP_GET_PSIZE(bp);
3555 cv_broadcast(&queue->q_zio_cv);
3556 mutex_exit(&queue->q_vd->vdev_scan_io_queue_lock);
3557 }
3558
3559 if (zio->io_error && (zio->io_error != ECKSUM ||
3560 !(zio->io_flags & ZIO_FLAG_SPECULATIVE))) {
3561 atomic_inc_64(&spa->spa_dsl_pool->dp_scan->scn_phys.scn_errors);
3562 }
3563 }
3564
3565 /*
3566 * Given a scanning zio's information, executes the zio. The zio need
3567 * not necessarily be only sortable, this function simply executes the
3568 * zio, no matter what it is. The optional queue argument allows the
3569 * caller to specify that they want per top level vdev IO rate limiting
3570 * instead of the legacy global limiting.
3571 */
3572 static void
3573 scan_exec_io(dsl_pool_t *dp, const blkptr_t *bp, int zio_flags,
3574 const zbookmark_phys_t *zb, dsl_scan_io_queue_t *queue)
3575 {
3576 spa_t *spa = dp->dp_spa;
3577 dsl_scan_t *scn = dp->dp_scan;
3578 size_t size = BP_GET_PSIZE(bp);
3579 abd_t *data = abd_alloc_for_io(size, B_FALSE);
3580
3581 ASSERT3U(scn->scn_maxinflight_bytes, >, 0);
3582
3583 if (queue == NULL) {
3584 mutex_enter(&spa->spa_scrub_lock);
3585 while (spa->spa_scrub_inflight >= scn->scn_maxinflight_bytes)
3586 cv_wait(&spa->spa_scrub_io_cv, &spa->spa_scrub_lock);
3587 spa->spa_scrub_inflight += BP_GET_PSIZE(bp);
3588 mutex_exit(&spa->spa_scrub_lock);
3589 } else {
3590 kmutex_t *q_lock = &queue->q_vd->vdev_scan_io_queue_lock;
3591
3592 mutex_enter(q_lock);
3593 while (queue->q_inflight_bytes >= queue->q_maxinflight_bytes)
3594 cv_wait(&queue->q_zio_cv, q_lock);
3595 queue->q_inflight_bytes += BP_GET_PSIZE(bp);
3596 mutex_exit(q_lock);
3597 }
3598
3599 count_block(scn, dp->dp_blkstats, bp);
3600 zio_nowait(zio_read(scn->scn_zio_root, spa, bp, data, size,
3601 dsl_scan_scrub_done, queue, ZIO_PRIORITY_SCRUB, zio_flags, zb));
3602 }
3603
3604 /*
3605 * This is the primary extent sorting algorithm. We balance two parameters:
3606 * 1) how many bytes of I/O are in an extent
3607 * 2) how well the extent is filled with I/O (as a fraction of its total size)
3608 * Since we allow extents to have gaps between their constituent I/Os, it's
3609 * possible to have a fairly large extent that contains the same amount of
3610 * I/O bytes than a much smaller extent, which just packs the I/O more tightly.
3611 * The algorithm sorts based on a score calculated from the extent's size,
3612 * the relative fill volume (in %) and a "fill weight" parameter that controls
3613 * the split between whether we prefer larger extents or more well populated
3614 * extents:
3615 *
3616 * SCORE = FILL_IN_BYTES + (FILL_IN_PERCENT * FILL_IN_BYTES * FILL_WEIGHT)
3617 *
3618 * Example:
3619 * 1) assume extsz = 64 MiB
3620 * 2) assume fill = 32 MiB (extent is half full)
3621 * 3) assume fill_weight = 3
3622 * 4) SCORE = 32M + (((32M * 100) / 64M) * 3 * 32M) / 100
3623 * SCORE = 32M + (50 * 3 * 32M) / 100
3624 * SCORE = 32M + (4800M / 100)
3625 * SCORE = 32M + 48M
3626 * ^ ^
3627 * | +--- final total relative fill-based score
3628 * +--------- final total fill-based score
3629 * SCORE = 80M
3630 *
3631 * As can be seen, at fill_ratio=3, the algorithm is slightly biased towards
3632 * extents that are more completely filled (in a 3:2 ratio) vs just larger.
3633 * Note that as an optimization, we replace multiplication and division by
3634 * 100 with bitshifting by 7 (which effecitvely multiplies and divides by 128).
3635 */
3636 static int
3637 ext_size_compare(const void *x, const void *y)
3638 {
3639 const range_seg_t *rsa = x, *rsb = y;
3640 uint64_t sa = rsa->rs_end - rsa->rs_start,
3641 sb = rsb->rs_end - rsb->rs_start;
3642 uint64_t score_a, score_b;
3643
3644 score_a = rsa->rs_fill + ((((rsa->rs_fill << 7) / sa) *
3645 fill_weight * rsa->rs_fill) >> 7);
3646 score_b = rsb->rs_fill + ((((rsb->rs_fill << 7) / sb) *
3647 fill_weight * rsb->rs_fill) >> 7);
3648
3649 if (score_a > score_b)
3650 return (-1);
3651 if (score_a == score_b) {
3652 if (rsa->rs_start < rsb->rs_start)
3653 return (-1);
3654 if (rsa->rs_start == rsb->rs_start)
3655 return (0);
3656 return (1);
3657 }
3658 return (1);
3659 }
3660
3661 /*
3662 * Comparator for the q_sios_by_addr tree. Sorting is simply performed
3663 * based on LBA-order (from lowest to highest).
3664 */
3665 static int
3666 sio_addr_compare(const void *x, const void *y)
3667 {
3668 const scan_io_t *a = x, *b = y;
3669
3670 if (a->sio_offset < b->sio_offset)
3671 return (-1);
3672 if (a->sio_offset == b->sio_offset)
3673 return (0);
3674 return (1);
3675 }
3676
3677 /* IO queues are created on demand when they are needed. */
3678 static dsl_scan_io_queue_t *
3679 scan_io_queue_create(vdev_t *vd)
3680 {
3681 dsl_scan_t *scn = vd->vdev_spa->spa_dsl_pool->dp_scan;
3682 dsl_scan_io_queue_t *q = kmem_zalloc(sizeof (*q), KM_SLEEP);
3683
3684 q->q_scn = scn;
3685 q->q_vd = vd;
3686 cv_init(&q->q_zio_cv, NULL, CV_DEFAULT, NULL);
3687 q->q_exts_by_addr = range_tree_create_impl(&rt_avl_ops,
3688 &q->q_exts_by_size, ext_size_compare,
3689 &q->q_vd->vdev_scan_io_queue_lock, zfs_scan_max_ext_gap);
3690 avl_create(&q->q_sios_by_addr, sio_addr_compare,
3691 sizeof (scan_io_t), offsetof(scan_io_t, sio_nodes.sio_addr_node));
3692
3693 return (q);
3694 }
3695
3696 /*
3697 * Destroys a scan queue and all segments and scan_io_t's contained in it.
3698 * No further execution of I/O occurs, anything pending in the queue is
3699 * simply freed without being executed.
3700 */
3701 void
3702 dsl_scan_io_queue_destroy(dsl_scan_io_queue_t *queue)
3703 {
3704 dsl_scan_t *scn = queue->q_scn;
3705 scan_io_t *sio;
3706 void *cookie = NULL;
3707 int64_t bytes_dequeued = 0;
3708
3709 ASSERT(MUTEX_HELD(&queue->q_vd->vdev_scan_io_queue_lock));
3710
3711 while ((sio = avl_destroy_nodes(&queue->q_sios_by_addr, &cookie)) !=
3712 NULL) {
3713 ASSERT(range_tree_contains(queue->q_exts_by_addr,
3714 sio->sio_offset, sio->sio_asize));
3715 bytes_dequeued += sio->sio_asize;
3716 kmem_cache_free(sio_cache, sio);
3717 }
3718
3719 atomic_add_64(&scn->scn_bytes_pending, -bytes_dequeued);
3720 range_tree_vacate(queue->q_exts_by_addr, NULL, queue);
3721 range_tree_destroy(queue->q_exts_by_addr);
3722 avl_destroy(&queue->q_sios_by_addr);
3723 cv_destroy(&queue->q_zio_cv);
3724
3725 kmem_free(queue, sizeof (*queue));
3726 }
3727
3728 /*
3729 * Properly transfers a dsl_scan_queue_t from `svd' to `tvd'. This is
3730 * called on behalf of vdev_top_transfer when creating or destroying
3731 * a mirror vdev due to zpool attach/detach.
3732 */
3733 void
3734 dsl_scan_io_queue_vdev_xfer(vdev_t *svd, vdev_t *tvd)
3735 {
3736 mutex_enter(&svd->vdev_scan_io_queue_lock);
3737 mutex_enter(&tvd->vdev_scan_io_queue_lock);
3738
3739 VERIFY3P(tvd->vdev_scan_io_queue, ==, NULL);
3740 tvd->vdev_scan_io_queue = svd->vdev_scan_io_queue;
3741 svd->vdev_scan_io_queue = NULL;
3742 if (tvd->vdev_scan_io_queue != NULL) {
3743 tvd->vdev_scan_io_queue->q_vd = tvd;
3744 range_tree_set_lock(tvd->vdev_scan_io_queue->q_exts_by_addr,
3745 &tvd->vdev_scan_io_queue_lock);
3746 }
3747
3748 mutex_exit(&tvd->vdev_scan_io_queue_lock);
3749 mutex_exit(&svd->vdev_scan_io_queue_lock);
3750 }
3751
3752 static void
3753 scan_io_queues_destroy(dsl_scan_t *scn)
3754 {
3755 vdev_t *rvd = scn->scn_dp->dp_spa->spa_root_vdev;
3756
3757 for (uint64_t i = 0; i < rvd->vdev_children; i++) {
3758 vdev_t *tvd = rvd->vdev_child[i];
3759
3760 mutex_enter(&tvd->vdev_scan_io_queue_lock);
3761 if (tvd->vdev_scan_io_queue != NULL)
3762 dsl_scan_io_queue_destroy(tvd->vdev_scan_io_queue);
3763 tvd->vdev_scan_io_queue = NULL;
3764 mutex_exit(&tvd->vdev_scan_io_queue_lock);
3765 }
3766 }
3767
3768 static void
3769 dsl_scan_freed_dva(spa_t *spa, const blkptr_t *bp, int dva_i)
3770 {
3771 dsl_pool_t *dp = spa->spa_dsl_pool;
3772 dsl_scan_t *scn = dp->dp_scan;
3773 vdev_t *vdev;
3774 kmutex_t *q_lock;
3775 dsl_scan_io_queue_t *queue;
3776 scan_io_t srch, *sio;
3777 avl_index_t idx;
3778 uint64_t start, size;
3779
3780 vdev = vdev_lookup_top(spa, DVA_GET_VDEV(&bp->blk_dva[dva_i]));
3781 ASSERT(vdev != NULL);
3782 q_lock = &vdev->vdev_scan_io_queue_lock;
3783 queue = vdev->vdev_scan_io_queue;
3784
3785 mutex_enter(q_lock);
3786 if (queue == NULL) {
3787 mutex_exit(q_lock);
3788 return;
3789 }
3790
3791 bp2sio(bp, &srch, dva_i);
3792 start = srch.sio_offset;
3793 size = srch.sio_asize;
3794
3795 /*
3796 * We can find the zio in two states:
3797 * 1) Cold, just sitting in the queue of zio's to be issued at
3798 * some point in the future. In this case, all we do is
3799 * remove the zio from the q_sios_by_addr tree, decrement
3800 * its data volume from the containing range_seg_t and
3801 * resort the q_exts_by_size tree to reflect that the
3802 * range_seg_t has lost some of its 'fill'. We don't shorten
3803 * the range_seg_t - this is usually rare enough not to be
3804 * worth the extra hassle of trying keep track of precise
3805 * extent boundaries.
3806 * 2) Hot, where the zio is currently in-flight in
3807 * dsl_scan_issue_ios. In this case, we can't simply
3808 * reach in and stop the in-flight zio's, so we instead
3809 * block the caller. Eventually, dsl_scan_issue_ios will
3810 * be done with issuing the zio's it gathered and will
3811 * signal us.
3812 */
3813 sio = avl_find(&queue->q_sios_by_addr, &srch, &idx);
3814 if (sio != NULL) {
3815 int64_t asize = sio->sio_asize;
3816 blkptr_t tmpbp;
3817
3818 /* Got it while it was cold in the queue */
3819 ASSERT3U(start, ==, sio->sio_offset);
3820 ASSERT3U(size, ==, asize);
3821 avl_remove(&queue->q_sios_by_addr, sio);
3822
3823 ASSERT(range_tree_contains(queue->q_exts_by_addr, start, size));
3824 range_tree_remove_fill(queue->q_exts_by_addr, start, size);
3825
3826 /*
3827 * We only update scn_bytes_pending in the cold path,
3828 * otherwise it will already have been accounted for as
3829 * part of the zio's execution.
3830 */
3831 atomic_add_64(&scn->scn_bytes_pending, -asize);
3832
3833 /* count the block as though we issued it */
3834 sio2bp(sio, &tmpbp, dva_i);
3835 count_block(scn, dp->dp_blkstats, &tmpbp);
3836
3837 kmem_cache_free(sio_cache, sio);
3838 }
3839 mutex_exit(q_lock);
3840 }
3841
3842 /*
3843 * Callback invoked when a zio_free() zio is executing. This needs to be
3844 * intercepted to prevent the zio from deallocating a particular portion
3845 * of disk space and it then getting reallocated and written to, while we
3846 * still have it queued up for processing.
3847 */
3848 void
3849 dsl_scan_freed(spa_t *spa, const blkptr_t *bp)
3850 {
3851 dsl_pool_t *dp = spa->spa_dsl_pool;
3852 dsl_scan_t *scn = dp->dp_scan;
3853
3854 ASSERT(!BP_IS_EMBEDDED(bp));
3855 ASSERT(scn != NULL);
3856 if (!dsl_scan_is_running(scn))
3857 return;
3858
3859 for (int i = 0; i < BP_GET_NDVAS(bp); i++)
3860 dsl_scan_freed_dva(spa, bp, i);
3861 }
3862
3863 #if defined(_KERNEL) && defined(HAVE_SPL)
3864 /* CSTYLED */
3865 module_param(zfs_scan_vdev_limit, ulong, 0644);
3866 MODULE_PARM_DESC(zfs_scan_vdev_limit,
3867 "Max bytes in flight per leaf vdev for scrubs and resilvers");
3868
3869 module_param(zfs_scrub_min_time_ms, int, 0644);
3870 MODULE_PARM_DESC(zfs_scrub_min_time_ms, "Min millisecs to scrub per txg");
3871
3872 module_param(zfs_free_min_time_ms, int, 0644);
3873 MODULE_PARM_DESC(zfs_free_min_time_ms, "Min millisecs to free per txg");
3874
3875 module_param(zfs_resilver_min_time_ms, int, 0644);
3876 MODULE_PARM_DESC(zfs_resilver_min_time_ms, "Min millisecs to resilver per txg");
3877
3878 module_param(zfs_no_scrub_io, int, 0644);
3879 MODULE_PARM_DESC(zfs_no_scrub_io, "Set to disable scrub I/O");
3880
3881 module_param(zfs_no_scrub_prefetch, int, 0644);
3882 MODULE_PARM_DESC(zfs_no_scrub_prefetch, "Set to disable scrub prefetching");
3883
3884 /* CSTYLED */
3885 module_param(zfs_free_max_blocks, ulong, 0644);
3886 MODULE_PARM_DESC(zfs_free_max_blocks, "Max number of blocks freed in one txg");
3887
3888 module_param(zfs_free_bpobj_enabled, int, 0644);
3889 MODULE_PARM_DESC(zfs_free_bpobj_enabled, "Enable processing of the free_bpobj");
3890
3891 module_param(zfs_scan_mem_lim_fact, int, 0644);
3892 MODULE_PARM_DESC(zfs_scan_mem_lim_fact, "Fraction of RAM for scan hard limit");
3893
3894 module_param(zfs_scan_issue_strategy, int, 0644);
3895 MODULE_PARM_DESC(zfs_scan_issue_strategy,
3896 "IO issuing strategy during scrubbing. 0 = default, 1 = LBA, 2 = size");
3897
3898 module_param(zfs_scan_legacy, int, 0644);
3899 MODULE_PARM_DESC(zfs_scan_legacy, "Scrub using legacy non-sequential method");
3900
3901 module_param(zfs_scan_checkpoint_intval, int, 0644);
3902 MODULE_PARM_DESC(zfs_scan_checkpoint_intval,
3903 "Scan progress on-disk checkpointing interval");
3904
3905 /* CSTYLED */
3906 module_param(zfs_scan_max_ext_gap, ulong, 0644);
3907 MODULE_PARM_DESC(zfs_scan_max_ext_gap,
3908 "Max gap in bytes between sequential scrub / resilver I/Os");
3909
3910 module_param(zfs_scan_mem_lim_soft_fact, int, 0644);
3911 MODULE_PARM_DESC(zfs_scan_mem_lim_soft_fact,
3912 "Fraction of hard limit used as soft limit");
3913
3914 module_param(zfs_scan_strict_mem_lim, int, 0644);
3915 MODULE_PARM_DESC(zfs_scan_strict_mem_lim,
3916 "Tunable to attempt to reduce lock contention");
3917
3918 module_param(zfs_scan_fill_weight, int, 0644);
3919 MODULE_PARM_DESC(zfs_scan_fill_weight,
3920 "Tunable to adjust bias towards more filled segments during scans");
3921 #endif