]> git.proxmox.com Git - mirror_zfs.git/blame - module/zfs/dmu.c
Illumos #3996
[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.
2e528b49 23 * Copyright (c) 2013 by Delphix. All rights reserved.
3a17a7a9 24 * Copyright (c) 2013 by Saso Kiselkov. All rights reserved.
34dc7c2f
BB
25 */
26
34dc7c2f
BB
27#include <sys/dmu.h>
28#include <sys/dmu_impl.h>
29#include <sys/dmu_tx.h>
30#include <sys/dbuf.h>
31#include <sys/dnode.h>
32#include <sys/zfs_context.h>
33#include <sys/dmu_objset.h>
34#include <sys/dmu_traverse.h>
35#include <sys/dsl_dataset.h>
36#include <sys/dsl_dir.h>
37#include <sys/dsl_pool.h>
38#include <sys/dsl_synctask.h>
39#include <sys/dsl_prop.h>
40#include <sys/dmu_zfetch.h>
41#include <sys/zfs_ioctl.h>
42#include <sys/zap.h>
43#include <sys/zio_checksum.h>
03c6040b 44#include <sys/zio_compress.h>
428870ff 45#include <sys/sa.h>
34dc7c2f
BB
46#ifdef _KERNEL
47#include <sys/vmsystm.h>
b128c09f 48#include <sys/zfs_znode.h>
34dc7c2f
BB
49#endif
50
03c6040b
GW
51/*
52 * Enable/disable nopwrite feature.
53 */
54int zfs_nopwrite_enabled = 1;
55
34dc7c2f 56const dmu_object_type_info_t dmu_ot[DMU_OT_NUMTYPES] = {
9ae529ec
CS
57 { DMU_BSWAP_UINT8, TRUE, "unallocated" },
58 { DMU_BSWAP_ZAP, TRUE, "object directory" },
59 { DMU_BSWAP_UINT64, TRUE, "object array" },
60 { DMU_BSWAP_UINT8, TRUE, "packed nvlist" },
61 { DMU_BSWAP_UINT64, TRUE, "packed nvlist size" },
62 { DMU_BSWAP_UINT64, TRUE, "bpobj" },
63 { DMU_BSWAP_UINT64, TRUE, "bpobj header" },
64 { DMU_BSWAP_UINT64, TRUE, "SPA space map header" },
65 { DMU_BSWAP_UINT64, TRUE, "SPA space map" },
66 { DMU_BSWAP_UINT64, TRUE, "ZIL intent log" },
67 { DMU_BSWAP_DNODE, TRUE, "DMU dnode" },
68 { DMU_BSWAP_OBJSET, TRUE, "DMU objset" },
69 { DMU_BSWAP_UINT64, TRUE, "DSL directory" },
70 { DMU_BSWAP_ZAP, TRUE, "DSL directory child map"},
71 { DMU_BSWAP_ZAP, TRUE, "DSL dataset snap map" },
72 { DMU_BSWAP_ZAP, TRUE, "DSL props" },
73 { DMU_BSWAP_UINT64, TRUE, "DSL dataset" },
74 { DMU_BSWAP_ZNODE, TRUE, "ZFS znode" },
75 { DMU_BSWAP_OLDACL, TRUE, "ZFS V0 ACL" },
76 { DMU_BSWAP_UINT8, FALSE, "ZFS plain file" },
77 { DMU_BSWAP_ZAP, TRUE, "ZFS directory" },
78 { DMU_BSWAP_ZAP, TRUE, "ZFS master node" },
79 { DMU_BSWAP_ZAP, TRUE, "ZFS delete queue" },
80 { DMU_BSWAP_UINT8, FALSE, "zvol object" },
81 { DMU_BSWAP_ZAP, TRUE, "zvol prop" },
82 { DMU_BSWAP_UINT8, FALSE, "other uint8[]" },
83 { DMU_BSWAP_UINT64, FALSE, "other uint64[]" },
84 { DMU_BSWAP_ZAP, TRUE, "other ZAP" },
85 { DMU_BSWAP_ZAP, TRUE, "persistent error log" },
86 { DMU_BSWAP_UINT8, TRUE, "SPA history" },
87 { DMU_BSWAP_UINT64, TRUE, "SPA history offsets" },
88 { DMU_BSWAP_ZAP, TRUE, "Pool properties" },
89 { DMU_BSWAP_ZAP, TRUE, "DSL permissions" },
90 { DMU_BSWAP_ACL, TRUE, "ZFS ACL" },
91 { DMU_BSWAP_UINT8, TRUE, "ZFS SYSACL" },
92 { DMU_BSWAP_UINT8, TRUE, "FUID table" },
93 { DMU_BSWAP_UINT64, TRUE, "FUID table size" },
94 { DMU_BSWAP_ZAP, TRUE, "DSL dataset next clones"},
95 { DMU_BSWAP_ZAP, TRUE, "scan work queue" },
96 { DMU_BSWAP_ZAP, TRUE, "ZFS user/group used" },
97 { DMU_BSWAP_ZAP, TRUE, "ZFS user/group quota" },
98 { DMU_BSWAP_ZAP, TRUE, "snapshot refcount tags"},
99 { DMU_BSWAP_ZAP, TRUE, "DDT ZAP algorithm" },
100 { DMU_BSWAP_ZAP, TRUE, "DDT statistics" },
101 { DMU_BSWAP_UINT8, TRUE, "System attributes" },
102 { DMU_BSWAP_ZAP, TRUE, "SA master node" },
103 { DMU_BSWAP_ZAP, TRUE, "SA attr registration" },
104 { DMU_BSWAP_ZAP, TRUE, "SA attr layouts" },
105 { DMU_BSWAP_ZAP, TRUE, "scan translations" },
106 { DMU_BSWAP_UINT8, FALSE, "deduplicated block" },
107 { DMU_BSWAP_ZAP, TRUE, "DSL deadlist map" },
108 { DMU_BSWAP_UINT64, TRUE, "DSL deadlist map hdr" },
109 { DMU_BSWAP_ZAP, TRUE, "DSL dir clones" },
110 { DMU_BSWAP_UINT64, TRUE, "bpobj subobj" }
111};
112
113const dmu_object_byteswap_info_t dmu_ot_byteswap[DMU_BSWAP_NUMFUNCS] = {
114 { byteswap_uint8_array, "uint8" },
115 { byteswap_uint16_array, "uint16" },
116 { byteswap_uint32_array, "uint32" },
117 { byteswap_uint64_array, "uint64" },
118 { zap_byteswap, "zap" },
119 { dnode_buf_byteswap, "dnode" },
120 { dmu_objset_byteswap, "objset" },
121 { zfs_znode_byteswap, "znode" },
122 { zfs_oldacl_byteswap, "oldacl" },
123 { zfs_acl_byteswap, "acl" }
34dc7c2f
BB
124};
125
126int
127dmu_buf_hold(objset_t *os, uint64_t object, uint64_t offset,
428870ff 128 void *tag, dmu_buf_t **dbp, int flags)
34dc7c2f
BB
129{
130 dnode_t *dn;
131 uint64_t blkid;
132 dmu_buf_impl_t *db;
133 int err;
428870ff 134 int db_flags = DB_RF_CANFAIL;
34dc7c2f 135
428870ff
BB
136 if (flags & DMU_READ_NO_PREFETCH)
137 db_flags |= DB_RF_NOPREFETCH;
138
139 err = dnode_hold(os, object, FTAG, &dn);
34dc7c2f
BB
140 if (err)
141 return (err);
142 blkid = dbuf_whichblock(dn, offset);
143 rw_enter(&dn->dn_struct_rwlock, RW_READER);
144 db = dbuf_hold(dn, blkid, tag);
145 rw_exit(&dn->dn_struct_rwlock);
146 if (db == NULL) {
2e528b49 147 err = SET_ERROR(EIO);
34dc7c2f 148 } else {
428870ff 149 err = dbuf_read(db, NULL, db_flags);
34dc7c2f
BB
150 if (err) {
151 dbuf_rele(db, tag);
152 db = NULL;
153 }
154 }
155
156 dnode_rele(dn, FTAG);
572e2857 157 *dbp = &db->db; /* NULL db plus first field offset is NULL */
34dc7c2f
BB
158 return (err);
159}
160
161int
162dmu_bonus_max(void)
163{
164 return (DN_MAX_BONUSLEN);
165}
166
167int
572e2857 168dmu_set_bonus(dmu_buf_t *db_fake, int newsize, dmu_tx_t *tx)
34dc7c2f 169{
572e2857
BB
170 dmu_buf_impl_t *db = (dmu_buf_impl_t *)db_fake;
171 dnode_t *dn;
172 int error;
34dc7c2f 173
572e2857
BB
174 DB_DNODE_ENTER(db);
175 dn = DB_DNODE(db);
176
177 if (dn->dn_bonus != db) {
2e528b49 178 error = SET_ERROR(EINVAL);
572e2857 179 } else if (newsize < 0 || newsize > db_fake->db_size) {
2e528b49 180 error = SET_ERROR(EINVAL);
572e2857
BB
181 } else {
182 dnode_setbonuslen(dn, newsize, tx);
183 error = 0;
184 }
185
186 DB_DNODE_EXIT(db);
187 return (error);
34dc7c2f
BB
188}
189
428870ff 190int
572e2857 191dmu_set_bonustype(dmu_buf_t *db_fake, dmu_object_type_t type, dmu_tx_t *tx)
428870ff 192{
572e2857
BB
193 dmu_buf_impl_t *db = (dmu_buf_impl_t *)db_fake;
194 dnode_t *dn;
195 int error;
428870ff 196
572e2857
BB
197 DB_DNODE_ENTER(db);
198 dn = DB_DNODE(db);
428870ff 199
9ae529ec 200 if (!DMU_OT_IS_VALID(type)) {
2e528b49 201 error = SET_ERROR(EINVAL);
572e2857 202 } else if (dn->dn_bonus != db) {
2e528b49 203 error = SET_ERROR(EINVAL);
572e2857
BB
204 } else {
205 dnode_setbonus_type(dn, type, tx);
206 error = 0;
207 }
428870ff 208
572e2857
BB
209 DB_DNODE_EXIT(db);
210 return (error);
211}
212
213dmu_object_type_t
214dmu_get_bonustype(dmu_buf_t *db_fake)
215{
216 dmu_buf_impl_t *db = (dmu_buf_impl_t *)db_fake;
217 dnode_t *dn;
218 dmu_object_type_t type;
219
220 DB_DNODE_ENTER(db);
221 dn = DB_DNODE(db);
222 type = dn->dn_bonustype;
223 DB_DNODE_EXIT(db);
224
225 return (type);
428870ff
BB
226}
227
228int
229dmu_rm_spill(objset_t *os, uint64_t object, dmu_tx_t *tx)
230{
231 dnode_t *dn;
232 int error;
233
234 error = dnode_hold(os, object, FTAG, &dn);
235 dbuf_rm_spill(dn, tx);
236 rw_enter(&dn->dn_struct_rwlock, RW_WRITER);
237 dnode_rm_spill(dn, tx);
238 rw_exit(&dn->dn_struct_rwlock);
239 dnode_rele(dn, FTAG);
240 return (error);
241}
242
34dc7c2f
BB
243/*
244 * returns ENOENT, EIO, or 0.
245 */
246int
247dmu_bonus_hold(objset_t *os, uint64_t object, void *tag, dmu_buf_t **dbp)
248{
249 dnode_t *dn;
250 dmu_buf_impl_t *db;
251 int error;
252
428870ff 253 error = dnode_hold(os, object, FTAG, &dn);
34dc7c2f
BB
254 if (error)
255 return (error);
256
257 rw_enter(&dn->dn_struct_rwlock, RW_READER);
258 if (dn->dn_bonus == NULL) {
259 rw_exit(&dn->dn_struct_rwlock);
260 rw_enter(&dn->dn_struct_rwlock, RW_WRITER);
261 if (dn->dn_bonus == NULL)
262 dbuf_create_bonus(dn);
263 }
264 db = dn->dn_bonus;
34dc7c2f
BB
265
266 /* as long as the bonus buf is held, the dnode will be held */
572e2857 267 if (refcount_add(&db->db_holds, tag) == 1) {
34dc7c2f 268 VERIFY(dnode_add_ref(dn, db));
572e2857
BB
269 (void) atomic_inc_32_nv(&dn->dn_dbufs_count);
270 }
271
272 /*
273 * Wait to drop dn_struct_rwlock until after adding the bonus dbuf's
274 * hold and incrementing the dbuf count to ensure that dnode_move() sees
275 * a dnode hold for every dbuf.
276 */
277 rw_exit(&dn->dn_struct_rwlock);
34dc7c2f
BB
278
279 dnode_rele(dn, FTAG);
280
428870ff 281 VERIFY(0 == dbuf_read(db, NULL, DB_RF_MUST_SUCCEED | DB_RF_NOPREFETCH));
34dc7c2f
BB
282
283 *dbp = &db->db;
284 return (0);
285}
286
428870ff
BB
287/*
288 * returns ENOENT, EIO, or 0.
289 *
290 * This interface will allocate a blank spill dbuf when a spill blk
291 * doesn't already exist on the dnode.
292 *
293 * if you only want to find an already existing spill db, then
294 * dmu_spill_hold_existing() should be used.
295 */
296int
297dmu_spill_hold_by_dnode(dnode_t *dn, uint32_t flags, void *tag, dmu_buf_t **dbp)
298{
299 dmu_buf_impl_t *db = NULL;
300 int err;
301
302 if ((flags & DB_RF_HAVESTRUCT) == 0)
303 rw_enter(&dn->dn_struct_rwlock, RW_READER);
304
305 db = dbuf_hold(dn, DMU_SPILL_BLKID, tag);
306
307 if ((flags & DB_RF_HAVESTRUCT) == 0)
308 rw_exit(&dn->dn_struct_rwlock);
309
310 ASSERT(db != NULL);
572e2857
BB
311 err = dbuf_read(db, NULL, flags);
312 if (err == 0)
313 *dbp = &db->db;
314 else
315 dbuf_rele(db, tag);
428870ff
BB
316 return (err);
317}
318
319int
320dmu_spill_hold_existing(dmu_buf_t *bonus, void *tag, dmu_buf_t **dbp)
321{
572e2857
BB
322 dmu_buf_impl_t *db = (dmu_buf_impl_t *)bonus;
323 dnode_t *dn;
428870ff
BB
324 int err;
325
572e2857
BB
326 DB_DNODE_ENTER(db);
327 dn = DB_DNODE(db);
328
329 if (spa_version(dn->dn_objset->os_spa) < SPA_VERSION_SA) {
2e528b49 330 err = SET_ERROR(EINVAL);
572e2857
BB
331 } else {
332 rw_enter(&dn->dn_struct_rwlock, RW_READER);
333
334 if (!dn->dn_have_spill) {
2e528b49 335 err = SET_ERROR(ENOENT);
572e2857
BB
336 } else {
337 err = dmu_spill_hold_by_dnode(dn,
338 DB_RF_HAVESTRUCT | DB_RF_CANFAIL, tag, dbp);
339 }
428870ff 340
428870ff 341 rw_exit(&dn->dn_struct_rwlock);
428870ff 342 }
572e2857
BB
343
344 DB_DNODE_EXIT(db);
428870ff
BB
345 return (err);
346}
347
348int
349dmu_spill_hold_by_bonus(dmu_buf_t *bonus, void *tag, dmu_buf_t **dbp)
350{
572e2857
BB
351 dmu_buf_impl_t *db = (dmu_buf_impl_t *)bonus;
352 dnode_t *dn;
353 int err;
354
355 DB_DNODE_ENTER(db);
356 dn = DB_DNODE(db);
357 err = dmu_spill_hold_by_dnode(dn, DB_RF_CANFAIL, tag, dbp);
358 DB_DNODE_EXIT(db);
359
360 return (err);
428870ff
BB
361}
362
34dc7c2f
BB
363/*
364 * Note: longer-term, we should modify all of the dmu_buf_*() interfaces
365 * to take a held dnode rather than <os, object> -- the lookup is wasteful,
366 * and can induce severe lock contention when writing to several files
367 * whose dnodes are in the same block.
368 */
369static int
9babb374
BB
370dmu_buf_hold_array_by_dnode(dnode_t *dn, uint64_t offset, uint64_t length,
371 int read, void *tag, int *numbufsp, dmu_buf_t ***dbpp, uint32_t flags)
34dc7c2f 372{
b128c09f 373 dsl_pool_t *dp = NULL;
34dc7c2f
BB
374 dmu_buf_t **dbp;
375 uint64_t blkid, nblks, i;
9babb374 376 uint32_t dbuf_flags;
34dc7c2f
BB
377 int err;
378 zio_t *zio;
d4ed6673 379 hrtime_t start = 0;
34dc7c2f
BB
380
381 ASSERT(length <= DMU_MAX_ACCESS);
382
45d1cae3 383 dbuf_flags = DB_RF_CANFAIL | DB_RF_NEVERWAIT | DB_RF_HAVESTRUCT;
9babb374
BB
384 if (flags & DMU_READ_NO_PREFETCH || length > zfetch_array_rd_sz)
385 dbuf_flags |= DB_RF_NOPREFETCH;
34dc7c2f
BB
386
387 rw_enter(&dn->dn_struct_rwlock, RW_READER);
388 if (dn->dn_datablkshift) {
389 int blkshift = dn->dn_datablkshift;
390 nblks = (P2ROUNDUP(offset+length, 1ULL<<blkshift) -
391 P2ALIGN(offset, 1ULL<<blkshift)) >> blkshift;
392 } else {
393 if (offset + length > dn->dn_datablksz) {
394 zfs_panic_recover("zfs: accessing past end of object "
395 "%llx/%llx (size=%u access=%llu+%llu)",
396 (longlong_t)dn->dn_objset->
397 os_dsl_dataset->ds_object,
398 (longlong_t)dn->dn_object, dn->dn_datablksz,
399 (longlong_t)offset, (longlong_t)length);
45d1cae3 400 rw_exit(&dn->dn_struct_rwlock);
2e528b49 401 return (SET_ERROR(EIO));
34dc7c2f
BB
402 }
403 nblks = 1;
404 }
b8d06fca 405 dbp = kmem_zalloc(sizeof (dmu_buf_t *) * nblks, KM_PUSHPAGE | KM_NODEBUG);
34dc7c2f 406
b128c09f
BB
407 if (dn->dn_objset->os_dsl_dataset)
408 dp = dn->dn_objset->os_dsl_dataset->ds_dir->dd_pool;
a117a6d6 409 start = gethrtime();
b128c09f 410 zio = zio_root(dn->dn_objset->os_spa, NULL, NULL, ZIO_FLAG_CANFAIL);
34dc7c2f
BB
411 blkid = dbuf_whichblock(dn, offset);
412 for (i = 0; i < nblks; i++) {
413 dmu_buf_impl_t *db = dbuf_hold(dn, blkid+i, tag);
414 if (db == NULL) {
415 rw_exit(&dn->dn_struct_rwlock);
416 dmu_buf_rele_array(dbp, nblks, tag);
417 zio_nowait(zio);
2e528b49 418 return (SET_ERROR(EIO));
34dc7c2f
BB
419 }
420 /* initiate async i/o */
421 if (read) {
9babb374 422 (void) dbuf_read(db, zio, dbuf_flags);
34dc7c2f
BB
423 }
424 dbp[i] = &db->db;
425 }
426 rw_exit(&dn->dn_struct_rwlock);
427
428 /* wait for async i/o */
429 err = zio_wait(zio);
b128c09f
BB
430 /* track read overhead when we are in sync context */
431 if (dp && dsl_pool_sync_context(dp))
432 dp->dp_read_overhead += gethrtime() - start;
34dc7c2f
BB
433 if (err) {
434 dmu_buf_rele_array(dbp, nblks, tag);
435 return (err);
436 }
437
438 /* wait for other io to complete */
439 if (read) {
440 for (i = 0; i < nblks; i++) {
441 dmu_buf_impl_t *db = (dmu_buf_impl_t *)dbp[i];
442 mutex_enter(&db->db_mtx);
443 while (db->db_state == DB_READ ||
444 db->db_state == DB_FILL)
445 cv_wait(&db->db_changed, &db->db_mtx);
446 if (db->db_state == DB_UNCACHED)
2e528b49 447 err = SET_ERROR(EIO);
34dc7c2f
BB
448 mutex_exit(&db->db_mtx);
449 if (err) {
450 dmu_buf_rele_array(dbp, nblks, tag);
451 return (err);
452 }
453 }
454 }
455
456 *numbufsp = nblks;
457 *dbpp = dbp;
458 return (0);
459}
460
461static int
462dmu_buf_hold_array(objset_t *os, uint64_t object, uint64_t offset,
463 uint64_t length, int read, void *tag, int *numbufsp, dmu_buf_t ***dbpp)
464{
465 dnode_t *dn;
466 int err;
467
428870ff 468 err = dnode_hold(os, object, FTAG, &dn);
34dc7c2f
BB
469 if (err)
470 return (err);
471
472 err = dmu_buf_hold_array_by_dnode(dn, offset, length, read, tag,
9babb374 473 numbufsp, dbpp, DMU_READ_PREFETCH);
34dc7c2f
BB
474
475 dnode_rele(dn, FTAG);
476
477 return (err);
478}
479
480int
572e2857 481dmu_buf_hold_array_by_bonus(dmu_buf_t *db_fake, uint64_t offset,
34dc7c2f
BB
482 uint64_t length, int read, void *tag, int *numbufsp, dmu_buf_t ***dbpp)
483{
572e2857
BB
484 dmu_buf_impl_t *db = (dmu_buf_impl_t *)db_fake;
485 dnode_t *dn;
34dc7c2f
BB
486 int err;
487
572e2857
BB
488 DB_DNODE_ENTER(db);
489 dn = DB_DNODE(db);
34dc7c2f 490 err = dmu_buf_hold_array_by_dnode(dn, offset, length, read, tag,
9babb374 491 numbufsp, dbpp, DMU_READ_PREFETCH);
572e2857 492 DB_DNODE_EXIT(db);
34dc7c2f
BB
493
494 return (err);
495}
496
497void
498dmu_buf_rele_array(dmu_buf_t **dbp_fake, int numbufs, void *tag)
499{
500 int i;
501 dmu_buf_impl_t **dbp = (dmu_buf_impl_t **)dbp_fake;
502
503 if (numbufs == 0)
504 return;
505
506 for (i = 0; i < numbufs; i++) {
507 if (dbp[i])
508 dbuf_rele(dbp[i], tag);
509 }
510
511 kmem_free(dbp, sizeof (dmu_buf_t *) * numbufs);
512}
513
514void
515dmu_prefetch(objset_t *os, uint64_t object, uint64_t offset, uint64_t len)
516{
517 dnode_t *dn;
518 uint64_t blkid;
519 int nblks, i, err;
520
521 if (zfs_prefetch_disable)
522 return;
523
524 if (len == 0) { /* they're interested in the bonus buffer */
572e2857 525 dn = DMU_META_DNODE(os);
34dc7c2f
BB
526
527 if (object == 0 || object >= DN_MAX_OBJECT)
528 return;
529
530 rw_enter(&dn->dn_struct_rwlock, RW_READER);
531 blkid = dbuf_whichblock(dn, object * sizeof (dnode_phys_t));
532 dbuf_prefetch(dn, blkid);
533 rw_exit(&dn->dn_struct_rwlock);
534 return;
535 }
536
537 /*
538 * XXX - Note, if the dnode for the requested object is not
539 * already cached, we will do a *synchronous* read in the
540 * dnode_hold() call. The same is true for any indirects.
541 */
428870ff 542 err = dnode_hold(os, object, FTAG, &dn);
34dc7c2f
BB
543 if (err != 0)
544 return;
545
546 rw_enter(&dn->dn_struct_rwlock, RW_READER);
547 if (dn->dn_datablkshift) {
548 int blkshift = dn->dn_datablkshift;
549 nblks = (P2ROUNDUP(offset+len, 1<<blkshift) -
550 P2ALIGN(offset, 1<<blkshift)) >> blkshift;
551 } else {
552 nblks = (offset < dn->dn_datablksz);
553 }
554
555 if (nblks != 0) {
556 blkid = dbuf_whichblock(dn, offset);
557 for (i = 0; i < nblks; i++)
558 dbuf_prefetch(dn, blkid+i);
559 }
560
561 rw_exit(&dn->dn_struct_rwlock);
562
563 dnode_rele(dn, FTAG);
564}
565
45d1cae3
BB
566/*
567 * Get the next "chunk" of file data to free. We traverse the file from
568 * the end so that the file gets shorter over time (if we crashes in the
569 * middle, this will leave us in a better state). We find allocated file
570 * data by simply searching the allocated level 1 indirects.
571 */
b128c09f 572static int
45d1cae3 573get_next_chunk(dnode_t *dn, uint64_t *start, uint64_t limit)
b128c09f 574{
45d1cae3
BB
575 uint64_t len = *start - limit;
576 uint64_t blkcnt = 0;
577 uint64_t maxblks = DMU_MAX_ACCESS / (1ULL << (dn->dn_indblkshift + 1));
578 uint64_t iblkrange =
b128c09f
BB
579 dn->dn_datablksz * EPB(dn->dn_indblkshift, SPA_BLKPTRSHIFT);
580
45d1cae3 581 ASSERT(limit <= *start);
b128c09f 582
45d1cae3
BB
583 if (len <= iblkrange * maxblks) {
584 *start = limit;
b128c09f
BB
585 return (0);
586 }
45d1cae3 587 ASSERT(ISP2(iblkrange));
b128c09f 588
45d1cae3 589 while (*start > limit && blkcnt < maxblks) {
b128c09f
BB
590 int err;
591
45d1cae3 592 /* find next allocated L1 indirect */
b128c09f 593 err = dnode_next_offset(dn,
45d1cae3 594 DNODE_FIND_BACKWARDS, start, 2, 1, 0);
b128c09f 595
45d1cae3
BB
596 /* if there are no more, then we are done */
597 if (err == ESRCH) {
598 *start = limit;
b128c09f 599 return (0);
45d1cae3 600 } else if (err) {
b128c09f 601 return (err);
45d1cae3
BB
602 }
603 blkcnt += 1;
b128c09f 604
45d1cae3
BB
605 /* reset offset to end of "next" block back */
606 *start = P2ALIGN(*start, iblkrange);
607 if (*start <= limit)
608 *start = limit;
609 else
610 *start -= 1;
b128c09f
BB
611 }
612 return (0);
613}
614
615static int
616dmu_free_long_range_impl(objset_t *os, dnode_t *dn, uint64_t offset,
617 uint64_t length, boolean_t free_dnode)
618{
619 dmu_tx_t *tx;
620 uint64_t object_size, start, end, len;
621 boolean_t trunc = (length == DMU_OBJECT_END);
622 int align, err;
623
624 align = 1 << dn->dn_datablkshift;
625 ASSERT(align > 0);
626 object_size = align == 1 ? dn->dn_datablksz :
627 (dn->dn_maxblkid + 1) << dn->dn_datablkshift;
628
9babb374
BB
629 end = offset + length;
630 if (trunc || end > object_size)
b128c09f
BB
631 end = object_size;
632 if (end <= offset)
633 return (0);
634 length = end - offset;
635
636 while (length) {
637 start = end;
9babb374 638 /* assert(offset <= start) */
b128c09f
BB
639 err = get_next_chunk(dn, &start, offset);
640 if (err)
641 return (err);
642 len = trunc ? DMU_OBJECT_END : end - start;
643
644 tx = dmu_tx_create(os);
645 dmu_tx_hold_free(tx, dn->dn_object, start, len);
646 err = dmu_tx_assign(tx, TXG_WAIT);
647 if (err) {
648 dmu_tx_abort(tx);
649 return (err);
650 }
651
652 dnode_free_range(dn, start, trunc ? -1 : len, tx);
653
654 if (start == 0 && free_dnode) {
655 ASSERT(trunc);
656 dnode_free(dn, tx);
657 }
658
659 length -= end - start;
660
661 dmu_tx_commit(tx);
662 end = start;
663 }
664 return (0);
665}
666
667int
668dmu_free_long_range(objset_t *os, uint64_t object,
669 uint64_t offset, uint64_t length)
670{
671 dnode_t *dn;
672 int err;
673
428870ff 674 err = dnode_hold(os, object, FTAG, &dn);
b128c09f
BB
675 if (err != 0)
676 return (err);
677 err = dmu_free_long_range_impl(os, dn, offset, length, FALSE);
678 dnode_rele(dn, FTAG);
679 return (err);
680}
681
682int
683dmu_free_object(objset_t *os, uint64_t object)
684{
685 dnode_t *dn;
686 dmu_tx_t *tx;
687 int err;
688
428870ff 689 err = dnode_hold_impl(os, object, DNODE_MUST_BE_ALLOCATED,
b128c09f
BB
690 FTAG, &dn);
691 if (err != 0)
692 return (err);
693 if (dn->dn_nlevels == 1) {
694 tx = dmu_tx_create(os);
695 dmu_tx_hold_bonus(tx, object);
696 dmu_tx_hold_free(tx, dn->dn_object, 0, DMU_OBJECT_END);
697 err = dmu_tx_assign(tx, TXG_WAIT);
698 if (err == 0) {
699 dnode_free_range(dn, 0, DMU_OBJECT_END, tx);
700 dnode_free(dn, tx);
701 dmu_tx_commit(tx);
702 } else {
703 dmu_tx_abort(tx);
704 }
705 } else {
706 err = dmu_free_long_range_impl(os, dn, 0, DMU_OBJECT_END, TRUE);
707 }
708 dnode_rele(dn, FTAG);
709 return (err);
710}
711
34dc7c2f
BB
712int
713dmu_free_range(objset_t *os, uint64_t object, uint64_t offset,
714 uint64_t size, dmu_tx_t *tx)
715{
716 dnode_t *dn;
428870ff 717 int err = dnode_hold(os, object, FTAG, &dn);
34dc7c2f
BB
718 if (err)
719 return (err);
720 ASSERT(offset < UINT64_MAX);
721 ASSERT(size == -1ULL || size <= UINT64_MAX - offset);
722 dnode_free_range(dn, offset, size, tx);
723 dnode_rele(dn, FTAG);
724 return (0);
725}
726
727int
728dmu_read(objset_t *os, uint64_t object, uint64_t offset, uint64_t size,
9babb374 729 void *buf, uint32_t flags)
34dc7c2f
BB
730{
731 dnode_t *dn;
732 dmu_buf_t **dbp;
45d1cae3 733 int numbufs, err;
34dc7c2f 734
428870ff 735 err = dnode_hold(os, object, FTAG, &dn);
34dc7c2f
BB
736 if (err)
737 return (err);
738
739 /*
740 * Deal with odd block sizes, where there can't be data past the first
741 * block. If we ever do the tail block optimization, we will need to
742 * handle that here as well.
743 */
45d1cae3 744 if (dn->dn_maxblkid == 0) {
34dc7c2f
BB
745 int newsz = offset > dn->dn_datablksz ? 0 :
746 MIN(size, dn->dn_datablksz - offset);
747 bzero((char *)buf + newsz, size - newsz);
748 size = newsz;
749 }
750
751 while (size > 0) {
752 uint64_t mylen = MIN(size, DMU_MAX_ACCESS / 2);
45d1cae3 753 int i;
34dc7c2f
BB
754
755 /*
756 * NB: we could do this block-at-a-time, but it's nice
757 * to be reading in parallel.
758 */
759 err = dmu_buf_hold_array_by_dnode(dn, offset, mylen,
9babb374 760 TRUE, FTAG, &numbufs, &dbp, flags);
34dc7c2f
BB
761 if (err)
762 break;
763
764 for (i = 0; i < numbufs; i++) {
765 int tocpy;
766 int bufoff;
767 dmu_buf_t *db = dbp[i];
768
769 ASSERT(size > 0);
770
771 bufoff = offset - db->db_offset;
772 tocpy = (int)MIN(db->db_size - bufoff, size);
773
774 bcopy((char *)db->db_data + bufoff, buf, tocpy);
775
776 offset += tocpy;
777 size -= tocpy;
778 buf = (char *)buf + tocpy;
779 }
780 dmu_buf_rele_array(dbp, numbufs, FTAG);
781 }
782 dnode_rele(dn, FTAG);
783 return (err);
784}
785
786void
787dmu_write(objset_t *os, uint64_t object, uint64_t offset, uint64_t size,
788 const void *buf, dmu_tx_t *tx)
789{
790 dmu_buf_t **dbp;
791 int numbufs, i;
792
793 if (size == 0)
794 return;
795
796 VERIFY(0 == dmu_buf_hold_array(os, object, offset, size,
797 FALSE, FTAG, &numbufs, &dbp));
798
799 for (i = 0; i < numbufs; i++) {
800 int tocpy;
801 int bufoff;
802 dmu_buf_t *db = dbp[i];
803
804 ASSERT(size > 0);
805
806 bufoff = offset - db->db_offset;
807 tocpy = (int)MIN(db->db_size - bufoff, size);
808
809 ASSERT(i == 0 || i == numbufs-1 || tocpy == db->db_size);
810
811 if (tocpy == db->db_size)
812 dmu_buf_will_fill(db, tx);
813 else
814 dmu_buf_will_dirty(db, tx);
815
60101509 816 (void) memcpy((char *)db->db_data + bufoff, buf, tocpy);
34dc7c2f
BB
817
818 if (tocpy == db->db_size)
819 dmu_buf_fill_done(db, tx);
820
821 offset += tocpy;
822 size -= tocpy;
823 buf = (char *)buf + tocpy;
824 }
825 dmu_buf_rele_array(dbp, numbufs, FTAG);
826}
827
b128c09f
BB
828void
829dmu_prealloc(objset_t *os, uint64_t object, uint64_t offset, uint64_t size,
830 dmu_tx_t *tx)
831{
832 dmu_buf_t **dbp;
833 int numbufs, i;
834
835 if (size == 0)
836 return;
837
838 VERIFY(0 == dmu_buf_hold_array(os, object, offset, size,
839 FALSE, FTAG, &numbufs, &dbp));
840
841 for (i = 0; i < numbufs; i++) {
842 dmu_buf_t *db = dbp[i];
843
844 dmu_buf_will_not_fill(db, tx);
845 }
846 dmu_buf_rele_array(dbp, numbufs, FTAG);
847}
848
428870ff
BB
849/*
850 * DMU support for xuio
851 */
852kstat_t *xuio_ksp = NULL;
853
59e6e7ca
BB
854typedef struct xuio_stats {
855 /* loaned yet not returned arc_buf */
856 kstat_named_t xuiostat_onloan_rbuf;
857 kstat_named_t xuiostat_onloan_wbuf;
858 /* whether a copy is made when loaning out a read buffer */
859 kstat_named_t xuiostat_rbuf_copied;
860 kstat_named_t xuiostat_rbuf_nocopy;
861 /* whether a copy is made when assigning a write buffer */
862 kstat_named_t xuiostat_wbuf_copied;
863 kstat_named_t xuiostat_wbuf_nocopy;
864} xuio_stats_t;
865
866static xuio_stats_t xuio_stats = {
867 { "onloan_read_buf", KSTAT_DATA_UINT64 },
868 { "onloan_write_buf", KSTAT_DATA_UINT64 },
869 { "read_buf_copied", KSTAT_DATA_UINT64 },
870 { "read_buf_nocopy", KSTAT_DATA_UINT64 },
871 { "write_buf_copied", KSTAT_DATA_UINT64 },
872 { "write_buf_nocopy", KSTAT_DATA_UINT64 }
873};
874
875#define XUIOSTAT_INCR(stat, val) \
876 atomic_add_64(&xuio_stats.stat.value.ui64, (val))
877#define XUIOSTAT_BUMP(stat) XUIOSTAT_INCR(stat, 1)
878
428870ff
BB
879int
880dmu_xuio_init(xuio_t *xuio, int nblk)
881{
882 dmu_xuio_t *priv;
883 uio_t *uio = &xuio->xu_uio;
884
885 uio->uio_iovcnt = nblk;
b8d06fca 886 uio->uio_iov = kmem_zalloc(nblk * sizeof (iovec_t), KM_PUSHPAGE);
428870ff 887
b8d06fca 888 priv = kmem_zalloc(sizeof (dmu_xuio_t), KM_PUSHPAGE);
428870ff 889 priv->cnt = nblk;
b8d06fca 890 priv->bufs = kmem_zalloc(nblk * sizeof (arc_buf_t *), KM_PUSHPAGE);
428870ff
BB
891 priv->iovp = uio->uio_iov;
892 XUIO_XUZC_PRIV(xuio) = priv;
893
894 if (XUIO_XUZC_RW(xuio) == UIO_READ)
895 XUIOSTAT_INCR(xuiostat_onloan_rbuf, nblk);
896 else
897 XUIOSTAT_INCR(xuiostat_onloan_wbuf, nblk);
898
899 return (0);
900}
901
902void
903dmu_xuio_fini(xuio_t *xuio)
904{
905 dmu_xuio_t *priv = XUIO_XUZC_PRIV(xuio);
906 int nblk = priv->cnt;
907
908 kmem_free(priv->iovp, nblk * sizeof (iovec_t));
909 kmem_free(priv->bufs, nblk * sizeof (arc_buf_t *));
910 kmem_free(priv, sizeof (dmu_xuio_t));
911
912 if (XUIO_XUZC_RW(xuio) == UIO_READ)
913 XUIOSTAT_INCR(xuiostat_onloan_rbuf, -nblk);
914 else
915 XUIOSTAT_INCR(xuiostat_onloan_wbuf, -nblk);
916}
917
918/*
919 * Initialize iov[priv->next] and priv->bufs[priv->next] with { off, n, abuf }
920 * and increase priv->next by 1.
921 */
922int
923dmu_xuio_add(xuio_t *xuio, arc_buf_t *abuf, offset_t off, size_t n)
924{
925 struct iovec *iov;
926 uio_t *uio = &xuio->xu_uio;
927 dmu_xuio_t *priv = XUIO_XUZC_PRIV(xuio);
928 int i = priv->next++;
929
930 ASSERT(i < priv->cnt);
931 ASSERT(off + n <= arc_buf_size(abuf));
932 iov = uio->uio_iov + i;
933 iov->iov_base = (char *)abuf->b_data + off;
934 iov->iov_len = n;
935 priv->bufs[i] = abuf;
936 return (0);
937}
938
939int
940dmu_xuio_cnt(xuio_t *xuio)
941{
942 dmu_xuio_t *priv = XUIO_XUZC_PRIV(xuio);
943 return (priv->cnt);
944}
945
946arc_buf_t *
947dmu_xuio_arcbuf(xuio_t *xuio, int i)
948{
949 dmu_xuio_t *priv = XUIO_XUZC_PRIV(xuio);
950
951 ASSERT(i < priv->cnt);
952 return (priv->bufs[i]);
953}
954
955void
956dmu_xuio_clear(xuio_t *xuio, int i)
957{
958 dmu_xuio_t *priv = XUIO_XUZC_PRIV(xuio);
959
960 ASSERT(i < priv->cnt);
961 priv->bufs[i] = NULL;
962}
963
964static void
965xuio_stat_init(void)
966{
967 xuio_ksp = kstat_create("zfs", 0, "xuio_stats", "misc",
968 KSTAT_TYPE_NAMED, sizeof (xuio_stats) / sizeof (kstat_named_t),
969 KSTAT_FLAG_VIRTUAL);
970 if (xuio_ksp != NULL) {
971 xuio_ksp->ks_data = &xuio_stats;
972 kstat_install(xuio_ksp);
973 }
974}
975
976static void
977xuio_stat_fini(void)
978{
979 if (xuio_ksp != NULL) {
980 kstat_delete(xuio_ksp);
981 xuio_ksp = NULL;
982 }
983}
984
985void
986xuio_stat_wbuf_copied()
987{
988 XUIOSTAT_BUMP(xuiostat_wbuf_copied);
989}
990
991void
992xuio_stat_wbuf_nocopy()
993{
994 XUIOSTAT_BUMP(xuiostat_wbuf_nocopy);
995}
996
34dc7c2f 997#ifdef _KERNEL
60101509
BB
998
999/*
1000 * Copy up to size bytes between arg_buf and req based on the data direction
1001 * described by the req. If an entire req's data cannot be transfered the
1002 * req's is updated such that it's current index and bv offsets correctly
1003 * reference any residual data which could not be copied. The return value
1004 * is the number of bytes successfully copied to arg_buf.
1005 */
1006static int
1007dmu_req_copy(void *arg_buf, int size, int *offset, struct request *req)
1008{
1009 struct bio_vec *bv;
1010 struct req_iterator iter;
1011 char *bv_buf;
1012 int tocpy;
1013
1014 *offset = 0;
1015 rq_for_each_segment(bv, req, iter) {
1016
1017 /* Fully consumed the passed arg_buf */
1018 ASSERT3S(*offset, <=, size);
1019 if (size == *offset)
1020 break;
1021
1022 /* Skip fully consumed bv's */
1023 if (bv->bv_len == 0)
1024 continue;
1025
1026 tocpy = MIN(bv->bv_len, size - *offset);
1027 ASSERT3S(tocpy, >=, 0);
1028
1029 bv_buf = page_address(bv->bv_page) + bv->bv_offset;
1030 ASSERT3P(bv_buf, !=, NULL);
1031
1032 if (rq_data_dir(req) == WRITE)
1033 memcpy(arg_buf + *offset, bv_buf, tocpy);
1034 else
1035 memcpy(bv_buf, arg_buf + *offset, tocpy);
1036
1037 *offset += tocpy;
1038 bv->bv_offset += tocpy;
1039 bv->bv_len -= tocpy;
1040 }
1041
1042 return 0;
1043}
1044
e26ade51
BB
1045static void
1046dmu_bio_put(struct bio *bio)
1047{
1048 struct bio *bio_next;
1049
1050 while (bio) {
1051 bio_next = bio->bi_next;
1052 bio_put(bio);
1053 bio = bio_next;
1054 }
1055}
1056
1057static int
1058dmu_bio_clone(struct bio *bio, struct bio **bio_copy)
1059{
1060 struct bio *bio_root = NULL;
1061 struct bio *bio_last = NULL;
1062 struct bio *bio_new;
1063
1064 if (bio == NULL)
1065 return EINVAL;
1066
1067 while (bio) {
1068 bio_new = bio_clone(bio, GFP_NOIO);
1069 if (bio_new == NULL) {
1070 dmu_bio_put(bio_root);
1071 return ENOMEM;
1072 }
1073
1074 if (bio_last) {
1075 bio_last->bi_next = bio_new;
1076 bio_last = bio_new;
1077 } else {
1078 bio_root = bio_new;
1079 bio_last = bio_new;
1080 }
1081
1082 bio = bio->bi_next;
1083 }
1084
1085 *bio_copy = bio_root;
1086
1087 return 0;
1088}
1089
34dc7c2f 1090int
60101509 1091dmu_read_req(objset_t *os, uint64_t object, struct request *req)
34dc7c2f 1092{
60101509
BB
1093 uint64_t size = blk_rq_bytes(req);
1094 uint64_t offset = blk_rq_pos(req) << 9;
e26ade51 1095 struct bio *bio_saved = req->bio;
34dc7c2f
BB
1096 dmu_buf_t **dbp;
1097 int numbufs, i, err;
1098
1099 /*
1100 * NB: we could do this block-at-a-time, but it's nice
1101 * to be reading in parallel.
1102 */
60101509
BB
1103 err = dmu_buf_hold_array(os, object, offset, size, TRUE, FTAG,
1104 &numbufs, &dbp);
34dc7c2f
BB
1105 if (err)
1106 return (err);
1107
e26ade51
BB
1108 /*
1109 * Clone the bio list so the bv->bv_offset and bv->bv_len members
1110 * can be safely modified. The original bio list is relinked in to
1111 * the request when the function exits. This is required because
1112 * some file systems blindly assume that these values will remain
1113 * constant between bio_submit() and the IO completion callback.
1114 */
1115 err = dmu_bio_clone(bio_saved, &req->bio);
1116 if (err)
1117 goto error;
1118
34dc7c2f 1119 for (i = 0; i < numbufs; i++) {
60101509 1120 int tocpy, didcpy, bufoff;
34dc7c2f
BB
1121 dmu_buf_t *db = dbp[i];
1122
60101509
BB
1123 bufoff = offset - db->db_offset;
1124 ASSERT3S(bufoff, >=, 0);
34dc7c2f 1125
34dc7c2f 1126 tocpy = (int)MIN(db->db_size - bufoff, size);
60101509
BB
1127 if (tocpy == 0)
1128 break;
34dc7c2f 1129
60101509
BB
1130 err = dmu_req_copy(db->db_data + bufoff, tocpy, &didcpy, req);
1131
1132 if (didcpy < tocpy)
1133 err = EIO;
428870ff 1134
34dc7c2f
BB
1135 if (err)
1136 break;
1137
1138 size -= tocpy;
60101509
BB
1139 offset += didcpy;
1140 err = 0;
34dc7c2f 1141 }
e26ade51
BB
1142
1143 dmu_bio_put(req->bio);
1144 req->bio = bio_saved;
1145error:
34dc7c2f
BB
1146 dmu_buf_rele_array(dbp, numbufs, FTAG);
1147
1148 return (err);
1149}
1150
60101509
BB
1151int
1152dmu_write_req(objset_t *os, uint64_t object, struct request *req, dmu_tx_t *tx)
34dc7c2f 1153{
60101509
BB
1154 uint64_t size = blk_rq_bytes(req);
1155 uint64_t offset = blk_rq_pos(req) << 9;
e26ade51 1156 struct bio *bio_saved = req->bio;
34dc7c2f 1157 dmu_buf_t **dbp;
428870ff 1158 int numbufs;
34dc7c2f 1159 int err = 0;
428870ff 1160 int i;
34dc7c2f 1161
60101509
BB
1162 if (size == 0)
1163 return (0);
1164
1165 err = dmu_buf_hold_array(os, object, offset, size, FALSE, FTAG,
1166 &numbufs, &dbp);
34dc7c2f
BB
1167 if (err)
1168 return (err);
1169
e26ade51
BB
1170 /*
1171 * Clone the bio list so the bv->bv_offset and bv->bv_len members
1172 * can be safely modified. The original bio list is relinked in to
1173 * the request when the function exits. This is required because
1174 * some file systems blindly assume that these values will remain
1175 * constant between bio_submit() and the IO completion callback.
1176 */
1177 err = dmu_bio_clone(bio_saved, &req->bio);
1178 if (err)
1179 goto error;
1180
34dc7c2f 1181 for (i = 0; i < numbufs; i++) {
60101509 1182 int tocpy, didcpy, bufoff;
34dc7c2f
BB
1183 dmu_buf_t *db = dbp[i];
1184
60101509
BB
1185 bufoff = offset - db->db_offset;
1186 ASSERT3S(bufoff, >=, 0);
34dc7c2f 1187
34dc7c2f 1188 tocpy = (int)MIN(db->db_size - bufoff, size);
60101509
BB
1189 if (tocpy == 0)
1190 break;
34dc7c2f
BB
1191
1192 ASSERT(i == 0 || i == numbufs-1 || tocpy == db->db_size);
1193
1194 if (tocpy == db->db_size)
1195 dmu_buf_will_fill(db, tx);
1196 else
1197 dmu_buf_will_dirty(db, tx);
1198
60101509 1199 err = dmu_req_copy(db->db_data + bufoff, tocpy, &didcpy, req);
34dc7c2f
BB
1200
1201 if (tocpy == db->db_size)
1202 dmu_buf_fill_done(db, tx);
1203
60101509
BB
1204 if (didcpy < tocpy)
1205 err = EIO;
1206
34dc7c2f
BB
1207 if (err)
1208 break;
1209
1210 size -= tocpy;
60101509
BB
1211 offset += didcpy;
1212 err = 0;
34dc7c2f 1213 }
428870ff 1214
e26ade51
BB
1215 dmu_bio_put(req->bio);
1216 req->bio = bio_saved;
1217error:
34dc7c2f 1218 dmu_buf_rele_array(dbp, numbufs, FTAG);
e26ade51 1219
34dc7c2f
BB
1220 return (err);
1221}
1222
872e8d26
BB
1223int
1224dmu_read_uio(objset_t *os, uint64_t object, uio_t *uio, uint64_t size)
1225{
1226 dmu_buf_t **dbp;
1227 int numbufs, i, err;
1228 xuio_t *xuio = NULL;
1229
1230 /*
1231 * NB: we could do this block-at-a-time, but it's nice
1232 * to be reading in parallel.
1233 */
1234 err = dmu_buf_hold_array(os, object, uio->uio_loffset, size, TRUE, FTAG,
1235 &numbufs, &dbp);
1236 if (err)
1237 return (err);
1238
1239 for (i = 0; i < numbufs; i++) {
1240 int tocpy;
1241 int bufoff;
1242 dmu_buf_t *db = dbp[i];
1243
1244 ASSERT(size > 0);
1245
1246 bufoff = uio->uio_loffset - db->db_offset;
1247 tocpy = (int)MIN(db->db_size - bufoff, size);
1248
1249 if (xuio) {
1250 dmu_buf_impl_t *dbi = (dmu_buf_impl_t *)db;
1251 arc_buf_t *dbuf_abuf = dbi->db_buf;
1252 arc_buf_t *abuf = dbuf_loan_arcbuf(dbi);
1253 err = dmu_xuio_add(xuio, abuf, bufoff, tocpy);
1254 if (!err) {
1255 uio->uio_resid -= tocpy;
1256 uio->uio_loffset += tocpy;
1257 }
1258
1259 if (abuf == dbuf_abuf)
1260 XUIOSTAT_BUMP(xuiostat_rbuf_nocopy);
1261 else
1262 XUIOSTAT_BUMP(xuiostat_rbuf_copied);
1263 } else {
1264 err = uiomove((char *)db->db_data + bufoff, tocpy,
1265 UIO_READ, uio);
1266 }
1267 if (err)
1268 break;
1269
1270 size -= tocpy;
1271 }
1272 dmu_buf_rele_array(dbp, numbufs, FTAG);
1273
1274 return (err);
1275}
1276
1277static int
1278dmu_write_uio_dnode(dnode_t *dn, uio_t *uio, uint64_t size, dmu_tx_t *tx)
1279{
1280 dmu_buf_t **dbp;
1281 int numbufs;
1282 int err = 0;
1283 int i;
1284
1285 err = dmu_buf_hold_array_by_dnode(dn, uio->uio_loffset, size,
1286 FALSE, FTAG, &numbufs, &dbp, DMU_READ_PREFETCH);
1287 if (err)
1288 return (err);
1289
1290 for (i = 0; i < numbufs; i++) {
1291 int tocpy;
1292 int bufoff;
1293 dmu_buf_t *db = dbp[i];
1294
1295 ASSERT(size > 0);
1296
1297 bufoff = uio->uio_loffset - db->db_offset;
1298 tocpy = (int)MIN(db->db_size - bufoff, size);
1299
1300 ASSERT(i == 0 || i == numbufs-1 || tocpy == db->db_size);
1301
1302 if (tocpy == db->db_size)
1303 dmu_buf_will_fill(db, tx);
1304 else
1305 dmu_buf_will_dirty(db, tx);
1306
1307 /*
1308 * XXX uiomove could block forever (eg.nfs-backed
1309 * pages). There needs to be a uiolockdown() function
1310 * to lock the pages in memory, so that uiomove won't
1311 * block.
1312 */
1313 err = uiomove((char *)db->db_data + bufoff, tocpy,
1314 UIO_WRITE, uio);
1315
1316 if (tocpy == db->db_size)
1317 dmu_buf_fill_done(db, tx);
1318
1319 if (err)
1320 break;
1321
1322 size -= tocpy;
1323 }
1324
1325 dmu_buf_rele_array(dbp, numbufs, FTAG);
1326 return (err);
1327}
1328
428870ff
BB
1329int
1330dmu_write_uio_dbuf(dmu_buf_t *zdb, uio_t *uio, uint64_t size,
1331 dmu_tx_t *tx)
1332{
572e2857
BB
1333 dmu_buf_impl_t *db = (dmu_buf_impl_t *)zdb;
1334 dnode_t *dn;
1335 int err;
1336
428870ff
BB
1337 if (size == 0)
1338 return (0);
1339
572e2857
BB
1340 DB_DNODE_ENTER(db);
1341 dn = DB_DNODE(db);
1342 err = dmu_write_uio_dnode(dn, uio, size, tx);
1343 DB_DNODE_EXIT(db);
1344
1345 return (err);
428870ff
BB
1346}
1347
1348int
1349dmu_write_uio(objset_t *os, uint64_t object, uio_t *uio, uint64_t size,
1350 dmu_tx_t *tx)
1351{
1352 dnode_t *dn;
1353 int err;
1354
1355 if (size == 0)
1356 return (0);
1357
1358 err = dnode_hold(os, object, FTAG, &dn);
1359 if (err)
1360 return (err);
1361
1362 err = dmu_write_uio_dnode(dn, uio, size, tx);
1363
1364 dnode_rele(dn, FTAG);
1365
1366 return (err);
1367}
872e8d26 1368#endif /* _KERNEL */
34dc7c2f 1369
9babb374
BB
1370/*
1371 * Allocate a loaned anonymous arc buffer.
1372 */
1373arc_buf_t *
1374dmu_request_arcbuf(dmu_buf_t *handle, int size)
1375{
572e2857
BB
1376 dmu_buf_impl_t *db = (dmu_buf_impl_t *)handle;
1377 spa_t *spa;
9babb374 1378
572e2857
BB
1379 DB_GET_SPA(&spa, db);
1380 return (arc_loan_buf(spa, size));
9babb374
BB
1381}
1382
1383/*
1384 * Free a loaned arc buffer.
1385 */
1386void
1387dmu_return_arcbuf(arc_buf_t *buf)
1388{
1389 arc_return_buf(buf, FTAG);
13fe0198 1390 VERIFY(arc_buf_remove_ref(buf, FTAG));
9babb374
BB
1391}
1392
1393/*
1394 * When possible directly assign passed loaned arc buffer to a dbuf.
1395 * If this is not possible copy the contents of passed arc buf via
1396 * dmu_write().
1397 */
1398void
1399dmu_assign_arcbuf(dmu_buf_t *handle, uint64_t offset, arc_buf_t *buf,
1400 dmu_tx_t *tx)
1401{
572e2857
BB
1402 dmu_buf_impl_t *dbuf = (dmu_buf_impl_t *)handle;
1403 dnode_t *dn;
9babb374
BB
1404 dmu_buf_impl_t *db;
1405 uint32_t blksz = (uint32_t)arc_buf_size(buf);
1406 uint64_t blkid;
1407
572e2857
BB
1408 DB_DNODE_ENTER(dbuf);
1409 dn = DB_DNODE(dbuf);
9babb374
BB
1410 rw_enter(&dn->dn_struct_rwlock, RW_READER);
1411 blkid = dbuf_whichblock(dn, offset);
1412 VERIFY((db = dbuf_hold(dn, blkid, FTAG)) != NULL);
1413 rw_exit(&dn->dn_struct_rwlock);
572e2857 1414 DB_DNODE_EXIT(dbuf);
9babb374
BB
1415
1416 if (offset == db->db.db_offset && blksz == db->db.db_size) {
1417 dbuf_assign_arcbuf(db, buf, tx);
1418 dbuf_rele(db, FTAG);
1419 } else {
572e2857
BB
1420 objset_t *os;
1421 uint64_t object;
1422
1423 DB_DNODE_ENTER(dbuf);
1424 dn = DB_DNODE(dbuf);
1425 os = dn->dn_objset;
1426 object = dn->dn_object;
1427 DB_DNODE_EXIT(dbuf);
1428
9babb374 1429 dbuf_rele(db, FTAG);
572e2857 1430 dmu_write(os, object, offset, blksz, buf->b_data, tx);
9babb374 1431 dmu_return_arcbuf(buf);
428870ff 1432 XUIOSTAT_BUMP(xuiostat_wbuf_copied);
9babb374
BB
1433 }
1434}
1435
34dc7c2f 1436typedef struct {
428870ff
BB
1437 dbuf_dirty_record_t *dsa_dr;
1438 dmu_sync_cb_t *dsa_done;
1439 zgd_t *dsa_zgd;
1440 dmu_tx_t *dsa_tx;
34dc7c2f
BB
1441} dmu_sync_arg_t;
1442
b128c09f
BB
1443/* ARGSUSED */
1444static void
1445dmu_sync_ready(zio_t *zio, arc_buf_t *buf, void *varg)
1446{
428870ff
BB
1447 dmu_sync_arg_t *dsa = varg;
1448 dmu_buf_t *db = dsa->dsa_zgd->zgd_db;
b128c09f
BB
1449 blkptr_t *bp = zio->io_bp;
1450
428870ff
BB
1451 if (zio->io_error == 0) {
1452 if (BP_IS_HOLE(bp)) {
1453 /*
1454 * A block of zeros may compress to a hole, but the
1455 * block size still needs to be known for replay.
1456 */
1457 BP_SET_LSIZE(bp, db->db_size);
1458 } else {
428870ff
BB
1459 ASSERT(BP_GET_LEVEL(bp) == 0);
1460 bp->blk_fill = 1;
1461 }
b128c09f
BB
1462 }
1463}
1464
428870ff
BB
1465static void
1466dmu_sync_late_arrival_ready(zio_t *zio)
1467{
1468 dmu_sync_ready(zio, NULL, zio->io_private);
1469}
1470
34dc7c2f
BB
1471/* ARGSUSED */
1472static void
1473dmu_sync_done(zio_t *zio, arc_buf_t *buf, void *varg)
1474{
428870ff
BB
1475 dmu_sync_arg_t *dsa = varg;
1476 dbuf_dirty_record_t *dr = dsa->dsa_dr;
34dc7c2f 1477 dmu_buf_impl_t *db = dr->dr_dbuf;
34dc7c2f 1478
34dc7c2f
BB
1479 mutex_enter(&db->db_mtx);
1480 ASSERT(dr->dt.dl.dr_override_state == DR_IN_DMU_SYNC);
428870ff 1481 if (zio->io_error == 0) {
03c6040b
GW
1482 dr->dt.dl.dr_nopwrite = !!(zio->io_flags & ZIO_FLAG_NOPWRITE);
1483 if (dr->dt.dl.dr_nopwrite) {
1484 ASSERTV(blkptr_t *bp = zio->io_bp);
1485 ASSERTV(blkptr_t *bp_orig = &zio->io_bp_orig);
1486 ASSERTV(uint8_t chksum = BP_GET_CHECKSUM(bp_orig));
1487
1488 ASSERT(BP_EQUAL(bp, bp_orig));
1489 ASSERT(zio->io_prop.zp_compress != ZIO_COMPRESS_OFF);
1490 ASSERT(zio_checksum_table[chksum].ci_dedup);
1491 }
428870ff
BB
1492 dr->dt.dl.dr_overridden_by = *zio->io_bp;
1493 dr->dt.dl.dr_override_state = DR_OVERRIDDEN;
1494 dr->dt.dl.dr_copies = zio->io_prop.zp_copies;
1495 if (BP_IS_HOLE(&dr->dt.dl.dr_overridden_by))
1496 BP_ZERO(&dr->dt.dl.dr_overridden_by);
1497 } else {
1498 dr->dt.dl.dr_override_state = DR_NOT_OVERRIDDEN;
1499 }
34dc7c2f
BB
1500 cv_broadcast(&db->db_changed);
1501 mutex_exit(&db->db_mtx);
1502
428870ff 1503 dsa->dsa_done(dsa->dsa_zgd, zio->io_error);
34dc7c2f 1504
428870ff
BB
1505 kmem_free(dsa, sizeof (*dsa));
1506}
1507
1508static void
1509dmu_sync_late_arrival_done(zio_t *zio)
1510{
1511 blkptr_t *bp = zio->io_bp;
1512 dmu_sync_arg_t *dsa = zio->io_private;
03c6040b 1513 ASSERTV(blkptr_t *bp_orig = &zio->io_bp_orig);
428870ff
BB
1514
1515 if (zio->io_error == 0 && !BP_IS_HOLE(bp)) {
03c6040b
GW
1516 /*
1517 * If we didn't allocate a new block (i.e. ZIO_FLAG_NOPWRITE)
1518 * then there is nothing to do here. Otherwise, free the
1519 * newly allocated block in this txg.
1520 */
1521 if (zio->io_flags & ZIO_FLAG_NOPWRITE) {
1522 ASSERT(BP_EQUAL(bp, bp_orig));
1523 } else {
1524 ASSERT(BP_IS_HOLE(bp_orig) || !BP_EQUAL(bp, bp_orig));
1525 ASSERT(zio->io_bp->blk_birth == zio->io_txg);
1526 ASSERT(zio->io_txg > spa_syncing_txg(zio->io_spa));
1527 zio_free(zio->io_spa, zio->io_txg, zio->io_bp);
1528 }
428870ff
BB
1529 }
1530
1531 dmu_tx_commit(dsa->dsa_tx);
1532
1533 dsa->dsa_done(dsa->dsa_zgd, zio->io_error);
1534
1535 kmem_free(dsa, sizeof (*dsa));
1536}
1537
1538static int
1539dmu_sync_late_arrival(zio_t *pio, objset_t *os, dmu_sync_cb_t *done, zgd_t *zgd,
1540 zio_prop_t *zp, zbookmark_t *zb)
1541{
1542 dmu_sync_arg_t *dsa;
1543 dmu_tx_t *tx;
1544
1545 tx = dmu_tx_create(os);
1546 dmu_tx_hold_space(tx, zgd->zgd_db->db_size);
1547 if (dmu_tx_assign(tx, TXG_WAIT) != 0) {
1548 dmu_tx_abort(tx);
2e528b49
MA
1549 /* Make zl_get_data do txg_waited_synced() */
1550 return (SET_ERROR(EIO));
428870ff
BB
1551 }
1552
b8d06fca 1553 dsa = kmem_alloc(sizeof (dmu_sync_arg_t), KM_PUSHPAGE);
428870ff
BB
1554 dsa->dsa_dr = NULL;
1555 dsa->dsa_done = done;
1556 dsa->dsa_zgd = zgd;
1557 dsa->dsa_tx = tx;
1558
1559 zio_nowait(zio_write(pio, os->os_spa, dmu_tx_get_txg(tx), zgd->zgd_bp,
1560 zgd->zgd_db->db_data, zgd->zgd_db->db_size, zp,
1561 dmu_sync_late_arrival_ready, dmu_sync_late_arrival_done, dsa,
920dd524 1562 ZIO_PRIORITY_SYNC_WRITE, ZIO_FLAG_CANFAIL | ZIO_FLAG_FASTWRITE, zb));
428870ff
BB
1563
1564 return (0);
34dc7c2f
BB
1565}
1566
1567/*
1568 * Intent log support: sync the block associated with db to disk.
1569 * N.B. and XXX: the caller is responsible for making sure that the
1570 * data isn't changing while dmu_sync() is writing it.
1571 *
1572 * Return values:
1573 *
03c6040b 1574 * EEXIST: this txg has already been synced, so there's nothing to do.
34dc7c2f
BB
1575 * The caller should not log the write.
1576 *
1577 * ENOENT: the block was dbuf_free_range()'d, so there's nothing to do.
1578 * The caller should not log the write.
1579 *
1580 * EALREADY: this block is already in the process of being synced.
1581 * The caller should track its progress (somehow).
1582 *
428870ff
BB
1583 * EIO: could not do the I/O.
1584 * The caller should do a txg_wait_synced().
34dc7c2f 1585 *
428870ff
BB
1586 * 0: the I/O has been initiated.
1587 * The caller should log this blkptr in the done callback.
1588 * It is possible that the I/O will fail, in which case
1589 * the error will be reported to the done callback and
1590 * propagated to pio from zio_done().
34dc7c2f
BB
1591 */
1592int
428870ff 1593dmu_sync(zio_t *pio, uint64_t txg, dmu_sync_cb_t *done, zgd_t *zgd)
34dc7c2f 1594{
428870ff
BB
1595 blkptr_t *bp = zgd->zgd_bp;
1596 dmu_buf_impl_t *db = (dmu_buf_impl_t *)zgd->zgd_db;
1597 objset_t *os = db->db_objset;
1598 dsl_dataset_t *ds = os->os_dsl_dataset;
34dc7c2f 1599 dbuf_dirty_record_t *dr;
428870ff 1600 dmu_sync_arg_t *dsa;
34dc7c2f 1601 zbookmark_t zb;
428870ff 1602 zio_prop_t zp;
572e2857 1603 dnode_t *dn;
34dc7c2f 1604
428870ff 1605 ASSERT(pio != NULL);
34dc7c2f
BB
1606 ASSERT(txg != 0);
1607
428870ff
BB
1608 SET_BOOKMARK(&zb, ds->ds_object,
1609 db->db.db_object, db->db_level, db->db_blkid);
1610
572e2857
BB
1611 DB_DNODE_ENTER(db);
1612 dn = DB_DNODE(db);
1613 dmu_write_policy(os, dn, db->db_level, WP_DMU_SYNC, &zp);
1614 DB_DNODE_EXIT(db);
34dc7c2f
BB
1615
1616 /*
428870ff 1617 * If we're frozen (running ziltest), we always need to generate a bp.
34dc7c2f 1618 */
428870ff
BB
1619 if (txg > spa_freeze_txg(os->os_spa))
1620 return (dmu_sync_late_arrival(pio, os, done, zgd, &zp, &zb));
34dc7c2f
BB
1621
1622 /*
428870ff
BB
1623 * Grabbing db_mtx now provides a barrier between dbuf_sync_leaf()
1624 * and us. If we determine that this txg is not yet syncing,
1625 * but it begins to sync a moment later, that's OK because the
1626 * sync thread will block in dbuf_sync_leaf() until we drop db_mtx.
34dc7c2f 1627 */
428870ff
BB
1628 mutex_enter(&db->db_mtx);
1629
1630 if (txg <= spa_last_synced_txg(os->os_spa)) {
34dc7c2f 1631 /*
428870ff 1632 * This txg has already synced. There's nothing to do.
34dc7c2f 1633 */
428870ff 1634 mutex_exit(&db->db_mtx);
2e528b49 1635 return (SET_ERROR(EEXIST));
34dc7c2f
BB
1636 }
1637
428870ff
BB
1638 if (txg <= spa_syncing_txg(os->os_spa)) {
1639 /*
1640 * This txg is currently syncing, so we can't mess with
1641 * the dirty record anymore; just write a new log block.
1642 */
1643 mutex_exit(&db->db_mtx);
1644 return (dmu_sync_late_arrival(pio, os, done, zgd, &zp, &zb));
34dc7c2f
BB
1645 }
1646
1647 dr = db->db_last_dirty;
428870ff 1648 while (dr && dr->dr_txg != txg)
34dc7c2f 1649 dr = dr->dr_next;
428870ff
BB
1650
1651 if (dr == NULL) {
34dc7c2f 1652 /*
428870ff 1653 * There's no dr for this dbuf, so it must have been freed.
34dc7c2f
BB
1654 * There's no need to log writes to freed blocks, so we're done.
1655 */
1656 mutex_exit(&db->db_mtx);
2e528b49 1657 return (SET_ERROR(ENOENT));
34dc7c2f
BB
1658 }
1659
03c6040b
GW
1660 ASSERT(dr->dr_next == NULL || dr->dr_next->dr_txg < txg);
1661
1662 /*
1663 * Assume the on-disk data is X, the current syncing data is Y,
1664 * and the current in-memory data is Z (currently in dmu_sync).
1665 * X and Z are identical but Y is has been modified. Normally,
1666 * when X and Z are the same we will perform a nopwrite but if Y
1667 * is different we must disable nopwrite since the resulting write
1668 * of Y to disk can free the block containing X. If we allowed a
1669 * nopwrite to occur the block pointing to Z would reference a freed
1670 * block. Since this is a rare case we simplify this by disabling
1671 * nopwrite if the current dmu_sync-ing dbuf has been modified in
1672 * a previous transaction.
1673 */
1674 if (dr->dr_next)
1675 zp.zp_nopwrite = B_FALSE;
1676
34dc7c2f 1677 ASSERT(dr->dr_txg == txg);
428870ff
BB
1678 if (dr->dt.dl.dr_override_state == DR_IN_DMU_SYNC ||
1679 dr->dt.dl.dr_override_state == DR_OVERRIDDEN) {
34dc7c2f 1680 /*
428870ff
BB
1681 * We have already issued a sync write for this buffer,
1682 * or this buffer has already been synced. It could not
34dc7c2f
BB
1683 * have been dirtied since, or we would have cleared the state.
1684 */
34dc7c2f 1685 mutex_exit(&db->db_mtx);
2e528b49 1686 return (SET_ERROR(EALREADY));
34dc7c2f
BB
1687 }
1688
428870ff 1689 ASSERT(dr->dt.dl.dr_override_state == DR_NOT_OVERRIDDEN);
34dc7c2f 1690 dr->dt.dl.dr_override_state = DR_IN_DMU_SYNC;
34dc7c2f 1691 mutex_exit(&db->db_mtx);
34dc7c2f 1692
b8d06fca 1693 dsa = kmem_alloc(sizeof (dmu_sync_arg_t), KM_PUSHPAGE);
428870ff
BB
1694 dsa->dsa_dr = dr;
1695 dsa->dsa_done = done;
1696 dsa->dsa_zgd = zgd;
1697 dsa->dsa_tx = NULL;
b128c09f 1698
428870ff 1699 zio_nowait(arc_write(pio, os->os_spa, txg,
3a17a7a9
SK
1700 bp, dr->dt.dl.dr_data, DBUF_IS_L2CACHEABLE(db),
1701 DBUF_IS_L2COMPRESSIBLE(db), &zp, dmu_sync_ready, dmu_sync_done,
1702 dsa, ZIO_PRIORITY_SYNC_WRITE, ZIO_FLAG_CANFAIL | ZIO_FLAG_FASTWRITE, &zb));
b128c09f 1703
428870ff 1704 return (0);
34dc7c2f
BB
1705}
1706
1707int
1708dmu_object_set_blocksize(objset_t *os, uint64_t object, uint64_t size, int ibs,
1709 dmu_tx_t *tx)
1710{
1711 dnode_t *dn;
1712 int err;
1713
428870ff 1714 err = dnode_hold(os, object, FTAG, &dn);
34dc7c2f
BB
1715 if (err)
1716 return (err);
1717 err = dnode_set_blksz(dn, size, ibs, tx);
1718 dnode_rele(dn, FTAG);
1719 return (err);
1720}
1721
1722void
1723dmu_object_set_checksum(objset_t *os, uint64_t object, uint8_t checksum,
1724 dmu_tx_t *tx)
1725{
1726 dnode_t *dn;
1727
1728 /* XXX assumes dnode_hold will not get an i/o error */
428870ff 1729 (void) dnode_hold(os, object, FTAG, &dn);
34dc7c2f
BB
1730 ASSERT(checksum < ZIO_CHECKSUM_FUNCTIONS);
1731 dn->dn_checksum = checksum;
1732 dnode_setdirty(dn, tx);
1733 dnode_rele(dn, FTAG);
1734}
1735
1736void
1737dmu_object_set_compress(objset_t *os, uint64_t object, uint8_t compress,
1738 dmu_tx_t *tx)
1739{
1740 dnode_t *dn;
1741
1742 /* XXX assumes dnode_hold will not get an i/o error */
428870ff 1743 (void) dnode_hold(os, object, FTAG, &dn);
34dc7c2f
BB
1744 ASSERT(compress < ZIO_COMPRESS_FUNCTIONS);
1745 dn->dn_compress = compress;
1746 dnode_setdirty(dn, tx);
1747 dnode_rele(dn, FTAG);
1748}
1749
428870ff
BB
1750int zfs_mdcomp_disable = 0;
1751
1752void
1753dmu_write_policy(objset_t *os, dnode_t *dn, int level, int wp, zio_prop_t *zp)
1754{
1755 dmu_object_type_t type = dn ? dn->dn_type : DMU_OT_OBJSET;
9ae529ec 1756 boolean_t ismd = (level > 0 || DMU_OT_IS_METADATA(type) ||
572e2857 1757 (wp & WP_SPILL));
428870ff
BB
1758 enum zio_checksum checksum = os->os_checksum;
1759 enum zio_compress compress = os->os_compress;
1760 enum zio_checksum dedup_checksum = os->os_dedup_checksum;
03c6040b
GW
1761 boolean_t dedup = B_FALSE;
1762 boolean_t nopwrite = B_FALSE;
428870ff
BB
1763 boolean_t dedup_verify = os->os_dedup_verify;
1764 int copies = os->os_copies;
1765
1766 /*
03c6040b
GW
1767 * We maintain different write policies for each of the following
1768 * types of data:
1769 * 1. metadata
1770 * 2. preallocated blocks (i.e. level-0 blocks of a dump device)
1771 * 3. all other level 0 blocks
428870ff
BB
1772 */
1773 if (ismd) {
03c6040b
GW
1774 /*
1775 * XXX -- we should design a compression algorithm
1776 * that specializes in arrays of bps.
1777 */
1778 compress = zfs_mdcomp_disable ? ZIO_COMPRESS_EMPTY :
1779 ZIO_COMPRESS_LZJB;
1780
428870ff
BB
1781 /*
1782 * Metadata always gets checksummed. If the data
1783 * checksum is multi-bit correctable, and it's not a
1784 * ZBT-style checksum, then it's suitable for metadata
1785 * as well. Otherwise, the metadata checksum defaults
1786 * to fletcher4.
1787 */
1788 if (zio_checksum_table[checksum].ci_correctable < 1 ||
1789 zio_checksum_table[checksum].ci_eck)
1790 checksum = ZIO_CHECKSUM_FLETCHER_4;
03c6040b
GW
1791 } else if (wp & WP_NOFILL) {
1792 ASSERT(level == 0);
428870ff 1793
428870ff 1794 /*
03c6040b
GW
1795 * If we're writing preallocated blocks, we aren't actually
1796 * writing them so don't set any policy properties. These
1797 * blocks are currently only used by an external subsystem
1798 * outside of zfs (i.e. dump) and not written by the zio
1799 * pipeline.
428870ff 1800 */
03c6040b
GW
1801 compress = ZIO_COMPRESS_OFF;
1802 checksum = ZIO_CHECKSUM_OFF;
428870ff
BB
1803 } else {
1804 compress = zio_compress_select(dn->dn_compress, compress);
428870ff 1805
03c6040b
GW
1806 checksum = (dedup_checksum == ZIO_CHECKSUM_OFF) ?
1807 zio_checksum_select(dn->dn_checksum, checksum) :
1808 dedup_checksum;
428870ff 1809
03c6040b
GW
1810 /*
1811 * Determine dedup setting. If we are in dmu_sync(),
1812 * we won't actually dedup now because that's all
1813 * done in syncing context; but we do want to use the
1814 * dedup checkum. If the checksum is not strong
1815 * enough to ensure unique signatures, force
1816 * dedup_verify.
1817 */
1818 if (dedup_checksum != ZIO_CHECKSUM_OFF) {
1819 dedup = (wp & WP_DMU_SYNC) ? B_FALSE : B_TRUE;
1820 if (!zio_checksum_table[checksum].ci_dedup)
1821 dedup_verify = B_TRUE;
1822 }
428870ff 1823
03c6040b
GW
1824 /*
1825 * Enable nopwrite if we have a cryptographically secure
1826 * checksum that has no known collisions (i.e. SHA-256)
1827 * and compression is enabled. We don't enable nopwrite if
1828 * dedup is enabled as the two features are mutually exclusive.
1829 */
1830 nopwrite = (!dedup && zio_checksum_table[checksum].ci_dedup &&
1831 compress != ZIO_COMPRESS_OFF && zfs_nopwrite_enabled);
428870ff
BB
1832 }
1833
1834 zp->zp_checksum = checksum;
1835 zp->zp_compress = compress;
1836 zp->zp_type = (wp & WP_SPILL) ? dn->dn_bonustype : type;
1837 zp->zp_level = level;
1838 zp->zp_copies = MIN(copies + ismd, spa_max_replication(os->os_spa));
1839 zp->zp_dedup = dedup;
1840 zp->zp_dedup_verify = dedup && dedup_verify;
03c6040b 1841 zp->zp_nopwrite = nopwrite;
428870ff
BB
1842}
1843
34dc7c2f
BB
1844int
1845dmu_offset_next(objset_t *os, uint64_t object, boolean_t hole, uint64_t *off)
1846{
1847 dnode_t *dn;
1848 int i, err;
1849
428870ff 1850 err = dnode_hold(os, object, FTAG, &dn);
34dc7c2f
BB
1851 if (err)
1852 return (err);
1853 /*
1854 * Sync any current changes before
1855 * we go trundling through the block pointers.
1856 */
1857 for (i = 0; i < TXG_SIZE; i++) {
1858 if (list_link_active(&dn->dn_dirty_link[i]))
1859 break;
1860 }
1861 if (i != TXG_SIZE) {
1862 dnode_rele(dn, FTAG);
1863 txg_wait_synced(dmu_objset_pool(os), 0);
428870ff 1864 err = dnode_hold(os, object, FTAG, &dn);
34dc7c2f
BB
1865 if (err)
1866 return (err);
1867 }
1868
b128c09f 1869 err = dnode_next_offset(dn, (hole ? DNODE_FIND_HOLE : 0), off, 1, 1, 0);
34dc7c2f
BB
1870 dnode_rele(dn, FTAG);
1871
1872 return (err);
1873}
1874
1875void
e0b0ca98 1876__dmu_object_info_from_dnode(dnode_t *dn, dmu_object_info_t *doi)
34dc7c2f 1877{
e0b0ca98 1878 dnode_phys_t *dnp = dn->dn_phys;
d6320ddb 1879 int i;
428870ff 1880
34dc7c2f
BB
1881 doi->doi_data_block_size = dn->dn_datablksz;
1882 doi->doi_metadata_block_size = dn->dn_indblkshift ?
1883 1ULL << dn->dn_indblkshift : 0;
428870ff
BB
1884 doi->doi_type = dn->dn_type;
1885 doi->doi_bonus_type = dn->dn_bonustype;
1886 doi->doi_bonus_size = dn->dn_bonuslen;
34dc7c2f
BB
1887 doi->doi_indirection = dn->dn_nlevels;
1888 doi->doi_checksum = dn->dn_checksum;
1889 doi->doi_compress = dn->dn_compress;
428870ff 1890 doi->doi_physical_blocks_512 = (DN_USED_BYTES(dnp) + 256) >> 9;
d1fada1e 1891 doi->doi_max_offset = (dn->dn_maxblkid + 1) * dn->dn_datablksz;
428870ff 1892 doi->doi_fill_count = 0;
d6320ddb 1893 for (i = 0; i < dnp->dn_nblkptr; i++)
428870ff 1894 doi->doi_fill_count += dnp->dn_blkptr[i].blk_fill;
e0b0ca98
BB
1895}
1896
1897void
1898dmu_object_info_from_dnode(dnode_t *dn, dmu_object_info_t *doi)
1899{
1900 rw_enter(&dn->dn_struct_rwlock, RW_READER);
1901 mutex_enter(&dn->dn_mtx);
1902
1903 __dmu_object_info_from_dnode(dn, doi);
34dc7c2f
BB
1904
1905 mutex_exit(&dn->dn_mtx);
1906 rw_exit(&dn->dn_struct_rwlock);
1907}
1908
1909/*
1910 * Get information on a DMU object.
1911 * If doi is NULL, just indicates whether the object exists.
1912 */
1913int
1914dmu_object_info(objset_t *os, uint64_t object, dmu_object_info_t *doi)
1915{
1916 dnode_t *dn;
428870ff 1917 int err = dnode_hold(os, object, FTAG, &dn);
34dc7c2f
BB
1918
1919 if (err)
1920 return (err);
1921
1922 if (doi != NULL)
1923 dmu_object_info_from_dnode(dn, doi);
1924
1925 dnode_rele(dn, FTAG);
1926 return (0);
1927}
1928
1929/*
1930 * As above, but faster; can be used when you have a held dbuf in hand.
1931 */
1932void
572e2857 1933dmu_object_info_from_db(dmu_buf_t *db_fake, dmu_object_info_t *doi)
34dc7c2f 1934{
572e2857
BB
1935 dmu_buf_impl_t *db = (dmu_buf_impl_t *)db_fake;
1936
1937 DB_DNODE_ENTER(db);
1938 dmu_object_info_from_dnode(DB_DNODE(db), doi);
1939 DB_DNODE_EXIT(db);
34dc7c2f
BB
1940}
1941
1942/*
1943 * Faster still when you only care about the size.
1944 * This is specifically optimized for zfs_getattr().
1945 */
1946void
572e2857
BB
1947dmu_object_size_from_db(dmu_buf_t *db_fake, uint32_t *blksize,
1948 u_longlong_t *nblk512)
34dc7c2f 1949{
572e2857
BB
1950 dmu_buf_impl_t *db = (dmu_buf_impl_t *)db_fake;
1951 dnode_t *dn;
1952
1953 DB_DNODE_ENTER(db);
1954 dn = DB_DNODE(db);
34dc7c2f
BB
1955
1956 *blksize = dn->dn_datablksz;
1957 /* add 1 for dnode space */
1958 *nblk512 = ((DN_USED_BYTES(dn->dn_phys) + SPA_MINBLOCKSIZE/2) >>
1959 SPA_MINBLOCKSHIFT) + 1;
572e2857 1960 DB_DNODE_EXIT(db);
34dc7c2f
BB
1961}
1962
1963void
1964byteswap_uint64_array(void *vbuf, size_t size)
1965{
1966 uint64_t *buf = vbuf;
1967 size_t count = size >> 3;
1968 int i;
1969
1970 ASSERT((size & 7) == 0);
1971
1972 for (i = 0; i < count; i++)
1973 buf[i] = BSWAP_64(buf[i]);
1974}
1975
1976void
1977byteswap_uint32_array(void *vbuf, size_t size)
1978{
1979 uint32_t *buf = vbuf;
1980 size_t count = size >> 2;
1981 int i;
1982
1983 ASSERT((size & 3) == 0);
1984
1985 for (i = 0; i < count; i++)
1986 buf[i] = BSWAP_32(buf[i]);
1987}
1988
1989void
1990byteswap_uint16_array(void *vbuf, size_t size)
1991{
1992 uint16_t *buf = vbuf;
1993 size_t count = size >> 1;
1994 int i;
1995
1996 ASSERT((size & 1) == 0);
1997
1998 for (i = 0; i < count; i++)
1999 buf[i] = BSWAP_16(buf[i]);
2000}
2001
2002/* ARGSUSED */
2003void
2004byteswap_uint8_array(void *vbuf, size_t size)
2005{
2006}
2007
2008void
2009dmu_init(void)
2010{
428870ff 2011 zfs_dbgmsg_init();
572e2857
BB
2012 sa_cache_init();
2013 xuio_stat_init();
2014 dmu_objset_init();
34dc7c2f 2015 dnode_init();
572e2857 2016 dbuf_init();
428870ff 2017 zfetch_init();
570827e1 2018 dmu_tx_init();
34dc7c2f 2019 l2arc_init();
29809a6c 2020 arc_init();
34dc7c2f
BB
2021}
2022
2023void
2024dmu_fini(void)
2025{
e49f1e20 2026 arc_fini(); /* arc depends on l2arc, so arc must go first */
29809a6c 2027 l2arc_fini();
570827e1 2028 dmu_tx_fini();
428870ff 2029 zfetch_fini();
34dc7c2f 2030 dbuf_fini();
572e2857
BB
2031 dnode_fini();
2032 dmu_objset_fini();
428870ff
BB
2033 xuio_stat_fini();
2034 sa_cache_fini();
2035 zfs_dbgmsg_fini();
34dc7c2f 2036}
c28b2279
BB
2037
2038#if defined(_KERNEL) && defined(HAVE_SPL)
2039EXPORT_SYMBOL(dmu_bonus_hold);
a473d90c
AZ
2040EXPORT_SYMBOL(dmu_buf_hold_array_by_bonus);
2041EXPORT_SYMBOL(dmu_buf_rele_array);
57b650b8 2042EXPORT_SYMBOL(dmu_prefetch);
c28b2279 2043EXPORT_SYMBOL(dmu_free_range);
57b650b8
BB
2044EXPORT_SYMBOL(dmu_free_long_range);
2045EXPORT_SYMBOL(dmu_free_object);
c28b2279
BB
2046EXPORT_SYMBOL(dmu_read);
2047EXPORT_SYMBOL(dmu_write);
57b650b8 2048EXPORT_SYMBOL(dmu_prealloc);
c28b2279
BB
2049EXPORT_SYMBOL(dmu_object_info);
2050EXPORT_SYMBOL(dmu_object_info_from_dnode);
2051EXPORT_SYMBOL(dmu_object_info_from_db);
2052EXPORT_SYMBOL(dmu_object_size_from_db);
c28b2279
BB
2053EXPORT_SYMBOL(dmu_object_set_blocksize);
2054EXPORT_SYMBOL(dmu_object_set_checksum);
2055EXPORT_SYMBOL(dmu_object_set_compress);
57b650b8
BB
2056EXPORT_SYMBOL(dmu_write_policy);
2057EXPORT_SYMBOL(dmu_sync);
b10c77f7
BB
2058EXPORT_SYMBOL(dmu_request_arcbuf);
2059EXPORT_SYMBOL(dmu_return_arcbuf);
2060EXPORT_SYMBOL(dmu_assign_arcbuf);
2061EXPORT_SYMBOL(dmu_buf_hold);
c28b2279 2062EXPORT_SYMBOL(dmu_ot);
afec56b4
BB
2063
2064module_param(zfs_mdcomp_disable, int, 0644);
2065MODULE_PARM_DESC(zfs_mdcomp_disable, "Disable meta data compression");
03c6040b
GW
2066
2067module_param(zfs_nopwrite_enabled, int, 0644);
2068MODULE_PARM_DESC(zfs_nopwrite_enabled, "Enable NOP writes");
2069
c28b2279 2070#endif