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 https://opensource.org/licenses/CDDL-1.0.
10 * See the License for the specific language governing permissions
11 * and limitations under the License.
13 * When distributing Covered Code, include this CDDL HEADER in each
14 * file and include the License file at usr/src/OPENSOLARIS.LICENSE.
15 * If applicable, add the following below this CDDL HEADER, with the
16 * fields enclosed by brackets "[]" replaced with your own identifying
17 * information: Portions Copyright [yyyy] [name of copyright owner]
22 * Copyright (c) 2005, 2010, Oracle and/or its affiliates. All rights reserved.
23 * Copyright (c) 2012, 2020 by Delphix. All rights reserved.
24 * Copyright (c) 2013 by Saso Kiselkov. All rights reserved.
25 * Copyright (c) 2014 Spectra Logic Corporation, All rights reserved.
36 #include <sys/zfs_context.h>
37 #include <sys/zfs_refcount.h>
38 #include <sys/zrlock.h>
39 #include <sys/multilist.h>
48 * define flags for dbuf_read
51 #define DB_RF_MUST_SUCCEED (1 << 0)
52 #define DB_RF_CANFAIL (1 << 1)
53 #define DB_RF_HAVESTRUCT (1 << 2)
54 #define DB_RF_NOPREFETCH (1 << 3)
55 #define DB_RF_NEVERWAIT (1 << 4)
56 #define DB_RF_CACHED (1 << 5)
57 #define DB_RF_NO_DECRYPT (1 << 6)
58 #define DB_RF_PARTIAL_FIRST (1 << 7)
59 #define DB_RF_PARTIAL_MORE (1 << 8)
62 * The simplified state transition diagram for dbufs looks like:
64 * +-------> READ ------+
67 * (alloc)-->UNCACHED CACHED-->EVICTING-->(free)
70 * | +-------> FILL ------+ |
73 * | +------> NOFILL -----+-----> UNCACHED
77 * DB_SEARCH is an invalid state for a dbuf. It is used by dbuf_free_range
78 * to find all dbufs in a range of a dnode and must be less than any other
79 * dbuf_states_t (see comment on dn_dbufs in dnode.h).
81 typedef enum dbuf_states
{
92 typedef enum dbuf_cached_state
{
95 DB_DBUF_METADATA_CACHE
,
97 } dbuf_cached_state_t
;
103 * level = 0 means the user data
104 * level = 1 means the single indirect block
110 typedef enum override_states
{
116 typedef enum db_lock_type
{
122 typedef struct dbuf_dirty_record
{
123 /* link on our parents dirty list */
124 list_node_t dr_dirty_node
;
126 /* transaction group this data will sync in */
129 /* zio of outstanding write IO */
132 /* pointer back to our dbuf */
133 struct dmu_buf_impl
*dr_dbuf
;
135 /* list link for dbuf dirty records */
136 list_node_t dr_dbuf_node
;
139 * The dnode we are part of. Note that the dnode can not be moved or
140 * evicted due to the hold that's added by dnode_setdirty() or
141 * dmu_objset_sync_dnodes(), and released by dnode_rele_task() or
142 * userquota_updates_task(). This hold is necessary for
143 * dirty_lightweight_leaf-type dirty records, which don't have a hold
148 /* pointer to parent dirty record */
149 struct dbuf_dirty_record
*dr_parent
;
151 /* How much space was changed to dsl_pool_dirty_space() for this? */
152 unsigned int dr_accounted
;
154 /* A copy of the bp that points to us */
158 struct dirty_indirect
{
160 /* protect access to list */
163 /* Our list of dirty children */
169 * dr_data is set when we dirty the buffer
170 * so that we can retain the pointer even if it
171 * gets COW'd in a subsequent transaction group.
174 override_states_t dr_override_state
;
176 boolean_t dr_nopwrite
;
177 boolean_t dr_brtwrite
;
178 boolean_t dr_diowrite
;
179 boolean_t dr_has_raw_params
;
181 /* Override and raw params are mutually exclusive. */
183 blkptr_t dr_overridden_by
;
186 * If dr_has_raw_params is set, the
187 * following crypt params will be set
188 * on the BP that's written.
190 boolean_t dr_byteorder
;
191 uint8_t dr_salt
[ZIO_DATA_SALT_LEN
];
192 uint8_t dr_iv
[ZIO_DATA_IV_LEN
];
193 uint8_t dr_mac
[ZIO_DATA_MAC_LEN
];
197 struct dirty_lightweight_leaf
{
199 * This dirty record refers to a leaf (level=0)
200 * block, whose dbuf has not been instantiated for
201 * performance reasons.
209 } dbuf_dirty_record_t
;
211 typedef struct dmu_buf_impl
{
213 * The following members are immutable, with the exception of
214 * db.db_data, which is protected by db_mtx.
217 /* the publicly visible structure */
220 /* the objset we belong to */
221 struct objset
*db_objset
;
224 * Handle to safely access the dnode we belong to (NULL when evicted)
225 * if dnode_move() is used on the platform, or just dnode otherwise.
227 #if !defined(__linux__) && !defined(__FreeBSD__)
228 #define USE_DNODE_HANDLE 1
229 struct dnode_handle
*db_dnode_handle
;
231 struct dnode
*db_dnode
;
235 * our parent buffer; if the dnode points to us directly,
236 * db_parent == db_dnode_handle->dnh_dnode->dn_dbuf
237 * only accessed by sync thread ???
238 * (NULL when evicted)
239 * May change from NULL to non-NULL under the protection of db_mtx
240 * (see dbuf_check_blkptr())
242 struct dmu_buf_impl
*db_parent
;
245 * link for hash table of all dmu_buf_impl_t's
247 struct dmu_buf_impl
*db_hash_next
;
250 * Our link on the owner dnodes's dn_dbufs list.
251 * Protected by its dn_dbufs_mtx. Should be on the same cache line
252 * as db_level and db_blkid for the best avl_add() performance.
256 /* our block number */
260 * Pointer to the blkptr_t which points to us. May be NULL if we
261 * don't have one yet. (NULL when evicted)
266 * Our indirection level. Data buffers have db_level==0.
267 * Indirect buffers which point to data buffers have
268 * db_level==1. etc. Buffers which contain dnodes have
269 * db_level==0, since the dnodes are stored in a file.
273 /* This block was freed while a read or write was active. */
274 uint8_t db_freed_in_flight
;
277 * Evict user data as soon as the dirty and reference counts are equal.
279 uint8_t db_user_immediate_evict
;
282 * dnode_evict_dbufs() or dnode_evict_bonus() tried to evict this dbuf,
283 * but couldn't due to outstanding references. Evict once the refcount
286 uint8_t db_pending_evict
;
288 /* Number of TXGs in which this buffer is dirty. */
291 /* The buffer was partially read. More reads may follow. */
292 uint8_t db_partial_read
;
295 * Protects db_buf's contents if they contain an indirect block or data
296 * block of the meta-dnode. We use this lock to protect the structure of
297 * the block tree. This means that when modifying this dbuf's data, we
298 * grab its rwlock. When modifying its parent's data (including the
299 * blkptr to this dbuf), we grab the parent's rwlock. The lock ordering
301 * 1) dn_struct_rwlock
303 * We don't currently grab multiple dbufs' db_rwlocks at once.
307 /* buffer holding our data */
310 /* db_mtx protects the members below */
314 * Current state of the buffer
316 dbuf_states_t db_state
;
318 /* In which dbuf cache this dbuf is, if any. */
319 dbuf_cached_state_t db_caching_status
;
322 * Refcount accessed by dmu_buf_{hold,rele}.
323 * If nonzero, the buffer can't be destroyed.
324 * Protected by db_mtx.
326 zfs_refcount_t db_holds
;
328 kcondvar_t db_changed
;
329 dbuf_dirty_record_t
*db_data_pending
;
331 /* List of dirty records for the buffer sorted newest to oldest. */
332 list_t db_dirty_records
;
334 /* Link in dbuf_cache or dbuf_metadata_cache */
335 multilist_node_t db_cache_link
;
339 /* User callback information. */
340 dmu_buf_user_t
*db_user
;
343 #define DBUF_HASH_MUTEX(h, idx) \
344 (&(h)->hash_mutexes[(idx) & ((h)->hash_mutex_mask)])
346 typedef struct dbuf_hash_table
{
347 uint64_t hash_table_mask
;
348 uint64_t hash_mutex_mask
;
349 dmu_buf_impl_t
**hash_table
;
350 kmutex_t
*hash_mutexes
;
353 typedef void (*dbuf_prefetch_fn
)(void *, uint64_t, uint64_t, boolean_t
);
355 extern kmem_cache_t
*dbuf_dirty_kmem_cache
;
357 uint64_t dbuf_whichblock(const struct dnode
*di
, const int64_t level
,
358 const uint64_t offset
);
360 void dbuf_create_bonus(struct dnode
*dn
);
361 int dbuf_spill_set_blksz(dmu_buf_t
*db
, uint64_t blksz
, dmu_tx_t
*tx
);
363 void dbuf_rm_spill(struct dnode
*dn
, dmu_tx_t
*tx
);
365 dmu_buf_impl_t
*dbuf_hold(struct dnode
*dn
, uint64_t blkid
, const void *tag
);
366 dmu_buf_impl_t
*dbuf_hold_level(struct dnode
*dn
, int level
, uint64_t blkid
,
368 int dbuf_hold_impl(struct dnode
*dn
, uint8_t level
, uint64_t blkid
,
369 boolean_t fail_sparse
, boolean_t fail_uncached
,
370 const void *tag
, dmu_buf_impl_t
**dbp
);
372 int dbuf_prefetch_impl(struct dnode
*dn
, int64_t level
, uint64_t blkid
,
373 zio_priority_t prio
, arc_flags_t aflags
, dbuf_prefetch_fn cb
,
375 int dbuf_prefetch(struct dnode
*dn
, int64_t level
, uint64_t blkid
,
376 zio_priority_t prio
, arc_flags_t aflags
);
378 void dbuf_add_ref(dmu_buf_impl_t
*db
, const void *tag
);
379 boolean_t
dbuf_try_add_ref(dmu_buf_t
*db
, objset_t
*os
, uint64_t obj
,
380 uint64_t blkid
, const void *tag
);
381 uint64_t dbuf_refcount(dmu_buf_impl_t
*db
);
383 void dbuf_rele(dmu_buf_impl_t
*db
, const void *tag
);
384 void dbuf_rele_and_unlock(dmu_buf_impl_t
*db
, const void *tag
,
387 dmu_buf_impl_t
*dbuf_find(struct objset
*os
, uint64_t object
, uint8_t level
,
388 uint64_t blkid
, uint64_t *hash_out
);
390 int dbuf_read(dmu_buf_impl_t
*db
, zio_t
*zio
, uint32_t flags
);
391 void dmu_buf_will_clone_or_dio(dmu_buf_t
*db
, dmu_tx_t
*tx
);
392 void dmu_buf_will_not_fill(dmu_buf_t
*db
, dmu_tx_t
*tx
);
393 void dmu_buf_will_fill(dmu_buf_t
*db
, dmu_tx_t
*tx
, boolean_t canfail
);
394 boolean_t
dmu_buf_fill_done(dmu_buf_t
*db
, dmu_tx_t
*tx
, boolean_t failed
);
395 void dbuf_assign_arcbuf(dmu_buf_impl_t
*db
, arc_buf_t
*buf
, dmu_tx_t
*tx
);
396 dbuf_dirty_record_t
*dbuf_dirty(dmu_buf_impl_t
*db
, dmu_tx_t
*tx
);
397 dbuf_dirty_record_t
*dbuf_dirty_lightweight(dnode_t
*dn
, uint64_t blkid
,
399 boolean_t
dbuf_undirty(dmu_buf_impl_t
*db
, dmu_tx_t
*tx
);
400 int dmu_buf_get_bp_from_dbuf(dmu_buf_impl_t
*db
, blkptr_t
**bp
);
401 int dmu_buf_untransform_direct(dmu_buf_impl_t
*db
, spa_t
*spa
);
402 arc_buf_t
*dbuf_loan_arcbuf(dmu_buf_impl_t
*db
);
403 void dmu_buf_write_embedded(dmu_buf_t
*dbuf
, void *data
,
404 bp_embedded_type_t etype
, enum zio_compress comp
,
405 int uncompressed_size
, int compressed_size
, int byteorder
, dmu_tx_t
*tx
);
407 int dmu_lightweight_write_by_dnode(dnode_t
*dn
, uint64_t offset
, abd_t
*abd
,
408 const struct zio_prop
*zp
, zio_flag_t flags
, dmu_tx_t
*tx
);
410 void dmu_buf_redact(dmu_buf_t
*dbuf
, dmu_tx_t
*tx
);
411 void dbuf_destroy(dmu_buf_impl_t
*db
);
413 void dbuf_unoverride(dbuf_dirty_record_t
*dr
);
414 void dbuf_sync_list(list_t
*list
, int level
, dmu_tx_t
*tx
);
415 void dbuf_release_bp(dmu_buf_impl_t
*db
);
416 db_lock_type_t
dmu_buf_lock_parent(dmu_buf_impl_t
*db
, krw_t rw
,
418 void dmu_buf_unlock_parent(dmu_buf_impl_t
*db
, db_lock_type_t type
,
421 void dbuf_free_range(struct dnode
*dn
, uint64_t start
, uint64_t end
,
424 void dbuf_new_size(dmu_buf_impl_t
*db
, int size
, dmu_tx_t
*tx
);
426 void dbuf_stats_init(dbuf_hash_table_t
*hash
);
427 void dbuf_stats_destroy(void);
429 int dbuf_dnode_findbp(dnode_t
*dn
, uint64_t level
, uint64_t blkid
,
430 blkptr_t
*bp
, uint16_t *datablkszsec
, uint8_t *indblkshift
);
432 #ifdef USE_DNODE_HANDLE
433 #define DB_DNODE(_db) ((_db)->db_dnode_handle->dnh_dnode)
434 #define DB_DNODE_LOCK(_db) ((_db)->db_dnode_handle->dnh_zrlock)
435 #define DB_DNODE_ENTER(_db) (zrl_add(&DB_DNODE_LOCK(_db)))
436 #define DB_DNODE_EXIT(_db) (zrl_remove(&DB_DNODE_LOCK(_db)))
437 #define DB_DNODE_HELD(_db) (!zrl_is_zero(&DB_DNODE_LOCK(_db)))
439 #define DB_DNODE(_db) ((_db)->db_dnode)
440 #define DB_DNODE_LOCK(_db)
441 #define DB_DNODE_ENTER(_db)
442 #define DB_DNODE_EXIT(_db)
443 #define DB_DNODE_HELD(_db) (B_TRUE)
446 void dbuf_init(void);
447 void dbuf_fini(void);
449 boolean_t
dbuf_is_metadata(dmu_buf_impl_t
*db
);
451 static inline dbuf_dirty_record_t
*
452 dbuf_find_dirty_lte(dmu_buf_impl_t
*db
, uint64_t txg
)
454 dbuf_dirty_record_t
*dr
;
456 for (dr
= list_head(&db
->db_dirty_records
);
457 dr
!= NULL
&& dr
->dr_txg
> txg
;
458 dr
= list_next(&db
->db_dirty_records
, dr
))
463 static inline dbuf_dirty_record_t
*
464 dbuf_find_dirty_eq(dmu_buf_impl_t
*db
, uint64_t txg
)
466 dbuf_dirty_record_t
*dr
;
468 dr
= dbuf_find_dirty_lte(db
, txg
);
469 if (dr
&& dr
->dr_txg
== txg
)
474 #define DBUF_GET_BUFC_TYPE(_db) \
475 (dbuf_is_metadata(_db) ? ARC_BUFC_METADATA : ARC_BUFC_DATA)
477 #define DBUF_IS_CACHEABLE(_db) \
478 ((_db)->db_objset->os_primary_cache == ZFS_CACHE_ALL || \
479 (dbuf_is_metadata(_db) && \
480 ((_db)->db_objset->os_primary_cache == ZFS_CACHE_METADATA)))
482 boolean_t
dbuf_is_l2cacheable(dmu_buf_impl_t
*db
, blkptr_t
*db_bp
);
487 * There should be a ## between the string literal and fmt, to make it
488 * clear that we're joining two strings together, but gcc does not
489 * support that preprocessor token.
491 #define dprintf_dbuf(dbuf, fmt, ...) do { \
492 if (zfs_flags & ZFS_DEBUG_DPRINTF) { \
494 uint64_t __db_obj = (dbuf)->db.db_object; \
495 if (__db_obj == DMU_META_DNODE_OBJECT) \
496 (void) strlcpy(__db_buf, "mdn", sizeof (__db_buf)); \
498 (void) snprintf(__db_buf, sizeof (__db_buf), "%lld", \
499 (u_longlong_t)__db_obj); \
500 dprintf_ds((dbuf)->db_objset->os_dsl_dataset, \
501 "obj=%s lvl=%u blkid=%lld " fmt, \
502 __db_buf, (dbuf)->db_level, \
503 (u_longlong_t)(dbuf)->db_blkid, __VA_ARGS__); \
507 #define dprintf_dbuf_bp(db, bp, fmt, ...) do { \
508 if (zfs_flags & ZFS_DEBUG_DPRINTF) { \
509 char *__blkbuf = kmem_alloc(BP_SPRINTF_LEN, KM_SLEEP); \
510 snprintf_blkptr(__blkbuf, BP_SPRINTF_LEN, bp); \
511 dprintf_dbuf(db, fmt " %s\n", __VA_ARGS__, __blkbuf); \
512 kmem_free(__blkbuf, BP_SPRINTF_LEN); \
516 #define DBUF_VERIFY(db) dbuf_verify(db)
520 #define dprintf_dbuf(db, fmt, ...)
521 #define dprintf_dbuf_bp(db, bp, fmt, ...)
522 #define DBUF_VERIFY(db)
531 #endif /* _SYS_DBUF_H */