2010-05-29 00:45:14 +04: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
|
|
|
|
*/
|
|
|
|
/*
|
2010-08-27 01:24:34 +04:00
|
|
|
* Copyright (c) 2010, Oracle and/or its affiliates. All rights reserved.
|
Illumos #4045 write throttle & i/o scheduler performance work
4045 zfs write throttle & i/o scheduler performance work
1. The ZFS i/o scheduler (vdev_queue.c) now divides i/os into 5 classes: sync
read, sync write, async read, async write, and scrub/resilver. The scheduler
issues a number of concurrent i/os from each class to the device. Once a class
has been selected, an i/o is selected from this class using either an elevator
algorithem (async, scrub classes) or FIFO (sync classes). The number of
concurrent async write i/os is tuned dynamically based on i/o load, to achieve
good sync i/o latency when there is not a high load of writes, and good write
throughput when there is. See the block comment in vdev_queue.c (reproduced
below) for more details.
2. The write throttle (dsl_pool_tempreserve_space() and
txg_constrain_throughput()) is rewritten to produce much more consistent delays
when under constant load. The new write throttle is based on the amount of
dirty data, rather than guesses about future performance of the system. When
there is a lot of dirty data, each transaction (e.g. write() syscall) will be
delayed by the same small amount. This eliminates the "brick wall of wait"
that the old write throttle could hit, causing all transactions to wait several
seconds until the next txg opens. One of the keys to the new write throttle is
decrementing the amount of dirty data as i/o completes, rather than at the end
of spa_sync(). Note that the write throttle is only applied once the i/o
scheduler is issuing the maximum number of outstanding async writes. See the
block comments in dsl_pool.c and above dmu_tx_delay() (reproduced below) for
more details.
This diff has several other effects, including:
* the commonly-tuned global variable zfs_vdev_max_pending has been removed;
use per-class zfs_vdev_*_max_active values or zfs_vdev_max_active instead.
* the size of each txg (meaning the amount of dirty data written, and thus the
time it takes to write out) is now controlled differently. There is no longer
an explicit time goal; the primary determinant is amount of dirty data.
Systems that are under light or medium load will now often see that a txg is
always syncing, but the impact to performance (e.g. read latency) is minimal.
Tune zfs_dirty_data_max and zfs_dirty_data_sync to control this.
* zio_taskq_batch_pct = 75 -- Only use 75% of all CPUs for compression,
checksum, etc. This improves latency by not allowing these CPU-intensive tasks
to consume all CPU (on machines with at least 4 CPU's; the percentage is
rounded up).
--matt
APPENDIX: problems with the current i/o scheduler
The current ZFS i/o scheduler (vdev_queue.c) is deadline based. The problem
with this is that if there are always i/os pending, then certain classes of
i/os can see very long delays.
For example, if there are always synchronous reads outstanding, then no async
writes will be serviced until they become "past due". One symptom of this
situation is that each pass of the txg sync takes at least several seconds
(typically 3 seconds).
If many i/os become "past due" (their deadline is in the past), then we must
service all of these overdue i/os before any new i/os. This happens when we
enqueue a batch of async writes for the txg sync, with deadlines 2.5 seconds in
the future. If we can't complete all the i/os in 2.5 seconds (e.g. because
there were always reads pending), then these i/os will become past due. Now we
must service all the "async" writes (which could be hundreds of megabytes)
before we service any reads, introducing considerable latency to synchronous
i/os (reads or ZIL writes).
Notes on porting to ZFS on Linux:
- zio_t gained new members io_physdone and io_phys_children. Because
object caches in the Linux port call the constructor only once at
allocation time, objects may contain residual data when retrieved
from the cache. Therefore zio_create() was updated to zero out the two
new fields.
- vdev_mirror_pending() relied on the depth of the per-vdev pending queue
(vq->vq_pending_tree) to select the least-busy leaf vdev to read from.
This tree has been replaced by vq->vq_active_tree which is now used
for the same purpose.
- vdev_queue_init() used the value of zfs_vdev_max_pending to determine
the number of vdev I/O buffers to pre-allocate. That global no longer
exists, so we instead use the sum of the *_max_active values for each of
the five I/O classes described above.
- The Illumos implementation of dmu_tx_delay() delays a transaction by
sleeping in condition variable embedded in the thread
(curthread->t_delay_cv). We do not have an equivalent CV to use in
Linux, so this change replaced the delay logic with a wrapper called
zfs_sleep_until(). This wrapper could be adopted upstream and in other
downstream ports to abstract away operating system-specific delay logic.
- These tunables are added as module parameters, and descriptions added
to the zfs-module-parameters.5 man page.
spa_asize_inflation
zfs_deadman_synctime_ms
zfs_vdev_max_active
zfs_vdev_async_write_active_min_dirty_percent
zfs_vdev_async_write_active_max_dirty_percent
zfs_vdev_async_read_max_active
zfs_vdev_async_read_min_active
zfs_vdev_async_write_max_active
zfs_vdev_async_write_min_active
zfs_vdev_scrub_max_active
zfs_vdev_scrub_min_active
zfs_vdev_sync_read_max_active
zfs_vdev_sync_read_min_active
zfs_vdev_sync_write_max_active
zfs_vdev_sync_write_min_active
zfs_dirty_data_max_percent
zfs_delay_min_dirty_percent
zfs_dirty_data_max_max_percent
zfs_dirty_data_max
zfs_dirty_data_max_max
zfs_dirty_data_sync
zfs_delay_scale
The latter four have type unsigned long, whereas they are uint64_t in
Illumos. This accommodates Linux's module_param() supported types, but
means they may overflow on 32-bit architectures.
The values zfs_dirty_data_max and zfs_dirty_data_max_max are the most
likely to overflow on 32-bit systems, since they express physical RAM
sizes in bytes. In fact, Illumos initializes zfs_dirty_data_max_max to
2^32 which does overflow. To resolve that, this port instead initializes
it in arc_init() to 25% of physical RAM, and adds the tunable
zfs_dirty_data_max_max_percent to override that percentage. While this
solution doesn't completely avoid the overflow issue, it should be a
reasonable default for most systems, and the minority of affected
systems can work around the issue by overriding the defaults.
- Fixed reversed logic in comment above zfs_delay_scale declaration.
- Clarified comments in vdev_queue.c regarding when per-queue minimums take
effect.
- Replaced dmu_tx_write_limit in the dmu_tx kstat file
with dmu_tx_dirty_delay and dmu_tx_dirty_over_max. The first counts
how many times a transaction has been delayed because the pool dirty
data has exceeded zfs_delay_min_dirty_percent. The latter counts how
many times the pool dirty data has exceeded zfs_dirty_data_max (which
we expect to never happen).
- The original patch would have regressed the bug fixed in
zfsonlinux/zfs@c418410, which prevented users from setting the
zfs_vdev_aggregation_limit tuning larger than SPA_MAXBLOCKSIZE.
A similar fix is added to vdev_queue_aggregate().
- In vdev_queue_io_to_issue(), dynamically allocate 'zio_t search' on the
heap instead of the stack. In Linux we can't afford such large
structures on the stack.
Reviewed by: George Wilson <george.wilson@delphix.com>
Reviewed by: Adam Leventhal <ahl@delphix.com>
Reviewed by: Christopher Siden <christopher.siden@delphix.com>
Reviewed by: Ned Bass <bass6@llnl.gov>
Reviewed by: Brendan Gregg <brendan.gregg@joyent.com>
Approved by: Robert Mustacchi <rm@joyent.com>
References:
http://www.illumos.org/issues/4045
illumos/illumos-gate@69962b5647e4a8b9b14998733b765925381b727e
Ported-by: Ned Bass <bass6@llnl.gov>
Signed-off-by: Brian Behlendorf <behlendorf1@llnl.gov>
Closes #1913
2013-08-29 07:01:20 +04:00
|
|
|
* Copyright (c) 2013 by Delphix. All rights reserved.
|
2015-04-02 06:44:32 +03:00
|
|
|
* Copyright (c) 2014 Spectra Logic Corporation, All rights reserved.
|
2010-05-29 00:45:14 +04:00
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef _SYS_SA_IMPL_H
|
|
|
|
#define _SYS_SA_IMPL_H
|
|
|
|
|
|
|
|
#include <sys/dmu.h>
|
2020-07-30 02:35:33 +03:00
|
|
|
#include <sys/zfs_refcount.h>
|
2010-05-29 00:45:14 +04:00
|
|
|
#include <sys/list.h>
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Array of known attributes and their
|
|
|
|
* various characteristics.
|
|
|
|
*/
|
|
|
|
typedef struct sa_attr_table {
|
|
|
|
sa_attr_type_t sa_attr;
|
|
|
|
uint8_t sa_registered;
|
|
|
|
uint16_t sa_length;
|
|
|
|
sa_bswap_type_t sa_byteswap;
|
|
|
|
char *sa_name;
|
|
|
|
} sa_attr_table_t;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Zap attribute format for attribute registration
|
|
|
|
*
|
|
|
|
* 64 56 48 40 32 24 16 8 0
|
|
|
|
* +-------+-------+-------+-------+-------+-------+-------+-------+
|
|
|
|
* | unused | len | bswap | attr num |
|
|
|
|
* +-------+-------+-------+-------+-------+-------+-------+-------+
|
|
|
|
*
|
|
|
|
* Zap attribute format for layout information.
|
|
|
|
*
|
|
|
|
* layout information is stored as an array of attribute numbers
|
|
|
|
* The name of the attribute is the layout number (0, 1, 2, ...)
|
|
|
|
*
|
|
|
|
* 16 0
|
|
|
|
* +---- ---+
|
|
|
|
* | attr # |
|
|
|
|
* +--------+
|
|
|
|
* | attr # |
|
|
|
|
* +--- ----+
|
|
|
|
* ......
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
|
|
|
#define ATTR_BSWAP(x) BF32_GET(x, 16, 8)
|
|
|
|
#define ATTR_LENGTH(x) BF32_GET(x, 24, 16)
|
|
|
|
#define ATTR_NUM(x) BF32_GET(x, 0, 16)
|
|
|
|
#define ATTR_ENCODE(x, attr, length, bswap) \
|
|
|
|
{ \
|
|
|
|
BF64_SET(x, 24, 16, length); \
|
|
|
|
BF64_SET(x, 16, 8, bswap); \
|
|
|
|
BF64_SET(x, 0, 16, attr); \
|
|
|
|
}
|
|
|
|
|
|
|
|
#define TOC_OFF(x) BF32_GET(x, 0, 23)
|
|
|
|
#define TOC_ATTR_PRESENT(x) BF32_GET(x, 31, 1)
|
|
|
|
#define TOC_LEN_IDX(x) BF32_GET(x, 24, 4)
|
|
|
|
#define TOC_ATTR_ENCODE(x, len_idx, offset) \
|
|
|
|
{ \
|
|
|
|
BF32_SET(x, 31, 1, 1); \
|
|
|
|
BF32_SET(x, 24, 7, len_idx); \
|
|
|
|
BF32_SET(x, 0, 24, offset); \
|
|
|
|
}
|
|
|
|
|
|
|
|
#define SA_LAYOUTS "LAYOUTS"
|
|
|
|
#define SA_REGISTRY "REGISTRY"
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Each unique layout will have their own table
|
|
|
|
* sa_lot (layout_table)
|
|
|
|
*/
|
|
|
|
typedef struct sa_lot {
|
|
|
|
avl_node_t lot_num_node;
|
|
|
|
avl_node_t lot_hash_node;
|
|
|
|
uint64_t lot_num;
|
|
|
|
uint64_t lot_hash;
|
|
|
|
sa_attr_type_t *lot_attrs; /* array of attr #'s */
|
|
|
|
uint32_t lot_var_sizes; /* how many aren't fixed size */
|
|
|
|
uint32_t lot_attr_count; /* total attr count */
|
|
|
|
list_t lot_idx_tab; /* should be only a couple of entries */
|
|
|
|
int lot_instance; /* used with lot_hash to identify entry */
|
|
|
|
} sa_lot_t;
|
|
|
|
|
|
|
|
/* index table of offsets */
|
|
|
|
typedef struct sa_idx_tab {
|
|
|
|
list_node_t sa_next;
|
|
|
|
sa_lot_t *sa_layout;
|
|
|
|
uint16_t *sa_variable_lengths;
|
2018-09-26 20:29:26 +03:00
|
|
|
zfs_refcount_t sa_refcount;
|
2010-05-29 00:45:14 +04:00
|
|
|
uint32_t *sa_idx_tab; /* array of offsets */
|
|
|
|
} sa_idx_tab_t;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Since the offset/index information into the actual data
|
|
|
|
* will usually be identical we can share that information with
|
|
|
|
* all handles that have the exact same offsets.
|
|
|
|
*
|
|
|
|
* You would typically only have a large number of different table of
|
|
|
|
* contents if you had a several variable sized attributes.
|
|
|
|
*
|
|
|
|
* Two AVL trees are used to track the attribute layout numbers.
|
|
|
|
* one is keyed by number and will be consulted when a DMU_OT_SA
|
|
|
|
* object is first read. The second tree is keyed by the hash signature
|
|
|
|
* of the attributes and will be consulted when an attribute is added
|
|
|
|
* to determine if we already have an instance of that layout. Both
|
|
|
|
* of these tree's are interconnected. The only difference is that
|
|
|
|
* when an entry is found in the "hash" tree the list of attributes will
|
|
|
|
* need to be compared against the list of attributes you have in hand.
|
|
|
|
* The assumption is that typically attributes will just be updated and
|
|
|
|
* adding a completely new attribute is a very rare operation.
|
|
|
|
*/
|
|
|
|
struct sa_os {
|
|
|
|
kmutex_t sa_lock;
|
|
|
|
boolean_t sa_need_attr_registration;
|
|
|
|
boolean_t sa_force_spill;
|
|
|
|
uint64_t sa_master_obj;
|
|
|
|
uint64_t sa_reg_attr_obj;
|
|
|
|
uint64_t sa_layout_attr_obj;
|
|
|
|
int sa_num_attrs;
|
|
|
|
sa_attr_table_t *sa_attr_table; /* private attr table */
|
|
|
|
sa_update_cb_t *sa_update_cb;
|
|
|
|
avl_tree_t sa_layout_num_tree; /* keyed by layout number */
|
|
|
|
avl_tree_t sa_layout_hash_tree; /* keyed by layout hash value */
|
|
|
|
int sa_user_table_sz;
|
|
|
|
sa_attr_type_t *sa_user_table; /* user name->attr mapping table */
|
|
|
|
};
|
|
|
|
|
|
|
|
/*
|
|
|
|
* header for all bonus and spill buffers.
|
2013-06-11 21:12:34 +04:00
|
|
|
*
|
2010-05-29 00:45:14 +04:00
|
|
|
* The header has a fixed portion with a variable number
|
|
|
|
* of "lengths" depending on the number of variable sized
|
Illumos #4045 write throttle & i/o scheduler performance work
4045 zfs write throttle & i/o scheduler performance work
1. The ZFS i/o scheduler (vdev_queue.c) now divides i/os into 5 classes: sync
read, sync write, async read, async write, and scrub/resilver. The scheduler
issues a number of concurrent i/os from each class to the device. Once a class
has been selected, an i/o is selected from this class using either an elevator
algorithem (async, scrub classes) or FIFO (sync classes). The number of
concurrent async write i/os is tuned dynamically based on i/o load, to achieve
good sync i/o latency when there is not a high load of writes, and good write
throughput when there is. See the block comment in vdev_queue.c (reproduced
below) for more details.
2. The write throttle (dsl_pool_tempreserve_space() and
txg_constrain_throughput()) is rewritten to produce much more consistent delays
when under constant load. The new write throttle is based on the amount of
dirty data, rather than guesses about future performance of the system. When
there is a lot of dirty data, each transaction (e.g. write() syscall) will be
delayed by the same small amount. This eliminates the "brick wall of wait"
that the old write throttle could hit, causing all transactions to wait several
seconds until the next txg opens. One of the keys to the new write throttle is
decrementing the amount of dirty data as i/o completes, rather than at the end
of spa_sync(). Note that the write throttle is only applied once the i/o
scheduler is issuing the maximum number of outstanding async writes. See the
block comments in dsl_pool.c and above dmu_tx_delay() (reproduced below) for
more details.
This diff has several other effects, including:
* the commonly-tuned global variable zfs_vdev_max_pending has been removed;
use per-class zfs_vdev_*_max_active values or zfs_vdev_max_active instead.
* the size of each txg (meaning the amount of dirty data written, and thus the
time it takes to write out) is now controlled differently. There is no longer
an explicit time goal; the primary determinant is amount of dirty data.
Systems that are under light or medium load will now often see that a txg is
always syncing, but the impact to performance (e.g. read latency) is minimal.
Tune zfs_dirty_data_max and zfs_dirty_data_sync to control this.
* zio_taskq_batch_pct = 75 -- Only use 75% of all CPUs for compression,
checksum, etc. This improves latency by not allowing these CPU-intensive tasks
to consume all CPU (on machines with at least 4 CPU's; the percentage is
rounded up).
--matt
APPENDIX: problems with the current i/o scheduler
The current ZFS i/o scheduler (vdev_queue.c) is deadline based. The problem
with this is that if there are always i/os pending, then certain classes of
i/os can see very long delays.
For example, if there are always synchronous reads outstanding, then no async
writes will be serviced until they become "past due". One symptom of this
situation is that each pass of the txg sync takes at least several seconds
(typically 3 seconds).
If many i/os become "past due" (their deadline is in the past), then we must
service all of these overdue i/os before any new i/os. This happens when we
enqueue a batch of async writes for the txg sync, with deadlines 2.5 seconds in
the future. If we can't complete all the i/os in 2.5 seconds (e.g. because
there were always reads pending), then these i/os will become past due. Now we
must service all the "async" writes (which could be hundreds of megabytes)
before we service any reads, introducing considerable latency to synchronous
i/os (reads or ZIL writes).
Notes on porting to ZFS on Linux:
- zio_t gained new members io_physdone and io_phys_children. Because
object caches in the Linux port call the constructor only once at
allocation time, objects may contain residual data when retrieved
from the cache. Therefore zio_create() was updated to zero out the two
new fields.
- vdev_mirror_pending() relied on the depth of the per-vdev pending queue
(vq->vq_pending_tree) to select the least-busy leaf vdev to read from.
This tree has been replaced by vq->vq_active_tree which is now used
for the same purpose.
- vdev_queue_init() used the value of zfs_vdev_max_pending to determine
the number of vdev I/O buffers to pre-allocate. That global no longer
exists, so we instead use the sum of the *_max_active values for each of
the five I/O classes described above.
- The Illumos implementation of dmu_tx_delay() delays a transaction by
sleeping in condition variable embedded in the thread
(curthread->t_delay_cv). We do not have an equivalent CV to use in
Linux, so this change replaced the delay logic with a wrapper called
zfs_sleep_until(). This wrapper could be adopted upstream and in other
downstream ports to abstract away operating system-specific delay logic.
- These tunables are added as module parameters, and descriptions added
to the zfs-module-parameters.5 man page.
spa_asize_inflation
zfs_deadman_synctime_ms
zfs_vdev_max_active
zfs_vdev_async_write_active_min_dirty_percent
zfs_vdev_async_write_active_max_dirty_percent
zfs_vdev_async_read_max_active
zfs_vdev_async_read_min_active
zfs_vdev_async_write_max_active
zfs_vdev_async_write_min_active
zfs_vdev_scrub_max_active
zfs_vdev_scrub_min_active
zfs_vdev_sync_read_max_active
zfs_vdev_sync_read_min_active
zfs_vdev_sync_write_max_active
zfs_vdev_sync_write_min_active
zfs_dirty_data_max_percent
zfs_delay_min_dirty_percent
zfs_dirty_data_max_max_percent
zfs_dirty_data_max
zfs_dirty_data_max_max
zfs_dirty_data_sync
zfs_delay_scale
The latter four have type unsigned long, whereas they are uint64_t in
Illumos. This accommodates Linux's module_param() supported types, but
means they may overflow on 32-bit architectures.
The values zfs_dirty_data_max and zfs_dirty_data_max_max are the most
likely to overflow on 32-bit systems, since they express physical RAM
sizes in bytes. In fact, Illumos initializes zfs_dirty_data_max_max to
2^32 which does overflow. To resolve that, this port instead initializes
it in arc_init() to 25% of physical RAM, and adds the tunable
zfs_dirty_data_max_max_percent to override that percentage. While this
solution doesn't completely avoid the overflow issue, it should be a
reasonable default for most systems, and the minority of affected
systems can work around the issue by overriding the defaults.
- Fixed reversed logic in comment above zfs_delay_scale declaration.
- Clarified comments in vdev_queue.c regarding when per-queue minimums take
effect.
- Replaced dmu_tx_write_limit in the dmu_tx kstat file
with dmu_tx_dirty_delay and dmu_tx_dirty_over_max. The first counts
how many times a transaction has been delayed because the pool dirty
data has exceeded zfs_delay_min_dirty_percent. The latter counts how
many times the pool dirty data has exceeded zfs_dirty_data_max (which
we expect to never happen).
- The original patch would have regressed the bug fixed in
zfsonlinux/zfs@c418410, which prevented users from setting the
zfs_vdev_aggregation_limit tuning larger than SPA_MAXBLOCKSIZE.
A similar fix is added to vdev_queue_aggregate().
- In vdev_queue_io_to_issue(), dynamically allocate 'zio_t search' on the
heap instead of the stack. In Linux we can't afford such large
structures on the stack.
Reviewed by: George Wilson <george.wilson@delphix.com>
Reviewed by: Adam Leventhal <ahl@delphix.com>
Reviewed by: Christopher Siden <christopher.siden@delphix.com>
Reviewed by: Ned Bass <bass6@llnl.gov>
Reviewed by: Brendan Gregg <brendan.gregg@joyent.com>
Approved by: Robert Mustacchi <rm@joyent.com>
References:
http://www.illumos.org/issues/4045
illumos/illumos-gate@69962b5647e4a8b9b14998733b765925381b727e
Ported-by: Ned Bass <bass6@llnl.gov>
Signed-off-by: Brian Behlendorf <behlendorf1@llnl.gov>
Closes #1913
2013-08-29 07:01:20 +04:00
|
|
|
* attributes which are determined by the "layout number"
|
2010-05-29 00:45:14 +04:00
|
|
|
*/
|
|
|
|
|
|
|
|
#define SA_MAGIC 0x2F505A /* ZFS SA */
|
|
|
|
typedef struct sa_hdr_phys {
|
|
|
|
uint32_t sa_magic;
|
2013-06-11 21:12:34 +04:00
|
|
|
/*
|
|
|
|
* Encoded with hdrsize and layout number as follows:
|
|
|
|
* 16 10 0
|
|
|
|
* +--------+-------+
|
|
|
|
* | hdrsz |layout |
|
|
|
|
* +--------+-------+
|
|
|
|
*
|
|
|
|
* Bits 0-10 are the layout number
|
|
|
|
* Bits 11-16 are the size of the header.
|
|
|
|
* The hdrsize is the number * 8
|
|
|
|
*
|
|
|
|
* For example.
|
|
|
|
* hdrsz of 1 ==> 8 byte header
|
|
|
|
* 2 ==> 16 byte header
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
uint16_t sa_layout_info;
|
2010-05-29 00:45:14 +04:00
|
|
|
uint16_t sa_lengths[1]; /* optional sizes for variable length attrs */
|
|
|
|
/* ... Data follows the lengths. */
|
|
|
|
} sa_hdr_phys_t;
|
|
|
|
|
|
|
|
#define SA_HDR_LAYOUT_NUM(hdr) BF32_GET(hdr->sa_layout_info, 0, 10)
|
2013-01-14 21:31:53 +04:00
|
|
|
#define SA_HDR_SIZE(hdr) BF32_GET_SB(hdr->sa_layout_info, 10, 6, 3, 0)
|
2010-05-29 00:45:14 +04:00
|
|
|
#define SA_HDR_LAYOUT_INFO_ENCODE(x, num, size) \
|
|
|
|
{ \
|
|
|
|
BF32_SET_SB(x, 10, 6, 3, 0, size); \
|
|
|
|
BF32_SET(x, 0, 10, num); \
|
|
|
|
}
|
|
|
|
|
|
|
|
typedef enum sa_buf_type {
|
|
|
|
SA_BONUS = 1,
|
|
|
|
SA_SPILL = 2
|
|
|
|
} sa_buf_type_t;
|
|
|
|
|
|
|
|
typedef enum sa_data_op {
|
|
|
|
SA_LOOKUP,
|
|
|
|
SA_UPDATE,
|
|
|
|
SA_ADD,
|
|
|
|
SA_REPLACE,
|
|
|
|
SA_REMOVE
|
|
|
|
} sa_data_op_t;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Opaque handle used for most sa functions
|
|
|
|
*
|
|
|
|
* This needs to be kept as small as possible.
|
|
|
|
*/
|
|
|
|
|
|
|
|
struct sa_handle {
|
2015-04-02 06:44:32 +03:00
|
|
|
dmu_buf_user_t sa_dbu;
|
2010-05-29 00:45:14 +04:00
|
|
|
kmutex_t sa_lock;
|
|
|
|
dmu_buf_t *sa_bonus;
|
|
|
|
dmu_buf_t *sa_spill;
|
|
|
|
objset_t *sa_os;
|
2015-04-02 06:44:32 +03:00
|
|
|
void *sa_userp;
|
2010-05-29 00:45:14 +04:00
|
|
|
sa_idx_tab_t *sa_bonus_tab; /* idx of bonus */
|
|
|
|
sa_idx_tab_t *sa_spill_tab; /* only present if spill activated */
|
|
|
|
};
|
|
|
|
|
|
|
|
#define SA_GET_DB(hdl, type) \
|
|
|
|
(dmu_buf_impl_t *)((type == SA_BONUS) ? hdl->sa_bonus : hdl->sa_spill)
|
|
|
|
|
|
|
|
#define SA_GET_HDR(hdl, type) \
|
|
|
|
((sa_hdr_phys_t *)((dmu_buf_impl_t *)(SA_GET_DB(hdl, \
|
|
|
|
type))->db.db_data))
|
|
|
|
|
|
|
|
#define SA_IDX_TAB_GET(hdl, type) \
|
|
|
|
(type == SA_BONUS ? hdl->sa_bonus_tab : hdl->sa_spill_tab)
|
|
|
|
|
|
|
|
#define IS_SA_BONUSTYPE(a) \
|
|
|
|
((a == DMU_OT_SA) ? B_TRUE : B_FALSE)
|
|
|
|
|
|
|
|
#define SA_BONUSTYPE_FROM_DB(db) \
|
2010-08-27 01:24:34 +04:00
|
|
|
(dmu_get_bonustype((dmu_buf_t *)db))
|
2010-05-29 00:45:14 +04:00
|
|
|
|
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 04:25:34 +03:00
|
|
|
#define SA_BLKPTR_SPACE (DN_OLD_MAX_BONUSLEN - sizeof (blkptr_t))
|
2010-05-29 00:45:14 +04:00
|
|
|
|
|
|
|
#define SA_LAYOUT_NUM(x, type) \
|
|
|
|
((!IS_SA_BONUSTYPE(type) ? 0 : (((IS_SA_BONUSTYPE(type)) && \
|
|
|
|
((SA_HDR_LAYOUT_NUM(x)) == 0)) ? 1 : SA_HDR_LAYOUT_NUM(x))))
|
|
|
|
|
|
|
|
|
|
|
|
#define SA_REGISTERED_LEN(sa, attr) sa->sa_attr_table[attr].sa_length
|
|
|
|
|
|
|
|
#define SA_ATTR_LEN(sa, idx, attr, hdr) ((SA_REGISTERED_LEN(sa, attr) == 0) ?\
|
|
|
|
hdr->sa_lengths[TOC_LEN_IDX(idx->sa_idx_tab[attr])] : \
|
|
|
|
SA_REGISTERED_LEN(sa, attr))
|
|
|
|
|
|
|
|
#define SA_SET_HDR(hdr, num, size) \
|
|
|
|
{ \
|
|
|
|
hdr->sa_magic = SA_MAGIC; \
|
|
|
|
SA_HDR_LAYOUT_INFO_ENCODE(hdr->sa_layout_info, num, size); \
|
|
|
|
}
|
|
|
|
|
|
|
|
#define SA_ATTR_INFO(sa, idx, hdr, attr, bulk, type, hdl) \
|
|
|
|
{ \
|
|
|
|
bulk.sa_size = SA_ATTR_LEN(sa, idx, attr, hdr); \
|
|
|
|
bulk.sa_buftype = type; \
|
|
|
|
bulk.sa_addr = \
|
|
|
|
(void *)((uintptr_t)TOC_OFF(idx->sa_idx_tab[attr]) + \
|
|
|
|
(uintptr_t)hdr); \
|
|
|
|
}
|
|
|
|
|
|
|
|
#define SA_HDR_SIZE_MATCH_LAYOUT(hdr, tb) \
|
|
|
|
(SA_HDR_SIZE(hdr) == (sizeof (sa_hdr_phys_t) + \
|
|
|
|
(tb->lot_var_sizes > 1 ? P2ROUNDUP((tb->lot_var_sizes - 1) * \
|
|
|
|
sizeof (uint16_t), 8) : 0)))
|
|
|
|
|
|
|
|
int sa_add_impl(sa_handle_t *, sa_attr_type_t,
|
|
|
|
uint32_t, sa_data_locator_t, void *, dmu_tx_t *);
|
|
|
|
|
|
|
|
void sa_register_update_callback_locked(objset_t *, sa_update_cb_t *);
|
|
|
|
int sa_size_locked(sa_handle_t *, sa_attr_type_t, int *);
|
|
|
|
|
|
|
|
void sa_default_locator(void **, uint32_t *, uint32_t, boolean_t, void *);
|
|
|
|
int sa_attr_size(sa_os_t *, sa_idx_tab_t *, sa_attr_type_t,
|
|
|
|
uint16_t *, sa_hdr_phys_t *);
|
|
|
|
|
|
|
|
#ifdef __cplusplus
|
|
|
|
extern "C" {
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#ifdef __cplusplus
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#endif /* _SYS_SA_IMPL_H */
|