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) 2005, 2010, Oracle and/or its affiliates. All rights reserved.
23 * Copyright (c) 2011, 2020 by Delphix. All rights reserved.
24 * Copyright (c) 2013 by Saso Kiselkov. All rights reserved.
25 * Copyright (c) 2013, Joyent, Inc. All rights reserved.
26 * Copyright (c) 2016, Nexenta Systems, Inc. All rights reserved.
27 * Copyright (c) 2015 by Chunwei Chen. All rights reserved.
28 * Copyright (c) 2019 Datto Inc.
29 * Copyright (c) 2019, Klara Inc.
30 * Copyright (c) 2019, Allan Jude
31 * Copyright (c) 2022 Hewlett Packard Enterprise Development LP.
32 */
33
34 #include <sys/dmu.h>
35 #include <sys/dmu_impl.h>
36 #include <sys/dmu_tx.h>
37 #include <sys/dbuf.h>
38 #include <sys/dnode.h>
39 #include <sys/zfs_context.h>
40 #include <sys/dmu_objset.h>
41 #include <sys/dmu_traverse.h>
42 #include <sys/dsl_dataset.h>
43 #include <sys/dsl_dir.h>
44 #include <sys/dsl_pool.h>
45 #include <sys/dsl_synctask.h>
46 #include <sys/dsl_prop.h>
47 #include <sys/dmu_zfetch.h>
48 #include <sys/zfs_ioctl.h>
49 #include <sys/zap.h>
50 #include <sys/zio_checksum.h>
51 #include <sys/zio_compress.h>
52 #include <sys/sa.h>
53 #include <sys/zfeature.h>
54 #include <sys/abd.h>
55 #include <sys/trace_zfs.h>
56 #include <sys/zfs_racct.h>
57 #include <sys/zfs_rlock.h>
58 #ifdef _KERNEL
59 #include <sys/vmsystm.h>
60 #include <sys/zfs_znode.h>
61 #endif
62
63 /*
64 * Enable/disable nopwrite feature.
65 */
66 int zfs_nopwrite_enabled = 1;
67
68 /*
69 * Tunable to control percentage of dirtied L1 blocks from frees allowed into
70 * one TXG. After this threshold is crossed, additional dirty blocks from frees
71 * will wait until the next TXG.
72 * A value of zero will disable this throttle.
73 */
74 unsigned long zfs_per_txg_dirty_frees_percent = 30;
75
76 /*
77 * Enable/disable forcing txg sync when dirty checking for holes with lseek().
78 * By default this is enabled to ensure accurate hole reporting, it can result
79 * in a significant performance penalty for lseek(SEEK_HOLE) heavy workloads.
80 * Disabling this option will result in holes never being reported in dirty
81 * files which is always safe.
82 */
83 int zfs_dmu_offset_next_sync = 1;
84
85 /*
86 * Limit the amount we can prefetch with one call to this amount. This
87 * helps to limit the amount of memory that can be used by prefetching.
88 * Larger objects should be prefetched a bit at a time.
89 */
90 int dmu_prefetch_max = 8 * SPA_MAXBLOCKSIZE;
91
92 const dmu_object_type_info_t dmu_ot[DMU_OT_NUMTYPES] = {
93 {DMU_BSWAP_UINT8, TRUE, FALSE, FALSE, "unallocated" },
94 {DMU_BSWAP_ZAP, TRUE, TRUE, FALSE, "object directory" },
95 {DMU_BSWAP_UINT64, TRUE, TRUE, FALSE, "object array" },
96 {DMU_BSWAP_UINT8, TRUE, FALSE, FALSE, "packed nvlist" },
97 {DMU_BSWAP_UINT64, TRUE, FALSE, FALSE, "packed nvlist size" },
98 {DMU_BSWAP_UINT64, TRUE, FALSE, FALSE, "bpobj" },
99 {DMU_BSWAP_UINT64, TRUE, FALSE, FALSE, "bpobj header" },
100 {DMU_BSWAP_UINT64, TRUE, FALSE, FALSE, "SPA space map header" },
101 {DMU_BSWAP_UINT64, TRUE, FALSE, FALSE, "SPA space map" },
102 {DMU_BSWAP_UINT64, TRUE, FALSE, TRUE, "ZIL intent log" },
103 {DMU_BSWAP_DNODE, TRUE, FALSE, TRUE, "DMU dnode" },
104 {DMU_BSWAP_OBJSET, TRUE, TRUE, FALSE, "DMU objset" },
105 {DMU_BSWAP_UINT64, TRUE, TRUE, FALSE, "DSL directory" },
106 {DMU_BSWAP_ZAP, TRUE, TRUE, FALSE, "DSL directory child map"},
107 {DMU_BSWAP_ZAP, TRUE, TRUE, FALSE, "DSL dataset snap map" },
108 {DMU_BSWAP_ZAP, TRUE, TRUE, FALSE, "DSL props" },
109 {DMU_BSWAP_UINT64, TRUE, TRUE, FALSE, "DSL dataset" },
110 {DMU_BSWAP_ZNODE, TRUE, FALSE, FALSE, "ZFS znode" },
111 {DMU_BSWAP_OLDACL, TRUE, FALSE, TRUE, "ZFS V0 ACL" },
112 {DMU_BSWAP_UINT8, FALSE, FALSE, TRUE, "ZFS plain file" },
113 {DMU_BSWAP_ZAP, TRUE, FALSE, TRUE, "ZFS directory" },
114 {DMU_BSWAP_ZAP, TRUE, FALSE, FALSE, "ZFS master node" },
115 {DMU_BSWAP_ZAP, TRUE, FALSE, TRUE, "ZFS delete queue" },
116 {DMU_BSWAP_UINT8, FALSE, FALSE, TRUE, "zvol object" },
117 {DMU_BSWAP_ZAP, TRUE, FALSE, FALSE, "zvol prop" },
118 {DMU_BSWAP_UINT8, FALSE, FALSE, TRUE, "other uint8[]" },
119 {DMU_BSWAP_UINT64, FALSE, FALSE, TRUE, "other uint64[]" },
120 {DMU_BSWAP_ZAP, TRUE, FALSE, FALSE, "other ZAP" },
121 {DMU_BSWAP_ZAP, TRUE, FALSE, FALSE, "persistent error log" },
122 {DMU_BSWAP_UINT8, TRUE, FALSE, FALSE, "SPA history" },
123 {DMU_BSWAP_UINT64, TRUE, FALSE, FALSE, "SPA history offsets" },
124 {DMU_BSWAP_ZAP, TRUE, TRUE, FALSE, "Pool properties" },
125 {DMU_BSWAP_ZAP, TRUE, TRUE, FALSE, "DSL permissions" },
126 {DMU_BSWAP_ACL, TRUE, FALSE, TRUE, "ZFS ACL" },
127 {DMU_BSWAP_UINT8, TRUE, FALSE, TRUE, "ZFS SYSACL" },
128 {DMU_BSWAP_UINT8, TRUE, FALSE, TRUE, "FUID table" },
129 {DMU_BSWAP_UINT64, TRUE, FALSE, FALSE, "FUID table size" },
130 {DMU_BSWAP_ZAP, TRUE, TRUE, FALSE, "DSL dataset next clones"},
131 {DMU_BSWAP_ZAP, TRUE, FALSE, FALSE, "scan work queue" },
132 {DMU_BSWAP_ZAP, TRUE, FALSE, TRUE, "ZFS user/group/project used" },
133 {DMU_BSWAP_ZAP, TRUE, FALSE, TRUE, "ZFS user/group/project quota"},
134 {DMU_BSWAP_ZAP, TRUE, TRUE, FALSE, "snapshot refcount tags"},
135 {DMU_BSWAP_ZAP, TRUE, FALSE, FALSE, "DDT ZAP algorithm" },
136 {DMU_BSWAP_ZAP, TRUE, FALSE, FALSE, "DDT statistics" },
137 {DMU_BSWAP_UINT8, TRUE, FALSE, TRUE, "System attributes" },
138 {DMU_BSWAP_ZAP, TRUE, FALSE, TRUE, "SA master node" },
139 {DMU_BSWAP_ZAP, TRUE, FALSE, TRUE, "SA attr registration" },
140 {DMU_BSWAP_ZAP, TRUE, FALSE, TRUE, "SA attr layouts" },
141 {DMU_BSWAP_ZAP, TRUE, FALSE, FALSE, "scan translations" },
142 {DMU_BSWAP_UINT8, FALSE, FALSE, TRUE, "deduplicated block" },
143 {DMU_BSWAP_ZAP, TRUE, TRUE, FALSE, "DSL deadlist map" },
144 {DMU_BSWAP_UINT64, TRUE, TRUE, FALSE, "DSL deadlist map hdr" },
145 {DMU_BSWAP_ZAP, TRUE, TRUE, FALSE, "DSL dir clones" },
146 {DMU_BSWAP_UINT64, TRUE, FALSE, FALSE, "bpobj subobj" }
147 };
148
149 const dmu_object_byteswap_info_t dmu_ot_byteswap[DMU_BSWAP_NUMFUNCS] = {
150 { byteswap_uint8_array, "uint8" },
151 { byteswap_uint16_array, "uint16" },
152 { byteswap_uint32_array, "uint32" },
153 { byteswap_uint64_array, "uint64" },
154 { zap_byteswap, "zap" },
155 { dnode_buf_byteswap, "dnode" },
156 { dmu_objset_byteswap, "objset" },
157 { zfs_znode_byteswap, "znode" },
158 { zfs_oldacl_byteswap, "oldacl" },
159 { zfs_acl_byteswap, "acl" }
160 };
161
162 static int
dmu_buf_hold_noread_by_dnode(dnode_t * dn,uint64_t offset,void * tag,dmu_buf_t ** dbp)163 dmu_buf_hold_noread_by_dnode(dnode_t *dn, uint64_t offset,
164 void *tag, dmu_buf_t **dbp)
165 {
166 uint64_t blkid;
167 dmu_buf_impl_t *db;
168
169 rw_enter(&dn->dn_struct_rwlock, RW_READER);
170 blkid = dbuf_whichblock(dn, 0, offset);
171 db = dbuf_hold(dn, blkid, tag);
172 rw_exit(&dn->dn_struct_rwlock);
173
174 if (db == NULL) {
175 *dbp = NULL;
176 return (SET_ERROR(EIO));
177 }
178
179 *dbp = &db->db;
180 return (0);
181 }
182 int
dmu_buf_hold_noread(objset_t * os,uint64_t object,uint64_t offset,void * tag,dmu_buf_t ** dbp)183 dmu_buf_hold_noread(objset_t *os, uint64_t object, uint64_t offset,
184 void *tag, dmu_buf_t **dbp)
185 {
186 dnode_t *dn;
187 uint64_t blkid;
188 dmu_buf_impl_t *db;
189 int err;
190
191 err = dnode_hold(os, object, FTAG, &dn);
192 if (err)
193 return (err);
194 rw_enter(&dn->dn_struct_rwlock, RW_READER);
195 blkid = dbuf_whichblock(dn, 0, offset);
196 db = dbuf_hold(dn, blkid, tag);
197 rw_exit(&dn->dn_struct_rwlock);
198 dnode_rele(dn, FTAG);
199
200 if (db == NULL) {
201 *dbp = NULL;
202 return (SET_ERROR(EIO));
203 }
204
205 *dbp = &db->db;
206 return (err);
207 }
208
209 int
dmu_buf_hold_by_dnode(dnode_t * dn,uint64_t offset,void * tag,dmu_buf_t ** dbp,int flags)210 dmu_buf_hold_by_dnode(dnode_t *dn, uint64_t offset,
211 void *tag, dmu_buf_t **dbp, int flags)
212 {
213 int err;
214 int db_flags = DB_RF_CANFAIL;
215
216 if (flags & DMU_READ_NO_PREFETCH)
217 db_flags |= DB_RF_NOPREFETCH;
218 if (flags & DMU_READ_NO_DECRYPT)
219 db_flags |= DB_RF_NO_DECRYPT;
220
221 err = dmu_buf_hold_noread_by_dnode(dn, offset, tag, dbp);
222 if (err == 0) {
223 dmu_buf_impl_t *db = (dmu_buf_impl_t *)(*dbp);
224 err = dbuf_read(db, NULL, db_flags);
225 if (err != 0) {
226 dbuf_rele(db, tag);
227 *dbp = NULL;
228 }
229 }
230
231 return (err);
232 }
233
234 int
dmu_buf_hold(objset_t * os,uint64_t object,uint64_t offset,void * tag,dmu_buf_t ** dbp,int flags)235 dmu_buf_hold(objset_t *os, uint64_t object, uint64_t offset,
236 void *tag, dmu_buf_t **dbp, int flags)
237 {
238 int err;
239 int db_flags = DB_RF_CANFAIL;
240
241 if (flags & DMU_READ_NO_PREFETCH)
242 db_flags |= DB_RF_NOPREFETCH;
243 if (flags & DMU_READ_NO_DECRYPT)
244 db_flags |= DB_RF_NO_DECRYPT;
245
246 err = dmu_buf_hold_noread(os, object, offset, tag, dbp);
247 if (err == 0) {
248 dmu_buf_impl_t *db = (dmu_buf_impl_t *)(*dbp);
249 err = dbuf_read(db, NULL, db_flags);
250 if (err != 0) {
251 dbuf_rele(db, tag);
252 *dbp = NULL;
253 }
254 }
255
256 return (err);
257 }
258
259 int
dmu_bonus_max(void)260 dmu_bonus_max(void)
261 {
262 return (DN_OLD_MAX_BONUSLEN);
263 }
264
265 int
dmu_set_bonus(dmu_buf_t * db_fake,int newsize,dmu_tx_t * tx)266 dmu_set_bonus(dmu_buf_t *db_fake, int newsize, dmu_tx_t *tx)
267 {
268 dmu_buf_impl_t *db = (dmu_buf_impl_t *)db_fake;
269 dnode_t *dn;
270 int error;
271
272 DB_DNODE_ENTER(db);
273 dn = DB_DNODE(db);
274
275 if (dn->dn_bonus != db) {
276 error = SET_ERROR(EINVAL);
277 } else if (newsize < 0 || newsize > db_fake->db_size) {
278 error = SET_ERROR(EINVAL);
279 } else {
280 dnode_setbonuslen(dn, newsize, tx);
281 error = 0;
282 }
283
284 DB_DNODE_EXIT(db);
285 return (error);
286 }
287
288 int
dmu_set_bonustype(dmu_buf_t * db_fake,dmu_object_type_t type,dmu_tx_t * tx)289 dmu_set_bonustype(dmu_buf_t *db_fake, dmu_object_type_t type, dmu_tx_t *tx)
290 {
291 dmu_buf_impl_t *db = (dmu_buf_impl_t *)db_fake;
292 dnode_t *dn;
293 int error;
294
295 DB_DNODE_ENTER(db);
296 dn = DB_DNODE(db);
297
298 if (!DMU_OT_IS_VALID(type)) {
299 error = SET_ERROR(EINVAL);
300 } else if (dn->dn_bonus != db) {
301 error = SET_ERROR(EINVAL);
302 } else {
303 dnode_setbonus_type(dn, type, tx);
304 error = 0;
305 }
306
307 DB_DNODE_EXIT(db);
308 return (error);
309 }
310
311 dmu_object_type_t
dmu_get_bonustype(dmu_buf_t * db_fake)312 dmu_get_bonustype(dmu_buf_t *db_fake)
313 {
314 dmu_buf_impl_t *db = (dmu_buf_impl_t *)db_fake;
315 dnode_t *dn;
316 dmu_object_type_t type;
317
318 DB_DNODE_ENTER(db);
319 dn = DB_DNODE(db);
320 type = dn->dn_bonustype;
321 DB_DNODE_EXIT(db);
322
323 return (type);
324 }
325
326 int
dmu_rm_spill(objset_t * os,uint64_t object,dmu_tx_t * tx)327 dmu_rm_spill(objset_t *os, uint64_t object, dmu_tx_t *tx)
328 {
329 dnode_t *dn;
330 int error;
331
332 error = dnode_hold(os, object, FTAG, &dn);
333 dbuf_rm_spill(dn, tx);
334 rw_enter(&dn->dn_struct_rwlock, RW_WRITER);
335 dnode_rm_spill(dn, tx);
336 rw_exit(&dn->dn_struct_rwlock);
337 dnode_rele(dn, FTAG);
338 return (error);
339 }
340
341 /*
342 * Lookup and hold the bonus buffer for the provided dnode. If the dnode
343 * has not yet been allocated a new bonus dbuf a will be allocated.
344 * Returns ENOENT, EIO, or 0.
345 */
dmu_bonus_hold_by_dnode(dnode_t * dn,void * tag,dmu_buf_t ** dbp,uint32_t flags)346 int dmu_bonus_hold_by_dnode(dnode_t *dn, void *tag, dmu_buf_t **dbp,
347 uint32_t flags)
348 {
349 dmu_buf_impl_t *db;
350 int error;
351 uint32_t db_flags = DB_RF_MUST_SUCCEED;
352
353 if (flags & DMU_READ_NO_PREFETCH)
354 db_flags |= DB_RF_NOPREFETCH;
355 if (flags & DMU_READ_NO_DECRYPT)
356 db_flags |= DB_RF_NO_DECRYPT;
357
358 rw_enter(&dn->dn_struct_rwlock, RW_READER);
359 if (dn->dn_bonus == NULL) {
360 rw_exit(&dn->dn_struct_rwlock);
361 rw_enter(&dn->dn_struct_rwlock, RW_WRITER);
362 if (dn->dn_bonus == NULL)
363 dbuf_create_bonus(dn);
364 }
365 db = dn->dn_bonus;
366
367 /* as long as the bonus buf is held, the dnode will be held */
368 if (zfs_refcount_add(&db->db_holds, tag) == 1) {
369 VERIFY(dnode_add_ref(dn, db));
370 atomic_inc_32(&dn->dn_dbufs_count);
371 }
372
373 /*
374 * Wait to drop dn_struct_rwlock until after adding the bonus dbuf's
375 * hold and incrementing the dbuf count to ensure that dnode_move() sees
376 * a dnode hold for every dbuf.
377 */
378 rw_exit(&dn->dn_struct_rwlock);
379
380 error = dbuf_read(db, NULL, db_flags);
381 if (error) {
382 dnode_evict_bonus(dn);
383 dbuf_rele(db, tag);
384 *dbp = NULL;
385 return (error);
386 }
387
388 *dbp = &db->db;
389 return (0);
390 }
391
392 int
dmu_bonus_hold(objset_t * os,uint64_t object,void * tag,dmu_buf_t ** dbp)393 dmu_bonus_hold(objset_t *os, uint64_t object, void *tag, dmu_buf_t **dbp)
394 {
395 dnode_t *dn;
396 int error;
397
398 error = dnode_hold(os, object, FTAG, &dn);
399 if (error)
400 return (error);
401
402 error = dmu_bonus_hold_by_dnode(dn, tag, dbp, DMU_READ_NO_PREFETCH);
403 dnode_rele(dn, FTAG);
404
405 return (error);
406 }
407
408 /*
409 * returns ENOENT, EIO, or 0.
410 *
411 * This interface will allocate a blank spill dbuf when a spill blk
412 * doesn't already exist on the dnode.
413 *
414 * if you only want to find an already existing spill db, then
415 * dmu_spill_hold_existing() should be used.
416 */
417 int
dmu_spill_hold_by_dnode(dnode_t * dn,uint32_t flags,void * tag,dmu_buf_t ** dbp)418 dmu_spill_hold_by_dnode(dnode_t *dn, uint32_t flags, void *tag, dmu_buf_t **dbp)
419 {
420 dmu_buf_impl_t *db = NULL;
421 int err;
422
423 if ((flags & DB_RF_HAVESTRUCT) == 0)
424 rw_enter(&dn->dn_struct_rwlock, RW_READER);
425
426 db = dbuf_hold(dn, DMU_SPILL_BLKID, tag);
427
428 if ((flags & DB_RF_HAVESTRUCT) == 0)
429 rw_exit(&dn->dn_struct_rwlock);
430
431 if (db == NULL) {
432 *dbp = NULL;
433 return (SET_ERROR(EIO));
434 }
435 err = dbuf_read(db, NULL, flags);
436 if (err == 0)
437 *dbp = &db->db;
438 else {
439 dbuf_rele(db, tag);
440 *dbp = NULL;
441 }
442 return (err);
443 }
444
445 int
dmu_spill_hold_existing(dmu_buf_t * bonus,void * tag,dmu_buf_t ** dbp)446 dmu_spill_hold_existing(dmu_buf_t *bonus, void *tag, dmu_buf_t **dbp)
447 {
448 dmu_buf_impl_t *db = (dmu_buf_impl_t *)bonus;
449 dnode_t *dn;
450 int err;
451
452 DB_DNODE_ENTER(db);
453 dn = DB_DNODE(db);
454
455 if (spa_version(dn->dn_objset->os_spa) < SPA_VERSION_SA) {
456 err = SET_ERROR(EINVAL);
457 } else {
458 rw_enter(&dn->dn_struct_rwlock, RW_READER);
459
460 if (!dn->dn_have_spill) {
461 err = SET_ERROR(ENOENT);
462 } else {
463 err = dmu_spill_hold_by_dnode(dn,
464 DB_RF_HAVESTRUCT | DB_RF_CANFAIL, tag, dbp);
465 }
466
467 rw_exit(&dn->dn_struct_rwlock);
468 }
469
470 DB_DNODE_EXIT(db);
471 return (err);
472 }
473
474 int
dmu_spill_hold_by_bonus(dmu_buf_t * bonus,uint32_t flags,void * tag,dmu_buf_t ** dbp)475 dmu_spill_hold_by_bonus(dmu_buf_t *bonus, uint32_t flags, void *tag,
476 dmu_buf_t **dbp)
477 {
478 dmu_buf_impl_t *db = (dmu_buf_impl_t *)bonus;
479 dnode_t *dn;
480 int err;
481 uint32_t db_flags = DB_RF_CANFAIL;
482
483 if (flags & DMU_READ_NO_DECRYPT)
484 db_flags |= DB_RF_NO_DECRYPT;
485
486 DB_DNODE_ENTER(db);
487 dn = DB_DNODE(db);
488 err = dmu_spill_hold_by_dnode(dn, db_flags, tag, dbp);
489 DB_DNODE_EXIT(db);
490
491 return (err);
492 }
493
494 /*
495 * Note: longer-term, we should modify all of the dmu_buf_*() interfaces
496 * to take a held dnode rather than <os, object> -- the lookup is wasteful,
497 * and can induce severe lock contention when writing to several files
498 * whose dnodes are in the same block.
499 */
500 int
dmu_buf_hold_array_by_dnode(dnode_t * dn,uint64_t offset,uint64_t length,boolean_t read,void * tag,int * numbufsp,dmu_buf_t *** dbpp,uint32_t flags)501 dmu_buf_hold_array_by_dnode(dnode_t *dn, uint64_t offset, uint64_t length,
502 boolean_t read, void *tag, int *numbufsp, dmu_buf_t ***dbpp, uint32_t flags)
503 {
504 dmu_buf_t **dbp;
505 zstream_t *zs = NULL;
506 uint64_t blkid, nblks, i;
507 uint32_t dbuf_flags;
508 int err;
509 zio_t *zio = NULL;
510 boolean_t missed = B_FALSE;
511
512 ASSERT(length <= DMU_MAX_ACCESS);
513
514 /*
515 * Note: We directly notify the prefetch code of this read, so that
516 * we can tell it about the multi-block read. dbuf_read() only knows
517 * about the one block it is accessing.
518 */
519 dbuf_flags = DB_RF_CANFAIL | DB_RF_NEVERWAIT | DB_RF_HAVESTRUCT |
520 DB_RF_NOPREFETCH;
521
522 rw_enter(&dn->dn_struct_rwlock, RW_READER);
523 if (dn->dn_datablkshift) {
524 int blkshift = dn->dn_datablkshift;
525 nblks = (P2ROUNDUP(offset + length, 1ULL << blkshift) -
526 P2ALIGN(offset, 1ULL << blkshift)) >> blkshift;
527 } else {
528 if (offset + length > dn->dn_datablksz) {
529 zfs_panic_recover("zfs: accessing past end of object "
530 "%llx/%llx (size=%u access=%llu+%llu)",
531 (longlong_t)dn->dn_objset->
532 os_dsl_dataset->ds_object,
533 (longlong_t)dn->dn_object, dn->dn_datablksz,
534 (longlong_t)offset, (longlong_t)length);
535 rw_exit(&dn->dn_struct_rwlock);
536 return (SET_ERROR(EIO));
537 }
538 nblks = 1;
539 }
540 dbp = kmem_zalloc(sizeof (dmu_buf_t *) * nblks, KM_SLEEP);
541
542 if (read)
543 zio = zio_root(dn->dn_objset->os_spa, NULL, NULL,
544 ZIO_FLAG_CANFAIL);
545 blkid = dbuf_whichblock(dn, 0, offset);
546 if ((flags & DMU_READ_NO_PREFETCH) == 0 &&
547 DNODE_META_IS_CACHEABLE(dn) && length <= zfetch_array_rd_sz) {
548 /*
549 * Prepare the zfetch before initiating the demand reads, so
550 * that if multiple threads block on same indirect block, we
551 * base predictions on the original less racy request order.
552 */
553 zs = dmu_zfetch_prepare(&dn->dn_zfetch, blkid, nblks,
554 read && DNODE_IS_CACHEABLE(dn), B_TRUE);
555 }
556 for (i = 0; i < nblks; i++) {
557 dmu_buf_impl_t *db = dbuf_hold(dn, blkid + i, tag);
558 if (db == NULL) {
559 if (zs)
560 dmu_zfetch_run(zs, missed, B_TRUE);
561 rw_exit(&dn->dn_struct_rwlock);
562 dmu_buf_rele_array(dbp, nblks, tag);
563 if (read)
564 zio_nowait(zio);
565 return (SET_ERROR(EIO));
566 }
567
568 /*
569 * Initiate async demand data read.
570 * We check the db_state after calling dbuf_read() because
571 * (1) dbuf_read() may change the state to CACHED due to a
572 * hit in the ARC, and (2) on a cache miss, a child will
573 * have been added to "zio" but not yet completed, so the
574 * state will not yet be CACHED.
575 */
576 if (read) {
577 (void) dbuf_read(db, zio, dbuf_flags);
578 if (db->db_state != DB_CACHED)
579 missed = B_TRUE;
580 }
581 dbp[i] = &db->db;
582 }
583
584 if (!read)
585 zfs_racct_write(length, nblks);
586
587 if (zs)
588 dmu_zfetch_run(zs, missed, B_TRUE);
589 rw_exit(&dn->dn_struct_rwlock);
590
591 if (read) {
592 /* wait for async read i/o */
593 err = zio_wait(zio);
594 if (err) {
595 dmu_buf_rele_array(dbp, nblks, tag);
596 return (err);
597 }
598
599 /* wait for other io to complete */
600 for (i = 0; i < nblks; i++) {
601 dmu_buf_impl_t *db = (dmu_buf_impl_t *)dbp[i];
602 mutex_enter(&db->db_mtx);
603 while (db->db_state == DB_READ ||
604 db->db_state == DB_FILL)
605 cv_wait(&db->db_changed, &db->db_mtx);
606 if (db->db_state == DB_UNCACHED)
607 err = SET_ERROR(EIO);
608 mutex_exit(&db->db_mtx);
609 if (err) {
610 dmu_buf_rele_array(dbp, nblks, tag);
611 return (err);
612 }
613 }
614 }
615
616 *numbufsp = nblks;
617 *dbpp = dbp;
618 return (0);
619 }
620
621 static int
dmu_buf_hold_array(objset_t * os,uint64_t object,uint64_t offset,uint64_t length,int read,void * tag,int * numbufsp,dmu_buf_t *** dbpp)622 dmu_buf_hold_array(objset_t *os, uint64_t object, uint64_t offset,
623 uint64_t length, int read, void *tag, int *numbufsp, dmu_buf_t ***dbpp)
624 {
625 dnode_t *dn;
626 int err;
627
628 err = dnode_hold(os, object, FTAG, &dn);
629 if (err)
630 return (err);
631
632 err = dmu_buf_hold_array_by_dnode(dn, offset, length, read, tag,
633 numbufsp, dbpp, DMU_READ_PREFETCH);
634
635 dnode_rele(dn, FTAG);
636
637 return (err);
638 }
639
640 int
dmu_buf_hold_array_by_bonus(dmu_buf_t * db_fake,uint64_t offset,uint64_t length,boolean_t read,void * tag,int * numbufsp,dmu_buf_t *** dbpp)641 dmu_buf_hold_array_by_bonus(dmu_buf_t *db_fake, uint64_t offset,
642 uint64_t length, boolean_t read, void *tag, int *numbufsp,
643 dmu_buf_t ***dbpp)
644 {
645 dmu_buf_impl_t *db = (dmu_buf_impl_t *)db_fake;
646 dnode_t *dn;
647 int err;
648
649 DB_DNODE_ENTER(db);
650 dn = DB_DNODE(db);
651 err = dmu_buf_hold_array_by_dnode(dn, offset, length, read, tag,
652 numbufsp, dbpp, DMU_READ_PREFETCH);
653 DB_DNODE_EXIT(db);
654
655 return (err);
656 }
657
658 void
dmu_buf_rele_array(dmu_buf_t ** dbp_fake,int numbufs,void * tag)659 dmu_buf_rele_array(dmu_buf_t **dbp_fake, int numbufs, void *tag)
660 {
661 int i;
662 dmu_buf_impl_t **dbp = (dmu_buf_impl_t **)dbp_fake;
663
664 if (numbufs == 0)
665 return;
666
667 for (i = 0; i < numbufs; i++) {
668 if (dbp[i])
669 dbuf_rele(dbp[i], tag);
670 }
671
672 kmem_free(dbp, sizeof (dmu_buf_t *) * numbufs);
673 }
674
675 /*
676 * Issue prefetch i/os for the given blocks. If level is greater than 0, the
677 * indirect blocks prefetched will be those that point to the blocks containing
678 * the data starting at offset, and continuing to offset + len.
679 *
680 * Note that if the indirect blocks above the blocks being prefetched are not
681 * in cache, they will be asynchronously read in.
682 */
683 void
dmu_prefetch(objset_t * os,uint64_t object,int64_t level,uint64_t offset,uint64_t len,zio_priority_t pri)684 dmu_prefetch(objset_t *os, uint64_t object, int64_t level, uint64_t offset,
685 uint64_t len, zio_priority_t pri)
686 {
687 dnode_t *dn;
688 uint64_t blkid;
689 int nblks, err;
690
691 if (len == 0) { /* they're interested in the bonus buffer */
692 dn = DMU_META_DNODE(os);
693
694 if (object == 0 || object >= DN_MAX_OBJECT)
695 return;
696
697 rw_enter(&dn->dn_struct_rwlock, RW_READER);
698 blkid = dbuf_whichblock(dn, level,
699 object * sizeof (dnode_phys_t));
700 dbuf_prefetch(dn, level, blkid, pri, 0);
701 rw_exit(&dn->dn_struct_rwlock);
702 return;
703 }
704
705 /*
706 * See comment before the definition of dmu_prefetch_max.
707 */
708 len = MIN(len, dmu_prefetch_max);
709
710 /*
711 * XXX - Note, if the dnode for the requested object is not
712 * already cached, we will do a *synchronous* read in the
713 * dnode_hold() call. The same is true for any indirects.
714 */
715 err = dnode_hold(os, object, FTAG, &dn);
716 if (err != 0)
717 return;
718
719 /*
720 * offset + len - 1 is the last byte we want to prefetch for, and offset
721 * is the first. Then dbuf_whichblk(dn, level, off + len - 1) is the
722 * last block we want to prefetch, and dbuf_whichblock(dn, level,
723 * offset) is the first. Then the number we need to prefetch is the
724 * last - first + 1.
725 */
726 rw_enter(&dn->dn_struct_rwlock, RW_READER);
727 if (level > 0 || dn->dn_datablkshift != 0) {
728 nblks = dbuf_whichblock(dn, level, offset + len - 1) -
729 dbuf_whichblock(dn, level, offset) + 1;
730 } else {
731 nblks = (offset < dn->dn_datablksz);
732 }
733
734 if (nblks != 0) {
735 blkid = dbuf_whichblock(dn, level, offset);
736 for (int i = 0; i < nblks; i++)
737 dbuf_prefetch(dn, level, blkid + i, pri, 0);
738 }
739 rw_exit(&dn->dn_struct_rwlock);
740
741 dnode_rele(dn, FTAG);
742 }
743
744 /*
745 * Get the next "chunk" of file data to free. We traverse the file from
746 * the end so that the file gets shorter over time (if we crashes in the
747 * middle, this will leave us in a better state). We find allocated file
748 * data by simply searching the allocated level 1 indirects.
749 *
750 * On input, *start should be the first offset that does not need to be
751 * freed (e.g. "offset + length"). On return, *start will be the first
752 * offset that should be freed and l1blks is set to the number of level 1
753 * indirect blocks found within the chunk.
754 */
755 static int
get_next_chunk(dnode_t * dn,uint64_t * start,uint64_t minimum,uint64_t * l1blks)756 get_next_chunk(dnode_t *dn, uint64_t *start, uint64_t minimum, uint64_t *l1blks)
757 {
758 uint64_t blks;
759 uint64_t maxblks = DMU_MAX_ACCESS >> (dn->dn_indblkshift + 1);
760 /* bytes of data covered by a level-1 indirect block */
761 uint64_t iblkrange = (uint64_t)dn->dn_datablksz *
762 EPB(dn->dn_indblkshift, SPA_BLKPTRSHIFT);
763
764 ASSERT3U(minimum, <=, *start);
765
766 /*
767 * Check if we can free the entire range assuming that all of the
768 * L1 blocks in this range have data. If we can, we use this
769 * worst case value as an estimate so we can avoid having to look
770 * at the object's actual data.
771 */
772 uint64_t total_l1blks =
773 (roundup(*start, iblkrange) - (minimum / iblkrange * iblkrange)) /
774 iblkrange;
775 if (total_l1blks <= maxblks) {
776 *l1blks = total_l1blks;
777 *start = minimum;
778 return (0);
779 }
780 ASSERT(ISP2(iblkrange));
781
782 for (blks = 0; *start > minimum && blks < maxblks; blks++) {
783 int err;
784
785 /*
786 * dnode_next_offset(BACKWARDS) will find an allocated L1
787 * indirect block at or before the input offset. We must
788 * decrement *start so that it is at the end of the region
789 * to search.
790 */
791 (*start)--;
792
793 err = dnode_next_offset(dn,
794 DNODE_FIND_BACKWARDS, start, 2, 1, 0);
795
796 /* if there are no indirect blocks before start, we are done */
797 if (err == ESRCH) {
798 *start = minimum;
799 break;
800 } else if (err != 0) {
801 *l1blks = blks;
802 return (err);
803 }
804
805 /* set start to the beginning of this L1 indirect */
806 *start = P2ALIGN(*start, iblkrange);
807 }
808 if (*start < minimum)
809 *start = minimum;
810 *l1blks = blks;
811
812 return (0);
813 }
814
815 /*
816 * If this objset is of type OST_ZFS return true if vfs's unmounted flag is set,
817 * otherwise return false.
818 * Used below in dmu_free_long_range_impl() to enable abort when unmounting
819 */
820 static boolean_t
dmu_objset_zfs_unmounting(objset_t * os)821 dmu_objset_zfs_unmounting(objset_t *os)
822 {
823 #ifdef _KERNEL
824 if (dmu_objset_type(os) == DMU_OST_ZFS)
825 return (zfs_get_vfs_flag_unmounted(os));
826 #else
827 (void) os;
828 #endif
829 return (B_FALSE);
830 }
831
832 static int
dmu_free_long_range_impl(objset_t * os,dnode_t * dn,uint64_t offset,uint64_t length)833 dmu_free_long_range_impl(objset_t *os, dnode_t *dn, uint64_t offset,
834 uint64_t length)
835 {
836 uint64_t object_size;
837 int err;
838 uint64_t dirty_frees_threshold;
839 dsl_pool_t *dp = dmu_objset_pool(os);
840
841 if (dn == NULL)
842 return (SET_ERROR(EINVAL));
843
844 object_size = (dn->dn_maxblkid + 1) * dn->dn_datablksz;
845 if (offset >= object_size)
846 return (0);
847
848 if (zfs_per_txg_dirty_frees_percent <= 100)
849 dirty_frees_threshold =
850 zfs_per_txg_dirty_frees_percent * zfs_dirty_data_max / 100;
851 else
852 dirty_frees_threshold = zfs_dirty_data_max / 20;
853
854 if (length == DMU_OBJECT_END || offset + length > object_size)
855 length = object_size - offset;
856
857 while (length != 0) {
858 uint64_t chunk_end, chunk_begin, chunk_len;
859 uint64_t l1blks;
860 dmu_tx_t *tx;
861
862 if (dmu_objset_zfs_unmounting(dn->dn_objset))
863 return (SET_ERROR(EINTR));
864
865 chunk_end = chunk_begin = offset + length;
866
867 /* move chunk_begin backwards to the beginning of this chunk */
868 err = get_next_chunk(dn, &chunk_begin, offset, &l1blks);
869 if (err)
870 return (err);
871 ASSERT3U(chunk_begin, >=, offset);
872 ASSERT3U(chunk_begin, <=, chunk_end);
873
874 chunk_len = chunk_end - chunk_begin;
875
876 tx = dmu_tx_create(os);
877 dmu_tx_hold_free(tx, dn->dn_object, chunk_begin, chunk_len);
878
879 /*
880 * Mark this transaction as typically resulting in a net
881 * reduction in space used.
882 */
883 dmu_tx_mark_netfree(tx);
884 err = dmu_tx_assign(tx, TXG_WAIT);
885 if (err) {
886 dmu_tx_abort(tx);
887 return (err);
888 }
889
890 uint64_t txg = dmu_tx_get_txg(tx);
891
892 mutex_enter(&dp->dp_lock);
893 uint64_t long_free_dirty =
894 dp->dp_long_free_dirty_pertxg[txg & TXG_MASK];
895 mutex_exit(&dp->dp_lock);
896
897 /*
898 * To avoid filling up a TXG with just frees, wait for
899 * the next TXG to open before freeing more chunks if
900 * we have reached the threshold of frees.
901 */
902 if (dirty_frees_threshold != 0 &&
903 long_free_dirty >= dirty_frees_threshold) {
904 DMU_TX_STAT_BUMP(dmu_tx_dirty_frees_delay);
905 dmu_tx_commit(tx);
906 txg_wait_open(dp, 0, B_TRUE);
907 continue;
908 }
909
910 /*
911 * In order to prevent unnecessary write throttling, for each
912 * TXG, we track the cumulative size of L1 blocks being dirtied
913 * in dnode_free_range() below. We compare this number to a
914 * tunable threshold, past which we prevent new L1 dirty freeing
915 * blocks from being added into the open TXG. See
916 * dmu_free_long_range_impl() for details. The threshold
917 * prevents write throttle activation due to dirty freeing L1
918 * blocks taking up a large percentage of zfs_dirty_data_max.
919 */
920 mutex_enter(&dp->dp_lock);
921 dp->dp_long_free_dirty_pertxg[txg & TXG_MASK] +=
922 l1blks << dn->dn_indblkshift;
923 mutex_exit(&dp->dp_lock);
924 DTRACE_PROBE3(free__long__range,
925 uint64_t, long_free_dirty, uint64_t, chunk_len,
926 uint64_t, txg);
927 dnode_free_range(dn, chunk_begin, chunk_len, tx);
928
929 dmu_tx_commit(tx);
930
931 length -= chunk_len;
932 }
933 return (0);
934 }
935
936 int
dmu_free_long_range(objset_t * os,uint64_t object,uint64_t offset,uint64_t length)937 dmu_free_long_range(objset_t *os, uint64_t object,
938 uint64_t offset, uint64_t length)
939 {
940 dnode_t *dn;
941 int err;
942
943 err = dnode_hold(os, object, FTAG, &dn);
944 if (err != 0)
945 return (err);
946 err = dmu_free_long_range_impl(os, dn, offset, length);
947
948 /*
949 * It is important to zero out the maxblkid when freeing the entire
950 * file, so that (a) subsequent calls to dmu_free_long_range_impl()
951 * will take the fast path, and (b) dnode_reallocate() can verify
952 * that the entire file has been freed.
953 */
954 if (err == 0 && offset == 0 && length == DMU_OBJECT_END)
955 dn->dn_maxblkid = 0;
956
957 dnode_rele(dn, FTAG);
958 return (err);
959 }
960
961 int
dmu_free_long_object(objset_t * os,uint64_t object)962 dmu_free_long_object(objset_t *os, uint64_t object)
963 {
964 dmu_tx_t *tx;
965 int err;
966
967 err = dmu_free_long_range(os, object, 0, DMU_OBJECT_END);
968 if (err != 0)
969 return (err);
970
971 tx = dmu_tx_create(os);
972 dmu_tx_hold_bonus(tx, object);
973 dmu_tx_hold_free(tx, object, 0, DMU_OBJECT_END);
974 dmu_tx_mark_netfree(tx);
975 err = dmu_tx_assign(tx, TXG_WAIT);
976 if (err == 0) {
977 if (err == 0)
978 err = dmu_object_free(os, object, tx);
979
980 dmu_tx_commit(tx);
981 } else {
982 dmu_tx_abort(tx);
983 }
984
985 return (err);
986 }
987
988 int
dmu_free_range(objset_t * os,uint64_t object,uint64_t offset,uint64_t size,dmu_tx_t * tx)989 dmu_free_range(objset_t *os, uint64_t object, uint64_t offset,
990 uint64_t size, dmu_tx_t *tx)
991 {
992 dnode_t *dn;
993 int err = dnode_hold(os, object, FTAG, &dn);
994 if (err)
995 return (err);
996 ASSERT(offset < UINT64_MAX);
997 ASSERT(size == DMU_OBJECT_END || size <= UINT64_MAX - offset);
998 dnode_free_range(dn, offset, size, tx);
999 dnode_rele(dn, FTAG);
1000 return (0);
1001 }
1002
1003 static int
dmu_read_impl(dnode_t * dn,uint64_t offset,uint64_t size,void * buf,uint32_t flags)1004 dmu_read_impl(dnode_t *dn, uint64_t offset, uint64_t size,
1005 void *buf, uint32_t flags)
1006 {
1007 dmu_buf_t **dbp;
1008 int numbufs, err = 0;
1009
1010 /*
1011 * Deal with odd block sizes, where there can't be data past the first
1012 * block. If we ever do the tail block optimization, we will need to
1013 * handle that here as well.
1014 */
1015 if (dn->dn_maxblkid == 0) {
1016 uint64_t newsz = offset > dn->dn_datablksz ? 0 :
1017 MIN(size, dn->dn_datablksz - offset);
1018 bzero((char *)buf + newsz, size - newsz);
1019 size = newsz;
1020 }
1021
1022 while (size > 0) {
1023 uint64_t mylen = MIN(size, DMU_MAX_ACCESS / 2);
1024 int i;
1025
1026 /*
1027 * NB: we could do this block-at-a-time, but it's nice
1028 * to be reading in parallel.
1029 */
1030 err = dmu_buf_hold_array_by_dnode(dn, offset, mylen,
1031 TRUE, FTAG, &numbufs, &dbp, flags);
1032 if (err)
1033 break;
1034
1035 for (i = 0; i < numbufs; i++) {
1036 uint64_t tocpy;
1037 int64_t bufoff;
1038 dmu_buf_t *db = dbp[i];
1039
1040 ASSERT(size > 0);
1041
1042 bufoff = offset - db->db_offset;
1043 tocpy = MIN(db->db_size - bufoff, size);
1044
1045 (void) memcpy(buf, (char *)db->db_data + bufoff, tocpy);
1046
1047 offset += tocpy;
1048 size -= tocpy;
1049 buf = (char *)buf + tocpy;
1050 }
1051 dmu_buf_rele_array(dbp, numbufs, FTAG);
1052 }
1053 return (err);
1054 }
1055
1056 int
dmu_read(objset_t * os,uint64_t object,uint64_t offset,uint64_t size,void * buf,uint32_t flags)1057 dmu_read(objset_t *os, uint64_t object, uint64_t offset, uint64_t size,
1058 void *buf, uint32_t flags)
1059 {
1060 dnode_t *dn;
1061 int err;
1062
1063 err = dnode_hold(os, object, FTAG, &dn);
1064 if (err != 0)
1065 return (err);
1066
1067 err = dmu_read_impl(dn, offset, size, buf, flags);
1068 dnode_rele(dn, FTAG);
1069 return (err);
1070 }
1071
1072 int
dmu_read_by_dnode(dnode_t * dn,uint64_t offset,uint64_t size,void * buf,uint32_t flags)1073 dmu_read_by_dnode(dnode_t *dn, uint64_t offset, uint64_t size, void *buf,
1074 uint32_t flags)
1075 {
1076 return (dmu_read_impl(dn, offset, size, buf, flags));
1077 }
1078
1079 static void
dmu_write_impl(dmu_buf_t ** dbp,int numbufs,uint64_t offset,uint64_t size,const void * buf,dmu_tx_t * tx)1080 dmu_write_impl(dmu_buf_t **dbp, int numbufs, uint64_t offset, uint64_t size,
1081 const void *buf, dmu_tx_t *tx)
1082 {
1083 int i;
1084
1085 for (i = 0; i < numbufs; i++) {
1086 uint64_t tocpy;
1087 int64_t bufoff;
1088 dmu_buf_t *db = dbp[i];
1089
1090 ASSERT(size > 0);
1091
1092 bufoff = offset - db->db_offset;
1093 tocpy = MIN(db->db_size - bufoff, size);
1094
1095 ASSERT(i == 0 || i == numbufs-1 || tocpy == db->db_size);
1096
1097 if (tocpy == db->db_size)
1098 dmu_buf_will_fill(db, tx);
1099 else
1100 dmu_buf_will_dirty(db, tx);
1101
1102 (void) memcpy((char *)db->db_data + bufoff, buf, tocpy);
1103
1104 if (tocpy == db->db_size)
1105 dmu_buf_fill_done(db, tx);
1106
1107 offset += tocpy;
1108 size -= tocpy;
1109 buf = (char *)buf + tocpy;
1110 }
1111 }
1112
1113 void
dmu_write(objset_t * os,uint64_t object,uint64_t offset,uint64_t size,const void * buf,dmu_tx_t * tx)1114 dmu_write(objset_t *os, uint64_t object, uint64_t offset, uint64_t size,
1115 const void *buf, dmu_tx_t *tx)
1116 {
1117 dmu_buf_t **dbp;
1118 int numbufs;
1119
1120 if (size == 0)
1121 return;
1122
1123 VERIFY0(dmu_buf_hold_array(os, object, offset, size,
1124 FALSE, FTAG, &numbufs, &dbp));
1125 dmu_write_impl(dbp, numbufs, offset, size, buf, tx);
1126 dmu_buf_rele_array(dbp, numbufs, FTAG);
1127 }
1128
1129 /*
1130 * Note: Lustre is an external consumer of this interface.
1131 */
1132 void
dmu_write_by_dnode(dnode_t * dn,uint64_t offset,uint64_t size,const void * buf,dmu_tx_t * tx)1133 dmu_write_by_dnode(dnode_t *dn, uint64_t offset, uint64_t size,
1134 const void *buf, dmu_tx_t *tx)
1135 {
1136 dmu_buf_t **dbp;
1137 int numbufs;
1138
1139 if (size == 0)
1140 return;
1141
1142 VERIFY0(dmu_buf_hold_array_by_dnode(dn, offset, size,
1143 FALSE, FTAG, &numbufs, &dbp, DMU_READ_PREFETCH));
1144 dmu_write_impl(dbp, numbufs, offset, size, buf, tx);
1145 dmu_buf_rele_array(dbp, numbufs, FTAG);
1146 }
1147
1148 void
dmu_prealloc(objset_t * os,uint64_t object,uint64_t offset,uint64_t size,dmu_tx_t * tx)1149 dmu_prealloc(objset_t *os, uint64_t object, uint64_t offset, uint64_t size,
1150 dmu_tx_t *tx)
1151 {
1152 dmu_buf_t **dbp;
1153 int numbufs, i;
1154
1155 if (size == 0)
1156 return;
1157
1158 VERIFY(0 == dmu_buf_hold_array(os, object, offset, size,
1159 FALSE, FTAG, &numbufs, &dbp));
1160
1161 for (i = 0; i < numbufs; i++) {
1162 dmu_buf_t *db = dbp[i];
1163
1164 dmu_buf_will_not_fill(db, tx);
1165 }
1166 dmu_buf_rele_array(dbp, numbufs, FTAG);
1167 }
1168
1169 void
dmu_write_embedded(objset_t * os,uint64_t object,uint64_t offset,void * data,uint8_t etype,uint8_t comp,int uncompressed_size,int compressed_size,int byteorder,dmu_tx_t * tx)1170 dmu_write_embedded(objset_t *os, uint64_t object, uint64_t offset,
1171 void *data, uint8_t etype, uint8_t comp, int uncompressed_size,
1172 int compressed_size, int byteorder, dmu_tx_t *tx)
1173 {
1174 dmu_buf_t *db;
1175
1176 ASSERT3U(etype, <, NUM_BP_EMBEDDED_TYPES);
1177 ASSERT3U(comp, <, ZIO_COMPRESS_FUNCTIONS);
1178 VERIFY0(dmu_buf_hold_noread(os, object, offset,
1179 FTAG, &db));
1180
1181 dmu_buf_write_embedded(db,
1182 data, (bp_embedded_type_t)etype, (enum zio_compress)comp,
1183 uncompressed_size, compressed_size, byteorder, tx);
1184
1185 dmu_buf_rele(db, FTAG);
1186 }
1187
1188 void
dmu_redact(objset_t * os,uint64_t object,uint64_t offset,uint64_t size,dmu_tx_t * tx)1189 dmu_redact(objset_t *os, uint64_t object, uint64_t offset, uint64_t size,
1190 dmu_tx_t *tx)
1191 {
1192 int numbufs, i;
1193 dmu_buf_t **dbp;
1194
1195 VERIFY0(dmu_buf_hold_array(os, object, offset, size, FALSE, FTAG,
1196 &numbufs, &dbp));
1197 for (i = 0; i < numbufs; i++)
1198 dmu_buf_redact(dbp[i], tx);
1199 dmu_buf_rele_array(dbp, numbufs, FTAG);
1200 }
1201
1202 #ifdef _KERNEL
1203 int
dmu_read_uio_dnode(dnode_t * dn,zfs_uio_t * uio,uint64_t size)1204 dmu_read_uio_dnode(dnode_t *dn, zfs_uio_t *uio, uint64_t size)
1205 {
1206 dmu_buf_t **dbp;
1207 int numbufs, i, err;
1208
1209 /*
1210 * NB: we could do this block-at-a-time, but it's nice
1211 * to be reading in parallel.
1212 */
1213 err = dmu_buf_hold_array_by_dnode(dn, zfs_uio_offset(uio), size,
1214 TRUE, FTAG, &numbufs, &dbp, 0);
1215 if (err)
1216 return (err);
1217
1218 for (i = 0; i < numbufs; i++) {
1219 uint64_t tocpy;
1220 int64_t bufoff;
1221 dmu_buf_t *db = dbp[i];
1222
1223 ASSERT(size > 0);
1224
1225 bufoff = zfs_uio_offset(uio) - db->db_offset;
1226 tocpy = MIN(db->db_size - bufoff, size);
1227
1228 err = zfs_uio_fault_move((char *)db->db_data + bufoff, tocpy,
1229 UIO_READ, uio);
1230
1231 if (err)
1232 break;
1233
1234 size -= tocpy;
1235 }
1236 dmu_buf_rele_array(dbp, numbufs, FTAG);
1237
1238 return (err);
1239 }
1240
1241 /*
1242 * Read 'size' bytes into the uio buffer.
1243 * From object zdb->db_object.
1244 * Starting at zfs_uio_offset(uio).
1245 *
1246 * If the caller already has a dbuf in the target object
1247 * (e.g. its bonus buffer), this routine is faster than dmu_read_uio(),
1248 * because we don't have to find the dnode_t for the object.
1249 */
1250 int
dmu_read_uio_dbuf(dmu_buf_t * zdb,zfs_uio_t * uio,uint64_t size)1251 dmu_read_uio_dbuf(dmu_buf_t *zdb, zfs_uio_t *uio, uint64_t size)
1252 {
1253 dmu_buf_impl_t *db = (dmu_buf_impl_t *)zdb;
1254 dnode_t *dn;
1255 int err;
1256
1257 if (size == 0)
1258 return (0);
1259
1260 DB_DNODE_ENTER(db);
1261 dn = DB_DNODE(db);
1262 err = dmu_read_uio_dnode(dn, uio, size);
1263 DB_DNODE_EXIT(db);
1264
1265 return (err);
1266 }
1267
1268 /*
1269 * Read 'size' bytes into the uio buffer.
1270 * From the specified object
1271 * Starting at offset zfs_uio_offset(uio).
1272 */
1273 int
dmu_read_uio(objset_t * os,uint64_t object,zfs_uio_t * uio,uint64_t size)1274 dmu_read_uio(objset_t *os, uint64_t object, zfs_uio_t *uio, uint64_t size)
1275 {
1276 dnode_t *dn;
1277 int err;
1278
1279 if (size == 0)
1280 return (0);
1281
1282 err = dnode_hold(os, object, FTAG, &dn);
1283 if (err)
1284 return (err);
1285
1286 err = dmu_read_uio_dnode(dn, uio, size);
1287
1288 dnode_rele(dn, FTAG);
1289
1290 return (err);
1291 }
1292
1293 int
dmu_write_uio_dnode(dnode_t * dn,zfs_uio_t * uio,uint64_t size,dmu_tx_t * tx)1294 dmu_write_uio_dnode(dnode_t *dn, zfs_uio_t *uio, uint64_t size, dmu_tx_t *tx)
1295 {
1296 dmu_buf_t **dbp;
1297 int numbufs;
1298 int err = 0;
1299 int i;
1300
1301 err = dmu_buf_hold_array_by_dnode(dn, zfs_uio_offset(uio), size,
1302 FALSE, FTAG, &numbufs, &dbp, DMU_READ_PREFETCH);
1303 if (err)
1304 return (err);
1305
1306 for (i = 0; i < numbufs; i++) {
1307 uint64_t tocpy;
1308 int64_t bufoff;
1309 dmu_buf_t *db = dbp[i];
1310
1311 ASSERT(size > 0);
1312
1313 bufoff = zfs_uio_offset(uio) - db->db_offset;
1314 tocpy = MIN(db->db_size - bufoff, size);
1315
1316 ASSERT(i == 0 || i == numbufs-1 || tocpy == db->db_size);
1317
1318 if (tocpy == db->db_size)
1319 dmu_buf_will_fill(db, tx);
1320 else
1321 dmu_buf_will_dirty(db, tx);
1322
1323 /*
1324 * XXX zfs_uiomove could block forever (eg.nfs-backed
1325 * pages). There needs to be a uiolockdown() function
1326 * to lock the pages in memory, so that zfs_uiomove won't
1327 * block.
1328 */
1329 err = zfs_uio_fault_move((char *)db->db_data + bufoff,
1330 tocpy, UIO_WRITE, uio);
1331
1332 if (tocpy == db->db_size)
1333 dmu_buf_fill_done(db, tx);
1334
1335 if (err)
1336 break;
1337
1338 size -= tocpy;
1339 }
1340
1341 dmu_buf_rele_array(dbp, numbufs, FTAG);
1342 return (err);
1343 }
1344
1345 /*
1346 * Write 'size' bytes from the uio buffer.
1347 * To object zdb->db_object.
1348 * Starting at offset zfs_uio_offset(uio).
1349 *
1350 * If the caller already has a dbuf in the target object
1351 * (e.g. its bonus buffer), this routine is faster than dmu_write_uio(),
1352 * because we don't have to find the dnode_t for the object.
1353 */
1354 int
dmu_write_uio_dbuf(dmu_buf_t * zdb,zfs_uio_t * uio,uint64_t size,dmu_tx_t * tx)1355 dmu_write_uio_dbuf(dmu_buf_t *zdb, zfs_uio_t *uio, uint64_t size,
1356 dmu_tx_t *tx)
1357 {
1358 dmu_buf_impl_t *db = (dmu_buf_impl_t *)zdb;
1359 dnode_t *dn;
1360 int err;
1361
1362 if (size == 0)
1363 return (0);
1364
1365 DB_DNODE_ENTER(db);
1366 dn = DB_DNODE(db);
1367 err = dmu_write_uio_dnode(dn, uio, size, tx);
1368 DB_DNODE_EXIT(db);
1369
1370 return (err);
1371 }
1372
1373 /*
1374 * Write 'size' bytes from the uio buffer.
1375 * To the specified object.
1376 * Starting at offset zfs_uio_offset(uio).
1377 */
1378 int
dmu_write_uio(objset_t * os,uint64_t object,zfs_uio_t * uio,uint64_t size,dmu_tx_t * tx)1379 dmu_write_uio(objset_t *os, uint64_t object, zfs_uio_t *uio, uint64_t size,
1380 dmu_tx_t *tx)
1381 {
1382 dnode_t *dn;
1383 int err;
1384
1385 if (size == 0)
1386 return (0);
1387
1388 err = dnode_hold(os, object, FTAG, &dn);
1389 if (err)
1390 return (err);
1391
1392 err = dmu_write_uio_dnode(dn, uio, size, tx);
1393
1394 dnode_rele(dn, FTAG);
1395
1396 return (err);
1397 }
1398 #endif /* _KERNEL */
1399
1400 /*
1401 * Allocate a loaned anonymous arc buffer.
1402 */
1403 arc_buf_t *
dmu_request_arcbuf(dmu_buf_t * handle,int size)1404 dmu_request_arcbuf(dmu_buf_t *handle, int size)
1405 {
1406 dmu_buf_impl_t *db = (dmu_buf_impl_t *)handle;
1407
1408 return (arc_loan_buf(db->db_objset->os_spa, B_FALSE, size));
1409 }
1410
1411 /*
1412 * Free a loaned arc buffer.
1413 */
1414 void
dmu_return_arcbuf(arc_buf_t * buf)1415 dmu_return_arcbuf(arc_buf_t *buf)
1416 {
1417 arc_return_buf(buf, FTAG);
1418 arc_buf_destroy(buf, FTAG);
1419 }
1420
1421 /*
1422 * A "lightweight" write is faster than a regular write (e.g.
1423 * dmu_write_by_dnode() or dmu_assign_arcbuf_by_dnode()), because it avoids the
1424 * CPU cost of creating a dmu_buf_impl_t and arc_buf_[hdr_]_t. However, the
1425 * data can not be read or overwritten until the transaction's txg has been
1426 * synced. This makes it appropriate for workloads that are known to be
1427 * (temporarily) write-only, like "zfs receive".
1428 *
1429 * A single block is written, starting at the specified offset in bytes. If
1430 * the call is successful, it returns 0 and the provided abd has been
1431 * consumed (the caller should not free it).
1432 */
1433 int
dmu_lightweight_write_by_dnode(dnode_t * dn,uint64_t offset,abd_t * abd,const zio_prop_t * zp,enum zio_flag flags,dmu_tx_t * tx)1434 dmu_lightweight_write_by_dnode(dnode_t *dn, uint64_t offset, abd_t *abd,
1435 const zio_prop_t *zp, enum zio_flag flags, dmu_tx_t *tx)
1436 {
1437 dbuf_dirty_record_t *dr =
1438 dbuf_dirty_lightweight(dn, dbuf_whichblock(dn, 0, offset), tx);
1439 if (dr == NULL)
1440 return (SET_ERROR(EIO));
1441 dr->dt.dll.dr_abd = abd;
1442 dr->dt.dll.dr_props = *zp;
1443 dr->dt.dll.dr_flags = flags;
1444 return (0);
1445 }
1446
1447 /*
1448 * When possible directly assign passed loaned arc buffer to a dbuf.
1449 * If this is not possible copy the contents of passed arc buf via
1450 * dmu_write().
1451 */
1452 int
dmu_assign_arcbuf_by_dnode(dnode_t * dn,uint64_t offset,arc_buf_t * buf,dmu_tx_t * tx)1453 dmu_assign_arcbuf_by_dnode(dnode_t *dn, uint64_t offset, arc_buf_t *buf,
1454 dmu_tx_t *tx)
1455 {
1456 dmu_buf_impl_t *db;
1457 objset_t *os = dn->dn_objset;
1458 uint64_t object = dn->dn_object;
1459 uint32_t blksz = (uint32_t)arc_buf_lsize(buf);
1460 uint64_t blkid;
1461
1462 rw_enter(&dn->dn_struct_rwlock, RW_READER);
1463 blkid = dbuf_whichblock(dn, 0, offset);
1464 db = dbuf_hold(dn, blkid, FTAG);
1465 if (db == NULL)
1466 return (SET_ERROR(EIO));
1467 rw_exit(&dn->dn_struct_rwlock);
1468
1469 /*
1470 * We can only assign if the offset is aligned and the arc buf is the
1471 * same size as the dbuf.
1472 */
1473 if (offset == db->db.db_offset && blksz == db->db.db_size) {
1474 zfs_racct_write(blksz, 1);
1475 dbuf_assign_arcbuf(db, buf, tx);
1476 dbuf_rele(db, FTAG);
1477 } else {
1478 /* compressed bufs must always be assignable to their dbuf */
1479 ASSERT3U(arc_get_compression(buf), ==, ZIO_COMPRESS_OFF);
1480 ASSERT(!(buf->b_flags & ARC_BUF_FLAG_COMPRESSED));
1481
1482 dbuf_rele(db, FTAG);
1483 dmu_write(os, object, offset, blksz, buf->b_data, tx);
1484 dmu_return_arcbuf(buf);
1485 }
1486
1487 return (0);
1488 }
1489
1490 int
dmu_assign_arcbuf_by_dbuf(dmu_buf_t * handle,uint64_t offset,arc_buf_t * buf,dmu_tx_t * tx)1491 dmu_assign_arcbuf_by_dbuf(dmu_buf_t *handle, uint64_t offset, arc_buf_t *buf,
1492 dmu_tx_t *tx)
1493 {
1494 int err;
1495 dmu_buf_impl_t *dbuf = (dmu_buf_impl_t *)handle;
1496
1497 DB_DNODE_ENTER(dbuf);
1498 err = dmu_assign_arcbuf_by_dnode(DB_DNODE(dbuf), offset, buf, tx);
1499 DB_DNODE_EXIT(dbuf);
1500
1501 return (err);
1502 }
1503
1504 typedef struct {
1505 dbuf_dirty_record_t *dsa_dr;
1506 dmu_sync_cb_t *dsa_done;
1507 zgd_t *dsa_zgd;
1508 dmu_tx_t *dsa_tx;
1509 } dmu_sync_arg_t;
1510
1511 static void
dmu_sync_ready(zio_t * zio,arc_buf_t * buf,void * varg)1512 dmu_sync_ready(zio_t *zio, arc_buf_t *buf, void *varg)
1513 {
1514 (void) buf;
1515 dmu_sync_arg_t *dsa = varg;
1516 dmu_buf_t *db = dsa->dsa_zgd->zgd_db;
1517 blkptr_t *bp = zio->io_bp;
1518
1519 if (zio->io_error == 0) {
1520 if (BP_IS_HOLE(bp)) {
1521 /*
1522 * A block of zeros may compress to a hole, but the
1523 * block size still needs to be known for replay.
1524 */
1525 BP_SET_LSIZE(bp, db->db_size);
1526 } else if (!BP_IS_EMBEDDED(bp)) {
1527 ASSERT(BP_GET_LEVEL(bp) == 0);
1528 BP_SET_FILL(bp, 1);
1529 }
1530 }
1531 }
1532
1533 static void
dmu_sync_late_arrival_ready(zio_t * zio)1534 dmu_sync_late_arrival_ready(zio_t *zio)
1535 {
1536 dmu_sync_ready(zio, NULL, zio->io_private);
1537 }
1538
1539 static void
dmu_sync_done(zio_t * zio,arc_buf_t * buf,void * varg)1540 dmu_sync_done(zio_t *zio, arc_buf_t *buf, void *varg)
1541 {
1542 (void) buf;
1543 dmu_sync_arg_t *dsa = varg;
1544 dbuf_dirty_record_t *dr = dsa->dsa_dr;
1545 dmu_buf_impl_t *db = dr->dr_dbuf;
1546 zgd_t *zgd = dsa->dsa_zgd;
1547
1548 /*
1549 * Record the vdev(s) backing this blkptr so they can be flushed after
1550 * the writes for the lwb have completed.
1551 */
1552 if (zio->io_error == 0) {
1553 zil_lwb_add_block(zgd->zgd_lwb, zgd->zgd_bp);
1554 }
1555
1556 mutex_enter(&db->db_mtx);
1557 ASSERT(dr->dt.dl.dr_override_state == DR_IN_DMU_SYNC);
1558 if (zio->io_error == 0) {
1559 dr->dt.dl.dr_nopwrite = !!(zio->io_flags & ZIO_FLAG_NOPWRITE);
1560 if (dr->dt.dl.dr_nopwrite) {
1561 blkptr_t *bp = zio->io_bp;
1562 blkptr_t *bp_orig = &zio->io_bp_orig;
1563 uint8_t chksum = BP_GET_CHECKSUM(bp_orig);
1564
1565 ASSERT(BP_EQUAL(bp, bp_orig));
1566 VERIFY(BP_EQUAL(bp, db->db_blkptr));
1567 ASSERT(zio->io_prop.zp_compress != ZIO_COMPRESS_OFF);
1568 VERIFY(zio_checksum_table[chksum].ci_flags &
1569 ZCHECKSUM_FLAG_NOPWRITE);
1570 }
1571 dr->dt.dl.dr_overridden_by = *zio->io_bp;
1572 dr->dt.dl.dr_override_state = DR_OVERRIDDEN;
1573 dr->dt.dl.dr_copies = zio->io_prop.zp_copies;
1574
1575 /*
1576 * Old style holes are filled with all zeros, whereas
1577 * new-style holes maintain their lsize, type, level,
1578 * and birth time (see zio_write_compress). While we
1579 * need to reset the BP_SET_LSIZE() call that happened
1580 * in dmu_sync_ready for old style holes, we do *not*
1581 * want to wipe out the information contained in new
1582 * style holes. Thus, only zero out the block pointer if
1583 * it's an old style hole.
1584 */
1585 if (BP_IS_HOLE(&dr->dt.dl.dr_overridden_by) &&
1586 dr->dt.dl.dr_overridden_by.blk_birth == 0)
1587 BP_ZERO(&dr->dt.dl.dr_overridden_by);
1588 } else {
1589 dr->dt.dl.dr_override_state = DR_NOT_OVERRIDDEN;
1590 }
1591 cv_broadcast(&db->db_changed);
1592 mutex_exit(&db->db_mtx);
1593
1594 dsa->dsa_done(dsa->dsa_zgd, zio->io_error);
1595
1596 kmem_free(dsa, sizeof (*dsa));
1597 }
1598
1599 static void
dmu_sync_late_arrival_done(zio_t * zio)1600 dmu_sync_late_arrival_done(zio_t *zio)
1601 {
1602 blkptr_t *bp = zio->io_bp;
1603 dmu_sync_arg_t *dsa = zio->io_private;
1604 zgd_t *zgd = dsa->dsa_zgd;
1605
1606 if (zio->io_error == 0) {
1607 /*
1608 * Record the vdev(s) backing this blkptr so they can be
1609 * flushed after the writes for the lwb have completed.
1610 */
1611 zil_lwb_add_block(zgd->zgd_lwb, zgd->zgd_bp);
1612
1613 if (!BP_IS_HOLE(bp)) {
1614 blkptr_t *bp_orig __maybe_unused = &zio->io_bp_orig;
1615 ASSERT(!(zio->io_flags & ZIO_FLAG_NOPWRITE));
1616 ASSERT(BP_IS_HOLE(bp_orig) || !BP_EQUAL(bp, bp_orig));
1617 ASSERT(zio->io_bp->blk_birth == zio->io_txg);
1618 ASSERT(zio->io_txg > spa_syncing_txg(zio->io_spa));
1619 zio_free(zio->io_spa, zio->io_txg, zio->io_bp);
1620 }
1621 }
1622
1623 dmu_tx_commit(dsa->dsa_tx);
1624
1625 dsa->dsa_done(dsa->dsa_zgd, zio->io_error);
1626
1627 abd_free(zio->io_abd);
1628 kmem_free(dsa, sizeof (*dsa));
1629 }
1630
1631 static int
dmu_sync_late_arrival(zio_t * pio,objset_t * os,dmu_sync_cb_t * done,zgd_t * zgd,zio_prop_t * zp,zbookmark_phys_t * zb)1632 dmu_sync_late_arrival(zio_t *pio, objset_t *os, dmu_sync_cb_t *done, zgd_t *zgd,
1633 zio_prop_t *zp, zbookmark_phys_t *zb)
1634 {
1635 dmu_sync_arg_t *dsa;
1636 dmu_tx_t *tx;
1637
1638 tx = dmu_tx_create(os);
1639 dmu_tx_hold_space(tx, zgd->zgd_db->db_size);
1640 if (dmu_tx_assign(tx, TXG_WAIT) != 0) {
1641 dmu_tx_abort(tx);
1642 /* Make zl_get_data do txg_waited_synced() */
1643 return (SET_ERROR(EIO));
1644 }
1645
1646 /*
1647 * In order to prevent the zgd's lwb from being free'd prior to
1648 * dmu_sync_late_arrival_done() being called, we have to ensure
1649 * the lwb's "max txg" takes this tx's txg into account.
1650 */
1651 zil_lwb_add_txg(zgd->zgd_lwb, dmu_tx_get_txg(tx));
1652
1653 dsa = kmem_alloc(sizeof (dmu_sync_arg_t), KM_SLEEP);
1654 dsa->dsa_dr = NULL;
1655 dsa->dsa_done = done;
1656 dsa->dsa_zgd = zgd;
1657 dsa->dsa_tx = tx;
1658
1659 /*
1660 * Since we are currently syncing this txg, it's nontrivial to
1661 * determine what BP to nopwrite against, so we disable nopwrite.
1662 *
1663 * When syncing, the db_blkptr is initially the BP of the previous
1664 * txg. We can not nopwrite against it because it will be changed
1665 * (this is similar to the non-late-arrival case where the dbuf is
1666 * dirty in a future txg).
1667 *
1668 * Then dbuf_write_ready() sets bp_blkptr to the location we will write.
1669 * We can not nopwrite against it because although the BP will not
1670 * (typically) be changed, the data has not yet been persisted to this
1671 * location.
1672 *
1673 * Finally, when dbuf_write_done() is called, it is theoretically
1674 * possible to always nopwrite, because the data that was written in
1675 * this txg is the same data that we are trying to write. However we
1676 * would need to check that this dbuf is not dirty in any future
1677 * txg's (as we do in the normal dmu_sync() path). For simplicity, we
1678 * don't nopwrite in this case.
1679 */
1680 zp->zp_nopwrite = B_FALSE;
1681
1682 zio_nowait(zio_write(pio, os->os_spa, dmu_tx_get_txg(tx), zgd->zgd_bp,
1683 abd_get_from_buf(zgd->zgd_db->db_data, zgd->zgd_db->db_size),
1684 zgd->zgd_db->db_size, zgd->zgd_db->db_size, zp,
1685 dmu_sync_late_arrival_ready, NULL, NULL, dmu_sync_late_arrival_done,
1686 dsa, ZIO_PRIORITY_SYNC_WRITE, ZIO_FLAG_CANFAIL, zb));
1687
1688 return (0);
1689 }
1690
1691 /*
1692 * Intent log support: sync the block associated with db to disk.
1693 * N.B. and XXX: the caller is responsible for making sure that the
1694 * data isn't changing while dmu_sync() is writing it.
1695 *
1696 * Return values:
1697 *
1698 * EEXIST: this txg has already been synced, so there's nothing to do.
1699 * The caller should not log the write.
1700 *
1701 * ENOENT: the block was dbuf_free_range()'d, so there's nothing to do.
1702 * The caller should not log the write.
1703 *
1704 * EALREADY: this block is already in the process of being synced.
1705 * The caller should track its progress (somehow).
1706 *
1707 * EIO: could not do the I/O.
1708 * The caller should do a txg_wait_synced().
1709 *
1710 * 0: the I/O has been initiated.
1711 * The caller should log this blkptr in the done callback.
1712 * It is possible that the I/O will fail, in which case
1713 * the error will be reported to the done callback and
1714 * propagated to pio from zio_done().
1715 */
1716 int
dmu_sync(zio_t * pio,uint64_t txg,dmu_sync_cb_t * done,zgd_t * zgd)1717 dmu_sync(zio_t *pio, uint64_t txg, dmu_sync_cb_t *done, zgd_t *zgd)
1718 {
1719 dmu_buf_impl_t *db = (dmu_buf_impl_t *)zgd->zgd_db;
1720 objset_t *os = db->db_objset;
1721 dsl_dataset_t *ds = os->os_dsl_dataset;
1722 dbuf_dirty_record_t *dr, *dr_next;
1723 dmu_sync_arg_t *dsa;
1724 zbookmark_phys_t zb;
1725 zio_prop_t zp;
1726 dnode_t *dn;
1727
1728 ASSERT(pio != NULL);
1729 ASSERT(txg != 0);
1730
1731 SET_BOOKMARK(&zb, ds->ds_object,
1732 db->db.db_object, db->db_level, db->db_blkid);
1733
1734 DB_DNODE_ENTER(db);
1735 dn = DB_DNODE(db);
1736 dmu_write_policy(os, dn, db->db_level, WP_DMU_SYNC, &zp);
1737 DB_DNODE_EXIT(db);
1738
1739 /*
1740 * If we're frozen (running ziltest), we always need to generate a bp.
1741 */
1742 if (txg > spa_freeze_txg(os->os_spa))
1743 return (dmu_sync_late_arrival(pio, os, done, zgd, &zp, &zb));
1744
1745 /*
1746 * Grabbing db_mtx now provides a barrier between dbuf_sync_leaf()
1747 * and us. If we determine that this txg is not yet syncing,
1748 * but it begins to sync a moment later, that's OK because the
1749 * sync thread will block in dbuf_sync_leaf() until we drop db_mtx.
1750 */
1751 mutex_enter(&db->db_mtx);
1752
1753 if (txg <= spa_last_synced_txg(os->os_spa)) {
1754 /*
1755 * This txg has already synced. There's nothing to do.
1756 */
1757 mutex_exit(&db->db_mtx);
1758 return (SET_ERROR(EEXIST));
1759 }
1760
1761 if (txg <= spa_syncing_txg(os->os_spa)) {
1762 /*
1763 * This txg is currently syncing, so we can't mess with
1764 * the dirty record anymore; just write a new log block.
1765 */
1766 mutex_exit(&db->db_mtx);
1767 return (dmu_sync_late_arrival(pio, os, done, zgd, &zp, &zb));
1768 }
1769
1770 dr = dbuf_find_dirty_eq(db, txg);
1771
1772 if (dr == NULL) {
1773 /*
1774 * There's no dr for this dbuf, so it must have been freed.
1775 * There's no need to log writes to freed blocks, so we're done.
1776 */
1777 mutex_exit(&db->db_mtx);
1778 return (SET_ERROR(ENOENT));
1779 }
1780
1781 dr_next = list_next(&db->db_dirty_records, dr);
1782 ASSERT(dr_next == NULL || dr_next->dr_txg < txg);
1783
1784 if (db->db_blkptr != NULL) {
1785 /*
1786 * We need to fill in zgd_bp with the current blkptr so that
1787 * the nopwrite code can check if we're writing the same
1788 * data that's already on disk. We can only nopwrite if we
1789 * are sure that after making the copy, db_blkptr will not
1790 * change until our i/o completes. We ensure this by
1791 * holding the db_mtx, and only allowing nopwrite if the
1792 * block is not already dirty (see below). This is verified
1793 * by dmu_sync_done(), which VERIFYs that the db_blkptr has
1794 * not changed.
1795 */
1796 *zgd->zgd_bp = *db->db_blkptr;
1797 }
1798
1799 /*
1800 * Assume the on-disk data is X, the current syncing data (in
1801 * txg - 1) is Y, and the current in-memory data is Z (currently
1802 * in dmu_sync).
1803 *
1804 * We usually want to perform a nopwrite if X and Z are the
1805 * same. However, if Y is different (i.e. the BP is going to
1806 * change before this write takes effect), then a nopwrite will
1807 * be incorrect - we would override with X, which could have
1808 * been freed when Y was written.
1809 *
1810 * (Note that this is not a concern when we are nop-writing from
1811 * syncing context, because X and Y must be identical, because
1812 * all previous txgs have been synced.)
1813 *
1814 * Therefore, we disable nopwrite if the current BP could change
1815 * before this TXG. There are two ways it could change: by
1816 * being dirty (dr_next is non-NULL), or by being freed
1817 * (dnode_block_freed()). This behavior is verified by
1818 * zio_done(), which VERIFYs that the override BP is identical
1819 * to the on-disk BP.
1820 */
1821 DB_DNODE_ENTER(db);
1822 dn = DB_DNODE(db);
1823 if (dr_next != NULL || dnode_block_freed(dn, db->db_blkid))
1824 zp.zp_nopwrite = B_FALSE;
1825 DB_DNODE_EXIT(db);
1826
1827 ASSERT(dr->dr_txg == txg);
1828 if (dr->dt.dl.dr_override_state == DR_IN_DMU_SYNC ||
1829 dr->dt.dl.dr_override_state == DR_OVERRIDDEN) {
1830 /*
1831 * We have already issued a sync write for this buffer,
1832 * or this buffer has already been synced. It could not
1833 * have been dirtied since, or we would have cleared the state.
1834 */
1835 mutex_exit(&db->db_mtx);
1836 return (SET_ERROR(EALREADY));
1837 }
1838
1839 ASSERT(dr->dt.dl.dr_override_state == DR_NOT_OVERRIDDEN);
1840 dr->dt.dl.dr_override_state = DR_IN_DMU_SYNC;
1841 mutex_exit(&db->db_mtx);
1842
1843 dsa = kmem_alloc(sizeof (dmu_sync_arg_t), KM_SLEEP);
1844 dsa->dsa_dr = dr;
1845 dsa->dsa_done = done;
1846 dsa->dsa_zgd = zgd;
1847 dsa->dsa_tx = NULL;
1848
1849 zio_nowait(arc_write(pio, os->os_spa, txg,
1850 zgd->zgd_bp, dr->dt.dl.dr_data, dbuf_is_l2cacheable(db),
1851 &zp, dmu_sync_ready, NULL, NULL, dmu_sync_done, dsa,
1852 ZIO_PRIORITY_SYNC_WRITE, ZIO_FLAG_CANFAIL, &zb));
1853
1854 return (0);
1855 }
1856
1857 int
dmu_object_set_nlevels(objset_t * os,uint64_t object,int nlevels,dmu_tx_t * tx)1858 dmu_object_set_nlevels(objset_t *os, uint64_t object, int nlevels, dmu_tx_t *tx)
1859 {
1860 dnode_t *dn;
1861 int err;
1862
1863 err = dnode_hold(os, object, FTAG, &dn);
1864 if (err)
1865 return (err);
1866 err = dnode_set_nlevels(dn, nlevels, tx);
1867 dnode_rele(dn, FTAG);
1868 return (err);
1869 }
1870
1871 int
dmu_object_set_blocksize(objset_t * os,uint64_t object,uint64_t size,int ibs,dmu_tx_t * tx)1872 dmu_object_set_blocksize(objset_t *os, uint64_t object, uint64_t size, int ibs,
1873 dmu_tx_t *tx)
1874 {
1875 dnode_t *dn;
1876 int err;
1877
1878 err = dnode_hold(os, object, FTAG, &dn);
1879 if (err)
1880 return (err);
1881 err = dnode_set_blksz(dn, size, ibs, tx);
1882 dnode_rele(dn, FTAG);
1883 return (err);
1884 }
1885
1886 int
dmu_object_set_maxblkid(objset_t * os,uint64_t object,uint64_t maxblkid,dmu_tx_t * tx)1887 dmu_object_set_maxblkid(objset_t *os, uint64_t object, uint64_t maxblkid,
1888 dmu_tx_t *tx)
1889 {
1890 dnode_t *dn;
1891 int err;
1892
1893 err = dnode_hold(os, object, FTAG, &dn);
1894 if (err)
1895 return (err);
1896 rw_enter(&dn->dn_struct_rwlock, RW_WRITER);
1897 dnode_new_blkid(dn, maxblkid, tx, B_FALSE, B_TRUE);
1898 rw_exit(&dn->dn_struct_rwlock);
1899 dnode_rele(dn, FTAG);
1900 return (0);
1901 }
1902
1903 void
dmu_object_set_checksum(objset_t * os,uint64_t object,uint8_t checksum,dmu_tx_t * tx)1904 dmu_object_set_checksum(objset_t *os, uint64_t object, uint8_t checksum,
1905 dmu_tx_t *tx)
1906 {
1907 dnode_t *dn;
1908
1909 /*
1910 * Send streams include each object's checksum function. This
1911 * check ensures that the receiving system can understand the
1912 * checksum function transmitted.
1913 */
1914 ASSERT3U(checksum, <, ZIO_CHECKSUM_LEGACY_FUNCTIONS);
1915
1916 VERIFY0(dnode_hold(os, object, FTAG, &dn));
1917 ASSERT3U(checksum, <, ZIO_CHECKSUM_FUNCTIONS);
1918 dn->dn_checksum = checksum;
1919 dnode_setdirty(dn, tx);
1920 dnode_rele(dn, FTAG);
1921 }
1922
1923 void
dmu_object_set_compress(objset_t * os,uint64_t object,uint8_t compress,dmu_tx_t * tx)1924 dmu_object_set_compress(objset_t *os, uint64_t object, uint8_t compress,
1925 dmu_tx_t *tx)
1926 {
1927 dnode_t *dn;
1928
1929 /*
1930 * Send streams include each object's compression function. This
1931 * check ensures that the receiving system can understand the
1932 * compression function transmitted.
1933 */
1934 ASSERT3U(compress, <, ZIO_COMPRESS_LEGACY_FUNCTIONS);
1935
1936 VERIFY0(dnode_hold(os, object, FTAG, &dn));
1937 dn->dn_compress = compress;
1938 dnode_setdirty(dn, tx);
1939 dnode_rele(dn, FTAG);
1940 }
1941
1942 /*
1943 * When the "redundant_metadata" property is set to "most", only indirect
1944 * blocks of this level and higher will have an additional ditto block.
1945 */
1946 int zfs_redundant_metadata_most_ditto_level = 2;
1947
1948 void
dmu_write_policy(objset_t * os,dnode_t * dn,int level,int wp,zio_prop_t * zp)1949 dmu_write_policy(objset_t *os, dnode_t *dn, int level, int wp, zio_prop_t *zp)
1950 {
1951 dmu_object_type_t type = dn ? dn->dn_type : DMU_OT_OBJSET;
1952 boolean_t ismd = (level > 0 || DMU_OT_IS_METADATA(type) ||
1953 (wp & WP_SPILL));
1954 enum zio_checksum checksum = os->os_checksum;
1955 enum zio_compress compress = os->os_compress;
1956 uint8_t complevel = os->os_complevel;
1957 enum zio_checksum dedup_checksum = os->os_dedup_checksum;
1958 boolean_t dedup = B_FALSE;
1959 boolean_t nopwrite = B_FALSE;
1960 boolean_t dedup_verify = os->os_dedup_verify;
1961 boolean_t encrypt = B_FALSE;
1962 int copies = os->os_copies;
1963
1964 /*
1965 * We maintain different write policies for each of the following
1966 * types of data:
1967 * 1. metadata
1968 * 2. preallocated blocks (i.e. level-0 blocks of a dump device)
1969 * 3. all other level 0 blocks
1970 */
1971 if (ismd) {
1972 /*
1973 * XXX -- we should design a compression algorithm
1974 * that specializes in arrays of bps.
1975 */
1976 compress = zio_compress_select(os->os_spa,
1977 ZIO_COMPRESS_ON, ZIO_COMPRESS_ON);
1978
1979 /*
1980 * Metadata always gets checksummed. If the data
1981 * checksum is multi-bit correctable, and it's not a
1982 * ZBT-style checksum, then it's suitable for metadata
1983 * as well. Otherwise, the metadata checksum defaults
1984 * to fletcher4.
1985 */
1986 if (!(zio_checksum_table[checksum].ci_flags &
1987 ZCHECKSUM_FLAG_METADATA) ||
1988 (zio_checksum_table[checksum].ci_flags &
1989 ZCHECKSUM_FLAG_EMBEDDED))
1990 checksum = ZIO_CHECKSUM_FLETCHER_4;
1991
1992 switch (os->os_redundant_metadata) {
1993 case ZFS_REDUNDANT_METADATA_ALL:
1994 copies++;
1995 break;
1996 case ZFS_REDUNDANT_METADATA_MOST:
1997 if (level >= zfs_redundant_metadata_most_ditto_level ||
1998 DMU_OT_IS_METADATA(type) || (wp & WP_SPILL))
1999 copies++;
2000 break;
2001 case ZFS_REDUNDANT_METADATA_SOME:
2002 if (DMU_OT_IS_CRITICAL(type))
2003 copies++;
2004 break;
2005 case ZFS_REDUNDANT_METADATA_NONE:
2006 break;
2007 }
2008 } else if (wp & WP_NOFILL) {
2009 ASSERT(level == 0);
2010
2011 /*
2012 * If we're writing preallocated blocks, we aren't actually
2013 * writing them so don't set any policy properties. These
2014 * blocks are currently only used by an external subsystem
2015 * outside of zfs (i.e. dump) and not written by the zio
2016 * pipeline.
2017 */
2018 compress = ZIO_COMPRESS_OFF;
2019 checksum = ZIO_CHECKSUM_OFF;
2020 } else {
2021 compress = zio_compress_select(os->os_spa, dn->dn_compress,
2022 compress);
2023 complevel = zio_complevel_select(os->os_spa, compress,
2024 complevel, complevel);
2025
2026 checksum = (dedup_checksum == ZIO_CHECKSUM_OFF) ?
2027 zio_checksum_select(dn->dn_checksum, checksum) :
2028 dedup_checksum;
2029
2030 /*
2031 * Determine dedup setting. If we are in dmu_sync(),
2032 * we won't actually dedup now because that's all
2033 * done in syncing context; but we do want to use the
2034 * dedup checksum. If the checksum is not strong
2035 * enough to ensure unique signatures, force
2036 * dedup_verify.
2037 */
2038 if (dedup_checksum != ZIO_CHECKSUM_OFF) {
2039 dedup = (wp & WP_DMU_SYNC) ? B_FALSE : B_TRUE;
2040 if (!(zio_checksum_table[checksum].ci_flags &
2041 ZCHECKSUM_FLAG_DEDUP))
2042 dedup_verify = B_TRUE;
2043 }
2044
2045 /*
2046 * Enable nopwrite if we have secure enough checksum
2047 * algorithm (see comment in zio_nop_write) and
2048 * compression is enabled. We don't enable nopwrite if
2049 * dedup is enabled as the two features are mutually
2050 * exclusive.
2051 */
2052 nopwrite = (!dedup && (zio_checksum_table[checksum].ci_flags &
2053 ZCHECKSUM_FLAG_NOPWRITE) &&
2054 compress != ZIO_COMPRESS_OFF && zfs_nopwrite_enabled);
2055 }
2056
2057 /*
2058 * All objects in an encrypted objset are protected from modification
2059 * via a MAC. Encrypted objects store their IV and salt in the last DVA
2060 * in the bp, so we cannot use all copies. Encrypted objects are also
2061 * not subject to nopwrite since writing the same data will still
2062 * result in a new ciphertext. Only encrypted blocks can be dedup'd
2063 * to avoid ambiguity in the dedup code since the DDT does not store
2064 * object types.
2065 */
2066 if (os->os_encrypted && (wp & WP_NOFILL) == 0) {
2067 encrypt = B_TRUE;
2068
2069 if (DMU_OT_IS_ENCRYPTED(type)) {
2070 copies = MIN(copies, SPA_DVAS_PER_BP - 1);
2071 nopwrite = B_FALSE;
2072 } else {
2073 dedup = B_FALSE;
2074 }
2075
2076 if (level <= 0 &&
2077 (type == DMU_OT_DNODE || type == DMU_OT_OBJSET)) {
2078 compress = ZIO_COMPRESS_EMPTY;
2079 }
2080 }
2081
2082 zp->zp_compress = compress;
2083 zp->zp_complevel = complevel;
2084 zp->zp_checksum = checksum;
2085 zp->zp_type = (wp & WP_SPILL) ? dn->dn_bonustype : type;
2086 zp->zp_level = level;
2087 zp->zp_copies = MIN(copies, spa_max_replication(os->os_spa));
2088 zp->zp_dedup = dedup;
2089 zp->zp_dedup_verify = dedup && dedup_verify;
2090 zp->zp_nopwrite = nopwrite;
2091 zp->zp_encrypt = encrypt;
2092 zp->zp_byteorder = ZFS_HOST_BYTEORDER;
2093 bzero(zp->zp_salt, ZIO_DATA_SALT_LEN);
2094 bzero(zp->zp_iv, ZIO_DATA_IV_LEN);
2095 bzero(zp->zp_mac, ZIO_DATA_MAC_LEN);
2096 zp->zp_zpl_smallblk = DMU_OT_IS_FILE(zp->zp_type) ?
2097 os->os_zpl_special_smallblock : 0;
2098
2099 ASSERT3U(zp->zp_compress, !=, ZIO_COMPRESS_INHERIT);
2100 }
2101
2102 /*
2103 * Reports the location of data and holes in an object. In order to
2104 * accurately report holes all dirty data must be synced to disk. This
2105 * causes extremely poor performance when seeking for holes in a dirty file.
2106 * As a compromise, only provide hole data when the dnode is clean. When
2107 * a dnode is dirty report the dnode as having no holes by returning EBUSY
2108 * which is always safe to do.
2109 */
2110 int
dmu_offset_next(objset_t * os,uint64_t object,boolean_t hole,uint64_t * off)2111 dmu_offset_next(objset_t *os, uint64_t object, boolean_t hole, uint64_t *off)
2112 {
2113 dnode_t *dn;
2114 int restarted = 0, err;
2115
2116 restart:
2117 err = dnode_hold(os, object, FTAG, &dn);
2118 if (err)
2119 return (err);
2120
2121 rw_enter(&dn->dn_struct_rwlock, RW_READER);
2122
2123 if (dnode_is_dirty(dn)) {
2124 /*
2125 * If the zfs_dmu_offset_next_sync module option is enabled
2126 * then hole reporting has been requested. Dirty dnodes
2127 * must be synced to disk to accurately report holes.
2128 *
2129 * Provided a RL_READER rangelock spanning 0-UINT64_MAX is
2130 * held by the caller only a single restart will be required.
2131 * We tolerate callers which do not hold the rangelock by
2132 * returning EBUSY and not reporting holes after one restart.
2133 */
2134 if (zfs_dmu_offset_next_sync) {
2135 rw_exit(&dn->dn_struct_rwlock);
2136 dnode_rele(dn, FTAG);
2137
2138 if (restarted)
2139 return (SET_ERROR(EBUSY));
2140
2141 txg_wait_synced(dmu_objset_pool(os), 0);
2142 restarted = 1;
2143 goto restart;
2144 }
2145
2146 err = SET_ERROR(EBUSY);
2147 } else {
2148 err = dnode_next_offset(dn, DNODE_FIND_HAVELOCK |
2149 (hole ? DNODE_FIND_HOLE : 0), off, 1, 1, 0);
2150 }
2151
2152 rw_exit(&dn->dn_struct_rwlock);
2153 dnode_rele(dn, FTAG);
2154
2155 return (err);
2156 }
2157
2158 void
__dmu_object_info_from_dnode(dnode_t * dn,dmu_object_info_t * doi)2159 __dmu_object_info_from_dnode(dnode_t *dn, dmu_object_info_t *doi)
2160 {
2161 dnode_phys_t *dnp = dn->dn_phys;
2162
2163 doi->doi_data_block_size = dn->dn_datablksz;
2164 doi->doi_metadata_block_size = dn->dn_indblkshift ?
2165 1ULL << dn->dn_indblkshift : 0;
2166 doi->doi_type = dn->dn_type;
2167 doi->doi_bonus_type = dn->dn_bonustype;
2168 doi->doi_bonus_size = dn->dn_bonuslen;
2169 doi->doi_dnodesize = dn->dn_num_slots << DNODE_SHIFT;
2170 doi->doi_indirection = dn->dn_nlevels;
2171 doi->doi_checksum = dn->dn_checksum;
2172 doi->doi_compress = dn->dn_compress;
2173 doi->doi_nblkptr = dn->dn_nblkptr;
2174 doi->doi_physical_blocks_512 = (DN_USED_BYTES(dnp) + 256) >> 9;
2175 doi->doi_max_offset = (dn->dn_maxblkid + 1) * dn->dn_datablksz;
2176 doi->doi_fill_count = 0;
2177 for (int i = 0; i < dnp->dn_nblkptr; i++)
2178 doi->doi_fill_count += BP_GET_FILL(&dnp->dn_blkptr[i]);
2179 }
2180
2181 void
dmu_object_info_from_dnode(dnode_t * dn,dmu_object_info_t * doi)2182 dmu_object_info_from_dnode(dnode_t *dn, dmu_object_info_t *doi)
2183 {
2184 rw_enter(&dn->dn_struct_rwlock, RW_READER);
2185 mutex_enter(&dn->dn_mtx);
2186
2187 __dmu_object_info_from_dnode(dn, doi);
2188
2189 mutex_exit(&dn->dn_mtx);
2190 rw_exit(&dn->dn_struct_rwlock);
2191 }
2192
2193 /*
2194 * Get information on a DMU object.
2195 * If doi is NULL, just indicates whether the object exists.
2196 */
2197 int
dmu_object_info(objset_t * os,uint64_t object,dmu_object_info_t * doi)2198 dmu_object_info(objset_t *os, uint64_t object, dmu_object_info_t *doi)
2199 {
2200 dnode_t *dn;
2201 int err = dnode_hold(os, object, FTAG, &dn);
2202
2203 if (err)
2204 return (err);
2205
2206 if (doi != NULL)
2207 dmu_object_info_from_dnode(dn, doi);
2208
2209 dnode_rele(dn, FTAG);
2210 return (0);
2211 }
2212
2213 /*
2214 * As above, but faster; can be used when you have a held dbuf in hand.
2215 */
2216 void
dmu_object_info_from_db(dmu_buf_t * db_fake,dmu_object_info_t * doi)2217 dmu_object_info_from_db(dmu_buf_t *db_fake, dmu_object_info_t *doi)
2218 {
2219 dmu_buf_impl_t *db = (dmu_buf_impl_t *)db_fake;
2220
2221 DB_DNODE_ENTER(db);
2222 dmu_object_info_from_dnode(DB_DNODE(db), doi);
2223 DB_DNODE_EXIT(db);
2224 }
2225
2226 /*
2227 * Faster still when you only care about the size.
2228 */
2229 void
dmu_object_size_from_db(dmu_buf_t * db_fake,uint32_t * blksize,u_longlong_t * nblk512)2230 dmu_object_size_from_db(dmu_buf_t *db_fake, uint32_t *blksize,
2231 u_longlong_t *nblk512)
2232 {
2233 dmu_buf_impl_t *db = (dmu_buf_impl_t *)db_fake;
2234 dnode_t *dn;
2235
2236 DB_DNODE_ENTER(db);
2237 dn = DB_DNODE(db);
2238
2239 *blksize = dn->dn_datablksz;
2240 /* add in number of slots used for the dnode itself */
2241 *nblk512 = ((DN_USED_BYTES(dn->dn_phys) + SPA_MINBLOCKSIZE/2) >>
2242 SPA_MINBLOCKSHIFT) + dn->dn_num_slots;
2243 DB_DNODE_EXIT(db);
2244 }
2245
2246 void
dmu_object_dnsize_from_db(dmu_buf_t * db_fake,int * dnsize)2247 dmu_object_dnsize_from_db(dmu_buf_t *db_fake, int *dnsize)
2248 {
2249 dmu_buf_impl_t *db = (dmu_buf_impl_t *)db_fake;
2250 dnode_t *dn;
2251
2252 DB_DNODE_ENTER(db);
2253 dn = DB_DNODE(db);
2254 *dnsize = dn->dn_num_slots << DNODE_SHIFT;
2255 DB_DNODE_EXIT(db);
2256 }
2257
2258 void
byteswap_uint64_array(void * vbuf,size_t size)2259 byteswap_uint64_array(void *vbuf, size_t size)
2260 {
2261 uint64_t *buf = vbuf;
2262 size_t count = size >> 3;
2263 int i;
2264
2265 ASSERT((size & 7) == 0);
2266
2267 for (i = 0; i < count; i++)
2268 buf[i] = BSWAP_64(buf[i]);
2269 }
2270
2271 void
byteswap_uint32_array(void * vbuf,size_t size)2272 byteswap_uint32_array(void *vbuf, size_t size)
2273 {
2274 uint32_t *buf = vbuf;
2275 size_t count = size >> 2;
2276 int i;
2277
2278 ASSERT((size & 3) == 0);
2279
2280 for (i = 0; i < count; i++)
2281 buf[i] = BSWAP_32(buf[i]);
2282 }
2283
2284 void
byteswap_uint16_array(void * vbuf,size_t size)2285 byteswap_uint16_array(void *vbuf, size_t size)
2286 {
2287 uint16_t *buf = vbuf;
2288 size_t count = size >> 1;
2289 int i;
2290
2291 ASSERT((size & 1) == 0);
2292
2293 for (i = 0; i < count; i++)
2294 buf[i] = BSWAP_16(buf[i]);
2295 }
2296
2297 void
byteswap_uint8_array(void * vbuf,size_t size)2298 byteswap_uint8_array(void *vbuf, size_t size)
2299 {
2300 (void) vbuf, (void) size;
2301 }
2302
2303 void
dmu_init(void)2304 dmu_init(void)
2305 {
2306 abd_init();
2307 zfs_dbgmsg_init();
2308 sa_cache_init();
2309 dmu_objset_init();
2310 dnode_init();
2311 zfetch_init();
2312 dmu_tx_init();
2313 l2arc_init();
2314 arc_init();
2315 dbuf_init();
2316 }
2317
2318 void
dmu_fini(void)2319 dmu_fini(void)
2320 {
2321 arc_fini(); /* arc depends on l2arc, so arc must go first */
2322 l2arc_fini();
2323 dmu_tx_fini();
2324 zfetch_fini();
2325 dbuf_fini();
2326 dnode_fini();
2327 dmu_objset_fini();
2328 sa_cache_fini();
2329 zfs_dbgmsg_fini();
2330 abd_fini();
2331 }
2332
2333 EXPORT_SYMBOL(dmu_bonus_hold);
2334 EXPORT_SYMBOL(dmu_bonus_hold_by_dnode);
2335 EXPORT_SYMBOL(dmu_buf_hold_array_by_bonus);
2336 EXPORT_SYMBOL(dmu_buf_rele_array);
2337 EXPORT_SYMBOL(dmu_prefetch);
2338 EXPORT_SYMBOL(dmu_free_range);
2339 EXPORT_SYMBOL(dmu_free_long_range);
2340 EXPORT_SYMBOL(dmu_free_long_object);
2341 EXPORT_SYMBOL(dmu_read);
2342 EXPORT_SYMBOL(dmu_read_by_dnode);
2343 EXPORT_SYMBOL(dmu_write);
2344 EXPORT_SYMBOL(dmu_write_by_dnode);
2345 EXPORT_SYMBOL(dmu_prealloc);
2346 EXPORT_SYMBOL(dmu_object_info);
2347 EXPORT_SYMBOL(dmu_object_info_from_dnode);
2348 EXPORT_SYMBOL(dmu_object_info_from_db);
2349 EXPORT_SYMBOL(dmu_object_size_from_db);
2350 EXPORT_SYMBOL(dmu_object_dnsize_from_db);
2351 EXPORT_SYMBOL(dmu_object_set_nlevels);
2352 EXPORT_SYMBOL(dmu_object_set_blocksize);
2353 EXPORT_SYMBOL(dmu_object_set_maxblkid);
2354 EXPORT_SYMBOL(dmu_object_set_checksum);
2355 EXPORT_SYMBOL(dmu_object_set_compress);
2356 EXPORT_SYMBOL(dmu_offset_next);
2357 EXPORT_SYMBOL(dmu_write_policy);
2358 EXPORT_SYMBOL(dmu_sync);
2359 EXPORT_SYMBOL(dmu_request_arcbuf);
2360 EXPORT_SYMBOL(dmu_return_arcbuf);
2361 EXPORT_SYMBOL(dmu_assign_arcbuf_by_dnode);
2362 EXPORT_SYMBOL(dmu_assign_arcbuf_by_dbuf);
2363 EXPORT_SYMBOL(dmu_buf_hold);
2364 EXPORT_SYMBOL(dmu_ot);
2365
2366 /* BEGIN CSTYLED */
2367 ZFS_MODULE_PARAM(zfs, zfs_, nopwrite_enabled, INT, ZMOD_RW,
2368 "Enable NOP writes");
2369
2370 ZFS_MODULE_PARAM(zfs, zfs_, per_txg_dirty_frees_percent, ULONG, ZMOD_RW,
2371 "Percentage of dirtied blocks from frees in one TXG");
2372
2373 ZFS_MODULE_PARAM(zfs, zfs_, dmu_offset_next_sync, INT, ZMOD_RW,
2374 "Enable forcing txg sync to find holes");
2375
2376 ZFS_MODULE_PARAM(zfs, , dmu_prefetch_max, INT, ZMOD_RW,
2377 "Limit one prefetch call to this size");
2378 /* END CSTYLED */
2379