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 2011 Nexenta Systems, Inc. All rights reserved.
24 * Copyright (c) 2012, 2018 by Delphix. All rights reserved.
25 * Copyright (c) 2013 by Saso Kiselkov. All rights reserved.
26 * Copyright (c) 2014 Spectra Logic Corporation, All rights reserved.
29 #include <sys/zfs_context.h>
32 #include <sys/dmu_send.h>
33 #include <sys/dmu_impl.h>
35 #include <sys/dmu_objset.h>
36 #include <sys/dsl_dataset.h>
37 #include <sys/dsl_dir.h>
38 #include <sys/dmu_tx.h>
41 #include <sys/dmu_zfetch.h>
43 #include <sys/sa_impl.h>
44 #include <sys/zfeature.h>
45 #include <sys/blkptr.h>
46 #include <sys/range_tree.h>
47 #include <sys/trace_dbuf.h>
48 #include <sys/callb.h>
51 #include <sys/cityhash.h>
52 #include <sys/spa_impl.h>
56 typedef struct dbuf_stats
{
58 * Various statistics about the size of the dbuf cache.
60 kstat_named_t cache_count
;
61 kstat_named_t cache_size_bytes
;
62 kstat_named_t cache_size_bytes_max
;
64 * Statistics regarding the bounds on the dbuf cache size.
66 kstat_named_t cache_target_bytes
;
67 kstat_named_t cache_lowater_bytes
;
68 kstat_named_t cache_hiwater_bytes
;
70 * Total number of dbuf cache evictions that have occurred.
72 kstat_named_t cache_total_evicts
;
74 * The distribution of dbuf levels in the dbuf cache and
75 * the total size of all dbufs at each level.
77 kstat_named_t cache_levels
[DN_MAX_LEVELS
];
78 kstat_named_t cache_levels_bytes
[DN_MAX_LEVELS
];
80 * Statistics about the dbuf hash table.
82 kstat_named_t hash_hits
;
83 kstat_named_t hash_misses
;
84 kstat_named_t hash_collisions
;
85 kstat_named_t hash_elements
;
86 kstat_named_t hash_elements_max
;
88 * Number of sublists containing more than one dbuf in the dbuf
89 * hash table. Keep track of the longest hash chain.
91 kstat_named_t hash_chains
;
92 kstat_named_t hash_chain_max
;
94 * Number of times a dbuf_create() discovers that a dbuf was
95 * already created and in the dbuf hash table.
97 kstat_named_t hash_insert_race
;
99 * Statistics about the size of the metadata dbuf cache.
101 kstat_named_t metadata_cache_count
;
102 kstat_named_t metadata_cache_size_bytes
;
103 kstat_named_t metadata_cache_size_bytes_max
;
105 * For diagnostic purposes, this is incremented whenever we can't add
106 * something to the metadata cache because it's full, and instead put
107 * the data in the regular dbuf cache.
109 kstat_named_t metadata_cache_overflow
;
112 dbuf_stats_t dbuf_stats
= {
113 { "cache_count", KSTAT_DATA_UINT64
},
114 { "cache_size_bytes", KSTAT_DATA_UINT64
},
115 { "cache_size_bytes_max", KSTAT_DATA_UINT64
},
116 { "cache_target_bytes", KSTAT_DATA_UINT64
},
117 { "cache_lowater_bytes", KSTAT_DATA_UINT64
},
118 { "cache_hiwater_bytes", KSTAT_DATA_UINT64
},
119 { "cache_total_evicts", KSTAT_DATA_UINT64
},
120 { { "cache_levels_N", KSTAT_DATA_UINT64
} },
121 { { "cache_levels_bytes_N", KSTAT_DATA_UINT64
} },
122 { "hash_hits", KSTAT_DATA_UINT64
},
123 { "hash_misses", KSTAT_DATA_UINT64
},
124 { "hash_collisions", KSTAT_DATA_UINT64
},
125 { "hash_elements", KSTAT_DATA_UINT64
},
126 { "hash_elements_max", KSTAT_DATA_UINT64
},
127 { "hash_chains", KSTAT_DATA_UINT64
},
128 { "hash_chain_max", KSTAT_DATA_UINT64
},
129 { "hash_insert_race", KSTAT_DATA_UINT64
},
130 { "metadata_cache_count", KSTAT_DATA_UINT64
},
131 { "metadata_cache_size_bytes", KSTAT_DATA_UINT64
},
132 { "metadata_cache_size_bytes_max", KSTAT_DATA_UINT64
},
133 { "metadata_cache_overflow", KSTAT_DATA_UINT64
}
136 #define DBUF_STAT_INCR(stat, val) \
137 atomic_add_64(&dbuf_stats.stat.value.ui64, (val));
138 #define DBUF_STAT_DECR(stat, val) \
139 DBUF_STAT_INCR(stat, -(val));
140 #define DBUF_STAT_BUMP(stat) \
141 DBUF_STAT_INCR(stat, 1);
142 #define DBUF_STAT_BUMPDOWN(stat) \
143 DBUF_STAT_INCR(stat, -1);
144 #define DBUF_STAT_MAX(stat, v) { \
146 while ((v) > (_m = dbuf_stats.stat.value.ui64) && \
147 (_m != atomic_cas_64(&dbuf_stats.stat.value.ui64, _m, (v))))\
151 struct dbuf_hold_impl_data
{
152 /* Function arguments */
156 boolean_t dh_fail_sparse
;
157 boolean_t dh_fail_uncached
;
159 dmu_buf_impl_t
**dh_dbp
;
160 /* Local variables */
161 dmu_buf_impl_t
*dh_db
;
162 dmu_buf_impl_t
*dh_parent
;
165 dbuf_dirty_record_t
*dh_dr
;
169 static void __dbuf_hold_impl_init(struct dbuf_hold_impl_data
*dh
,
170 dnode_t
*dn
, uint8_t level
, uint64_t blkid
, boolean_t fail_sparse
,
171 boolean_t fail_uncached
,
172 void *tag
, dmu_buf_impl_t
**dbp
, int depth
);
173 static int __dbuf_hold_impl(struct dbuf_hold_impl_data
*dh
);
175 static boolean_t
dbuf_undirty(dmu_buf_impl_t
*db
, dmu_tx_t
*tx
);
176 static void dbuf_write(dbuf_dirty_record_t
*dr
, arc_buf_t
*data
, dmu_tx_t
*tx
);
178 extern inline void dmu_buf_init_user(dmu_buf_user_t
*dbu
,
179 dmu_buf_evict_func_t
*evict_func_sync
,
180 dmu_buf_evict_func_t
*evict_func_async
,
181 dmu_buf_t
**clear_on_evict_dbufp
);
184 * Global data structures and functions for the dbuf cache.
186 static kmem_cache_t
*dbuf_kmem_cache
;
187 static taskq_t
*dbu_evict_taskq
;
189 static kthread_t
*dbuf_cache_evict_thread
;
190 static kmutex_t dbuf_evict_lock
;
191 static kcondvar_t dbuf_evict_cv
;
192 static boolean_t dbuf_evict_thread_exit
;
195 * There are two dbuf caches; each dbuf can only be in one of them at a time.
197 * 1. Cache of metadata dbufs, to help make read-heavy administrative commands
198 * from /sbin/zfs run faster. The "metadata cache" specifically stores dbufs
199 * that represent the metadata that describes filesystems/snapshots/
200 * bookmarks/properties/etc. We only evict from this cache when we export a
201 * pool, to short-circuit as much I/O as possible for all administrative
202 * commands that need the metadata. There is no eviction policy for this
203 * cache, because we try to only include types in it which would occupy a
204 * very small amount of space per object but create a large impact on the
205 * performance of these commands. Instead, after it reaches a maximum size
206 * (which should only happen on very small memory systems with a very large
207 * number of filesystem objects), we stop taking new dbufs into the
208 * metadata cache, instead putting them in the normal dbuf cache.
210 * 2. LRU cache of dbufs. The dbuf cache maintains a list of dbufs that
211 * are not currently held but have been recently released. These dbufs
212 * are not eligible for arc eviction until they are aged out of the cache.
213 * Dbufs that are aged out of the cache will be immediately destroyed and
214 * become eligible for arc eviction.
216 * Dbufs are added to these caches once the last hold is released. If a dbuf is
217 * later accessed and still exists in the dbuf cache, then it will be removed
218 * from the cache and later re-added to the head of the cache.
220 * If a given dbuf meets the requirements for the metadata cache, it will go
221 * there, otherwise it will be considered for the generic LRU dbuf cache. The
222 * caches and the refcounts tracking their sizes are stored in an array indexed
223 * by those caches' matching enum values (from dbuf_cached_state_t).
225 typedef struct dbuf_cache
{
229 dbuf_cache_t dbuf_caches
[DB_CACHE_MAX
];
231 /* Size limits for the caches */
232 unsigned long dbuf_cache_max_bytes
= 0;
233 unsigned long dbuf_metadata_cache_max_bytes
= 0;
234 /* Set the default sizes of the caches to log2 fraction of arc size */
235 int dbuf_cache_shift
= 5;
236 int dbuf_metadata_cache_shift
= 6;
239 * The LRU dbuf cache uses a three-stage eviction policy:
240 * - A low water marker designates when the dbuf eviction thread
241 * should stop evicting from the dbuf cache.
242 * - When we reach the maximum size (aka mid water mark), we
243 * signal the eviction thread to run.
244 * - The high water mark indicates when the eviction thread
245 * is unable to keep up with the incoming load and eviction must
246 * happen in the context of the calling thread.
250 * low water mid water hi water
251 * +----------------------------------------+----------+----------+
256 * +----------------------------------------+----------+----------+
258 * evicting eviction directly
261 * The high and low water marks indicate the operating range for the eviction
262 * thread. The low water mark is, by default, 90% of the total size of the
263 * cache and the high water mark is at 110% (both of these percentages can be
264 * changed by setting dbuf_cache_lowater_pct and dbuf_cache_hiwater_pct,
265 * respectively). The eviction thread will try to ensure that the cache remains
266 * within this range by waking up every second and checking if the cache is
267 * above the low water mark. The thread can also be woken up by callers adding
268 * elements into the cache if the cache is larger than the mid water (i.e max
269 * cache size). Once the eviction thread is woken up and eviction is required,
270 * it will continue evicting buffers until it's able to reduce the cache size
271 * to the low water mark. If the cache size continues to grow and hits the high
272 * water mark, then callers adding elements to the cache will begin to evict
273 * directly from the cache until the cache is no longer above the high water
278 * The percentage above and below the maximum cache size.
280 uint_t dbuf_cache_hiwater_pct
= 10;
281 uint_t dbuf_cache_lowater_pct
= 10;
285 dbuf_cons(void *vdb
, void *unused
, int kmflag
)
287 dmu_buf_impl_t
*db
= vdb
;
288 bzero(db
, sizeof (dmu_buf_impl_t
));
290 mutex_init(&db
->db_mtx
, NULL
, MUTEX_DEFAULT
, NULL
);
291 cv_init(&db
->db_changed
, NULL
, CV_DEFAULT
, NULL
);
292 multilist_link_init(&db
->db_cache_link
);
293 refcount_create(&db
->db_holds
);
300 dbuf_dest(void *vdb
, void *unused
)
302 dmu_buf_impl_t
*db
= vdb
;
303 mutex_destroy(&db
->db_mtx
);
304 cv_destroy(&db
->db_changed
);
305 ASSERT(!multilist_link_active(&db
->db_cache_link
));
306 refcount_destroy(&db
->db_holds
);
310 * dbuf hash table routines
312 static dbuf_hash_table_t dbuf_hash_table
;
314 static uint64_t dbuf_hash_count
;
317 * We use Cityhash for this. It's fast, and has good hash properties without
318 * requiring any large static buffers.
321 dbuf_hash(void *os
, uint64_t obj
, uint8_t lvl
, uint64_t blkid
)
323 return (cityhash4((uintptr_t)os
, obj
, (uint64_t)lvl
, blkid
));
326 #define DBUF_EQUAL(dbuf, os, obj, level, blkid) \
327 ((dbuf)->db.db_object == (obj) && \
328 (dbuf)->db_objset == (os) && \
329 (dbuf)->db_level == (level) && \
330 (dbuf)->db_blkid == (blkid))
333 dbuf_find(objset_t
*os
, uint64_t obj
, uint8_t level
, uint64_t blkid
)
335 dbuf_hash_table_t
*h
= &dbuf_hash_table
;
340 hv
= dbuf_hash(os
, obj
, level
, blkid
);
341 idx
= hv
& h
->hash_table_mask
;
343 mutex_enter(DBUF_HASH_MUTEX(h
, idx
));
344 for (db
= h
->hash_table
[idx
]; db
!= NULL
; db
= db
->db_hash_next
) {
345 if (DBUF_EQUAL(db
, os
, obj
, level
, blkid
)) {
346 mutex_enter(&db
->db_mtx
);
347 if (db
->db_state
!= DB_EVICTING
) {
348 mutex_exit(DBUF_HASH_MUTEX(h
, idx
));
351 mutex_exit(&db
->db_mtx
);
354 mutex_exit(DBUF_HASH_MUTEX(h
, idx
));
358 static dmu_buf_impl_t
*
359 dbuf_find_bonus(objset_t
*os
, uint64_t object
)
362 dmu_buf_impl_t
*db
= NULL
;
364 if (dnode_hold(os
, object
, FTAG
, &dn
) == 0) {
365 rw_enter(&dn
->dn_struct_rwlock
, RW_READER
);
366 if (dn
->dn_bonus
!= NULL
) {
368 mutex_enter(&db
->db_mtx
);
370 rw_exit(&dn
->dn_struct_rwlock
);
371 dnode_rele(dn
, FTAG
);
377 * Insert an entry into the hash table. If there is already an element
378 * equal to elem in the hash table, then the already existing element
379 * will be returned and the new element will not be inserted.
380 * Otherwise returns NULL.
382 static dmu_buf_impl_t
*
383 dbuf_hash_insert(dmu_buf_impl_t
*db
)
385 dbuf_hash_table_t
*h
= &dbuf_hash_table
;
386 objset_t
*os
= db
->db_objset
;
387 uint64_t obj
= db
->db
.db_object
;
388 int level
= db
->db_level
;
389 uint64_t blkid
, hv
, idx
;
393 blkid
= db
->db_blkid
;
394 hv
= dbuf_hash(os
, obj
, level
, blkid
);
395 idx
= hv
& h
->hash_table_mask
;
397 mutex_enter(DBUF_HASH_MUTEX(h
, idx
));
398 for (dbf
= h
->hash_table
[idx
], i
= 0; dbf
!= NULL
;
399 dbf
= dbf
->db_hash_next
, i
++) {
400 if (DBUF_EQUAL(dbf
, os
, obj
, level
, blkid
)) {
401 mutex_enter(&dbf
->db_mtx
);
402 if (dbf
->db_state
!= DB_EVICTING
) {
403 mutex_exit(DBUF_HASH_MUTEX(h
, idx
));
406 mutex_exit(&dbf
->db_mtx
);
411 DBUF_STAT_BUMP(hash_collisions
);
413 DBUF_STAT_BUMP(hash_chains
);
415 DBUF_STAT_MAX(hash_chain_max
, i
);
418 mutex_enter(&db
->db_mtx
);
419 db
->db_hash_next
= h
->hash_table
[idx
];
420 h
->hash_table
[idx
] = db
;
421 mutex_exit(DBUF_HASH_MUTEX(h
, idx
));
422 atomic_inc_64(&dbuf_hash_count
);
423 DBUF_STAT_MAX(hash_elements_max
, dbuf_hash_count
);
429 * This returns whether this dbuf should be stored in the metadata cache, which
430 * is based on whether it's from one of the dnode types that store data related
431 * to traversing dataset hierarchies.
434 dbuf_include_in_metadata_cache(dmu_buf_impl_t
*db
)
437 dmu_object_type_t type
= DB_DNODE(db
)->dn_type
;
440 /* Check if this dbuf is one of the types we care about */
441 if (DMU_OT_IS_METADATA_CACHED(type
)) {
442 /* If we hit this, then we set something up wrong in dmu_ot */
443 ASSERT(DMU_OT_IS_METADATA(type
));
446 * Sanity check for small-memory systems: don't allocate too
447 * much memory for this purpose.
449 if (refcount_count(&dbuf_caches
[DB_DBUF_METADATA_CACHE
].size
) >
450 dbuf_metadata_cache_max_bytes
) {
451 DBUF_STAT_BUMP(metadata_cache_overflow
);
462 * Remove an entry from the hash table. It must be in the EVICTING state.
465 dbuf_hash_remove(dmu_buf_impl_t
*db
)
467 dbuf_hash_table_t
*h
= &dbuf_hash_table
;
469 dmu_buf_impl_t
*dbf
, **dbp
;
471 hv
= dbuf_hash(db
->db_objset
, db
->db
.db_object
,
472 db
->db_level
, db
->db_blkid
);
473 idx
= hv
& h
->hash_table_mask
;
476 * We mustn't hold db_mtx to maintain lock ordering:
477 * DBUF_HASH_MUTEX > db_mtx.
479 ASSERT(refcount_is_zero(&db
->db_holds
));
480 ASSERT(db
->db_state
== DB_EVICTING
);
481 ASSERT(!MUTEX_HELD(&db
->db_mtx
));
483 mutex_enter(DBUF_HASH_MUTEX(h
, idx
));
484 dbp
= &h
->hash_table
[idx
];
485 while ((dbf
= *dbp
) != db
) {
486 dbp
= &dbf
->db_hash_next
;
489 *dbp
= db
->db_hash_next
;
490 db
->db_hash_next
= NULL
;
491 if (h
->hash_table
[idx
] &&
492 h
->hash_table
[idx
]->db_hash_next
== NULL
)
493 DBUF_STAT_BUMPDOWN(hash_chains
);
494 mutex_exit(DBUF_HASH_MUTEX(h
, idx
));
495 atomic_dec_64(&dbuf_hash_count
);
501 } dbvu_verify_type_t
;
504 dbuf_verify_user(dmu_buf_impl_t
*db
, dbvu_verify_type_t verify_type
)
509 if (db
->db_user
== NULL
)
512 /* Only data blocks support the attachment of user data. */
513 ASSERT(db
->db_level
== 0);
515 /* Clients must resolve a dbuf before attaching user data. */
516 ASSERT(db
->db
.db_data
!= NULL
);
517 ASSERT3U(db
->db_state
, ==, DB_CACHED
);
519 holds
= refcount_count(&db
->db_holds
);
520 if (verify_type
== DBVU_EVICTING
) {
522 * Immediate eviction occurs when holds == dirtycnt.
523 * For normal eviction buffers, holds is zero on
524 * eviction, except when dbuf_fix_old_data() calls
525 * dbuf_clear_data(). However, the hold count can grow
526 * during eviction even though db_mtx is held (see
527 * dmu_bonus_hold() for an example), so we can only
528 * test the generic invariant that holds >= dirtycnt.
530 ASSERT3U(holds
, >=, db
->db_dirtycnt
);
532 if (db
->db_user_immediate_evict
== TRUE
)
533 ASSERT3U(holds
, >=, db
->db_dirtycnt
);
535 ASSERT3U(holds
, >, 0);
541 dbuf_evict_user(dmu_buf_impl_t
*db
)
543 dmu_buf_user_t
*dbu
= db
->db_user
;
545 ASSERT(MUTEX_HELD(&db
->db_mtx
));
550 dbuf_verify_user(db
, DBVU_EVICTING
);
554 if (dbu
->dbu_clear_on_evict_dbufp
!= NULL
)
555 *dbu
->dbu_clear_on_evict_dbufp
= NULL
;
559 * There are two eviction callbacks - one that we call synchronously
560 * and one that we invoke via a taskq. The async one is useful for
561 * avoiding lock order reversals and limiting stack depth.
563 * Note that if we have a sync callback but no async callback,
564 * it's likely that the sync callback will free the structure
565 * containing the dbu. In that case we need to take care to not
566 * dereference dbu after calling the sync evict func.
568 boolean_t has_async
= (dbu
->dbu_evict_func_async
!= NULL
);
570 if (dbu
->dbu_evict_func_sync
!= NULL
)
571 dbu
->dbu_evict_func_sync(dbu
);
574 taskq_dispatch_ent(dbu_evict_taskq
, dbu
->dbu_evict_func_async
,
575 dbu
, 0, &dbu
->dbu_tqent
);
580 dbuf_is_metadata(dmu_buf_impl_t
*db
)
583 * Consider indirect blocks and spill blocks to be meta data.
585 if (db
->db_level
> 0 || db
->db_blkid
== DMU_SPILL_BLKID
) {
588 boolean_t is_metadata
;
591 is_metadata
= DMU_OT_IS_METADATA(DB_DNODE(db
)->dn_type
);
594 return (is_metadata
);
600 * This function *must* return indices evenly distributed between all
601 * sublists of the multilist. This is needed due to how the dbuf eviction
602 * code is laid out; dbuf_evict_thread() assumes dbufs are evenly
603 * distributed between all sublists and uses this assumption when
604 * deciding which sublist to evict from and how much to evict from it.
607 dbuf_cache_multilist_index_func(multilist_t
*ml
, void *obj
)
609 dmu_buf_impl_t
*db
= obj
;
612 * The assumption here, is the hash value for a given
613 * dmu_buf_impl_t will remain constant throughout it's lifetime
614 * (i.e. it's objset, object, level and blkid fields don't change).
615 * Thus, we don't need to store the dbuf's sublist index
616 * on insertion, as this index can be recalculated on removal.
618 * Also, the low order bits of the hash value are thought to be
619 * distributed evenly. Otherwise, in the case that the multilist
620 * has a power of two number of sublists, each sublists' usage
621 * would not be evenly distributed.
623 return (dbuf_hash(db
->db_objset
, db
->db
.db_object
,
624 db
->db_level
, db
->db_blkid
) %
625 multilist_get_num_sublists(ml
));
628 static inline unsigned long
629 dbuf_cache_target_bytes(void)
631 return MIN(dbuf_cache_max_bytes
,
632 arc_target_bytes() >> dbuf_cache_shift
);
635 static inline uint64_t
636 dbuf_cache_hiwater_bytes(void)
638 uint64_t dbuf_cache_target
= dbuf_cache_target_bytes();
639 return (dbuf_cache_target
+
640 (dbuf_cache_target
* dbuf_cache_hiwater_pct
) / 100);
643 static inline uint64_t
644 dbuf_cache_lowater_bytes(void)
646 uint64_t dbuf_cache_target
= dbuf_cache_target_bytes();
647 return (dbuf_cache_target
-
648 (dbuf_cache_target
* dbuf_cache_lowater_pct
) / 100);
651 static inline boolean_t
652 dbuf_cache_above_hiwater(void)
654 return (refcount_count(&dbuf_caches
[DB_DBUF_CACHE
].size
) >
655 dbuf_cache_hiwater_bytes());
658 static inline boolean_t
659 dbuf_cache_above_lowater(void)
661 return (refcount_count(&dbuf_caches
[DB_DBUF_CACHE
].size
) >
662 dbuf_cache_lowater_bytes());
666 * Evict the oldest eligible dbuf from the dbuf cache.
671 int idx
= multilist_get_random_index(dbuf_caches
[DB_DBUF_CACHE
].cache
);
672 multilist_sublist_t
*mls
= multilist_sublist_lock(
673 dbuf_caches
[DB_DBUF_CACHE
].cache
, idx
);
675 ASSERT(!MUTEX_HELD(&dbuf_evict_lock
));
677 dmu_buf_impl_t
*db
= multilist_sublist_tail(mls
);
678 while (db
!= NULL
&& mutex_tryenter(&db
->db_mtx
) == 0) {
679 db
= multilist_sublist_prev(mls
, db
);
682 DTRACE_PROBE2(dbuf__evict__one
, dmu_buf_impl_t
*, db
,
683 multilist_sublist_t
*, mls
);
686 multilist_sublist_remove(mls
, db
);
687 multilist_sublist_unlock(mls
);
688 (void) refcount_remove_many(&dbuf_caches
[DB_DBUF_CACHE
].size
,
690 DBUF_STAT_BUMPDOWN(cache_levels
[db
->db_level
]);
691 DBUF_STAT_BUMPDOWN(cache_count
);
692 DBUF_STAT_DECR(cache_levels_bytes
[db
->db_level
],
694 ASSERT3U(db
->db_caching_status
, ==, DB_DBUF_CACHE
);
695 db
->db_caching_status
= DB_NO_CACHE
;
697 DBUF_STAT_MAX(cache_size_bytes_max
,
698 refcount_count(&dbuf_caches
[DB_DBUF_CACHE
].size
));
699 DBUF_STAT_BUMP(cache_total_evicts
);
701 multilist_sublist_unlock(mls
);
706 * The dbuf evict thread is responsible for aging out dbufs from the
707 * cache. Once the cache has reached it's maximum size, dbufs are removed
708 * and destroyed. The eviction thread will continue running until the size
709 * of the dbuf cache is at or below the maximum size. Once the dbuf is aged
710 * out of the cache it is destroyed and becomes eligible for arc eviction.
714 dbuf_evict_thread(void *unused
)
718 CALLB_CPR_INIT(&cpr
, &dbuf_evict_lock
, callb_generic_cpr
, FTAG
);
720 mutex_enter(&dbuf_evict_lock
);
721 while (!dbuf_evict_thread_exit
) {
722 while (!dbuf_cache_above_lowater() && !dbuf_evict_thread_exit
) {
723 CALLB_CPR_SAFE_BEGIN(&cpr
);
724 (void) cv_timedwait_sig_hires(&dbuf_evict_cv
,
725 &dbuf_evict_lock
, SEC2NSEC(1), MSEC2NSEC(1), 0);
726 CALLB_CPR_SAFE_END(&cpr
, &dbuf_evict_lock
);
728 mutex_exit(&dbuf_evict_lock
);
731 * Keep evicting as long as we're above the low water mark
732 * for the cache. We do this without holding the locks to
733 * minimize lock contention.
735 while (dbuf_cache_above_lowater() && !dbuf_evict_thread_exit
) {
739 mutex_enter(&dbuf_evict_lock
);
742 dbuf_evict_thread_exit
= B_FALSE
;
743 cv_broadcast(&dbuf_evict_cv
);
744 CALLB_CPR_EXIT(&cpr
); /* drops dbuf_evict_lock */
749 * Wake up the dbuf eviction thread if the dbuf cache is at its max size.
750 * If the dbuf cache is at its high water mark, then evict a dbuf from the
751 * dbuf cache using the callers context.
754 dbuf_evict_notify(void)
757 * We check if we should evict without holding the dbuf_evict_lock,
758 * because it's OK to occasionally make the wrong decision here,
759 * and grabbing the lock results in massive lock contention.
761 if (refcount_count(&dbuf_caches
[DB_DBUF_CACHE
].size
) >
762 dbuf_cache_target_bytes()) {
763 if (dbuf_cache_above_hiwater())
765 cv_signal(&dbuf_evict_cv
);
770 dbuf_kstat_update(kstat_t
*ksp
, int rw
)
772 dbuf_stats_t
*ds
= ksp
->ks_data
;
774 if (rw
== KSTAT_WRITE
) {
775 return (SET_ERROR(EACCES
));
777 ds
->metadata_cache_size_bytes
.value
.ui64
=
778 refcount_count(&dbuf_caches
[DB_DBUF_METADATA_CACHE
].size
);
779 ds
->cache_size_bytes
.value
.ui64
=
780 refcount_count(&dbuf_caches
[DB_DBUF_CACHE
].size
);
781 ds
->cache_target_bytes
.value
.ui64
= dbuf_cache_target_bytes();
782 ds
->cache_hiwater_bytes
.value
.ui64
= dbuf_cache_hiwater_bytes();
783 ds
->cache_lowater_bytes
.value
.ui64
= dbuf_cache_lowater_bytes();
784 ds
->hash_elements
.value
.ui64
= dbuf_hash_count
;
793 uint64_t hsize
= 1ULL << 16;
794 dbuf_hash_table_t
*h
= &dbuf_hash_table
;
798 * The hash table is big enough to fill all of physical memory
799 * with an average block size of zfs_arc_average_blocksize (default 8K).
800 * By default, the table will take up
801 * totalmem * sizeof(void*) / 8K (1MB per GB with 8-byte pointers).
803 while (hsize
* zfs_arc_average_blocksize
< physmem
* PAGESIZE
)
807 h
->hash_table_mask
= hsize
- 1;
810 * Large allocations which do not require contiguous pages
811 * should be using vmem_alloc() in the linux kernel
813 h
->hash_table
= vmem_zalloc(hsize
* sizeof (void *), KM_SLEEP
);
815 h
->hash_table
= kmem_zalloc(hsize
* sizeof (void *), KM_NOSLEEP
);
817 if (h
->hash_table
== NULL
) {
818 /* XXX - we should really return an error instead of assert */
819 ASSERT(hsize
> (1ULL << 10));
824 dbuf_kmem_cache
= kmem_cache_create("dmu_buf_impl_t",
825 sizeof (dmu_buf_impl_t
),
826 0, dbuf_cons
, dbuf_dest
, NULL
, NULL
, NULL
, 0);
828 for (i
= 0; i
< DBUF_MUTEXES
; i
++)
829 mutex_init(&h
->hash_mutexes
[i
], NULL
, MUTEX_DEFAULT
, NULL
);
834 * Setup the parameters for the dbuf caches. We set the sizes of the
835 * dbuf cache and the metadata cache to 1/32nd and 1/16th (default)
836 * of the target size of the ARC. If the values has been specified as
837 * a module option and they're not greater than the target size of the
838 * ARC, then we honor that value.
840 if (dbuf_cache_max_bytes
== 0 ||
841 dbuf_cache_max_bytes
>= arc_target_bytes()) {
842 dbuf_cache_max_bytes
= arc_target_bytes() >> dbuf_cache_shift
;
844 if (dbuf_metadata_cache_max_bytes
== 0 ||
845 dbuf_metadata_cache_max_bytes
>= arc_target_bytes()) {
846 dbuf_metadata_cache_max_bytes
=
847 arc_target_bytes() >> dbuf_metadata_cache_shift
;
851 * All entries are queued via taskq_dispatch_ent(), so min/maxalloc
852 * configuration is not required.
854 dbu_evict_taskq
= taskq_create("dbu_evict", 1, defclsyspri
, 0, 0, 0);
856 for (dbuf_cached_state_t dcs
= 0; dcs
< DB_CACHE_MAX
; dcs
++) {
857 dbuf_caches
[dcs
].cache
=
858 multilist_create(sizeof (dmu_buf_impl_t
),
859 offsetof(dmu_buf_impl_t
, db_cache_link
),
860 dbuf_cache_multilist_index_func
);
861 refcount_create(&dbuf_caches
[dcs
].size
);
864 dbuf_evict_thread_exit
= B_FALSE
;
865 mutex_init(&dbuf_evict_lock
, NULL
, MUTEX_DEFAULT
, NULL
);
866 cv_init(&dbuf_evict_cv
, NULL
, CV_DEFAULT
, NULL
);
867 dbuf_cache_evict_thread
= thread_create(NULL
, 0, dbuf_evict_thread
,
868 NULL
, 0, &p0
, TS_RUN
, minclsyspri
);
870 dbuf_ksp
= kstat_create("zfs", 0, "dbufstats", "misc",
871 KSTAT_TYPE_NAMED
, sizeof (dbuf_stats
) / sizeof (kstat_named_t
),
873 if (dbuf_ksp
!= NULL
) {
874 dbuf_ksp
->ks_data
= &dbuf_stats
;
875 dbuf_ksp
->ks_update
= dbuf_kstat_update
;
876 kstat_install(dbuf_ksp
);
878 for (i
= 0; i
< DN_MAX_LEVELS
; i
++) {
879 snprintf(dbuf_stats
.cache_levels
[i
].name
,
880 KSTAT_STRLEN
, "cache_level_%d", i
);
881 dbuf_stats
.cache_levels
[i
].data_type
=
883 snprintf(dbuf_stats
.cache_levels_bytes
[i
].name
,
884 KSTAT_STRLEN
, "cache_level_%d_bytes", i
);
885 dbuf_stats
.cache_levels_bytes
[i
].data_type
=
894 dbuf_hash_table_t
*h
= &dbuf_hash_table
;
897 dbuf_stats_destroy();
899 for (i
= 0; i
< DBUF_MUTEXES
; i
++)
900 mutex_destroy(&h
->hash_mutexes
[i
]);
903 * Large allocations which do not require contiguous pages
904 * should be using vmem_free() in the linux kernel
906 vmem_free(h
->hash_table
, (h
->hash_table_mask
+ 1) * sizeof (void *));
908 kmem_free(h
->hash_table
, (h
->hash_table_mask
+ 1) * sizeof (void *));
910 kmem_cache_destroy(dbuf_kmem_cache
);
911 taskq_destroy(dbu_evict_taskq
);
913 mutex_enter(&dbuf_evict_lock
);
914 dbuf_evict_thread_exit
= B_TRUE
;
915 while (dbuf_evict_thread_exit
) {
916 cv_signal(&dbuf_evict_cv
);
917 cv_wait(&dbuf_evict_cv
, &dbuf_evict_lock
);
919 mutex_exit(&dbuf_evict_lock
);
921 mutex_destroy(&dbuf_evict_lock
);
922 cv_destroy(&dbuf_evict_cv
);
924 for (dbuf_cached_state_t dcs
= 0; dcs
< DB_CACHE_MAX
; dcs
++) {
925 refcount_destroy(&dbuf_caches
[dcs
].size
);
926 multilist_destroy(dbuf_caches
[dcs
].cache
);
929 if (dbuf_ksp
!= NULL
) {
930 kstat_delete(dbuf_ksp
);
941 dbuf_verify(dmu_buf_impl_t
*db
)
944 dbuf_dirty_record_t
*dr
;
946 ASSERT(MUTEX_HELD(&db
->db_mtx
));
948 if (!(zfs_flags
& ZFS_DEBUG_DBUF_VERIFY
))
951 ASSERT(db
->db_objset
!= NULL
);
955 ASSERT(db
->db_parent
== NULL
);
956 ASSERT(db
->db_blkptr
== NULL
);
958 ASSERT3U(db
->db
.db_object
, ==, dn
->dn_object
);
959 ASSERT3P(db
->db_objset
, ==, dn
->dn_objset
);
960 ASSERT3U(db
->db_level
, <, dn
->dn_nlevels
);
961 ASSERT(db
->db_blkid
== DMU_BONUS_BLKID
||
962 db
->db_blkid
== DMU_SPILL_BLKID
||
963 !avl_is_empty(&dn
->dn_dbufs
));
965 if (db
->db_blkid
== DMU_BONUS_BLKID
) {
967 ASSERT3U(db
->db
.db_size
, >=, dn
->dn_bonuslen
);
968 ASSERT3U(db
->db
.db_offset
, ==, DMU_BONUS_BLKID
);
969 } else if (db
->db_blkid
== DMU_SPILL_BLKID
) {
971 ASSERT0(db
->db
.db_offset
);
973 ASSERT3U(db
->db
.db_offset
, ==, db
->db_blkid
* db
->db
.db_size
);
976 for (dr
= db
->db_data_pending
; dr
!= NULL
; dr
= dr
->dr_next
)
977 ASSERT(dr
->dr_dbuf
== db
);
979 for (dr
= db
->db_last_dirty
; dr
!= NULL
; dr
= dr
->dr_next
)
980 ASSERT(dr
->dr_dbuf
== db
);
983 * We can't assert that db_size matches dn_datablksz because it
984 * can be momentarily different when another thread is doing
987 if (db
->db_level
== 0 && db
->db
.db_object
== DMU_META_DNODE_OBJECT
) {
988 dr
= db
->db_data_pending
;
990 * It should only be modified in syncing context, so
991 * make sure we only have one copy of the data.
993 ASSERT(dr
== NULL
|| dr
->dt
.dl
.dr_data
== db
->db_buf
);
996 /* verify db->db_blkptr */
998 if (db
->db_parent
== dn
->dn_dbuf
) {
999 /* db is pointed to by the dnode */
1000 /* ASSERT3U(db->db_blkid, <, dn->dn_nblkptr); */
1001 if (DMU_OBJECT_IS_SPECIAL(db
->db
.db_object
))
1002 ASSERT(db
->db_parent
== NULL
);
1004 ASSERT(db
->db_parent
!= NULL
);
1005 if (db
->db_blkid
!= DMU_SPILL_BLKID
)
1006 ASSERT3P(db
->db_blkptr
, ==,
1007 &dn
->dn_phys
->dn_blkptr
[db
->db_blkid
]);
1009 /* db is pointed to by an indirect block */
1010 ASSERTV(int epb
= db
->db_parent
->db
.db_size
>>
1012 ASSERT3U(db
->db_parent
->db_level
, ==, db
->db_level
+1);
1013 ASSERT3U(db
->db_parent
->db
.db_object
, ==,
1016 * dnode_grow_indblksz() can make this fail if we don't
1017 * have the struct_rwlock. XXX indblksz no longer
1018 * grows. safe to do this now?
1020 if (RW_WRITE_HELD(&dn
->dn_struct_rwlock
)) {
1021 ASSERT3P(db
->db_blkptr
, ==,
1022 ((blkptr_t
*)db
->db_parent
->db
.db_data
+
1023 db
->db_blkid
% epb
));
1027 if ((db
->db_blkptr
== NULL
|| BP_IS_HOLE(db
->db_blkptr
)) &&
1028 (db
->db_buf
== NULL
|| db
->db_buf
->b_data
) &&
1029 db
->db
.db_data
&& db
->db_blkid
!= DMU_BONUS_BLKID
&&
1030 db
->db_state
!= DB_FILL
&& !dn
->dn_free_txg
) {
1032 * If the blkptr isn't set but they have nonzero data,
1033 * it had better be dirty, otherwise we'll lose that
1034 * data when we evict this buffer.
1036 * There is an exception to this rule for indirect blocks; in
1037 * this case, if the indirect block is a hole, we fill in a few
1038 * fields on each of the child blocks (importantly, birth time)
1039 * to prevent hole birth times from being lost when you
1040 * partially fill in a hole.
1042 if (db
->db_dirtycnt
== 0) {
1043 if (db
->db_level
== 0) {
1044 uint64_t *buf
= db
->db
.db_data
;
1047 for (i
= 0; i
< db
->db
.db_size
>> 3; i
++) {
1048 ASSERT(buf
[i
] == 0);
1051 blkptr_t
*bps
= db
->db
.db_data
;
1052 ASSERT3U(1 << DB_DNODE(db
)->dn_indblkshift
, ==,
1055 * We want to verify that all the blkptrs in the
1056 * indirect block are holes, but we may have
1057 * automatically set up a few fields for them.
1058 * We iterate through each blkptr and verify
1059 * they only have those fields set.
1062 i
< db
->db
.db_size
/ sizeof (blkptr_t
);
1064 blkptr_t
*bp
= &bps
[i
];
1065 ASSERT(ZIO_CHECKSUM_IS_ZERO(
1068 DVA_IS_EMPTY(&bp
->blk_dva
[0]) &&
1069 DVA_IS_EMPTY(&bp
->blk_dva
[1]) &&
1070 DVA_IS_EMPTY(&bp
->blk_dva
[2]));
1071 ASSERT0(bp
->blk_fill
);
1072 ASSERT0(bp
->blk_pad
[0]);
1073 ASSERT0(bp
->blk_pad
[1]);
1074 ASSERT(!BP_IS_EMBEDDED(bp
));
1075 ASSERT(BP_IS_HOLE(bp
));
1076 ASSERT0(bp
->blk_phys_birth
);
1086 dbuf_clear_data(dmu_buf_impl_t
*db
)
1088 ASSERT(MUTEX_HELD(&db
->db_mtx
));
1089 dbuf_evict_user(db
);
1090 ASSERT3P(db
->db_buf
, ==, NULL
);
1091 db
->db
.db_data
= NULL
;
1092 if (db
->db_state
!= DB_NOFILL
)
1093 db
->db_state
= DB_UNCACHED
;
1097 dbuf_set_data(dmu_buf_impl_t
*db
, arc_buf_t
*buf
)
1099 ASSERT(MUTEX_HELD(&db
->db_mtx
));
1100 ASSERT(buf
!= NULL
);
1103 ASSERT(buf
->b_data
!= NULL
);
1104 db
->db
.db_data
= buf
->b_data
;
1108 * Loan out an arc_buf for read. Return the loaned arc_buf.
1111 dbuf_loan_arcbuf(dmu_buf_impl_t
*db
)
1115 ASSERT(db
->db_blkid
!= DMU_BONUS_BLKID
);
1116 mutex_enter(&db
->db_mtx
);
1117 if (arc_released(db
->db_buf
) || refcount_count(&db
->db_holds
) > 1) {
1118 int blksz
= db
->db
.db_size
;
1119 spa_t
*spa
= db
->db_objset
->os_spa
;
1121 mutex_exit(&db
->db_mtx
);
1122 abuf
= arc_loan_buf(spa
, B_FALSE
, blksz
);
1123 bcopy(db
->db
.db_data
, abuf
->b_data
, blksz
);
1126 arc_loan_inuse_buf(abuf
, db
);
1128 dbuf_clear_data(db
);
1129 mutex_exit(&db
->db_mtx
);
1135 * Calculate which level n block references the data at the level 0 offset
1139 dbuf_whichblock(const dnode_t
*dn
, const int64_t level
, const uint64_t offset
)
1141 if (dn
->dn_datablkshift
!= 0 && dn
->dn_indblkshift
!= 0) {
1143 * The level n blkid is equal to the level 0 blkid divided by
1144 * the number of level 0s in a level n block.
1146 * The level 0 blkid is offset >> datablkshift =
1147 * offset / 2^datablkshift.
1149 * The number of level 0s in a level n is the number of block
1150 * pointers in an indirect block, raised to the power of level.
1151 * This is 2^(indblkshift - SPA_BLKPTRSHIFT)^level =
1152 * 2^(level*(indblkshift - SPA_BLKPTRSHIFT)).
1154 * Thus, the level n blkid is: offset /
1155 * ((2^datablkshift)*(2^(level*(indblkshift-SPA_BLKPTRSHIFT))))
1156 * = offset / 2^(datablkshift + level *
1157 * (indblkshift - SPA_BLKPTRSHIFT))
1158 * = offset >> (datablkshift + level *
1159 * (indblkshift - SPA_BLKPTRSHIFT))
1162 const unsigned exp
= dn
->dn_datablkshift
+
1163 level
* (dn
->dn_indblkshift
- SPA_BLKPTRSHIFT
);
1165 if (exp
>= 8 * sizeof (offset
)) {
1166 /* This only happens on the highest indirection level */
1167 ASSERT3U(level
, ==, dn
->dn_nlevels
- 1);
1171 ASSERT3U(exp
, <, 8 * sizeof (offset
));
1173 return (offset
>> exp
);
1175 ASSERT3U(offset
, <, dn
->dn_datablksz
);
1181 dbuf_read_done(zio_t
*zio
, const zbookmark_phys_t
*zb
, const blkptr_t
*bp
,
1182 arc_buf_t
*buf
, void *vdb
)
1184 dmu_buf_impl_t
*db
= vdb
;
1186 mutex_enter(&db
->db_mtx
);
1187 ASSERT3U(db
->db_state
, ==, DB_READ
);
1189 * All reads are synchronous, so we must have a hold on the dbuf
1191 ASSERT(refcount_count(&db
->db_holds
) > 0);
1192 ASSERT(db
->db_buf
== NULL
);
1193 ASSERT(db
->db
.db_data
== NULL
);
1196 ASSERT(zio
== NULL
|| zio
->io_error
!= 0);
1197 ASSERT(db
->db_blkid
!= DMU_BONUS_BLKID
);
1198 ASSERT3P(db
->db_buf
, ==, NULL
);
1199 db
->db_state
= DB_UNCACHED
;
1200 } else if (db
->db_level
== 0 && db
->db_freed_in_flight
) {
1201 /* freed in flight */
1202 ASSERT(zio
== NULL
|| zio
->io_error
== 0);
1203 arc_release(buf
, db
);
1204 bzero(buf
->b_data
, db
->db
.db_size
);
1205 arc_buf_freeze(buf
);
1206 db
->db_freed_in_flight
= FALSE
;
1207 dbuf_set_data(db
, buf
);
1208 db
->db_state
= DB_CACHED
;
1211 ASSERT(zio
== NULL
|| zio
->io_error
== 0);
1212 dbuf_set_data(db
, buf
);
1213 db
->db_state
= DB_CACHED
;
1215 cv_broadcast(&db
->db_changed
);
1216 dbuf_rele_and_unlock(db
, NULL
, B_FALSE
);
1221 * This function ensures that, when doing a decrypting read of a block,
1222 * we make sure we have decrypted the dnode associated with it. We must do
1223 * this so that we ensure we are fully authenticating the checksum-of-MACs
1224 * tree from the root of the objset down to this block. Indirect blocks are
1225 * always verified against their secure checksum-of-MACs assuming that the
1226 * dnode containing them is correct. Now that we are doing a decrypting read,
1227 * we can be sure that the key is loaded and verify that assumption. This is
1228 * especially important considering that we always read encrypted dnode
1229 * blocks as raw data (without verifying their MACs) to start, and
1230 * decrypt / authenticate them when we need to read an encrypted bonus buffer.
1233 dbuf_read_verify_dnode_crypt(dmu_buf_impl_t
*db
, uint32_t flags
)
1236 objset_t
*os
= db
->db_objset
;
1237 arc_buf_t
*dnode_abuf
;
1239 zbookmark_phys_t zb
;
1241 ASSERT(MUTEX_HELD(&db
->db_mtx
));
1243 if (!os
->os_encrypted
|| os
->os_raw_receive
||
1244 (flags
& DB_RF_NO_DECRYPT
) != 0)
1249 dnode_abuf
= (dn
->dn_dbuf
!= NULL
) ? dn
->dn_dbuf
->db_buf
: NULL
;
1251 if (dnode_abuf
== NULL
|| !arc_is_encrypted(dnode_abuf
)) {
1256 SET_BOOKMARK(&zb
, dmu_objset_id(os
),
1257 DMU_META_DNODE_OBJECT
, 0, dn
->dn_dbuf
->db_blkid
);
1258 err
= arc_untransform(dnode_abuf
, os
->os_spa
, &zb
, B_TRUE
);
1261 * An error code of EACCES tells us that the key is still not
1262 * available. This is ok if we are only reading authenticated
1263 * (and therefore non-encrypted) blocks.
1265 if (err
== EACCES
&& ((db
->db_blkid
!= DMU_BONUS_BLKID
&&
1266 !DMU_OT_IS_ENCRYPTED(dn
->dn_type
)) ||
1267 (db
->db_blkid
== DMU_BONUS_BLKID
&&
1268 !DMU_OT_IS_ENCRYPTED(dn
->dn_bonustype
))))
1277 dbuf_read_impl(dmu_buf_impl_t
*db
, zio_t
*zio
, uint32_t flags
)
1280 zbookmark_phys_t zb
;
1281 uint32_t aflags
= ARC_FLAG_NOWAIT
;
1282 int err
, zio_flags
= 0;
1286 ASSERT(!refcount_is_zero(&db
->db_holds
));
1287 /* We need the struct_rwlock to prevent db_blkptr from changing. */
1288 ASSERT(RW_LOCK_HELD(&dn
->dn_struct_rwlock
));
1289 ASSERT(MUTEX_HELD(&db
->db_mtx
));
1290 ASSERT(db
->db_state
== DB_UNCACHED
);
1291 ASSERT(db
->db_buf
== NULL
);
1293 if (db
->db_blkid
== DMU_BONUS_BLKID
) {
1295 * The bonus length stored in the dnode may be less than
1296 * the maximum available space in the bonus buffer.
1298 int bonuslen
= MIN(dn
->dn_bonuslen
, dn
->dn_phys
->dn_bonuslen
);
1299 int max_bonuslen
= DN_SLOTS_TO_BONUSLEN(dn
->dn_num_slots
);
1301 /* if the underlying dnode block is encrypted, decrypt it */
1302 err
= dbuf_read_verify_dnode_crypt(db
, flags
);
1305 mutex_exit(&db
->db_mtx
);
1309 ASSERT3U(bonuslen
, <=, db
->db
.db_size
);
1310 db
->db
.db_data
= kmem_alloc(max_bonuslen
, KM_SLEEP
);
1311 arc_space_consume(max_bonuslen
, ARC_SPACE_BONUS
);
1312 if (bonuslen
< max_bonuslen
)
1313 bzero(db
->db
.db_data
, max_bonuslen
);
1315 bcopy(DN_BONUS(dn
->dn_phys
), db
->db
.db_data
, bonuslen
);
1317 db
->db_state
= DB_CACHED
;
1318 mutex_exit(&db
->db_mtx
);
1323 * Recheck BP_IS_HOLE() after dnode_block_freed() in case dnode_sync()
1324 * processes the delete record and clears the bp while we are waiting
1325 * for the dn_mtx (resulting in a "no" from block_freed).
1327 if (db
->db_blkptr
== NULL
|| BP_IS_HOLE(db
->db_blkptr
) ||
1328 (db
->db_level
== 0 && (dnode_block_freed(dn
, db
->db_blkid
) ||
1329 BP_IS_HOLE(db
->db_blkptr
)))) {
1330 arc_buf_contents_t type
= DBUF_GET_BUFC_TYPE(db
);
1332 dbuf_set_data(db
, arc_alloc_buf(db
->db_objset
->os_spa
, db
, type
,
1334 bzero(db
->db
.db_data
, db
->db
.db_size
);
1336 if (db
->db_blkptr
!= NULL
&& db
->db_level
> 0 &&
1337 BP_IS_HOLE(db
->db_blkptr
) &&
1338 db
->db_blkptr
->blk_birth
!= 0) {
1339 blkptr_t
*bps
= db
->db
.db_data
;
1340 for (int i
= 0; i
< ((1 <<
1341 DB_DNODE(db
)->dn_indblkshift
) / sizeof (blkptr_t
));
1343 blkptr_t
*bp
= &bps
[i
];
1344 ASSERT3U(BP_GET_LSIZE(db
->db_blkptr
), ==,
1345 1 << dn
->dn_indblkshift
);
1347 BP_GET_LEVEL(db
->db_blkptr
) == 1 ?
1349 BP_GET_LSIZE(db
->db_blkptr
));
1350 BP_SET_TYPE(bp
, BP_GET_TYPE(db
->db_blkptr
));
1352 BP_GET_LEVEL(db
->db_blkptr
) - 1);
1353 BP_SET_BIRTH(bp
, db
->db_blkptr
->blk_birth
, 0);
1357 db
->db_state
= DB_CACHED
;
1358 mutex_exit(&db
->db_mtx
);
1363 SET_BOOKMARK(&zb
, dmu_objset_id(db
->db_objset
),
1364 db
->db
.db_object
, db
->db_level
, db
->db_blkid
);
1367 * All bps of an encrypted os should have the encryption bit set.
1368 * If this is not true it indicates tampering and we report an error.
1370 if (db
->db_objset
->os_encrypted
&& !BP_USES_CRYPT(db
->db_blkptr
)) {
1371 spa_log_error(db
->db_objset
->os_spa
, &zb
);
1372 zfs_panic_recover("unencrypted block in encrypted "
1373 "object set %llu", dmu_objset_id(db
->db_objset
));
1375 mutex_exit(&db
->db_mtx
);
1376 return (SET_ERROR(EIO
));
1379 err
= dbuf_read_verify_dnode_crypt(db
, flags
);
1382 mutex_exit(&db
->db_mtx
);
1388 db
->db_state
= DB_READ
;
1389 mutex_exit(&db
->db_mtx
);
1391 if (DBUF_IS_L2CACHEABLE(db
))
1392 aflags
|= ARC_FLAG_L2CACHE
;
1394 dbuf_add_ref(db
, NULL
);
1396 zio_flags
= (flags
& DB_RF_CANFAIL
) ?
1397 ZIO_FLAG_CANFAIL
: ZIO_FLAG_MUSTSUCCEED
;
1399 if ((flags
& DB_RF_NO_DECRYPT
) && BP_IS_PROTECTED(db
->db_blkptr
))
1400 zio_flags
|= ZIO_FLAG_RAW
;
1402 err
= arc_read(zio
, db
->db_objset
->os_spa
, db
->db_blkptr
,
1403 dbuf_read_done
, db
, ZIO_PRIORITY_SYNC_READ
, zio_flags
,
1410 * This is our just-in-time copy function. It makes a copy of buffers that
1411 * have been modified in a previous transaction group before we access them in
1412 * the current active group.
1414 * This function is used in three places: when we are dirtying a buffer for the
1415 * first time in a txg, when we are freeing a range in a dnode that includes
1416 * this buffer, and when we are accessing a buffer which was received compressed
1417 * and later referenced in a WRITE_BYREF record.
1419 * Note that when we are called from dbuf_free_range() we do not put a hold on
1420 * the buffer, we just traverse the active dbuf list for the dnode.
1423 dbuf_fix_old_data(dmu_buf_impl_t
*db
, uint64_t txg
)
1425 dbuf_dirty_record_t
*dr
= db
->db_last_dirty
;
1427 ASSERT(MUTEX_HELD(&db
->db_mtx
));
1428 ASSERT(db
->db
.db_data
!= NULL
);
1429 ASSERT(db
->db_level
== 0);
1430 ASSERT(db
->db
.db_object
!= DMU_META_DNODE_OBJECT
);
1433 (dr
->dt
.dl
.dr_data
!=
1434 ((db
->db_blkid
== DMU_BONUS_BLKID
) ? db
->db
.db_data
: db
->db_buf
)))
1438 * If the last dirty record for this dbuf has not yet synced
1439 * and its referencing the dbuf data, either:
1440 * reset the reference to point to a new copy,
1441 * or (if there a no active holders)
1442 * just null out the current db_data pointer.
1444 ASSERT3U(dr
->dr_txg
, >=, txg
- 2);
1445 if (db
->db_blkid
== DMU_BONUS_BLKID
) {
1446 dnode_t
*dn
= DB_DNODE(db
);
1447 int bonuslen
= DN_SLOTS_TO_BONUSLEN(dn
->dn_num_slots
);
1448 dr
->dt
.dl
.dr_data
= kmem_alloc(bonuslen
, KM_SLEEP
);
1449 arc_space_consume(bonuslen
, ARC_SPACE_BONUS
);
1450 bcopy(db
->db
.db_data
, dr
->dt
.dl
.dr_data
, bonuslen
);
1451 } else if (refcount_count(&db
->db_holds
) > db
->db_dirtycnt
) {
1452 dnode_t
*dn
= DB_DNODE(db
);
1453 int size
= arc_buf_size(db
->db_buf
);
1454 arc_buf_contents_t type
= DBUF_GET_BUFC_TYPE(db
);
1455 spa_t
*spa
= db
->db_objset
->os_spa
;
1456 enum zio_compress compress_type
=
1457 arc_get_compression(db
->db_buf
);
1459 if (arc_is_encrypted(db
->db_buf
)) {
1460 boolean_t byteorder
;
1461 uint8_t salt
[ZIO_DATA_SALT_LEN
];
1462 uint8_t iv
[ZIO_DATA_IV_LEN
];
1463 uint8_t mac
[ZIO_DATA_MAC_LEN
];
1465 arc_get_raw_params(db
->db_buf
, &byteorder
, salt
,
1467 dr
->dt
.dl
.dr_data
= arc_alloc_raw_buf(spa
, db
,
1468 dmu_objset_id(dn
->dn_objset
), byteorder
, salt
, iv
,
1469 mac
, dn
->dn_type
, size
, arc_buf_lsize(db
->db_buf
),
1471 } else if (compress_type
!= ZIO_COMPRESS_OFF
) {
1472 ASSERT3U(type
, ==, ARC_BUFC_DATA
);
1473 dr
->dt
.dl
.dr_data
= arc_alloc_compressed_buf(spa
, db
,
1474 size
, arc_buf_lsize(db
->db_buf
), compress_type
);
1476 dr
->dt
.dl
.dr_data
= arc_alloc_buf(spa
, db
, type
, size
);
1478 bcopy(db
->db
.db_data
, dr
->dt
.dl
.dr_data
->b_data
, size
);
1481 dbuf_clear_data(db
);
1486 dbuf_read(dmu_buf_impl_t
*db
, zio_t
*zio
, uint32_t flags
)
1493 * We don't have to hold the mutex to check db_state because it
1494 * can't be freed while we have a hold on the buffer.
1496 ASSERT(!refcount_is_zero(&db
->db_holds
));
1498 if (db
->db_state
== DB_NOFILL
)
1499 return (SET_ERROR(EIO
));
1503 if ((flags
& DB_RF_HAVESTRUCT
) == 0)
1504 rw_enter(&dn
->dn_struct_rwlock
, RW_READER
);
1506 prefetch
= db
->db_level
== 0 && db
->db_blkid
!= DMU_BONUS_BLKID
&&
1507 (flags
& DB_RF_NOPREFETCH
) == 0 && dn
!= NULL
&&
1508 DBUF_IS_CACHEABLE(db
);
1510 mutex_enter(&db
->db_mtx
);
1511 if (db
->db_state
== DB_CACHED
) {
1512 spa_t
*spa
= dn
->dn_objset
->os_spa
;
1515 * Ensure that this block's dnode has been decrypted if
1516 * the caller has requested decrypted data.
1518 err
= dbuf_read_verify_dnode_crypt(db
, flags
);
1521 * If the arc buf is compressed or encrypted and the caller
1522 * requested uncompressed data, we need to untransform it
1523 * before returning. We also call arc_untransform() on any
1524 * unauthenticated blocks, which will verify their MAC if
1525 * the key is now available.
1527 if (err
== 0 && db
->db_buf
!= NULL
&&
1528 (flags
& DB_RF_NO_DECRYPT
) == 0 &&
1529 (arc_is_encrypted(db
->db_buf
) ||
1530 arc_is_unauthenticated(db
->db_buf
) ||
1531 arc_get_compression(db
->db_buf
) != ZIO_COMPRESS_OFF
)) {
1532 zbookmark_phys_t zb
;
1534 SET_BOOKMARK(&zb
, dmu_objset_id(db
->db_objset
),
1535 db
->db
.db_object
, db
->db_level
, db
->db_blkid
);
1536 dbuf_fix_old_data(db
, spa_syncing_txg(spa
));
1537 err
= arc_untransform(db
->db_buf
, spa
, &zb
, B_FALSE
);
1538 dbuf_set_data(db
, db
->db_buf
);
1540 mutex_exit(&db
->db_mtx
);
1541 if (err
== 0 && prefetch
)
1542 dmu_zfetch(&dn
->dn_zfetch
, db
->db_blkid
, 1, B_TRUE
);
1543 if ((flags
& DB_RF_HAVESTRUCT
) == 0)
1544 rw_exit(&dn
->dn_struct_rwlock
);
1546 DBUF_STAT_BUMP(hash_hits
);
1547 } else if (db
->db_state
== DB_UNCACHED
) {
1548 spa_t
*spa
= dn
->dn_objset
->os_spa
;
1549 boolean_t need_wait
= B_FALSE
;
1552 db
->db_blkptr
!= NULL
&& !BP_IS_HOLE(db
->db_blkptr
)) {
1553 zio
= zio_root(spa
, NULL
, NULL
, ZIO_FLAG_CANFAIL
);
1556 err
= dbuf_read_impl(db
, zio
, flags
);
1558 /* dbuf_read_impl has dropped db_mtx for us */
1560 if (!err
&& prefetch
)
1561 dmu_zfetch(&dn
->dn_zfetch
, db
->db_blkid
, 1, B_TRUE
);
1563 if ((flags
& DB_RF_HAVESTRUCT
) == 0)
1564 rw_exit(&dn
->dn_struct_rwlock
);
1566 DBUF_STAT_BUMP(hash_misses
);
1568 if (!err
&& need_wait
)
1569 err
= zio_wait(zio
);
1572 * Another reader came in while the dbuf was in flight
1573 * between UNCACHED and CACHED. Either a writer will finish
1574 * writing the buffer (sending the dbuf to CACHED) or the
1575 * first reader's request will reach the read_done callback
1576 * and send the dbuf to CACHED. Otherwise, a failure
1577 * occurred and the dbuf went to UNCACHED.
1579 mutex_exit(&db
->db_mtx
);
1581 dmu_zfetch(&dn
->dn_zfetch
, db
->db_blkid
, 1, B_TRUE
);
1582 if ((flags
& DB_RF_HAVESTRUCT
) == 0)
1583 rw_exit(&dn
->dn_struct_rwlock
);
1585 DBUF_STAT_BUMP(hash_misses
);
1587 /* Skip the wait per the caller's request. */
1588 mutex_enter(&db
->db_mtx
);
1589 if ((flags
& DB_RF_NEVERWAIT
) == 0) {
1590 while (db
->db_state
== DB_READ
||
1591 db
->db_state
== DB_FILL
) {
1592 ASSERT(db
->db_state
== DB_READ
||
1593 (flags
& DB_RF_HAVESTRUCT
) == 0);
1594 DTRACE_PROBE2(blocked__read
, dmu_buf_impl_t
*,
1596 cv_wait(&db
->db_changed
, &db
->db_mtx
);
1598 if (db
->db_state
== DB_UNCACHED
)
1599 err
= SET_ERROR(EIO
);
1601 mutex_exit(&db
->db_mtx
);
1608 dbuf_noread(dmu_buf_impl_t
*db
)
1610 ASSERT(!refcount_is_zero(&db
->db_holds
));
1611 ASSERT(db
->db_blkid
!= DMU_BONUS_BLKID
);
1612 mutex_enter(&db
->db_mtx
);
1613 while (db
->db_state
== DB_READ
|| db
->db_state
== DB_FILL
)
1614 cv_wait(&db
->db_changed
, &db
->db_mtx
);
1615 if (db
->db_state
== DB_UNCACHED
) {
1616 arc_buf_contents_t type
= DBUF_GET_BUFC_TYPE(db
);
1617 spa_t
*spa
= db
->db_objset
->os_spa
;
1619 ASSERT(db
->db_buf
== NULL
);
1620 ASSERT(db
->db
.db_data
== NULL
);
1621 dbuf_set_data(db
, arc_alloc_buf(spa
, db
, type
, db
->db
.db_size
));
1622 db
->db_state
= DB_FILL
;
1623 } else if (db
->db_state
== DB_NOFILL
) {
1624 dbuf_clear_data(db
);
1626 ASSERT3U(db
->db_state
, ==, DB_CACHED
);
1628 mutex_exit(&db
->db_mtx
);
1632 dbuf_unoverride(dbuf_dirty_record_t
*dr
)
1634 dmu_buf_impl_t
*db
= dr
->dr_dbuf
;
1635 blkptr_t
*bp
= &dr
->dt
.dl
.dr_overridden_by
;
1636 uint64_t txg
= dr
->dr_txg
;
1638 ASSERT(MUTEX_HELD(&db
->db_mtx
));
1640 * This assert is valid because dmu_sync() expects to be called by
1641 * a zilog's get_data while holding a range lock. This call only
1642 * comes from dbuf_dirty() callers who must also hold a range lock.
1644 ASSERT(dr
->dt
.dl
.dr_override_state
!= DR_IN_DMU_SYNC
);
1645 ASSERT(db
->db_level
== 0);
1647 if (db
->db_blkid
== DMU_BONUS_BLKID
||
1648 dr
->dt
.dl
.dr_override_state
== DR_NOT_OVERRIDDEN
)
1651 ASSERT(db
->db_data_pending
!= dr
);
1653 /* free this block */
1654 if (!BP_IS_HOLE(bp
) && !dr
->dt
.dl
.dr_nopwrite
)
1655 zio_free(db
->db_objset
->os_spa
, txg
, bp
);
1657 dr
->dt
.dl
.dr_override_state
= DR_NOT_OVERRIDDEN
;
1658 dr
->dt
.dl
.dr_nopwrite
= B_FALSE
;
1659 dr
->dt
.dl
.dr_has_raw_params
= B_FALSE
;
1662 * Release the already-written buffer, so we leave it in
1663 * a consistent dirty state. Note that all callers are
1664 * modifying the buffer, so they will immediately do
1665 * another (redundant) arc_release(). Therefore, leave
1666 * the buf thawed to save the effort of freezing &
1667 * immediately re-thawing it.
1669 arc_release(dr
->dt
.dl
.dr_data
, db
);
1673 * Evict (if its unreferenced) or clear (if its referenced) any level-0
1674 * data blocks in the free range, so that any future readers will find
1678 dbuf_free_range(dnode_t
*dn
, uint64_t start_blkid
, uint64_t end_blkid
,
1681 dmu_buf_impl_t
*db_search
;
1682 dmu_buf_impl_t
*db
, *db_next
;
1683 uint64_t txg
= tx
->tx_txg
;
1686 if (end_blkid
> dn
->dn_maxblkid
&&
1687 !(start_blkid
== DMU_SPILL_BLKID
|| end_blkid
== DMU_SPILL_BLKID
))
1688 end_blkid
= dn
->dn_maxblkid
;
1689 dprintf_dnode(dn
, "start=%llu end=%llu\n", start_blkid
, end_blkid
);
1691 db_search
= kmem_alloc(sizeof (dmu_buf_impl_t
), KM_SLEEP
);
1692 db_search
->db_level
= 0;
1693 db_search
->db_blkid
= start_blkid
;
1694 db_search
->db_state
= DB_SEARCH
;
1696 mutex_enter(&dn
->dn_dbufs_mtx
);
1697 db
= avl_find(&dn
->dn_dbufs
, db_search
, &where
);
1698 ASSERT3P(db
, ==, NULL
);
1700 db
= avl_nearest(&dn
->dn_dbufs
, where
, AVL_AFTER
);
1702 for (; db
!= NULL
; db
= db_next
) {
1703 db_next
= AVL_NEXT(&dn
->dn_dbufs
, db
);
1704 ASSERT(db
->db_blkid
!= DMU_BONUS_BLKID
);
1706 if (db
->db_level
!= 0 || db
->db_blkid
> end_blkid
) {
1709 ASSERT3U(db
->db_blkid
, >=, start_blkid
);
1711 /* found a level 0 buffer in the range */
1712 mutex_enter(&db
->db_mtx
);
1713 if (dbuf_undirty(db
, tx
)) {
1714 /* mutex has been dropped and dbuf destroyed */
1718 if (db
->db_state
== DB_UNCACHED
||
1719 db
->db_state
== DB_NOFILL
||
1720 db
->db_state
== DB_EVICTING
) {
1721 ASSERT(db
->db
.db_data
== NULL
);
1722 mutex_exit(&db
->db_mtx
);
1725 if (db
->db_state
== DB_READ
|| db
->db_state
== DB_FILL
) {
1726 /* will be handled in dbuf_read_done or dbuf_rele */
1727 db
->db_freed_in_flight
= TRUE
;
1728 mutex_exit(&db
->db_mtx
);
1731 if (refcount_count(&db
->db_holds
) == 0) {
1736 /* The dbuf is referenced */
1738 if (db
->db_last_dirty
!= NULL
) {
1739 dbuf_dirty_record_t
*dr
= db
->db_last_dirty
;
1741 if (dr
->dr_txg
== txg
) {
1743 * This buffer is "in-use", re-adjust the file
1744 * size to reflect that this buffer may
1745 * contain new data when we sync.
1747 if (db
->db_blkid
!= DMU_SPILL_BLKID
&&
1748 db
->db_blkid
> dn
->dn_maxblkid
)
1749 dn
->dn_maxblkid
= db
->db_blkid
;
1750 dbuf_unoverride(dr
);
1753 * This dbuf is not dirty in the open context.
1754 * Either uncache it (if its not referenced in
1755 * the open context) or reset its contents to
1758 dbuf_fix_old_data(db
, txg
);
1761 /* clear the contents if its cached */
1762 if (db
->db_state
== DB_CACHED
) {
1763 ASSERT(db
->db
.db_data
!= NULL
);
1764 arc_release(db
->db_buf
, db
);
1765 bzero(db
->db
.db_data
, db
->db
.db_size
);
1766 arc_buf_freeze(db
->db_buf
);
1769 mutex_exit(&db
->db_mtx
);
1772 kmem_free(db_search
, sizeof (dmu_buf_impl_t
));
1773 mutex_exit(&dn
->dn_dbufs_mtx
);
1777 dbuf_new_size(dmu_buf_impl_t
*db
, int size
, dmu_tx_t
*tx
)
1779 arc_buf_t
*buf
, *obuf
;
1780 int osize
= db
->db
.db_size
;
1781 arc_buf_contents_t type
= DBUF_GET_BUFC_TYPE(db
);
1784 ASSERT(db
->db_blkid
!= DMU_BONUS_BLKID
);
1789 /* XXX does *this* func really need the lock? */
1790 ASSERT(RW_WRITE_HELD(&dn
->dn_struct_rwlock
));
1793 * This call to dmu_buf_will_dirty() with the dn_struct_rwlock held
1794 * is OK, because there can be no other references to the db
1795 * when we are changing its size, so no concurrent DB_FILL can
1799 * XXX we should be doing a dbuf_read, checking the return
1800 * value and returning that up to our callers
1802 dmu_buf_will_dirty(&db
->db
, tx
);
1804 /* create the data buffer for the new block */
1805 buf
= arc_alloc_buf(dn
->dn_objset
->os_spa
, db
, type
, size
);
1807 /* copy old block data to the new block */
1809 bcopy(obuf
->b_data
, buf
->b_data
, MIN(osize
, size
));
1810 /* zero the remainder */
1812 bzero((uint8_t *)buf
->b_data
+ osize
, size
- osize
);
1814 mutex_enter(&db
->db_mtx
);
1815 dbuf_set_data(db
, buf
);
1816 arc_buf_destroy(obuf
, db
);
1817 db
->db
.db_size
= size
;
1819 if (db
->db_level
== 0) {
1820 ASSERT3U(db
->db_last_dirty
->dr_txg
, ==, tx
->tx_txg
);
1821 db
->db_last_dirty
->dt
.dl
.dr_data
= buf
;
1823 mutex_exit(&db
->db_mtx
);
1825 dmu_objset_willuse_space(dn
->dn_objset
, size
- osize
, tx
);
1830 dbuf_release_bp(dmu_buf_impl_t
*db
)
1832 ASSERTV(objset_t
*os
= db
->db_objset
);
1834 ASSERT(dsl_pool_sync_context(dmu_objset_pool(os
)));
1835 ASSERT(arc_released(os
->os_phys_buf
) ||
1836 list_link_active(&os
->os_dsl_dataset
->ds_synced_link
));
1837 ASSERT(db
->db_parent
== NULL
|| arc_released(db
->db_parent
->db_buf
));
1839 (void) arc_release(db
->db_buf
, db
);
1843 * We already have a dirty record for this TXG, and we are being
1847 dbuf_redirty(dbuf_dirty_record_t
*dr
)
1849 dmu_buf_impl_t
*db
= dr
->dr_dbuf
;
1851 ASSERT(MUTEX_HELD(&db
->db_mtx
));
1853 if (db
->db_level
== 0 && db
->db_blkid
!= DMU_BONUS_BLKID
) {
1855 * If this buffer has already been written out,
1856 * we now need to reset its state.
1858 dbuf_unoverride(dr
);
1859 if (db
->db
.db_object
!= DMU_META_DNODE_OBJECT
&&
1860 db
->db_state
!= DB_NOFILL
) {
1861 /* Already released on initial dirty, so just thaw. */
1862 ASSERT(arc_released(db
->db_buf
));
1863 arc_buf_thaw(db
->db_buf
);
1868 dbuf_dirty_record_t
*
1869 dbuf_dirty(dmu_buf_impl_t
*db
, dmu_tx_t
*tx
)
1873 dbuf_dirty_record_t
**drp
, *dr
;
1874 int drop_struct_lock
= FALSE
;
1875 int txgoff
= tx
->tx_txg
& TXG_MASK
;
1877 ASSERT(tx
->tx_txg
!= 0);
1878 ASSERT(!refcount_is_zero(&db
->db_holds
));
1879 DMU_TX_DIRTY_BUF(tx
, db
);
1884 * Shouldn't dirty a regular buffer in syncing context. Private
1885 * objects may be dirtied in syncing context, but only if they
1886 * were already pre-dirtied in open context.
1889 if (dn
->dn_objset
->os_dsl_dataset
!= NULL
) {
1890 rrw_enter(&dn
->dn_objset
->os_dsl_dataset
->ds_bp_rwlock
,
1893 ASSERT(!dmu_tx_is_syncing(tx
) ||
1894 BP_IS_HOLE(dn
->dn_objset
->os_rootbp
) ||
1895 DMU_OBJECT_IS_SPECIAL(dn
->dn_object
) ||
1896 dn
->dn_objset
->os_dsl_dataset
== NULL
);
1897 if (dn
->dn_objset
->os_dsl_dataset
!= NULL
)
1898 rrw_exit(&dn
->dn_objset
->os_dsl_dataset
->ds_bp_rwlock
, FTAG
);
1901 * We make this assert for private objects as well, but after we
1902 * check if we're already dirty. They are allowed to re-dirty
1903 * in syncing context.
1905 ASSERT(dn
->dn_object
== DMU_META_DNODE_OBJECT
||
1906 dn
->dn_dirtyctx
== DN_UNDIRTIED
|| dn
->dn_dirtyctx
==
1907 (dmu_tx_is_syncing(tx
) ? DN_DIRTY_SYNC
: DN_DIRTY_OPEN
));
1909 mutex_enter(&db
->db_mtx
);
1911 * XXX make this true for indirects too? The problem is that
1912 * transactions created with dmu_tx_create_assigned() from
1913 * syncing context don't bother holding ahead.
1915 ASSERT(db
->db_level
!= 0 ||
1916 db
->db_state
== DB_CACHED
|| db
->db_state
== DB_FILL
||
1917 db
->db_state
== DB_NOFILL
);
1919 mutex_enter(&dn
->dn_mtx
);
1921 * Don't set dirtyctx to SYNC if we're just modifying this as we
1922 * initialize the objset.
1924 if (dn
->dn_dirtyctx
== DN_UNDIRTIED
) {
1925 if (dn
->dn_objset
->os_dsl_dataset
!= NULL
) {
1926 rrw_enter(&dn
->dn_objset
->os_dsl_dataset
->ds_bp_rwlock
,
1929 if (!BP_IS_HOLE(dn
->dn_objset
->os_rootbp
)) {
1930 dn
->dn_dirtyctx
= (dmu_tx_is_syncing(tx
) ?
1931 DN_DIRTY_SYNC
: DN_DIRTY_OPEN
);
1932 ASSERT(dn
->dn_dirtyctx_firstset
== NULL
);
1933 dn
->dn_dirtyctx_firstset
= kmem_alloc(1, KM_SLEEP
);
1935 if (dn
->dn_objset
->os_dsl_dataset
!= NULL
) {
1936 rrw_exit(&dn
->dn_objset
->os_dsl_dataset
->ds_bp_rwlock
,
1941 if (tx
->tx_txg
> dn
->dn_dirty_txg
)
1942 dn
->dn_dirty_txg
= tx
->tx_txg
;
1943 mutex_exit(&dn
->dn_mtx
);
1945 if (db
->db_blkid
== DMU_SPILL_BLKID
)
1946 dn
->dn_have_spill
= B_TRUE
;
1949 * If this buffer is already dirty, we're done.
1951 drp
= &db
->db_last_dirty
;
1952 ASSERT(*drp
== NULL
|| (*drp
)->dr_txg
<= tx
->tx_txg
||
1953 db
->db
.db_object
== DMU_META_DNODE_OBJECT
);
1954 while ((dr
= *drp
) != NULL
&& dr
->dr_txg
> tx
->tx_txg
)
1956 if (dr
&& dr
->dr_txg
== tx
->tx_txg
) {
1960 mutex_exit(&db
->db_mtx
);
1965 * Only valid if not already dirty.
1967 ASSERT(dn
->dn_object
== 0 ||
1968 dn
->dn_dirtyctx
== DN_UNDIRTIED
|| dn
->dn_dirtyctx
==
1969 (dmu_tx_is_syncing(tx
) ? DN_DIRTY_SYNC
: DN_DIRTY_OPEN
));
1971 ASSERT3U(dn
->dn_nlevels
, >, db
->db_level
);
1974 * We should only be dirtying in syncing context if it's the
1975 * mos or we're initializing the os or it's a special object.
1976 * However, we are allowed to dirty in syncing context provided
1977 * we already dirtied it in open context. Hence we must make
1978 * this assertion only if we're not already dirty.
1981 VERIFY3U(tx
->tx_txg
, <=, spa_final_dirty_txg(os
->os_spa
));
1983 if (dn
->dn_objset
->os_dsl_dataset
!= NULL
)
1984 rrw_enter(&os
->os_dsl_dataset
->ds_bp_rwlock
, RW_READER
, FTAG
);
1985 ASSERT(!dmu_tx_is_syncing(tx
) || DMU_OBJECT_IS_SPECIAL(dn
->dn_object
) ||
1986 os
->os_dsl_dataset
== NULL
|| BP_IS_HOLE(os
->os_rootbp
));
1987 if (dn
->dn_objset
->os_dsl_dataset
!= NULL
)
1988 rrw_exit(&os
->os_dsl_dataset
->ds_bp_rwlock
, FTAG
);
1990 ASSERT(db
->db
.db_size
!= 0);
1992 dprintf_dbuf(db
, "size=%llx\n", (u_longlong_t
)db
->db
.db_size
);
1994 if (db
->db_blkid
!= DMU_BONUS_BLKID
) {
1995 dmu_objset_willuse_space(os
, db
->db
.db_size
, tx
);
1999 * If this buffer is dirty in an old transaction group we need
2000 * to make a copy of it so that the changes we make in this
2001 * transaction group won't leak out when we sync the older txg.
2003 dr
= kmem_zalloc(sizeof (dbuf_dirty_record_t
), KM_SLEEP
);
2004 list_link_init(&dr
->dr_dirty_node
);
2005 if (db
->db_level
== 0) {
2006 void *data_old
= db
->db_buf
;
2008 if (db
->db_state
!= DB_NOFILL
) {
2009 if (db
->db_blkid
== DMU_BONUS_BLKID
) {
2010 dbuf_fix_old_data(db
, tx
->tx_txg
);
2011 data_old
= db
->db
.db_data
;
2012 } else if (db
->db
.db_object
!= DMU_META_DNODE_OBJECT
) {
2014 * Release the data buffer from the cache so
2015 * that we can modify it without impacting
2016 * possible other users of this cached data
2017 * block. Note that indirect blocks and
2018 * private objects are not released until the
2019 * syncing state (since they are only modified
2022 arc_release(db
->db_buf
, db
);
2023 dbuf_fix_old_data(db
, tx
->tx_txg
);
2024 data_old
= db
->db_buf
;
2026 ASSERT(data_old
!= NULL
);
2028 dr
->dt
.dl
.dr_data
= data_old
;
2030 mutex_init(&dr
->dt
.di
.dr_mtx
, NULL
, MUTEX_NOLOCKDEP
, NULL
);
2031 list_create(&dr
->dt
.di
.dr_children
,
2032 sizeof (dbuf_dirty_record_t
),
2033 offsetof(dbuf_dirty_record_t
, dr_dirty_node
));
2035 if (db
->db_blkid
!= DMU_BONUS_BLKID
&& os
->os_dsl_dataset
!= NULL
)
2036 dr
->dr_accounted
= db
->db
.db_size
;
2038 dr
->dr_txg
= tx
->tx_txg
;
2043 * We could have been freed_in_flight between the dbuf_noread
2044 * and dbuf_dirty. We win, as though the dbuf_noread() had
2045 * happened after the free.
2047 if (db
->db_level
== 0 && db
->db_blkid
!= DMU_BONUS_BLKID
&&
2048 db
->db_blkid
!= DMU_SPILL_BLKID
) {
2049 mutex_enter(&dn
->dn_mtx
);
2050 if (dn
->dn_free_ranges
[txgoff
] != NULL
) {
2051 range_tree_clear(dn
->dn_free_ranges
[txgoff
],
2054 mutex_exit(&dn
->dn_mtx
);
2055 db
->db_freed_in_flight
= FALSE
;
2059 * This buffer is now part of this txg
2061 dbuf_add_ref(db
, (void *)(uintptr_t)tx
->tx_txg
);
2062 db
->db_dirtycnt
+= 1;
2063 ASSERT3U(db
->db_dirtycnt
, <=, 3);
2065 mutex_exit(&db
->db_mtx
);
2067 if (db
->db_blkid
== DMU_BONUS_BLKID
||
2068 db
->db_blkid
== DMU_SPILL_BLKID
) {
2069 mutex_enter(&dn
->dn_mtx
);
2070 ASSERT(!list_link_active(&dr
->dr_dirty_node
));
2071 list_insert_tail(&dn
->dn_dirty_records
[txgoff
], dr
);
2072 mutex_exit(&dn
->dn_mtx
);
2073 dnode_setdirty(dn
, tx
);
2079 * The dn_struct_rwlock prevents db_blkptr from changing
2080 * due to a write from syncing context completing
2081 * while we are running, so we want to acquire it before
2082 * looking at db_blkptr.
2084 if (!RW_WRITE_HELD(&dn
->dn_struct_rwlock
)) {
2085 rw_enter(&dn
->dn_struct_rwlock
, RW_READER
);
2086 drop_struct_lock
= TRUE
;
2090 * We need to hold the dn_struct_rwlock to make this assertion,
2091 * because it protects dn_phys / dn_next_nlevels from changing.
2093 ASSERT((dn
->dn_phys
->dn_nlevels
== 0 && db
->db_level
== 0) ||
2094 dn
->dn_phys
->dn_nlevels
> db
->db_level
||
2095 dn
->dn_next_nlevels
[txgoff
] > db
->db_level
||
2096 dn
->dn_next_nlevels
[(tx
->tx_txg
-1) & TXG_MASK
] > db
->db_level
||
2097 dn
->dn_next_nlevels
[(tx
->tx_txg
-2) & TXG_MASK
] > db
->db_level
);
2100 * If we are overwriting a dedup BP, then unless it is snapshotted,
2101 * when we get to syncing context we will need to decrement its
2102 * refcount in the DDT. Prefetch the relevant DDT block so that
2103 * syncing context won't have to wait for the i/o.
2105 ddt_prefetch(os
->os_spa
, db
->db_blkptr
);
2107 if (db
->db_level
== 0) {
2108 ASSERT(!db
->db_objset
->os_raw_receive
||
2109 dn
->dn_maxblkid
>= db
->db_blkid
);
2110 dnode_new_blkid(dn
, db
->db_blkid
, tx
, drop_struct_lock
);
2111 ASSERT(dn
->dn_maxblkid
>= db
->db_blkid
);
2114 if (db
->db_level
+1 < dn
->dn_nlevels
) {
2115 dmu_buf_impl_t
*parent
= db
->db_parent
;
2116 dbuf_dirty_record_t
*di
;
2117 int parent_held
= FALSE
;
2119 if (db
->db_parent
== NULL
|| db
->db_parent
== dn
->dn_dbuf
) {
2120 int epbs
= dn
->dn_indblkshift
- SPA_BLKPTRSHIFT
;
2122 parent
= dbuf_hold_level(dn
, db
->db_level
+1,
2123 db
->db_blkid
>> epbs
, FTAG
);
2124 ASSERT(parent
!= NULL
);
2127 if (drop_struct_lock
)
2128 rw_exit(&dn
->dn_struct_rwlock
);
2129 ASSERT3U(db
->db_level
+1, ==, parent
->db_level
);
2130 di
= dbuf_dirty(parent
, tx
);
2132 dbuf_rele(parent
, FTAG
);
2134 mutex_enter(&db
->db_mtx
);
2136 * Since we've dropped the mutex, it's possible that
2137 * dbuf_undirty() might have changed this out from under us.
2139 if (db
->db_last_dirty
== dr
||
2140 dn
->dn_object
== DMU_META_DNODE_OBJECT
) {
2141 mutex_enter(&di
->dt
.di
.dr_mtx
);
2142 ASSERT3U(di
->dr_txg
, ==, tx
->tx_txg
);
2143 ASSERT(!list_link_active(&dr
->dr_dirty_node
));
2144 list_insert_tail(&di
->dt
.di
.dr_children
, dr
);
2145 mutex_exit(&di
->dt
.di
.dr_mtx
);
2148 mutex_exit(&db
->db_mtx
);
2150 ASSERT(db
->db_level
+1 == dn
->dn_nlevels
);
2151 ASSERT(db
->db_blkid
< dn
->dn_nblkptr
);
2152 ASSERT(db
->db_parent
== NULL
|| db
->db_parent
== dn
->dn_dbuf
);
2153 mutex_enter(&dn
->dn_mtx
);
2154 ASSERT(!list_link_active(&dr
->dr_dirty_node
));
2155 list_insert_tail(&dn
->dn_dirty_records
[txgoff
], dr
);
2156 mutex_exit(&dn
->dn_mtx
);
2157 if (drop_struct_lock
)
2158 rw_exit(&dn
->dn_struct_rwlock
);
2161 dnode_setdirty(dn
, tx
);
2167 * Undirty a buffer in the transaction group referenced by the given
2168 * transaction. Return whether this evicted the dbuf.
2171 dbuf_undirty(dmu_buf_impl_t
*db
, dmu_tx_t
*tx
)
2174 uint64_t txg
= tx
->tx_txg
;
2175 dbuf_dirty_record_t
*dr
, **drp
;
2180 * Due to our use of dn_nlevels below, this can only be called
2181 * in open context, unless we are operating on the MOS.
2182 * From syncing context, dn_nlevels may be different from the
2183 * dn_nlevels used when dbuf was dirtied.
2185 ASSERT(db
->db_objset
==
2186 dmu_objset_pool(db
->db_objset
)->dp_meta_objset
||
2187 txg
!= spa_syncing_txg(dmu_objset_spa(db
->db_objset
)));
2188 ASSERT(db
->db_blkid
!= DMU_BONUS_BLKID
);
2189 ASSERT0(db
->db_level
);
2190 ASSERT(MUTEX_HELD(&db
->db_mtx
));
2193 * If this buffer is not dirty, we're done.
2195 for (drp
= &db
->db_last_dirty
; (dr
= *drp
) != NULL
; drp
= &dr
->dr_next
)
2196 if (dr
->dr_txg
<= txg
)
2198 if (dr
== NULL
|| dr
->dr_txg
< txg
)
2200 ASSERT(dr
->dr_txg
== txg
);
2201 ASSERT(dr
->dr_dbuf
== db
);
2206 dprintf_dbuf(db
, "size=%llx\n", (u_longlong_t
)db
->db
.db_size
);
2208 ASSERT(db
->db
.db_size
!= 0);
2210 dsl_pool_undirty_space(dmu_objset_pool(dn
->dn_objset
),
2211 dr
->dr_accounted
, txg
);
2216 * Note that there are three places in dbuf_dirty()
2217 * where this dirty record may be put on a list.
2218 * Make sure to do a list_remove corresponding to
2219 * every one of those list_insert calls.
2221 if (dr
->dr_parent
) {
2222 mutex_enter(&dr
->dr_parent
->dt
.di
.dr_mtx
);
2223 list_remove(&dr
->dr_parent
->dt
.di
.dr_children
, dr
);
2224 mutex_exit(&dr
->dr_parent
->dt
.di
.dr_mtx
);
2225 } else if (db
->db_blkid
== DMU_SPILL_BLKID
||
2226 db
->db_level
+ 1 == dn
->dn_nlevels
) {
2227 ASSERT(db
->db_blkptr
== NULL
|| db
->db_parent
== dn
->dn_dbuf
);
2228 mutex_enter(&dn
->dn_mtx
);
2229 list_remove(&dn
->dn_dirty_records
[txg
& TXG_MASK
], dr
);
2230 mutex_exit(&dn
->dn_mtx
);
2234 if (db
->db_state
!= DB_NOFILL
) {
2235 dbuf_unoverride(dr
);
2237 ASSERT(db
->db_buf
!= NULL
);
2238 ASSERT(dr
->dt
.dl
.dr_data
!= NULL
);
2239 if (dr
->dt
.dl
.dr_data
!= db
->db_buf
)
2240 arc_buf_destroy(dr
->dt
.dl
.dr_data
, db
);
2243 kmem_free(dr
, sizeof (dbuf_dirty_record_t
));
2245 ASSERT(db
->db_dirtycnt
> 0);
2246 db
->db_dirtycnt
-= 1;
2248 if (refcount_remove(&db
->db_holds
, (void *)(uintptr_t)txg
) == 0) {
2249 ASSERT(db
->db_state
== DB_NOFILL
|| arc_released(db
->db_buf
));
2258 dmu_buf_will_dirty_impl(dmu_buf_t
*db_fake
, int flags
, dmu_tx_t
*tx
)
2260 dmu_buf_impl_t
*db
= (dmu_buf_impl_t
*)db_fake
;
2262 ASSERT(tx
->tx_txg
!= 0);
2263 ASSERT(!refcount_is_zero(&db
->db_holds
));
2266 * Quick check for dirtyness. For already dirty blocks, this
2267 * reduces runtime of this function by >90%, and overall performance
2268 * by 50% for some workloads (e.g. file deletion with indirect blocks
2271 mutex_enter(&db
->db_mtx
);
2273 dbuf_dirty_record_t
*dr
;
2274 for (dr
= db
->db_last_dirty
;
2275 dr
!= NULL
&& dr
->dr_txg
>= tx
->tx_txg
; dr
= dr
->dr_next
) {
2277 * It's possible that it is already dirty but not cached,
2278 * because there are some calls to dbuf_dirty() that don't
2279 * go through dmu_buf_will_dirty().
2281 if (dr
->dr_txg
== tx
->tx_txg
&& db
->db_state
== DB_CACHED
) {
2282 /* This dbuf is already dirty and cached. */
2284 mutex_exit(&db
->db_mtx
);
2288 mutex_exit(&db
->db_mtx
);
2291 if (RW_WRITE_HELD(&DB_DNODE(db
)->dn_struct_rwlock
))
2292 flags
|= DB_RF_HAVESTRUCT
;
2294 (void) dbuf_read(db
, NULL
, flags
);
2295 (void) dbuf_dirty(db
, tx
);
2299 dmu_buf_will_dirty(dmu_buf_t
*db_fake
, dmu_tx_t
*tx
)
2301 dmu_buf_will_dirty_impl(db_fake
,
2302 DB_RF_MUST_SUCCEED
| DB_RF_NOPREFETCH
, tx
);
2306 dmu_buf_will_not_fill(dmu_buf_t
*db_fake
, dmu_tx_t
*tx
)
2308 dmu_buf_impl_t
*db
= (dmu_buf_impl_t
*)db_fake
;
2310 db
->db_state
= DB_NOFILL
;
2312 dmu_buf_will_fill(db_fake
, tx
);
2316 dmu_buf_will_fill(dmu_buf_t
*db_fake
, dmu_tx_t
*tx
)
2318 dmu_buf_impl_t
*db
= (dmu_buf_impl_t
*)db_fake
;
2320 ASSERT(db
->db_blkid
!= DMU_BONUS_BLKID
);
2321 ASSERT(tx
->tx_txg
!= 0);
2322 ASSERT(db
->db_level
== 0);
2323 ASSERT(!refcount_is_zero(&db
->db_holds
));
2325 ASSERT(db
->db
.db_object
!= DMU_META_DNODE_OBJECT
||
2326 dmu_tx_private_ok(tx
));
2329 (void) dbuf_dirty(db
, tx
);
2333 * This function is effectively the same as dmu_buf_will_dirty(), but
2334 * indicates the caller expects raw encrypted data in the db, and provides
2335 * the crypt params (byteorder, salt, iv, mac) which should be stored in the
2336 * blkptr_t when this dbuf is written. This is only used for blocks of
2337 * dnodes, during raw receive.
2340 dmu_buf_set_crypt_params(dmu_buf_t
*db_fake
, boolean_t byteorder
,
2341 const uint8_t *salt
, const uint8_t *iv
, const uint8_t *mac
, dmu_tx_t
*tx
)
2343 dmu_buf_impl_t
*db
= (dmu_buf_impl_t
*)db_fake
;
2344 dbuf_dirty_record_t
*dr
;
2347 * dr_has_raw_params is only processed for blocks of dnodes
2348 * (see dbuf_sync_dnode_leaf_crypt()).
2350 ASSERT3U(db
->db
.db_object
, ==, DMU_META_DNODE_OBJECT
);
2351 ASSERT3U(db
->db_level
, ==, 0);
2352 ASSERT(db
->db_objset
->os_raw_receive
);
2354 dmu_buf_will_dirty_impl(db_fake
,
2355 DB_RF_MUST_SUCCEED
| DB_RF_NOPREFETCH
| DB_RF_NO_DECRYPT
, tx
);
2357 dr
= db
->db_last_dirty
;
2358 while (dr
!= NULL
&& dr
->dr_txg
> tx
->tx_txg
)
2361 ASSERT3P(dr
, !=, NULL
);
2362 ASSERT3U(dr
->dr_txg
, ==, tx
->tx_txg
);
2364 dr
->dt
.dl
.dr_has_raw_params
= B_TRUE
;
2365 dr
->dt
.dl
.dr_byteorder
= byteorder
;
2366 bcopy(salt
, dr
->dt
.dl
.dr_salt
, ZIO_DATA_SALT_LEN
);
2367 bcopy(iv
, dr
->dt
.dl
.dr_iv
, ZIO_DATA_IV_LEN
);
2368 bcopy(mac
, dr
->dt
.dl
.dr_mac
, ZIO_DATA_MAC_LEN
);
2371 #pragma weak dmu_buf_fill_done = dbuf_fill_done
2374 dbuf_fill_done(dmu_buf_impl_t
*db
, dmu_tx_t
*tx
)
2376 mutex_enter(&db
->db_mtx
);
2379 if (db
->db_state
== DB_FILL
) {
2380 if (db
->db_level
== 0 && db
->db_freed_in_flight
) {
2381 ASSERT(db
->db_blkid
!= DMU_BONUS_BLKID
);
2382 /* we were freed while filling */
2383 /* XXX dbuf_undirty? */
2384 bzero(db
->db
.db_data
, db
->db
.db_size
);
2385 db
->db_freed_in_flight
= FALSE
;
2387 db
->db_state
= DB_CACHED
;
2388 cv_broadcast(&db
->db_changed
);
2390 mutex_exit(&db
->db_mtx
);
2394 dmu_buf_write_embedded(dmu_buf_t
*dbuf
, void *data
,
2395 bp_embedded_type_t etype
, enum zio_compress comp
,
2396 int uncompressed_size
, int compressed_size
, int byteorder
,
2399 dmu_buf_impl_t
*db
= (dmu_buf_impl_t
*)dbuf
;
2400 struct dirty_leaf
*dl
;
2401 dmu_object_type_t type
;
2403 if (etype
== BP_EMBEDDED_TYPE_DATA
) {
2404 ASSERT(spa_feature_is_active(dmu_objset_spa(db
->db_objset
),
2405 SPA_FEATURE_EMBEDDED_DATA
));
2409 type
= DB_DNODE(db
)->dn_type
;
2412 ASSERT0(db
->db_level
);
2413 ASSERT(db
->db_blkid
!= DMU_BONUS_BLKID
);
2415 dmu_buf_will_not_fill(dbuf
, tx
);
2417 ASSERT3U(db
->db_last_dirty
->dr_txg
, ==, tx
->tx_txg
);
2418 dl
= &db
->db_last_dirty
->dt
.dl
;
2419 encode_embedded_bp_compressed(&dl
->dr_overridden_by
,
2420 data
, comp
, uncompressed_size
, compressed_size
);
2421 BPE_SET_ETYPE(&dl
->dr_overridden_by
, etype
);
2422 BP_SET_TYPE(&dl
->dr_overridden_by
, type
);
2423 BP_SET_LEVEL(&dl
->dr_overridden_by
, 0);
2424 BP_SET_BYTEORDER(&dl
->dr_overridden_by
, byteorder
);
2426 dl
->dr_override_state
= DR_OVERRIDDEN
;
2427 dl
->dr_overridden_by
.blk_birth
= db
->db_last_dirty
->dr_txg
;
2431 * Directly assign a provided arc buf to a given dbuf if it's not referenced
2432 * by anybody except our caller. Otherwise copy arcbuf's contents to dbuf.
2435 dbuf_assign_arcbuf(dmu_buf_impl_t
*db
, arc_buf_t
*buf
, dmu_tx_t
*tx
)
2437 ASSERT(!refcount_is_zero(&db
->db_holds
));
2438 ASSERT(db
->db_blkid
!= DMU_BONUS_BLKID
);
2439 ASSERT(db
->db_level
== 0);
2440 ASSERT3U(dbuf_is_metadata(db
), ==, arc_is_metadata(buf
));
2441 ASSERT(buf
!= NULL
);
2442 ASSERT(arc_buf_lsize(buf
) == db
->db
.db_size
);
2443 ASSERT(tx
->tx_txg
!= 0);
2445 arc_return_buf(buf
, db
);
2446 ASSERT(arc_released(buf
));
2448 mutex_enter(&db
->db_mtx
);
2450 while (db
->db_state
== DB_READ
|| db
->db_state
== DB_FILL
)
2451 cv_wait(&db
->db_changed
, &db
->db_mtx
);
2453 ASSERT(db
->db_state
== DB_CACHED
|| db
->db_state
== DB_UNCACHED
);
2455 if (db
->db_state
== DB_CACHED
&&
2456 refcount_count(&db
->db_holds
) - 1 > db
->db_dirtycnt
) {
2458 * In practice, we will never have a case where we have an
2459 * encrypted arc buffer while additional holds exist on the
2460 * dbuf. We don't handle this here so we simply assert that
2463 ASSERT(!arc_is_encrypted(buf
));
2464 mutex_exit(&db
->db_mtx
);
2465 (void) dbuf_dirty(db
, tx
);
2466 bcopy(buf
->b_data
, db
->db
.db_data
, db
->db
.db_size
);
2467 arc_buf_destroy(buf
, db
);
2468 xuio_stat_wbuf_copied();
2472 xuio_stat_wbuf_nocopy();
2473 if (db
->db_state
== DB_CACHED
) {
2474 dbuf_dirty_record_t
*dr
= db
->db_last_dirty
;
2476 ASSERT(db
->db_buf
!= NULL
);
2477 if (dr
!= NULL
&& dr
->dr_txg
== tx
->tx_txg
) {
2478 ASSERT(dr
->dt
.dl
.dr_data
== db
->db_buf
);
2480 if (!arc_released(db
->db_buf
)) {
2481 ASSERT(dr
->dt
.dl
.dr_override_state
==
2483 arc_release(db
->db_buf
, db
);
2485 dr
->dt
.dl
.dr_data
= buf
;
2486 arc_buf_destroy(db
->db_buf
, db
);
2487 } else if (dr
== NULL
|| dr
->dt
.dl
.dr_data
!= db
->db_buf
) {
2488 arc_release(db
->db_buf
, db
);
2489 arc_buf_destroy(db
->db_buf
, db
);
2493 ASSERT(db
->db_buf
== NULL
);
2494 dbuf_set_data(db
, buf
);
2495 db
->db_state
= DB_FILL
;
2496 mutex_exit(&db
->db_mtx
);
2497 (void) dbuf_dirty(db
, tx
);
2498 dmu_buf_fill_done(&db
->db
, tx
);
2502 dbuf_destroy(dmu_buf_impl_t
*db
)
2505 dmu_buf_impl_t
*parent
= db
->db_parent
;
2506 dmu_buf_impl_t
*dndb
;
2508 ASSERT(MUTEX_HELD(&db
->db_mtx
));
2509 ASSERT(refcount_is_zero(&db
->db_holds
));
2511 if (db
->db_buf
!= NULL
) {
2512 arc_buf_destroy(db
->db_buf
, db
);
2516 if (db
->db_blkid
== DMU_BONUS_BLKID
) {
2517 int slots
= DB_DNODE(db
)->dn_num_slots
;
2518 int bonuslen
= DN_SLOTS_TO_BONUSLEN(slots
);
2519 if (db
->db
.db_data
!= NULL
) {
2520 kmem_free(db
->db
.db_data
, bonuslen
);
2521 arc_space_return(bonuslen
, ARC_SPACE_BONUS
);
2522 db
->db_state
= DB_UNCACHED
;
2526 dbuf_clear_data(db
);
2528 if (multilist_link_active(&db
->db_cache_link
)) {
2529 ASSERT(db
->db_caching_status
== DB_DBUF_CACHE
||
2530 db
->db_caching_status
== DB_DBUF_METADATA_CACHE
);
2532 multilist_remove(dbuf_caches
[db
->db_caching_status
].cache
, db
);
2533 (void) refcount_remove_many(
2534 &dbuf_caches
[db
->db_caching_status
].size
,
2535 db
->db
.db_size
, db
);
2537 if (db
->db_caching_status
== DB_DBUF_METADATA_CACHE
) {
2538 DBUF_STAT_BUMPDOWN(metadata_cache_count
);
2540 DBUF_STAT_BUMPDOWN(cache_levels
[db
->db_level
]);
2541 DBUF_STAT_BUMPDOWN(cache_count
);
2542 DBUF_STAT_DECR(cache_levels_bytes
[db
->db_level
],
2545 db
->db_caching_status
= DB_NO_CACHE
;
2548 ASSERT(db
->db_state
== DB_UNCACHED
|| db
->db_state
== DB_NOFILL
);
2549 ASSERT(db
->db_data_pending
== NULL
);
2551 db
->db_state
= DB_EVICTING
;
2552 db
->db_blkptr
= NULL
;
2555 * Now that db_state is DB_EVICTING, nobody else can find this via
2556 * the hash table. We can now drop db_mtx, which allows us to
2557 * acquire the dn_dbufs_mtx.
2559 mutex_exit(&db
->db_mtx
);
2564 if (db
->db_blkid
!= DMU_BONUS_BLKID
) {
2565 boolean_t needlock
= !MUTEX_HELD(&dn
->dn_dbufs_mtx
);
2567 mutex_enter(&dn
->dn_dbufs_mtx
);
2568 avl_remove(&dn
->dn_dbufs
, db
);
2569 atomic_dec_32(&dn
->dn_dbufs_count
);
2573 mutex_exit(&dn
->dn_dbufs_mtx
);
2575 * Decrementing the dbuf count means that the hold corresponding
2576 * to the removed dbuf is no longer discounted in dnode_move(),
2577 * so the dnode cannot be moved until after we release the hold.
2578 * The membar_producer() ensures visibility of the decremented
2579 * value in dnode_move(), since DB_DNODE_EXIT doesn't actually
2582 mutex_enter(&dn
->dn_mtx
);
2583 dnode_rele_and_unlock(dn
, db
, B_TRUE
);
2584 db
->db_dnode_handle
= NULL
;
2586 dbuf_hash_remove(db
);
2591 ASSERT(refcount_is_zero(&db
->db_holds
));
2593 db
->db_parent
= NULL
;
2595 ASSERT(db
->db_buf
== NULL
);
2596 ASSERT(db
->db
.db_data
== NULL
);
2597 ASSERT(db
->db_hash_next
== NULL
);
2598 ASSERT(db
->db_blkptr
== NULL
);
2599 ASSERT(db
->db_data_pending
== NULL
);
2600 ASSERT3U(db
->db_caching_status
, ==, DB_NO_CACHE
);
2601 ASSERT(!multilist_link_active(&db
->db_cache_link
));
2603 kmem_cache_free(dbuf_kmem_cache
, db
);
2604 arc_space_return(sizeof (dmu_buf_impl_t
), ARC_SPACE_DBUF
);
2607 * If this dbuf is referenced from an indirect dbuf,
2608 * decrement the ref count on the indirect dbuf.
2610 if (parent
&& parent
!= dndb
) {
2611 mutex_enter(&parent
->db_mtx
);
2612 dbuf_rele_and_unlock(parent
, db
, B_TRUE
);
2617 * Note: While bpp will always be updated if the function returns success,
2618 * parentp will not be updated if the dnode does not have dn_dbuf filled in;
2619 * this happens when the dnode is the meta-dnode, or {user|group|project}used
2622 __attribute__((always_inline
))
2624 dbuf_findbp(dnode_t
*dn
, int level
, uint64_t blkid
, int fail_sparse
,
2625 dmu_buf_impl_t
**parentp
, blkptr_t
**bpp
, struct dbuf_hold_impl_data
*dh
)
2630 ASSERT(blkid
!= DMU_BONUS_BLKID
);
2632 if (blkid
== DMU_SPILL_BLKID
) {
2633 mutex_enter(&dn
->dn_mtx
);
2634 if (dn
->dn_have_spill
&&
2635 (dn
->dn_phys
->dn_flags
& DNODE_FLAG_SPILL_BLKPTR
))
2636 *bpp
= DN_SPILL_BLKPTR(dn
->dn_phys
);
2639 dbuf_add_ref(dn
->dn_dbuf
, NULL
);
2640 *parentp
= dn
->dn_dbuf
;
2641 mutex_exit(&dn
->dn_mtx
);
2646 (dn
->dn_phys
->dn_nlevels
== 0) ? 1 : dn
->dn_phys
->dn_nlevels
;
2647 int epbs
= dn
->dn_indblkshift
- SPA_BLKPTRSHIFT
;
2649 ASSERT3U(level
* epbs
, <, 64);
2650 ASSERT(RW_LOCK_HELD(&dn
->dn_struct_rwlock
));
2652 * This assertion shouldn't trip as long as the max indirect block size
2653 * is less than 1M. The reason for this is that up to that point,
2654 * the number of levels required to address an entire object with blocks
2655 * of size SPA_MINBLOCKSIZE satisfies nlevels * epbs + 1 <= 64. In
2656 * other words, if N * epbs + 1 > 64, then if (N-1) * epbs + 1 > 55
2657 * (i.e. we can address the entire object), objects will all use at most
2658 * N-1 levels and the assertion won't overflow. However, once epbs is
2659 * 13, 4 * 13 + 1 = 53, but 5 * 13 + 1 = 66. Then, 4 levels will not be
2660 * enough to address an entire object, so objects will have 5 levels,
2661 * but then this assertion will overflow.
2663 * All this is to say that if we ever increase DN_MAX_INDBLKSHIFT, we
2664 * need to redo this logic to handle overflows.
2666 ASSERT(level
>= nlevels
||
2667 ((nlevels
- level
- 1) * epbs
) +
2668 highbit64(dn
->dn_phys
->dn_nblkptr
) <= 64);
2669 if (level
>= nlevels
||
2670 blkid
>= ((uint64_t)dn
->dn_phys
->dn_nblkptr
<<
2671 ((nlevels
- level
- 1) * epbs
)) ||
2673 blkid
> (dn
->dn_phys
->dn_maxblkid
>> (level
* epbs
)))) {
2674 /* the buffer has no parent yet */
2675 return (SET_ERROR(ENOENT
));
2676 } else if (level
< nlevels
-1) {
2677 /* this block is referenced from an indirect block */
2680 err
= dbuf_hold_impl(dn
, level
+1,
2681 blkid
>> epbs
, fail_sparse
, FALSE
, NULL
, parentp
);
2683 __dbuf_hold_impl_init(dh
+ 1, dn
, dh
->dh_level
+ 1,
2684 blkid
>> epbs
, fail_sparse
, FALSE
, NULL
,
2685 parentp
, dh
->dh_depth
+ 1);
2686 err
= __dbuf_hold_impl(dh
+ 1);
2690 err
= dbuf_read(*parentp
, NULL
,
2691 (DB_RF_HAVESTRUCT
| DB_RF_NOPREFETCH
| DB_RF_CANFAIL
));
2693 dbuf_rele(*parentp
, NULL
);
2697 *bpp
= ((blkptr_t
*)(*parentp
)->db
.db_data
) +
2698 (blkid
& ((1ULL << epbs
) - 1));
2699 if (blkid
> (dn
->dn_phys
->dn_maxblkid
>> (level
* epbs
)))
2700 ASSERT(BP_IS_HOLE(*bpp
));
2703 /* the block is referenced from the dnode */
2704 ASSERT3U(level
, ==, nlevels
-1);
2705 ASSERT(dn
->dn_phys
->dn_nblkptr
== 0 ||
2706 blkid
< dn
->dn_phys
->dn_nblkptr
);
2708 dbuf_add_ref(dn
->dn_dbuf
, NULL
);
2709 *parentp
= dn
->dn_dbuf
;
2711 *bpp
= &dn
->dn_phys
->dn_blkptr
[blkid
];
2716 static dmu_buf_impl_t
*
2717 dbuf_create(dnode_t
*dn
, uint8_t level
, uint64_t blkid
,
2718 dmu_buf_impl_t
*parent
, blkptr_t
*blkptr
)
2720 objset_t
*os
= dn
->dn_objset
;
2721 dmu_buf_impl_t
*db
, *odb
;
2723 ASSERT(RW_LOCK_HELD(&dn
->dn_struct_rwlock
));
2724 ASSERT(dn
->dn_type
!= DMU_OT_NONE
);
2726 db
= kmem_cache_alloc(dbuf_kmem_cache
, KM_SLEEP
);
2729 db
->db
.db_object
= dn
->dn_object
;
2730 db
->db_level
= level
;
2731 db
->db_blkid
= blkid
;
2732 db
->db_last_dirty
= NULL
;
2733 db
->db_dirtycnt
= 0;
2734 db
->db_dnode_handle
= dn
->dn_handle
;
2735 db
->db_parent
= parent
;
2736 db
->db_blkptr
= blkptr
;
2739 db
->db_user_immediate_evict
= FALSE
;
2740 db
->db_freed_in_flight
= FALSE
;
2741 db
->db_pending_evict
= FALSE
;
2743 if (blkid
== DMU_BONUS_BLKID
) {
2744 ASSERT3P(parent
, ==, dn
->dn_dbuf
);
2745 db
->db
.db_size
= DN_SLOTS_TO_BONUSLEN(dn
->dn_num_slots
) -
2746 (dn
->dn_nblkptr
-1) * sizeof (blkptr_t
);
2747 ASSERT3U(db
->db
.db_size
, >=, dn
->dn_bonuslen
);
2748 db
->db
.db_offset
= DMU_BONUS_BLKID
;
2749 db
->db_state
= DB_UNCACHED
;
2750 db
->db_caching_status
= DB_NO_CACHE
;
2751 /* the bonus dbuf is not placed in the hash table */
2752 arc_space_consume(sizeof (dmu_buf_impl_t
), ARC_SPACE_DBUF
);
2754 } else if (blkid
== DMU_SPILL_BLKID
) {
2755 db
->db
.db_size
= (blkptr
!= NULL
) ?
2756 BP_GET_LSIZE(blkptr
) : SPA_MINBLOCKSIZE
;
2757 db
->db
.db_offset
= 0;
2760 db
->db_level
? 1 << dn
->dn_indblkshift
: dn
->dn_datablksz
;
2761 db
->db
.db_size
= blocksize
;
2762 db
->db
.db_offset
= db
->db_blkid
* blocksize
;
2766 * Hold the dn_dbufs_mtx while we get the new dbuf
2767 * in the hash table *and* added to the dbufs list.
2768 * This prevents a possible deadlock with someone
2769 * trying to look up this dbuf before its added to the
2772 mutex_enter(&dn
->dn_dbufs_mtx
);
2773 db
->db_state
= DB_EVICTING
;
2774 if ((odb
= dbuf_hash_insert(db
)) != NULL
) {
2775 /* someone else inserted it first */
2776 kmem_cache_free(dbuf_kmem_cache
, db
);
2777 mutex_exit(&dn
->dn_dbufs_mtx
);
2778 DBUF_STAT_BUMP(hash_insert_race
);
2781 avl_add(&dn
->dn_dbufs
, db
);
2783 db
->db_state
= DB_UNCACHED
;
2784 db
->db_caching_status
= DB_NO_CACHE
;
2785 mutex_exit(&dn
->dn_dbufs_mtx
);
2786 arc_space_consume(sizeof (dmu_buf_impl_t
), ARC_SPACE_DBUF
);
2788 if (parent
&& parent
!= dn
->dn_dbuf
)
2789 dbuf_add_ref(parent
, db
);
2791 ASSERT(dn
->dn_object
== DMU_META_DNODE_OBJECT
||
2792 refcount_count(&dn
->dn_holds
) > 0);
2793 (void) refcount_add(&dn
->dn_holds
, db
);
2794 atomic_inc_32(&dn
->dn_dbufs_count
);
2796 dprintf_dbuf(db
, "db=%p\n", db
);
2801 typedef struct dbuf_prefetch_arg
{
2802 spa_t
*dpa_spa
; /* The spa to issue the prefetch in. */
2803 zbookmark_phys_t dpa_zb
; /* The target block to prefetch. */
2804 int dpa_epbs
; /* Entries (blkptr_t's) Per Block Shift. */
2805 int dpa_curlevel
; /* The current level that we're reading */
2806 dnode_t
*dpa_dnode
; /* The dnode associated with the prefetch */
2807 zio_priority_t dpa_prio
; /* The priority I/Os should be issued at. */
2808 zio_t
*dpa_zio
; /* The parent zio_t for all prefetches. */
2809 arc_flags_t dpa_aflags
; /* Flags to pass to the final prefetch. */
2810 } dbuf_prefetch_arg_t
;
2813 * Actually issue the prefetch read for the block given.
2816 dbuf_issue_final_prefetch(dbuf_prefetch_arg_t
*dpa
, blkptr_t
*bp
)
2818 if (BP_IS_HOLE(bp
) || BP_IS_EMBEDDED(bp
))
2821 int zio_flags
= ZIO_FLAG_CANFAIL
| ZIO_FLAG_SPECULATIVE
;
2822 arc_flags_t aflags
=
2823 dpa
->dpa_aflags
| ARC_FLAG_NOWAIT
| ARC_FLAG_PREFETCH
;
2825 /* dnodes are always read as raw and then converted later */
2826 if (BP_GET_TYPE(bp
) == DMU_OT_DNODE
&& BP_IS_PROTECTED(bp
) &&
2827 dpa
->dpa_curlevel
== 0)
2828 zio_flags
|= ZIO_FLAG_RAW
;
2830 ASSERT3U(dpa
->dpa_curlevel
, ==, BP_GET_LEVEL(bp
));
2831 ASSERT3U(dpa
->dpa_curlevel
, ==, dpa
->dpa_zb
.zb_level
);
2832 ASSERT(dpa
->dpa_zio
!= NULL
);
2833 (void) arc_read(dpa
->dpa_zio
, dpa
->dpa_spa
, bp
, NULL
, NULL
,
2834 dpa
->dpa_prio
, zio_flags
, &aflags
, &dpa
->dpa_zb
);
2838 * Called when an indirect block above our prefetch target is read in. This
2839 * will either read in the next indirect block down the tree or issue the actual
2840 * prefetch if the next block down is our target.
2843 dbuf_prefetch_indirect_done(zio_t
*zio
, const zbookmark_phys_t
*zb
,
2844 const blkptr_t
*iobp
, arc_buf_t
*abuf
, void *private)
2846 dbuf_prefetch_arg_t
*dpa
= private;
2848 ASSERT3S(dpa
->dpa_zb
.zb_level
, <, dpa
->dpa_curlevel
);
2849 ASSERT3S(dpa
->dpa_curlevel
, >, 0);
2852 ASSERT(zio
== NULL
|| zio
->io_error
!= 0);
2853 kmem_free(dpa
, sizeof (*dpa
));
2856 ASSERT(zio
== NULL
|| zio
->io_error
== 0);
2859 * The dpa_dnode is only valid if we are called with a NULL
2860 * zio. This indicates that the arc_read() returned without
2861 * first calling zio_read() to issue a physical read. Once
2862 * a physical read is made the dpa_dnode must be invalidated
2863 * as the locks guarding it may have been dropped. If the
2864 * dpa_dnode is still valid, then we want to add it to the dbuf
2865 * cache. To do so, we must hold the dbuf associated with the block
2866 * we just prefetched, read its contents so that we associate it
2867 * with an arc_buf_t, and then release it.
2870 ASSERT3S(BP_GET_LEVEL(zio
->io_bp
), ==, dpa
->dpa_curlevel
);
2871 if (zio
->io_flags
& ZIO_FLAG_RAW_COMPRESS
) {
2872 ASSERT3U(BP_GET_PSIZE(zio
->io_bp
), ==, zio
->io_size
);
2874 ASSERT3U(BP_GET_LSIZE(zio
->io_bp
), ==, zio
->io_size
);
2876 ASSERT3P(zio
->io_spa
, ==, dpa
->dpa_spa
);
2878 dpa
->dpa_dnode
= NULL
;
2879 } else if (dpa
->dpa_dnode
!= NULL
) {
2880 uint64_t curblkid
= dpa
->dpa_zb
.zb_blkid
>>
2881 (dpa
->dpa_epbs
* (dpa
->dpa_curlevel
-
2882 dpa
->dpa_zb
.zb_level
));
2883 dmu_buf_impl_t
*db
= dbuf_hold_level(dpa
->dpa_dnode
,
2884 dpa
->dpa_curlevel
, curblkid
, FTAG
);
2885 (void) dbuf_read(db
, NULL
,
2886 DB_RF_MUST_SUCCEED
| DB_RF_NOPREFETCH
| DB_RF_HAVESTRUCT
);
2887 dbuf_rele(db
, FTAG
);
2890 dpa
->dpa_curlevel
--;
2891 uint64_t nextblkid
= dpa
->dpa_zb
.zb_blkid
>>
2892 (dpa
->dpa_epbs
* (dpa
->dpa_curlevel
- dpa
->dpa_zb
.zb_level
));
2893 blkptr_t
*bp
= ((blkptr_t
*)abuf
->b_data
) +
2894 P2PHASE(nextblkid
, 1ULL << dpa
->dpa_epbs
);
2896 if (BP_IS_HOLE(bp
)) {
2897 kmem_free(dpa
, sizeof (*dpa
));
2898 } else if (dpa
->dpa_curlevel
== dpa
->dpa_zb
.zb_level
) {
2899 ASSERT3U(nextblkid
, ==, dpa
->dpa_zb
.zb_blkid
);
2900 dbuf_issue_final_prefetch(dpa
, bp
);
2901 kmem_free(dpa
, sizeof (*dpa
));
2903 arc_flags_t iter_aflags
= ARC_FLAG_NOWAIT
;
2904 zbookmark_phys_t zb
;
2906 /* flag if L2ARC eligible, l2arc_noprefetch then decides */
2907 if (dpa
->dpa_aflags
& ARC_FLAG_L2CACHE
)
2908 iter_aflags
|= ARC_FLAG_L2CACHE
;
2910 ASSERT3U(dpa
->dpa_curlevel
, ==, BP_GET_LEVEL(bp
));
2912 SET_BOOKMARK(&zb
, dpa
->dpa_zb
.zb_objset
,
2913 dpa
->dpa_zb
.zb_object
, dpa
->dpa_curlevel
, nextblkid
);
2915 (void) arc_read(dpa
->dpa_zio
, dpa
->dpa_spa
,
2916 bp
, dbuf_prefetch_indirect_done
, dpa
, dpa
->dpa_prio
,
2917 ZIO_FLAG_CANFAIL
| ZIO_FLAG_SPECULATIVE
,
2921 arc_buf_destroy(abuf
, private);
2925 * Issue prefetch reads for the given block on the given level. If the indirect
2926 * blocks above that block are not in memory, we will read them in
2927 * asynchronously. As a result, this call never blocks waiting for a read to
2928 * complete. Note that the prefetch might fail if the dataset is encrypted and
2929 * the encryption key is unmapped before the IO completes.
2932 dbuf_prefetch(dnode_t
*dn
, int64_t level
, uint64_t blkid
, zio_priority_t prio
,
2936 int epbs
, nlevels
, curlevel
;
2939 ASSERT(blkid
!= DMU_BONUS_BLKID
);
2940 ASSERT(RW_LOCK_HELD(&dn
->dn_struct_rwlock
));
2942 if (blkid
> dn
->dn_maxblkid
)
2945 if (dnode_block_freed(dn
, blkid
))
2949 * This dnode hasn't been written to disk yet, so there's nothing to
2952 nlevels
= dn
->dn_phys
->dn_nlevels
;
2953 if (level
>= nlevels
|| dn
->dn_phys
->dn_nblkptr
== 0)
2956 epbs
= dn
->dn_phys
->dn_indblkshift
- SPA_BLKPTRSHIFT
;
2957 if (dn
->dn_phys
->dn_maxblkid
< blkid
<< (epbs
* level
))
2960 dmu_buf_impl_t
*db
= dbuf_find(dn
->dn_objset
, dn
->dn_object
,
2963 mutex_exit(&db
->db_mtx
);
2965 * This dbuf already exists. It is either CACHED, or
2966 * (we assume) about to be read or filled.
2972 * Find the closest ancestor (indirect block) of the target block
2973 * that is present in the cache. In this indirect block, we will
2974 * find the bp that is at curlevel, curblkid.
2978 while (curlevel
< nlevels
- 1) {
2979 int parent_level
= curlevel
+ 1;
2980 uint64_t parent_blkid
= curblkid
>> epbs
;
2983 if (dbuf_hold_impl(dn
, parent_level
, parent_blkid
,
2984 FALSE
, TRUE
, FTAG
, &db
) == 0) {
2985 blkptr_t
*bpp
= db
->db_buf
->b_data
;
2986 bp
= bpp
[P2PHASE(curblkid
, 1 << epbs
)];
2987 dbuf_rele(db
, FTAG
);
2991 curlevel
= parent_level
;
2992 curblkid
= parent_blkid
;
2995 if (curlevel
== nlevels
- 1) {
2996 /* No cached indirect blocks found. */
2997 ASSERT3U(curblkid
, <, dn
->dn_phys
->dn_nblkptr
);
2998 bp
= dn
->dn_phys
->dn_blkptr
[curblkid
];
3000 if (BP_IS_HOLE(&bp
))
3003 ASSERT3U(curlevel
, ==, BP_GET_LEVEL(&bp
));
3005 zio_t
*pio
= zio_root(dmu_objset_spa(dn
->dn_objset
), NULL
, NULL
,
3008 dbuf_prefetch_arg_t
*dpa
= kmem_zalloc(sizeof (*dpa
), KM_SLEEP
);
3009 dsl_dataset_t
*ds
= dn
->dn_objset
->os_dsl_dataset
;
3010 SET_BOOKMARK(&dpa
->dpa_zb
, ds
!= NULL
? ds
->ds_object
: DMU_META_OBJSET
,
3011 dn
->dn_object
, level
, blkid
);
3012 dpa
->dpa_curlevel
= curlevel
;
3013 dpa
->dpa_prio
= prio
;
3014 dpa
->dpa_aflags
= aflags
;
3015 dpa
->dpa_spa
= dn
->dn_objset
->os_spa
;
3016 dpa
->dpa_dnode
= dn
;
3017 dpa
->dpa_epbs
= epbs
;
3020 /* flag if L2ARC eligible, l2arc_noprefetch then decides */
3021 if (DNODE_LEVEL_IS_L2CACHEABLE(dn
, level
))
3022 dpa
->dpa_aflags
|= ARC_FLAG_L2CACHE
;
3025 * If we have the indirect just above us, no need to do the asynchronous
3026 * prefetch chain; we'll just run the last step ourselves. If we're at
3027 * a higher level, though, we want to issue the prefetches for all the
3028 * indirect blocks asynchronously, so we can go on with whatever we were
3031 if (curlevel
== level
) {
3032 ASSERT3U(curblkid
, ==, blkid
);
3033 dbuf_issue_final_prefetch(dpa
, &bp
);
3034 kmem_free(dpa
, sizeof (*dpa
));
3036 arc_flags_t iter_aflags
= ARC_FLAG_NOWAIT
;
3037 zbookmark_phys_t zb
;
3039 /* flag if L2ARC eligible, l2arc_noprefetch then decides */
3040 if (DNODE_LEVEL_IS_L2CACHEABLE(dn
, level
))
3041 iter_aflags
|= ARC_FLAG_L2CACHE
;
3043 SET_BOOKMARK(&zb
, ds
!= NULL
? ds
->ds_object
: DMU_META_OBJSET
,
3044 dn
->dn_object
, curlevel
, curblkid
);
3045 (void) arc_read(dpa
->dpa_zio
, dpa
->dpa_spa
,
3046 &bp
, dbuf_prefetch_indirect_done
, dpa
, prio
,
3047 ZIO_FLAG_CANFAIL
| ZIO_FLAG_SPECULATIVE
,
3051 * We use pio here instead of dpa_zio since it's possible that
3052 * dpa may have already been freed.
3057 #define DBUF_HOLD_IMPL_MAX_DEPTH 20
3060 * Helper function for __dbuf_hold_impl() to copy a buffer. Handles
3061 * the case of encrypted, compressed and uncompressed buffers by
3062 * allocating the new buffer, respectively, with arc_alloc_raw_buf(),
3063 * arc_alloc_compressed_buf() or arc_alloc_buf().*
3065 * NOTE: Declared noinline to avoid stack bloat in __dbuf_hold_impl().
3067 noinline
static void
3068 dbuf_hold_copy(struct dbuf_hold_impl_data
*dh
)
3070 dnode_t
*dn
= dh
->dh_dn
;
3071 dmu_buf_impl_t
*db
= dh
->dh_db
;
3072 dbuf_dirty_record_t
*dr
= dh
->dh_dr
;
3073 arc_buf_t
*data
= dr
->dt
.dl
.dr_data
;
3075 enum zio_compress compress_type
= arc_get_compression(data
);
3077 if (arc_is_encrypted(data
)) {
3078 boolean_t byteorder
;
3079 uint8_t salt
[ZIO_DATA_SALT_LEN
];
3080 uint8_t iv
[ZIO_DATA_IV_LEN
];
3081 uint8_t mac
[ZIO_DATA_MAC_LEN
];
3083 arc_get_raw_params(data
, &byteorder
, salt
, iv
, mac
);
3084 dbuf_set_data(db
, arc_alloc_raw_buf(dn
->dn_objset
->os_spa
, db
,
3085 dmu_objset_id(dn
->dn_objset
), byteorder
, salt
, iv
, mac
,
3086 dn
->dn_type
, arc_buf_size(data
), arc_buf_lsize(data
),
3088 } else if (compress_type
!= ZIO_COMPRESS_OFF
) {
3089 dbuf_set_data(db
, arc_alloc_compressed_buf(
3090 dn
->dn_objset
->os_spa
, db
, arc_buf_size(data
),
3091 arc_buf_lsize(data
), compress_type
));
3093 dbuf_set_data(db
, arc_alloc_buf(dn
->dn_objset
->os_spa
, db
,
3094 DBUF_GET_BUFC_TYPE(db
), db
->db
.db_size
));
3097 bcopy(data
->b_data
, db
->db
.db_data
, arc_buf_size(data
));
3101 * Returns with db_holds incremented, and db_mtx not held.
3102 * Note: dn_struct_rwlock must be held.
3105 __dbuf_hold_impl(struct dbuf_hold_impl_data
*dh
)
3107 ASSERT3S(dh
->dh_depth
, <, DBUF_HOLD_IMPL_MAX_DEPTH
);
3108 dh
->dh_parent
= NULL
;
3110 ASSERT(dh
->dh_blkid
!= DMU_BONUS_BLKID
);
3111 ASSERT(RW_LOCK_HELD(&dh
->dh_dn
->dn_struct_rwlock
));
3112 ASSERT3U(dh
->dh_dn
->dn_nlevels
, >, dh
->dh_level
);
3114 *(dh
->dh_dbp
) = NULL
;
3116 /* dbuf_find() returns with db_mtx held */
3117 dh
->dh_db
= dbuf_find(dh
->dh_dn
->dn_objset
, dh
->dh_dn
->dn_object
,
3118 dh
->dh_level
, dh
->dh_blkid
);
3120 if (dh
->dh_db
== NULL
) {
3123 if (dh
->dh_fail_uncached
)
3124 return (SET_ERROR(ENOENT
));
3126 ASSERT3P(dh
->dh_parent
, ==, NULL
);
3127 dh
->dh_err
= dbuf_findbp(dh
->dh_dn
, dh
->dh_level
, dh
->dh_blkid
,
3128 dh
->dh_fail_sparse
, &dh
->dh_parent
, &dh
->dh_bp
, dh
);
3129 if (dh
->dh_fail_sparse
) {
3130 if (dh
->dh_err
== 0 &&
3131 dh
->dh_bp
&& BP_IS_HOLE(dh
->dh_bp
))
3132 dh
->dh_err
= SET_ERROR(ENOENT
);
3135 dbuf_rele(dh
->dh_parent
, NULL
);
3136 return (dh
->dh_err
);
3139 if (dh
->dh_err
&& dh
->dh_err
!= ENOENT
)
3140 return (dh
->dh_err
);
3141 dh
->dh_db
= dbuf_create(dh
->dh_dn
, dh
->dh_level
, dh
->dh_blkid
,
3142 dh
->dh_parent
, dh
->dh_bp
);
3145 if (dh
->dh_fail_uncached
&& dh
->dh_db
->db_state
!= DB_CACHED
) {
3146 mutex_exit(&dh
->dh_db
->db_mtx
);
3147 return (SET_ERROR(ENOENT
));
3150 if (dh
->dh_db
->db_buf
!= NULL
) {
3151 arc_buf_access(dh
->dh_db
->db_buf
);
3152 ASSERT3P(dh
->dh_db
->db
.db_data
, ==, dh
->dh_db
->db_buf
->b_data
);
3155 ASSERT(dh
->dh_db
->db_buf
== NULL
|| arc_referenced(dh
->dh_db
->db_buf
));
3158 * If this buffer is currently syncing out, and we are are
3159 * still referencing it from db_data, we need to make a copy
3160 * of it in case we decide we want to dirty it again in this txg.
3162 if (dh
->dh_db
->db_level
== 0 &&
3163 dh
->dh_db
->db_blkid
!= DMU_BONUS_BLKID
&&
3164 dh
->dh_dn
->dn_object
!= DMU_META_DNODE_OBJECT
&&
3165 dh
->dh_db
->db_state
== DB_CACHED
&& dh
->dh_db
->db_data_pending
) {
3166 dh
->dh_dr
= dh
->dh_db
->db_data_pending
;
3167 if (dh
->dh_dr
->dt
.dl
.dr_data
== dh
->dh_db
->db_buf
)
3171 if (multilist_link_active(&dh
->dh_db
->db_cache_link
)) {
3172 ASSERT(refcount_is_zero(&dh
->dh_db
->db_holds
));
3173 ASSERT(dh
->dh_db
->db_caching_status
== DB_DBUF_CACHE
||
3174 dh
->dh_db
->db_caching_status
== DB_DBUF_METADATA_CACHE
);
3177 dbuf_caches
[dh
->dh_db
->db_caching_status
].cache
,
3179 (void) refcount_remove_many(
3180 &dbuf_caches
[dh
->dh_db
->db_caching_status
].size
,
3181 dh
->dh_db
->db
.db_size
, dh
->dh_db
);
3183 if (dh
->dh_db
->db_caching_status
== DB_DBUF_METADATA_CACHE
) {
3184 DBUF_STAT_BUMPDOWN(metadata_cache_count
);
3186 DBUF_STAT_BUMPDOWN(cache_levels
[dh
->dh_db
->db_level
]);
3187 DBUF_STAT_BUMPDOWN(cache_count
);
3188 DBUF_STAT_DECR(cache_levels_bytes
[dh
->dh_db
->db_level
],
3189 dh
->dh_db
->db
.db_size
);
3191 dh
->dh_db
->db_caching_status
= DB_NO_CACHE
;
3193 (void) refcount_add(&dh
->dh_db
->db_holds
, dh
->dh_tag
);
3194 DBUF_VERIFY(dh
->dh_db
);
3195 mutex_exit(&dh
->dh_db
->db_mtx
);
3197 /* NOTE: we can't rele the parent until after we drop the db_mtx */
3199 dbuf_rele(dh
->dh_parent
, NULL
);
3201 ASSERT3P(DB_DNODE(dh
->dh_db
), ==, dh
->dh_dn
);
3202 ASSERT3U(dh
->dh_db
->db_blkid
, ==, dh
->dh_blkid
);
3203 ASSERT3U(dh
->dh_db
->db_level
, ==, dh
->dh_level
);
3204 *(dh
->dh_dbp
) = dh
->dh_db
;
3210 * The following code preserves the recursive function dbuf_hold_impl()
3211 * but moves the local variables AND function arguments to the heap to
3212 * minimize the stack frame size. Enough space is initially allocated
3213 * on the stack for 20 levels of recursion.
3216 dbuf_hold_impl(dnode_t
*dn
, uint8_t level
, uint64_t blkid
,
3217 boolean_t fail_sparse
, boolean_t fail_uncached
,
3218 void *tag
, dmu_buf_impl_t
**dbp
)
3220 struct dbuf_hold_impl_data
*dh
;
3223 dh
= kmem_alloc(sizeof (struct dbuf_hold_impl_data
) *
3224 DBUF_HOLD_IMPL_MAX_DEPTH
, KM_SLEEP
);
3225 __dbuf_hold_impl_init(dh
, dn
, level
, blkid
, fail_sparse
,
3226 fail_uncached
, tag
, dbp
, 0);
3228 error
= __dbuf_hold_impl(dh
);
3230 kmem_free(dh
, sizeof (struct dbuf_hold_impl_data
) *
3231 DBUF_HOLD_IMPL_MAX_DEPTH
);
3237 __dbuf_hold_impl_init(struct dbuf_hold_impl_data
*dh
,
3238 dnode_t
*dn
, uint8_t level
, uint64_t blkid
,
3239 boolean_t fail_sparse
, boolean_t fail_uncached
,
3240 void *tag
, dmu_buf_impl_t
**dbp
, int depth
)
3243 dh
->dh_level
= level
;
3244 dh
->dh_blkid
= blkid
;
3246 dh
->dh_fail_sparse
= fail_sparse
;
3247 dh
->dh_fail_uncached
= fail_uncached
;
3253 dh
->dh_parent
= NULL
;
3258 dh
->dh_depth
= depth
;
3262 dbuf_hold(dnode_t
*dn
, uint64_t blkid
, void *tag
)
3264 return (dbuf_hold_level(dn
, 0, blkid
, tag
));
3268 dbuf_hold_level(dnode_t
*dn
, int level
, uint64_t blkid
, void *tag
)
3271 int err
= dbuf_hold_impl(dn
, level
, blkid
, FALSE
, FALSE
, tag
, &db
);
3272 return (err
? NULL
: db
);
3276 dbuf_create_bonus(dnode_t
*dn
)
3278 ASSERT(RW_WRITE_HELD(&dn
->dn_struct_rwlock
));
3280 ASSERT(dn
->dn_bonus
== NULL
);
3281 dn
->dn_bonus
= dbuf_create(dn
, 0, DMU_BONUS_BLKID
, dn
->dn_dbuf
, NULL
);
3285 dbuf_spill_set_blksz(dmu_buf_t
*db_fake
, uint64_t blksz
, dmu_tx_t
*tx
)
3287 dmu_buf_impl_t
*db
= (dmu_buf_impl_t
*)db_fake
;
3290 if (db
->db_blkid
!= DMU_SPILL_BLKID
)
3291 return (SET_ERROR(ENOTSUP
));
3293 blksz
= SPA_MINBLOCKSIZE
;
3294 ASSERT3U(blksz
, <=, spa_maxblocksize(dmu_objset_spa(db
->db_objset
)));
3295 blksz
= P2ROUNDUP(blksz
, SPA_MINBLOCKSIZE
);
3299 rw_enter(&dn
->dn_struct_rwlock
, RW_WRITER
);
3300 dbuf_new_size(db
, blksz
, tx
);
3301 rw_exit(&dn
->dn_struct_rwlock
);
3308 dbuf_rm_spill(dnode_t
*dn
, dmu_tx_t
*tx
)
3310 dbuf_free_range(dn
, DMU_SPILL_BLKID
, DMU_SPILL_BLKID
, tx
);
3313 #pragma weak dmu_buf_add_ref = dbuf_add_ref
3315 dbuf_add_ref(dmu_buf_impl_t
*db
, void *tag
)
3317 int64_t holds
= refcount_add(&db
->db_holds
, tag
);
3318 VERIFY3S(holds
, >, 1);
3321 #pragma weak dmu_buf_try_add_ref = dbuf_try_add_ref
3323 dbuf_try_add_ref(dmu_buf_t
*db_fake
, objset_t
*os
, uint64_t obj
, uint64_t blkid
,
3326 dmu_buf_impl_t
*db
= (dmu_buf_impl_t
*)db_fake
;
3327 dmu_buf_impl_t
*found_db
;
3328 boolean_t result
= B_FALSE
;
3330 if (blkid
== DMU_BONUS_BLKID
)
3331 found_db
= dbuf_find_bonus(os
, obj
);
3333 found_db
= dbuf_find(os
, obj
, 0, blkid
);
3335 if (found_db
!= NULL
) {
3336 if (db
== found_db
&& dbuf_refcount(db
) > db
->db_dirtycnt
) {
3337 (void) refcount_add(&db
->db_holds
, tag
);
3340 mutex_exit(&found_db
->db_mtx
);
3346 * If you call dbuf_rele() you had better not be referencing the dnode handle
3347 * unless you have some other direct or indirect hold on the dnode. (An indirect
3348 * hold is a hold on one of the dnode's dbufs, including the bonus buffer.)
3349 * Without that, the dbuf_rele() could lead to a dnode_rele() followed by the
3350 * dnode's parent dbuf evicting its dnode handles.
3353 dbuf_rele(dmu_buf_impl_t
*db
, void *tag
)
3355 mutex_enter(&db
->db_mtx
);
3356 dbuf_rele_and_unlock(db
, tag
, B_FALSE
);
3360 dmu_buf_rele(dmu_buf_t
*db
, void *tag
)
3362 dbuf_rele((dmu_buf_impl_t
*)db
, tag
);
3366 * dbuf_rele() for an already-locked dbuf. This is necessary to allow
3367 * db_dirtycnt and db_holds to be updated atomically. The 'evicting'
3368 * argument should be set if we are already in the dbuf-evicting code
3369 * path, in which case we don't want to recursively evict. This allows us to
3370 * avoid deeply nested stacks that would have a call flow similar to this:
3372 * dbuf_rele()-->dbuf_rele_and_unlock()-->dbuf_evict_notify()
3375 * +-----dbuf_destroy()<--dbuf_evict_one()<--------+
3379 dbuf_rele_and_unlock(dmu_buf_impl_t
*db
, void *tag
, boolean_t evicting
)
3383 ASSERT(MUTEX_HELD(&db
->db_mtx
));
3387 * Remove the reference to the dbuf before removing its hold on the
3388 * dnode so we can guarantee in dnode_move() that a referenced bonus
3389 * buffer has a corresponding dnode hold.
3391 holds
= refcount_remove(&db
->db_holds
, tag
);
3395 * We can't freeze indirects if there is a possibility that they
3396 * may be modified in the current syncing context.
3398 if (db
->db_buf
!= NULL
&&
3399 holds
== (db
->db_level
== 0 ? db
->db_dirtycnt
: 0)) {
3400 arc_buf_freeze(db
->db_buf
);
3403 if (holds
== db
->db_dirtycnt
&&
3404 db
->db_level
== 0 && db
->db_user_immediate_evict
)
3405 dbuf_evict_user(db
);
3408 if (db
->db_blkid
== DMU_BONUS_BLKID
) {
3410 boolean_t evict_dbuf
= db
->db_pending_evict
;
3413 * If the dnode moves here, we cannot cross this
3414 * barrier until the move completes.
3419 atomic_dec_32(&dn
->dn_dbufs_count
);
3422 * Decrementing the dbuf count means that the bonus
3423 * buffer's dnode hold is no longer discounted in
3424 * dnode_move(). The dnode cannot move until after
3425 * the dnode_rele() below.
3430 * Do not reference db after its lock is dropped.
3431 * Another thread may evict it.
3433 mutex_exit(&db
->db_mtx
);
3436 dnode_evict_bonus(dn
);
3439 } else if (db
->db_buf
== NULL
) {
3441 * This is a special case: we never associated this
3442 * dbuf with any data allocated from the ARC.
3444 ASSERT(db
->db_state
== DB_UNCACHED
||
3445 db
->db_state
== DB_NOFILL
);
3447 } else if (arc_released(db
->db_buf
)) {
3449 * This dbuf has anonymous data associated with it.
3453 boolean_t do_arc_evict
= B_FALSE
;
3455 spa_t
*spa
= dmu_objset_spa(db
->db_objset
);
3457 if (!DBUF_IS_CACHEABLE(db
) &&
3458 db
->db_blkptr
!= NULL
&&
3459 !BP_IS_HOLE(db
->db_blkptr
) &&
3460 !BP_IS_EMBEDDED(db
->db_blkptr
)) {
3461 do_arc_evict
= B_TRUE
;
3462 bp
= *db
->db_blkptr
;
3465 if (!DBUF_IS_CACHEABLE(db
) ||
3466 db
->db_pending_evict
) {
3468 } else if (!multilist_link_active(&db
->db_cache_link
)) {
3469 ASSERT3U(db
->db_caching_status
, ==,
3472 dbuf_cached_state_t dcs
=
3473 dbuf_include_in_metadata_cache(db
) ?
3474 DB_DBUF_METADATA_CACHE
: DB_DBUF_CACHE
;
3475 db
->db_caching_status
= dcs
;
3477 multilist_insert(dbuf_caches
[dcs
].cache
, db
);
3478 (void) refcount_add_many(&dbuf_caches
[dcs
].size
,
3479 db
->db
.db_size
, db
);
3481 if (dcs
== DB_DBUF_METADATA_CACHE
) {
3482 DBUF_STAT_BUMP(metadata_cache_count
);
3484 metadata_cache_size_bytes_max
,
3486 &dbuf_caches
[dcs
].size
));
3489 cache_levels
[db
->db_level
]);
3490 DBUF_STAT_BUMP(cache_count
);
3492 cache_levels_bytes
[db
->db_level
],
3494 DBUF_STAT_MAX(cache_size_bytes_max
,
3496 &dbuf_caches
[dcs
].size
));
3498 mutex_exit(&db
->db_mtx
);
3500 if (db
->db_caching_status
== DB_DBUF_CACHE
&&
3502 dbuf_evict_notify();
3507 arc_freed(spa
, &bp
);
3510 mutex_exit(&db
->db_mtx
);
3515 #pragma weak dmu_buf_refcount = dbuf_refcount
3517 dbuf_refcount(dmu_buf_impl_t
*db
)
3519 return (refcount_count(&db
->db_holds
));
3523 dmu_buf_user_refcount(dmu_buf_t
*db_fake
)
3526 dmu_buf_impl_t
*db
= (dmu_buf_impl_t
*)db_fake
;
3528 mutex_enter(&db
->db_mtx
);
3529 ASSERT3U(refcount_count(&db
->db_holds
), >=, db
->db_dirtycnt
);
3530 holds
= refcount_count(&db
->db_holds
) - db
->db_dirtycnt
;
3531 mutex_exit(&db
->db_mtx
);
3537 dmu_buf_replace_user(dmu_buf_t
*db_fake
, dmu_buf_user_t
*old_user
,
3538 dmu_buf_user_t
*new_user
)
3540 dmu_buf_impl_t
*db
= (dmu_buf_impl_t
*)db_fake
;
3542 mutex_enter(&db
->db_mtx
);
3543 dbuf_verify_user(db
, DBVU_NOT_EVICTING
);
3544 if (db
->db_user
== old_user
)
3545 db
->db_user
= new_user
;
3547 old_user
= db
->db_user
;
3548 dbuf_verify_user(db
, DBVU_NOT_EVICTING
);
3549 mutex_exit(&db
->db_mtx
);
3555 dmu_buf_set_user(dmu_buf_t
*db_fake
, dmu_buf_user_t
*user
)
3557 return (dmu_buf_replace_user(db_fake
, NULL
, user
));
3561 dmu_buf_set_user_ie(dmu_buf_t
*db_fake
, dmu_buf_user_t
*user
)
3563 dmu_buf_impl_t
*db
= (dmu_buf_impl_t
*)db_fake
;
3565 db
->db_user_immediate_evict
= TRUE
;
3566 return (dmu_buf_set_user(db_fake
, user
));
3570 dmu_buf_remove_user(dmu_buf_t
*db_fake
, dmu_buf_user_t
*user
)
3572 return (dmu_buf_replace_user(db_fake
, user
, NULL
));
3576 dmu_buf_get_user(dmu_buf_t
*db_fake
)
3578 dmu_buf_impl_t
*db
= (dmu_buf_impl_t
*)db_fake
;
3580 dbuf_verify_user(db
, DBVU_NOT_EVICTING
);
3581 return (db
->db_user
);
3585 dmu_buf_user_evict_wait()
3587 taskq_wait(dbu_evict_taskq
);
3591 dmu_buf_get_blkptr(dmu_buf_t
*db
)
3593 dmu_buf_impl_t
*dbi
= (dmu_buf_impl_t
*)db
;
3594 return (dbi
->db_blkptr
);
3598 dmu_buf_get_objset(dmu_buf_t
*db
)
3600 dmu_buf_impl_t
*dbi
= (dmu_buf_impl_t
*)db
;
3601 return (dbi
->db_objset
);
3605 dmu_buf_dnode_enter(dmu_buf_t
*db
)
3607 dmu_buf_impl_t
*dbi
= (dmu_buf_impl_t
*)db
;
3608 DB_DNODE_ENTER(dbi
);
3609 return (DB_DNODE(dbi
));
3613 dmu_buf_dnode_exit(dmu_buf_t
*db
)
3615 dmu_buf_impl_t
*dbi
= (dmu_buf_impl_t
*)db
;
3620 dbuf_check_blkptr(dnode_t
*dn
, dmu_buf_impl_t
*db
)
3622 /* ASSERT(dmu_tx_is_syncing(tx) */
3623 ASSERT(MUTEX_HELD(&db
->db_mtx
));
3625 if (db
->db_blkptr
!= NULL
)
3628 if (db
->db_blkid
== DMU_SPILL_BLKID
) {
3629 db
->db_blkptr
= DN_SPILL_BLKPTR(dn
->dn_phys
);
3630 BP_ZERO(db
->db_blkptr
);
3633 if (db
->db_level
== dn
->dn_phys
->dn_nlevels
-1) {
3635 * This buffer was allocated at a time when there was
3636 * no available blkptrs from the dnode, or it was
3637 * inappropriate to hook it in (i.e., nlevels mis-match).
3639 ASSERT(db
->db_blkid
< dn
->dn_phys
->dn_nblkptr
);
3640 ASSERT(db
->db_parent
== NULL
);
3641 db
->db_parent
= dn
->dn_dbuf
;
3642 db
->db_blkptr
= &dn
->dn_phys
->dn_blkptr
[db
->db_blkid
];
3645 dmu_buf_impl_t
*parent
= db
->db_parent
;
3646 int epbs
= dn
->dn_phys
->dn_indblkshift
- SPA_BLKPTRSHIFT
;
3648 ASSERT(dn
->dn_phys
->dn_nlevels
> 1);
3649 if (parent
== NULL
) {
3650 mutex_exit(&db
->db_mtx
);
3651 rw_enter(&dn
->dn_struct_rwlock
, RW_READER
);
3652 parent
= dbuf_hold_level(dn
, db
->db_level
+ 1,
3653 db
->db_blkid
>> epbs
, db
);
3654 rw_exit(&dn
->dn_struct_rwlock
);
3655 mutex_enter(&db
->db_mtx
);
3656 db
->db_parent
= parent
;
3658 db
->db_blkptr
= (blkptr_t
*)parent
->db
.db_data
+
3659 (db
->db_blkid
& ((1ULL << epbs
) - 1));
3665 * When syncing out a blocks of dnodes, adjust the block to deal with
3666 * encryption. Normally, we make sure the block is decrypted before writing
3667 * it. If we have crypt params, then we are writing a raw (encrypted) block,
3668 * from a raw receive. In this case, set the ARC buf's crypt params so
3669 * that the BP will be filled with the correct byteorder, salt, iv, and mac.
3672 dbuf_prepare_encrypted_dnode_leaf(dbuf_dirty_record_t
*dr
)
3675 dmu_buf_impl_t
*db
= dr
->dr_dbuf
;
3677 ASSERT(MUTEX_HELD(&db
->db_mtx
));
3678 ASSERT3U(db
->db
.db_object
, ==, DMU_META_DNODE_OBJECT
);
3679 ASSERT3U(db
->db_level
, ==, 0);
3681 if (!db
->db_objset
->os_raw_receive
&& arc_is_encrypted(db
->db_buf
)) {
3682 zbookmark_phys_t zb
;
3685 * Unfortunately, there is currently no mechanism for
3686 * syncing context to handle decryption errors. An error
3687 * here is only possible if an attacker maliciously
3688 * changed a dnode block and updated the associated
3689 * checksums going up the block tree.
3691 SET_BOOKMARK(&zb
, dmu_objset_id(db
->db_objset
),
3692 db
->db
.db_object
, db
->db_level
, db
->db_blkid
);
3693 err
= arc_untransform(db
->db_buf
, db
->db_objset
->os_spa
,
3696 panic("Invalid dnode block MAC");
3697 } else if (dr
->dt
.dl
.dr_has_raw_params
) {
3698 (void) arc_release(dr
->dt
.dl
.dr_data
, db
);
3699 arc_convert_to_raw(dr
->dt
.dl
.dr_data
,
3700 dmu_objset_id(db
->db_objset
),
3701 dr
->dt
.dl
.dr_byteorder
, DMU_OT_DNODE
,
3702 dr
->dt
.dl
.dr_salt
, dr
->dt
.dl
.dr_iv
, dr
->dt
.dl
.dr_mac
);
3707 * dbuf_sync_indirect() is called recursively from dbuf_sync_list() so it
3708 * is critical the we not allow the compiler to inline this function in to
3709 * dbuf_sync_list() thereby drastically bloating the stack usage.
3711 noinline
static void
3712 dbuf_sync_indirect(dbuf_dirty_record_t
*dr
, dmu_tx_t
*tx
)
3714 dmu_buf_impl_t
*db
= dr
->dr_dbuf
;
3718 ASSERT(dmu_tx_is_syncing(tx
));
3720 dprintf_dbuf_bp(db
, db
->db_blkptr
, "blkptr=%p", db
->db_blkptr
);
3722 mutex_enter(&db
->db_mtx
);
3724 ASSERT(db
->db_level
> 0);
3727 /* Read the block if it hasn't been read yet. */
3728 if (db
->db_buf
== NULL
) {
3729 mutex_exit(&db
->db_mtx
);
3730 (void) dbuf_read(db
, NULL
, DB_RF_MUST_SUCCEED
);
3731 mutex_enter(&db
->db_mtx
);
3733 ASSERT3U(db
->db_state
, ==, DB_CACHED
);
3734 ASSERT(db
->db_buf
!= NULL
);
3738 /* Indirect block size must match what the dnode thinks it is. */
3739 ASSERT3U(db
->db
.db_size
, ==, 1<<dn
->dn_phys
->dn_indblkshift
);
3740 dbuf_check_blkptr(dn
, db
);
3743 /* Provide the pending dirty record to child dbufs */
3744 db
->db_data_pending
= dr
;
3746 mutex_exit(&db
->db_mtx
);
3748 dbuf_write(dr
, db
->db_buf
, tx
);
3751 mutex_enter(&dr
->dt
.di
.dr_mtx
);
3752 dbuf_sync_list(&dr
->dt
.di
.dr_children
, db
->db_level
- 1, tx
);
3753 ASSERT(list_head(&dr
->dt
.di
.dr_children
) == NULL
);
3754 mutex_exit(&dr
->dt
.di
.dr_mtx
);
3759 * dbuf_sync_leaf() is called recursively from dbuf_sync_list() so it is
3760 * critical the we not allow the compiler to inline this function in to
3761 * dbuf_sync_list() thereby drastically bloating the stack usage.
3763 noinline
static void
3764 dbuf_sync_leaf(dbuf_dirty_record_t
*dr
, dmu_tx_t
*tx
)
3766 arc_buf_t
**datap
= &dr
->dt
.dl
.dr_data
;
3767 dmu_buf_impl_t
*db
= dr
->dr_dbuf
;
3770 uint64_t txg
= tx
->tx_txg
;
3772 ASSERT(dmu_tx_is_syncing(tx
));
3774 dprintf_dbuf_bp(db
, db
->db_blkptr
, "blkptr=%p", db
->db_blkptr
);
3776 mutex_enter(&db
->db_mtx
);
3778 * To be synced, we must be dirtied. But we
3779 * might have been freed after the dirty.
3781 if (db
->db_state
== DB_UNCACHED
) {
3782 /* This buffer has been freed since it was dirtied */
3783 ASSERT(db
->db
.db_data
== NULL
);
3784 } else if (db
->db_state
== DB_FILL
) {
3785 /* This buffer was freed and is now being re-filled */
3786 ASSERT(db
->db
.db_data
!= dr
->dt
.dl
.dr_data
);
3788 ASSERT(db
->db_state
== DB_CACHED
|| db
->db_state
== DB_NOFILL
);
3795 if (db
->db_blkid
== DMU_SPILL_BLKID
) {
3796 mutex_enter(&dn
->dn_mtx
);
3797 if (!(dn
->dn_phys
->dn_flags
& DNODE_FLAG_SPILL_BLKPTR
)) {
3799 * In the previous transaction group, the bonus buffer
3800 * was entirely used to store the attributes for the
3801 * dnode which overrode the dn_spill field. However,
3802 * when adding more attributes to the file a spill
3803 * block was required to hold the extra attributes.
3805 * Make sure to clear the garbage left in the dn_spill
3806 * field from the previous attributes in the bonus
3807 * buffer. Otherwise, after writing out the spill
3808 * block to the new allocated dva, it will free
3809 * the old block pointed to by the invalid dn_spill.
3811 db
->db_blkptr
= NULL
;
3813 dn
->dn_phys
->dn_flags
|= DNODE_FLAG_SPILL_BLKPTR
;
3814 mutex_exit(&dn
->dn_mtx
);
3818 * If this is a bonus buffer, simply copy the bonus data into the
3819 * dnode. It will be written out when the dnode is synced (and it
3820 * will be synced, since it must have been dirty for dbuf_sync to
3823 if (db
->db_blkid
== DMU_BONUS_BLKID
) {
3824 dbuf_dirty_record_t
**drp
;
3826 ASSERT(*datap
!= NULL
);
3827 ASSERT0(db
->db_level
);
3828 ASSERT3U(DN_MAX_BONUS_LEN(dn
->dn_phys
), <=,
3829 DN_SLOTS_TO_BONUSLEN(dn
->dn_phys
->dn_extra_slots
+ 1));
3830 bcopy(*datap
, DN_BONUS(dn
->dn_phys
),
3831 DN_MAX_BONUS_LEN(dn
->dn_phys
));
3834 if (*datap
!= db
->db
.db_data
) {
3835 int slots
= DB_DNODE(db
)->dn_num_slots
;
3836 int bonuslen
= DN_SLOTS_TO_BONUSLEN(slots
);
3837 kmem_free(*datap
, bonuslen
);
3838 arc_space_return(bonuslen
, ARC_SPACE_BONUS
);
3840 db
->db_data_pending
= NULL
;
3841 drp
= &db
->db_last_dirty
;
3843 drp
= &(*drp
)->dr_next
;
3844 ASSERT(dr
->dr_next
== NULL
);
3845 ASSERT(dr
->dr_dbuf
== db
);
3847 if (dr
->dr_dbuf
->db_level
!= 0) {
3848 mutex_destroy(&dr
->dt
.di
.dr_mtx
);
3849 list_destroy(&dr
->dt
.di
.dr_children
);
3851 kmem_free(dr
, sizeof (dbuf_dirty_record_t
));
3852 ASSERT(db
->db_dirtycnt
> 0);
3853 db
->db_dirtycnt
-= 1;
3854 dbuf_rele_and_unlock(db
, (void *)(uintptr_t)txg
, B_FALSE
);
3861 * This function may have dropped the db_mtx lock allowing a dmu_sync
3862 * operation to sneak in. As a result, we need to ensure that we
3863 * don't check the dr_override_state until we have returned from
3864 * dbuf_check_blkptr.
3866 dbuf_check_blkptr(dn
, db
);
3869 * If this buffer is in the middle of an immediate write,
3870 * wait for the synchronous IO to complete.
3872 while (dr
->dt
.dl
.dr_override_state
== DR_IN_DMU_SYNC
) {
3873 ASSERT(dn
->dn_object
!= DMU_META_DNODE_OBJECT
);
3874 cv_wait(&db
->db_changed
, &db
->db_mtx
);
3875 ASSERT(dr
->dt
.dl
.dr_override_state
!= DR_NOT_OVERRIDDEN
);
3879 * If this is a dnode block, ensure it is appropriately encrypted
3880 * or decrypted, depending on what we are writing to it this txg.
3882 if (os
->os_encrypted
&& dn
->dn_object
== DMU_META_DNODE_OBJECT
)
3883 dbuf_prepare_encrypted_dnode_leaf(dr
);
3885 if (db
->db_state
!= DB_NOFILL
&&
3886 dn
->dn_object
!= DMU_META_DNODE_OBJECT
&&
3887 refcount_count(&db
->db_holds
) > 1 &&
3888 dr
->dt
.dl
.dr_override_state
!= DR_OVERRIDDEN
&&
3889 *datap
== db
->db_buf
) {
3891 * If this buffer is currently "in use" (i.e., there
3892 * are active holds and db_data still references it),
3893 * then make a copy before we start the write so that
3894 * any modifications from the open txg will not leak
3897 * NOTE: this copy does not need to be made for
3898 * objects only modified in the syncing context (e.g.
3899 * DNONE_DNODE blocks).
3901 int psize
= arc_buf_size(*datap
);
3902 int lsize
= arc_buf_lsize(*datap
);
3903 arc_buf_contents_t type
= DBUF_GET_BUFC_TYPE(db
);
3904 enum zio_compress compress_type
= arc_get_compression(*datap
);
3906 if (arc_is_encrypted(*datap
)) {
3907 boolean_t byteorder
;
3908 uint8_t salt
[ZIO_DATA_SALT_LEN
];
3909 uint8_t iv
[ZIO_DATA_IV_LEN
];
3910 uint8_t mac
[ZIO_DATA_MAC_LEN
];
3912 arc_get_raw_params(*datap
, &byteorder
, salt
, iv
, mac
);
3913 *datap
= arc_alloc_raw_buf(os
->os_spa
, db
,
3914 dmu_objset_id(os
), byteorder
, salt
, iv
, mac
,
3915 dn
->dn_type
, psize
, lsize
, compress_type
);
3916 } else if (compress_type
!= ZIO_COMPRESS_OFF
) {
3917 ASSERT3U(type
, ==, ARC_BUFC_DATA
);
3918 *datap
= arc_alloc_compressed_buf(os
->os_spa
, db
,
3919 psize
, lsize
, compress_type
);
3921 *datap
= arc_alloc_buf(os
->os_spa
, db
, type
, psize
);
3923 bcopy(db
->db
.db_data
, (*datap
)->b_data
, psize
);
3925 db
->db_data_pending
= dr
;
3927 mutex_exit(&db
->db_mtx
);
3929 dbuf_write(dr
, *datap
, tx
);
3931 ASSERT(!list_link_active(&dr
->dr_dirty_node
));
3932 if (dn
->dn_object
== DMU_META_DNODE_OBJECT
) {
3933 list_insert_tail(&dn
->dn_dirty_records
[txg
&TXG_MASK
], dr
);
3937 * Although zio_nowait() does not "wait for an IO", it does
3938 * initiate the IO. If this is an empty write it seems plausible
3939 * that the IO could actually be completed before the nowait
3940 * returns. We need to DB_DNODE_EXIT() first in case
3941 * zio_nowait() invalidates the dbuf.
3944 zio_nowait(dr
->dr_zio
);
3949 dbuf_sync_list(list_t
*list
, int level
, dmu_tx_t
*tx
)
3951 dbuf_dirty_record_t
*dr
;
3953 while ((dr
= list_head(list
))) {
3954 if (dr
->dr_zio
!= NULL
) {
3956 * If we find an already initialized zio then we
3957 * are processing the meta-dnode, and we have finished.
3958 * The dbufs for all dnodes are put back on the list
3959 * during processing, so that we can zio_wait()
3960 * these IOs after initiating all child IOs.
3962 ASSERT3U(dr
->dr_dbuf
->db
.db_object
, ==,
3963 DMU_META_DNODE_OBJECT
);
3966 if (dr
->dr_dbuf
->db_blkid
!= DMU_BONUS_BLKID
&&
3967 dr
->dr_dbuf
->db_blkid
!= DMU_SPILL_BLKID
) {
3968 VERIFY3U(dr
->dr_dbuf
->db_level
, ==, level
);
3970 list_remove(list
, dr
);
3971 if (dr
->dr_dbuf
->db_level
> 0)
3972 dbuf_sync_indirect(dr
, tx
);
3974 dbuf_sync_leaf(dr
, tx
);
3980 dbuf_write_ready(zio_t
*zio
, arc_buf_t
*buf
, void *vdb
)
3982 dmu_buf_impl_t
*db
= vdb
;
3984 blkptr_t
*bp
= zio
->io_bp
;
3985 blkptr_t
*bp_orig
= &zio
->io_bp_orig
;
3986 spa_t
*spa
= zio
->io_spa
;
3991 ASSERT3P(db
->db_blkptr
, !=, NULL
);
3992 ASSERT3P(&db
->db_data_pending
->dr_bp_copy
, ==, bp
);
3996 delta
= bp_get_dsize_sync(spa
, bp
) - bp_get_dsize_sync(spa
, bp_orig
);
3997 dnode_diduse_space(dn
, delta
- zio
->io_prev_space_delta
);
3998 zio
->io_prev_space_delta
= delta
;
4000 if (bp
->blk_birth
!= 0) {
4001 ASSERT((db
->db_blkid
!= DMU_SPILL_BLKID
&&
4002 BP_GET_TYPE(bp
) == dn
->dn_type
) ||
4003 (db
->db_blkid
== DMU_SPILL_BLKID
&&
4004 BP_GET_TYPE(bp
) == dn
->dn_bonustype
) ||
4005 BP_IS_EMBEDDED(bp
));
4006 ASSERT(BP_GET_LEVEL(bp
) == db
->db_level
);
4009 mutex_enter(&db
->db_mtx
);
4012 if (db
->db_blkid
== DMU_SPILL_BLKID
) {
4013 ASSERT(dn
->dn_phys
->dn_flags
& DNODE_FLAG_SPILL_BLKPTR
);
4014 ASSERT(!(BP_IS_HOLE(bp
)) &&
4015 db
->db_blkptr
== DN_SPILL_BLKPTR(dn
->dn_phys
));
4019 if (db
->db_level
== 0) {
4020 mutex_enter(&dn
->dn_mtx
);
4021 if (db
->db_blkid
> dn
->dn_phys
->dn_maxblkid
&&
4022 db
->db_blkid
!= DMU_SPILL_BLKID
) {
4023 ASSERT0(db
->db_objset
->os_raw_receive
);
4024 dn
->dn_phys
->dn_maxblkid
= db
->db_blkid
;
4026 mutex_exit(&dn
->dn_mtx
);
4028 if (dn
->dn_type
== DMU_OT_DNODE
) {
4030 while (i
< db
->db
.db_size
) {
4032 (void *)(((char *)db
->db
.db_data
) + i
);
4034 i
+= DNODE_MIN_SIZE
;
4035 if (dnp
->dn_type
!= DMU_OT_NONE
) {
4037 i
+= dnp
->dn_extra_slots
*
4042 if (BP_IS_HOLE(bp
)) {
4049 blkptr_t
*ibp
= db
->db
.db_data
;
4050 ASSERT3U(db
->db
.db_size
, ==, 1<<dn
->dn_phys
->dn_indblkshift
);
4051 for (i
= db
->db
.db_size
>> SPA_BLKPTRSHIFT
; i
> 0; i
--, ibp
++) {
4052 if (BP_IS_HOLE(ibp
))
4054 fill
+= BP_GET_FILL(ibp
);
4059 if (!BP_IS_EMBEDDED(bp
))
4060 BP_SET_FILL(bp
, fill
);
4062 mutex_exit(&db
->db_mtx
);
4064 rw_enter(&dn
->dn_struct_rwlock
, RW_WRITER
);
4065 *db
->db_blkptr
= *bp
;
4066 rw_exit(&dn
->dn_struct_rwlock
);
4071 * This function gets called just prior to running through the compression
4072 * stage of the zio pipeline. If we're an indirect block comprised of only
4073 * holes, then we want this indirect to be compressed away to a hole. In
4074 * order to do that we must zero out any information about the holes that
4075 * this indirect points to prior to before we try to compress it.
4078 dbuf_write_children_ready(zio_t
*zio
, arc_buf_t
*buf
, void *vdb
)
4080 dmu_buf_impl_t
*db
= vdb
;
4083 unsigned int epbs
, i
;
4085 ASSERT3U(db
->db_level
, >, 0);
4088 epbs
= dn
->dn_phys
->dn_indblkshift
- SPA_BLKPTRSHIFT
;
4089 ASSERT3U(epbs
, <, 31);
4091 /* Determine if all our children are holes */
4092 for (i
= 0, bp
= db
->db
.db_data
; i
< 1ULL << epbs
; i
++, bp
++) {
4093 if (!BP_IS_HOLE(bp
))
4098 * If all the children are holes, then zero them all out so that
4099 * we may get compressed away.
4101 if (i
== 1ULL << epbs
) {
4103 * We only found holes. Grab the rwlock to prevent
4104 * anybody from reading the blocks we're about to
4107 rw_enter(&dn
->dn_struct_rwlock
, RW_WRITER
);
4108 bzero(db
->db
.db_data
, db
->db
.db_size
);
4109 rw_exit(&dn
->dn_struct_rwlock
);
4115 * The SPA will call this callback several times for each zio - once
4116 * for every physical child i/o (zio->io_phys_children times). This
4117 * allows the DMU to monitor the progress of each logical i/o. For example,
4118 * there may be 2 copies of an indirect block, or many fragments of a RAID-Z
4119 * block. There may be a long delay before all copies/fragments are completed,
4120 * so this callback allows us to retire dirty space gradually, as the physical
4125 dbuf_write_physdone(zio_t
*zio
, arc_buf_t
*buf
, void *arg
)
4127 dmu_buf_impl_t
*db
= arg
;
4128 objset_t
*os
= db
->db_objset
;
4129 dsl_pool_t
*dp
= dmu_objset_pool(os
);
4130 dbuf_dirty_record_t
*dr
;
4133 dr
= db
->db_data_pending
;
4134 ASSERT3U(dr
->dr_txg
, ==, zio
->io_txg
);
4137 * The callback will be called io_phys_children times. Retire one
4138 * portion of our dirty space each time we are called. Any rounding
4139 * error will be cleaned up by dsl_pool_sync()'s call to
4140 * dsl_pool_undirty_space().
4142 delta
= dr
->dr_accounted
/ zio
->io_phys_children
;
4143 dsl_pool_undirty_space(dp
, delta
, zio
->io_txg
);
4148 dbuf_write_done(zio_t
*zio
, arc_buf_t
*buf
, void *vdb
)
4150 dmu_buf_impl_t
*db
= vdb
;
4151 blkptr_t
*bp_orig
= &zio
->io_bp_orig
;
4152 blkptr_t
*bp
= db
->db_blkptr
;
4153 objset_t
*os
= db
->db_objset
;
4154 dmu_tx_t
*tx
= os
->os_synctx
;
4155 dbuf_dirty_record_t
**drp
, *dr
;
4157 ASSERT0(zio
->io_error
);
4158 ASSERT(db
->db_blkptr
== bp
);
4161 * For nopwrites and rewrites we ensure that the bp matches our
4162 * original and bypass all the accounting.
4164 if (zio
->io_flags
& (ZIO_FLAG_IO_REWRITE
| ZIO_FLAG_NOPWRITE
)) {
4165 ASSERT(BP_EQUAL(bp
, bp_orig
));
4167 dsl_dataset_t
*ds
= os
->os_dsl_dataset
;
4168 (void) dsl_dataset_block_kill(ds
, bp_orig
, tx
, B_TRUE
);
4169 dsl_dataset_block_born(ds
, bp
, tx
);
4172 mutex_enter(&db
->db_mtx
);
4176 drp
= &db
->db_last_dirty
;
4177 while ((dr
= *drp
) != db
->db_data_pending
)
4179 ASSERT(!list_link_active(&dr
->dr_dirty_node
));
4180 ASSERT(dr
->dr_dbuf
== db
);
4181 ASSERT(dr
->dr_next
== NULL
);
4185 if (db
->db_blkid
== DMU_SPILL_BLKID
) {
4190 ASSERT(dn
->dn_phys
->dn_flags
& DNODE_FLAG_SPILL_BLKPTR
);
4191 ASSERT(!(BP_IS_HOLE(db
->db_blkptr
)) &&
4192 db
->db_blkptr
== DN_SPILL_BLKPTR(dn
->dn_phys
));
4197 if (db
->db_level
== 0) {
4198 ASSERT(db
->db_blkid
!= DMU_BONUS_BLKID
);
4199 ASSERT(dr
->dt
.dl
.dr_override_state
== DR_NOT_OVERRIDDEN
);
4200 if (db
->db_state
!= DB_NOFILL
) {
4201 if (dr
->dt
.dl
.dr_data
!= db
->db_buf
)
4202 arc_buf_destroy(dr
->dt
.dl
.dr_data
, db
);
4209 ASSERT(list_head(&dr
->dt
.di
.dr_children
) == NULL
);
4210 ASSERT3U(db
->db
.db_size
, ==, 1 << dn
->dn_phys
->dn_indblkshift
);
4211 if (!BP_IS_HOLE(db
->db_blkptr
)) {
4212 ASSERTV(int epbs
= dn
->dn_phys
->dn_indblkshift
-
4214 ASSERT3U(db
->db_blkid
, <=,
4215 dn
->dn_phys
->dn_maxblkid
>> (db
->db_level
* epbs
));
4216 ASSERT3U(BP_GET_LSIZE(db
->db_blkptr
), ==,
4220 mutex_destroy(&dr
->dt
.di
.dr_mtx
);
4221 list_destroy(&dr
->dt
.di
.dr_children
);
4223 kmem_free(dr
, sizeof (dbuf_dirty_record_t
));
4225 cv_broadcast(&db
->db_changed
);
4226 ASSERT(db
->db_dirtycnt
> 0);
4227 db
->db_dirtycnt
-= 1;
4228 db
->db_data_pending
= NULL
;
4229 dbuf_rele_and_unlock(db
, (void *)(uintptr_t)tx
->tx_txg
, B_FALSE
);
4233 dbuf_write_nofill_ready(zio_t
*zio
)
4235 dbuf_write_ready(zio
, NULL
, zio
->io_private
);
4239 dbuf_write_nofill_done(zio_t
*zio
)
4241 dbuf_write_done(zio
, NULL
, zio
->io_private
);
4245 dbuf_write_override_ready(zio_t
*zio
)
4247 dbuf_dirty_record_t
*dr
= zio
->io_private
;
4248 dmu_buf_impl_t
*db
= dr
->dr_dbuf
;
4250 dbuf_write_ready(zio
, NULL
, db
);
4254 dbuf_write_override_done(zio_t
*zio
)
4256 dbuf_dirty_record_t
*dr
= zio
->io_private
;
4257 dmu_buf_impl_t
*db
= dr
->dr_dbuf
;
4258 blkptr_t
*obp
= &dr
->dt
.dl
.dr_overridden_by
;
4260 mutex_enter(&db
->db_mtx
);
4261 if (!BP_EQUAL(zio
->io_bp
, obp
)) {
4262 if (!BP_IS_HOLE(obp
))
4263 dsl_free(spa_get_dsl(zio
->io_spa
), zio
->io_txg
, obp
);
4264 arc_release(dr
->dt
.dl
.dr_data
, db
);
4266 mutex_exit(&db
->db_mtx
);
4268 dbuf_write_done(zio
, NULL
, db
);
4270 if (zio
->io_abd
!= NULL
)
4271 abd_put(zio
->io_abd
);
4274 typedef struct dbuf_remap_impl_callback_arg
{
4276 uint64_t drica_blk_birth
;
4278 } dbuf_remap_impl_callback_arg_t
;
4281 dbuf_remap_impl_callback(uint64_t vdev
, uint64_t offset
, uint64_t size
,
4284 dbuf_remap_impl_callback_arg_t
*drica
= arg
;
4285 objset_t
*os
= drica
->drica_os
;
4286 spa_t
*spa
= dmu_objset_spa(os
);
4287 dmu_tx_t
*tx
= drica
->drica_tx
;
4289 ASSERT(dsl_pool_sync_context(spa_get_dsl(spa
)));
4291 if (os
== spa_meta_objset(spa
)) {
4292 spa_vdev_indirect_mark_obsolete(spa
, vdev
, offset
, size
, tx
);
4294 dsl_dataset_block_remapped(dmu_objset_ds(os
), vdev
, offset
,
4295 size
, drica
->drica_blk_birth
, tx
);
4300 dbuf_remap_impl(dnode_t
*dn
, blkptr_t
*bp
, dmu_tx_t
*tx
)
4302 blkptr_t bp_copy
= *bp
;
4303 spa_t
*spa
= dmu_objset_spa(dn
->dn_objset
);
4304 dbuf_remap_impl_callback_arg_t drica
;
4306 ASSERT(dsl_pool_sync_context(spa_get_dsl(spa
)));
4308 drica
.drica_os
= dn
->dn_objset
;
4309 drica
.drica_blk_birth
= bp
->blk_birth
;
4310 drica
.drica_tx
= tx
;
4311 if (spa_remap_blkptr(spa
, &bp_copy
, dbuf_remap_impl_callback
,
4314 * The struct_rwlock prevents dbuf_read_impl() from
4315 * dereferencing the BP while we are changing it. To
4316 * avoid lock contention, only grab it when we are actually
4319 rw_enter(&dn
->dn_struct_rwlock
, RW_WRITER
);
4321 rw_exit(&dn
->dn_struct_rwlock
);
4326 * Returns true if a dbuf_remap would modify the dbuf. We do this by attempting
4327 * to remap a copy of every bp in the dbuf.
4330 dbuf_can_remap(const dmu_buf_impl_t
*db
)
4332 spa_t
*spa
= dmu_objset_spa(db
->db_objset
);
4333 blkptr_t
*bp
= db
->db
.db_data
;
4334 boolean_t ret
= B_FALSE
;
4336 ASSERT3U(db
->db_level
, >, 0);
4337 ASSERT3S(db
->db_state
, ==, DB_CACHED
);
4339 ASSERT(spa_feature_is_active(spa
, SPA_FEATURE_DEVICE_REMOVAL
));
4341 spa_config_enter(spa
, SCL_VDEV
, FTAG
, RW_READER
);
4342 for (int i
= 0; i
< db
->db
.db_size
>> SPA_BLKPTRSHIFT
; i
++) {
4343 blkptr_t bp_copy
= bp
[i
];
4344 if (spa_remap_blkptr(spa
, &bp_copy
, NULL
, NULL
)) {
4349 spa_config_exit(spa
, SCL_VDEV
, FTAG
);
4355 dnode_needs_remap(const dnode_t
*dn
)
4357 spa_t
*spa
= dmu_objset_spa(dn
->dn_objset
);
4358 boolean_t ret
= B_FALSE
;
4360 if (dn
->dn_phys
->dn_nlevels
== 0) {
4364 ASSERT(spa_feature_is_active(spa
, SPA_FEATURE_DEVICE_REMOVAL
));
4366 spa_config_enter(spa
, SCL_VDEV
, FTAG
, RW_READER
);
4367 for (int j
= 0; j
< dn
->dn_phys
->dn_nblkptr
; j
++) {
4368 blkptr_t bp_copy
= dn
->dn_phys
->dn_blkptr
[j
];
4369 if (spa_remap_blkptr(spa
, &bp_copy
, NULL
, NULL
)) {
4374 spa_config_exit(spa
, SCL_VDEV
, FTAG
);
4380 * Remap any existing BP's to concrete vdevs, if possible.
4383 dbuf_remap(dnode_t
*dn
, dmu_buf_impl_t
*db
, dmu_tx_t
*tx
)
4385 spa_t
*spa
= dmu_objset_spa(db
->db_objset
);
4386 ASSERT(dsl_pool_sync_context(spa_get_dsl(spa
)));
4388 if (!spa_feature_is_active(spa
, SPA_FEATURE_DEVICE_REMOVAL
))
4391 if (db
->db_level
> 0) {
4392 blkptr_t
*bp
= db
->db
.db_data
;
4393 for (int i
= 0; i
< db
->db
.db_size
>> SPA_BLKPTRSHIFT
; i
++) {
4394 dbuf_remap_impl(dn
, &bp
[i
], tx
);
4396 } else if (db
->db
.db_object
== DMU_META_DNODE_OBJECT
) {
4397 dnode_phys_t
*dnp
= db
->db
.db_data
;
4398 ASSERT3U(db
->db_dnode_handle
->dnh_dnode
->dn_type
, ==,
4400 for (int i
= 0; i
< db
->db
.db_size
>> DNODE_SHIFT
;
4401 i
+= dnp
[i
].dn_extra_slots
+ 1) {
4402 for (int j
= 0; j
< dnp
[i
].dn_nblkptr
; j
++) {
4403 dbuf_remap_impl(dn
, &dnp
[i
].dn_blkptr
[j
], tx
);
4410 /* Issue I/O to commit a dirty buffer to disk. */
4412 dbuf_write(dbuf_dirty_record_t
*dr
, arc_buf_t
*data
, dmu_tx_t
*tx
)
4414 dmu_buf_impl_t
*db
= dr
->dr_dbuf
;
4417 dmu_buf_impl_t
*parent
= db
->db_parent
;
4418 uint64_t txg
= tx
->tx_txg
;
4419 zbookmark_phys_t zb
;
4424 ASSERT(dmu_tx_is_syncing(tx
));
4430 if (db
->db_state
!= DB_NOFILL
) {
4431 if (db
->db_level
> 0 || dn
->dn_type
== DMU_OT_DNODE
) {
4433 * Private object buffers are released here rather
4434 * than in dbuf_dirty() since they are only modified
4435 * in the syncing context and we don't want the
4436 * overhead of making multiple copies of the data.
4438 if (BP_IS_HOLE(db
->db_blkptr
)) {
4441 dbuf_release_bp(db
);
4443 dbuf_remap(dn
, db
, tx
);
4447 if (parent
!= dn
->dn_dbuf
) {
4448 /* Our parent is an indirect block. */
4449 /* We have a dirty parent that has been scheduled for write. */
4450 ASSERT(parent
&& parent
->db_data_pending
);
4451 /* Our parent's buffer is one level closer to the dnode. */
4452 ASSERT(db
->db_level
== parent
->db_level
-1);
4454 * We're about to modify our parent's db_data by modifying
4455 * our block pointer, so the parent must be released.
4457 ASSERT(arc_released(parent
->db_buf
));
4458 zio
= parent
->db_data_pending
->dr_zio
;
4460 /* Our parent is the dnode itself. */
4461 ASSERT((db
->db_level
== dn
->dn_phys
->dn_nlevels
-1 &&
4462 db
->db_blkid
!= DMU_SPILL_BLKID
) ||
4463 (db
->db_blkid
== DMU_SPILL_BLKID
&& db
->db_level
== 0));
4464 if (db
->db_blkid
!= DMU_SPILL_BLKID
)
4465 ASSERT3P(db
->db_blkptr
, ==,
4466 &dn
->dn_phys
->dn_blkptr
[db
->db_blkid
]);
4470 ASSERT(db
->db_level
== 0 || data
== db
->db_buf
);
4471 ASSERT3U(db
->db_blkptr
->blk_birth
, <=, txg
);
4474 SET_BOOKMARK(&zb
, os
->os_dsl_dataset
?
4475 os
->os_dsl_dataset
->ds_object
: DMU_META_OBJSET
,
4476 db
->db
.db_object
, db
->db_level
, db
->db_blkid
);
4478 if (db
->db_blkid
== DMU_SPILL_BLKID
)
4480 wp_flag
|= (db
->db_state
== DB_NOFILL
) ? WP_NOFILL
: 0;
4482 dmu_write_policy(os
, dn
, db
->db_level
, wp_flag
, &zp
);
4486 * We copy the blkptr now (rather than when we instantiate the dirty
4487 * record), because its value can change between open context and
4488 * syncing context. We do not need to hold dn_struct_rwlock to read
4489 * db_blkptr because we are in syncing context.
4491 dr
->dr_bp_copy
= *db
->db_blkptr
;
4493 if (db
->db_level
== 0 &&
4494 dr
->dt
.dl
.dr_override_state
== DR_OVERRIDDEN
) {
4496 * The BP for this block has been provided by open context
4497 * (by dmu_sync() or dmu_buf_write_embedded()).
4499 abd_t
*contents
= (data
!= NULL
) ?
4500 abd_get_from_buf(data
->b_data
, arc_buf_size(data
)) : NULL
;
4502 dr
->dr_zio
= zio_write(zio
, os
->os_spa
, txg
,
4503 &dr
->dr_bp_copy
, contents
, db
->db
.db_size
, db
->db
.db_size
,
4504 &zp
, dbuf_write_override_ready
, NULL
, NULL
,
4505 dbuf_write_override_done
,
4506 dr
, ZIO_PRIORITY_ASYNC_WRITE
, ZIO_FLAG_MUSTSUCCEED
, &zb
);
4507 mutex_enter(&db
->db_mtx
);
4508 dr
->dt
.dl
.dr_override_state
= DR_NOT_OVERRIDDEN
;
4509 zio_write_override(dr
->dr_zio
, &dr
->dt
.dl
.dr_overridden_by
,
4510 dr
->dt
.dl
.dr_copies
, dr
->dt
.dl
.dr_nopwrite
);
4511 mutex_exit(&db
->db_mtx
);
4512 } else if (db
->db_state
== DB_NOFILL
) {
4513 ASSERT(zp
.zp_checksum
== ZIO_CHECKSUM_OFF
||
4514 zp
.zp_checksum
== ZIO_CHECKSUM_NOPARITY
);
4515 dr
->dr_zio
= zio_write(zio
, os
->os_spa
, txg
,
4516 &dr
->dr_bp_copy
, NULL
, db
->db
.db_size
, db
->db
.db_size
, &zp
,
4517 dbuf_write_nofill_ready
, NULL
, NULL
,
4518 dbuf_write_nofill_done
, db
,
4519 ZIO_PRIORITY_ASYNC_WRITE
,
4520 ZIO_FLAG_MUSTSUCCEED
| ZIO_FLAG_NODATA
, &zb
);
4522 ASSERT(arc_released(data
));
4525 * For indirect blocks, we want to setup the children
4526 * ready callback so that we can properly handle an indirect
4527 * block that only contains holes.
4529 arc_write_done_func_t
*children_ready_cb
= NULL
;
4530 if (db
->db_level
!= 0)
4531 children_ready_cb
= dbuf_write_children_ready
;
4533 dr
->dr_zio
= arc_write(zio
, os
->os_spa
, txg
,
4534 &dr
->dr_bp_copy
, data
, DBUF_IS_L2CACHEABLE(db
),
4535 &zp
, dbuf_write_ready
,
4536 children_ready_cb
, dbuf_write_physdone
,
4537 dbuf_write_done
, db
, ZIO_PRIORITY_ASYNC_WRITE
,
4538 ZIO_FLAG_MUSTSUCCEED
, &zb
);
4542 #if defined(_KERNEL)
4543 EXPORT_SYMBOL(dbuf_find
);
4544 EXPORT_SYMBOL(dbuf_is_metadata
);
4545 EXPORT_SYMBOL(dbuf_destroy
);
4546 EXPORT_SYMBOL(dbuf_loan_arcbuf
);
4547 EXPORT_SYMBOL(dbuf_whichblock
);
4548 EXPORT_SYMBOL(dbuf_read
);
4549 EXPORT_SYMBOL(dbuf_unoverride
);
4550 EXPORT_SYMBOL(dbuf_free_range
);
4551 EXPORT_SYMBOL(dbuf_new_size
);
4552 EXPORT_SYMBOL(dbuf_release_bp
);
4553 EXPORT_SYMBOL(dbuf_dirty
);
4554 EXPORT_SYMBOL(dmu_buf_set_crypt_params
);
4555 EXPORT_SYMBOL(dmu_buf_will_dirty
);
4556 EXPORT_SYMBOL(dmu_buf_will_not_fill
);
4557 EXPORT_SYMBOL(dmu_buf_will_fill
);
4558 EXPORT_SYMBOL(dmu_buf_fill_done
);
4559 EXPORT_SYMBOL(dmu_buf_rele
);
4560 EXPORT_SYMBOL(dbuf_assign_arcbuf
);
4561 EXPORT_SYMBOL(dbuf_prefetch
);
4562 EXPORT_SYMBOL(dbuf_hold_impl
);
4563 EXPORT_SYMBOL(dbuf_hold
);
4564 EXPORT_SYMBOL(dbuf_hold_level
);
4565 EXPORT_SYMBOL(dbuf_create_bonus
);
4566 EXPORT_SYMBOL(dbuf_spill_set_blksz
);
4567 EXPORT_SYMBOL(dbuf_rm_spill
);
4568 EXPORT_SYMBOL(dbuf_add_ref
);
4569 EXPORT_SYMBOL(dbuf_rele
);
4570 EXPORT_SYMBOL(dbuf_rele_and_unlock
);
4571 EXPORT_SYMBOL(dbuf_refcount
);
4572 EXPORT_SYMBOL(dbuf_sync_list
);
4573 EXPORT_SYMBOL(dmu_buf_set_user
);
4574 EXPORT_SYMBOL(dmu_buf_set_user_ie
);
4575 EXPORT_SYMBOL(dmu_buf_get_user
);
4576 EXPORT_SYMBOL(dmu_buf_get_blkptr
);
4579 module_param(dbuf_cache_max_bytes
, ulong
, 0644);
4580 MODULE_PARM_DESC(dbuf_cache_max_bytes
,
4581 "Maximum size in bytes of the dbuf cache.");
4583 module_param(dbuf_cache_hiwater_pct
, uint
, 0644);
4584 MODULE_PARM_DESC(dbuf_cache_hiwater_pct
,
4585 "Percentage over dbuf_cache_max_bytes when dbufs must be evicted "
4588 module_param(dbuf_cache_lowater_pct
, uint
, 0644);
4589 MODULE_PARM_DESC(dbuf_cache_lowater_pct
,
4590 "Percentage below dbuf_cache_max_bytes when the evict thread stops "
4593 module_param(dbuf_metadata_cache_max_bytes
, ulong
, 0644);
4594 MODULE_PARM_DESC(dbuf_metadata_cache_max_bytes
,
4595 "Maximum size in bytes of the dbuf metadata cache.");
4597 module_param(dbuf_cache_shift
, int, 0644);
4598 MODULE_PARM_DESC(dbuf_cache_shift
,
4599 "Set the size of the dbuf cache to a log2 fraction of arc size.");
4601 module_param(dbuf_metadata_cache_shift
, int, 0644);
4602 MODULE_PARM_DESC(dbuf_cache_shift
,
4603 "Set the size of the dbuf metadata cache to a log2 fraction of "