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