4 * The contents of this file are subject to the terms of the
5 * Common Development and Distribution License (the "License").
6 * You may not use this file except in compliance with the License.
8 * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
9 * or http://www.opensolaris.org/os/licensing.
10 * See the License for the specific language governing permissions
11 * and limitations under the License.
13 * When distributing Covered Code, include this CDDL HEADER in each
14 * file and include the License file at usr/src/OPENSOLARIS.LICENSE.
15 * If applicable, add the following below this CDDL HEADER, with the
16 * fields enclosed by brackets "[]" replaced with your own identifying
17 * information: Portions Copyright [yyyy] [name of copyright owner]
22 * Copyright (c) 2005, 2010, Oracle and/or its affiliates. All rights reserved.
23 * Copyright 2011 Nexenta Systems, Inc. All rights reserved.
24 * Copyright (c) 2013 by Delphix. All rights reserved.
25 * Copyright (c) 2013 by Saso Kiselkov. All rights reserved.
29 * DVA-based Adjustable Replacement Cache
31 * While much of the theory of operation used here is
32 * based on the self-tuning, low overhead replacement cache
33 * presented by Megiddo and Modha at FAST 2003, there are some
34 * significant differences:
36 * 1. The Megiddo and Modha model assumes any page is evictable.
37 * Pages in its cache cannot be "locked" into memory. This makes
38 * the eviction algorithm simple: evict the last page in the list.
39 * This also make the performance characteristics easy to reason
40 * about. Our cache is not so simple. At any given moment, some
41 * subset of the blocks in the cache are un-evictable because we
42 * have handed out a reference to them. Blocks are only evictable
43 * when there are no external references active. This makes
44 * eviction far more problematic: we choose to evict the evictable
45 * blocks that are the "lowest" in the list.
47 * There are times when it is not possible to evict the requested
48 * space. In these circumstances we are unable to adjust the cache
49 * size. To prevent the cache growing unbounded at these times we
50 * implement a "cache throttle" that slows the flow of new data
51 * into the cache until we can make space available.
53 * 2. The Megiddo and Modha model assumes a fixed cache size.
54 * Pages are evicted when the cache is full and there is a cache
55 * miss. Our model has a variable sized cache. It grows with
56 * high use, but also tries to react to memory pressure from the
57 * operating system: decreasing its size when system memory is
60 * 3. The Megiddo and Modha model assumes a fixed page size. All
61 * elements of the cache are therefore exactly the same size. So
62 * when adjusting the cache size following a cache miss, its simply
63 * a matter of choosing a single page to evict. In our model, we
64 * have variable sized cache blocks (rangeing from 512 bytes to
65 * 128K bytes). We therefore choose a set of blocks to evict to make
66 * space for a cache miss that approximates as closely as possible
67 * the space used by the new block.
69 * See also: "ARC: A Self-Tuning, Low Overhead Replacement Cache"
70 * by N. Megiddo & D. Modha, FAST 2003
76 * A new reference to a cache buffer can be obtained in two
77 * ways: 1) via a hash table lookup using the DVA as a key,
78 * or 2) via one of the ARC lists. The arc_read() interface
79 * uses method 1, while the internal arc algorithms for
80 * adjusting the cache use method 2. We therefore provide two
81 * types of locks: 1) the hash table lock array, and 2) the
84 * Buffers do not have their own mutexes, rather they rely on the
85 * hash table mutexes for the bulk of their protection (i.e. most
86 * fields in the arc_buf_hdr_t are protected by these mutexes).
88 * buf_hash_find() returns the appropriate mutex (held) when it
89 * locates the requested buffer in the hash table. It returns
90 * NULL for the mutex if the buffer was not in the table.
92 * buf_hash_remove() expects the appropriate hash mutex to be
93 * already held before it is invoked.
95 * Each arc state also has a mutex which is used to protect the
96 * buffer list associated with the state. When attempting to
97 * obtain a hash table lock while holding an arc list lock you
98 * must use: mutex_tryenter() to avoid deadlock. Also note that
99 * the active state mutex must be held before the ghost state mutex.
101 * Arc buffers may have an associated eviction callback function.
102 * This function will be invoked prior to removing the buffer (e.g.
103 * in arc_do_user_evicts()). Note however that the data associated
104 * with the buffer may be evicted prior to the callback. The callback
105 * must be made with *no locks held* (to prevent deadlock). Additionally,
106 * the users of callbacks must ensure that their private data is
107 * protected from simultaneous callbacks from arc_buf_evict()
108 * and arc_do_user_evicts().
110 * It as also possible to register a callback which is run when the
111 * arc_meta_limit is reached and no buffers can be safely evicted. In
112 * this case the arc user should drop a reference on some arc buffers so
113 * they can be reclaimed and the arc_meta_limit honored. For example,
114 * when using the ZPL each dentry holds a references on a znode. These
115 * dentries must be pruned before the arc buffer holding the znode can
118 * Note that the majority of the performance stats are manipulated
119 * with atomic operations.
121 * The L2ARC uses the l2arc_buflist_mtx global mutex for the following:
123 * - L2ARC buflist creation
124 * - L2ARC buflist eviction
125 * - L2ARC write completion, which walks L2ARC buflists
126 * - ARC header destruction, as it removes from L2ARC buflists
127 * - ARC header release, as it removes from L2ARC buflists
132 #include <sys/zio_compress.h>
133 #include <sys/zfs_context.h>
135 #include <sys/vdev.h>
136 #include <sys/vdev_impl.h>
137 #include <sys/dsl_pool.h>
139 #include <sys/vmsystm.h>
141 #include <sys/fs/swapnode.h>
144 #include <sys/callb.h>
145 #include <sys/kstat.h>
146 #include <sys/dmu_tx.h>
147 #include <zfs_fletcher.h>
150 /* set with ZFS_DEBUG=watch, to enable watchpoints on frozen buffers */
151 boolean_t arc_watch
= B_FALSE
;
154 static kmutex_t arc_reclaim_thr_lock
;
155 static kcondvar_t arc_reclaim_thr_cv
; /* used to signal reclaim thr */
156 static uint8_t arc_thread_exit
;
158 /* number of bytes to prune from caches when at arc_meta_limit is reached */
159 int zfs_arc_meta_prune
= 1048576;
161 typedef enum arc_reclaim_strategy
{
162 ARC_RECLAIM_AGGR
, /* Aggressive reclaim strategy */
163 ARC_RECLAIM_CONS
/* Conservative reclaim strategy */
164 } arc_reclaim_strategy_t
;
167 * The number of iterations through arc_evict_*() before we
168 * drop & reacquire the lock.
170 int arc_evict_iterations
= 100;
172 /* number of seconds before growing cache again */
173 int zfs_arc_grow_retry
= 5;
175 /* shift of arc_c for calculating both min and max arc_p */
176 int zfs_arc_p_min_shift
= 4;
178 /* log2(fraction of arc to reclaim) */
179 int zfs_arc_shrink_shift
= 5;
182 * minimum lifespan of a prefetch block in clock ticks
183 * (initialized in arc_init())
185 int zfs_arc_min_prefetch_lifespan
= HZ
;
187 /* disable arc proactive arc throttle due to low memory */
188 int zfs_arc_memory_throttle_disable
= 1;
190 /* disable duplicate buffer eviction */
191 int zfs_disable_dup_eviction
= 0;
194 * If this percent of memory is free, don't throttle.
196 int arc_lotsfree_percent
= 10;
200 /* expiration time for arc_no_grow */
201 static clock_t arc_grow_time
= 0;
204 * The arc has filled available memory and has now warmed up.
206 static boolean_t arc_warm
;
209 * These tunables are for performance analysis.
211 unsigned long zfs_arc_max
= 0;
212 unsigned long zfs_arc_min
= 0;
213 unsigned long zfs_arc_meta_limit
= 0;
216 * Note that buffers can be in one of 6 states:
217 * ARC_anon - anonymous (discussed below)
218 * ARC_mru - recently used, currently cached
219 * ARC_mru_ghost - recentely used, no longer in cache
220 * ARC_mfu - frequently used, currently cached
221 * ARC_mfu_ghost - frequently used, no longer in cache
222 * ARC_l2c_only - exists in L2ARC but not other states
223 * When there are no active references to the buffer, they are
224 * are linked onto a list in one of these arc states. These are
225 * the only buffers that can be evicted or deleted. Within each
226 * state there are multiple lists, one for meta-data and one for
227 * non-meta-data. Meta-data (indirect blocks, blocks of dnodes,
228 * etc.) is tracked separately so that it can be managed more
229 * explicitly: favored over data, limited explicitly.
231 * Anonymous buffers are buffers that are not associated with
232 * a DVA. These are buffers that hold dirty block copies
233 * before they are written to stable storage. By definition,
234 * they are "ref'd" and are considered part of arc_mru
235 * that cannot be freed. Generally, they will aquire a DVA
236 * as they are written and migrate onto the arc_mru list.
238 * The ARC_l2c_only state is for buffers that are in the second
239 * level ARC but no longer in any of the ARC_m* lists. The second
240 * level ARC itself may also contain buffers that are in any of
241 * the ARC_m* states - meaning that a buffer can exist in two
242 * places. The reason for the ARC_l2c_only state is to keep the
243 * buffer header in the hash table, so that reads that hit the
244 * second level ARC benefit from these fast lookups.
247 typedef struct arc_state
{
248 list_t arcs_list
[ARC_BUFC_NUMTYPES
]; /* list of evictable buffers */
249 uint64_t arcs_lsize
[ARC_BUFC_NUMTYPES
]; /* amount of evictable data */
250 uint64_t arcs_size
; /* total amount of data in this state */
252 arc_state_type_t arcs_state
;
256 static arc_state_t ARC_anon
;
257 static arc_state_t ARC_mru
;
258 static arc_state_t ARC_mru_ghost
;
259 static arc_state_t ARC_mfu
;
260 static arc_state_t ARC_mfu_ghost
;
261 static arc_state_t ARC_l2c_only
;
263 typedef struct arc_stats
{
264 kstat_named_t arcstat_hits
;
265 kstat_named_t arcstat_misses
;
266 kstat_named_t arcstat_demand_data_hits
;
267 kstat_named_t arcstat_demand_data_misses
;
268 kstat_named_t arcstat_demand_metadata_hits
;
269 kstat_named_t arcstat_demand_metadata_misses
;
270 kstat_named_t arcstat_prefetch_data_hits
;
271 kstat_named_t arcstat_prefetch_data_misses
;
272 kstat_named_t arcstat_prefetch_metadata_hits
;
273 kstat_named_t arcstat_prefetch_metadata_misses
;
274 kstat_named_t arcstat_mru_hits
;
275 kstat_named_t arcstat_mru_ghost_hits
;
276 kstat_named_t arcstat_mfu_hits
;
277 kstat_named_t arcstat_mfu_ghost_hits
;
278 kstat_named_t arcstat_deleted
;
279 kstat_named_t arcstat_recycle_miss
;
281 * Number of buffers that could not be evicted because the hash lock
282 * was held by another thread. The lock may not necessarily be held
283 * by something using the same buffer, since hash locks are shared
284 * by multiple buffers.
286 kstat_named_t arcstat_mutex_miss
;
288 * Number of buffers skipped because they have I/O in progress, are
289 * indrect prefetch buffers that have not lived long enough, or are
290 * not from the spa we're trying to evict from.
292 kstat_named_t arcstat_evict_skip
;
293 kstat_named_t arcstat_evict_l2_cached
;
294 kstat_named_t arcstat_evict_l2_eligible
;
295 kstat_named_t arcstat_evict_l2_ineligible
;
296 kstat_named_t arcstat_hash_elements
;
297 kstat_named_t arcstat_hash_elements_max
;
298 kstat_named_t arcstat_hash_collisions
;
299 kstat_named_t arcstat_hash_chains
;
300 kstat_named_t arcstat_hash_chain_max
;
301 kstat_named_t arcstat_p
;
302 kstat_named_t arcstat_c
;
303 kstat_named_t arcstat_c_min
;
304 kstat_named_t arcstat_c_max
;
305 kstat_named_t arcstat_size
;
306 kstat_named_t arcstat_hdr_size
;
307 kstat_named_t arcstat_data_size
;
308 kstat_named_t arcstat_other_size
;
309 kstat_named_t arcstat_anon_size
;
310 kstat_named_t arcstat_anon_evict_data
;
311 kstat_named_t arcstat_anon_evict_metadata
;
312 kstat_named_t arcstat_mru_size
;
313 kstat_named_t arcstat_mru_evict_data
;
314 kstat_named_t arcstat_mru_evict_metadata
;
315 kstat_named_t arcstat_mru_ghost_size
;
316 kstat_named_t arcstat_mru_ghost_evict_data
;
317 kstat_named_t arcstat_mru_ghost_evict_metadata
;
318 kstat_named_t arcstat_mfu_size
;
319 kstat_named_t arcstat_mfu_evict_data
;
320 kstat_named_t arcstat_mfu_evict_metadata
;
321 kstat_named_t arcstat_mfu_ghost_size
;
322 kstat_named_t arcstat_mfu_ghost_evict_data
;
323 kstat_named_t arcstat_mfu_ghost_evict_metadata
;
324 kstat_named_t arcstat_l2_hits
;
325 kstat_named_t arcstat_l2_misses
;
326 kstat_named_t arcstat_l2_feeds
;
327 kstat_named_t arcstat_l2_rw_clash
;
328 kstat_named_t arcstat_l2_read_bytes
;
329 kstat_named_t arcstat_l2_write_bytes
;
330 kstat_named_t arcstat_l2_writes_sent
;
331 kstat_named_t arcstat_l2_writes_done
;
332 kstat_named_t arcstat_l2_writes_error
;
333 kstat_named_t arcstat_l2_writes_hdr_miss
;
334 kstat_named_t arcstat_l2_evict_lock_retry
;
335 kstat_named_t arcstat_l2_evict_reading
;
336 kstat_named_t arcstat_l2_free_on_write
;
337 kstat_named_t arcstat_l2_abort_lowmem
;
338 kstat_named_t arcstat_l2_cksum_bad
;
339 kstat_named_t arcstat_l2_io_error
;
340 kstat_named_t arcstat_l2_size
;
341 kstat_named_t arcstat_l2_asize
;
342 kstat_named_t arcstat_l2_hdr_size
;
343 kstat_named_t arcstat_l2_compress_successes
;
344 kstat_named_t arcstat_l2_compress_zeros
;
345 kstat_named_t arcstat_l2_compress_failures
;
346 kstat_named_t arcstat_memory_throttle_count
;
347 kstat_named_t arcstat_duplicate_buffers
;
348 kstat_named_t arcstat_duplicate_buffers_size
;
349 kstat_named_t arcstat_duplicate_reads
;
350 kstat_named_t arcstat_memory_direct_count
;
351 kstat_named_t arcstat_memory_indirect_count
;
352 kstat_named_t arcstat_no_grow
;
353 kstat_named_t arcstat_tempreserve
;
354 kstat_named_t arcstat_loaned_bytes
;
355 kstat_named_t arcstat_prune
;
356 kstat_named_t arcstat_meta_used
;
357 kstat_named_t arcstat_meta_limit
;
358 kstat_named_t arcstat_meta_max
;
361 static arc_stats_t arc_stats
= {
362 { "hits", KSTAT_DATA_UINT64
},
363 { "misses", KSTAT_DATA_UINT64
},
364 { "demand_data_hits", KSTAT_DATA_UINT64
},
365 { "demand_data_misses", KSTAT_DATA_UINT64
},
366 { "demand_metadata_hits", KSTAT_DATA_UINT64
},
367 { "demand_metadata_misses", KSTAT_DATA_UINT64
},
368 { "prefetch_data_hits", KSTAT_DATA_UINT64
},
369 { "prefetch_data_misses", KSTAT_DATA_UINT64
},
370 { "prefetch_metadata_hits", KSTAT_DATA_UINT64
},
371 { "prefetch_metadata_misses", KSTAT_DATA_UINT64
},
372 { "mru_hits", KSTAT_DATA_UINT64
},
373 { "mru_ghost_hits", KSTAT_DATA_UINT64
},
374 { "mfu_hits", KSTAT_DATA_UINT64
},
375 { "mfu_ghost_hits", KSTAT_DATA_UINT64
},
376 { "deleted", KSTAT_DATA_UINT64
},
377 { "recycle_miss", KSTAT_DATA_UINT64
},
378 { "mutex_miss", KSTAT_DATA_UINT64
},
379 { "evict_skip", KSTAT_DATA_UINT64
},
380 { "evict_l2_cached", KSTAT_DATA_UINT64
},
381 { "evict_l2_eligible", KSTAT_DATA_UINT64
},
382 { "evict_l2_ineligible", KSTAT_DATA_UINT64
},
383 { "hash_elements", KSTAT_DATA_UINT64
},
384 { "hash_elements_max", KSTAT_DATA_UINT64
},
385 { "hash_collisions", KSTAT_DATA_UINT64
},
386 { "hash_chains", KSTAT_DATA_UINT64
},
387 { "hash_chain_max", KSTAT_DATA_UINT64
},
388 { "p", KSTAT_DATA_UINT64
},
389 { "c", KSTAT_DATA_UINT64
},
390 { "c_min", KSTAT_DATA_UINT64
},
391 { "c_max", KSTAT_DATA_UINT64
},
392 { "size", KSTAT_DATA_UINT64
},
393 { "hdr_size", KSTAT_DATA_UINT64
},
394 { "data_size", KSTAT_DATA_UINT64
},
395 { "other_size", KSTAT_DATA_UINT64
},
396 { "anon_size", KSTAT_DATA_UINT64
},
397 { "anon_evict_data", KSTAT_DATA_UINT64
},
398 { "anon_evict_metadata", KSTAT_DATA_UINT64
},
399 { "mru_size", KSTAT_DATA_UINT64
},
400 { "mru_evict_data", KSTAT_DATA_UINT64
},
401 { "mru_evict_metadata", KSTAT_DATA_UINT64
},
402 { "mru_ghost_size", KSTAT_DATA_UINT64
},
403 { "mru_ghost_evict_data", KSTAT_DATA_UINT64
},
404 { "mru_ghost_evict_metadata", KSTAT_DATA_UINT64
},
405 { "mfu_size", KSTAT_DATA_UINT64
},
406 { "mfu_evict_data", KSTAT_DATA_UINT64
},
407 { "mfu_evict_metadata", KSTAT_DATA_UINT64
},
408 { "mfu_ghost_size", KSTAT_DATA_UINT64
},
409 { "mfu_ghost_evict_data", KSTAT_DATA_UINT64
},
410 { "mfu_ghost_evict_metadata", KSTAT_DATA_UINT64
},
411 { "l2_hits", KSTAT_DATA_UINT64
},
412 { "l2_misses", KSTAT_DATA_UINT64
},
413 { "l2_feeds", KSTAT_DATA_UINT64
},
414 { "l2_rw_clash", KSTAT_DATA_UINT64
},
415 { "l2_read_bytes", KSTAT_DATA_UINT64
},
416 { "l2_write_bytes", KSTAT_DATA_UINT64
},
417 { "l2_writes_sent", KSTAT_DATA_UINT64
},
418 { "l2_writes_done", KSTAT_DATA_UINT64
},
419 { "l2_writes_error", KSTAT_DATA_UINT64
},
420 { "l2_writes_hdr_miss", KSTAT_DATA_UINT64
},
421 { "l2_evict_lock_retry", KSTAT_DATA_UINT64
},
422 { "l2_evict_reading", KSTAT_DATA_UINT64
},
423 { "l2_free_on_write", KSTAT_DATA_UINT64
},
424 { "l2_abort_lowmem", KSTAT_DATA_UINT64
},
425 { "l2_cksum_bad", KSTAT_DATA_UINT64
},
426 { "l2_io_error", KSTAT_DATA_UINT64
},
427 { "l2_size", KSTAT_DATA_UINT64
},
428 { "l2_asize", KSTAT_DATA_UINT64
},
429 { "l2_hdr_size", KSTAT_DATA_UINT64
},
430 { "l2_compress_successes", KSTAT_DATA_UINT64
},
431 { "l2_compress_zeros", KSTAT_DATA_UINT64
},
432 { "l2_compress_failures", KSTAT_DATA_UINT64
},
433 { "memory_throttle_count", KSTAT_DATA_UINT64
},
434 { "duplicate_buffers", KSTAT_DATA_UINT64
},
435 { "duplicate_buffers_size", KSTAT_DATA_UINT64
},
436 { "duplicate_reads", KSTAT_DATA_UINT64
},
437 { "memory_direct_count", KSTAT_DATA_UINT64
},
438 { "memory_indirect_count", KSTAT_DATA_UINT64
},
439 { "arc_no_grow", KSTAT_DATA_UINT64
},
440 { "arc_tempreserve", KSTAT_DATA_UINT64
},
441 { "arc_loaned_bytes", KSTAT_DATA_UINT64
},
442 { "arc_prune", KSTAT_DATA_UINT64
},
443 { "arc_meta_used", KSTAT_DATA_UINT64
},
444 { "arc_meta_limit", KSTAT_DATA_UINT64
},
445 { "arc_meta_max", KSTAT_DATA_UINT64
},
448 #define ARCSTAT(stat) (arc_stats.stat.value.ui64)
450 #define ARCSTAT_INCR(stat, val) \
451 atomic_add_64(&arc_stats.stat.value.ui64, (val))
453 #define ARCSTAT_BUMP(stat) ARCSTAT_INCR(stat, 1)
454 #define ARCSTAT_BUMPDOWN(stat) ARCSTAT_INCR(stat, -1)
456 #define ARCSTAT_MAX(stat, val) { \
458 while ((val) > (m = arc_stats.stat.value.ui64) && \
459 (m != atomic_cas_64(&arc_stats.stat.value.ui64, m, (val)))) \
463 #define ARCSTAT_MAXSTAT(stat) \
464 ARCSTAT_MAX(stat##_max, arc_stats.stat.value.ui64)
467 * We define a macro to allow ARC hits/misses to be easily broken down by
468 * two separate conditions, giving a total of four different subtypes for
469 * each of hits and misses (so eight statistics total).
471 #define ARCSTAT_CONDSTAT(cond1, stat1, notstat1, cond2, stat2, notstat2, stat) \
474 ARCSTAT_BUMP(arcstat_##stat1##_##stat2##_##stat); \
476 ARCSTAT_BUMP(arcstat_##stat1##_##notstat2##_##stat); \
480 ARCSTAT_BUMP(arcstat_##notstat1##_##stat2##_##stat); \
482 ARCSTAT_BUMP(arcstat_##notstat1##_##notstat2##_##stat);\
487 static arc_state_t
*arc_anon
;
488 static arc_state_t
*arc_mru
;
489 static arc_state_t
*arc_mru_ghost
;
490 static arc_state_t
*arc_mfu
;
491 static arc_state_t
*arc_mfu_ghost
;
492 static arc_state_t
*arc_l2c_only
;
495 * There are several ARC variables that are critical to export as kstats --
496 * but we don't want to have to grovel around in the kstat whenever we wish to
497 * manipulate them. For these variables, we therefore define them to be in
498 * terms of the statistic variable. This assures that we are not introducing
499 * the possibility of inconsistency by having shadow copies of the variables,
500 * while still allowing the code to be readable.
502 #define arc_size ARCSTAT(arcstat_size) /* actual total arc size */
503 #define arc_p ARCSTAT(arcstat_p) /* target size of MRU */
504 #define arc_c ARCSTAT(arcstat_c) /* target size of cache */
505 #define arc_c_min ARCSTAT(arcstat_c_min) /* min target cache size */
506 #define arc_c_max ARCSTAT(arcstat_c_max) /* max target cache size */
507 #define arc_no_grow ARCSTAT(arcstat_no_grow)
508 #define arc_tempreserve ARCSTAT(arcstat_tempreserve)
509 #define arc_loaned_bytes ARCSTAT(arcstat_loaned_bytes)
510 #define arc_meta_limit ARCSTAT(arcstat_meta_limit) /* max size for metadata */
511 #define arc_meta_used ARCSTAT(arcstat_meta_used) /* size of metadata */
512 #define arc_meta_max ARCSTAT(arcstat_meta_max) /* max size of metadata */
514 #define L2ARC_IS_VALID_COMPRESS(_c_) \
515 ((_c_) == ZIO_COMPRESS_LZ4 || (_c_) == ZIO_COMPRESS_EMPTY)
517 typedef struct l2arc_buf_hdr l2arc_buf_hdr_t
;
519 typedef struct arc_callback arc_callback_t
;
521 struct arc_callback
{
523 arc_done_func_t
*acb_done
;
525 zio_t
*acb_zio_dummy
;
526 arc_callback_t
*acb_next
;
529 typedef struct arc_write_callback arc_write_callback_t
;
531 struct arc_write_callback
{
533 arc_done_func_t
*awcb_ready
;
534 arc_done_func_t
*awcb_physdone
;
535 arc_done_func_t
*awcb_done
;
540 /* protected by hash lock */
545 kmutex_t b_freeze_lock
;
546 zio_cksum_t
*b_freeze_cksum
;
548 arc_buf_hdr_t
*b_hash_next
;
553 arc_callback_t
*b_acb
;
557 arc_buf_contents_t b_type
;
561 /* protected by arc state mutex */
562 arc_state_t
*b_state
;
563 list_node_t b_arc_node
;
565 /* updated atomically */
566 clock_t b_arc_access
;
568 uint32_t b_mru_ghost_hits
;
570 uint32_t b_mfu_ghost_hits
;
573 /* self protecting */
576 l2arc_buf_hdr_t
*b_l2hdr
;
577 list_node_t b_l2node
;
580 static list_t arc_prune_list
;
581 static kmutex_t arc_prune_mtx
;
582 static arc_buf_t
*arc_eviction_list
;
583 static kmutex_t arc_eviction_mtx
;
584 static arc_buf_hdr_t arc_eviction_hdr
;
585 static void arc_get_data_buf(arc_buf_t
*buf
);
586 static void arc_access(arc_buf_hdr_t
*buf
, kmutex_t
*hash_lock
);
587 static int arc_evict_needed(arc_buf_contents_t type
);
588 static void arc_evict_ghost(arc_state_t
*state
, uint64_t spa
, int64_t bytes
,
589 arc_buf_contents_t type
);
590 static void arc_buf_watch(arc_buf_t
*buf
);
592 static boolean_t
l2arc_write_eligible(uint64_t spa_guid
, arc_buf_hdr_t
*ab
);
594 #define GHOST_STATE(state) \
595 ((state) == arc_mru_ghost || (state) == arc_mfu_ghost || \
596 (state) == arc_l2c_only)
599 * Private ARC flags. These flags are private ARC only flags that will show up
600 * in b_flags in the arc_hdr_buf_t. Some flags are publicly declared, and can
601 * be passed in as arc_flags in things like arc_read. However, these flags
602 * should never be passed and should only be set by ARC code. When adding new
603 * public flags, make sure not to smash the private ones.
606 #define ARC_IN_HASH_TABLE (1 << 9) /* this buffer is hashed */
607 #define ARC_IO_IN_PROGRESS (1 << 10) /* I/O in progress for buf */
608 #define ARC_IO_ERROR (1 << 11) /* I/O failed for buf */
609 #define ARC_FREED_IN_READ (1 << 12) /* buf freed while in read */
610 #define ARC_BUF_AVAILABLE (1 << 13) /* block not in active use */
611 #define ARC_INDIRECT (1 << 14) /* this is an indirect block */
612 #define ARC_FREE_IN_PROGRESS (1 << 15) /* hdr about to be freed */
613 #define ARC_L2_WRITING (1 << 16) /* L2ARC write in progress */
614 #define ARC_L2_EVICTED (1 << 17) /* evicted during I/O */
615 #define ARC_L2_WRITE_HEAD (1 << 18) /* head of write list */
617 #define HDR_IN_HASH_TABLE(hdr) ((hdr)->b_flags & ARC_IN_HASH_TABLE)
618 #define HDR_IO_IN_PROGRESS(hdr) ((hdr)->b_flags & ARC_IO_IN_PROGRESS)
619 #define HDR_IO_ERROR(hdr) ((hdr)->b_flags & ARC_IO_ERROR)
620 #define HDR_PREFETCH(hdr) ((hdr)->b_flags & ARC_PREFETCH)
621 #define HDR_FREED_IN_READ(hdr) ((hdr)->b_flags & ARC_FREED_IN_READ)
622 #define HDR_BUF_AVAILABLE(hdr) ((hdr)->b_flags & ARC_BUF_AVAILABLE)
623 #define HDR_FREE_IN_PROGRESS(hdr) ((hdr)->b_flags & ARC_FREE_IN_PROGRESS)
624 #define HDR_L2CACHE(hdr) ((hdr)->b_flags & ARC_L2CACHE)
625 #define HDR_L2_READING(hdr) ((hdr)->b_flags & ARC_IO_IN_PROGRESS && \
626 (hdr)->b_l2hdr != NULL)
627 #define HDR_L2_WRITING(hdr) ((hdr)->b_flags & ARC_L2_WRITING)
628 #define HDR_L2_EVICTED(hdr) ((hdr)->b_flags & ARC_L2_EVICTED)
629 #define HDR_L2_WRITE_HEAD(hdr) ((hdr)->b_flags & ARC_L2_WRITE_HEAD)
635 #define HDR_SIZE ((int64_t)sizeof (arc_buf_hdr_t))
636 #define L2HDR_SIZE ((int64_t)sizeof (l2arc_buf_hdr_t))
639 * Hash table routines
642 #define HT_LOCK_ALIGN 64
643 #define HT_LOCK_PAD (P2NPHASE(sizeof (kmutex_t), (HT_LOCK_ALIGN)))
648 unsigned char pad
[HT_LOCK_PAD
];
652 #define BUF_LOCKS 256
653 typedef struct buf_hash_table
{
655 arc_buf_hdr_t
**ht_table
;
656 struct ht_lock ht_locks
[BUF_LOCKS
];
659 static buf_hash_table_t buf_hash_table
;
661 #define BUF_HASH_INDEX(spa, dva, birth) \
662 (buf_hash(spa, dva, birth) & buf_hash_table.ht_mask)
663 #define BUF_HASH_LOCK_NTRY(idx) (buf_hash_table.ht_locks[idx & (BUF_LOCKS-1)])
664 #define BUF_HASH_LOCK(idx) (&(BUF_HASH_LOCK_NTRY(idx).ht_lock))
665 #define HDR_LOCK(hdr) \
666 (BUF_HASH_LOCK(BUF_HASH_INDEX(hdr->b_spa, &hdr->b_dva, hdr->b_birth)))
668 uint64_t zfs_crc64_table
[256];
674 #define L2ARC_WRITE_SIZE (8 * 1024 * 1024) /* initial write max */
675 #define L2ARC_HEADROOM 2 /* num of writes */
677 * If we discover during ARC scan any buffers to be compressed, we boost
678 * our headroom for the next scanning cycle by this percentage multiple.
680 #define L2ARC_HEADROOM_BOOST 200
681 #define L2ARC_FEED_SECS 1 /* caching interval secs */
682 #define L2ARC_FEED_MIN_MS 200 /* min caching interval ms */
684 #define l2arc_writes_sent ARCSTAT(arcstat_l2_writes_sent)
685 #define l2arc_writes_done ARCSTAT(arcstat_l2_writes_done)
687 /* L2ARC Performance Tunables */
688 unsigned long l2arc_write_max
= L2ARC_WRITE_SIZE
; /* def max write size */
689 unsigned long l2arc_write_boost
= L2ARC_WRITE_SIZE
; /* extra warmup write */
690 unsigned long l2arc_headroom
= L2ARC_HEADROOM
; /* # of dev writes */
691 unsigned long l2arc_headroom_boost
= L2ARC_HEADROOM_BOOST
;
692 unsigned long l2arc_feed_secs
= L2ARC_FEED_SECS
; /* interval seconds */
693 unsigned long l2arc_feed_min_ms
= L2ARC_FEED_MIN_MS
; /* min interval msecs */
694 int l2arc_noprefetch
= B_TRUE
; /* don't cache prefetch bufs */
695 int l2arc_nocompress
= B_FALSE
; /* don't compress bufs */
696 int l2arc_feed_again
= B_TRUE
; /* turbo warmup */
697 int l2arc_norw
= B_FALSE
; /* no reads during writes */
702 typedef struct l2arc_dev
{
703 vdev_t
*l2ad_vdev
; /* vdev */
704 spa_t
*l2ad_spa
; /* spa */
705 uint64_t l2ad_hand
; /* next write location */
706 uint64_t l2ad_start
; /* first addr on device */
707 uint64_t l2ad_end
; /* last addr on device */
708 uint64_t l2ad_evict
; /* last addr eviction reached */
709 boolean_t l2ad_first
; /* first sweep through */
710 boolean_t l2ad_writing
; /* currently writing */
711 list_t
*l2ad_buflist
; /* buffer list */
712 list_node_t l2ad_node
; /* device list node */
715 static list_t L2ARC_dev_list
; /* device list */
716 static list_t
*l2arc_dev_list
; /* device list pointer */
717 static kmutex_t l2arc_dev_mtx
; /* device list mutex */
718 static l2arc_dev_t
*l2arc_dev_last
; /* last device used */
719 static kmutex_t l2arc_buflist_mtx
; /* mutex for all buflists */
720 static list_t L2ARC_free_on_write
; /* free after write buf list */
721 static list_t
*l2arc_free_on_write
; /* free after write list ptr */
722 static kmutex_t l2arc_free_on_write_mtx
; /* mutex for list */
723 static uint64_t l2arc_ndev
; /* number of devices */
725 typedef struct l2arc_read_callback
{
726 arc_buf_t
*l2rcb_buf
; /* read buffer */
727 spa_t
*l2rcb_spa
; /* spa */
728 blkptr_t l2rcb_bp
; /* original blkptr */
729 zbookmark_t l2rcb_zb
; /* original bookmark */
730 int l2rcb_flags
; /* original flags */
731 enum zio_compress l2rcb_compress
; /* applied compress */
732 } l2arc_read_callback_t
;
734 typedef struct l2arc_write_callback
{
735 l2arc_dev_t
*l2wcb_dev
; /* device info */
736 arc_buf_hdr_t
*l2wcb_head
; /* head of write buflist */
737 } l2arc_write_callback_t
;
739 struct l2arc_buf_hdr
{
740 /* protected by arc_buf_hdr mutex */
741 l2arc_dev_t
*b_dev
; /* L2ARC device */
742 uint64_t b_daddr
; /* disk address, offset byte */
743 /* compression applied to buffer data */
744 enum zio_compress b_compress
;
745 /* real alloc'd buffer size depending on b_compress applied */
748 /* temporary buffer holder for in-flight compressed data */
752 typedef struct l2arc_data_free
{
753 /* protected by l2arc_free_on_write_mtx */
756 void (*l2df_func
)(void *, size_t);
757 list_node_t l2df_list_node
;
760 static kmutex_t l2arc_feed_thr_lock
;
761 static kcondvar_t l2arc_feed_thr_cv
;
762 static uint8_t l2arc_thread_exit
;
764 static void l2arc_read_done(zio_t
*zio
);
765 static void l2arc_hdr_stat_add(void);
766 static void l2arc_hdr_stat_remove(void);
768 static boolean_t
l2arc_compress_buf(l2arc_buf_hdr_t
*l2hdr
);
769 static void l2arc_decompress_zio(zio_t
*zio
, arc_buf_hdr_t
*hdr
,
770 enum zio_compress c
);
771 static void l2arc_release_cdata_buf(arc_buf_hdr_t
*ab
);
774 buf_hash(uint64_t spa
, const dva_t
*dva
, uint64_t birth
)
776 uint8_t *vdva
= (uint8_t *)dva
;
777 uint64_t crc
= -1ULL;
780 ASSERT(zfs_crc64_table
[128] == ZFS_CRC64_POLY
);
782 for (i
= 0; i
< sizeof (dva_t
); i
++)
783 crc
= (crc
>> 8) ^ zfs_crc64_table
[(crc
^ vdva
[i
]) & 0xFF];
785 crc
^= (spa
>>8) ^ birth
;
790 #define BUF_EMPTY(buf) \
791 ((buf)->b_dva.dva_word[0] == 0 && \
792 (buf)->b_dva.dva_word[1] == 0 && \
795 #define BUF_EQUAL(spa, dva, birth, buf) \
796 ((buf)->b_dva.dva_word[0] == (dva)->dva_word[0]) && \
797 ((buf)->b_dva.dva_word[1] == (dva)->dva_word[1]) && \
798 ((buf)->b_birth == birth) && ((buf)->b_spa == spa)
801 buf_discard_identity(arc_buf_hdr_t
*hdr
)
803 hdr
->b_dva
.dva_word
[0] = 0;
804 hdr
->b_dva
.dva_word
[1] = 0;
809 static arc_buf_hdr_t
*
810 buf_hash_find(uint64_t spa
, const dva_t
*dva
, uint64_t birth
, kmutex_t
**lockp
)
812 uint64_t idx
= BUF_HASH_INDEX(spa
, dva
, birth
);
813 kmutex_t
*hash_lock
= BUF_HASH_LOCK(idx
);
816 mutex_enter(hash_lock
);
817 for (buf
= buf_hash_table
.ht_table
[idx
]; buf
!= NULL
;
818 buf
= buf
->b_hash_next
) {
819 if (BUF_EQUAL(spa
, dva
, birth
, buf
)) {
824 mutex_exit(hash_lock
);
830 * Insert an entry into the hash table. If there is already an element
831 * equal to elem in the hash table, then the already existing element
832 * will be returned and the new element will not be inserted.
833 * Otherwise returns NULL.
835 static arc_buf_hdr_t
*
836 buf_hash_insert(arc_buf_hdr_t
*buf
, kmutex_t
**lockp
)
838 uint64_t idx
= BUF_HASH_INDEX(buf
->b_spa
, &buf
->b_dva
, buf
->b_birth
);
839 kmutex_t
*hash_lock
= BUF_HASH_LOCK(idx
);
843 ASSERT(!HDR_IN_HASH_TABLE(buf
));
845 mutex_enter(hash_lock
);
846 for (fbuf
= buf_hash_table
.ht_table
[idx
], i
= 0; fbuf
!= NULL
;
847 fbuf
= fbuf
->b_hash_next
, i
++) {
848 if (BUF_EQUAL(buf
->b_spa
, &buf
->b_dva
, buf
->b_birth
, fbuf
))
852 buf
->b_hash_next
= buf_hash_table
.ht_table
[idx
];
853 buf_hash_table
.ht_table
[idx
] = buf
;
854 buf
->b_flags
|= ARC_IN_HASH_TABLE
;
856 /* collect some hash table performance data */
858 ARCSTAT_BUMP(arcstat_hash_collisions
);
860 ARCSTAT_BUMP(arcstat_hash_chains
);
862 ARCSTAT_MAX(arcstat_hash_chain_max
, i
);
865 ARCSTAT_BUMP(arcstat_hash_elements
);
866 ARCSTAT_MAXSTAT(arcstat_hash_elements
);
872 buf_hash_remove(arc_buf_hdr_t
*buf
)
874 arc_buf_hdr_t
*fbuf
, **bufp
;
875 uint64_t idx
= BUF_HASH_INDEX(buf
->b_spa
, &buf
->b_dva
, buf
->b_birth
);
877 ASSERT(MUTEX_HELD(BUF_HASH_LOCK(idx
)));
878 ASSERT(HDR_IN_HASH_TABLE(buf
));
880 bufp
= &buf_hash_table
.ht_table
[idx
];
881 while ((fbuf
= *bufp
) != buf
) {
882 ASSERT(fbuf
!= NULL
);
883 bufp
= &fbuf
->b_hash_next
;
885 *bufp
= buf
->b_hash_next
;
886 buf
->b_hash_next
= NULL
;
887 buf
->b_flags
&= ~ARC_IN_HASH_TABLE
;
889 /* collect some hash table performance data */
890 ARCSTAT_BUMPDOWN(arcstat_hash_elements
);
892 if (buf_hash_table
.ht_table
[idx
] &&
893 buf_hash_table
.ht_table
[idx
]->b_hash_next
== NULL
)
894 ARCSTAT_BUMPDOWN(arcstat_hash_chains
);
898 * Global data structures and functions for the buf kmem cache.
900 static kmem_cache_t
*hdr_cache
;
901 static kmem_cache_t
*buf_cache
;
908 #if defined(_KERNEL) && defined(HAVE_SPL)
910 * Large allocations which do not require contiguous pages
911 * should be using vmem_free() in the linux kernel\
913 vmem_free(buf_hash_table
.ht_table
,
914 (buf_hash_table
.ht_mask
+ 1) * sizeof (void *));
916 kmem_free(buf_hash_table
.ht_table
,
917 (buf_hash_table
.ht_mask
+ 1) * sizeof (void *));
919 for (i
= 0; i
< BUF_LOCKS
; i
++)
920 mutex_destroy(&buf_hash_table
.ht_locks
[i
].ht_lock
);
921 kmem_cache_destroy(hdr_cache
);
922 kmem_cache_destroy(buf_cache
);
926 * Constructor callback - called when the cache is empty
927 * and a new buf is requested.
931 hdr_cons(void *vbuf
, void *unused
, int kmflag
)
933 arc_buf_hdr_t
*buf
= vbuf
;
935 bzero(buf
, sizeof (arc_buf_hdr_t
));
936 refcount_create(&buf
->b_refcnt
);
937 cv_init(&buf
->b_cv
, NULL
, CV_DEFAULT
, NULL
);
938 mutex_init(&buf
->b_freeze_lock
, NULL
, MUTEX_DEFAULT
, NULL
);
939 list_link_init(&buf
->b_arc_node
);
940 list_link_init(&buf
->b_l2node
);
941 arc_space_consume(sizeof (arc_buf_hdr_t
), ARC_SPACE_HDRS
);
948 buf_cons(void *vbuf
, void *unused
, int kmflag
)
950 arc_buf_t
*buf
= vbuf
;
952 bzero(buf
, sizeof (arc_buf_t
));
953 mutex_init(&buf
->b_evict_lock
, NULL
, MUTEX_DEFAULT
, NULL
);
954 arc_space_consume(sizeof (arc_buf_t
), ARC_SPACE_HDRS
);
960 * Destructor callback - called when a cached buf is
961 * no longer required.
965 hdr_dest(void *vbuf
, void *unused
)
967 arc_buf_hdr_t
*buf
= vbuf
;
969 ASSERT(BUF_EMPTY(buf
));
970 refcount_destroy(&buf
->b_refcnt
);
971 cv_destroy(&buf
->b_cv
);
972 mutex_destroy(&buf
->b_freeze_lock
);
973 arc_space_return(sizeof (arc_buf_hdr_t
), ARC_SPACE_HDRS
);
978 buf_dest(void *vbuf
, void *unused
)
980 arc_buf_t
*buf
= vbuf
;
982 mutex_destroy(&buf
->b_evict_lock
);
983 arc_space_return(sizeof (arc_buf_t
), ARC_SPACE_HDRS
);
990 uint64_t hsize
= 1ULL << 12;
994 * The hash table is big enough to fill all of physical memory
995 * with an average 64K block size. The table will take up
996 * totalmem*sizeof(void*)/64K (eg. 128KB/GB with 8-byte pointers).
998 while (hsize
* 65536 < physmem
* PAGESIZE
)
1001 buf_hash_table
.ht_mask
= hsize
- 1;
1002 #if defined(_KERNEL) && defined(HAVE_SPL)
1004 * Large allocations which do not require contiguous pages
1005 * should be using vmem_alloc() in the linux kernel
1007 buf_hash_table
.ht_table
=
1008 vmem_zalloc(hsize
* sizeof (void*), KM_SLEEP
);
1010 buf_hash_table
.ht_table
=
1011 kmem_zalloc(hsize
* sizeof (void*), KM_NOSLEEP
);
1013 if (buf_hash_table
.ht_table
== NULL
) {
1014 ASSERT(hsize
> (1ULL << 8));
1019 hdr_cache
= kmem_cache_create("arc_buf_hdr_t", sizeof (arc_buf_hdr_t
),
1020 0, hdr_cons
, hdr_dest
, NULL
, NULL
, NULL
, 0);
1021 buf_cache
= kmem_cache_create("arc_buf_t", sizeof (arc_buf_t
),
1022 0, buf_cons
, buf_dest
, NULL
, NULL
, NULL
, 0);
1024 for (i
= 0; i
< 256; i
++)
1025 for (ct
= zfs_crc64_table
+ i
, *ct
= i
, j
= 8; j
> 0; j
--)
1026 *ct
= (*ct
>> 1) ^ (-(*ct
& 1) & ZFS_CRC64_POLY
);
1028 for (i
= 0; i
< BUF_LOCKS
; i
++) {
1029 mutex_init(&buf_hash_table
.ht_locks
[i
].ht_lock
,
1030 NULL
, MUTEX_DEFAULT
, NULL
);
1034 #define ARC_MINTIME (hz>>4) /* 62 ms */
1037 arc_cksum_verify(arc_buf_t
*buf
)
1041 if (!(zfs_flags
& ZFS_DEBUG_MODIFY
))
1044 mutex_enter(&buf
->b_hdr
->b_freeze_lock
);
1045 if (buf
->b_hdr
->b_freeze_cksum
== NULL
||
1046 (buf
->b_hdr
->b_flags
& ARC_IO_ERROR
)) {
1047 mutex_exit(&buf
->b_hdr
->b_freeze_lock
);
1050 fletcher_2_native(buf
->b_data
, buf
->b_hdr
->b_size
, &zc
);
1051 if (!ZIO_CHECKSUM_EQUAL(*buf
->b_hdr
->b_freeze_cksum
, zc
))
1052 panic("buffer modified while frozen!");
1053 mutex_exit(&buf
->b_hdr
->b_freeze_lock
);
1057 arc_cksum_equal(arc_buf_t
*buf
)
1062 mutex_enter(&buf
->b_hdr
->b_freeze_lock
);
1063 fletcher_2_native(buf
->b_data
, buf
->b_hdr
->b_size
, &zc
);
1064 equal
= ZIO_CHECKSUM_EQUAL(*buf
->b_hdr
->b_freeze_cksum
, zc
);
1065 mutex_exit(&buf
->b_hdr
->b_freeze_lock
);
1071 arc_cksum_compute(arc_buf_t
*buf
, boolean_t force
)
1073 if (!force
&& !(zfs_flags
& ZFS_DEBUG_MODIFY
))
1076 mutex_enter(&buf
->b_hdr
->b_freeze_lock
);
1077 if (buf
->b_hdr
->b_freeze_cksum
!= NULL
) {
1078 mutex_exit(&buf
->b_hdr
->b_freeze_lock
);
1081 buf
->b_hdr
->b_freeze_cksum
= kmem_alloc(sizeof (zio_cksum_t
),
1083 fletcher_2_native(buf
->b_data
, buf
->b_hdr
->b_size
,
1084 buf
->b_hdr
->b_freeze_cksum
);
1085 mutex_exit(&buf
->b_hdr
->b_freeze_lock
);
1091 arc_buf_sigsegv(int sig
, siginfo_t
*si
, void *unused
)
1093 panic("Got SIGSEGV at address: 0x%lx\n", (long) si
->si_addr
);
1099 arc_buf_unwatch(arc_buf_t
*buf
)
1103 ASSERT0(mprotect(buf
->b_data
, buf
->b_hdr
->b_size
,
1104 PROT_READ
| PROT_WRITE
));
1111 arc_buf_watch(arc_buf_t
*buf
)
1115 ASSERT0(mprotect(buf
->b_data
, buf
->b_hdr
->b_size
, PROT_READ
));
1120 arc_buf_thaw(arc_buf_t
*buf
)
1122 if (zfs_flags
& ZFS_DEBUG_MODIFY
) {
1123 if (buf
->b_hdr
->b_state
!= arc_anon
)
1124 panic("modifying non-anon buffer!");
1125 if (buf
->b_hdr
->b_flags
& ARC_IO_IN_PROGRESS
)
1126 panic("modifying buffer while i/o in progress!");
1127 arc_cksum_verify(buf
);
1130 mutex_enter(&buf
->b_hdr
->b_freeze_lock
);
1131 if (buf
->b_hdr
->b_freeze_cksum
!= NULL
) {
1132 kmem_free(buf
->b_hdr
->b_freeze_cksum
, sizeof (zio_cksum_t
));
1133 buf
->b_hdr
->b_freeze_cksum
= NULL
;
1136 mutex_exit(&buf
->b_hdr
->b_freeze_lock
);
1138 arc_buf_unwatch(buf
);
1142 arc_buf_freeze(arc_buf_t
*buf
)
1144 kmutex_t
*hash_lock
;
1146 if (!(zfs_flags
& ZFS_DEBUG_MODIFY
))
1149 hash_lock
= HDR_LOCK(buf
->b_hdr
);
1150 mutex_enter(hash_lock
);
1152 ASSERT(buf
->b_hdr
->b_freeze_cksum
!= NULL
||
1153 buf
->b_hdr
->b_state
== arc_anon
);
1154 arc_cksum_compute(buf
, B_FALSE
);
1155 mutex_exit(hash_lock
);
1160 add_reference(arc_buf_hdr_t
*ab
, kmutex_t
*hash_lock
, void *tag
)
1162 ASSERT(MUTEX_HELD(hash_lock
));
1164 if ((refcount_add(&ab
->b_refcnt
, tag
) == 1) &&
1165 (ab
->b_state
!= arc_anon
)) {
1166 uint64_t delta
= ab
->b_size
* ab
->b_datacnt
;
1167 list_t
*list
= &ab
->b_state
->arcs_list
[ab
->b_type
];
1168 uint64_t *size
= &ab
->b_state
->arcs_lsize
[ab
->b_type
];
1170 ASSERT(!MUTEX_HELD(&ab
->b_state
->arcs_mtx
));
1171 mutex_enter(&ab
->b_state
->arcs_mtx
);
1172 ASSERT(list_link_active(&ab
->b_arc_node
));
1173 list_remove(list
, ab
);
1174 if (GHOST_STATE(ab
->b_state
)) {
1175 ASSERT0(ab
->b_datacnt
);
1176 ASSERT3P(ab
->b_buf
, ==, NULL
);
1180 ASSERT3U(*size
, >=, delta
);
1181 atomic_add_64(size
, -delta
);
1182 mutex_exit(&ab
->b_state
->arcs_mtx
);
1183 /* remove the prefetch flag if we get a reference */
1184 if (ab
->b_flags
& ARC_PREFETCH
)
1185 ab
->b_flags
&= ~ARC_PREFETCH
;
1190 remove_reference(arc_buf_hdr_t
*ab
, kmutex_t
*hash_lock
, void *tag
)
1193 arc_state_t
*state
= ab
->b_state
;
1195 ASSERT(state
== arc_anon
|| MUTEX_HELD(hash_lock
));
1196 ASSERT(!GHOST_STATE(state
));
1198 if (((cnt
= refcount_remove(&ab
->b_refcnt
, tag
)) == 0) &&
1199 (state
!= arc_anon
)) {
1200 uint64_t *size
= &state
->arcs_lsize
[ab
->b_type
];
1202 ASSERT(!MUTEX_HELD(&state
->arcs_mtx
));
1203 mutex_enter(&state
->arcs_mtx
);
1204 ASSERT(!list_link_active(&ab
->b_arc_node
));
1205 list_insert_head(&state
->arcs_list
[ab
->b_type
], ab
);
1206 ASSERT(ab
->b_datacnt
> 0);
1207 atomic_add_64(size
, ab
->b_size
* ab
->b_datacnt
);
1208 mutex_exit(&state
->arcs_mtx
);
1214 * Returns detailed information about a specific arc buffer. When the
1215 * state_index argument is set the function will calculate the arc header
1216 * list position for its arc state. Since this requires a linear traversal
1217 * callers are strongly encourage not to do this. However, it can be helpful
1218 * for targeted analysis so the functionality is provided.
1221 arc_buf_info(arc_buf_t
*ab
, arc_buf_info_t
*abi
, int state_index
)
1223 arc_buf_hdr_t
*hdr
= ab
->b_hdr
;
1224 arc_state_t
*state
= hdr
->b_state
;
1226 memset(abi
, 0, sizeof (arc_buf_info_t
));
1227 abi
->abi_flags
= hdr
->b_flags
;
1228 abi
->abi_datacnt
= hdr
->b_datacnt
;
1229 abi
->abi_state_type
= state
? state
->arcs_state
: ARC_STATE_ANON
;
1230 abi
->abi_state_contents
= hdr
->b_type
;
1231 abi
->abi_state_index
= -1;
1232 abi
->abi_size
= hdr
->b_size
;
1233 abi
->abi_access
= hdr
->b_arc_access
;
1234 abi
->abi_mru_hits
= hdr
->b_mru_hits
;
1235 abi
->abi_mru_ghost_hits
= hdr
->b_mru_ghost_hits
;
1236 abi
->abi_mfu_hits
= hdr
->b_mfu_hits
;
1237 abi
->abi_mfu_ghost_hits
= hdr
->b_mfu_ghost_hits
;
1238 abi
->abi_holds
= refcount_count(&hdr
->b_refcnt
);
1241 abi
->abi_l2arc_dattr
= hdr
->b_l2hdr
->b_daddr
;
1242 abi
->abi_l2arc_asize
= hdr
->b_l2hdr
->b_asize
;
1243 abi
->abi_l2arc_compress
= hdr
->b_l2hdr
->b_compress
;
1244 abi
->abi_l2arc_hits
= hdr
->b_l2hdr
->b_hits
;
1247 if (state
&& state_index
&& list_link_active(&hdr
->b_arc_node
)) {
1248 list_t
*list
= &state
->arcs_list
[hdr
->b_type
];
1251 mutex_enter(&state
->arcs_mtx
);
1252 for (h
= list_head(list
); h
!= NULL
; h
= list_next(list
, h
)) {
1253 abi
->abi_state_index
++;
1257 mutex_exit(&state
->arcs_mtx
);
1262 * Move the supplied buffer to the indicated state. The mutex
1263 * for the buffer must be held by the caller.
1266 arc_change_state(arc_state_t
*new_state
, arc_buf_hdr_t
*ab
, kmutex_t
*hash_lock
)
1268 arc_state_t
*old_state
= ab
->b_state
;
1269 int64_t refcnt
= refcount_count(&ab
->b_refcnt
);
1270 uint64_t from_delta
, to_delta
;
1272 ASSERT(MUTEX_HELD(hash_lock
));
1273 ASSERT3P(new_state
, !=, old_state
);
1274 ASSERT(refcnt
== 0 || ab
->b_datacnt
> 0);
1275 ASSERT(ab
->b_datacnt
== 0 || !GHOST_STATE(new_state
));
1276 ASSERT(ab
->b_datacnt
<= 1 || old_state
!= arc_anon
);
1278 from_delta
= to_delta
= ab
->b_datacnt
* ab
->b_size
;
1281 * If this buffer is evictable, transfer it from the
1282 * old state list to the new state list.
1285 if (old_state
!= arc_anon
) {
1286 int use_mutex
= !MUTEX_HELD(&old_state
->arcs_mtx
);
1287 uint64_t *size
= &old_state
->arcs_lsize
[ab
->b_type
];
1290 mutex_enter(&old_state
->arcs_mtx
);
1292 ASSERT(list_link_active(&ab
->b_arc_node
));
1293 list_remove(&old_state
->arcs_list
[ab
->b_type
], ab
);
1296 * If prefetching out of the ghost cache,
1297 * we will have a non-zero datacnt.
1299 if (GHOST_STATE(old_state
) && ab
->b_datacnt
== 0) {
1300 /* ghost elements have a ghost size */
1301 ASSERT(ab
->b_buf
== NULL
);
1302 from_delta
= ab
->b_size
;
1304 ASSERT3U(*size
, >=, from_delta
);
1305 atomic_add_64(size
, -from_delta
);
1308 mutex_exit(&old_state
->arcs_mtx
);
1310 if (new_state
!= arc_anon
) {
1311 int use_mutex
= !MUTEX_HELD(&new_state
->arcs_mtx
);
1312 uint64_t *size
= &new_state
->arcs_lsize
[ab
->b_type
];
1315 mutex_enter(&new_state
->arcs_mtx
);
1317 list_insert_head(&new_state
->arcs_list
[ab
->b_type
], ab
);
1319 /* ghost elements have a ghost size */
1320 if (GHOST_STATE(new_state
)) {
1321 ASSERT(ab
->b_datacnt
== 0);
1322 ASSERT(ab
->b_buf
== NULL
);
1323 to_delta
= ab
->b_size
;
1325 atomic_add_64(size
, to_delta
);
1328 mutex_exit(&new_state
->arcs_mtx
);
1332 ASSERT(!BUF_EMPTY(ab
));
1333 if (new_state
== arc_anon
&& HDR_IN_HASH_TABLE(ab
))
1334 buf_hash_remove(ab
);
1336 /* adjust state sizes */
1338 atomic_add_64(&new_state
->arcs_size
, to_delta
);
1340 ASSERT3U(old_state
->arcs_size
, >=, from_delta
);
1341 atomic_add_64(&old_state
->arcs_size
, -from_delta
);
1343 ab
->b_state
= new_state
;
1345 /* adjust l2arc hdr stats */
1346 if (new_state
== arc_l2c_only
)
1347 l2arc_hdr_stat_add();
1348 else if (old_state
== arc_l2c_only
)
1349 l2arc_hdr_stat_remove();
1353 arc_space_consume(uint64_t space
, arc_space_type_t type
)
1355 ASSERT(type
>= 0 && type
< ARC_SPACE_NUMTYPES
);
1360 case ARC_SPACE_DATA
:
1361 ARCSTAT_INCR(arcstat_data_size
, space
);
1363 case ARC_SPACE_OTHER
:
1364 ARCSTAT_INCR(arcstat_other_size
, space
);
1366 case ARC_SPACE_HDRS
:
1367 ARCSTAT_INCR(arcstat_hdr_size
, space
);
1369 case ARC_SPACE_L2HDRS
:
1370 ARCSTAT_INCR(arcstat_l2_hdr_size
, space
);
1374 ARCSTAT_INCR(arcstat_meta_used
, space
);
1375 atomic_add_64(&arc_size
, space
);
1379 arc_space_return(uint64_t space
, arc_space_type_t type
)
1381 ASSERT(type
>= 0 && type
< ARC_SPACE_NUMTYPES
);
1386 case ARC_SPACE_DATA
:
1387 ARCSTAT_INCR(arcstat_data_size
, -space
);
1389 case ARC_SPACE_OTHER
:
1390 ARCSTAT_INCR(arcstat_other_size
, -space
);
1392 case ARC_SPACE_HDRS
:
1393 ARCSTAT_INCR(arcstat_hdr_size
, -space
);
1395 case ARC_SPACE_L2HDRS
:
1396 ARCSTAT_INCR(arcstat_l2_hdr_size
, -space
);
1400 ASSERT(arc_meta_used
>= space
);
1401 if (arc_meta_max
< arc_meta_used
)
1402 arc_meta_max
= arc_meta_used
;
1403 ARCSTAT_INCR(arcstat_meta_used
, -space
);
1404 ASSERT(arc_size
>= space
);
1405 atomic_add_64(&arc_size
, -space
);
1409 arc_buf_alloc(spa_t
*spa
, int size
, void *tag
, arc_buf_contents_t type
)
1414 ASSERT3U(size
, >, 0);
1415 hdr
= kmem_cache_alloc(hdr_cache
, KM_PUSHPAGE
);
1416 ASSERT(BUF_EMPTY(hdr
));
1419 hdr
->b_spa
= spa_load_guid(spa
);
1420 hdr
->b_state
= arc_anon
;
1421 hdr
->b_arc_access
= 0;
1422 hdr
->b_mru_hits
= 0;
1423 hdr
->b_mru_ghost_hits
= 0;
1424 hdr
->b_mfu_hits
= 0;
1425 hdr
->b_mfu_ghost_hits
= 0;
1427 buf
= kmem_cache_alloc(buf_cache
, KM_PUSHPAGE
);
1430 buf
->b_efunc
= NULL
;
1431 buf
->b_private
= NULL
;
1434 arc_get_data_buf(buf
);
1437 ASSERT(refcount_is_zero(&hdr
->b_refcnt
));
1438 (void) refcount_add(&hdr
->b_refcnt
, tag
);
1443 static char *arc_onloan_tag
= "onloan";
1446 * Loan out an anonymous arc buffer. Loaned buffers are not counted as in
1447 * flight data by arc_tempreserve_space() until they are "returned". Loaned
1448 * buffers must be returned to the arc before they can be used by the DMU or
1452 arc_loan_buf(spa_t
*spa
, int size
)
1456 buf
= arc_buf_alloc(spa
, size
, arc_onloan_tag
, ARC_BUFC_DATA
);
1458 atomic_add_64(&arc_loaned_bytes
, size
);
1463 * Return a loaned arc buffer to the arc.
1466 arc_return_buf(arc_buf_t
*buf
, void *tag
)
1468 arc_buf_hdr_t
*hdr
= buf
->b_hdr
;
1470 ASSERT(buf
->b_data
!= NULL
);
1471 (void) refcount_add(&hdr
->b_refcnt
, tag
);
1472 (void) refcount_remove(&hdr
->b_refcnt
, arc_onloan_tag
);
1474 atomic_add_64(&arc_loaned_bytes
, -hdr
->b_size
);
1477 /* Detach an arc_buf from a dbuf (tag) */
1479 arc_loan_inuse_buf(arc_buf_t
*buf
, void *tag
)
1483 ASSERT(buf
->b_data
!= NULL
);
1485 (void) refcount_add(&hdr
->b_refcnt
, arc_onloan_tag
);
1486 (void) refcount_remove(&hdr
->b_refcnt
, tag
);
1487 buf
->b_efunc
= NULL
;
1488 buf
->b_private
= NULL
;
1490 atomic_add_64(&arc_loaned_bytes
, hdr
->b_size
);
1494 arc_buf_clone(arc_buf_t
*from
)
1497 arc_buf_hdr_t
*hdr
= from
->b_hdr
;
1498 uint64_t size
= hdr
->b_size
;
1500 ASSERT(hdr
->b_state
!= arc_anon
);
1502 buf
= kmem_cache_alloc(buf_cache
, KM_PUSHPAGE
);
1505 buf
->b_efunc
= NULL
;
1506 buf
->b_private
= NULL
;
1507 buf
->b_next
= hdr
->b_buf
;
1509 arc_get_data_buf(buf
);
1510 bcopy(from
->b_data
, buf
->b_data
, size
);
1513 * This buffer already exists in the arc so create a duplicate
1514 * copy for the caller. If the buffer is associated with user data
1515 * then track the size and number of duplicates. These stats will be
1516 * updated as duplicate buffers are created and destroyed.
1518 if (hdr
->b_type
== ARC_BUFC_DATA
) {
1519 ARCSTAT_BUMP(arcstat_duplicate_buffers
);
1520 ARCSTAT_INCR(arcstat_duplicate_buffers_size
, size
);
1522 hdr
->b_datacnt
+= 1;
1527 arc_buf_add_ref(arc_buf_t
*buf
, void* tag
)
1530 kmutex_t
*hash_lock
;
1533 * Check to see if this buffer is evicted. Callers
1534 * must verify b_data != NULL to know if the add_ref
1537 mutex_enter(&buf
->b_evict_lock
);
1538 if (buf
->b_data
== NULL
) {
1539 mutex_exit(&buf
->b_evict_lock
);
1542 hash_lock
= HDR_LOCK(buf
->b_hdr
);
1543 mutex_enter(hash_lock
);
1545 ASSERT3P(hash_lock
, ==, HDR_LOCK(hdr
));
1546 mutex_exit(&buf
->b_evict_lock
);
1548 ASSERT(hdr
->b_state
== arc_mru
|| hdr
->b_state
== arc_mfu
);
1549 add_reference(hdr
, hash_lock
, tag
);
1550 DTRACE_PROBE1(arc__hit
, arc_buf_hdr_t
*, hdr
);
1551 arc_access(hdr
, hash_lock
);
1552 mutex_exit(hash_lock
);
1553 ARCSTAT_BUMP(arcstat_hits
);
1554 ARCSTAT_CONDSTAT(!(hdr
->b_flags
& ARC_PREFETCH
),
1555 demand
, prefetch
, hdr
->b_type
!= ARC_BUFC_METADATA
,
1556 data
, metadata
, hits
);
1560 * Free the arc data buffer. If it is an l2arc write in progress,
1561 * the buffer is placed on l2arc_free_on_write to be freed later.
1564 arc_buf_data_free(arc_buf_t
*buf
, void (*free_func
)(void *, size_t))
1566 arc_buf_hdr_t
*hdr
= buf
->b_hdr
;
1568 if (HDR_L2_WRITING(hdr
)) {
1569 l2arc_data_free_t
*df
;
1570 df
= kmem_alloc(sizeof (l2arc_data_free_t
), KM_PUSHPAGE
);
1571 df
->l2df_data
= buf
->b_data
;
1572 df
->l2df_size
= hdr
->b_size
;
1573 df
->l2df_func
= free_func
;
1574 mutex_enter(&l2arc_free_on_write_mtx
);
1575 list_insert_head(l2arc_free_on_write
, df
);
1576 mutex_exit(&l2arc_free_on_write_mtx
);
1577 ARCSTAT_BUMP(arcstat_l2_free_on_write
);
1579 free_func(buf
->b_data
, hdr
->b_size
);
1584 arc_buf_destroy(arc_buf_t
*buf
, boolean_t recycle
, boolean_t all
)
1588 /* free up data associated with the buf */
1590 arc_state_t
*state
= buf
->b_hdr
->b_state
;
1591 uint64_t size
= buf
->b_hdr
->b_size
;
1592 arc_buf_contents_t type
= buf
->b_hdr
->b_type
;
1594 arc_cksum_verify(buf
);
1595 arc_buf_unwatch(buf
);
1598 if (type
== ARC_BUFC_METADATA
) {
1599 arc_buf_data_free(buf
, zio_buf_free
);
1600 arc_space_return(size
, ARC_SPACE_DATA
);
1602 ASSERT(type
== ARC_BUFC_DATA
);
1603 arc_buf_data_free(buf
, zio_data_buf_free
);
1604 ARCSTAT_INCR(arcstat_data_size
, -size
);
1605 atomic_add_64(&arc_size
, -size
);
1608 if (list_link_active(&buf
->b_hdr
->b_arc_node
)) {
1609 uint64_t *cnt
= &state
->arcs_lsize
[type
];
1611 ASSERT(refcount_is_zero(&buf
->b_hdr
->b_refcnt
));
1612 ASSERT(state
!= arc_anon
);
1614 ASSERT3U(*cnt
, >=, size
);
1615 atomic_add_64(cnt
, -size
);
1617 ASSERT3U(state
->arcs_size
, >=, size
);
1618 atomic_add_64(&state
->arcs_size
, -size
);
1622 * If we're destroying a duplicate buffer make sure
1623 * that the appropriate statistics are updated.
1625 if (buf
->b_hdr
->b_datacnt
> 1 &&
1626 buf
->b_hdr
->b_type
== ARC_BUFC_DATA
) {
1627 ARCSTAT_BUMPDOWN(arcstat_duplicate_buffers
);
1628 ARCSTAT_INCR(arcstat_duplicate_buffers_size
, -size
);
1630 ASSERT(buf
->b_hdr
->b_datacnt
> 0);
1631 buf
->b_hdr
->b_datacnt
-= 1;
1634 /* only remove the buf if requested */
1638 /* remove the buf from the hdr list */
1639 for (bufp
= &buf
->b_hdr
->b_buf
; *bufp
!= buf
; bufp
= &(*bufp
)->b_next
)
1641 *bufp
= buf
->b_next
;
1644 ASSERT(buf
->b_efunc
== NULL
);
1646 /* clean up the buf */
1648 kmem_cache_free(buf_cache
, buf
);
1652 arc_hdr_destroy(arc_buf_hdr_t
*hdr
)
1654 l2arc_buf_hdr_t
*l2hdr
= hdr
->b_l2hdr
;
1656 ASSERT(refcount_is_zero(&hdr
->b_refcnt
));
1657 ASSERT3P(hdr
->b_state
, ==, arc_anon
);
1658 ASSERT(!HDR_IO_IN_PROGRESS(hdr
));
1660 if (l2hdr
!= NULL
) {
1661 boolean_t buflist_held
= MUTEX_HELD(&l2arc_buflist_mtx
);
1663 * To prevent arc_free() and l2arc_evict() from
1664 * attempting to free the same buffer at the same time,
1665 * a FREE_IN_PROGRESS flag is given to arc_free() to
1666 * give it priority. l2arc_evict() can't destroy this
1667 * header while we are waiting on l2arc_buflist_mtx.
1669 * The hdr may be removed from l2ad_buflist before we
1670 * grab l2arc_buflist_mtx, so b_l2hdr is rechecked.
1672 if (!buflist_held
) {
1673 mutex_enter(&l2arc_buflist_mtx
);
1674 l2hdr
= hdr
->b_l2hdr
;
1677 if (l2hdr
!= NULL
) {
1678 list_remove(l2hdr
->b_dev
->l2ad_buflist
, hdr
);
1679 ARCSTAT_INCR(arcstat_l2_size
, -hdr
->b_size
);
1680 ARCSTAT_INCR(arcstat_l2_asize
, -l2hdr
->b_asize
);
1681 kmem_free(l2hdr
, sizeof (l2arc_buf_hdr_t
));
1682 arc_space_return(L2HDR_SIZE
, ARC_SPACE_L2HDRS
);
1683 if (hdr
->b_state
== arc_l2c_only
)
1684 l2arc_hdr_stat_remove();
1685 hdr
->b_l2hdr
= NULL
;
1689 mutex_exit(&l2arc_buflist_mtx
);
1692 if (!BUF_EMPTY(hdr
)) {
1693 ASSERT(!HDR_IN_HASH_TABLE(hdr
));
1694 buf_discard_identity(hdr
);
1696 while (hdr
->b_buf
) {
1697 arc_buf_t
*buf
= hdr
->b_buf
;
1700 mutex_enter(&arc_eviction_mtx
);
1701 mutex_enter(&buf
->b_evict_lock
);
1702 ASSERT(buf
->b_hdr
!= NULL
);
1703 arc_buf_destroy(hdr
->b_buf
, FALSE
, FALSE
);
1704 hdr
->b_buf
= buf
->b_next
;
1705 buf
->b_hdr
= &arc_eviction_hdr
;
1706 buf
->b_next
= arc_eviction_list
;
1707 arc_eviction_list
= buf
;
1708 mutex_exit(&buf
->b_evict_lock
);
1709 mutex_exit(&arc_eviction_mtx
);
1711 arc_buf_destroy(hdr
->b_buf
, FALSE
, TRUE
);
1714 if (hdr
->b_freeze_cksum
!= NULL
) {
1715 kmem_free(hdr
->b_freeze_cksum
, sizeof (zio_cksum_t
));
1716 hdr
->b_freeze_cksum
= NULL
;
1719 ASSERT(!list_link_active(&hdr
->b_arc_node
));
1720 ASSERT3P(hdr
->b_hash_next
, ==, NULL
);
1721 ASSERT3P(hdr
->b_acb
, ==, NULL
);
1722 kmem_cache_free(hdr_cache
, hdr
);
1726 arc_buf_free(arc_buf_t
*buf
, void *tag
)
1728 arc_buf_hdr_t
*hdr
= buf
->b_hdr
;
1729 int hashed
= hdr
->b_state
!= arc_anon
;
1731 ASSERT(buf
->b_efunc
== NULL
);
1732 ASSERT(buf
->b_data
!= NULL
);
1735 kmutex_t
*hash_lock
= HDR_LOCK(hdr
);
1737 mutex_enter(hash_lock
);
1739 ASSERT3P(hash_lock
, ==, HDR_LOCK(hdr
));
1741 (void) remove_reference(hdr
, hash_lock
, tag
);
1742 if (hdr
->b_datacnt
> 1) {
1743 arc_buf_destroy(buf
, FALSE
, TRUE
);
1745 ASSERT(buf
== hdr
->b_buf
);
1746 ASSERT(buf
->b_efunc
== NULL
);
1747 hdr
->b_flags
|= ARC_BUF_AVAILABLE
;
1749 mutex_exit(hash_lock
);
1750 } else if (HDR_IO_IN_PROGRESS(hdr
)) {
1753 * We are in the middle of an async write. Don't destroy
1754 * this buffer unless the write completes before we finish
1755 * decrementing the reference count.
1757 mutex_enter(&arc_eviction_mtx
);
1758 (void) remove_reference(hdr
, NULL
, tag
);
1759 ASSERT(refcount_is_zero(&hdr
->b_refcnt
));
1760 destroy_hdr
= !HDR_IO_IN_PROGRESS(hdr
);
1761 mutex_exit(&arc_eviction_mtx
);
1763 arc_hdr_destroy(hdr
);
1765 if (remove_reference(hdr
, NULL
, tag
) > 0)
1766 arc_buf_destroy(buf
, FALSE
, TRUE
);
1768 arc_hdr_destroy(hdr
);
1773 arc_buf_remove_ref(arc_buf_t
*buf
, void* tag
)
1775 arc_buf_hdr_t
*hdr
= buf
->b_hdr
;
1776 kmutex_t
*hash_lock
= NULL
;
1777 boolean_t no_callback
= (buf
->b_efunc
== NULL
);
1779 if (hdr
->b_state
== arc_anon
) {
1780 ASSERT(hdr
->b_datacnt
== 1);
1781 arc_buf_free(buf
, tag
);
1782 return (no_callback
);
1785 hash_lock
= HDR_LOCK(hdr
);
1786 mutex_enter(hash_lock
);
1788 ASSERT3P(hash_lock
, ==, HDR_LOCK(hdr
));
1789 ASSERT(hdr
->b_state
!= arc_anon
);
1790 ASSERT(buf
->b_data
!= NULL
);
1792 (void) remove_reference(hdr
, hash_lock
, tag
);
1793 if (hdr
->b_datacnt
> 1) {
1795 arc_buf_destroy(buf
, FALSE
, TRUE
);
1796 } else if (no_callback
) {
1797 ASSERT(hdr
->b_buf
== buf
&& buf
->b_next
== NULL
);
1798 ASSERT(buf
->b_efunc
== NULL
);
1799 hdr
->b_flags
|= ARC_BUF_AVAILABLE
;
1801 ASSERT(no_callback
|| hdr
->b_datacnt
> 1 ||
1802 refcount_is_zero(&hdr
->b_refcnt
));
1803 mutex_exit(hash_lock
);
1804 return (no_callback
);
1808 arc_buf_size(arc_buf_t
*buf
)
1810 return (buf
->b_hdr
->b_size
);
1814 * Called from the DMU to determine if the current buffer should be
1815 * evicted. In order to ensure proper locking, the eviction must be initiated
1816 * from the DMU. Return true if the buffer is associated with user data and
1817 * duplicate buffers still exist.
1820 arc_buf_eviction_needed(arc_buf_t
*buf
)
1823 boolean_t evict_needed
= B_FALSE
;
1825 if (zfs_disable_dup_eviction
)
1828 mutex_enter(&buf
->b_evict_lock
);
1832 * We are in arc_do_user_evicts(); let that function
1833 * perform the eviction.
1835 ASSERT(buf
->b_data
== NULL
);
1836 mutex_exit(&buf
->b_evict_lock
);
1838 } else if (buf
->b_data
== NULL
) {
1840 * We have already been added to the arc eviction list;
1841 * recommend eviction.
1843 ASSERT3P(hdr
, ==, &arc_eviction_hdr
);
1844 mutex_exit(&buf
->b_evict_lock
);
1848 if (hdr
->b_datacnt
> 1 && hdr
->b_type
== ARC_BUFC_DATA
)
1849 evict_needed
= B_TRUE
;
1851 mutex_exit(&buf
->b_evict_lock
);
1852 return (evict_needed
);
1856 * Evict buffers from list until we've removed the specified number of
1857 * bytes. Move the removed buffers to the appropriate evict state.
1858 * If the recycle flag is set, then attempt to "recycle" a buffer:
1859 * - look for a buffer to evict that is `bytes' long.
1860 * - return the data block from this buffer rather than freeing it.
1861 * This flag is used by callers that are trying to make space for a
1862 * new buffer in a full arc cache.
1864 * This function makes a "best effort". It skips over any buffers
1865 * it can't get a hash_lock on, and so may not catch all candidates.
1866 * It may also return without evicting as much space as requested.
1869 arc_evict(arc_state_t
*state
, uint64_t spa
, int64_t bytes
, boolean_t recycle
,
1870 arc_buf_contents_t type
)
1872 arc_state_t
*evicted_state
;
1873 uint64_t bytes_evicted
= 0, skipped
= 0, missed
= 0;
1874 arc_buf_hdr_t
*ab
, *ab_prev
= NULL
;
1875 list_t
*list
= &state
->arcs_list
[type
];
1876 kmutex_t
*hash_lock
;
1877 boolean_t have_lock
;
1878 void *stolen
= NULL
;
1879 arc_buf_hdr_t marker
= {{{ 0 }}};
1882 ASSERT(state
== arc_mru
|| state
== arc_mfu
);
1884 evicted_state
= (state
== arc_mru
) ? arc_mru_ghost
: arc_mfu_ghost
;
1886 mutex_enter(&state
->arcs_mtx
);
1887 mutex_enter(&evicted_state
->arcs_mtx
);
1889 for (ab
= list_tail(list
); ab
; ab
= ab_prev
) {
1890 ab_prev
= list_prev(list
, ab
);
1891 /* prefetch buffers have a minimum lifespan */
1892 if (HDR_IO_IN_PROGRESS(ab
) ||
1893 (spa
&& ab
->b_spa
!= spa
) ||
1894 (ab
->b_flags
& (ARC_PREFETCH
|ARC_INDIRECT
) &&
1895 ddi_get_lbolt() - ab
->b_arc_access
<
1896 zfs_arc_min_prefetch_lifespan
)) {
1900 /* "lookahead" for better eviction candidate */
1901 if (recycle
&& ab
->b_size
!= bytes
&&
1902 ab_prev
&& ab_prev
->b_size
== bytes
)
1905 /* ignore markers */
1910 * It may take a long time to evict all the bufs requested.
1911 * To avoid blocking all arc activity, periodically drop
1912 * the arcs_mtx and give other threads a chance to run
1913 * before reacquiring the lock.
1915 * If we are looking for a buffer to recycle, we are in
1916 * the hot code path, so don't sleep.
1918 if (!recycle
&& count
++ > arc_evict_iterations
) {
1919 list_insert_after(list
, ab
, &marker
);
1920 mutex_exit(&evicted_state
->arcs_mtx
);
1921 mutex_exit(&state
->arcs_mtx
);
1922 kpreempt(KPREEMPT_SYNC
);
1923 mutex_enter(&state
->arcs_mtx
);
1924 mutex_enter(&evicted_state
->arcs_mtx
);
1925 ab_prev
= list_prev(list
, &marker
);
1926 list_remove(list
, &marker
);
1931 hash_lock
= HDR_LOCK(ab
);
1932 have_lock
= MUTEX_HELD(hash_lock
);
1933 if (have_lock
|| mutex_tryenter(hash_lock
)) {
1934 ASSERT0(refcount_count(&ab
->b_refcnt
));
1935 ASSERT(ab
->b_datacnt
> 0);
1937 arc_buf_t
*buf
= ab
->b_buf
;
1938 if (!mutex_tryenter(&buf
->b_evict_lock
)) {
1943 bytes_evicted
+= ab
->b_size
;
1944 if (recycle
&& ab
->b_type
== type
&&
1945 ab
->b_size
== bytes
&&
1946 !HDR_L2_WRITING(ab
)) {
1947 stolen
= buf
->b_data
;
1952 mutex_enter(&arc_eviction_mtx
);
1953 arc_buf_destroy(buf
,
1954 buf
->b_data
== stolen
, FALSE
);
1955 ab
->b_buf
= buf
->b_next
;
1956 buf
->b_hdr
= &arc_eviction_hdr
;
1957 buf
->b_next
= arc_eviction_list
;
1958 arc_eviction_list
= buf
;
1959 mutex_exit(&arc_eviction_mtx
);
1960 mutex_exit(&buf
->b_evict_lock
);
1962 mutex_exit(&buf
->b_evict_lock
);
1963 arc_buf_destroy(buf
,
1964 buf
->b_data
== stolen
, TRUE
);
1969 ARCSTAT_INCR(arcstat_evict_l2_cached
,
1972 if (l2arc_write_eligible(ab
->b_spa
, ab
)) {
1973 ARCSTAT_INCR(arcstat_evict_l2_eligible
,
1977 arcstat_evict_l2_ineligible
,
1982 if (ab
->b_datacnt
== 0) {
1983 arc_change_state(evicted_state
, ab
, hash_lock
);
1984 ASSERT(HDR_IN_HASH_TABLE(ab
));
1985 ab
->b_flags
|= ARC_IN_HASH_TABLE
;
1986 ab
->b_flags
&= ~ARC_BUF_AVAILABLE
;
1987 DTRACE_PROBE1(arc__evict
, arc_buf_hdr_t
*, ab
);
1990 mutex_exit(hash_lock
);
1991 if (bytes
>= 0 && bytes_evicted
>= bytes
)
1998 mutex_exit(&evicted_state
->arcs_mtx
);
1999 mutex_exit(&state
->arcs_mtx
);
2001 if (bytes_evicted
< bytes
)
2002 dprintf("only evicted %lld bytes from %x\n",
2003 (longlong_t
)bytes_evicted
, state
);
2006 ARCSTAT_INCR(arcstat_evict_skip
, skipped
);
2009 ARCSTAT_INCR(arcstat_mutex_miss
, missed
);
2012 * Note: we have just evicted some data into the ghost state,
2013 * potentially putting the ghost size over the desired size. Rather
2014 * that evicting from the ghost list in this hot code path, leave
2015 * this chore to the arc_reclaim_thread().
2022 * Remove buffers from list until we've removed the specified number of
2023 * bytes. Destroy the buffers that are removed.
2026 arc_evict_ghost(arc_state_t
*state
, uint64_t spa
, int64_t bytes
,
2027 arc_buf_contents_t type
)
2029 arc_buf_hdr_t
*ab
, *ab_prev
;
2030 arc_buf_hdr_t marker
;
2031 list_t
*list
= &state
->arcs_list
[type
];
2032 kmutex_t
*hash_lock
;
2033 uint64_t bytes_deleted
= 0;
2034 uint64_t bufs_skipped
= 0;
2037 ASSERT(GHOST_STATE(state
));
2038 bzero(&marker
, sizeof (marker
));
2040 mutex_enter(&state
->arcs_mtx
);
2041 for (ab
= list_tail(list
); ab
; ab
= ab_prev
) {
2042 ab_prev
= list_prev(list
, ab
);
2043 if (ab
->b_type
> ARC_BUFC_NUMTYPES
)
2044 panic("invalid ab=%p", (void *)ab
);
2045 if (spa
&& ab
->b_spa
!= spa
)
2048 /* ignore markers */
2052 hash_lock
= HDR_LOCK(ab
);
2053 /* caller may be trying to modify this buffer, skip it */
2054 if (MUTEX_HELD(hash_lock
))
2058 * It may take a long time to evict all the bufs requested.
2059 * To avoid blocking all arc activity, periodically drop
2060 * the arcs_mtx and give other threads a chance to run
2061 * before reacquiring the lock.
2063 if (count
++ > arc_evict_iterations
) {
2064 list_insert_after(list
, ab
, &marker
);
2065 mutex_exit(&state
->arcs_mtx
);
2066 kpreempt(KPREEMPT_SYNC
);
2067 mutex_enter(&state
->arcs_mtx
);
2068 ab_prev
= list_prev(list
, &marker
);
2069 list_remove(list
, &marker
);
2073 if (mutex_tryenter(hash_lock
)) {
2074 ASSERT(!HDR_IO_IN_PROGRESS(ab
));
2075 ASSERT(ab
->b_buf
== NULL
);
2076 ARCSTAT_BUMP(arcstat_deleted
);
2077 bytes_deleted
+= ab
->b_size
;
2079 if (ab
->b_l2hdr
!= NULL
) {
2081 * This buffer is cached on the 2nd Level ARC;
2082 * don't destroy the header.
2084 arc_change_state(arc_l2c_only
, ab
, hash_lock
);
2085 mutex_exit(hash_lock
);
2087 arc_change_state(arc_anon
, ab
, hash_lock
);
2088 mutex_exit(hash_lock
);
2089 arc_hdr_destroy(ab
);
2092 DTRACE_PROBE1(arc__delete
, arc_buf_hdr_t
*, ab
);
2093 if (bytes
>= 0 && bytes_deleted
>= bytes
)
2095 } else if (bytes
< 0) {
2097 * Insert a list marker and then wait for the
2098 * hash lock to become available. Once its
2099 * available, restart from where we left off.
2101 list_insert_after(list
, ab
, &marker
);
2102 mutex_exit(&state
->arcs_mtx
);
2103 mutex_enter(hash_lock
);
2104 mutex_exit(hash_lock
);
2105 mutex_enter(&state
->arcs_mtx
);
2106 ab_prev
= list_prev(list
, &marker
);
2107 list_remove(list
, &marker
);
2112 mutex_exit(&state
->arcs_mtx
);
2114 if (list
== &state
->arcs_list
[ARC_BUFC_DATA
] &&
2115 (bytes
< 0 || bytes_deleted
< bytes
)) {
2116 list
= &state
->arcs_list
[ARC_BUFC_METADATA
];
2121 ARCSTAT_INCR(arcstat_mutex_miss
, bufs_skipped
);
2125 if (bytes_deleted
< bytes
)
2126 dprintf("only deleted %lld bytes from %p\n",
2127 (longlong_t
)bytes_deleted
, state
);
2133 int64_t adjustment
, delta
;
2139 adjustment
= MIN((int64_t)(arc_size
- arc_c
),
2140 (int64_t)(arc_anon
->arcs_size
+ arc_mru
->arcs_size
+ arc_meta_used
-
2143 if (adjustment
> 0 && arc_mru
->arcs_lsize
[ARC_BUFC_DATA
] > 0) {
2144 delta
= MIN(arc_mru
->arcs_lsize
[ARC_BUFC_DATA
], adjustment
);
2145 (void) arc_evict(arc_mru
, 0, delta
, FALSE
, ARC_BUFC_DATA
);
2146 adjustment
-= delta
;
2149 if (adjustment
> 0 && arc_mru
->arcs_lsize
[ARC_BUFC_METADATA
] > 0) {
2150 delta
= MIN(arc_mru
->arcs_lsize
[ARC_BUFC_METADATA
], adjustment
);
2151 (void) arc_evict(arc_mru
, 0, delta
, FALSE
,
2159 adjustment
= arc_size
- arc_c
;
2161 if (adjustment
> 0 && arc_mfu
->arcs_lsize
[ARC_BUFC_DATA
] > 0) {
2162 delta
= MIN(adjustment
, arc_mfu
->arcs_lsize
[ARC_BUFC_DATA
]);
2163 (void) arc_evict(arc_mfu
, 0, delta
, FALSE
, ARC_BUFC_DATA
);
2164 adjustment
-= delta
;
2167 if (adjustment
> 0 && arc_mfu
->arcs_lsize
[ARC_BUFC_METADATA
] > 0) {
2168 int64_t delta
= MIN(adjustment
,
2169 arc_mfu
->arcs_lsize
[ARC_BUFC_METADATA
]);
2170 (void) arc_evict(arc_mfu
, 0, delta
, FALSE
,
2175 * Adjust ghost lists
2178 adjustment
= arc_mru
->arcs_size
+ arc_mru_ghost
->arcs_size
- arc_c
;
2180 if (adjustment
> 0 && arc_mru_ghost
->arcs_size
> 0) {
2181 delta
= MIN(arc_mru_ghost
->arcs_size
, adjustment
);
2182 arc_evict_ghost(arc_mru_ghost
, 0, delta
, ARC_BUFC_DATA
);
2186 arc_mru_ghost
->arcs_size
+ arc_mfu_ghost
->arcs_size
- arc_c
;
2188 if (adjustment
> 0 && arc_mfu_ghost
->arcs_size
> 0) {
2189 delta
= MIN(arc_mfu_ghost
->arcs_size
, adjustment
);
2190 arc_evict_ghost(arc_mfu_ghost
, 0, delta
, ARC_BUFC_DATA
);
2195 * Request that arc user drop references so that N bytes can be released
2196 * from the cache. This provides a mechanism to ensure the arc can honor
2197 * the arc_meta_limit and reclaim buffers which are pinned in the cache
2198 * by higher layers. (i.e. the zpl)
2201 arc_do_user_prune(int64_t adjustment
)
2203 arc_prune_func_t
*func
;
2205 arc_prune_t
*cp
, *np
;
2207 mutex_enter(&arc_prune_mtx
);
2209 cp
= list_head(&arc_prune_list
);
2210 while (cp
!= NULL
) {
2212 private = cp
->p_private
;
2213 np
= list_next(&arc_prune_list
, cp
);
2214 refcount_add(&cp
->p_refcnt
, func
);
2215 mutex_exit(&arc_prune_mtx
);
2218 func(adjustment
, private);
2220 mutex_enter(&arc_prune_mtx
);
2222 /* User removed prune callback concurrently with execution */
2223 if (refcount_remove(&cp
->p_refcnt
, func
) == 0) {
2224 ASSERT(!list_link_active(&cp
->p_node
));
2225 refcount_destroy(&cp
->p_refcnt
);
2226 kmem_free(cp
, sizeof (*cp
));
2232 ARCSTAT_BUMP(arcstat_prune
);
2233 mutex_exit(&arc_prune_mtx
);
2237 arc_do_user_evicts(void)
2239 mutex_enter(&arc_eviction_mtx
);
2240 while (arc_eviction_list
!= NULL
) {
2241 arc_buf_t
*buf
= arc_eviction_list
;
2242 arc_eviction_list
= buf
->b_next
;
2243 mutex_enter(&buf
->b_evict_lock
);
2245 mutex_exit(&buf
->b_evict_lock
);
2246 mutex_exit(&arc_eviction_mtx
);
2248 if (buf
->b_efunc
!= NULL
)
2249 VERIFY(buf
->b_efunc(buf
) == 0);
2251 buf
->b_efunc
= NULL
;
2252 buf
->b_private
= NULL
;
2253 kmem_cache_free(buf_cache
, buf
);
2254 mutex_enter(&arc_eviction_mtx
);
2256 mutex_exit(&arc_eviction_mtx
);
2260 * Evict only meta data objects from the cache leaving the data objects.
2261 * This is only used to enforce the tunable arc_meta_limit, if we are
2262 * unable to evict enough buffers notify the user via the prune callback.
2265 arc_adjust_meta(int64_t adjustment
, boolean_t may_prune
)
2269 if (adjustment
> 0 && arc_mru
->arcs_lsize
[ARC_BUFC_METADATA
] > 0) {
2270 delta
= MIN(arc_mru
->arcs_lsize
[ARC_BUFC_METADATA
], adjustment
);
2271 arc_evict(arc_mru
, 0, delta
, FALSE
, ARC_BUFC_METADATA
);
2272 adjustment
-= delta
;
2275 if (adjustment
> 0 && arc_mfu
->arcs_lsize
[ARC_BUFC_METADATA
] > 0) {
2276 delta
= MIN(arc_mfu
->arcs_lsize
[ARC_BUFC_METADATA
], adjustment
);
2277 arc_evict(arc_mfu
, 0, delta
, FALSE
, ARC_BUFC_METADATA
);
2278 adjustment
-= delta
;
2281 if (may_prune
&& (adjustment
> 0) && (arc_meta_used
> arc_meta_limit
))
2282 arc_do_user_prune(zfs_arc_meta_prune
);
2286 * Flush all *evictable* data from the cache for the given spa.
2287 * NOTE: this will not touch "active" (i.e. referenced) data.
2290 arc_flush(spa_t
*spa
)
2295 guid
= spa_load_guid(spa
);
2297 while (list_head(&arc_mru
->arcs_list
[ARC_BUFC_DATA
])) {
2298 (void) arc_evict(arc_mru
, guid
, -1, FALSE
, ARC_BUFC_DATA
);
2302 while (list_head(&arc_mru
->arcs_list
[ARC_BUFC_METADATA
])) {
2303 (void) arc_evict(arc_mru
, guid
, -1, FALSE
, ARC_BUFC_METADATA
);
2307 while (list_head(&arc_mfu
->arcs_list
[ARC_BUFC_DATA
])) {
2308 (void) arc_evict(arc_mfu
, guid
, -1, FALSE
, ARC_BUFC_DATA
);
2312 while (list_head(&arc_mfu
->arcs_list
[ARC_BUFC_METADATA
])) {
2313 (void) arc_evict(arc_mfu
, guid
, -1, FALSE
, ARC_BUFC_METADATA
);
2318 arc_evict_ghost(arc_mru_ghost
, guid
, -1, ARC_BUFC_DATA
);
2319 arc_evict_ghost(arc_mfu_ghost
, guid
, -1, ARC_BUFC_DATA
);
2321 mutex_enter(&arc_reclaim_thr_lock
);
2322 arc_do_user_evicts();
2323 mutex_exit(&arc_reclaim_thr_lock
);
2324 ASSERT(spa
|| arc_eviction_list
== NULL
);
2328 arc_shrink(uint64_t bytes
)
2330 if (arc_c
> arc_c_min
) {
2333 to_free
= bytes
? bytes
: arc_c
>> zfs_arc_shrink_shift
;
2335 if (arc_c
> arc_c_min
+ to_free
)
2336 atomic_add_64(&arc_c
, -to_free
);
2340 atomic_add_64(&arc_p
, -(arc_p
>> zfs_arc_shrink_shift
));
2341 if (arc_c
> arc_size
)
2342 arc_c
= MAX(arc_size
, arc_c_min
);
2344 arc_p
= (arc_c
>> 1);
2345 ASSERT(arc_c
>= arc_c_min
);
2346 ASSERT((int64_t)arc_p
>= 0);
2349 if (arc_size
> arc_c
)
2354 arc_kmem_reap_now(arc_reclaim_strategy_t strat
, uint64_t bytes
)
2357 kmem_cache_t
*prev_cache
= NULL
;
2358 kmem_cache_t
*prev_data_cache
= NULL
;
2359 extern kmem_cache_t
*zio_buf_cache
[];
2360 extern kmem_cache_t
*zio_data_buf_cache
[];
2363 * An aggressive reclamation will shrink the cache size as well as
2364 * reap free buffers from the arc kmem caches.
2366 if (strat
== ARC_RECLAIM_AGGR
)
2369 for (i
= 0; i
< SPA_MAXBLOCKSIZE
>> SPA_MINBLOCKSHIFT
; i
++) {
2370 if (zio_buf_cache
[i
] != prev_cache
) {
2371 prev_cache
= zio_buf_cache
[i
];
2372 kmem_cache_reap_now(zio_buf_cache
[i
]);
2374 if (zio_data_buf_cache
[i
] != prev_data_cache
) {
2375 prev_data_cache
= zio_data_buf_cache
[i
];
2376 kmem_cache_reap_now(zio_data_buf_cache
[i
]);
2380 kmem_cache_reap_now(buf_cache
);
2381 kmem_cache_reap_now(hdr_cache
);
2385 * Unlike other ZFS implementations this thread is only responsible for
2386 * adapting the target ARC size on Linux. The responsibility for memory
2387 * reclamation has been entirely delegated to the arc_shrinker_func()
2388 * which is registered with the VM. To reflect this change in behavior
2389 * the arc_reclaim thread has been renamed to arc_adapt.
2392 arc_adapt_thread(void)
2397 CALLB_CPR_INIT(&cpr
, &arc_reclaim_thr_lock
, callb_generic_cpr
, FTAG
);
2399 mutex_enter(&arc_reclaim_thr_lock
);
2400 while (arc_thread_exit
== 0) {
2402 arc_reclaim_strategy_t last_reclaim
= ARC_RECLAIM_CONS
;
2404 if (spa_get_random(100) == 0) {
2407 if (last_reclaim
== ARC_RECLAIM_CONS
) {
2408 last_reclaim
= ARC_RECLAIM_AGGR
;
2410 last_reclaim
= ARC_RECLAIM_CONS
;
2414 last_reclaim
= ARC_RECLAIM_AGGR
;
2418 /* reset the growth delay for every reclaim */
2419 arc_grow_time
= ddi_get_lbolt() +
2420 (zfs_arc_grow_retry
* hz
);
2422 arc_kmem_reap_now(last_reclaim
, 0);
2425 #endif /* !_KERNEL */
2427 /* No recent memory pressure allow the ARC to grow. */
2428 if (arc_no_grow
&& ddi_get_lbolt() >= arc_grow_time
)
2429 arc_no_grow
= FALSE
;
2432 * Keep meta data usage within limits, arc_shrink() is not
2433 * used to avoid collapsing the arc_c value when only the
2434 * arc_meta_limit is being exceeded.
2436 prune
= (int64_t)arc_meta_used
- (int64_t)arc_meta_limit
;
2438 arc_adjust_meta(prune
, B_TRUE
);
2442 if (arc_eviction_list
!= NULL
)
2443 arc_do_user_evicts();
2445 /* block until needed, or one second, whichever is shorter */
2446 CALLB_CPR_SAFE_BEGIN(&cpr
);
2447 (void) cv_timedwait_interruptible(&arc_reclaim_thr_cv
,
2448 &arc_reclaim_thr_lock
, (ddi_get_lbolt() + hz
));
2449 CALLB_CPR_SAFE_END(&cpr
, &arc_reclaim_thr_lock
);
2452 /* Allow the module options to be changed */
2453 if (zfs_arc_max
> 64 << 20 &&
2454 zfs_arc_max
< physmem
* PAGESIZE
&&
2455 zfs_arc_max
!= arc_c_max
)
2456 arc_c_max
= zfs_arc_max
;
2458 if (zfs_arc_min
> 0 &&
2459 zfs_arc_min
< arc_c_max
&&
2460 zfs_arc_min
!= arc_c_min
)
2461 arc_c_min
= zfs_arc_min
;
2463 if (zfs_arc_meta_limit
> 0 &&
2464 zfs_arc_meta_limit
<= arc_c_max
&&
2465 zfs_arc_meta_limit
!= arc_meta_limit
)
2466 arc_meta_limit
= zfs_arc_meta_limit
;
2472 arc_thread_exit
= 0;
2473 cv_broadcast(&arc_reclaim_thr_cv
);
2474 CALLB_CPR_EXIT(&cpr
); /* drops arc_reclaim_thr_lock */
2480 * Determine the amount of memory eligible for eviction contained in the
2481 * ARC. All clean data reported by the ghost lists can always be safely
2482 * evicted. Due to arc_c_min, the same does not hold for all clean data
2483 * contained by the regular mru and mfu lists.
2485 * In the case of the regular mru and mfu lists, we need to report as
2486 * much clean data as possible, such that evicting that same reported
2487 * data will not bring arc_size below arc_c_min. Thus, in certain
2488 * circumstances, the total amount of clean data in the mru and mfu
2489 * lists might not actually be evictable.
2491 * The following two distinct cases are accounted for:
2493 * 1. The sum of the amount of dirty data contained by both the mru and
2494 * mfu lists, plus the ARC's other accounting (e.g. the anon list),
2495 * is greater than or equal to arc_c_min.
2496 * (i.e. amount of dirty data >= arc_c_min)
2498 * This is the easy case; all clean data contained by the mru and mfu
2499 * lists is evictable. Evicting all clean data can only drop arc_size
2500 * to the amount of dirty data, which is greater than arc_c_min.
2502 * 2. The sum of the amount of dirty data contained by both the mru and
2503 * mfu lists, plus the ARC's other accounting (e.g. the anon list),
2504 * is less than arc_c_min.
2505 * (i.e. arc_c_min > amount of dirty data)
2507 * 2.1. arc_size is greater than or equal arc_c_min.
2508 * (i.e. arc_size >= arc_c_min > amount of dirty data)
2510 * In this case, not all clean data from the regular mru and mfu
2511 * lists is actually evictable; we must leave enough clean data
2512 * to keep arc_size above arc_c_min. Thus, the maximum amount of
2513 * evictable data from the two lists combined, is exactly the
2514 * difference between arc_size and arc_c_min.
2516 * 2.2. arc_size is less than arc_c_min
2517 * (i.e. arc_c_min > arc_size > amount of dirty data)
2519 * In this case, none of the data contained in the mru and mfu
2520 * lists is evictable, even if it's clean. Since arc_size is
2521 * already below arc_c_min, evicting any more would only
2522 * increase this negative difference.
2525 arc_evictable_memory(void) {
2526 uint64_t arc_clean
=
2527 arc_mru
->arcs_lsize
[ARC_BUFC_DATA
] +
2528 arc_mru
->arcs_lsize
[ARC_BUFC_METADATA
] +
2529 arc_mfu
->arcs_lsize
[ARC_BUFC_DATA
] +
2530 arc_mfu
->arcs_lsize
[ARC_BUFC_METADATA
];
2531 uint64_t ghost_clean
=
2532 arc_mru_ghost
->arcs_lsize
[ARC_BUFC_DATA
] +
2533 arc_mru_ghost
->arcs_lsize
[ARC_BUFC_METADATA
] +
2534 arc_mfu_ghost
->arcs_lsize
[ARC_BUFC_DATA
] +
2535 arc_mfu_ghost
->arcs_lsize
[ARC_BUFC_METADATA
];
2536 uint64_t arc_dirty
= MAX((int64_t)arc_size
- (int64_t)arc_clean
, 0);
2538 if (arc_dirty
>= arc_c_min
)
2539 return (ghost_clean
+ arc_clean
);
2541 return (ghost_clean
+ MAX((int64_t)arc_size
- (int64_t)arc_c_min
, 0));
2545 __arc_shrinker_func(struct shrinker
*shrink
, struct shrink_control
*sc
)
2549 /* The arc is considered warm once reclaim has occurred */
2550 if (unlikely(arc_warm
== B_FALSE
))
2553 /* Return the potential number of reclaimable pages */
2554 pages
= btop(arc_evictable_memory());
2555 if (sc
->nr_to_scan
== 0)
2558 /* Not allowed to perform filesystem reclaim */
2559 if (!(sc
->gfp_mask
& __GFP_FS
))
2562 /* Reclaim in progress */
2563 if (mutex_tryenter(&arc_reclaim_thr_lock
) == 0)
2567 * Evict the requested number of pages by shrinking arc_c the
2568 * requested amount. If there is nothing left to evict just
2569 * reap whatever we can from the various arc slabs.
2572 arc_kmem_reap_now(ARC_RECLAIM_AGGR
, ptob(sc
->nr_to_scan
));
2574 arc_kmem_reap_now(ARC_RECLAIM_CONS
, ptob(sc
->nr_to_scan
));
2578 * When direct reclaim is observed it usually indicates a rapid
2579 * increase in memory pressure. This occurs because the kswapd
2580 * threads were unable to asynchronously keep enough free memory
2581 * available. In this case set arc_no_grow to briefly pause arc
2582 * growth to avoid compounding the memory pressure.
2584 if (current_is_kswapd()) {
2585 ARCSTAT_BUMP(arcstat_memory_indirect_count
);
2587 arc_no_grow
= B_TRUE
;
2588 arc_grow_time
= ddi_get_lbolt() + (zfs_arc_grow_retry
* hz
);
2589 ARCSTAT_BUMP(arcstat_memory_direct_count
);
2592 mutex_exit(&arc_reclaim_thr_lock
);
2596 SPL_SHRINKER_CALLBACK_WRAPPER(arc_shrinker_func
);
2598 SPL_SHRINKER_DECLARE(arc_shrinker
, arc_shrinker_func
, DEFAULT_SEEKS
);
2599 #endif /* _KERNEL */
2602 * Adapt arc info given the number of bytes we are trying to add and
2603 * the state that we are comming from. This function is only called
2604 * when we are adding new content to the cache.
2607 arc_adapt(int bytes
, arc_state_t
*state
)
2610 uint64_t arc_p_min
= (arc_c
>> zfs_arc_p_min_shift
);
2612 if (state
== arc_l2c_only
)
2617 * Adapt the target size of the MRU list:
2618 * - if we just hit in the MRU ghost list, then increase
2619 * the target size of the MRU list.
2620 * - if we just hit in the MFU ghost list, then increase
2621 * the target size of the MFU list by decreasing the
2622 * target size of the MRU list.
2624 if (state
== arc_mru_ghost
) {
2625 mult
= ((arc_mru_ghost
->arcs_size
>= arc_mfu_ghost
->arcs_size
) ?
2626 1 : (arc_mfu_ghost
->arcs_size
/arc_mru_ghost
->arcs_size
));
2627 mult
= MIN(mult
, 10); /* avoid wild arc_p adjustment */
2629 arc_p
= MIN(arc_c
- arc_p_min
, arc_p
+ bytes
* mult
);
2630 } else if (state
== arc_mfu_ghost
) {
2633 mult
= ((arc_mfu_ghost
->arcs_size
>= arc_mru_ghost
->arcs_size
) ?
2634 1 : (arc_mru_ghost
->arcs_size
/arc_mfu_ghost
->arcs_size
));
2635 mult
= MIN(mult
, 10);
2637 delta
= MIN(bytes
* mult
, arc_p
);
2638 arc_p
= MAX(arc_p_min
, arc_p
- delta
);
2640 ASSERT((int64_t)arc_p
>= 0);
2645 if (arc_c
>= arc_c_max
)
2649 * If we're within (2 * maxblocksize) bytes of the target
2650 * cache size, increment the target cache size
2652 if (arc_size
> arc_c
- (2ULL << SPA_MAXBLOCKSHIFT
)) {
2653 atomic_add_64(&arc_c
, (int64_t)bytes
);
2654 if (arc_c
> arc_c_max
)
2656 else if (state
== arc_anon
)
2657 atomic_add_64(&arc_p
, (int64_t)bytes
);
2661 ASSERT((int64_t)arc_p
>= 0);
2665 * Check if the cache has reached its limits and eviction is required
2669 arc_evict_needed(arc_buf_contents_t type
)
2671 if (type
== ARC_BUFC_METADATA
&& arc_meta_used
>= arc_meta_limit
)
2677 return (arc_size
> arc_c
);
2681 * The buffer, supplied as the first argument, needs a data block.
2682 * So, if we are at cache max, determine which cache should be victimized.
2683 * We have the following cases:
2685 * 1. Insert for MRU, p > sizeof(arc_anon + arc_mru) ->
2686 * In this situation if we're out of space, but the resident size of the MFU is
2687 * under the limit, victimize the MFU cache to satisfy this insertion request.
2689 * 2. Insert for MRU, p <= sizeof(arc_anon + arc_mru) ->
2690 * Here, we've used up all of the available space for the MRU, so we need to
2691 * evict from our own cache instead. Evict from the set of resident MRU
2694 * 3. Insert for MFU (c - p) > sizeof(arc_mfu) ->
2695 * c minus p represents the MFU space in the cache, since p is the size of the
2696 * cache that is dedicated to the MRU. In this situation there's still space on
2697 * the MFU side, so the MRU side needs to be victimized.
2699 * 4. Insert for MFU (c - p) < sizeof(arc_mfu) ->
2700 * MFU's resident set is consuming more space than it has been allotted. In
2701 * this situation, we must victimize our own cache, the MFU, for this insertion.
2704 arc_get_data_buf(arc_buf_t
*buf
)
2706 arc_state_t
*state
= buf
->b_hdr
->b_state
;
2707 uint64_t size
= buf
->b_hdr
->b_size
;
2708 arc_buf_contents_t type
= buf
->b_hdr
->b_type
;
2710 arc_adapt(size
, state
);
2713 * We have not yet reached cache maximum size,
2714 * just allocate a new buffer.
2716 if (!arc_evict_needed(type
)) {
2717 if (type
== ARC_BUFC_METADATA
) {
2718 buf
->b_data
= zio_buf_alloc(size
);
2719 arc_space_consume(size
, ARC_SPACE_DATA
);
2721 ASSERT(type
== ARC_BUFC_DATA
);
2722 buf
->b_data
= zio_data_buf_alloc(size
);
2723 ARCSTAT_INCR(arcstat_data_size
, size
);
2724 atomic_add_64(&arc_size
, size
);
2730 * If we are prefetching from the mfu ghost list, this buffer
2731 * will end up on the mru list; so steal space from there.
2733 if (state
== arc_mfu_ghost
)
2734 state
= buf
->b_hdr
->b_flags
& ARC_PREFETCH
? arc_mru
: arc_mfu
;
2735 else if (state
== arc_mru_ghost
)
2738 if (state
== arc_mru
|| state
== arc_anon
) {
2739 uint64_t mru_used
= arc_anon
->arcs_size
+ arc_mru
->arcs_size
;
2740 state
= (arc_mfu
->arcs_lsize
[type
] >= size
&&
2741 arc_p
> mru_used
) ? arc_mfu
: arc_mru
;
2744 uint64_t mfu_space
= arc_c
- arc_p
;
2745 state
= (arc_mru
->arcs_lsize
[type
] >= size
&&
2746 mfu_space
> arc_mfu
->arcs_size
) ? arc_mru
: arc_mfu
;
2749 if ((buf
->b_data
= arc_evict(state
, 0, size
, TRUE
, type
)) == NULL
) {
2750 if (type
== ARC_BUFC_METADATA
) {
2751 buf
->b_data
= zio_buf_alloc(size
);
2752 arc_space_consume(size
, ARC_SPACE_DATA
);
2755 * If we are unable to recycle an existing meta buffer
2756 * signal the reclaim thread. It will notify users
2757 * via the prune callback to drop references. The
2758 * prune callback in run in the context of the reclaim
2759 * thread to avoid deadlocking on the hash_lock.
2761 cv_signal(&arc_reclaim_thr_cv
);
2763 ASSERT(type
== ARC_BUFC_DATA
);
2764 buf
->b_data
= zio_data_buf_alloc(size
);
2765 ARCSTAT_INCR(arcstat_data_size
, size
);
2766 atomic_add_64(&arc_size
, size
);
2769 ARCSTAT_BUMP(arcstat_recycle_miss
);
2771 ASSERT(buf
->b_data
!= NULL
);
2774 * Update the state size. Note that ghost states have a
2775 * "ghost size" and so don't need to be updated.
2777 if (!GHOST_STATE(buf
->b_hdr
->b_state
)) {
2778 arc_buf_hdr_t
*hdr
= buf
->b_hdr
;
2780 atomic_add_64(&hdr
->b_state
->arcs_size
, size
);
2781 if (list_link_active(&hdr
->b_arc_node
)) {
2782 ASSERT(refcount_is_zero(&hdr
->b_refcnt
));
2783 atomic_add_64(&hdr
->b_state
->arcs_lsize
[type
], size
);
2786 * If we are growing the cache, and we are adding anonymous
2787 * data, and we have outgrown arc_p, update arc_p
2789 if (arc_size
< arc_c
&& hdr
->b_state
== arc_anon
&&
2790 arc_anon
->arcs_size
+ arc_mru
->arcs_size
> arc_p
)
2791 arc_p
= MIN(arc_c
, arc_p
+ size
);
2796 * This routine is called whenever a buffer is accessed.
2797 * NOTE: the hash lock is dropped in this function.
2800 arc_access(arc_buf_hdr_t
*buf
, kmutex_t
*hash_lock
)
2804 ASSERT(MUTEX_HELD(hash_lock
));
2806 if (buf
->b_state
== arc_anon
) {
2808 * This buffer is not in the cache, and does not
2809 * appear in our "ghost" list. Add the new buffer
2813 ASSERT(buf
->b_arc_access
== 0);
2814 buf
->b_arc_access
= ddi_get_lbolt();
2815 DTRACE_PROBE1(new_state__mru
, arc_buf_hdr_t
*, buf
);
2816 arc_change_state(arc_mru
, buf
, hash_lock
);
2818 } else if (buf
->b_state
== arc_mru
) {
2819 now
= ddi_get_lbolt();
2822 * If this buffer is here because of a prefetch, then either:
2823 * - clear the flag if this is a "referencing" read
2824 * (any subsequent access will bump this into the MFU state).
2826 * - move the buffer to the head of the list if this is
2827 * another prefetch (to make it less likely to be evicted).
2829 if ((buf
->b_flags
& ARC_PREFETCH
) != 0) {
2830 if (refcount_count(&buf
->b_refcnt
) == 0) {
2831 ASSERT(list_link_active(&buf
->b_arc_node
));
2833 buf
->b_flags
&= ~ARC_PREFETCH
;
2834 atomic_inc_32(&buf
->b_mru_hits
);
2835 ARCSTAT_BUMP(arcstat_mru_hits
);
2837 buf
->b_arc_access
= now
;
2842 * This buffer has been "accessed" only once so far,
2843 * but it is still in the cache. Move it to the MFU
2846 if (now
> buf
->b_arc_access
+ ARC_MINTIME
) {
2848 * More than 125ms have passed since we
2849 * instantiated this buffer. Move it to the
2850 * most frequently used state.
2852 buf
->b_arc_access
= now
;
2853 DTRACE_PROBE1(new_state__mfu
, arc_buf_hdr_t
*, buf
);
2854 arc_change_state(arc_mfu
, buf
, hash_lock
);
2856 atomic_inc_32(&buf
->b_mru_hits
);
2857 ARCSTAT_BUMP(arcstat_mru_hits
);
2858 } else if (buf
->b_state
== arc_mru_ghost
) {
2859 arc_state_t
*new_state
;
2861 * This buffer has been "accessed" recently, but
2862 * was evicted from the cache. Move it to the
2866 if (buf
->b_flags
& ARC_PREFETCH
) {
2867 new_state
= arc_mru
;
2868 if (refcount_count(&buf
->b_refcnt
) > 0)
2869 buf
->b_flags
&= ~ARC_PREFETCH
;
2870 DTRACE_PROBE1(new_state__mru
, arc_buf_hdr_t
*, buf
);
2872 new_state
= arc_mfu
;
2873 DTRACE_PROBE1(new_state__mfu
, arc_buf_hdr_t
*, buf
);
2876 buf
->b_arc_access
= ddi_get_lbolt();
2877 arc_change_state(new_state
, buf
, hash_lock
);
2879 atomic_inc_32(&buf
->b_mru_ghost_hits
);
2880 ARCSTAT_BUMP(arcstat_mru_ghost_hits
);
2881 } else if (buf
->b_state
== arc_mfu
) {
2883 * This buffer has been accessed more than once and is
2884 * still in the cache. Keep it in the MFU state.
2886 * NOTE: an add_reference() that occurred when we did
2887 * the arc_read() will have kicked this off the list.
2888 * If it was a prefetch, we will explicitly move it to
2889 * the head of the list now.
2891 if ((buf
->b_flags
& ARC_PREFETCH
) != 0) {
2892 ASSERT(refcount_count(&buf
->b_refcnt
) == 0);
2893 ASSERT(list_link_active(&buf
->b_arc_node
));
2895 atomic_inc_32(&buf
->b_mfu_hits
);
2896 ARCSTAT_BUMP(arcstat_mfu_hits
);
2897 buf
->b_arc_access
= ddi_get_lbolt();
2898 } else if (buf
->b_state
== arc_mfu_ghost
) {
2899 arc_state_t
*new_state
= arc_mfu
;
2901 * This buffer has been accessed more than once but has
2902 * been evicted from the cache. Move it back to the
2906 if (buf
->b_flags
& ARC_PREFETCH
) {
2908 * This is a prefetch access...
2909 * move this block back to the MRU state.
2911 ASSERT0(refcount_count(&buf
->b_refcnt
));
2912 new_state
= arc_mru
;
2915 buf
->b_arc_access
= ddi_get_lbolt();
2916 DTRACE_PROBE1(new_state__mfu
, arc_buf_hdr_t
*, buf
);
2917 arc_change_state(new_state
, buf
, hash_lock
);
2919 atomic_inc_32(&buf
->b_mfu_ghost_hits
);
2920 ARCSTAT_BUMP(arcstat_mfu_ghost_hits
);
2921 } else if (buf
->b_state
== arc_l2c_only
) {
2923 * This buffer is on the 2nd Level ARC.
2926 buf
->b_arc_access
= ddi_get_lbolt();
2927 DTRACE_PROBE1(new_state__mfu
, arc_buf_hdr_t
*, buf
);
2928 arc_change_state(arc_mfu
, buf
, hash_lock
);
2930 ASSERT(!"invalid arc state");
2934 /* a generic arc_done_func_t which you can use */
2937 arc_bcopy_func(zio_t
*zio
, arc_buf_t
*buf
, void *arg
)
2939 if (zio
== NULL
|| zio
->io_error
== 0)
2940 bcopy(buf
->b_data
, arg
, buf
->b_hdr
->b_size
);
2941 VERIFY(arc_buf_remove_ref(buf
, arg
));
2944 /* a generic arc_done_func_t */
2946 arc_getbuf_func(zio_t
*zio
, arc_buf_t
*buf
, void *arg
)
2948 arc_buf_t
**bufp
= arg
;
2949 if (zio
&& zio
->io_error
) {
2950 VERIFY(arc_buf_remove_ref(buf
, arg
));
2954 ASSERT(buf
->b_data
);
2959 arc_read_done(zio_t
*zio
)
2961 arc_buf_hdr_t
*hdr
, *found
;
2963 arc_buf_t
*abuf
; /* buffer we're assigning to callback */
2964 kmutex_t
*hash_lock
;
2965 arc_callback_t
*callback_list
, *acb
;
2966 int freeable
= FALSE
;
2968 buf
= zio
->io_private
;
2972 * The hdr was inserted into hash-table and removed from lists
2973 * prior to starting I/O. We should find this header, since
2974 * it's in the hash table, and it should be legit since it's
2975 * not possible to evict it during the I/O. The only possible
2976 * reason for it not to be found is if we were freed during the
2979 found
= buf_hash_find(hdr
->b_spa
, &hdr
->b_dva
, hdr
->b_birth
,
2982 ASSERT((found
== NULL
&& HDR_FREED_IN_READ(hdr
) && hash_lock
== NULL
) ||
2983 (found
== hdr
&& DVA_EQUAL(&hdr
->b_dva
, BP_IDENTITY(zio
->io_bp
))) ||
2984 (found
== hdr
&& HDR_L2_READING(hdr
)));
2986 hdr
->b_flags
&= ~ARC_L2_EVICTED
;
2987 if (l2arc_noprefetch
&& (hdr
->b_flags
& ARC_PREFETCH
))
2988 hdr
->b_flags
&= ~ARC_L2CACHE
;
2990 /* byteswap if necessary */
2991 callback_list
= hdr
->b_acb
;
2992 ASSERT(callback_list
!= NULL
);
2993 if (BP_SHOULD_BYTESWAP(zio
->io_bp
) && zio
->io_error
== 0) {
2994 dmu_object_byteswap_t bswap
=
2995 DMU_OT_BYTESWAP(BP_GET_TYPE(zio
->io_bp
));
2996 if (BP_GET_LEVEL(zio
->io_bp
) > 0)
2997 byteswap_uint64_array(buf
->b_data
, hdr
->b_size
);
2999 dmu_ot_byteswap
[bswap
].ob_func(buf
->b_data
, hdr
->b_size
);
3002 arc_cksum_compute(buf
, B_FALSE
);
3005 if (hash_lock
&& zio
->io_error
== 0 && hdr
->b_state
== arc_anon
) {
3007 * Only call arc_access on anonymous buffers. This is because
3008 * if we've issued an I/O for an evicted buffer, we've already
3009 * called arc_access (to prevent any simultaneous readers from
3010 * getting confused).
3012 arc_access(hdr
, hash_lock
);
3015 /* create copies of the data buffer for the callers */
3017 for (acb
= callback_list
; acb
; acb
= acb
->acb_next
) {
3018 if (acb
->acb_done
) {
3020 ARCSTAT_BUMP(arcstat_duplicate_reads
);
3021 abuf
= arc_buf_clone(buf
);
3023 acb
->acb_buf
= abuf
;
3028 hdr
->b_flags
&= ~ARC_IO_IN_PROGRESS
;
3029 ASSERT(!HDR_BUF_AVAILABLE(hdr
));
3031 ASSERT(buf
->b_efunc
== NULL
);
3032 ASSERT(hdr
->b_datacnt
== 1);
3033 hdr
->b_flags
|= ARC_BUF_AVAILABLE
;
3036 ASSERT(refcount_is_zero(&hdr
->b_refcnt
) || callback_list
!= NULL
);
3038 if (zio
->io_error
!= 0) {
3039 hdr
->b_flags
|= ARC_IO_ERROR
;
3040 if (hdr
->b_state
!= arc_anon
)
3041 arc_change_state(arc_anon
, hdr
, hash_lock
);
3042 if (HDR_IN_HASH_TABLE(hdr
))
3043 buf_hash_remove(hdr
);
3044 freeable
= refcount_is_zero(&hdr
->b_refcnt
);
3048 * Broadcast before we drop the hash_lock to avoid the possibility
3049 * that the hdr (and hence the cv) might be freed before we get to
3050 * the cv_broadcast().
3052 cv_broadcast(&hdr
->b_cv
);
3055 mutex_exit(hash_lock
);
3058 * This block was freed while we waited for the read to
3059 * complete. It has been removed from the hash table and
3060 * moved to the anonymous state (so that it won't show up
3063 ASSERT3P(hdr
->b_state
, ==, arc_anon
);
3064 freeable
= refcount_is_zero(&hdr
->b_refcnt
);
3067 /* execute each callback and free its structure */
3068 while ((acb
= callback_list
) != NULL
) {
3070 acb
->acb_done(zio
, acb
->acb_buf
, acb
->acb_private
);
3072 if (acb
->acb_zio_dummy
!= NULL
) {
3073 acb
->acb_zio_dummy
->io_error
= zio
->io_error
;
3074 zio_nowait(acb
->acb_zio_dummy
);
3077 callback_list
= acb
->acb_next
;
3078 kmem_free(acb
, sizeof (arc_callback_t
));
3082 arc_hdr_destroy(hdr
);
3086 * "Read" the block at the specified DVA (in bp) via the
3087 * cache. If the block is found in the cache, invoke the provided
3088 * callback immediately and return. Note that the `zio' parameter
3089 * in the callback will be NULL in this case, since no IO was
3090 * required. If the block is not in the cache pass the read request
3091 * on to the spa with a substitute callback function, so that the
3092 * requested block will be added to the cache.
3094 * If a read request arrives for a block that has a read in-progress,
3095 * either wait for the in-progress read to complete (and return the
3096 * results); or, if this is a read with a "done" func, add a record
3097 * to the read to invoke the "done" func when the read completes,
3098 * and return; or just return.
3100 * arc_read_done() will invoke all the requested "done" functions
3101 * for readers of this block.
3104 arc_read(zio_t
*pio
, spa_t
*spa
, const blkptr_t
*bp
, arc_done_func_t
*done
,
3105 void *private, zio_priority_t priority
, int zio_flags
, uint32_t *arc_flags
,
3106 const zbookmark_t
*zb
)
3109 arc_buf_t
*buf
= NULL
;
3110 kmutex_t
*hash_lock
;
3112 uint64_t guid
= spa_load_guid(spa
);
3116 hdr
= buf_hash_find(guid
, BP_IDENTITY(bp
), BP_PHYSICAL_BIRTH(bp
),
3118 if (hdr
&& hdr
->b_datacnt
> 0) {
3120 *arc_flags
|= ARC_CACHED
;
3122 if (HDR_IO_IN_PROGRESS(hdr
)) {
3124 if (*arc_flags
& ARC_WAIT
) {
3125 cv_wait(&hdr
->b_cv
, hash_lock
);
3126 mutex_exit(hash_lock
);
3129 ASSERT(*arc_flags
& ARC_NOWAIT
);
3132 arc_callback_t
*acb
= NULL
;
3134 acb
= kmem_zalloc(sizeof (arc_callback_t
),
3136 acb
->acb_done
= done
;
3137 acb
->acb_private
= private;
3139 acb
->acb_zio_dummy
= zio_null(pio
,
3140 spa
, NULL
, NULL
, NULL
, zio_flags
);
3142 ASSERT(acb
->acb_done
!= NULL
);
3143 acb
->acb_next
= hdr
->b_acb
;
3145 add_reference(hdr
, hash_lock
, private);
3146 mutex_exit(hash_lock
);
3149 mutex_exit(hash_lock
);
3153 ASSERT(hdr
->b_state
== arc_mru
|| hdr
->b_state
== arc_mfu
);
3156 add_reference(hdr
, hash_lock
, private);
3158 * If this block is already in use, create a new
3159 * copy of the data so that we will be guaranteed
3160 * that arc_release() will always succeed.
3164 ASSERT(buf
->b_data
);
3165 if (HDR_BUF_AVAILABLE(hdr
)) {
3166 ASSERT(buf
->b_efunc
== NULL
);
3167 hdr
->b_flags
&= ~ARC_BUF_AVAILABLE
;
3169 buf
= arc_buf_clone(buf
);
3172 } else if (*arc_flags
& ARC_PREFETCH
&&
3173 refcount_count(&hdr
->b_refcnt
) == 0) {
3174 hdr
->b_flags
|= ARC_PREFETCH
;
3176 DTRACE_PROBE1(arc__hit
, arc_buf_hdr_t
*, hdr
);
3177 arc_access(hdr
, hash_lock
);
3178 if (*arc_flags
& ARC_L2CACHE
)
3179 hdr
->b_flags
|= ARC_L2CACHE
;
3180 if (*arc_flags
& ARC_L2COMPRESS
)
3181 hdr
->b_flags
|= ARC_L2COMPRESS
;
3182 mutex_exit(hash_lock
);
3183 ARCSTAT_BUMP(arcstat_hits
);
3184 ARCSTAT_CONDSTAT(!(hdr
->b_flags
& ARC_PREFETCH
),
3185 demand
, prefetch
, hdr
->b_type
!= ARC_BUFC_METADATA
,
3186 data
, metadata
, hits
);
3189 done(NULL
, buf
, private);
3191 uint64_t size
= BP_GET_LSIZE(bp
);
3192 arc_callback_t
*acb
;
3195 boolean_t devw
= B_FALSE
;
3198 /* this block is not in the cache */
3199 arc_buf_hdr_t
*exists
;
3200 arc_buf_contents_t type
= BP_GET_BUFC_TYPE(bp
);
3201 buf
= arc_buf_alloc(spa
, size
, private, type
);
3203 hdr
->b_dva
= *BP_IDENTITY(bp
);
3204 hdr
->b_birth
= BP_PHYSICAL_BIRTH(bp
);
3205 hdr
->b_cksum0
= bp
->blk_cksum
.zc_word
[0];
3206 exists
= buf_hash_insert(hdr
, &hash_lock
);
3208 /* somebody beat us to the hash insert */
3209 mutex_exit(hash_lock
);
3210 buf_discard_identity(hdr
);
3211 (void) arc_buf_remove_ref(buf
, private);
3212 goto top
; /* restart the IO request */
3214 /* if this is a prefetch, we don't have a reference */
3215 if (*arc_flags
& ARC_PREFETCH
) {
3216 (void) remove_reference(hdr
, hash_lock
,
3218 hdr
->b_flags
|= ARC_PREFETCH
;
3220 if (*arc_flags
& ARC_L2CACHE
)
3221 hdr
->b_flags
|= ARC_L2CACHE
;
3222 if (*arc_flags
& ARC_L2COMPRESS
)
3223 hdr
->b_flags
|= ARC_L2COMPRESS
;
3224 if (BP_GET_LEVEL(bp
) > 0)
3225 hdr
->b_flags
|= ARC_INDIRECT
;
3227 /* this block is in the ghost cache */
3228 ASSERT(GHOST_STATE(hdr
->b_state
));
3229 ASSERT(!HDR_IO_IN_PROGRESS(hdr
));
3230 ASSERT0(refcount_count(&hdr
->b_refcnt
));
3231 ASSERT(hdr
->b_buf
== NULL
);
3233 /* if this is a prefetch, we don't have a reference */
3234 if (*arc_flags
& ARC_PREFETCH
)
3235 hdr
->b_flags
|= ARC_PREFETCH
;
3237 add_reference(hdr
, hash_lock
, private);
3238 if (*arc_flags
& ARC_L2CACHE
)
3239 hdr
->b_flags
|= ARC_L2CACHE
;
3240 if (*arc_flags
& ARC_L2COMPRESS
)
3241 hdr
->b_flags
|= ARC_L2COMPRESS
;
3242 buf
= kmem_cache_alloc(buf_cache
, KM_PUSHPAGE
);
3245 buf
->b_efunc
= NULL
;
3246 buf
->b_private
= NULL
;
3249 ASSERT(hdr
->b_datacnt
== 0);
3251 arc_get_data_buf(buf
);
3252 arc_access(hdr
, hash_lock
);
3255 ASSERT(!GHOST_STATE(hdr
->b_state
));
3257 acb
= kmem_zalloc(sizeof (arc_callback_t
), KM_PUSHPAGE
);
3258 acb
->acb_done
= done
;
3259 acb
->acb_private
= private;
3261 ASSERT(hdr
->b_acb
== NULL
);
3263 hdr
->b_flags
|= ARC_IO_IN_PROGRESS
;
3265 if (HDR_L2CACHE(hdr
) && hdr
->b_l2hdr
!= NULL
&&
3266 (vd
= hdr
->b_l2hdr
->b_dev
->l2ad_vdev
) != NULL
) {
3267 devw
= hdr
->b_l2hdr
->b_dev
->l2ad_writing
;
3268 addr
= hdr
->b_l2hdr
->b_daddr
;
3270 * Lock out device removal.
3272 if (vdev_is_dead(vd
) ||
3273 !spa_config_tryenter(spa
, SCL_L2ARC
, vd
, RW_READER
))
3277 mutex_exit(hash_lock
);
3280 * At this point, we have a level 1 cache miss. Try again in
3281 * L2ARC if possible.
3283 ASSERT3U(hdr
->b_size
, ==, size
);
3284 DTRACE_PROBE4(arc__miss
, arc_buf_hdr_t
*, hdr
, blkptr_t
*, bp
,
3285 uint64_t, size
, zbookmark_t
*, zb
);
3286 ARCSTAT_BUMP(arcstat_misses
);
3287 ARCSTAT_CONDSTAT(!(hdr
->b_flags
& ARC_PREFETCH
),
3288 demand
, prefetch
, hdr
->b_type
!= ARC_BUFC_METADATA
,
3289 data
, metadata
, misses
);
3291 if (vd
!= NULL
&& l2arc_ndev
!= 0 && !(l2arc_norw
&& devw
)) {
3293 * Read from the L2ARC if the following are true:
3294 * 1. The L2ARC vdev was previously cached.
3295 * 2. This buffer still has L2ARC metadata.
3296 * 3. This buffer isn't currently writing to the L2ARC.
3297 * 4. The L2ARC entry wasn't evicted, which may
3298 * also have invalidated the vdev.
3299 * 5. This isn't prefetch and l2arc_noprefetch is set.
3301 if (hdr
->b_l2hdr
!= NULL
&&
3302 !HDR_L2_WRITING(hdr
) && !HDR_L2_EVICTED(hdr
) &&
3303 !(l2arc_noprefetch
&& HDR_PREFETCH(hdr
))) {
3304 l2arc_read_callback_t
*cb
;
3306 DTRACE_PROBE1(l2arc__hit
, arc_buf_hdr_t
*, hdr
);
3307 ARCSTAT_BUMP(arcstat_l2_hits
);
3308 atomic_inc_32(&hdr
->b_l2hdr
->b_hits
);
3310 cb
= kmem_zalloc(sizeof (l2arc_read_callback_t
),
3312 cb
->l2rcb_buf
= buf
;
3313 cb
->l2rcb_spa
= spa
;
3316 cb
->l2rcb_flags
= zio_flags
;
3317 cb
->l2rcb_compress
= hdr
->b_l2hdr
->b_compress
;
3319 ASSERT(addr
>= VDEV_LABEL_START_SIZE
&&
3320 addr
+ size
< vd
->vdev_psize
-
3321 VDEV_LABEL_END_SIZE
);
3324 * l2arc read. The SCL_L2ARC lock will be
3325 * released by l2arc_read_done().
3326 * Issue a null zio if the underlying buffer
3327 * was squashed to zero size by compression.
3329 if (hdr
->b_l2hdr
->b_compress
==
3330 ZIO_COMPRESS_EMPTY
) {
3331 rzio
= zio_null(pio
, spa
, vd
,
3332 l2arc_read_done
, cb
,
3333 zio_flags
| ZIO_FLAG_DONT_CACHE
|
3335 ZIO_FLAG_DONT_PROPAGATE
|
3336 ZIO_FLAG_DONT_RETRY
);
3338 rzio
= zio_read_phys(pio
, vd
, addr
,
3339 hdr
->b_l2hdr
->b_asize
,
3340 buf
->b_data
, ZIO_CHECKSUM_OFF
,
3341 l2arc_read_done
, cb
, priority
,
3342 zio_flags
| ZIO_FLAG_DONT_CACHE
|
3344 ZIO_FLAG_DONT_PROPAGATE
|
3345 ZIO_FLAG_DONT_RETRY
, B_FALSE
);
3347 DTRACE_PROBE2(l2arc__read
, vdev_t
*, vd
,
3349 ARCSTAT_INCR(arcstat_l2_read_bytes
,
3350 hdr
->b_l2hdr
->b_asize
);
3352 if (*arc_flags
& ARC_NOWAIT
) {
3357 ASSERT(*arc_flags
& ARC_WAIT
);
3358 if (zio_wait(rzio
) == 0)
3361 /* l2arc read error; goto zio_read() */
3363 DTRACE_PROBE1(l2arc__miss
,
3364 arc_buf_hdr_t
*, hdr
);
3365 ARCSTAT_BUMP(arcstat_l2_misses
);
3366 if (HDR_L2_WRITING(hdr
))
3367 ARCSTAT_BUMP(arcstat_l2_rw_clash
);
3368 spa_config_exit(spa
, SCL_L2ARC
, vd
);
3372 spa_config_exit(spa
, SCL_L2ARC
, vd
);
3373 if (l2arc_ndev
!= 0) {
3374 DTRACE_PROBE1(l2arc__miss
,
3375 arc_buf_hdr_t
*, hdr
);
3376 ARCSTAT_BUMP(arcstat_l2_misses
);
3380 rzio
= zio_read(pio
, spa
, bp
, buf
->b_data
, size
,
3381 arc_read_done
, buf
, priority
, zio_flags
, zb
);
3383 if (*arc_flags
& ARC_WAIT
) {
3384 rc
= zio_wait(rzio
);
3388 ASSERT(*arc_flags
& ARC_NOWAIT
);
3393 spa_read_history_add(spa
, zb
, *arc_flags
);
3398 arc_add_prune_callback(arc_prune_func_t
*func
, void *private)
3402 p
= kmem_alloc(sizeof (*p
), KM_SLEEP
);
3404 p
->p_private
= private;
3405 list_link_init(&p
->p_node
);
3406 refcount_create(&p
->p_refcnt
);
3408 mutex_enter(&arc_prune_mtx
);
3409 refcount_add(&p
->p_refcnt
, &arc_prune_list
);
3410 list_insert_head(&arc_prune_list
, p
);
3411 mutex_exit(&arc_prune_mtx
);
3417 arc_remove_prune_callback(arc_prune_t
*p
)
3419 mutex_enter(&arc_prune_mtx
);
3420 list_remove(&arc_prune_list
, p
);
3421 if (refcount_remove(&p
->p_refcnt
, &arc_prune_list
) == 0) {
3422 refcount_destroy(&p
->p_refcnt
);
3423 kmem_free(p
, sizeof (*p
));
3425 mutex_exit(&arc_prune_mtx
);
3429 arc_set_callback(arc_buf_t
*buf
, arc_evict_func_t
*func
, void *private)
3431 ASSERT(buf
->b_hdr
!= NULL
);
3432 ASSERT(buf
->b_hdr
->b_state
!= arc_anon
);
3433 ASSERT(!refcount_is_zero(&buf
->b_hdr
->b_refcnt
) || func
== NULL
);
3434 ASSERT(buf
->b_efunc
== NULL
);
3435 ASSERT(!HDR_BUF_AVAILABLE(buf
->b_hdr
));
3437 buf
->b_efunc
= func
;
3438 buf
->b_private
= private;
3442 * Notify the arc that a block was freed, and thus will never be used again.
3445 arc_freed(spa_t
*spa
, const blkptr_t
*bp
)
3448 kmutex_t
*hash_lock
;
3449 uint64_t guid
= spa_load_guid(spa
);
3451 hdr
= buf_hash_find(guid
, BP_IDENTITY(bp
), BP_PHYSICAL_BIRTH(bp
),
3455 if (HDR_BUF_AVAILABLE(hdr
)) {
3456 arc_buf_t
*buf
= hdr
->b_buf
;
3457 add_reference(hdr
, hash_lock
, FTAG
);
3458 hdr
->b_flags
&= ~ARC_BUF_AVAILABLE
;
3459 mutex_exit(hash_lock
);
3461 arc_release(buf
, FTAG
);
3462 (void) arc_buf_remove_ref(buf
, FTAG
);
3464 mutex_exit(hash_lock
);
3470 * This is used by the DMU to let the ARC know that a buffer is
3471 * being evicted, so the ARC should clean up. If this arc buf
3472 * is not yet in the evicted state, it will be put there.
3475 arc_buf_evict(arc_buf_t
*buf
)
3478 kmutex_t
*hash_lock
;
3481 mutex_enter(&buf
->b_evict_lock
);
3485 * We are in arc_do_user_evicts().
3487 ASSERT(buf
->b_data
== NULL
);
3488 mutex_exit(&buf
->b_evict_lock
);
3490 } else if (buf
->b_data
== NULL
) {
3491 arc_buf_t copy
= *buf
; /* structure assignment */
3493 * We are on the eviction list; process this buffer now
3494 * but let arc_do_user_evicts() do the reaping.
3496 buf
->b_efunc
= NULL
;
3497 mutex_exit(&buf
->b_evict_lock
);
3498 VERIFY(copy
.b_efunc(©
) == 0);
3501 hash_lock
= HDR_LOCK(hdr
);
3502 mutex_enter(hash_lock
);
3504 ASSERT3P(hash_lock
, ==, HDR_LOCK(hdr
));
3506 ASSERT3U(refcount_count(&hdr
->b_refcnt
), <, hdr
->b_datacnt
);
3507 ASSERT(hdr
->b_state
== arc_mru
|| hdr
->b_state
== arc_mfu
);
3510 * Pull this buffer off of the hdr
3513 while (*bufp
!= buf
)
3514 bufp
= &(*bufp
)->b_next
;
3515 *bufp
= buf
->b_next
;
3517 ASSERT(buf
->b_data
!= NULL
);
3518 arc_buf_destroy(buf
, FALSE
, FALSE
);
3520 if (hdr
->b_datacnt
== 0) {
3521 arc_state_t
*old_state
= hdr
->b_state
;
3522 arc_state_t
*evicted_state
;
3524 ASSERT(hdr
->b_buf
== NULL
);
3525 ASSERT(refcount_is_zero(&hdr
->b_refcnt
));
3528 (old_state
== arc_mru
) ? arc_mru_ghost
: arc_mfu_ghost
;
3530 mutex_enter(&old_state
->arcs_mtx
);
3531 mutex_enter(&evicted_state
->arcs_mtx
);
3533 arc_change_state(evicted_state
, hdr
, hash_lock
);
3534 ASSERT(HDR_IN_HASH_TABLE(hdr
));
3535 hdr
->b_flags
|= ARC_IN_HASH_TABLE
;
3536 hdr
->b_flags
&= ~ARC_BUF_AVAILABLE
;
3538 mutex_exit(&evicted_state
->arcs_mtx
);
3539 mutex_exit(&old_state
->arcs_mtx
);
3541 mutex_exit(hash_lock
);
3542 mutex_exit(&buf
->b_evict_lock
);
3544 VERIFY(buf
->b_efunc(buf
) == 0);
3545 buf
->b_efunc
= NULL
;
3546 buf
->b_private
= NULL
;
3549 kmem_cache_free(buf_cache
, buf
);
3554 * Release this buffer from the cache, making it an anonymous buffer. This
3555 * must be done after a read and prior to modifying the buffer contents.
3556 * If the buffer has more than one reference, we must make
3557 * a new hdr for the buffer.
3560 arc_release(arc_buf_t
*buf
, void *tag
)
3563 kmutex_t
*hash_lock
= NULL
;
3564 l2arc_buf_hdr_t
*l2hdr
;
3565 uint64_t buf_size
= 0;
3568 * It would be nice to assert that if it's DMU metadata (level >
3569 * 0 || it's the dnode file), then it must be syncing context.
3570 * But we don't know that information at this level.
3573 mutex_enter(&buf
->b_evict_lock
);
3576 /* this buffer is not on any list */
3577 ASSERT(refcount_count(&hdr
->b_refcnt
) > 0);
3579 if (hdr
->b_state
== arc_anon
) {
3580 /* this buffer is already released */
3581 ASSERT(buf
->b_efunc
== NULL
);
3583 hash_lock
= HDR_LOCK(hdr
);
3584 mutex_enter(hash_lock
);
3586 ASSERT3P(hash_lock
, ==, HDR_LOCK(hdr
));
3589 l2hdr
= hdr
->b_l2hdr
;
3591 mutex_enter(&l2arc_buflist_mtx
);
3592 hdr
->b_l2hdr
= NULL
;
3594 buf_size
= hdr
->b_size
;
3597 * Do we have more than one buf?
3599 if (hdr
->b_datacnt
> 1) {
3600 arc_buf_hdr_t
*nhdr
;
3602 uint64_t blksz
= hdr
->b_size
;
3603 uint64_t spa
= hdr
->b_spa
;
3604 arc_buf_contents_t type
= hdr
->b_type
;
3605 uint32_t flags
= hdr
->b_flags
;
3607 ASSERT(hdr
->b_buf
!= buf
|| buf
->b_next
!= NULL
);
3609 * Pull the data off of this hdr and attach it to
3610 * a new anonymous hdr.
3612 (void) remove_reference(hdr
, hash_lock
, tag
);
3614 while (*bufp
!= buf
)
3615 bufp
= &(*bufp
)->b_next
;
3616 *bufp
= buf
->b_next
;
3619 ASSERT3U(hdr
->b_state
->arcs_size
, >=, hdr
->b_size
);
3620 atomic_add_64(&hdr
->b_state
->arcs_size
, -hdr
->b_size
);
3621 if (refcount_is_zero(&hdr
->b_refcnt
)) {
3622 uint64_t *size
= &hdr
->b_state
->arcs_lsize
[hdr
->b_type
];
3623 ASSERT3U(*size
, >=, hdr
->b_size
);
3624 atomic_add_64(size
, -hdr
->b_size
);
3628 * We're releasing a duplicate user data buffer, update
3629 * our statistics accordingly.
3631 if (hdr
->b_type
== ARC_BUFC_DATA
) {
3632 ARCSTAT_BUMPDOWN(arcstat_duplicate_buffers
);
3633 ARCSTAT_INCR(arcstat_duplicate_buffers_size
,
3636 hdr
->b_datacnt
-= 1;
3637 arc_cksum_verify(buf
);
3638 arc_buf_unwatch(buf
);
3640 mutex_exit(hash_lock
);
3642 nhdr
= kmem_cache_alloc(hdr_cache
, KM_PUSHPAGE
);
3643 nhdr
->b_size
= blksz
;
3645 nhdr
->b_type
= type
;
3647 nhdr
->b_state
= arc_anon
;
3648 nhdr
->b_arc_access
= 0;
3649 nhdr
->b_mru_hits
= 0;
3650 nhdr
->b_mru_ghost_hits
= 0;
3651 nhdr
->b_mfu_hits
= 0;
3652 nhdr
->b_mfu_ghost_hits
= 0;
3653 nhdr
->b_l2_hits
= 0;
3654 nhdr
->b_flags
= flags
& ARC_L2_WRITING
;
3655 nhdr
->b_l2hdr
= NULL
;
3656 nhdr
->b_datacnt
= 1;
3657 nhdr
->b_freeze_cksum
= NULL
;
3658 (void) refcount_add(&nhdr
->b_refcnt
, tag
);
3660 mutex_exit(&buf
->b_evict_lock
);
3661 atomic_add_64(&arc_anon
->arcs_size
, blksz
);
3663 mutex_exit(&buf
->b_evict_lock
);
3664 ASSERT(refcount_count(&hdr
->b_refcnt
) == 1);
3665 ASSERT(!list_link_active(&hdr
->b_arc_node
));
3666 ASSERT(!HDR_IO_IN_PROGRESS(hdr
));
3667 if (hdr
->b_state
!= arc_anon
)
3668 arc_change_state(arc_anon
, hdr
, hash_lock
);
3669 hdr
->b_arc_access
= 0;
3670 hdr
->b_mru_hits
= 0;
3671 hdr
->b_mru_ghost_hits
= 0;
3672 hdr
->b_mfu_hits
= 0;
3673 hdr
->b_mfu_ghost_hits
= 0;
3676 mutex_exit(hash_lock
);
3678 buf_discard_identity(hdr
);
3681 buf
->b_efunc
= NULL
;
3682 buf
->b_private
= NULL
;
3685 ARCSTAT_INCR(arcstat_l2_asize
, -l2hdr
->b_asize
);
3686 list_remove(l2hdr
->b_dev
->l2ad_buflist
, hdr
);
3687 kmem_free(l2hdr
, sizeof (l2arc_buf_hdr_t
));
3688 arc_space_return(L2HDR_SIZE
, ARC_SPACE_L2HDRS
);
3689 ARCSTAT_INCR(arcstat_l2_size
, -buf_size
);
3690 mutex_exit(&l2arc_buflist_mtx
);
3695 arc_released(arc_buf_t
*buf
)
3699 mutex_enter(&buf
->b_evict_lock
);
3700 released
= (buf
->b_data
!= NULL
&& buf
->b_hdr
->b_state
== arc_anon
);
3701 mutex_exit(&buf
->b_evict_lock
);
3706 arc_has_callback(arc_buf_t
*buf
)
3710 mutex_enter(&buf
->b_evict_lock
);
3711 callback
= (buf
->b_efunc
!= NULL
);
3712 mutex_exit(&buf
->b_evict_lock
);
3718 arc_referenced(arc_buf_t
*buf
)
3722 mutex_enter(&buf
->b_evict_lock
);
3723 referenced
= (refcount_count(&buf
->b_hdr
->b_refcnt
));
3724 mutex_exit(&buf
->b_evict_lock
);
3725 return (referenced
);
3730 arc_write_ready(zio_t
*zio
)
3732 arc_write_callback_t
*callback
= zio
->io_private
;
3733 arc_buf_t
*buf
= callback
->awcb_buf
;
3734 arc_buf_hdr_t
*hdr
= buf
->b_hdr
;
3736 ASSERT(!refcount_is_zero(&buf
->b_hdr
->b_refcnt
));
3737 callback
->awcb_ready(zio
, buf
, callback
->awcb_private
);
3740 * If the IO is already in progress, then this is a re-write
3741 * attempt, so we need to thaw and re-compute the cksum.
3742 * It is the responsibility of the callback to handle the
3743 * accounting for any re-write attempt.
3745 if (HDR_IO_IN_PROGRESS(hdr
)) {
3746 mutex_enter(&hdr
->b_freeze_lock
);
3747 if (hdr
->b_freeze_cksum
!= NULL
) {
3748 kmem_free(hdr
->b_freeze_cksum
, sizeof (zio_cksum_t
));
3749 hdr
->b_freeze_cksum
= NULL
;
3751 mutex_exit(&hdr
->b_freeze_lock
);
3753 arc_cksum_compute(buf
, B_FALSE
);
3754 hdr
->b_flags
|= ARC_IO_IN_PROGRESS
;
3758 * The SPA calls this callback for each physical write that happens on behalf
3759 * of a logical write. See the comment in dbuf_write_physdone() for details.
3762 arc_write_physdone(zio_t
*zio
)
3764 arc_write_callback_t
*cb
= zio
->io_private
;
3765 if (cb
->awcb_physdone
!= NULL
)
3766 cb
->awcb_physdone(zio
, cb
->awcb_buf
, cb
->awcb_private
);
3770 arc_write_done(zio_t
*zio
)
3772 arc_write_callback_t
*callback
= zio
->io_private
;
3773 arc_buf_t
*buf
= callback
->awcb_buf
;
3774 arc_buf_hdr_t
*hdr
= buf
->b_hdr
;
3776 ASSERT(hdr
->b_acb
== NULL
);
3778 if (zio
->io_error
== 0) {
3779 hdr
->b_dva
= *BP_IDENTITY(zio
->io_bp
);
3780 hdr
->b_birth
= BP_PHYSICAL_BIRTH(zio
->io_bp
);
3781 hdr
->b_cksum0
= zio
->io_bp
->blk_cksum
.zc_word
[0];
3783 ASSERT(BUF_EMPTY(hdr
));
3787 * If the block to be written was all-zero, we may have
3788 * compressed it away. In this case no write was performed
3789 * so there will be no dva/birth/checksum. The buffer must
3790 * therefore remain anonymous (and uncached).
3792 if (!BUF_EMPTY(hdr
)) {
3793 arc_buf_hdr_t
*exists
;
3794 kmutex_t
*hash_lock
;
3796 ASSERT(zio
->io_error
== 0);
3798 arc_cksum_verify(buf
);
3800 exists
= buf_hash_insert(hdr
, &hash_lock
);
3803 * This can only happen if we overwrite for
3804 * sync-to-convergence, because we remove
3805 * buffers from the hash table when we arc_free().
3807 if (zio
->io_flags
& ZIO_FLAG_IO_REWRITE
) {
3808 if (!BP_EQUAL(&zio
->io_bp_orig
, zio
->io_bp
))
3809 panic("bad overwrite, hdr=%p exists=%p",
3810 (void *)hdr
, (void *)exists
);
3811 ASSERT(refcount_is_zero(&exists
->b_refcnt
));
3812 arc_change_state(arc_anon
, exists
, hash_lock
);
3813 mutex_exit(hash_lock
);
3814 arc_hdr_destroy(exists
);
3815 exists
= buf_hash_insert(hdr
, &hash_lock
);
3816 ASSERT3P(exists
, ==, NULL
);
3817 } else if (zio
->io_flags
& ZIO_FLAG_NOPWRITE
) {
3819 ASSERT(zio
->io_prop
.zp_nopwrite
);
3820 if (!BP_EQUAL(&zio
->io_bp_orig
, zio
->io_bp
))
3821 panic("bad nopwrite, hdr=%p exists=%p",
3822 (void *)hdr
, (void *)exists
);
3825 ASSERT(hdr
->b_datacnt
== 1);
3826 ASSERT(hdr
->b_state
== arc_anon
);
3827 ASSERT(BP_GET_DEDUP(zio
->io_bp
));
3828 ASSERT(BP_GET_LEVEL(zio
->io_bp
) == 0);
3831 hdr
->b_flags
&= ~ARC_IO_IN_PROGRESS
;
3832 /* if it's not anon, we are doing a scrub */
3833 if (!exists
&& hdr
->b_state
== arc_anon
)
3834 arc_access(hdr
, hash_lock
);
3835 mutex_exit(hash_lock
);
3837 hdr
->b_flags
&= ~ARC_IO_IN_PROGRESS
;
3840 ASSERT(!refcount_is_zero(&hdr
->b_refcnt
));
3841 callback
->awcb_done(zio
, buf
, callback
->awcb_private
);
3843 kmem_free(callback
, sizeof (arc_write_callback_t
));
3847 arc_write(zio_t
*pio
, spa_t
*spa
, uint64_t txg
,
3848 blkptr_t
*bp
, arc_buf_t
*buf
, boolean_t l2arc
, boolean_t l2arc_compress
,
3849 const zio_prop_t
*zp
, arc_done_func_t
*ready
, arc_done_func_t
*physdone
,
3850 arc_done_func_t
*done
, void *private, zio_priority_t priority
,
3851 int zio_flags
, const zbookmark_t
*zb
)
3853 arc_buf_hdr_t
*hdr
= buf
->b_hdr
;
3854 arc_write_callback_t
*callback
;
3857 ASSERT(ready
!= NULL
);
3858 ASSERT(done
!= NULL
);
3859 ASSERT(!HDR_IO_ERROR(hdr
));
3860 ASSERT((hdr
->b_flags
& ARC_IO_IN_PROGRESS
) == 0);
3861 ASSERT(hdr
->b_acb
== NULL
);
3863 hdr
->b_flags
|= ARC_L2CACHE
;
3865 hdr
->b_flags
|= ARC_L2COMPRESS
;
3866 callback
= kmem_zalloc(sizeof (arc_write_callback_t
), KM_PUSHPAGE
);
3867 callback
->awcb_ready
= ready
;
3868 callback
->awcb_physdone
= physdone
;
3869 callback
->awcb_done
= done
;
3870 callback
->awcb_private
= private;
3871 callback
->awcb_buf
= buf
;
3873 zio
= zio_write(pio
, spa
, txg
, bp
, buf
->b_data
, hdr
->b_size
, zp
,
3874 arc_write_ready
, arc_write_physdone
, arc_write_done
, callback
,
3875 priority
, zio_flags
, zb
);
3881 arc_memory_throttle(uint64_t reserve
, uint64_t txg
)
3884 if (zfs_arc_memory_throttle_disable
)
3887 if (freemem
<= physmem
* arc_lotsfree_percent
/ 100) {
3888 ARCSTAT_INCR(arcstat_memory_throttle_count
, 1);
3889 DMU_TX_STAT_BUMP(dmu_tx_memory_reclaim
);
3890 return (SET_ERROR(EAGAIN
));
3897 arc_tempreserve_clear(uint64_t reserve
)
3899 atomic_add_64(&arc_tempreserve
, -reserve
);
3900 ASSERT((int64_t)arc_tempreserve
>= 0);
3904 arc_tempreserve_space(uint64_t reserve
, uint64_t txg
)
3909 if (reserve
> arc_c
/4 && !arc_no_grow
)
3910 arc_c
= MIN(arc_c_max
, reserve
* 4);
3911 if (reserve
> arc_c
) {
3912 DMU_TX_STAT_BUMP(dmu_tx_memory_reserve
);
3913 return (SET_ERROR(ENOMEM
));
3917 * Don't count loaned bufs as in flight dirty data to prevent long
3918 * network delays from blocking transactions that are ready to be
3919 * assigned to a txg.
3921 anon_size
= MAX((int64_t)(arc_anon
->arcs_size
- arc_loaned_bytes
), 0);
3924 * Writes will, almost always, require additional memory allocations
3925 * in order to compress/encrypt/etc the data. We therefore need to
3926 * make sure that there is sufficient available memory for this.
3928 error
= arc_memory_throttle(reserve
, txg
);
3933 * Throttle writes when the amount of dirty data in the cache
3934 * gets too large. We try to keep the cache less than half full
3935 * of dirty blocks so that our sync times don't grow too large.
3936 * Note: if two requests come in concurrently, we might let them
3937 * both succeed, when one of them should fail. Not a huge deal.
3940 if (reserve
+ arc_tempreserve
+ anon_size
> arc_c
/ 2 &&
3941 anon_size
> arc_c
/ 4) {
3942 dprintf("failing, arc_tempreserve=%lluK anon_meta=%lluK "
3943 "anon_data=%lluK tempreserve=%lluK arc_c=%lluK\n",
3944 arc_tempreserve
>>10,
3945 arc_anon
->arcs_lsize
[ARC_BUFC_METADATA
]>>10,
3946 arc_anon
->arcs_lsize
[ARC_BUFC_DATA
]>>10,
3947 reserve
>>10, arc_c
>>10);
3948 DMU_TX_STAT_BUMP(dmu_tx_dirty_throttle
);
3949 return (SET_ERROR(ERESTART
));
3951 atomic_add_64(&arc_tempreserve
, reserve
);
3956 arc_kstat_update_state(arc_state_t
*state
, kstat_named_t
*size
,
3957 kstat_named_t
*evict_data
, kstat_named_t
*evict_metadata
)
3959 size
->value
.ui64
= state
->arcs_size
;
3960 evict_data
->value
.ui64
= state
->arcs_lsize
[ARC_BUFC_DATA
];
3961 evict_metadata
->value
.ui64
= state
->arcs_lsize
[ARC_BUFC_METADATA
];
3965 arc_kstat_update(kstat_t
*ksp
, int rw
)
3967 arc_stats_t
*as
= ksp
->ks_data
;
3969 if (rw
== KSTAT_WRITE
) {
3970 return (SET_ERROR(EACCES
));
3972 arc_kstat_update_state(arc_anon
,
3973 &as
->arcstat_anon_size
,
3974 &as
->arcstat_anon_evict_data
,
3975 &as
->arcstat_anon_evict_metadata
);
3976 arc_kstat_update_state(arc_mru
,
3977 &as
->arcstat_mru_size
,
3978 &as
->arcstat_mru_evict_data
,
3979 &as
->arcstat_mru_evict_metadata
);
3980 arc_kstat_update_state(arc_mru_ghost
,
3981 &as
->arcstat_mru_ghost_size
,
3982 &as
->arcstat_mru_ghost_evict_data
,
3983 &as
->arcstat_mru_ghost_evict_metadata
);
3984 arc_kstat_update_state(arc_mfu
,
3985 &as
->arcstat_mfu_size
,
3986 &as
->arcstat_mfu_evict_data
,
3987 &as
->arcstat_mfu_evict_metadata
);
3988 arc_kstat_update_state(arc_mfu_ghost
,
3989 &as
->arcstat_mfu_ghost_size
,
3990 &as
->arcstat_mfu_ghost_evict_data
,
3991 &as
->arcstat_mfu_ghost_evict_metadata
);
4000 mutex_init(&arc_reclaim_thr_lock
, NULL
, MUTEX_DEFAULT
, NULL
);
4001 cv_init(&arc_reclaim_thr_cv
, NULL
, CV_DEFAULT
, NULL
);
4003 /* Convert seconds to clock ticks */
4004 zfs_arc_min_prefetch_lifespan
= 1 * hz
;
4006 /* Start out with 1/8 of all memory */
4007 arc_c
= physmem
* PAGESIZE
/ 8;
4011 * On architectures where the physical memory can be larger
4012 * than the addressable space (intel in 32-bit mode), we may
4013 * need to limit the cache to 1/8 of VM size.
4015 arc_c
= MIN(arc_c
, vmem_size(heap_arena
, VMEM_ALLOC
| VMEM_FREE
) / 8);
4017 * Register a shrinker to support synchronous (direct) memory
4018 * reclaim from the arc. This is done to prevent kswapd from
4019 * swapping out pages when it is preferable to shrink the arc.
4021 spl_register_shrinker(&arc_shrinker
);
4024 /* set min cache to 1/32 of all memory, or 64MB, whichever is more */
4025 arc_c_min
= MAX(arc_c
/ 4, 64<<20);
4026 /* set max to 1/2 of all memory */
4027 arc_c_max
= arc_c
* 4;
4030 * Allow the tunables to override our calculations if they are
4031 * reasonable (ie. over 64MB)
4033 if (zfs_arc_max
> 64<<20 && zfs_arc_max
< physmem
* PAGESIZE
)
4034 arc_c_max
= zfs_arc_max
;
4035 if (zfs_arc_min
> 64<<20 && zfs_arc_min
<= arc_c_max
)
4036 arc_c_min
= zfs_arc_min
;
4039 arc_p
= (arc_c
>> 1);
4041 /* limit meta-data to 1/4 of the arc capacity */
4042 arc_meta_limit
= arc_c_max
/ 4;
4045 /* Allow the tunable to override if it is reasonable */
4046 if (zfs_arc_meta_limit
> 0 && zfs_arc_meta_limit
<= arc_c_max
)
4047 arc_meta_limit
= zfs_arc_meta_limit
;
4049 if (arc_c_min
< arc_meta_limit
/ 2 && zfs_arc_min
== 0)
4050 arc_c_min
= arc_meta_limit
/ 2;
4052 /* if kmem_flags are set, lets try to use less memory */
4053 if (kmem_debugging())
4055 if (arc_c
< arc_c_min
)
4058 arc_anon
= &ARC_anon
;
4060 arc_mru_ghost
= &ARC_mru_ghost
;
4062 arc_mfu_ghost
= &ARC_mfu_ghost
;
4063 arc_l2c_only
= &ARC_l2c_only
;
4066 mutex_init(&arc_anon
->arcs_mtx
, NULL
, MUTEX_DEFAULT
, NULL
);
4067 mutex_init(&arc_mru
->arcs_mtx
, NULL
, MUTEX_DEFAULT
, NULL
);
4068 mutex_init(&arc_mru_ghost
->arcs_mtx
, NULL
, MUTEX_DEFAULT
, NULL
);
4069 mutex_init(&arc_mfu
->arcs_mtx
, NULL
, MUTEX_DEFAULT
, NULL
);
4070 mutex_init(&arc_mfu_ghost
->arcs_mtx
, NULL
, MUTEX_DEFAULT
, NULL
);
4071 mutex_init(&arc_l2c_only
->arcs_mtx
, NULL
, MUTEX_DEFAULT
, NULL
);
4073 list_create(&arc_mru
->arcs_list
[ARC_BUFC_METADATA
],
4074 sizeof (arc_buf_hdr_t
), offsetof(arc_buf_hdr_t
, b_arc_node
));
4075 list_create(&arc_mru
->arcs_list
[ARC_BUFC_DATA
],
4076 sizeof (arc_buf_hdr_t
), offsetof(arc_buf_hdr_t
, b_arc_node
));
4077 list_create(&arc_mru_ghost
->arcs_list
[ARC_BUFC_METADATA
],
4078 sizeof (arc_buf_hdr_t
), offsetof(arc_buf_hdr_t
, b_arc_node
));
4079 list_create(&arc_mru_ghost
->arcs_list
[ARC_BUFC_DATA
],
4080 sizeof (arc_buf_hdr_t
), offsetof(arc_buf_hdr_t
, b_arc_node
));
4081 list_create(&arc_mfu
->arcs_list
[ARC_BUFC_METADATA
],
4082 sizeof (arc_buf_hdr_t
), offsetof(arc_buf_hdr_t
, b_arc_node
));
4083 list_create(&arc_mfu
->arcs_list
[ARC_BUFC_DATA
],
4084 sizeof (arc_buf_hdr_t
), offsetof(arc_buf_hdr_t
, b_arc_node
));
4085 list_create(&arc_mfu_ghost
->arcs_list
[ARC_BUFC_METADATA
],
4086 sizeof (arc_buf_hdr_t
), offsetof(arc_buf_hdr_t
, b_arc_node
));
4087 list_create(&arc_mfu_ghost
->arcs_list
[ARC_BUFC_DATA
],
4088 sizeof (arc_buf_hdr_t
), offsetof(arc_buf_hdr_t
, b_arc_node
));
4089 list_create(&arc_l2c_only
->arcs_list
[ARC_BUFC_METADATA
],
4090 sizeof (arc_buf_hdr_t
), offsetof(arc_buf_hdr_t
, b_arc_node
));
4091 list_create(&arc_l2c_only
->arcs_list
[ARC_BUFC_DATA
],
4092 sizeof (arc_buf_hdr_t
), offsetof(arc_buf_hdr_t
, b_arc_node
));
4094 arc_anon
->arcs_state
= ARC_STATE_ANON
;
4095 arc_mru
->arcs_state
= ARC_STATE_MRU
;
4096 arc_mru_ghost
->arcs_state
= ARC_STATE_MRU_GHOST
;
4097 arc_mfu
->arcs_state
= ARC_STATE_MFU
;
4098 arc_mfu_ghost
->arcs_state
= ARC_STATE_MFU_GHOST
;
4099 arc_l2c_only
->arcs_state
= ARC_STATE_L2C_ONLY
;
4103 arc_thread_exit
= 0;
4104 list_create(&arc_prune_list
, sizeof (arc_prune_t
),
4105 offsetof(arc_prune_t
, p_node
));
4106 arc_eviction_list
= NULL
;
4107 mutex_init(&arc_prune_mtx
, NULL
, MUTEX_DEFAULT
, NULL
);
4108 mutex_init(&arc_eviction_mtx
, NULL
, MUTEX_DEFAULT
, NULL
);
4109 bzero(&arc_eviction_hdr
, sizeof (arc_buf_hdr_t
));
4111 arc_ksp
= kstat_create("zfs", 0, "arcstats", "misc", KSTAT_TYPE_NAMED
,
4112 sizeof (arc_stats
) / sizeof (kstat_named_t
), KSTAT_FLAG_VIRTUAL
);
4114 if (arc_ksp
!= NULL
) {
4115 arc_ksp
->ks_data
= &arc_stats
;
4116 arc_ksp
->ks_update
= arc_kstat_update
;
4117 kstat_install(arc_ksp
);
4120 (void) thread_create(NULL
, 0, arc_adapt_thread
, NULL
, 0, &p0
,
4121 TS_RUN
, minclsyspri
);
4127 * Calculate maximum amount of dirty data per pool.
4129 * If it has been set by a module parameter, take that.
4130 * Otherwise, use a percentage of physical memory defined by
4131 * zfs_dirty_data_max_percent (default 10%) with a cap at
4132 * zfs_dirty_data_max_max (default 25% of physical memory).
4134 if (zfs_dirty_data_max_max
== 0)
4135 zfs_dirty_data_max_max
= physmem
* PAGESIZE
*
4136 zfs_dirty_data_max_max_percent
/ 100;
4138 if (zfs_dirty_data_max
== 0) {
4139 zfs_dirty_data_max
= physmem
* PAGESIZE
*
4140 zfs_dirty_data_max_percent
/ 100;
4141 zfs_dirty_data_max
= MIN(zfs_dirty_data_max
,
4142 zfs_dirty_data_max_max
);
4151 mutex_enter(&arc_reclaim_thr_lock
);
4153 spl_unregister_shrinker(&arc_shrinker
);
4154 #endif /* _KERNEL */
4156 arc_thread_exit
= 1;
4157 while (arc_thread_exit
!= 0)
4158 cv_wait(&arc_reclaim_thr_cv
, &arc_reclaim_thr_lock
);
4159 mutex_exit(&arc_reclaim_thr_lock
);
4165 if (arc_ksp
!= NULL
) {
4166 kstat_delete(arc_ksp
);
4170 mutex_enter(&arc_prune_mtx
);
4171 while ((p
= list_head(&arc_prune_list
)) != NULL
) {
4172 list_remove(&arc_prune_list
, p
);
4173 refcount_remove(&p
->p_refcnt
, &arc_prune_list
);
4174 refcount_destroy(&p
->p_refcnt
);
4175 kmem_free(p
, sizeof (*p
));
4177 mutex_exit(&arc_prune_mtx
);
4179 list_destroy(&arc_prune_list
);
4180 mutex_destroy(&arc_prune_mtx
);
4181 mutex_destroy(&arc_eviction_mtx
);
4182 mutex_destroy(&arc_reclaim_thr_lock
);
4183 cv_destroy(&arc_reclaim_thr_cv
);
4185 list_destroy(&arc_mru
->arcs_list
[ARC_BUFC_METADATA
]);
4186 list_destroy(&arc_mru_ghost
->arcs_list
[ARC_BUFC_METADATA
]);
4187 list_destroy(&arc_mfu
->arcs_list
[ARC_BUFC_METADATA
]);
4188 list_destroy(&arc_mfu_ghost
->arcs_list
[ARC_BUFC_METADATA
]);
4189 list_destroy(&arc_mru
->arcs_list
[ARC_BUFC_DATA
]);
4190 list_destroy(&arc_mru_ghost
->arcs_list
[ARC_BUFC_DATA
]);
4191 list_destroy(&arc_mfu
->arcs_list
[ARC_BUFC_DATA
]);
4192 list_destroy(&arc_mfu_ghost
->arcs_list
[ARC_BUFC_DATA
]);
4194 mutex_destroy(&arc_anon
->arcs_mtx
);
4195 mutex_destroy(&arc_mru
->arcs_mtx
);
4196 mutex_destroy(&arc_mru_ghost
->arcs_mtx
);
4197 mutex_destroy(&arc_mfu
->arcs_mtx
);
4198 mutex_destroy(&arc_mfu_ghost
->arcs_mtx
);
4199 mutex_destroy(&arc_l2c_only
->arcs_mtx
);
4203 ASSERT(arc_loaned_bytes
== 0);
4209 * The level 2 ARC (L2ARC) is a cache layer in-between main memory and disk.
4210 * It uses dedicated storage devices to hold cached data, which are populated
4211 * using large infrequent writes. The main role of this cache is to boost
4212 * the performance of random read workloads. The intended L2ARC devices
4213 * include short-stroked disks, solid state disks, and other media with
4214 * substantially faster read latency than disk.
4216 * +-----------------------+
4218 * +-----------------------+
4221 * l2arc_feed_thread() arc_read()
4225 * +---------------+ |
4227 * +---------------+ |
4232 * +-------+ +-------+
4234 * | cache | | cache |
4235 * +-------+ +-------+
4236 * +=========+ .-----.
4237 * : L2ARC : |-_____-|
4238 * : devices : | Disks |
4239 * +=========+ `-_____-'
4241 * Read requests are satisfied from the following sources, in order:
4244 * 2) vdev cache of L2ARC devices
4246 * 4) vdev cache of disks
4249 * Some L2ARC device types exhibit extremely slow write performance.
4250 * To accommodate for this there are some significant differences between
4251 * the L2ARC and traditional cache design:
4253 * 1. There is no eviction path from the ARC to the L2ARC. Evictions from
4254 * the ARC behave as usual, freeing buffers and placing headers on ghost
4255 * lists. The ARC does not send buffers to the L2ARC during eviction as
4256 * this would add inflated write latencies for all ARC memory pressure.
4258 * 2. The L2ARC attempts to cache data from the ARC before it is evicted.
4259 * It does this by periodically scanning buffers from the eviction-end of
4260 * the MFU and MRU ARC lists, copying them to the L2ARC devices if they are
4261 * not already there. It scans until a headroom of buffers is satisfied,
4262 * which itself is a buffer for ARC eviction. If a compressible buffer is
4263 * found during scanning and selected for writing to an L2ARC device, we
4264 * temporarily boost scanning headroom during the next scan cycle to make
4265 * sure we adapt to compression effects (which might significantly reduce
4266 * the data volume we write to L2ARC). The thread that does this is
4267 * l2arc_feed_thread(), illustrated below; example sizes are included to
4268 * provide a better sense of ratio than this diagram:
4271 * +---------------------+----------+
4272 * ARC_mfu |:::::#:::::::::::::::|o#o###o###|-->. # already on L2ARC
4273 * +---------------------+----------+ | o L2ARC eligible
4274 * ARC_mru |:#:::::::::::::::::::|#o#ooo####|-->| : ARC buffer
4275 * +---------------------+----------+ |
4276 * 15.9 Gbytes ^ 32 Mbytes |
4278 * l2arc_feed_thread()
4280 * l2arc write hand <--[oooo]--'
4284 * +==============================+
4285 * L2ARC dev |####|#|###|###| |####| ... |
4286 * +==============================+
4289 * 3. If an ARC buffer is copied to the L2ARC but then hit instead of
4290 * evicted, then the L2ARC has cached a buffer much sooner than it probably
4291 * needed to, potentially wasting L2ARC device bandwidth and storage. It is
4292 * safe to say that this is an uncommon case, since buffers at the end of
4293 * the ARC lists have moved there due to inactivity.
4295 * 4. If the ARC evicts faster than the L2ARC can maintain a headroom,
4296 * then the L2ARC simply misses copying some buffers. This serves as a
4297 * pressure valve to prevent heavy read workloads from both stalling the ARC
4298 * with waits and clogging the L2ARC with writes. This also helps prevent
4299 * the potential for the L2ARC to churn if it attempts to cache content too
4300 * quickly, such as during backups of the entire pool.
4302 * 5. After system boot and before the ARC has filled main memory, there are
4303 * no evictions from the ARC and so the tails of the ARC_mfu and ARC_mru
4304 * lists can remain mostly static. Instead of searching from tail of these
4305 * lists as pictured, the l2arc_feed_thread() will search from the list heads
4306 * for eligible buffers, greatly increasing its chance of finding them.
4308 * The L2ARC device write speed is also boosted during this time so that
4309 * the L2ARC warms up faster. Since there have been no ARC evictions yet,
4310 * there are no L2ARC reads, and no fear of degrading read performance
4311 * through increased writes.
4313 * 6. Writes to the L2ARC devices are grouped and sent in-sequence, so that
4314 * the vdev queue can aggregate them into larger and fewer writes. Each
4315 * device is written to in a rotor fashion, sweeping writes through
4316 * available space then repeating.
4318 * 7. The L2ARC does not store dirty content. It never needs to flush
4319 * write buffers back to disk based storage.
4321 * 8. If an ARC buffer is written (and dirtied) which also exists in the
4322 * L2ARC, the now stale L2ARC buffer is immediately dropped.
4324 * The performance of the L2ARC can be tweaked by a number of tunables, which
4325 * may be necessary for different workloads:
4327 * l2arc_write_max max write bytes per interval
4328 * l2arc_write_boost extra write bytes during device warmup
4329 * l2arc_noprefetch skip caching prefetched buffers
4330 * l2arc_nocompress skip compressing buffers
4331 * l2arc_headroom number of max device writes to precache
4332 * l2arc_headroom_boost when we find compressed buffers during ARC
4333 * scanning, we multiply headroom by this
4334 * percentage factor for the next scan cycle,
4335 * since more compressed buffers are likely to
4337 * l2arc_feed_secs seconds between L2ARC writing
4339 * Tunables may be removed or added as future performance improvements are
4340 * integrated, and also may become zpool properties.
4342 * There are three key functions that control how the L2ARC warms up:
4344 * l2arc_write_eligible() check if a buffer is eligible to cache
4345 * l2arc_write_size() calculate how much to write
4346 * l2arc_write_interval() calculate sleep delay between writes
4348 * These three functions determine what to write, how much, and how quickly
4353 l2arc_write_eligible(uint64_t spa_guid
, arc_buf_hdr_t
*ab
)
4356 * A buffer is *not* eligible for the L2ARC if it:
4357 * 1. belongs to a different spa.
4358 * 2. is already cached on the L2ARC.
4359 * 3. has an I/O in progress (it may be an incomplete read).
4360 * 4. is flagged not eligible (zfs property).
4362 if (ab
->b_spa
!= spa_guid
|| ab
->b_l2hdr
!= NULL
||
4363 HDR_IO_IN_PROGRESS(ab
) || !HDR_L2CACHE(ab
))
4370 l2arc_write_size(void)
4375 * Make sure our globals have meaningful values in case the user
4378 size
= l2arc_write_max
;
4380 cmn_err(CE_NOTE
, "Bad value for l2arc_write_max, value must "
4381 "be greater than zero, resetting it to the default (%d)",
4383 size
= l2arc_write_max
= L2ARC_WRITE_SIZE
;
4386 if (arc_warm
== B_FALSE
)
4387 size
+= l2arc_write_boost
;
4394 l2arc_write_interval(clock_t began
, uint64_t wanted
, uint64_t wrote
)
4396 clock_t interval
, next
, now
;
4399 * If the ARC lists are busy, increase our write rate; if the
4400 * lists are stale, idle back. This is achieved by checking
4401 * how much we previously wrote - if it was more than half of
4402 * what we wanted, schedule the next write much sooner.
4404 if (l2arc_feed_again
&& wrote
> (wanted
/ 2))
4405 interval
= (hz
* l2arc_feed_min_ms
) / 1000;
4407 interval
= hz
* l2arc_feed_secs
;
4409 now
= ddi_get_lbolt();
4410 next
= MAX(now
, MIN(now
+ interval
, began
+ interval
));
4416 l2arc_hdr_stat_add(void)
4418 ARCSTAT_INCR(arcstat_l2_hdr_size
, HDR_SIZE
);
4419 ARCSTAT_INCR(arcstat_hdr_size
, -HDR_SIZE
);
4423 l2arc_hdr_stat_remove(void)
4425 ARCSTAT_INCR(arcstat_l2_hdr_size
, -HDR_SIZE
);
4426 ARCSTAT_INCR(arcstat_hdr_size
, HDR_SIZE
);
4430 * Cycle through L2ARC devices. This is how L2ARC load balances.
4431 * If a device is returned, this also returns holding the spa config lock.
4433 static l2arc_dev_t
*
4434 l2arc_dev_get_next(void)
4436 l2arc_dev_t
*first
, *next
= NULL
;
4439 * Lock out the removal of spas (spa_namespace_lock), then removal
4440 * of cache devices (l2arc_dev_mtx). Once a device has been selected,
4441 * both locks will be dropped and a spa config lock held instead.
4443 mutex_enter(&spa_namespace_lock
);
4444 mutex_enter(&l2arc_dev_mtx
);
4446 /* if there are no vdevs, there is nothing to do */
4447 if (l2arc_ndev
== 0)
4451 next
= l2arc_dev_last
;
4453 /* loop around the list looking for a non-faulted vdev */
4455 next
= list_head(l2arc_dev_list
);
4457 next
= list_next(l2arc_dev_list
, next
);
4459 next
= list_head(l2arc_dev_list
);
4462 /* if we have come back to the start, bail out */
4465 else if (next
== first
)
4468 } while (vdev_is_dead(next
->l2ad_vdev
));
4470 /* if we were unable to find any usable vdevs, return NULL */
4471 if (vdev_is_dead(next
->l2ad_vdev
))
4474 l2arc_dev_last
= next
;
4477 mutex_exit(&l2arc_dev_mtx
);
4480 * Grab the config lock to prevent the 'next' device from being
4481 * removed while we are writing to it.
4484 spa_config_enter(next
->l2ad_spa
, SCL_L2ARC
, next
, RW_READER
);
4485 mutex_exit(&spa_namespace_lock
);
4491 * Free buffers that were tagged for destruction.
4494 l2arc_do_free_on_write(void)
4497 l2arc_data_free_t
*df
, *df_prev
;
4499 mutex_enter(&l2arc_free_on_write_mtx
);
4500 buflist
= l2arc_free_on_write
;
4502 for (df
= list_tail(buflist
); df
; df
= df_prev
) {
4503 df_prev
= list_prev(buflist
, df
);
4504 ASSERT(df
->l2df_data
!= NULL
);
4505 ASSERT(df
->l2df_func
!= NULL
);
4506 df
->l2df_func(df
->l2df_data
, df
->l2df_size
);
4507 list_remove(buflist
, df
);
4508 kmem_free(df
, sizeof (l2arc_data_free_t
));
4511 mutex_exit(&l2arc_free_on_write_mtx
);
4515 * A write to a cache device has completed. Update all headers to allow
4516 * reads from these buffers to begin.
4519 l2arc_write_done(zio_t
*zio
)
4521 l2arc_write_callback_t
*cb
;
4524 arc_buf_hdr_t
*head
, *ab
, *ab_prev
;
4525 l2arc_buf_hdr_t
*abl2
;
4526 kmutex_t
*hash_lock
;
4528 cb
= zio
->io_private
;
4530 dev
= cb
->l2wcb_dev
;
4531 ASSERT(dev
!= NULL
);
4532 head
= cb
->l2wcb_head
;
4533 ASSERT(head
!= NULL
);
4534 buflist
= dev
->l2ad_buflist
;
4535 ASSERT(buflist
!= NULL
);
4536 DTRACE_PROBE2(l2arc__iodone
, zio_t
*, zio
,
4537 l2arc_write_callback_t
*, cb
);
4539 if (zio
->io_error
!= 0)
4540 ARCSTAT_BUMP(arcstat_l2_writes_error
);
4542 mutex_enter(&l2arc_buflist_mtx
);
4545 * All writes completed, or an error was hit.
4547 for (ab
= list_prev(buflist
, head
); ab
; ab
= ab_prev
) {
4548 ab_prev
= list_prev(buflist
, ab
);
4552 * Release the temporary compressed buffer as soon as possible.
4554 if (abl2
->b_compress
!= ZIO_COMPRESS_OFF
)
4555 l2arc_release_cdata_buf(ab
);
4557 hash_lock
= HDR_LOCK(ab
);
4558 if (!mutex_tryenter(hash_lock
)) {
4560 * This buffer misses out. It may be in a stage
4561 * of eviction. Its ARC_L2_WRITING flag will be
4562 * left set, denying reads to this buffer.
4564 ARCSTAT_BUMP(arcstat_l2_writes_hdr_miss
);
4568 if (zio
->io_error
!= 0) {
4570 * Error - drop L2ARC entry.
4572 list_remove(buflist
, ab
);
4573 ARCSTAT_INCR(arcstat_l2_asize
, -abl2
->b_asize
);
4575 kmem_free(abl2
, sizeof (l2arc_buf_hdr_t
));
4576 arc_space_return(L2HDR_SIZE
, ARC_SPACE_L2HDRS
);
4577 ARCSTAT_INCR(arcstat_l2_size
, -ab
->b_size
);
4581 * Allow ARC to begin reads to this L2ARC entry.
4583 ab
->b_flags
&= ~ARC_L2_WRITING
;
4585 mutex_exit(hash_lock
);
4588 atomic_inc_64(&l2arc_writes_done
);
4589 list_remove(buflist
, head
);
4590 kmem_cache_free(hdr_cache
, head
);
4591 mutex_exit(&l2arc_buflist_mtx
);
4593 l2arc_do_free_on_write();
4595 kmem_free(cb
, sizeof (l2arc_write_callback_t
));
4599 * A read to a cache device completed. Validate buffer contents before
4600 * handing over to the regular ARC routines.
4603 l2arc_read_done(zio_t
*zio
)
4605 l2arc_read_callback_t
*cb
;
4608 kmutex_t
*hash_lock
;
4611 ASSERT(zio
->io_vd
!= NULL
);
4612 ASSERT(zio
->io_flags
& ZIO_FLAG_DONT_PROPAGATE
);
4614 spa_config_exit(zio
->io_spa
, SCL_L2ARC
, zio
->io_vd
);
4616 cb
= zio
->io_private
;
4618 buf
= cb
->l2rcb_buf
;
4619 ASSERT(buf
!= NULL
);
4621 hash_lock
= HDR_LOCK(buf
->b_hdr
);
4622 mutex_enter(hash_lock
);
4624 ASSERT3P(hash_lock
, ==, HDR_LOCK(hdr
));
4627 * If the buffer was compressed, decompress it first.
4629 if (cb
->l2rcb_compress
!= ZIO_COMPRESS_OFF
)
4630 l2arc_decompress_zio(zio
, hdr
, cb
->l2rcb_compress
);
4631 ASSERT(zio
->io_data
!= NULL
);
4634 * Check this survived the L2ARC journey.
4636 equal
= arc_cksum_equal(buf
);
4637 if (equal
&& zio
->io_error
== 0 && !HDR_L2_EVICTED(hdr
)) {
4638 mutex_exit(hash_lock
);
4639 zio
->io_private
= buf
;
4640 zio
->io_bp_copy
= cb
->l2rcb_bp
; /* XXX fix in L2ARC 2.0 */
4641 zio
->io_bp
= &zio
->io_bp_copy
; /* XXX fix in L2ARC 2.0 */
4644 mutex_exit(hash_lock
);
4646 * Buffer didn't survive caching. Increment stats and
4647 * reissue to the original storage device.
4649 if (zio
->io_error
!= 0) {
4650 ARCSTAT_BUMP(arcstat_l2_io_error
);
4652 zio
->io_error
= SET_ERROR(EIO
);
4655 ARCSTAT_BUMP(arcstat_l2_cksum_bad
);
4658 * If there's no waiter, issue an async i/o to the primary
4659 * storage now. If there *is* a waiter, the caller must
4660 * issue the i/o in a context where it's OK to block.
4662 if (zio
->io_waiter
== NULL
) {
4663 zio_t
*pio
= zio_unique_parent(zio
);
4665 ASSERT(!pio
|| pio
->io_child_type
== ZIO_CHILD_LOGICAL
);
4667 zio_nowait(zio_read(pio
, cb
->l2rcb_spa
, &cb
->l2rcb_bp
,
4668 buf
->b_data
, zio
->io_size
, arc_read_done
, buf
,
4669 zio
->io_priority
, cb
->l2rcb_flags
, &cb
->l2rcb_zb
));
4673 kmem_free(cb
, sizeof (l2arc_read_callback_t
));
4677 * This is the list priority from which the L2ARC will search for pages to
4678 * cache. This is used within loops (0..3) to cycle through lists in the
4679 * desired order. This order can have a significant effect on cache
4682 * Currently the metadata lists are hit first, MFU then MRU, followed by
4683 * the data lists. This function returns a locked list, and also returns
4687 l2arc_list_locked(int list_num
, kmutex_t
**lock
)
4689 list_t
*list
= NULL
;
4691 ASSERT(list_num
>= 0 && list_num
<= 3);
4695 list
= &arc_mfu
->arcs_list
[ARC_BUFC_METADATA
];
4696 *lock
= &arc_mfu
->arcs_mtx
;
4699 list
= &arc_mru
->arcs_list
[ARC_BUFC_METADATA
];
4700 *lock
= &arc_mru
->arcs_mtx
;
4703 list
= &arc_mfu
->arcs_list
[ARC_BUFC_DATA
];
4704 *lock
= &arc_mfu
->arcs_mtx
;
4707 list
= &arc_mru
->arcs_list
[ARC_BUFC_DATA
];
4708 *lock
= &arc_mru
->arcs_mtx
;
4712 ASSERT(!(MUTEX_HELD(*lock
)));
4718 * Evict buffers from the device write hand to the distance specified in
4719 * bytes. This distance may span populated buffers, it may span nothing.
4720 * This is clearing a region on the L2ARC device ready for writing.
4721 * If the 'all' boolean is set, every buffer is evicted.
4724 l2arc_evict(l2arc_dev_t
*dev
, uint64_t distance
, boolean_t all
)
4727 l2arc_buf_hdr_t
*abl2
;
4728 arc_buf_hdr_t
*ab
, *ab_prev
;
4729 kmutex_t
*hash_lock
;
4732 buflist
= dev
->l2ad_buflist
;
4734 if (buflist
== NULL
)
4737 if (!all
&& dev
->l2ad_first
) {
4739 * This is the first sweep through the device. There is
4745 if (dev
->l2ad_hand
>= (dev
->l2ad_end
- (2 * distance
))) {
4747 * When nearing the end of the device, evict to the end
4748 * before the device write hand jumps to the start.
4750 taddr
= dev
->l2ad_end
;
4752 taddr
= dev
->l2ad_hand
+ distance
;
4754 DTRACE_PROBE4(l2arc__evict
, l2arc_dev_t
*, dev
, list_t
*, buflist
,
4755 uint64_t, taddr
, boolean_t
, all
);
4758 mutex_enter(&l2arc_buflist_mtx
);
4759 for (ab
= list_tail(buflist
); ab
; ab
= ab_prev
) {
4760 ab_prev
= list_prev(buflist
, ab
);
4762 hash_lock
= HDR_LOCK(ab
);
4763 if (!mutex_tryenter(hash_lock
)) {
4765 * Missed the hash lock. Retry.
4767 ARCSTAT_BUMP(arcstat_l2_evict_lock_retry
);
4768 mutex_exit(&l2arc_buflist_mtx
);
4769 mutex_enter(hash_lock
);
4770 mutex_exit(hash_lock
);
4774 if (HDR_L2_WRITE_HEAD(ab
)) {
4776 * We hit a write head node. Leave it for
4777 * l2arc_write_done().
4779 list_remove(buflist
, ab
);
4780 mutex_exit(hash_lock
);
4784 if (!all
&& ab
->b_l2hdr
!= NULL
&&
4785 (ab
->b_l2hdr
->b_daddr
> taddr
||
4786 ab
->b_l2hdr
->b_daddr
< dev
->l2ad_hand
)) {
4788 * We've evicted to the target address,
4789 * or the end of the device.
4791 mutex_exit(hash_lock
);
4795 if (HDR_FREE_IN_PROGRESS(ab
)) {
4797 * Already on the path to destruction.
4799 mutex_exit(hash_lock
);
4803 if (ab
->b_state
== arc_l2c_only
) {
4804 ASSERT(!HDR_L2_READING(ab
));
4806 * This doesn't exist in the ARC. Destroy.
4807 * arc_hdr_destroy() will call list_remove()
4808 * and decrement arcstat_l2_size.
4810 arc_change_state(arc_anon
, ab
, hash_lock
);
4811 arc_hdr_destroy(ab
);
4814 * Invalidate issued or about to be issued
4815 * reads, since we may be about to write
4816 * over this location.
4818 if (HDR_L2_READING(ab
)) {
4819 ARCSTAT_BUMP(arcstat_l2_evict_reading
);
4820 ab
->b_flags
|= ARC_L2_EVICTED
;
4824 * Tell ARC this no longer exists in L2ARC.
4826 if (ab
->b_l2hdr
!= NULL
) {
4828 ARCSTAT_INCR(arcstat_l2_asize
, -abl2
->b_asize
);
4830 kmem_free(abl2
, sizeof (l2arc_buf_hdr_t
));
4831 arc_space_return(L2HDR_SIZE
, ARC_SPACE_L2HDRS
);
4832 ARCSTAT_INCR(arcstat_l2_size
, -ab
->b_size
);
4834 list_remove(buflist
, ab
);
4837 * This may have been leftover after a
4840 ab
->b_flags
&= ~ARC_L2_WRITING
;
4842 mutex_exit(hash_lock
);
4844 mutex_exit(&l2arc_buflist_mtx
);
4846 vdev_space_update(dev
->l2ad_vdev
, -(taddr
- dev
->l2ad_evict
), 0, 0);
4847 dev
->l2ad_evict
= taddr
;
4851 * Find and write ARC buffers to the L2ARC device.
4853 * An ARC_L2_WRITING flag is set so that the L2ARC buffers are not valid
4854 * for reading until they have completed writing.
4855 * The headroom_boost is an in-out parameter used to maintain headroom boost
4856 * state between calls to this function.
4858 * Returns the number of bytes actually written (which may be smaller than
4859 * the delta by which the device hand has changed due to alignment).
4862 l2arc_write_buffers(spa_t
*spa
, l2arc_dev_t
*dev
, uint64_t target_sz
,
4863 boolean_t
*headroom_boost
)
4865 arc_buf_hdr_t
*ab
, *ab_prev
, *head
;
4867 uint64_t write_asize
, write_psize
, write_sz
, headroom
,
4870 kmutex_t
*list_lock
= NULL
;
4872 l2arc_write_callback_t
*cb
;
4874 uint64_t guid
= spa_load_guid(spa
);
4876 const boolean_t do_headroom_boost
= *headroom_boost
;
4878 ASSERT(dev
->l2ad_vdev
!= NULL
);
4880 /* Lower the flag now, we might want to raise it again later. */
4881 *headroom_boost
= B_FALSE
;
4884 write_sz
= write_asize
= write_psize
= 0;
4886 head
= kmem_cache_alloc(hdr_cache
, KM_PUSHPAGE
);
4887 head
->b_flags
|= ARC_L2_WRITE_HEAD
;
4890 * We will want to try to compress buffers that are at least 2x the
4891 * device sector size.
4893 buf_compress_minsz
= 2 << dev
->l2ad_vdev
->vdev_ashift
;
4896 * Copy buffers for L2ARC writing.
4898 mutex_enter(&l2arc_buflist_mtx
);
4899 for (try = 0; try <= 3; try++) {
4900 uint64_t passed_sz
= 0;
4902 list
= l2arc_list_locked(try, &list_lock
);
4905 * L2ARC fast warmup.
4907 * Until the ARC is warm and starts to evict, read from the
4908 * head of the ARC lists rather than the tail.
4910 if (arc_warm
== B_FALSE
)
4911 ab
= list_head(list
);
4913 ab
= list_tail(list
);
4915 headroom
= target_sz
* l2arc_headroom
;
4916 if (do_headroom_boost
)
4917 headroom
= (headroom
* l2arc_headroom_boost
) / 100;
4919 for (; ab
; ab
= ab_prev
) {
4920 l2arc_buf_hdr_t
*l2hdr
;
4921 kmutex_t
*hash_lock
;
4924 if (arc_warm
== B_FALSE
)
4925 ab_prev
= list_next(list
, ab
);
4927 ab_prev
= list_prev(list
, ab
);
4929 hash_lock
= HDR_LOCK(ab
);
4930 if (!mutex_tryenter(hash_lock
)) {
4932 * Skip this buffer rather than waiting.
4937 passed_sz
+= ab
->b_size
;
4938 if (passed_sz
> headroom
) {
4942 mutex_exit(hash_lock
);
4946 if (!l2arc_write_eligible(guid
, ab
)) {
4947 mutex_exit(hash_lock
);
4951 if ((write_sz
+ ab
->b_size
) > target_sz
) {
4953 mutex_exit(hash_lock
);
4959 * Insert a dummy header on the buflist so
4960 * l2arc_write_done() can find where the
4961 * write buffers begin without searching.
4963 list_insert_head(dev
->l2ad_buflist
, head
);
4965 cb
= kmem_alloc(sizeof (l2arc_write_callback_t
),
4967 cb
->l2wcb_dev
= dev
;
4968 cb
->l2wcb_head
= head
;
4969 pio
= zio_root(spa
, l2arc_write_done
, cb
,
4974 * Create and add a new L2ARC header.
4976 l2hdr
= kmem_zalloc(sizeof (l2arc_buf_hdr_t
),
4979 arc_space_consume(L2HDR_SIZE
, ARC_SPACE_L2HDRS
);
4981 ab
->b_flags
|= ARC_L2_WRITING
;
4984 * Temporarily stash the data buffer in b_tmp_cdata.
4985 * The subsequent write step will pick it up from
4986 * there. This is because can't access ab->b_buf
4987 * without holding the hash_lock, which we in turn
4988 * can't access without holding the ARC list locks
4989 * (which we want to avoid during compression/writing)
4991 l2hdr
->b_compress
= ZIO_COMPRESS_OFF
;
4992 l2hdr
->b_asize
= ab
->b_size
;
4993 l2hdr
->b_tmp_cdata
= ab
->b_buf
->b_data
;
4996 buf_sz
= ab
->b_size
;
4997 ab
->b_l2hdr
= l2hdr
;
4999 list_insert_head(dev
->l2ad_buflist
, ab
);
5002 * Compute and store the buffer cksum before
5003 * writing. On debug the cksum is verified first.
5005 arc_cksum_verify(ab
->b_buf
);
5006 arc_cksum_compute(ab
->b_buf
, B_TRUE
);
5008 mutex_exit(hash_lock
);
5013 mutex_exit(list_lock
);
5019 /* No buffers selected for writing? */
5022 mutex_exit(&l2arc_buflist_mtx
);
5023 kmem_cache_free(hdr_cache
, head
);
5028 * Now start writing the buffers. We're starting at the write head
5029 * and work backwards, retracing the course of the buffer selector
5032 for (ab
= list_prev(dev
->l2ad_buflist
, head
); ab
;
5033 ab
= list_prev(dev
->l2ad_buflist
, ab
)) {
5034 l2arc_buf_hdr_t
*l2hdr
;
5038 * We shouldn't need to lock the buffer here, since we flagged
5039 * it as ARC_L2_WRITING in the previous step, but we must take
5040 * care to only access its L2 cache parameters. In particular,
5041 * ab->b_buf may be invalid by now due to ARC eviction.
5043 l2hdr
= ab
->b_l2hdr
;
5044 l2hdr
->b_daddr
= dev
->l2ad_hand
;
5046 if (!l2arc_nocompress
&& (ab
->b_flags
& ARC_L2COMPRESS
) &&
5047 l2hdr
->b_asize
>= buf_compress_minsz
) {
5048 if (l2arc_compress_buf(l2hdr
)) {
5050 * If compression succeeded, enable headroom
5051 * boost on the next scan cycle.
5053 *headroom_boost
= B_TRUE
;
5058 * Pick up the buffer data we had previously stashed away
5059 * (and now potentially also compressed).
5061 buf_data
= l2hdr
->b_tmp_cdata
;
5062 buf_sz
= l2hdr
->b_asize
;
5064 /* Compression may have squashed the buffer to zero length. */
5068 wzio
= zio_write_phys(pio
, dev
->l2ad_vdev
,
5069 dev
->l2ad_hand
, buf_sz
, buf_data
, ZIO_CHECKSUM_OFF
,
5070 NULL
, NULL
, ZIO_PRIORITY_ASYNC_WRITE
,
5071 ZIO_FLAG_CANFAIL
, B_FALSE
);
5073 DTRACE_PROBE2(l2arc__write
, vdev_t
*, dev
->l2ad_vdev
,
5075 (void) zio_nowait(wzio
);
5077 write_asize
+= buf_sz
;
5079 * Keep the clock hand suitably device-aligned.
5081 buf_p_sz
= vdev_psize_to_asize(dev
->l2ad_vdev
, buf_sz
);
5082 write_psize
+= buf_p_sz
;
5083 dev
->l2ad_hand
+= buf_p_sz
;
5087 mutex_exit(&l2arc_buflist_mtx
);
5089 ASSERT3U(write_asize
, <=, target_sz
);
5090 ARCSTAT_BUMP(arcstat_l2_writes_sent
);
5091 ARCSTAT_INCR(arcstat_l2_write_bytes
, write_asize
);
5092 ARCSTAT_INCR(arcstat_l2_size
, write_sz
);
5093 ARCSTAT_INCR(arcstat_l2_asize
, write_asize
);
5094 vdev_space_update(dev
->l2ad_vdev
, write_psize
, 0, 0);
5097 * Bump device hand to the device start if it is approaching the end.
5098 * l2arc_evict() will already have evicted ahead for this case.
5100 if (dev
->l2ad_hand
>= (dev
->l2ad_end
- target_sz
)) {
5101 vdev_space_update(dev
->l2ad_vdev
,
5102 dev
->l2ad_end
- dev
->l2ad_hand
, 0, 0);
5103 dev
->l2ad_hand
= dev
->l2ad_start
;
5104 dev
->l2ad_evict
= dev
->l2ad_start
;
5105 dev
->l2ad_first
= B_FALSE
;
5108 dev
->l2ad_writing
= B_TRUE
;
5109 (void) zio_wait(pio
);
5110 dev
->l2ad_writing
= B_FALSE
;
5112 return (write_asize
);
5116 * Compresses an L2ARC buffer.
5117 * The data to be compressed must be prefilled in l2hdr->b_tmp_cdata and its
5118 * size in l2hdr->b_asize. This routine tries to compress the data and
5119 * depending on the compression result there are three possible outcomes:
5120 * *) The buffer was incompressible. The original l2hdr contents were left
5121 * untouched and are ready for writing to an L2 device.
5122 * *) The buffer was all-zeros, so there is no need to write it to an L2
5123 * device. To indicate this situation b_tmp_cdata is NULL'ed, b_asize is
5124 * set to zero and b_compress is set to ZIO_COMPRESS_EMPTY.
5125 * *) Compression succeeded and b_tmp_cdata was replaced with a temporary
5126 * data buffer which holds the compressed data to be written, and b_asize
5127 * tells us how much data there is. b_compress is set to the appropriate
5128 * compression algorithm. Once writing is done, invoke
5129 * l2arc_release_cdata_buf on this l2hdr to free this temporary buffer.
5131 * Returns B_TRUE if compression succeeded, or B_FALSE if it didn't (the
5132 * buffer was incompressible).
5135 l2arc_compress_buf(l2arc_buf_hdr_t
*l2hdr
)
5140 ASSERT(l2hdr
->b_compress
== ZIO_COMPRESS_OFF
);
5141 ASSERT(l2hdr
->b_tmp_cdata
!= NULL
);
5143 len
= l2hdr
->b_asize
;
5144 cdata
= zio_data_buf_alloc(len
);
5145 csize
= zio_compress_data(ZIO_COMPRESS_LZ4
, l2hdr
->b_tmp_cdata
,
5146 cdata
, l2hdr
->b_asize
);
5149 /* zero block, indicate that there's nothing to write */
5150 zio_data_buf_free(cdata
, len
);
5151 l2hdr
->b_compress
= ZIO_COMPRESS_EMPTY
;
5153 l2hdr
->b_tmp_cdata
= NULL
;
5154 ARCSTAT_BUMP(arcstat_l2_compress_zeros
);
5156 } else if (csize
> 0 && csize
< len
) {
5158 * Compression succeeded, we'll keep the cdata around for
5159 * writing and release it afterwards.
5161 l2hdr
->b_compress
= ZIO_COMPRESS_LZ4
;
5162 l2hdr
->b_asize
= csize
;
5163 l2hdr
->b_tmp_cdata
= cdata
;
5164 ARCSTAT_BUMP(arcstat_l2_compress_successes
);
5168 * Compression failed, release the compressed buffer.
5169 * l2hdr will be left unmodified.
5171 zio_data_buf_free(cdata
, len
);
5172 ARCSTAT_BUMP(arcstat_l2_compress_failures
);
5178 * Decompresses a zio read back from an l2arc device. On success, the
5179 * underlying zio's io_data buffer is overwritten by the uncompressed
5180 * version. On decompression error (corrupt compressed stream), the
5181 * zio->io_error value is set to signal an I/O error.
5183 * Please note that the compressed data stream is not checksummed, so
5184 * if the underlying device is experiencing data corruption, we may feed
5185 * corrupt data to the decompressor, so the decompressor needs to be
5186 * able to handle this situation (LZ4 does).
5189 l2arc_decompress_zio(zio_t
*zio
, arc_buf_hdr_t
*hdr
, enum zio_compress c
)
5194 ASSERT(L2ARC_IS_VALID_COMPRESS(c
));
5196 if (zio
->io_error
!= 0) {
5198 * An io error has occured, just restore the original io
5199 * size in preparation for a main pool read.
5201 zio
->io_orig_size
= zio
->io_size
= hdr
->b_size
;
5205 if (c
== ZIO_COMPRESS_EMPTY
) {
5207 * An empty buffer results in a null zio, which means we
5208 * need to fill its io_data after we're done restoring the
5209 * buffer's contents.
5211 ASSERT(hdr
->b_buf
!= NULL
);
5212 bzero(hdr
->b_buf
->b_data
, hdr
->b_size
);
5213 zio
->io_data
= zio
->io_orig_data
= hdr
->b_buf
->b_data
;
5215 ASSERT(zio
->io_data
!= NULL
);
5217 * We copy the compressed data from the start of the arc buffer
5218 * (the zio_read will have pulled in only what we need, the
5219 * rest is garbage which we will overwrite at decompression)
5220 * and then decompress back to the ARC data buffer. This way we
5221 * can minimize copying by simply decompressing back over the
5222 * original compressed data (rather than decompressing to an
5223 * aux buffer and then copying back the uncompressed buffer,
5224 * which is likely to be much larger).
5226 csize
= zio
->io_size
;
5227 cdata
= zio_data_buf_alloc(csize
);
5228 bcopy(zio
->io_data
, cdata
, csize
);
5229 if (zio_decompress_data(c
, cdata
, zio
->io_data
, csize
,
5231 zio
->io_error
= SET_ERROR(EIO
);
5232 zio_data_buf_free(cdata
, csize
);
5235 /* Restore the expected uncompressed IO size. */
5236 zio
->io_orig_size
= zio
->io_size
= hdr
->b_size
;
5240 * Releases the temporary b_tmp_cdata buffer in an l2arc header structure.
5241 * This buffer serves as a temporary holder of compressed data while
5242 * the buffer entry is being written to an l2arc device. Once that is
5243 * done, we can dispose of it.
5246 l2arc_release_cdata_buf(arc_buf_hdr_t
*ab
)
5248 l2arc_buf_hdr_t
*l2hdr
= ab
->b_l2hdr
;
5250 if (l2hdr
->b_compress
== ZIO_COMPRESS_LZ4
) {
5252 * If the data was compressed, then we've allocated a
5253 * temporary buffer for it, so now we need to release it.
5255 ASSERT(l2hdr
->b_tmp_cdata
!= NULL
);
5256 zio_data_buf_free(l2hdr
->b_tmp_cdata
, ab
->b_size
);
5258 l2hdr
->b_tmp_cdata
= NULL
;
5262 * This thread feeds the L2ARC at regular intervals. This is the beating
5263 * heart of the L2ARC.
5266 l2arc_feed_thread(void)
5271 uint64_t size
, wrote
;
5272 clock_t begin
, next
= ddi_get_lbolt();
5273 boolean_t headroom_boost
= B_FALSE
;
5275 CALLB_CPR_INIT(&cpr
, &l2arc_feed_thr_lock
, callb_generic_cpr
, FTAG
);
5277 mutex_enter(&l2arc_feed_thr_lock
);
5279 while (l2arc_thread_exit
== 0) {
5280 CALLB_CPR_SAFE_BEGIN(&cpr
);
5281 (void) cv_timedwait_interruptible(&l2arc_feed_thr_cv
,
5282 &l2arc_feed_thr_lock
, next
);
5283 CALLB_CPR_SAFE_END(&cpr
, &l2arc_feed_thr_lock
);
5284 next
= ddi_get_lbolt() + hz
;
5287 * Quick check for L2ARC devices.
5289 mutex_enter(&l2arc_dev_mtx
);
5290 if (l2arc_ndev
== 0) {
5291 mutex_exit(&l2arc_dev_mtx
);
5294 mutex_exit(&l2arc_dev_mtx
);
5295 begin
= ddi_get_lbolt();
5298 * This selects the next l2arc device to write to, and in
5299 * doing so the next spa to feed from: dev->l2ad_spa. This
5300 * will return NULL if there are now no l2arc devices or if
5301 * they are all faulted.
5303 * If a device is returned, its spa's config lock is also
5304 * held to prevent device removal. l2arc_dev_get_next()
5305 * will grab and release l2arc_dev_mtx.
5307 if ((dev
= l2arc_dev_get_next()) == NULL
)
5310 spa
= dev
->l2ad_spa
;
5311 ASSERT(spa
!= NULL
);
5314 * If the pool is read-only then force the feed thread to
5315 * sleep a little longer.
5317 if (!spa_writeable(spa
)) {
5318 next
= ddi_get_lbolt() + 5 * l2arc_feed_secs
* hz
;
5319 spa_config_exit(spa
, SCL_L2ARC
, dev
);
5324 * Avoid contributing to memory pressure.
5327 ARCSTAT_BUMP(arcstat_l2_abort_lowmem
);
5328 spa_config_exit(spa
, SCL_L2ARC
, dev
);
5332 ARCSTAT_BUMP(arcstat_l2_feeds
);
5334 size
= l2arc_write_size();
5337 * Evict L2ARC buffers that will be overwritten.
5339 l2arc_evict(dev
, size
, B_FALSE
);
5342 * Write ARC buffers.
5344 wrote
= l2arc_write_buffers(spa
, dev
, size
, &headroom_boost
);
5347 * Calculate interval between writes.
5349 next
= l2arc_write_interval(begin
, size
, wrote
);
5350 spa_config_exit(spa
, SCL_L2ARC
, dev
);
5353 l2arc_thread_exit
= 0;
5354 cv_broadcast(&l2arc_feed_thr_cv
);
5355 CALLB_CPR_EXIT(&cpr
); /* drops l2arc_feed_thr_lock */
5360 l2arc_vdev_present(vdev_t
*vd
)
5364 mutex_enter(&l2arc_dev_mtx
);
5365 for (dev
= list_head(l2arc_dev_list
); dev
!= NULL
;
5366 dev
= list_next(l2arc_dev_list
, dev
)) {
5367 if (dev
->l2ad_vdev
== vd
)
5370 mutex_exit(&l2arc_dev_mtx
);
5372 return (dev
!= NULL
);
5376 * Add a vdev for use by the L2ARC. By this point the spa has already
5377 * validated the vdev and opened it.
5380 l2arc_add_vdev(spa_t
*spa
, vdev_t
*vd
)
5382 l2arc_dev_t
*adddev
;
5384 ASSERT(!l2arc_vdev_present(vd
));
5387 * Create a new l2arc device entry.
5389 adddev
= kmem_zalloc(sizeof (l2arc_dev_t
), KM_SLEEP
);
5390 adddev
->l2ad_spa
= spa
;
5391 adddev
->l2ad_vdev
= vd
;
5392 adddev
->l2ad_start
= VDEV_LABEL_START_SIZE
;
5393 adddev
->l2ad_end
= VDEV_LABEL_START_SIZE
+ vdev_get_min_asize(vd
);
5394 adddev
->l2ad_hand
= adddev
->l2ad_start
;
5395 adddev
->l2ad_evict
= adddev
->l2ad_start
;
5396 adddev
->l2ad_first
= B_TRUE
;
5397 adddev
->l2ad_writing
= B_FALSE
;
5398 list_link_init(&adddev
->l2ad_node
);
5401 * This is a list of all ARC buffers that are still valid on the
5404 adddev
->l2ad_buflist
= kmem_zalloc(sizeof (list_t
), KM_SLEEP
);
5405 list_create(adddev
->l2ad_buflist
, sizeof (arc_buf_hdr_t
),
5406 offsetof(arc_buf_hdr_t
, b_l2node
));
5408 vdev_space_update(vd
, 0, 0, adddev
->l2ad_end
- adddev
->l2ad_hand
);
5411 * Add device to global list
5413 mutex_enter(&l2arc_dev_mtx
);
5414 list_insert_head(l2arc_dev_list
, adddev
);
5415 atomic_inc_64(&l2arc_ndev
);
5416 mutex_exit(&l2arc_dev_mtx
);
5420 * Remove a vdev from the L2ARC.
5423 l2arc_remove_vdev(vdev_t
*vd
)
5425 l2arc_dev_t
*dev
, *nextdev
, *remdev
= NULL
;
5428 * Find the device by vdev
5430 mutex_enter(&l2arc_dev_mtx
);
5431 for (dev
= list_head(l2arc_dev_list
); dev
; dev
= nextdev
) {
5432 nextdev
= list_next(l2arc_dev_list
, dev
);
5433 if (vd
== dev
->l2ad_vdev
) {
5438 ASSERT(remdev
!= NULL
);
5441 * Remove device from global list
5443 list_remove(l2arc_dev_list
, remdev
);
5444 l2arc_dev_last
= NULL
; /* may have been invalidated */
5445 atomic_dec_64(&l2arc_ndev
);
5446 mutex_exit(&l2arc_dev_mtx
);
5449 * Clear all buflists and ARC references. L2ARC device flush.
5451 l2arc_evict(remdev
, 0, B_TRUE
);
5452 list_destroy(remdev
->l2ad_buflist
);
5453 kmem_free(remdev
->l2ad_buflist
, sizeof (list_t
));
5454 kmem_free(remdev
, sizeof (l2arc_dev_t
));
5460 l2arc_thread_exit
= 0;
5462 l2arc_writes_sent
= 0;
5463 l2arc_writes_done
= 0;
5465 mutex_init(&l2arc_feed_thr_lock
, NULL
, MUTEX_DEFAULT
, NULL
);
5466 cv_init(&l2arc_feed_thr_cv
, NULL
, CV_DEFAULT
, NULL
);
5467 mutex_init(&l2arc_dev_mtx
, NULL
, MUTEX_DEFAULT
, NULL
);
5468 mutex_init(&l2arc_buflist_mtx
, NULL
, MUTEX_DEFAULT
, NULL
);
5469 mutex_init(&l2arc_free_on_write_mtx
, NULL
, MUTEX_DEFAULT
, NULL
);
5471 l2arc_dev_list
= &L2ARC_dev_list
;
5472 l2arc_free_on_write
= &L2ARC_free_on_write
;
5473 list_create(l2arc_dev_list
, sizeof (l2arc_dev_t
),
5474 offsetof(l2arc_dev_t
, l2ad_node
));
5475 list_create(l2arc_free_on_write
, sizeof (l2arc_data_free_t
),
5476 offsetof(l2arc_data_free_t
, l2df_list_node
));
5483 * This is called from dmu_fini(), which is called from spa_fini();
5484 * Because of this, we can assume that all l2arc devices have
5485 * already been removed when the pools themselves were removed.
5488 l2arc_do_free_on_write();
5490 mutex_destroy(&l2arc_feed_thr_lock
);
5491 cv_destroy(&l2arc_feed_thr_cv
);
5492 mutex_destroy(&l2arc_dev_mtx
);
5493 mutex_destroy(&l2arc_buflist_mtx
);
5494 mutex_destroy(&l2arc_free_on_write_mtx
);
5496 list_destroy(l2arc_dev_list
);
5497 list_destroy(l2arc_free_on_write
);
5503 if (!(spa_mode_global
& FWRITE
))
5506 (void) thread_create(NULL
, 0, l2arc_feed_thread
, NULL
, 0, &p0
,
5507 TS_RUN
, minclsyspri
);
5513 if (!(spa_mode_global
& FWRITE
))
5516 mutex_enter(&l2arc_feed_thr_lock
);
5517 cv_signal(&l2arc_feed_thr_cv
); /* kick thread out of startup */
5518 l2arc_thread_exit
= 1;
5519 while (l2arc_thread_exit
!= 0)
5520 cv_wait(&l2arc_feed_thr_cv
, &l2arc_feed_thr_lock
);
5521 mutex_exit(&l2arc_feed_thr_lock
);
5524 #if defined(_KERNEL) && defined(HAVE_SPL)
5525 EXPORT_SYMBOL(arc_read
);
5526 EXPORT_SYMBOL(arc_buf_remove_ref
);
5527 EXPORT_SYMBOL(arc_buf_info
);
5528 EXPORT_SYMBOL(arc_getbuf_func
);
5529 EXPORT_SYMBOL(arc_add_prune_callback
);
5530 EXPORT_SYMBOL(arc_remove_prune_callback
);
5532 module_param(zfs_arc_min
, ulong
, 0644);
5533 MODULE_PARM_DESC(zfs_arc_min
, "Min arc size");
5535 module_param(zfs_arc_max
, ulong
, 0644);
5536 MODULE_PARM_DESC(zfs_arc_max
, "Max arc size");
5538 module_param(zfs_arc_meta_limit
, ulong
, 0644);
5539 MODULE_PARM_DESC(zfs_arc_meta_limit
, "Meta limit for arc size");
5541 module_param(zfs_arc_meta_prune
, int, 0644);
5542 MODULE_PARM_DESC(zfs_arc_meta_prune
, "Bytes of meta data to prune");
5544 module_param(zfs_arc_grow_retry
, int, 0644);
5545 MODULE_PARM_DESC(zfs_arc_grow_retry
, "Seconds before growing arc size");
5547 module_param(zfs_arc_shrink_shift
, int, 0644);
5548 MODULE_PARM_DESC(zfs_arc_shrink_shift
, "log2(fraction of arc to reclaim)");
5550 module_param(zfs_arc_p_min_shift
, int, 0644);
5551 MODULE_PARM_DESC(zfs_arc_p_min_shift
, "arc_c shift to calc min/max arc_p");
5553 module_param(zfs_disable_dup_eviction
, int, 0644);
5554 MODULE_PARM_DESC(zfs_disable_dup_eviction
, "disable duplicate buffer eviction");
5556 module_param(zfs_arc_memory_throttle_disable
, int, 0644);
5557 MODULE_PARM_DESC(zfs_arc_memory_throttle_disable
, "disable memory throttle");
5559 module_param(zfs_arc_min_prefetch_lifespan
, int, 0644);
5560 MODULE_PARM_DESC(zfs_arc_min_prefetch_lifespan
, "Min life of prefetch block");
5562 module_param(l2arc_write_max
, ulong
, 0644);
5563 MODULE_PARM_DESC(l2arc_write_max
, "Max write bytes per interval");
5565 module_param(l2arc_write_boost
, ulong
, 0644);
5566 MODULE_PARM_DESC(l2arc_write_boost
, "Extra write bytes during device warmup");
5568 module_param(l2arc_headroom
, ulong
, 0644);
5569 MODULE_PARM_DESC(l2arc_headroom
, "Number of max device writes to precache");
5571 module_param(l2arc_headroom_boost
, ulong
, 0644);
5572 MODULE_PARM_DESC(l2arc_headroom_boost
, "Compressed l2arc_headroom multiplier");
5574 module_param(l2arc_feed_secs
, ulong
, 0644);
5575 MODULE_PARM_DESC(l2arc_feed_secs
, "Seconds between L2ARC writing");
5577 module_param(l2arc_feed_min_ms
, ulong
, 0644);
5578 MODULE_PARM_DESC(l2arc_feed_min_ms
, "Min feed interval in milliseconds");
5580 module_param(l2arc_noprefetch
, int, 0644);
5581 MODULE_PARM_DESC(l2arc_noprefetch
, "Skip caching prefetched buffers");
5583 module_param(l2arc_nocompress
, int, 0644);
5584 MODULE_PARM_DESC(l2arc_nocompress
, "Skip compressing L2ARC buffers");
5586 module_param(l2arc_feed_again
, int, 0644);
5587 MODULE_PARM_DESC(l2arc_feed_again
, "Turbo L2ARC warmup");
5589 module_param(l2arc_norw
, int, 0644);
5590 MODULE_PARM_DESC(l2arc_norw
, "No reads during writes");