Print this page
3748 zfs headers should be C++ compatible
Submitted by: Justin Gibbs <justing@spectralogic.com>
Submitted by: Will Andrews <willa@spectralogic.com>
Reviewed by: Matthew Ahrens <mahrens@delphix.com>
Reviewed by: Eric Schrock <eric.schrock@delphix.com>
Reviewed by: Robert Mustacchi <rm@joyent.com>
| Split |
Close |
| Expand all |
| Collapse all |
--- old/usr/src/uts/common/fs/zfs/ddt.c
+++ new/usr/src/uts/common/fs/zfs/ddt.c
1 1 /*
2 2 * CDDL HEADER START
3 3 *
4 4 * The contents of this file are subject to the terms of the
5 5 * Common Development and Distribution License (the "License").
6 6 * You may not use this file except in compliance with the License.
7 7 *
8 8 * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
9 9 * or http://www.opensolaris.org/os/licensing.
10 10 * See the License for the specific language governing permissions
11 11 * and limitations under the License.
12 12 *
13 13 * When distributing Covered Code, include this CDDL HEADER in each
14 14 * file and include the License file at usr/src/OPENSOLARIS.LICENSE.
15 15 * If applicable, add the following below this CDDL HEADER, with the
16 16 * fields enclosed by brackets "[]" replaced with your own identifying
17 17 * information: Portions Copyright [yyyy] [name of copyright owner]
18 18 *
19 19 * CDDL HEADER END
20 20 */
21 21
22 22 /*
23 23 * Copyright (c) 2009, 2010, Oracle and/or its affiliates. All rights reserved.
24 24 * Copyright (c) 2013 by Delphix. All rights reserved.
25 25 */
26 26
27 27 #include <sys/zfs_context.h>
28 28 #include <sys/spa.h>
29 29 #include <sys/spa_impl.h>
30 30 #include <sys/zio.h>
31 31 #include <sys/ddt.h>
32 32 #include <sys/zap.h>
33 33 #include <sys/dmu_tx.h>
34 34 #include <sys/arc.h>
35 35 #include <sys/dsl_pool.h>
36 36 #include <sys/zio_checksum.h>
37 37 #include <sys/zio_compress.h>
38 38 #include <sys/dsl_scan.h>
39 39
40 40 /*
41 41 * Enable/disable prefetching of dedup-ed blocks which are going to be freed.
42 42 */
43 43 int zfs_dedup_prefetch = 1;
44 44
45 45 static const ddt_ops_t *ddt_ops[DDT_TYPES] = {
46 46 &ddt_zap_ops,
47 47 };
48 48
49 49 static const char *ddt_class_name[DDT_CLASSES] = {
50 50 "ditto",
51 51 "duplicate",
52 52 "unique",
53 53 };
54 54
55 55 static void
56 56 ddt_object_create(ddt_t *ddt, enum ddt_type type, enum ddt_class class,
57 57 dmu_tx_t *tx)
58 58 {
59 59 spa_t *spa = ddt->ddt_spa;
60 60 objset_t *os = ddt->ddt_os;
61 61 uint64_t *objectp = &ddt->ddt_object[type][class];
62 62 boolean_t prehash = zio_checksum_table[ddt->ddt_checksum].ci_dedup;
63 63 char name[DDT_NAMELEN];
64 64
65 65 ddt_object_name(ddt, type, class, name);
66 66
67 67 ASSERT(*objectp == 0);
68 68 VERIFY(ddt_ops[type]->ddt_op_create(os, objectp, tx, prehash) == 0);
69 69 ASSERT(*objectp != 0);
70 70
71 71 VERIFY(zap_add(os, DMU_POOL_DIRECTORY_OBJECT, name,
72 72 sizeof (uint64_t), 1, objectp, tx) == 0);
73 73
74 74 VERIFY(zap_add(os, spa->spa_ddt_stat_object, name,
75 75 sizeof (uint64_t), sizeof (ddt_histogram_t) / sizeof (uint64_t),
76 76 &ddt->ddt_histogram[type][class], tx) == 0);
77 77 }
78 78
79 79 static void
80 80 ddt_object_destroy(ddt_t *ddt, enum ddt_type type, enum ddt_class class,
81 81 dmu_tx_t *tx)
82 82 {
83 83 spa_t *spa = ddt->ddt_spa;
84 84 objset_t *os = ddt->ddt_os;
85 85 uint64_t *objectp = &ddt->ddt_object[type][class];
86 86 char name[DDT_NAMELEN];
87 87
88 88 ddt_object_name(ddt, type, class, name);
89 89
90 90 ASSERT(*objectp != 0);
91 91 ASSERT(ddt_object_count(ddt, type, class) == 0);
92 92 ASSERT(ddt_histogram_empty(&ddt->ddt_histogram[type][class]));
93 93 VERIFY(zap_remove(os, DMU_POOL_DIRECTORY_OBJECT, name, tx) == 0);
94 94 VERIFY(zap_remove(os, spa->spa_ddt_stat_object, name, tx) == 0);
95 95 VERIFY(ddt_ops[type]->ddt_op_destroy(os, *objectp, tx) == 0);
96 96 bzero(&ddt->ddt_object_stats[type][class], sizeof (ddt_object_t));
97 97
98 98 *objectp = 0;
99 99 }
100 100
101 101 static int
102 102 ddt_object_load(ddt_t *ddt, enum ddt_type type, enum ddt_class class)
103 103 {
104 104 ddt_object_t *ddo = &ddt->ddt_object_stats[type][class];
105 105 dmu_object_info_t doi;
106 106 char name[DDT_NAMELEN];
107 107 int error;
108 108
109 109 ddt_object_name(ddt, type, class, name);
110 110
111 111 error = zap_lookup(ddt->ddt_os, DMU_POOL_DIRECTORY_OBJECT, name,
112 112 sizeof (uint64_t), 1, &ddt->ddt_object[type][class]);
113 113
114 114 if (error)
115 115 return (error);
116 116
117 117 error = zap_lookup(ddt->ddt_os, ddt->ddt_spa->spa_ddt_stat_object, name,
118 118 sizeof (uint64_t), sizeof (ddt_histogram_t) / sizeof (uint64_t),
119 119 &ddt->ddt_histogram[type][class]);
120 120
121 121 /*
122 122 * Seed the cached statistics.
123 123 */
124 124 VERIFY(ddt_object_info(ddt, type, class, &doi) == 0);
125 125
126 126 ddo->ddo_count = ddt_object_count(ddt, type, class);
127 127 ddo->ddo_dspace = doi.doi_physical_blocks_512 << 9;
128 128 ddo->ddo_mspace = doi.doi_fill_count * doi.doi_data_block_size;
129 129
130 130 ASSERT(error == 0);
131 131 return (error);
132 132 }
133 133
134 134 static void
135 135 ddt_object_sync(ddt_t *ddt, enum ddt_type type, enum ddt_class class,
136 136 dmu_tx_t *tx)
137 137 {
138 138 ddt_object_t *ddo = &ddt->ddt_object_stats[type][class];
139 139 dmu_object_info_t doi;
140 140 char name[DDT_NAMELEN];
141 141
142 142 ddt_object_name(ddt, type, class, name);
143 143
144 144 VERIFY(zap_update(ddt->ddt_os, ddt->ddt_spa->spa_ddt_stat_object, name,
145 145 sizeof (uint64_t), sizeof (ddt_histogram_t) / sizeof (uint64_t),
146 146 &ddt->ddt_histogram[type][class], tx) == 0);
147 147
148 148 /*
149 149 * Cache DDT statistics; this is the only time they'll change.
150 150 */
151 151 VERIFY(ddt_object_info(ddt, type, class, &doi) == 0);
152 152
153 153 ddo->ddo_count = ddt_object_count(ddt, type, class);
154 154 ddo->ddo_dspace = doi.doi_physical_blocks_512 << 9;
155 155 ddo->ddo_mspace = doi.doi_fill_count * doi.doi_data_block_size;
156 156 }
157 157
158 158 static int
159 159 ddt_object_lookup(ddt_t *ddt, enum ddt_type type, enum ddt_class class,
160 160 ddt_entry_t *dde)
161 161 {
162 162 if (!ddt_object_exists(ddt, type, class))
163 163 return (SET_ERROR(ENOENT));
164 164
165 165 return (ddt_ops[type]->ddt_op_lookup(ddt->ddt_os,
166 166 ddt->ddt_object[type][class], dde));
167 167 }
168 168
169 169 static void
170 170 ddt_object_prefetch(ddt_t *ddt, enum ddt_type type, enum ddt_class class,
|
↓ open down ↓ |
170 lines elided |
↑ open up ↑ |
171 171 ddt_entry_t *dde)
172 172 {
173 173 if (!ddt_object_exists(ddt, type, class))
174 174 return;
175 175
176 176 ddt_ops[type]->ddt_op_prefetch(ddt->ddt_os,
177 177 ddt->ddt_object[type][class], dde);
178 178 }
179 179
180 180 int
181 -ddt_object_update(ddt_t *ddt, enum ddt_type type, enum ddt_class class,
181 +ddt_object_update(ddt_t *ddt, enum ddt_type type, enum ddt_class ddt_class,
182 182 ddt_entry_t *dde, dmu_tx_t *tx)
183 183 {
184 - ASSERT(ddt_object_exists(ddt, type, class));
184 + ASSERT(ddt_object_exists(ddt, type, ddt_class));
185 185
186 186 return (ddt_ops[type]->ddt_op_update(ddt->ddt_os,
187 - ddt->ddt_object[type][class], dde, tx));
187 + ddt->ddt_object[type][ddt_class], dde, tx));
188 188 }
189 189
190 190 static int
191 191 ddt_object_remove(ddt_t *ddt, enum ddt_type type, enum ddt_class class,
192 192 ddt_entry_t *dde, dmu_tx_t *tx)
193 193 {
194 194 ASSERT(ddt_object_exists(ddt, type, class));
195 195
196 196 return (ddt_ops[type]->ddt_op_remove(ddt->ddt_os,
197 197 ddt->ddt_object[type][class], dde, tx));
198 198 }
199 199
200 200 int
201 -ddt_object_walk(ddt_t *ddt, enum ddt_type type, enum ddt_class class,
201 +ddt_object_walk(ddt_t *ddt, enum ddt_type type, enum ddt_class ddt_class,
202 202 uint64_t *walk, ddt_entry_t *dde)
203 203 {
204 - ASSERT(ddt_object_exists(ddt, type, class));
204 + ASSERT(ddt_object_exists(ddt, type, ddt_class));
205 205
206 206 return (ddt_ops[type]->ddt_op_walk(ddt->ddt_os,
207 - ddt->ddt_object[type][class], dde, walk));
207 + ddt->ddt_object[type][ddt_class], dde, walk));
208 208 }
209 209
210 210 uint64_t
211 -ddt_object_count(ddt_t *ddt, enum ddt_type type, enum ddt_class class)
211 +ddt_object_count(ddt_t *ddt, enum ddt_type type, enum ddt_class ddt_class)
212 212 {
213 - ASSERT(ddt_object_exists(ddt, type, class));
213 + ASSERT(ddt_object_exists(ddt, type, ddt_class));
214 214
215 215 return (ddt_ops[type]->ddt_op_count(ddt->ddt_os,
216 - ddt->ddt_object[type][class]));
216 + ddt->ddt_object[type][ddt_class]));
217 217 }
218 218
219 219 int
220 -ddt_object_info(ddt_t *ddt, enum ddt_type type, enum ddt_class class,
220 +ddt_object_info(ddt_t *ddt, enum ddt_type type, enum ddt_class ddt_class,
221 221 dmu_object_info_t *doi)
222 222 {
223 - if (!ddt_object_exists(ddt, type, class))
223 + if (!ddt_object_exists(ddt, type, ddt_class))
224 224 return (SET_ERROR(ENOENT));
225 225
226 - return (dmu_object_info(ddt->ddt_os, ddt->ddt_object[type][class],
226 + return (dmu_object_info(ddt->ddt_os, ddt->ddt_object[type][ddt_class],
227 227 doi));
228 228 }
229 229
230 230 boolean_t
231 -ddt_object_exists(ddt_t *ddt, enum ddt_type type, enum ddt_class class)
231 +ddt_object_exists(ddt_t *ddt, enum ddt_type type, enum ddt_class ddt_class)
232 232 {
233 - return (!!ddt->ddt_object[type][class]);
233 + return (!!ddt->ddt_object[type][ddt_class]);
234 234 }
235 235
236 236 void
237 -ddt_object_name(ddt_t *ddt, enum ddt_type type, enum ddt_class class,
237 +ddt_object_name(ddt_t *ddt, enum ddt_type type, enum ddt_class ddt_class,
238 238 char *name)
239 239 {
240 240 (void) sprintf(name, DMU_POOL_DDT,
241 241 zio_checksum_table[ddt->ddt_checksum].ci_name,
242 - ddt_ops[type]->ddt_op_name, ddt_class_name[class]);
242 + ddt_ops[type]->ddt_op_name, ddt_class_name[ddt_class]);
243 243 }
244 244
245 245 void
246 246 ddt_bp_fill(const ddt_phys_t *ddp, blkptr_t *bp, uint64_t txg)
247 247 {
248 248 ASSERT(txg != 0);
249 249
250 250 for (int d = 0; d < SPA_DVAS_PER_BP; d++)
251 251 bp->blk_dva[d] = ddp->ddp_dva[d];
252 252 BP_SET_BIRTH(bp, txg, ddp->ddp_phys_birth);
253 253 }
254 254
255 255 void
256 256 ddt_bp_create(enum zio_checksum checksum,
257 257 const ddt_key_t *ddk, const ddt_phys_t *ddp, blkptr_t *bp)
258 258 {
259 259 BP_ZERO(bp);
260 260
261 261 if (ddp != NULL)
262 262 ddt_bp_fill(ddp, bp, ddp->ddp_phys_birth);
263 263
264 264 bp->blk_cksum = ddk->ddk_cksum;
265 265 bp->blk_fill = 1;
266 266
267 267 BP_SET_LSIZE(bp, DDK_GET_LSIZE(ddk));
268 268 BP_SET_PSIZE(bp, DDK_GET_PSIZE(ddk));
269 269 BP_SET_COMPRESS(bp, DDK_GET_COMPRESS(ddk));
270 270 BP_SET_CHECKSUM(bp, checksum);
271 271 BP_SET_TYPE(bp, DMU_OT_DEDUP);
272 272 BP_SET_LEVEL(bp, 0);
273 273 BP_SET_DEDUP(bp, 0);
274 274 BP_SET_BYTEORDER(bp, ZFS_HOST_BYTEORDER);
275 275 }
276 276
277 277 void
278 278 ddt_key_fill(ddt_key_t *ddk, const blkptr_t *bp)
279 279 {
280 280 ddk->ddk_cksum = bp->blk_cksum;
281 281 ddk->ddk_prop = 0;
282 282
283 283 DDK_SET_LSIZE(ddk, BP_GET_LSIZE(bp));
284 284 DDK_SET_PSIZE(ddk, BP_GET_PSIZE(bp));
285 285 DDK_SET_COMPRESS(ddk, BP_GET_COMPRESS(bp));
286 286 }
287 287
288 288 void
289 289 ddt_phys_fill(ddt_phys_t *ddp, const blkptr_t *bp)
290 290 {
291 291 ASSERT(ddp->ddp_phys_birth == 0);
292 292
293 293 for (int d = 0; d < SPA_DVAS_PER_BP; d++)
294 294 ddp->ddp_dva[d] = bp->blk_dva[d];
295 295 ddp->ddp_phys_birth = BP_PHYSICAL_BIRTH(bp);
296 296 }
297 297
298 298 void
299 299 ddt_phys_clear(ddt_phys_t *ddp)
300 300 {
301 301 bzero(ddp, sizeof (*ddp));
302 302 }
303 303
304 304 void
305 305 ddt_phys_addref(ddt_phys_t *ddp)
306 306 {
307 307 ddp->ddp_refcnt++;
308 308 }
309 309
310 310 void
311 311 ddt_phys_decref(ddt_phys_t *ddp)
312 312 {
313 313 ASSERT((int64_t)ddp->ddp_refcnt > 0);
314 314 ddp->ddp_refcnt--;
315 315 }
316 316
317 317 void
318 318 ddt_phys_free(ddt_t *ddt, ddt_key_t *ddk, ddt_phys_t *ddp, uint64_t txg)
319 319 {
320 320 blkptr_t blk;
321 321
322 322 ddt_bp_create(ddt->ddt_checksum, ddk, ddp, &blk);
323 323 ddt_phys_clear(ddp);
324 324 zio_free(ddt->ddt_spa, txg, &blk);
325 325 }
326 326
327 327 ddt_phys_t *
328 328 ddt_phys_select(const ddt_entry_t *dde, const blkptr_t *bp)
329 329 {
330 330 ddt_phys_t *ddp = (ddt_phys_t *)dde->dde_phys;
331 331
332 332 for (int p = 0; p < DDT_PHYS_TYPES; p++, ddp++) {
333 333 if (DVA_EQUAL(BP_IDENTITY(bp), &ddp->ddp_dva[0]) &&
334 334 BP_PHYSICAL_BIRTH(bp) == ddp->ddp_phys_birth)
335 335 return (ddp);
336 336 }
337 337 return (NULL);
338 338 }
339 339
340 340 uint64_t
341 341 ddt_phys_total_refcnt(const ddt_entry_t *dde)
342 342 {
343 343 uint64_t refcnt = 0;
344 344
345 345 for (int p = DDT_PHYS_SINGLE; p <= DDT_PHYS_TRIPLE; p++)
346 346 refcnt += dde->dde_phys[p].ddp_refcnt;
347 347
348 348 return (refcnt);
349 349 }
350 350
351 351 static void
352 352 ddt_stat_generate(ddt_t *ddt, ddt_entry_t *dde, ddt_stat_t *dds)
353 353 {
354 354 spa_t *spa = ddt->ddt_spa;
355 355 ddt_phys_t *ddp = dde->dde_phys;
356 356 ddt_key_t *ddk = &dde->dde_key;
357 357 uint64_t lsize = DDK_GET_LSIZE(ddk);
358 358 uint64_t psize = DDK_GET_PSIZE(ddk);
359 359
360 360 bzero(dds, sizeof (*dds));
361 361
362 362 for (int p = 0; p < DDT_PHYS_TYPES; p++, ddp++) {
363 363 uint64_t dsize = 0;
364 364 uint64_t refcnt = ddp->ddp_refcnt;
365 365
366 366 if (ddp->ddp_phys_birth == 0)
367 367 continue;
368 368
369 369 for (int d = 0; d < SPA_DVAS_PER_BP; d++)
370 370 dsize += dva_get_dsize_sync(spa, &ddp->ddp_dva[d]);
371 371
372 372 dds->dds_blocks += 1;
373 373 dds->dds_lsize += lsize;
374 374 dds->dds_psize += psize;
375 375 dds->dds_dsize += dsize;
376 376
377 377 dds->dds_ref_blocks += refcnt;
378 378 dds->dds_ref_lsize += lsize * refcnt;
379 379 dds->dds_ref_psize += psize * refcnt;
380 380 dds->dds_ref_dsize += dsize * refcnt;
381 381 }
382 382 }
383 383
384 384 void
385 385 ddt_stat_add(ddt_stat_t *dst, const ddt_stat_t *src, uint64_t neg)
386 386 {
387 387 const uint64_t *s = (const uint64_t *)src;
388 388 uint64_t *d = (uint64_t *)dst;
389 389 uint64_t *d_end = (uint64_t *)(dst + 1);
390 390
391 391 ASSERT(neg == 0 || neg == -1ULL); /* add or subtract */
392 392
393 393 while (d < d_end)
394 394 *d++ += (*s++ ^ neg) - neg;
395 395 }
396 396
397 397 static void
398 398 ddt_stat_update(ddt_t *ddt, ddt_entry_t *dde, uint64_t neg)
399 399 {
400 400 ddt_stat_t dds;
401 401 ddt_histogram_t *ddh;
402 402 int bucket;
403 403
404 404 ddt_stat_generate(ddt, dde, &dds);
405 405
406 406 bucket = highbit(dds.dds_ref_blocks) - 1;
407 407 ASSERT(bucket >= 0);
408 408
409 409 ddh = &ddt->ddt_histogram[dde->dde_type][dde->dde_class];
410 410
411 411 ddt_stat_add(&ddh->ddh_stat[bucket], &dds, neg);
412 412 }
413 413
414 414 void
415 415 ddt_histogram_add(ddt_histogram_t *dst, const ddt_histogram_t *src)
416 416 {
417 417 for (int h = 0; h < 64; h++)
418 418 ddt_stat_add(&dst->ddh_stat[h], &src->ddh_stat[h], 0);
419 419 }
420 420
421 421 void
422 422 ddt_histogram_stat(ddt_stat_t *dds, const ddt_histogram_t *ddh)
423 423 {
424 424 bzero(dds, sizeof (*dds));
425 425
426 426 for (int h = 0; h < 64; h++)
427 427 ddt_stat_add(dds, &ddh->ddh_stat[h], 0);
428 428 }
429 429
430 430 boolean_t
431 431 ddt_histogram_empty(const ddt_histogram_t *ddh)
432 432 {
433 433 const uint64_t *s = (const uint64_t *)ddh;
434 434 const uint64_t *s_end = (const uint64_t *)(ddh + 1);
435 435
436 436 while (s < s_end)
437 437 if (*s++ != 0)
438 438 return (B_FALSE);
439 439
440 440 return (B_TRUE);
441 441 }
442 442
443 443 void
444 444 ddt_get_dedup_object_stats(spa_t *spa, ddt_object_t *ddo_total)
445 445 {
446 446 /* Sum the statistics we cached in ddt_object_sync(). */
447 447 for (enum zio_checksum c = 0; c < ZIO_CHECKSUM_FUNCTIONS; c++) {
448 448 ddt_t *ddt = spa->spa_ddt[c];
449 449 for (enum ddt_type type = 0; type < DDT_TYPES; type++) {
450 450 for (enum ddt_class class = 0; class < DDT_CLASSES;
451 451 class++) {
452 452 ddt_object_t *ddo =
453 453 &ddt->ddt_object_stats[type][class];
454 454 ddo_total->ddo_count += ddo->ddo_count;
455 455 ddo_total->ddo_dspace += ddo->ddo_dspace;
456 456 ddo_total->ddo_mspace += ddo->ddo_mspace;
457 457 }
458 458 }
459 459 }
460 460
461 461 /* ... and compute the averages. */
462 462 if (ddo_total->ddo_count != 0) {
463 463 ddo_total->ddo_dspace /= ddo_total->ddo_count;
464 464 ddo_total->ddo_mspace /= ddo_total->ddo_count;
465 465 }
466 466 }
467 467
468 468 void
469 469 ddt_get_dedup_histogram(spa_t *spa, ddt_histogram_t *ddh)
470 470 {
471 471 for (enum zio_checksum c = 0; c < ZIO_CHECKSUM_FUNCTIONS; c++) {
472 472 ddt_t *ddt = spa->spa_ddt[c];
473 473 for (enum ddt_type type = 0; type < DDT_TYPES; type++) {
474 474 for (enum ddt_class class = 0; class < DDT_CLASSES;
475 475 class++) {
476 476 ddt_histogram_add(ddh,
477 477 &ddt->ddt_histogram_cache[type][class]);
478 478 }
479 479 }
480 480 }
481 481 }
482 482
483 483 void
484 484 ddt_get_dedup_stats(spa_t *spa, ddt_stat_t *dds_total)
485 485 {
486 486 ddt_histogram_t *ddh_total;
487 487
488 488 ddh_total = kmem_zalloc(sizeof (ddt_histogram_t), KM_SLEEP);
489 489 ddt_get_dedup_histogram(spa, ddh_total);
490 490 ddt_histogram_stat(dds_total, ddh_total);
491 491 kmem_free(ddh_total, sizeof (ddt_histogram_t));
492 492 }
493 493
494 494 uint64_t
495 495 ddt_get_dedup_dspace(spa_t *spa)
496 496 {
497 497 ddt_stat_t dds_total = { 0 };
498 498
499 499 ddt_get_dedup_stats(spa, &dds_total);
500 500 return (dds_total.dds_ref_dsize - dds_total.dds_dsize);
501 501 }
502 502
503 503 uint64_t
504 504 ddt_get_pool_dedup_ratio(spa_t *spa)
505 505 {
506 506 ddt_stat_t dds_total = { 0 };
507 507
508 508 ddt_get_dedup_stats(spa, &dds_total);
509 509 if (dds_total.dds_dsize == 0)
510 510 return (100);
511 511
512 512 return (dds_total.dds_ref_dsize * 100 / dds_total.dds_dsize);
513 513 }
514 514
515 515 int
516 516 ddt_ditto_copies_needed(ddt_t *ddt, ddt_entry_t *dde, ddt_phys_t *ddp_willref)
517 517 {
518 518 spa_t *spa = ddt->ddt_spa;
519 519 uint64_t total_refcnt = 0;
520 520 uint64_t ditto = spa->spa_dedup_ditto;
521 521 int total_copies = 0;
522 522 int desired_copies = 0;
523 523
524 524 for (int p = DDT_PHYS_SINGLE; p <= DDT_PHYS_TRIPLE; p++) {
525 525 ddt_phys_t *ddp = &dde->dde_phys[p];
526 526 zio_t *zio = dde->dde_lead_zio[p];
527 527 uint64_t refcnt = ddp->ddp_refcnt; /* committed refs */
528 528 if (zio != NULL)
529 529 refcnt += zio->io_parent_count; /* pending refs */
530 530 if (ddp == ddp_willref)
531 531 refcnt++; /* caller's ref */
532 532 if (refcnt != 0) {
533 533 total_refcnt += refcnt;
534 534 total_copies += p;
535 535 }
536 536 }
537 537
538 538 if (ditto == 0 || ditto > UINT32_MAX)
539 539 ditto = UINT32_MAX;
540 540
541 541 if (total_refcnt >= 1)
542 542 desired_copies++;
543 543 if (total_refcnt >= ditto)
544 544 desired_copies++;
545 545 if (total_refcnt >= ditto * ditto)
546 546 desired_copies++;
547 547
548 548 return (MAX(desired_copies, total_copies) - total_copies);
549 549 }
550 550
551 551 int
552 552 ddt_ditto_copies_present(ddt_entry_t *dde)
553 553 {
554 554 ddt_phys_t *ddp = &dde->dde_phys[DDT_PHYS_DITTO];
555 555 dva_t *dva = ddp->ddp_dva;
556 556 int copies = 0 - DVA_GET_GANG(dva);
557 557
558 558 for (int d = 0; d < SPA_DVAS_PER_BP; d++, dva++)
559 559 if (DVA_IS_VALID(dva))
560 560 copies++;
561 561
562 562 ASSERT(copies >= 0 && copies < SPA_DVAS_PER_BP);
563 563
564 564 return (copies);
565 565 }
566 566
567 567 size_t
568 568 ddt_compress(void *src, uchar_t *dst, size_t s_len, size_t d_len)
569 569 {
570 570 uchar_t *version = dst++;
571 571 int cpfunc = ZIO_COMPRESS_ZLE;
572 572 zio_compress_info_t *ci = &zio_compress_table[cpfunc];
573 573 size_t c_len;
574 574
575 575 ASSERT(d_len >= s_len + 1); /* no compression plus version byte */
576 576
577 577 c_len = ci->ci_compress(src, dst, s_len, d_len - 1, ci->ci_level);
578 578
579 579 if (c_len == s_len) {
580 580 cpfunc = ZIO_COMPRESS_OFF;
581 581 bcopy(src, dst, s_len);
582 582 }
583 583
584 584 *version = (ZFS_HOST_BYTEORDER & DDT_COMPRESS_BYTEORDER_MASK) | cpfunc;
585 585
586 586 return (c_len + 1);
587 587 }
588 588
589 589 void
590 590 ddt_decompress(uchar_t *src, void *dst, size_t s_len, size_t d_len)
591 591 {
592 592 uchar_t version = *src++;
593 593 int cpfunc = version & DDT_COMPRESS_FUNCTION_MASK;
594 594 zio_compress_info_t *ci = &zio_compress_table[cpfunc];
595 595
596 596 if (ci->ci_decompress != NULL)
597 597 (void) ci->ci_decompress(src, dst, s_len, d_len, ci->ci_level);
598 598 else
599 599 bcopy(src, dst, d_len);
600 600
601 601 if ((version ^ ZFS_HOST_BYTEORDER) & DDT_COMPRESS_BYTEORDER_MASK)
602 602 byteswap_uint64_array(dst, d_len);
603 603 }
604 604
605 605 ddt_t *
606 606 ddt_select_by_checksum(spa_t *spa, enum zio_checksum c)
607 607 {
608 608 return (spa->spa_ddt[c]);
609 609 }
610 610
611 611 ddt_t *
612 612 ddt_select(spa_t *spa, const blkptr_t *bp)
613 613 {
614 614 return (spa->spa_ddt[BP_GET_CHECKSUM(bp)]);
615 615 }
616 616
617 617 void
618 618 ddt_enter(ddt_t *ddt)
619 619 {
620 620 mutex_enter(&ddt->ddt_lock);
621 621 }
622 622
623 623 void
624 624 ddt_exit(ddt_t *ddt)
625 625 {
626 626 mutex_exit(&ddt->ddt_lock);
627 627 }
628 628
629 629 static ddt_entry_t *
630 630 ddt_alloc(const ddt_key_t *ddk)
631 631 {
632 632 ddt_entry_t *dde;
633 633
634 634 dde = kmem_zalloc(sizeof (ddt_entry_t), KM_SLEEP);
635 635 cv_init(&dde->dde_cv, NULL, CV_DEFAULT, NULL);
636 636
637 637 dde->dde_key = *ddk;
638 638
639 639 return (dde);
640 640 }
641 641
642 642 static void
643 643 ddt_free(ddt_entry_t *dde)
644 644 {
645 645 ASSERT(!dde->dde_loading);
646 646
647 647 for (int p = 0; p < DDT_PHYS_TYPES; p++)
648 648 ASSERT(dde->dde_lead_zio[p] == NULL);
649 649
650 650 if (dde->dde_repair_data != NULL)
651 651 zio_buf_free(dde->dde_repair_data,
652 652 DDK_GET_PSIZE(&dde->dde_key));
653 653
654 654 cv_destroy(&dde->dde_cv);
655 655 kmem_free(dde, sizeof (*dde));
656 656 }
657 657
658 658 void
659 659 ddt_remove(ddt_t *ddt, ddt_entry_t *dde)
660 660 {
661 661 ASSERT(MUTEX_HELD(&ddt->ddt_lock));
662 662
663 663 avl_remove(&ddt->ddt_tree, dde);
664 664 ddt_free(dde);
665 665 }
666 666
667 667 ddt_entry_t *
668 668 ddt_lookup(ddt_t *ddt, const blkptr_t *bp, boolean_t add)
669 669 {
670 670 ddt_entry_t *dde, dde_search;
671 671 enum ddt_type type;
672 672 enum ddt_class class;
673 673 avl_index_t where;
674 674 int error;
675 675
676 676 ASSERT(MUTEX_HELD(&ddt->ddt_lock));
677 677
678 678 ddt_key_fill(&dde_search.dde_key, bp);
679 679
680 680 dde = avl_find(&ddt->ddt_tree, &dde_search, &where);
681 681 if (dde == NULL) {
682 682 if (!add)
683 683 return (NULL);
684 684 dde = ddt_alloc(&dde_search.dde_key);
685 685 avl_insert(&ddt->ddt_tree, dde, where);
686 686 }
687 687
688 688 while (dde->dde_loading)
689 689 cv_wait(&dde->dde_cv, &ddt->ddt_lock);
690 690
691 691 if (dde->dde_loaded)
692 692 return (dde);
693 693
694 694 dde->dde_loading = B_TRUE;
695 695
696 696 ddt_exit(ddt);
697 697
698 698 error = ENOENT;
699 699
700 700 for (type = 0; type < DDT_TYPES; type++) {
701 701 for (class = 0; class < DDT_CLASSES; class++) {
702 702 error = ddt_object_lookup(ddt, type, class, dde);
703 703 if (error != ENOENT)
704 704 break;
705 705 }
706 706 if (error != ENOENT)
707 707 break;
708 708 }
709 709
710 710 ASSERT(error == 0 || error == ENOENT);
711 711
712 712 ddt_enter(ddt);
713 713
714 714 ASSERT(dde->dde_loaded == B_FALSE);
715 715 ASSERT(dde->dde_loading == B_TRUE);
716 716
717 717 dde->dde_type = type; /* will be DDT_TYPES if no entry found */
718 718 dde->dde_class = class; /* will be DDT_CLASSES if no entry found */
719 719 dde->dde_loaded = B_TRUE;
720 720 dde->dde_loading = B_FALSE;
721 721
722 722 if (error == 0)
723 723 ddt_stat_update(ddt, dde, -1ULL);
724 724
725 725 cv_broadcast(&dde->dde_cv);
726 726
727 727 return (dde);
728 728 }
729 729
730 730 void
731 731 ddt_prefetch(spa_t *spa, const blkptr_t *bp)
732 732 {
733 733 ddt_t *ddt;
734 734 ddt_entry_t dde;
735 735
736 736 if (!zfs_dedup_prefetch || bp == NULL || !BP_GET_DEDUP(bp))
737 737 return;
738 738
739 739 /*
740 740 * We only remove the DDT once all tables are empty and only
741 741 * prefetch dedup blocks when there are entries in the DDT.
742 742 * Thus no locking is required as the DDT can't disappear on us.
743 743 */
744 744 ddt = ddt_select(spa, bp);
745 745 ddt_key_fill(&dde.dde_key, bp);
746 746
747 747 for (enum ddt_type type = 0; type < DDT_TYPES; type++) {
748 748 for (enum ddt_class class = 0; class < DDT_CLASSES; class++) {
749 749 ddt_object_prefetch(ddt, type, class, &dde);
750 750 }
751 751 }
752 752 }
753 753
754 754 int
755 755 ddt_entry_compare(const void *x1, const void *x2)
756 756 {
757 757 const ddt_entry_t *dde1 = x1;
758 758 const ddt_entry_t *dde2 = x2;
759 759 const uint64_t *u1 = (const uint64_t *)&dde1->dde_key;
760 760 const uint64_t *u2 = (const uint64_t *)&dde2->dde_key;
761 761
762 762 for (int i = 0; i < DDT_KEY_WORDS; i++) {
763 763 if (u1[i] < u2[i])
764 764 return (-1);
765 765 if (u1[i] > u2[i])
766 766 return (1);
767 767 }
768 768
769 769 return (0);
770 770 }
771 771
772 772 static ddt_t *
773 773 ddt_table_alloc(spa_t *spa, enum zio_checksum c)
774 774 {
775 775 ddt_t *ddt;
776 776
777 777 ddt = kmem_zalloc(sizeof (*ddt), KM_SLEEP);
778 778
779 779 mutex_init(&ddt->ddt_lock, NULL, MUTEX_DEFAULT, NULL);
780 780 avl_create(&ddt->ddt_tree, ddt_entry_compare,
781 781 sizeof (ddt_entry_t), offsetof(ddt_entry_t, dde_node));
782 782 avl_create(&ddt->ddt_repair_tree, ddt_entry_compare,
783 783 sizeof (ddt_entry_t), offsetof(ddt_entry_t, dde_node));
784 784 ddt->ddt_checksum = c;
785 785 ddt->ddt_spa = spa;
786 786 ddt->ddt_os = spa->spa_meta_objset;
787 787
788 788 return (ddt);
789 789 }
790 790
791 791 static void
792 792 ddt_table_free(ddt_t *ddt)
793 793 {
794 794 ASSERT(avl_numnodes(&ddt->ddt_tree) == 0);
795 795 ASSERT(avl_numnodes(&ddt->ddt_repair_tree) == 0);
796 796 avl_destroy(&ddt->ddt_tree);
797 797 avl_destroy(&ddt->ddt_repair_tree);
798 798 mutex_destroy(&ddt->ddt_lock);
799 799 kmem_free(ddt, sizeof (*ddt));
800 800 }
801 801
802 802 void
803 803 ddt_create(spa_t *spa)
804 804 {
805 805 spa->spa_dedup_checksum = ZIO_DEDUPCHECKSUM;
806 806
807 807 for (enum zio_checksum c = 0; c < ZIO_CHECKSUM_FUNCTIONS; c++)
808 808 spa->spa_ddt[c] = ddt_table_alloc(spa, c);
809 809 }
810 810
811 811 int
812 812 ddt_load(spa_t *spa)
813 813 {
814 814 int error;
815 815
816 816 ddt_create(spa);
817 817
818 818 error = zap_lookup(spa->spa_meta_objset, DMU_POOL_DIRECTORY_OBJECT,
819 819 DMU_POOL_DDT_STATS, sizeof (uint64_t), 1,
820 820 &spa->spa_ddt_stat_object);
821 821
822 822 if (error)
823 823 return (error == ENOENT ? 0 : error);
824 824
825 825 for (enum zio_checksum c = 0; c < ZIO_CHECKSUM_FUNCTIONS; c++) {
826 826 ddt_t *ddt = spa->spa_ddt[c];
827 827 for (enum ddt_type type = 0; type < DDT_TYPES; type++) {
828 828 for (enum ddt_class class = 0; class < DDT_CLASSES;
829 829 class++) {
830 830 error = ddt_object_load(ddt, type, class);
831 831 if (error != 0 && error != ENOENT)
832 832 return (error);
833 833 }
834 834 }
835 835
836 836 /*
837 837 * Seed the cached histograms.
838 838 */
839 839 bcopy(ddt->ddt_histogram, &ddt->ddt_histogram_cache,
840 840 sizeof (ddt->ddt_histogram));
841 841 }
842 842
843 843 return (0);
844 844 }
845 845
846 846 void
847 847 ddt_unload(spa_t *spa)
848 848 {
849 849 for (enum zio_checksum c = 0; c < ZIO_CHECKSUM_FUNCTIONS; c++) {
850 850 if (spa->spa_ddt[c]) {
851 851 ddt_table_free(spa->spa_ddt[c]);
852 852 spa->spa_ddt[c] = NULL;
853 853 }
854 854 }
855 855 }
856 856
857 857 boolean_t
858 858 ddt_class_contains(spa_t *spa, enum ddt_class max_class, const blkptr_t *bp)
859 859 {
860 860 ddt_t *ddt;
861 861 ddt_entry_t dde;
862 862
863 863 if (!BP_GET_DEDUP(bp))
864 864 return (B_FALSE);
865 865
866 866 if (max_class == DDT_CLASS_UNIQUE)
867 867 return (B_TRUE);
868 868
869 869 ddt = spa->spa_ddt[BP_GET_CHECKSUM(bp)];
870 870
871 871 ddt_key_fill(&dde.dde_key, bp);
872 872
873 873 for (enum ddt_type type = 0; type < DDT_TYPES; type++)
874 874 for (enum ddt_class class = 0; class <= max_class; class++)
875 875 if (ddt_object_lookup(ddt, type, class, &dde) == 0)
876 876 return (B_TRUE);
877 877
878 878 return (B_FALSE);
879 879 }
880 880
881 881 ddt_entry_t *
882 882 ddt_repair_start(ddt_t *ddt, const blkptr_t *bp)
883 883 {
884 884 ddt_key_t ddk;
885 885 ddt_entry_t *dde;
886 886
887 887 ddt_key_fill(&ddk, bp);
888 888
889 889 dde = ddt_alloc(&ddk);
890 890
891 891 for (enum ddt_type type = 0; type < DDT_TYPES; type++) {
892 892 for (enum ddt_class class = 0; class < DDT_CLASSES; class++) {
893 893 /*
894 894 * We can only do repair if there are multiple copies
895 895 * of the block. For anything in the UNIQUE class,
896 896 * there's definitely only one copy, so don't even try.
897 897 */
898 898 if (class != DDT_CLASS_UNIQUE &&
899 899 ddt_object_lookup(ddt, type, class, dde) == 0)
900 900 return (dde);
901 901 }
902 902 }
903 903
904 904 bzero(dde->dde_phys, sizeof (dde->dde_phys));
905 905
906 906 return (dde);
907 907 }
908 908
909 909 void
910 910 ddt_repair_done(ddt_t *ddt, ddt_entry_t *dde)
911 911 {
912 912 avl_index_t where;
913 913
914 914 ddt_enter(ddt);
915 915
916 916 if (dde->dde_repair_data != NULL && spa_writeable(ddt->ddt_spa) &&
917 917 avl_find(&ddt->ddt_repair_tree, dde, &where) == NULL)
918 918 avl_insert(&ddt->ddt_repair_tree, dde, where);
919 919 else
920 920 ddt_free(dde);
921 921
922 922 ddt_exit(ddt);
923 923 }
924 924
925 925 static void
926 926 ddt_repair_entry_done(zio_t *zio)
927 927 {
928 928 ddt_entry_t *rdde = zio->io_private;
929 929
930 930 ddt_free(rdde);
931 931 }
932 932
933 933 static void
934 934 ddt_repair_entry(ddt_t *ddt, ddt_entry_t *dde, ddt_entry_t *rdde, zio_t *rio)
935 935 {
936 936 ddt_phys_t *ddp = dde->dde_phys;
937 937 ddt_phys_t *rddp = rdde->dde_phys;
938 938 ddt_key_t *ddk = &dde->dde_key;
939 939 ddt_key_t *rddk = &rdde->dde_key;
940 940 zio_t *zio;
941 941 blkptr_t blk;
942 942
943 943 zio = zio_null(rio, rio->io_spa, NULL,
944 944 ddt_repair_entry_done, rdde, rio->io_flags);
945 945
946 946 for (int p = 0; p < DDT_PHYS_TYPES; p++, ddp++, rddp++) {
947 947 if (ddp->ddp_phys_birth == 0 ||
948 948 ddp->ddp_phys_birth != rddp->ddp_phys_birth ||
949 949 bcmp(ddp->ddp_dva, rddp->ddp_dva, sizeof (ddp->ddp_dva)))
950 950 continue;
951 951 ddt_bp_create(ddt->ddt_checksum, ddk, ddp, &blk);
952 952 zio_nowait(zio_rewrite(zio, zio->io_spa, 0, &blk,
953 953 rdde->dde_repair_data, DDK_GET_PSIZE(rddk), NULL, NULL,
954 954 ZIO_PRIORITY_SYNC_WRITE, ZIO_DDT_CHILD_FLAGS(zio), NULL));
955 955 }
956 956
957 957 zio_nowait(zio);
958 958 }
959 959
960 960 static void
961 961 ddt_repair_table(ddt_t *ddt, zio_t *rio)
962 962 {
963 963 spa_t *spa = ddt->ddt_spa;
964 964 ddt_entry_t *dde, *rdde_next, *rdde;
965 965 avl_tree_t *t = &ddt->ddt_repair_tree;
966 966 blkptr_t blk;
967 967
968 968 if (spa_sync_pass(spa) > 1)
969 969 return;
970 970
971 971 ddt_enter(ddt);
972 972 for (rdde = avl_first(t); rdde != NULL; rdde = rdde_next) {
973 973 rdde_next = AVL_NEXT(t, rdde);
974 974 avl_remove(&ddt->ddt_repair_tree, rdde);
975 975 ddt_exit(ddt);
976 976 ddt_bp_create(ddt->ddt_checksum, &rdde->dde_key, NULL, &blk);
977 977 dde = ddt_repair_start(ddt, &blk);
978 978 ddt_repair_entry(ddt, dde, rdde, rio);
979 979 ddt_repair_done(ddt, dde);
980 980 ddt_enter(ddt);
981 981 }
982 982 ddt_exit(ddt);
983 983 }
984 984
985 985 static void
986 986 ddt_sync_entry(ddt_t *ddt, ddt_entry_t *dde, dmu_tx_t *tx, uint64_t txg)
987 987 {
988 988 dsl_pool_t *dp = ddt->ddt_spa->spa_dsl_pool;
989 989 ddt_phys_t *ddp = dde->dde_phys;
990 990 ddt_key_t *ddk = &dde->dde_key;
991 991 enum ddt_type otype = dde->dde_type;
992 992 enum ddt_type ntype = DDT_TYPE_CURRENT;
993 993 enum ddt_class oclass = dde->dde_class;
994 994 enum ddt_class nclass;
995 995 uint64_t total_refcnt = 0;
996 996
997 997 ASSERT(dde->dde_loaded);
998 998 ASSERT(!dde->dde_loading);
999 999
1000 1000 for (int p = 0; p < DDT_PHYS_TYPES; p++, ddp++) {
1001 1001 ASSERT(dde->dde_lead_zio[p] == NULL);
1002 1002 ASSERT((int64_t)ddp->ddp_refcnt >= 0);
1003 1003 if (ddp->ddp_phys_birth == 0) {
1004 1004 ASSERT(ddp->ddp_refcnt == 0);
1005 1005 continue;
1006 1006 }
1007 1007 if (p == DDT_PHYS_DITTO) {
1008 1008 if (ddt_ditto_copies_needed(ddt, dde, NULL) == 0)
1009 1009 ddt_phys_free(ddt, ddk, ddp, txg);
1010 1010 continue;
1011 1011 }
1012 1012 if (ddp->ddp_refcnt == 0)
1013 1013 ddt_phys_free(ddt, ddk, ddp, txg);
1014 1014 total_refcnt += ddp->ddp_refcnt;
1015 1015 }
1016 1016
1017 1017 if (dde->dde_phys[DDT_PHYS_DITTO].ddp_phys_birth != 0)
1018 1018 nclass = DDT_CLASS_DITTO;
1019 1019 else if (total_refcnt > 1)
1020 1020 nclass = DDT_CLASS_DUPLICATE;
1021 1021 else
1022 1022 nclass = DDT_CLASS_UNIQUE;
1023 1023
1024 1024 if (otype != DDT_TYPES &&
1025 1025 (otype != ntype || oclass != nclass || total_refcnt == 0)) {
1026 1026 VERIFY(ddt_object_remove(ddt, otype, oclass, dde, tx) == 0);
1027 1027 ASSERT(ddt_object_lookup(ddt, otype, oclass, dde) == ENOENT);
1028 1028 }
1029 1029
1030 1030 if (total_refcnt != 0) {
1031 1031 dde->dde_type = ntype;
1032 1032 dde->dde_class = nclass;
1033 1033 ddt_stat_update(ddt, dde, 0);
1034 1034 if (!ddt_object_exists(ddt, ntype, nclass))
1035 1035 ddt_object_create(ddt, ntype, nclass, tx);
1036 1036 VERIFY(ddt_object_update(ddt, ntype, nclass, dde, tx) == 0);
1037 1037
1038 1038 /*
1039 1039 * If the class changes, the order that we scan this bp
1040 1040 * changes. If it decreases, we could miss it, so
1041 1041 * scan it right now. (This covers both class changing
1042 1042 * while we are doing ddt_walk(), and when we are
1043 1043 * traversing.)
1044 1044 */
1045 1045 if (nclass < oclass) {
1046 1046 dsl_scan_ddt_entry(dp->dp_scan,
1047 1047 ddt->ddt_checksum, dde, tx);
1048 1048 }
1049 1049 }
1050 1050 }
1051 1051
1052 1052 static void
1053 1053 ddt_sync_table(ddt_t *ddt, dmu_tx_t *tx, uint64_t txg)
1054 1054 {
1055 1055 spa_t *spa = ddt->ddt_spa;
1056 1056 ddt_entry_t *dde;
1057 1057 void *cookie = NULL;
1058 1058
1059 1059 if (avl_numnodes(&ddt->ddt_tree) == 0)
1060 1060 return;
1061 1061
1062 1062 ASSERT(spa->spa_uberblock.ub_version >= SPA_VERSION_DEDUP);
1063 1063
1064 1064 if (spa->spa_ddt_stat_object == 0) {
1065 1065 spa->spa_ddt_stat_object = zap_create_link(ddt->ddt_os,
1066 1066 DMU_OT_DDT_STATS, DMU_POOL_DIRECTORY_OBJECT,
1067 1067 DMU_POOL_DDT_STATS, tx);
1068 1068 }
1069 1069
1070 1070 while ((dde = avl_destroy_nodes(&ddt->ddt_tree, &cookie)) != NULL) {
1071 1071 ddt_sync_entry(ddt, dde, tx, txg);
1072 1072 ddt_free(dde);
1073 1073 }
1074 1074
1075 1075 for (enum ddt_type type = 0; type < DDT_TYPES; type++) {
1076 1076 uint64_t count = 0;
1077 1077 for (enum ddt_class class = 0; class < DDT_CLASSES; class++) {
1078 1078 if (ddt_object_exists(ddt, type, class)) {
1079 1079 ddt_object_sync(ddt, type, class, tx);
1080 1080 count += ddt_object_count(ddt, type, class);
1081 1081 }
1082 1082 }
1083 1083 for (enum ddt_class class = 0; class < DDT_CLASSES; class++) {
1084 1084 if (count == 0 && ddt_object_exists(ddt, type, class))
1085 1085 ddt_object_destroy(ddt, type, class, tx);
1086 1086 }
1087 1087 }
1088 1088
1089 1089 bcopy(ddt->ddt_histogram, &ddt->ddt_histogram_cache,
1090 1090 sizeof (ddt->ddt_histogram));
1091 1091 }
1092 1092
1093 1093 void
1094 1094 ddt_sync(spa_t *spa, uint64_t txg)
1095 1095 {
1096 1096 dmu_tx_t *tx;
1097 1097 zio_t *rio = zio_root(spa, NULL, NULL,
1098 1098 ZIO_FLAG_CANFAIL | ZIO_FLAG_SPECULATIVE);
1099 1099
1100 1100 ASSERT(spa_syncing_txg(spa) == txg);
1101 1101
1102 1102 tx = dmu_tx_create_assigned(spa->spa_dsl_pool, txg);
1103 1103
1104 1104 for (enum zio_checksum c = 0; c < ZIO_CHECKSUM_FUNCTIONS; c++) {
1105 1105 ddt_t *ddt = spa->spa_ddt[c];
1106 1106 if (ddt == NULL)
1107 1107 continue;
1108 1108 ddt_sync_table(ddt, tx, txg);
1109 1109 ddt_repair_table(ddt, rio);
1110 1110 }
1111 1111
1112 1112 (void) zio_wait(rio);
1113 1113
1114 1114 dmu_tx_commit(tx);
1115 1115 }
1116 1116
1117 1117 int
1118 1118 ddt_walk(spa_t *spa, ddt_bookmark_t *ddb, ddt_entry_t *dde)
1119 1119 {
1120 1120 do {
1121 1121 do {
1122 1122 do {
1123 1123 ddt_t *ddt = spa->spa_ddt[ddb->ddb_checksum];
1124 1124 int error = ENOENT;
1125 1125 if (ddt_object_exists(ddt, ddb->ddb_type,
1126 1126 ddb->ddb_class)) {
1127 1127 error = ddt_object_walk(ddt,
1128 1128 ddb->ddb_type, ddb->ddb_class,
1129 1129 &ddb->ddb_cursor, dde);
1130 1130 }
1131 1131 dde->dde_type = ddb->ddb_type;
1132 1132 dde->dde_class = ddb->ddb_class;
1133 1133 if (error == 0)
1134 1134 return (0);
1135 1135 if (error != ENOENT)
1136 1136 return (error);
1137 1137 ddb->ddb_cursor = 0;
1138 1138 } while (++ddb->ddb_checksum < ZIO_CHECKSUM_FUNCTIONS);
1139 1139 ddb->ddb_checksum = 0;
1140 1140 } while (++ddb->ddb_type < DDT_TYPES);
1141 1141 ddb->ddb_type = 0;
1142 1142 } while (++ddb->ddb_class < DDT_CLASSES);
1143 1143
1144 1144 return (SET_ERROR(ENOENT));
1145 1145 }
|
↓ open down ↓ |
893 lines elided |
↑ open up ↑ |
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX