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.
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.
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]
22 * Copyright (c) 2005, 2010, Oracle and/or its affiliates. All rights reserved.
23 * Copyright (c) 2012, 2015 by Delphix. All rights reserved.
26 #include <sys/zfs_context.h>
28 #include <sys/dnode.h>
30 #include <sys/dmu_impl.h>
31 #include <sys/dmu_tx.h>
32 #include <sys/dmu_objset.h>
33 #include <sys/dsl_dir.h>
34 #include <sys/dsl_dataset.h>
37 #include <sys/dmu_zfetch.h>
38 #include <sys/range_tree.h>
40 static kmem_cache_t *dnode_cache;
42 * Define DNODE_STATS to turn on statistic gathering. By default, it is only
43 * turned on when DEBUG is also defined.
50 #define DNODE_STAT_ADD(stat) ((stat)++)
52 #define DNODE_STAT_ADD(stat) /* nothing */
53 #endif /* DNODE_STATS */
55 static dnode_phys_t dnode_phys_zero;
57 int zfs_default_bs = SPA_MINBLOCKSHIFT;
58 int zfs_default_ibs = DN_MAX_INDBLKSHIFT;
61 static kmem_cbrc_t dnode_move(void *, void *, size_t, void *);
65 dbuf_compare(const void *x1, const void *x2)
67 const dmu_buf_impl_t *d1 = x1;
68 const dmu_buf_impl_t *d2 = x2;
70 if (d1->db_level < d2->db_level) {
73 if (d1->db_level > d2->db_level) {
77 if (d1->db_blkid < d2->db_blkid) {
80 if (d1->db_blkid > d2->db_blkid) {
84 if (d1->db_state == DB_SEARCH) {
85 ASSERT3S(d2->db_state, !=, DB_SEARCH);
87 } else if (d2->db_state == DB_SEARCH) {
88 ASSERT3S(d1->db_state, !=, DB_SEARCH);
92 if ((uintptr_t)d1 < (uintptr_t)d2) {
95 if ((uintptr_t)d1 > (uintptr_t)d2) {
103 dnode_cons(void *arg, void *unused, int kmflag)
108 rw_init(&dn->dn_struct_rwlock, NULL, RW_DEFAULT, NULL);
109 mutex_init(&dn->dn_mtx, NULL, MUTEX_DEFAULT, NULL);
110 mutex_init(&dn->dn_dbufs_mtx, NULL, MUTEX_DEFAULT, NULL);
111 cv_init(&dn->dn_notxholds, NULL, CV_DEFAULT, NULL);
114 * Every dbuf has a reference, and dropping a tracked reference is
115 * O(number of references), so don't track dn_holds.
117 refcount_create_untracked(&dn->dn_holds);
118 refcount_create(&dn->dn_tx_holds);
119 list_link_init(&dn->dn_link);
121 bzero(&dn->dn_next_nblkptr[0], sizeof (dn->dn_next_nblkptr));
122 bzero(&dn->dn_next_nlevels[0], sizeof (dn->dn_next_nlevels));
123 bzero(&dn->dn_next_indblkshift[0], sizeof (dn->dn_next_indblkshift));
124 bzero(&dn->dn_next_bonustype[0], sizeof (dn->dn_next_bonustype));
125 bzero(&dn->dn_rm_spillblk[0], sizeof (dn->dn_rm_spillblk));
126 bzero(&dn->dn_next_bonuslen[0], sizeof (dn->dn_next_bonuslen));
127 bzero(&dn->dn_next_blksz[0], sizeof (dn->dn_next_blksz));
129 for (i = 0; i < TXG_SIZE; i++) {
130 list_link_init(&dn->dn_dirty_link[i]);
131 dn->dn_free_ranges[i] = NULL;
132 list_create(&dn->dn_dirty_records[i],
133 sizeof (dbuf_dirty_record_t),
134 offsetof(dbuf_dirty_record_t, dr_dirty_node));
137 dn->dn_allocated_txg = 0;
139 dn->dn_assigned_txg = 0;
141 dn->dn_dirtyctx_firstset = NULL;
143 dn->dn_have_spill = B_FALSE;
153 dn->dn_dbufs_count = 0;
154 dn->dn_unlisted_l0_blkid = 0;
155 avl_create(&dn->dn_dbufs, dbuf_compare, sizeof (dmu_buf_impl_t),
156 offsetof(dmu_buf_impl_t, db_link));
159 POINTER_INVALIDATE(&dn->dn_objset);
165 dnode_dest(void *arg, void *unused)
170 rw_destroy(&dn->dn_struct_rwlock);
171 mutex_destroy(&dn->dn_mtx);
172 mutex_destroy(&dn->dn_dbufs_mtx);
173 cv_destroy(&dn->dn_notxholds);
174 refcount_destroy(&dn->dn_holds);
175 refcount_destroy(&dn->dn_tx_holds);
176 ASSERT(!list_link_active(&dn->dn_link));
178 for (i = 0; i < TXG_SIZE; i++) {
179 ASSERT(!list_link_active(&dn->dn_dirty_link[i]));
180 ASSERT3P(dn->dn_free_ranges[i], ==, NULL);
181 list_destroy(&dn->dn_dirty_records[i]);
182 ASSERT0(dn->dn_next_nblkptr[i]);
183 ASSERT0(dn->dn_next_nlevels[i]);
184 ASSERT0(dn->dn_next_indblkshift[i]);
185 ASSERT0(dn->dn_next_bonustype[i]);
186 ASSERT0(dn->dn_rm_spillblk[i]);
187 ASSERT0(dn->dn_next_bonuslen[i]);
188 ASSERT0(dn->dn_next_blksz[i]);
191 ASSERT0(dn->dn_allocated_txg);
192 ASSERT0(dn->dn_free_txg);
193 ASSERT0(dn->dn_assigned_txg);
194 ASSERT0(dn->dn_dirtyctx);
195 ASSERT3P(dn->dn_dirtyctx_firstset, ==, NULL);
196 ASSERT3P(dn->dn_bonus, ==, NULL);
197 ASSERT(!dn->dn_have_spill);
198 ASSERT3P(dn->dn_zio, ==, NULL);
199 ASSERT0(dn->dn_oldused);
200 ASSERT0(dn->dn_oldflags);
201 ASSERT0(dn->dn_olduid);
202 ASSERT0(dn->dn_oldgid);
203 ASSERT0(dn->dn_newuid);
204 ASSERT0(dn->dn_newgid);
205 ASSERT0(dn->dn_id_flags);
207 ASSERT0(dn->dn_dbufs_count);
208 ASSERT0(dn->dn_unlisted_l0_blkid);
209 avl_destroy(&dn->dn_dbufs);
215 ASSERT(dnode_cache == NULL);
216 dnode_cache = kmem_cache_create("dnode_t",
218 0, dnode_cons, dnode_dest, NULL, NULL, NULL, 0);
219 kmem_cache_set_move(dnode_cache, dnode_move);
225 kmem_cache_destroy(dnode_cache);
232 dnode_verify(dnode_t *dn)
234 int drop_struct_lock = FALSE;
237 ASSERT(dn->dn_objset);
238 ASSERT(dn->dn_handle->dnh_dnode == dn);
240 ASSERT(DMU_OT_IS_VALID(dn->dn_phys->dn_type));
242 if (!(zfs_flags & ZFS_DEBUG_DNODE_VERIFY))
245 if (!RW_WRITE_HELD(&dn->dn_struct_rwlock)) {
246 rw_enter(&dn->dn_struct_rwlock, RW_READER);
247 drop_struct_lock = TRUE;
249 if (dn->dn_phys->dn_type != DMU_OT_NONE || dn->dn_allocated_txg != 0) {
251 ASSERT3U(dn->dn_indblkshift, >=, 0);
252 ASSERT3U(dn->dn_indblkshift, <=, SPA_MAXBLOCKSHIFT);
253 if (dn->dn_datablkshift) {
254 ASSERT3U(dn->dn_datablkshift, >=, SPA_MINBLOCKSHIFT);
255 ASSERT3U(dn->dn_datablkshift, <=, SPA_MAXBLOCKSHIFT);
256 ASSERT3U(1<<dn->dn_datablkshift, ==, dn->dn_datablksz);
258 ASSERT3U(dn->dn_nlevels, <=, 30);
259 ASSERT(DMU_OT_IS_VALID(dn->dn_type));
260 ASSERT3U(dn->dn_nblkptr, >=, 1);
261 ASSERT3U(dn->dn_nblkptr, <=, DN_MAX_NBLKPTR);
262 ASSERT3U(dn->dn_bonuslen, <=, DN_MAX_BONUSLEN);
263 ASSERT3U(dn->dn_datablksz, ==,
264 dn->dn_datablkszsec << SPA_MINBLOCKSHIFT);
265 ASSERT3U(ISP2(dn->dn_datablksz), ==, dn->dn_datablkshift != 0);
266 ASSERT3U((dn->dn_nblkptr - 1) * sizeof (blkptr_t) +
267 dn->dn_bonuslen, <=, DN_MAX_BONUSLEN);
268 for (i = 0; i < TXG_SIZE; i++) {
269 ASSERT3U(dn->dn_next_nlevels[i], <=, dn->dn_nlevels);
272 if (dn->dn_phys->dn_type != DMU_OT_NONE)
273 ASSERT3U(dn->dn_phys->dn_nlevels, <=, dn->dn_nlevels);
274 ASSERT(DMU_OBJECT_IS_SPECIAL(dn->dn_object) || dn->dn_dbuf != NULL);
275 if (dn->dn_dbuf != NULL) {
276 ASSERT3P(dn->dn_phys, ==,
277 (dnode_phys_t *)dn->dn_dbuf->db.db_data +
278 (dn->dn_object % (dn->dn_dbuf->db.db_size >> DNODE_SHIFT)));
280 if (drop_struct_lock)
281 rw_exit(&dn->dn_struct_rwlock);
286 dnode_byteswap(dnode_phys_t *dnp)
288 uint64_t *buf64 = (void*)&dnp->dn_blkptr;
291 if (dnp->dn_type == DMU_OT_NONE) {
292 bzero(dnp, sizeof (dnode_phys_t));
296 dnp->dn_datablkszsec = BSWAP_16(dnp->dn_datablkszsec);
297 dnp->dn_bonuslen = BSWAP_16(dnp->dn_bonuslen);
298 dnp->dn_maxblkid = BSWAP_64(dnp->dn_maxblkid);
299 dnp->dn_used = BSWAP_64(dnp->dn_used);
302 * dn_nblkptr is only one byte, so it's OK to read it in either
303 * byte order. We can't read dn_bouslen.
305 ASSERT(dnp->dn_indblkshift <= SPA_MAXBLOCKSHIFT);
306 ASSERT(dnp->dn_nblkptr <= DN_MAX_NBLKPTR);
307 for (i = 0; i < dnp->dn_nblkptr * sizeof (blkptr_t)/8; i++)
308 buf64[i] = BSWAP_64(buf64[i]);
311 * OK to check dn_bonuslen for zero, because it won't matter if
312 * we have the wrong byte order. This is necessary because the
313 * dnode dnode is smaller than a regular dnode.
315 if (dnp->dn_bonuslen != 0) {
317 * Note that the bonus length calculated here may be
318 * longer than the actual bonus buffer. This is because
319 * we always put the bonus buffer after the last block
320 * pointer (instead of packing it against the end of the
323 int off = (dnp->dn_nblkptr-1) * sizeof (blkptr_t);
324 size_t len = DN_MAX_BONUSLEN - off;
325 ASSERT(DMU_OT_IS_VALID(dnp->dn_bonustype));
326 dmu_object_byteswap_t byteswap =
327 DMU_OT_BYTESWAP(dnp->dn_bonustype);
328 dmu_ot_byteswap[byteswap].ob_func(dnp->dn_bonus + off, len);
331 /* Swap SPILL block if we have one */
332 if (dnp->dn_flags & DNODE_FLAG_SPILL_BLKPTR)
333 byteswap_uint64_array(&dnp->dn_spill, sizeof (blkptr_t));
338 dnode_buf_byteswap(void *vbuf, size_t size)
340 dnode_phys_t *buf = vbuf;
343 ASSERT3U(sizeof (dnode_phys_t), ==, (1<<DNODE_SHIFT));
344 ASSERT((size & (sizeof (dnode_phys_t)-1)) == 0);
346 size >>= DNODE_SHIFT;
347 for (i = 0; i < size; i++) {
354 dnode_setbonuslen(dnode_t *dn, int newsize, dmu_tx_t *tx)
356 ASSERT3U(refcount_count(&dn->dn_holds), >=, 1);
358 dnode_setdirty(dn, tx);
359 rw_enter(&dn->dn_struct_rwlock, RW_WRITER);
360 ASSERT3U(newsize, <=, DN_MAX_BONUSLEN -
361 (dn->dn_nblkptr-1) * sizeof (blkptr_t));
362 dn->dn_bonuslen = newsize;
364 dn->dn_next_bonuslen[tx->tx_txg & TXG_MASK] = DN_ZERO_BONUSLEN;
366 dn->dn_next_bonuslen[tx->tx_txg & TXG_MASK] = dn->dn_bonuslen;
367 rw_exit(&dn->dn_struct_rwlock);
371 dnode_setbonus_type(dnode_t *dn, dmu_object_type_t newtype, dmu_tx_t *tx)
373 ASSERT3U(refcount_count(&dn->dn_holds), >=, 1);
374 dnode_setdirty(dn, tx);
375 rw_enter(&dn->dn_struct_rwlock, RW_WRITER);
376 dn->dn_bonustype = newtype;
377 dn->dn_next_bonustype[tx->tx_txg & TXG_MASK] = dn->dn_bonustype;
378 rw_exit(&dn->dn_struct_rwlock);
382 dnode_rm_spill(dnode_t *dn, dmu_tx_t *tx)
384 ASSERT3U(refcount_count(&dn->dn_holds), >=, 1);
385 ASSERT(RW_WRITE_HELD(&dn->dn_struct_rwlock));
386 dnode_setdirty(dn, tx);
387 dn->dn_rm_spillblk[tx->tx_txg&TXG_MASK] = DN_KILL_SPILLBLK;
388 dn->dn_have_spill = B_FALSE;
392 dnode_setdblksz(dnode_t *dn, int size)
394 ASSERT0(P2PHASE(size, SPA_MINBLOCKSIZE));
395 ASSERT3U(size, <=, SPA_MAXBLOCKSIZE);
396 ASSERT3U(size, >=, SPA_MINBLOCKSIZE);
397 ASSERT3U(size >> SPA_MINBLOCKSHIFT, <,
398 1<<(sizeof (dn->dn_phys->dn_datablkszsec) * 8));
399 dn->dn_datablksz = size;
400 dn->dn_datablkszsec = size >> SPA_MINBLOCKSHIFT;
401 dn->dn_datablkshift = ISP2(size) ? highbit64(size - 1) : 0;
405 dnode_create(objset_t *os, dnode_phys_t *dnp, dmu_buf_impl_t *db,
406 uint64_t object, dnode_handle_t *dnh)
408 dnode_t *dn = kmem_cache_alloc(dnode_cache, KM_SLEEP);
410 ASSERT(!POINTER_IS_VALID(dn->dn_objset));
414 * Defer setting dn_objset until the dnode is ready to be a candidate
415 * for the dnode_move() callback.
417 dn->dn_object = object;
422 if (dnp->dn_datablkszsec) {
423 dnode_setdblksz(dn, dnp->dn_datablkszsec << SPA_MINBLOCKSHIFT);
425 dn->dn_datablksz = 0;
426 dn->dn_datablkszsec = 0;
427 dn->dn_datablkshift = 0;
429 dn->dn_indblkshift = dnp->dn_indblkshift;
430 dn->dn_nlevels = dnp->dn_nlevels;
431 dn->dn_type = dnp->dn_type;
432 dn->dn_nblkptr = dnp->dn_nblkptr;
433 dn->dn_checksum = dnp->dn_checksum;
434 dn->dn_compress = dnp->dn_compress;
435 dn->dn_bonustype = dnp->dn_bonustype;
436 dn->dn_bonuslen = dnp->dn_bonuslen;
437 dn->dn_maxblkid = dnp->dn_maxblkid;
438 dn->dn_have_spill = ((dnp->dn_flags & DNODE_FLAG_SPILL_BLKPTR) != 0);
441 dmu_zfetch_init(&dn->dn_zfetch, dn);
443 ASSERT(DMU_OT_IS_VALID(dn->dn_phys->dn_type));
445 mutex_enter(&os->os_lock);
446 list_insert_head(&os->os_dnodes, dn);
449 * Everything else must be valid before assigning dn_objset makes the
450 * dnode eligible for dnode_move().
453 mutex_exit(&os->os_lock);
455 arc_space_consume(sizeof (dnode_t), ARC_SPACE_OTHER);
460 * Caller must be holding the dnode handle, which is released upon return.
463 dnode_destroy(dnode_t *dn)
465 objset_t *os = dn->dn_objset;
467 ASSERT((dn->dn_id_flags & DN_ID_NEW_EXIST) == 0);
469 mutex_enter(&os->os_lock);
470 POINTER_INVALIDATE(&dn->dn_objset);
471 list_remove(&os->os_dnodes, dn);
472 mutex_exit(&os->os_lock);
474 /* the dnode can no longer move, so we can release the handle */
475 zrl_remove(&dn->dn_handle->dnh_zrlock);
477 dn->dn_allocated_txg = 0;
479 dn->dn_assigned_txg = 0;
482 if (dn->dn_dirtyctx_firstset != NULL) {
483 kmem_free(dn->dn_dirtyctx_firstset, 1);
484 dn->dn_dirtyctx_firstset = NULL;
486 if (dn->dn_bonus != NULL) {
487 mutex_enter(&dn->dn_bonus->db_mtx);
488 dbuf_evict(dn->dn_bonus);
493 dn->dn_have_spill = B_FALSE;
501 dn->dn_unlisted_l0_blkid = 0;
503 dmu_zfetch_rele(&dn->dn_zfetch);
504 kmem_cache_free(dnode_cache, dn);
505 arc_space_return(sizeof (dnode_t), ARC_SPACE_OTHER);
509 dnode_allocate(dnode_t *dn, dmu_object_type_t ot, int blocksize, int ibs,
510 dmu_object_type_t bonustype, int bonuslen, dmu_tx_t *tx)
514 ASSERT3U(blocksize, <=,
515 spa_maxblocksize(dmu_objset_spa(dn->dn_objset)));
517 blocksize = 1 << zfs_default_bs;
519 blocksize = P2ROUNDUP(blocksize, SPA_MINBLOCKSIZE);
522 ibs = zfs_default_ibs;
524 ibs = MIN(MAX(ibs, DN_MIN_INDBLKSHIFT), DN_MAX_INDBLKSHIFT);
526 dprintf("os=%p obj=%llu txg=%llu blocksize=%d ibs=%d\n", dn->dn_objset,
527 dn->dn_object, tx->tx_txg, blocksize, ibs);
529 ASSERT(dn->dn_type == DMU_OT_NONE);
530 ASSERT(bcmp(dn->dn_phys, &dnode_phys_zero, sizeof (dnode_phys_t)) == 0);
531 ASSERT(dn->dn_phys->dn_type == DMU_OT_NONE);
532 ASSERT(ot != DMU_OT_NONE);
533 ASSERT(DMU_OT_IS_VALID(ot));
534 ASSERT((bonustype == DMU_OT_NONE && bonuslen == 0) ||
535 (bonustype == DMU_OT_SA && bonuslen == 0) ||
536 (bonustype != DMU_OT_NONE && bonuslen != 0));
537 ASSERT(DMU_OT_IS_VALID(bonustype));
538 ASSERT3U(bonuslen, <=, DN_MAX_BONUSLEN);
539 ASSERT(dn->dn_type == DMU_OT_NONE);
540 ASSERT0(dn->dn_maxblkid);
541 ASSERT0(dn->dn_allocated_txg);
542 ASSERT0(dn->dn_assigned_txg);
543 ASSERT(refcount_is_zero(&dn->dn_tx_holds));
544 ASSERT3U(refcount_count(&dn->dn_holds), <=, 1);
545 ASSERT(avl_is_empty(&dn->dn_dbufs));
547 for (i = 0; i < TXG_SIZE; i++) {
548 ASSERT0(dn->dn_next_nblkptr[i]);
549 ASSERT0(dn->dn_next_nlevels[i]);
550 ASSERT0(dn->dn_next_indblkshift[i]);
551 ASSERT0(dn->dn_next_bonuslen[i]);
552 ASSERT0(dn->dn_next_bonustype[i]);
553 ASSERT0(dn->dn_rm_spillblk[i]);
554 ASSERT0(dn->dn_next_blksz[i]);
555 ASSERT(!list_link_active(&dn->dn_dirty_link[i]));
556 ASSERT3P(list_head(&dn->dn_dirty_records[i]), ==, NULL);
557 ASSERT3P(dn->dn_free_ranges[i], ==, NULL);
561 dnode_setdblksz(dn, blocksize);
562 dn->dn_indblkshift = ibs;
564 if (bonustype == DMU_OT_SA) /* Maximize bonus space for SA */
568 ((DN_MAX_BONUSLEN - bonuslen) >> SPA_BLKPTRSHIFT);
569 dn->dn_bonustype = bonustype;
570 dn->dn_bonuslen = bonuslen;
571 dn->dn_checksum = ZIO_CHECKSUM_INHERIT;
572 dn->dn_compress = ZIO_COMPRESS_INHERIT;
576 if (dn->dn_dirtyctx_firstset) {
577 kmem_free(dn->dn_dirtyctx_firstset, 1);
578 dn->dn_dirtyctx_firstset = NULL;
581 dn->dn_allocated_txg = tx->tx_txg;
584 dnode_setdirty(dn, tx);
585 dn->dn_next_indblkshift[tx->tx_txg & TXG_MASK] = ibs;
586 dn->dn_next_bonuslen[tx->tx_txg & TXG_MASK] = dn->dn_bonuslen;
587 dn->dn_next_bonustype[tx->tx_txg & TXG_MASK] = dn->dn_bonustype;
588 dn->dn_next_blksz[tx->tx_txg & TXG_MASK] = dn->dn_datablksz;
592 dnode_reallocate(dnode_t *dn, dmu_object_type_t ot, int blocksize,
593 dmu_object_type_t bonustype, int bonuslen, dmu_tx_t *tx)
597 ASSERT3U(blocksize, >=, SPA_MINBLOCKSIZE);
598 ASSERT3U(blocksize, <=,
599 spa_maxblocksize(dmu_objset_spa(dn->dn_objset)));
600 ASSERT0(blocksize % SPA_MINBLOCKSIZE);
601 ASSERT(dn->dn_object != DMU_META_DNODE_OBJECT || dmu_tx_private_ok(tx));
602 ASSERT(tx->tx_txg != 0);
603 ASSERT((bonustype == DMU_OT_NONE && bonuslen == 0) ||
604 (bonustype != DMU_OT_NONE && bonuslen != 0) ||
605 (bonustype == DMU_OT_SA && bonuslen == 0));
606 ASSERT(DMU_OT_IS_VALID(bonustype));
607 ASSERT3U(bonuslen, <=, DN_MAX_BONUSLEN);
609 /* clean up any unreferenced dbufs */
610 dnode_evict_dbufs(dn);
614 rw_enter(&dn->dn_struct_rwlock, RW_WRITER);
615 dnode_setdirty(dn, tx);
616 if (dn->dn_datablksz != blocksize) {
617 /* change blocksize */
618 ASSERT(dn->dn_maxblkid == 0 &&
619 (BP_IS_HOLE(&dn->dn_phys->dn_blkptr[0]) ||
620 dnode_block_freed(dn, 0)));
621 dnode_setdblksz(dn, blocksize);
622 dn->dn_next_blksz[tx->tx_txg&TXG_MASK] = blocksize;
624 if (dn->dn_bonuslen != bonuslen)
625 dn->dn_next_bonuslen[tx->tx_txg&TXG_MASK] = bonuslen;
627 if (bonustype == DMU_OT_SA) /* Maximize bonus space for SA */
630 nblkptr = 1 + ((DN_MAX_BONUSLEN - bonuslen) >> SPA_BLKPTRSHIFT);
631 if (dn->dn_bonustype != bonustype)
632 dn->dn_next_bonustype[tx->tx_txg&TXG_MASK] = bonustype;
633 if (dn->dn_nblkptr != nblkptr)
634 dn->dn_next_nblkptr[tx->tx_txg&TXG_MASK] = nblkptr;
635 if (dn->dn_phys->dn_flags & DNODE_FLAG_SPILL_BLKPTR) {
636 dbuf_rm_spill(dn, tx);
637 dnode_rm_spill(dn, tx);
639 rw_exit(&dn->dn_struct_rwlock);
644 /* change bonus size and type */
645 mutex_enter(&dn->dn_mtx);
646 dn->dn_bonustype = bonustype;
647 dn->dn_bonuslen = bonuslen;
648 dn->dn_nblkptr = nblkptr;
649 dn->dn_checksum = ZIO_CHECKSUM_INHERIT;
650 dn->dn_compress = ZIO_COMPRESS_INHERIT;
651 ASSERT3U(dn->dn_nblkptr, <=, DN_MAX_NBLKPTR);
653 /* fix up the bonus db_size */
655 dn->dn_bonus->db.db_size =
656 DN_MAX_BONUSLEN - (dn->dn_nblkptr-1) * sizeof (blkptr_t);
657 ASSERT(dn->dn_bonuslen <= dn->dn_bonus->db.db_size);
660 dn->dn_allocated_txg = tx->tx_txg;
661 mutex_exit(&dn->dn_mtx);
666 uint64_t dms_dnode_invalid;
667 uint64_t dms_dnode_recheck1;
668 uint64_t dms_dnode_recheck2;
669 uint64_t dms_dnode_special;
670 uint64_t dms_dnode_handle;
671 uint64_t dms_dnode_rwlock;
672 uint64_t dms_dnode_active;
674 #endif /* DNODE_STATS */
677 dnode_move_impl(dnode_t *odn, dnode_t *ndn)
681 ASSERT(!RW_LOCK_HELD(&odn->dn_struct_rwlock));
682 ASSERT(MUTEX_NOT_HELD(&odn->dn_mtx));
683 ASSERT(MUTEX_NOT_HELD(&odn->dn_dbufs_mtx));
684 ASSERT(!RW_LOCK_HELD(&odn->dn_zfetch.zf_rwlock));
687 ndn->dn_objset = odn->dn_objset;
688 ndn->dn_object = odn->dn_object;
689 ndn->dn_dbuf = odn->dn_dbuf;
690 ndn->dn_handle = odn->dn_handle;
691 ndn->dn_phys = odn->dn_phys;
692 ndn->dn_type = odn->dn_type;
693 ndn->dn_bonuslen = odn->dn_bonuslen;
694 ndn->dn_bonustype = odn->dn_bonustype;
695 ndn->dn_nblkptr = odn->dn_nblkptr;
696 ndn->dn_checksum = odn->dn_checksum;
697 ndn->dn_compress = odn->dn_compress;
698 ndn->dn_nlevels = odn->dn_nlevels;
699 ndn->dn_indblkshift = odn->dn_indblkshift;
700 ndn->dn_datablkshift = odn->dn_datablkshift;
701 ndn->dn_datablkszsec = odn->dn_datablkszsec;
702 ndn->dn_datablksz = odn->dn_datablksz;
703 ndn->dn_maxblkid = odn->dn_maxblkid;
704 bcopy(&odn->dn_next_nblkptr[0], &ndn->dn_next_nblkptr[0],
705 sizeof (odn->dn_next_nblkptr));
706 bcopy(&odn->dn_next_nlevels[0], &ndn->dn_next_nlevels[0],
707 sizeof (odn->dn_next_nlevels));
708 bcopy(&odn->dn_next_indblkshift[0], &ndn->dn_next_indblkshift[0],
709 sizeof (odn->dn_next_indblkshift));
710 bcopy(&odn->dn_next_bonustype[0], &ndn->dn_next_bonustype[0],
711 sizeof (odn->dn_next_bonustype));
712 bcopy(&odn->dn_rm_spillblk[0], &ndn->dn_rm_spillblk[0],
713 sizeof (odn->dn_rm_spillblk));
714 bcopy(&odn->dn_next_bonuslen[0], &ndn->dn_next_bonuslen[0],
715 sizeof (odn->dn_next_bonuslen));
716 bcopy(&odn->dn_next_blksz[0], &ndn->dn_next_blksz[0],
717 sizeof (odn->dn_next_blksz));
718 for (i = 0; i < TXG_SIZE; i++) {
719 list_move_tail(&ndn->dn_dirty_records[i],
720 &odn->dn_dirty_records[i]);
722 bcopy(&odn->dn_free_ranges[0], &ndn->dn_free_ranges[0],
723 sizeof (odn->dn_free_ranges));
724 ndn->dn_allocated_txg = odn->dn_allocated_txg;
725 ndn->dn_free_txg = odn->dn_free_txg;
726 ndn->dn_assigned_txg = odn->dn_assigned_txg;
727 ndn->dn_dirtyctx = odn->dn_dirtyctx;
728 ndn->dn_dirtyctx_firstset = odn->dn_dirtyctx_firstset;
729 ASSERT(refcount_count(&odn->dn_tx_holds) == 0);
730 refcount_transfer(&ndn->dn_holds, &odn->dn_holds);
731 ASSERT(avl_is_empty(&ndn->dn_dbufs));
732 avl_swap(&ndn->dn_dbufs, &odn->dn_dbufs);
733 ndn->dn_dbufs_count = odn->dn_dbufs_count;
734 ndn->dn_unlisted_l0_blkid = odn->dn_unlisted_l0_blkid;
735 ndn->dn_bonus = odn->dn_bonus;
736 ndn->dn_have_spill = odn->dn_have_spill;
737 ndn->dn_zio = odn->dn_zio;
738 ndn->dn_oldused = odn->dn_oldused;
739 ndn->dn_oldflags = odn->dn_oldflags;
740 ndn->dn_olduid = odn->dn_olduid;
741 ndn->dn_oldgid = odn->dn_oldgid;
742 ndn->dn_newuid = odn->dn_newuid;
743 ndn->dn_newgid = odn->dn_newgid;
744 ndn->dn_id_flags = odn->dn_id_flags;
745 dmu_zfetch_init(&ndn->dn_zfetch, NULL);
746 list_move_tail(&ndn->dn_zfetch.zf_stream, &odn->dn_zfetch.zf_stream);
747 ndn->dn_zfetch.zf_dnode = odn->dn_zfetch.zf_dnode;
748 ndn->dn_zfetch.zf_stream_cnt = odn->dn_zfetch.zf_stream_cnt;
749 ndn->dn_zfetch.zf_alloc_fail = odn->dn_zfetch.zf_alloc_fail;
752 * Update back pointers. Updating the handle fixes the back pointer of
753 * every descendant dbuf as well as the bonus dbuf.
755 ASSERT(ndn->dn_handle->dnh_dnode == odn);
756 ndn->dn_handle->dnh_dnode = ndn;
757 if (ndn->dn_zfetch.zf_dnode == odn) {
758 ndn->dn_zfetch.zf_dnode = ndn;
762 * Invalidate the original dnode by clearing all of its back pointers.
765 odn->dn_handle = NULL;
766 avl_create(&odn->dn_dbufs, dbuf_compare, sizeof (dmu_buf_impl_t),
767 offsetof(dmu_buf_impl_t, db_link));
768 odn->dn_dbufs_count = 0;
769 odn->dn_unlisted_l0_blkid = 0;
770 odn->dn_bonus = NULL;
771 odn->dn_zfetch.zf_dnode = NULL;
774 * Set the low bit of the objset pointer to ensure that dnode_move()
775 * recognizes the dnode as invalid in any subsequent callback.
777 POINTER_INVALIDATE(&odn->dn_objset);
780 * Satisfy the destructor.
782 for (i = 0; i < TXG_SIZE; i++) {
783 list_create(&odn->dn_dirty_records[i],
784 sizeof (dbuf_dirty_record_t),
785 offsetof(dbuf_dirty_record_t, dr_dirty_node));
786 odn->dn_free_ranges[i] = NULL;
787 odn->dn_next_nlevels[i] = 0;
788 odn->dn_next_indblkshift[i] = 0;
789 odn->dn_next_bonustype[i] = 0;
790 odn->dn_rm_spillblk[i] = 0;
791 odn->dn_next_bonuslen[i] = 0;
792 odn->dn_next_blksz[i] = 0;
794 odn->dn_allocated_txg = 0;
795 odn->dn_free_txg = 0;
796 odn->dn_assigned_txg = 0;
797 odn->dn_dirtyctx = 0;
798 odn->dn_dirtyctx_firstset = NULL;
799 odn->dn_have_spill = B_FALSE;
802 odn->dn_oldflags = 0;
807 odn->dn_id_flags = 0;
813 odn->dn_moved = (uint8_t)-1;
820 dnode_move(void *buf, void *newbuf, size_t size, void *arg)
822 dnode_t *odn = buf, *ndn = newbuf;
828 * The dnode is on the objset's list of known dnodes if the objset
829 * pointer is valid. We set the low bit of the objset pointer when
830 * freeing the dnode to invalidate it, and the memory patterns written
831 * by kmem (baddcafe and deadbeef) set at least one of the two low bits.
832 * A newly created dnode sets the objset pointer last of all to indicate
833 * that the dnode is known and in a valid state to be moved by this
837 if (!POINTER_IS_VALID(os)) {
838 DNODE_STAT_ADD(dnode_move_stats.dms_dnode_invalid);
839 return (KMEM_CBRC_DONT_KNOW);
843 * Ensure that the objset does not go away during the move.
845 rw_enter(&os_lock, RW_WRITER);
846 if (os != odn->dn_objset) {
848 DNODE_STAT_ADD(dnode_move_stats.dms_dnode_recheck1);
849 return (KMEM_CBRC_DONT_KNOW);
853 * If the dnode is still valid, then so is the objset. We know that no
854 * valid objset can be freed while we hold os_lock, so we can safely
855 * ensure that the objset remains in use.
857 mutex_enter(&os->os_lock);
860 * Recheck the objset pointer in case the dnode was removed just before
861 * acquiring the lock.
863 if (os != odn->dn_objset) {
864 mutex_exit(&os->os_lock);
866 DNODE_STAT_ADD(dnode_move_stats.dms_dnode_recheck2);
867 return (KMEM_CBRC_DONT_KNOW);
871 * At this point we know that as long as we hold os->os_lock, the dnode
872 * cannot be freed and fields within the dnode can be safely accessed.
873 * The objset listing this dnode cannot go away as long as this dnode is
877 if (DMU_OBJECT_IS_SPECIAL(odn->dn_object)) {
878 mutex_exit(&os->os_lock);
879 DNODE_STAT_ADD(dnode_move_stats.dms_dnode_special);
880 return (KMEM_CBRC_NO);
882 ASSERT(odn->dn_dbuf != NULL); /* only "special" dnodes have no parent */
885 * Lock the dnode handle to prevent the dnode from obtaining any new
886 * holds. This also prevents the descendant dbufs and the bonus dbuf
887 * from accessing the dnode, so that we can discount their holds. The
888 * handle is safe to access because we know that while the dnode cannot
889 * go away, neither can its handle. Once we hold dnh_zrlock, we can
890 * safely move any dnode referenced only by dbufs.
892 if (!zrl_tryenter(&odn->dn_handle->dnh_zrlock)) {
893 mutex_exit(&os->os_lock);
894 DNODE_STAT_ADD(dnode_move_stats.dms_dnode_handle);
895 return (KMEM_CBRC_LATER);
899 * Ensure a consistent view of the dnode's holds and the dnode's dbufs.
900 * We need to guarantee that there is a hold for every dbuf in order to
901 * determine whether the dnode is actively referenced. Falsely matching
902 * a dbuf to an active hold would lead to an unsafe move. It's possible
903 * that a thread already having an active dnode hold is about to add a
904 * dbuf, and we can't compare hold and dbuf counts while the add is in
907 if (!rw_tryenter(&odn->dn_struct_rwlock, RW_WRITER)) {
908 zrl_exit(&odn->dn_handle->dnh_zrlock);
909 mutex_exit(&os->os_lock);
910 DNODE_STAT_ADD(dnode_move_stats.dms_dnode_rwlock);
911 return (KMEM_CBRC_LATER);
915 * A dbuf may be removed (evicted) without an active dnode hold. In that
916 * case, the dbuf count is decremented under the handle lock before the
917 * dbuf's hold is released. This order ensures that if we count the hold
918 * after the dbuf is removed but before its hold is released, we will
919 * treat the unmatched hold as active and exit safely. If we count the
920 * hold before the dbuf is removed, the hold is discounted, and the
921 * removal is blocked until the move completes.
923 refcount = refcount_count(&odn->dn_holds);
924 ASSERT(refcount >= 0);
925 dbufs = odn->dn_dbufs_count;
927 /* We can't have more dbufs than dnode holds. */
928 ASSERT3U(dbufs, <=, refcount);
929 DTRACE_PROBE3(dnode__move, dnode_t *, odn, int64_t, refcount,
932 if (refcount > dbufs) {
933 rw_exit(&odn->dn_struct_rwlock);
934 zrl_exit(&odn->dn_handle->dnh_zrlock);
935 mutex_exit(&os->os_lock);
936 DNODE_STAT_ADD(dnode_move_stats.dms_dnode_active);
937 return (KMEM_CBRC_LATER);
940 rw_exit(&odn->dn_struct_rwlock);
943 * At this point we know that anyone with a hold on the dnode is not
944 * actively referencing it. The dnode is known and in a valid state to
945 * move. We're holding the locks needed to execute the critical section.
947 dnode_move_impl(odn, ndn);
949 list_link_replace(&odn->dn_link, &ndn->dn_link);
950 /* If the dnode was safe to move, the refcount cannot have changed. */
951 ASSERT(refcount == refcount_count(&ndn->dn_holds));
952 ASSERT(dbufs == ndn->dn_dbufs_count);
953 zrl_exit(&ndn->dn_handle->dnh_zrlock); /* handle has moved */
954 mutex_exit(&os->os_lock);
956 return (KMEM_CBRC_YES);
962 dnode_special_close(dnode_handle_t *dnh)
964 dnode_t *dn = dnh->dnh_dnode;
967 * Wait for final references to the dnode to clear. This can
968 * only happen if the arc is asyncronously evicting state that
969 * has a hold on this dnode while we are trying to evict this
972 while (refcount_count(&dn->dn_holds) > 0)
974 zrl_add(&dnh->dnh_zrlock);
975 dnode_destroy(dn); /* implicit zrl_remove() */
976 zrl_destroy(&dnh->dnh_zrlock);
977 dnh->dnh_dnode = NULL;
981 dnode_special_open(objset_t *os, dnode_phys_t *dnp, uint64_t object,
984 dnode_t *dn = dnode_create(os, dnp, NULL, object, dnh);
986 zrl_init(&dnh->dnh_zrlock);
992 dnode_buf_pageout(dmu_buf_t *db, void *arg)
994 dnode_children_t *children_dnodes = arg;
996 int epb = db->db_size >> DNODE_SHIFT;
998 ASSERT(epb == children_dnodes->dnc_count);
1000 for (i = 0; i < epb; i++) {
1001 dnode_handle_t *dnh = &children_dnodes->dnc_children[i];
1005 * The dnode handle lock guards against the dnode moving to
1006 * another valid address, so there is no need here to guard
1007 * against changes to or from NULL.
1009 if (dnh->dnh_dnode == NULL) {
1010 zrl_destroy(&dnh->dnh_zrlock);
1014 zrl_add(&dnh->dnh_zrlock);
1015 dn = dnh->dnh_dnode;
1017 * If there are holds on this dnode, then there should
1018 * be holds on the dnode's containing dbuf as well; thus
1019 * it wouldn't be eligible for eviction and this function
1020 * would not have been called.
1022 ASSERT(refcount_is_zero(&dn->dn_holds));
1023 ASSERT(refcount_is_zero(&dn->dn_tx_holds));
1025 dnode_destroy(dn); /* implicit zrl_remove() */
1026 zrl_destroy(&dnh->dnh_zrlock);
1027 dnh->dnh_dnode = NULL;
1029 kmem_free(children_dnodes, sizeof (dnode_children_t) +
1030 epb * sizeof (dnode_handle_t));
1035 * EINVAL - invalid object number.
1037 * succeeds even for free dnodes.
1040 dnode_hold_impl(objset_t *os, uint64_t object, int flag,
1041 void *tag, dnode_t **dnp)
1044 int drop_struct_lock = FALSE;
1049 dnode_children_t *children_dnodes;
1050 dnode_handle_t *dnh;
1053 * If you are holding the spa config lock as writer, you shouldn't
1054 * be asking the DMU to do *anything* unless it's the root pool
1055 * which may require us to read from the root filesystem while
1056 * holding some (not all) of the locks as writer.
1058 ASSERT(spa_config_held(os->os_spa, SCL_ALL, RW_WRITER) == 0 ||
1059 (spa_is_root(os->os_spa) &&
1060 spa_config_held(os->os_spa, SCL_STATE, RW_WRITER)));
1062 if (object == DMU_USERUSED_OBJECT || object == DMU_GROUPUSED_OBJECT) {
1063 dn = (object == DMU_USERUSED_OBJECT) ?
1064 DMU_USERUSED_DNODE(os) : DMU_GROUPUSED_DNODE(os);
1066 return (SET_ERROR(ENOENT));
1068 if ((flag & DNODE_MUST_BE_ALLOCATED) && type == DMU_OT_NONE)
1069 return (SET_ERROR(ENOENT));
1070 if ((flag & DNODE_MUST_BE_FREE) && type != DMU_OT_NONE)
1071 return (SET_ERROR(EEXIST));
1073 (void) refcount_add(&dn->dn_holds, tag);
1078 if (object == 0 || object >= DN_MAX_OBJECT)
1079 return (SET_ERROR(EINVAL));
1081 mdn = DMU_META_DNODE(os);
1082 ASSERT(mdn->dn_object == DMU_META_DNODE_OBJECT);
1086 if (!RW_WRITE_HELD(&mdn->dn_struct_rwlock)) {
1087 rw_enter(&mdn->dn_struct_rwlock, RW_READER);
1088 drop_struct_lock = TRUE;
1091 blk = dbuf_whichblock(mdn, object * sizeof (dnode_phys_t));
1093 db = dbuf_hold(mdn, blk, FTAG);
1094 if (drop_struct_lock)
1095 rw_exit(&mdn->dn_struct_rwlock);
1097 return (SET_ERROR(EIO));
1098 err = dbuf_read(db, NULL, DB_RF_CANFAIL);
1100 dbuf_rele(db, FTAG);
1104 ASSERT3U(db->db.db_size, >=, 1<<DNODE_SHIFT);
1105 epb = db->db.db_size >> DNODE_SHIFT;
1107 idx = object & (epb-1);
1109 ASSERT(DB_DNODE(db)->dn_type == DMU_OT_DNODE);
1110 children_dnodes = dmu_buf_get_user(&db->db);
1111 if (children_dnodes == NULL) {
1113 dnode_children_t *winner;
1114 children_dnodes = kmem_zalloc(sizeof (dnode_children_t) +
1115 epb * sizeof (dnode_handle_t), KM_SLEEP);
1116 children_dnodes->dnc_count = epb;
1117 dnh = &children_dnodes->dnc_children[0];
1118 for (i = 0; i < epb; i++) {
1119 zrl_init(&dnh[i].dnh_zrlock);
1120 dnh[i].dnh_dnode = NULL;
1122 if (winner = dmu_buf_set_user(&db->db, children_dnodes,
1123 dnode_buf_pageout)) {
1125 for (i = 0; i < epb; i++) {
1126 zrl_destroy(&dnh[i].dnh_zrlock);
1129 kmem_free(children_dnodes, sizeof (dnode_children_t) +
1130 epb * sizeof (dnode_handle_t));
1131 children_dnodes = winner;
1134 ASSERT(children_dnodes->dnc_count == epb);
1136 dnh = &children_dnodes->dnc_children[idx];
1137 zrl_add(&dnh->dnh_zrlock);
1138 if ((dn = dnh->dnh_dnode) == NULL) {
1139 dnode_phys_t *phys = (dnode_phys_t *)db->db.db_data+idx;
1142 dn = dnode_create(os, phys, db, object, dnh);
1143 winner = atomic_cas_ptr(&dnh->dnh_dnode, NULL, dn);
1144 if (winner != NULL) {
1145 zrl_add(&dnh->dnh_zrlock);
1146 dnode_destroy(dn); /* implicit zrl_remove() */
1151 mutex_enter(&dn->dn_mtx);
1153 if (dn->dn_free_txg ||
1154 ((flag & DNODE_MUST_BE_ALLOCATED) && type == DMU_OT_NONE) ||
1155 ((flag & DNODE_MUST_BE_FREE) &&
1156 (type != DMU_OT_NONE || !refcount_is_zero(&dn->dn_holds)))) {
1157 mutex_exit(&dn->dn_mtx);
1158 zrl_remove(&dnh->dnh_zrlock);
1159 dbuf_rele(db, FTAG);
1160 return (type == DMU_OT_NONE ? ENOENT : EEXIST);
1162 mutex_exit(&dn->dn_mtx);
1164 if (refcount_add(&dn->dn_holds, tag) == 1)
1165 dbuf_add_ref(db, dnh);
1166 /* Now we can rely on the hold to prevent the dnode from moving. */
1167 zrl_remove(&dnh->dnh_zrlock);
1170 ASSERT3P(dn->dn_dbuf, ==, db);
1171 ASSERT3U(dn->dn_object, ==, object);
1172 dbuf_rele(db, FTAG);
1179 * Return held dnode if the object is allocated, NULL if not.
1182 dnode_hold(objset_t *os, uint64_t object, void *tag, dnode_t **dnp)
1184 return (dnode_hold_impl(os, object, DNODE_MUST_BE_ALLOCATED, tag, dnp));
1188 * Can only add a reference if there is already at least one
1189 * reference on the dnode. Returns FALSE if unable to add a
1193 dnode_add_ref(dnode_t *dn, void *tag)
1195 mutex_enter(&dn->dn_mtx);
1196 if (refcount_is_zero(&dn->dn_holds)) {
1197 mutex_exit(&dn->dn_mtx);
1200 VERIFY(1 < refcount_add(&dn->dn_holds, tag));
1201 mutex_exit(&dn->dn_mtx);
1206 dnode_rele(dnode_t *dn, void *tag)
1209 /* Get while the hold prevents the dnode from moving. */
1210 dmu_buf_impl_t *db = dn->dn_dbuf;
1211 dnode_handle_t *dnh = dn->dn_handle;
1213 mutex_enter(&dn->dn_mtx);
1214 refs = refcount_remove(&dn->dn_holds, tag);
1215 mutex_exit(&dn->dn_mtx);
1218 * It's unsafe to release the last hold on a dnode by dnode_rele() or
1219 * indirectly by dbuf_rele() while relying on the dnode handle to
1220 * prevent the dnode from moving, since releasing the last hold could
1221 * result in the dnode's parent dbuf evicting its dnode handles. For
1222 * that reason anyone calling dnode_rele() or dbuf_rele() without some
1223 * other direct or indirect hold on the dnode must first drop the dnode
1226 ASSERT(refs > 0 || dnh->dnh_zrlock.zr_owner != curthread);
1228 /* NOTE: the DNODE_DNODE does not have a dn_dbuf */
1229 if (refs == 0 && db != NULL) {
1231 * Another thread could add a hold to the dnode handle in
1232 * dnode_hold_impl() while holding the parent dbuf. Since the
1233 * hold on the parent dbuf prevents the handle from being
1234 * destroyed, the hold on the handle is OK. We can't yet assert
1235 * that the handle has zero references, but that will be
1236 * asserted anyway when the handle gets destroyed.
1243 dnode_setdirty(dnode_t *dn, dmu_tx_t *tx)
1245 objset_t *os = dn->dn_objset;
1246 uint64_t txg = tx->tx_txg;
1248 if (DMU_OBJECT_IS_SPECIAL(dn->dn_object)) {
1249 dsl_dataset_dirty(os->os_dsl_dataset, tx);
1256 mutex_enter(&dn->dn_mtx);
1257 ASSERT(dn->dn_phys->dn_type || dn->dn_allocated_txg);
1258 ASSERT(dn->dn_free_txg == 0 || dn->dn_free_txg >= txg);
1259 mutex_exit(&dn->dn_mtx);
1263 * Determine old uid/gid when necessary
1265 dmu_objset_userquota_get_ids(dn, B_TRUE, tx);
1267 mutex_enter(&os->os_lock);
1270 * If we are already marked dirty, we're done.
1272 if (list_link_active(&dn->dn_dirty_link[txg & TXG_MASK])) {
1273 mutex_exit(&os->os_lock);
1277 ASSERT(!refcount_is_zero(&dn->dn_holds) ||
1278 !avl_is_empty(&dn->dn_dbufs));
1279 ASSERT(dn->dn_datablksz != 0);
1280 ASSERT0(dn->dn_next_bonuslen[txg&TXG_MASK]);
1281 ASSERT0(dn->dn_next_blksz[txg&TXG_MASK]);
1282 ASSERT0(dn->dn_next_bonustype[txg&TXG_MASK]);
1284 dprintf_ds(os->os_dsl_dataset, "obj=%llu txg=%llu\n",
1285 dn->dn_object, txg);
1287 if (dn->dn_free_txg > 0 && dn->dn_free_txg <= txg) {
1288 list_insert_tail(&os->os_free_dnodes[txg&TXG_MASK], dn);
1290 list_insert_tail(&os->os_dirty_dnodes[txg&TXG_MASK], dn);
1293 mutex_exit(&os->os_lock);
1296 * The dnode maintains a hold on its containing dbuf as
1297 * long as there are holds on it. Each instantiated child
1298 * dbuf maintains a hold on the dnode. When the last child
1299 * drops its hold, the dnode will drop its hold on the
1300 * containing dbuf. We add a "dirty hold" here so that the
1301 * dnode will hang around after we finish processing its
1304 VERIFY(dnode_add_ref(dn, (void *)(uintptr_t)tx->tx_txg));
1306 (void) dbuf_dirty(dn->dn_dbuf, tx);
1308 dsl_dataset_dirty(os->os_dsl_dataset, tx);
1312 dnode_free(dnode_t *dn, dmu_tx_t *tx)
1314 int txgoff = tx->tx_txg & TXG_MASK;
1316 dprintf("dn=%p txg=%llu\n", dn, tx->tx_txg);
1318 /* we should be the only holder... hopefully */
1319 /* ASSERT3U(refcount_count(&dn->dn_holds), ==, 1); */
1321 mutex_enter(&dn->dn_mtx);
1322 if (dn->dn_type == DMU_OT_NONE || dn->dn_free_txg) {
1323 mutex_exit(&dn->dn_mtx);
1326 dn->dn_free_txg = tx->tx_txg;
1327 mutex_exit(&dn->dn_mtx);
1330 * If the dnode is already dirty, it needs to be moved from
1331 * the dirty list to the free list.
1333 mutex_enter(&dn->dn_objset->os_lock);
1334 if (list_link_active(&dn->dn_dirty_link[txgoff])) {
1335 list_remove(&dn->dn_objset->os_dirty_dnodes[txgoff], dn);
1336 list_insert_tail(&dn->dn_objset->os_free_dnodes[txgoff], dn);
1337 mutex_exit(&dn->dn_objset->os_lock);
1339 mutex_exit(&dn->dn_objset->os_lock);
1340 dnode_setdirty(dn, tx);
1345 * Try to change the block size for the indicated dnode. This can only
1346 * succeed if there are no blocks allocated or dirty beyond first block
1349 dnode_set_blksz(dnode_t *dn, uint64_t size, int ibs, dmu_tx_t *tx)
1354 ASSERT3U(size, <=, spa_maxblocksize(dmu_objset_spa(dn->dn_objset)));
1356 size = SPA_MINBLOCKSIZE;
1358 size = P2ROUNDUP(size, SPA_MINBLOCKSIZE);
1360 if (ibs == dn->dn_indblkshift)
1363 if (size >> SPA_MINBLOCKSHIFT == dn->dn_datablkszsec && ibs == 0)
1366 rw_enter(&dn->dn_struct_rwlock, RW_WRITER);
1368 /* Check for any allocated blocks beyond the first */
1369 if (dn->dn_maxblkid != 0)
1372 mutex_enter(&dn->dn_dbufs_mtx);
1373 for (db = avl_first(&dn->dn_dbufs); db != NULL;
1374 db = AVL_NEXT(&dn->dn_dbufs, db)) {
1375 if (db->db_blkid != 0 && db->db_blkid != DMU_BONUS_BLKID &&
1376 db->db_blkid != DMU_SPILL_BLKID) {
1377 mutex_exit(&dn->dn_dbufs_mtx);
1381 mutex_exit(&dn->dn_dbufs_mtx);
1383 if (ibs && dn->dn_nlevels != 1)
1386 /* resize the old block */
1387 err = dbuf_hold_impl(dn, 0, 0, TRUE, FTAG, &db);
1389 dbuf_new_size(db, size, tx);
1390 else if (err != ENOENT)
1393 dnode_setdblksz(dn, size);
1394 dnode_setdirty(dn, tx);
1395 dn->dn_next_blksz[tx->tx_txg&TXG_MASK] = size;
1397 dn->dn_indblkshift = ibs;
1398 dn->dn_next_indblkshift[tx->tx_txg&TXG_MASK] = ibs;
1400 /* rele after we have fixed the blocksize in the dnode */
1402 dbuf_rele(db, FTAG);
1404 rw_exit(&dn->dn_struct_rwlock);
1408 rw_exit(&dn->dn_struct_rwlock);
1409 return (SET_ERROR(ENOTSUP));
1412 /* read-holding callers must not rely on the lock being continuously held */
1414 dnode_new_blkid(dnode_t *dn, uint64_t blkid, dmu_tx_t *tx, boolean_t have_read)
1416 uint64_t txgoff = tx->tx_txg & TXG_MASK;
1417 int epbs, new_nlevels;
1420 ASSERT(blkid != DMU_BONUS_BLKID);
1423 RW_READ_HELD(&dn->dn_struct_rwlock) :
1424 RW_WRITE_HELD(&dn->dn_struct_rwlock));
1427 * if we have a read-lock, check to see if we need to do any work
1428 * before upgrading to a write-lock.
1431 if (blkid <= dn->dn_maxblkid)
1434 if (!rw_tryupgrade(&dn->dn_struct_rwlock)) {
1435 rw_exit(&dn->dn_struct_rwlock);
1436 rw_enter(&dn->dn_struct_rwlock, RW_WRITER);
1440 if (blkid <= dn->dn_maxblkid)
1443 dn->dn_maxblkid = blkid;
1446 * Compute the number of levels necessary to support the new maxblkid.
1449 epbs = dn->dn_indblkshift - SPA_BLKPTRSHIFT;
1450 for (sz = dn->dn_nblkptr;
1451 sz <= blkid && sz >= dn->dn_nblkptr; sz <<= epbs)
1454 if (new_nlevels > dn->dn_nlevels) {
1455 int old_nlevels = dn->dn_nlevels;
1458 dbuf_dirty_record_t *new, *dr, *dr_next;
1460 dn->dn_nlevels = new_nlevels;
1462 ASSERT3U(new_nlevels, >, dn->dn_next_nlevels[txgoff]);
1463 dn->dn_next_nlevels[txgoff] = new_nlevels;
1465 /* dirty the left indirects */
1466 db = dbuf_hold_level(dn, old_nlevels, 0, FTAG);
1468 new = dbuf_dirty(db, tx);
1469 dbuf_rele(db, FTAG);
1471 /* transfer the dirty records to the new indirect */
1472 mutex_enter(&dn->dn_mtx);
1473 mutex_enter(&new->dt.di.dr_mtx);
1474 list = &dn->dn_dirty_records[txgoff];
1475 for (dr = list_head(list); dr; dr = dr_next) {
1476 dr_next = list_next(&dn->dn_dirty_records[txgoff], dr);
1477 if (dr->dr_dbuf->db_level != new_nlevels-1 &&
1478 dr->dr_dbuf->db_blkid != DMU_BONUS_BLKID &&
1479 dr->dr_dbuf->db_blkid != DMU_SPILL_BLKID) {
1480 ASSERT(dr->dr_dbuf->db_level == old_nlevels-1);
1481 list_remove(&dn->dn_dirty_records[txgoff], dr);
1482 list_insert_tail(&new->dt.di.dr_children, dr);
1483 dr->dr_parent = new;
1486 mutex_exit(&new->dt.di.dr_mtx);
1487 mutex_exit(&dn->dn_mtx);
1492 rw_downgrade(&dn->dn_struct_rwlock);
1496 dnode_dirty_l1(dnode_t *dn, uint64_t l1blkid, dmu_tx_t *tx)
1498 dmu_buf_impl_t *db = dbuf_hold_level(dn, 1, l1blkid, FTAG);
1500 dmu_buf_will_dirty(&db->db, tx);
1501 dbuf_rele(db, FTAG);
1506 dnode_free_range(dnode_t *dn, uint64_t off, uint64_t len, dmu_tx_t *tx)
1509 uint64_t blkoff, blkid, nblks;
1510 int blksz, blkshift, head, tail;
1514 rw_enter(&dn->dn_struct_rwlock, RW_WRITER);
1515 blksz = dn->dn_datablksz;
1516 blkshift = dn->dn_datablkshift;
1517 epbs = dn->dn_indblkshift - SPA_BLKPTRSHIFT;
1519 if (len == DMU_OBJECT_END) {
1520 len = UINT64_MAX - off;
1525 * First, block align the region to free:
1528 head = P2NPHASE(off, blksz);
1529 blkoff = P2PHASE(off, blksz);
1530 if ((off >> blkshift) > dn->dn_maxblkid)
1533 ASSERT(dn->dn_maxblkid == 0);
1534 if (off == 0 && len >= blksz) {
1536 * Freeing the whole block; fast-track this request.
1537 * Note that we won't dirty any indirect blocks,
1538 * which is fine because we will be freeing the entire
1539 * file and thus all indirect blocks will be freed
1540 * by free_children().
1545 } else if (off >= blksz) {
1546 /* Freeing past end-of-data */
1549 /* Freeing part of the block. */
1551 ASSERT3U(head, >, 0);
1555 /* zero out any partial block data at the start of the range */
1557 ASSERT3U(blkoff + head, ==, blksz);
1560 if (dbuf_hold_impl(dn, 0, dbuf_whichblock(dn, off), TRUE,
1564 /* don't dirty if it isn't on disk and isn't dirty */
1565 if (db->db_last_dirty ||
1566 (db->db_blkptr && !BP_IS_HOLE(db->db_blkptr))) {
1567 rw_exit(&dn->dn_struct_rwlock);
1568 dmu_buf_will_dirty(&db->db, tx);
1569 rw_enter(&dn->dn_struct_rwlock, RW_WRITER);
1570 data = db->db.db_data;
1571 bzero(data + blkoff, head);
1573 dbuf_rele(db, FTAG);
1579 /* If the range was less than one block, we're done */
1583 /* If the remaining range is past end of file, we're done */
1584 if ((off >> blkshift) > dn->dn_maxblkid)
1587 ASSERT(ISP2(blksz));
1591 tail = P2PHASE(len, blksz);
1593 ASSERT0(P2PHASE(off, blksz));
1594 /* zero out any partial block data at the end of the range */
1598 if (dbuf_hold_impl(dn, 0, dbuf_whichblock(dn, off+len),
1599 TRUE, FTAG, &db) == 0) {
1600 /* don't dirty if not on disk and not dirty */
1601 if (db->db_last_dirty ||
1602 (db->db_blkptr && !BP_IS_HOLE(db->db_blkptr))) {
1603 rw_exit(&dn->dn_struct_rwlock);
1604 dmu_buf_will_dirty(&db->db, tx);
1605 rw_enter(&dn->dn_struct_rwlock, RW_WRITER);
1606 bzero(db->db.db_data, tail);
1608 dbuf_rele(db, FTAG);
1613 /* If the range did not include a full block, we are done */
1617 ASSERT(IS_P2ALIGNED(off, blksz));
1618 ASSERT(trunc || IS_P2ALIGNED(len, blksz));
1619 blkid = off >> blkshift;
1620 nblks = len >> blkshift;
1625 * Dirty all the indirect blocks in this range. Note that only
1626 * the first and last indirect blocks can actually be written
1627 * (if they were partially freed) -- they must be dirtied, even if
1628 * they do not exist on disk yet. The interior blocks will
1629 * be freed by free_children(), so they will not actually be written.
1630 * Even though these interior blocks will not be written, we
1631 * dirty them for two reasons:
1633 * - It ensures that the indirect blocks remain in memory until
1634 * syncing context. (They have already been prefetched by
1635 * dmu_tx_hold_free(), so we don't have to worry about reading
1636 * them serially here.)
1638 * - The dirty space accounting will put pressure on the txg sync
1639 * mechanism to begin syncing, and to delay transactions if there
1640 * is a large amount of freeing. Even though these indirect
1641 * blocks will not be written, we could need to write the same
1642 * amount of space if we copy the freed BPs into deadlists.
1644 if (dn->dn_nlevels > 1) {
1645 uint64_t first, last;
1647 first = blkid >> epbs;
1648 dnode_dirty_l1(dn, first, tx);
1650 last = dn->dn_maxblkid >> epbs;
1652 last = (blkid + nblks - 1) >> epbs;
1654 dnode_dirty_l1(dn, last, tx);
1656 int shift = dn->dn_datablkshift + dn->dn_indblkshift -
1658 for (uint64_t i = first + 1; i < last; i++) {
1660 * Set i to the blockid of the next non-hole
1661 * level-1 indirect block at or after i. Note
1662 * that dnode_next_offset() operates in terms of
1663 * level-0-equivalent bytes.
1665 uint64_t ibyte = i << shift;
1666 int err = dnode_next_offset(dn, DNODE_FIND_HAVELOCK,
1673 * Normally we should not see an error, either
1674 * from dnode_next_offset() or dbuf_hold_level()
1675 * (except for ESRCH from dnode_next_offset).
1676 * If there is an i/o error, then when we read
1677 * this block in syncing context, it will use
1678 * ZIO_FLAG_MUSTSUCCEED, and thus hang/panic according
1679 * to the "failmode" property. dnode_next_offset()
1680 * doesn't have a flag to indicate MUSTSUCCEED.
1685 dnode_dirty_l1(dn, i, tx);
1691 * Add this range to the dnode range list.
1692 * We will finish up this free operation in the syncing phase.
1694 mutex_enter(&dn->dn_mtx);
1695 int txgoff = tx->tx_txg & TXG_MASK;
1696 if (dn->dn_free_ranges[txgoff] == NULL) {
1697 dn->dn_free_ranges[txgoff] =
1698 range_tree_create(NULL, NULL, &dn->dn_mtx);
1700 range_tree_clear(dn->dn_free_ranges[txgoff], blkid, nblks);
1701 range_tree_add(dn->dn_free_ranges[txgoff], blkid, nblks);
1702 dprintf_dnode(dn, "blkid=%llu nblks=%llu txg=%llu\n",
1703 blkid, nblks, tx->tx_txg);
1704 mutex_exit(&dn->dn_mtx);
1706 dbuf_free_range(dn, blkid, blkid + nblks - 1, tx);
1707 dnode_setdirty(dn, tx);
1710 rw_exit(&dn->dn_struct_rwlock);
1714 dnode_spill_freed(dnode_t *dn)
1718 mutex_enter(&dn->dn_mtx);
1719 for (i = 0; i < TXG_SIZE; i++) {
1720 if (dn->dn_rm_spillblk[i] == DN_KILL_SPILLBLK)
1723 mutex_exit(&dn->dn_mtx);
1724 return (i < TXG_SIZE);
1727 /* return TRUE if this blkid was freed in a recent txg, or FALSE if it wasn't */
1729 dnode_block_freed(dnode_t *dn, uint64_t blkid)
1731 void *dp = spa_get_dsl(dn->dn_objset->os_spa);
1734 if (blkid == DMU_BONUS_BLKID)
1738 * If we're in the process of opening the pool, dp will not be
1739 * set yet, but there shouldn't be anything dirty.
1744 if (dn->dn_free_txg)
1747 if (blkid == DMU_SPILL_BLKID)
1748 return (dnode_spill_freed(dn));
1750 mutex_enter(&dn->dn_mtx);
1751 for (i = 0; i < TXG_SIZE; i++) {
1752 if (dn->dn_free_ranges[i] != NULL &&
1753 range_tree_contains(dn->dn_free_ranges[i], blkid, 1))
1756 mutex_exit(&dn->dn_mtx);
1757 return (i < TXG_SIZE);
1760 /* call from syncing context when we actually write/free space for this dnode */
1762 dnode_diduse_space(dnode_t *dn, int64_t delta)
1765 dprintf_dnode(dn, "dn=%p dnp=%p used=%llu delta=%lld\n",
1767 (u_longlong_t)dn->dn_phys->dn_used,
1770 mutex_enter(&dn->dn_mtx);
1771 space = DN_USED_BYTES(dn->dn_phys);
1773 ASSERT3U(space + delta, >=, space); /* no overflow */
1775 ASSERT3U(space, >=, -delta); /* no underflow */
1778 if (spa_version(dn->dn_objset->os_spa) < SPA_VERSION_DNODE_BYTES) {
1779 ASSERT((dn->dn_phys->dn_flags & DNODE_FLAG_USED_BYTES) == 0);
1780 ASSERT0(P2PHASE(space, 1<<DEV_BSHIFT));
1781 dn->dn_phys->dn_used = space >> DEV_BSHIFT;
1783 dn->dn_phys->dn_used = space;
1784 dn->dn_phys->dn_flags |= DNODE_FLAG_USED_BYTES;
1786 mutex_exit(&dn->dn_mtx);
1790 * Call when we think we're going to write/free space in open context to track
1791 * the amount of memory in use by the currently open txg.
1794 dnode_willuse_space(dnode_t *dn, int64_t space, dmu_tx_t *tx)
1796 objset_t *os = dn->dn_objset;
1797 dsl_dataset_t *ds = os->os_dsl_dataset;
1798 int64_t aspace = spa_get_asize(os->os_spa, space);
1801 dsl_dir_willuse_space(ds->ds_dir, aspace, tx);
1802 dsl_pool_dirty_space(dmu_tx_pool(tx), space, tx);
1805 dmu_tx_willuse_space(tx, aspace);
1809 * Scans a block at the indicated "level" looking for a hole or data,
1810 * depending on 'flags'.
1812 * If level > 0, then we are scanning an indirect block looking at its
1813 * pointers. If level == 0, then we are looking at a block of dnodes.
1815 * If we don't find what we are looking for in the block, we return ESRCH.
1816 * Otherwise, return with *offset pointing to the beginning (if searching
1817 * forwards) or end (if searching backwards) of the range covered by the
1818 * block pointer we matched on (or dnode).
1820 * The basic search algorithm used below by dnode_next_offset() is to
1821 * use this function to search up the block tree (widen the search) until
1822 * we find something (i.e., we don't return ESRCH) and then search back
1823 * down the tree (narrow the search) until we reach our original search
1827 dnode_next_offset_level(dnode_t *dn, int flags, uint64_t *offset,
1828 int lvl, uint64_t blkfill, uint64_t txg)
1830 dmu_buf_impl_t *db = NULL;
1832 uint64_t epbs = dn->dn_phys->dn_indblkshift - SPA_BLKPTRSHIFT;
1833 uint64_t epb = 1ULL << epbs;
1834 uint64_t minfill, maxfill;
1836 int i, inc, error, span;
1838 dprintf("probing object %llu offset %llx level %d of %u\n",
1839 dn->dn_object, *offset, lvl, dn->dn_phys->dn_nlevels);
1841 hole = ((flags & DNODE_FIND_HOLE) != 0);
1842 inc = (flags & DNODE_FIND_BACKWARDS) ? -1 : 1;
1843 ASSERT(txg == 0 || !hole);
1845 if (lvl == dn->dn_phys->dn_nlevels) {
1847 epb = dn->dn_phys->dn_nblkptr;
1848 data = dn->dn_phys->dn_blkptr;
1850 uint64_t blkid = dbuf_whichblock(dn, *offset) >> (epbs * lvl);
1851 error = dbuf_hold_impl(dn, lvl, blkid, TRUE, FTAG, &db);
1853 if (error != ENOENT)
1858 * This can only happen when we are searching up
1859 * the block tree for data. We don't really need to
1860 * adjust the offset, as we will just end up looking
1861 * at the pointer to this block in its parent, and its
1862 * going to be unallocated, so we will skip over it.
1864 return (SET_ERROR(ESRCH));
1866 error = dbuf_read(db, NULL, DB_RF_CANFAIL | DB_RF_HAVESTRUCT);
1868 dbuf_rele(db, FTAG);
1871 data = db->db.db_data;
1875 if (db != NULL && txg != 0 && (db->db_blkptr == NULL ||
1876 db->db_blkptr->blk_birth <= txg ||
1877 BP_IS_HOLE(db->db_blkptr))) {
1879 * This can only happen when we are searching up the tree
1880 * and these conditions mean that we need to keep climbing.
1882 error = SET_ERROR(ESRCH);
1883 } else if (lvl == 0) {
1884 dnode_phys_t *dnp = data;
1886 ASSERT(dn->dn_type == DMU_OT_DNODE);
1888 for (i = (*offset >> span) & (blkfill - 1);
1889 i >= 0 && i < blkfill; i += inc) {
1890 if ((dnp[i].dn_type == DMU_OT_NONE) == hole)
1892 *offset += (1ULL << span) * inc;
1894 if (i < 0 || i == blkfill)
1895 error = SET_ERROR(ESRCH);
1897 blkptr_t *bp = data;
1898 uint64_t start = *offset;
1899 span = (lvl - 1) * epbs + dn->dn_datablkshift;
1901 maxfill = blkfill << ((lvl - 1) * epbs);
1908 *offset = *offset >> span;
1909 for (i = BF64_GET(*offset, 0, epbs);
1910 i >= 0 && i < epb; i += inc) {
1911 if (BP_GET_FILL(&bp[i]) >= minfill &&
1912 BP_GET_FILL(&bp[i]) <= maxfill &&
1913 (hole || bp[i].blk_birth > txg))
1915 if (inc > 0 || *offset > 0)
1918 *offset = *offset << span;
1920 /* traversing backwards; position offset at the end */
1921 ASSERT3U(*offset, <=, start);
1922 *offset = MIN(*offset + (1ULL << span) - 1, start);
1923 } else if (*offset < start) {
1926 if (i < 0 || i >= epb)
1927 error = SET_ERROR(ESRCH);
1931 dbuf_rele(db, FTAG);
1937 * Find the next hole, data, or sparse region at or after *offset.
1938 * The value 'blkfill' tells us how many items we expect to find
1939 * in an L0 data block; this value is 1 for normal objects,
1940 * DNODES_PER_BLOCK for the meta dnode, and some fraction of
1941 * DNODES_PER_BLOCK when searching for sparse regions thereof.
1945 * dnode_next_offset(dn, flags, offset, 1, 1, 0);
1946 * Finds the next/previous hole/data in a file.
1947 * Used in dmu_offset_next().
1949 * dnode_next_offset(mdn, flags, offset, 0, DNODES_PER_BLOCK, txg);
1950 * Finds the next free/allocated dnode an objset's meta-dnode.
1951 * Only finds objects that have new contents since txg (ie.
1952 * bonus buffer changes and content removal are ignored).
1953 * Used in dmu_object_next().
1955 * dnode_next_offset(mdn, DNODE_FIND_HOLE, offset, 2, DNODES_PER_BLOCK >> 2, 0);
1956 * Finds the next L2 meta-dnode bp that's at most 1/4 full.
1957 * Used in dmu_object_alloc().
1960 dnode_next_offset(dnode_t *dn, int flags, uint64_t *offset,
1961 int minlvl, uint64_t blkfill, uint64_t txg)
1963 uint64_t initial_offset = *offset;
1967 if (!(flags & DNODE_FIND_HAVELOCK))
1968 rw_enter(&dn->dn_struct_rwlock, RW_READER);
1970 if (dn->dn_phys->dn_nlevels == 0) {
1971 error = SET_ERROR(ESRCH);
1975 if (dn->dn_datablkshift == 0) {
1976 if (*offset < dn->dn_datablksz) {
1977 if (flags & DNODE_FIND_HOLE)
1978 *offset = dn->dn_datablksz;
1980 error = SET_ERROR(ESRCH);
1985 maxlvl = dn->dn_phys->dn_nlevels;
1987 for (lvl = minlvl; lvl <= maxlvl; lvl++) {
1988 error = dnode_next_offset_level(dn,
1989 flags, offset, lvl, blkfill, txg);
1994 while (error == 0 && --lvl >= minlvl) {
1995 error = dnode_next_offset_level(dn,
1996 flags, offset, lvl, blkfill, txg);
2000 * There's always a "virtual hole" at the end of the object, even
2001 * if all BP's which physically exist are non-holes.
2003 if ((flags & DNODE_FIND_HOLE) && error == ESRCH && txg == 0 &&
2004 minlvl == 1 && blkfill == 1 && !(flags & DNODE_FIND_BACKWARDS)) {
2008 if (error == 0 && (flags & DNODE_FIND_BACKWARDS ?
2009 initial_offset < *offset : initial_offset > *offset))
2010 error = SET_ERROR(ESRCH);
2012 if (!(flags & DNODE_FIND_HAVELOCK))
2013 rw_exit(&dn->dn_struct_rwlock);