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) 2011 by Delphix. All rights reserved.
28 * DVA-based Adjustable Replacement Cache
30 * While much of the theory of operation used here is
31 * based on the self-tuning, low overhead replacement cache
32 * presented by Megiddo and Modha at FAST 2003, there are some
33 * significant differences:
35 * 1. The Megiddo and Modha model assumes any page is evictable.
36 * Pages in its cache cannot be "locked" into memory. This makes
37 * the eviction algorithm simple: evict the last page in the list.
38 * This also make the performance characteristics easy to reason
39 * about. Our cache is not so simple. At any given moment, some
40 * subset of the blocks in the cache are un-evictable because we
41 * have handed out a reference to them. Blocks are only evictable
42 * when there are no external references active. This makes
43 * eviction far more problematic: we choose to evict the evictable
44 * blocks that are the "lowest" in the list.
46 * There are times when it is not possible to evict the requested
47 * space. In these circumstances we are unable to adjust the cache
48 * size. To prevent the cache growing unbounded at these times we
49 * implement a "cache throttle" that slows the flow of new data
50 * into the cache until we can make space available.
52 * 2. The Megiddo and Modha model assumes a fixed cache size.
53 * Pages are evicted when the cache is full and there is a cache
54 * miss. Our model has a variable sized cache. It grows with
55 * high use, but also tries to react to memory pressure from the
56 * operating system: decreasing its size when system memory is
59 * 3. The Megiddo and Modha model assumes a fixed page size. All
60 * elements of the cache are therefor exactly the same size. So
61 * when adjusting the cache size following a cache miss, its simply
62 * a matter of choosing a single page to evict. In our model, we
63 * have variable sized cache blocks (rangeing from 512 bytes to
64 * 128K bytes). We therefor choose a set of blocks to evict to make
65 * space for a cache miss that approximates as closely as possible
66 * the space used by the new block.
68 * See also: "ARC: A Self-Tuning, Low Overhead Replacement Cache"
69 * by N. Megiddo & D. Modha, FAST 2003
75 * A new reference to a cache buffer can be obtained in two
76 * ways: 1) via a hash table lookup using the DVA as a key,
77 * or 2) via one of the ARC lists. The arc_read() interface
78 * uses method 1, while the internal arc algorithms for
79 * adjusting the cache use method 2. We therefor provide two
80 * types of locks: 1) the hash table lock array, and 2) the
83 * Buffers do not have their own mutexes, rather they rely on the
84 * hash table mutexes for the bulk of their protection (i.e. most
85 * fields in the arc_buf_hdr_t are protected by these mutexes).
87 * buf_hash_find() returns the appropriate mutex (held) when it
88 * locates the requested buffer in the hash table. It returns
89 * NULL for the mutex if the buffer was not in the table.
91 * buf_hash_remove() expects the appropriate hash mutex to be
92 * already held before it is invoked.
94 * Each arc state also has a mutex which is used to protect the
95 * buffer list associated with the state. When attempting to
96 * obtain a hash table lock while holding an arc list lock you
97 * must use: mutex_tryenter() to avoid deadlock. Also note that
98 * the active state mutex must be held before the ghost state mutex.
100 * Arc buffers may have an associated eviction callback function.
101 * This function will be invoked prior to removing the buffer (e.g.
102 * in arc_do_user_evicts()). Note however that the data associated
103 * with the buffer may be evicted prior to the callback. The callback
104 * must be made with *no locks held* (to prevent deadlock). Additionally,
105 * the users of callbacks must ensure that their private data is
106 * protected from simultaneous callbacks from arc_buf_evict()
107 * and arc_do_user_evicts().
109 * It as also possible to register a callback which is run when the
110 * arc_meta_limit is reached and no buffers can be safely evicted. In
111 * this case the arc user should drop a reference on some arc buffers so
112 * they can be reclaimed and the arc_meta_limit honored. For example,
113 * when using the ZPL each dentry holds a references on a znode. These
114 * dentries must be pruned before the arc buffer holding the znode can
117 * Note that the majority of the performance stats are manipulated
118 * with atomic operations.
120 * The L2ARC uses the l2arc_buflist_mtx global mutex for the following:
122 * - L2ARC buflist creation
123 * - L2ARC buflist eviction
124 * - L2ARC write completion, which walks L2ARC buflists
125 * - ARC header destruction, as it removes from L2ARC buflists
126 * - ARC header release, as it removes from L2ARC buflists
131 #include <sys/zfs_context.h>
133 #include <sys/vdev.h>
134 #include <sys/vdev_impl.h>
136 #include <sys/vmsystm.h>
138 #include <sys/fs/swapnode.h>
141 #include <sys/callb.h>
142 #include <sys/kstat.h>
143 #include <sys/dmu_tx.h>
144 #include <zfs_fletcher.h>
146 static kmutex_t arc_reclaim_thr_lock;
147 static kcondvar_t arc_reclaim_thr_cv; /* used to signal reclaim thr */
148 static uint8_t arc_thread_exit;
150 /* number of bytes to prune from caches when at arc_meta_limit is reached */
151 uint_t arc_meta_prune = 1048576;
153 typedef enum arc_reclaim_strategy {
154 ARC_RECLAIM_AGGR, /* Aggressive reclaim strategy */
155 ARC_RECLAIM_CONS /* Conservative reclaim strategy */
156 } arc_reclaim_strategy_t;
158 /* number of seconds before growing cache again */
159 static int arc_grow_retry = 5;
161 /* expiration time for arc_no_grow */
162 static clock_t arc_grow_time = 0;
164 /* shift of arc_c for calculating both min and max arc_p */
165 static int arc_p_min_shift = 4;
167 /* log2(fraction of arc to reclaim) */
168 static int arc_shrink_shift = 5;
171 * minimum lifespan of a prefetch block in clock ticks
172 * (initialized in arc_init())
174 static int arc_min_prefetch_lifespan;
179 * The arc has filled available memory and has now warmed up.
181 static boolean_t arc_warm;
184 * These tunables are for performance analysis.
186 unsigned long zfs_arc_max = 0;
187 unsigned long zfs_arc_min = 0;
188 unsigned long zfs_arc_meta_limit = 0;
189 int zfs_arc_grow_retry = 0;
190 int zfs_arc_shrink_shift = 0;
191 int zfs_arc_p_min_shift = 0;
192 int zfs_arc_memory_throttle_disable = 1;
193 int zfs_disable_dup_eviction = 0;
194 int zfs_arc_meta_prune = 0;
197 * Note that buffers can be in one of 6 states:
198 * ARC_anon - anonymous (discussed below)
199 * ARC_mru - recently used, currently cached
200 * ARC_mru_ghost - recentely used, no longer in cache
201 * ARC_mfu - frequently used, currently cached
202 * ARC_mfu_ghost - frequently used, no longer in cache
203 * ARC_l2c_only - exists in L2ARC but not other states
204 * When there are no active references to the buffer, they are
205 * are linked onto a list in one of these arc states. These are
206 * the only buffers that can be evicted or deleted. Within each
207 * state there are multiple lists, one for meta-data and one for
208 * non-meta-data. Meta-data (indirect blocks, blocks of dnodes,
209 * etc.) is tracked separately so that it can be managed more
210 * explicitly: favored over data, limited explicitly.
212 * Anonymous buffers are buffers that are not associated with
213 * a DVA. These are buffers that hold dirty block copies
214 * before they are written to stable storage. By definition,
215 * they are "ref'd" and are considered part of arc_mru
216 * that cannot be freed. Generally, they will aquire a DVA
217 * as they are written and migrate onto the arc_mru list.
219 * The ARC_l2c_only state is for buffers that are in the second
220 * level ARC but no longer in any of the ARC_m* lists. The second
221 * level ARC itself may also contain buffers that are in any of
222 * the ARC_m* states - meaning that a buffer can exist in two
223 * places. The reason for the ARC_l2c_only state is to keep the
224 * buffer header in the hash table, so that reads that hit the
225 * second level ARC benefit from these fast lookups.
228 typedef struct arc_state {
229 list_t arcs_list[ARC_BUFC_NUMTYPES]; /* list of evictable buffers */
230 uint64_t arcs_lsize[ARC_BUFC_NUMTYPES]; /* amount of evictable data */
231 uint64_t arcs_size; /* total amount of data in this state */
236 static arc_state_t ARC_anon;
237 static arc_state_t ARC_mru;
238 static arc_state_t ARC_mru_ghost;
239 static arc_state_t ARC_mfu;
240 static arc_state_t ARC_mfu_ghost;
241 static arc_state_t ARC_l2c_only;
243 typedef struct arc_stats {
244 kstat_named_t arcstat_hits;
245 kstat_named_t arcstat_misses;
246 kstat_named_t arcstat_demand_data_hits;
247 kstat_named_t arcstat_demand_data_misses;
248 kstat_named_t arcstat_demand_metadata_hits;
249 kstat_named_t arcstat_demand_metadata_misses;
250 kstat_named_t arcstat_prefetch_data_hits;
251 kstat_named_t arcstat_prefetch_data_misses;
252 kstat_named_t arcstat_prefetch_metadata_hits;
253 kstat_named_t arcstat_prefetch_metadata_misses;
254 kstat_named_t arcstat_mru_hits;
255 kstat_named_t arcstat_mru_ghost_hits;
256 kstat_named_t arcstat_mfu_hits;
257 kstat_named_t arcstat_mfu_ghost_hits;
258 kstat_named_t arcstat_deleted;
259 kstat_named_t arcstat_recycle_miss;
260 kstat_named_t arcstat_mutex_miss;
261 kstat_named_t arcstat_evict_skip;
262 kstat_named_t arcstat_evict_l2_cached;
263 kstat_named_t arcstat_evict_l2_eligible;
264 kstat_named_t arcstat_evict_l2_ineligible;
265 kstat_named_t arcstat_hash_elements;
266 kstat_named_t arcstat_hash_elements_max;
267 kstat_named_t arcstat_hash_collisions;
268 kstat_named_t arcstat_hash_chains;
269 kstat_named_t arcstat_hash_chain_max;
270 kstat_named_t arcstat_p;
271 kstat_named_t arcstat_c;
272 kstat_named_t arcstat_c_min;
273 kstat_named_t arcstat_c_max;
274 kstat_named_t arcstat_size;
275 kstat_named_t arcstat_hdr_size;
276 kstat_named_t arcstat_data_size;
277 kstat_named_t arcstat_other_size;
278 kstat_named_t arcstat_anon_size;
279 kstat_named_t arcstat_anon_evict_data;
280 kstat_named_t arcstat_anon_evict_metadata;
281 kstat_named_t arcstat_mru_size;
282 kstat_named_t arcstat_mru_evict_data;
283 kstat_named_t arcstat_mru_evict_metadata;
284 kstat_named_t arcstat_mru_ghost_size;
285 kstat_named_t arcstat_mru_ghost_evict_data;
286 kstat_named_t arcstat_mru_ghost_evict_metadata;
287 kstat_named_t arcstat_mfu_size;
288 kstat_named_t arcstat_mfu_evict_data;
289 kstat_named_t arcstat_mfu_evict_metadata;
290 kstat_named_t arcstat_mfu_ghost_size;
291 kstat_named_t arcstat_mfu_ghost_evict_data;
292 kstat_named_t arcstat_mfu_ghost_evict_metadata;
293 kstat_named_t arcstat_l2_hits;
294 kstat_named_t arcstat_l2_misses;
295 kstat_named_t arcstat_l2_feeds;
296 kstat_named_t arcstat_l2_rw_clash;
297 kstat_named_t arcstat_l2_read_bytes;
298 kstat_named_t arcstat_l2_write_bytes;
299 kstat_named_t arcstat_l2_writes_sent;
300 kstat_named_t arcstat_l2_writes_done;
301 kstat_named_t arcstat_l2_writes_error;
302 kstat_named_t arcstat_l2_writes_hdr_miss;
303 kstat_named_t arcstat_l2_evict_lock_retry;
304 kstat_named_t arcstat_l2_evict_reading;
305 kstat_named_t arcstat_l2_free_on_write;
306 kstat_named_t arcstat_l2_abort_lowmem;
307 kstat_named_t arcstat_l2_cksum_bad;
308 kstat_named_t arcstat_l2_io_error;
309 kstat_named_t arcstat_l2_size;
310 kstat_named_t arcstat_l2_hdr_size;
311 kstat_named_t arcstat_memory_throttle_count;
312 kstat_named_t arcstat_duplicate_buffers;
313 kstat_named_t arcstat_duplicate_buffers_size;
314 kstat_named_t arcstat_duplicate_reads;
315 kstat_named_t arcstat_memory_direct_count;
316 kstat_named_t arcstat_memory_indirect_count;
317 kstat_named_t arcstat_no_grow;
318 kstat_named_t arcstat_tempreserve;
319 kstat_named_t arcstat_loaned_bytes;
320 kstat_named_t arcstat_prune;
321 kstat_named_t arcstat_meta_used;
322 kstat_named_t arcstat_meta_limit;
323 kstat_named_t arcstat_meta_max;
326 static arc_stats_t arc_stats = {
327 { "hits", KSTAT_DATA_UINT64 },
328 { "misses", KSTAT_DATA_UINT64 },
329 { "demand_data_hits", KSTAT_DATA_UINT64 },
330 { "demand_data_misses", KSTAT_DATA_UINT64 },
331 { "demand_metadata_hits", KSTAT_DATA_UINT64 },
332 { "demand_metadata_misses", KSTAT_DATA_UINT64 },
333 { "prefetch_data_hits", KSTAT_DATA_UINT64 },
334 { "prefetch_data_misses", KSTAT_DATA_UINT64 },
335 { "prefetch_metadata_hits", KSTAT_DATA_UINT64 },
336 { "prefetch_metadata_misses", KSTAT_DATA_UINT64 },
337 { "mru_hits", KSTAT_DATA_UINT64 },
338 { "mru_ghost_hits", KSTAT_DATA_UINT64 },
339 { "mfu_hits", KSTAT_DATA_UINT64 },
340 { "mfu_ghost_hits", KSTAT_DATA_UINT64 },
341 { "deleted", KSTAT_DATA_UINT64 },
342 { "recycle_miss", KSTAT_DATA_UINT64 },
343 { "mutex_miss", KSTAT_DATA_UINT64 },
344 { "evict_skip", KSTAT_DATA_UINT64 },
345 { "evict_l2_cached", KSTAT_DATA_UINT64 },
346 { "evict_l2_eligible", KSTAT_DATA_UINT64 },
347 { "evict_l2_ineligible", KSTAT_DATA_UINT64 },
348 { "hash_elements", KSTAT_DATA_UINT64 },
349 { "hash_elements_max", KSTAT_DATA_UINT64 },
350 { "hash_collisions", KSTAT_DATA_UINT64 },
351 { "hash_chains", KSTAT_DATA_UINT64 },
352 { "hash_chain_max", KSTAT_DATA_UINT64 },
353 { "p", KSTAT_DATA_UINT64 },
354 { "c", KSTAT_DATA_UINT64 },
355 { "c_min", KSTAT_DATA_UINT64 },
356 { "c_max", KSTAT_DATA_UINT64 },
357 { "size", KSTAT_DATA_UINT64 },
358 { "hdr_size", KSTAT_DATA_UINT64 },
359 { "data_size", KSTAT_DATA_UINT64 },
360 { "other_size", KSTAT_DATA_UINT64 },
361 { "anon_size", KSTAT_DATA_UINT64 },
362 { "anon_evict_data", KSTAT_DATA_UINT64 },
363 { "anon_evict_metadata", KSTAT_DATA_UINT64 },
364 { "mru_size", KSTAT_DATA_UINT64 },
365 { "mru_evict_data", KSTAT_DATA_UINT64 },
366 { "mru_evict_metadata", KSTAT_DATA_UINT64 },
367 { "mru_ghost_size", KSTAT_DATA_UINT64 },
368 { "mru_ghost_evict_data", KSTAT_DATA_UINT64 },
369 { "mru_ghost_evict_metadata", KSTAT_DATA_UINT64 },
370 { "mfu_size", KSTAT_DATA_UINT64 },
371 { "mfu_evict_data", KSTAT_DATA_UINT64 },
372 { "mfu_evict_metadata", KSTAT_DATA_UINT64 },
373 { "mfu_ghost_size", KSTAT_DATA_UINT64 },
374 { "mfu_ghost_evict_data", KSTAT_DATA_UINT64 },
375 { "mfu_ghost_evict_metadata", KSTAT_DATA_UINT64 },
376 { "l2_hits", KSTAT_DATA_UINT64 },
377 { "l2_misses", KSTAT_DATA_UINT64 },
378 { "l2_feeds", KSTAT_DATA_UINT64 },
379 { "l2_rw_clash", KSTAT_DATA_UINT64 },
380 { "l2_read_bytes", KSTAT_DATA_UINT64 },
381 { "l2_write_bytes", KSTAT_DATA_UINT64 },
382 { "l2_writes_sent", KSTAT_DATA_UINT64 },
383 { "l2_writes_done", KSTAT_DATA_UINT64 },
384 { "l2_writes_error", KSTAT_DATA_UINT64 },
385 { "l2_writes_hdr_miss", KSTAT_DATA_UINT64 },
386 { "l2_evict_lock_retry", KSTAT_DATA_UINT64 },
387 { "l2_evict_reading", KSTAT_DATA_UINT64 },
388 { "l2_free_on_write", KSTAT_DATA_UINT64 },
389 { "l2_abort_lowmem", KSTAT_DATA_UINT64 },
390 { "l2_cksum_bad", KSTAT_DATA_UINT64 },
391 { "l2_io_error", KSTAT_DATA_UINT64 },
392 { "l2_size", KSTAT_DATA_UINT64 },
393 { "l2_hdr_size", KSTAT_DATA_UINT64 },
394 { "memory_throttle_count", KSTAT_DATA_UINT64 },
395 { "duplicate_buffers", KSTAT_DATA_UINT64 },
396 { "duplicate_buffers_size", KSTAT_DATA_UINT64 },
397 { "duplicate_reads", KSTAT_DATA_UINT64 },
398 { "memory_direct_count", KSTAT_DATA_UINT64 },
399 { "memory_indirect_count", KSTAT_DATA_UINT64 },
400 { "arc_no_grow", KSTAT_DATA_UINT64 },
401 { "arc_tempreserve", KSTAT_DATA_UINT64 },
402 { "arc_loaned_bytes", KSTAT_DATA_UINT64 },
403 { "arc_prune", KSTAT_DATA_UINT64 },
404 { "arc_meta_used", KSTAT_DATA_UINT64 },
405 { "arc_meta_limit", KSTAT_DATA_UINT64 },
406 { "arc_meta_max", KSTAT_DATA_UINT64 },
409 #define ARCSTAT(stat) (arc_stats.stat.value.ui64)
411 #define ARCSTAT_INCR(stat, val) \
412 atomic_add_64(&arc_stats.stat.value.ui64, (val));
414 #define ARCSTAT_BUMP(stat) ARCSTAT_INCR(stat, 1)
415 #define ARCSTAT_BUMPDOWN(stat) ARCSTAT_INCR(stat, -1)
417 #define ARCSTAT_MAX(stat, val) { \
419 while ((val) > (m = arc_stats.stat.value.ui64) && \
420 (m != atomic_cas_64(&arc_stats.stat.value.ui64, m, (val)))) \
424 #define ARCSTAT_MAXSTAT(stat) \
425 ARCSTAT_MAX(stat##_max, arc_stats.stat.value.ui64)
428 * We define a macro to allow ARC hits/misses to be easily broken down by
429 * two separate conditions, giving a total of four different subtypes for
430 * each of hits and misses (so eight statistics total).
432 #define ARCSTAT_CONDSTAT(cond1, stat1, notstat1, cond2, stat2, notstat2, stat) \
435 ARCSTAT_BUMP(arcstat_##stat1##_##stat2##_##stat); \
437 ARCSTAT_BUMP(arcstat_##stat1##_##notstat2##_##stat); \
441 ARCSTAT_BUMP(arcstat_##notstat1##_##stat2##_##stat); \
443 ARCSTAT_BUMP(arcstat_##notstat1##_##notstat2##_##stat);\
448 static arc_state_t *arc_anon;
449 static arc_state_t *arc_mru;
450 static arc_state_t *arc_mru_ghost;
451 static arc_state_t *arc_mfu;
452 static arc_state_t *arc_mfu_ghost;
453 static arc_state_t *arc_l2c_only;
456 * There are several ARC variables that are critical to export as kstats --
457 * but we don't want to have to grovel around in the kstat whenever we wish to
458 * manipulate them. For these variables, we therefore define them to be in
459 * terms of the statistic variable. This assures that we are not introducing
460 * the possibility of inconsistency by having shadow copies of the variables,
461 * while still allowing the code to be readable.
463 #define arc_size ARCSTAT(arcstat_size) /* actual total arc size */
464 #define arc_p ARCSTAT(arcstat_p) /* target size of MRU */
465 #define arc_c ARCSTAT(arcstat_c) /* target size of cache */
466 #define arc_c_min ARCSTAT(arcstat_c_min) /* min target cache size */
467 #define arc_c_max ARCSTAT(arcstat_c_max) /* max target cache size */
468 #define arc_no_grow ARCSTAT(arcstat_no_grow)
469 #define arc_tempreserve ARCSTAT(arcstat_tempreserve)
470 #define arc_loaned_bytes ARCSTAT(arcstat_loaned_bytes)
471 #define arc_meta_used ARCSTAT(arcstat_meta_used)
472 #define arc_meta_limit ARCSTAT(arcstat_meta_limit)
473 #define arc_meta_max ARCSTAT(arcstat_meta_max)
475 typedef struct l2arc_buf_hdr l2arc_buf_hdr_t;
477 typedef struct arc_callback arc_callback_t;
479 struct arc_callback {
481 arc_done_func_t *acb_done;
483 zio_t *acb_zio_dummy;
484 arc_callback_t *acb_next;
487 typedef struct arc_write_callback arc_write_callback_t;
489 struct arc_write_callback {
491 arc_done_func_t *awcb_ready;
492 arc_done_func_t *awcb_done;
497 /* protected by hash lock */
502 kmutex_t b_freeze_lock;
503 zio_cksum_t *b_freeze_cksum;
506 arc_buf_hdr_t *b_hash_next;
511 arc_callback_t *b_acb;
515 arc_buf_contents_t b_type;
519 /* protected by arc state mutex */
520 arc_state_t *b_state;
521 list_node_t b_arc_node;
523 /* updated atomically */
524 clock_t b_arc_access;
526 /* self protecting */
529 l2arc_buf_hdr_t *b_l2hdr;
530 list_node_t b_l2node;
533 static list_t arc_prune_list;
534 static kmutex_t arc_prune_mtx;
535 static arc_buf_t *arc_eviction_list;
536 static kmutex_t arc_eviction_mtx;
537 static arc_buf_hdr_t arc_eviction_hdr;
538 static void arc_get_data_buf(arc_buf_t *buf);
539 static void arc_access(arc_buf_hdr_t *buf, kmutex_t *hash_lock);
540 static int arc_evict_needed(arc_buf_contents_t type);
541 static void arc_evict_ghost(arc_state_t *state, uint64_t spa, int64_t bytes);
543 static boolean_t l2arc_write_eligible(uint64_t spa_guid, arc_buf_hdr_t *ab);
545 #define GHOST_STATE(state) \
546 ((state) == arc_mru_ghost || (state) == arc_mfu_ghost || \
547 (state) == arc_l2c_only)
550 * Private ARC flags. These flags are private ARC only flags that will show up
551 * in b_flags in the arc_hdr_buf_t. Some flags are publicly declared, and can
552 * be passed in as arc_flags in things like arc_read. However, these flags
553 * should never be passed and should only be set by ARC code. When adding new
554 * public flags, make sure not to smash the private ones.
557 #define ARC_IN_HASH_TABLE (1 << 9) /* this buffer is hashed */
558 #define ARC_IO_IN_PROGRESS (1 << 10) /* I/O in progress for buf */
559 #define ARC_IO_ERROR (1 << 11) /* I/O failed for buf */
560 #define ARC_FREED_IN_READ (1 << 12) /* buf freed while in read */
561 #define ARC_BUF_AVAILABLE (1 << 13) /* block not in active use */
562 #define ARC_INDIRECT (1 << 14) /* this is an indirect block */
563 #define ARC_FREE_IN_PROGRESS (1 << 15) /* hdr about to be freed */
564 #define ARC_L2_WRITING (1 << 16) /* L2ARC write in progress */
565 #define ARC_L2_EVICTED (1 << 17) /* evicted during I/O */
566 #define ARC_L2_WRITE_HEAD (1 << 18) /* head of write list */
568 #define HDR_IN_HASH_TABLE(hdr) ((hdr)->b_flags & ARC_IN_HASH_TABLE)
569 #define HDR_IO_IN_PROGRESS(hdr) ((hdr)->b_flags & ARC_IO_IN_PROGRESS)
570 #define HDR_IO_ERROR(hdr) ((hdr)->b_flags & ARC_IO_ERROR)
571 #define HDR_PREFETCH(hdr) ((hdr)->b_flags & ARC_PREFETCH)
572 #define HDR_FREED_IN_READ(hdr) ((hdr)->b_flags & ARC_FREED_IN_READ)
573 #define HDR_BUF_AVAILABLE(hdr) ((hdr)->b_flags & ARC_BUF_AVAILABLE)
574 #define HDR_FREE_IN_PROGRESS(hdr) ((hdr)->b_flags & ARC_FREE_IN_PROGRESS)
575 #define HDR_L2CACHE(hdr) ((hdr)->b_flags & ARC_L2CACHE)
576 #define HDR_L2_READING(hdr) ((hdr)->b_flags & ARC_IO_IN_PROGRESS && \
577 (hdr)->b_l2hdr != NULL)
578 #define HDR_L2_WRITING(hdr) ((hdr)->b_flags & ARC_L2_WRITING)
579 #define HDR_L2_EVICTED(hdr) ((hdr)->b_flags & ARC_L2_EVICTED)
580 #define HDR_L2_WRITE_HEAD(hdr) ((hdr)->b_flags & ARC_L2_WRITE_HEAD)
586 #define HDR_SIZE ((int64_t)sizeof (arc_buf_hdr_t))
587 #define L2HDR_SIZE ((int64_t)sizeof (l2arc_buf_hdr_t))
590 * Hash table routines
593 #define HT_LOCK_ALIGN 64
594 #define HT_LOCK_PAD (P2NPHASE(sizeof (kmutex_t), (HT_LOCK_ALIGN)))
599 unsigned char pad[HT_LOCK_PAD];
603 #define BUF_LOCKS 256
604 typedef struct buf_hash_table {
606 arc_buf_hdr_t **ht_table;
607 struct ht_lock ht_locks[BUF_LOCKS];
610 static buf_hash_table_t buf_hash_table;
612 #define BUF_HASH_INDEX(spa, dva, birth) \
613 (buf_hash(spa, dva, birth) & buf_hash_table.ht_mask)
614 #define BUF_HASH_LOCK_NTRY(idx) (buf_hash_table.ht_locks[idx & (BUF_LOCKS-1)])
615 #define BUF_HASH_LOCK(idx) (&(BUF_HASH_LOCK_NTRY(idx).ht_lock))
616 #define HDR_LOCK(hdr) \
617 (BUF_HASH_LOCK(BUF_HASH_INDEX(hdr->b_spa, &hdr->b_dva, hdr->b_birth)))
619 uint64_t zfs_crc64_table[256];
625 #define L2ARC_WRITE_SIZE (8 * 1024 * 1024) /* initial write max */
626 #define L2ARC_HEADROOM 2 /* num of writes */
627 #define L2ARC_FEED_SECS 1 /* caching interval secs */
628 #define L2ARC_FEED_MIN_MS 200 /* min caching interval ms */
630 #define l2arc_writes_sent ARCSTAT(arcstat_l2_writes_sent)
631 #define l2arc_writes_done ARCSTAT(arcstat_l2_writes_done)
634 * L2ARC Performance Tunables
636 unsigned long l2arc_write_max = L2ARC_WRITE_SIZE; /* def max write size */
637 unsigned long l2arc_write_boost = L2ARC_WRITE_SIZE; /* extra warmup write */
638 unsigned long l2arc_headroom = L2ARC_HEADROOM; /* # of dev writes */
639 unsigned long l2arc_feed_secs = L2ARC_FEED_SECS; /* interval seconds */
640 unsigned long l2arc_feed_min_ms = L2ARC_FEED_MIN_MS; /* min interval msecs */
641 int l2arc_noprefetch = B_TRUE; /* don't cache prefetch bufs */
642 int l2arc_feed_again = B_TRUE; /* turbo warmup */
643 int l2arc_norw = B_TRUE; /* no reads during writes */
648 typedef struct l2arc_dev {
649 vdev_t *l2ad_vdev; /* vdev */
650 spa_t *l2ad_spa; /* spa */
651 uint64_t l2ad_hand; /* next write location */
652 uint64_t l2ad_write; /* desired write size, bytes */
653 uint64_t l2ad_boost; /* warmup write boost, bytes */
654 uint64_t l2ad_start; /* first addr on device */
655 uint64_t l2ad_end; /* last addr on device */
656 uint64_t l2ad_evict; /* last addr eviction reached */
657 boolean_t l2ad_first; /* first sweep through */
658 boolean_t l2ad_writing; /* currently writing */
659 list_t *l2ad_buflist; /* buffer list */
660 list_node_t l2ad_node; /* device list node */
663 static list_t L2ARC_dev_list; /* device list */
664 static list_t *l2arc_dev_list; /* device list pointer */
665 static kmutex_t l2arc_dev_mtx; /* device list mutex */
666 static l2arc_dev_t *l2arc_dev_last; /* last device used */
667 static kmutex_t l2arc_buflist_mtx; /* mutex for all buflists */
668 static list_t L2ARC_free_on_write; /* free after write buf list */
669 static list_t *l2arc_free_on_write; /* free after write list ptr */
670 static kmutex_t l2arc_free_on_write_mtx; /* mutex for list */
671 static uint64_t l2arc_ndev; /* number of devices */
673 typedef struct l2arc_read_callback {
674 arc_buf_t *l2rcb_buf; /* read buffer */
675 spa_t *l2rcb_spa; /* spa */
676 blkptr_t l2rcb_bp; /* original blkptr */
677 zbookmark_t l2rcb_zb; /* original bookmark */
678 int l2rcb_flags; /* original flags */
679 } l2arc_read_callback_t;
681 typedef struct l2arc_write_callback {
682 l2arc_dev_t *l2wcb_dev; /* device info */
683 arc_buf_hdr_t *l2wcb_head; /* head of write buflist */
684 } l2arc_write_callback_t;
686 struct l2arc_buf_hdr {
687 /* protected by arc_buf_hdr mutex */
688 l2arc_dev_t *b_dev; /* L2ARC device */
689 uint64_t b_daddr; /* disk address, offset byte */
692 typedef struct l2arc_data_free {
693 /* protected by l2arc_free_on_write_mtx */
696 void (*l2df_func)(void *, size_t);
697 list_node_t l2df_list_node;
700 static kmutex_t l2arc_feed_thr_lock;
701 static kcondvar_t l2arc_feed_thr_cv;
702 static uint8_t l2arc_thread_exit;
704 static void l2arc_read_done(zio_t *zio);
705 static void l2arc_hdr_stat_add(void);
706 static void l2arc_hdr_stat_remove(void);
709 buf_hash(uint64_t spa, const dva_t *dva, uint64_t birth)
711 uint8_t *vdva = (uint8_t *)dva;
712 uint64_t crc = -1ULL;
715 ASSERT(zfs_crc64_table[128] == ZFS_CRC64_POLY);
717 for (i = 0; i < sizeof (dva_t); i++)
718 crc = (crc >> 8) ^ zfs_crc64_table[(crc ^ vdva[i]) & 0xFF];
720 crc ^= (spa>>8) ^ birth;
725 #define BUF_EMPTY(buf) \
726 ((buf)->b_dva.dva_word[0] == 0 && \
727 (buf)->b_dva.dva_word[1] == 0 && \
730 #define BUF_EQUAL(spa, dva, birth, buf) \
731 ((buf)->b_dva.dva_word[0] == (dva)->dva_word[0]) && \
732 ((buf)->b_dva.dva_word[1] == (dva)->dva_word[1]) && \
733 ((buf)->b_birth == birth) && ((buf)->b_spa == spa)
736 buf_discard_identity(arc_buf_hdr_t *hdr)
738 hdr->b_dva.dva_word[0] = 0;
739 hdr->b_dva.dva_word[1] = 0;
744 static arc_buf_hdr_t *
745 buf_hash_find(uint64_t spa, const dva_t *dva, uint64_t birth, kmutex_t **lockp)
747 uint64_t idx = BUF_HASH_INDEX(spa, dva, birth);
748 kmutex_t *hash_lock = BUF_HASH_LOCK(idx);
751 mutex_enter(hash_lock);
752 for (buf = buf_hash_table.ht_table[idx]; buf != NULL;
753 buf = buf->b_hash_next) {
754 if (BUF_EQUAL(spa, dva, birth, buf)) {
759 mutex_exit(hash_lock);
765 * Insert an entry into the hash table. If there is already an element
766 * equal to elem in the hash table, then the already existing element
767 * will be returned and the new element will not be inserted.
768 * Otherwise returns NULL.
770 static arc_buf_hdr_t *
771 buf_hash_insert(arc_buf_hdr_t *buf, kmutex_t **lockp)
773 uint64_t idx = BUF_HASH_INDEX(buf->b_spa, &buf->b_dva, buf->b_birth);
774 kmutex_t *hash_lock = BUF_HASH_LOCK(idx);
778 ASSERT(!HDR_IN_HASH_TABLE(buf));
780 mutex_enter(hash_lock);
781 for (fbuf = buf_hash_table.ht_table[idx], i = 0; fbuf != NULL;
782 fbuf = fbuf->b_hash_next, i++) {
783 if (BUF_EQUAL(buf->b_spa, &buf->b_dva, buf->b_birth, fbuf))
787 buf->b_hash_next = buf_hash_table.ht_table[idx];
788 buf_hash_table.ht_table[idx] = buf;
789 buf->b_flags |= ARC_IN_HASH_TABLE;
791 /* collect some hash table performance data */
793 ARCSTAT_BUMP(arcstat_hash_collisions);
795 ARCSTAT_BUMP(arcstat_hash_chains);
797 ARCSTAT_MAX(arcstat_hash_chain_max, i);
800 ARCSTAT_BUMP(arcstat_hash_elements);
801 ARCSTAT_MAXSTAT(arcstat_hash_elements);
807 buf_hash_remove(arc_buf_hdr_t *buf)
809 arc_buf_hdr_t *fbuf, **bufp;
810 uint64_t idx = BUF_HASH_INDEX(buf->b_spa, &buf->b_dva, buf->b_birth);
812 ASSERT(MUTEX_HELD(BUF_HASH_LOCK(idx)));
813 ASSERT(HDR_IN_HASH_TABLE(buf));
815 bufp = &buf_hash_table.ht_table[idx];
816 while ((fbuf = *bufp) != buf) {
817 ASSERT(fbuf != NULL);
818 bufp = &fbuf->b_hash_next;
820 *bufp = buf->b_hash_next;
821 buf->b_hash_next = NULL;
822 buf->b_flags &= ~ARC_IN_HASH_TABLE;
824 /* collect some hash table performance data */
825 ARCSTAT_BUMPDOWN(arcstat_hash_elements);
827 if (buf_hash_table.ht_table[idx] &&
828 buf_hash_table.ht_table[idx]->b_hash_next == NULL)
829 ARCSTAT_BUMPDOWN(arcstat_hash_chains);
833 * Global data structures and functions for the buf kmem cache.
835 static kmem_cache_t *hdr_cache;
836 static kmem_cache_t *buf_cache;
843 #if defined(_KERNEL) && defined(HAVE_SPL)
844 /* Large allocations which do not require contiguous pages
845 * should be using vmem_free() in the linux kernel */
846 vmem_free(buf_hash_table.ht_table,
847 (buf_hash_table.ht_mask + 1) * sizeof (void *));
849 kmem_free(buf_hash_table.ht_table,
850 (buf_hash_table.ht_mask + 1) * sizeof (void *));
852 for (i = 0; i < BUF_LOCKS; i++)
853 mutex_destroy(&buf_hash_table.ht_locks[i].ht_lock);
854 kmem_cache_destroy(hdr_cache);
855 kmem_cache_destroy(buf_cache);
859 * Constructor callback - called when the cache is empty
860 * and a new buf is requested.
864 hdr_cons(void *vbuf, void *unused, int kmflag)
866 arc_buf_hdr_t *buf = vbuf;
868 bzero(buf, sizeof (arc_buf_hdr_t));
869 refcount_create(&buf->b_refcnt);
870 cv_init(&buf->b_cv, NULL, CV_DEFAULT, NULL);
871 mutex_init(&buf->b_freeze_lock, NULL, MUTEX_DEFAULT, NULL);
872 list_link_init(&buf->b_arc_node);
873 list_link_init(&buf->b_l2node);
874 arc_space_consume(sizeof (arc_buf_hdr_t), ARC_SPACE_HDRS);
881 buf_cons(void *vbuf, void *unused, int kmflag)
883 arc_buf_t *buf = vbuf;
885 bzero(buf, sizeof (arc_buf_t));
886 mutex_init(&buf->b_evict_lock, NULL, MUTEX_DEFAULT, NULL);
887 arc_space_consume(sizeof (arc_buf_t), ARC_SPACE_HDRS);
893 * Destructor callback - called when a cached buf is
894 * no longer required.
898 hdr_dest(void *vbuf, void *unused)
900 arc_buf_hdr_t *buf = vbuf;
902 ASSERT(BUF_EMPTY(buf));
903 refcount_destroy(&buf->b_refcnt);
904 cv_destroy(&buf->b_cv);
905 mutex_destroy(&buf->b_freeze_lock);
906 arc_space_return(sizeof (arc_buf_hdr_t), ARC_SPACE_HDRS);
911 buf_dest(void *vbuf, void *unused)
913 arc_buf_t *buf = vbuf;
915 mutex_destroy(&buf->b_evict_lock);
916 arc_space_return(sizeof (arc_buf_t), ARC_SPACE_HDRS);
923 uint64_t hsize = 1ULL << 12;
927 * The hash table is big enough to fill all of physical memory
928 * with an average 64K block size. The table will take up
929 * totalmem*sizeof(void*)/64K (eg. 128KB/GB with 8-byte pointers).
931 while (hsize * 65536 < physmem * PAGESIZE)
934 buf_hash_table.ht_mask = hsize - 1;
935 #if defined(_KERNEL) && defined(HAVE_SPL)
936 /* Large allocations which do not require contiguous pages
937 * should be using vmem_alloc() in the linux kernel */
938 buf_hash_table.ht_table =
939 vmem_zalloc(hsize * sizeof (void*), KM_SLEEP);
941 buf_hash_table.ht_table =
942 kmem_zalloc(hsize * sizeof (void*), KM_NOSLEEP);
944 if (buf_hash_table.ht_table == NULL) {
945 ASSERT(hsize > (1ULL << 8));
950 hdr_cache = kmem_cache_create("arc_buf_hdr_t", sizeof (arc_buf_hdr_t),
951 0, hdr_cons, hdr_dest, NULL, NULL, NULL, 0);
952 buf_cache = kmem_cache_create("arc_buf_t", sizeof (arc_buf_t),
953 0, buf_cons, buf_dest, NULL, NULL, NULL, 0);
955 for (i = 0; i < 256; i++)
956 for (ct = zfs_crc64_table + i, *ct = i, j = 8; j > 0; j--)
957 *ct = (*ct >> 1) ^ (-(*ct & 1) & ZFS_CRC64_POLY);
959 for (i = 0; i < BUF_LOCKS; i++) {
960 mutex_init(&buf_hash_table.ht_locks[i].ht_lock,
961 NULL, MUTEX_DEFAULT, NULL);
965 #define ARC_MINTIME (hz>>4) /* 62 ms */
968 arc_cksum_verify(arc_buf_t *buf)
972 if (!(zfs_flags & ZFS_DEBUG_MODIFY))
975 mutex_enter(&buf->b_hdr->b_freeze_lock);
976 if (buf->b_hdr->b_freeze_cksum == NULL ||
977 (buf->b_hdr->b_flags & ARC_IO_ERROR)) {
978 mutex_exit(&buf->b_hdr->b_freeze_lock);
981 fletcher_2_native(buf->b_data, buf->b_hdr->b_size, &zc);
982 if (!ZIO_CHECKSUM_EQUAL(*buf->b_hdr->b_freeze_cksum, zc))
983 panic("buffer modified while frozen!");
984 mutex_exit(&buf->b_hdr->b_freeze_lock);
988 arc_cksum_equal(arc_buf_t *buf)
993 mutex_enter(&buf->b_hdr->b_freeze_lock);
994 fletcher_2_native(buf->b_data, buf->b_hdr->b_size, &zc);
995 equal = ZIO_CHECKSUM_EQUAL(*buf->b_hdr->b_freeze_cksum, zc);
996 mutex_exit(&buf->b_hdr->b_freeze_lock);
1002 arc_cksum_compute(arc_buf_t *buf, boolean_t force)
1004 if (!force && !(zfs_flags & ZFS_DEBUG_MODIFY))
1007 mutex_enter(&buf->b_hdr->b_freeze_lock);
1008 if (buf->b_hdr->b_freeze_cksum != NULL) {
1009 mutex_exit(&buf->b_hdr->b_freeze_lock);
1012 buf->b_hdr->b_freeze_cksum = kmem_alloc(sizeof (zio_cksum_t),
1014 fletcher_2_native(buf->b_data, buf->b_hdr->b_size,
1015 buf->b_hdr->b_freeze_cksum);
1016 mutex_exit(&buf->b_hdr->b_freeze_lock);
1020 arc_buf_thaw(arc_buf_t *buf)
1022 if (zfs_flags & ZFS_DEBUG_MODIFY) {
1023 if (buf->b_hdr->b_state != arc_anon)
1024 panic("modifying non-anon buffer!");
1025 if (buf->b_hdr->b_flags & ARC_IO_IN_PROGRESS)
1026 panic("modifying buffer while i/o in progress!");
1027 arc_cksum_verify(buf);
1030 mutex_enter(&buf->b_hdr->b_freeze_lock);
1031 if (buf->b_hdr->b_freeze_cksum != NULL) {
1032 kmem_free(buf->b_hdr->b_freeze_cksum, sizeof (zio_cksum_t));
1033 buf->b_hdr->b_freeze_cksum = NULL;
1036 if (zfs_flags & ZFS_DEBUG_MODIFY) {
1037 if (buf->b_hdr->b_thawed)
1038 kmem_free(buf->b_hdr->b_thawed, 1);
1039 buf->b_hdr->b_thawed = kmem_alloc(1, KM_SLEEP);
1042 mutex_exit(&buf->b_hdr->b_freeze_lock);
1046 arc_buf_freeze(arc_buf_t *buf)
1048 kmutex_t *hash_lock;
1050 if (!(zfs_flags & ZFS_DEBUG_MODIFY))
1053 hash_lock = HDR_LOCK(buf->b_hdr);
1054 mutex_enter(hash_lock);
1056 ASSERT(buf->b_hdr->b_freeze_cksum != NULL ||
1057 buf->b_hdr->b_state == arc_anon);
1058 arc_cksum_compute(buf, B_FALSE);
1059 mutex_exit(hash_lock);
1063 add_reference(arc_buf_hdr_t *ab, kmutex_t *hash_lock, void *tag)
1065 ASSERT(MUTEX_HELD(hash_lock));
1067 if ((refcount_add(&ab->b_refcnt, tag) == 1) &&
1068 (ab->b_state != arc_anon)) {
1069 uint64_t delta = ab->b_size * ab->b_datacnt;
1070 list_t *list = &ab->b_state->arcs_list[ab->b_type];
1071 uint64_t *size = &ab->b_state->arcs_lsize[ab->b_type];
1073 ASSERT(!MUTEX_HELD(&ab->b_state->arcs_mtx));
1074 mutex_enter(&ab->b_state->arcs_mtx);
1075 ASSERT(list_link_active(&ab->b_arc_node));
1076 list_remove(list, ab);
1077 if (GHOST_STATE(ab->b_state)) {
1078 ASSERT0(ab->b_datacnt);
1079 ASSERT3P(ab->b_buf, ==, NULL);
1083 ASSERT3U(*size, >=, delta);
1084 atomic_add_64(size, -delta);
1085 mutex_exit(&ab->b_state->arcs_mtx);
1086 /* remove the prefetch flag if we get a reference */
1087 if (ab->b_flags & ARC_PREFETCH)
1088 ab->b_flags &= ~ARC_PREFETCH;
1093 remove_reference(arc_buf_hdr_t *ab, kmutex_t *hash_lock, void *tag)
1096 arc_state_t *state = ab->b_state;
1098 ASSERT(state == arc_anon || MUTEX_HELD(hash_lock));
1099 ASSERT(!GHOST_STATE(state));
1101 if (((cnt = refcount_remove(&ab->b_refcnt, tag)) == 0) &&
1102 (state != arc_anon)) {
1103 uint64_t *size = &state->arcs_lsize[ab->b_type];
1105 ASSERT(!MUTEX_HELD(&state->arcs_mtx));
1106 mutex_enter(&state->arcs_mtx);
1107 ASSERT(!list_link_active(&ab->b_arc_node));
1108 list_insert_head(&state->arcs_list[ab->b_type], ab);
1109 ASSERT(ab->b_datacnt > 0);
1110 atomic_add_64(size, ab->b_size * ab->b_datacnt);
1111 mutex_exit(&state->arcs_mtx);
1117 * Move the supplied buffer to the indicated state. The mutex
1118 * for the buffer must be held by the caller.
1121 arc_change_state(arc_state_t *new_state, arc_buf_hdr_t *ab, kmutex_t *hash_lock)
1123 arc_state_t *old_state = ab->b_state;
1124 int64_t refcnt = refcount_count(&ab->b_refcnt);
1125 uint64_t from_delta, to_delta;
1127 ASSERT(MUTEX_HELD(hash_lock));
1128 ASSERT(new_state != old_state);
1129 ASSERT(refcnt == 0 || ab->b_datacnt > 0);
1130 ASSERT(ab->b_datacnt == 0 || !GHOST_STATE(new_state));
1131 ASSERT(ab->b_datacnt <= 1 || old_state != arc_anon);
1133 from_delta = to_delta = ab->b_datacnt * ab->b_size;
1136 * If this buffer is evictable, transfer it from the
1137 * old state list to the new state list.
1140 if (old_state != arc_anon) {
1141 int use_mutex = !MUTEX_HELD(&old_state->arcs_mtx);
1142 uint64_t *size = &old_state->arcs_lsize[ab->b_type];
1145 mutex_enter(&old_state->arcs_mtx);
1147 ASSERT(list_link_active(&ab->b_arc_node));
1148 list_remove(&old_state->arcs_list[ab->b_type], ab);
1151 * If prefetching out of the ghost cache,
1152 * we will have a non-zero datacnt.
1154 if (GHOST_STATE(old_state) && ab->b_datacnt == 0) {
1155 /* ghost elements have a ghost size */
1156 ASSERT(ab->b_buf == NULL);
1157 from_delta = ab->b_size;
1159 ASSERT3U(*size, >=, from_delta);
1160 atomic_add_64(size, -from_delta);
1163 mutex_exit(&old_state->arcs_mtx);
1165 if (new_state != arc_anon) {
1166 int use_mutex = !MUTEX_HELD(&new_state->arcs_mtx);
1167 uint64_t *size = &new_state->arcs_lsize[ab->b_type];
1170 mutex_enter(&new_state->arcs_mtx);
1172 list_insert_head(&new_state->arcs_list[ab->b_type], ab);
1174 /* ghost elements have a ghost size */
1175 if (GHOST_STATE(new_state)) {
1176 ASSERT(ab->b_datacnt == 0);
1177 ASSERT(ab->b_buf == NULL);
1178 to_delta = ab->b_size;
1180 atomic_add_64(size, to_delta);
1183 mutex_exit(&new_state->arcs_mtx);
1187 ASSERT(!BUF_EMPTY(ab));
1188 if (new_state == arc_anon && HDR_IN_HASH_TABLE(ab))
1189 buf_hash_remove(ab);
1191 /* adjust state sizes */
1193 atomic_add_64(&new_state->arcs_size, to_delta);
1195 ASSERT3U(old_state->arcs_size, >=, from_delta);
1196 atomic_add_64(&old_state->arcs_size, -from_delta);
1198 ab->b_state = new_state;
1200 /* adjust l2arc hdr stats */
1201 if (new_state == arc_l2c_only)
1202 l2arc_hdr_stat_add();
1203 else if (old_state == arc_l2c_only)
1204 l2arc_hdr_stat_remove();
1208 arc_space_consume(uint64_t space, arc_space_type_t type)
1210 ASSERT(type >= 0 && type < ARC_SPACE_NUMTYPES);
1215 case ARC_SPACE_DATA:
1216 ARCSTAT_INCR(arcstat_data_size, space);
1218 case ARC_SPACE_OTHER:
1219 ARCSTAT_INCR(arcstat_other_size, space);
1221 case ARC_SPACE_HDRS:
1222 ARCSTAT_INCR(arcstat_hdr_size, space);
1224 case ARC_SPACE_L2HDRS:
1225 ARCSTAT_INCR(arcstat_l2_hdr_size, space);
1229 atomic_add_64(&arc_meta_used, space);
1230 atomic_add_64(&arc_size, space);
1234 arc_space_return(uint64_t space, arc_space_type_t type)
1236 ASSERT(type >= 0 && type < ARC_SPACE_NUMTYPES);
1241 case ARC_SPACE_DATA:
1242 ARCSTAT_INCR(arcstat_data_size, -space);
1244 case ARC_SPACE_OTHER:
1245 ARCSTAT_INCR(arcstat_other_size, -space);
1247 case ARC_SPACE_HDRS:
1248 ARCSTAT_INCR(arcstat_hdr_size, -space);
1250 case ARC_SPACE_L2HDRS:
1251 ARCSTAT_INCR(arcstat_l2_hdr_size, -space);
1255 ASSERT(arc_meta_used >= space);
1256 if (arc_meta_max < arc_meta_used)
1257 arc_meta_max = arc_meta_used;
1258 atomic_add_64(&arc_meta_used, -space);
1259 ASSERT(arc_size >= space);
1260 atomic_add_64(&arc_size, -space);
1264 arc_data_buf_alloc(uint64_t size)
1266 if (arc_evict_needed(ARC_BUFC_DATA))
1267 cv_signal(&arc_reclaim_thr_cv);
1268 atomic_add_64(&arc_size, size);
1269 return (zio_data_buf_alloc(size));
1273 arc_data_buf_free(void *buf, uint64_t size)
1275 zio_data_buf_free(buf, size);
1276 ASSERT(arc_size >= size);
1277 atomic_add_64(&arc_size, -size);
1281 arc_buf_alloc(spa_t *spa, int size, void *tag, arc_buf_contents_t type)
1286 ASSERT3U(size, >, 0);
1287 hdr = kmem_cache_alloc(hdr_cache, KM_PUSHPAGE);
1288 ASSERT(BUF_EMPTY(hdr));
1291 hdr->b_spa = spa_load_guid(spa);
1292 hdr->b_state = arc_anon;
1293 hdr->b_arc_access = 0;
1294 buf = kmem_cache_alloc(buf_cache, KM_PUSHPAGE);
1297 buf->b_efunc = NULL;
1298 buf->b_private = NULL;
1301 arc_get_data_buf(buf);
1304 ASSERT(refcount_is_zero(&hdr->b_refcnt));
1305 (void) refcount_add(&hdr->b_refcnt, tag);
1310 static char *arc_onloan_tag = "onloan";
1313 * Loan out an anonymous arc buffer. Loaned buffers are not counted as in
1314 * flight data by arc_tempreserve_space() until they are "returned". Loaned
1315 * buffers must be returned to the arc before they can be used by the DMU or
1319 arc_loan_buf(spa_t *spa, int size)
1323 buf = arc_buf_alloc(spa, size, arc_onloan_tag, ARC_BUFC_DATA);
1325 atomic_add_64(&arc_loaned_bytes, size);
1330 * Return a loaned arc buffer to the arc.
1333 arc_return_buf(arc_buf_t *buf, void *tag)
1335 arc_buf_hdr_t *hdr = buf->b_hdr;
1337 ASSERT(buf->b_data != NULL);
1338 (void) refcount_add(&hdr->b_refcnt, tag);
1339 (void) refcount_remove(&hdr->b_refcnt, arc_onloan_tag);
1341 atomic_add_64(&arc_loaned_bytes, -hdr->b_size);
1344 /* Detach an arc_buf from a dbuf (tag) */
1346 arc_loan_inuse_buf(arc_buf_t *buf, void *tag)
1350 ASSERT(buf->b_data != NULL);
1352 (void) refcount_add(&hdr->b_refcnt, arc_onloan_tag);
1353 (void) refcount_remove(&hdr->b_refcnt, tag);
1354 buf->b_efunc = NULL;
1355 buf->b_private = NULL;
1357 atomic_add_64(&arc_loaned_bytes, hdr->b_size);
1361 arc_buf_clone(arc_buf_t *from)
1364 arc_buf_hdr_t *hdr = from->b_hdr;
1365 uint64_t size = hdr->b_size;
1367 ASSERT(hdr->b_state != arc_anon);
1369 buf = kmem_cache_alloc(buf_cache, KM_PUSHPAGE);
1372 buf->b_efunc = NULL;
1373 buf->b_private = NULL;
1374 buf->b_next = hdr->b_buf;
1376 arc_get_data_buf(buf);
1377 bcopy(from->b_data, buf->b_data, size);
1380 * This buffer already exists in the arc so create a duplicate
1381 * copy for the caller. If the buffer is associated with user data
1382 * then track the size and number of duplicates. These stats will be
1383 * updated as duplicate buffers are created and destroyed.
1385 if (hdr->b_type == ARC_BUFC_DATA) {
1386 ARCSTAT_BUMP(arcstat_duplicate_buffers);
1387 ARCSTAT_INCR(arcstat_duplicate_buffers_size, size);
1389 hdr->b_datacnt += 1;
1394 arc_buf_add_ref(arc_buf_t *buf, void* tag)
1397 kmutex_t *hash_lock;
1400 * Check to see if this buffer is evicted. Callers
1401 * must verify b_data != NULL to know if the add_ref
1404 mutex_enter(&buf->b_evict_lock);
1405 if (buf->b_data == NULL) {
1406 mutex_exit(&buf->b_evict_lock);
1409 hash_lock = HDR_LOCK(buf->b_hdr);
1410 mutex_enter(hash_lock);
1412 ASSERT3P(hash_lock, ==, HDR_LOCK(hdr));
1413 mutex_exit(&buf->b_evict_lock);
1415 ASSERT(hdr->b_state == arc_mru || hdr->b_state == arc_mfu);
1416 add_reference(hdr, hash_lock, tag);
1417 DTRACE_PROBE1(arc__hit, arc_buf_hdr_t *, hdr);
1418 arc_access(hdr, hash_lock);
1419 mutex_exit(hash_lock);
1420 ARCSTAT_BUMP(arcstat_hits);
1421 ARCSTAT_CONDSTAT(!(hdr->b_flags & ARC_PREFETCH),
1422 demand, prefetch, hdr->b_type != ARC_BUFC_METADATA,
1423 data, metadata, hits);
1427 * Free the arc data buffer. If it is an l2arc write in progress,
1428 * the buffer is placed on l2arc_free_on_write to be freed later.
1431 arc_buf_data_free(arc_buf_hdr_t *hdr, void (*free_func)(void *, size_t),
1432 void *data, size_t size)
1434 if (HDR_L2_WRITING(hdr)) {
1435 l2arc_data_free_t *df;
1436 df = kmem_alloc(sizeof (l2arc_data_free_t), KM_PUSHPAGE);
1437 df->l2df_data = data;
1438 df->l2df_size = size;
1439 df->l2df_func = free_func;
1440 mutex_enter(&l2arc_free_on_write_mtx);
1441 list_insert_head(l2arc_free_on_write, df);
1442 mutex_exit(&l2arc_free_on_write_mtx);
1443 ARCSTAT_BUMP(arcstat_l2_free_on_write);
1445 free_func(data, size);
1450 arc_buf_destroy(arc_buf_t *buf, boolean_t recycle, boolean_t all)
1454 /* free up data associated with the buf */
1456 arc_state_t *state = buf->b_hdr->b_state;
1457 uint64_t size = buf->b_hdr->b_size;
1458 arc_buf_contents_t type = buf->b_hdr->b_type;
1460 arc_cksum_verify(buf);
1463 if (type == ARC_BUFC_METADATA) {
1464 arc_buf_data_free(buf->b_hdr, zio_buf_free,
1466 arc_space_return(size, ARC_SPACE_DATA);
1468 ASSERT(type == ARC_BUFC_DATA);
1469 arc_buf_data_free(buf->b_hdr,
1470 zio_data_buf_free, buf->b_data, size);
1471 ARCSTAT_INCR(arcstat_data_size, -size);
1472 atomic_add_64(&arc_size, -size);
1475 if (list_link_active(&buf->b_hdr->b_arc_node)) {
1476 uint64_t *cnt = &state->arcs_lsize[type];
1478 ASSERT(refcount_is_zero(&buf->b_hdr->b_refcnt));
1479 ASSERT(state != arc_anon);
1481 ASSERT3U(*cnt, >=, size);
1482 atomic_add_64(cnt, -size);
1484 ASSERT3U(state->arcs_size, >=, size);
1485 atomic_add_64(&state->arcs_size, -size);
1489 * If we're destroying a duplicate buffer make sure
1490 * that the appropriate statistics are updated.
1492 if (buf->b_hdr->b_datacnt > 1 &&
1493 buf->b_hdr->b_type == ARC_BUFC_DATA) {
1494 ARCSTAT_BUMPDOWN(arcstat_duplicate_buffers);
1495 ARCSTAT_INCR(arcstat_duplicate_buffers_size, -size);
1497 ASSERT(buf->b_hdr->b_datacnt > 0);
1498 buf->b_hdr->b_datacnt -= 1;
1501 /* only remove the buf if requested */
1505 /* remove the buf from the hdr list */
1506 for (bufp = &buf->b_hdr->b_buf; *bufp != buf; bufp = &(*bufp)->b_next)
1508 *bufp = buf->b_next;
1511 ASSERT(buf->b_efunc == NULL);
1513 /* clean up the buf */
1515 kmem_cache_free(buf_cache, buf);
1519 arc_hdr_destroy(arc_buf_hdr_t *hdr)
1521 l2arc_buf_hdr_t *l2hdr = hdr->b_l2hdr;
1523 ASSERT(refcount_is_zero(&hdr->b_refcnt));
1524 ASSERT3P(hdr->b_state, ==, arc_anon);
1525 ASSERT(!HDR_IO_IN_PROGRESS(hdr));
1527 if (l2hdr != NULL) {
1528 boolean_t buflist_held = MUTEX_HELD(&l2arc_buflist_mtx);
1530 * To prevent arc_free() and l2arc_evict() from
1531 * attempting to free the same buffer at the same time,
1532 * a FREE_IN_PROGRESS flag is given to arc_free() to
1533 * give it priority. l2arc_evict() can't destroy this
1534 * header while we are waiting on l2arc_buflist_mtx.
1536 * The hdr may be removed from l2ad_buflist before we
1537 * grab l2arc_buflist_mtx, so b_l2hdr is rechecked.
1539 if (!buflist_held) {
1540 mutex_enter(&l2arc_buflist_mtx);
1541 l2hdr = hdr->b_l2hdr;
1544 if (l2hdr != NULL) {
1545 list_remove(l2hdr->b_dev->l2ad_buflist, hdr);
1546 ARCSTAT_INCR(arcstat_l2_size, -hdr->b_size);
1547 kmem_free(l2hdr, sizeof (l2arc_buf_hdr_t));
1548 arc_space_return(L2HDR_SIZE, ARC_SPACE_L2HDRS);
1549 if (hdr->b_state == arc_l2c_only)
1550 l2arc_hdr_stat_remove();
1551 hdr->b_l2hdr = NULL;
1555 mutex_exit(&l2arc_buflist_mtx);
1558 if (!BUF_EMPTY(hdr)) {
1559 ASSERT(!HDR_IN_HASH_TABLE(hdr));
1560 buf_discard_identity(hdr);
1562 while (hdr->b_buf) {
1563 arc_buf_t *buf = hdr->b_buf;
1566 mutex_enter(&arc_eviction_mtx);
1567 mutex_enter(&buf->b_evict_lock);
1568 ASSERT(buf->b_hdr != NULL);
1569 arc_buf_destroy(hdr->b_buf, FALSE, FALSE);
1570 hdr->b_buf = buf->b_next;
1571 buf->b_hdr = &arc_eviction_hdr;
1572 buf->b_next = arc_eviction_list;
1573 arc_eviction_list = buf;
1574 mutex_exit(&buf->b_evict_lock);
1575 mutex_exit(&arc_eviction_mtx);
1577 arc_buf_destroy(hdr->b_buf, FALSE, TRUE);
1580 if (hdr->b_freeze_cksum != NULL) {
1581 kmem_free(hdr->b_freeze_cksum, sizeof (zio_cksum_t));
1582 hdr->b_freeze_cksum = NULL;
1584 if (hdr->b_thawed) {
1585 kmem_free(hdr->b_thawed, 1);
1586 hdr->b_thawed = NULL;
1589 ASSERT(!list_link_active(&hdr->b_arc_node));
1590 ASSERT3P(hdr->b_hash_next, ==, NULL);
1591 ASSERT3P(hdr->b_acb, ==, NULL);
1592 kmem_cache_free(hdr_cache, hdr);
1596 arc_buf_free(arc_buf_t *buf, void *tag)
1598 arc_buf_hdr_t *hdr = buf->b_hdr;
1599 int hashed = hdr->b_state != arc_anon;
1601 ASSERT(buf->b_efunc == NULL);
1602 ASSERT(buf->b_data != NULL);
1605 kmutex_t *hash_lock = HDR_LOCK(hdr);
1607 mutex_enter(hash_lock);
1609 ASSERT3P(hash_lock, ==, HDR_LOCK(hdr));
1611 (void) remove_reference(hdr, hash_lock, tag);
1612 if (hdr->b_datacnt > 1) {
1613 arc_buf_destroy(buf, FALSE, TRUE);
1615 ASSERT(buf == hdr->b_buf);
1616 ASSERT(buf->b_efunc == NULL);
1617 hdr->b_flags |= ARC_BUF_AVAILABLE;
1619 mutex_exit(hash_lock);
1620 } else if (HDR_IO_IN_PROGRESS(hdr)) {
1623 * We are in the middle of an async write. Don't destroy
1624 * this buffer unless the write completes before we finish
1625 * decrementing the reference count.
1627 mutex_enter(&arc_eviction_mtx);
1628 (void) remove_reference(hdr, NULL, tag);
1629 ASSERT(refcount_is_zero(&hdr->b_refcnt));
1630 destroy_hdr = !HDR_IO_IN_PROGRESS(hdr);
1631 mutex_exit(&arc_eviction_mtx);
1633 arc_hdr_destroy(hdr);
1635 if (remove_reference(hdr, NULL, tag) > 0)
1636 arc_buf_destroy(buf, FALSE, TRUE);
1638 arc_hdr_destroy(hdr);
1643 arc_buf_remove_ref(arc_buf_t *buf, void* tag)
1645 arc_buf_hdr_t *hdr = buf->b_hdr;
1646 kmutex_t *hash_lock = NULL;
1647 int no_callback = (buf->b_efunc == NULL);
1649 if (hdr->b_state == arc_anon) {
1650 ASSERT(hdr->b_datacnt == 1);
1651 arc_buf_free(buf, tag);
1652 return (no_callback);
1655 hash_lock = HDR_LOCK(hdr);
1656 mutex_enter(hash_lock);
1658 ASSERT3P(hash_lock, ==, HDR_LOCK(hdr));
1659 ASSERT(hdr->b_state != arc_anon);
1660 ASSERT(buf->b_data != NULL);
1662 (void) remove_reference(hdr, hash_lock, tag);
1663 if (hdr->b_datacnt > 1) {
1665 arc_buf_destroy(buf, FALSE, TRUE);
1666 } else if (no_callback) {
1667 ASSERT(hdr->b_buf == buf && buf->b_next == NULL);
1668 ASSERT(buf->b_efunc == NULL);
1669 hdr->b_flags |= ARC_BUF_AVAILABLE;
1671 ASSERT(no_callback || hdr->b_datacnt > 1 ||
1672 refcount_is_zero(&hdr->b_refcnt));
1673 mutex_exit(hash_lock);
1674 return (no_callback);
1678 arc_buf_size(arc_buf_t *buf)
1680 return (buf->b_hdr->b_size);
1684 * Called from the DMU to determine if the current buffer should be
1685 * evicted. In order to ensure proper locking, the eviction must be initiated
1686 * from the DMU. Return true if the buffer is associated with user data and
1687 * duplicate buffers still exist.
1690 arc_buf_eviction_needed(arc_buf_t *buf)
1693 boolean_t evict_needed = B_FALSE;
1695 if (zfs_disable_dup_eviction)
1698 mutex_enter(&buf->b_evict_lock);
1702 * We are in arc_do_user_evicts(); let that function
1703 * perform the eviction.
1705 ASSERT(buf->b_data == NULL);
1706 mutex_exit(&buf->b_evict_lock);
1708 } else if (buf->b_data == NULL) {
1710 * We have already been added to the arc eviction list;
1711 * recommend eviction.
1713 ASSERT3P(hdr, ==, &arc_eviction_hdr);
1714 mutex_exit(&buf->b_evict_lock);
1718 if (hdr->b_datacnt > 1 && hdr->b_type == ARC_BUFC_DATA)
1719 evict_needed = B_TRUE;
1721 mutex_exit(&buf->b_evict_lock);
1722 return (evict_needed);
1726 * Evict buffers from list until we've removed the specified number of
1727 * bytes. Move the removed buffers to the appropriate evict state.
1728 * If the recycle flag is set, then attempt to "recycle" a buffer:
1729 * - look for a buffer to evict that is `bytes' long.
1730 * - return the data block from this buffer rather than freeing it.
1731 * This flag is used by callers that are trying to make space for a
1732 * new buffer in a full arc cache.
1734 * This function makes a "best effort". It skips over any buffers
1735 * it can't get a hash_lock on, and so may not catch all candidates.
1736 * It may also return without evicting as much space as requested.
1739 arc_evict(arc_state_t *state, uint64_t spa, int64_t bytes, boolean_t recycle,
1740 arc_buf_contents_t type)
1742 arc_state_t *evicted_state;
1743 uint64_t bytes_evicted = 0, skipped = 0, missed = 0;
1744 arc_buf_hdr_t *ab, *ab_prev = NULL;
1745 list_t *list = &state->arcs_list[type];
1746 kmutex_t *hash_lock;
1747 boolean_t have_lock;
1748 void *stolen = NULL;
1750 ASSERT(state == arc_mru || state == arc_mfu);
1752 evicted_state = (state == arc_mru) ? arc_mru_ghost : arc_mfu_ghost;
1754 mutex_enter(&state->arcs_mtx);
1755 mutex_enter(&evicted_state->arcs_mtx);
1757 for (ab = list_tail(list); ab; ab = ab_prev) {
1758 ab_prev = list_prev(list, ab);
1759 /* prefetch buffers have a minimum lifespan */
1760 if (HDR_IO_IN_PROGRESS(ab) ||
1761 (spa && ab->b_spa != spa) ||
1762 (ab->b_flags & (ARC_PREFETCH|ARC_INDIRECT) &&
1763 ddi_get_lbolt() - ab->b_arc_access <
1764 arc_min_prefetch_lifespan)) {
1768 /* "lookahead" for better eviction candidate */
1769 if (recycle && ab->b_size != bytes &&
1770 ab_prev && ab_prev->b_size == bytes)
1772 hash_lock = HDR_LOCK(ab);
1773 have_lock = MUTEX_HELD(hash_lock);
1774 if (have_lock || mutex_tryenter(hash_lock)) {
1775 ASSERT0(refcount_count(&ab->b_refcnt));
1776 ASSERT(ab->b_datacnt > 0);
1778 arc_buf_t *buf = ab->b_buf;
1779 if (!mutex_tryenter(&buf->b_evict_lock)) {
1784 bytes_evicted += ab->b_size;
1785 if (recycle && ab->b_type == type &&
1786 ab->b_size == bytes &&
1787 !HDR_L2_WRITING(ab)) {
1788 stolen = buf->b_data;
1793 mutex_enter(&arc_eviction_mtx);
1794 arc_buf_destroy(buf,
1795 buf->b_data == stolen, FALSE);
1796 ab->b_buf = buf->b_next;
1797 buf->b_hdr = &arc_eviction_hdr;
1798 buf->b_next = arc_eviction_list;
1799 arc_eviction_list = buf;
1800 mutex_exit(&arc_eviction_mtx);
1801 mutex_exit(&buf->b_evict_lock);
1803 mutex_exit(&buf->b_evict_lock);
1804 arc_buf_destroy(buf,
1805 buf->b_data == stolen, TRUE);
1810 ARCSTAT_INCR(arcstat_evict_l2_cached,
1813 if (l2arc_write_eligible(ab->b_spa, ab)) {
1814 ARCSTAT_INCR(arcstat_evict_l2_eligible,
1818 arcstat_evict_l2_ineligible,
1823 if (ab->b_datacnt == 0) {
1824 arc_change_state(evicted_state, ab, hash_lock);
1825 ASSERT(HDR_IN_HASH_TABLE(ab));
1826 ab->b_flags |= ARC_IN_HASH_TABLE;
1827 ab->b_flags &= ~ARC_BUF_AVAILABLE;
1828 DTRACE_PROBE1(arc__evict, arc_buf_hdr_t *, ab);
1831 mutex_exit(hash_lock);
1832 if (bytes >= 0 && bytes_evicted >= bytes)
1839 mutex_exit(&evicted_state->arcs_mtx);
1840 mutex_exit(&state->arcs_mtx);
1842 if (bytes_evicted < bytes)
1843 dprintf("only evicted %lld bytes from %x\n",
1844 (longlong_t)bytes_evicted, state);
1847 ARCSTAT_INCR(arcstat_evict_skip, skipped);
1850 ARCSTAT_INCR(arcstat_mutex_miss, missed);
1853 * We have just evicted some date into the ghost state, make
1854 * sure we also adjust the ghost state size if necessary.
1857 arc_mru_ghost->arcs_size + arc_mfu_ghost->arcs_size > arc_c) {
1858 int64_t mru_over = arc_anon->arcs_size + arc_mru->arcs_size +
1859 arc_mru_ghost->arcs_size - arc_c;
1861 if (mru_over > 0 && arc_mru_ghost->arcs_lsize[type] > 0) {
1863 MIN(arc_mru_ghost->arcs_lsize[type], mru_over);
1864 arc_evict_ghost(arc_mru_ghost, 0, todelete);
1865 } else if (arc_mfu_ghost->arcs_lsize[type] > 0) {
1866 int64_t todelete = MIN(arc_mfu_ghost->arcs_lsize[type],
1867 arc_mru_ghost->arcs_size +
1868 arc_mfu_ghost->arcs_size - arc_c);
1869 arc_evict_ghost(arc_mfu_ghost, 0, todelete);
1877 * Remove buffers from list until we've removed the specified number of
1878 * bytes. Destroy the buffers that are removed.
1881 arc_evict_ghost(arc_state_t *state, uint64_t spa, int64_t bytes)
1883 arc_buf_hdr_t *ab, *ab_prev;
1884 arc_buf_hdr_t marker;
1885 list_t *list = &state->arcs_list[ARC_BUFC_DATA];
1886 kmutex_t *hash_lock;
1887 uint64_t bytes_deleted = 0;
1888 uint64_t bufs_skipped = 0;
1890 ASSERT(GHOST_STATE(state));
1891 bzero(&marker, sizeof(marker));
1893 mutex_enter(&state->arcs_mtx);
1894 for (ab = list_tail(list); ab; ab = ab_prev) {
1895 ab_prev = list_prev(list, ab);
1896 if (spa && ab->b_spa != spa)
1899 /* ignore markers */
1903 hash_lock = HDR_LOCK(ab);
1904 /* caller may be trying to modify this buffer, skip it */
1905 if (MUTEX_HELD(hash_lock))
1907 if (mutex_tryenter(hash_lock)) {
1908 ASSERT(!HDR_IO_IN_PROGRESS(ab));
1909 ASSERT(ab->b_buf == NULL);
1910 ARCSTAT_BUMP(arcstat_deleted);
1911 bytes_deleted += ab->b_size;
1913 if (ab->b_l2hdr != NULL) {
1915 * This buffer is cached on the 2nd Level ARC;
1916 * don't destroy the header.
1918 arc_change_state(arc_l2c_only, ab, hash_lock);
1919 mutex_exit(hash_lock);
1921 arc_change_state(arc_anon, ab, hash_lock);
1922 mutex_exit(hash_lock);
1923 arc_hdr_destroy(ab);
1926 DTRACE_PROBE1(arc__delete, arc_buf_hdr_t *, ab);
1927 if (bytes >= 0 && bytes_deleted >= bytes)
1929 } else if (bytes < 0) {
1931 * Insert a list marker and then wait for the
1932 * hash lock to become available. Once its
1933 * available, restart from where we left off.
1935 list_insert_after(list, ab, &marker);
1936 mutex_exit(&state->arcs_mtx);
1937 mutex_enter(hash_lock);
1938 mutex_exit(hash_lock);
1939 mutex_enter(&state->arcs_mtx);
1940 ab_prev = list_prev(list, &marker);
1941 list_remove(list, &marker);
1945 mutex_exit(&state->arcs_mtx);
1947 if (list == &state->arcs_list[ARC_BUFC_DATA] &&
1948 (bytes < 0 || bytes_deleted < bytes)) {
1949 list = &state->arcs_list[ARC_BUFC_METADATA];
1954 ARCSTAT_INCR(arcstat_mutex_miss, bufs_skipped);
1958 if (bytes_deleted < bytes)
1959 dprintf("only deleted %lld bytes from %p\n",
1960 (longlong_t)bytes_deleted, state);
1966 int64_t adjustment, delta;
1972 adjustment = MIN((int64_t)(arc_size - arc_c),
1973 (int64_t)(arc_anon->arcs_size + arc_mru->arcs_size + arc_meta_used -
1976 if (adjustment > 0 && arc_mru->arcs_lsize[ARC_BUFC_DATA] > 0) {
1977 delta = MIN(arc_mru->arcs_lsize[ARC_BUFC_DATA], adjustment);
1978 (void) arc_evict(arc_mru, 0, delta, FALSE, ARC_BUFC_DATA);
1979 adjustment -= delta;
1982 if (adjustment > 0 && arc_mru->arcs_lsize[ARC_BUFC_METADATA] > 0) {
1983 delta = MIN(arc_mru->arcs_lsize[ARC_BUFC_METADATA], adjustment);
1984 (void) arc_evict(arc_mru, 0, delta, FALSE,
1992 adjustment = arc_size - arc_c;
1994 if (adjustment > 0 && arc_mfu->arcs_lsize[ARC_BUFC_DATA] > 0) {
1995 delta = MIN(adjustment, arc_mfu->arcs_lsize[ARC_BUFC_DATA]);
1996 (void) arc_evict(arc_mfu, 0, delta, FALSE, ARC_BUFC_DATA);
1997 adjustment -= delta;
2000 if (adjustment > 0 && arc_mfu->arcs_lsize[ARC_BUFC_METADATA] > 0) {
2001 int64_t delta = MIN(adjustment,
2002 arc_mfu->arcs_lsize[ARC_BUFC_METADATA]);
2003 (void) arc_evict(arc_mfu, 0, delta, FALSE,
2008 * Adjust ghost lists
2011 adjustment = arc_mru->arcs_size + arc_mru_ghost->arcs_size - arc_c;
2013 if (adjustment > 0 && arc_mru_ghost->arcs_size > 0) {
2014 delta = MIN(arc_mru_ghost->arcs_size, adjustment);
2015 arc_evict_ghost(arc_mru_ghost, 0, delta);
2019 arc_mru_ghost->arcs_size + arc_mfu_ghost->arcs_size - arc_c;
2021 if (adjustment > 0 && arc_mfu_ghost->arcs_size > 0) {
2022 delta = MIN(arc_mfu_ghost->arcs_size, adjustment);
2023 arc_evict_ghost(arc_mfu_ghost, 0, delta);
2028 * Request that arc user drop references so that N bytes can be released
2029 * from the cache. This provides a mechanism to ensure the arc can honor
2030 * the arc_meta_limit and reclaim buffers which are pinned in the cache
2031 * by higher layers. (i.e. the zpl)
2034 arc_do_user_prune(int64_t adjustment)
2036 arc_prune_func_t *func;
2038 arc_prune_t *cp, *np;
2040 mutex_enter(&arc_prune_mtx);
2042 cp = list_head(&arc_prune_list);
2043 while (cp != NULL) {
2045 private = cp->p_private;
2046 np = list_next(&arc_prune_list, cp);
2047 refcount_add(&cp->p_refcnt, func);
2048 mutex_exit(&arc_prune_mtx);
2051 func(adjustment, private);
2053 mutex_enter(&arc_prune_mtx);
2055 /* User removed prune callback concurrently with execution */
2056 if (refcount_remove(&cp->p_refcnt, func) == 0) {
2057 ASSERT(!list_link_active(&cp->p_node));
2058 refcount_destroy(&cp->p_refcnt);
2059 kmem_free(cp, sizeof (*cp));
2065 ARCSTAT_BUMP(arcstat_prune);
2066 mutex_exit(&arc_prune_mtx);
2070 arc_do_user_evicts(void)
2072 mutex_enter(&arc_eviction_mtx);
2073 while (arc_eviction_list != NULL) {
2074 arc_buf_t *buf = arc_eviction_list;
2075 arc_eviction_list = buf->b_next;
2076 mutex_enter(&buf->b_evict_lock);
2078 mutex_exit(&buf->b_evict_lock);
2079 mutex_exit(&arc_eviction_mtx);
2081 if (buf->b_efunc != NULL)
2082 VERIFY(buf->b_efunc(buf) == 0);
2084 buf->b_efunc = NULL;
2085 buf->b_private = NULL;
2086 kmem_cache_free(buf_cache, buf);
2087 mutex_enter(&arc_eviction_mtx);
2089 mutex_exit(&arc_eviction_mtx);
2093 * Evict only meta data objects from the cache leaving the data objects.
2094 * This is only used to enforce the tunable arc_meta_limit, if we are
2095 * unable to evict enough buffers notify the user via the prune callback.
2098 arc_adjust_meta(int64_t adjustment, boolean_t may_prune)
2102 if (adjustment > 0 && arc_mru->arcs_lsize[ARC_BUFC_METADATA] > 0) {
2103 delta = MIN(arc_mru->arcs_lsize[ARC_BUFC_METADATA], adjustment);
2104 arc_evict(arc_mru, 0, delta, FALSE, ARC_BUFC_METADATA);
2105 adjustment -= delta;
2108 if (adjustment > 0 && arc_mfu->arcs_lsize[ARC_BUFC_METADATA] > 0) {
2109 delta = MIN(arc_mfu->arcs_lsize[ARC_BUFC_METADATA], adjustment);
2110 arc_evict(arc_mfu, 0, delta, FALSE, ARC_BUFC_METADATA);
2111 adjustment -= delta;
2114 if (may_prune && (adjustment > 0) && (arc_meta_used > arc_meta_limit))
2115 arc_do_user_prune(arc_meta_prune);
2119 * Flush all *evictable* data from the cache for the given spa.
2120 * NOTE: this will not touch "active" (i.e. referenced) data.
2123 arc_flush(spa_t *spa)
2128 guid = spa_load_guid(spa);
2130 while (list_head(&arc_mru->arcs_list[ARC_BUFC_DATA])) {
2131 (void) arc_evict(arc_mru, guid, -1, FALSE, ARC_BUFC_DATA);
2135 while (list_head(&arc_mru->arcs_list[ARC_BUFC_METADATA])) {
2136 (void) arc_evict(arc_mru, guid, -1, FALSE, ARC_BUFC_METADATA);
2140 while (list_head(&arc_mfu->arcs_list[ARC_BUFC_DATA])) {
2141 (void) arc_evict(arc_mfu, guid, -1, FALSE, ARC_BUFC_DATA);
2145 while (list_head(&arc_mfu->arcs_list[ARC_BUFC_METADATA])) {
2146 (void) arc_evict(arc_mfu, guid, -1, FALSE, ARC_BUFC_METADATA);
2151 arc_evict_ghost(arc_mru_ghost, guid, -1);
2152 arc_evict_ghost(arc_mfu_ghost, guid, -1);
2154 mutex_enter(&arc_reclaim_thr_lock);
2155 arc_do_user_evicts();
2156 mutex_exit(&arc_reclaim_thr_lock);
2157 ASSERT(spa || arc_eviction_list == NULL);
2161 arc_shrink(uint64_t bytes)
2163 if (arc_c > arc_c_min) {
2166 to_free = bytes ? bytes : arc_c >> arc_shrink_shift;
2168 if (arc_c > arc_c_min + to_free)
2169 atomic_add_64(&arc_c, -to_free);
2173 atomic_add_64(&arc_p, -(arc_p >> arc_shrink_shift));
2174 if (arc_c > arc_size)
2175 arc_c = MAX(arc_size, arc_c_min);
2177 arc_p = (arc_c >> 1);
2178 ASSERT(arc_c >= arc_c_min);
2179 ASSERT((int64_t)arc_p >= 0);
2182 if (arc_size > arc_c)
2187 arc_kmem_reap_now(arc_reclaim_strategy_t strat, uint64_t bytes)
2190 kmem_cache_t *prev_cache = NULL;
2191 kmem_cache_t *prev_data_cache = NULL;
2192 extern kmem_cache_t *zio_buf_cache[];
2193 extern kmem_cache_t *zio_data_buf_cache[];
2196 * An aggressive reclamation will shrink the cache size as well as
2197 * reap free buffers from the arc kmem caches.
2199 if (strat == ARC_RECLAIM_AGGR)
2202 for (i = 0; i < SPA_MAXBLOCKSIZE >> SPA_MINBLOCKSHIFT; i++) {
2203 if (zio_buf_cache[i] != prev_cache) {
2204 prev_cache = zio_buf_cache[i];
2205 kmem_cache_reap_now(zio_buf_cache[i]);
2207 if (zio_data_buf_cache[i] != prev_data_cache) {
2208 prev_data_cache = zio_data_buf_cache[i];
2209 kmem_cache_reap_now(zio_data_buf_cache[i]);
2213 kmem_cache_reap_now(buf_cache);
2214 kmem_cache_reap_now(hdr_cache);
2218 * Unlike other ZFS implementations this thread is only responsible for
2219 * adapting the target ARC size on Linux. The responsibility for memory
2220 * reclamation has been entirely delegated to the arc_shrinker_func()
2221 * which is registered with the VM. To reflect this change in behavior
2222 * the arc_reclaim thread has been renamed to arc_adapt.
2225 arc_adapt_thread(void)
2230 CALLB_CPR_INIT(&cpr, &arc_reclaim_thr_lock, callb_generic_cpr, FTAG);
2232 mutex_enter(&arc_reclaim_thr_lock);
2233 while (arc_thread_exit == 0) {
2235 arc_reclaim_strategy_t last_reclaim = ARC_RECLAIM_CONS;
2237 if (spa_get_random(100) == 0) {
2240 if (last_reclaim == ARC_RECLAIM_CONS) {
2241 last_reclaim = ARC_RECLAIM_AGGR;
2243 last_reclaim = ARC_RECLAIM_CONS;
2247 last_reclaim = ARC_RECLAIM_AGGR;
2251 /* reset the growth delay for every reclaim */
2252 arc_grow_time = ddi_get_lbolt()+(arc_grow_retry * hz);
2254 arc_kmem_reap_now(last_reclaim, 0);
2257 #endif /* !_KERNEL */
2259 /* No recent memory pressure allow the ARC to grow. */
2260 if (arc_no_grow && ddi_get_lbolt() >= arc_grow_time)
2261 arc_no_grow = FALSE;
2264 * Keep meta data usage within limits, arc_shrink() is not
2265 * used to avoid collapsing the arc_c value when only the
2266 * arc_meta_limit is being exceeded.
2268 prune = (int64_t)arc_meta_used - (int64_t)arc_meta_limit;
2270 arc_adjust_meta(prune, B_TRUE);
2274 if (arc_eviction_list != NULL)
2275 arc_do_user_evicts();
2277 /* block until needed, or one second, whichever is shorter */
2278 CALLB_CPR_SAFE_BEGIN(&cpr);
2279 (void) cv_timedwait_interruptible(&arc_reclaim_thr_cv,
2280 &arc_reclaim_thr_lock, (ddi_get_lbolt() + hz));
2281 CALLB_CPR_SAFE_END(&cpr, &arc_reclaim_thr_lock);
2284 arc_thread_exit = 0;
2285 cv_broadcast(&arc_reclaim_thr_cv);
2286 CALLB_CPR_EXIT(&cpr); /* drops arc_reclaim_thr_lock */
2292 * Determine the amount of memory eligible for eviction contained in the
2293 * ARC. All clean data reported by the ghost lists can always be safely
2294 * evicted. Due to arc_c_min, the same does not hold for all clean data
2295 * contained by the regular mru and mfu lists.
2297 * In the case of the regular mru and mfu lists, we need to report as
2298 * much clean data as possible, such that evicting that same reported
2299 * data will not bring arc_size below arc_c_min. Thus, in certain
2300 * circumstances, the total amount of clean data in the mru and mfu
2301 * lists might not actually be evictable.
2303 * The following two distinct cases are accounted for:
2305 * 1. The sum of the amount of dirty data contained by both the mru and
2306 * mfu lists, plus the ARC's other accounting (e.g. the anon list),
2307 * is greater than or equal to arc_c_min.
2308 * (i.e. amount of dirty data >= arc_c_min)
2310 * This is the easy case; all clean data contained by the mru and mfu
2311 * lists is evictable. Evicting all clean data can only drop arc_size
2312 * to the amount of dirty data, which is greater than arc_c_min.
2314 * 2. The sum of the amount of dirty data contained by both the mru and
2315 * mfu lists, plus the ARC's other accounting (e.g. the anon list),
2316 * is less than arc_c_min.
2317 * (i.e. arc_c_min > amount of dirty data)
2319 * 2.1. arc_size is greater than or equal arc_c_min.
2320 * (i.e. arc_size >= arc_c_min > amount of dirty data)
2322 * In this case, not all clean data from the regular mru and mfu
2323 * lists is actually evictable; we must leave enough clean data
2324 * to keep arc_size above arc_c_min. Thus, the maximum amount of
2325 * evictable data from the two lists combined, is exactly the
2326 * difference between arc_size and arc_c_min.
2328 * 2.2. arc_size is less than arc_c_min
2329 * (i.e. arc_c_min > arc_size > amount of dirty data)
2331 * In this case, none of the data contained in the mru and mfu
2332 * lists is evictable, even if it's clean. Since arc_size is
2333 * already below arc_c_min, evicting any more would only
2334 * increase this negative difference.
2337 arc_evictable_memory(void) {
2338 uint64_t arc_clean =
2339 arc_mru->arcs_lsize[ARC_BUFC_DATA] +
2340 arc_mru->arcs_lsize[ARC_BUFC_METADATA] +
2341 arc_mfu->arcs_lsize[ARC_BUFC_DATA] +
2342 arc_mfu->arcs_lsize[ARC_BUFC_METADATA];
2343 uint64_t ghost_clean =
2344 arc_mru_ghost->arcs_lsize[ARC_BUFC_DATA] +
2345 arc_mru_ghost->arcs_lsize[ARC_BUFC_METADATA] +
2346 arc_mfu_ghost->arcs_lsize[ARC_BUFC_DATA] +
2347 arc_mfu_ghost->arcs_lsize[ARC_BUFC_METADATA];
2348 uint64_t arc_dirty = MAX((int64_t)arc_size - (int64_t)arc_clean, 0);
2350 if (arc_dirty >= arc_c_min)
2351 return (ghost_clean + arc_clean);
2353 return (ghost_clean + MAX((int64_t)arc_size - (int64_t)arc_c_min, 0));
2357 __arc_shrinker_func(struct shrinker *shrink, struct shrink_control *sc)
2361 /* The arc is considered warm once reclaim has occurred */
2362 if (unlikely(arc_warm == B_FALSE))
2365 /* Return the potential number of reclaimable pages */
2366 pages = btop(arc_evictable_memory());
2367 if (sc->nr_to_scan == 0)
2370 /* Not allowed to perform filesystem reclaim */
2371 if (!(sc->gfp_mask & __GFP_FS))
2374 /* Reclaim in progress */
2375 if (mutex_tryenter(&arc_reclaim_thr_lock) == 0)
2379 * Evict the requested number of pages by shrinking arc_c the
2380 * requested amount. If there is nothing left to evict just
2381 * reap whatever we can from the various arc slabs.
2384 arc_kmem_reap_now(ARC_RECLAIM_AGGR, ptob(sc->nr_to_scan));
2385 pages = btop(arc_evictable_memory());
2387 arc_kmem_reap_now(ARC_RECLAIM_CONS, ptob(sc->nr_to_scan));
2392 * When direct reclaim is observed it usually indicates a rapid
2393 * increase in memory pressure. This occurs because the kswapd
2394 * threads were unable to asynchronously keep enough free memory
2395 * available. In this case set arc_no_grow to briefly pause arc
2396 * growth to avoid compounding the memory pressure.
2398 if (current_is_kswapd()) {
2399 ARCSTAT_BUMP(arcstat_memory_indirect_count);
2401 arc_no_grow = B_TRUE;
2402 arc_grow_time = ddi_get_lbolt() + (arc_grow_retry * hz);
2403 ARCSTAT_BUMP(arcstat_memory_direct_count);
2406 mutex_exit(&arc_reclaim_thr_lock);
2410 SPL_SHRINKER_CALLBACK_WRAPPER(arc_shrinker_func);
2412 SPL_SHRINKER_DECLARE(arc_shrinker, arc_shrinker_func, DEFAULT_SEEKS);
2413 #endif /* _KERNEL */
2416 * Adapt arc info given the number of bytes we are trying to add and
2417 * the state that we are comming from. This function is only called
2418 * when we are adding new content to the cache.
2421 arc_adapt(int bytes, arc_state_t *state)
2424 uint64_t arc_p_min = (arc_c >> arc_p_min_shift);
2426 if (state == arc_l2c_only)
2431 * Adapt the target size of the MRU list:
2432 * - if we just hit in the MRU ghost list, then increase
2433 * the target size of the MRU list.
2434 * - if we just hit in the MFU ghost list, then increase
2435 * the target size of the MFU list by decreasing the
2436 * target size of the MRU list.
2438 if (state == arc_mru_ghost) {
2439 mult = ((arc_mru_ghost->arcs_size >= arc_mfu_ghost->arcs_size) ?
2440 1 : (arc_mfu_ghost->arcs_size/arc_mru_ghost->arcs_size));
2441 mult = MIN(mult, 10); /* avoid wild arc_p adjustment */
2443 arc_p = MIN(arc_c - arc_p_min, arc_p + bytes * mult);
2444 } else if (state == arc_mfu_ghost) {
2447 mult = ((arc_mfu_ghost->arcs_size >= arc_mru_ghost->arcs_size) ?
2448 1 : (arc_mru_ghost->arcs_size/arc_mfu_ghost->arcs_size));
2449 mult = MIN(mult, 10);
2451 delta = MIN(bytes * mult, arc_p);
2452 arc_p = MAX(arc_p_min, arc_p - delta);
2454 ASSERT((int64_t)arc_p >= 0);
2459 if (arc_c >= arc_c_max)
2463 * If we're within (2 * maxblocksize) bytes of the target
2464 * cache size, increment the target cache size
2466 if (arc_size > arc_c - (2ULL << SPA_MAXBLOCKSHIFT)) {
2467 atomic_add_64(&arc_c, (int64_t)bytes);
2468 if (arc_c > arc_c_max)
2470 else if (state == arc_anon)
2471 atomic_add_64(&arc_p, (int64_t)bytes);
2475 ASSERT((int64_t)arc_p >= 0);
2479 * Check if the cache has reached its limits and eviction is required
2483 arc_evict_needed(arc_buf_contents_t type)
2485 if (type == ARC_BUFC_METADATA && arc_meta_used >= arc_meta_limit)
2491 return (arc_size > arc_c);
2495 * The buffer, supplied as the first argument, needs a data block.
2496 * So, if we are at cache max, determine which cache should be victimized.
2497 * We have the following cases:
2499 * 1. Insert for MRU, p > sizeof(arc_anon + arc_mru) ->
2500 * In this situation if we're out of space, but the resident size of the MFU is
2501 * under the limit, victimize the MFU cache to satisfy this insertion request.
2503 * 2. Insert for MRU, p <= sizeof(arc_anon + arc_mru) ->
2504 * Here, we've used up all of the available space for the MRU, so we need to
2505 * evict from our own cache instead. Evict from the set of resident MRU
2508 * 3. Insert for MFU (c - p) > sizeof(arc_mfu) ->
2509 * c minus p represents the MFU space in the cache, since p is the size of the
2510 * cache that is dedicated to the MRU. In this situation there's still space on
2511 * the MFU side, so the MRU side needs to be victimized.
2513 * 4. Insert for MFU (c - p) < sizeof(arc_mfu) ->
2514 * MFU's resident set is consuming more space than it has been allotted. In
2515 * this situation, we must victimize our own cache, the MFU, for this insertion.
2518 arc_get_data_buf(arc_buf_t *buf)
2520 arc_state_t *state = buf->b_hdr->b_state;
2521 uint64_t size = buf->b_hdr->b_size;
2522 arc_buf_contents_t type = buf->b_hdr->b_type;
2524 arc_adapt(size, state);
2527 * We have not yet reached cache maximum size,
2528 * just allocate a new buffer.
2530 if (!arc_evict_needed(type)) {
2531 if (type == ARC_BUFC_METADATA) {
2532 buf->b_data = zio_buf_alloc(size);
2533 arc_space_consume(size, ARC_SPACE_DATA);
2535 ASSERT(type == ARC_BUFC_DATA);
2536 buf->b_data = zio_data_buf_alloc(size);
2537 ARCSTAT_INCR(arcstat_data_size, size);
2538 atomic_add_64(&arc_size, size);
2544 * If we are prefetching from the mfu ghost list, this buffer
2545 * will end up on the mru list; so steal space from there.
2547 if (state == arc_mfu_ghost)
2548 state = buf->b_hdr->b_flags & ARC_PREFETCH ? arc_mru : arc_mfu;
2549 else if (state == arc_mru_ghost)
2552 if (state == arc_mru || state == arc_anon) {
2553 uint64_t mru_used = arc_anon->arcs_size + arc_mru->arcs_size;
2554 state = (arc_mfu->arcs_lsize[type] >= size &&
2555 arc_p > mru_used) ? arc_mfu : arc_mru;
2558 uint64_t mfu_space = arc_c - arc_p;
2559 state = (arc_mru->arcs_lsize[type] >= size &&
2560 mfu_space > arc_mfu->arcs_size) ? arc_mru : arc_mfu;
2563 if ((buf->b_data = arc_evict(state, 0, size, TRUE, type)) == NULL) {
2564 if (type == ARC_BUFC_METADATA) {
2565 buf->b_data = zio_buf_alloc(size);
2566 arc_space_consume(size, ARC_SPACE_DATA);
2569 * If we are unable to recycle an existing meta buffer
2570 * signal the reclaim thread. It will notify users
2571 * via the prune callback to drop references. The
2572 * prune callback in run in the context of the reclaim
2573 * thread to avoid deadlocking on the hash_lock.
2575 cv_signal(&arc_reclaim_thr_cv);
2577 ASSERT(type == ARC_BUFC_DATA);
2578 buf->b_data = zio_data_buf_alloc(size);
2579 ARCSTAT_INCR(arcstat_data_size, size);
2580 atomic_add_64(&arc_size, size);
2583 ARCSTAT_BUMP(arcstat_recycle_miss);
2585 ASSERT(buf->b_data != NULL);
2588 * Update the state size. Note that ghost states have a
2589 * "ghost size" and so don't need to be updated.
2591 if (!GHOST_STATE(buf->b_hdr->b_state)) {
2592 arc_buf_hdr_t *hdr = buf->b_hdr;
2594 atomic_add_64(&hdr->b_state->arcs_size, size);
2595 if (list_link_active(&hdr->b_arc_node)) {
2596 ASSERT(refcount_is_zero(&hdr->b_refcnt));
2597 atomic_add_64(&hdr->b_state->arcs_lsize[type], size);
2600 * If we are growing the cache, and we are adding anonymous
2601 * data, and we have outgrown arc_p, update arc_p
2603 if (arc_size < arc_c && hdr->b_state == arc_anon &&
2604 arc_anon->arcs_size + arc_mru->arcs_size > arc_p)
2605 arc_p = MIN(arc_c, arc_p + size);
2610 * This routine is called whenever a buffer is accessed.
2611 * NOTE: the hash lock is dropped in this function.
2614 arc_access(arc_buf_hdr_t *buf, kmutex_t *hash_lock)
2618 ASSERT(MUTEX_HELD(hash_lock));
2620 if (buf->b_state == arc_anon) {
2622 * This buffer is not in the cache, and does not
2623 * appear in our "ghost" list. Add the new buffer
2627 ASSERT(buf->b_arc_access == 0);
2628 buf->b_arc_access = ddi_get_lbolt();
2629 DTRACE_PROBE1(new_state__mru, arc_buf_hdr_t *, buf);
2630 arc_change_state(arc_mru, buf, hash_lock);
2632 } else if (buf->b_state == arc_mru) {
2633 now = ddi_get_lbolt();
2636 * If this buffer is here because of a prefetch, then either:
2637 * - clear the flag if this is a "referencing" read
2638 * (any subsequent access will bump this into the MFU state).
2640 * - move the buffer to the head of the list if this is
2641 * another prefetch (to make it less likely to be evicted).
2643 if ((buf->b_flags & ARC_PREFETCH) != 0) {
2644 if (refcount_count(&buf->b_refcnt) == 0) {
2645 ASSERT(list_link_active(&buf->b_arc_node));
2647 buf->b_flags &= ~ARC_PREFETCH;
2648 ARCSTAT_BUMP(arcstat_mru_hits);
2650 buf->b_arc_access = now;
2655 * This buffer has been "accessed" only once so far,
2656 * but it is still in the cache. Move it to the MFU
2659 if (now > buf->b_arc_access + ARC_MINTIME) {
2661 * More than 125ms have passed since we
2662 * instantiated this buffer. Move it to the
2663 * most frequently used state.
2665 buf->b_arc_access = now;
2666 DTRACE_PROBE1(new_state__mfu, arc_buf_hdr_t *, buf);
2667 arc_change_state(arc_mfu, buf, hash_lock);
2669 ARCSTAT_BUMP(arcstat_mru_hits);
2670 } else if (buf->b_state == arc_mru_ghost) {
2671 arc_state_t *new_state;
2673 * This buffer has been "accessed" recently, but
2674 * was evicted from the cache. Move it to the
2678 if (buf->b_flags & ARC_PREFETCH) {
2679 new_state = arc_mru;
2680 if (refcount_count(&buf->b_refcnt) > 0)
2681 buf->b_flags &= ~ARC_PREFETCH;
2682 DTRACE_PROBE1(new_state__mru, arc_buf_hdr_t *, buf);
2684 new_state = arc_mfu;
2685 DTRACE_PROBE1(new_state__mfu, arc_buf_hdr_t *, buf);
2688 buf->b_arc_access = ddi_get_lbolt();
2689 arc_change_state(new_state, buf, hash_lock);
2691 ARCSTAT_BUMP(arcstat_mru_ghost_hits);
2692 } else if (buf->b_state == arc_mfu) {
2694 * This buffer has been accessed more than once and is
2695 * still in the cache. Keep it in the MFU state.
2697 * NOTE: an add_reference() that occurred when we did
2698 * the arc_read() will have kicked this off the list.
2699 * If it was a prefetch, we will explicitly move it to
2700 * the head of the list now.
2702 if ((buf->b_flags & ARC_PREFETCH) != 0) {
2703 ASSERT(refcount_count(&buf->b_refcnt) == 0);
2704 ASSERT(list_link_active(&buf->b_arc_node));
2706 ARCSTAT_BUMP(arcstat_mfu_hits);
2707 buf->b_arc_access = ddi_get_lbolt();
2708 } else if (buf->b_state == arc_mfu_ghost) {
2709 arc_state_t *new_state = arc_mfu;
2711 * This buffer has been accessed more than once but has
2712 * been evicted from the cache. Move it back to the
2716 if (buf->b_flags & ARC_PREFETCH) {
2718 * This is a prefetch access...
2719 * move this block back to the MRU state.
2721 ASSERT0(refcount_count(&buf->b_refcnt));
2722 new_state = arc_mru;
2725 buf->b_arc_access = ddi_get_lbolt();
2726 DTRACE_PROBE1(new_state__mfu, arc_buf_hdr_t *, buf);
2727 arc_change_state(new_state, buf, hash_lock);
2729 ARCSTAT_BUMP(arcstat_mfu_ghost_hits);
2730 } else if (buf->b_state == arc_l2c_only) {
2732 * This buffer is on the 2nd Level ARC.
2735 buf->b_arc_access = ddi_get_lbolt();
2736 DTRACE_PROBE1(new_state__mfu, arc_buf_hdr_t *, buf);
2737 arc_change_state(arc_mfu, buf, hash_lock);
2739 ASSERT(!"invalid arc state");
2743 /* a generic arc_done_func_t which you can use */
2746 arc_bcopy_func(zio_t *zio, arc_buf_t *buf, void *arg)
2748 if (zio == NULL || zio->io_error == 0)
2749 bcopy(buf->b_data, arg, buf->b_hdr->b_size);
2750 VERIFY(arc_buf_remove_ref(buf, arg) == 1);
2753 /* a generic arc_done_func_t */
2755 arc_getbuf_func(zio_t *zio, arc_buf_t *buf, void *arg)
2757 arc_buf_t **bufp = arg;
2758 if (zio && zio->io_error) {
2759 VERIFY(arc_buf_remove_ref(buf, arg) == 1);
2763 ASSERT(buf->b_data);
2768 arc_read_done(zio_t *zio)
2770 arc_buf_hdr_t *hdr, *found;
2772 arc_buf_t *abuf; /* buffer we're assigning to callback */
2773 kmutex_t *hash_lock;
2774 arc_callback_t *callback_list, *acb;
2775 int freeable = FALSE;
2777 buf = zio->io_private;
2781 * The hdr was inserted into hash-table and removed from lists
2782 * prior to starting I/O. We should find this header, since
2783 * it's in the hash table, and it should be legit since it's
2784 * not possible to evict it during the I/O. The only possible
2785 * reason for it not to be found is if we were freed during the
2788 found = buf_hash_find(hdr->b_spa, &hdr->b_dva, hdr->b_birth,
2791 ASSERT((found == NULL && HDR_FREED_IN_READ(hdr) && hash_lock == NULL) ||
2792 (found == hdr && DVA_EQUAL(&hdr->b_dva, BP_IDENTITY(zio->io_bp))) ||
2793 (found == hdr && HDR_L2_READING(hdr)));
2795 hdr->b_flags &= ~ARC_L2_EVICTED;
2796 if (l2arc_noprefetch && (hdr->b_flags & ARC_PREFETCH))
2797 hdr->b_flags &= ~ARC_L2CACHE;
2799 /* byteswap if necessary */
2800 callback_list = hdr->b_acb;
2801 ASSERT(callback_list != NULL);
2802 if (BP_SHOULD_BYTESWAP(zio->io_bp) && zio->io_error == 0) {
2803 dmu_object_byteswap_t bswap =
2804 DMU_OT_BYTESWAP(BP_GET_TYPE(zio->io_bp));
2805 if (BP_GET_LEVEL(zio->io_bp) > 0)
2806 byteswap_uint64_array(buf->b_data, hdr->b_size);
2808 dmu_ot_byteswap[bswap].ob_func(buf->b_data, hdr->b_size);
2811 arc_cksum_compute(buf, B_FALSE);
2813 if (hash_lock && zio->io_error == 0 && hdr->b_state == arc_anon) {
2815 * Only call arc_access on anonymous buffers. This is because
2816 * if we've issued an I/O for an evicted buffer, we've already
2817 * called arc_access (to prevent any simultaneous readers from
2818 * getting confused).
2820 arc_access(hdr, hash_lock);
2823 /* create copies of the data buffer for the callers */
2825 for (acb = callback_list; acb; acb = acb->acb_next) {
2826 if (acb->acb_done) {
2828 ARCSTAT_BUMP(arcstat_duplicate_reads);
2829 abuf = arc_buf_clone(buf);
2831 acb->acb_buf = abuf;
2836 hdr->b_flags &= ~ARC_IO_IN_PROGRESS;
2837 ASSERT(!HDR_BUF_AVAILABLE(hdr));
2839 ASSERT(buf->b_efunc == NULL);
2840 ASSERT(hdr->b_datacnt == 1);
2841 hdr->b_flags |= ARC_BUF_AVAILABLE;
2844 ASSERT(refcount_is_zero(&hdr->b_refcnt) || callback_list != NULL);
2846 if (zio->io_error != 0) {
2847 hdr->b_flags |= ARC_IO_ERROR;
2848 if (hdr->b_state != arc_anon)
2849 arc_change_state(arc_anon, hdr, hash_lock);
2850 if (HDR_IN_HASH_TABLE(hdr))
2851 buf_hash_remove(hdr);
2852 freeable = refcount_is_zero(&hdr->b_refcnt);
2856 * Broadcast before we drop the hash_lock to avoid the possibility
2857 * that the hdr (and hence the cv) might be freed before we get to
2858 * the cv_broadcast().
2860 cv_broadcast(&hdr->b_cv);
2863 mutex_exit(hash_lock);
2866 * This block was freed while we waited for the read to
2867 * complete. It has been removed from the hash table and
2868 * moved to the anonymous state (so that it won't show up
2871 ASSERT3P(hdr->b_state, ==, arc_anon);
2872 freeable = refcount_is_zero(&hdr->b_refcnt);
2875 /* execute each callback and free its structure */
2876 while ((acb = callback_list) != NULL) {
2878 acb->acb_done(zio, acb->acb_buf, acb->acb_private);
2880 if (acb->acb_zio_dummy != NULL) {
2881 acb->acb_zio_dummy->io_error = zio->io_error;
2882 zio_nowait(acb->acb_zio_dummy);
2885 callback_list = acb->acb_next;
2886 kmem_free(acb, sizeof (arc_callback_t));
2890 arc_hdr_destroy(hdr);
2894 * "Read" the block at the specified DVA (in bp) via the
2895 * cache. If the block is found in the cache, invoke the provided
2896 * callback immediately and return. Note that the `zio' parameter
2897 * in the callback will be NULL in this case, since no IO was
2898 * required. If the block is not in the cache pass the read request
2899 * on to the spa with a substitute callback function, so that the
2900 * requested block will be added to the cache.
2902 * If a read request arrives for a block that has a read in-progress,
2903 * either wait for the in-progress read to complete (and return the
2904 * results); or, if this is a read with a "done" func, add a record
2905 * to the read to invoke the "done" func when the read completes,
2906 * and return; or just return.
2908 * arc_read_done() will invoke all the requested "done" functions
2909 * for readers of this block.
2912 arc_read(zio_t *pio, spa_t *spa, const blkptr_t *bp, arc_done_func_t *done,
2913 void *private, int priority, int zio_flags, uint32_t *arc_flags,
2914 const zbookmark_t *zb)
2917 arc_buf_t *buf = NULL;
2918 kmutex_t *hash_lock;
2920 uint64_t guid = spa_load_guid(spa);
2923 hdr = buf_hash_find(guid, BP_IDENTITY(bp), BP_PHYSICAL_BIRTH(bp),
2925 if (hdr && hdr->b_datacnt > 0) {
2927 *arc_flags |= ARC_CACHED;
2929 if (HDR_IO_IN_PROGRESS(hdr)) {
2931 if (*arc_flags & ARC_WAIT) {
2932 cv_wait(&hdr->b_cv, hash_lock);
2933 mutex_exit(hash_lock);
2936 ASSERT(*arc_flags & ARC_NOWAIT);
2939 arc_callback_t *acb = NULL;
2941 acb = kmem_zalloc(sizeof (arc_callback_t),
2943 acb->acb_done = done;
2944 acb->acb_private = private;
2946 acb->acb_zio_dummy = zio_null(pio,
2947 spa, NULL, NULL, NULL, zio_flags);
2949 ASSERT(acb->acb_done != NULL);
2950 acb->acb_next = hdr->b_acb;
2952 add_reference(hdr, hash_lock, private);
2953 mutex_exit(hash_lock);
2956 mutex_exit(hash_lock);
2960 ASSERT(hdr->b_state == arc_mru || hdr->b_state == arc_mfu);
2963 add_reference(hdr, hash_lock, private);
2965 * If this block is already in use, create a new
2966 * copy of the data so that we will be guaranteed
2967 * that arc_release() will always succeed.
2971 ASSERT(buf->b_data);
2972 if (HDR_BUF_AVAILABLE(hdr)) {
2973 ASSERT(buf->b_efunc == NULL);
2974 hdr->b_flags &= ~ARC_BUF_AVAILABLE;
2976 buf = arc_buf_clone(buf);
2979 } else if (*arc_flags & ARC_PREFETCH &&
2980 refcount_count(&hdr->b_refcnt) == 0) {
2981 hdr->b_flags |= ARC_PREFETCH;
2983 DTRACE_PROBE1(arc__hit, arc_buf_hdr_t *, hdr);
2984 arc_access(hdr, hash_lock);
2985 if (*arc_flags & ARC_L2CACHE)
2986 hdr->b_flags |= ARC_L2CACHE;
2987 mutex_exit(hash_lock);
2988 ARCSTAT_BUMP(arcstat_hits);
2989 ARCSTAT_CONDSTAT(!(hdr->b_flags & ARC_PREFETCH),
2990 demand, prefetch, hdr->b_type != ARC_BUFC_METADATA,
2991 data, metadata, hits);
2994 done(NULL, buf, private);
2996 uint64_t size = BP_GET_LSIZE(bp);
2997 arc_callback_t *acb;
3000 boolean_t devw = B_FALSE;
3003 /* this block is not in the cache */
3004 arc_buf_hdr_t *exists;
3005 arc_buf_contents_t type = BP_GET_BUFC_TYPE(bp);
3006 buf = arc_buf_alloc(spa, size, private, type);
3008 hdr->b_dva = *BP_IDENTITY(bp);
3009 hdr->b_birth = BP_PHYSICAL_BIRTH(bp);
3010 hdr->b_cksum0 = bp->blk_cksum.zc_word[0];
3011 exists = buf_hash_insert(hdr, &hash_lock);
3013 /* somebody beat us to the hash insert */
3014 mutex_exit(hash_lock);
3015 buf_discard_identity(hdr);
3016 (void) arc_buf_remove_ref(buf, private);
3017 goto top; /* restart the IO request */
3019 /* if this is a prefetch, we don't have a reference */
3020 if (*arc_flags & ARC_PREFETCH) {
3021 (void) remove_reference(hdr, hash_lock,
3023 hdr->b_flags |= ARC_PREFETCH;
3025 if (*arc_flags & ARC_L2CACHE)
3026 hdr->b_flags |= ARC_L2CACHE;
3027 if (BP_GET_LEVEL(bp) > 0)
3028 hdr->b_flags |= ARC_INDIRECT;
3030 /* this block is in the ghost cache */
3031 ASSERT(GHOST_STATE(hdr->b_state));
3032 ASSERT(!HDR_IO_IN_PROGRESS(hdr));
3033 ASSERT0(refcount_count(&hdr->b_refcnt));
3034 ASSERT(hdr->b_buf == NULL);
3036 /* if this is a prefetch, we don't have a reference */
3037 if (*arc_flags & ARC_PREFETCH)
3038 hdr->b_flags |= ARC_PREFETCH;
3040 add_reference(hdr, hash_lock, private);
3041 if (*arc_flags & ARC_L2CACHE)
3042 hdr->b_flags |= ARC_L2CACHE;
3043 buf = kmem_cache_alloc(buf_cache, KM_PUSHPAGE);
3046 buf->b_efunc = NULL;
3047 buf->b_private = NULL;
3050 ASSERT(hdr->b_datacnt == 0);
3052 arc_get_data_buf(buf);
3053 arc_access(hdr, hash_lock);
3056 ASSERT(!GHOST_STATE(hdr->b_state));
3058 acb = kmem_zalloc(sizeof (arc_callback_t), KM_PUSHPAGE);
3059 acb->acb_done = done;
3060 acb->acb_private = private;
3062 ASSERT(hdr->b_acb == NULL);
3064 hdr->b_flags |= ARC_IO_IN_PROGRESS;
3066 if (HDR_L2CACHE(hdr) && hdr->b_l2hdr != NULL &&
3067 (vd = hdr->b_l2hdr->b_dev->l2ad_vdev) != NULL) {
3068 devw = hdr->b_l2hdr->b_dev->l2ad_writing;
3069 addr = hdr->b_l2hdr->b_daddr;
3071 * Lock out device removal.
3073 if (vdev_is_dead(vd) ||
3074 !spa_config_tryenter(spa, SCL_L2ARC, vd, RW_READER))
3078 mutex_exit(hash_lock);
3080 ASSERT3U(hdr->b_size, ==, size);
3081 DTRACE_PROBE4(arc__miss, arc_buf_hdr_t *, hdr, blkptr_t *, bp,
3082 uint64_t, size, zbookmark_t *, zb);
3083 ARCSTAT_BUMP(arcstat_misses);
3084 ARCSTAT_CONDSTAT(!(hdr->b_flags & ARC_PREFETCH),
3085 demand, prefetch, hdr->b_type != ARC_BUFC_METADATA,
3086 data, metadata, misses);
3088 if (vd != NULL && l2arc_ndev != 0 && !(l2arc_norw && devw)) {
3090 * Read from the L2ARC if the following are true:
3091 * 1. The L2ARC vdev was previously cached.
3092 * 2. This buffer still has L2ARC metadata.
3093 * 3. This buffer isn't currently writing to the L2ARC.
3094 * 4. The L2ARC entry wasn't evicted, which may
3095 * also have invalidated the vdev.
3096 * 5. This isn't prefetch and l2arc_noprefetch is set.
3098 if (hdr->b_l2hdr != NULL &&
3099 !HDR_L2_WRITING(hdr) && !HDR_L2_EVICTED(hdr) &&
3100 !(l2arc_noprefetch && HDR_PREFETCH(hdr))) {
3101 l2arc_read_callback_t *cb;
3103 DTRACE_PROBE1(l2arc__hit, arc_buf_hdr_t *, hdr);
3104 ARCSTAT_BUMP(arcstat_l2_hits);
3106 cb = kmem_zalloc(sizeof (l2arc_read_callback_t),
3108 cb->l2rcb_buf = buf;
3109 cb->l2rcb_spa = spa;
3112 cb->l2rcb_flags = zio_flags;
3115 * l2arc read. The SCL_L2ARC lock will be
3116 * released by l2arc_read_done().
3118 rzio = zio_read_phys(pio, vd, addr, size,
3119 buf->b_data, ZIO_CHECKSUM_OFF,
3120 l2arc_read_done, cb, priority, zio_flags |
3121 ZIO_FLAG_DONT_CACHE | ZIO_FLAG_CANFAIL |
3122 ZIO_FLAG_DONT_PROPAGATE |
3123 ZIO_FLAG_DONT_RETRY, B_FALSE);
3124 DTRACE_PROBE2(l2arc__read, vdev_t *, vd,
3126 ARCSTAT_INCR(arcstat_l2_read_bytes, size);
3128 if (*arc_flags & ARC_NOWAIT) {
3133 ASSERT(*arc_flags & ARC_WAIT);
3134 if (zio_wait(rzio) == 0)
3137 /* l2arc read error; goto zio_read() */
3139 DTRACE_PROBE1(l2arc__miss,
3140 arc_buf_hdr_t *, hdr);
3141 ARCSTAT_BUMP(arcstat_l2_misses);
3142 if (HDR_L2_WRITING(hdr))
3143 ARCSTAT_BUMP(arcstat_l2_rw_clash);
3144 spa_config_exit(spa, SCL_L2ARC, vd);
3148 spa_config_exit(spa, SCL_L2ARC, vd);
3149 if (l2arc_ndev != 0) {
3150 DTRACE_PROBE1(l2arc__miss,
3151 arc_buf_hdr_t *, hdr);
3152 ARCSTAT_BUMP(arcstat_l2_misses);
3156 rzio = zio_read(pio, spa, bp, buf->b_data, size,
3157 arc_read_done, buf, priority, zio_flags, zb);
3159 if (*arc_flags & ARC_WAIT)
3160 return (zio_wait(rzio));
3162 ASSERT(*arc_flags & ARC_NOWAIT);
3169 arc_add_prune_callback(arc_prune_func_t *func, void *private)
3173 p = kmem_alloc(sizeof(*p), KM_SLEEP);
3175 p->p_private = private;
3176 list_link_init(&p->p_node);
3177 refcount_create(&p->p_refcnt);
3179 mutex_enter(&arc_prune_mtx);
3180 refcount_add(&p->p_refcnt, &arc_prune_list);
3181 list_insert_head(&arc_prune_list, p);
3182 mutex_exit(&arc_prune_mtx);
3188 arc_remove_prune_callback(arc_prune_t *p)
3190 mutex_enter(&arc_prune_mtx);
3191 list_remove(&arc_prune_list, p);
3192 if (refcount_remove(&p->p_refcnt, &arc_prune_list) == 0) {
3193 refcount_destroy(&p->p_refcnt);
3194 kmem_free(p, sizeof (*p));
3196 mutex_exit(&arc_prune_mtx);
3200 arc_set_callback(arc_buf_t *buf, arc_evict_func_t *func, void *private)
3202 ASSERT(buf->b_hdr != NULL);
3203 ASSERT(buf->b_hdr->b_state != arc_anon);
3204 ASSERT(!refcount_is_zero(&buf->b_hdr->b_refcnt) || func == NULL);
3205 ASSERT(buf->b_efunc == NULL);
3206 ASSERT(!HDR_BUF_AVAILABLE(buf->b_hdr));
3208 buf->b_efunc = func;
3209 buf->b_private = private;
3213 * Notify the arc that a block was freed, and thus will never be used again.
3216 arc_freed(spa_t *spa, const blkptr_t *bp)
3219 kmutex_t *hash_lock;
3220 uint64_t guid = spa_load_guid(spa);
3222 hdr = buf_hash_find(guid, BP_IDENTITY(bp), BP_PHYSICAL_BIRTH(bp),
3226 if (HDR_BUF_AVAILABLE(hdr)) {
3227 arc_buf_t *buf = hdr->b_buf;
3228 add_reference(hdr, hash_lock, FTAG);
3229 hdr->b_flags &= ~ARC_BUF_AVAILABLE;
3230 mutex_exit(hash_lock);
3232 arc_release(buf, FTAG);
3233 (void) arc_buf_remove_ref(buf, FTAG);
3235 mutex_exit(hash_lock);
3241 * This is used by the DMU to let the ARC know that a buffer is
3242 * being evicted, so the ARC should clean up. If this arc buf
3243 * is not yet in the evicted state, it will be put there.
3246 arc_buf_evict(arc_buf_t *buf)
3249 kmutex_t *hash_lock;
3252 mutex_enter(&buf->b_evict_lock);
3256 * We are in arc_do_user_evicts().
3258 ASSERT(buf->b_data == NULL);
3259 mutex_exit(&buf->b_evict_lock);
3261 } else if (buf->b_data == NULL) {
3262 arc_buf_t copy = *buf; /* structure assignment */
3264 * We are on the eviction list; process this buffer now
3265 * but let arc_do_user_evicts() do the reaping.
3267 buf->b_efunc = NULL;
3268 mutex_exit(&buf->b_evict_lock);
3269 VERIFY(copy.b_efunc(©) == 0);
3272 hash_lock = HDR_LOCK(hdr);
3273 mutex_enter(hash_lock);
3275 ASSERT3P(hash_lock, ==, HDR_LOCK(hdr));
3277 ASSERT3U(refcount_count(&hdr->b_refcnt), <, hdr->b_datacnt);
3278 ASSERT(hdr->b_state == arc_mru || hdr->b_state == arc_mfu);
3281 * Pull this buffer off of the hdr
3284 while (*bufp != buf)
3285 bufp = &(*bufp)->b_next;
3286 *bufp = buf->b_next;
3288 ASSERT(buf->b_data != NULL);
3289 arc_buf_destroy(buf, FALSE, FALSE);
3291 if (hdr->b_datacnt == 0) {
3292 arc_state_t *old_state = hdr->b_state;
3293 arc_state_t *evicted_state;
3295 ASSERT(hdr->b_buf == NULL);
3296 ASSERT(refcount_is_zero(&hdr->b_refcnt));
3299 (old_state == arc_mru) ? arc_mru_ghost : arc_mfu_ghost;
3301 mutex_enter(&old_state->arcs_mtx);
3302 mutex_enter(&evicted_state->arcs_mtx);
3304 arc_change_state(evicted_state, hdr, hash_lock);
3305 ASSERT(HDR_IN_HASH_TABLE(hdr));
3306 hdr->b_flags |= ARC_IN_HASH_TABLE;
3307 hdr->b_flags &= ~ARC_BUF_AVAILABLE;
3309 mutex_exit(&evicted_state->arcs_mtx);
3310 mutex_exit(&old_state->arcs_mtx);
3312 mutex_exit(hash_lock);
3313 mutex_exit(&buf->b_evict_lock);
3315 VERIFY(buf->b_efunc(buf) == 0);
3316 buf->b_efunc = NULL;
3317 buf->b_private = NULL;
3320 kmem_cache_free(buf_cache, buf);
3325 * Release this buffer from the cache. This must be done
3326 * after a read and prior to modifying the buffer contents.
3327 * If the buffer has more than one reference, we must make
3328 * a new hdr for the buffer.
3331 arc_release(arc_buf_t *buf, void *tag)
3334 kmutex_t *hash_lock = NULL;
3335 l2arc_buf_hdr_t *l2hdr;
3336 uint64_t buf_size = 0;
3339 * It would be nice to assert that if it's DMU metadata (level >
3340 * 0 || it's the dnode file), then it must be syncing context.
3341 * But we don't know that information at this level.
3344 mutex_enter(&buf->b_evict_lock);
3347 /* this buffer is not on any list */
3348 ASSERT(refcount_count(&hdr->b_refcnt) > 0);
3350 if (hdr->b_state == arc_anon) {
3351 /* this buffer is already released */
3352 ASSERT(buf->b_efunc == NULL);
3354 hash_lock = HDR_LOCK(hdr);
3355 mutex_enter(hash_lock);
3357 ASSERT3P(hash_lock, ==, HDR_LOCK(hdr));
3360 l2hdr = hdr->b_l2hdr;
3362 mutex_enter(&l2arc_buflist_mtx);
3363 hdr->b_l2hdr = NULL;
3364 buf_size = hdr->b_size;
3368 * Do we have more than one buf?
3370 if (hdr->b_datacnt > 1) {
3371 arc_buf_hdr_t *nhdr;
3373 uint64_t blksz = hdr->b_size;
3374 uint64_t spa = hdr->b_spa;
3375 arc_buf_contents_t type = hdr->b_type;
3376 uint32_t flags = hdr->b_flags;
3378 ASSERT(hdr->b_buf != buf || buf->b_next != NULL);
3380 * Pull the data off of this hdr and attach it to
3381 * a new anonymous hdr.
3383 (void) remove_reference(hdr, hash_lock, tag);
3385 while (*bufp != buf)
3386 bufp = &(*bufp)->b_next;
3387 *bufp = buf->b_next;
3390 ASSERT3U(hdr->b_state->arcs_size, >=, hdr->b_size);
3391 atomic_add_64(&hdr->b_state->arcs_size, -hdr->b_size);
3392 if (refcount_is_zero(&hdr->b_refcnt)) {
3393 uint64_t *size = &hdr->b_state->arcs_lsize[hdr->b_type];
3394 ASSERT3U(*size, >=, hdr->b_size);
3395 atomic_add_64(size, -hdr->b_size);
3399 * We're releasing a duplicate user data buffer, update
3400 * our statistics accordingly.
3402 if (hdr->b_type == ARC_BUFC_DATA) {
3403 ARCSTAT_BUMPDOWN(arcstat_duplicate_buffers);
3404 ARCSTAT_INCR(arcstat_duplicate_buffers_size,
3407 hdr->b_datacnt -= 1;
3408 arc_cksum_verify(buf);
3410 mutex_exit(hash_lock);
3412 nhdr = kmem_cache_alloc(hdr_cache, KM_PUSHPAGE);
3413 nhdr->b_size = blksz;
3415 nhdr->b_type = type;
3417 nhdr->b_state = arc_anon;
3418 nhdr->b_arc_access = 0;
3419 nhdr->b_flags = flags & ARC_L2_WRITING;
3420 nhdr->b_l2hdr = NULL;
3421 nhdr->b_datacnt = 1;
3422 nhdr->b_freeze_cksum = NULL;
3423 (void) refcount_add(&nhdr->b_refcnt, tag);
3425 mutex_exit(&buf->b_evict_lock);
3426 atomic_add_64(&arc_anon->arcs_size, blksz);
3428 mutex_exit(&buf->b_evict_lock);
3429 ASSERT(refcount_count(&hdr->b_refcnt) == 1);
3430 ASSERT(!list_link_active(&hdr->b_arc_node));
3431 ASSERT(!HDR_IO_IN_PROGRESS(hdr));
3432 if (hdr->b_state != arc_anon)
3433 arc_change_state(arc_anon, hdr, hash_lock);
3434 hdr->b_arc_access = 0;
3436 mutex_exit(hash_lock);
3438 buf_discard_identity(hdr);
3441 buf->b_efunc = NULL;
3442 buf->b_private = NULL;
3445 list_remove(l2hdr->b_dev->l2ad_buflist, hdr);
3446 kmem_free(l2hdr, sizeof (l2arc_buf_hdr_t));
3447 arc_space_return(L2HDR_SIZE, ARC_SPACE_L2HDRS);
3448 ARCSTAT_INCR(arcstat_l2_size, -buf_size);
3449 mutex_exit(&l2arc_buflist_mtx);
3454 arc_released(arc_buf_t *buf)
3458 mutex_enter(&buf->b_evict_lock);
3459 released = (buf->b_data != NULL && buf->b_hdr->b_state == arc_anon);
3460 mutex_exit(&buf->b_evict_lock);
3465 arc_has_callback(arc_buf_t *buf)
3469 mutex_enter(&buf->b_evict_lock);
3470 callback = (buf->b_efunc != NULL);
3471 mutex_exit(&buf->b_evict_lock);
3477 arc_referenced(arc_buf_t *buf)
3481 mutex_enter(&buf->b_evict_lock);
3482 referenced = (refcount_count(&buf->b_hdr->b_refcnt));
3483 mutex_exit(&buf->b_evict_lock);
3484 return (referenced);
3489 arc_write_ready(zio_t *zio)
3491 arc_write_callback_t *callback = zio->io_private;
3492 arc_buf_t *buf = callback->awcb_buf;
3493 arc_buf_hdr_t *hdr = buf->b_hdr;
3495 ASSERT(!refcount_is_zero(&buf->b_hdr->b_refcnt));
3496 callback->awcb_ready(zio, buf, callback->awcb_private);
3499 * If the IO is already in progress, then this is a re-write
3500 * attempt, so we need to thaw and re-compute the cksum.
3501 * It is the responsibility of the callback to handle the
3502 * accounting for any re-write attempt.
3504 if (HDR_IO_IN_PROGRESS(hdr)) {
3505 mutex_enter(&hdr->b_freeze_lock);
3506 if (hdr->b_freeze_cksum != NULL) {
3507 kmem_free(hdr->b_freeze_cksum, sizeof (zio_cksum_t));
3508 hdr->b_freeze_cksum = NULL;
3510 mutex_exit(&hdr->b_freeze_lock);
3512 arc_cksum_compute(buf, B_FALSE);
3513 hdr->b_flags |= ARC_IO_IN_PROGRESS;
3517 arc_write_done(zio_t *zio)
3519 arc_write_callback_t *callback = zio->io_private;
3520 arc_buf_t *buf = callback->awcb_buf;
3521 arc_buf_hdr_t *hdr = buf->b_hdr;
3523 ASSERT(hdr->b_acb == NULL);
3525 if (zio->io_error == 0) {
3526 hdr->b_dva = *BP_IDENTITY(zio->io_bp);
3527 hdr->b_birth = BP_PHYSICAL_BIRTH(zio->io_bp);
3528 hdr->b_cksum0 = zio->io_bp->blk_cksum.zc_word[0];
3530 ASSERT(BUF_EMPTY(hdr));
3534 * If the block to be written was all-zero, we may have
3535 * compressed it away. In this case no write was performed
3536 * so there will be no dva/birth/checksum. The buffer must
3537 * therefore remain anonymous (and uncached).
3539 if (!BUF_EMPTY(hdr)) {
3540 arc_buf_hdr_t *exists;
3541 kmutex_t *hash_lock;
3543 ASSERT(zio->io_error == 0);
3545 arc_cksum_verify(buf);
3547 exists = buf_hash_insert(hdr, &hash_lock);
3550 * This can only happen if we overwrite for
3551 * sync-to-convergence, because we remove
3552 * buffers from the hash table when we arc_free().
3554 if (zio->io_flags & ZIO_FLAG_IO_REWRITE) {
3555 if (!BP_EQUAL(&zio->io_bp_orig, zio->io_bp))
3556 panic("bad overwrite, hdr=%p exists=%p",
3557 (void *)hdr, (void *)exists);
3558 ASSERT(refcount_is_zero(&exists->b_refcnt));
3559 arc_change_state(arc_anon, exists, hash_lock);
3560 mutex_exit(hash_lock);
3561 arc_hdr_destroy(exists);
3562 exists = buf_hash_insert(hdr, &hash_lock);
3563 ASSERT3P(exists, ==, NULL);
3566 ASSERT(hdr->b_datacnt == 1);
3567 ASSERT(hdr->b_state == arc_anon);
3568 ASSERT(BP_GET_DEDUP(zio->io_bp));
3569 ASSERT(BP_GET_LEVEL(zio->io_bp) == 0);
3572 hdr->b_flags &= ~ARC_IO_IN_PROGRESS;
3573 /* if it's not anon, we are doing a scrub */
3574 if (!exists && hdr->b_state == arc_anon)
3575 arc_access(hdr, hash_lock);
3576 mutex_exit(hash_lock);
3578 hdr->b_flags &= ~ARC_IO_IN_PROGRESS;
3581 ASSERT(!refcount_is_zero(&hdr->b_refcnt));
3582 callback->awcb_done(zio, buf, callback->awcb_private);
3584 kmem_free(callback, sizeof (arc_write_callback_t));
3588 arc_write(zio_t *pio, spa_t *spa, uint64_t txg,
3589 blkptr_t *bp, arc_buf_t *buf, boolean_t l2arc, const zio_prop_t *zp,
3590 arc_done_func_t *ready, arc_done_func_t *done, void *private,
3591 int priority, int zio_flags, const zbookmark_t *zb)
3593 arc_buf_hdr_t *hdr = buf->b_hdr;
3594 arc_write_callback_t *callback;
3597 ASSERT(ready != NULL);
3598 ASSERT(done != NULL);
3599 ASSERT(!HDR_IO_ERROR(hdr));
3600 ASSERT((hdr->b_flags & ARC_IO_IN_PROGRESS) == 0);
3601 ASSERT(hdr->b_acb == NULL);
3603 hdr->b_flags |= ARC_L2CACHE;
3604 callback = kmem_zalloc(sizeof (arc_write_callback_t), KM_PUSHPAGE);
3605 callback->awcb_ready = ready;
3606 callback->awcb_done = done;
3607 callback->awcb_private = private;
3608 callback->awcb_buf = buf;
3610 zio = zio_write(pio, spa, txg, bp, buf->b_data, hdr->b_size, zp,
3611 arc_write_ready, arc_write_done, callback, priority, zio_flags, zb);
3617 arc_memory_throttle(uint64_t reserve, uint64_t inflight_data, uint64_t txg)
3620 uint64_t available_memory;
3622 if (zfs_arc_memory_throttle_disable)
3625 /* Easily reclaimable memory (free + inactive + arc-evictable) */
3626 available_memory = ptob(spl_kmem_availrmem()) + arc_evictable_memory();
3628 if (available_memory <= zfs_write_limit_max) {
3629 ARCSTAT_INCR(arcstat_memory_throttle_count, 1);
3630 DMU_TX_STAT_BUMP(dmu_tx_memory_reclaim);
3634 if (inflight_data > available_memory / 4) {
3635 ARCSTAT_INCR(arcstat_memory_throttle_count, 1);
3636 DMU_TX_STAT_BUMP(dmu_tx_memory_inflight);
3644 arc_tempreserve_clear(uint64_t reserve)
3646 atomic_add_64(&arc_tempreserve, -reserve);
3647 ASSERT((int64_t)arc_tempreserve >= 0);
3651 arc_tempreserve_space(uint64_t reserve, uint64_t txg)
3658 * Once in a while, fail for no reason. Everything should cope.
3660 if (spa_get_random(10000) == 0) {
3661 dprintf("forcing random failure\n");
3665 if (reserve > arc_c/4 && !arc_no_grow)
3666 arc_c = MIN(arc_c_max, reserve * 4);
3667 if (reserve > arc_c) {
3668 DMU_TX_STAT_BUMP(dmu_tx_memory_reserve);
3673 * Don't count loaned bufs as in flight dirty data to prevent long
3674 * network delays from blocking transactions that are ready to be
3675 * assigned to a txg.
3677 anon_size = MAX((int64_t)(arc_anon->arcs_size - arc_loaned_bytes), 0);
3680 * Writes will, almost always, require additional memory allocations
3681 * in order to compress/encrypt/etc the data. We therefor need to
3682 * make sure that there is sufficient available memory for this.
3684 if ((error = arc_memory_throttle(reserve, anon_size, txg)))
3688 * Throttle writes when the amount of dirty data in the cache
3689 * gets too large. We try to keep the cache less than half full
3690 * of dirty blocks so that our sync times don't grow too large.
3691 * Note: if two requests come in concurrently, we might let them
3692 * both succeed, when one of them should fail. Not a huge deal.
3695 if (reserve + arc_tempreserve + anon_size > arc_c / 2 &&
3696 anon_size > arc_c / 4) {
3697 dprintf("failing, arc_tempreserve=%lluK anon_meta=%lluK "
3698 "anon_data=%lluK tempreserve=%lluK arc_c=%lluK\n",
3699 arc_tempreserve>>10,
3700 arc_anon->arcs_lsize[ARC_BUFC_METADATA]>>10,
3701 arc_anon->arcs_lsize[ARC_BUFC_DATA]>>10,
3702 reserve>>10, arc_c>>10);
3703 DMU_TX_STAT_BUMP(dmu_tx_dirty_throttle);
3706 atomic_add_64(&arc_tempreserve, reserve);
3711 arc_kstat_update_state(arc_state_t *state, kstat_named_t *size,
3712 kstat_named_t *evict_data, kstat_named_t *evict_metadata)
3714 size->value.ui64 = state->arcs_size;
3715 evict_data->value.ui64 = state->arcs_lsize[ARC_BUFC_DATA];
3716 evict_metadata->value.ui64 = state->arcs_lsize[ARC_BUFC_METADATA];
3720 arc_kstat_update(kstat_t *ksp, int rw)
3722 arc_stats_t *as = ksp->ks_data;
3724 if (rw == KSTAT_WRITE) {
3727 arc_kstat_update_state(arc_anon,
3728 &as->arcstat_anon_size,
3729 &as->arcstat_anon_evict_data,
3730 &as->arcstat_anon_evict_metadata);
3731 arc_kstat_update_state(arc_mru,
3732 &as->arcstat_mru_size,
3733 &as->arcstat_mru_evict_data,
3734 &as->arcstat_mru_evict_metadata);
3735 arc_kstat_update_state(arc_mru_ghost,
3736 &as->arcstat_mru_ghost_size,
3737 &as->arcstat_mru_ghost_evict_data,
3738 &as->arcstat_mru_ghost_evict_metadata);
3739 arc_kstat_update_state(arc_mfu,
3740 &as->arcstat_mfu_size,
3741 &as->arcstat_mfu_evict_data,
3742 &as->arcstat_mfu_evict_metadata);
3743 arc_kstat_update_state(arc_mfu_ghost,
3744 &as->arcstat_mfu_ghost_size,
3745 &as->arcstat_mfu_ghost_evict_data,
3746 &as->arcstat_mfu_ghost_evict_metadata);
3755 mutex_init(&arc_reclaim_thr_lock, NULL, MUTEX_DEFAULT, NULL);
3756 cv_init(&arc_reclaim_thr_cv, NULL, CV_DEFAULT, NULL);
3758 /* Convert seconds to clock ticks */
3759 arc_min_prefetch_lifespan = 1 * hz;
3761 /* Start out with 1/8 of all memory */
3762 arc_c = physmem * PAGESIZE / 8;
3766 * On architectures where the physical memory can be larger
3767 * than the addressable space (intel in 32-bit mode), we may
3768 * need to limit the cache to 1/8 of VM size.
3770 arc_c = MIN(arc_c, vmem_size(heap_arena, VMEM_ALLOC | VMEM_FREE) / 8);
3772 * Register a shrinker to support synchronous (direct) memory
3773 * reclaim from the arc. This is done to prevent kswapd from
3774 * swapping out pages when it is preferable to shrink the arc.
3776 spl_register_shrinker(&arc_shrinker);
3779 /* set min cache to 1/32 of all memory, or 64MB, whichever is more */
3780 arc_c_min = MAX(arc_c / 4, 64<<20);
3781 /* set max to 1/2 of all memory */
3782 arc_c_max = MAX(arc_c * 4, arc_c_max);
3785 * Allow the tunables to override our calculations if they are
3786 * reasonable (ie. over 64MB)
3788 if (zfs_arc_max > 64<<20 && zfs_arc_max < physmem * PAGESIZE)
3789 arc_c_max = zfs_arc_max;
3790 if (zfs_arc_min > 64<<20 && zfs_arc_min <= arc_c_max)
3791 arc_c_min = zfs_arc_min;
3794 arc_p = (arc_c >> 1);
3796 /* limit meta-data to 1/4 of the arc capacity */
3797 arc_meta_limit = arc_c_max / 4;
3800 /* Allow the tunable to override if it is reasonable */
3801 if (zfs_arc_meta_limit > 0 && zfs_arc_meta_limit <= arc_c_max)
3802 arc_meta_limit = zfs_arc_meta_limit;
3804 if (arc_c_min < arc_meta_limit / 2 && zfs_arc_min == 0)
3805 arc_c_min = arc_meta_limit / 2;
3807 if (zfs_arc_grow_retry > 0)
3808 arc_grow_retry = zfs_arc_grow_retry;
3810 if (zfs_arc_shrink_shift > 0)
3811 arc_shrink_shift = zfs_arc_shrink_shift;
3813 if (zfs_arc_p_min_shift > 0)
3814 arc_p_min_shift = zfs_arc_p_min_shift;
3816 if (zfs_arc_meta_prune > 0)
3817 arc_meta_prune = zfs_arc_meta_prune;
3819 /* if kmem_flags are set, lets try to use less memory */
3820 if (kmem_debugging())
3822 if (arc_c < arc_c_min)
3825 arc_anon = &ARC_anon;
3827 arc_mru_ghost = &ARC_mru_ghost;
3829 arc_mfu_ghost = &ARC_mfu_ghost;
3830 arc_l2c_only = &ARC_l2c_only;
3833 mutex_init(&arc_anon->arcs_mtx, NULL, MUTEX_DEFAULT, NULL);
3834 mutex_init(&arc_mru->arcs_mtx, NULL, MUTEX_DEFAULT, NULL);
3835 mutex_init(&arc_mru_ghost->arcs_mtx, NULL, MUTEX_DEFAULT, NULL);
3836 mutex_init(&arc_mfu->arcs_mtx, NULL, MUTEX_DEFAULT, NULL);
3837 mutex_init(&arc_mfu_ghost->arcs_mtx, NULL, MUTEX_DEFAULT, NULL);
3838 mutex_init(&arc_l2c_only->arcs_mtx, NULL, MUTEX_DEFAULT, NULL);
3840 list_create(&arc_mru->arcs_list[ARC_BUFC_METADATA],
3841 sizeof (arc_buf_hdr_t), offsetof(arc_buf_hdr_t, b_arc_node));
3842 list_create(&arc_mru->arcs_list[ARC_BUFC_DATA],
3843 sizeof (arc_buf_hdr_t), offsetof(arc_buf_hdr_t, b_arc_node));
3844 list_create(&arc_mru_ghost->arcs_list[ARC_BUFC_METADATA],
3845 sizeof (arc_buf_hdr_t), offsetof(arc_buf_hdr_t, b_arc_node));
3846 list_create(&arc_mru_ghost->arcs_list[ARC_BUFC_DATA],
3847 sizeof (arc_buf_hdr_t), offsetof(arc_buf_hdr_t, b_arc_node));
3848 list_create(&arc_mfu->arcs_list[ARC_BUFC_METADATA],
3849 sizeof (arc_buf_hdr_t), offsetof(arc_buf_hdr_t, b_arc_node));
3850 list_create(&arc_mfu->arcs_list[ARC_BUFC_DATA],
3851 sizeof (arc_buf_hdr_t), offsetof(arc_buf_hdr_t, b_arc_node));
3852 list_create(&arc_mfu_ghost->arcs_list[ARC_BUFC_METADATA],
3853 sizeof (arc_buf_hdr_t), offsetof(arc_buf_hdr_t, b_arc_node));
3854 list_create(&arc_mfu_ghost->arcs_list[ARC_BUFC_DATA],
3855 sizeof (arc_buf_hdr_t), offsetof(arc_buf_hdr_t, b_arc_node));
3856 list_create(&arc_l2c_only->arcs_list[ARC_BUFC_METADATA],
3857 sizeof (arc_buf_hdr_t), offsetof(arc_buf_hdr_t, b_arc_node));
3858 list_create(&arc_l2c_only->arcs_list[ARC_BUFC_DATA],
3859 sizeof (arc_buf_hdr_t), offsetof(arc_buf_hdr_t, b_arc_node));
3863 arc_thread_exit = 0;
3864 list_create(&arc_prune_list, sizeof (arc_prune_t),
3865 offsetof(arc_prune_t, p_node));
3866 arc_eviction_list = NULL;
3867 mutex_init(&arc_prune_mtx, NULL, MUTEX_DEFAULT, NULL);
3868 mutex_init(&arc_eviction_mtx, NULL, MUTEX_DEFAULT, NULL);
3869 bzero(&arc_eviction_hdr, sizeof (arc_buf_hdr_t));
3871 arc_ksp = kstat_create("zfs", 0, "arcstats", "misc", KSTAT_TYPE_NAMED,
3872 sizeof (arc_stats) / sizeof (kstat_named_t), KSTAT_FLAG_VIRTUAL);
3874 if (arc_ksp != NULL) {
3875 arc_ksp->ks_data = &arc_stats;
3876 arc_ksp->ks_update = arc_kstat_update;
3877 kstat_install(arc_ksp);
3880 (void) thread_create(NULL, 0, arc_adapt_thread, NULL, 0, &p0,
3881 TS_RUN, minclsyspri);
3886 if (zfs_write_limit_max == 0)
3887 zfs_write_limit_max = ptob(physmem) >> zfs_write_limit_shift;
3889 zfs_write_limit_shift = 0;
3890 mutex_init(&zfs_write_limit_lock, NULL, MUTEX_DEFAULT, NULL);
3898 mutex_enter(&arc_reclaim_thr_lock);
3900 spl_unregister_shrinker(&arc_shrinker);
3901 #endif /* _KERNEL */
3903 arc_thread_exit = 1;
3904 while (arc_thread_exit != 0)
3905 cv_wait(&arc_reclaim_thr_cv, &arc_reclaim_thr_lock);
3906 mutex_exit(&arc_reclaim_thr_lock);
3912 if (arc_ksp != NULL) {
3913 kstat_delete(arc_ksp);
3917 mutex_enter(&arc_prune_mtx);
3918 while ((p = list_head(&arc_prune_list)) != NULL) {
3919 list_remove(&arc_prune_list, p);
3920 refcount_remove(&p->p_refcnt, &arc_prune_list);
3921 refcount_destroy(&p->p_refcnt);
3922 kmem_free(p, sizeof (*p));
3924 mutex_exit(&arc_prune_mtx);
3926 list_destroy(&arc_prune_list);
3927 mutex_destroy(&arc_prune_mtx);
3928 mutex_destroy(&arc_eviction_mtx);
3929 mutex_destroy(&arc_reclaim_thr_lock);
3930 cv_destroy(&arc_reclaim_thr_cv);
3932 list_destroy(&arc_mru->arcs_list[ARC_BUFC_METADATA]);
3933 list_destroy(&arc_mru_ghost->arcs_list[ARC_BUFC_METADATA]);
3934 list_destroy(&arc_mfu->arcs_list[ARC_BUFC_METADATA]);
3935 list_destroy(&arc_mfu_ghost->arcs_list[ARC_BUFC_METADATA]);
3936 list_destroy(&arc_mru->arcs_list[ARC_BUFC_DATA]);
3937 list_destroy(&arc_mru_ghost->arcs_list[ARC_BUFC_DATA]);
3938 list_destroy(&arc_mfu->arcs_list[ARC_BUFC_DATA]);
3939 list_destroy(&arc_mfu_ghost->arcs_list[ARC_BUFC_DATA]);
3941 mutex_destroy(&arc_anon->arcs_mtx);
3942 mutex_destroy(&arc_mru->arcs_mtx);
3943 mutex_destroy(&arc_mru_ghost->arcs_mtx);
3944 mutex_destroy(&arc_mfu->arcs_mtx);
3945 mutex_destroy(&arc_mfu_ghost->arcs_mtx);
3946 mutex_destroy(&arc_l2c_only->arcs_mtx);
3948 mutex_destroy(&zfs_write_limit_lock);
3952 ASSERT(arc_loaned_bytes == 0);
3958 * The level 2 ARC (L2ARC) is a cache layer in-between main memory and disk.
3959 * It uses dedicated storage devices to hold cached data, which are populated
3960 * using large infrequent writes. The main role of this cache is to boost
3961 * the performance of random read workloads. The intended L2ARC devices
3962 * include short-stroked disks, solid state disks, and other media with
3963 * substantially faster read latency than disk.
3965 * +-----------------------+
3967 * +-----------------------+
3970 * l2arc_feed_thread() arc_read()
3974 * +---------------+ |
3976 * +---------------+ |
3981 * +-------+ +-------+
3983 * | cache | | cache |
3984 * +-------+ +-------+
3985 * +=========+ .-----.
3986 * : L2ARC : |-_____-|
3987 * : devices : | Disks |
3988 * +=========+ `-_____-'
3990 * Read requests are satisfied from the following sources, in order:
3993 * 2) vdev cache of L2ARC devices
3995 * 4) vdev cache of disks
3998 * Some L2ARC device types exhibit extremely slow write performance.
3999 * To accommodate for this there are some significant differences between
4000 * the L2ARC and traditional cache design:
4002 * 1. There is no eviction path from the ARC to the L2ARC. Evictions from
4003 * the ARC behave as usual, freeing buffers and placing headers on ghost
4004 * lists. The ARC does not send buffers to the L2ARC during eviction as
4005 * this would add inflated write latencies for all ARC memory pressure.
4007 * 2. The L2ARC attempts to cache data from the ARC before it is evicted.
4008 * It does this by periodically scanning buffers from the eviction-end of
4009 * the MFU and MRU ARC lists, copying them to the L2ARC devices if they are
4010 * not already there. It scans until a headroom of buffers is satisfied,
4011 * which itself is a buffer for ARC eviction. The thread that does this is
4012 * l2arc_feed_thread(), illustrated below; example sizes are included to
4013 * provide a better sense of ratio than this diagram:
4016 * +---------------------+----------+
4017 * ARC_mfu |:::::#:::::::::::::::|o#o###o###|-->. # already on L2ARC
4018 * +---------------------+----------+ | o L2ARC eligible
4019 * ARC_mru |:#:::::::::::::::::::|#o#ooo####|-->| : ARC buffer
4020 * +---------------------+----------+ |
4021 * 15.9 Gbytes ^ 32 Mbytes |
4023 * l2arc_feed_thread()
4025 * l2arc write hand <--[oooo]--'
4029 * +==============================+
4030 * L2ARC dev |####|#|###|###| |####| ... |
4031 * +==============================+
4034 * 3. If an ARC buffer is copied to the L2ARC but then hit instead of
4035 * evicted, then the L2ARC has cached a buffer much sooner than it probably
4036 * needed to, potentially wasting L2ARC device bandwidth and storage. It is
4037 * safe to say that this is an uncommon case, since buffers at the end of
4038 * the ARC lists have moved there due to inactivity.
4040 * 4. If the ARC evicts faster than the L2ARC can maintain a headroom,
4041 * then the L2ARC simply misses copying some buffers. This serves as a
4042 * pressure valve to prevent heavy read workloads from both stalling the ARC
4043 * with waits and clogging the L2ARC with writes. This also helps prevent
4044 * the potential for the L2ARC to churn if it attempts to cache content too
4045 * quickly, such as during backups of the entire pool.
4047 * 5. After system boot and before the ARC has filled main memory, there are
4048 * no evictions from the ARC and so the tails of the ARC_mfu and ARC_mru
4049 * lists can remain mostly static. Instead of searching from tail of these
4050 * lists as pictured, the l2arc_feed_thread() will search from the list heads
4051 * for eligible buffers, greatly increasing its chance of finding them.
4053 * The L2ARC device write speed is also boosted during this time so that
4054 * the L2ARC warms up faster. Since there have been no ARC evictions yet,
4055 * there are no L2ARC reads, and no fear of degrading read performance
4056 * through increased writes.
4058 * 6. Writes to the L2ARC devices are grouped and sent in-sequence, so that
4059 * the vdev queue can aggregate them into larger and fewer writes. Each
4060 * device is written to in a rotor fashion, sweeping writes through
4061 * available space then repeating.
4063 * 7. The L2ARC does not store dirty content. It never needs to flush
4064 * write buffers back to disk based storage.
4066 * 8. If an ARC buffer is written (and dirtied) which also exists in the
4067 * L2ARC, the now stale L2ARC buffer is immediately dropped.
4069 * The performance of the L2ARC can be tweaked by a number of tunables, which
4070 * may be necessary for different workloads:
4072 * l2arc_write_max max write bytes per interval
4073 * l2arc_write_boost extra write bytes during device warmup
4074 * l2arc_noprefetch skip caching prefetched buffers
4075 * l2arc_headroom number of max device writes to precache
4076 * l2arc_feed_secs seconds between L2ARC writing
4078 * Tunables may be removed or added as future performance improvements are
4079 * integrated, and also may become zpool properties.
4081 * There are three key functions that control how the L2ARC warms up:
4083 * l2arc_write_eligible() check if a buffer is eligible to cache
4084 * l2arc_write_size() calculate how much to write
4085 * l2arc_write_interval() calculate sleep delay between writes
4087 * These three functions determine what to write, how much, and how quickly
4092 l2arc_write_eligible(uint64_t spa_guid, arc_buf_hdr_t *ab)
4095 * A buffer is *not* eligible for the L2ARC if it:
4096 * 1. belongs to a different spa.
4097 * 2. is already cached on the L2ARC.
4098 * 3. has an I/O in progress (it may be an incomplete read).
4099 * 4. is flagged not eligible (zfs property).
4101 if (ab->b_spa != spa_guid || ab->b_l2hdr != NULL ||
4102 HDR_IO_IN_PROGRESS(ab) || !HDR_L2CACHE(ab))
4109 l2arc_write_size(l2arc_dev_t *dev)
4113 size = dev->l2ad_write;
4115 if (arc_warm == B_FALSE)
4116 size += dev->l2ad_boost;
4123 l2arc_write_interval(clock_t began, uint64_t wanted, uint64_t wrote)
4125 clock_t interval, next, now;
4128 * If the ARC lists are busy, increase our write rate; if the
4129 * lists are stale, idle back. This is achieved by checking
4130 * how much we previously wrote - if it was more than half of
4131 * what we wanted, schedule the next write much sooner.
4133 if (l2arc_feed_again && wrote > (wanted / 2))
4134 interval = (hz * l2arc_feed_min_ms) / 1000;
4136 interval = hz * l2arc_feed_secs;
4138 now = ddi_get_lbolt();
4139 next = MAX(now, MIN(now + interval, began + interval));
4145 l2arc_hdr_stat_add(void)
4147 ARCSTAT_INCR(arcstat_l2_hdr_size, HDR_SIZE);
4148 ARCSTAT_INCR(arcstat_hdr_size, -HDR_SIZE);
4152 l2arc_hdr_stat_remove(void)
4154 ARCSTAT_INCR(arcstat_l2_hdr_size, -HDR_SIZE);
4155 ARCSTAT_INCR(arcstat_hdr_size, HDR_SIZE);
4159 * Cycle through L2ARC devices. This is how L2ARC load balances.
4160 * If a device is returned, this also returns holding the spa config lock.
4162 static l2arc_dev_t *
4163 l2arc_dev_get_next(void)
4165 l2arc_dev_t *first, *next = NULL;
4168 * Lock out the removal of spas (spa_namespace_lock), then removal
4169 * of cache devices (l2arc_dev_mtx). Once a device has been selected,
4170 * both locks will be dropped and a spa config lock held instead.
4172 mutex_enter(&spa_namespace_lock);
4173 mutex_enter(&l2arc_dev_mtx);
4175 /* if there are no vdevs, there is nothing to do */
4176 if (l2arc_ndev == 0)
4180 next = l2arc_dev_last;
4182 /* loop around the list looking for a non-faulted vdev */
4184 next = list_head(l2arc_dev_list);
4186 next = list_next(l2arc_dev_list, next);
4188 next = list_head(l2arc_dev_list);
4191 /* if we have come back to the start, bail out */
4194 else if (next == first)
4197 } while (vdev_is_dead(next->l2ad_vdev));
4199 /* if we were unable to find any usable vdevs, return NULL */
4200 if (vdev_is_dead(next->l2ad_vdev))
4203 l2arc_dev_last = next;
4206 mutex_exit(&l2arc_dev_mtx);
4209 * Grab the config lock to prevent the 'next' device from being
4210 * removed while we are writing to it.
4213 spa_config_enter(next->l2ad_spa, SCL_L2ARC, next, RW_READER);
4214 mutex_exit(&spa_namespace_lock);
4220 * Free buffers that were tagged for destruction.
4223 l2arc_do_free_on_write(void)
4226 l2arc_data_free_t *df, *df_prev;
4228 mutex_enter(&l2arc_free_on_write_mtx);
4229 buflist = l2arc_free_on_write;
4231 for (df = list_tail(buflist); df; df = df_prev) {
4232 df_prev = list_prev(buflist, df);
4233 ASSERT(df->l2df_data != NULL);
4234 ASSERT(df->l2df_func != NULL);
4235 df->l2df_func(df->l2df_data, df->l2df_size);
4236 list_remove(buflist, df);
4237 kmem_free(df, sizeof (l2arc_data_free_t));
4240 mutex_exit(&l2arc_free_on_write_mtx);
4244 * A write to a cache device has completed. Update all headers to allow
4245 * reads from these buffers to begin.
4248 l2arc_write_done(zio_t *zio)
4250 l2arc_write_callback_t *cb;
4253 arc_buf_hdr_t *head, *ab, *ab_prev;
4254 l2arc_buf_hdr_t *abl2;
4255 kmutex_t *hash_lock;
4257 cb = zio->io_private;
4259 dev = cb->l2wcb_dev;
4260 ASSERT(dev != NULL);
4261 head = cb->l2wcb_head;
4262 ASSERT(head != NULL);
4263 buflist = dev->l2ad_buflist;
4264 ASSERT(buflist != NULL);
4265 DTRACE_PROBE2(l2arc__iodone, zio_t *, zio,
4266 l2arc_write_callback_t *, cb);
4268 if (zio->io_error != 0)
4269 ARCSTAT_BUMP(arcstat_l2_writes_error);
4271 mutex_enter(&l2arc_buflist_mtx);
4274 * All writes completed, or an error was hit.
4276 for (ab = list_prev(buflist, head); ab; ab = ab_prev) {
4277 ab_prev = list_prev(buflist, ab);
4279 hash_lock = HDR_LOCK(ab);
4280 if (!mutex_tryenter(hash_lock)) {
4282 * This buffer misses out. It may be in a stage
4283 * of eviction. Its ARC_L2_WRITING flag will be
4284 * left set, denying reads to this buffer.
4286 ARCSTAT_BUMP(arcstat_l2_writes_hdr_miss);
4290 if (zio->io_error != 0) {
4292 * Error - drop L2ARC entry.
4294 list_remove(buflist, ab);
4297 kmem_free(abl2, sizeof (l2arc_buf_hdr_t));
4298 arc_space_return(L2HDR_SIZE, ARC_SPACE_L2HDRS);
4299 ARCSTAT_INCR(arcstat_l2_size, -ab->b_size);
4303 * Allow ARC to begin reads to this L2ARC entry.
4305 ab->b_flags &= ~ARC_L2_WRITING;
4307 mutex_exit(hash_lock);
4310 atomic_inc_64(&l2arc_writes_done);
4311 list_remove(buflist, head);
4312 kmem_cache_free(hdr_cache, head);
4313 mutex_exit(&l2arc_buflist_mtx);
4315 l2arc_do_free_on_write();
4317 kmem_free(cb, sizeof (l2arc_write_callback_t));
4321 * A read to a cache device completed. Validate buffer contents before
4322 * handing over to the regular ARC routines.
4325 l2arc_read_done(zio_t *zio)
4327 l2arc_read_callback_t *cb;
4330 kmutex_t *hash_lock;
4333 ASSERT(zio->io_vd != NULL);
4334 ASSERT(zio->io_flags & ZIO_FLAG_DONT_PROPAGATE);
4336 spa_config_exit(zio->io_spa, SCL_L2ARC, zio->io_vd);
4338 cb = zio->io_private;
4340 buf = cb->l2rcb_buf;
4341 ASSERT(buf != NULL);
4343 hash_lock = HDR_LOCK(buf->b_hdr);
4344 mutex_enter(hash_lock);
4346 ASSERT3P(hash_lock, ==, HDR_LOCK(hdr));
4349 * Check this survived the L2ARC journey.
4351 equal = arc_cksum_equal(buf);
4352 if (equal && zio->io_error == 0 && !HDR_L2_EVICTED(hdr)) {
4353 mutex_exit(hash_lock);
4354 zio->io_private = buf;
4355 zio->io_bp_copy = cb->l2rcb_bp; /* XXX fix in L2ARC 2.0 */
4356 zio->io_bp = &zio->io_bp_copy; /* XXX fix in L2ARC 2.0 */
4359 mutex_exit(hash_lock);
4361 * Buffer didn't survive caching. Increment stats and
4362 * reissue to the original storage device.
4364 if (zio->io_error != 0) {
4365 ARCSTAT_BUMP(arcstat_l2_io_error);
4367 zio->io_error = EIO;
4370 ARCSTAT_BUMP(arcstat_l2_cksum_bad);
4373 * If there's no waiter, issue an async i/o to the primary
4374 * storage now. If there *is* a waiter, the caller must
4375 * issue the i/o in a context where it's OK to block.
4377 if (zio->io_waiter == NULL) {
4378 zio_t *pio = zio_unique_parent(zio);
4380 ASSERT(!pio || pio->io_child_type == ZIO_CHILD_LOGICAL);
4382 zio_nowait(zio_read(pio, cb->l2rcb_spa, &cb->l2rcb_bp,
4383 buf->b_data, zio->io_size, arc_read_done, buf,
4384 zio->io_priority, cb->l2rcb_flags, &cb->l2rcb_zb));
4388 kmem_free(cb, sizeof (l2arc_read_callback_t));
4392 * This is the list priority from which the L2ARC will search for pages to
4393 * cache. This is used within loops (0..3) to cycle through lists in the
4394 * desired order. This order can have a significant effect on cache
4397 * Currently the metadata lists are hit first, MFU then MRU, followed by
4398 * the data lists. This function returns a locked list, and also returns
4402 l2arc_list_locked(int list_num, kmutex_t **lock)
4404 list_t *list = NULL;
4406 ASSERT(list_num >= 0 && list_num <= 3);
4410 list = &arc_mfu->arcs_list[ARC_BUFC_METADATA];
4411 *lock = &arc_mfu->arcs_mtx;
4414 list = &arc_mru->arcs_list[ARC_BUFC_METADATA];
4415 *lock = &arc_mru->arcs_mtx;
4418 list = &arc_mfu->arcs_list[ARC_BUFC_DATA];
4419 *lock = &arc_mfu->arcs_mtx;
4422 list = &arc_mru->arcs_list[ARC_BUFC_DATA];
4423 *lock = &arc_mru->arcs_mtx;
4427 ASSERT(!(MUTEX_HELD(*lock)));
4433 * Evict buffers from the device write hand to the distance specified in
4434 * bytes. This distance may span populated buffers, it may span nothing.
4435 * This is clearing a region on the L2ARC device ready for writing.
4436 * If the 'all' boolean is set, every buffer is evicted.
4439 l2arc_evict(l2arc_dev_t *dev, uint64_t distance, boolean_t all)
4442 l2arc_buf_hdr_t *abl2;
4443 arc_buf_hdr_t *ab, *ab_prev;
4444 kmutex_t *hash_lock;
4447 buflist = dev->l2ad_buflist;
4449 if (buflist == NULL)
4452 if (!all && dev->l2ad_first) {
4454 * This is the first sweep through the device. There is
4460 if (dev->l2ad_hand >= (dev->l2ad_end - (2 * distance))) {
4462 * When nearing the end of the device, evict to the end
4463 * before the device write hand jumps to the start.
4465 taddr = dev->l2ad_end;
4467 taddr = dev->l2ad_hand + distance;
4469 DTRACE_PROBE4(l2arc__evict, l2arc_dev_t *, dev, list_t *, buflist,
4470 uint64_t, taddr, boolean_t, all);
4473 mutex_enter(&l2arc_buflist_mtx);
4474 for (ab = list_tail(buflist); ab; ab = ab_prev) {
4475 ab_prev = list_prev(buflist, ab);
4477 hash_lock = HDR_LOCK(ab);
4478 if (!mutex_tryenter(hash_lock)) {
4480 * Missed the hash lock. Retry.
4482 ARCSTAT_BUMP(arcstat_l2_evict_lock_retry);
4483 mutex_exit(&l2arc_buflist_mtx);
4484 mutex_enter(hash_lock);
4485 mutex_exit(hash_lock);
4489 if (HDR_L2_WRITE_HEAD(ab)) {
4491 * We hit a write head node. Leave it for
4492 * l2arc_write_done().
4494 list_remove(buflist, ab);
4495 mutex_exit(hash_lock);
4499 if (!all && ab->b_l2hdr != NULL &&
4500 (ab->b_l2hdr->b_daddr > taddr ||
4501 ab->b_l2hdr->b_daddr < dev->l2ad_hand)) {
4503 * We've evicted to the target address,
4504 * or the end of the device.
4506 mutex_exit(hash_lock);
4510 if (HDR_FREE_IN_PROGRESS(ab)) {
4512 * Already on the path to destruction.
4514 mutex_exit(hash_lock);
4518 if (ab->b_state == arc_l2c_only) {
4519 ASSERT(!HDR_L2_READING(ab));
4521 * This doesn't exist in the ARC. Destroy.
4522 * arc_hdr_destroy() will call list_remove()
4523 * and decrement arcstat_l2_size.
4525 arc_change_state(arc_anon, ab, hash_lock);
4526 arc_hdr_destroy(ab);
4529 * Invalidate issued or about to be issued
4530 * reads, since we may be about to write
4531 * over this location.
4533 if (HDR_L2_READING(ab)) {
4534 ARCSTAT_BUMP(arcstat_l2_evict_reading);
4535 ab->b_flags |= ARC_L2_EVICTED;
4539 * Tell ARC this no longer exists in L2ARC.
4541 if (ab->b_l2hdr != NULL) {
4544 kmem_free(abl2, sizeof (l2arc_buf_hdr_t));
4545 arc_space_return(L2HDR_SIZE, ARC_SPACE_L2HDRS);
4546 ARCSTAT_INCR(arcstat_l2_size, -ab->b_size);
4548 list_remove(buflist, ab);
4551 * This may have been leftover after a
4554 ab->b_flags &= ~ARC_L2_WRITING;
4556 mutex_exit(hash_lock);
4558 mutex_exit(&l2arc_buflist_mtx);
4560 vdev_space_update(dev->l2ad_vdev, -(taddr - dev->l2ad_evict), 0, 0);
4561 dev->l2ad_evict = taddr;
4565 * Find and write ARC buffers to the L2ARC device.
4567 * An ARC_L2_WRITING flag is set so that the L2ARC buffers are not valid
4568 * for reading until they have completed writing.
4571 l2arc_write_buffers(spa_t *spa, l2arc_dev_t *dev, uint64_t target_sz)
4573 arc_buf_hdr_t *ab, *ab_prev, *head;
4574 l2arc_buf_hdr_t *hdrl2;
4576 uint64_t passed_sz, write_sz, buf_sz, headroom;
4578 kmutex_t *hash_lock, *list_lock = NULL;
4579 boolean_t have_lock, full;
4580 l2arc_write_callback_t *cb;
4582 uint64_t guid = spa_load_guid(spa);
4585 ASSERT(dev->l2ad_vdev != NULL);
4590 head = kmem_cache_alloc(hdr_cache, KM_PUSHPAGE);
4591 head->b_flags |= ARC_L2_WRITE_HEAD;
4594 * Copy buffers for L2ARC writing.
4596 mutex_enter(&l2arc_buflist_mtx);
4597 for (try = 0; try <= 3; try++) {
4598 list = l2arc_list_locked(try, &list_lock);
4602 * L2ARC fast warmup.
4604 * Until the ARC is warm and starts to evict, read from the
4605 * head of the ARC lists rather than the tail.
4607 headroom = target_sz * l2arc_headroom;
4608 if (arc_warm == B_FALSE)
4609 ab = list_head(list);
4611 ab = list_tail(list);
4613 for (; ab; ab = ab_prev) {
4614 if (arc_warm == B_FALSE)
4615 ab_prev = list_next(list, ab);
4617 ab_prev = list_prev(list, ab);
4619 hash_lock = HDR_LOCK(ab);
4620 have_lock = MUTEX_HELD(hash_lock);
4621 if (!have_lock && !mutex_tryenter(hash_lock)) {
4623 * Skip this buffer rather than waiting.
4628 passed_sz += ab->b_size;
4629 if (passed_sz > headroom) {
4633 mutex_exit(hash_lock);
4637 if (!l2arc_write_eligible(guid, ab)) {
4638 mutex_exit(hash_lock);
4642 if ((write_sz + ab->b_size) > target_sz) {
4644 mutex_exit(hash_lock);
4650 * Insert a dummy header on the buflist so
4651 * l2arc_write_done() can find where the
4652 * write buffers begin without searching.
4654 list_insert_head(dev->l2ad_buflist, head);
4656 cb = kmem_alloc(sizeof (l2arc_write_callback_t),
4658 cb->l2wcb_dev = dev;
4659 cb->l2wcb_head = head;
4660 pio = zio_root(spa, l2arc_write_done, cb,
4665 * Create and add a new L2ARC header.
4667 hdrl2 = kmem_zalloc(sizeof (l2arc_buf_hdr_t),
4670 hdrl2->b_daddr = dev->l2ad_hand;
4671 arc_space_consume(L2HDR_SIZE, ARC_SPACE_L2HDRS);
4673 ab->b_flags |= ARC_L2_WRITING;
4674 ab->b_l2hdr = hdrl2;
4675 list_insert_head(dev->l2ad_buflist, ab);
4676 buf_data = ab->b_buf->b_data;
4677 buf_sz = ab->b_size;
4680 * Compute and store the buffer cksum before
4681 * writing. On debug the cksum is verified first.
4683 arc_cksum_verify(ab->b_buf);
4684 arc_cksum_compute(ab->b_buf, B_TRUE);
4686 mutex_exit(hash_lock);
4688 wzio = zio_write_phys(pio, dev->l2ad_vdev,
4689 dev->l2ad_hand, buf_sz, buf_data, ZIO_CHECKSUM_OFF,
4690 NULL, NULL, ZIO_PRIORITY_ASYNC_WRITE,
4691 ZIO_FLAG_CANFAIL, B_FALSE);
4693 DTRACE_PROBE2(l2arc__write, vdev_t *, dev->l2ad_vdev,
4695 (void) zio_nowait(wzio);
4698 * Keep the clock hand suitably device-aligned.
4700 buf_sz = vdev_psize_to_asize(dev->l2ad_vdev, buf_sz);
4703 dev->l2ad_hand += buf_sz;
4706 mutex_exit(list_lock);
4711 mutex_exit(&l2arc_buflist_mtx);
4715 kmem_cache_free(hdr_cache, head);
4719 ASSERT3U(write_sz, <=, target_sz);
4720 ARCSTAT_BUMP(arcstat_l2_writes_sent);
4721 ARCSTAT_INCR(arcstat_l2_write_bytes, write_sz);
4722 ARCSTAT_INCR(arcstat_l2_size, write_sz);
4723 vdev_space_update(dev->l2ad_vdev, write_sz, 0, 0);
4726 * Bump device hand to the device start if it is approaching the end.
4727 * l2arc_evict() will already have evicted ahead for this case.
4729 if (dev->l2ad_hand >= (dev->l2ad_end - target_sz)) {
4730 vdev_space_update(dev->l2ad_vdev,
4731 dev->l2ad_end - dev->l2ad_hand, 0, 0);
4732 dev->l2ad_hand = dev->l2ad_start;
4733 dev->l2ad_evict = dev->l2ad_start;
4734 dev->l2ad_first = B_FALSE;
4737 dev->l2ad_writing = B_TRUE;
4738 (void) zio_wait(pio);
4739 dev->l2ad_writing = B_FALSE;
4745 * This thread feeds the L2ARC at regular intervals. This is the beating
4746 * heart of the L2ARC.
4749 l2arc_feed_thread(void)
4754 uint64_t size, wrote;
4755 clock_t begin, next = ddi_get_lbolt();
4757 CALLB_CPR_INIT(&cpr, &l2arc_feed_thr_lock, callb_generic_cpr, FTAG);
4759 mutex_enter(&l2arc_feed_thr_lock);
4761 while (l2arc_thread_exit == 0) {
4762 CALLB_CPR_SAFE_BEGIN(&cpr);
4763 (void) cv_timedwait_interruptible(&l2arc_feed_thr_cv,
4764 &l2arc_feed_thr_lock, next);
4765 CALLB_CPR_SAFE_END(&cpr, &l2arc_feed_thr_lock);
4766 next = ddi_get_lbolt() + hz;
4769 * Quick check for L2ARC devices.
4771 mutex_enter(&l2arc_dev_mtx);
4772 if (l2arc_ndev == 0) {
4773 mutex_exit(&l2arc_dev_mtx);
4776 mutex_exit(&l2arc_dev_mtx);
4777 begin = ddi_get_lbolt();
4780 * This selects the next l2arc device to write to, and in
4781 * doing so the next spa to feed from: dev->l2ad_spa. This
4782 * will return NULL if there are now no l2arc devices or if
4783 * they are all faulted.
4785 * If a device is returned, its spa's config lock is also
4786 * held to prevent device removal. l2arc_dev_get_next()
4787 * will grab and release l2arc_dev_mtx.
4789 if ((dev = l2arc_dev_get_next()) == NULL)
4792 spa = dev->l2ad_spa;
4793 ASSERT(spa != NULL);
4796 * If the pool is read-only then force the feed thread to
4797 * sleep a little longer.
4799 if (!spa_writeable(spa)) {
4800 next = ddi_get_lbolt() + 5 * l2arc_feed_secs * hz;
4801 spa_config_exit(spa, SCL_L2ARC, dev);
4806 * Avoid contributing to memory pressure.
4809 ARCSTAT_BUMP(arcstat_l2_abort_lowmem);
4810 spa_config_exit(spa, SCL_L2ARC, dev);
4814 ARCSTAT_BUMP(arcstat_l2_feeds);
4816 size = l2arc_write_size(dev);
4819 * Evict L2ARC buffers that will be overwritten.
4821 l2arc_evict(dev, size, B_FALSE);
4824 * Write ARC buffers.
4826 wrote = l2arc_write_buffers(spa, dev, size);
4829 * Calculate interval between writes.
4831 next = l2arc_write_interval(begin, size, wrote);
4832 spa_config_exit(spa, SCL_L2ARC, dev);
4835 l2arc_thread_exit = 0;
4836 cv_broadcast(&l2arc_feed_thr_cv);
4837 CALLB_CPR_EXIT(&cpr); /* drops l2arc_feed_thr_lock */
4842 l2arc_vdev_present(vdev_t *vd)
4846 mutex_enter(&l2arc_dev_mtx);
4847 for (dev = list_head(l2arc_dev_list); dev != NULL;
4848 dev = list_next(l2arc_dev_list, dev)) {
4849 if (dev->l2ad_vdev == vd)
4852 mutex_exit(&l2arc_dev_mtx);
4854 return (dev != NULL);
4858 * Add a vdev for use by the L2ARC. By this point the spa has already
4859 * validated the vdev and opened it.
4862 l2arc_add_vdev(spa_t *spa, vdev_t *vd)
4864 l2arc_dev_t *adddev;
4866 ASSERT(!l2arc_vdev_present(vd));
4869 * Create a new l2arc device entry.
4871 adddev = kmem_zalloc(sizeof (l2arc_dev_t), KM_SLEEP);
4872 adddev->l2ad_spa = spa;
4873 adddev->l2ad_vdev = vd;
4874 adddev->l2ad_write = l2arc_write_max;
4875 adddev->l2ad_boost = l2arc_write_boost;
4876 adddev->l2ad_start = VDEV_LABEL_START_SIZE;
4877 adddev->l2ad_end = VDEV_LABEL_START_SIZE + vdev_get_min_asize(vd);
4878 adddev->l2ad_hand = adddev->l2ad_start;
4879 adddev->l2ad_evict = adddev->l2ad_start;
4880 adddev->l2ad_first = B_TRUE;
4881 adddev->l2ad_writing = B_FALSE;
4882 list_link_init(&adddev->l2ad_node);
4883 ASSERT3U(adddev->l2ad_write, >, 0);
4886 * This is a list of all ARC buffers that are still valid on the
4889 adddev->l2ad_buflist = kmem_zalloc(sizeof (list_t), KM_SLEEP);
4890 list_create(adddev->l2ad_buflist, sizeof (arc_buf_hdr_t),
4891 offsetof(arc_buf_hdr_t, b_l2node));
4893 vdev_space_update(vd, 0, 0, adddev->l2ad_end - adddev->l2ad_hand);
4896 * Add device to global list
4898 mutex_enter(&l2arc_dev_mtx);
4899 list_insert_head(l2arc_dev_list, adddev);
4900 atomic_inc_64(&l2arc_ndev);
4901 mutex_exit(&l2arc_dev_mtx);
4905 * Remove a vdev from the L2ARC.
4908 l2arc_remove_vdev(vdev_t *vd)
4910 l2arc_dev_t *dev, *nextdev, *remdev = NULL;
4913 * Find the device by vdev
4915 mutex_enter(&l2arc_dev_mtx);
4916 for (dev = list_head(l2arc_dev_list); dev; dev = nextdev) {
4917 nextdev = list_next(l2arc_dev_list, dev);
4918 if (vd == dev->l2ad_vdev) {
4923 ASSERT(remdev != NULL);
4926 * Remove device from global list
4928 list_remove(l2arc_dev_list, remdev);
4929 l2arc_dev_last = NULL; /* may have been invalidated */
4930 atomic_dec_64(&l2arc_ndev);
4931 mutex_exit(&l2arc_dev_mtx);
4934 * Clear all buflists and ARC references. L2ARC device flush.
4936 l2arc_evict(remdev, 0, B_TRUE);
4937 list_destroy(remdev->l2ad_buflist);
4938 kmem_free(remdev->l2ad_buflist, sizeof (list_t));
4939 kmem_free(remdev, sizeof (l2arc_dev_t));
4945 l2arc_thread_exit = 0;
4947 l2arc_writes_sent = 0;
4948 l2arc_writes_done = 0;
4950 mutex_init(&l2arc_feed_thr_lock, NULL, MUTEX_DEFAULT, NULL);
4951 cv_init(&l2arc_feed_thr_cv, NULL, CV_DEFAULT, NULL);
4952 mutex_init(&l2arc_dev_mtx, NULL, MUTEX_DEFAULT, NULL);
4953 mutex_init(&l2arc_buflist_mtx, NULL, MUTEX_DEFAULT, NULL);
4954 mutex_init(&l2arc_free_on_write_mtx, NULL, MUTEX_DEFAULT, NULL);
4956 l2arc_dev_list = &L2ARC_dev_list;
4957 l2arc_free_on_write = &L2ARC_free_on_write;
4958 list_create(l2arc_dev_list, sizeof (l2arc_dev_t),
4959 offsetof(l2arc_dev_t, l2ad_node));
4960 list_create(l2arc_free_on_write, sizeof (l2arc_data_free_t),
4961 offsetof(l2arc_data_free_t, l2df_list_node));
4968 * This is called from dmu_fini(), which is called from spa_fini();
4969 * Because of this, we can assume that all l2arc devices have
4970 * already been removed when the pools themselves were removed.
4973 l2arc_do_free_on_write();
4975 mutex_destroy(&l2arc_feed_thr_lock);
4976 cv_destroy(&l2arc_feed_thr_cv);
4977 mutex_destroy(&l2arc_dev_mtx);
4978 mutex_destroy(&l2arc_buflist_mtx);
4979 mutex_destroy(&l2arc_free_on_write_mtx);
4981 list_destroy(l2arc_dev_list);
4982 list_destroy(l2arc_free_on_write);
4988 if (!(spa_mode_global & FWRITE))
4991 (void) thread_create(NULL, 0, l2arc_feed_thread, NULL, 0, &p0,
4992 TS_RUN, minclsyspri);
4998 if (!(spa_mode_global & FWRITE))
5001 mutex_enter(&l2arc_feed_thr_lock);
5002 cv_signal(&l2arc_feed_thr_cv); /* kick thread out of startup */
5003 l2arc_thread_exit = 1;
5004 while (l2arc_thread_exit != 0)
5005 cv_wait(&l2arc_feed_thr_cv, &l2arc_feed_thr_lock);
5006 mutex_exit(&l2arc_feed_thr_lock);
5009 #if defined(_KERNEL) && defined(HAVE_SPL)
5010 EXPORT_SYMBOL(arc_read);
5011 EXPORT_SYMBOL(arc_buf_remove_ref);
5012 EXPORT_SYMBOL(arc_getbuf_func);
5013 EXPORT_SYMBOL(arc_add_prune_callback);
5014 EXPORT_SYMBOL(arc_remove_prune_callback);
5016 module_param(zfs_arc_min, ulong, 0444);
5017 MODULE_PARM_DESC(zfs_arc_min, "Min arc size");
5019 module_param(zfs_arc_max, ulong, 0444);
5020 MODULE_PARM_DESC(zfs_arc_max, "Max arc size");
5022 module_param(zfs_arc_meta_limit, ulong, 0444);
5023 MODULE_PARM_DESC(zfs_arc_meta_limit, "Meta limit for arc size");
5025 module_param(zfs_arc_meta_prune, int, 0444);
5026 MODULE_PARM_DESC(zfs_arc_meta_prune, "Bytes of meta data to prune");
5028 module_param(zfs_arc_grow_retry, int, 0444);
5029 MODULE_PARM_DESC(zfs_arc_grow_retry, "Seconds before growing arc size");
5031 module_param(zfs_arc_shrink_shift, int, 0444);
5032 MODULE_PARM_DESC(zfs_arc_shrink_shift, "log2(fraction of arc to reclaim)");
5034 module_param(zfs_arc_p_min_shift, int, 0444);
5035 MODULE_PARM_DESC(zfs_arc_p_min_shift, "arc_c shift to calc min/max arc_p");
5037 module_param(zfs_disable_dup_eviction, int, 0644);
5038 MODULE_PARM_DESC(zfs_disable_dup_eviction, "disable duplicate buffer eviction");
5040 module_param(zfs_arc_memory_throttle_disable, int, 0644);
5041 MODULE_PARM_DESC(zfs_arc_memory_throttle_disable, "disable memory throttle");
5043 module_param(l2arc_write_max, ulong, 0444);
5044 MODULE_PARM_DESC(l2arc_write_max, "Max write bytes per interval");
5046 module_param(l2arc_write_boost, ulong, 0444);
5047 MODULE_PARM_DESC(l2arc_write_boost, "Extra write bytes during device warmup");
5049 module_param(l2arc_headroom, ulong, 0444);
5050 MODULE_PARM_DESC(l2arc_headroom, "Number of max device writes to precache");
5052 module_param(l2arc_feed_secs, ulong, 0444);
5053 MODULE_PARM_DESC(l2arc_feed_secs, "Seconds between L2ARC writing");
5055 module_param(l2arc_feed_min_ms, ulong, 0444);
5056 MODULE_PARM_DESC(l2arc_feed_min_ms, "Min feed interval in milliseconds");
5058 module_param(l2arc_noprefetch, int, 0444);
5059 MODULE_PARM_DESC(l2arc_noprefetch, "Skip caching prefetched buffers");
5061 module_param(l2arc_feed_again, int, 0444);
5062 MODULE_PARM_DESC(l2arc_feed_again, "Turbo L2ARC warmup");
5064 module_param(l2arc_norw, int, 0444);
5065 MODULE_PARM_DESC(l2arc_norw, "No reads during writes");