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, 2017 by Delphix. All rights reserved.
28 #include <sys/dmu_impl.h>
30 #include <sys/dmu_tx.h>
31 #include <sys/dmu_objset.h>
32 #include <sys/dsl_dataset.h>
33 #include <sys/dsl_dir.h>
34 #include <sys/dsl_pool.h>
35 #include <sys/zap_impl.h>
38 #include <sys/sa_impl.h>
39 #include <sys/zfs_context.h>
40 #include <sys/varargs.h>
41 #include <sys/trace_dmu.h>
43 typedef void (*dmu_tx_hold_func_t
)(dmu_tx_t
*tx
, struct dnode
*dn
,
44 uint64_t arg1
, uint64_t arg2
);
46 dmu_tx_stats_t dmu_tx_stats
= {
47 { "dmu_tx_assigned", KSTAT_DATA_UINT64
},
48 { "dmu_tx_delay", KSTAT_DATA_UINT64
},
49 { "dmu_tx_error", KSTAT_DATA_UINT64
},
50 { "dmu_tx_suspended", KSTAT_DATA_UINT64
},
51 { "dmu_tx_group", KSTAT_DATA_UINT64
},
52 { "dmu_tx_memory_reserve", KSTAT_DATA_UINT64
},
53 { "dmu_tx_memory_reclaim", KSTAT_DATA_UINT64
},
54 { "dmu_tx_dirty_throttle", KSTAT_DATA_UINT64
},
55 { "dmu_tx_dirty_delay", KSTAT_DATA_UINT64
},
56 { "dmu_tx_dirty_over_max", KSTAT_DATA_UINT64
},
57 { "dmu_tx_quota", KSTAT_DATA_UINT64
},
60 static kstat_t
*dmu_tx_ksp
;
63 dmu_tx_create_dd(dsl_dir_t
*dd
)
65 dmu_tx_t
*tx
= kmem_zalloc(sizeof (dmu_tx_t
), KM_SLEEP
);
68 tx
->tx_pool
= dd
->dd_pool
;
69 list_create(&tx
->tx_holds
, sizeof (dmu_tx_hold_t
),
70 offsetof(dmu_tx_hold_t
, txh_node
));
71 list_create(&tx
->tx_callbacks
, sizeof (dmu_tx_callback_t
),
72 offsetof(dmu_tx_callback_t
, dcb_node
));
73 tx
->tx_start
= gethrtime();
78 dmu_tx_create(objset_t
*os
)
80 dmu_tx_t
*tx
= dmu_tx_create_dd(os
->os_dsl_dataset
->ds_dir
);
86 dmu_tx_create_assigned(struct dsl_pool
*dp
, uint64_t txg
)
88 dmu_tx_t
*tx
= dmu_tx_create_dd(NULL
);
90 txg_verify(dp
->dp_spa
, txg
);
99 dmu_tx_is_syncing(dmu_tx_t
*tx
)
101 return (tx
->tx_anyobj
);
105 dmu_tx_private_ok(dmu_tx_t
*tx
)
107 return (tx
->tx_anyobj
);
110 static dmu_tx_hold_t
*
111 dmu_tx_hold_dnode_impl(dmu_tx_t
*tx
, dnode_t
*dn
, enum dmu_tx_hold_type type
,
112 uint64_t arg1
, uint64_t arg2
)
117 (void) refcount_add(&dn
->dn_holds
, tx
);
118 if (tx
->tx_txg
!= 0) {
119 mutex_enter(&dn
->dn_mtx
);
121 * dn->dn_assigned_txg == tx->tx_txg doesn't pose a
122 * problem, but there's no way for it to happen (for
125 ASSERT(dn
->dn_assigned_txg
== 0);
126 dn
->dn_assigned_txg
= tx
->tx_txg
;
127 (void) refcount_add(&dn
->dn_tx_holds
, tx
);
128 mutex_exit(&dn
->dn_mtx
);
132 txh
= kmem_zalloc(sizeof (dmu_tx_hold_t
), KM_SLEEP
);
135 refcount_create(&txh
->txh_space_towrite
);
136 refcount_create(&txh
->txh_memory_tohold
);
137 txh
->txh_type
= type
;
138 txh
->txh_arg1
= arg1
;
139 txh
->txh_arg2
= arg2
;
140 list_insert_tail(&tx
->tx_holds
, txh
);
145 static dmu_tx_hold_t
*
146 dmu_tx_hold_object_impl(dmu_tx_t
*tx
, objset_t
*os
, uint64_t object
,
147 enum dmu_tx_hold_type type
, uint64_t arg1
, uint64_t arg2
)
153 if (object
!= DMU_NEW_OBJECT
) {
154 err
= dnode_hold(os
, object
, FTAG
, &dn
);
160 txh
= dmu_tx_hold_dnode_impl(tx
, dn
, type
, arg1
, arg2
);
162 dnode_rele(dn
, FTAG
);
167 dmu_tx_add_new_object(dmu_tx_t
*tx
, dnode_t
*dn
)
170 * If we're syncing, they can manipulate any object anyhow, and
171 * the hold on the dnode_t can cause problems.
173 if (!dmu_tx_is_syncing(tx
))
174 (void) dmu_tx_hold_dnode_impl(tx
, dn
, THT_NEWOBJECT
, 0, 0);
178 * This function reads specified data from disk. The specified data will
179 * be needed to perform the transaction -- i.e, it will be read after
180 * we do dmu_tx_assign(). There are two reasons that we read the data now
181 * (before dmu_tx_assign()):
183 * 1. Reading it now has potentially better performance. The transaction
184 * has not yet been assigned, so the TXG is not held open, and also the
185 * caller typically has less locks held when calling dmu_tx_hold_*() than
186 * after the transaction has been assigned. This reduces the lock (and txg)
187 * hold times, thus reducing lock contention.
189 * 2. It is easier for callers (primarily the ZPL) to handle i/o errors
190 * that are detected before they start making changes to the DMU state
191 * (i.e. now). Once the transaction has been assigned, and some DMU
192 * state has been changed, it can be difficult to recover from an i/o
193 * error (e.g. to undo the changes already made in memory at the DMU
194 * layer). Typically code to do so does not exist in the caller -- it
195 * assumes that the data has already been cached and thus i/o errors are
198 * It has been observed that the i/o initiated here can be a performance
199 * problem, and it appears to be optional, because we don't look at the
200 * data which is read. However, removing this read would only serve to
201 * move the work elsewhere (after the dmu_tx_assign()), where it may
202 * have a greater impact on performance (in addition to the impact on
203 * fault tolerance noted above).
206 dmu_tx_check_ioerr(zio_t
*zio
, dnode_t
*dn
, int level
, uint64_t blkid
)
211 rw_enter(&dn
->dn_struct_rwlock
, RW_READER
);
212 db
= dbuf_hold_level(dn
, level
, blkid
, FTAG
);
213 rw_exit(&dn
->dn_struct_rwlock
);
215 return (SET_ERROR(EIO
));
216 err
= dbuf_read(db
, zio
, DB_RF_CANFAIL
| DB_RF_NOPREFETCH
);
223 dmu_tx_count_write(dmu_tx_hold_t
*txh
, uint64_t off
, uint64_t len
)
225 dnode_t
*dn
= txh
->txh_dnode
;
231 (void) refcount_add_many(&txh
->txh_space_towrite
, len
, FTAG
);
233 if (refcount_count(&txh
->txh_space_towrite
) > 2 * DMU_MAX_ACCESS
)
234 err
= SET_ERROR(EFBIG
);
240 * For i/o error checking, read the blocks that will be needed
241 * to perform the write: the first and last level-0 blocks (if
242 * they are not aligned, i.e. if they are partial-block writes),
243 * and all the level-1 blocks.
245 if (dn
->dn_maxblkid
== 0) {
246 if (off
< dn
->dn_datablksz
&&
247 (off
> 0 || len
< dn
->dn_datablksz
)) {
248 err
= dmu_tx_check_ioerr(NULL
, dn
, 0, 0);
250 txh
->txh_tx
->tx_err
= err
;
254 zio_t
*zio
= zio_root(dn
->dn_objset
->os_spa
,
255 NULL
, NULL
, ZIO_FLAG_CANFAIL
);
257 /* first level-0 block */
258 uint64_t start
= off
>> dn
->dn_datablkshift
;
259 if (P2PHASE(off
, dn
->dn_datablksz
) || len
< dn
->dn_datablksz
) {
260 err
= dmu_tx_check_ioerr(zio
, dn
, 0, start
);
262 txh
->txh_tx
->tx_err
= err
;
266 /* last level-0 block */
267 uint64_t end
= (off
+ len
- 1) >> dn
->dn_datablkshift
;
268 if (end
!= start
&& end
<= dn
->dn_maxblkid
&&
269 P2PHASE(off
+ len
, dn
->dn_datablksz
)) {
270 err
= dmu_tx_check_ioerr(zio
, dn
, 0, end
);
272 txh
->txh_tx
->tx_err
= err
;
277 if (dn
->dn_nlevels
> 1) {
278 int shft
= dn
->dn_indblkshift
- SPA_BLKPTRSHIFT
;
279 for (uint64_t i
= (start
>> shft
) + 1;
280 i
< end
>> shft
; i
++) {
281 err
= dmu_tx_check_ioerr(zio
, dn
, 1, i
);
283 txh
->txh_tx
->tx_err
= err
;
290 txh
->txh_tx
->tx_err
= err
;
296 dmu_tx_count_dnode(dmu_tx_hold_t
*txh
)
298 (void) refcount_add_many(&txh
->txh_space_towrite
, DNODE_MIN_SIZE
, FTAG
);
302 dmu_tx_hold_write(dmu_tx_t
*tx
, uint64_t object
, uint64_t off
, int len
)
307 ASSERT3U(len
, <=, DMU_MAX_ACCESS
);
308 ASSERT(len
== 0 || UINT64_MAX
- off
>= len
- 1);
310 txh
= dmu_tx_hold_object_impl(tx
, tx
->tx_objset
,
311 object
, THT_WRITE
, off
, len
);
313 dmu_tx_count_write(txh
, off
, len
);
314 dmu_tx_count_dnode(txh
);
319 dmu_tx_hold_write_by_dnode(dmu_tx_t
*tx
, dnode_t
*dn
, uint64_t off
, int len
)
324 ASSERT3U(len
, <=, DMU_MAX_ACCESS
);
325 ASSERT(len
== 0 || UINT64_MAX
- off
>= len
- 1);
327 txh
= dmu_tx_hold_dnode_impl(tx
, dn
, THT_WRITE
, off
, len
);
329 dmu_tx_count_write(txh
, off
, len
);
330 dmu_tx_count_dnode(txh
);
335 * This function marks the transaction as being a "net free". The end
336 * result is that refquotas will be disabled for this transaction, and
337 * this transaction will be able to use half of the pool space overhead
338 * (see dsl_pool_adjustedsize()). Therefore this function should only
339 * be called for transactions that we expect will not cause a net increase
340 * in the amount of space used (but it's OK if that is occasionally not true).
343 dmu_tx_mark_netfree(dmu_tx_t
*tx
)
345 tx
->tx_netfree
= B_TRUE
;
349 dmu_tx_hold_free_impl(dmu_tx_hold_t
*txh
, uint64_t off
, uint64_t len
)
351 dmu_tx_t
*tx
= txh
->txh_tx
;
352 dnode_t
*dn
= txh
->txh_dnode
;
355 ASSERT(tx
->tx_txg
== 0);
357 dmu_tx_count_dnode(txh
);
359 if (off
>= (dn
->dn_maxblkid
+ 1) * dn
->dn_datablksz
)
361 if (len
== DMU_OBJECT_END
)
362 len
= (dn
->dn_maxblkid
+ 1) * dn
->dn_datablksz
- off
;
364 dmu_tx_count_dnode(txh
);
367 * For i/o error checking, we read the first and last level-0
368 * blocks if they are not aligned, and all the level-1 blocks.
370 * Note: dbuf_free_range() assumes that we have not instantiated
371 * any level-0 dbufs that will be completely freed. Therefore we must
372 * exercise care to not read or count the first and last blocks
373 * if they are blocksize-aligned.
375 if (dn
->dn_datablkshift
== 0) {
376 if (off
!= 0 || len
< dn
->dn_datablksz
)
377 dmu_tx_count_write(txh
, 0, dn
->dn_datablksz
);
379 /* first block will be modified if it is not aligned */
380 if (!IS_P2ALIGNED(off
, 1 << dn
->dn_datablkshift
))
381 dmu_tx_count_write(txh
, off
, 1);
382 /* last block will be modified if it is not aligned */
383 if (!IS_P2ALIGNED(off
+ len
, 1 << dn
->dn_datablkshift
))
384 dmu_tx_count_write(txh
, off
+ len
, 1);
388 * Check level-1 blocks.
390 if (dn
->dn_nlevels
> 1) {
391 int shift
= dn
->dn_datablkshift
+ dn
->dn_indblkshift
-
393 uint64_t start
= off
>> shift
;
394 uint64_t end
= (off
+ len
) >> shift
;
397 ASSERT(dn
->dn_indblkshift
!= 0);
400 * dnode_reallocate() can result in an object with indirect
401 * blocks having an odd data block size. In this case,
402 * just check the single block.
404 if (dn
->dn_datablkshift
== 0)
407 zio_t
*zio
= zio_root(tx
->tx_pool
->dp_spa
,
408 NULL
, NULL
, ZIO_FLAG_CANFAIL
);
409 for (i
= start
; i
<= end
; i
++) {
410 uint64_t ibyte
= i
<< shift
;
411 err
= dnode_next_offset(dn
, 0, &ibyte
, 2, 1, 0);
413 if (err
== ESRCH
|| i
> end
)
417 (void) zio_wait(zio
);
421 (void) refcount_add_many(&txh
->txh_memory_tohold
,
422 1 << dn
->dn_indblkshift
, FTAG
);
424 err
= dmu_tx_check_ioerr(zio
, dn
, 1, i
);
427 (void) zio_wait(zio
);
440 dmu_tx_hold_free(dmu_tx_t
*tx
, uint64_t object
, uint64_t off
, uint64_t len
)
444 txh
= dmu_tx_hold_object_impl(tx
, tx
->tx_objset
,
445 object
, THT_FREE
, off
, len
);
447 (void) dmu_tx_hold_free_impl(txh
, off
, len
);
451 dmu_tx_hold_free_by_dnode(dmu_tx_t
*tx
, dnode_t
*dn
, uint64_t off
, uint64_t len
)
455 txh
= dmu_tx_hold_dnode_impl(tx
, dn
, THT_FREE
, off
, len
);
457 (void) dmu_tx_hold_free_impl(txh
, off
, len
);
461 dmu_tx_hold_zap_impl(dmu_tx_hold_t
*txh
, const char *name
)
463 dmu_tx_t
*tx
= txh
->txh_tx
;
464 dnode_t
*dn
= txh
->txh_dnode
;
467 ASSERT(tx
->tx_txg
== 0);
469 dmu_tx_count_dnode(txh
);
472 * Modifying a almost-full microzap is around the worst case (128KB)
474 * If it is a fat zap, the worst case would be 7*16KB=112KB:
475 * - 3 blocks overwritten: target leaf, ptrtbl block, header block
476 * - 4 new blocks written if adding:
477 * - 2 blocks for possibly split leaves,
478 * - 2 grown ptrtbl blocks
480 (void) refcount_add_many(&txh
->txh_space_towrite
,
481 MZAP_MAX_BLKSZ
, FTAG
);
486 ASSERT3U(DMU_OT_BYTESWAP(dn
->dn_type
), ==, DMU_BSWAP_ZAP
);
488 if (dn
->dn_maxblkid
== 0 || name
== NULL
) {
490 * This is a microzap (only one block), or we don't know
491 * the name. Check the first block for i/o errors.
493 err
= dmu_tx_check_ioerr(NULL
, dn
, 0, 0);
499 * Access the name so that we'll check for i/o errors to
500 * the leaf blocks, etc. We ignore ENOENT, as this name
503 err
= zap_lookup_by_dnode(dn
, name
, 8, 0, NULL
);
504 if (err
== EIO
|| err
== ECKSUM
|| err
== ENXIO
) {
511 dmu_tx_hold_zap(dmu_tx_t
*tx
, uint64_t object
, int add
, const char *name
)
517 txh
= dmu_tx_hold_object_impl(tx
, tx
->tx_objset
,
518 object
, THT_ZAP
, add
, (uintptr_t)name
);
520 dmu_tx_hold_zap_impl(txh
, name
);
524 dmu_tx_hold_zap_by_dnode(dmu_tx_t
*tx
, dnode_t
*dn
, int add
, const char *name
)
531 txh
= dmu_tx_hold_dnode_impl(tx
, dn
, THT_ZAP
, add
, (uintptr_t)name
);
533 dmu_tx_hold_zap_impl(txh
, name
);
537 dmu_tx_hold_bonus(dmu_tx_t
*tx
, uint64_t object
)
541 ASSERT(tx
->tx_txg
== 0);
543 txh
= dmu_tx_hold_object_impl(tx
, tx
->tx_objset
,
544 object
, THT_BONUS
, 0, 0);
546 dmu_tx_count_dnode(txh
);
550 dmu_tx_hold_bonus_by_dnode(dmu_tx_t
*tx
, dnode_t
*dn
)
556 txh
= dmu_tx_hold_dnode_impl(tx
, dn
, THT_BONUS
, 0, 0);
558 dmu_tx_count_dnode(txh
);
562 dmu_tx_hold_space(dmu_tx_t
*tx
, uint64_t space
)
566 ASSERT(tx
->tx_txg
== 0);
568 txh
= dmu_tx_hold_object_impl(tx
, tx
->tx_objset
,
569 DMU_NEW_OBJECT
, THT_SPACE
, space
, 0);
571 (void) refcount_add_many(&txh
->txh_space_towrite
, space
, FTAG
);
576 dmu_tx_dirty_buf(dmu_tx_t
*tx
, dmu_buf_impl_t
*db
)
578 boolean_t match_object
= B_FALSE
;
579 boolean_t match_offset
= B_FALSE
;
582 dnode_t
*dn
= DB_DNODE(db
);
583 ASSERT(tx
->tx_txg
!= 0);
584 ASSERT(tx
->tx_objset
== NULL
|| dn
->dn_objset
== tx
->tx_objset
);
585 ASSERT3U(dn
->dn_object
, ==, db
->db
.db_object
);
592 /* XXX No checking on the meta dnode for now */
593 if (db
->db
.db_object
== DMU_META_DNODE_OBJECT
) {
598 for (dmu_tx_hold_t
*txh
= list_head(&tx
->tx_holds
); txh
!= NULL
;
599 txh
= list_next(&tx
->tx_holds
, txh
)) {
600 ASSERT3U(dn
->dn_assigned_txg
, ==, tx
->tx_txg
);
601 if (txh
->txh_dnode
== dn
&& txh
->txh_type
!= THT_NEWOBJECT
)
603 if (txh
->txh_dnode
== NULL
|| txh
->txh_dnode
== dn
) {
604 int datablkshift
= dn
->dn_datablkshift
?
605 dn
->dn_datablkshift
: SPA_MAXBLOCKSHIFT
;
606 int epbs
= dn
->dn_indblkshift
- SPA_BLKPTRSHIFT
;
607 int shift
= datablkshift
+ epbs
* db
->db_level
;
608 uint64_t beginblk
= shift
>= 64 ? 0 :
609 (txh
->txh_arg1
>> shift
);
610 uint64_t endblk
= shift
>= 64 ? 0 :
611 ((txh
->txh_arg1
+ txh
->txh_arg2
- 1) >> shift
);
612 uint64_t blkid
= db
->db_blkid
;
614 /* XXX txh_arg2 better not be zero... */
616 dprintf("found txh type %x beginblk=%llx endblk=%llx\n",
617 txh
->txh_type
, beginblk
, endblk
);
619 switch (txh
->txh_type
) {
621 if (blkid
>= beginblk
&& blkid
<= endblk
)
624 * We will let this hold work for the bonus
625 * or spill buffer so that we don't need to
626 * hold it when creating a new object.
628 if (blkid
== DMU_BONUS_BLKID
||
629 blkid
== DMU_SPILL_BLKID
)
632 * They might have to increase nlevels,
633 * thus dirtying the new TLIBs. Or the
634 * might have to change the block size,
635 * thus dirying the new lvl=0 blk=0.
642 * We will dirty all the level 1 blocks in
643 * the free range and perhaps the first and
644 * last level 0 block.
646 if (blkid
>= beginblk
&& (blkid
<= endblk
||
647 txh
->txh_arg2
== DMU_OBJECT_END
))
651 if (blkid
== DMU_SPILL_BLKID
)
655 if (blkid
== DMU_BONUS_BLKID
)
665 cmn_err(CE_PANIC
, "bad txh_type %d",
669 if (match_object
&& match_offset
) {
675 panic("dirtying dbuf obj=%llx lvl=%u blkid=%llx but not tx_held\n",
676 (u_longlong_t
)db
->db
.db_object
, db
->db_level
,
677 (u_longlong_t
)db
->db_blkid
);
682 * If we can't do 10 iops, something is wrong. Let us go ahead
683 * and hit zfs_dirty_data_max.
685 hrtime_t zfs_delay_max_ns
= 100 * MICROSEC
; /* 100 milliseconds */
686 int zfs_delay_resolution_ns
= 100 * 1000; /* 100 microseconds */
689 * We delay transactions when we've determined that the backend storage
690 * isn't able to accommodate the rate of incoming writes.
692 * If there is already a transaction waiting, we delay relative to when
693 * that transaction finishes waiting. This way the calculated min_time
694 * is independent of the number of threads concurrently executing
697 * If we are the only waiter, wait relative to when the transaction
698 * started, rather than the current time. This credits the transaction for
699 * "time already served", e.g. reading indirect blocks.
701 * The minimum time for a transaction to take is calculated as:
702 * min_time = scale * (dirty - min) / (max - dirty)
703 * min_time is then capped at zfs_delay_max_ns.
705 * The delay has two degrees of freedom that can be adjusted via tunables.
706 * The percentage of dirty data at which we start to delay is defined by
707 * zfs_delay_min_dirty_percent. This should typically be at or above
708 * zfs_vdev_async_write_active_max_dirty_percent so that we only start to
709 * delay after writing at full speed has failed to keep up with the incoming
710 * write rate. The scale of the curve is defined by zfs_delay_scale. Roughly
711 * speaking, this variable determines the amount of delay at the midpoint of
715 * 10ms +-------------------------------------------------------------*+
731 * 2ms + (midpoint) * +
734 * | zfs_delay_scale ----------> ******** |
735 * 0 +-------------------------------------*********----------------+
736 * 0% <- zfs_dirty_data_max -> 100%
738 * Note that since the delay is added to the outstanding time remaining on the
739 * most recent transaction, the delay is effectively the inverse of IOPS.
740 * Here the midpoint of 500us translates to 2000 IOPS. The shape of the curve
741 * was chosen such that small changes in the amount of accumulated dirty data
742 * in the first 3/4 of the curve yield relatively small differences in the
745 * The effects can be easier to understand when the amount of delay is
746 * represented on a log scale:
749 * 100ms +-------------------------------------------------------------++
758 * + zfs_delay_scale ----------> ***** +
769 * +--------------------------------------------------------------+
770 * 0% <- zfs_dirty_data_max -> 100%
772 * Note here that only as the amount of dirty data approaches its limit does
773 * the delay start to increase rapidly. The goal of a properly tuned system
774 * should be to keep the amount of dirty data out of that range by first
775 * ensuring that the appropriate limits are set for the I/O scheduler to reach
776 * optimal throughput on the backend storage, and then by changing the value
777 * of zfs_delay_scale to increase the steepness of the curve.
780 dmu_tx_delay(dmu_tx_t
*tx
, uint64_t dirty
)
782 dsl_pool_t
*dp
= tx
->tx_pool
;
783 uint64_t delay_min_bytes
=
784 zfs_dirty_data_max
* zfs_delay_min_dirty_percent
/ 100;
785 hrtime_t wakeup
, min_tx_time
, now
;
787 if (dirty
<= delay_min_bytes
)
791 * The caller has already waited until we are under the max.
792 * We make them pass us the amount of dirty data so we don't
793 * have to handle the case of it being >= the max, which could
794 * cause a divide-by-zero if it's == the max.
796 ASSERT3U(dirty
, <, zfs_dirty_data_max
);
799 min_tx_time
= zfs_delay_scale
*
800 (dirty
- delay_min_bytes
) / (zfs_dirty_data_max
- dirty
);
801 min_tx_time
= MIN(min_tx_time
, zfs_delay_max_ns
);
802 if (now
> tx
->tx_start
+ min_tx_time
)
805 DTRACE_PROBE3(delay__mintime
, dmu_tx_t
*, tx
, uint64_t, dirty
,
806 uint64_t, min_tx_time
);
808 mutex_enter(&dp
->dp_lock
);
809 wakeup
= MAX(tx
->tx_start
+ min_tx_time
,
810 dp
->dp_last_wakeup
+ min_tx_time
);
811 dp
->dp_last_wakeup
= wakeup
;
812 mutex_exit(&dp
->dp_lock
);
814 zfs_sleep_until(wakeup
);
818 * This routine attempts to assign the transaction to a transaction group.
819 * To do so, we must determine if there is sufficient free space on disk.
821 * If this is a "netfree" transaction (i.e. we called dmu_tx_mark_netfree()
822 * on it), then it is assumed that there is sufficient free space,
823 * unless there's insufficient slop space in the pool (see the comment
824 * above spa_slop_shift in spa_misc.c).
826 * If it is not a "netfree" transaction, then if the data already on disk
827 * is over the allowed usage (e.g. quota), this will fail with EDQUOT or
828 * ENOSPC. Otherwise, if the current rough estimate of pending changes,
829 * plus the rough estimate of this transaction's changes, may exceed the
830 * allowed usage, then this will fail with ERESTART, which will cause the
831 * caller to wait for the pending changes to be written to disk (by waiting
832 * for the next TXG to open), and then check the space usage again.
834 * The rough estimate of pending changes is comprised of the sum of:
836 * - this transaction's holds' txh_space_towrite
838 * - dd_tempreserved[], which is the sum of in-flight transactions'
839 * holds' txh_space_towrite (i.e. those transactions that have called
840 * dmu_tx_assign() but not yet called dmu_tx_commit()).
842 * - dd_space_towrite[], which is the amount of dirtied dbufs.
844 * Note that all of these values are inflated by spa_get_worst_case_asize(),
845 * which means that we may get ERESTART well before we are actually in danger
846 * of running out of space, but this also mitigates any small inaccuracies
847 * in the rough estimate (e.g. txh_space_towrite doesn't take into account
848 * indirect blocks, and dd_space_towrite[] doesn't take into account changes
851 * Note that due to this algorithm, it is possible to exceed the allowed
852 * usage by one transaction. Also, as we approach the allowed usage,
853 * we will allow a very limited amount of changes into each TXG, thus
854 * decreasing performance.
857 dmu_tx_try_assign(dmu_tx_t
*tx
, uint64_t txg_how
)
859 spa_t
*spa
= tx
->tx_pool
->dp_spa
;
864 DMU_TX_STAT_BUMP(dmu_tx_error
);
868 if (spa_suspended(spa
)) {
869 DMU_TX_STAT_BUMP(dmu_tx_suspended
);
872 * If the user has indicated a blocking failure mode
873 * then return ERESTART which will block in dmu_tx_wait().
874 * Otherwise, return EIO so that an error can get
875 * propagated back to the VOP calls.
877 * Note that we always honor the txg_how flag regardless
878 * of the failuremode setting.
880 if (spa_get_failmode(spa
) == ZIO_FAILURE_MODE_CONTINUE
&&
881 !(txg_how
& TXG_WAIT
))
882 return (SET_ERROR(EIO
));
884 return (SET_ERROR(ERESTART
));
887 if (!tx
->tx_dirty_delayed
&&
888 dsl_pool_need_dirty_delay(tx
->tx_pool
)) {
889 tx
->tx_wait_dirty
= B_TRUE
;
890 DMU_TX_STAT_BUMP(dmu_tx_dirty_delay
);
894 tx
->tx_txg
= txg_hold_open(tx
->tx_pool
, &tx
->tx_txgh
);
895 tx
->tx_needassign_txh
= NULL
;
898 * NB: No error returns are allowed after txg_hold_open, but
899 * before processing the dnode holds, due to the
900 * dmu_tx_unassign() logic.
903 uint64_t towrite
= 0;
905 for (dmu_tx_hold_t
*txh
= list_head(&tx
->tx_holds
); txh
!= NULL
;
906 txh
= list_next(&tx
->tx_holds
, txh
)) {
907 dnode_t
*dn
= txh
->txh_dnode
;
909 mutex_enter(&dn
->dn_mtx
);
910 if (dn
->dn_assigned_txg
== tx
->tx_txg
- 1) {
911 mutex_exit(&dn
->dn_mtx
);
912 tx
->tx_needassign_txh
= txh
;
913 DMU_TX_STAT_BUMP(dmu_tx_group
);
914 return (SET_ERROR(ERESTART
));
916 if (dn
->dn_assigned_txg
== 0)
917 dn
->dn_assigned_txg
= tx
->tx_txg
;
918 ASSERT3U(dn
->dn_assigned_txg
, ==, tx
->tx_txg
);
919 (void) refcount_add(&dn
->dn_tx_holds
, tx
);
920 mutex_exit(&dn
->dn_mtx
);
922 towrite
+= refcount_count(&txh
->txh_space_towrite
);
923 tohold
+= refcount_count(&txh
->txh_memory_tohold
);
926 /* needed allocation: worst-case estimate of write space */
927 uint64_t asize
= spa_get_worst_case_asize(tx
->tx_pool
->dp_spa
, towrite
);
928 /* calculate memory footprint estimate */
929 uint64_t memory
= towrite
+ tohold
;
931 if (tx
->tx_dir
!= NULL
&& asize
!= 0) {
932 int err
= dsl_dir_tempreserve_space(tx
->tx_dir
, memory
,
933 asize
, tx
->tx_netfree
, &tx
->tx_tempreserve_cookie
, tx
);
938 DMU_TX_STAT_BUMP(dmu_tx_assigned
);
944 dmu_tx_unassign(dmu_tx_t
*tx
)
949 txg_rele_to_quiesce(&tx
->tx_txgh
);
952 * Walk the transaction's hold list, removing the hold on the
953 * associated dnode, and notifying waiters if the refcount drops to 0.
955 for (dmu_tx_hold_t
*txh
= list_head(&tx
->tx_holds
);
956 txh
&& txh
!= tx
->tx_needassign_txh
;
957 txh
= list_next(&tx
->tx_holds
, txh
)) {
958 dnode_t
*dn
= txh
->txh_dnode
;
962 mutex_enter(&dn
->dn_mtx
);
963 ASSERT3U(dn
->dn_assigned_txg
, ==, tx
->tx_txg
);
965 if (refcount_remove(&dn
->dn_tx_holds
, tx
) == 0) {
966 dn
->dn_assigned_txg
= 0;
967 cv_broadcast(&dn
->dn_notxholds
);
969 mutex_exit(&dn
->dn_mtx
);
972 txg_rele_to_sync(&tx
->tx_txgh
);
974 tx
->tx_lasttried_txg
= tx
->tx_txg
;
979 * Assign tx to a transaction group; txg_how is a bitmask:
981 * If TXG_WAIT is set and the currently open txg is full, this function
982 * will wait until there's a new txg. This should be used when no locks
983 * are being held. With this bit set, this function will only fail if
984 * we're truly out of space (or over quota).
986 * If TXG_WAIT is *not* set and we can't assign into the currently open
987 * txg without blocking, this function will return immediately with
988 * ERESTART. This should be used whenever locks are being held. On an
989 * ERESTART error, the caller should drop all locks, call dmu_tx_wait(),
992 * If TXG_NOTHROTTLE is set, this indicates that this tx should not be
993 * delayed due on the ZFS Write Throttle (see comments in dsl_pool.c for
994 * details on the throttle). This is used by the VFS operations, after
995 * they have already called dmu_tx_wait() (though most likely on a
999 dmu_tx_assign(dmu_tx_t
*tx
, uint64_t txg_how
)
1003 ASSERT(tx
->tx_txg
== 0);
1004 ASSERT0(txg_how
& ~(TXG_WAIT
| TXG_NOTHROTTLE
));
1005 ASSERT(!dsl_pool_sync_context(tx
->tx_pool
));
1007 /* If we might wait, we must not hold the config lock. */
1008 IMPLY((txg_how
& TXG_WAIT
), !dsl_pool_config_held(tx
->tx_pool
));
1010 if ((txg_how
& TXG_NOTHROTTLE
))
1011 tx
->tx_dirty_delayed
= B_TRUE
;
1013 while ((err
= dmu_tx_try_assign(tx
, txg_how
)) != 0) {
1014 dmu_tx_unassign(tx
);
1016 if (err
!= ERESTART
|| !(txg_how
& TXG_WAIT
))
1022 txg_rele_to_quiesce(&tx
->tx_txgh
);
1028 dmu_tx_wait(dmu_tx_t
*tx
)
1030 spa_t
*spa
= tx
->tx_pool
->dp_spa
;
1031 dsl_pool_t
*dp
= tx
->tx_pool
;
1034 ASSERT(tx
->tx_txg
== 0);
1035 ASSERT(!dsl_pool_config_held(tx
->tx_pool
));
1037 before
= gethrtime();
1039 if (tx
->tx_wait_dirty
) {
1043 * dmu_tx_try_assign() has determined that we need to wait
1044 * because we've consumed much or all of the dirty buffer
1047 mutex_enter(&dp
->dp_lock
);
1048 if (dp
->dp_dirty_total
>= zfs_dirty_data_max
)
1049 DMU_TX_STAT_BUMP(dmu_tx_dirty_over_max
);
1050 while (dp
->dp_dirty_total
>= zfs_dirty_data_max
)
1051 cv_wait(&dp
->dp_spaceavail_cv
, &dp
->dp_lock
);
1052 dirty
= dp
->dp_dirty_total
;
1053 mutex_exit(&dp
->dp_lock
);
1055 dmu_tx_delay(tx
, dirty
);
1057 tx
->tx_wait_dirty
= B_FALSE
;
1060 * Note: setting tx_dirty_delayed only has effect if the
1061 * caller used TX_WAIT. Otherwise they are going to
1062 * destroy this tx and try again. The common case,
1063 * zfs_write(), uses TX_WAIT.
1065 tx
->tx_dirty_delayed
= B_TRUE
;
1066 } else if (spa_suspended(spa
) || tx
->tx_lasttried_txg
== 0) {
1068 * If the pool is suspended we need to wait until it
1069 * is resumed. Note that it's possible that the pool
1070 * has become active after this thread has tried to
1071 * obtain a tx. If that's the case then tx_lasttried_txg
1072 * would not have been set.
1074 txg_wait_synced(dp
, spa_last_synced_txg(spa
) + 1);
1075 } else if (tx
->tx_needassign_txh
) {
1076 dnode_t
*dn
= tx
->tx_needassign_txh
->txh_dnode
;
1078 mutex_enter(&dn
->dn_mtx
);
1079 while (dn
->dn_assigned_txg
== tx
->tx_lasttried_txg
- 1)
1080 cv_wait(&dn
->dn_notxholds
, &dn
->dn_mtx
);
1081 mutex_exit(&dn
->dn_mtx
);
1082 tx
->tx_needassign_txh
= NULL
;
1085 * A dnode is assigned to the quiescing txg. Wait for its
1086 * transaction to complete.
1088 txg_wait_open(tx
->tx_pool
, tx
->tx_lasttried_txg
+ 1);
1091 spa_tx_assign_add_nsecs(spa
, gethrtime() - before
);
1095 dmu_tx_destroy(dmu_tx_t
*tx
)
1099 while ((txh
= list_head(&tx
->tx_holds
)) != NULL
) {
1100 dnode_t
*dn
= txh
->txh_dnode
;
1102 list_remove(&tx
->tx_holds
, txh
);
1103 refcount_destroy_many(&txh
->txh_space_towrite
,
1104 refcount_count(&txh
->txh_space_towrite
));
1105 refcount_destroy_many(&txh
->txh_memory_tohold
,
1106 refcount_count(&txh
->txh_memory_tohold
));
1107 kmem_free(txh
, sizeof (dmu_tx_hold_t
));
1112 list_destroy(&tx
->tx_callbacks
);
1113 list_destroy(&tx
->tx_holds
);
1114 kmem_free(tx
, sizeof (dmu_tx_t
));
1118 dmu_tx_commit(dmu_tx_t
*tx
)
1122 ASSERT(tx
->tx_txg
!= 0);
1125 * Go through the transaction's hold list and remove holds on
1126 * associated dnodes, notifying waiters if no holds remain.
1128 for (txh
= list_head(&tx
->tx_holds
); txh
!= NULL
;
1129 txh
= list_next(&tx
->tx_holds
, txh
)) {
1130 dnode_t
*dn
= txh
->txh_dnode
;
1135 mutex_enter(&dn
->dn_mtx
);
1136 ASSERT3U(dn
->dn_assigned_txg
, ==, tx
->tx_txg
);
1138 if (refcount_remove(&dn
->dn_tx_holds
, tx
) == 0) {
1139 dn
->dn_assigned_txg
= 0;
1140 cv_broadcast(&dn
->dn_notxholds
);
1142 mutex_exit(&dn
->dn_mtx
);
1145 if (tx
->tx_tempreserve_cookie
)
1146 dsl_dir_tempreserve_clear(tx
->tx_tempreserve_cookie
, tx
);
1148 if (!list_is_empty(&tx
->tx_callbacks
))
1149 txg_register_callbacks(&tx
->tx_txgh
, &tx
->tx_callbacks
);
1151 if (tx
->tx_anyobj
== FALSE
)
1152 txg_rele_to_sync(&tx
->tx_txgh
);
1158 dmu_tx_abort(dmu_tx_t
*tx
)
1160 ASSERT(tx
->tx_txg
== 0);
1163 * Call any registered callbacks with an error code.
1165 if (!list_is_empty(&tx
->tx_callbacks
))
1166 dmu_tx_do_callbacks(&tx
->tx_callbacks
, ECANCELED
);
1172 dmu_tx_get_txg(dmu_tx_t
*tx
)
1174 ASSERT(tx
->tx_txg
!= 0);
1175 return (tx
->tx_txg
);
1179 dmu_tx_pool(dmu_tx_t
*tx
)
1181 ASSERT(tx
->tx_pool
!= NULL
);
1182 return (tx
->tx_pool
);
1186 dmu_tx_callback_register(dmu_tx_t
*tx
, dmu_tx_callback_func_t
*func
, void *data
)
1188 dmu_tx_callback_t
*dcb
;
1190 dcb
= kmem_alloc(sizeof (dmu_tx_callback_t
), KM_SLEEP
);
1192 dcb
->dcb_func
= func
;
1193 dcb
->dcb_data
= data
;
1195 list_insert_tail(&tx
->tx_callbacks
, dcb
);
1199 * Call all the commit callbacks on a list, with a given error code.
1202 dmu_tx_do_callbacks(list_t
*cb_list
, int error
)
1204 dmu_tx_callback_t
*dcb
;
1206 while ((dcb
= list_tail(cb_list
)) != NULL
) {
1207 list_remove(cb_list
, dcb
);
1208 dcb
->dcb_func(dcb
->dcb_data
, error
);
1209 kmem_free(dcb
, sizeof (dmu_tx_callback_t
));
1214 * Interface to hold a bunch of attributes.
1215 * used for creating new files.
1216 * attrsize is the total size of all attributes
1217 * to be added during object creation
1219 * For updating/adding a single attribute dmu_tx_hold_sa() should be used.
1223 * hold necessary attribute name for attribute registration.
1224 * should be a very rare case where this is needed. If it does
1225 * happen it would only happen on the first write to the file system.
1228 dmu_tx_sa_registration_hold(sa_os_t
*sa
, dmu_tx_t
*tx
)
1230 if (!sa
->sa_need_attr_registration
)
1233 for (int i
= 0; i
!= sa
->sa_num_attrs
; i
++) {
1234 if (!sa
->sa_attr_table
[i
].sa_registered
) {
1235 if (sa
->sa_reg_attr_obj
)
1236 dmu_tx_hold_zap(tx
, sa
->sa_reg_attr_obj
,
1237 B_TRUE
, sa
->sa_attr_table
[i
].sa_name
);
1239 dmu_tx_hold_zap(tx
, DMU_NEW_OBJECT
,
1240 B_TRUE
, sa
->sa_attr_table
[i
].sa_name
);
1246 dmu_tx_hold_spill(dmu_tx_t
*tx
, uint64_t object
)
1250 txh
= dmu_tx_hold_object_impl(tx
, tx
->tx_objset
, object
,
1253 (void) refcount_add_many(&txh
->txh_space_towrite
,
1254 SPA_OLD_MAXBLOCKSIZE
, FTAG
);
1258 dmu_tx_hold_sa_create(dmu_tx_t
*tx
, int attrsize
)
1260 sa_os_t
*sa
= tx
->tx_objset
->os_sa
;
1262 dmu_tx_hold_bonus(tx
, DMU_NEW_OBJECT
);
1264 if (tx
->tx_objset
->os_sa
->sa_master_obj
== 0)
1267 if (tx
->tx_objset
->os_sa
->sa_layout_attr_obj
) {
1268 dmu_tx_hold_zap(tx
, sa
->sa_layout_attr_obj
, B_TRUE
, NULL
);
1270 dmu_tx_hold_zap(tx
, sa
->sa_master_obj
, B_TRUE
, SA_LAYOUTS
);
1271 dmu_tx_hold_zap(tx
, sa
->sa_master_obj
, B_TRUE
, SA_REGISTRY
);
1272 dmu_tx_hold_zap(tx
, DMU_NEW_OBJECT
, B_TRUE
, NULL
);
1273 dmu_tx_hold_zap(tx
, DMU_NEW_OBJECT
, B_TRUE
, NULL
);
1276 dmu_tx_sa_registration_hold(sa
, tx
);
1278 if (attrsize
<= DN_OLD_MAX_BONUSLEN
&& !sa
->sa_force_spill
)
1281 (void) dmu_tx_hold_object_impl(tx
, tx
->tx_objset
, DMU_NEW_OBJECT
,
1288 * dmu_tx_hold_sa(dmu_tx_t *tx, sa_handle_t *, attribute, add, size)
1290 * variable_size is the total size of all variable sized attributes
1291 * passed to this function. It is not the total size of all
1292 * variable size attributes that *may* exist on this object.
1295 dmu_tx_hold_sa(dmu_tx_t
*tx
, sa_handle_t
*hdl
, boolean_t may_grow
)
1298 sa_os_t
*sa
= tx
->tx_objset
->os_sa
;
1300 ASSERT(hdl
!= NULL
);
1302 object
= sa_handle_object(hdl
);
1304 dmu_tx_hold_bonus(tx
, object
);
1306 if (tx
->tx_objset
->os_sa
->sa_master_obj
== 0)
1309 if (tx
->tx_objset
->os_sa
->sa_reg_attr_obj
== 0 ||
1310 tx
->tx_objset
->os_sa
->sa_layout_attr_obj
== 0) {
1311 dmu_tx_hold_zap(tx
, sa
->sa_master_obj
, B_TRUE
, SA_LAYOUTS
);
1312 dmu_tx_hold_zap(tx
, sa
->sa_master_obj
, B_TRUE
, SA_REGISTRY
);
1313 dmu_tx_hold_zap(tx
, DMU_NEW_OBJECT
, B_TRUE
, NULL
);
1314 dmu_tx_hold_zap(tx
, DMU_NEW_OBJECT
, B_TRUE
, NULL
);
1317 dmu_tx_sa_registration_hold(sa
, tx
);
1319 if (may_grow
&& tx
->tx_objset
->os_sa
->sa_layout_attr_obj
)
1320 dmu_tx_hold_zap(tx
, sa
->sa_layout_attr_obj
, B_TRUE
, NULL
);
1322 if (sa
->sa_force_spill
|| may_grow
|| hdl
->sa_spill
) {
1323 ASSERT(tx
->tx_txg
== 0);
1324 dmu_tx_hold_spill(tx
, object
);
1326 dmu_buf_impl_t
*db
= (dmu_buf_impl_t
*)hdl
->sa_bonus
;
1331 if (dn
->dn_have_spill
) {
1332 ASSERT(tx
->tx_txg
== 0);
1333 dmu_tx_hold_spill(tx
, object
);
1342 dmu_tx_ksp
= kstat_create("zfs", 0, "dmu_tx", "misc",
1343 KSTAT_TYPE_NAMED
, sizeof (dmu_tx_stats
) / sizeof (kstat_named_t
),
1344 KSTAT_FLAG_VIRTUAL
);
1346 if (dmu_tx_ksp
!= NULL
) {
1347 dmu_tx_ksp
->ks_data
= &dmu_tx_stats
;
1348 kstat_install(dmu_tx_ksp
);
1355 if (dmu_tx_ksp
!= NULL
) {
1356 kstat_delete(dmu_tx_ksp
);
1361 #if defined(_KERNEL) && defined(HAVE_SPL)
1362 EXPORT_SYMBOL(dmu_tx_create
);
1363 EXPORT_SYMBOL(dmu_tx_hold_write
);
1364 EXPORT_SYMBOL(dmu_tx_hold_write_by_dnode
);
1365 EXPORT_SYMBOL(dmu_tx_hold_free
);
1366 EXPORT_SYMBOL(dmu_tx_hold_free_by_dnode
);
1367 EXPORT_SYMBOL(dmu_tx_hold_zap
);
1368 EXPORT_SYMBOL(dmu_tx_hold_zap_by_dnode
);
1369 EXPORT_SYMBOL(dmu_tx_hold_bonus
);
1370 EXPORT_SYMBOL(dmu_tx_hold_bonus_by_dnode
);
1371 EXPORT_SYMBOL(dmu_tx_abort
);
1372 EXPORT_SYMBOL(dmu_tx_assign
);
1373 EXPORT_SYMBOL(dmu_tx_wait
);
1374 EXPORT_SYMBOL(dmu_tx_commit
);
1375 EXPORT_SYMBOL(dmu_tx_mark_netfree
);
1376 EXPORT_SYMBOL(dmu_tx_get_txg
);
1377 EXPORT_SYMBOL(dmu_tx_callback_register
);
1378 EXPORT_SYMBOL(dmu_tx_do_callbacks
);
1379 EXPORT_SYMBOL(dmu_tx_hold_spill
);
1380 EXPORT_SYMBOL(dmu_tx_hold_sa_create
);
1381 EXPORT_SYMBOL(dmu_tx_hold_sa
);