Illumos 5497 - lock contention on arcs_mtx
Reviewed by: George Wilson <george.wilson@delphix.com>
Reviewed by: Matthew Ahrens <mahrens@delphix.com>
Reviewed by: Richard Elling <richard.elling@richardelling.com>
Approved by: Dan McDonald <danmcd@omniti.com>
Porting notes and other significant code changes:
The illumos 5368 patch (ARC should cache more metadata), which
was never picked up by ZoL, is mostly reverted by this patch.
Since ZoL relies on the kernel asynchronously calling the shrinker to
actually reap memory, the shrinker wakes up arc_reclaim_waiters_cv every
time it runs.
The arc_adapt_thread() function no longer calls arc_do_user_evicts()
since the newly-added arc_user_evicts_thread() calls it periodically.
Notable conflicting ZoL commits which conflicted with this patch or
whose effects are either duplicated or un-done by this patch:
302f753 - Integrate ARC more tightly with Linux
39e055c - Adjust arc_p based on "bytes" in arc_shrink
f521ce1 - Allow "arc_p" to drop to zero or grow to "arc_c"
77765b5 - Remove "arc_meta_used" from arc_adjust calculation
94520ca - Prune metadata from ghost lists in arc_adjust_meta
Trace support for multilist_insert() and multilist_remove() has been
added and produces the following output:
fio-12498 [077] .... 112936.448324: zfs_multilist__insert: ml { offset 240 numsublists 80 sublistidx 63 }
fio-12498 [077] .... 112936.448347: zfs_multilist__remove: ml { offset 240 numsublists 80 sublistidx 29 }
The following arcstats have been removed:
recycle_miss - Used by arcstat.py and arc_summary.py, both of which
have been updated appropriately.
l2_writes_hdr_miss
The following arcstats have been added:
evict_not_enough - Number of times arc_evict_state() was unable to
evict enough buffers to reach its target amount.
evict_l2_skip - Number of times arc_evict_hdr() skipped eviction
because it was being written to the l2arc.
l2_writes_lock_retry - Replaces l2_writes_hdr_miss. Number of times
l2arc_write_done() failed to acquire hash_lock (and re-tries).
arc_meta_min - Shows the value of the zfs_arc_meta_min module
parameter (see below).
The "index" column of the "dbuf" kstat has been removed since it doesn't
have a direct analog in the new multilist scheme. Additional multilist-
related stats could be added in the future but would likely require
extensions to the mulilist API.
The following module parameters have been added:
zfs_arc_evict_batch_limit - Number of ARC headers to free per sub-list
before moving on to the next sub-list.
zfs_arc_meta_min - Enforce a floor on the amount of metadata in
the ARC.
zfs_arc_num_sublists_per_state - Number of multilist sub-lists per
ARC state.
zfs_arc_overflow_shift - Controls amount by which the ARC must exceed
the target size to be considered "overflowing".
Ported-by: Tim Chase <tim@chase2k.com>
Signed-off-by: Brian Behlendorf <behlendorf1@llnl.gov
This commit is contained in:
Prakash Surya
Brian Behlendorf
parent
b9541d6b7d
commit
ca0bf58d65
@ -191,12 +191,10 @@ def get_arc_summary(Kstat):
|
||||
### ARC Misc. ###
|
||||
deleted = Kstat["kstat.zfs.misc.arcstats.deleted"]
|
||||
mutex_miss = Kstat["kstat.zfs.misc.arcstats.mutex_miss"]
|
||||
recycle_miss = Kstat["kstat.zfs.misc.arcstats.recycle_miss"]
|
||||
|
||||
### ARC Misc. ###
|
||||
output["arc_misc"] = {}
|
||||
output["arc_misc"]["deleted"] = fHits(deleted)
|
||||
output["arc_misc"]['recycle_miss'] = fHits(recycle_miss)
|
||||
output["arc_misc"]['mutex_miss'] = fHits(mutex_miss)
|
||||
output["arc_misc"]['evict_skips'] = fHits(mutex_miss)
|
||||
|
||||
@ -302,8 +300,6 @@ def _arc_summary(Kstat):
|
||||
### ARC Misc. ###
|
||||
sys.stdout.write("ARC Misc:\n")
|
||||
sys.stdout.write("\tDeleted:\t\t\t\t%s\n" % arc['arc_misc']['deleted'])
|
||||
sys.stdout.write("\tRecycle Misses:\t\t\t\t%s\n" %
|
||||
arc['arc_misc']['recycle_miss'])
|
||||
sys.stdout.write("\tMutex Misses:\t\t\t\t%s\n" %
|
||||
arc['arc_misc']['mutex_miss'])
|
||||
sys.stdout.write("\tEvict Skips:\t\t\t\t%s\n" %
|
||||
|
||||
@ -82,7 +82,6 @@
|
||||
"mrug": [4, 1000, "MRU Ghost List hits per second"],
|
||||
"eskip": [5, 1000, "evict_skip per second"],
|
||||
"mtxmis": [6, 1000, "mutex_miss per second"],
|
||||
"rmis": [4, 1000, "recycle_miss per second"],
|
||||
"dread": [5, 1000, "Demand accesses per second"],
|
||||
"pread": [5, 1000, "Prefetch accesses per second"],
|
||||
"l2hits": [6, 1000, "L2ARC hits per second"],
|
||||
@ -406,7 +405,6 @@ def calculate():
|
||||
v["mrug"] = d["mru_ghost_hits"] / sint
|
||||
v["mfug"] = d["mfu_ghost_hits"] / sint
|
||||
v["eskip"] = d["evict_skip"] / sint
|
||||
v["rmis"] = d["recycle_miss"] / sint
|
||||
v["mtxmis"] = d["mutex_miss"] / sint
|
||||
|
||||
if l2exist:
|
||||
|
||||
@ -33,6 +33,7 @@ COMMON_H = \
|
||||
$(top_srcdir)/include/sys/efi_partition.h \
|
||||
$(top_srcdir)/include/sys/metaslab.h \
|
||||
$(top_srcdir)/include/sys/metaslab_impl.h \
|
||||
$(top_srcdir)/include/sys/multilist.h \
|
||||
$(top_srcdir)/include/sys/nvpair.h \
|
||||
$(top_srcdir)/include/sys/nvpair_impl.h \
|
||||
$(top_srcdir)/include/sys/range_tree.h \
|
||||
@ -53,6 +54,7 @@ COMMON_H = \
|
||||
$(top_srcdir)/include/sys/trace_dbuf.h \
|
||||
$(top_srcdir)/include/sys/trace_dmu.h \
|
||||
$(top_srcdir)/include/sys/trace_dnode.h \
|
||||
$(top_srcdir)/include/sys/trace_multilist.h \
|
||||
$(top_srcdir)/include/sys/trace_txg.h \
|
||||
$(top_srcdir)/include/sys/trace_zil.h \
|
||||
$(top_srcdir)/include/sys/trace_zrlock.h \
|
||||
|
||||
@ -38,6 +38,12 @@ extern "C" {
|
||||
#include <sys/spa.h>
|
||||
#include <sys/refcount.h>
|
||||
|
||||
/*
|
||||
* Used by arc_flush() to inform arc_evict_state() that it should evict
|
||||
* all available buffers from the arc state being passed in.
|
||||
*/
|
||||
#define ARC_EVICT_ALL -1ULL
|
||||
|
||||
typedef struct arc_buf_hdr arc_buf_hdr_t;
|
||||
typedef struct arc_buf arc_buf_t;
|
||||
typedef struct arc_prune arc_prune_t;
|
||||
@ -146,7 +152,6 @@ typedef enum arc_state_type {
|
||||
typedef struct arc_buf_info {
|
||||
arc_state_type_t abi_state_type;
|
||||
arc_buf_contents_t abi_state_contents;
|
||||
uint64_t abi_state_index;
|
||||
uint32_t abi_flags;
|
||||
uint32_t abi_datacnt;
|
||||
uint64_t abi_size;
|
||||
@ -200,7 +205,7 @@ void arc_freed(spa_t *spa, const blkptr_t *bp);
|
||||
void arc_set_callback(arc_buf_t *buf, arc_evict_func_t *func, void *private);
|
||||
boolean_t arc_clear_callback(arc_buf_t *buf);
|
||||
|
||||
void arc_flush(spa_t *spa);
|
||||
void arc_flush(spa_t *spa, boolean_t retry);
|
||||
void arc_tempreserve_clear(uint64_t reserve);
|
||||
int arc_tempreserve_space(uint64_t reserve, uint64_t txg);
|
||||
|
||||
|
||||
@ -67,10 +67,22 @@ extern "C" {
|
||||
*/
|
||||
|
||||
typedef struct arc_state {
|
||||
list_t arcs_list[ARC_BUFC_NUMTYPES]; /* list of evictable buffers */
|
||||
uint64_t arcs_lsize[ARC_BUFC_NUMTYPES]; /* amount of evictable data */
|
||||
uint64_t arcs_size; /* total amount of data in this state */
|
||||
kmutex_t arcs_mtx;
|
||||
/*
|
||||
* list of evictable buffers
|
||||
*/
|
||||
multilist_t arcs_list[ARC_BUFC_NUMTYPES];
|
||||
/*
|
||||
* total amount of evictable data in this state
|
||||
*/
|
||||
uint64_t arcs_lsize[ARC_BUFC_NUMTYPES];
|
||||
/*
|
||||
* total amount of data in this state; this includes: evictable,
|
||||
* non-evictable, ARC_BUFC_DATA, and ARC_BUFC_METADATA.
|
||||
*/
|
||||
uint64_t arcs_size;
|
||||
/*
|
||||
* supports the "dbufs" kstat
|
||||
*/
|
||||
arc_state_type_t arcs_state;
|
||||
} arc_state_t;
|
||||
|
||||
@ -136,7 +148,7 @@ typedef struct l1arc_buf_hdr {
|
||||
|
||||
/* protected by arc state mutex */
|
||||
arc_state_t *b_state;
|
||||
list_node_t b_arc_node;
|
||||
multilist_node_t b_arc_node;
|
||||
|
||||
/* updated atomically */
|
||||
clock_t b_arc_access;
|
||||
|
||||
105
include/sys/multilist.h
Normal file
105
include/sys/multilist.h
Normal file
@ -0,0 +1,105 @@
|
||||
/*
|
||||
* CDDL HEADER START
|
||||
*
|
||||
* This file and its contents are supplied under the terms of the
|
||||
* Common Development and Distribution License ("CDDL"), version 1.0.
|
||||
* You may only use this file in accordance with the terms of version
|
||||
* 1.0 of the CDDL.
|
||||
*
|
||||
* A full copy of the text of the CDDL should have accompanied this
|
||||
* source. A copy of the CDDL is also available via the Internet at
|
||||
* http://www.illumos.org/license/CDDL.
|
||||
*
|
||||
* CDDL HEADER END
|
||||
*/
|
||||
/*
|
||||
* Copyright (c) 2013, 2014 by Delphix. All rights reserved.
|
||||
*/
|
||||
|
||||
#ifndef _SYS_MULTILIST_H
|
||||
#define _SYS_MULTILIST_H
|
||||
|
||||
#include <sys/zfs_context.h>
|
||||
|
||||
#ifdef __cplusplus
|
||||
extern "C" {
|
||||
#endif
|
||||
|
||||
typedef list_node_t multilist_node_t;
|
||||
typedef struct multilist multilist_t;
|
||||
typedef struct multilist_sublist multilist_sublist_t;
|
||||
typedef unsigned int multilist_sublist_index_func_t(multilist_t *, void *);
|
||||
|
||||
struct multilist_sublist {
|
||||
/*
|
||||
* The mutex used internally to implement thread safe insertions
|
||||
* and removals to this individual sublist. It can also be locked
|
||||
* by a consumer using multilist_sublist_{lock,unlock}, which is
|
||||
* useful if a consumer needs to traverse the list in a thread
|
||||
* safe manner.
|
||||
*/
|
||||
kmutex_t mls_lock;
|
||||
/*
|
||||
* The actual list object containing all objects in this sublist.
|
||||
*/
|
||||
list_t mls_list;
|
||||
/*
|
||||
* Pad to cache line, in an effort to try and prevent cache line
|
||||
* contention.
|
||||
*/
|
||||
} ____cacheline_aligned;
|
||||
|
||||
struct multilist {
|
||||
/*
|
||||
* This is used to get to the multilist_node_t structure given
|
||||
* the void *object contained on the list.
|
||||
*/
|
||||
size_t ml_offset;
|
||||
/*
|
||||
* The number of sublists used internally by this multilist.
|
||||
*/
|
||||
uint64_t ml_num_sublists;
|
||||
/*
|
||||
* The array of pointers to the actual sublists.
|
||||
*/
|
||||
multilist_sublist_t *ml_sublists;
|
||||
/*
|
||||
* Pointer to function which determines the sublist to use
|
||||
* when inserting and removing objects from this multilist.
|
||||
* Please see the comment above multilist_create for details.
|
||||
*/
|
||||
multilist_sublist_index_func_t *ml_index_func;
|
||||
};
|
||||
|
||||
void multilist_destroy(multilist_t *);
|
||||
void multilist_create(multilist_t *, size_t, size_t, unsigned int,
|
||||
multilist_sublist_index_func_t *);
|
||||
|
||||
void multilist_insert(multilist_t *, void *);
|
||||
void multilist_remove(multilist_t *, void *);
|
||||
int multilist_is_empty(multilist_t *);
|
||||
|
||||
unsigned int multilist_get_num_sublists(multilist_t *);
|
||||
unsigned int multilist_get_random_index(multilist_t *);
|
||||
|
||||
multilist_sublist_t *multilist_sublist_lock(multilist_t *, unsigned int);
|
||||
void multilist_sublist_unlock(multilist_sublist_t *);
|
||||
|
||||
void multilist_sublist_insert_head(multilist_sublist_t *, void *);
|
||||
void multilist_sublist_insert_tail(multilist_sublist_t *, void *);
|
||||
void multilist_sublist_move_forward(multilist_sublist_t *mls, void *obj);
|
||||
void multilist_sublist_remove(multilist_sublist_t *, void *);
|
||||
|
||||
void *multilist_sublist_head(multilist_sublist_t *);
|
||||
void *multilist_sublist_tail(multilist_sublist_t *);
|
||||
void *multilist_sublist_next(multilist_sublist_t *, void *);
|
||||
void *multilist_sublist_prev(multilist_sublist_t *, void *);
|
||||
|
||||
void multilist_link_init(multilist_node_t *);
|
||||
int multilist_link_active(multilist_node_t *);
|
||||
|
||||
#ifdef __cplusplus
|
||||
}
|
||||
#endif
|
||||
|
||||
#endif /* _SYS_MULTILIST_H */
|
||||
76
include/sys/trace_multilist.h
Normal file
76
include/sys/trace_multilist.h
Normal file
@ -0,0 +1,76 @@
|
||||
/*
|
||||
* 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
|
||||
*/
|
||||
|
||||
#if defined(_KERNEL) && defined(HAVE_DECLARE_EVENT_CLASS)
|
||||
|
||||
#undef TRACE_SYSTEM
|
||||
#define TRACE_SYSTEM zfs
|
||||
|
||||
#if !defined(_TRACE_MULTILIST_H) || defined(TRACE_HEADER_MULTI_READ)
|
||||
#define _TRACE_MULTILIST_H
|
||||
|
||||
#include <linux/tracepoint.h>
|
||||
#include <sys/types.h>
|
||||
|
||||
/*
|
||||
* Generic support for three argument tracepoints of the form:
|
||||
*
|
||||
* DTRACE_PROBE3(...,
|
||||
* multilist_t *, ...,
|
||||
* unsigned int, ...,
|
||||
* void *, ...);
|
||||
*/
|
||||
|
||||
DECLARE_EVENT_CLASS(zfs_multilist_insert_remove_class,
|
||||
TP_PROTO(multilist_t *ml, unsigned sublist_idx, void *obj),
|
||||
TP_ARGS(ml, sublist_idx, obj),
|
||||
TP_STRUCT__entry(
|
||||
__field(size_t, ml_offset)
|
||||
__field(uint64_t, ml_num_sublists)
|
||||
|
||||
__field(unsigned int, sublist_idx)
|
||||
),
|
||||
TP_fast_assign(
|
||||
__entry->ml_offset = ml->ml_offset;
|
||||
__entry->ml_num_sublists = ml->ml_num_sublists;
|
||||
|
||||
__entry->sublist_idx = sublist_idx;
|
||||
),
|
||||
TP_printk("ml { offset %ld numsublists %llu sublistidx %u } ",
|
||||
__entry->ml_offset, __entry->ml_num_sublists, __entry->sublist_idx)
|
||||
);
|
||||
|
||||
#define DEFINE_MULTILIST_INSERT_REMOVE_EVENT(name) \
|
||||
DEFINE_EVENT(zfs_multilist_insert_remove_class, name, \
|
||||
TP_PROTO(multilist_t *ml, unsigned int sublist_idx, void *obj), \
|
||||
TP_ARGS(ml, sublist_idx, obj))
|
||||
DEFINE_MULTILIST_INSERT_REMOVE_EVENT(zfs_multilist__insert);
|
||||
DEFINE_MULTILIST_INSERT_REMOVE_EVENT(zfs_multilist__remove);
|
||||
|
||||
#endif /* _TRACE_MULTILIST_H */
|
||||
|
||||
#undef TRACE_INCLUDE_PATH
|
||||
#undef TRACE_INCLUDE_FILE
|
||||
#define TRACE_INCLUDE_PATH sys
|
||||
#define TRACE_INCLUDE_FILE trace_multilist
|
||||
#include <trace/define_trace.h>
|
||||
|
||||
#endif /* _KERNEL && HAVE_DECLARE_EVENT_CLASS */
|
||||
@ -609,6 +609,7 @@ extern void delay(clock_t ticks);
|
||||
} while (0);
|
||||
|
||||
#define max_ncpus 64
|
||||
#define num_online_cpus() (sysconf(_SC_NPROCESSORS_ONLN))
|
||||
|
||||
#define minclsyspri 60
|
||||
#define maxclsyspri 99
|
||||
|
||||
@ -55,6 +55,7 @@ libzpool_la_SOURCES = \
|
||||
$(top_srcdir)/module/zfs/lzjb.c \
|
||||
$(top_srcdir)/module/zfs/lz4.c \
|
||||
$(top_srcdir)/module/zfs/metaslab.c \
|
||||
$(top_srcdir)/module/zfs/multilist.c \
|
||||
$(top_srcdir)/module/zfs/range_tree.c \
|
||||
$(top_srcdir)/module/zfs/refcount.c \
|
||||
$(top_srcdir)/module/zfs/rrwlock.c \
|
||||
|
||||
@ -347,6 +347,19 @@ increased to reduce the memory footprint.
|
||||
Default value: \fB8192\fR.
|
||||
.RE
|
||||
|
||||
.sp
|
||||
.ne 2
|
||||
.na
|
||||
\fBzfs_arc_evict_batch_limit\fR (int)
|
||||
.ad
|
||||
.RS 12n
|
||||
Number ARC headers to evict per sub-list before proceding to another sub-list.
|
||||
This batch-style operation prevents entire sub-lists from being evicted at once
|
||||
but comes at a cost of additional unlocking and locking.
|
||||
.sp
|
||||
Default value: \fB10\fR.
|
||||
.RE
|
||||
|
||||
.sp
|
||||
.ne 2
|
||||
.na
|
||||
@ -395,6 +408,19 @@ for meta data.
|
||||
Default value: \fB0\fR.
|
||||
.RE
|
||||
|
||||
.sp
|
||||
.ne 2
|
||||
.na
|
||||
\fBzfs_arc_meta_min\fR (ulong)
|
||||
.ad
|
||||
.RS 12n
|
||||
The minimum allowed size in bytes that meta data buffers may consume in
|
||||
the ARC. This value defaults to 0 which disables a floor on the amount
|
||||
of the ARC devoted meta data.
|
||||
.sp
|
||||
Default value: \fB0\fR.
|
||||
.RE
|
||||
|
||||
.sp
|
||||
.ne 2
|
||||
.na
|
||||
@ -447,6 +473,40 @@ Min life of prefetch block
|
||||
Default value: \fB100\fR.
|
||||
.RE
|
||||
|
||||
.sp
|
||||
.ne 2
|
||||
.na
|
||||
\fBzfs_arc_num_sublists_per_state\fR (int)
|
||||
.ad
|
||||
.RS 12n
|
||||
To allow more fine-grained locking, each ARC state contains a series
|
||||
of lists for both data and meta data objects. Locking is performed at
|
||||
the level of these "sub-lists". This parameters controls the number of
|
||||
sub-lists per ARC state.
|
||||
.sp
|
||||
Default value: 1 or the number of on-online CPUs, whichever is greater
|
||||
.RE
|
||||
|
||||
.sp
|
||||
.ne 2
|
||||
.na
|
||||
\fBzfs_arc_overflow_shift\fR (int)
|
||||
.ad
|
||||
.RS 12n
|
||||
The ARC size is considered to be overflowing if it exceeds the current
|
||||
ARC target size (arc_c) by a threshold determined by this parameter.
|
||||
The threshold is calculated as a fraction of arc_c using the formula
|
||||
"arc_c >> \fBzfs_arc_overflow_shift\fR".
|
||||
|
||||
The default value of 8 causes the ARC to be considered to be overflowing
|
||||
if it exceeds the target size by 1/256th (0.3%) of the target size.
|
||||
|
||||
When the ARC is overflowing, new buffer allocations are stalled until
|
||||
the reclaim thread catches up and the overflow condition no longer exists.
|
||||
.sp
|
||||
Default value: \fB8\fR.
|
||||
.RE
|
||||
|
||||
.sp
|
||||
.ne 2
|
||||
.na
|
||||
|
||||
@ -37,6 +37,7 @@ $(MODULE)-objs += @top_srcdir@/module/zfs/gzip.o
|
||||
$(MODULE)-objs += @top_srcdir@/module/zfs/lzjb.o
|
||||
$(MODULE)-objs += @top_srcdir@/module/zfs/lz4.o
|
||||
$(MODULE)-objs += @top_srcdir@/module/zfs/metaslab.o
|
||||
$(MODULE)-objs += @top_srcdir@/module/zfs/multilist.o
|
||||
$(MODULE)-objs += @top_srcdir@/module/zfs/range_tree.o
|
||||
$(MODULE)-objs += @top_srcdir@/module/zfs/refcount.o
|
||||
$(MODULE)-objs += @top_srcdir@/module/zfs/rrwlock.o
|
||||
|
||||
1899
module/zfs/arc.c
1899
module/zfs/arc.c
File diff suppressed because it is too large
Load Diff
@ -48,12 +48,12 @@ dbuf_stats_hash_table_headers(char *buf, size_t size)
|
||||
(void) snprintf(buf, size,
|
||||
"%-88s | %-124s | %s\n"
|
||||
"%-16s %-8s %-8s %-8s %-8s %-8s %-8s %-5s %-5s %5s | "
|
||||
"%-5s %-5s %-6s %-8s %-6s %-8s %-12s "
|
||||
"%-5s %-5s %-8s %-6s %-8s %-12s "
|
||||
"%-6s %-6s %-6s %-6s %-6s %-8s %-8s %-8s %-5s | "
|
||||
"%-6s %-6s %-8s %-8s %-6s %-6s %-5s %-8s %-8s\n",
|
||||
"dbuf", "arcbuf", "dnode", "pool", "objset", "object", "level",
|
||||
"blkid", "offset", "dbsize", "meta", "state", "dbholds", "list",
|
||||
"atype", "index", "flags", "count", "asize", "access",
|
||||
"atype", "flags", "count", "asize", "access",
|
||||
"mru", "gmru", "mfu", "gmfu", "l2", "l2_dattr", "l2_asize",
|
||||
"l2_comp", "aholds", "dtype", "btype", "data_bs", "meta_bs",
|
||||
"bsize", "lvls", "dholds", "blocks", "dsize");
|
||||
@ -77,7 +77,7 @@ __dbuf_stats_hash_table_data(char *buf, size_t size, dmu_buf_impl_t *db)
|
||||
|
||||
nwritten = snprintf(buf, size,
|
||||
"%-16s %-8llu %-8lld %-8lld %-8lld %-8llu %-8llu %-5d %-5d %-5lu | "
|
||||
"%-5d %-5d %-6lld 0x%-6x %-6lu %-8llu %-12llu "
|
||||
"%-5d %-5d 0x%-6x %-6lu %-8llu %-12llu "
|
||||
"%-6lu %-6lu %-6lu %-6lu %-6lu %-8llu %-8llu %-8d %-5lu | "
|
||||
"%-6d %-6d %-8lu %-8lu %-6llu %-6lu %-5lu %-8llu %-8llu\n",
|
||||
/* dmu_buf_impl_t */
|
||||
@ -94,7 +94,6 @@ __dbuf_stats_hash_table_data(char *buf, size_t size, dmu_buf_impl_t *db)
|
||||
/* arc_buf_info_t */
|
||||
abi.abi_state_type,
|
||||
abi.abi_state_contents,
|
||||
(longlong_t)abi.abi_state_index,
|
||||
abi.abi_flags,
|
||||
(ulong_t)abi.abi_datacnt,
|
||||
(u_longlong_t)abi.abi_size,
|
||||
|
||||
@ -317,7 +317,14 @@ dsl_pool_close(dsl_pool_t *dp)
|
||||
txg_list_destroy(&dp->dp_sync_tasks);
|
||||
txg_list_destroy(&dp->dp_dirty_dirs);
|
||||
|
||||
arc_flush(dp->dp_spa);
|
||||
/*
|
||||
* We can't set retry to TRUE since we're explicitly specifying
|
||||
* a spa to flush. This is good enough; any missed buffers for
|
||||
* this spa won't cause trouble, and they'll eventually fall
|
||||
* out of the ARC just like any other unused buffer.
|
||||
*/
|
||||
arc_flush(dp->dp_spa, FALSE);
|
||||
|
||||
txg_fini(dp);
|
||||
dsl_scan_fini(dp);
|
||||
dmu_buf_user_evict_wait();
|
||||
|
||||
375
module/zfs/multilist.c
Normal file
375
module/zfs/multilist.c
Normal file
@ -0,0 +1,375 @@
|
||||
/*
|
||||
* CDDL HEADER START
|
||||
*
|
||||
* This file and its contents are supplied under the terms of the
|
||||
* Common Development and Distribution License ("CDDL"), version 1.0.
|
||||
* You may only use this file in accordance with the terms of version
|
||||
* 1.0 of the CDDL.
|
||||
*
|
||||
* A full copy of the text of the CDDL should have accompanied this
|
||||
* source. A copy of the CDDL is also available via the Internet at
|
||||
* http://www.illumos.org/license/CDDL.
|
||||
*
|
||||
* CDDL HEADER END
|
||||
*/
|
||||
/*
|
||||
* Copyright (c) 2013, 2014 by Delphix. All rights reserved.
|
||||
*/
|
||||
|
||||
#include <sys/zfs_context.h>
|
||||
#include <sys/multilist.h>
|
||||
#include <sys/trace_multilist.h>
|
||||
|
||||
/* needed for spa_get_random() */
|
||||
#include <sys/spa.h>
|
||||
|
||||
/*
|
||||
* Given the object contained on the list, return a pointer to the
|
||||
* object's multilist_node_t structure it contains.
|
||||
*/
|
||||
#ifdef DEBUG
|
||||
static multilist_node_t *
|
||||
multilist_d2l(multilist_t *ml, void *obj)
|
||||
{
|
||||
return ((multilist_node_t *)((char *)obj + ml->ml_offset));
|
||||
}
|
||||
#endif
|
||||
|
||||
/*
|
||||
* Initialize a new mutlilist using the parameters specified.
|
||||
*
|
||||
* - 'size' denotes the size of the structure containing the
|
||||
* multilist_node_t.
|
||||
* - 'offset' denotes the byte offset of the mutlilist_node_t within
|
||||
* the structure that contains it.
|
||||
* - 'num' specifies the number of internal sublists to create.
|
||||
* - 'index_func' is used to determine which sublist to insert into
|
||||
* when the multilist_insert() function is called; as well as which
|
||||
* sublist to remove from when multilist_remove() is called. The
|
||||
* requirements this function must meet, are the following:
|
||||
*
|
||||
* - It must always return the same value when called on the same
|
||||
* object (to ensure the object is removed from the list it was
|
||||
* inserted into).
|
||||
*
|
||||
* - It must return a value in the range [0, number of sublists).
|
||||
* The multilist_get_num_sublists() function may be used to
|
||||
* determine the number of sublists in the multilist.
|
||||
*
|
||||
* Also, in order to reduce internal contention between the sublists
|
||||
* during insertion and removal, this function should choose evenly
|
||||
* between all available sublists when inserting. This isn't a hard
|
||||
* requirement, but a general rule of thumb in order to garner the
|
||||
* best multi-threaded performance out of the data structure.
|
||||
*/
|
||||
void
|
||||
multilist_create(multilist_t *ml, size_t size, size_t offset, unsigned int num,
|
||||
multilist_sublist_index_func_t *index_func)
|
||||
{
|
||||
int i;
|
||||
|
||||
ASSERT3P(ml, !=, NULL);
|
||||
ASSERT3U(size, >, 0);
|
||||
ASSERT3U(size, >=, offset + sizeof (multilist_node_t));
|
||||
ASSERT3U(num, >, 0);
|
||||
ASSERT3P(index_func, !=, NULL);
|
||||
|
||||
ml->ml_offset = offset;
|
||||
ml->ml_num_sublists = num;
|
||||
ml->ml_index_func = index_func;
|
||||
|
||||
ml->ml_sublists = kmem_zalloc(sizeof (multilist_sublist_t) *
|
||||
ml->ml_num_sublists, KM_SLEEP);
|
||||
|
||||
ASSERT3P(ml->ml_sublists, !=, NULL);
|
||||
|
||||
for (i = 0; i < ml->ml_num_sublists; i++) {
|
||||
multilist_sublist_t *mls = &ml->ml_sublists[i];
|
||||
mutex_init(&mls->mls_lock, NULL, MUTEX_DEFAULT, NULL);
|
||||
list_create(&mls->mls_list, size, offset);
|
||||
}
|
||||
}
|
||||
|
||||
/*
|
||||
* Destroy the given multilist object, and free up any memory it holds.
|
||||
*/
|
||||
void
|
||||
multilist_destroy(multilist_t *ml)
|
||||
{
|
||||
int i;
|
||||
|
||||
ASSERT(multilist_is_empty(ml));
|
||||
|
||||
for (i = 0; i < ml->ml_num_sublists; i++) {
|
||||
multilist_sublist_t *mls = &ml->ml_sublists[i];
|
||||
|
||||
ASSERT(list_is_empty(&mls->mls_list));
|
||||
|
||||
list_destroy(&mls->mls_list);
|
||||
mutex_destroy(&mls->mls_lock);
|
||||
}
|
||||
|
||||
ASSERT3P(ml->ml_sublists, !=, NULL);
|
||||
kmem_free(ml->ml_sublists,
|
||||
sizeof (multilist_sublist_t) * ml->ml_num_sublists);
|
||||
|
||||
ml->ml_num_sublists = 0;
|
||||
ml->ml_offset = 0;
|
||||
}
|
||||
|
||||
/*
|
||||
* Insert the given object into the multilist.
|
||||
*
|
||||
* This function will insert the object specified into the sublist
|
||||
* determined using the function given at multilist creation time.
|
||||
*
|
||||
* The sublist locks are automatically acquired if not already held, to
|
||||
* ensure consistency when inserting and removing from multiple threads.
|
||||
*/
|
||||
void
|
||||
multilist_insert(multilist_t *ml, void *obj)
|
||||
{
|
||||
unsigned int sublist_idx = ml->ml_index_func(ml, obj);
|
||||
multilist_sublist_t *mls;
|
||||
boolean_t need_lock;
|
||||
|
||||
DTRACE_PROBE3(multilist__insert, multilist_t *, ml,
|
||||
unsigned int, sublist_idx, void *, obj);
|
||||
|
||||
ASSERT3U(sublist_idx, <, ml->ml_num_sublists);
|
||||
|
||||
mls = &ml->ml_sublists[sublist_idx];
|
||||
|
||||
/*
|
||||
* Note: Callers may already hold the sublist lock by calling
|
||||
* multilist_sublist_lock(). Here we rely on MUTEX_HELD()
|
||||
* returning TRUE if and only if the current thread holds the
|
||||
* lock. While it's a little ugly to make the lock recursive in
|
||||
* this way, it works and allows the calling code to be much
|
||||
* simpler -- otherwise it would have to pass around a flag
|
||||
* indicating that it already has the lock.
|
||||
*/
|
||||
need_lock = !MUTEX_HELD(&mls->mls_lock);
|
||||
|
||||
if (need_lock)
|
||||
mutex_enter(&mls->mls_lock);
|
||||
|
||||
ASSERT(!multilist_link_active(multilist_d2l(ml, obj)));
|
||||
|
||||
multilist_sublist_insert_head(mls, obj);
|
||||
|
||||
if (need_lock)
|
||||
mutex_exit(&mls->mls_lock);
|
||||
}
|
||||
|
||||
/*
|
||||
* Remove the given object from the multilist.
|
||||
*
|
||||
* This function will remove the object specified from the sublist
|
||||
* determined using the function given at multilist creation time.
|
||||
*
|
||||
* The necessary sublist locks are automatically acquired, to ensure
|
||||
* consistency when inserting and removing from multiple threads.
|
||||
*/
|
||||
void
|
||||
multilist_remove(multilist_t *ml, void *obj)
|
||||
{
|
||||
unsigned int sublist_idx = ml->ml_index_func(ml, obj);
|
||||
multilist_sublist_t *mls;
|
||||
boolean_t need_lock;
|
||||
|
||||
DTRACE_PROBE3(multilist__remove, multilist_t *, ml,
|
||||
unsigned int, sublist_idx, void *, obj);
|
||||
|
||||
ASSERT3U(sublist_idx, <, ml->ml_num_sublists);
|
||||
|
||||
mls = &ml->ml_sublists[sublist_idx];
|
||||
/* See comment in multilist_insert(). */
|
||||
need_lock = !MUTEX_HELD(&mls->mls_lock);
|
||||
|
||||
if (need_lock)
|
||||
mutex_enter(&mls->mls_lock);
|
||||
|
||||
ASSERT(multilist_link_active(multilist_d2l(ml, obj)));
|
||||
|
||||
multilist_sublist_remove(mls, obj);
|
||||
|
||||
if (need_lock)
|
||||
mutex_exit(&mls->mls_lock);
|
||||
}
|
||||
|
||||
/*
|
||||
* Check to see if this multilist object is empty.
|
||||
*
|
||||
* This will return TRUE if it finds all of the sublists of this
|
||||
* multilist to be empty, and FALSE otherwise. Each sublist lock will be
|
||||
* automatically acquired as necessary.
|
||||
*
|
||||
* If concurrent insertions and removals are occurring, the semantics
|
||||
* of this function become a little fuzzy. Instead of locking all
|
||||
* sublists for the entire call time of the function, each sublist is
|
||||
* only locked as it is individually checked for emptiness. Thus, it's
|
||||
* possible for this function to return TRUE with non-empty sublists at
|
||||
* the time the function returns. This would be due to another thread
|
||||
* inserting into a given sublist, after that specific sublist was check
|
||||
* and deemed empty, but before all sublists have been checked.
|
||||
*/
|
||||
int
|
||||
multilist_is_empty(multilist_t *ml)
|
||||
{
|
||||
int i;
|
||||
|
||||
for (i = 0; i < ml->ml_num_sublists; i++) {
|
||||
multilist_sublist_t *mls = &ml->ml_sublists[i];
|
||||
/* See comment in multilist_insert(). */
|
||||
boolean_t need_lock = !MUTEX_HELD(&mls->mls_lock);
|
||||
|
||||
if (need_lock)
|
||||
mutex_enter(&mls->mls_lock);
|
||||
|
||||
if (!list_is_empty(&mls->mls_list)) {
|
||||
if (need_lock)
|
||||
mutex_exit(&mls->mls_lock);
|
||||
|
||||
return (FALSE);
|
||||
}
|
||||
|
||||
if (need_lock)
|
||||
mutex_exit(&mls->mls_lock);
|
||||
}
|
||||
|
||||
return (TRUE);
|
||||
}
|
||||
|
||||
/* Return the number of sublists composing this multilist */
|
||||
unsigned int
|
||||
multilist_get_num_sublists(multilist_t *ml)
|
||||
{
|
||||
return (ml->ml_num_sublists);
|
||||
}
|
||||
|
||||
/* Return a randomly selected, valid sublist index for this multilist */
|
||||
unsigned int
|
||||
multilist_get_random_index(multilist_t *ml)
|
||||
{
|
||||
return (spa_get_random(ml->ml_num_sublists));
|
||||
}
|
||||
|
||||
/* Lock and return the sublist specified at the given index */
|
||||
multilist_sublist_t *
|
||||
multilist_sublist_lock(multilist_t *ml, unsigned int sublist_idx)
|
||||
{
|
||||
multilist_sublist_t *mls;
|
||||
|
||||
ASSERT3U(sublist_idx, <, ml->ml_num_sublists);
|
||||
mls = &ml->ml_sublists[sublist_idx];
|
||||
mutex_enter(&mls->mls_lock);
|
||||
|
||||
return (mls);
|
||||
}
|
||||
|
||||
void
|
||||
multilist_sublist_unlock(multilist_sublist_t *mls)
|
||||
{
|
||||
mutex_exit(&mls->mls_lock);
|
||||
}
|
||||
|
||||
/*
|
||||
* We're allowing any object to be inserted into this specific sublist,
|
||||
* but this can lead to trouble if multilist_remove() is called to
|
||||
* remove this object. Specifically, if calling ml_index_func on this
|
||||
* object returns an index for sublist different than what is passed as
|
||||
* a parameter here, any call to multilist_remove() with this newly
|
||||
* inserted object is undefined! (the call to multilist_remove() will
|
||||
* remove the object from a list that it isn't contained in)
|
||||
*/
|
||||
void
|
||||
multilist_sublist_insert_head(multilist_sublist_t *mls, void *obj)
|
||||
{
|
||||
ASSERT(MUTEX_HELD(&mls->mls_lock));
|
||||
list_insert_head(&mls->mls_list, obj);
|
||||
}
|
||||
|
||||
/* please see comment above multilist_sublist_insert_head */
|
||||
void
|
||||
multilist_sublist_insert_tail(multilist_sublist_t *mls, void *obj)
|
||||
{
|
||||
ASSERT(MUTEX_HELD(&mls->mls_lock));
|
||||
list_insert_tail(&mls->mls_list, obj);
|
||||
}
|
||||
|
||||
/*
|
||||
* Move the object one element forward in the list.
|
||||
*
|
||||
* This function will move the given object forward in the list (towards
|
||||
* the head) by one object. So, in essence, it will swap its position in
|
||||
* the list with its "prev" pointer. If the given object is already at the
|
||||
* head of the list, it cannot be moved forward any more than it already
|
||||
* is, so no action is taken.
|
||||
*
|
||||
* NOTE: This function **must not** remove any object from the list other
|
||||
* than the object given as the parameter. This is relied upon in
|
||||
* arc_evict_state_impl().
|
||||
*/
|
||||
void
|
||||
multilist_sublist_move_forward(multilist_sublist_t *mls, void *obj)
|
||||
{
|
||||
void *prev = list_prev(&mls->mls_list, obj);
|
||||
|
||||
ASSERT(MUTEX_HELD(&mls->mls_lock));
|
||||
ASSERT(!list_is_empty(&mls->mls_list));
|
||||
|
||||
/* 'obj' must be at the head of the list, nothing to do */
|
||||
if (prev == NULL)
|
||||
return;
|
||||
|
||||
list_remove(&mls->mls_list, obj);
|
||||
list_insert_before(&mls->mls_list, prev, obj);
|
||||
}
|
||||
|
||||
void
|
||||
multilist_sublist_remove(multilist_sublist_t *mls, void *obj)
|
||||
{
|
||||
ASSERT(MUTEX_HELD(&mls->mls_lock));
|
||||
list_remove(&mls->mls_list, obj);
|
||||
}
|
||||
|
||||
void *
|
||||
multilist_sublist_head(multilist_sublist_t *mls)
|
||||
{
|
||||
ASSERT(MUTEX_HELD(&mls->mls_lock));
|
||||
return (list_head(&mls->mls_list));
|
||||
}
|
||||
|
||||
void *
|
||||
multilist_sublist_tail(multilist_sublist_t *mls)
|
||||
{
|
||||
ASSERT(MUTEX_HELD(&mls->mls_lock));
|
||||
return (list_tail(&mls->mls_list));
|
||||
}
|
||||
|
||||
void *
|
||||
multilist_sublist_next(multilist_sublist_t *mls, void *obj)
|
||||
{
|
||||
ASSERT(MUTEX_HELD(&mls->mls_lock));
|
||||
return (list_next(&mls->mls_list, obj));
|
||||
}
|
||||
|
||||
void *
|
||||
multilist_sublist_prev(multilist_sublist_t *mls, void *obj)
|
||||
{
|
||||
ASSERT(MUTEX_HELD(&mls->mls_lock));
|
||||
return (list_prev(&mls->mls_list, obj));
|
||||
}
|
||||
|
||||
void
|
||||
multilist_link_init(multilist_node_t *link)
|
||||
{
|
||||
list_link_init(link);
|
||||
}
|
||||
|
||||
int
|
||||
multilist_link_active(multilist_node_t *link)
|
||||
{
|
||||
return (list_link_active(link));
|
||||
}
|
||||
@ -23,6 +23,7 @@
|
||||
* (and only one) C file, so this dummy file exists for that purpose.
|
||||
*/
|
||||
|
||||
#include <sys/multilist.h>
|
||||
#include <sys/arc_impl.h>
|
||||
#include <sys/vdev_impl.h>
|
||||
#include <sys/zio.h>
|
||||
@ -31,6 +32,7 @@
|
||||
#include <sys/dsl_dataset.h>
|
||||
#include <sys/dmu_tx.h>
|
||||
#include <sys/dnode.h>
|
||||
#include <sys/multilist.h>
|
||||
#include <sys/zfs_znode.h>
|
||||
#include <sys/zil_impl.h>
|
||||
#include <sys/zrlock.h>
|
||||
@ -42,6 +44,7 @@
|
||||
#include <sys/trace_dbuf.h>
|
||||
#include <sys/trace_dmu.h>
|
||||
#include <sys/trace_dnode.h>
|
||||
#include <sys/trace_multilist.h>
|
||||
#include <sys/trace_txg.h>
|
||||
#include <sys/trace_zil.h>
|
||||
#include <sys/trace_zrlock.h>
|
||||
|
||||
@ -439,7 +439,11 @@ zio_inject_fault(char *name, int flags, int *id, zinject_record_t *record)
|
||||
* fault injection isn't a performance critical path.
|
||||
*/
|
||||
if (flags & ZINJECT_FLUSH_ARC)
|
||||
arc_flush(NULL);
|
||||
/*
|
||||
* We must use FALSE to ensure arc_flush returns, since
|
||||
* we're not preventing concurrent ARC insertions.
|
||||
*/
|
||||
arc_flush(NULL, FALSE);
|
||||
|
||||
return (0);
|
||||
}
|
||||
|
||||
Loading…
Reference in New Issue
Block a user