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