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) 2013 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> /* for dsl_dataset_block_freeable() */
33 #include <sys/dsl_dir.h> /* for dsl_dir_tempreserve_*() */
34 #include <sys/dsl_pool.h>
35 #include <sys/zap_impl.h> /* for fzap_default_block_shift */
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_PUSHPAGE
);
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();
75 refcount_create(&tx
->tx_space_written
);
76 refcount_create(&tx
->tx_space_freed
);
82 dmu_tx_create(objset_t
*os
)
84 dmu_tx_t
*tx
= dmu_tx_create_dd(os
->os_dsl_dataset
->ds_dir
);
86 tx
->tx_lastsnap_txg
= dsl_dataset_prev_snap_txg(os
->os_dsl_dataset
);
91 dmu_tx_create_assigned(struct dsl_pool
*dp
, uint64_t txg
)
93 dmu_tx_t
*tx
= dmu_tx_create_dd(NULL
);
95 ASSERT3U(txg
, <=, dp
->dp_tx
.tx_open_txg
);
104 dmu_tx_is_syncing(dmu_tx_t
*tx
)
106 return (tx
->tx_anyobj
);
110 dmu_tx_private_ok(dmu_tx_t
*tx
)
112 return (tx
->tx_anyobj
);
115 static dmu_tx_hold_t
*
116 dmu_tx_hold_object_impl(dmu_tx_t
*tx
, objset_t
*os
, uint64_t object
,
117 enum dmu_tx_hold_type type
, uint64_t arg1
, uint64_t arg2
)
123 if (object
!= DMU_NEW_OBJECT
) {
124 err
= dnode_hold(os
, object
, tx
, &dn
);
130 if (err
== 0 && tx
->tx_txg
!= 0) {
131 mutex_enter(&dn
->dn_mtx
);
133 * dn->dn_assigned_txg == tx->tx_txg doesn't pose a
134 * problem, but there's no way for it to happen (for
137 ASSERT(dn
->dn_assigned_txg
== 0);
138 dn
->dn_assigned_txg
= tx
->tx_txg
;
139 (void) refcount_add(&dn
->dn_tx_holds
, tx
);
140 mutex_exit(&dn
->dn_mtx
);
144 txh
= kmem_zalloc(sizeof (dmu_tx_hold_t
), KM_PUSHPAGE
);
148 txh
->txh_type
= type
;
149 txh
->txh_arg1
= arg1
;
150 txh
->txh_arg2
= arg2
;
152 list_insert_tail(&tx
->tx_holds
, txh
);
158 dmu_tx_add_new_object(dmu_tx_t
*tx
, objset_t
*os
, uint64_t object
)
161 * If we're syncing, they can manipulate any object anyhow, and
162 * the hold on the dnode_t can cause problems.
164 if (!dmu_tx_is_syncing(tx
)) {
165 (void) dmu_tx_hold_object_impl(tx
, os
,
166 object
, THT_NEWOBJECT
, 0, 0);
171 dmu_tx_check_ioerr(zio_t
*zio
, dnode_t
*dn
, int level
, uint64_t blkid
)
176 rw_enter(&dn
->dn_struct_rwlock
, RW_READER
);
177 db
= dbuf_hold_level(dn
, level
, blkid
, FTAG
);
178 rw_exit(&dn
->dn_struct_rwlock
);
180 return (SET_ERROR(EIO
));
181 err
= dbuf_read(db
, zio
, DB_RF_CANFAIL
| DB_RF_NOPREFETCH
);
187 dmu_tx_count_twig(dmu_tx_hold_t
*txh
, dnode_t
*dn
, dmu_buf_impl_t
*db
,
188 int level
, uint64_t blkid
, boolean_t freeable
, uint64_t *history
)
190 objset_t
*os
= dn
->dn_objset
;
191 dsl_dataset_t
*ds
= os
->os_dsl_dataset
;
192 int epbs
= dn
->dn_indblkshift
- SPA_BLKPTRSHIFT
;
193 dmu_buf_impl_t
*parent
= NULL
;
197 if (level
>= dn
->dn_nlevels
|| history
[level
] == blkid
)
200 history
[level
] = blkid
;
202 space
= (level
== 0) ? dn
->dn_datablksz
: (1ULL << dn
->dn_indblkshift
);
204 if (db
== NULL
|| db
== dn
->dn_dbuf
) {
208 ASSERT(DB_DNODE(db
) == dn
);
209 ASSERT(db
->db_level
== level
);
210 ASSERT(db
->db
.db_size
== space
);
211 ASSERT(db
->db_blkid
== blkid
);
213 parent
= db
->db_parent
;
216 freeable
= (bp
&& (freeable
||
217 dsl_dataset_block_freeable(ds
, bp
, bp
->blk_birth
)));
220 txh
->txh_space_tooverwrite
+= space
;
222 txh
->txh_space_towrite
+= space
;
224 txh
->txh_space_tounref
+= bp_get_dsize(os
->os_spa
, bp
);
226 dmu_tx_count_twig(txh
, dn
, parent
, level
+ 1,
227 blkid
>> epbs
, freeable
, history
);
232 dmu_tx_count_write(dmu_tx_hold_t
*txh
, uint64_t off
, uint64_t len
)
234 dnode_t
*dn
= txh
->txh_dnode
;
235 uint64_t start
, end
, i
;
236 int min_bs
, max_bs
, min_ibs
, max_ibs
, epbs
, bits
;
243 min_bs
= SPA_MINBLOCKSHIFT
;
244 max_bs
= SPA_MAXBLOCKSHIFT
;
245 min_ibs
= DN_MIN_INDBLKSHIFT
;
246 max_ibs
= DN_MAX_INDBLKSHIFT
;
249 uint64_t history
[DN_MAX_LEVELS
];
250 int nlvls
= dn
->dn_nlevels
;
254 * For i/o error checking, read the first and last level-0
255 * blocks (if they are not aligned), and all the level-1 blocks.
257 if (dn
->dn_maxblkid
== 0) {
258 delta
= dn
->dn_datablksz
;
259 start
= (off
< dn
->dn_datablksz
) ? 0 : 1;
260 end
= (off
+len
<= dn
->dn_datablksz
) ? 0 : 1;
261 if (start
== 0 && (off
> 0 || len
< dn
->dn_datablksz
)) {
262 err
= dmu_tx_check_ioerr(NULL
, dn
, 0, 0);
268 zio_t
*zio
= zio_root(dn
->dn_objset
->os_spa
,
269 NULL
, NULL
, ZIO_FLAG_CANFAIL
);
271 /* first level-0 block */
272 start
= off
>> dn
->dn_datablkshift
;
273 if (P2PHASE(off
, dn
->dn_datablksz
) ||
274 len
< dn
->dn_datablksz
) {
275 err
= dmu_tx_check_ioerr(zio
, dn
, 0, start
);
280 /* last level-0 block */
281 end
= (off
+len
-1) >> dn
->dn_datablkshift
;
282 if (end
!= start
&& end
<= dn
->dn_maxblkid
&&
283 P2PHASE(off
+len
, dn
->dn_datablksz
)) {
284 err
= dmu_tx_check_ioerr(zio
, dn
, 0, end
);
291 int shft
= dn
->dn_indblkshift
- SPA_BLKPTRSHIFT
;
292 for (i
= (start
>>shft
)+1; i
< end
>>shft
; i
++) {
293 err
= dmu_tx_check_ioerr(zio
, dn
, 1, i
);
302 delta
= P2NPHASE(off
, dn
->dn_datablksz
);
305 min_ibs
= max_ibs
= dn
->dn_indblkshift
;
306 if (dn
->dn_maxblkid
> 0) {
308 * The blocksize can't change,
309 * so we can make a more precise estimate.
311 ASSERT(dn
->dn_datablkshift
!= 0);
312 min_bs
= max_bs
= dn
->dn_datablkshift
;
316 * If this write is not off the end of the file
317 * we need to account for overwrites/unref.
319 if (start
<= dn
->dn_maxblkid
) {
320 for (l
= 0; l
< DN_MAX_LEVELS
; l
++)
323 while (start
<= dn
->dn_maxblkid
) {
326 rw_enter(&dn
->dn_struct_rwlock
, RW_READER
);
327 err
= dbuf_hold_impl(dn
, 0, start
, FALSE
, FTAG
, &db
);
328 rw_exit(&dn
->dn_struct_rwlock
);
331 txh
->txh_tx
->tx_err
= err
;
335 dmu_tx_count_twig(txh
, dn
, db
, 0, start
, B_FALSE
,
340 * Account for new indirects appearing
341 * before this IO gets assigned into a txg.
344 epbs
= min_ibs
- SPA_BLKPTRSHIFT
;
345 for (bits
-= epbs
* (nlvls
- 1);
346 bits
>= 0; bits
-= epbs
)
347 txh
->txh_fudge
+= 1ULL << max_ibs
;
353 delta
= dn
->dn_datablksz
;
358 * 'end' is the last thing we will access, not one past.
359 * This way we won't overflow when accessing the last byte.
361 start
= P2ALIGN(off
, 1ULL << max_bs
);
362 end
= P2ROUNDUP(off
+ len
, 1ULL << max_bs
) - 1;
363 txh
->txh_space_towrite
+= end
- start
+ 1;
368 epbs
= min_ibs
- SPA_BLKPTRSHIFT
;
371 * The object contains at most 2^(64 - min_bs) blocks,
372 * and each indirect level maps 2^epbs.
374 for (bits
= 64 - min_bs
; bits
>= 0; bits
-= epbs
) {
377 ASSERT3U(end
, >=, start
);
378 txh
->txh_space_towrite
+= (end
- start
+ 1) << max_ibs
;
381 * We also need a new blkid=0 indirect block
382 * to reference any existing file data.
384 txh
->txh_space_towrite
+= 1ULL << max_ibs
;
389 if (txh
->txh_space_towrite
+ txh
->txh_space_tooverwrite
>
391 err
= SET_ERROR(EFBIG
);
394 txh
->txh_tx
->tx_err
= err
;
398 dmu_tx_count_dnode(dmu_tx_hold_t
*txh
)
400 dnode_t
*dn
= txh
->txh_dnode
;
401 dnode_t
*mdn
= DMU_META_DNODE(txh
->txh_tx
->tx_objset
);
402 uint64_t space
= mdn
->dn_datablksz
+
403 ((mdn
->dn_nlevels
-1) << mdn
->dn_indblkshift
);
405 if (dn
&& dn
->dn_dbuf
->db_blkptr
&&
406 dsl_dataset_block_freeable(dn
->dn_objset
->os_dsl_dataset
,
407 dn
->dn_dbuf
->db_blkptr
, dn
->dn_dbuf
->db_blkptr
->blk_birth
)) {
408 txh
->txh_space_tooverwrite
+= space
;
409 txh
->txh_space_tounref
+= space
;
411 txh
->txh_space_towrite
+= space
;
412 if (dn
&& dn
->dn_dbuf
->db_blkptr
)
413 txh
->txh_space_tounref
+= space
;
418 dmu_tx_hold_write(dmu_tx_t
*tx
, uint64_t object
, uint64_t off
, int len
)
422 ASSERT(tx
->tx_txg
== 0);
423 ASSERT(len
< DMU_MAX_ACCESS
);
424 ASSERT(len
== 0 || UINT64_MAX
- off
>= len
- 1);
426 txh
= dmu_tx_hold_object_impl(tx
, tx
->tx_objset
,
427 object
, THT_WRITE
, off
, len
);
431 dmu_tx_count_write(txh
, off
, len
);
432 dmu_tx_count_dnode(txh
);
436 dmu_tx_count_free(dmu_tx_hold_t
*txh
, uint64_t off
, uint64_t len
)
438 uint64_t blkid
, nblks
, lastblk
;
439 uint64_t space
= 0, unref
= 0, skipped
= 0;
440 dnode_t
*dn
= txh
->txh_dnode
;
441 dsl_dataset_t
*ds
= dn
->dn_objset
->os_dsl_dataset
;
442 spa_t
*spa
= txh
->txh_tx
->tx_pool
->dp_spa
;
444 uint64_t l0span
= 0, nl1blks
= 0;
446 if (dn
->dn_nlevels
== 0)
450 * The struct_rwlock protects us against dn_nlevels
451 * changing, in case (against all odds) we manage to dirty &
452 * sync out the changes after we check for being dirty.
453 * Also, dbuf_hold_impl() wants us to have the struct_rwlock.
455 rw_enter(&dn
->dn_struct_rwlock
, RW_READER
);
456 epbs
= dn
->dn_indblkshift
- SPA_BLKPTRSHIFT
;
457 if (dn
->dn_maxblkid
== 0) {
458 if (off
== 0 && len
>= dn
->dn_datablksz
) {
462 rw_exit(&dn
->dn_struct_rwlock
);
466 blkid
= off
>> dn
->dn_datablkshift
;
467 nblks
= (len
+ dn
->dn_datablksz
- 1) >> dn
->dn_datablkshift
;
469 if (blkid
> dn
->dn_maxblkid
) {
470 rw_exit(&dn
->dn_struct_rwlock
);
473 if (blkid
+ nblks
> dn
->dn_maxblkid
)
474 nblks
= dn
->dn_maxblkid
- blkid
+ 1;
477 l0span
= nblks
; /* save for later use to calc level > 1 overhead */
478 if (dn
->dn_nlevels
== 1) {
480 for (i
= 0; i
< nblks
; i
++) {
481 blkptr_t
*bp
= dn
->dn_phys
->dn_blkptr
;
482 ASSERT3U(blkid
+ i
, <, dn
->dn_nblkptr
);
484 if (dsl_dataset_block_freeable(ds
, bp
, bp
->blk_birth
)) {
485 dprintf_bp(bp
, "can free old%s", "");
486 space
+= bp_get_dsize(spa
, bp
);
488 unref
+= BP_GET_ASIZE(bp
);
494 lastblk
= blkid
+ nblks
- 1;
496 dmu_buf_impl_t
*dbuf
;
497 uint64_t ibyte
, new_blkid
;
499 int err
, i
, blkoff
, tochk
;
502 ibyte
= blkid
<< dn
->dn_datablkshift
;
503 err
= dnode_next_offset(dn
,
504 DNODE_FIND_HAVELOCK
, &ibyte
, 2, 1, 0);
505 new_blkid
= ibyte
>> dn
->dn_datablkshift
;
507 skipped
+= (lastblk
>> epbs
) - (blkid
>> epbs
) + 1;
511 txh
->txh_tx
->tx_err
= err
;
514 if (new_blkid
> lastblk
) {
515 skipped
+= (lastblk
>> epbs
) - (blkid
>> epbs
) + 1;
519 if (new_blkid
> blkid
) {
520 ASSERT((new_blkid
>> epbs
) > (blkid
>> epbs
));
521 skipped
+= (new_blkid
>> epbs
) - (blkid
>> epbs
) - 1;
522 nblks
-= new_blkid
- blkid
;
525 blkoff
= P2PHASE(blkid
, epb
);
526 tochk
= MIN(epb
- blkoff
, nblks
);
528 err
= dbuf_hold_impl(dn
, 1, blkid
>> epbs
, FALSE
, FTAG
, &dbuf
);
530 txh
->txh_tx
->tx_err
= err
;
534 txh
->txh_memory_tohold
+= dbuf
->db
.db_size
;
537 * We don't check memory_tohold against DMU_MAX_ACCESS because
538 * memory_tohold is an over-estimation (especially the >L1
539 * indirect blocks), so it could fail. Callers should have
540 * already verified that they will not be holding too much
544 err
= dbuf_read(dbuf
, NULL
, DB_RF_HAVESTRUCT
| DB_RF_CANFAIL
);
546 txh
->txh_tx
->tx_err
= err
;
547 dbuf_rele(dbuf
, FTAG
);
551 bp
= dbuf
->db
.db_data
;
554 for (i
= 0; i
< tochk
; i
++) {
555 if (dsl_dataset_block_freeable(ds
, &bp
[i
],
557 dprintf_bp(&bp
[i
], "can free old%s", "");
558 space
+= bp_get_dsize(spa
, &bp
[i
]);
560 unref
+= BP_GET_ASIZE(bp
);
562 dbuf_rele(dbuf
, FTAG
);
568 rw_exit(&dn
->dn_struct_rwlock
);
571 * Add in memory requirements of higher-level indirects.
572 * This assumes a worst-possible scenario for dn_nlevels and a
573 * worst-possible distribution of l1-blocks over the region to free.
576 uint64_t blkcnt
= 1 + ((l0span
>> epbs
) >> epbs
);
579 * Here we don't use DN_MAX_LEVEL, but calculate it with the
580 * given datablkshift and indblkshift. This makes the
581 * difference between 19 and 8 on large files.
583 int maxlevel
= 2 + (DN_MAX_OFFSET_SHIFT
- dn
->dn_datablkshift
) /
584 (dn
->dn_indblkshift
- SPA_BLKPTRSHIFT
);
586 while (level
++ < maxlevel
) {
587 txh
->txh_memory_tohold
+= MAX(MIN(blkcnt
, nl1blks
), 1)
588 << dn
->dn_indblkshift
;
589 blkcnt
= 1 + (blkcnt
>> epbs
);
593 /* account for new level 1 indirect blocks that might show up */
595 txh
->txh_fudge
+= skipped
<< dn
->dn_indblkshift
;
596 skipped
= MIN(skipped
, DMU_MAX_DELETEBLKCNT
>> epbs
);
597 txh
->txh_memory_tohold
+= skipped
<< dn
->dn_indblkshift
;
599 txh
->txh_space_tofree
+= space
;
600 txh
->txh_space_tounref
+= unref
;
604 dmu_tx_hold_free(dmu_tx_t
*tx
, uint64_t object
, uint64_t off
, uint64_t len
)
611 ASSERT(tx
->tx_txg
== 0);
613 txh
= dmu_tx_hold_object_impl(tx
, tx
->tx_objset
,
614 object
, THT_FREE
, off
, len
);
618 dmu_tx_count_dnode(txh
);
620 if (off
>= (dn
->dn_maxblkid
+1) * dn
->dn_datablksz
)
622 if (len
== DMU_OBJECT_END
)
623 len
= (dn
->dn_maxblkid
+1) * dn
->dn_datablksz
- off
;
625 dmu_tx_count_dnode(txh
);
628 * For i/o error checking, we read the first and last level-0
629 * blocks if they are not aligned, and all the level-1 blocks.
631 * Note: dbuf_free_range() assumes that we have not instantiated
632 * any level-0 dbufs that will be completely freed. Therefore we must
633 * exercise care to not read or count the first and last blocks
634 * if they are blocksize-aligned.
636 if (dn
->dn_datablkshift
== 0) {
637 if (off
!= 0 || len
< dn
->dn_datablksz
)
638 dmu_tx_count_write(txh
, 0, dn
->dn_datablksz
);
640 /* first block will be modified if it is not aligned */
641 if (!IS_P2ALIGNED(off
, 1 << dn
->dn_datablkshift
))
642 dmu_tx_count_write(txh
, off
, 1);
643 /* last block will be modified if it is not aligned */
644 if (!IS_P2ALIGNED(off
+ len
, 1 << dn
->dn_datablkshift
))
645 dmu_tx_count_write(txh
, off
+len
, 1);
649 * Check level-1 blocks.
651 if (dn
->dn_nlevels
> 1) {
652 int shift
= dn
->dn_datablkshift
+ dn
->dn_indblkshift
-
654 uint64_t start
= off
>> shift
;
655 uint64_t end
= (off
+ len
) >> shift
;
658 ASSERT(dn
->dn_indblkshift
!= 0);
661 * dnode_reallocate() can result in an object with indirect
662 * blocks having an odd data block size. In this case,
663 * just check the single block.
665 if (dn
->dn_datablkshift
== 0)
668 zio
= zio_root(tx
->tx_pool
->dp_spa
,
669 NULL
, NULL
, ZIO_FLAG_CANFAIL
);
670 for (i
= start
; i
<= end
; i
++) {
671 uint64_t ibyte
= i
<< shift
;
672 err
= dnode_next_offset(dn
, 0, &ibyte
, 2, 1, 0);
681 err
= dmu_tx_check_ioerr(zio
, dn
, 1, i
);
694 dmu_tx_count_free(txh
, off
, len
);
698 dmu_tx_hold_zap(dmu_tx_t
*tx
, uint64_t object
, int add
, const char *name
)
705 ASSERT(tx
->tx_txg
== 0);
707 txh
= dmu_tx_hold_object_impl(tx
, tx
->tx_objset
,
708 object
, THT_ZAP
, add
, (uintptr_t)name
);
713 dmu_tx_count_dnode(txh
);
717 * We will be able to fit a new object's entries into one leaf
718 * block. So there will be at most 2 blocks total,
719 * including the header block.
721 dmu_tx_count_write(txh
, 0, 2 << fzap_default_block_shift
);
725 ASSERT3U(DMU_OT_BYTESWAP(dn
->dn_type
), ==, DMU_BSWAP_ZAP
);
727 if (dn
->dn_maxblkid
== 0 && !add
) {
731 * If there is only one block (i.e. this is a micro-zap)
732 * and we are not adding anything, the accounting is simple.
734 err
= dmu_tx_check_ioerr(NULL
, dn
, 0, 0);
741 * Use max block size here, since we don't know how much
742 * the size will change between now and the dbuf dirty call.
744 bp
= &dn
->dn_phys
->dn_blkptr
[0];
745 if (dsl_dataset_block_freeable(dn
->dn_objset
->os_dsl_dataset
,
747 txh
->txh_space_tooverwrite
+= SPA_MAXBLOCKSIZE
;
749 txh
->txh_space_towrite
+= SPA_MAXBLOCKSIZE
;
751 txh
->txh_space_tounref
+= SPA_MAXBLOCKSIZE
;
755 if (dn
->dn_maxblkid
> 0 && name
) {
757 * access the name in this fat-zap so that we'll check
758 * for i/o errors to the leaf blocks, etc.
760 err
= zap_lookup(dn
->dn_objset
, dn
->dn_object
, name
,
768 err
= zap_count_write(dn
->dn_objset
, dn
->dn_object
, name
, add
,
769 &txh
->txh_space_towrite
, &txh
->txh_space_tooverwrite
);
772 * If the modified blocks are scattered to the four winds,
773 * we'll have to modify an indirect twig for each.
775 epbs
= dn
->dn_indblkshift
- SPA_BLKPTRSHIFT
;
776 for (nblocks
= dn
->dn_maxblkid
>> epbs
; nblocks
!= 0; nblocks
>>= epbs
)
777 if (dn
->dn_objset
->os_dsl_dataset
->ds_phys
->ds_prev_snap_obj
)
778 txh
->txh_space_towrite
+= 3 << dn
->dn_indblkshift
;
780 txh
->txh_space_tooverwrite
+= 3 << dn
->dn_indblkshift
;
784 dmu_tx_hold_bonus(dmu_tx_t
*tx
, uint64_t object
)
788 ASSERT(tx
->tx_txg
== 0);
790 txh
= dmu_tx_hold_object_impl(tx
, tx
->tx_objset
,
791 object
, THT_BONUS
, 0, 0);
793 dmu_tx_count_dnode(txh
);
797 dmu_tx_hold_space(dmu_tx_t
*tx
, uint64_t space
)
801 ASSERT(tx
->tx_txg
== 0);
803 txh
= dmu_tx_hold_object_impl(tx
, tx
->tx_objset
,
804 DMU_NEW_OBJECT
, THT_SPACE
, space
, 0);
806 txh
->txh_space_towrite
+= space
;
810 dmu_tx_holds(dmu_tx_t
*tx
, uint64_t object
)
816 * By asserting that the tx is assigned, we're counting the
817 * number of dn_tx_holds, which is the same as the number of
818 * dn_holds. Otherwise, we'd be counting dn_holds, but
819 * dn_tx_holds could be 0.
821 ASSERT(tx
->tx_txg
!= 0);
823 /* if (tx->tx_anyobj == TRUE) */
826 for (txh
= list_head(&tx
->tx_holds
); txh
;
827 txh
= list_next(&tx
->tx_holds
, txh
)) {
828 if (txh
->txh_dnode
&& txh
->txh_dnode
->dn_object
== object
)
837 dmu_tx_dirty_buf(dmu_tx_t
*tx
, dmu_buf_impl_t
*db
)
840 int match_object
= FALSE
, match_offset
= FALSE
;
846 ASSERT(tx
->tx_txg
!= 0);
847 ASSERT(tx
->tx_objset
== NULL
|| dn
->dn_objset
== tx
->tx_objset
);
848 ASSERT3U(dn
->dn_object
, ==, db
->db
.db_object
);
855 /* XXX No checking on the meta dnode for now */
856 if (db
->db
.db_object
== DMU_META_DNODE_OBJECT
) {
861 for (txh
= list_head(&tx
->tx_holds
); txh
;
862 txh
= list_next(&tx
->tx_holds
, txh
)) {
863 ASSERT3U(dn
->dn_assigned_txg
, ==, tx
->tx_txg
);
864 if (txh
->txh_dnode
== dn
&& txh
->txh_type
!= THT_NEWOBJECT
)
866 if (txh
->txh_dnode
== NULL
|| txh
->txh_dnode
== dn
) {
867 int datablkshift
= dn
->dn_datablkshift
?
868 dn
->dn_datablkshift
: SPA_MAXBLOCKSHIFT
;
869 int epbs
= dn
->dn_indblkshift
- SPA_BLKPTRSHIFT
;
870 int shift
= datablkshift
+ epbs
* db
->db_level
;
871 uint64_t beginblk
= shift
>= 64 ? 0 :
872 (txh
->txh_arg1
>> shift
);
873 uint64_t endblk
= shift
>= 64 ? 0 :
874 ((txh
->txh_arg1
+ txh
->txh_arg2
- 1) >> shift
);
875 uint64_t blkid
= db
->db_blkid
;
877 /* XXX txh_arg2 better not be zero... */
879 dprintf("found txh type %x beginblk=%llx endblk=%llx\n",
880 txh
->txh_type
, beginblk
, endblk
);
882 switch (txh
->txh_type
) {
884 if (blkid
>= beginblk
&& blkid
<= endblk
)
887 * We will let this hold work for the bonus
888 * or spill buffer so that we don't need to
889 * hold it when creating a new object.
891 if (blkid
== DMU_BONUS_BLKID
||
892 blkid
== DMU_SPILL_BLKID
)
895 * They might have to increase nlevels,
896 * thus dirtying the new TLIBs. Or the
897 * might have to change the block size,
898 * thus dirying the new lvl=0 blk=0.
905 * We will dirty all the level 1 blocks in
906 * the free range and perhaps the first and
907 * last level 0 block.
909 if (blkid
>= beginblk
&& (blkid
<= endblk
||
910 txh
->txh_arg2
== DMU_OBJECT_END
))
914 if (blkid
== DMU_SPILL_BLKID
)
918 if (blkid
== DMU_BONUS_BLKID
)
928 ASSERT(!"bad txh_type");
931 if (match_object
&& match_offset
) {
937 panic("dirtying dbuf obj=%llx lvl=%u blkid=%llx but not tx_held\n",
938 (u_longlong_t
)db
->db
.db_object
, db
->db_level
,
939 (u_longlong_t
)db
->db_blkid
);
944 * If we can't do 10 iops, something is wrong. Let us go ahead
945 * and hit zfs_dirty_data_max.
947 hrtime_t zfs_delay_max_ns
= 100 * MICROSEC
; /* 100 milliseconds */
948 int zfs_delay_resolution_ns
= 100 * 1000; /* 100 microseconds */
951 * We delay transactions when we've determined that the backend storage
952 * isn't able to accommodate the rate of incoming writes.
954 * If there is already a transaction waiting, we delay relative to when
955 * that transaction finishes waiting. This way the calculated min_time
956 * is independent of the number of threads concurrently executing
959 * If we are the only waiter, wait relative to when the transaction
960 * started, rather than the current time. This credits the transaction for
961 * "time already served", e.g. reading indirect blocks.
963 * The minimum time for a transaction to take is calculated as:
964 * min_time = scale * (dirty - min) / (max - dirty)
965 * min_time is then capped at zfs_delay_max_ns.
967 * The delay has two degrees of freedom that can be adjusted via tunables.
968 * The percentage of dirty data at which we start to delay is defined by
969 * zfs_delay_min_dirty_percent. This should typically be at or above
970 * zfs_vdev_async_write_active_max_dirty_percent so that we only start to
971 * delay after writing at full speed has failed to keep up with the incoming
972 * write rate. The scale of the curve is defined by zfs_delay_scale. Roughly
973 * speaking, this variable determines the amount of delay at the midpoint of
977 * 10ms +-------------------------------------------------------------*+
993 * 2ms + (midpoint) * +
996 * | zfs_delay_scale ----------> ******** |
997 * 0 +-------------------------------------*********----------------+
998 * 0% <- zfs_dirty_data_max -> 100%
1000 * Note that since the delay is added to the outstanding time remaining on the
1001 * most recent transaction, the delay is effectively the inverse of IOPS.
1002 * Here the midpoint of 500us translates to 2000 IOPS. The shape of the curve
1003 * was chosen such that small changes in the amount of accumulated dirty data
1004 * in the first 3/4 of the curve yield relatively small differences in the
1007 * The effects can be easier to understand when the amount of delay is
1008 * represented on a log scale:
1011 * 100ms +-------------------------------------------------------------++
1020 * + zfs_delay_scale ----------> ***** +
1031 * +--------------------------------------------------------------+
1032 * 0% <- zfs_dirty_data_max -> 100%
1034 * Note here that only as the amount of dirty data approaches its limit does
1035 * the delay start to increase rapidly. The goal of a properly tuned system
1036 * should be to keep the amount of dirty data out of that range by first
1037 * ensuring that the appropriate limits are set for the I/O scheduler to reach
1038 * optimal throughput on the backend storage, and then by changing the value
1039 * of zfs_delay_scale to increase the steepness of the curve.
1042 dmu_tx_delay(dmu_tx_t
*tx
, uint64_t dirty
)
1044 dsl_pool_t
*dp
= tx
->tx_pool
;
1045 uint64_t delay_min_bytes
=
1046 zfs_dirty_data_max
* zfs_delay_min_dirty_percent
/ 100;
1047 hrtime_t wakeup
, min_tx_time
, now
;
1049 if (dirty
<= delay_min_bytes
)
1053 * The caller has already waited until we are under the max.
1054 * We make them pass us the amount of dirty data so we don't
1055 * have to handle the case of it being >= the max, which could
1056 * cause a divide-by-zero if it's == the max.
1058 ASSERT3U(dirty
, <, zfs_dirty_data_max
);
1061 min_tx_time
= zfs_delay_scale
*
1062 (dirty
- delay_min_bytes
) / (zfs_dirty_data_max
- dirty
);
1063 min_tx_time
= MIN(min_tx_time
, zfs_delay_max_ns
);
1064 if (now
> tx
->tx_start
+ min_tx_time
)
1067 DTRACE_PROBE3(delay__mintime
, dmu_tx_t
*, tx
, uint64_t, dirty
,
1068 uint64_t, min_tx_time
);
1070 mutex_enter(&dp
->dp_lock
);
1071 wakeup
= MAX(tx
->tx_start
+ min_tx_time
,
1072 dp
->dp_last_wakeup
+ min_tx_time
);
1073 dp
->dp_last_wakeup
= wakeup
;
1074 mutex_exit(&dp
->dp_lock
);
1076 zfs_sleep_until(wakeup
);
1080 dmu_tx_try_assign(dmu_tx_t
*tx
, txg_how_t txg_how
)
1083 spa_t
*spa
= tx
->tx_pool
->dp_spa
;
1084 uint64_t memory
, asize
, fsize
, usize
;
1085 uint64_t towrite
, tofree
, tooverwrite
, tounref
, tohold
, fudge
;
1087 ASSERT0(tx
->tx_txg
);
1090 DMU_TX_STAT_BUMP(dmu_tx_error
);
1091 return (tx
->tx_err
);
1094 if (spa_suspended(spa
)) {
1095 DMU_TX_STAT_BUMP(dmu_tx_suspended
);
1098 * If the user has indicated a blocking failure mode
1099 * then return ERESTART which will block in dmu_tx_wait().
1100 * Otherwise, return EIO so that an error can get
1101 * propagated back to the VOP calls.
1103 * Note that we always honor the txg_how flag regardless
1104 * of the failuremode setting.
1106 if (spa_get_failmode(spa
) == ZIO_FAILURE_MODE_CONTINUE
&&
1107 txg_how
!= TXG_WAIT
)
1108 return (SET_ERROR(EIO
));
1110 return (SET_ERROR(ERESTART
));
1113 if (!tx
->tx_waited
&&
1114 dsl_pool_need_dirty_delay(tx
->tx_pool
)) {
1115 tx
->tx_wait_dirty
= B_TRUE
;
1116 DMU_TX_STAT_BUMP(dmu_tx_dirty_delay
);
1120 tx
->tx_txg
= txg_hold_open(tx
->tx_pool
, &tx
->tx_txgh
);
1121 tx
->tx_needassign_txh
= NULL
;
1124 * NB: No error returns are allowed after txg_hold_open, but
1125 * before processing the dnode holds, due to the
1126 * dmu_tx_unassign() logic.
1129 towrite
= tofree
= tooverwrite
= tounref
= tohold
= fudge
= 0;
1130 for (txh
= list_head(&tx
->tx_holds
); txh
;
1131 txh
= list_next(&tx
->tx_holds
, txh
)) {
1132 dnode_t
*dn
= txh
->txh_dnode
;
1134 mutex_enter(&dn
->dn_mtx
);
1135 if (dn
->dn_assigned_txg
== tx
->tx_txg
- 1) {
1136 mutex_exit(&dn
->dn_mtx
);
1137 tx
->tx_needassign_txh
= txh
;
1138 DMU_TX_STAT_BUMP(dmu_tx_group
);
1139 return (SET_ERROR(ERESTART
));
1141 if (dn
->dn_assigned_txg
== 0)
1142 dn
->dn_assigned_txg
= tx
->tx_txg
;
1143 ASSERT3U(dn
->dn_assigned_txg
, ==, tx
->tx_txg
);
1144 (void) refcount_add(&dn
->dn_tx_holds
, tx
);
1145 mutex_exit(&dn
->dn_mtx
);
1147 towrite
+= txh
->txh_space_towrite
;
1148 tofree
+= txh
->txh_space_tofree
;
1149 tooverwrite
+= txh
->txh_space_tooverwrite
;
1150 tounref
+= txh
->txh_space_tounref
;
1151 tohold
+= txh
->txh_memory_tohold
;
1152 fudge
+= txh
->txh_fudge
;
1156 * If a snapshot has been taken since we made our estimates,
1157 * assume that we won't be able to free or overwrite anything.
1159 if (tx
->tx_objset
&&
1160 dsl_dataset_prev_snap_txg(tx
->tx_objset
->os_dsl_dataset
) >
1161 tx
->tx_lastsnap_txg
) {
1162 towrite
+= tooverwrite
;
1163 tooverwrite
= tofree
= 0;
1166 /* needed allocation: worst-case estimate of write space */
1167 asize
= spa_get_asize(tx
->tx_pool
->dp_spa
, towrite
+ tooverwrite
);
1168 /* freed space estimate: worst-case overwrite + free estimate */
1169 fsize
= spa_get_asize(tx
->tx_pool
->dp_spa
, tooverwrite
) + tofree
;
1170 /* convert unrefd space to worst-case estimate */
1171 usize
= spa_get_asize(tx
->tx_pool
->dp_spa
, tounref
);
1172 /* calculate memory footprint estimate */
1173 memory
= towrite
+ tooverwrite
+ tohold
;
1177 * Add in 'tohold' to account for our dirty holds on this memory
1178 * XXX - the "fudge" factor is to account for skipped blocks that
1179 * we missed because dnode_next_offset() misses in-core-only blocks.
1181 tx
->tx_space_towrite
= asize
+
1182 spa_get_asize(tx
->tx_pool
->dp_spa
, tohold
+ fudge
);
1183 tx
->tx_space_tofree
= tofree
;
1184 tx
->tx_space_tooverwrite
= tooverwrite
;
1185 tx
->tx_space_tounref
= tounref
;
1188 if (tx
->tx_dir
&& asize
!= 0) {
1189 int err
= dsl_dir_tempreserve_space(tx
->tx_dir
, memory
,
1190 asize
, fsize
, usize
, &tx
->tx_tempreserve_cookie
, tx
);
1195 DMU_TX_STAT_BUMP(dmu_tx_assigned
);
1201 dmu_tx_unassign(dmu_tx_t
*tx
)
1205 if (tx
->tx_txg
== 0)
1208 txg_rele_to_quiesce(&tx
->tx_txgh
);
1211 * Walk the transaction's hold list, removing the hold on the
1212 * associated dnode, and notifying waiters if the refcount drops to 0.
1214 for (txh
= list_head(&tx
->tx_holds
); txh
!= tx
->tx_needassign_txh
;
1215 txh
= list_next(&tx
->tx_holds
, txh
)) {
1216 dnode_t
*dn
= txh
->txh_dnode
;
1220 mutex_enter(&dn
->dn_mtx
);
1221 ASSERT3U(dn
->dn_assigned_txg
, ==, tx
->tx_txg
);
1223 if (refcount_remove(&dn
->dn_tx_holds
, tx
) == 0) {
1224 dn
->dn_assigned_txg
= 0;
1225 cv_broadcast(&dn
->dn_notxholds
);
1227 mutex_exit(&dn
->dn_mtx
);
1230 txg_rele_to_sync(&tx
->tx_txgh
);
1232 tx
->tx_lasttried_txg
= tx
->tx_txg
;
1237 * Assign tx to a transaction group. txg_how can be one of:
1239 * (1) TXG_WAIT. If the current open txg is full, waits until there's
1240 * a new one. This should be used when you're not holding locks.
1241 * It will only fail if we're truly out of space (or over quota).
1243 * (2) TXG_NOWAIT. If we can't assign into the current open txg without
1244 * blocking, returns immediately with ERESTART. This should be used
1245 * whenever you're holding locks. On an ERESTART error, the caller
1246 * should drop locks, do a dmu_tx_wait(tx), and try again.
1248 * (3) TXG_WAITED. Like TXG_NOWAIT, but indicates that dmu_tx_wait()
1249 * has already been called on behalf of this operation (though
1250 * most likely on a different tx).
1253 dmu_tx_assign(dmu_tx_t
*tx
, txg_how_t txg_how
)
1257 ASSERT(tx
->tx_txg
== 0);
1258 ASSERT(txg_how
== TXG_WAIT
|| txg_how
== TXG_NOWAIT
||
1259 txg_how
== TXG_WAITED
);
1260 ASSERT(!dsl_pool_sync_context(tx
->tx_pool
));
1262 if (txg_how
== TXG_WAITED
)
1263 tx
->tx_waited
= B_TRUE
;
1265 /* If we might wait, we must not hold the config lock. */
1266 ASSERT(txg_how
!= TXG_WAIT
|| !dsl_pool_config_held(tx
->tx_pool
));
1268 while ((err
= dmu_tx_try_assign(tx
, txg_how
)) != 0) {
1269 dmu_tx_unassign(tx
);
1271 if (err
!= ERESTART
|| txg_how
!= TXG_WAIT
)
1277 txg_rele_to_quiesce(&tx
->tx_txgh
);
1283 dmu_tx_wait(dmu_tx_t
*tx
)
1285 spa_t
*spa
= tx
->tx_pool
->dp_spa
;
1286 dsl_pool_t
*dp
= tx
->tx_pool
;
1289 ASSERT(tx
->tx_txg
== 0);
1290 ASSERT(!dsl_pool_config_held(tx
->tx_pool
));
1292 before
= gethrtime();
1294 if (tx
->tx_wait_dirty
) {
1298 * dmu_tx_try_assign() has determined that we need to wait
1299 * because we've consumed much or all of the dirty buffer
1302 mutex_enter(&dp
->dp_lock
);
1303 if (dp
->dp_dirty_total
>= zfs_dirty_data_max
)
1304 DMU_TX_STAT_BUMP(dmu_tx_dirty_over_max
);
1305 while (dp
->dp_dirty_total
>= zfs_dirty_data_max
)
1306 cv_wait(&dp
->dp_spaceavail_cv
, &dp
->dp_lock
);
1307 dirty
= dp
->dp_dirty_total
;
1308 mutex_exit(&dp
->dp_lock
);
1310 dmu_tx_delay(tx
, dirty
);
1312 tx
->tx_wait_dirty
= B_FALSE
;
1315 * Note: setting tx_waited only has effect if the caller
1316 * used TX_WAIT. Otherwise they are going to destroy
1317 * this tx and try again. The common case, zfs_write(),
1320 tx
->tx_waited
= B_TRUE
;
1321 } else if (spa_suspended(spa
) || tx
->tx_lasttried_txg
== 0) {
1323 * If the pool is suspended we need to wait until it
1324 * is resumed. Note that it's possible that the pool
1325 * has become active after this thread has tried to
1326 * obtain a tx. If that's the case then tx_lasttried_txg
1327 * would not have been set.
1329 txg_wait_synced(dp
, spa_last_synced_txg(spa
) + 1);
1330 } else if (tx
->tx_needassign_txh
) {
1331 dnode_t
*dn
= tx
->tx_needassign_txh
->txh_dnode
;
1333 mutex_enter(&dn
->dn_mtx
);
1334 while (dn
->dn_assigned_txg
== tx
->tx_lasttried_txg
- 1)
1335 cv_wait(&dn
->dn_notxholds
, &dn
->dn_mtx
);
1336 mutex_exit(&dn
->dn_mtx
);
1337 tx
->tx_needassign_txh
= NULL
;
1340 * A dnode is assigned to the quiescing txg. Wait for its
1341 * transaction to complete.
1343 txg_wait_open(tx
->tx_pool
, tx
->tx_lasttried_txg
+ 1);
1346 spa_tx_assign_add_nsecs(spa
, gethrtime() - before
);
1350 dmu_tx_willuse_space(dmu_tx_t
*tx
, int64_t delta
)
1353 if (tx
->tx_dir
== NULL
|| delta
== 0)
1357 ASSERT3U(refcount_count(&tx
->tx_space_written
) + delta
, <=,
1358 tx
->tx_space_towrite
);
1359 (void) refcount_add_many(&tx
->tx_space_written
, delta
, NULL
);
1361 (void) refcount_add_many(&tx
->tx_space_freed
, -delta
, NULL
);
1367 dmu_tx_commit(dmu_tx_t
*tx
)
1371 ASSERT(tx
->tx_txg
!= 0);
1374 * Go through the transaction's hold list and remove holds on
1375 * associated dnodes, notifying waiters if no holds remain.
1377 while ((txh
= list_head(&tx
->tx_holds
))) {
1378 dnode_t
*dn
= txh
->txh_dnode
;
1380 list_remove(&tx
->tx_holds
, txh
);
1381 kmem_free(txh
, sizeof (dmu_tx_hold_t
));
1384 mutex_enter(&dn
->dn_mtx
);
1385 ASSERT3U(dn
->dn_assigned_txg
, ==, tx
->tx_txg
);
1387 if (refcount_remove(&dn
->dn_tx_holds
, tx
) == 0) {
1388 dn
->dn_assigned_txg
= 0;
1389 cv_broadcast(&dn
->dn_notxholds
);
1391 mutex_exit(&dn
->dn_mtx
);
1395 if (tx
->tx_tempreserve_cookie
)
1396 dsl_dir_tempreserve_clear(tx
->tx_tempreserve_cookie
, tx
);
1398 if (!list_is_empty(&tx
->tx_callbacks
))
1399 txg_register_callbacks(&tx
->tx_txgh
, &tx
->tx_callbacks
);
1401 if (tx
->tx_anyobj
== FALSE
)
1402 txg_rele_to_sync(&tx
->tx_txgh
);
1404 list_destroy(&tx
->tx_callbacks
);
1405 list_destroy(&tx
->tx_holds
);
1407 dprintf("towrite=%llu written=%llu tofree=%llu freed=%llu\n",
1408 tx
->tx_space_towrite
, refcount_count(&tx
->tx_space_written
),
1409 tx
->tx_space_tofree
, refcount_count(&tx
->tx_space_freed
));
1410 refcount_destroy_many(&tx
->tx_space_written
,
1411 refcount_count(&tx
->tx_space_written
));
1412 refcount_destroy_many(&tx
->tx_space_freed
,
1413 refcount_count(&tx
->tx_space_freed
));
1415 kmem_free(tx
, sizeof (dmu_tx_t
));
1419 dmu_tx_abort(dmu_tx_t
*tx
)
1423 ASSERT(tx
->tx_txg
== 0);
1425 while ((txh
= list_head(&tx
->tx_holds
))) {
1426 dnode_t
*dn
= txh
->txh_dnode
;
1428 list_remove(&tx
->tx_holds
, txh
);
1429 kmem_free(txh
, sizeof (dmu_tx_hold_t
));
1435 * Call any registered callbacks with an error code.
1437 if (!list_is_empty(&tx
->tx_callbacks
))
1438 dmu_tx_do_callbacks(&tx
->tx_callbacks
, ECANCELED
);
1440 list_destroy(&tx
->tx_callbacks
);
1441 list_destroy(&tx
->tx_holds
);
1443 refcount_destroy_many(&tx
->tx_space_written
,
1444 refcount_count(&tx
->tx_space_written
));
1445 refcount_destroy_many(&tx
->tx_space_freed
,
1446 refcount_count(&tx
->tx_space_freed
));
1448 kmem_free(tx
, sizeof (dmu_tx_t
));
1452 dmu_tx_get_txg(dmu_tx_t
*tx
)
1454 ASSERT(tx
->tx_txg
!= 0);
1455 return (tx
->tx_txg
);
1459 dmu_tx_pool(dmu_tx_t
*tx
)
1461 ASSERT(tx
->tx_pool
!= NULL
);
1462 return (tx
->tx_pool
);
1466 dmu_tx_callback_register(dmu_tx_t
*tx
, dmu_tx_callback_func_t
*func
, void *data
)
1468 dmu_tx_callback_t
*dcb
;
1470 dcb
= kmem_alloc(sizeof (dmu_tx_callback_t
), KM_PUSHPAGE
);
1472 dcb
->dcb_func
= func
;
1473 dcb
->dcb_data
= data
;
1475 list_insert_tail(&tx
->tx_callbacks
, dcb
);
1479 * Call all the commit callbacks on a list, with a given error code.
1482 dmu_tx_do_callbacks(list_t
*cb_list
, int error
)
1484 dmu_tx_callback_t
*dcb
;
1486 while ((dcb
= list_head(cb_list
))) {
1487 list_remove(cb_list
, dcb
);
1488 dcb
->dcb_func(dcb
->dcb_data
, error
);
1489 kmem_free(dcb
, sizeof (dmu_tx_callback_t
));
1494 * Interface to hold a bunch of attributes.
1495 * used for creating new files.
1496 * attrsize is the total size of all attributes
1497 * to be added during object creation
1499 * For updating/adding a single attribute dmu_tx_hold_sa() should be used.
1503 * hold necessary attribute name for attribute registration.
1504 * should be a very rare case where this is needed. If it does
1505 * happen it would only happen on the first write to the file system.
1508 dmu_tx_sa_registration_hold(sa_os_t
*sa
, dmu_tx_t
*tx
)
1512 if (!sa
->sa_need_attr_registration
)
1515 for (i
= 0; i
!= sa
->sa_num_attrs
; i
++) {
1516 if (!sa
->sa_attr_table
[i
].sa_registered
) {
1517 if (sa
->sa_reg_attr_obj
)
1518 dmu_tx_hold_zap(tx
, sa
->sa_reg_attr_obj
,
1519 B_TRUE
, sa
->sa_attr_table
[i
].sa_name
);
1521 dmu_tx_hold_zap(tx
, DMU_NEW_OBJECT
,
1522 B_TRUE
, sa
->sa_attr_table
[i
].sa_name
);
1529 dmu_tx_hold_spill(dmu_tx_t
*tx
, uint64_t object
)
1534 txh
= dmu_tx_hold_object_impl(tx
, tx
->tx_objset
, object
,
1539 dn
= txh
->txh_dnode
;
1544 /* If blkptr doesn't exist then add space to towrite */
1545 if (!(dn
->dn_phys
->dn_flags
& DNODE_FLAG_SPILL_BLKPTR
)) {
1546 txh
->txh_space_towrite
+= SPA_MAXBLOCKSIZE
;
1550 bp
= &dn
->dn_phys
->dn_spill
;
1551 if (dsl_dataset_block_freeable(dn
->dn_objset
->os_dsl_dataset
,
1553 txh
->txh_space_tooverwrite
+= SPA_MAXBLOCKSIZE
;
1555 txh
->txh_space_towrite
+= SPA_MAXBLOCKSIZE
;
1556 if (!BP_IS_HOLE(bp
))
1557 txh
->txh_space_tounref
+= SPA_MAXBLOCKSIZE
;
1562 dmu_tx_hold_sa_create(dmu_tx_t
*tx
, int attrsize
)
1564 sa_os_t
*sa
= tx
->tx_objset
->os_sa
;
1566 dmu_tx_hold_bonus(tx
, DMU_NEW_OBJECT
);
1568 if (tx
->tx_objset
->os_sa
->sa_master_obj
== 0)
1571 if (tx
->tx_objset
->os_sa
->sa_layout_attr_obj
)
1572 dmu_tx_hold_zap(tx
, sa
->sa_layout_attr_obj
, B_TRUE
, NULL
);
1574 dmu_tx_hold_zap(tx
, sa
->sa_master_obj
, B_TRUE
, SA_LAYOUTS
);
1575 dmu_tx_hold_zap(tx
, sa
->sa_master_obj
, B_TRUE
, SA_REGISTRY
);
1576 dmu_tx_hold_zap(tx
, DMU_NEW_OBJECT
, B_TRUE
, NULL
);
1577 dmu_tx_hold_zap(tx
, DMU_NEW_OBJECT
, B_TRUE
, NULL
);
1580 dmu_tx_sa_registration_hold(sa
, tx
);
1582 if (attrsize
<= DN_MAX_BONUSLEN
&& !sa
->sa_force_spill
)
1585 (void) dmu_tx_hold_object_impl(tx
, tx
->tx_objset
, DMU_NEW_OBJECT
,
1592 * dmu_tx_hold_sa(dmu_tx_t *tx, sa_handle_t *, attribute, add, size)
1594 * variable_size is the total size of all variable sized attributes
1595 * passed to this function. It is not the total size of all
1596 * variable size attributes that *may* exist on this object.
1599 dmu_tx_hold_sa(dmu_tx_t
*tx
, sa_handle_t
*hdl
, boolean_t may_grow
)
1602 sa_os_t
*sa
= tx
->tx_objset
->os_sa
;
1604 ASSERT(hdl
!= NULL
);
1606 object
= sa_handle_object(hdl
);
1608 dmu_tx_hold_bonus(tx
, object
);
1610 if (tx
->tx_objset
->os_sa
->sa_master_obj
== 0)
1613 if (tx
->tx_objset
->os_sa
->sa_reg_attr_obj
== 0 ||
1614 tx
->tx_objset
->os_sa
->sa_layout_attr_obj
== 0) {
1615 dmu_tx_hold_zap(tx
, sa
->sa_master_obj
, B_TRUE
, SA_LAYOUTS
);
1616 dmu_tx_hold_zap(tx
, sa
->sa_master_obj
, B_TRUE
, SA_REGISTRY
);
1617 dmu_tx_hold_zap(tx
, DMU_NEW_OBJECT
, B_TRUE
, NULL
);
1618 dmu_tx_hold_zap(tx
, DMU_NEW_OBJECT
, B_TRUE
, NULL
);
1621 dmu_tx_sa_registration_hold(sa
, tx
);
1623 if (may_grow
&& tx
->tx_objset
->os_sa
->sa_layout_attr_obj
)
1624 dmu_tx_hold_zap(tx
, sa
->sa_layout_attr_obj
, B_TRUE
, NULL
);
1626 if (sa
->sa_force_spill
|| may_grow
|| hdl
->sa_spill
) {
1627 ASSERT(tx
->tx_txg
== 0);
1628 dmu_tx_hold_spill(tx
, object
);
1630 dmu_buf_impl_t
*db
= (dmu_buf_impl_t
*)hdl
->sa_bonus
;
1635 if (dn
->dn_have_spill
) {
1636 ASSERT(tx
->tx_txg
== 0);
1637 dmu_tx_hold_spill(tx
, object
);
1646 dmu_tx_ksp
= kstat_create("zfs", 0, "dmu_tx", "misc",
1647 KSTAT_TYPE_NAMED
, sizeof (dmu_tx_stats
) / sizeof (kstat_named_t
),
1648 KSTAT_FLAG_VIRTUAL
);
1650 if (dmu_tx_ksp
!= NULL
) {
1651 dmu_tx_ksp
->ks_data
= &dmu_tx_stats
;
1652 kstat_install(dmu_tx_ksp
);
1659 if (dmu_tx_ksp
!= NULL
) {
1660 kstat_delete(dmu_tx_ksp
);
1665 #if defined(_KERNEL) && defined(HAVE_SPL)
1666 EXPORT_SYMBOL(dmu_tx_create
);
1667 EXPORT_SYMBOL(dmu_tx_hold_write
);
1668 EXPORT_SYMBOL(dmu_tx_hold_free
);
1669 EXPORT_SYMBOL(dmu_tx_hold_zap
);
1670 EXPORT_SYMBOL(dmu_tx_hold_bonus
);
1671 EXPORT_SYMBOL(dmu_tx_abort
);
1672 EXPORT_SYMBOL(dmu_tx_assign
);
1673 EXPORT_SYMBOL(dmu_tx_wait
);
1674 EXPORT_SYMBOL(dmu_tx_commit
);
1675 EXPORT_SYMBOL(dmu_tx_get_txg
);
1676 EXPORT_SYMBOL(dmu_tx_callback_register
);
1677 EXPORT_SYMBOL(dmu_tx_do_callbacks
);
1678 EXPORT_SYMBOL(dmu_tx_hold_spill
);
1679 EXPORT_SYMBOL(dmu_tx_hold_sa_create
);
1680 EXPORT_SYMBOL(dmu_tx_hold_sa
);