Implementation of block cloning for ZFS
Block Cloning allows to manually clone a file (or a subset of its blocks) into another (or the same) file by just creating additional references to the data blocks without copying the data itself. Those references are kept in the Block Reference Tables (BRTs). The whole design of block cloning is documented in module/zfs/brt.c. Reviewed-by: Alexander Motin <mav@FreeBSD.org> Reviewed-by: Christian Schwarz <christian.schwarz@nutanix.com> Reviewed-by: Brian Behlendorf <behlendorf1@llnl.gov> Reviewed-by: Rich Ercolani <rincebrain@gmail.com> Signed-off-by: Pawel Jakub Dawidek <pawel@dawidek.net> Closes #13392
This commit is contained in:
parent
da19d919a8
commit
67a1b03791
@ -307,6 +307,23 @@ zil_prt_rec_acl(zilog_t *zilog, int txtype, const void *arg)
|
||||
(u_longlong_t)lr->lr_foid, (u_longlong_t)lr->lr_aclcnt);
|
||||
}
|
||||
|
||||
static void
|
||||
zil_prt_rec_clone_range(zilog_t *zilog, int txtype, const void *arg)
|
||||
{
|
||||
(void) zilog, (void) txtype;
|
||||
const lr_clone_range_t *lr = arg;
|
||||
|
||||
(void) printf("%sfoid %llu, offset %llx, length %llx, blksize %llx\n",
|
||||
tab_prefix, (u_longlong_t)lr->lr_foid, (u_longlong_t)lr->lr_offset,
|
||||
(u_longlong_t)lr->lr_length, (u_longlong_t)lr->lr_blksz);
|
||||
|
||||
for (unsigned int i = 0; i < lr->lr_nbps; i++) {
|
||||
(void) printf("%s[%u/%llu] ", tab_prefix, i + 1,
|
||||
(u_longlong_t)lr->lr_nbps);
|
||||
print_log_bp(&lr->lr_bps[i], "");
|
||||
}
|
||||
}
|
||||
|
||||
typedef void (*zil_prt_rec_func_t)(zilog_t *, int, const void *);
|
||||
typedef struct zil_rec_info {
|
||||
zil_prt_rec_func_t zri_print;
|
||||
@ -340,6 +357,8 @@ static zil_rec_info_t zil_rec_info[TX_MAX_TYPE] = {
|
||||
.zri_name = "TX_SETSAXATTR "},
|
||||
{.zri_print = zil_prt_rec_rename, .zri_name = "TX_RENAME_EXCHANGE "},
|
||||
{.zri_print = zil_prt_rec_rename, .zri_name = "TX_RENAME_WHITEOUT "},
|
||||
{.zri_print = zil_prt_rec_clone_range,
|
||||
.zri_name = "TX_CLONE_RANGE "},
|
||||
};
|
||||
|
||||
static int
|
||||
|
@ -1902,7 +1902,7 @@ ztest_log_write(ztest_ds_t *zd, dmu_tx_t *tx, lr_write_t *lr)
|
||||
if (zil_replaying(zd->zd_zilog, tx))
|
||||
return;
|
||||
|
||||
if (lr->lr_length > zil_max_log_data(zd->zd_zilog))
|
||||
if (lr->lr_length > zil_max_log_data(zd->zd_zilog, sizeof (lr_write_t)))
|
||||
write_state = WR_INDIRECT;
|
||||
|
||||
itx = zil_itx_create(TX_WRITE,
|
||||
|
@ -23,6 +23,7 @@ COMMON_H = \
|
||||
sys/asm_linkage.h \
|
||||
sys/avl.h \
|
||||
sys/avl_impl.h \
|
||||
sys/bitmap.h \
|
||||
sys/bitops.h \
|
||||
sys/blake3.h \
|
||||
sys/blkptr.h \
|
||||
@ -31,6 +32,7 @@ COMMON_H = \
|
||||
sys/bptree.h \
|
||||
sys/bqueue.h \
|
||||
sys/btree.h \
|
||||
sys/brt.h \
|
||||
sys/dataset_kstats.h \
|
||||
sys/dbuf.h \
|
||||
sys/ddt.h \
|
||||
|
@ -119,7 +119,8 @@ typedef struct zfs_soft_state {
|
||||
#define zn_has_cached_data(zp, start, end) \
|
||||
vn_has_cached_data(ZTOV(zp))
|
||||
#define zn_flush_cached_data(zp, sync) vn_flush_cached_data(ZTOV(zp), sync)
|
||||
#define zn_rlimit_fsize(zp, uio) \
|
||||
#define zn_rlimit_fsize(size) zfs_rlimit_fsize(size)
|
||||
#define zn_rlimit_fsize_uio(zp, uio) \
|
||||
vn_rlimit_fsize(ZTOV(zp), GET_UIO_STRUCT(uio), zfs_uio_td(uio))
|
||||
|
||||
/* Called on entry to each ZFS vnode and vfs operation */
|
||||
@ -179,6 +180,8 @@ extern zil_replay_func_t *const zfs_replay_vector[TX_MAX_TYPE];
|
||||
|
||||
extern int zfs_znode_parent_and_name(struct znode *zp, struct znode **dzpp,
|
||||
char *buf);
|
||||
|
||||
extern int zfs_rlimit_fsize(off_t fsize);
|
||||
#ifdef __cplusplus
|
||||
}
|
||||
#endif
|
||||
|
@ -47,6 +47,7 @@ typedef const struct kernel_param zfs_kernel_param_t;
|
||||
enum scope_prefix_types {
|
||||
zfs,
|
||||
zfs_arc,
|
||||
zfs_brt,
|
||||
zfs_condense,
|
||||
zfs_dbuf,
|
||||
zfs_dbuf_cache,
|
||||
|
@ -86,7 +86,8 @@ extern "C" {
|
||||
#endif
|
||||
|
||||
#define zn_flush_cached_data(zp, sync) write_inode_now(ZTOI(zp), sync)
|
||||
#define zn_rlimit_fsize(zp, uio) (0)
|
||||
#define zn_rlimit_fsize(size) (0)
|
||||
#define zn_rlimit_fsize_uio(zp, uio) (0)
|
||||
|
||||
/*
|
||||
* zhold() wraps igrab() on Linux, and igrab() may fail when the
|
||||
|
93
include/sys/bitmap.h
Normal file
93
include/sys/bitmap.h
Normal file
@ -0,0 +1,93 @@
|
||||
/*
|
||||
* CDDL HEADER START
|
||||
*
|
||||
* The contents of this file are subject to the terms of the
|
||||
* Common Development and Distribution License (the "License").
|
||||
* You may not use this file except in compliance with the License.
|
||||
*
|
||||
* You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
|
||||
* or http://www.opensolaris.org/os/licensing.
|
||||
* See the License for the specific language governing permissions
|
||||
* and limitations under the License.
|
||||
*
|
||||
* When distributing Covered Code, include this CDDL HEADER in each
|
||||
* file and include the License file at usr/src/OPENSOLARIS.LICENSE.
|
||||
* If applicable, add the following below this CDDL HEADER, with the
|
||||
* fields enclosed by brackets "[]" replaced with your own identifying
|
||||
* information: Portions Copyright [yyyy] [name of copyright owner]
|
||||
*
|
||||
* CDDL HEADER END
|
||||
*/
|
||||
|
||||
/*
|
||||
* Copyright 2006 Sun Microsystems, Inc. All rights reserved.
|
||||
* Use is subject to license terms.
|
||||
*/
|
||||
|
||||
/* Copyright (c) 1984, 1986, 1987, 1988, 1989 AT&T */
|
||||
/* All Rights Reserved */
|
||||
|
||||
|
||||
#ifndef _SYS_BITMAP_H
|
||||
#define _SYS_BITMAP_H
|
||||
|
||||
#ifdef __cplusplus
|
||||
extern "C" {
|
||||
#endif
|
||||
|
||||
/*
|
||||
* Operations on bitmaps of arbitrary size
|
||||
* A bitmap is a vector of 1 or more ulong_t's.
|
||||
* The user of the package is responsible for range checks and keeping
|
||||
* track of sizes.
|
||||
*/
|
||||
|
||||
#ifdef _LP64
|
||||
#define BT_ULSHIFT 6 /* log base 2 of BT_NBIPUL, to extract word index */
|
||||
#define BT_ULSHIFT32 5 /* log base 2 of BT_NBIPUL, to extract word index */
|
||||
#else
|
||||
#define BT_ULSHIFT 5 /* log base 2 of BT_NBIPUL, to extract word index */
|
||||
#endif
|
||||
|
||||
#define BT_NBIPUL (1 << BT_ULSHIFT) /* n bits per ulong_t */
|
||||
#define BT_ULMASK (BT_NBIPUL - 1) /* to extract bit index */
|
||||
|
||||
/*
|
||||
* bitmap is a ulong_t *, bitindex an index_t
|
||||
*
|
||||
* The macros BT_WIM and BT_BIW internal; there is no need
|
||||
* for users of this package to use them.
|
||||
*/
|
||||
|
||||
/*
|
||||
* word in map
|
||||
*/
|
||||
#define BT_WIM(bitmap, bitindex) \
|
||||
((bitmap)[(bitindex) >> BT_ULSHIFT])
|
||||
/*
|
||||
* bit in word
|
||||
*/
|
||||
#define BT_BIW(bitindex) \
|
||||
(1UL << ((bitindex) & BT_ULMASK))
|
||||
|
||||
/*
|
||||
* These are public macros
|
||||
*
|
||||
* BT_BITOUL == n bits to n ulong_t's
|
||||
*/
|
||||
#define BT_BITOUL(nbits) \
|
||||
(((nbits) + BT_NBIPUL - 1l) / BT_NBIPUL)
|
||||
#define BT_SIZEOFMAP(nbits) \
|
||||
(BT_BITOUL(nbits) * sizeof (ulong_t))
|
||||
#define BT_TEST(bitmap, bitindex) \
|
||||
((BT_WIM((bitmap), (bitindex)) & BT_BIW(bitindex)) ? 1 : 0)
|
||||
#define BT_SET(bitmap, bitindex) \
|
||||
{ BT_WIM((bitmap), (bitindex)) |= BT_BIW(bitindex); }
|
||||
#define BT_CLEAR(bitmap, bitindex) \
|
||||
{ BT_WIM((bitmap), (bitindex)) &= ~BT_BIW(bitindex); }
|
||||
|
||||
#ifdef __cplusplus
|
||||
}
|
||||
#endif
|
||||
|
||||
#endif /* _SYS_BITMAP_H */
|
62
include/sys/brt.h
Normal file
62
include/sys/brt.h
Normal file
@ -0,0 +1,62 @@
|
||||
/*
|
||||
* CDDL HEADER START
|
||||
*
|
||||
* The contents of this file are subject to the terms of the
|
||||
* Common Development and Distribution License (the "License").
|
||||
* You may not use this file except in compliance with the License.
|
||||
*
|
||||
* You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
|
||||
* or http://www.opensolaris.org/os/licensing.
|
||||
* See the License for the specific language governing permissions
|
||||
* and limitations under the License.
|
||||
*
|
||||
* When distributing Covered Code, include this CDDL HEADER in each
|
||||
* file and include the License file at usr/src/OPENSOLARIS.LICENSE.
|
||||
* If applicable, add the following below this CDDL HEADER, with the
|
||||
* fields enclosed by brackets "[]" replaced with your own identifying
|
||||
* information: Portions Copyright [yyyy] [name of copyright owner]
|
||||
*
|
||||
* CDDL HEADER END
|
||||
*/
|
||||
/*
|
||||
* Copyright (c) 2020, 2021, 2022 by Pawel Jakub Dawidek
|
||||
*/
|
||||
|
||||
#ifndef _SYS_BRT_H
|
||||
#define _SYS_BRT_H
|
||||
|
||||
#include <sys/sysmacros.h>
|
||||
#include <sys/types.h>
|
||||
#include <sys/fs/zfs.h>
|
||||
#include <sys/zio.h>
|
||||
#include <sys/dmu.h>
|
||||
|
||||
#ifdef __cplusplus
|
||||
extern "C" {
|
||||
#endif
|
||||
|
||||
extern boolean_t brt_entry_decref(spa_t *spa, const blkptr_t *bp);
|
||||
|
||||
extern uint64_t brt_get_dspace(spa_t *spa);
|
||||
extern uint64_t brt_get_used(spa_t *spa);
|
||||
extern uint64_t brt_get_saved(spa_t *spa);
|
||||
extern uint64_t brt_get_ratio(spa_t *spa);
|
||||
|
||||
extern boolean_t brt_maybe_exists(spa_t *spa, const blkptr_t *bp);
|
||||
extern void brt_init(void);
|
||||
extern void brt_fini(void);
|
||||
|
||||
extern void brt_pending_add(spa_t *spa, const blkptr_t *bp, dmu_tx_t *tx);
|
||||
extern void brt_pending_remove(spa_t *spa, const blkptr_t *bp, dmu_tx_t *tx);
|
||||
extern void brt_pending_apply(spa_t *spa, uint64_t txg);
|
||||
|
||||
extern void brt_create(spa_t *spa);
|
||||
extern int brt_load(spa_t *spa);
|
||||
extern void brt_unload(spa_t *spa);
|
||||
extern void brt_sync(spa_t *spa, uint64_t txg);
|
||||
|
||||
#ifdef __cplusplus
|
||||
}
|
||||
#endif
|
||||
|
||||
#endif /* _SYS_BRT_H */
|
@ -172,6 +172,7 @@ typedef struct dbuf_dirty_record {
|
||||
override_states_t dr_override_state;
|
||||
uint8_t dr_copies;
|
||||
boolean_t dr_nopwrite;
|
||||
boolean_t dr_brtwrite;
|
||||
boolean_t dr_has_raw_params;
|
||||
|
||||
/*
|
||||
|
@ -248,6 +248,8 @@ extern int ddt_walk(spa_t *spa, ddt_bookmark_t *ddb, ddt_entry_t *dde);
|
||||
extern int ddt_object_update(ddt_t *ddt, enum ddt_type type,
|
||||
enum ddt_class clazz, ddt_entry_t *dde, dmu_tx_t *tx);
|
||||
|
||||
extern boolean_t ddt_addref(spa_t *spa, const blkptr_t *bp);
|
||||
|
||||
extern const ddt_ops_t ddt_zap_ops;
|
||||
|
||||
#ifdef __cplusplus
|
||||
|
@ -782,6 +782,8 @@ dmu_tx_t *dmu_tx_create(objset_t *os);
|
||||
void dmu_tx_hold_write(dmu_tx_t *tx, uint64_t object, uint64_t off, int len);
|
||||
void dmu_tx_hold_write_by_dnode(dmu_tx_t *tx, dnode_t *dn, uint64_t off,
|
||||
int len);
|
||||
void dmu_tx_hold_clone_by_dnode(dmu_tx_t *tx, dnode_t *dn, uint64_t off,
|
||||
int len);
|
||||
void dmu_tx_hold_free(dmu_tx_t *tx, uint64_t object, uint64_t off,
|
||||
uint64_t len);
|
||||
void dmu_tx_hold_free_by_dnode(dmu_tx_t *tx, dnode_t *dn, uint64_t off,
|
||||
@ -1059,6 +1061,12 @@ int dmu_sync(struct zio *zio, uint64_t txg, dmu_sync_cb_t *done, zgd_t *zgd);
|
||||
int dmu_offset_next(objset_t *os, uint64_t object, boolean_t hole,
|
||||
uint64_t *off);
|
||||
|
||||
int dmu_read_l0_bps(objset_t *os, uint64_t object, uint64_t offset,
|
||||
uint64_t length, dmu_tx_t *tx, struct blkptr *bps, size_t *nbpsp);
|
||||
void dmu_brt_clone(objset_t *os, uint64_t object, uint64_t offset,
|
||||
uint64_t length, dmu_tx_t *tx, const struct blkptr *bps, size_t nbps,
|
||||
boolean_t replay);
|
||||
|
||||
/*
|
||||
* Initial setup and final teardown.
|
||||
*/
|
||||
|
@ -90,6 +90,7 @@ enum dmu_tx_hold_type {
|
||||
THT_ZAP,
|
||||
THT_SPACE,
|
||||
THT_SPILL,
|
||||
THT_CLONE,
|
||||
THT_NUMTYPES
|
||||
};
|
||||
|
||||
|
@ -253,6 +253,9 @@ typedef enum {
|
||||
ZPOOL_PROP_LOAD_GUID,
|
||||
ZPOOL_PROP_AUTOTRIM,
|
||||
ZPOOL_PROP_COMPATIBILITY,
|
||||
ZPOOL_PROP_BCLONEUSED,
|
||||
ZPOOL_PROP_BCLONESAVED,
|
||||
ZPOOL_PROP_BCLONERATIO,
|
||||
ZPOOL_NUM_PROPS
|
||||
} zpool_prop_t;
|
||||
|
||||
|
@ -380,6 +380,7 @@ struct spa {
|
||||
uint64_t spa_dedup_dspace; /* Cache get_dedup_dspace() */
|
||||
uint64_t spa_dedup_checksum; /* default dedup checksum */
|
||||
uint64_t spa_dspace; /* dspace in normal class */
|
||||
struct brt *spa_brt; /* in-core BRT */
|
||||
kmutex_t spa_vdev_top_lock; /* dueling offline/remove */
|
||||
kmutex_t spa_proc_lock; /* protects spa_proc* */
|
||||
kcondvar_t spa_proc_cv; /* spa_proc_state transitions */
|
||||
|
@ -57,6 +57,7 @@ extern int zfs_dbgmsg_enable;
|
||||
#define ZFS_DEBUG_TRIM (1 << 11)
|
||||
#define ZFS_DEBUG_LOG_SPACEMAP (1 << 12)
|
||||
#define ZFS_DEBUG_METASLAB_ALLOC (1 << 13)
|
||||
#define ZFS_DEBUG_BRT (1 << 14)
|
||||
|
||||
extern void __set_error(const char *file, const char *func, int line, int err);
|
||||
extern void __zfs_dbgmsg(char *buf);
|
||||
|
@ -31,6 +31,10 @@ extern int zfs_read(znode_t *, zfs_uio_t *, int, cred_t *);
|
||||
extern int zfs_write(znode_t *, zfs_uio_t *, int, cred_t *);
|
||||
extern int zfs_holey(znode_t *, ulong_t, loff_t *);
|
||||
extern int zfs_access(znode_t *, int, int, cred_t *);
|
||||
extern int zfs_clone_range(znode_t *, uint64_t *, znode_t *, uint64_t *,
|
||||
uint64_t *, cred_t *);
|
||||
extern int zfs_clone_range_replay(znode_t *, uint64_t, uint64_t, uint64_t,
|
||||
const blkptr_t *, size_t);
|
||||
|
||||
extern int zfs_getsecattr(znode_t *, vsecattr_t *, int, cred_t *);
|
||||
extern int zfs_setsecattr(znode_t *, vsecattr_t *, int, cred_t *);
|
||||
|
@ -315,6 +315,9 @@ extern void zfs_log_setattr(zilog_t *zilog, dmu_tx_t *tx, int txtype,
|
||||
znode_t *zp, vattr_t *vap, uint_t mask_applied, zfs_fuid_info_t *fuidp);
|
||||
extern void zfs_log_acl(zilog_t *zilog, dmu_tx_t *tx, znode_t *zp,
|
||||
vsecattr_t *vsecp, zfs_fuid_info_t *fuidp);
|
||||
extern void zfs_log_clone_range(zilog_t *zilog, dmu_tx_t *tx, int txtype,
|
||||
znode_t *zp, uint64_t offset, uint64_t length, uint64_t blksz,
|
||||
const blkptr_t *bps, size_t nbps);
|
||||
extern void zfs_xvattr_set(znode_t *zp, xvattr_t *xvap, dmu_tx_t *tx);
|
||||
extern void zfs_upgrade(zfsvfs_t *zfsvfs, dmu_tx_t *tx);
|
||||
extern void zfs_log_setsaxattr(zilog_t *zilog, dmu_tx_t *tx, int txtype,
|
||||
|
@ -166,7 +166,8 @@ typedef enum zil_create {
|
||||
#define TX_SETSAXATTR 21 /* Set sa xattrs on file */
|
||||
#define TX_RENAME_EXCHANGE 22 /* Atomic swap via renameat2 */
|
||||
#define TX_RENAME_WHITEOUT 23 /* Atomic whiteout via renameat2 */
|
||||
#define TX_MAX_TYPE 24 /* Max transaction type */
|
||||
#define TX_CLONE_RANGE 24 /* Clone a file range */
|
||||
#define TX_MAX_TYPE 25 /* Max transaction type */
|
||||
|
||||
/*
|
||||
* The transactions for mkdir, symlink, remove, rmdir, link, and rename
|
||||
@ -176,9 +177,9 @@ typedef enum zil_create {
|
||||
#define TX_CI ((uint64_t)0x1 << 63) /* case-insensitive behavior requested */
|
||||
|
||||
/*
|
||||
* Transactions for write, truncate, setattr, acl_v0, and acl can be logged
|
||||
* out of order. For convenience in the code, all such records must have
|
||||
* lr_foid at the same offset.
|
||||
* Transactions for operations below can be logged out of order.
|
||||
* For convenience in the code, all such records must have lr_foid
|
||||
* at the same offset.
|
||||
*/
|
||||
#define TX_OOO(txtype) \
|
||||
((txtype) == TX_WRITE || \
|
||||
@ -187,7 +188,8 @@ typedef enum zil_create {
|
||||
(txtype) == TX_ACL_V0 || \
|
||||
(txtype) == TX_ACL || \
|
||||
(txtype) == TX_WRITE2 || \
|
||||
(txtype) == TX_SETSAXATTR)
|
||||
(txtype) == TX_SETSAXATTR || \
|
||||
(txtype) == TX_CLONE_RANGE)
|
||||
|
||||
/*
|
||||
* The number of dnode slots consumed by the object is stored in the 8
|
||||
@ -387,6 +389,17 @@ typedef struct {
|
||||
/* lr_acl_bytes number of variable sized ace's follows */
|
||||
} lr_acl_t;
|
||||
|
||||
typedef struct {
|
||||
lr_t lr_common; /* common portion of log record */
|
||||
uint64_t lr_foid; /* file object to clone into */
|
||||
uint64_t lr_offset; /* offset to clone to */
|
||||
uint64_t lr_length; /* length of the blocks to clone */
|
||||
uint64_t lr_blksz; /* file's block size */
|
||||
uint64_t lr_nbps; /* number of block pointers */
|
||||
blkptr_t lr_bps[];
|
||||
/* block pointers of the blocks to clone follows */
|
||||
} lr_clone_range_t;
|
||||
|
||||
/*
|
||||
* ZIL structure definitions, interface function prototype and globals.
|
||||
*/
|
||||
@ -574,7 +587,7 @@ extern void zil_set_sync(zilog_t *zilog, uint64_t syncval);
|
||||
extern void zil_set_logbias(zilog_t *zilog, uint64_t slogval);
|
||||
|
||||
extern uint64_t zil_max_copied_data(zilog_t *zilog);
|
||||
extern uint64_t zil_max_log_data(zilog_t *zilog);
|
||||
extern uint64_t zil_max_log_data(zilog_t *zilog, size_t hdrsize);
|
||||
|
||||
extern void zil_sums_init(zil_sums_t *zs);
|
||||
extern void zil_sums_fini(zil_sums_t *zs);
|
||||
|
@ -348,6 +348,7 @@ typedef struct zio_prop {
|
||||
boolean_t zp_dedup;
|
||||
boolean_t zp_dedup_verify;
|
||||
boolean_t zp_nopwrite;
|
||||
boolean_t zp_brtwrite;
|
||||
boolean_t zp_encrypt;
|
||||
boolean_t zp_byteorder;
|
||||
uint8_t zp_salt[ZIO_DATA_SALT_LEN];
|
||||
@ -556,7 +557,7 @@ extern zio_t *zio_rewrite(zio_t *pio, spa_t *spa, uint64_t txg, blkptr_t *bp,
|
||||
zio_priority_t priority, zio_flag_t flags, zbookmark_phys_t *zb);
|
||||
|
||||
extern void zio_write_override(zio_t *zio, blkptr_t *bp, int copies,
|
||||
boolean_t nopwrite);
|
||||
boolean_t nopwrite, boolean_t brtwrite);
|
||||
|
||||
extern void zio_free(spa_t *spa, uint64_t txg, const blkptr_t *bp);
|
||||
|
||||
|
@ -77,6 +77,12 @@ extern "C" {
|
||||
* and zstd. Compression occurs as part of the write pipeline and is
|
||||
* performed in the ZIO_STAGE_WRITE_BP_INIT stage.
|
||||
*
|
||||
* Block cloning:
|
||||
* The block cloning functionality introduces ZIO_STAGE_BRT_FREE stage which
|
||||
* is called during a free pipeline. If the block is referenced in the
|
||||
* Block Cloning Table (BRT) we will just decrease its reference counter
|
||||
* instead of actually freeing the block.
|
||||
*
|
||||
* Dedup:
|
||||
* Dedup reads are handled by the ZIO_STAGE_DDT_READ_START and
|
||||
* ZIO_STAGE_DDT_READ_DONE stages. These stages are added to an existing
|
||||
@ -127,28 +133,30 @@ enum zio_stage {
|
||||
|
||||
ZIO_STAGE_NOP_WRITE = 1 << 8, /* -W--- */
|
||||
|
||||
ZIO_STAGE_DDT_READ_START = 1 << 9, /* R---- */
|
||||
ZIO_STAGE_DDT_READ_DONE = 1 << 10, /* R---- */
|
||||
ZIO_STAGE_DDT_WRITE = 1 << 11, /* -W--- */
|
||||
ZIO_STAGE_DDT_FREE = 1 << 12, /* --F-- */
|
||||
ZIO_STAGE_BRT_FREE = 1 << 9, /* --F-- */
|
||||
|
||||
ZIO_STAGE_GANG_ASSEMBLE = 1 << 13, /* RWFC- */
|
||||
ZIO_STAGE_GANG_ISSUE = 1 << 14, /* RWFC- */
|
||||
ZIO_STAGE_DDT_READ_START = 1 << 10, /* R---- */
|
||||
ZIO_STAGE_DDT_READ_DONE = 1 << 11, /* R---- */
|
||||
ZIO_STAGE_DDT_WRITE = 1 << 12, /* -W--- */
|
||||
ZIO_STAGE_DDT_FREE = 1 << 13, /* --F-- */
|
||||
|
||||
ZIO_STAGE_DVA_THROTTLE = 1 << 15, /* -W--- */
|
||||
ZIO_STAGE_DVA_ALLOCATE = 1 << 16, /* -W--- */
|
||||
ZIO_STAGE_DVA_FREE = 1 << 17, /* --F-- */
|
||||
ZIO_STAGE_DVA_CLAIM = 1 << 18, /* ---C- */
|
||||
ZIO_STAGE_GANG_ASSEMBLE = 1 << 14, /* RWFC- */
|
||||
ZIO_STAGE_GANG_ISSUE = 1 << 15, /* RWFC- */
|
||||
|
||||
ZIO_STAGE_READY = 1 << 19, /* RWFCI */
|
||||
ZIO_STAGE_DVA_THROTTLE = 1 << 16, /* -W--- */
|
||||
ZIO_STAGE_DVA_ALLOCATE = 1 << 17, /* -W--- */
|
||||
ZIO_STAGE_DVA_FREE = 1 << 18, /* --F-- */
|
||||
ZIO_STAGE_DVA_CLAIM = 1 << 19, /* ---C- */
|
||||
|
||||
ZIO_STAGE_VDEV_IO_START = 1 << 20, /* RW--I */
|
||||
ZIO_STAGE_VDEV_IO_DONE = 1 << 21, /* RW--I */
|
||||
ZIO_STAGE_VDEV_IO_ASSESS = 1 << 22, /* RW--I */
|
||||
ZIO_STAGE_READY = 1 << 20, /* RWFCI */
|
||||
|
||||
ZIO_STAGE_CHECKSUM_VERIFY = 1 << 23, /* R---- */
|
||||
ZIO_STAGE_VDEV_IO_START = 1 << 21, /* RW--I */
|
||||
ZIO_STAGE_VDEV_IO_DONE = 1 << 22, /* RW--I */
|
||||
ZIO_STAGE_VDEV_IO_ASSESS = 1 << 23, /* RW--I */
|
||||
|
||||
ZIO_STAGE_DONE = 1 << 24 /* RWFCI */
|
||||
ZIO_STAGE_CHECKSUM_VERIFY = 1 << 24, /* R---- */
|
||||
|
||||
ZIO_STAGE_DONE = 1 << 25 /* RWFCI */
|
||||
};
|
||||
|
||||
#define ZIO_INTERLOCK_STAGES \
|
||||
@ -233,6 +241,7 @@ enum zio_stage {
|
||||
#define ZIO_FREE_PIPELINE \
|
||||
(ZIO_INTERLOCK_STAGES | \
|
||||
ZIO_STAGE_FREE_BP_INIT | \
|
||||
ZIO_STAGE_BRT_FREE | \
|
||||
ZIO_STAGE_DVA_FREE)
|
||||
|
||||
#define ZIO_DDT_FREE_PIPELINE \
|
||||
|
@ -78,6 +78,7 @@ typedef enum spa_feature {
|
||||
SPA_FEATURE_ZILSAXATTR,
|
||||
SPA_FEATURE_HEAD_ERRLOG,
|
||||
SPA_FEATURE_BLAKE3,
|
||||
SPA_FEATURE_BLOCK_CLONING,
|
||||
SPA_FEATURES
|
||||
} spa_feature_t;
|
||||
|
||||
|
@ -590,7 +590,7 @@
|
||||
<elf-symbol name='fletcher_4_superscalar_ops' size='64' type='object-type' binding='global-binding' visibility='default-visibility' is-defined='yes'/>
|
||||
<elf-symbol name='libzfs_config_ops' size='16' type='object-type' binding='global-binding' visibility='default-visibility' is-defined='yes'/>
|
||||
<elf-symbol name='sa_protocol_names' size='16' type='object-type' binding='global-binding' visibility='default-visibility' is-defined='yes'/>
|
||||
<elf-symbol name='spa_feature_table' size='2072' type='object-type' binding='global-binding' visibility='default-visibility' is-defined='yes'/>
|
||||
<elf-symbol name='spa_feature_table' size='2128' type='object-type' binding='global-binding' visibility='default-visibility' is-defined='yes'/>
|
||||
<elf-symbol name='zfeature_checks_disable' size='4' type='object-type' binding='global-binding' visibility='default-visibility' is-defined='yes'/>
|
||||
<elf-symbol name='zfs_deleg_perm_tab' size='512' type='object-type' binding='global-binding' visibility='default-visibility' is-defined='yes'/>
|
||||
<elf-symbol name='zfs_history_event_names' size='328' type='object-type' binding='global-binding' visibility='default-visibility' is-defined='yes'/>
|
||||
@ -3174,7 +3174,10 @@
|
||||
<enumerator name='ZPOOL_PROP_LOAD_GUID' value='30'/>
|
||||
<enumerator name='ZPOOL_PROP_AUTOTRIM' value='31'/>
|
||||
<enumerator name='ZPOOL_PROP_COMPATIBILITY' value='32'/>
|
||||
<enumerator name='ZPOOL_NUM_PROPS' value='33'/>
|
||||
<enumerator name='ZPOOL_PROP_BCLONEUSED' value='33'/>
|
||||
<enumerator name='ZPOOL_PROP_BCLONESAVED' value='34'/>
|
||||
<enumerator name='ZPOOL_PROP_BCLONERATIO' value='35'/>
|
||||
<enumerator name='ZPOOL_NUM_PROPS' value='36'/>
|
||||
</enum-decl>
|
||||
<typedef-decl name='zpool_prop_t' type-id='af1ba157' id='5d0c23fb'/>
|
||||
<enum-decl name='vdev_prop_t' naming-typedef-id='5aa5c90c' id='1573bec8'>
|
||||
@ -4850,8 +4853,8 @@
|
||||
</function-decl>
|
||||
</abi-instr>
|
||||
<abi-instr address-size='64' path='module/zcommon/zfeature_common.c' language='LANG_C99'>
|
||||
<array-type-def dimensions='1' type-id='83f29ca2' size-in-bits='16576' id='d95b2b0b'>
|
||||
<subrange length='37' type-id='7359adad' id='aa6426fb'/>
|
||||
<array-type-def dimensions='1' type-id='83f29ca2' size-in-bits='17024' id='d95b2b0b'>
|
||||
<subrange length='38' type-id='7359adad' id='aa6426fb'/>
|
||||
</array-type-def>
|
||||
<enum-decl name='spa_feature' id='33ecb627'>
|
||||
<underlying-type type-id='9cac1fee'/>
|
||||
@ -4893,7 +4896,8 @@
|
||||
<enumerator name='SPA_FEATURE_ZILSAXATTR' value='34'/>
|
||||
<enumerator name='SPA_FEATURE_HEAD_ERRLOG' value='35'/>
|
||||
<enumerator name='SPA_FEATURE_BLAKE3' value='36'/>
|
||||
<enumerator name='SPA_FEATURES' value='37'/>
|
||||
<enumerator name='SPA_FEATURE_BLOCK_CLONING' value='37'/>
|
||||
<enumerator name='SPA_FEATURES' value='38'/>
|
||||
</enum-decl>
|
||||
<typedef-decl name='spa_feature_t' type-id='33ecb627' id='d6618c78'/>
|
||||
<enum-decl name='zfeature_flags' id='6db816a4'>
|
||||
|
@ -339,6 +339,8 @@ zpool_get_prop(zpool_handle_t *zhp, zpool_prop_t prop, char *buf,
|
||||
case ZPOOL_PROP_ASHIFT:
|
||||
case ZPOOL_PROP_MAXBLOCKSIZE:
|
||||
case ZPOOL_PROP_MAXDNODESIZE:
|
||||
case ZPOOL_PROP_BCLONESAVED:
|
||||
case ZPOOL_PROP_BCLONEUSED:
|
||||
if (literal)
|
||||
(void) snprintf(buf, len, "%llu",
|
||||
(u_longlong_t)intval);
|
||||
@ -380,6 +382,7 @@ zpool_get_prop(zpool_handle_t *zhp, zpool_prop_t prop, char *buf,
|
||||
}
|
||||
break;
|
||||
|
||||
case ZPOOL_PROP_BCLONERATIO:
|
||||
case ZPOOL_PROP_DEDUPRATIO:
|
||||
if (literal)
|
||||
(void) snprintf(buf, len, "%llu.%02llu",
|
||||
|
@ -74,6 +74,7 @@ nodist_libzpool_la_SOURCES = \
|
||||
module/zfs/bptree.c \
|
||||
module/zfs/bqueue.c \
|
||||
module/zfs/btree.c \
|
||||
module/zfs/brt.c \
|
||||
module/zfs/dbuf.c \
|
||||
module/zfs/dbuf_stats.c \
|
||||
module/zfs/ddt.c \
|
||||
|
@ -347,6 +347,20 @@ BLAKE3 is a secure hash algorithm focused on high performance.
|
||||
.Pp
|
||||
.checksum-spiel blake3
|
||||
.
|
||||
.feature com.fudosecurity block_cloning yes
|
||||
When this feature is enabled ZFS will use block cloning for operations like
|
||||
.Fn copy_file_range 2 .
|
||||
Block cloning allows to create multiple references to a single block.
|
||||
It is much faster than copying the data (as the actual data is neither read nor
|
||||
written) and takes no additional space.
|
||||
Blocks can be cloned across datasets under some conditions (like disabled
|
||||
encryption and equal
|
||||
.Nm recordsize ) .
|
||||
.Pp
|
||||
This feature becomes
|
||||
.Sy active
|
||||
when first block is cloned.
|
||||
When the last cloned block is freed, it goes back to the enabled state.
|
||||
.feature com.delphix bookmarks yes extensible_dataset
|
||||
This feature enables use of the
|
||||
.Nm zfs Cm bookmark
|
||||
|
@ -42,13 +42,26 @@ change the behavior of the pool.
|
||||
.Pp
|
||||
The following are read-only properties:
|
||||
.Bl -tag -width "unsupported@guid"
|
||||
.It Cm allocated
|
||||
.It Sy allocated
|
||||
Amount of storage used within the pool.
|
||||
See
|
||||
.Sy fragmentation
|
||||
and
|
||||
.Sy free
|
||||
for more information.
|
||||
.It Sy bcloneratio
|
||||
The ratio of the total amount of storage that would be required to store all
|
||||
the cloned blocks without cloning to the actual storage used.
|
||||
The
|
||||
.Sy bcloneratio
|
||||
property is calculated as:
|
||||
.Pp
|
||||
.Sy ( ( bclonesaved + bcloneused ) * 100 ) / bcloneused
|
||||
.It Sy bclonesaved
|
||||
The amount of additional storage that would be required if block cloning
|
||||
was not used.
|
||||
.It Sy bcloneused
|
||||
The amount of storage used by cloned blocks.
|
||||
.It Sy capacity
|
||||
Percentage of pool space used.
|
||||
This property can also be referred to by its shortened column name,
|
||||
@ -103,16 +116,16 @@ Over time
|
||||
will decrease while
|
||||
.Sy free
|
||||
increases.
|
||||
.It Sy leaked
|
||||
Space not released while
|
||||
.Sy freeing
|
||||
due to corruption, now permanently leaked into the pool.
|
||||
.It Sy guid
|
||||
A unique identifier for the pool.
|
||||
.It Sy health
|
||||
The current health of the pool.
|
||||
Health can be one of
|
||||
.Sy ONLINE , DEGRADED , FAULTED , OFFLINE, REMOVED , UNAVAIL .
|
||||
.It Sy guid
|
||||
A unique identifier for the pool.
|
||||
.It Sy leaked
|
||||
Space not released while
|
||||
.Sy freeing
|
||||
due to corruption, now permanently leaked into the pool.
|
||||
.It Sy load_guid
|
||||
A unique identifier for the pool.
|
||||
Unlike the
|
||||
|
@ -305,6 +305,7 @@ ZFS_OBJS := \
|
||||
bpobj.o \
|
||||
bptree.o \
|
||||
bqueue.o \
|
||||
brt.o \
|
||||
btree.o \
|
||||
dataset_kstats.o \
|
||||
dbuf.o \
|
||||
|
@ -33,11 +33,11 @@ KMOD= openzfs
|
||||
${SRCDIR}/zstd/lib/decompress
|
||||
|
||||
CFLAGS+= -I${INCDIR}
|
||||
CFLAGS+= -I${SRCDIR}/icp/include
|
||||
CFLAGS+= -I${INCDIR}/os/freebsd
|
||||
CFLAGS+= -I${INCDIR}/os/freebsd/spl
|
||||
CFLAGS+= -I${INCDIR}/os/freebsd/zfs
|
||||
CFLAGS+= -I${SRCDIR}/zstd/include
|
||||
CFLAGS+= -I${SRCDIR}/icp/include
|
||||
CFLAGS+= -include ${INCDIR}/os/freebsd/spl/sys/ccompile.h
|
||||
CFLAGS+= -I${.CURDIR}
|
||||
|
||||
@ -243,6 +243,7 @@ SRCS+= abd.c \
|
||||
blkptr.c \
|
||||
bplist.c \
|
||||
bpobj.c \
|
||||
brt.c \
|
||||
btree.c \
|
||||
cityhash.c \
|
||||
dbuf.c \
|
||||
|
@ -97,6 +97,8 @@ __FBSDID("$FreeBSD$");
|
||||
SYSCTL_DECL(_vfs_zfs);
|
||||
SYSCTL_NODE(_vfs_zfs, OID_AUTO, arc, CTLFLAG_RW, 0,
|
||||
"ZFS adaptive replacement cache");
|
||||
SYSCTL_NODE(_vfs_zfs, OID_AUTO, brt, CTLFLAG_RW, 0,
|
||||
"ZFS Block Reference Table");
|
||||
SYSCTL_NODE(_vfs_zfs, OID_AUTO, condense, CTLFLAG_RW, 0, "ZFS condense");
|
||||
SYSCTL_NODE(_vfs_zfs, OID_AUTO, dbuf, CTLFLAG_RW, 0, "ZFS disk buf cache");
|
||||
SYSCTL_NODE(_vfs_zfs, OID_AUTO, dbuf_cache, CTLFLAG_RW, 0,
|
||||
|
@ -153,7 +153,12 @@ struct vfsops zfs_vfsops = {
|
||||
.vfs_quotactl = zfs_quotactl,
|
||||
};
|
||||
|
||||
VFS_SET(zfs_vfsops, zfs, VFCF_JAIL | VFCF_DELEGADMIN);
|
||||
#ifdef VFCF_CROSS_COPY_FILE_RANGE
|
||||
VFS_SET(zfs_vfsops, zfs,
|
||||
VFCF_DELEGADMIN | VFCF_JAIL | VFCF_CROSS_COPY_FILE_RANGE);
|
||||
#else
|
||||
VFS_SET(zfs_vfsops, zfs, VFCF_DELEGADMIN | VFCF_JAIL);
|
||||
#endif
|
||||
|
||||
/*
|
||||
* We need to keep a count of active fs's.
|
||||
|
@ -30,7 +30,6 @@
|
||||
/* Portions Copyright 2010 Robert Milkowski */
|
||||
|
||||
|
||||
#include <sys/types.h>
|
||||
#include <sys/param.h>
|
||||
#include <sys/time.h>
|
||||
#include <sys/systm.h>
|
||||
@ -84,6 +83,12 @@
|
||||
#include <vm/vm_param.h>
|
||||
#include <sys/zil.h>
|
||||
#include <sys/zfs_vnops.h>
|
||||
#include <sys/module.h>
|
||||
#include <sys/sysent.h>
|
||||
#include <security/mac/mac_framework.h>
|
||||
#include <sys/dmu_impl.h>
|
||||
#include <sys/brt.h>
|
||||
#include <sys/zfeature.h>
|
||||
|
||||
#include <vm/vm_object.h>
|
||||
|
||||
@ -6209,6 +6214,93 @@ zfs_deallocate(struct vop_deallocate_args *ap)
|
||||
}
|
||||
#endif
|
||||
|
||||
#ifndef _SYS_SYSPROTO_H_
|
||||
struct vop_copy_file_range_args {
|
||||
struct vnode *a_invp;
|
||||
off_t *a_inoffp;
|
||||
struct vnode *a_outvp;
|
||||
off_t *a_outoffp;
|
||||
size_t *a_lenp;
|
||||
unsigned int a_flags;
|
||||
struct ucred *a_incred;
|
||||
struct ucred *a_outcred;
|
||||
struct thread *a_fsizetd;
|
||||
}
|
||||
#endif
|
||||
/*
|
||||
* TODO: FreeBSD will only call file system-specific copy_file_range() if both
|
||||
* files resides under the same mountpoint. In case of ZFS we want to be called
|
||||
* even is files are in different datasets (but on the same pools, but we need
|
||||
* to check that ourselves).
|
||||
*/
|
||||
static int
|
||||
zfs_freebsd_copy_file_range(struct vop_copy_file_range_args *ap)
|
||||
{
|
||||
struct vnode *invp = ap->a_invp;
|
||||
struct vnode *outvp = ap->a_outvp;
|
||||
struct mount *mp;
|
||||
struct uio io;
|
||||
int error;
|
||||
|
||||
/*
|
||||
* TODO: If offset/length is not aligned to recordsize, use
|
||||
* vn_generic_copy_file_range() on this fragment.
|
||||
* It would be better to do this after we lock the vnodes, but then we
|
||||
* need something else than vn_generic_copy_file_range().
|
||||
*/
|
||||
|
||||
/* Lock both vnodes, avoiding risk of deadlock. */
|
||||
do {
|
||||
mp = NULL;
|
||||
error = vn_start_write(outvp, &mp, V_WAIT);
|
||||
if (error == 0) {
|
||||
error = vn_lock(outvp, LK_EXCLUSIVE);
|
||||
if (error == 0) {
|
||||
if (invp == outvp)
|
||||
break;
|
||||
error = vn_lock(invp, LK_SHARED | LK_NOWAIT);
|
||||
if (error == 0)
|
||||
break;
|
||||
VOP_UNLOCK(outvp);
|
||||
if (mp != NULL)
|
||||
vn_finished_write(mp);
|
||||
mp = NULL;
|
||||
error = vn_lock(invp, LK_SHARED);
|
||||
if (error == 0)
|
||||
VOP_UNLOCK(invp);
|
||||
}
|
||||
}
|
||||
if (mp != NULL)
|
||||
vn_finished_write(mp);
|
||||
} while (error == 0);
|
||||
if (error != 0)
|
||||
return (error);
|
||||
#ifdef MAC
|
||||
error = mac_vnode_check_write(curthread->td_ucred, ap->a_outcred,
|
||||
outvp);
|
||||
if (error != 0)
|
||||
goto unlock;
|
||||
#endif
|
||||
|
||||
io.uio_offset = *ap->a_outoffp;
|
||||
io.uio_resid = *ap->a_lenp;
|
||||
error = vn_rlimit_fsize(outvp, &io, ap->a_fsizetd);
|
||||
if (error != 0)
|
||||
goto unlock;
|
||||
|
||||
error = zfs_clone_range(VTOZ(invp), ap->a_inoffp, VTOZ(outvp),
|
||||
ap->a_outoffp, ap->a_lenp, ap->a_fsizetd->td_ucred);
|
||||
|
||||
unlock:
|
||||
if (invp != outvp)
|
||||
VOP_UNLOCK(invp);
|
||||
VOP_UNLOCK(outvp);
|
||||
if (mp != NULL)
|
||||
vn_finished_write(mp);
|
||||
|
||||
return (error);
|
||||
}
|
||||
|
||||
struct vop_vector zfs_vnodeops;
|
||||
struct vop_vector zfs_fifoops;
|
||||
struct vop_vector zfs_shareops;
|
||||
@ -6272,6 +6364,7 @@ struct vop_vector zfs_vnodeops = {
|
||||
#if __FreeBSD_version >= 1400043
|
||||
.vop_add_writecount = vop_stdadd_writecount_nomsync,
|
||||
#endif
|
||||
.vop_copy_file_range = zfs_freebsd_copy_file_range,
|
||||
};
|
||||
VFS_VOP_VECTOR_REGISTER(zfs_vnodeops);
|
||||
|
||||
|
@ -34,6 +34,7 @@
|
||||
#include <sys/systm.h>
|
||||
#include <sys/sysmacros.h>
|
||||
#include <sys/resource.h>
|
||||
#include <sys/resourcevar.h>
|
||||
#include <sys/mntent.h>
|
||||
#include <sys/u8_textprep.h>
|
||||
#include <sys/dsl_dataset.h>
|
||||
@ -2113,3 +2114,28 @@ zfs_znode_parent_and_name(znode_t *zp, znode_t **dzpp, char *buf)
|
||||
return (err);
|
||||
}
|
||||
#endif /* _KERNEL */
|
||||
|
||||
#ifdef _KERNEL
|
||||
int
|
||||
zfs_rlimit_fsize(off_t fsize)
|
||||
{
|
||||
struct thread *td = curthread;
|
||||
off_t lim;
|
||||
|
||||
if (td == NULL)
|
||||
return (0);
|
||||
|
||||
lim = lim_cur(td, RLIMIT_FSIZE);
|
||||
if (__predict_true((uoff_t)fsize <= lim))
|
||||
return (0);
|
||||
|
||||
/*
|
||||
* The limit is reached.
|
||||
*/
|
||||
PROC_LOCK(td->td_proc);
|
||||
kern_psignal(td->td_proc, SIGXFSZ);
|
||||
PROC_UNLOCK(td->td_proc);
|
||||
|
||||
return (EFBIG);
|
||||
}
|
||||
#endif /* _KERNEL */
|
||||
|
@ -725,6 +725,12 @@ zpool_feature_init(void)
|
||||
blake3_deps, sfeatures);
|
||||
}
|
||||
|
||||
zfeature_register(SPA_FEATURE_BLOCK_CLONING,
|
||||
"com.fudosecurity:block_cloning", "block_cloning",
|
||||
"Support for block cloning via Block Reference Table.",
|
||||
ZFEATURE_FLAG_READONLY_COMPAT, ZFEATURE_TYPE_BOOLEAN, NULL,
|
||||
sfeatures);
|
||||
|
||||
zfs_mod_list_supported_free(sfeatures);
|
||||
}
|
||||
|
||||
|
@ -116,6 +116,15 @@ zpool_prop_init(void)
|
||||
zprop_register_number(ZPOOL_PROP_DEDUPRATIO, "dedupratio", 0,
|
||||
PROP_READONLY, ZFS_TYPE_POOL, "<1.00x or higher if deduped>",
|
||||
"DEDUP", B_FALSE, sfeatures);
|
||||
zprop_register_number(ZPOOL_PROP_BCLONEUSED, "bcloneused", 0,
|
||||
PROP_READONLY, ZFS_TYPE_POOL, "<size>",
|
||||
"BCLONE_USED", B_FALSE, sfeatures);
|
||||
zprop_register_number(ZPOOL_PROP_BCLONESAVED, "bclonesaved", 0,
|
||||
PROP_READONLY, ZFS_TYPE_POOL, "<size>",
|
||||
"BCLONE_SAVED", B_FALSE, sfeatures);
|
||||
zprop_register_number(ZPOOL_PROP_BCLONERATIO, "bcloneratio", 0,
|
||||
PROP_READONLY, ZFS_TYPE_POOL, "<1.00x or higher if cloned>",
|
||||
"BCLONE_RATIO", B_FALSE, sfeatures);
|
||||
|
||||
/* default number properties */
|
||||
zprop_register_number(ZPOOL_PROP_VERSION, "version", SPA_VERSION,
|
||||
|
1884
module/zfs/brt.c
Normal file
1884
module/zfs/brt.c
Normal file
File diff suppressed because it is too large
Load Diff
@ -26,6 +26,7 @@
|
||||
* Copyright (c) 2014 Spectra Logic Corporation, All rights reserved.
|
||||
* Copyright (c) 2019, Klara Inc.
|
||||
* Copyright (c) 2019, Allan Jude
|
||||
* Copyright (c) 2021, 2022 by Pawel Jakub Dawidek
|
||||
*/
|
||||
|
||||
#include <sys/zfs_context.h>
|
||||
@ -49,6 +50,7 @@
|
||||
#include <sys/trace_zfs.h>
|
||||
#include <sys/callb.h>
|
||||
#include <sys/abd.h>
|
||||
#include <sys/brt.h>
|
||||
#include <sys/vdev.h>
|
||||
#include <cityhash.h>
|
||||
#include <sys/spa_impl.h>
|
||||
@ -1427,7 +1429,7 @@ dbuf_read_bonus(dmu_buf_impl_t *db, dnode_t *dn, uint32_t flags)
|
||||
}
|
||||
|
||||
static void
|
||||
dbuf_handle_indirect_hole(dmu_buf_impl_t *db, dnode_t *dn)
|
||||
dbuf_handle_indirect_hole(dmu_buf_impl_t *db, dnode_t *dn, blkptr_t *dbbp)
|
||||
{
|
||||
blkptr_t *bps = db->db.db_data;
|
||||
uint32_t indbs = 1ULL << dn->dn_indblkshift;
|
||||
@ -1436,12 +1438,12 @@ dbuf_handle_indirect_hole(dmu_buf_impl_t *db, dnode_t *dn)
|
||||
for (int i = 0; i < n_bps; i++) {
|
||||
blkptr_t *bp = &bps[i];
|
||||
|
||||
ASSERT3U(BP_GET_LSIZE(db->db_blkptr), ==, indbs);
|
||||
BP_SET_LSIZE(bp, BP_GET_LEVEL(db->db_blkptr) == 1 ?
|
||||
dn->dn_datablksz : BP_GET_LSIZE(db->db_blkptr));
|
||||
BP_SET_TYPE(bp, BP_GET_TYPE(db->db_blkptr));
|
||||
BP_SET_LEVEL(bp, BP_GET_LEVEL(db->db_blkptr) - 1);
|
||||
BP_SET_BIRTH(bp, db->db_blkptr->blk_birth, 0);
|
||||
ASSERT3U(BP_GET_LSIZE(dbbp), ==, indbs);
|
||||
BP_SET_LSIZE(bp, BP_GET_LEVEL(dbbp) == 1 ?
|
||||
dn->dn_datablksz : BP_GET_LSIZE(dbbp));
|
||||
BP_SET_TYPE(bp, BP_GET_TYPE(dbbp));
|
||||
BP_SET_LEVEL(bp, BP_GET_LEVEL(dbbp) - 1);
|
||||
BP_SET_BIRTH(bp, dbbp->blk_birth, 0);
|
||||
}
|
||||
}
|
||||
|
||||
@ -1451,30 +1453,27 @@ dbuf_handle_indirect_hole(dmu_buf_impl_t *db, dnode_t *dn)
|
||||
* was taken, ENOENT if no action was taken.
|
||||
*/
|
||||
static int
|
||||
dbuf_read_hole(dmu_buf_impl_t *db, dnode_t *dn)
|
||||
dbuf_read_hole(dmu_buf_impl_t *db, dnode_t *dn, blkptr_t *bp)
|
||||
{
|
||||
ASSERT(MUTEX_HELD(&db->db_mtx));
|
||||
|
||||
int is_hole = db->db_blkptr == NULL || BP_IS_HOLE(db->db_blkptr);
|
||||
int is_hole = bp == NULL || BP_IS_HOLE(bp);
|
||||
/*
|
||||
* For level 0 blocks only, if the above check fails:
|
||||
* Recheck BP_IS_HOLE() after dnode_block_freed() in case dnode_sync()
|
||||
* processes the delete record and clears the bp while we are waiting
|
||||
* for the dn_mtx (resulting in a "no" from block_freed).
|
||||
*/
|
||||
if (!is_hole && db->db_level == 0) {
|
||||
is_hole = dnode_block_freed(dn, db->db_blkid) ||
|
||||
BP_IS_HOLE(db->db_blkptr);
|
||||
}
|
||||
if (!is_hole && db->db_level == 0)
|
||||
is_hole = dnode_block_freed(dn, db->db_blkid) || BP_IS_HOLE(bp);
|
||||
|
||||
if (is_hole) {
|
||||
dbuf_set_data(db, dbuf_alloc_arcbuf(db));
|
||||
memset(db->db.db_data, 0, db->db.db_size);
|
||||
|
||||
if (db->db_blkptr != NULL && db->db_level > 0 &&
|
||||
BP_IS_HOLE(db->db_blkptr) &&
|
||||
db->db_blkptr->blk_birth != 0) {
|
||||
dbuf_handle_indirect_hole(db, dn);
|
||||
if (bp != NULL && db->db_level > 0 && BP_IS_HOLE(bp) &&
|
||||
bp->blk_birth != 0) {
|
||||
dbuf_handle_indirect_hole(db, dn, bp);
|
||||
}
|
||||
db->db_state = DB_CACHED;
|
||||
DTRACE_SET_STATE(db, "hole read satisfied");
|
||||
@ -1551,12 +1550,13 @@ dbuf_read_impl(dmu_buf_impl_t *db, zio_t *zio, uint32_t flags,
|
||||
zbookmark_phys_t zb;
|
||||
uint32_t aflags = ARC_FLAG_NOWAIT;
|
||||
int err, zio_flags;
|
||||
blkptr_t bp, *bpp;
|
||||
|
||||
DB_DNODE_ENTER(db);
|
||||
dn = DB_DNODE(db);
|
||||
ASSERT(!zfs_refcount_is_zero(&db->db_holds));
|
||||
ASSERT(MUTEX_HELD(&db->db_mtx));
|
||||
ASSERT(db->db_state == DB_UNCACHED);
|
||||
ASSERT(db->db_state == DB_UNCACHED || db->db_state == DB_NOFILL);
|
||||
ASSERT(db->db_buf == NULL);
|
||||
ASSERT(db->db_parent == NULL ||
|
||||
RW_LOCK_HELD(&db->db_parent->db_rwlock));
|
||||
@ -1566,16 +1566,46 @@ dbuf_read_impl(dmu_buf_impl_t *db, zio_t *zio, uint32_t flags,
|
||||
goto early_unlock;
|
||||
}
|
||||
|
||||
err = dbuf_read_hole(db, dn);
|
||||
if (db->db_state == DB_UNCACHED) {
|
||||
if (db->db_blkptr == NULL) {
|
||||
bpp = NULL;
|
||||
} else {
|
||||
bp = *db->db_blkptr;
|
||||
bpp = &bp;
|
||||
}
|
||||
} else {
|
||||
struct dirty_leaf *dl;
|
||||
dbuf_dirty_record_t *dr;
|
||||
|
||||
ASSERT3S(db->db_state, ==, DB_NOFILL);
|
||||
|
||||
dr = list_head(&db->db_dirty_records);
|
||||
if (dr == NULL) {
|
||||
err = EIO;
|
||||
goto early_unlock;
|
||||
} else {
|
||||
dl = &dr->dt.dl;
|
||||
if (!dl->dr_brtwrite) {
|
||||
err = EIO;
|
||||
goto early_unlock;
|
||||
}
|
||||
bp = dl->dr_overridden_by;
|
||||
bpp = &bp;
|
||||
}
|
||||
}
|
||||
|
||||
err = dbuf_read_hole(db, dn, bpp);
|
||||
if (err == 0)
|
||||
goto early_unlock;
|
||||
|
||||
ASSERT(bpp != NULL);
|
||||
|
||||
/*
|
||||
* Any attempt to read a redacted block should result in an error. This
|
||||
* will never happen under normal conditions, but can be useful for
|
||||
* debugging purposes.
|
||||
*/
|
||||
if (BP_IS_REDACTED(db->db_blkptr)) {
|
||||
if (BP_IS_REDACTED(bpp)) {
|
||||
ASSERT(dsl_dataset_feature_is_active(
|
||||
db->db_objset->os_dsl_dataset,
|
||||
SPA_FEATURE_REDACTED_DATASETS));
|
||||
@ -1590,7 +1620,7 @@ dbuf_read_impl(dmu_buf_impl_t *db, zio_t *zio, uint32_t flags,
|
||||
* All bps of an encrypted os should have the encryption bit set.
|
||||
* If this is not true it indicates tampering and we report an error.
|
||||
*/
|
||||
if (db->db_objset->os_encrypted && !BP_USES_CRYPT(db->db_blkptr)) {
|
||||
if (db->db_objset->os_encrypted && !BP_USES_CRYPT(bpp)) {
|
||||
spa_log_error(db->db_objset->os_spa, &zb);
|
||||
zfs_panic_recover("unencrypted block in encrypted "
|
||||
"object set %llu", dmu_objset_id(db->db_objset));
|
||||
@ -1621,15 +1651,14 @@ dbuf_read_impl(dmu_buf_impl_t *db, zio_t *zio, uint32_t flags,
|
||||
if ((flags & DB_RF_NO_DECRYPT) && BP_IS_PROTECTED(db->db_blkptr))
|
||||
zio_flags |= ZIO_FLAG_RAW;
|
||||
/*
|
||||
* The zio layer will copy the provided blkptr later, but we need to
|
||||
* do this now so that we can release the parent's rwlock. We have to
|
||||
* do that now so that if dbuf_read_done is called synchronously (on
|
||||
* The zio layer will copy the provided blkptr later, but we have our
|
||||
* own copy so that we can release the parent's rwlock. We have to
|
||||
* do that so that if dbuf_read_done is called synchronously (on
|
||||
* an l1 cache hit) we don't acquire the db_mtx while holding the
|
||||
* parent's rwlock, which would be a lock ordering violation.
|
||||
*/
|
||||
blkptr_t bp = *db->db_blkptr;
|
||||
dmu_buf_unlock_parent(db, dblt, tag);
|
||||
(void) arc_read(zio, db->db_objset->os_spa, &bp,
|
||||
(void) arc_read(zio, db->db_objset->os_spa, bpp,
|
||||
dbuf_read_done, db, ZIO_PRIORITY_SYNC_READ, zio_flags,
|
||||
&aflags, &zb);
|
||||
return (err);
|
||||
@ -1731,9 +1760,6 @@ dbuf_read(dmu_buf_impl_t *db, zio_t *zio, uint32_t flags)
|
||||
*/
|
||||
ASSERT(!zfs_refcount_is_zero(&db->db_holds));
|
||||
|
||||
if (db->db_state == DB_NOFILL)
|
||||
return (SET_ERROR(EIO));
|
||||
|
||||
DB_DNODE_ENTER(db);
|
||||
dn = DB_DNODE(db);
|
||||
|
||||
@ -1780,13 +1806,13 @@ dbuf_read(dmu_buf_impl_t *db, zio_t *zio, uint32_t flags)
|
||||
}
|
||||
DB_DNODE_EXIT(db);
|
||||
DBUF_STAT_BUMP(hash_hits);
|
||||
} else if (db->db_state == DB_UNCACHED) {
|
||||
} else if (db->db_state == DB_UNCACHED || db->db_state == DB_NOFILL) {
|
||||
boolean_t need_wait = B_FALSE;
|
||||
|
||||
db_lock_type_t dblt = dmu_buf_lock_parent(db, RW_READER, FTAG);
|
||||
|
||||
if (zio == NULL &&
|
||||
db->db_blkptr != NULL && !BP_IS_HOLE(db->db_blkptr)) {
|
||||
if (zio == NULL && (db->db_state == DB_NOFILL ||
|
||||
(db->db_blkptr != NULL && !BP_IS_HOLE(db->db_blkptr)))) {
|
||||
spa_t *spa = dn->dn_objset->os_spa;
|
||||
zio = zio_root(spa, NULL, NULL, ZIO_FLAG_CANFAIL);
|
||||
need_wait = B_TRUE;
|
||||
@ -1913,6 +1939,7 @@ dbuf_unoverride(dbuf_dirty_record_t *dr)
|
||||
* the buf thawed to save the effort of freezing &
|
||||
* immediately re-thawing it.
|
||||
*/
|
||||
if (!dr->dt.dl.dr_brtwrite)
|
||||
arc_release(dr->dt.dl.dr_data, db);
|
||||
}
|
||||
|
||||
@ -1996,6 +2023,11 @@ dbuf_free_range(dnode_t *dn, uint64_t start_blkid, uint64_t end_blkid,
|
||||
db->db_blkid > dn->dn_maxblkid)
|
||||
dn->dn_maxblkid = db->db_blkid;
|
||||
dbuf_unoverride(dr);
|
||||
if (dr->dt.dl.dr_brtwrite) {
|
||||
ASSERT(db->db.db_data == NULL);
|
||||
mutex_exit(&db->db_mtx);
|
||||
continue;
|
||||
}
|
||||
} else {
|
||||
/*
|
||||
* This dbuf is not dirty in the open context.
|
||||
@ -2285,7 +2317,7 @@ dbuf_dirty(dmu_buf_impl_t *db, dmu_tx_t *tx)
|
||||
|
||||
dprintf_dbuf(db, "size=%llx\n", (u_longlong_t)db->db.db_size);
|
||||
|
||||
if (db->db_blkid != DMU_BONUS_BLKID) {
|
||||
if (db->db_blkid != DMU_BONUS_BLKID && db->db_state != DB_NOFILL) {
|
||||
dmu_objset_willuse_space(os, db->db.db_size, tx);
|
||||
}
|
||||
|
||||
@ -2328,8 +2360,9 @@ dbuf_dirty(dmu_buf_impl_t *db, dmu_tx_t *tx)
|
||||
sizeof (dbuf_dirty_record_t),
|
||||
offsetof(dbuf_dirty_record_t, dr_dirty_node));
|
||||
}
|
||||
if (db->db_blkid != DMU_BONUS_BLKID)
|
||||
if (db->db_blkid != DMU_BONUS_BLKID && db->db_state != DB_NOFILL) {
|
||||
dr->dr_accounted = db->db.db_size;
|
||||
}
|
||||
dr->dr_dbuf = db;
|
||||
dr->dr_txg = tx->tx_txg;
|
||||
list_insert_before(&db->db_dirty_records, dr_next, dr);
|
||||
@ -2489,6 +2522,7 @@ static boolean_t
|
||||
dbuf_undirty(dmu_buf_impl_t *db, dmu_tx_t *tx)
|
||||
{
|
||||
uint64_t txg = tx->tx_txg;
|
||||
boolean_t brtwrite;
|
||||
|
||||
ASSERT(txg != 0);
|
||||
|
||||
@ -2513,6 +2547,16 @@ dbuf_undirty(dmu_buf_impl_t *db, dmu_tx_t *tx)
|
||||
return (B_FALSE);
|
||||
ASSERT(dr->dr_dbuf == db);
|
||||
|
||||
brtwrite = dr->dt.dl.dr_brtwrite;
|
||||
if (brtwrite) {
|
||||
/*
|
||||
* We are freeing a block that we cloned in the same
|
||||
* transaction group.
|
||||
*/
|
||||
brt_pending_remove(dmu_objset_spa(db->db_objset),
|
||||
&dr->dt.dl.dr_overridden_by, tx);
|
||||
}
|
||||
|
||||
dnode_t *dn = dr->dr_dnode;
|
||||
|
||||
dprintf_dbuf(db, "size=%llx\n", (u_longlong_t)db->db.db_size);
|
||||
@ -2542,7 +2586,7 @@ dbuf_undirty(dmu_buf_impl_t *db, dmu_tx_t *tx)
|
||||
mutex_exit(&dn->dn_mtx);
|
||||
}
|
||||
|
||||
if (db->db_state != DB_NOFILL) {
|
||||
if (db->db_state != DB_NOFILL && !brtwrite) {
|
||||
dbuf_unoverride(dr);
|
||||
|
||||
ASSERT(db->db_buf != NULL);
|
||||
@ -2557,7 +2601,8 @@ dbuf_undirty(dmu_buf_impl_t *db, dmu_tx_t *tx)
|
||||
db->db_dirtycnt -= 1;
|
||||
|
||||
if (zfs_refcount_remove(&db->db_holds, (void *)(uintptr_t)txg) == 0) {
|
||||
ASSERT(db->db_state == DB_NOFILL || arc_released(db->db_buf));
|
||||
ASSERT(db->db_state == DB_NOFILL || brtwrite ||
|
||||
arc_released(db->db_buf));
|
||||
dbuf_destroy(db);
|
||||
return (B_TRUE);
|
||||
}
|
||||
@ -4748,9 +4793,11 @@ dbuf_write_done(zio_t *zio, arc_buf_t *buf, void *vdb)
|
||||
ASSERT(db->db_blkid != DMU_BONUS_BLKID);
|
||||
ASSERT(dr->dt.dl.dr_override_state == DR_NOT_OVERRIDDEN);
|
||||
if (db->db_state != DB_NOFILL) {
|
||||
if (dr->dt.dl.dr_data != db->db_buf)
|
||||
if (dr->dt.dl.dr_data != NULL &&
|
||||
dr->dt.dl.dr_data != db->db_buf) {
|
||||
arc_buf_destroy(dr->dt.dl.dr_data, db);
|
||||
}
|
||||
}
|
||||
} else {
|
||||
ASSERT(list_head(&dr->dt.di.dr_children) == NULL);
|
||||
ASSERT3U(db->db.db_size, ==, 1 << dn->dn_phys->dn_indblkshift);
|
||||
@ -5046,7 +5093,8 @@ dbuf_write(dbuf_dirty_record_t *dr, arc_buf_t *data, dmu_tx_t *tx)
|
||||
mutex_enter(&db->db_mtx);
|
||||
dr->dt.dl.dr_override_state = DR_NOT_OVERRIDDEN;
|
||||
zio_write_override(dr->dr_zio, &dr->dt.dl.dr_overridden_by,
|
||||
dr->dt.dl.dr_copies, dr->dt.dl.dr_nopwrite);
|
||||
dr->dt.dl.dr_copies, dr->dt.dl.dr_nopwrite,
|
||||
dr->dt.dl.dr_brtwrite);
|
||||
mutex_exit(&db->db_mtx);
|
||||
} else if (db->db_state == DB_NOFILL) {
|
||||
ASSERT(zp.zp_checksum == ZIO_CHECKSUM_OFF ||
|
||||
|
@ -22,6 +22,7 @@
|
||||
/*
|
||||
* Copyright (c) 2009, 2010, Oracle and/or its affiliates. All rights reserved.
|
||||
* Copyright (c) 2012, 2016 by Delphix. All rights reserved.
|
||||
* Copyright (c) 2022 by Pawel Jakub Dawidek
|
||||
*/
|
||||
|
||||
#include <sys/zfs_context.h>
|
||||
@ -1180,5 +1181,59 @@ ddt_walk(spa_t *spa, ddt_bookmark_t *ddb, ddt_entry_t *dde)
|
||||
return (SET_ERROR(ENOENT));
|
||||
}
|
||||
|
||||
/*
|
||||
* This function is used by Block Cloning (brt.c) to increase reference
|
||||
* counter for the DDT entry if the block is already in DDT.
|
||||
*
|
||||
* Return false if the block, despite having the D bit set, is not present
|
||||
* in the DDT. Currently this is not possible but might be in the future.
|
||||
* See the comment below.
|
||||
*/
|
||||
boolean_t
|
||||
ddt_addref(spa_t *spa, const blkptr_t *bp)
|
||||
{
|
||||
ddt_t *ddt;
|
||||
ddt_entry_t *dde;
|
||||
boolean_t result;
|
||||
|
||||
spa_config_enter(spa, SCL_ZIO, FTAG, RW_READER);
|
||||
ddt = ddt_select(spa, bp);
|
||||
ddt_enter(ddt);
|
||||
|
||||
dde = ddt_lookup(ddt, bp, B_TRUE);
|
||||
ASSERT(dde != NULL);
|
||||
|
||||
if (dde->dde_type < DDT_TYPES) {
|
||||
ddt_phys_t *ddp;
|
||||
|
||||
ASSERT3S(dde->dde_class, <, DDT_CLASSES);
|
||||
|
||||
ddp = &dde->dde_phys[BP_GET_NDVAS(bp)];
|
||||
if (ddp->ddp_refcnt == 0) {
|
||||
/* This should never happen? */
|
||||
ddt_phys_fill(ddp, bp);
|
||||
}
|
||||
ddt_phys_addref(ddp);
|
||||
result = B_TRUE;
|
||||
} else {
|
||||
/*
|
||||
* At the time of implementating this if the block has the
|
||||
* DEDUP flag set it must exist in the DEDUP table, but
|
||||
* there are many advocates that want ability to remove
|
||||
* entries from DDT with refcnt=1. If this will happen,
|
||||
* we may have a block with the DEDUP set, but which doesn't
|
||||
* have a corresponding entry in the DDT. Be ready.
|
||||
*/
|
||||
ASSERT3S(dde->dde_class, ==, DDT_CLASSES);
|
||||
ddt_remove(ddt, dde);
|
||||
result = B_FALSE;
|
||||
}
|
||||
|
||||
ddt_exit(ddt);
|
||||
spa_config_exit(spa, SCL_ZIO, FTAG);
|
||||
|
||||
return (result);
|
||||
}
|
||||
|
||||
ZFS_MODULE_PARAM(zfs_dedup, zfs_dedup_, prefetch, INT, ZMOD_RW,
|
||||
"Enable prefetching dedup-ed blks");
|
||||
|
153
module/zfs/dmu.c
153
module/zfs/dmu.c
@ -29,6 +29,7 @@
|
||||
* Copyright (c) 2019, Klara Inc.
|
||||
* Copyright (c) 2019, Allan Jude
|
||||
* Copyright (c) 2022 Hewlett Packard Enterprise Development LP.
|
||||
* Copyright (c) 2021, 2022 by Pawel Jakub Dawidek
|
||||
*/
|
||||
|
||||
#include <sys/dmu.h>
|
||||
@ -52,6 +53,7 @@
|
||||
#include <sys/sa.h>
|
||||
#include <sys/zfeature.h>
|
||||
#include <sys/abd.h>
|
||||
#include <sys/brt.h>
|
||||
#include <sys/trace_zfs.h>
|
||||
#include <sys/zfs_racct.h>
|
||||
#include <sys/zfs_rlock.h>
|
||||
@ -513,7 +515,7 @@ dmu_buf_hold_array_by_dnode(dnode_t *dn, uint64_t offset, uint64_t length,
|
||||
zio_t *zio = NULL;
|
||||
boolean_t missed = B_FALSE;
|
||||
|
||||
ASSERT(length <= DMU_MAX_ACCESS);
|
||||
ASSERT(!read || length <= DMU_MAX_ACCESS);
|
||||
|
||||
/*
|
||||
* Note: We directly notify the prefetch code of this read, so that
|
||||
@ -2165,6 +2167,155 @@ dmu_offset_next(objset_t *os, uint64_t object, boolean_t hole, uint64_t *off)
|
||||
return (err);
|
||||
}
|
||||
|
||||
int
|
||||
dmu_read_l0_bps(objset_t *os, uint64_t object, uint64_t offset, uint64_t length,
|
||||
dmu_tx_t *tx, blkptr_t *bps, size_t *nbpsp)
|
||||
{
|
||||
dmu_buf_t **dbp, *dbuf;
|
||||
dmu_buf_impl_t *db;
|
||||
blkptr_t *bp;
|
||||
int error, numbufs;
|
||||
|
||||
error = dmu_buf_hold_array(os, object, offset, length, FALSE, FTAG,
|
||||
&numbufs, &dbp);
|
||||
if (error != 0) {
|
||||
if (error == ESRCH) {
|
||||
error = SET_ERROR(ENXIO);
|
||||
}
|
||||
return (error);
|
||||
}
|
||||
|
||||
ASSERT3U(numbufs, <=, *nbpsp);
|
||||
|
||||
for (int i = 0; i < numbufs; i++) {
|
||||
dbuf = dbp[i];
|
||||
db = (dmu_buf_impl_t *)dbuf;
|
||||
bp = db->db_blkptr;
|
||||
|
||||
/*
|
||||
* If the block is not on the disk yet, it has no BP assigned.
|
||||
* There is not much we can do...
|
||||
*/
|
||||
if (!list_is_empty(&db->db_dirty_records)) {
|
||||
dbuf_dirty_record_t *dr;
|
||||
|
||||
dr = list_head(&db->db_dirty_records);
|
||||
if (dr->dt.dl.dr_brtwrite) {
|
||||
/*
|
||||
* This is very special case where we clone a
|
||||
* block and in the same transaction group we
|
||||
* read its BP (most likely to clone the clone).
|
||||
*/
|
||||
bp = &dr->dt.dl.dr_overridden_by;
|
||||
} else {
|
||||
/*
|
||||
* The block was modified in the same
|
||||
* transaction group.
|
||||
*/
|
||||
error = SET_ERROR(EAGAIN);
|
||||
goto out;
|
||||
}
|
||||
}
|
||||
if (bp == NULL) {
|
||||
/*
|
||||
* The block was created in this transaction group,
|
||||
* so it has no BP yet.
|
||||
*/
|
||||
error = SET_ERROR(EAGAIN);
|
||||
goto out;
|
||||
}
|
||||
if (dmu_buf_is_dirty(dbuf, tx)) {
|
||||
error = SET_ERROR(EAGAIN);
|
||||
goto out;
|
||||
}
|
||||
/*
|
||||
* Make sure we clone only data blocks.
|
||||
*/
|
||||
if (BP_IS_METADATA(bp) && !BP_IS_HOLE(bp)) {
|
||||
error = SET_ERROR(EINVAL);
|
||||
goto out;
|
||||
}
|
||||
|
||||
bps[i] = *bp;
|
||||
}
|
||||
|
||||
*nbpsp = numbufs;
|
||||
out:
|
||||
dmu_buf_rele_array(dbp, numbufs, FTAG);
|
||||
|
||||
return (error);
|
||||
}
|
||||
|
||||
void
|
||||
dmu_brt_clone(objset_t *os, uint64_t object, uint64_t offset, uint64_t length,
|
||||
dmu_tx_t *tx, const blkptr_t *bps, size_t nbps, boolean_t replay)
|
||||
{
|
||||
spa_t *spa;
|
||||
dmu_buf_t **dbp, *dbuf;
|
||||
dmu_buf_impl_t *db;
|
||||
struct dirty_leaf *dl;
|
||||
dbuf_dirty_record_t *dr;
|
||||
const blkptr_t *bp;
|
||||
int numbufs;
|
||||
|
||||
spa = os->os_spa;
|
||||
|
||||
VERIFY0(dmu_buf_hold_array(os, object, offset, length, FALSE, FTAG,
|
||||
&numbufs, &dbp));
|
||||
ASSERT3U(nbps, ==, numbufs);
|
||||
|
||||
for (int i = 0; i < numbufs; i++) {
|
||||
dbuf = dbp[i];
|
||||
db = (dmu_buf_impl_t *)dbuf;
|
||||
bp = &bps[i];
|
||||
|
||||
ASSERT0(db->db_level);
|
||||
ASSERT(db->db_blkid != DMU_BONUS_BLKID);
|
||||
ASSERT(BP_IS_HOLE(bp) || dbuf->db_size == BP_GET_LSIZE(bp));
|
||||
|
||||
if (db->db_state == DB_UNCACHED) {
|
||||
/*
|
||||
* XXX-PJD: If the dbuf is already cached, calling
|
||||
* dmu_buf_will_not_fill() will panic on assertion
|
||||
* (db->db_buf == NULL) in dbuf_clear_data(),
|
||||
* which is called from dbuf_noread() in DB_NOFILL
|
||||
* case. I'm not 100% sure this is the right thing
|
||||
* to do, but it seems to work.
|
||||
*/
|
||||
dmu_buf_will_not_fill(dbuf, tx);
|
||||
}
|
||||
|
||||
dr = list_head(&db->db_dirty_records);
|
||||
ASSERT3U(dr->dr_txg, ==, tx->tx_txg);
|
||||
dl = &dr->dt.dl;
|
||||
dl->dr_overridden_by = *bp;
|
||||
dl->dr_brtwrite = B_TRUE;
|
||||
|
||||
dl->dr_override_state = DR_OVERRIDDEN;
|
||||
if (BP_IS_HOLE(bp)) {
|
||||
dl->dr_overridden_by.blk_birth = 0;
|
||||
dl->dr_overridden_by.blk_phys_birth = 0;
|
||||
} else {
|
||||
dl->dr_overridden_by.blk_birth = dr->dr_txg;
|
||||
dl->dr_overridden_by.blk_phys_birth =
|
||||
BP_PHYSICAL_BIRTH(bp);
|
||||
}
|
||||
|
||||
/*
|
||||
* When data in embedded into BP there is no need to create
|
||||
* BRT entry as there is no data block. Just copy the BP as
|
||||
* it contains the data.
|
||||
* Also, when replaying ZIL we don't want to bump references
|
||||
* in the BRT as it was already done during ZIL claim.
|
||||
*/
|
||||
if (!replay && !BP_IS_HOLE(bp) && !BP_IS_EMBEDDED(bp)) {
|
||||
brt_pending_add(spa, bp, tx);
|
||||
}
|
||||
}
|
||||
|
||||
dmu_buf_rele_array(dbp, numbufs, FTAG);
|
||||
}
|
||||
|
||||
void
|
||||
__dmu_object_info_from_dnode(dnode_t *dn, dmu_object_info_t *doi)
|
||||
{
|
||||
|
@ -349,7 +349,7 @@ dmu_tx_mark_netfree(dmu_tx_t *tx)
|
||||
}
|
||||
|
||||
static void
|
||||
dmu_tx_hold_free_impl(dmu_tx_hold_t *txh, uint64_t off, uint64_t len)
|
||||
dmu_tx_count_free(dmu_tx_hold_t *txh, uint64_t off, uint64_t len)
|
||||
{
|
||||
dmu_tx_t *tx = txh->txh_tx;
|
||||
dnode_t *dn = txh->txh_dnode;
|
||||
@ -357,15 +357,11 @@ dmu_tx_hold_free_impl(dmu_tx_hold_t *txh, uint64_t off, uint64_t len)
|
||||
|
||||
ASSERT(tx->tx_txg == 0);
|
||||
|
||||
dmu_tx_count_dnode(txh);
|
||||
|
||||
if (off >= (dn->dn_maxblkid + 1) * dn->dn_datablksz)
|
||||
return;
|
||||
if (len == DMU_OBJECT_END)
|
||||
len = (dn->dn_maxblkid + 1) * dn->dn_datablksz - off;
|
||||
|
||||
dmu_tx_count_dnode(txh);
|
||||
|
||||
/*
|
||||
* For i/o error checking, we read the first and last level-0
|
||||
* blocks if they are not aligned, and all the level-1 blocks.
|
||||
@ -445,8 +441,10 @@ dmu_tx_hold_free(dmu_tx_t *tx, uint64_t object, uint64_t off, uint64_t len)
|
||||
|
||||
txh = dmu_tx_hold_object_impl(tx, tx->tx_objset,
|
||||
object, THT_FREE, off, len);
|
||||
if (txh != NULL)
|
||||
(void) dmu_tx_hold_free_impl(txh, off, len);
|
||||
if (txh != NULL) {
|
||||
dmu_tx_count_dnode(txh);
|
||||
dmu_tx_count_free(txh, off, len);
|
||||
}
|
||||
}
|
||||
|
||||
void
|
||||
@ -455,8 +453,35 @@ dmu_tx_hold_free_by_dnode(dmu_tx_t *tx, dnode_t *dn, uint64_t off, uint64_t len)
|
||||
dmu_tx_hold_t *txh;
|
||||
|
||||
txh = dmu_tx_hold_dnode_impl(tx, dn, THT_FREE, off, len);
|
||||
if (txh != NULL)
|
||||
(void) dmu_tx_hold_free_impl(txh, off, len);
|
||||
if (txh != NULL) {
|
||||
dmu_tx_count_dnode(txh);
|
||||
dmu_tx_count_free(txh, off, len);
|
||||
}
|
||||
}
|
||||
|
||||
static void
|
||||
dmu_tx_count_clone(dmu_tx_hold_t *txh, uint64_t off, uint64_t len)
|
||||
{
|
||||
|
||||
/*
|
||||
* Reuse dmu_tx_count_free(), it does exactly what we need for clone.
|
||||
*/
|
||||
dmu_tx_count_free(txh, off, len);
|
||||
}
|
||||
|
||||
void
|
||||
dmu_tx_hold_clone_by_dnode(dmu_tx_t *tx, dnode_t *dn, uint64_t off, int len)
|
||||
{
|
||||
dmu_tx_hold_t *txh;
|
||||
|
||||
ASSERT0(tx->tx_txg);
|
||||
ASSERT(len == 0 || UINT64_MAX - off >= len - 1);
|
||||
|
||||
txh = dmu_tx_hold_dnode_impl(tx, dn, THT_CLONE, off, len);
|
||||
if (txh != NULL) {
|
||||
dmu_tx_count_dnode(txh);
|
||||
dmu_tx_count_clone(txh, off, len);
|
||||
}
|
||||
}
|
||||
|
||||
static void
|
||||
@ -667,6 +692,10 @@ dmu_tx_dirty_buf(dmu_tx_t *tx, dmu_buf_impl_t *db)
|
||||
case THT_NEWOBJECT:
|
||||
match_object = TRUE;
|
||||
break;
|
||||
case THT_CLONE:
|
||||
if (blkid >= beginblk && blkid <= endblk)
|
||||
match_offset = TRUE;
|
||||
break;
|
||||
default:
|
||||
cmn_err(CE_PANIC, "bad txh_type %d",
|
||||
txh->txh_type);
|
||||
|
@ -47,6 +47,7 @@
|
||||
#include <sys/vdev_impl.h>
|
||||
#include <sys/zil_impl.h>
|
||||
#include <sys/zio_checksum.h>
|
||||
#include <sys/brt.h>
|
||||
#include <sys/ddt.h>
|
||||
#include <sys/sa.h>
|
||||
#include <sys/sa_impl.h>
|
||||
@ -3499,11 +3500,12 @@ dsl_process_async_destroys(dsl_pool_t *dp, dmu_tx_t *tx)
|
||||
scn->scn_dedup_frees_this_txg = 0;
|
||||
|
||||
/*
|
||||
* Write out changes to the DDT that may be required as a
|
||||
* result of the blocks freed. This ensures that the DDT
|
||||
* is clean when a scrub/resilver runs.
|
||||
* Write out changes to the DDT and the BRT that may be required
|
||||
* as a result of the blocks freed. This ensures that the DDT
|
||||
* and the BRT are clean when a scrub/resilver runs.
|
||||
*/
|
||||
ddt_sync(spa, tx->tx_txg);
|
||||
brt_sync(spa, tx->tx_txg);
|
||||
}
|
||||
if (err != 0)
|
||||
return (err);
|
||||
|
@ -52,6 +52,7 @@
|
||||
#include <sys/dmu_tx.h>
|
||||
#include <sys/zap.h>
|
||||
#include <sys/zil.h>
|
||||
#include <sys/brt.h>
|
||||
#include <sys/ddt.h>
|
||||
#include <sys/vdev_impl.h>
|
||||
#include <sys/vdev_removal.h>
|
||||
@ -341,6 +342,12 @@ spa_prop_get_config(spa_t *spa, nvlist_t **nvp)
|
||||
|
||||
spa_prop_add_list(*nvp, ZPOOL_PROP_DEDUPRATIO, NULL,
|
||||
ddt_get_pool_dedup_ratio(spa), src);
|
||||
spa_prop_add_list(*nvp, ZPOOL_PROP_BCLONEUSED, NULL,
|
||||
brt_get_used(spa), src);
|
||||
spa_prop_add_list(*nvp, ZPOOL_PROP_BCLONESAVED, NULL,
|
||||
brt_get_saved(spa), src);
|
||||
spa_prop_add_list(*nvp, ZPOOL_PROP_BCLONERATIO, NULL,
|
||||
brt_get_ratio(spa), src);
|
||||
|
||||
spa_prop_add_list(*nvp, ZPOOL_PROP_HEALTH, NULL,
|
||||
rvd->vdev_state, src);
|
||||
@ -1707,6 +1714,7 @@ spa_unload(spa_t *spa)
|
||||
}
|
||||
|
||||
ddt_unload(spa);
|
||||
brt_unload(spa);
|
||||
spa_unload_log_sm_metadata(spa);
|
||||
|
||||
/*
|
||||
@ -4414,6 +4422,21 @@ spa_ld_load_dedup_tables(spa_t *spa)
|
||||
return (0);
|
||||
}
|
||||
|
||||
static int
|
||||
spa_ld_load_brt(spa_t *spa)
|
||||
{
|
||||
int error = 0;
|
||||
vdev_t *rvd = spa->spa_root_vdev;
|
||||
|
||||
error = brt_load(spa);
|
||||
if (error != 0) {
|
||||
spa_load_failed(spa, "brt_load failed [error=%d]", error);
|
||||
return (spa_vdev_err(rvd, VDEV_AUX_CORRUPT_DATA, EIO));
|
||||
}
|
||||
|
||||
return (0);
|
||||
}
|
||||
|
||||
static int
|
||||
spa_ld_verify_logs(spa_t *spa, spa_import_type_t type, const char **ereport)
|
||||
{
|
||||
@ -4895,6 +4918,10 @@ spa_load_impl(spa_t *spa, spa_import_type_t type, const char **ereport)
|
||||
if (error != 0)
|
||||
return (error);
|
||||
|
||||
error = spa_ld_load_brt(spa);
|
||||
if (error != 0)
|
||||
return (error);
|
||||
|
||||
/*
|
||||
* Verify the logs now to make sure we don't have any unexpected errors
|
||||
* when we claim log blocks later.
|
||||
@ -5963,6 +5990,10 @@ spa_create(const char *pool, nvlist_t *nvroot, nvlist_t *props,
|
||||
* Create DDTs (dedup tables).
|
||||
*/
|
||||
ddt_create(spa);
|
||||
/*
|
||||
* Create BRT table and BRT table object.
|
||||
*/
|
||||
brt_create(spa);
|
||||
|
||||
spa_update_dspace(spa);
|
||||
|
||||
@ -9138,6 +9169,7 @@ spa_sync_iterate_to_convergence(spa_t *spa, dmu_tx_t *tx)
|
||||
&spa->spa_deferred_bpobj, tx);
|
||||
}
|
||||
|
||||
brt_sync(spa, txg);
|
||||
ddt_sync(spa, txg);
|
||||
dsl_scan_sync(dp, tx);
|
||||
svr_sync(spa, tx);
|
||||
@ -9262,6 +9294,13 @@ spa_sync(spa_t *spa, uint64_t txg)
|
||||
spa->spa_txg_zio[txg & TXG_MASK] = zio_root(spa, NULL, NULL,
|
||||
ZIO_FLAG_CANFAIL);
|
||||
|
||||
/*
|
||||
* Now that there can be no more cloning in this transaction group,
|
||||
* but we are still before issuing frees, we can process pending BRT
|
||||
* updates.
|
||||
*/
|
||||
brt_pending_apply(spa, txg);
|
||||
|
||||
/*
|
||||
* Lock out configuration changes.
|
||||
*/
|
||||
|
@ -57,6 +57,7 @@
|
||||
#include <sys/fs/zfs.h>
|
||||
#include <sys/metaslab_impl.h>
|
||||
#include <sys/arc.h>
|
||||
#include <sys/brt.h>
|
||||
#include <sys/ddt.h>
|
||||
#include <sys/kstat.h>
|
||||
#include "zfs_prop.h"
|
||||
@ -1834,7 +1835,7 @@ void
|
||||
spa_update_dspace(spa_t *spa)
|
||||
{
|
||||
spa->spa_dspace = metaslab_class_get_dspace(spa_normal_class(spa)) +
|
||||
ddt_get_dedup_dspace(spa);
|
||||
ddt_get_dedup_dspace(spa) + brt_get_dspace(spa);
|
||||
if (spa->spa_nonallocating_dspace > 0) {
|
||||
/*
|
||||
* Subtract the space provided by all non-allocating vdevs that
|
||||
@ -2410,6 +2411,7 @@ spa_init(spa_mode_t mode)
|
||||
unique_init();
|
||||
zfs_btree_init();
|
||||
metaslab_stat_init();
|
||||
brt_init();
|
||||
ddt_init();
|
||||
zio_init();
|
||||
dmu_init();
|
||||
@ -2446,6 +2448,7 @@ spa_fini(void)
|
||||
dmu_fini();
|
||||
zio_fini();
|
||||
ddt_fini();
|
||||
brt_fini();
|
||||
metaslab_stat_fini();
|
||||
zfs_btree_fini();
|
||||
unique_fini();
|
||||
|
@ -23,7 +23,7 @@
|
||||
* Copyright (c) 2005, 2010, Oracle and/or its affiliates. All rights reserved.
|
||||
* Portions Copyright 2011 Martin Matuska
|
||||
* Copyright 2015, OmniTI Computer Consulting, Inc. All rights reserved.
|
||||
* Portions Copyright 2012 Pawel Jakub Dawidek <pawel@dawidek.net>
|
||||
* Copyright (c) 2012 Pawel Jakub Dawidek
|
||||
* Copyright (c) 2014, 2016 Joyent, Inc. All rights reserved.
|
||||
* Copyright 2016 Nexenta Systems, Inc. All rights reserved.
|
||||
* Copyright (c) 2014, Joyent, Inc. All rights reserved.
|
||||
|
@ -21,6 +21,7 @@
|
||||
/*
|
||||
* Copyright (c) 2005, 2010, Oracle and/or its affiliates. All rights reserved.
|
||||
* Copyright (c) 2015, 2018 by Delphix. All rights reserved.
|
||||
* Copyright (c) 2022 by Pawel Jakub Dawidek
|
||||
*/
|
||||
|
||||
|
||||
@ -891,5 +892,56 @@ zfs_log_acl(zilog_t *zilog, dmu_tx_t *tx, znode_t *zp,
|
||||
zil_itx_assign(zilog, itx, tx);
|
||||
}
|
||||
|
||||
/*
|
||||
* Handles TX_CLONE_RANGE transactions.
|
||||
*/
|
||||
void
|
||||
zfs_log_clone_range(zilog_t *zilog, dmu_tx_t *tx, int txtype, znode_t *zp,
|
||||
uint64_t off, uint64_t len, uint64_t blksz, const blkptr_t *bps,
|
||||
size_t nbps)
|
||||
{
|
||||
itx_t *itx;
|
||||
lr_clone_range_t *lr;
|
||||
uint64_t partlen, max_log_data;
|
||||
size_t i, partnbps;
|
||||
|
||||
VERIFY(!zil_replaying(zilog, tx));
|
||||
|
||||
if (zp->z_unlinked)
|
||||
return;
|
||||
|
||||
max_log_data = zil_max_log_data(zilog, sizeof (lr_clone_range_t));
|
||||
|
||||
while (nbps > 0) {
|
||||
partnbps = MIN(nbps, max_log_data / sizeof (bps[0]));
|
||||
partlen = 0;
|
||||
for (i = 0; i < partnbps; i++) {
|
||||
partlen += BP_GET_LSIZE(&bps[i]);
|
||||
}
|
||||
partlen = MIN(partlen, len);
|
||||
|
||||
itx = zil_itx_create(txtype,
|
||||
sizeof (*lr) + sizeof (bps[0]) * partnbps);
|
||||
lr = (lr_clone_range_t *)&itx->itx_lr;
|
||||
lr->lr_foid = zp->z_id;
|
||||
lr->lr_offset = off;
|
||||
lr->lr_length = partlen;
|
||||
lr->lr_blksz = blksz;
|
||||
lr->lr_nbps = partnbps;
|
||||
memcpy(lr->lr_bps, bps, sizeof (bps[0]) * partnbps);
|
||||
|
||||
itx->itx_sync = (zp->z_sync_cnt != 0);
|
||||
|
||||
zil_itx_assign(zilog, itx, tx);
|
||||
|
||||
bps += partnbps;
|
||||
ASSERT3U(nbps, >=, partnbps);
|
||||
nbps -= partnbps;
|
||||
off += partlen;
|
||||
ASSERT3U(len, >=, partlen);
|
||||
len -= partlen;
|
||||
}
|
||||
}
|
||||
|
||||
ZFS_MODULE_PARAM(zfs, zfs_, immediate_write_sz, S64, ZMOD_RW,
|
||||
"Largest data block to write to zil");
|
||||
|
@ -20,8 +20,7 @@
|
||||
*/
|
||||
/*
|
||||
* Copyright (c) 2005, 2010, Oracle and/or its affiliates. All rights reserved.
|
||||
* Copyright (c) 2011 Pawel Jakub Dawidek <pawel@dawidek.net>.
|
||||
* All rights reserved.
|
||||
* Copyright (c) 2011 Pawel Jakub Dawidek
|
||||
* Copyright (c) 2012, 2015, 2018 by Delphix. All rights reserved.
|
||||
* Copyright (c) 2014 Integros [integros.com]
|
||||
* Copyright 2016 Nexenta Systems, Inc. All rights reserved.
|
||||
|
@ -22,6 +22,7 @@
|
||||
* Copyright (c) 2005, 2010, Oracle and/or its affiliates. All rights reserved.
|
||||
* Copyright (c) 2012 Cyril Plisko. All rights reserved.
|
||||
* Copyright (c) 2013, 2017 by Delphix. All rights reserved.
|
||||
* Copyright (c) 2021, 2022 by Pawel Jakub Dawidek
|
||||
*/
|
||||
|
||||
#include <sys/types.h>
|
||||
@ -1162,6 +1163,34 @@ zfs_replay_acl(void *arg1, void *arg2, boolean_t byteswap)
|
||||
return (error);
|
||||
}
|
||||
|
||||
static int
|
||||
zfs_replay_clone_range(void *arg1, void *arg2, boolean_t byteswap)
|
||||
{
|
||||
zfsvfs_t *zfsvfs = arg1;
|
||||
lr_clone_range_t *lr = arg2;
|
||||
znode_t *zp;
|
||||
int error;
|
||||
|
||||
if (byteswap)
|
||||
byteswap_uint64_array(lr, sizeof (*lr));
|
||||
|
||||
if ((error = zfs_zget(zfsvfs, lr->lr_foid, &zp)) != 0) {
|
||||
/*
|
||||
* Clones can be logged out of order, so don't be surprised if
|
||||
* the file is gone - just return success.
|
||||
*/
|
||||
if (error == ENOENT)
|
||||
error = 0;
|
||||
return (error);
|
||||
}
|
||||
|
||||
error = zfs_clone_range_replay(zp, lr->lr_offset, lr->lr_length,
|
||||
lr->lr_blksz, lr->lr_bps, lr->lr_nbps);
|
||||
|
||||
zrele(zp);
|
||||
return (error);
|
||||
}
|
||||
|
||||
/*
|
||||
* Callback vectors for replaying records
|
||||
*/
|
||||
@ -1190,4 +1219,5 @@ zil_replay_func_t *const zfs_replay_vector[TX_MAX_TYPE] = {
|
||||
zfs_replay_setsaxattr, /* TX_SETSAXATTR */
|
||||
zfs_replay_rename_exchange, /* TX_RENAME_EXCHANGE */
|
||||
zfs_replay_rename_whiteout, /* TX_RENAME_WHITEOUT */
|
||||
zfs_replay_clone_range, /* TX_CLONE_RANGE */
|
||||
};
|
||||
|
@ -24,6 +24,7 @@
|
||||
* Copyright (c) 2012, 2018 by Delphix. All rights reserved.
|
||||
* Copyright (c) 2015 by Chunwei Chen. All rights reserved.
|
||||
* Copyright 2017 Nexenta Systems, Inc.
|
||||
* Copyright (c) 2021, 2022 by Pawel Jakub Dawidek
|
||||
*/
|
||||
|
||||
/* Portions Copyright 2007 Jeremy Teo */
|
||||
@ -50,6 +51,7 @@
|
||||
#include <sys/txg.h>
|
||||
#include <sys/dbuf.h>
|
||||
#include <sys/policy.h>
|
||||
#include <sys/zfeature.h>
|
||||
#include <sys/zfs_vnops.h>
|
||||
#include <sys/zfs_quota.h>
|
||||
#include <sys/zfs_vfsops.h>
|
||||
@ -501,7 +503,7 @@ zfs_write(znode_t *zp, zfs_uio_t *uio, int ioflag, cred_t *cr)
|
||||
lr = zfs_rangelock_enter(&zp->z_rangelock, woff, n, RL_WRITER);
|
||||
}
|
||||
|
||||
if (zn_rlimit_fsize(zp, uio)) {
|
||||
if (zn_rlimit_fsize_uio(zp, uio)) {
|
||||
zfs_rangelock_exit(lr);
|
||||
zfs_exit(zfsvfs, FTAG);
|
||||
return (SET_ERROR(EFBIG));
|
||||
@ -995,6 +997,467 @@ zfs_get_done(zgd_t *zgd, int error)
|
||||
kmem_free(zgd, sizeof (zgd_t));
|
||||
}
|
||||
|
||||
static int
|
||||
zfs_enter_two(zfsvfs_t *zfsvfs1, zfsvfs_t *zfsvfs2, const char *tag)
|
||||
{
|
||||
int error;
|
||||
|
||||
/* Swap. Not sure if the order of zfs_enter()s is important. */
|
||||
if (zfsvfs1 > zfsvfs2) {
|
||||
zfsvfs_t *tmpzfsvfs;
|
||||
|
||||
tmpzfsvfs = zfsvfs2;
|
||||
zfsvfs2 = zfsvfs1;
|
||||
zfsvfs1 = tmpzfsvfs;
|
||||
}
|
||||
|
||||
error = zfs_enter(zfsvfs1, tag);
|
||||
if (error != 0)
|
||||
return (error);
|
||||
if (zfsvfs1 != zfsvfs2) {
|
||||
error = zfs_enter(zfsvfs2, tag);
|
||||
if (error != 0) {
|
||||
zfs_exit(zfsvfs1, tag);
|
||||
return (error);
|
||||
}
|
||||
}
|
||||
|
||||
return (0);
|
||||
}
|
||||
|
||||
static void
|
||||
zfs_exit_two(zfsvfs_t *zfsvfs1, zfsvfs_t *zfsvfs2, const char *tag)
|
||||
{
|
||||
|
||||
zfs_exit(zfsvfs1, tag);
|
||||
if (zfsvfs1 != zfsvfs2)
|
||||
zfs_exit(zfsvfs2, tag);
|
||||
}
|
||||
|
||||
/*
|
||||
* We split each clone request in chunks that can fit into a single ZIL
|
||||
* log entry. Each ZIL log entry can fit 130816 bytes for a block cloning
|
||||
* operation (see zil_max_log_data() and zfs_log_clone_range()). This gives
|
||||
* us room for storing 1022 block pointers.
|
||||
*
|
||||
* On success, the function return the number of bytes copied in *lenp.
|
||||
* Note, it doesn't return how much bytes are left to be copied.
|
||||
*/
|
||||
int
|
||||
zfs_clone_range(znode_t *inzp, uint64_t *inoffp, znode_t *outzp,
|
||||
uint64_t *outoffp, uint64_t *lenp, cred_t *cr)
|
||||
{
|
||||
zfsvfs_t *inzfsvfs, *outzfsvfs;
|
||||
objset_t *inos, *outos;
|
||||
zfs_locked_range_t *inlr, *outlr;
|
||||
dmu_buf_impl_t *db;
|
||||
dmu_tx_t *tx;
|
||||
zilog_t *zilog;
|
||||
uint64_t inoff, outoff, len, done;
|
||||
uint64_t outsize, size;
|
||||
int error;
|
||||
int count = 0;
|
||||
sa_bulk_attr_t bulk[3];
|
||||
uint64_t mtime[2], ctime[2];
|
||||
uint64_t uid, gid, projid;
|
||||
blkptr_t *bps;
|
||||
size_t maxblocks, nbps;
|
||||
uint_t inblksz;
|
||||
uint64_t clear_setid_bits_txg = 0;
|
||||
|
||||
inoff = *inoffp;
|
||||
outoff = *outoffp;
|
||||
len = *lenp;
|
||||
done = 0;
|
||||
|
||||
inzfsvfs = ZTOZSB(inzp);
|
||||
outzfsvfs = ZTOZSB(outzp);
|
||||
inos = inzfsvfs->z_os;
|
||||
outos = outzfsvfs->z_os;
|
||||
|
||||
/*
|
||||
* Both source and destination have to belong to the same storage pool.
|
||||
*/
|
||||
if (dmu_objset_spa(inos) != dmu_objset_spa(outos)) {
|
||||
zfs_exit_two(inzfsvfs, outzfsvfs, FTAG);
|
||||
return (SET_ERROR(EXDEV));
|
||||
}
|
||||
|
||||
/*
|
||||
* We need to call zfs_enter() potentially on two different datasets,
|
||||
* so we need a dedicated function for that.
|
||||
*/
|
||||
error = zfs_enter_two(inzfsvfs, outzfsvfs, FTAG);
|
||||
if (error != 0)
|
||||
return (error);
|
||||
|
||||
ASSERT(!outzfsvfs->z_replay);
|
||||
|
||||
error = zfs_verify_zp(inzp);
|
||||
if (error == 0)
|
||||
error = zfs_verify_zp(outzp);
|
||||
if (error != 0) {
|
||||
zfs_exit_two(inzfsvfs, outzfsvfs, FTAG);
|
||||
return (error);
|
||||
}
|
||||
|
||||
if (!spa_feature_is_enabled(dmu_objset_spa(outos),
|
||||
SPA_FEATURE_BLOCK_CLONING)) {
|
||||
zfs_exit_two(inzfsvfs, outzfsvfs, FTAG);
|
||||
return (SET_ERROR(EXDEV));
|
||||
}
|
||||
|
||||
/*
|
||||
* We don't copy source file's flags that's why we don't allow to clone
|
||||
* files that are in quarantine.
|
||||
*/
|
||||
if (inzp->z_pflags & ZFS_AV_QUARANTINED) {
|
||||
zfs_exit_two(inzfsvfs, outzfsvfs, FTAG);
|
||||
return (SET_ERROR(EACCES));
|
||||
}
|
||||
|
||||
if (inoff >= inzp->z_size) {
|
||||
*lenp = 0;
|
||||
zfs_exit_two(inzfsvfs, outzfsvfs, FTAG);
|
||||
return (0);
|
||||
}
|
||||
if (len > inzp->z_size - inoff) {
|
||||
len = inzp->z_size - inoff;
|
||||
}
|
||||
if (len == 0) {
|
||||
*lenp = 0;
|
||||
zfs_exit_two(inzfsvfs, outzfsvfs, FTAG);
|
||||
return (0);
|
||||
}
|
||||
|
||||
/*
|
||||
* Callers might not be able to detect properly that we are read-only,
|
||||
* so check it explicitly here.
|
||||
*/
|
||||
if (zfs_is_readonly(outzfsvfs)) {
|
||||
zfs_exit_two(inzfsvfs, outzfsvfs, FTAG);
|
||||
return (SET_ERROR(EROFS));
|
||||
}
|
||||
|
||||
/*
|
||||
* If immutable or not appending then return EPERM.
|
||||
* Intentionally allow ZFS_READONLY through here.
|
||||
* See zfs_zaccess_common()
|
||||
*/
|
||||
if ((outzp->z_pflags & ZFS_IMMUTABLE) != 0) {
|
||||
zfs_exit_two(inzfsvfs, outzfsvfs, FTAG);
|
||||
return (SET_ERROR(EPERM));
|
||||
}
|
||||
|
||||
/*
|
||||
* No overlapping if we are cloning within the same file.
|
||||
*/
|
||||
if (inzp == outzp) {
|
||||
if (inoff < outoff + len && outoff < inoff + len) {
|
||||
zfs_exit_two(inzfsvfs, outzfsvfs, FTAG);
|
||||
return (SET_ERROR(EINVAL));
|
||||
}
|
||||
}
|
||||
|
||||
/*
|
||||
* Maintain predictable lock order.
|
||||
*/
|
||||
if (inzp < outzp || (inzp == outzp && inoff < outoff)) {
|
||||
inlr = zfs_rangelock_enter(&inzp->z_rangelock, inoff, len,
|
||||
RL_READER);
|
||||
outlr = zfs_rangelock_enter(&outzp->z_rangelock, outoff, len,
|
||||
RL_WRITER);
|
||||
} else {
|
||||
outlr = zfs_rangelock_enter(&outzp->z_rangelock, outoff, len,
|
||||
RL_WRITER);
|
||||
inlr = zfs_rangelock_enter(&inzp->z_rangelock, inoff, len,
|
||||
RL_READER);
|
||||
}
|
||||
|
||||
inblksz = inzp->z_blksz;
|
||||
|
||||
/*
|
||||
* We cannot clone into files with different block size.
|
||||
*/
|
||||
if (inblksz != outzp->z_blksz && outzp->z_size > inblksz) {
|
||||
error = SET_ERROR(EXDEV);
|
||||
goto unlock;
|
||||
}
|
||||
|
||||
/*
|
||||
* Offsets and len must be at block boundries.
|
||||
*/
|
||||
if ((inoff % inblksz) != 0 || (outoff % inblksz) != 0) {
|
||||
error = SET_ERROR(EXDEV);
|
||||
goto unlock;
|
||||
}
|
||||
/*
|
||||
* Length must be multipe of blksz, except for the end of the file.
|
||||
*/
|
||||
if ((len % inblksz) != 0 &&
|
||||
(len < inzp->z_size - inoff || len < outzp->z_size - outoff)) {
|
||||
error = SET_ERROR(EXDEV);
|
||||
goto unlock;
|
||||
}
|
||||
|
||||
error = zn_rlimit_fsize(outoff + len);
|
||||
if (error != 0) {
|
||||
goto unlock;
|
||||
}
|
||||
|
||||
if (inoff >= MAXOFFSET_T || outoff >= MAXOFFSET_T) {
|
||||
error = SET_ERROR(EFBIG);
|
||||
goto unlock;
|
||||
}
|
||||
|
||||
SA_ADD_BULK_ATTR(bulk, count, SA_ZPL_MTIME(outzfsvfs), NULL,
|
||||
&mtime, 16);
|
||||
SA_ADD_BULK_ATTR(bulk, count, SA_ZPL_CTIME(outzfsvfs), NULL,
|
||||
&ctime, 16);
|
||||
SA_ADD_BULK_ATTR(bulk, count, SA_ZPL_SIZE(outzfsvfs), NULL,
|
||||
&outzp->z_size, 8);
|
||||
|
||||
zilog = outzfsvfs->z_log;
|
||||
maxblocks = zil_max_log_data(zilog, sizeof (lr_clone_range_t)) /
|
||||
sizeof (bps[0]);
|
||||
|
||||
uid = KUID_TO_SUID(ZTOUID(outzp));
|
||||
gid = KGID_TO_SGID(ZTOGID(outzp));
|
||||
projid = outzp->z_projid;
|
||||
|
||||
bps = kmem_alloc(sizeof (bps[0]) * maxblocks, KM_SLEEP);
|
||||
|
||||
/*
|
||||
* Clone the file in reasonable size chunks. Each chunk is cloned
|
||||
* in a separate transaction; this keeps the intent log records small
|
||||
* and allows us to do more fine-grained space accounting.
|
||||
*/
|
||||
while (len > 0) {
|
||||
size = MIN(inblksz * maxblocks, len);
|
||||
|
||||
if (zfs_id_overblockquota(outzfsvfs, DMU_USERUSED_OBJECT,
|
||||
uid) ||
|
||||
zfs_id_overblockquota(outzfsvfs, DMU_GROUPUSED_OBJECT,
|
||||
gid) ||
|
||||
(projid != ZFS_DEFAULT_PROJID &&
|
||||
zfs_id_overblockquota(outzfsvfs, DMU_PROJECTUSED_OBJECT,
|
||||
projid))) {
|
||||
error = SET_ERROR(EDQUOT);
|
||||
break;
|
||||
}
|
||||
|
||||
/*
|
||||
* Start a transaction.
|
||||
*/
|
||||
tx = dmu_tx_create(outos);
|
||||
|
||||
nbps = maxblocks;
|
||||
error = dmu_read_l0_bps(inos, inzp->z_id, inoff, size, tx, bps,
|
||||
&nbps);
|
||||
if (error != 0) {
|
||||
dmu_tx_abort(tx);
|
||||
/*
|
||||
* If we are tyring to clone a block that was created
|
||||
* in the current transaction group. Return an error,
|
||||
* so the caller can fallback to just copying the data.
|
||||
*/
|
||||
if (error == EAGAIN) {
|
||||
error = SET_ERROR(EXDEV);
|
||||
}
|
||||
break;
|
||||
}
|
||||
/*
|
||||
* Encrypted data is fine as long as it comes from the same
|
||||
* dataset.
|
||||
* TODO: We want to extend it in the future to allow cloning to
|
||||
* datasets with the same keys, like clones or to be able to
|
||||
* clone a file from a snapshot of an encrypted dataset into the
|
||||
* dataset itself.
|
||||
*/
|
||||
if (BP_IS_PROTECTED(&bps[0])) {
|
||||
if (inzfsvfs != outzfsvfs) {
|
||||
dmu_tx_abort(tx);
|
||||
error = SET_ERROR(EXDEV);
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
dmu_tx_hold_sa(tx, outzp->z_sa_hdl, B_FALSE);
|
||||
db = (dmu_buf_impl_t *)sa_get_db(outzp->z_sa_hdl);
|
||||
DB_DNODE_ENTER(db);
|
||||
dmu_tx_hold_clone_by_dnode(tx, DB_DNODE(db), outoff, size);
|
||||
DB_DNODE_EXIT(db);
|
||||
zfs_sa_upgrade_txholds(tx, outzp);
|
||||
error = dmu_tx_assign(tx, TXG_WAIT);
|
||||
if (error != 0) {
|
||||
dmu_tx_abort(tx);
|
||||
break;
|
||||
}
|
||||
|
||||
/*
|
||||
* Copy source znode's block size. This only happens on the
|
||||
* first iteration since zfs_rangelock_reduce() will shrink down
|
||||
* lr_len to the appropriate size.
|
||||
*/
|
||||
if (outlr->lr_length == UINT64_MAX) {
|
||||
zfs_grow_blocksize(outzp, inblksz, tx);
|
||||
/*
|
||||
* Round range lock up to the block boundary, so we
|
||||
* prevent appends until we are done.
|
||||
*/
|
||||
zfs_rangelock_reduce(outlr, outoff,
|
||||
((len - 1) / inblksz + 1) * inblksz);
|
||||
}
|
||||
|
||||
dmu_brt_clone(outos, outzp->z_id, outoff, size, tx, bps, nbps,
|
||||
B_FALSE);
|
||||
|
||||
zfs_clear_setid_bits_if_necessary(outzfsvfs, outzp, cr,
|
||||
&clear_setid_bits_txg, tx);
|
||||
|
||||
zfs_tstamp_update_setup(outzp, CONTENT_MODIFIED, mtime, ctime);
|
||||
|
||||
/*
|
||||
* Update the file size (zp_size) if it has changed;
|
||||
* account for possible concurrent updates.
|
||||
*/
|
||||
while ((outsize = outzp->z_size) < outoff + size) {
|
||||
(void) atomic_cas_64(&outzp->z_size, outsize,
|
||||
outoff + size);
|
||||
}
|
||||
|
||||
error = sa_bulk_update(outzp->z_sa_hdl, bulk, count, tx);
|
||||
|
||||
zfs_log_clone_range(zilog, tx, TX_CLONE_RANGE, outzp, outoff,
|
||||
size, inblksz, bps, nbps);
|
||||
|
||||
dmu_tx_commit(tx);
|
||||
|
||||
if (error != 0)
|
||||
break;
|
||||
|
||||
inoff += size;
|
||||
outoff += size;
|
||||
len -= size;
|
||||
done += size;
|
||||
}
|
||||
|
||||
kmem_free(bps, sizeof (bps[0]) * maxblocks);
|
||||
zfs_znode_update_vfs(outzp);
|
||||
|
||||
unlock:
|
||||
zfs_rangelock_exit(outlr);
|
||||
zfs_rangelock_exit(inlr);
|
||||
|
||||
if (done > 0) {
|
||||
/*
|
||||
* If we have made at least partial progress, reset the error.
|
||||
*/
|
||||
error = 0;
|
||||
|
||||
ZFS_ACCESSTIME_STAMP(inzfsvfs, inzp);
|
||||
|
||||
if (outos->os_sync == ZFS_SYNC_ALWAYS) {
|
||||
zil_commit(zilog, outzp->z_id);
|
||||
}
|
||||
|
||||
*inoffp += done;
|
||||
*outoffp += done;
|
||||
*lenp = done;
|
||||
}
|
||||
|
||||
zfs_exit_two(inzfsvfs, outzfsvfs, FTAG);
|
||||
|
||||
return (error);
|
||||
}
|
||||
|
||||
/*
|
||||
* Usual pattern would be to call zfs_clone_range() from zfs_replay_clone(),
|
||||
* but we cannot do that, because when replaying we don't have source znode
|
||||
* available. This is why we need a dedicated replay function.
|
||||
*/
|
||||
int
|
||||
zfs_clone_range_replay(znode_t *zp, uint64_t off, uint64_t len, uint64_t blksz,
|
||||
const blkptr_t *bps, size_t nbps)
|
||||
{
|
||||
zfsvfs_t *zfsvfs;
|
||||
dmu_buf_impl_t *db;
|
||||
dmu_tx_t *tx;
|
||||
int error;
|
||||
int count = 0;
|
||||
sa_bulk_attr_t bulk[3];
|
||||
uint64_t mtime[2], ctime[2];
|
||||
|
||||
ASSERT3U(off, <, MAXOFFSET_T);
|
||||
ASSERT3U(len, >, 0);
|
||||
ASSERT3U(nbps, >, 0);
|
||||
|
||||
zfsvfs = ZTOZSB(zp);
|
||||
|
||||
ASSERT(spa_feature_is_enabled(dmu_objset_spa(zfsvfs->z_os),
|
||||
SPA_FEATURE_BLOCK_CLONING));
|
||||
|
||||
if ((error = zfs_enter_verify_zp(zfsvfs, zp, FTAG)) != 0)
|
||||
return (error);
|
||||
|
||||
ASSERT(zfsvfs->z_replay);
|
||||
ASSERT(!zfs_is_readonly(zfsvfs));
|
||||
|
||||
if ((off % blksz) != 0) {
|
||||
zfs_exit(zfsvfs, FTAG);
|
||||
return (SET_ERROR(EINVAL));
|
||||
}
|
||||
|
||||
SA_ADD_BULK_ATTR(bulk, count, SA_ZPL_MTIME(zfsvfs), NULL, &mtime, 16);
|
||||
SA_ADD_BULK_ATTR(bulk, count, SA_ZPL_CTIME(zfsvfs), NULL, &ctime, 16);
|
||||
SA_ADD_BULK_ATTR(bulk, count, SA_ZPL_SIZE(zfsvfs), NULL,
|
||||
&zp->z_size, 8);
|
||||
|
||||
/*
|
||||
* Start a transaction.
|
||||
*/
|
||||
tx = dmu_tx_create(zfsvfs->z_os);
|
||||
|
||||
dmu_tx_hold_sa(tx, zp->z_sa_hdl, B_FALSE);
|
||||
db = (dmu_buf_impl_t *)sa_get_db(zp->z_sa_hdl);
|
||||
DB_DNODE_ENTER(db);
|
||||
dmu_tx_hold_clone_by_dnode(tx, DB_DNODE(db), off, len);
|
||||
DB_DNODE_EXIT(db);
|
||||
zfs_sa_upgrade_txholds(tx, zp);
|
||||
error = dmu_tx_assign(tx, TXG_WAIT);
|
||||
if (error != 0) {
|
||||
dmu_tx_abort(tx);
|
||||
zfs_exit(zfsvfs, FTAG);
|
||||
return (error);
|
||||
}
|
||||
|
||||
if (zp->z_blksz < blksz)
|
||||
zfs_grow_blocksize(zp, blksz, tx);
|
||||
|
||||
dmu_brt_clone(zfsvfs->z_os, zp->z_id, off, len, tx, bps, nbps, B_TRUE);
|
||||
|
||||
zfs_tstamp_update_setup(zp, CONTENT_MODIFIED, mtime, ctime);
|
||||
|
||||
if (zp->z_size < off + len)
|
||||
zp->z_size = off + len;
|
||||
|
||||
error = sa_bulk_update(zp->z_sa_hdl, bulk, count, tx);
|
||||
|
||||
/*
|
||||
* zil_replaying() not only check if we are replaying ZIL, but also
|
||||
* updates the ZIL header to record replay progress.
|
||||
*/
|
||||
VERIFY(zil_replaying(zfsvfs->z_log, tx));
|
||||
|
||||
dmu_tx_commit(tx);
|
||||
|
||||
zfs_znode_update_vfs(zp);
|
||||
|
||||
zfs_exit(zfsvfs, FTAG);
|
||||
|
||||
return (error);
|
||||
}
|
||||
|
||||
EXPORT_SYMBOL(zfs_access);
|
||||
EXPORT_SYMBOL(zfs_fsync);
|
||||
EXPORT_SYMBOL(zfs_holey);
|
||||
@ -1002,6 +1465,8 @@ EXPORT_SYMBOL(zfs_read);
|
||||
EXPORT_SYMBOL(zfs_write);
|
||||
EXPORT_SYMBOL(zfs_getsecattr);
|
||||
EXPORT_SYMBOL(zfs_setsecattr);
|
||||
EXPORT_SYMBOL(zfs_clone_range);
|
||||
EXPORT_SYMBOL(zfs_clone_range_replay);
|
||||
|
||||
ZFS_MODULE_PARAM(zfs_vnops, zfs_vnops_, read_chunk_size, U64, ZMOD_RW,
|
||||
"Bytes to read per chunk");
|
||||
|
126
module/zfs/zil.c
126
module/zfs/zil.c
@ -43,6 +43,7 @@
|
||||
#include <sys/metaslab.h>
|
||||
#include <sys/trace_zfs.h>
|
||||
#include <sys/abd.h>
|
||||
#include <sys/brt.h>
|
||||
#include <sys/wmsum.h>
|
||||
|
||||
/*
|
||||
@ -578,14 +579,12 @@ zil_claim_log_block(zilog_t *zilog, const blkptr_t *bp, void *tx,
|
||||
}
|
||||
|
||||
static int
|
||||
zil_claim_log_record(zilog_t *zilog, const lr_t *lrc, void *tx,
|
||||
uint64_t first_txg)
|
||||
zil_claim_write(zilog_t *zilog, const lr_t *lrc, void *tx, uint64_t first_txg)
|
||||
{
|
||||
lr_write_t *lr = (lr_write_t *)lrc;
|
||||
int error;
|
||||
|
||||
if (lrc->lrc_txtype != TX_WRITE)
|
||||
return (0);
|
||||
ASSERT(lrc->lrc_txtype == TX_WRITE);
|
||||
|
||||
/*
|
||||
* If the block is not readable, don't claim it. This can happen
|
||||
@ -604,6 +603,57 @@ zil_claim_log_record(zilog_t *zilog, const lr_t *lrc, void *tx,
|
||||
return (zil_claim_log_block(zilog, &lr->lr_blkptr, tx, first_txg));
|
||||
}
|
||||
|
||||
static int
|
||||
zil_claim_clone_range(zilog_t *zilog, const lr_t *lrc, void *tx)
|
||||
{
|
||||
const lr_clone_range_t *lr = (const lr_clone_range_t *)lrc;
|
||||
const blkptr_t *bp;
|
||||
spa_t *spa;
|
||||
uint_t ii;
|
||||
|
||||
ASSERT(lrc->lrc_txtype == TX_CLONE_RANGE);
|
||||
|
||||
if (tx == NULL) {
|
||||
return (0);
|
||||
}
|
||||
|
||||
/*
|
||||
* XXX: Do we need to byteswap lr?
|
||||
*/
|
||||
|
||||
spa = zilog->zl_spa;
|
||||
|
||||
for (ii = 0; ii < lr->lr_nbps; ii++) {
|
||||
bp = &lr->lr_bps[ii];
|
||||
|
||||
/*
|
||||
* When data in embedded into BP there is no need to create
|
||||
* BRT entry as there is no data block. Just copy the BP as
|
||||
* it contains the data.
|
||||
*/
|
||||
if (!BP_IS_HOLE(bp) && !BP_IS_EMBEDDED(bp)) {
|
||||
brt_pending_add(spa, bp, tx);
|
||||
}
|
||||
}
|
||||
|
||||
return (0);
|
||||
}
|
||||
|
||||
static int
|
||||
zil_claim_log_record(zilog_t *zilog, const lr_t *lrc, void *tx,
|
||||
uint64_t first_txg)
|
||||
{
|
||||
|
||||
switch (lrc->lrc_txtype) {
|
||||
case TX_WRITE:
|
||||
return (zil_claim_write(zilog, lrc, tx, first_txg));
|
||||
case TX_CLONE_RANGE:
|
||||
return (zil_claim_clone_range(zilog, lrc, tx));
|
||||
default:
|
||||
return (0);
|
||||
}
|
||||
}
|
||||
|
||||
static int
|
||||
zil_free_log_block(zilog_t *zilog, const blkptr_t *bp, void *tx,
|
||||
uint64_t claim_txg)
|
||||
@ -616,23 +666,70 @@ zil_free_log_block(zilog_t *zilog, const blkptr_t *bp, void *tx,
|
||||
}
|
||||
|
||||
static int
|
||||
zil_free_log_record(zilog_t *zilog, const lr_t *lrc, void *tx,
|
||||
uint64_t claim_txg)
|
||||
zil_free_write(zilog_t *zilog, const lr_t *lrc, void *tx, uint64_t claim_txg)
|
||||
{
|
||||
lr_write_t *lr = (lr_write_t *)lrc;
|
||||
blkptr_t *bp = &lr->lr_blkptr;
|
||||
|
||||
ASSERT(lrc->lrc_txtype == TX_WRITE);
|
||||
|
||||
/*
|
||||
* If we previously claimed it, we need to free it.
|
||||
*/
|
||||
if (claim_txg != 0 && lrc->lrc_txtype == TX_WRITE &&
|
||||
bp->blk_birth >= claim_txg && zil_bp_tree_add(zilog, bp) == 0 &&
|
||||
!BP_IS_HOLE(bp))
|
||||
if (bp->blk_birth >= claim_txg && zil_bp_tree_add(zilog, bp) == 0 &&
|
||||
!BP_IS_HOLE(bp)) {
|
||||
zio_free(zilog->zl_spa, dmu_tx_get_txg(tx), bp);
|
||||
}
|
||||
|
||||
return (0);
|
||||
}
|
||||
|
||||
static int
|
||||
zil_free_clone_range(zilog_t *zilog, const lr_t *lrc, void *tx)
|
||||
{
|
||||
const lr_clone_range_t *lr = (const lr_clone_range_t *)lrc;
|
||||
const blkptr_t *bp;
|
||||
spa_t *spa;
|
||||
uint_t ii;
|
||||
|
||||
ASSERT(lrc->lrc_txtype == TX_CLONE_RANGE);
|
||||
|
||||
if (tx == NULL) {
|
||||
return (0);
|
||||
}
|
||||
|
||||
spa = zilog->zl_spa;
|
||||
|
||||
for (ii = 0; ii < lr->lr_nbps; ii++) {
|
||||
bp = &lr->lr_bps[ii];
|
||||
|
||||
if (!BP_IS_HOLE(bp)) {
|
||||
zio_free(spa, dmu_tx_get_txg(tx), bp);
|
||||
}
|
||||
}
|
||||
|
||||
return (0);
|
||||
}
|
||||
|
||||
static int
|
||||
zil_free_log_record(zilog_t *zilog, const lr_t *lrc, void *tx,
|
||||
uint64_t claim_txg)
|
||||
{
|
||||
|
||||
if (claim_txg == 0) {
|
||||
return (0);
|
||||
}
|
||||
|
||||
switch (lrc->lrc_txtype) {
|
||||
case TX_WRITE:
|
||||
return (zil_free_write(zilog, lrc, tx, claim_txg));
|
||||
case TX_CLONE_RANGE:
|
||||
return (zil_free_clone_range(zilog, lrc, tx));
|
||||
default:
|
||||
return (0);
|
||||
}
|
||||
}
|
||||
|
||||
static int
|
||||
zil_lwb_vdev_compare(const void *x1, const void *x2)
|
||||
{
|
||||
@ -1798,13 +1895,12 @@ zil_lwb_write_issue(zilog_t *zilog, lwb_t *lwb)
|
||||
}
|
||||
|
||||
/*
|
||||
* Maximum amount of write data that can be put into single log block.
|
||||
* Maximum amount of data that can be put into single log block.
|
||||
*/
|
||||
uint64_t
|
||||
zil_max_log_data(zilog_t *zilog)
|
||||
zil_max_log_data(zilog_t *zilog, size_t hdrsize)
|
||||
{
|
||||
return (zilog->zl_max_block_size -
|
||||
sizeof (zil_chain_t) - sizeof (lr_write_t));
|
||||
return (zilog->zl_max_block_size - sizeof (zil_chain_t) - hdrsize);
|
||||
}
|
||||
|
||||
/*
|
||||
@ -1814,7 +1910,7 @@ zil_max_log_data(zilog_t *zilog)
|
||||
static inline uint64_t
|
||||
zil_max_waste_space(zilog_t *zilog)
|
||||
{
|
||||
return (zil_max_log_data(zilog) / 8);
|
||||
return (zil_max_log_data(zilog, sizeof (lr_write_t)) / 8);
|
||||
}
|
||||
|
||||
/*
|
||||
@ -1887,7 +1983,7 @@ zil_lwb_commit(zilog_t *zilog, itx_t *itx, lwb_t *lwb)
|
||||
* For WR_NEED_COPY optimize layout for minimal number of chunks.
|
||||
*/
|
||||
lwb_sp = lwb->lwb_sz - lwb->lwb_nused;
|
||||
max_log_data = zil_max_log_data(zilog);
|
||||
max_log_data = zil_max_log_data(zilog, sizeof (lr_write_t));
|
||||
if (reclen > lwb_sp || (reclen + dlen > lwb_sp &&
|
||||
lwb_sp < zil_max_waste_space(zilog) &&
|
||||
(dlen % max_log_data == 0 ||
|
||||
|
@ -41,6 +41,7 @@
|
||||
#include <sys/zio_checksum.h>
|
||||
#include <sys/dmu_objset.h>
|
||||
#include <sys/arc.h>
|
||||
#include <sys/brt.h>
|
||||
#include <sys/ddt.h>
|
||||
#include <sys/blkptr.h>
|
||||
#include <sys/zfeature.h>
|
||||
@ -1176,12 +1177,14 @@ zio_rewrite(zio_t *pio, spa_t *spa, uint64_t txg, blkptr_t *bp, abd_t *data,
|
||||
}
|
||||
|
||||
void
|
||||
zio_write_override(zio_t *zio, blkptr_t *bp, int copies, boolean_t nopwrite)
|
||||
zio_write_override(zio_t *zio, blkptr_t *bp, int copies, boolean_t nopwrite,
|
||||
boolean_t brtwrite)
|
||||
{
|
||||
ASSERT(zio->io_type == ZIO_TYPE_WRITE);
|
||||
ASSERT(zio->io_child_type == ZIO_CHILD_LOGICAL);
|
||||
ASSERT(zio->io_stage == ZIO_STAGE_OPEN);
|
||||
ASSERT(zio->io_txg == spa_syncing_txg(zio->io_spa));
|
||||
ASSERT(!brtwrite || !nopwrite);
|
||||
|
||||
/*
|
||||
* We must reset the io_prop to match the values that existed
|
||||
@ -1190,6 +1193,7 @@ zio_write_override(zio_t *zio, blkptr_t *bp, int copies, boolean_t nopwrite)
|
||||
*/
|
||||
zio->io_prop.zp_dedup = nopwrite ? B_FALSE : zio->io_prop.zp_dedup;
|
||||
zio->io_prop.zp_nopwrite = nopwrite;
|
||||
zio->io_prop.zp_brtwrite = brtwrite;
|
||||
zio->io_prop.zp_copies = copies;
|
||||
zio->io_bp_override = bp;
|
||||
}
|
||||
@ -1222,7 +1226,8 @@ zio_free(spa_t *spa, uint64_t txg, const blkptr_t *bp)
|
||||
BP_GET_DEDUP(bp) ||
|
||||
txg != spa->spa_syncing_txg ||
|
||||
(spa_sync_pass(spa) >= zfs_sync_pass_deferred_free &&
|
||||
!spa_feature_is_active(spa, SPA_FEATURE_LOG_SPACEMAP))) {
|
||||
!spa_feature_is_active(spa, SPA_FEATURE_LOG_SPACEMAP)) ||
|
||||
brt_maybe_exists(spa, bp)) {
|
||||
metaslab_check_free(spa, bp);
|
||||
bplist_append(&spa->spa_free_bplist[txg & TXG_MASK], bp);
|
||||
} else {
|
||||
@ -1249,11 +1254,13 @@ zio_free_sync(zio_t *pio, spa_t *spa, uint64_t txg, const blkptr_t *bp,
|
||||
arc_freed(spa, bp);
|
||||
dsl_scan_freed(spa, bp);
|
||||
|
||||
if (BP_IS_GANG(bp) || BP_GET_DEDUP(bp)) {
|
||||
if (BP_IS_GANG(bp) ||
|
||||
BP_GET_DEDUP(bp) ||
|
||||
brt_maybe_exists(spa, bp)) {
|
||||
/*
|
||||
* GANG and DEDUP blocks can induce a read (for the gang block
|
||||
* header, or the DDT), so issue them asynchronously so that
|
||||
* this thread is not tied up.
|
||||
* GANG, DEDUP and BRT blocks can induce a read (for the gang
|
||||
* block header, the DDT or the BRT), so issue them
|
||||
* asynchronously so that this thread is not tied up.
|
||||
*/
|
||||
enum zio_stage stage =
|
||||
ZIO_FREE_PIPELINE | ZIO_STAGE_ISSUE_ASYNC;
|
||||
@ -1594,11 +1601,15 @@ zio_write_bp_init(zio_t *zio)
|
||||
zio_prop_t *zp = &zio->io_prop;
|
||||
|
||||
ASSERT(bp->blk_birth != zio->io_txg);
|
||||
ASSERT(BP_GET_DEDUP(zio->io_bp_override) == 0);
|
||||
|
||||
*bp = *zio->io_bp_override;
|
||||
zio->io_pipeline = ZIO_INTERLOCK_PIPELINE;
|
||||
|
||||
if (zp->zp_brtwrite)
|
||||
return (zio);
|
||||
|
||||
ASSERT(!BP_GET_DEDUP(zio->io_bp_override));
|
||||
|
||||
if (BP_IS_EMBEDDED(bp))
|
||||
return (zio);
|
||||
|
||||
@ -3042,6 +3053,35 @@ zio_nop_write(zio_t *zio)
|
||||
return (zio);
|
||||
}
|
||||
|
||||
/*
|
||||
* ==========================================================================
|
||||
* Block Reference Table
|
||||
* ==========================================================================
|
||||
*/
|
||||
static zio_t *
|
||||
zio_brt_free(zio_t *zio)
|
||||
{
|
||||
blkptr_t *bp;
|
||||
|
||||
bp = zio->io_bp;
|
||||
|
||||
if (BP_GET_LEVEL(bp) > 0 ||
|
||||
BP_IS_METADATA(bp) ||
|
||||
!brt_maybe_exists(zio->io_spa, bp)) {
|
||||
return (zio);
|
||||
}
|
||||
|
||||
if (!brt_entry_decref(zio->io_spa, bp)) {
|
||||
/*
|
||||
* This isn't the last reference, so we cannot free
|
||||
* the data yet.
|
||||
*/
|
||||
zio->io_pipeline = ZIO_INTERLOCK_PIPELINE;
|
||||
}
|
||||
|
||||
return (zio);
|
||||
}
|
||||
|
||||
/*
|
||||
* ==========================================================================
|
||||
* Dedup
|
||||
@ -4894,6 +4934,7 @@ static zio_pipe_stage_t *zio_pipeline[] = {
|
||||
zio_encrypt,
|
||||
zio_checksum_generate,
|
||||
zio_nop_write,
|
||||
zio_brt_free,
|
||||
zio_ddt_read_start,
|
||||
zio_ddt_read_done,
|
||||
zio_ddt_write,
|
||||
|
@ -482,6 +482,60 @@ zvol_replay_write(void *arg1, void *arg2, boolean_t byteswap)
|
||||
return (error);
|
||||
}
|
||||
|
||||
/*
|
||||
* Replay a TX_CLONE_RANGE ZIL transaction that didn't get committed
|
||||
* after a system failure.
|
||||
*
|
||||
* TODO: For now we drop block cloning transations for ZVOLs as they are
|
||||
* unsupported, but we still need to inform BRT about that as we
|
||||
* claimed them during pool import.
|
||||
* This situation can occur when we try to import a pool from a ZFS
|
||||
* version supporting block cloning for ZVOLs into a system that
|
||||
* has this ZFS version, that doesn't support block cloning for ZVOLs.
|
||||
*/
|
||||
static int
|
||||
zvol_replay_clone_range(void *arg1, void *arg2, boolean_t byteswap)
|
||||
{
|
||||
char name[ZFS_MAX_DATASET_NAME_LEN];
|
||||
zvol_state_t *zv = arg1;
|
||||
objset_t *os = zv->zv_objset;
|
||||
lr_clone_range_t *lr = arg2;
|
||||
blkptr_t *bp;
|
||||
dmu_tx_t *tx;
|
||||
spa_t *spa;
|
||||
uint_t ii;
|
||||
int error;
|
||||
|
||||
dmu_objset_name(os, name);
|
||||
cmn_err(CE_WARN, "ZFS dropping block cloning transaction for %s.",
|
||||
name);
|
||||
|
||||
if (byteswap)
|
||||
byteswap_uint64_array(lr, sizeof (*lr));
|
||||
|
||||
tx = dmu_tx_create(os);
|
||||
error = dmu_tx_assign(tx, TXG_WAIT);
|
||||
if (error) {
|
||||
dmu_tx_abort(tx);
|
||||
return (error);
|
||||
}
|
||||
|
||||
spa = os->os_spa;
|
||||
|
||||
for (ii = 0; ii < lr->lr_nbps; ii++) {
|
||||
bp = &lr->lr_bps[ii];
|
||||
|
||||
if (!BP_IS_HOLE(bp)) {
|
||||
zio_free(spa, dmu_tx_get_txg(tx), bp);
|
||||
}
|
||||
}
|
||||
|
||||
(void) zil_replaying(zv->zv_zilog, tx);
|
||||
dmu_tx_commit(tx);
|
||||
|
||||
return (0);
|
||||
}
|
||||
|
||||
static int
|
||||
zvol_replay_err(void *arg1, void *arg2, boolean_t byteswap)
|
||||
{
|
||||
@ -516,6 +570,7 @@ zil_replay_func_t *const zvol_replay_vector[TX_MAX_TYPE] = {
|
||||
zvol_replay_err, /* TX_SETSAXATTR */
|
||||
zvol_replay_err, /* TX_RENAME_EXCHANGE */
|
||||
zvol_replay_err, /* TX_RENAME_WHITEOUT */
|
||||
zvol_replay_clone_range /* TX_CLONE_RANGE */
|
||||
};
|
||||
|
||||
/*
|
||||
|
@ -58,6 +58,9 @@ typeset -a properties=(
|
||||
"multihost"
|
||||
"autotrim"
|
||||
"compatibility"
|
||||
"bcloneused"
|
||||
"bclonesaved"
|
||||
"bcloneratio"
|
||||
"feature@async_destroy"
|
||||
"feature@empty_bpobj"
|
||||
"feature@lz4_compress"
|
||||
@ -100,5 +103,6 @@ if is_linux || is_freebsd; then
|
||||
"feature@zilsaxattr"
|
||||
"feature@head_errlog"
|
||||
"feature@blake3"
|
||||
"feature@block_cloning"
|
||||
)
|
||||
fi
|
||||
|
Loading…
Reference in New Issue
Block a user