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, 2017 by Delphix. All rights reserved.
24 * Copyright (c) 2014 Spectra Logic Corporation, All rights reserved.
27 #include <sys/zfs_context.h>
29 #include <sys/dnode.h>
31 #include <sys/dmu_impl.h>
32 #include <sys/dmu_tx.h>
33 #include <sys/dmu_objset.h>
34 #include <sys/dsl_dir.h>
35 #include <sys/dsl_dataset.h>
38 #include <sys/dmu_zfetch.h>
39 #include <sys/range_tree.h>
40 #include <sys/trace_dnode.h>
41 #include <sys/zfs_project.h>
43 dnode_stats_t dnode_stats
= {
44 { "dnode_hold_dbuf_hold", KSTAT_DATA_UINT64
},
45 { "dnode_hold_dbuf_read", KSTAT_DATA_UINT64
},
46 { "dnode_hold_alloc_hits", KSTAT_DATA_UINT64
},
47 { "dnode_hold_alloc_misses", KSTAT_DATA_UINT64
},
48 { "dnode_hold_alloc_interior", KSTAT_DATA_UINT64
},
49 { "dnode_hold_alloc_lock_retry", KSTAT_DATA_UINT64
},
50 { "dnode_hold_alloc_lock_misses", KSTAT_DATA_UINT64
},
51 { "dnode_hold_alloc_type_none", KSTAT_DATA_UINT64
},
52 { "dnode_hold_free_hits", KSTAT_DATA_UINT64
},
53 { "dnode_hold_free_misses", KSTAT_DATA_UINT64
},
54 { "dnode_hold_free_lock_misses", KSTAT_DATA_UINT64
},
55 { "dnode_hold_free_lock_retry", KSTAT_DATA_UINT64
},
56 { "dnode_hold_free_overflow", KSTAT_DATA_UINT64
},
57 { "dnode_hold_free_refcount", KSTAT_DATA_UINT64
},
58 { "dnode_hold_free_txg", KSTAT_DATA_UINT64
},
59 { "dnode_free_interior_lock_retry", KSTAT_DATA_UINT64
},
60 { "dnode_allocate", KSTAT_DATA_UINT64
},
61 { "dnode_reallocate", KSTAT_DATA_UINT64
},
62 { "dnode_buf_evict", KSTAT_DATA_UINT64
},
63 { "dnode_alloc_next_chunk", KSTAT_DATA_UINT64
},
64 { "dnode_alloc_race", KSTAT_DATA_UINT64
},
65 { "dnode_alloc_next_block", KSTAT_DATA_UINT64
},
66 { "dnode_move_invalid", KSTAT_DATA_UINT64
},
67 { "dnode_move_recheck1", KSTAT_DATA_UINT64
},
68 { "dnode_move_recheck2", KSTAT_DATA_UINT64
},
69 { "dnode_move_special", KSTAT_DATA_UINT64
},
70 { "dnode_move_handle", KSTAT_DATA_UINT64
},
71 { "dnode_move_rwlock", KSTAT_DATA_UINT64
},
72 { "dnode_move_active", KSTAT_DATA_UINT64
},
75 static kstat_t
*dnode_ksp
;
76 static kmem_cache_t
*dnode_cache
;
78 ASSERTV(static dnode_phys_t dnode_phys_zero
);
80 int zfs_default_bs
= SPA_MINBLOCKSHIFT
;
81 int zfs_default_ibs
= DN_MAX_INDBLKSHIFT
;
84 static kmem_cbrc_t
dnode_move(void *, void *, size_t, void *);
88 dbuf_compare(const void *x1
, const void *x2
)
90 const dmu_buf_impl_t
*d1
= x1
;
91 const dmu_buf_impl_t
*d2
= x2
;
93 int cmp
= AVL_CMP(d1
->db_level
, d2
->db_level
);
97 cmp
= AVL_CMP(d1
->db_blkid
, d2
->db_blkid
);
101 if (d1
->db_state
== DB_SEARCH
) {
102 ASSERT3S(d2
->db_state
, !=, DB_SEARCH
);
104 } else if (d2
->db_state
== DB_SEARCH
) {
105 ASSERT3S(d1
->db_state
, !=, DB_SEARCH
);
109 return (AVL_PCMP(d1
, d2
));
114 dnode_cons(void *arg
, void *unused
, int kmflag
)
119 rw_init(&dn
->dn_struct_rwlock
, NULL
, RW_NOLOCKDEP
, NULL
);
120 mutex_init(&dn
->dn_mtx
, NULL
, MUTEX_DEFAULT
, NULL
);
121 mutex_init(&dn
->dn_dbufs_mtx
, NULL
, MUTEX_DEFAULT
, NULL
);
122 cv_init(&dn
->dn_notxholds
, NULL
, CV_DEFAULT
, NULL
);
125 * Every dbuf has a reference, and dropping a tracked reference is
126 * O(number of references), so don't track dn_holds.
128 refcount_create_untracked(&dn
->dn_holds
);
129 refcount_create(&dn
->dn_tx_holds
);
130 list_link_init(&dn
->dn_link
);
132 bzero(&dn
->dn_next_nblkptr
[0], sizeof (dn
->dn_next_nblkptr
));
133 bzero(&dn
->dn_next_nlevels
[0], sizeof (dn
->dn_next_nlevels
));
134 bzero(&dn
->dn_next_indblkshift
[0], sizeof (dn
->dn_next_indblkshift
));
135 bzero(&dn
->dn_next_bonustype
[0], sizeof (dn
->dn_next_bonustype
));
136 bzero(&dn
->dn_rm_spillblk
[0], sizeof (dn
->dn_rm_spillblk
));
137 bzero(&dn
->dn_next_bonuslen
[0], sizeof (dn
->dn_next_bonuslen
));
138 bzero(&dn
->dn_next_blksz
[0], sizeof (dn
->dn_next_blksz
));
139 bzero(&dn
->dn_next_maxblkid
[0], sizeof (dn
->dn_next_maxblkid
));
141 for (i
= 0; i
< TXG_SIZE
; i
++) {
142 multilist_link_init(&dn
->dn_dirty_link
[i
]);
143 dn
->dn_free_ranges
[i
] = NULL
;
144 list_create(&dn
->dn_dirty_records
[i
],
145 sizeof (dbuf_dirty_record_t
),
146 offsetof(dbuf_dirty_record_t
, dr_dirty_node
));
149 dn
->dn_allocated_txg
= 0;
151 dn
->dn_assigned_txg
= 0;
152 dn
->dn_dirty_txg
= 0;
154 dn
->dn_dirtyctx_firstset
= NULL
;
156 dn
->dn_have_spill
= B_FALSE
;
162 dn
->dn_oldprojid
= ZFS_DEFAULT_PROJID
;
165 dn
->dn_newprojid
= ZFS_DEFAULT_PROJID
;
168 dn
->dn_dbufs_count
= 0;
169 avl_create(&dn
->dn_dbufs
, dbuf_compare
, sizeof (dmu_buf_impl_t
),
170 offsetof(dmu_buf_impl_t
, db_link
));
178 dnode_dest(void *arg
, void *unused
)
183 rw_destroy(&dn
->dn_struct_rwlock
);
184 mutex_destroy(&dn
->dn_mtx
);
185 mutex_destroy(&dn
->dn_dbufs_mtx
);
186 cv_destroy(&dn
->dn_notxholds
);
187 refcount_destroy(&dn
->dn_holds
);
188 refcount_destroy(&dn
->dn_tx_holds
);
189 ASSERT(!list_link_active(&dn
->dn_link
));
191 for (i
= 0; i
< TXG_SIZE
; i
++) {
192 ASSERT(!multilist_link_active(&dn
->dn_dirty_link
[i
]));
193 ASSERT3P(dn
->dn_free_ranges
[i
], ==, NULL
);
194 list_destroy(&dn
->dn_dirty_records
[i
]);
195 ASSERT0(dn
->dn_next_nblkptr
[i
]);
196 ASSERT0(dn
->dn_next_nlevels
[i
]);
197 ASSERT0(dn
->dn_next_indblkshift
[i
]);
198 ASSERT0(dn
->dn_next_bonustype
[i
]);
199 ASSERT0(dn
->dn_rm_spillblk
[i
]);
200 ASSERT0(dn
->dn_next_bonuslen
[i
]);
201 ASSERT0(dn
->dn_next_blksz
[i
]);
202 ASSERT0(dn
->dn_next_maxblkid
[i
]);
205 ASSERT0(dn
->dn_allocated_txg
);
206 ASSERT0(dn
->dn_free_txg
);
207 ASSERT0(dn
->dn_assigned_txg
);
208 ASSERT0(dn
->dn_dirty_txg
);
209 ASSERT0(dn
->dn_dirtyctx
);
210 ASSERT3P(dn
->dn_dirtyctx_firstset
, ==, NULL
);
211 ASSERT3P(dn
->dn_bonus
, ==, NULL
);
212 ASSERT(!dn
->dn_have_spill
);
213 ASSERT3P(dn
->dn_zio
, ==, NULL
);
214 ASSERT0(dn
->dn_oldused
);
215 ASSERT0(dn
->dn_oldflags
);
216 ASSERT0(dn
->dn_olduid
);
217 ASSERT0(dn
->dn_oldgid
);
218 ASSERT0(dn
->dn_oldprojid
);
219 ASSERT0(dn
->dn_newuid
);
220 ASSERT0(dn
->dn_newgid
);
221 ASSERT0(dn
->dn_newprojid
);
222 ASSERT0(dn
->dn_id_flags
);
224 ASSERT0(dn
->dn_dbufs_count
);
225 avl_destroy(&dn
->dn_dbufs
);
231 ASSERT(dnode_cache
== NULL
);
232 dnode_cache
= kmem_cache_create("dnode_t", sizeof (dnode_t
),
233 0, dnode_cons
, dnode_dest
, NULL
, NULL
, NULL
, 0);
234 kmem_cache_set_move(dnode_cache
, dnode_move
);
236 dnode_ksp
= kstat_create("zfs", 0, "dnodestats", "misc",
237 KSTAT_TYPE_NAMED
, sizeof (dnode_stats
) / sizeof (kstat_named_t
),
239 if (dnode_ksp
!= NULL
) {
240 dnode_ksp
->ks_data
= &dnode_stats
;
241 kstat_install(dnode_ksp
);
248 if (dnode_ksp
!= NULL
) {
249 kstat_delete(dnode_ksp
);
253 kmem_cache_destroy(dnode_cache
);
260 dnode_verify(dnode_t
*dn
)
262 int drop_struct_lock
= FALSE
;
265 ASSERT(dn
->dn_objset
);
266 ASSERT(dn
->dn_handle
->dnh_dnode
== dn
);
268 ASSERT(DMU_OT_IS_VALID(dn
->dn_phys
->dn_type
));
270 if (!(zfs_flags
& ZFS_DEBUG_DNODE_VERIFY
))
273 if (!RW_WRITE_HELD(&dn
->dn_struct_rwlock
)) {
274 rw_enter(&dn
->dn_struct_rwlock
, RW_READER
);
275 drop_struct_lock
= TRUE
;
277 if (dn
->dn_phys
->dn_type
!= DMU_OT_NONE
|| dn
->dn_allocated_txg
!= 0) {
279 int max_bonuslen
= DN_SLOTS_TO_BONUSLEN(dn
->dn_num_slots
);
280 ASSERT3U(dn
->dn_indblkshift
, <=, SPA_MAXBLOCKSHIFT
);
281 if (dn
->dn_datablkshift
) {
282 ASSERT3U(dn
->dn_datablkshift
, >=, SPA_MINBLOCKSHIFT
);
283 ASSERT3U(dn
->dn_datablkshift
, <=, SPA_MAXBLOCKSHIFT
);
284 ASSERT3U(1<<dn
->dn_datablkshift
, ==, dn
->dn_datablksz
);
286 ASSERT3U(dn
->dn_nlevels
, <=, 30);
287 ASSERT(DMU_OT_IS_VALID(dn
->dn_type
));
288 ASSERT3U(dn
->dn_nblkptr
, >=, 1);
289 ASSERT3U(dn
->dn_nblkptr
, <=, DN_MAX_NBLKPTR
);
290 ASSERT3U(dn
->dn_bonuslen
, <=, max_bonuslen
);
291 ASSERT3U(dn
->dn_datablksz
, ==,
292 dn
->dn_datablkszsec
<< SPA_MINBLOCKSHIFT
);
293 ASSERT3U(ISP2(dn
->dn_datablksz
), ==, dn
->dn_datablkshift
!= 0);
294 ASSERT3U((dn
->dn_nblkptr
- 1) * sizeof (blkptr_t
) +
295 dn
->dn_bonuslen
, <=, max_bonuslen
);
296 for (i
= 0; i
< TXG_SIZE
; i
++) {
297 ASSERT3U(dn
->dn_next_nlevels
[i
], <=, dn
->dn_nlevels
);
300 if (dn
->dn_phys
->dn_type
!= DMU_OT_NONE
)
301 ASSERT3U(dn
->dn_phys
->dn_nlevels
, <=, dn
->dn_nlevels
);
302 ASSERT(DMU_OBJECT_IS_SPECIAL(dn
->dn_object
) || dn
->dn_dbuf
!= NULL
);
303 if (dn
->dn_dbuf
!= NULL
) {
304 ASSERT3P(dn
->dn_phys
, ==,
305 (dnode_phys_t
*)dn
->dn_dbuf
->db
.db_data
+
306 (dn
->dn_object
% (dn
->dn_dbuf
->db
.db_size
>> DNODE_SHIFT
)));
308 if (drop_struct_lock
)
309 rw_exit(&dn
->dn_struct_rwlock
);
314 dnode_byteswap(dnode_phys_t
*dnp
)
316 uint64_t *buf64
= (void*)&dnp
->dn_blkptr
;
319 if (dnp
->dn_type
== DMU_OT_NONE
) {
320 bzero(dnp
, sizeof (dnode_phys_t
));
324 dnp
->dn_datablkszsec
= BSWAP_16(dnp
->dn_datablkszsec
);
325 dnp
->dn_bonuslen
= BSWAP_16(dnp
->dn_bonuslen
);
326 dnp
->dn_extra_slots
= BSWAP_8(dnp
->dn_extra_slots
);
327 dnp
->dn_maxblkid
= BSWAP_64(dnp
->dn_maxblkid
);
328 dnp
->dn_used
= BSWAP_64(dnp
->dn_used
);
331 * dn_nblkptr is only one byte, so it's OK to read it in either
332 * byte order. We can't read dn_bouslen.
334 ASSERT(dnp
->dn_indblkshift
<= SPA_MAXBLOCKSHIFT
);
335 ASSERT(dnp
->dn_nblkptr
<= DN_MAX_NBLKPTR
);
336 for (i
= 0; i
< dnp
->dn_nblkptr
* sizeof (blkptr_t
)/8; i
++)
337 buf64
[i
] = BSWAP_64(buf64
[i
]);
340 * OK to check dn_bonuslen for zero, because it won't matter if
341 * we have the wrong byte order. This is necessary because the
342 * dnode dnode is smaller than a regular dnode.
344 if (dnp
->dn_bonuslen
!= 0) {
346 * Note that the bonus length calculated here may be
347 * longer than the actual bonus buffer. This is because
348 * we always put the bonus buffer after the last block
349 * pointer (instead of packing it against the end of the
352 int off
= (dnp
->dn_nblkptr
-1) * sizeof (blkptr_t
);
353 int slots
= dnp
->dn_extra_slots
+ 1;
354 size_t len
= DN_SLOTS_TO_BONUSLEN(slots
) - off
;
355 dmu_object_byteswap_t byteswap
;
356 ASSERT(DMU_OT_IS_VALID(dnp
->dn_bonustype
));
357 byteswap
= DMU_OT_BYTESWAP(dnp
->dn_bonustype
);
358 dmu_ot_byteswap
[byteswap
].ob_func(dnp
->dn_bonus
+ off
, len
);
361 /* Swap SPILL block if we have one */
362 if (dnp
->dn_flags
& DNODE_FLAG_SPILL_BLKPTR
)
363 byteswap_uint64_array(DN_SPILL_BLKPTR(dnp
), sizeof (blkptr_t
));
367 dnode_buf_byteswap(void *vbuf
, size_t size
)
371 ASSERT3U(sizeof (dnode_phys_t
), ==, (1<<DNODE_SHIFT
));
372 ASSERT((size
& (sizeof (dnode_phys_t
)-1)) == 0);
375 dnode_phys_t
*dnp
= (void *)(((char *)vbuf
) + i
);
379 if (dnp
->dn_type
!= DMU_OT_NONE
)
380 i
+= dnp
->dn_extra_slots
* DNODE_MIN_SIZE
;
385 dnode_setbonuslen(dnode_t
*dn
, int newsize
, dmu_tx_t
*tx
)
387 ASSERT3U(refcount_count(&dn
->dn_holds
), >=, 1);
389 dnode_setdirty(dn
, tx
);
390 rw_enter(&dn
->dn_struct_rwlock
, RW_WRITER
);
391 ASSERT3U(newsize
, <=, DN_SLOTS_TO_BONUSLEN(dn
->dn_num_slots
) -
392 (dn
->dn_nblkptr
-1) * sizeof (blkptr_t
));
393 dn
->dn_bonuslen
= newsize
;
395 dn
->dn_next_bonuslen
[tx
->tx_txg
& TXG_MASK
] = DN_ZERO_BONUSLEN
;
397 dn
->dn_next_bonuslen
[tx
->tx_txg
& TXG_MASK
] = dn
->dn_bonuslen
;
398 rw_exit(&dn
->dn_struct_rwlock
);
402 dnode_setbonus_type(dnode_t
*dn
, dmu_object_type_t newtype
, dmu_tx_t
*tx
)
404 ASSERT3U(refcount_count(&dn
->dn_holds
), >=, 1);
405 dnode_setdirty(dn
, tx
);
406 rw_enter(&dn
->dn_struct_rwlock
, RW_WRITER
);
407 dn
->dn_bonustype
= newtype
;
408 dn
->dn_next_bonustype
[tx
->tx_txg
& TXG_MASK
] = dn
->dn_bonustype
;
409 rw_exit(&dn
->dn_struct_rwlock
);
413 dnode_rm_spill(dnode_t
*dn
, dmu_tx_t
*tx
)
415 ASSERT3U(refcount_count(&dn
->dn_holds
), >=, 1);
416 ASSERT(RW_WRITE_HELD(&dn
->dn_struct_rwlock
));
417 dnode_setdirty(dn
, tx
);
418 dn
->dn_rm_spillblk
[tx
->tx_txg
&TXG_MASK
] = DN_KILL_SPILLBLK
;
419 dn
->dn_have_spill
= B_FALSE
;
423 dnode_setdblksz(dnode_t
*dn
, int size
)
425 ASSERT0(P2PHASE(size
, SPA_MINBLOCKSIZE
));
426 ASSERT3U(size
, <=, SPA_MAXBLOCKSIZE
);
427 ASSERT3U(size
, >=, SPA_MINBLOCKSIZE
);
428 ASSERT3U(size
>> SPA_MINBLOCKSHIFT
, <,
429 1<<(sizeof (dn
->dn_phys
->dn_datablkszsec
) * 8));
430 dn
->dn_datablksz
= size
;
431 dn
->dn_datablkszsec
= size
>> SPA_MINBLOCKSHIFT
;
432 dn
->dn_datablkshift
= ISP2(size
) ? highbit64(size
- 1) : 0;
436 dnode_create(objset_t
*os
, dnode_phys_t
*dnp
, dmu_buf_impl_t
*db
,
437 uint64_t object
, dnode_handle_t
*dnh
)
441 dn
= kmem_cache_alloc(dnode_cache
, KM_SLEEP
);
442 ASSERT(!POINTER_IS_VALID(dn
->dn_objset
));
446 * Defer setting dn_objset until the dnode is ready to be a candidate
447 * for the dnode_move() callback.
449 dn
->dn_object
= object
;
454 if (dnp
->dn_datablkszsec
) {
455 dnode_setdblksz(dn
, dnp
->dn_datablkszsec
<< SPA_MINBLOCKSHIFT
);
457 dn
->dn_datablksz
= 0;
458 dn
->dn_datablkszsec
= 0;
459 dn
->dn_datablkshift
= 0;
461 dn
->dn_indblkshift
= dnp
->dn_indblkshift
;
462 dn
->dn_nlevels
= dnp
->dn_nlevels
;
463 dn
->dn_type
= dnp
->dn_type
;
464 dn
->dn_nblkptr
= dnp
->dn_nblkptr
;
465 dn
->dn_checksum
= dnp
->dn_checksum
;
466 dn
->dn_compress
= dnp
->dn_compress
;
467 dn
->dn_bonustype
= dnp
->dn_bonustype
;
468 dn
->dn_bonuslen
= dnp
->dn_bonuslen
;
469 dn
->dn_num_slots
= dnp
->dn_extra_slots
+ 1;
470 dn
->dn_maxblkid
= dnp
->dn_maxblkid
;
471 dn
->dn_have_spill
= ((dnp
->dn_flags
& DNODE_FLAG_SPILL_BLKPTR
) != 0);
474 dmu_zfetch_init(&dn
->dn_zfetch
, dn
);
476 ASSERT(DMU_OT_IS_VALID(dn
->dn_phys
->dn_type
));
477 ASSERT(zrl_is_locked(&dnh
->dnh_zrlock
));
478 ASSERT(!DN_SLOT_IS_PTR(dnh
->dnh_dnode
));
480 mutex_enter(&os
->os_lock
);
483 * Exclude special dnodes from os_dnodes so an empty os_dnodes
484 * signifies that the special dnodes have no references from
485 * their children (the entries in os_dnodes). This allows
486 * dnode_destroy() to easily determine if the last child has
487 * been removed and then complete eviction of the objset.
489 if (!DMU_OBJECT_IS_SPECIAL(object
))
490 list_insert_head(&os
->os_dnodes
, dn
);
494 * Everything else must be valid before assigning dn_objset
495 * makes the dnode eligible for dnode_move().
500 mutex_exit(&os
->os_lock
);
502 arc_space_consume(sizeof (dnode_t
), ARC_SPACE_DNODE
);
508 * Caller must be holding the dnode handle, which is released upon return.
511 dnode_destroy(dnode_t
*dn
)
513 objset_t
*os
= dn
->dn_objset
;
514 boolean_t complete_os_eviction
= B_FALSE
;
516 ASSERT((dn
->dn_id_flags
& DN_ID_NEW_EXIST
) == 0);
518 mutex_enter(&os
->os_lock
);
519 POINTER_INVALIDATE(&dn
->dn_objset
);
520 if (!DMU_OBJECT_IS_SPECIAL(dn
->dn_object
)) {
521 list_remove(&os
->os_dnodes
, dn
);
522 complete_os_eviction
=
523 list_is_empty(&os
->os_dnodes
) &&
524 list_link_active(&os
->os_evicting_node
);
526 mutex_exit(&os
->os_lock
);
528 /* the dnode can no longer move, so we can release the handle */
529 if (!zrl_is_locked(&dn
->dn_handle
->dnh_zrlock
))
530 zrl_remove(&dn
->dn_handle
->dnh_zrlock
);
532 dn
->dn_allocated_txg
= 0;
534 dn
->dn_assigned_txg
= 0;
535 dn
->dn_dirty_txg
= 0;
538 if (dn
->dn_dirtyctx_firstset
!= NULL
) {
539 kmem_free(dn
->dn_dirtyctx_firstset
, 1);
540 dn
->dn_dirtyctx_firstset
= NULL
;
542 if (dn
->dn_bonus
!= NULL
) {
543 mutex_enter(&dn
->dn_bonus
->db_mtx
);
544 dbuf_destroy(dn
->dn_bonus
);
549 dn
->dn_have_spill
= B_FALSE
;
554 dn
->dn_oldprojid
= ZFS_DEFAULT_PROJID
;
557 dn
->dn_newprojid
= ZFS_DEFAULT_PROJID
;
560 dmu_zfetch_fini(&dn
->dn_zfetch
);
561 kmem_cache_free(dnode_cache
, dn
);
562 arc_space_return(sizeof (dnode_t
), ARC_SPACE_DNODE
);
564 if (complete_os_eviction
)
565 dmu_objset_evict_done(os
);
569 dnode_allocate(dnode_t
*dn
, dmu_object_type_t ot
, int blocksize
, int ibs
,
570 dmu_object_type_t bonustype
, int bonuslen
, int dn_slots
, dmu_tx_t
*tx
)
574 ASSERT3U(dn_slots
, >, 0);
575 ASSERT3U(dn_slots
<< DNODE_SHIFT
, <=,
576 spa_maxdnodesize(dmu_objset_spa(dn
->dn_objset
)));
577 ASSERT3U(blocksize
, <=,
578 spa_maxblocksize(dmu_objset_spa(dn
->dn_objset
)));
580 blocksize
= 1 << zfs_default_bs
;
582 blocksize
= P2ROUNDUP(blocksize
, SPA_MINBLOCKSIZE
);
585 ibs
= zfs_default_ibs
;
587 ibs
= MIN(MAX(ibs
, DN_MIN_INDBLKSHIFT
), DN_MAX_INDBLKSHIFT
);
589 dprintf("os=%p obj=%llu txg=%llu blocksize=%d ibs=%d dn_slots=%d\n",
590 dn
->dn_objset
, dn
->dn_object
, tx
->tx_txg
, blocksize
, ibs
, dn_slots
);
591 DNODE_STAT_BUMP(dnode_allocate
);
593 ASSERT(dn
->dn_type
== DMU_OT_NONE
);
594 ASSERT(bcmp(dn
->dn_phys
, &dnode_phys_zero
, sizeof (dnode_phys_t
)) == 0);
595 ASSERT(dn
->dn_phys
->dn_type
== DMU_OT_NONE
);
596 ASSERT(ot
!= DMU_OT_NONE
);
597 ASSERT(DMU_OT_IS_VALID(ot
));
598 ASSERT((bonustype
== DMU_OT_NONE
&& bonuslen
== 0) ||
599 (bonustype
== DMU_OT_SA
&& bonuslen
== 0) ||
600 (bonustype
!= DMU_OT_NONE
&& bonuslen
!= 0));
601 ASSERT(DMU_OT_IS_VALID(bonustype
));
602 ASSERT3U(bonuslen
, <=, DN_SLOTS_TO_BONUSLEN(dn_slots
));
603 ASSERT(dn
->dn_type
== DMU_OT_NONE
);
604 ASSERT0(dn
->dn_maxblkid
);
605 ASSERT0(dn
->dn_allocated_txg
);
606 ASSERT0(dn
->dn_assigned_txg
);
607 ASSERT0(dn
->dn_dirty_txg
);
608 ASSERT(refcount_is_zero(&dn
->dn_tx_holds
));
609 ASSERT3U(refcount_count(&dn
->dn_holds
), <=, 1);
610 ASSERT(avl_is_empty(&dn
->dn_dbufs
));
612 for (i
= 0; i
< TXG_SIZE
; i
++) {
613 ASSERT0(dn
->dn_next_nblkptr
[i
]);
614 ASSERT0(dn
->dn_next_nlevels
[i
]);
615 ASSERT0(dn
->dn_next_indblkshift
[i
]);
616 ASSERT0(dn
->dn_next_bonuslen
[i
]);
617 ASSERT0(dn
->dn_next_bonustype
[i
]);
618 ASSERT0(dn
->dn_rm_spillblk
[i
]);
619 ASSERT0(dn
->dn_next_blksz
[i
]);
620 ASSERT0(dn
->dn_next_maxblkid
[i
]);
621 ASSERT(!multilist_link_active(&dn
->dn_dirty_link
[i
]));
622 ASSERT3P(list_head(&dn
->dn_dirty_records
[i
]), ==, NULL
);
623 ASSERT3P(dn
->dn_free_ranges
[i
], ==, NULL
);
627 dnode_setdblksz(dn
, blocksize
);
628 dn
->dn_indblkshift
= ibs
;
630 dn
->dn_num_slots
= dn_slots
;
631 if (bonustype
== DMU_OT_SA
) /* Maximize bonus space for SA */
634 dn
->dn_nblkptr
= MIN(DN_MAX_NBLKPTR
,
635 1 + ((DN_SLOTS_TO_BONUSLEN(dn_slots
) - bonuslen
) >>
639 dn
->dn_bonustype
= bonustype
;
640 dn
->dn_bonuslen
= bonuslen
;
641 dn
->dn_checksum
= ZIO_CHECKSUM_INHERIT
;
642 dn
->dn_compress
= ZIO_COMPRESS_INHERIT
;
646 if (dn
->dn_dirtyctx_firstset
) {
647 kmem_free(dn
->dn_dirtyctx_firstset
, 1);
648 dn
->dn_dirtyctx_firstset
= NULL
;
651 dn
->dn_allocated_txg
= tx
->tx_txg
;
654 dnode_setdirty(dn
, tx
);
655 dn
->dn_next_indblkshift
[tx
->tx_txg
& TXG_MASK
] = ibs
;
656 dn
->dn_next_bonuslen
[tx
->tx_txg
& TXG_MASK
] = dn
->dn_bonuslen
;
657 dn
->dn_next_bonustype
[tx
->tx_txg
& TXG_MASK
] = dn
->dn_bonustype
;
658 dn
->dn_next_blksz
[tx
->tx_txg
& TXG_MASK
] = dn
->dn_datablksz
;
662 dnode_reallocate(dnode_t
*dn
, dmu_object_type_t ot
, int blocksize
,
663 dmu_object_type_t bonustype
, int bonuslen
, int dn_slots
, dmu_tx_t
*tx
)
667 ASSERT3U(blocksize
, >=, SPA_MINBLOCKSIZE
);
668 ASSERT3U(blocksize
, <=,
669 spa_maxblocksize(dmu_objset_spa(dn
->dn_objset
)));
670 ASSERT0(blocksize
% SPA_MINBLOCKSIZE
);
671 ASSERT(dn
->dn_object
!= DMU_META_DNODE_OBJECT
|| dmu_tx_private_ok(tx
));
672 ASSERT(tx
->tx_txg
!= 0);
673 ASSERT((bonustype
== DMU_OT_NONE
&& bonuslen
== 0) ||
674 (bonustype
!= DMU_OT_NONE
&& bonuslen
!= 0) ||
675 (bonustype
== DMU_OT_SA
&& bonuslen
== 0));
676 ASSERT(DMU_OT_IS_VALID(bonustype
));
677 ASSERT3U(bonuslen
, <=,
678 DN_BONUS_SIZE(spa_maxdnodesize(dmu_objset_spa(dn
->dn_objset
))));
679 ASSERT3U(bonuslen
, <=, DN_BONUS_SIZE(dn_slots
<< DNODE_SHIFT
));
681 dnode_free_interior_slots(dn
);
682 DNODE_STAT_BUMP(dnode_reallocate
);
684 /* clean up any unreferenced dbufs */
685 dnode_evict_dbufs(dn
);
689 rw_enter(&dn
->dn_struct_rwlock
, RW_WRITER
);
690 dnode_setdirty(dn
, tx
);
691 if (dn
->dn_datablksz
!= blocksize
) {
692 /* change blocksize */
693 ASSERT(dn
->dn_maxblkid
== 0 &&
694 (BP_IS_HOLE(&dn
->dn_phys
->dn_blkptr
[0]) ||
695 dnode_block_freed(dn
, 0)));
696 dnode_setdblksz(dn
, blocksize
);
697 dn
->dn_next_blksz
[tx
->tx_txg
&TXG_MASK
] = blocksize
;
699 if (dn
->dn_bonuslen
!= bonuslen
)
700 dn
->dn_next_bonuslen
[tx
->tx_txg
&TXG_MASK
] = bonuslen
;
702 if (bonustype
== DMU_OT_SA
) /* Maximize bonus space for SA */
705 nblkptr
= MIN(DN_MAX_NBLKPTR
,
706 1 + ((DN_SLOTS_TO_BONUSLEN(dn_slots
) - bonuslen
) >>
708 if (dn
->dn_bonustype
!= bonustype
)
709 dn
->dn_next_bonustype
[tx
->tx_txg
&TXG_MASK
] = bonustype
;
710 if (dn
->dn_nblkptr
!= nblkptr
)
711 dn
->dn_next_nblkptr
[tx
->tx_txg
&TXG_MASK
] = nblkptr
;
712 if (dn
->dn_phys
->dn_flags
& DNODE_FLAG_SPILL_BLKPTR
) {
713 dbuf_rm_spill(dn
, tx
);
714 dnode_rm_spill(dn
, tx
);
716 rw_exit(&dn
->dn_struct_rwlock
);
721 /* change bonus size and type */
722 mutex_enter(&dn
->dn_mtx
);
723 dn
->dn_bonustype
= bonustype
;
724 dn
->dn_bonuslen
= bonuslen
;
725 dn
->dn_num_slots
= dn_slots
;
726 dn
->dn_nblkptr
= nblkptr
;
727 dn
->dn_checksum
= ZIO_CHECKSUM_INHERIT
;
728 dn
->dn_compress
= ZIO_COMPRESS_INHERIT
;
729 ASSERT3U(dn
->dn_nblkptr
, <=, DN_MAX_NBLKPTR
);
731 /* fix up the bonus db_size */
733 dn
->dn_bonus
->db
.db_size
=
734 DN_SLOTS_TO_BONUSLEN(dn
->dn_num_slots
) -
735 (dn
->dn_nblkptr
-1) * sizeof (blkptr_t
);
736 ASSERT(dn
->dn_bonuslen
<= dn
->dn_bonus
->db
.db_size
);
739 dn
->dn_allocated_txg
= tx
->tx_txg
;
740 mutex_exit(&dn
->dn_mtx
);
745 dnode_move_impl(dnode_t
*odn
, dnode_t
*ndn
)
749 ASSERT(!RW_LOCK_HELD(&odn
->dn_struct_rwlock
));
750 ASSERT(MUTEX_NOT_HELD(&odn
->dn_mtx
));
751 ASSERT(MUTEX_NOT_HELD(&odn
->dn_dbufs_mtx
));
752 ASSERT(!RW_LOCK_HELD(&odn
->dn_zfetch
.zf_rwlock
));
755 ndn
->dn_objset
= odn
->dn_objset
;
756 ndn
->dn_object
= odn
->dn_object
;
757 ndn
->dn_dbuf
= odn
->dn_dbuf
;
758 ndn
->dn_handle
= odn
->dn_handle
;
759 ndn
->dn_phys
= odn
->dn_phys
;
760 ndn
->dn_type
= odn
->dn_type
;
761 ndn
->dn_bonuslen
= odn
->dn_bonuslen
;
762 ndn
->dn_bonustype
= odn
->dn_bonustype
;
763 ndn
->dn_nblkptr
= odn
->dn_nblkptr
;
764 ndn
->dn_checksum
= odn
->dn_checksum
;
765 ndn
->dn_compress
= odn
->dn_compress
;
766 ndn
->dn_nlevels
= odn
->dn_nlevels
;
767 ndn
->dn_indblkshift
= odn
->dn_indblkshift
;
768 ndn
->dn_datablkshift
= odn
->dn_datablkshift
;
769 ndn
->dn_datablkszsec
= odn
->dn_datablkszsec
;
770 ndn
->dn_datablksz
= odn
->dn_datablksz
;
771 ndn
->dn_maxblkid
= odn
->dn_maxblkid
;
772 ndn
->dn_num_slots
= odn
->dn_num_slots
;
773 bcopy(&odn
->dn_next_nblkptr
[0], &ndn
->dn_next_nblkptr
[0],
774 sizeof (odn
->dn_next_nblkptr
));
775 bcopy(&odn
->dn_next_nlevels
[0], &ndn
->dn_next_nlevels
[0],
776 sizeof (odn
->dn_next_nlevels
));
777 bcopy(&odn
->dn_next_indblkshift
[0], &ndn
->dn_next_indblkshift
[0],
778 sizeof (odn
->dn_next_indblkshift
));
779 bcopy(&odn
->dn_next_bonustype
[0], &ndn
->dn_next_bonustype
[0],
780 sizeof (odn
->dn_next_bonustype
));
781 bcopy(&odn
->dn_rm_spillblk
[0], &ndn
->dn_rm_spillblk
[0],
782 sizeof (odn
->dn_rm_spillblk
));
783 bcopy(&odn
->dn_next_bonuslen
[0], &ndn
->dn_next_bonuslen
[0],
784 sizeof (odn
->dn_next_bonuslen
));
785 bcopy(&odn
->dn_next_blksz
[0], &ndn
->dn_next_blksz
[0],
786 sizeof (odn
->dn_next_blksz
));
787 bcopy(&odn
->dn_next_maxblkid
[0], &ndn
->dn_next_maxblkid
[0],
788 sizeof (odn
->dn_next_maxblkid
));
789 for (i
= 0; i
< TXG_SIZE
; i
++) {
790 list_move_tail(&ndn
->dn_dirty_records
[i
],
791 &odn
->dn_dirty_records
[i
]);
793 bcopy(&odn
->dn_free_ranges
[0], &ndn
->dn_free_ranges
[0],
794 sizeof (odn
->dn_free_ranges
));
795 ndn
->dn_allocated_txg
= odn
->dn_allocated_txg
;
796 ndn
->dn_free_txg
= odn
->dn_free_txg
;
797 ndn
->dn_assigned_txg
= odn
->dn_assigned_txg
;
798 ndn
->dn_dirty_txg
= odn
->dn_dirty_txg
;
799 ndn
->dn_dirtyctx
= odn
->dn_dirtyctx
;
800 ndn
->dn_dirtyctx_firstset
= odn
->dn_dirtyctx_firstset
;
801 ASSERT(refcount_count(&odn
->dn_tx_holds
) == 0);
802 refcount_transfer(&ndn
->dn_holds
, &odn
->dn_holds
);
803 ASSERT(avl_is_empty(&ndn
->dn_dbufs
));
804 avl_swap(&ndn
->dn_dbufs
, &odn
->dn_dbufs
);
805 ndn
->dn_dbufs_count
= odn
->dn_dbufs_count
;
806 ndn
->dn_bonus
= odn
->dn_bonus
;
807 ndn
->dn_have_spill
= odn
->dn_have_spill
;
808 ndn
->dn_zio
= odn
->dn_zio
;
809 ndn
->dn_oldused
= odn
->dn_oldused
;
810 ndn
->dn_oldflags
= odn
->dn_oldflags
;
811 ndn
->dn_olduid
= odn
->dn_olduid
;
812 ndn
->dn_oldgid
= odn
->dn_oldgid
;
813 ndn
->dn_oldprojid
= odn
->dn_oldprojid
;
814 ndn
->dn_newuid
= odn
->dn_newuid
;
815 ndn
->dn_newgid
= odn
->dn_newgid
;
816 ndn
->dn_newprojid
= odn
->dn_newprojid
;
817 ndn
->dn_id_flags
= odn
->dn_id_flags
;
818 dmu_zfetch_init(&ndn
->dn_zfetch
, NULL
);
819 list_move_tail(&ndn
->dn_zfetch
.zf_stream
, &odn
->dn_zfetch
.zf_stream
);
820 ndn
->dn_zfetch
.zf_dnode
= odn
->dn_zfetch
.zf_dnode
;
823 * Update back pointers. Updating the handle fixes the back pointer of
824 * every descendant dbuf as well as the bonus dbuf.
826 ASSERT(ndn
->dn_handle
->dnh_dnode
== odn
);
827 ndn
->dn_handle
->dnh_dnode
= ndn
;
828 if (ndn
->dn_zfetch
.zf_dnode
== odn
) {
829 ndn
->dn_zfetch
.zf_dnode
= ndn
;
833 * Invalidate the original dnode by clearing all of its back pointers.
836 odn
->dn_handle
= NULL
;
837 avl_create(&odn
->dn_dbufs
, dbuf_compare
, sizeof (dmu_buf_impl_t
),
838 offsetof(dmu_buf_impl_t
, db_link
));
839 odn
->dn_dbufs_count
= 0;
840 odn
->dn_bonus
= NULL
;
841 odn
->dn_zfetch
.zf_dnode
= NULL
;
844 * Set the low bit of the objset pointer to ensure that dnode_move()
845 * recognizes the dnode as invalid in any subsequent callback.
847 POINTER_INVALIDATE(&odn
->dn_objset
);
850 * Satisfy the destructor.
852 for (i
= 0; i
< TXG_SIZE
; i
++) {
853 list_create(&odn
->dn_dirty_records
[i
],
854 sizeof (dbuf_dirty_record_t
),
855 offsetof(dbuf_dirty_record_t
, dr_dirty_node
));
856 odn
->dn_free_ranges
[i
] = NULL
;
857 odn
->dn_next_nlevels
[i
] = 0;
858 odn
->dn_next_indblkshift
[i
] = 0;
859 odn
->dn_next_bonustype
[i
] = 0;
860 odn
->dn_rm_spillblk
[i
] = 0;
861 odn
->dn_next_bonuslen
[i
] = 0;
862 odn
->dn_next_blksz
[i
] = 0;
864 odn
->dn_allocated_txg
= 0;
865 odn
->dn_free_txg
= 0;
866 odn
->dn_assigned_txg
= 0;
867 odn
->dn_dirty_txg
= 0;
868 odn
->dn_dirtyctx
= 0;
869 odn
->dn_dirtyctx_firstset
= NULL
;
870 odn
->dn_have_spill
= B_FALSE
;
873 odn
->dn_oldflags
= 0;
876 odn
->dn_oldprojid
= ZFS_DEFAULT_PROJID
;
879 odn
->dn_newprojid
= ZFS_DEFAULT_PROJID
;
880 odn
->dn_id_flags
= 0;
886 odn
->dn_moved
= (uint8_t)-1;
891 dnode_move(void *buf
, void *newbuf
, size_t size
, void *arg
)
893 dnode_t
*odn
= buf
, *ndn
= newbuf
;
899 * The dnode is on the objset's list of known dnodes if the objset
900 * pointer is valid. We set the low bit of the objset pointer when
901 * freeing the dnode to invalidate it, and the memory patterns written
902 * by kmem (baddcafe and deadbeef) set at least one of the two low bits.
903 * A newly created dnode sets the objset pointer last of all to indicate
904 * that the dnode is known and in a valid state to be moved by this
908 if (!POINTER_IS_VALID(os
)) {
909 DNODE_STAT_BUMP(dnode_move_invalid
);
910 return (KMEM_CBRC_DONT_KNOW
);
914 * Ensure that the objset does not go away during the move.
916 rw_enter(&os_lock
, RW_WRITER
);
917 if (os
!= odn
->dn_objset
) {
919 DNODE_STAT_BUMP(dnode_move_recheck1
);
920 return (KMEM_CBRC_DONT_KNOW
);
924 * If the dnode is still valid, then so is the objset. We know that no
925 * valid objset can be freed while we hold os_lock, so we can safely
926 * ensure that the objset remains in use.
928 mutex_enter(&os
->os_lock
);
931 * Recheck the objset pointer in case the dnode was removed just before
932 * acquiring the lock.
934 if (os
!= odn
->dn_objset
) {
935 mutex_exit(&os
->os_lock
);
937 DNODE_STAT_BUMP(dnode_move_recheck2
);
938 return (KMEM_CBRC_DONT_KNOW
);
942 * At this point we know that as long as we hold os->os_lock, the dnode
943 * cannot be freed and fields within the dnode can be safely accessed.
944 * The objset listing this dnode cannot go away as long as this dnode is
948 if (DMU_OBJECT_IS_SPECIAL(odn
->dn_object
)) {
949 mutex_exit(&os
->os_lock
);
950 DNODE_STAT_BUMP(dnode_move_special
);
951 return (KMEM_CBRC_NO
);
953 ASSERT(odn
->dn_dbuf
!= NULL
); /* only "special" dnodes have no parent */
956 * Lock the dnode handle to prevent the dnode from obtaining any new
957 * holds. This also prevents the descendant dbufs and the bonus dbuf
958 * from accessing the dnode, so that we can discount their holds. The
959 * handle is safe to access because we know that while the dnode cannot
960 * go away, neither can its handle. Once we hold dnh_zrlock, we can
961 * safely move any dnode referenced only by dbufs.
963 if (!zrl_tryenter(&odn
->dn_handle
->dnh_zrlock
)) {
964 mutex_exit(&os
->os_lock
);
965 DNODE_STAT_BUMP(dnode_move_handle
);
966 return (KMEM_CBRC_LATER
);
970 * Ensure a consistent view of the dnode's holds and the dnode's dbufs.
971 * We need to guarantee that there is a hold for every dbuf in order to
972 * determine whether the dnode is actively referenced. Falsely matching
973 * a dbuf to an active hold would lead to an unsafe move. It's possible
974 * that a thread already having an active dnode hold is about to add a
975 * dbuf, and we can't compare hold and dbuf counts while the add is in
978 if (!rw_tryenter(&odn
->dn_struct_rwlock
, RW_WRITER
)) {
979 zrl_exit(&odn
->dn_handle
->dnh_zrlock
);
980 mutex_exit(&os
->os_lock
);
981 DNODE_STAT_BUMP(dnode_move_rwlock
);
982 return (KMEM_CBRC_LATER
);
986 * A dbuf may be removed (evicted) without an active dnode hold. In that
987 * case, the dbuf count is decremented under the handle lock before the
988 * dbuf's hold is released. This order ensures that if we count the hold
989 * after the dbuf is removed but before its hold is released, we will
990 * treat the unmatched hold as active and exit safely. If we count the
991 * hold before the dbuf is removed, the hold is discounted, and the
992 * removal is blocked until the move completes.
994 refcount
= refcount_count(&odn
->dn_holds
);
995 ASSERT(refcount
>= 0);
996 dbufs
= odn
->dn_dbufs_count
;
998 /* We can't have more dbufs than dnode holds. */
999 ASSERT3U(dbufs
, <=, refcount
);
1000 DTRACE_PROBE3(dnode__move
, dnode_t
*, odn
, int64_t, refcount
,
1003 if (refcount
> dbufs
) {
1004 rw_exit(&odn
->dn_struct_rwlock
);
1005 zrl_exit(&odn
->dn_handle
->dnh_zrlock
);
1006 mutex_exit(&os
->os_lock
);
1007 DNODE_STAT_BUMP(dnode_move_active
);
1008 return (KMEM_CBRC_LATER
);
1011 rw_exit(&odn
->dn_struct_rwlock
);
1014 * At this point we know that anyone with a hold on the dnode is not
1015 * actively referencing it. The dnode is known and in a valid state to
1016 * move. We're holding the locks needed to execute the critical section.
1018 dnode_move_impl(odn
, ndn
);
1020 list_link_replace(&odn
->dn_link
, &ndn
->dn_link
);
1021 /* If the dnode was safe to move, the refcount cannot have changed. */
1022 ASSERT(refcount
== refcount_count(&ndn
->dn_holds
));
1023 ASSERT(dbufs
== ndn
->dn_dbufs_count
);
1024 zrl_exit(&ndn
->dn_handle
->dnh_zrlock
); /* handle has moved */
1025 mutex_exit(&os
->os_lock
);
1027 return (KMEM_CBRC_YES
);
1029 #endif /* _KERNEL */
1032 dnode_slots_hold(dnode_children_t
*children
, int idx
, int slots
)
1034 ASSERT3S(idx
+ slots
, <=, DNODES_PER_BLOCK
);
1036 for (int i
= idx
; i
< idx
+ slots
; i
++) {
1037 dnode_handle_t
*dnh
= &children
->dnc_children
[i
];
1038 zrl_add(&dnh
->dnh_zrlock
);
1043 dnode_slots_rele(dnode_children_t
*children
, int idx
, int slots
)
1045 ASSERT3S(idx
+ slots
, <=, DNODES_PER_BLOCK
);
1047 for (int i
= idx
; i
< idx
+ slots
; i
++) {
1048 dnode_handle_t
*dnh
= &children
->dnc_children
[i
];
1050 if (zrl_is_locked(&dnh
->dnh_zrlock
))
1051 zrl_exit(&dnh
->dnh_zrlock
);
1053 zrl_remove(&dnh
->dnh_zrlock
);
1058 dnode_slots_tryenter(dnode_children_t
*children
, int idx
, int slots
)
1060 ASSERT3S(idx
+ slots
, <=, DNODES_PER_BLOCK
);
1062 for (int i
= idx
; i
< idx
+ slots
; i
++) {
1063 dnode_handle_t
*dnh
= &children
->dnc_children
[i
];
1065 if (!zrl_tryenter(&dnh
->dnh_zrlock
)) {
1066 for (int j
= idx
; j
< i
; j
++) {
1067 dnh
= &children
->dnc_children
[j
];
1068 zrl_exit(&dnh
->dnh_zrlock
);
1079 dnode_set_slots(dnode_children_t
*children
, int idx
, int slots
, void *ptr
)
1081 ASSERT3S(idx
+ slots
, <=, DNODES_PER_BLOCK
);
1083 for (int i
= idx
; i
< idx
+ slots
; i
++) {
1084 dnode_handle_t
*dnh
= &children
->dnc_children
[i
];
1085 dnh
->dnh_dnode
= ptr
;
1090 dnode_check_slots_free(dnode_children_t
*children
, int idx
, int slots
)
1092 ASSERT3S(idx
+ slots
, <=, DNODES_PER_BLOCK
);
1095 * If all dnode slots are either already free or
1096 * evictable return B_TRUE.
1098 for (int i
= idx
; i
< idx
+ slots
; i
++) {
1099 dnode_handle_t
*dnh
= &children
->dnc_children
[i
];
1100 dnode_t
*dn
= dnh
->dnh_dnode
;
1102 if (dn
== DN_SLOT_FREE
) {
1104 } else if (DN_SLOT_IS_PTR(dn
)) {
1105 mutex_enter(&dn
->dn_mtx
);
1106 boolean_t can_free
= (dn
->dn_type
== DMU_OT_NONE
&&
1107 !DNODE_IS_DIRTY(dn
));
1108 mutex_exit(&dn
->dn_mtx
);
1123 dnode_reclaim_slots(dnode_children_t
*children
, int idx
, int slots
)
1125 ASSERT3S(idx
+ slots
, <=, DNODES_PER_BLOCK
);
1127 for (int i
= idx
; i
< idx
+ slots
; i
++) {
1128 dnode_handle_t
*dnh
= &children
->dnc_children
[i
];
1130 ASSERT(zrl_is_locked(&dnh
->dnh_zrlock
));
1132 if (DN_SLOT_IS_PTR(dnh
->dnh_dnode
)) {
1133 ASSERT3S(dnh
->dnh_dnode
->dn_type
, ==, DMU_OT_NONE
);
1134 dnode_destroy(dnh
->dnh_dnode
);
1135 dnh
->dnh_dnode
= DN_SLOT_FREE
;
1141 dnode_free_interior_slots(dnode_t
*dn
)
1143 dnode_children_t
*children
= dmu_buf_get_user(&dn
->dn_dbuf
->db
);
1144 int epb
= dn
->dn_dbuf
->db
.db_size
>> DNODE_SHIFT
;
1145 int idx
= (dn
->dn_object
& (epb
- 1)) + 1;
1146 int slots
= dn
->dn_num_slots
- 1;
1151 ASSERT3S(idx
+ slots
, <=, DNODES_PER_BLOCK
);
1153 while (!dnode_slots_tryenter(children
, idx
, slots
))
1154 DNODE_STAT_BUMP(dnode_free_interior_lock_retry
);
1156 dnode_set_slots(children
, idx
, slots
, DN_SLOT_FREE
);
1157 dnode_slots_rele(children
, idx
, slots
);
1161 dnode_special_close(dnode_handle_t
*dnh
)
1163 dnode_t
*dn
= dnh
->dnh_dnode
;
1166 * Wait for final references to the dnode to clear. This can
1167 * only happen if the arc is asynchronously evicting state that
1168 * has a hold on this dnode while we are trying to evict this
1171 while (refcount_count(&dn
->dn_holds
) > 0)
1173 ASSERT(dn
->dn_dbuf
== NULL
||
1174 dmu_buf_get_user(&dn
->dn_dbuf
->db
) == NULL
);
1175 zrl_add(&dnh
->dnh_zrlock
);
1176 dnode_destroy(dn
); /* implicit zrl_remove() */
1177 zrl_destroy(&dnh
->dnh_zrlock
);
1178 dnh
->dnh_dnode
= NULL
;
1182 dnode_special_open(objset_t
*os
, dnode_phys_t
*dnp
, uint64_t object
,
1183 dnode_handle_t
*dnh
)
1187 zrl_init(&dnh
->dnh_zrlock
);
1188 zrl_tryenter(&dnh
->dnh_zrlock
);
1190 dn
= dnode_create(os
, dnp
, NULL
, object
, dnh
);
1193 zrl_exit(&dnh
->dnh_zrlock
);
1197 dnode_buf_evict_async(void *dbu
)
1199 dnode_children_t
*dnc
= dbu
;
1201 DNODE_STAT_BUMP(dnode_buf_evict
);
1203 for (int i
= 0; i
< dnc
->dnc_count
; i
++) {
1204 dnode_handle_t
*dnh
= &dnc
->dnc_children
[i
];
1208 * The dnode handle lock guards against the dnode moving to
1209 * another valid address, so there is no need here to guard
1210 * against changes to or from NULL.
1212 if (!DN_SLOT_IS_PTR(dnh
->dnh_dnode
)) {
1213 zrl_destroy(&dnh
->dnh_zrlock
);
1214 dnh
->dnh_dnode
= DN_SLOT_UNINIT
;
1218 zrl_add(&dnh
->dnh_zrlock
);
1219 dn
= dnh
->dnh_dnode
;
1221 * If there are holds on this dnode, then there should
1222 * be holds on the dnode's containing dbuf as well; thus
1223 * it wouldn't be eligible for eviction and this function
1224 * would not have been called.
1226 ASSERT(refcount_is_zero(&dn
->dn_holds
));
1227 ASSERT(refcount_is_zero(&dn
->dn_tx_holds
));
1229 dnode_destroy(dn
); /* implicit zrl_remove() for first slot */
1230 zrl_destroy(&dnh
->dnh_zrlock
);
1231 dnh
->dnh_dnode
= DN_SLOT_UNINIT
;
1233 kmem_free(dnc
, sizeof (dnode_children_t
) +
1234 dnc
->dnc_count
* sizeof (dnode_handle_t
));
1238 * When the DNODE_MUST_BE_FREE flag is set, the "slots" parameter is used
1239 * to ensure the hole at the specified object offset is large enough to
1240 * hold the dnode being created. The slots parameter is also used to ensure
1241 * a dnode does not span multiple dnode blocks. In both of these cases, if
1242 * a failure occurs, ENOSPC is returned. Keep in mind, these failure cases
1243 * are only possible when using DNODE_MUST_BE_FREE.
1245 * If the DNODE_MUST_BE_ALLOCATED flag is set, "slots" must be 0.
1246 * dnode_hold_impl() will check if the requested dnode is already consumed
1247 * as an extra dnode slot by an large dnode, in which case it returns
1251 * EINVAL - Invalid object number or flags.
1252 * ENOSPC - Hole too small to fulfill "slots" request (DNODE_MUST_BE_FREE)
1253 * EEXIST - Refers to an allocated dnode (DNODE_MUST_BE_FREE)
1254 * - Refers to an interior dnode slot (DNODE_MUST_BE_ALLOCATED)
1255 * ENOENT - The requested dnode is not allocated (DNODE_MUST_BE_ALLOCATED)
1256 * EIO - I/O error when reading the meta dnode dbuf.
1258 * succeeds even for free dnodes.
1261 dnode_hold_impl(objset_t
*os
, uint64_t object
, int flag
, int slots
,
1262 void *tag
, dnode_t
**dnp
)
1265 int drop_struct_lock
= FALSE
;
1270 dnode_children_t
*dnc
;
1271 dnode_phys_t
*dn_block
;
1272 dnode_handle_t
*dnh
;
1274 ASSERT(!(flag
& DNODE_MUST_BE_ALLOCATED
) || (slots
== 0));
1275 ASSERT(!(flag
& DNODE_MUST_BE_FREE
) || (slots
> 0));
1278 * If you are holding the spa config lock as writer, you shouldn't
1279 * be asking the DMU to do *anything* unless it's the root pool
1280 * which may require us to read from the root filesystem while
1281 * holding some (not all) of the locks as writer.
1283 ASSERT(spa_config_held(os
->os_spa
, SCL_ALL
, RW_WRITER
) == 0 ||
1284 (spa_is_root(os
->os_spa
) &&
1285 spa_config_held(os
->os_spa
, SCL_STATE
, RW_WRITER
)));
1287 ASSERT((flag
& DNODE_MUST_BE_ALLOCATED
) || (flag
& DNODE_MUST_BE_FREE
));
1289 if (object
== DMU_USERUSED_OBJECT
|| object
== DMU_GROUPUSED_OBJECT
||
1290 object
== DMU_PROJECTUSED_OBJECT
) {
1291 if (object
== DMU_USERUSED_OBJECT
)
1292 dn
= DMU_USERUSED_DNODE(os
);
1293 else if (object
== DMU_GROUPUSED_OBJECT
)
1294 dn
= DMU_GROUPUSED_DNODE(os
);
1296 dn
= DMU_PROJECTUSED_DNODE(os
);
1298 return (SET_ERROR(ENOENT
));
1300 if ((flag
& DNODE_MUST_BE_ALLOCATED
) && type
== DMU_OT_NONE
)
1301 return (SET_ERROR(ENOENT
));
1302 if ((flag
& DNODE_MUST_BE_FREE
) && type
!= DMU_OT_NONE
)
1303 return (SET_ERROR(EEXIST
));
1305 (void) refcount_add(&dn
->dn_holds
, tag
);
1310 if (object
== 0 || object
>= DN_MAX_OBJECT
)
1311 return (SET_ERROR(EINVAL
));
1313 mdn
= DMU_META_DNODE(os
);
1314 ASSERT(mdn
->dn_object
== DMU_META_DNODE_OBJECT
);
1318 if (!RW_WRITE_HELD(&mdn
->dn_struct_rwlock
)) {
1319 rw_enter(&mdn
->dn_struct_rwlock
, RW_READER
);
1320 drop_struct_lock
= TRUE
;
1323 blk
= dbuf_whichblock(mdn
, 0, object
* sizeof (dnode_phys_t
));
1325 db
= dbuf_hold(mdn
, blk
, FTAG
);
1326 if (drop_struct_lock
)
1327 rw_exit(&mdn
->dn_struct_rwlock
);
1329 DNODE_STAT_BUMP(dnode_hold_dbuf_hold
);
1330 return (SET_ERROR(EIO
));
1334 * We do not need to decrypt to read the dnode so it doesn't matter
1335 * if we get the encrypted or decrypted version.
1337 err
= dbuf_read(db
, NULL
, DB_RF_CANFAIL
| DB_RF_NO_DECRYPT
);
1339 DNODE_STAT_BUMP(dnode_hold_dbuf_read
);
1340 dbuf_rele(db
, FTAG
);
1344 ASSERT3U(db
->db
.db_size
, >=, 1<<DNODE_SHIFT
);
1345 epb
= db
->db
.db_size
>> DNODE_SHIFT
;
1347 idx
= object
& (epb
- 1);
1348 dn_block
= (dnode_phys_t
*)db
->db
.db_data
;
1350 ASSERT(DB_DNODE(db
)->dn_type
== DMU_OT_DNODE
);
1351 dnc
= dmu_buf_get_user(&db
->db
);
1354 dnode_children_t
*winner
;
1357 dnc
= kmem_zalloc(sizeof (dnode_children_t
) +
1358 epb
* sizeof (dnode_handle_t
), KM_SLEEP
);
1359 dnc
->dnc_count
= epb
;
1360 dnh
= &dnc
->dnc_children
[0];
1362 /* Initialize dnode slot status from dnode_phys_t */
1363 for (int i
= 0; i
< epb
; i
++) {
1364 zrl_init(&dnh
[i
].dnh_zrlock
);
1371 if (dn_block
[i
].dn_type
!= DMU_OT_NONE
) {
1372 int interior
= dn_block
[i
].dn_extra_slots
;
1374 dnode_set_slots(dnc
, i
, 1, DN_SLOT_ALLOCATED
);
1375 dnode_set_slots(dnc
, i
+ 1, interior
,
1379 dnh
[i
].dnh_dnode
= DN_SLOT_FREE
;
1384 dmu_buf_init_user(&dnc
->dnc_dbu
, NULL
,
1385 dnode_buf_evict_async
, NULL
);
1386 winner
= dmu_buf_set_user(&db
->db
, &dnc
->dnc_dbu
);
1387 if (winner
!= NULL
) {
1389 for (int i
= 0; i
< epb
; i
++)
1390 zrl_destroy(&dnh
[i
].dnh_zrlock
);
1392 kmem_free(dnc
, sizeof (dnode_children_t
) +
1393 epb
* sizeof (dnode_handle_t
));
1398 ASSERT(dnc
->dnc_count
== epb
);
1399 dn
= DN_SLOT_UNINIT
;
1401 if (flag
& DNODE_MUST_BE_ALLOCATED
) {
1404 while (dn
== DN_SLOT_UNINIT
) {
1405 dnode_slots_hold(dnc
, idx
, slots
);
1406 dnh
= &dnc
->dnc_children
[idx
];
1408 if (DN_SLOT_IS_PTR(dnh
->dnh_dnode
)) {
1409 dn
= dnh
->dnh_dnode
;
1411 } else if (dnh
->dnh_dnode
== DN_SLOT_INTERIOR
) {
1412 DNODE_STAT_BUMP(dnode_hold_alloc_interior
);
1413 dnode_slots_rele(dnc
, idx
, slots
);
1414 dbuf_rele(db
, FTAG
);
1415 return (SET_ERROR(EEXIST
));
1416 } else if (dnh
->dnh_dnode
!= DN_SLOT_ALLOCATED
) {
1417 DNODE_STAT_BUMP(dnode_hold_alloc_misses
);
1418 dnode_slots_rele(dnc
, idx
, slots
);
1419 dbuf_rele(db
, FTAG
);
1420 return (SET_ERROR(ENOENT
));
1423 dnode_slots_rele(dnc
, idx
, slots
);
1424 if (!dnode_slots_tryenter(dnc
, idx
, slots
)) {
1425 DNODE_STAT_BUMP(dnode_hold_alloc_lock_retry
);
1430 * Someone else won the race and called dnode_create()
1431 * after we checked DN_SLOT_IS_PTR() above but before
1432 * we acquired the lock.
1434 if (DN_SLOT_IS_PTR(dnh
->dnh_dnode
)) {
1435 DNODE_STAT_BUMP(dnode_hold_alloc_lock_misses
);
1436 dn
= dnh
->dnh_dnode
;
1438 dn
= dnode_create(os
, dn_block
+ idx
, db
,
1443 mutex_enter(&dn
->dn_mtx
);
1444 if (dn
->dn_type
== DMU_OT_NONE
) {
1445 DNODE_STAT_BUMP(dnode_hold_alloc_type_none
);
1446 mutex_exit(&dn
->dn_mtx
);
1447 dnode_slots_rele(dnc
, idx
, slots
);
1448 dbuf_rele(db
, FTAG
);
1449 return (SET_ERROR(ENOENT
));
1452 DNODE_STAT_BUMP(dnode_hold_alloc_hits
);
1453 } else if (flag
& DNODE_MUST_BE_FREE
) {
1455 if (idx
+ slots
- 1 >= DNODES_PER_BLOCK
) {
1456 DNODE_STAT_BUMP(dnode_hold_free_overflow
);
1457 dbuf_rele(db
, FTAG
);
1458 return (SET_ERROR(ENOSPC
));
1461 while (dn
== DN_SLOT_UNINIT
) {
1462 dnode_slots_hold(dnc
, idx
, slots
);
1464 if (!dnode_check_slots_free(dnc
, idx
, slots
)) {
1465 DNODE_STAT_BUMP(dnode_hold_free_misses
);
1466 dnode_slots_rele(dnc
, idx
, slots
);
1467 dbuf_rele(db
, FTAG
);
1468 return (SET_ERROR(ENOSPC
));
1471 dnode_slots_rele(dnc
, idx
, slots
);
1472 if (!dnode_slots_tryenter(dnc
, idx
, slots
)) {
1473 DNODE_STAT_BUMP(dnode_hold_free_lock_retry
);
1477 if (!dnode_check_slots_free(dnc
, idx
, slots
)) {
1478 DNODE_STAT_BUMP(dnode_hold_free_lock_misses
);
1479 dnode_slots_rele(dnc
, idx
, slots
);
1480 dbuf_rele(db
, FTAG
);
1481 return (SET_ERROR(ENOSPC
));
1485 * Allocated but otherwise free dnodes which would
1486 * be in the interior of a multi-slot dnodes need
1487 * to be freed. Single slot dnodes can be safely
1488 * re-purposed as a performance optimization.
1491 dnode_reclaim_slots(dnc
, idx
+ 1, slots
- 1);
1493 dnh
= &dnc
->dnc_children
[idx
];
1494 if (DN_SLOT_IS_PTR(dnh
->dnh_dnode
)) {
1495 dn
= dnh
->dnh_dnode
;
1497 dn
= dnode_create(os
, dn_block
+ idx
, db
,
1502 mutex_enter(&dn
->dn_mtx
);
1503 if (!refcount_is_zero(&dn
->dn_holds
)) {
1504 DNODE_STAT_BUMP(dnode_hold_free_refcount
);
1505 mutex_exit(&dn
->dn_mtx
);
1506 dnode_slots_rele(dnc
, idx
, slots
);
1507 dbuf_rele(db
, FTAG
);
1508 return (SET_ERROR(EEXIST
));
1511 dnode_set_slots(dnc
, idx
+ 1, slots
- 1, DN_SLOT_INTERIOR
);
1512 DNODE_STAT_BUMP(dnode_hold_free_hits
);
1514 dbuf_rele(db
, FTAG
);
1515 return (SET_ERROR(EINVAL
));
1518 if (dn
->dn_free_txg
) {
1519 DNODE_STAT_BUMP(dnode_hold_free_txg
);
1521 mutex_exit(&dn
->dn_mtx
);
1522 dnode_slots_rele(dnc
, idx
, slots
);
1523 dbuf_rele(db
, FTAG
);
1524 return (SET_ERROR((flag
& DNODE_MUST_BE_ALLOCATED
) ?
1528 if (refcount_add(&dn
->dn_holds
, tag
) == 1)
1529 dbuf_add_ref(db
, dnh
);
1531 mutex_exit(&dn
->dn_mtx
);
1533 /* Now we can rely on the hold to prevent the dnode from moving. */
1534 dnode_slots_rele(dnc
, idx
, slots
);
1537 ASSERT3P(dn
->dn_dbuf
, ==, db
);
1538 ASSERT3U(dn
->dn_object
, ==, object
);
1539 dbuf_rele(db
, FTAG
);
1546 * Return held dnode if the object is allocated, NULL if not.
1549 dnode_hold(objset_t
*os
, uint64_t object
, void *tag
, dnode_t
**dnp
)
1551 return (dnode_hold_impl(os
, object
, DNODE_MUST_BE_ALLOCATED
, 0, tag
,
1556 * Can only add a reference if there is already at least one
1557 * reference on the dnode. Returns FALSE if unable to add a
1561 dnode_add_ref(dnode_t
*dn
, void *tag
)
1563 mutex_enter(&dn
->dn_mtx
);
1564 if (refcount_is_zero(&dn
->dn_holds
)) {
1565 mutex_exit(&dn
->dn_mtx
);
1568 VERIFY(1 < refcount_add(&dn
->dn_holds
, tag
));
1569 mutex_exit(&dn
->dn_mtx
);
1574 dnode_rele(dnode_t
*dn
, void *tag
)
1576 mutex_enter(&dn
->dn_mtx
);
1577 dnode_rele_and_unlock(dn
, tag
);
1581 dnode_rele_and_unlock(dnode_t
*dn
, void *tag
)
1584 /* Get while the hold prevents the dnode from moving. */
1585 dmu_buf_impl_t
*db
= dn
->dn_dbuf
;
1586 dnode_handle_t
*dnh
= dn
->dn_handle
;
1588 refs
= refcount_remove(&dn
->dn_holds
, tag
);
1589 mutex_exit(&dn
->dn_mtx
);
1592 * It's unsafe to release the last hold on a dnode by dnode_rele() or
1593 * indirectly by dbuf_rele() while relying on the dnode handle to
1594 * prevent the dnode from moving, since releasing the last hold could
1595 * result in the dnode's parent dbuf evicting its dnode handles. For
1596 * that reason anyone calling dnode_rele() or dbuf_rele() without some
1597 * other direct or indirect hold on the dnode must first drop the dnode
1600 ASSERT(refs
> 0 || dnh
->dnh_zrlock
.zr_owner
!= curthread
);
1602 /* NOTE: the DNODE_DNODE does not have a dn_dbuf */
1603 if (refs
== 0 && db
!= NULL
) {
1605 * Another thread could add a hold to the dnode handle in
1606 * dnode_hold_impl() while holding the parent dbuf. Since the
1607 * hold on the parent dbuf prevents the handle from being
1608 * destroyed, the hold on the handle is OK. We can't yet assert
1609 * that the handle has zero references, but that will be
1610 * asserted anyway when the handle gets destroyed.
1612 mutex_enter(&db
->db_mtx
);
1613 dbuf_rele_and_unlock(db
, dnh
);
1618 dnode_setdirty(dnode_t
*dn
, dmu_tx_t
*tx
)
1620 objset_t
*os
= dn
->dn_objset
;
1621 uint64_t txg
= tx
->tx_txg
;
1623 if (DMU_OBJECT_IS_SPECIAL(dn
->dn_object
)) {
1624 dsl_dataset_dirty(os
->os_dsl_dataset
, tx
);
1631 mutex_enter(&dn
->dn_mtx
);
1632 ASSERT(dn
->dn_phys
->dn_type
|| dn
->dn_allocated_txg
);
1633 ASSERT(dn
->dn_free_txg
== 0 || dn
->dn_free_txg
>= txg
);
1634 mutex_exit(&dn
->dn_mtx
);
1638 * Determine old uid/gid when necessary
1640 dmu_objset_userquota_get_ids(dn
, B_TRUE
, tx
);
1642 multilist_t
*dirtylist
= os
->os_dirty_dnodes
[txg
& TXG_MASK
];
1643 multilist_sublist_t
*mls
= multilist_sublist_lock_obj(dirtylist
, dn
);
1646 * If we are already marked dirty, we're done.
1648 if (multilist_link_active(&dn
->dn_dirty_link
[txg
& TXG_MASK
])) {
1649 multilist_sublist_unlock(mls
);
1653 ASSERT(!refcount_is_zero(&dn
->dn_holds
) ||
1654 !avl_is_empty(&dn
->dn_dbufs
));
1655 ASSERT(dn
->dn_datablksz
!= 0);
1656 ASSERT0(dn
->dn_next_bonuslen
[txg
&TXG_MASK
]);
1657 ASSERT0(dn
->dn_next_blksz
[txg
&TXG_MASK
]);
1658 ASSERT0(dn
->dn_next_bonustype
[txg
&TXG_MASK
]);
1660 dprintf_ds(os
->os_dsl_dataset
, "obj=%llu txg=%llu\n",
1661 dn
->dn_object
, txg
);
1663 multilist_sublist_insert_head(mls
, dn
);
1665 multilist_sublist_unlock(mls
);
1668 * The dnode maintains a hold on its containing dbuf as
1669 * long as there are holds on it. Each instantiated child
1670 * dbuf maintains a hold on the dnode. When the last child
1671 * drops its hold, the dnode will drop its hold on the
1672 * containing dbuf. We add a "dirty hold" here so that the
1673 * dnode will hang around after we finish processing its
1676 VERIFY(dnode_add_ref(dn
, (void *)(uintptr_t)tx
->tx_txg
));
1678 (void) dbuf_dirty(dn
->dn_dbuf
, tx
);
1680 dsl_dataset_dirty(os
->os_dsl_dataset
, tx
);
1684 dnode_free(dnode_t
*dn
, dmu_tx_t
*tx
)
1686 mutex_enter(&dn
->dn_mtx
);
1687 if (dn
->dn_type
== DMU_OT_NONE
|| dn
->dn_free_txg
) {
1688 mutex_exit(&dn
->dn_mtx
);
1691 dn
->dn_free_txg
= tx
->tx_txg
;
1692 mutex_exit(&dn
->dn_mtx
);
1694 dnode_setdirty(dn
, tx
);
1698 * Try to change the block size for the indicated dnode. This can only
1699 * succeed if there are no blocks allocated or dirty beyond first block
1702 dnode_set_blksz(dnode_t
*dn
, uint64_t size
, int ibs
, dmu_tx_t
*tx
)
1707 ASSERT3U(size
, <=, spa_maxblocksize(dmu_objset_spa(dn
->dn_objset
)));
1709 size
= SPA_MINBLOCKSIZE
;
1711 size
= P2ROUNDUP(size
, SPA_MINBLOCKSIZE
);
1713 if (ibs
== dn
->dn_indblkshift
)
1716 if (size
>> SPA_MINBLOCKSHIFT
== dn
->dn_datablkszsec
&& ibs
== 0)
1719 rw_enter(&dn
->dn_struct_rwlock
, RW_WRITER
);
1721 /* Check for any allocated blocks beyond the first */
1722 if (dn
->dn_maxblkid
!= 0)
1725 mutex_enter(&dn
->dn_dbufs_mtx
);
1726 for (db
= avl_first(&dn
->dn_dbufs
); db
!= NULL
;
1727 db
= AVL_NEXT(&dn
->dn_dbufs
, db
)) {
1728 if (db
->db_blkid
!= 0 && db
->db_blkid
!= DMU_BONUS_BLKID
&&
1729 db
->db_blkid
!= DMU_SPILL_BLKID
) {
1730 mutex_exit(&dn
->dn_dbufs_mtx
);
1734 mutex_exit(&dn
->dn_dbufs_mtx
);
1736 if (ibs
&& dn
->dn_nlevels
!= 1)
1739 /* resize the old block */
1740 err
= dbuf_hold_impl(dn
, 0, 0, TRUE
, FALSE
, FTAG
, &db
);
1742 dbuf_new_size(db
, size
, tx
);
1743 else if (err
!= ENOENT
)
1746 dnode_setdblksz(dn
, size
);
1747 dnode_setdirty(dn
, tx
);
1748 dn
->dn_next_blksz
[tx
->tx_txg
&TXG_MASK
] = size
;
1750 dn
->dn_indblkshift
= ibs
;
1751 dn
->dn_next_indblkshift
[tx
->tx_txg
&TXG_MASK
] = ibs
;
1753 /* rele after we have fixed the blocksize in the dnode */
1755 dbuf_rele(db
, FTAG
);
1757 rw_exit(&dn
->dn_struct_rwlock
);
1761 rw_exit(&dn
->dn_struct_rwlock
);
1762 return (SET_ERROR(ENOTSUP
));
1766 dnode_set_nlevels_impl(dnode_t
*dn
, int new_nlevels
, dmu_tx_t
*tx
)
1768 uint64_t txgoff
= tx
->tx_txg
& TXG_MASK
;
1769 int old_nlevels
= dn
->dn_nlevels
;
1772 dbuf_dirty_record_t
*new, *dr
, *dr_next
;
1774 ASSERT(RW_WRITE_HELD(&dn
->dn_struct_rwlock
));
1776 dn
->dn_nlevels
= new_nlevels
;
1778 ASSERT3U(new_nlevels
, >, dn
->dn_next_nlevels
[txgoff
]);
1779 dn
->dn_next_nlevels
[txgoff
] = new_nlevels
;
1781 /* dirty the left indirects */
1782 db
= dbuf_hold_level(dn
, old_nlevels
, 0, FTAG
);
1784 new = dbuf_dirty(db
, tx
);
1785 dbuf_rele(db
, FTAG
);
1787 /* transfer the dirty records to the new indirect */
1788 mutex_enter(&dn
->dn_mtx
);
1789 mutex_enter(&new->dt
.di
.dr_mtx
);
1790 list
= &dn
->dn_dirty_records
[txgoff
];
1791 for (dr
= list_head(list
); dr
; dr
= dr_next
) {
1792 dr_next
= list_next(&dn
->dn_dirty_records
[txgoff
], dr
);
1793 if (dr
->dr_dbuf
->db_level
!= new_nlevels
-1 &&
1794 dr
->dr_dbuf
->db_blkid
!= DMU_BONUS_BLKID
&&
1795 dr
->dr_dbuf
->db_blkid
!= DMU_SPILL_BLKID
) {
1796 ASSERT(dr
->dr_dbuf
->db_level
== old_nlevels
-1);
1797 list_remove(&dn
->dn_dirty_records
[txgoff
], dr
);
1798 list_insert_tail(&new->dt
.di
.dr_children
, dr
);
1799 dr
->dr_parent
= new;
1802 mutex_exit(&new->dt
.di
.dr_mtx
);
1803 mutex_exit(&dn
->dn_mtx
);
1807 dnode_set_nlevels(dnode_t
*dn
, int nlevels
, dmu_tx_t
*tx
)
1811 rw_enter(&dn
->dn_struct_rwlock
, RW_WRITER
);
1813 if (dn
->dn_nlevels
== nlevels
) {
1816 } else if (nlevels
< dn
->dn_nlevels
) {
1817 ret
= SET_ERROR(EINVAL
);
1821 dnode_set_nlevels_impl(dn
, nlevels
, tx
);
1824 rw_exit(&dn
->dn_struct_rwlock
);
1828 /* read-holding callers must not rely on the lock being continuously held */
1830 dnode_new_blkid(dnode_t
*dn
, uint64_t blkid
, dmu_tx_t
*tx
, boolean_t have_read
)
1832 int epbs
, new_nlevels
;
1835 ASSERT(blkid
!= DMU_BONUS_BLKID
);
1838 RW_READ_HELD(&dn
->dn_struct_rwlock
) :
1839 RW_WRITE_HELD(&dn
->dn_struct_rwlock
));
1842 * if we have a read-lock, check to see if we need to do any work
1843 * before upgrading to a write-lock.
1846 if (blkid
<= dn
->dn_maxblkid
)
1849 if (!rw_tryupgrade(&dn
->dn_struct_rwlock
)) {
1850 rw_exit(&dn
->dn_struct_rwlock
);
1851 rw_enter(&dn
->dn_struct_rwlock
, RW_WRITER
);
1855 if (blkid
<= dn
->dn_maxblkid
)
1858 dn
->dn_maxblkid
= blkid
;
1859 dn
->dn_next_maxblkid
[tx
->tx_txg
& TXG_MASK
] = blkid
;
1862 * Compute the number of levels necessary to support the new maxblkid.
1865 epbs
= dn
->dn_indblkshift
- SPA_BLKPTRSHIFT
;
1866 for (sz
= dn
->dn_nblkptr
;
1867 sz
<= blkid
&& sz
>= dn
->dn_nblkptr
; sz
<<= epbs
)
1870 ASSERT3U(new_nlevels
, <=, DN_MAX_LEVELS
);
1872 if (new_nlevels
> dn
->dn_nlevels
)
1873 dnode_set_nlevels_impl(dn
, new_nlevels
, tx
);
1877 rw_downgrade(&dn
->dn_struct_rwlock
);
1881 dnode_dirty_l1(dnode_t
*dn
, uint64_t l1blkid
, dmu_tx_t
*tx
)
1883 dmu_buf_impl_t
*db
= dbuf_hold_level(dn
, 1, l1blkid
, FTAG
);
1885 dmu_buf_will_dirty(&db
->db
, tx
);
1886 dbuf_rele(db
, FTAG
);
1891 dnode_free_range(dnode_t
*dn
, uint64_t off
, uint64_t len
, dmu_tx_t
*tx
)
1894 uint64_t blkoff
, blkid
, nblks
;
1895 int blksz
, blkshift
, head
, tail
;
1899 rw_enter(&dn
->dn_struct_rwlock
, RW_WRITER
);
1900 blksz
= dn
->dn_datablksz
;
1901 blkshift
= dn
->dn_datablkshift
;
1902 epbs
= dn
->dn_indblkshift
- SPA_BLKPTRSHIFT
;
1904 if (len
== DMU_OBJECT_END
) {
1905 len
= UINT64_MAX
- off
;
1910 * First, block align the region to free:
1913 head
= P2NPHASE(off
, blksz
);
1914 blkoff
= P2PHASE(off
, blksz
);
1915 if ((off
>> blkshift
) > dn
->dn_maxblkid
)
1918 ASSERT(dn
->dn_maxblkid
== 0);
1919 if (off
== 0 && len
>= blksz
) {
1921 * Freeing the whole block; fast-track this request.
1922 * Note that we won't dirty any indirect blocks,
1923 * which is fine because we will be freeing the entire
1924 * file and thus all indirect blocks will be freed
1925 * by free_children().
1930 } else if (off
>= blksz
) {
1931 /* Freeing past end-of-data */
1934 /* Freeing part of the block. */
1936 ASSERT3U(head
, >, 0);
1940 /* zero out any partial block data at the start of the range */
1942 ASSERT3U(blkoff
+ head
, ==, blksz
);
1945 if (dbuf_hold_impl(dn
, 0, dbuf_whichblock(dn
, 0, off
),
1946 TRUE
, FALSE
, FTAG
, &db
) == 0) {
1949 /* don't dirty if it isn't on disk and isn't dirty */
1950 if (db
->db_last_dirty
||
1951 (db
->db_blkptr
&& !BP_IS_HOLE(db
->db_blkptr
))) {
1952 rw_exit(&dn
->dn_struct_rwlock
);
1953 dmu_buf_will_dirty(&db
->db
, tx
);
1954 rw_enter(&dn
->dn_struct_rwlock
, RW_WRITER
);
1955 data
= db
->db
.db_data
;
1956 bzero(data
+ blkoff
, head
);
1958 dbuf_rele(db
, FTAG
);
1964 /* If the range was less than one block, we're done */
1968 /* If the remaining range is past end of file, we're done */
1969 if ((off
>> blkshift
) > dn
->dn_maxblkid
)
1972 ASSERT(ISP2(blksz
));
1976 tail
= P2PHASE(len
, blksz
);
1978 ASSERT0(P2PHASE(off
, blksz
));
1979 /* zero out any partial block data at the end of the range */
1983 if (dbuf_hold_impl(dn
, 0, dbuf_whichblock(dn
, 0, off
+len
),
1984 TRUE
, FALSE
, FTAG
, &db
) == 0) {
1985 /* don't dirty if not on disk and not dirty */
1986 if (db
->db_last_dirty
||
1987 (db
->db_blkptr
&& !BP_IS_HOLE(db
->db_blkptr
))) {
1988 rw_exit(&dn
->dn_struct_rwlock
);
1989 dmu_buf_will_dirty(&db
->db
, tx
);
1990 rw_enter(&dn
->dn_struct_rwlock
, RW_WRITER
);
1991 bzero(db
->db
.db_data
, tail
);
1993 dbuf_rele(db
, FTAG
);
1998 /* If the range did not include a full block, we are done */
2002 ASSERT(IS_P2ALIGNED(off
, blksz
));
2003 ASSERT(trunc
|| IS_P2ALIGNED(len
, blksz
));
2004 blkid
= off
>> blkshift
;
2005 nblks
= len
>> blkshift
;
2010 * Dirty all the indirect blocks in this range. Note that only
2011 * the first and last indirect blocks can actually be written
2012 * (if they were partially freed) -- they must be dirtied, even if
2013 * they do not exist on disk yet. The interior blocks will
2014 * be freed by free_children(), so they will not actually be written.
2015 * Even though these interior blocks will not be written, we
2016 * dirty them for two reasons:
2018 * - It ensures that the indirect blocks remain in memory until
2019 * syncing context. (They have already been prefetched by
2020 * dmu_tx_hold_free(), so we don't have to worry about reading
2021 * them serially here.)
2023 * - The dirty space accounting will put pressure on the txg sync
2024 * mechanism to begin syncing, and to delay transactions if there
2025 * is a large amount of freeing. Even though these indirect
2026 * blocks will not be written, we could need to write the same
2027 * amount of space if we copy the freed BPs into deadlists.
2029 if (dn
->dn_nlevels
> 1) {
2030 uint64_t first
, last
;
2032 first
= blkid
>> epbs
;
2033 dnode_dirty_l1(dn
, first
, tx
);
2035 last
= dn
->dn_maxblkid
>> epbs
;
2037 last
= (blkid
+ nblks
- 1) >> epbs
;
2039 dnode_dirty_l1(dn
, last
, tx
);
2041 int shift
= dn
->dn_datablkshift
+ dn
->dn_indblkshift
-
2043 for (uint64_t i
= first
+ 1; i
< last
; i
++) {
2045 * Set i to the blockid of the next non-hole
2046 * level-1 indirect block at or after i. Note
2047 * that dnode_next_offset() operates in terms of
2048 * level-0-equivalent bytes.
2050 uint64_t ibyte
= i
<< shift
;
2051 int err
= dnode_next_offset(dn
, DNODE_FIND_HAVELOCK
,
2058 * Normally we should not see an error, either
2059 * from dnode_next_offset() or dbuf_hold_level()
2060 * (except for ESRCH from dnode_next_offset).
2061 * If there is an i/o error, then when we read
2062 * this block in syncing context, it will use
2063 * ZIO_FLAG_MUSTSUCCEED, and thus hang/panic according
2064 * to the "failmode" property. dnode_next_offset()
2065 * doesn't have a flag to indicate MUSTSUCCEED.
2070 dnode_dirty_l1(dn
, i
, tx
);
2076 * Add this range to the dnode range list.
2077 * We will finish up this free operation in the syncing phase.
2079 mutex_enter(&dn
->dn_mtx
);
2081 int txgoff
= tx
->tx_txg
& TXG_MASK
;
2082 if (dn
->dn_free_ranges
[txgoff
] == NULL
) {
2083 dn
->dn_free_ranges
[txgoff
] = range_tree_create(NULL
, NULL
);
2085 range_tree_clear(dn
->dn_free_ranges
[txgoff
], blkid
, nblks
);
2086 range_tree_add(dn
->dn_free_ranges
[txgoff
], blkid
, nblks
);
2088 dprintf_dnode(dn
, "blkid=%llu nblks=%llu txg=%llu\n",
2089 blkid
, nblks
, tx
->tx_txg
);
2090 mutex_exit(&dn
->dn_mtx
);
2092 dbuf_free_range(dn
, blkid
, blkid
+ nblks
- 1, tx
);
2093 dnode_setdirty(dn
, tx
);
2096 rw_exit(&dn
->dn_struct_rwlock
);
2100 dnode_spill_freed(dnode_t
*dn
)
2104 mutex_enter(&dn
->dn_mtx
);
2105 for (i
= 0; i
< TXG_SIZE
; i
++) {
2106 if (dn
->dn_rm_spillblk
[i
] == DN_KILL_SPILLBLK
)
2109 mutex_exit(&dn
->dn_mtx
);
2110 return (i
< TXG_SIZE
);
2113 /* return TRUE if this blkid was freed in a recent txg, or FALSE if it wasn't */
2115 dnode_block_freed(dnode_t
*dn
, uint64_t blkid
)
2117 void *dp
= spa_get_dsl(dn
->dn_objset
->os_spa
);
2120 if (blkid
== DMU_BONUS_BLKID
)
2124 * If we're in the process of opening the pool, dp will not be
2125 * set yet, but there shouldn't be anything dirty.
2130 if (dn
->dn_free_txg
)
2133 if (blkid
== DMU_SPILL_BLKID
)
2134 return (dnode_spill_freed(dn
));
2136 mutex_enter(&dn
->dn_mtx
);
2137 for (i
= 0; i
< TXG_SIZE
; i
++) {
2138 if (dn
->dn_free_ranges
[i
] != NULL
&&
2139 range_tree_contains(dn
->dn_free_ranges
[i
], blkid
, 1))
2142 mutex_exit(&dn
->dn_mtx
);
2143 return (i
< TXG_SIZE
);
2146 /* call from syncing context when we actually write/free space for this dnode */
2148 dnode_diduse_space(dnode_t
*dn
, int64_t delta
)
2151 dprintf_dnode(dn
, "dn=%p dnp=%p used=%llu delta=%lld\n",
2153 (u_longlong_t
)dn
->dn_phys
->dn_used
,
2156 mutex_enter(&dn
->dn_mtx
);
2157 space
= DN_USED_BYTES(dn
->dn_phys
);
2159 ASSERT3U(space
+ delta
, >=, space
); /* no overflow */
2161 ASSERT3U(space
, >=, -delta
); /* no underflow */
2164 if (spa_version(dn
->dn_objset
->os_spa
) < SPA_VERSION_DNODE_BYTES
) {
2165 ASSERT((dn
->dn_phys
->dn_flags
& DNODE_FLAG_USED_BYTES
) == 0);
2166 ASSERT0(P2PHASE(space
, 1<<DEV_BSHIFT
));
2167 dn
->dn_phys
->dn_used
= space
>> DEV_BSHIFT
;
2169 dn
->dn_phys
->dn_used
= space
;
2170 dn
->dn_phys
->dn_flags
|= DNODE_FLAG_USED_BYTES
;
2172 mutex_exit(&dn
->dn_mtx
);
2176 * Scans a block at the indicated "level" looking for a hole or data,
2177 * depending on 'flags'.
2179 * If level > 0, then we are scanning an indirect block looking at its
2180 * pointers. If level == 0, then we are looking at a block of dnodes.
2182 * If we don't find what we are looking for in the block, we return ESRCH.
2183 * Otherwise, return with *offset pointing to the beginning (if searching
2184 * forwards) or end (if searching backwards) of the range covered by the
2185 * block pointer we matched on (or dnode).
2187 * The basic search algorithm used below by dnode_next_offset() is to
2188 * use this function to search up the block tree (widen the search) until
2189 * we find something (i.e., we don't return ESRCH) and then search back
2190 * down the tree (narrow the search) until we reach our original search
2194 dnode_next_offset_level(dnode_t
*dn
, int flags
, uint64_t *offset
,
2195 int lvl
, uint64_t blkfill
, uint64_t txg
)
2197 dmu_buf_impl_t
*db
= NULL
;
2199 uint64_t epbs
= dn
->dn_phys
->dn_indblkshift
- SPA_BLKPTRSHIFT
;
2200 uint64_t epb
= 1ULL << epbs
;
2201 uint64_t minfill
, maxfill
;
2203 int i
, inc
, error
, span
;
2205 hole
= ((flags
& DNODE_FIND_HOLE
) != 0);
2206 inc
= (flags
& DNODE_FIND_BACKWARDS
) ? -1 : 1;
2207 ASSERT(txg
== 0 || !hole
);
2209 if (lvl
== dn
->dn_phys
->dn_nlevels
) {
2211 epb
= dn
->dn_phys
->dn_nblkptr
;
2212 data
= dn
->dn_phys
->dn_blkptr
;
2214 uint64_t blkid
= dbuf_whichblock(dn
, lvl
, *offset
);
2215 error
= dbuf_hold_impl(dn
, lvl
, blkid
, TRUE
, FALSE
, FTAG
, &db
);
2217 if (error
!= ENOENT
)
2222 * This can only happen when we are searching up
2223 * the block tree for data. We don't really need to
2224 * adjust the offset, as we will just end up looking
2225 * at the pointer to this block in its parent, and its
2226 * going to be unallocated, so we will skip over it.
2228 return (SET_ERROR(ESRCH
));
2230 error
= dbuf_read(db
, NULL
,
2231 DB_RF_CANFAIL
| DB_RF_HAVESTRUCT
| DB_RF_NO_DECRYPT
);
2233 dbuf_rele(db
, FTAG
);
2236 data
= db
->db
.db_data
;
2240 if (db
!= NULL
&& txg
!= 0 && (db
->db_blkptr
== NULL
||
2241 db
->db_blkptr
->blk_birth
<= txg
||
2242 BP_IS_HOLE(db
->db_blkptr
))) {
2244 * This can only happen when we are searching up the tree
2245 * and these conditions mean that we need to keep climbing.
2247 error
= SET_ERROR(ESRCH
);
2248 } else if (lvl
== 0) {
2249 dnode_phys_t
*dnp
= data
;
2251 ASSERT(dn
->dn_type
== DMU_OT_DNODE
);
2252 ASSERT(!(flags
& DNODE_FIND_BACKWARDS
));
2254 for (i
= (*offset
>> DNODE_SHIFT
) & (blkfill
- 1);
2255 i
< blkfill
; i
+= dnp
[i
].dn_extra_slots
+ 1) {
2256 if ((dnp
[i
].dn_type
== DMU_OT_NONE
) == hole
)
2261 error
= SET_ERROR(ESRCH
);
2263 *offset
= (*offset
& ~(DNODE_BLOCK_SIZE
- 1)) +
2266 blkptr_t
*bp
= data
;
2267 uint64_t start
= *offset
;
2268 span
= (lvl
- 1) * epbs
+ dn
->dn_datablkshift
;
2270 maxfill
= blkfill
<< ((lvl
- 1) * epbs
);
2277 if (span
>= 8 * sizeof (*offset
)) {
2278 /* This only happens on the highest indirection level */
2279 ASSERT3U((lvl
- 1), ==, dn
->dn_phys
->dn_nlevels
- 1);
2282 *offset
= *offset
>> span
;
2285 for (i
= BF64_GET(*offset
, 0, epbs
);
2286 i
>= 0 && i
< epb
; i
+= inc
) {
2287 if (BP_GET_FILL(&bp
[i
]) >= minfill
&&
2288 BP_GET_FILL(&bp
[i
]) <= maxfill
&&
2289 (hole
|| bp
[i
].blk_birth
> txg
))
2291 if (inc
> 0 || *offset
> 0)
2295 if (span
>= 8 * sizeof (*offset
)) {
2298 *offset
= *offset
<< span
;
2302 /* traversing backwards; position offset at the end */
2303 ASSERT3U(*offset
, <=, start
);
2304 *offset
= MIN(*offset
+ (1ULL << span
) - 1, start
);
2305 } else if (*offset
< start
) {
2308 if (i
< 0 || i
>= epb
)
2309 error
= SET_ERROR(ESRCH
);
2313 dbuf_rele(db
, FTAG
);
2319 * Find the next hole, data, or sparse region at or after *offset.
2320 * The value 'blkfill' tells us how many items we expect to find
2321 * in an L0 data block; this value is 1 for normal objects,
2322 * DNODES_PER_BLOCK for the meta dnode, and some fraction of
2323 * DNODES_PER_BLOCK when searching for sparse regions thereof.
2327 * dnode_next_offset(dn, flags, offset, 1, 1, 0);
2328 * Finds the next/previous hole/data in a file.
2329 * Used in dmu_offset_next().
2331 * dnode_next_offset(mdn, flags, offset, 0, DNODES_PER_BLOCK, txg);
2332 * Finds the next free/allocated dnode an objset's meta-dnode.
2333 * Only finds objects that have new contents since txg (ie.
2334 * bonus buffer changes and content removal are ignored).
2335 * Used in dmu_object_next().
2337 * dnode_next_offset(mdn, DNODE_FIND_HOLE, offset, 2, DNODES_PER_BLOCK >> 2, 0);
2338 * Finds the next L2 meta-dnode bp that's at most 1/4 full.
2339 * Used in dmu_object_alloc().
2342 dnode_next_offset(dnode_t
*dn
, int flags
, uint64_t *offset
,
2343 int minlvl
, uint64_t blkfill
, uint64_t txg
)
2345 uint64_t initial_offset
= *offset
;
2349 if (!(flags
& DNODE_FIND_HAVELOCK
))
2350 rw_enter(&dn
->dn_struct_rwlock
, RW_READER
);
2352 if (dn
->dn_phys
->dn_nlevels
== 0) {
2353 error
= SET_ERROR(ESRCH
);
2357 if (dn
->dn_datablkshift
== 0) {
2358 if (*offset
< dn
->dn_datablksz
) {
2359 if (flags
& DNODE_FIND_HOLE
)
2360 *offset
= dn
->dn_datablksz
;
2362 error
= SET_ERROR(ESRCH
);
2367 maxlvl
= dn
->dn_phys
->dn_nlevels
;
2369 for (lvl
= minlvl
; lvl
<= maxlvl
; lvl
++) {
2370 error
= dnode_next_offset_level(dn
,
2371 flags
, offset
, lvl
, blkfill
, txg
);
2376 while (error
== 0 && --lvl
>= minlvl
) {
2377 error
= dnode_next_offset_level(dn
,
2378 flags
, offset
, lvl
, blkfill
, txg
);
2382 * There's always a "virtual hole" at the end of the object, even
2383 * if all BP's which physically exist are non-holes.
2385 if ((flags
& DNODE_FIND_HOLE
) && error
== ESRCH
&& txg
== 0 &&
2386 minlvl
== 1 && blkfill
== 1 && !(flags
& DNODE_FIND_BACKWARDS
)) {
2390 if (error
== 0 && (flags
& DNODE_FIND_BACKWARDS
?
2391 initial_offset
< *offset
: initial_offset
> *offset
))
2392 error
= SET_ERROR(ESRCH
);
2394 if (!(flags
& DNODE_FIND_HAVELOCK
))
2395 rw_exit(&dn
->dn_struct_rwlock
);