2008-11-20 20:01:55 +00:00
|
|
|
/*
|
|
|
|
|
* 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
|
|
|
|
|
*/
|
|
|
|
|
/*
|
2009-07-02 22:44:48 +00:00
|
|
|
* Copyright 2009 Sun Microsystems, Inc. All rights reserved.
|
2012-09-12 09:15:40 +00:00
|
|
|
* Copyright (c) 2012 Cyril Plisko. All rights reserved.
|
2008-11-20 20:01:55 +00:00
|
|
|
* Use is subject to license terms.
|
|
|
|
|
*/
|
|
|
|
|
|
2013-12-09 18:37:51 +00:00
|
|
|
/*
|
2016-12-16 22:11:29 +00:00
|
|
|
* Copyright (c) 2013, 2017 by Delphix. All rights reserved.
|
2013-12-09 18:37:51 +00:00
|
|
|
*/
|
|
|
|
|
|
2008-11-20 20:01:55 +00:00
|
|
|
/*
|
|
|
|
|
* Print intent log header and statistics.
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
#include <stdio.h>
|
|
|
|
|
#include <stdlib.h>
|
|
|
|
|
#include <ctype.h>
|
|
|
|
|
#include <sys/zfs_context.h>
|
|
|
|
|
#include <sys/spa.h>
|
|
|
|
|
#include <sys/dmu.h>
|
|
|
|
|
#include <sys/stat.h>
|
|
|
|
|
#include <sys/resource.h>
|
|
|
|
|
#include <sys/zil.h>
|
|
|
|
|
#include <sys/zil_impl.h>
|
2016-12-16 22:11:29 +00:00
|
|
|
#include <sys/spa_impl.h>
|
2016-07-22 15:52:49 +00:00
|
|
|
#include <sys/abd.h>
|
2008-11-20 20:01:55 +00:00
|
|
|
|
2017-10-27 19:46:35 +00:00
|
|
|
#include "zdb.h"
|
|
|
|
|
|
2008-11-20 20:01:55 +00:00
|
|
|
extern uint8_t dump_opt[256];
|
|
|
|
|
|
2017-10-27 19:46:35 +00:00
|
|
|
static char tab_prefix[4] = "\t\t\t";
|
2010-05-28 20:45:14 +00:00
|
|
|
|
2008-11-20 20:01:55 +00:00
|
|
|
static void
|
|
|
|
|
print_log_bp(const blkptr_t *bp, const char *prefix)
|
|
|
|
|
{
|
|
|
|
|
char blkbuf[BP_SPRINTF_LEN];
|
|
|
|
|
|
2013-12-09 18:37:51 +00:00
|
|
|
snprintf_blkptr(blkbuf, sizeof (blkbuf), bp);
|
2008-11-20 20:01:55 +00:00
|
|
|
(void) printf("%s%s\n", prefix, blkbuf);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static void
|
2020-10-09 16:34:54 +00:00
|
|
|
zil_prt_rec_create(zilog_t *zilog, int txtype, const void *arg)
|
2008-11-20 20:01:55 +00:00
|
|
|
{
|
2021-12-11 00:40:42 +00:00
|
|
|
(void) zilog;
|
2020-10-09 16:34:54 +00:00
|
|
|
const lr_create_t *lr = arg;
|
2008-11-20 20:01:55 +00:00
|
|
|
time_t crtime = lr->lr_crtime[0];
|
2010-05-28 20:45:14 +00:00
|
|
|
char *name, *link;
|
|
|
|
|
lr_attr_t *lrattr;
|
2008-11-20 20:01:55 +00:00
|
|
|
|
2010-05-28 20:45:14 +00:00
|
|
|
name = (char *)(lr + 1);
|
|
|
|
|
|
|
|
|
|
if (lr->lr_common.lrc_txtype == TX_CREATE_ATTR ||
|
|
|
|
|
lr->lr_common.lrc_txtype == TX_MKDIR_ATTR) {
|
|
|
|
|
lrattr = (lr_attr_t *)(lr + 1);
|
|
|
|
|
name += ZIL_XVAT_SIZE(lrattr->lr_attr_masksize);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (txtype == TX_SYMLINK) {
|
|
|
|
|
link = name + strlen(name) + 1;
|
2017-10-27 19:46:35 +00:00
|
|
|
(void) printf("%s%s -> %s\n", tab_prefix, name, link);
|
2010-05-28 20:45:14 +00:00
|
|
|
} else if (txtype != TX_MKXATTR) {
|
2017-10-27 19:46:35 +00:00
|
|
|
(void) printf("%s%s\n", tab_prefix, name);
|
2010-05-28 20:45:14 +00:00
|
|
|
}
|
2008-11-20 20:01:55 +00:00
|
|
|
|
2017-10-27 19:46:35 +00:00
|
|
|
(void) printf("%s%s", tab_prefix, ctime(&crtime));
|
|
|
|
|
(void) printf("%sdoid %llu, foid %llu, slots %llu, mode %llo\n",
|
|
|
|
|
tab_prefix, (u_longlong_t)lr->lr_doid,
|
Implement large_dnode pool feature
Justification
-------------
This feature adds support for variable length dnodes. Our motivation is
to eliminate the overhead associated with using spill blocks. Spill
blocks are used to store system attribute data (i.e. file metadata) that
does not fit in the dnode's bonus buffer. By allowing a larger bonus
buffer area the use of a spill block can be avoided. Spill blocks
potentially incur an additional read I/O for every dnode in a dnode
block. As a worst case example, reading 32 dnodes from a 16k dnode block
and all of the spill blocks could issue 33 separate reads. Now suppose
those dnodes have size 1024 and therefore don't need spill blocks. Then
the worst case number of blocks read is reduced to from 33 to two--one
per dnode block. In practice spill blocks may tend to be co-located on
disk with the dnode blocks so the reduction in I/O would not be this
drastic. In a badly fragmented pool, however, the improvement could be
significant.
ZFS-on-Linux systems that make heavy use of extended attributes would
benefit from this feature. In particular, ZFS-on-Linux supports the
xattr=sa dataset property which allows file extended attribute data
to be stored in the dnode bonus buffer as an alternative to the
traditional directory-based format. Workloads such as SELinux and the
Lustre distributed filesystem often store enough xattr data to force
spill bocks when xattr=sa is in effect. Large dnodes may therefore
provide a performance benefit to such systems.
Other use cases that may benefit from this feature include files with
large ACLs and symbolic links with long target names. Furthermore,
this feature may be desirable on other platforms in case future
applications or features are developed that could make use of a
larger bonus buffer area.
Implementation
--------------
The size of a dnode may be a multiple of 512 bytes up to the size of
a dnode block (currently 16384 bytes). A dn_extra_slots field was
added to the current on-disk dnode_phys_t structure to describe the
size of the physical dnode on disk. The 8 bits for this field were
taken from the zero filled dn_pad2 field. The field represents how
many "extra" dnode_phys_t slots a dnode consumes in its dnode block.
This convention results in a value of 0 for 512 byte dnodes which
preserves on-disk format compatibility with older software.
Similarly, the in-memory dnode_t structure has a new dn_num_slots field
to represent the total number of dnode_phys_t slots consumed on disk.
Thus dn->dn_num_slots is 1 greater than the corresponding
dnp->dn_extra_slots. This difference in convention was adopted
because, unlike on-disk structures, backward compatibility is not a
concern for in-memory objects, so we used a more natural way to
represent size for a dnode_t.
The default size for newly created dnodes is determined by the value of
a new "dnodesize" dataset property. By default the property is set to
"legacy" which is compatible with older software. Setting the property
to "auto" will allow the filesystem to choose the most suitable dnode
size. Currently this just sets the default dnode size to 1k, but future
code improvements could dynamically choose a size based on observed
workload patterns. Dnodes of varying sizes can coexist within the same
dataset and even within the same dnode block. For example, to enable
automatically-sized dnodes, run
# zfs set dnodesize=auto tank/fish
The user can also specify literal values for the dnodesize property.
These are currently limited to powers of two from 1k to 16k. The
power-of-2 limitation is only for simplicity of the user interface.
Internally the implementation can handle any multiple of 512 up to 16k,
and consumers of the DMU API can specify any legal dnode value.
The size of a new dnode is determined at object allocation time and
stored as a new field in the znode in-memory structure. New DMU
interfaces are added to allow the consumer to specify the dnode size
that a newly allocated object should use. Existing interfaces are
unchanged to avoid having to update every call site and to preserve
compatibility with external consumers such as Lustre. The new
interfaces names are given below. The versions of these functions that
don't take a dnodesize parameter now just call the _dnsize() versions
with a dnodesize of 0, which means use the legacy dnode size.
New DMU interfaces:
dmu_object_alloc_dnsize()
dmu_object_claim_dnsize()
dmu_object_reclaim_dnsize()
New ZAP interfaces:
zap_create_dnsize()
zap_create_norm_dnsize()
zap_create_flags_dnsize()
zap_create_claim_norm_dnsize()
zap_create_link_dnsize()
The constant DN_MAX_BONUSLEN is renamed to DN_OLD_MAX_BONUSLEN. The
spa_maxdnodesize() function should be used to determine the maximum
bonus length for a pool.
These are a few noteworthy changes to key functions:
* The prototype for dnode_hold_impl() now takes a "slots" parameter.
When the DNODE_MUST_BE_FREE flag is set, this parameter is used to
ensure the hole at the specified object offset is large enough to
hold the dnode being created. The slots parameter is also used
to ensure a dnode does not span multiple dnode blocks. In both of
these cases, if a failure occurs, ENOSPC is returned. Keep in mind,
these failure cases are only possible when using DNODE_MUST_BE_FREE.
If the DNODE_MUST_BE_ALLOCATED flag is set, "slots" must be 0.
dnode_hold_impl() will check if the requested dnode is already
consumed as an extra dnode slot by an large dnode, in which case
it returns ENOENT.
* The function dmu_object_alloc() advances to the next dnode block
if dnode_hold_impl() returns an error for a requested object.
This is because the beginning of the next dnode block is the only
location it can safely assume to either be a hole or a valid
starting point for a dnode.
* dnode_next_offset_level() and other functions that iterate
through dnode blocks may no longer use a simple array indexing
scheme. These now use the current dnode's dn_num_slots field to
advance to the next dnode in the block. This is to ensure we
properly skip the current dnode's bonus area and don't interpret it
as a valid dnode.
zdb
---
The zdb command was updated to display a dnode's size under the
"dnsize" column when the object is dumped.
For ZIL create log records, zdb will now display the slot count for
the object.
ztest
-----
Ztest chooses a random dnodesize for every newly created object. The
random distribution is more heavily weighted toward small dnodes to
better simulate real-world datasets.
Unused bonus buffer space is filled with non-zero values computed from
the object number, dataset id, offset, and generation number. This
helps ensure that the dnode traversal code properly skips the interior
regions of large dnodes, and that these interior regions are not
overwritten by data belonging to other dnodes. A new test visits each
object in a dataset. It verifies that the actual dnode size matches what
was stored in the ztest block tag when it was created. It also verifies
that the unused bonus buffer space is filled with the expected data
patterns.
ZFS Test Suite
--------------
Added six new large dnode-specific tests, and integrated the dnodesize
property into existing tests for zfs allow and send/recv.
Send/Receive
------------
ZFS send streams for datasets containing large dnodes cannot be received
on pools that don't support the large_dnode feature. A send stream with
large dnodes sets a DMU_BACKUP_FEATURE_LARGE_DNODE flag which will be
unrecognized by an incompatible receiving pool so that the zfs receive
will fail gracefully.
While not implemented here, it may be possible to generate a
backward-compatible send stream from a dataset containing large
dnodes. The implementation may be tricky, however, because the send
object record for a large dnode would need to be resized to a 512
byte dnode, possibly kicking in a spill block in the process. This
means we would need to construct a new SA layout and possibly
register it in the SA layout object. The SA layout is normally just
sent as an ordinary object record. But if we are constructing new
layouts while generating the send stream we'd have to build the SA
layout object dynamically and send it at the end of the stream.
For sending and receiving between pools that do support large dnodes,
the drr_object send record type is extended with a new field to store
the dnode slot count. This field was repurposed from unused padding
in the structure.
ZIL Replay
----------
The dnode slot count is stored in the uppermost 8 bits of the lr_foid
field. The bits were unused as the object id is currently capped at
48 bits.
Resizing Dnodes
---------------
It should be possible to resize a dnode when it is dirtied if the
current dnodesize dataset property differs from the dnode's size, but
this functionality is not currently implemented. Clearly a dnode can
only grow if there are sufficient contiguous unused slots in the
dnode block, but it should always be possible to shrink a dnode.
Growing dnodes may be useful to reduce fragmentation in a pool with
many spill blocks in use. Shrinking dnodes may be useful to allow
sending a dataset to a pool that doesn't support the large_dnode
feature.
Feature Reference Counting
--------------------------
The reference count for the large_dnode pool feature tracks the
number of datasets that have ever contained a dnode of size larger
than 512 bytes. The first time a large dnode is created in a dataset
the dataset is converted to an extensible dataset. This is a one-way
operation and the only way to decrement the feature count is to
destroy the dataset, even if the dataset no longer contains any large
dnodes. The complexity of reference counting on a per-dnode basis was
too high, so we chose to track it on a per-dataset basis similarly to
the large_block feature.
Signed-off-by: Ned Bass <bass6@llnl.gov>
Signed-off-by: Brian Behlendorf <behlendorf1@llnl.gov>
Closes #3542
2016-03-17 01:25:34 +00:00
|
|
|
(u_longlong_t)LR_FOID_GET_OBJ(lr->lr_foid),
|
|
|
|
|
(u_longlong_t)LR_FOID_GET_SLOTS(lr->lr_foid),
|
2008-11-20 20:01:55 +00:00
|
|
|
(longlong_t)lr->lr_mode);
|
2017-10-27 19:46:35 +00:00
|
|
|
(void) printf("%suid %llu, gid %llu, gen %llu, rdev 0x%llx\n",
|
|
|
|
|
tab_prefix,
|
2008-11-20 20:01:55 +00:00
|
|
|
(u_longlong_t)lr->lr_uid, (u_longlong_t)lr->lr_gid,
|
|
|
|
|
(u_longlong_t)lr->lr_gen, (u_longlong_t)lr->lr_rdev);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static void
|
2020-10-09 16:34:54 +00:00
|
|
|
zil_prt_rec_remove(zilog_t *zilog, int txtype, const void *arg)
|
2008-11-20 20:01:55 +00:00
|
|
|
{
|
2021-12-11 00:40:42 +00:00
|
|
|
(void) zilog, (void) txtype;
|
2020-10-09 16:34:54 +00:00
|
|
|
const lr_remove_t *lr = arg;
|
2017-10-27 19:46:35 +00:00
|
|
|
|
|
|
|
|
(void) printf("%sdoid %llu, name %s\n", tab_prefix,
|
2008-11-20 20:01:55 +00:00
|
|
|
(u_longlong_t)lr->lr_doid, (char *)(lr + 1));
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static void
|
2020-10-09 16:34:54 +00:00
|
|
|
zil_prt_rec_link(zilog_t *zilog, int txtype, const void *arg)
|
2008-11-20 20:01:55 +00:00
|
|
|
{
|
2021-12-11 00:40:42 +00:00
|
|
|
(void) zilog, (void) txtype;
|
2020-10-09 16:34:54 +00:00
|
|
|
const lr_link_t *lr = arg;
|
2017-10-27 19:46:35 +00:00
|
|
|
|
|
|
|
|
(void) printf("%sdoid %llu, link_obj %llu, name %s\n", tab_prefix,
|
2008-11-20 20:01:55 +00:00
|
|
|
(u_longlong_t)lr->lr_doid, (u_longlong_t)lr->lr_link_obj,
|
|
|
|
|
(char *)(lr + 1));
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static void
|
2020-10-09 16:34:54 +00:00
|
|
|
zil_prt_rec_rename(zilog_t *zilog, int txtype, const void *arg)
|
2008-11-20 20:01:55 +00:00
|
|
|
{
|
2021-12-11 00:40:42 +00:00
|
|
|
(void) zilog, (void) txtype;
|
2020-10-09 16:34:54 +00:00
|
|
|
const lr_rename_t *lr = arg;
|
2008-11-20 20:01:55 +00:00
|
|
|
char *snm = (char *)(lr + 1);
|
|
|
|
|
char *tnm = snm + strlen(snm) + 1;
|
|
|
|
|
|
2017-10-27 19:46:35 +00:00
|
|
|
(void) printf("%ssdoid %llu, tdoid %llu\n", tab_prefix,
|
2008-11-20 20:01:55 +00:00
|
|
|
(u_longlong_t)lr->lr_sdoid, (u_longlong_t)lr->lr_tdoid);
|
2017-10-27 19:46:35 +00:00
|
|
|
(void) printf("%ssrc %s tgt %s\n", tab_prefix, snm, tnm);
|
2008-11-20 20:01:55 +00:00
|
|
|
}
|
|
|
|
|
|
2016-07-22 15:52:49 +00:00
|
|
|
static int
|
|
|
|
|
zil_prt_rec_write_cb(void *data, size_t len, void *unused)
|
|
|
|
|
{
|
2021-12-11 00:40:42 +00:00
|
|
|
(void) unused;
|
2016-07-22 15:52:49 +00:00
|
|
|
char *cdata = data;
|
|
|
|
|
|
2017-10-27 19:46:35 +00:00
|
|
|
for (size_t i = 0; i < len; i++) {
|
2016-07-22 15:52:49 +00:00
|
|
|
if (isprint(*cdata))
|
|
|
|
|
(void) printf("%c ", *cdata);
|
|
|
|
|
else
|
|
|
|
|
(void) printf("%2X", *cdata);
|
|
|
|
|
cdata++;
|
|
|
|
|
}
|
|
|
|
|
return (0);
|
|
|
|
|
}
|
|
|
|
|
|
2008-11-20 20:01:55 +00:00
|
|
|
static void
|
2020-10-09 16:34:54 +00:00
|
|
|
zil_prt_rec_write(zilog_t *zilog, int txtype, const void *arg)
|
2008-11-20 20:01:55 +00:00
|
|
|
{
|
2020-10-09 16:34:54 +00:00
|
|
|
const lr_write_t *lr = arg;
|
2016-07-22 15:52:49 +00:00
|
|
|
abd_t *data;
|
2020-10-09 16:34:54 +00:00
|
|
|
const blkptr_t *bp = &lr->lr_blkptr;
|
2014-06-25 18:37:59 +00:00
|
|
|
zbookmark_phys_t zb;
|
2008-11-20 20:01:55 +00:00
|
|
|
int verbose = MAX(dump_opt['d'], dump_opt['i']);
|
|
|
|
|
int error;
|
|
|
|
|
|
2017-10-27 19:46:35 +00:00
|
|
|
(void) printf("%sfoid %llu, offset %llx, length %llx\n", tab_prefix,
|
2010-05-28 20:45:14 +00:00
|
|
|
(u_longlong_t)lr->lr_foid, (u_longlong_t)lr->lr_offset,
|
|
|
|
|
(u_longlong_t)lr->lr_length);
|
2008-11-20 20:01:55 +00:00
|
|
|
|
2010-05-28 20:45:14 +00:00
|
|
|
if (txtype == TX_WRITE2 || verbose < 5)
|
2008-11-20 20:01:55 +00:00
|
|
|
return;
|
|
|
|
|
|
|
|
|
|
if (lr->lr_common.lrc_reclen == sizeof (lr_write_t)) {
|
2017-10-27 19:46:35 +00:00
|
|
|
(void) printf("%shas blkptr, %s\n", tab_prefix,
|
2013-12-09 18:37:51 +00:00
|
|
|
!BP_IS_HOLE(bp) &&
|
2016-12-16 22:11:29 +00:00
|
|
|
bp->blk_birth >= spa_min_claim_txg(zilog->zl_spa) ?
|
2008-11-20 20:01:55 +00:00
|
|
|
"will claim" : "won't claim");
|
2017-10-27 19:46:35 +00:00
|
|
|
print_log_bp(bp, tab_prefix);
|
2010-05-28 20:45:14 +00:00
|
|
|
|
|
|
|
|
if (BP_IS_HOLE(bp)) {
|
|
|
|
|
(void) printf("\t\t\tLSIZE 0x%llx\n",
|
|
|
|
|
(u_longlong_t)BP_GET_LSIZE(bp));
|
2017-10-27 19:46:35 +00:00
|
|
|
(void) printf("%s<hole>\n", tab_prefix);
|
2016-07-22 15:52:49 +00:00
|
|
|
return;
|
2008-11-20 20:01:55 +00:00
|
|
|
}
|
2010-05-28 20:45:14 +00:00
|
|
|
if (bp->blk_birth < zilog->zl_header->zh_claim_txg) {
|
2017-10-27 19:46:35 +00:00
|
|
|
(void) printf("%s<block already committed>\n",
|
|
|
|
|
tab_prefix);
|
2016-07-22 15:52:49 +00:00
|
|
|
return;
|
2010-05-28 20:45:14 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
SET_BOOKMARK(&zb, dmu_objset_id(zilog->zl_os),
|
|
|
|
|
lr->lr_foid, ZB_ZIL_LEVEL,
|
|
|
|
|
lr->lr_offset / BP_GET_LSIZE(bp));
|
|
|
|
|
|
2016-07-22 15:52:49 +00:00
|
|
|
data = abd_alloc(BP_GET_LSIZE(bp), B_FALSE);
|
2010-05-28 20:45:14 +00:00
|
|
|
error = zio_wait(zio_read(NULL, zilog->zl_spa,
|
2016-07-22 15:52:49 +00:00
|
|
|
bp, data, BP_GET_LSIZE(bp), NULL, NULL,
|
2010-05-28 20:45:14 +00:00
|
|
|
ZIO_PRIORITY_SYNC_READ, ZIO_FLAG_CANFAIL, &zb));
|
|
|
|
|
if (error)
|
2016-07-22 15:52:49 +00:00
|
|
|
goto out;
|
2008-11-20 20:01:55 +00:00
|
|
|
} else {
|
2016-07-22 15:52:49 +00:00
|
|
|
/* data is stored after the end of the lr_write record */
|
|
|
|
|
data = abd_alloc(lr->lr_length, B_FALSE);
|
|
|
|
|
abd_copy_from_buf(data, lr + 1, lr->lr_length);
|
2008-11-20 20:01:55 +00:00
|
|
|
}
|
|
|
|
|
|
2017-10-27 19:46:35 +00:00
|
|
|
(void) printf("%s", tab_prefix);
|
2016-07-22 15:52:49 +00:00
|
|
|
(void) abd_iterate_func(data,
|
|
|
|
|
0, MIN(lr->lr_length, (verbose < 6 ? 20 : SPA_MAXBLOCKSIZE)),
|
|
|
|
|
zil_prt_rec_write_cb, NULL);
|
2008-11-20 20:01:55 +00:00
|
|
|
(void) printf("\n");
|
2016-07-22 15:52:49 +00:00
|
|
|
|
|
|
|
|
out:
|
|
|
|
|
abd_free(data);
|
2008-11-20 20:01:55 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static void
|
2020-10-09 16:34:54 +00:00
|
|
|
zil_prt_rec_truncate(zilog_t *zilog, int txtype, const void *arg)
|
2008-11-20 20:01:55 +00:00
|
|
|
{
|
2021-12-11 00:40:42 +00:00
|
|
|
(void) zilog, (void) txtype;
|
2020-10-09 16:34:54 +00:00
|
|
|
const lr_truncate_t *lr = arg;
|
2017-10-27 19:46:35 +00:00
|
|
|
|
|
|
|
|
(void) printf("%sfoid %llu, offset 0x%llx, length 0x%llx\n", tab_prefix,
|
2008-11-20 20:01:55 +00:00
|
|
|
(u_longlong_t)lr->lr_foid, (longlong_t)lr->lr_offset,
|
|
|
|
|
(u_longlong_t)lr->lr_length);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static void
|
2020-10-09 16:34:54 +00:00
|
|
|
zil_prt_rec_setattr(zilog_t *zilog, int txtype, const void *arg)
|
2008-11-20 20:01:55 +00:00
|
|
|
{
|
2021-12-11 00:40:42 +00:00
|
|
|
(void) zilog, (void) txtype;
|
2020-10-09 16:34:54 +00:00
|
|
|
const lr_setattr_t *lr = arg;
|
2008-11-20 20:01:55 +00:00
|
|
|
time_t atime = (time_t)lr->lr_atime[0];
|
|
|
|
|
time_t mtime = (time_t)lr->lr_mtime[0];
|
|
|
|
|
|
2017-10-27 19:46:35 +00:00
|
|
|
(void) printf("%sfoid %llu, mask 0x%llx\n", tab_prefix,
|
2008-11-20 20:01:55 +00:00
|
|
|
(u_longlong_t)lr->lr_foid, (u_longlong_t)lr->lr_mask);
|
|
|
|
|
|
|
|
|
|
if (lr->lr_mask & AT_MODE) {
|
2017-10-27 19:46:35 +00:00
|
|
|
(void) printf("%sAT_MODE %llo\n", tab_prefix,
|
2008-11-20 20:01:55 +00:00
|
|
|
(longlong_t)lr->lr_mode);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (lr->lr_mask & AT_UID) {
|
2017-10-27 19:46:35 +00:00
|
|
|
(void) printf("%sAT_UID %llu\n", tab_prefix,
|
2008-11-20 20:01:55 +00:00
|
|
|
(u_longlong_t)lr->lr_uid);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (lr->lr_mask & AT_GID) {
|
2017-10-27 19:46:35 +00:00
|
|
|
(void) printf("%sAT_GID %llu\n", tab_prefix,
|
2008-11-20 20:01:55 +00:00
|
|
|
(u_longlong_t)lr->lr_gid);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (lr->lr_mask & AT_SIZE) {
|
2017-10-27 19:46:35 +00:00
|
|
|
(void) printf("%sAT_SIZE %llu\n", tab_prefix,
|
2008-11-20 20:01:55 +00:00
|
|
|
(u_longlong_t)lr->lr_size);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (lr->lr_mask & AT_ATIME) {
|
2017-10-27 19:46:35 +00:00
|
|
|
(void) printf("%sAT_ATIME %llu.%09llu %s", tab_prefix,
|
2008-11-20 20:01:55 +00:00
|
|
|
(u_longlong_t)lr->lr_atime[0],
|
|
|
|
|
(u_longlong_t)lr->lr_atime[1],
|
|
|
|
|
ctime(&atime));
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (lr->lr_mask & AT_MTIME) {
|
2017-10-27 19:46:35 +00:00
|
|
|
(void) printf("%sAT_MTIME %llu.%09llu %s", tab_prefix,
|
2008-11-20 20:01:55 +00:00
|
|
|
(u_longlong_t)lr->lr_mtime[0],
|
|
|
|
|
(u_longlong_t)lr->lr_mtime[1],
|
|
|
|
|
ctime(&mtime));
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
log xattr=sa create/remove/update to ZIL
As such, there are no specific synchronous semantics defined for
the xattrs. But for xattr=on, it does log to ZIL and zil_commit() is
done, if sync=always is set on dataset. This provides sync semantics
for xattr=on with sync=always set on dataset.
For the xattr=sa implementation, it doesn't log to ZIL, so, even with
sync=always, xattrs are not guaranteed to be synced before xattr call
returns to caller. So, xattr can be lost if system crash happens, before
txg carrying xattr transaction is synced.
This change adds xattr=sa logging to ZIL on xattr create/remove/update
and xattrs are synced to ZIL (zil_commit() done) for sync=always.
This makes xattr=sa behavior similar to xattr=on.
Implementation notes:
The actual logging is fairly straight-forward and does not warrant
additional explanation.
However, it has been 14 years since we last added new TX types
to the ZIL [1], hence this is the first time we do it after the
introduction of zpool features. Therefore, here is an overview of the
feature activation and deactivation workflow:
1. The feature must be enabled. Otherwise, we don't log the new
record type. This ensures compatibility with older software.
2. The feature is activated per-dataset, since the ZIL is per-dataset.
3. If the feature is enabled and dataset is not for zvol, any append to
the ZIL chain will activate the feature for the dataset. Likewise
for starting a new ZIL chain.
4. A dataset that doesn't have a ZIL chain has the feature deactivated.
We ensure (3) by activating on the first zil_commit() after the feature
was enabled. Since activating the features requires waiting for txg
sync, the first zil_commit() after enabling the feature will be slower
than usual. The downside is that this is really a conservative
approximation: even if we never append a 'TX_SETSAXATTR' to the ZIL
chain, we pay the penalty for feature activation. The upside is that the
user is in control of when we pay the penalty, i.e., upon enabling the
feature.
We ensure (4) by hooking into zil_sync(), where ZIL destroy actually
happens.
One more piece on feature activation, since it's spread across
multiple functions:
zil_commit()
zil_process_commit_list()
if lwb == NULL // first zil_commit since zil_open
zil_create()
if no log block pointer in ZIL header:
if feature enabled and not active:
// CASE 1
enable, COALESCE txg wait with dmu_tx that allocated the
log block
else // log block was allocated earlier than this zil_open
if feature enabled and not active:
// CASE 2
enable, EXPLICIT txg wait
else // already have an in-DRAM LWB
if feature enabled and not active:
// this happens when we enable the feature after zil_create
// CASE 3
enable, EXPLICIT txg wait
[1] https://github.com/illumos/illumos-gate/commit/da6c28aaf62fa55f0fdb8004aa40f88f23bf53f0
Reviewed-by: Matthew Ahrens <mahrens@delphix.com>
Reviewed-by: Christian Schwarz <christian.schwarz@nutanix.com>
Reviewed-by: Ahelenia Ziemiańska <nabijaczleweli@nabijaczleweli.xyz>
Reviewed-by: Ryan Moeller <freqlabs@FreeBSD.org>
Reviewed-by: Brian Behlendorf <behlendorf1@llnl.gov>
Signed-off-by: Jitendra Patidar <jitendra.patidar@nutanix.com>
Closes #8768
Closes #9078
2022-02-22 21:06:43 +00:00
|
|
|
static void
|
|
|
|
|
zil_prt_rec_setsaxattr(zilog_t *zilog, int txtype, const void *arg)
|
|
|
|
|
{
|
|
|
|
|
(void) zilog, (void) txtype;
|
|
|
|
|
const lr_setsaxattr_t *lr = arg;
|
|
|
|
|
|
|
|
|
|
char *name = (char *)(lr + 1);
|
|
|
|
|
(void) printf("%sfoid %llu\n", tab_prefix,
|
|
|
|
|
(u_longlong_t)lr->lr_foid);
|
|
|
|
|
|
|
|
|
|
(void) printf("%sXAT_NAME %s\n", tab_prefix, name);
|
|
|
|
|
if (lr->lr_size == 0) {
|
|
|
|
|
(void) printf("%sXAT_VALUE NULL\n", tab_prefix);
|
|
|
|
|
} else {
|
|
|
|
|
(void) printf("%sXAT_VALUE ", tab_prefix);
|
|
|
|
|
char *val = name + (strlen(name) + 1);
|
|
|
|
|
for (int i = 0; i < lr->lr_size; i++) {
|
|
|
|
|
(void) printf("%c", *val);
|
|
|
|
|
val++;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2008-11-20 20:01:55 +00:00
|
|
|
static void
|
2020-10-09 16:34:54 +00:00
|
|
|
zil_prt_rec_acl(zilog_t *zilog, int txtype, const void *arg)
|
2008-11-20 20:01:55 +00:00
|
|
|
{
|
2021-12-11 00:40:42 +00:00
|
|
|
(void) zilog, (void) txtype;
|
2020-10-09 16:34:54 +00:00
|
|
|
const lr_acl_t *lr = arg;
|
2017-10-27 19:46:35 +00:00
|
|
|
|
|
|
|
|
(void) printf("%sfoid %llu, aclcnt %llu\n", tab_prefix,
|
2008-11-20 20:01:55 +00:00
|
|
|
(u_longlong_t)lr->lr_foid, (u_longlong_t)lr->lr_aclcnt);
|
|
|
|
|
}
|
|
|
|
|
|
2020-10-09 16:34:54 +00:00
|
|
|
typedef void (*zil_prt_rec_func_t)(zilog_t *, int, const void *);
|
2008-11-20 20:01:55 +00:00
|
|
|
typedef struct zil_rec_info {
|
|
|
|
|
zil_prt_rec_func_t zri_print;
|
2017-10-27 19:46:35 +00:00
|
|
|
const char *zri_name;
|
2008-11-20 20:01:55 +00:00
|
|
|
uint64_t zri_count;
|
|
|
|
|
} zil_rec_info_t;
|
|
|
|
|
|
|
|
|
|
static zil_rec_info_t zil_rec_info[TX_MAX_TYPE] = {
|
2017-10-27 19:46:35 +00:00
|
|
|
{.zri_print = NULL, .zri_name = "Total "},
|
|
|
|
|
{.zri_print = zil_prt_rec_create, .zri_name = "TX_CREATE "},
|
|
|
|
|
{.zri_print = zil_prt_rec_create, .zri_name = "TX_MKDIR "},
|
|
|
|
|
{.zri_print = zil_prt_rec_create, .zri_name = "TX_MKXATTR "},
|
|
|
|
|
{.zri_print = zil_prt_rec_create, .zri_name = "TX_SYMLINK "},
|
|
|
|
|
{.zri_print = zil_prt_rec_remove, .zri_name = "TX_REMOVE "},
|
|
|
|
|
{.zri_print = zil_prt_rec_remove, .zri_name = "TX_RMDIR "},
|
|
|
|
|
{.zri_print = zil_prt_rec_link, .zri_name = "TX_LINK "},
|
|
|
|
|
{.zri_print = zil_prt_rec_rename, .zri_name = "TX_RENAME "},
|
|
|
|
|
{.zri_print = zil_prt_rec_write, .zri_name = "TX_WRITE "},
|
|
|
|
|
{.zri_print = zil_prt_rec_truncate, .zri_name = "TX_TRUNCATE "},
|
|
|
|
|
{.zri_print = zil_prt_rec_setattr, .zri_name = "TX_SETATTR "},
|
|
|
|
|
{.zri_print = zil_prt_rec_acl, .zri_name = "TX_ACL_V0 "},
|
|
|
|
|
{.zri_print = zil_prt_rec_acl, .zri_name = "TX_ACL_ACL "},
|
|
|
|
|
{.zri_print = zil_prt_rec_create, .zri_name = "TX_CREATE_ACL "},
|
|
|
|
|
{.zri_print = zil_prt_rec_create, .zri_name = "TX_CREATE_ATTR "},
|
|
|
|
|
{.zri_print = zil_prt_rec_create, .zri_name = "TX_CREATE_ACL_ATTR "},
|
|
|
|
|
{.zri_print = zil_prt_rec_create, .zri_name = "TX_MKDIR_ACL "},
|
|
|
|
|
{.zri_print = zil_prt_rec_create, .zri_name = "TX_MKDIR_ATTR "},
|
|
|
|
|
{.zri_print = zil_prt_rec_create, .zri_name = "TX_MKDIR_ACL_ATTR "},
|
|
|
|
|
{.zri_print = zil_prt_rec_write, .zri_name = "TX_WRITE2 "},
|
log xattr=sa create/remove/update to ZIL
As such, there are no specific synchronous semantics defined for
the xattrs. But for xattr=on, it does log to ZIL and zil_commit() is
done, if sync=always is set on dataset. This provides sync semantics
for xattr=on with sync=always set on dataset.
For the xattr=sa implementation, it doesn't log to ZIL, so, even with
sync=always, xattrs are not guaranteed to be synced before xattr call
returns to caller. So, xattr can be lost if system crash happens, before
txg carrying xattr transaction is synced.
This change adds xattr=sa logging to ZIL on xattr create/remove/update
and xattrs are synced to ZIL (zil_commit() done) for sync=always.
This makes xattr=sa behavior similar to xattr=on.
Implementation notes:
The actual logging is fairly straight-forward and does not warrant
additional explanation.
However, it has been 14 years since we last added new TX types
to the ZIL [1], hence this is the first time we do it after the
introduction of zpool features. Therefore, here is an overview of the
feature activation and deactivation workflow:
1. The feature must be enabled. Otherwise, we don't log the new
record type. This ensures compatibility with older software.
2. The feature is activated per-dataset, since the ZIL is per-dataset.
3. If the feature is enabled and dataset is not for zvol, any append to
the ZIL chain will activate the feature for the dataset. Likewise
for starting a new ZIL chain.
4. A dataset that doesn't have a ZIL chain has the feature deactivated.
We ensure (3) by activating on the first zil_commit() after the feature
was enabled. Since activating the features requires waiting for txg
sync, the first zil_commit() after enabling the feature will be slower
than usual. The downside is that this is really a conservative
approximation: even if we never append a 'TX_SETSAXATTR' to the ZIL
chain, we pay the penalty for feature activation. The upside is that the
user is in control of when we pay the penalty, i.e., upon enabling the
feature.
We ensure (4) by hooking into zil_sync(), where ZIL destroy actually
happens.
One more piece on feature activation, since it's spread across
multiple functions:
zil_commit()
zil_process_commit_list()
if lwb == NULL // first zil_commit since zil_open
zil_create()
if no log block pointer in ZIL header:
if feature enabled and not active:
// CASE 1
enable, COALESCE txg wait with dmu_tx that allocated the
log block
else // log block was allocated earlier than this zil_open
if feature enabled and not active:
// CASE 2
enable, EXPLICIT txg wait
else // already have an in-DRAM LWB
if feature enabled and not active:
// this happens when we enable the feature after zil_create
// CASE 3
enable, EXPLICIT txg wait
[1] https://github.com/illumos/illumos-gate/commit/da6c28aaf62fa55f0fdb8004aa40f88f23bf53f0
Reviewed-by: Matthew Ahrens <mahrens@delphix.com>
Reviewed-by: Christian Schwarz <christian.schwarz@nutanix.com>
Reviewed-by: Ahelenia Ziemiańska <nabijaczleweli@nabijaczleweli.xyz>
Reviewed-by: Ryan Moeller <freqlabs@FreeBSD.org>
Reviewed-by: Brian Behlendorf <behlendorf1@llnl.gov>
Signed-off-by: Jitendra Patidar <jitendra.patidar@nutanix.com>
Closes #8768
Closes #9078
2022-02-22 21:06:43 +00:00
|
|
|
{.zri_print = zil_prt_rec_setsaxattr,
|
|
|
|
|
.zri_name = "TX_SETSAXATTR "},
|
2008-11-20 20:01:55 +00:00
|
|
|
};
|
|
|
|
|
|
2010-05-28 20:45:14 +00:00
|
|
|
static int
|
2020-10-09 16:34:54 +00:00
|
|
|
print_log_record(zilog_t *zilog, const lr_t *lr, void *arg, uint64_t claim_txg)
|
2008-11-20 20:01:55 +00:00
|
|
|
{
|
2021-12-11 00:40:42 +00:00
|
|
|
(void) arg, (void) claim_txg;
|
2008-11-20 20:01:55 +00:00
|
|
|
int txtype;
|
|
|
|
|
int verbose = MAX(dump_opt['d'], dump_opt['i']);
|
|
|
|
|
|
|
|
|
|
/* reduce size of txtype to strip off TX_CI bit */
|
|
|
|
|
txtype = lr->lrc_txtype;
|
|
|
|
|
|
|
|
|
|
ASSERT(txtype != 0 && (uint_t)txtype < TX_MAX_TYPE);
|
|
|
|
|
ASSERT(lr->lrc_txg);
|
|
|
|
|
|
|
|
|
|
(void) printf("\t\t%s%s len %6llu, txg %llu, seq %llu\n",
|
|
|
|
|
(lr->lrc_txtype & TX_CI) ? "CI-" : "",
|
|
|
|
|
zil_rec_info[txtype].zri_name,
|
|
|
|
|
(u_longlong_t)lr->lrc_reclen,
|
|
|
|
|
(u_longlong_t)lr->lrc_txg,
|
|
|
|
|
(u_longlong_t)lr->lrc_seq);
|
|
|
|
|
|
Native Encryption for ZFS on Linux
This change incorporates three major pieces:
The first change is a keystore that manages wrapping
and encryption keys for encrypted datasets. These
commands mostly involve manipulating the new
DSL Crypto Key ZAP Objects that live in the MOS. Each
encrypted dataset has its own DSL Crypto Key that is
protected with a user's key. This level of indirection
allows users to change their keys without re-encrypting
their entire datasets. The change implements the new
subcommands "zfs load-key", "zfs unload-key" and
"zfs change-key" which allow the user to manage their
encryption keys and settings. In addition, several new
flags and properties have been added to allow dataset
creation and to make mounting and unmounting more
convenient.
The second piece of this patch provides the ability to
encrypt, decyrpt, and authenticate protected datasets.
Each object set maintains a Merkel tree of Message
Authentication Codes that protect the lower layers,
similarly to how checksums are maintained. This part
impacts the zio layer, which handles the actual
encryption and generation of MACs, as well as the ARC
and DMU, which need to be able to handle encrypted
buffers and protected data.
The last addition is the ability to do raw, encrypted
sends and receives. The idea here is to send raw
encrypted and compressed data and receive it exactly
as is on a backup system. This means that the dataset
on the receiving system is protected using the same
user key that is in use on the sending side. By doing
so, datasets can be efficiently backed up to an
untrusted system without fear of data being
compromised.
Reviewed by: Matthew Ahrens <mahrens@delphix.com>
Reviewed-by: Brian Behlendorf <behlendorf1@llnl.gov>
Reviewed-by: Jorgen Lundman <lundman@lundman.net>
Signed-off-by: Tom Caputi <tcaputi@datto.com>
Closes #494
Closes #5769
2017-08-14 17:36:48 +00:00
|
|
|
if (txtype && verbose >= 3) {
|
|
|
|
|
if (!zilog->zl_os->os_encrypted) {
|
|
|
|
|
zil_rec_info[txtype].zri_print(zilog, txtype, lr);
|
|
|
|
|
} else {
|
2017-10-27 19:46:35 +00:00
|
|
|
(void) printf("%s(encrypted)\n", tab_prefix);
|
Native Encryption for ZFS on Linux
This change incorporates three major pieces:
The first change is a keystore that manages wrapping
and encryption keys for encrypted datasets. These
commands mostly involve manipulating the new
DSL Crypto Key ZAP Objects that live in the MOS. Each
encrypted dataset has its own DSL Crypto Key that is
protected with a user's key. This level of indirection
allows users to change their keys without re-encrypting
their entire datasets. The change implements the new
subcommands "zfs load-key", "zfs unload-key" and
"zfs change-key" which allow the user to manage their
encryption keys and settings. In addition, several new
flags and properties have been added to allow dataset
creation and to make mounting and unmounting more
convenient.
The second piece of this patch provides the ability to
encrypt, decyrpt, and authenticate protected datasets.
Each object set maintains a Merkel tree of Message
Authentication Codes that protect the lower layers,
similarly to how checksums are maintained. This part
impacts the zio layer, which handles the actual
encryption and generation of MACs, as well as the ARC
and DMU, which need to be able to handle encrypted
buffers and protected data.
The last addition is the ability to do raw, encrypted
sends and receives. The idea here is to send raw
encrypted and compressed data and receive it exactly
as is on a backup system. This means that the dataset
on the receiving system is protected using the same
user key that is in use on the sending side. By doing
so, datasets can be efficiently backed up to an
untrusted system without fear of data being
compromised.
Reviewed by: Matthew Ahrens <mahrens@delphix.com>
Reviewed-by: Brian Behlendorf <behlendorf1@llnl.gov>
Reviewed-by: Jorgen Lundman <lundman@lundman.net>
Signed-off-by: Tom Caputi <tcaputi@datto.com>
Closes #494
Closes #5769
2017-08-14 17:36:48 +00:00
|
|
|
}
|
|
|
|
|
}
|
2008-11-20 20:01:55 +00:00
|
|
|
|
|
|
|
|
zil_rec_info[txtype].zri_count++;
|
|
|
|
|
zil_rec_info[0].zri_count++;
|
2010-05-28 20:45:14 +00:00
|
|
|
|
|
|
|
|
return (0);
|
2008-11-20 20:01:55 +00:00
|
|
|
}
|
|
|
|
|
|
2010-05-28 20:45:14 +00:00
|
|
|
static int
|
2020-10-09 16:34:54 +00:00
|
|
|
print_log_block(zilog_t *zilog, const blkptr_t *bp, void *arg,
|
|
|
|
|
uint64_t claim_txg)
|
2008-11-20 20:01:55 +00:00
|
|
|
{
|
2021-12-11 00:40:42 +00:00
|
|
|
(void) arg;
|
2010-05-28 20:45:14 +00:00
|
|
|
char blkbuf[BP_SPRINTF_LEN + 10];
|
2008-11-20 20:01:55 +00:00
|
|
|
int verbose = MAX(dump_opt['d'], dump_opt['i']);
|
2017-10-27 19:46:35 +00:00
|
|
|
const char *claim;
|
2008-11-20 20:01:55 +00:00
|
|
|
|
|
|
|
|
if (verbose <= 3)
|
2010-05-28 20:45:14 +00:00
|
|
|
return (0);
|
2008-11-20 20:01:55 +00:00
|
|
|
|
|
|
|
|
if (verbose >= 5) {
|
|
|
|
|
(void) strcpy(blkbuf, ", ");
|
2013-12-09 18:37:51 +00:00
|
|
|
snprintf_blkptr(blkbuf + strlen(blkbuf),
|
|
|
|
|
sizeof (blkbuf) - strlen(blkbuf), bp);
|
2008-11-20 20:01:55 +00:00
|
|
|
} else {
|
|
|
|
|
blkbuf[0] = '\0';
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (claim_txg != 0)
|
|
|
|
|
claim = "already claimed";
|
2016-12-16 22:11:29 +00:00
|
|
|
else if (bp->blk_birth >= spa_min_claim_txg(zilog->zl_spa))
|
2008-11-20 20:01:55 +00:00
|
|
|
claim = "will claim";
|
|
|
|
|
else
|
|
|
|
|
claim = "won't claim";
|
|
|
|
|
|
|
|
|
|
(void) printf("\tBlock seqno %llu, %s%s\n",
|
|
|
|
|
(u_longlong_t)bp->blk_cksum.zc_word[ZIL_ZC_SEQ], claim, blkbuf);
|
2010-05-28 20:45:14 +00:00
|
|
|
|
|
|
|
|
return (0);
|
2008-11-20 20:01:55 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
print_log_stats(int verbose)
|
|
|
|
|
{
|
2017-10-27 19:46:35 +00:00
|
|
|
unsigned i, w, p10;
|
2008-11-20 20:01:55 +00:00
|
|
|
|
|
|
|
|
if (verbose > 3)
|
|
|
|
|
(void) printf("\n");
|
|
|
|
|
|
|
|
|
|
if (zil_rec_info[0].zri_count == 0)
|
|
|
|
|
return;
|
|
|
|
|
|
|
|
|
|
for (w = 1, p10 = 10; zil_rec_info[0].zri_count >= p10; p10 *= 10)
|
|
|
|
|
w++;
|
|
|
|
|
|
|
|
|
|
for (i = 0; i < TX_MAX_TYPE; i++)
|
|
|
|
|
if (zil_rec_info[i].zri_count || verbose >= 3)
|
|
|
|
|
(void) printf("\t\t%s %*llu\n",
|
|
|
|
|
zil_rec_info[i].zri_name, w,
|
|
|
|
|
(u_longlong_t)zil_rec_info[i].zri_count);
|
|
|
|
|
(void) printf("\n");
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void
|
|
|
|
|
dump_intent_log(zilog_t *zilog)
|
|
|
|
|
{
|
|
|
|
|
const zil_header_t *zh = zilog->zl_header;
|
|
|
|
|
int verbose = MAX(dump_opt['d'], dump_opt['i']);
|
|
|
|
|
int i;
|
|
|
|
|
|
2013-12-09 18:37:51 +00:00
|
|
|
if (BP_IS_HOLE(&zh->zh_log) || verbose < 1)
|
2008-11-20 20:01:55 +00:00
|
|
|
return;
|
|
|
|
|
|
2010-05-28 20:45:14 +00:00
|
|
|
(void) printf("\n ZIL header: claim_txg %llu, "
|
|
|
|
|
"claim_blk_seq %llu, claim_lr_seq %llu",
|
|
|
|
|
(u_longlong_t)zh->zh_claim_txg,
|
|
|
|
|
(u_longlong_t)zh->zh_claim_blk_seq,
|
|
|
|
|
(u_longlong_t)zh->zh_claim_lr_seq);
|
2009-07-02 22:44:48 +00:00
|
|
|
(void) printf(" replay_seq %llu, flags 0x%llx\n",
|
|
|
|
|
(u_longlong_t)zh->zh_replay_seq, (u_longlong_t)zh->zh_flags);
|
2008-11-20 20:01:55 +00:00
|
|
|
|
|
|
|
|
for (i = 0; i < TX_MAX_TYPE; i++)
|
|
|
|
|
zil_rec_info[i].zri_count = 0;
|
|
|
|
|
|
2016-12-16 22:11:29 +00:00
|
|
|
/* see comment in zil_claim() or zil_check_log_chain() */
|
|
|
|
|
if (zilog->zl_spa->spa_uberblock.ub_checkpoint_txg != 0 &&
|
|
|
|
|
zh->zh_claim_txg == 0)
|
|
|
|
|
return;
|
|
|
|
|
|
2008-11-20 20:01:55 +00:00
|
|
|
if (verbose >= 2) {
|
|
|
|
|
(void) printf("\n");
|
|
|
|
|
(void) zil_parse(zilog, print_log_block, print_log_record, NULL,
|
Native Encryption for ZFS on Linux
This change incorporates three major pieces:
The first change is a keystore that manages wrapping
and encryption keys for encrypted datasets. These
commands mostly involve manipulating the new
DSL Crypto Key ZAP Objects that live in the MOS. Each
encrypted dataset has its own DSL Crypto Key that is
protected with a user's key. This level of indirection
allows users to change their keys without re-encrypting
their entire datasets. The change implements the new
subcommands "zfs load-key", "zfs unload-key" and
"zfs change-key" which allow the user to manage their
encryption keys and settings. In addition, several new
flags and properties have been added to allow dataset
creation and to make mounting and unmounting more
convenient.
The second piece of this patch provides the ability to
encrypt, decyrpt, and authenticate protected datasets.
Each object set maintains a Merkel tree of Message
Authentication Codes that protect the lower layers,
similarly to how checksums are maintained. This part
impacts the zio layer, which handles the actual
encryption and generation of MACs, as well as the ARC
and DMU, which need to be able to handle encrypted
buffers and protected data.
The last addition is the ability to do raw, encrypted
sends and receives. The idea here is to send raw
encrypted and compressed data and receive it exactly
as is on a backup system. This means that the dataset
on the receiving system is protected using the same
user key that is in use on the sending side. By doing
so, datasets can be efficiently backed up to an
untrusted system without fear of data being
compromised.
Reviewed by: Matthew Ahrens <mahrens@delphix.com>
Reviewed-by: Brian Behlendorf <behlendorf1@llnl.gov>
Reviewed-by: Jorgen Lundman <lundman@lundman.net>
Signed-off-by: Tom Caputi <tcaputi@datto.com>
Closes #494
Closes #5769
2017-08-14 17:36:48 +00:00
|
|
|
zh->zh_claim_txg, B_FALSE);
|
2008-11-20 20:01:55 +00:00
|
|
|
print_log_stats(verbose);
|
|
|
|
|
}
|
|
|
|
|
}
|
