2 * SPDX-License-Identifier: BSD-2-Clause-FreeBSD
4 * Copyright (c) 2004 Poul-Henning Kamp
5 * Copyright (c) 1994,1997 John S. Dyson
6 * Copyright (c) 2013 The FreeBSD Foundation
9 * Portions of this software were developed by Konstantin Belousov
10 * under sponsorship from the FreeBSD Foundation.
12 * Redistribution and use in source and binary forms, with or without
13 * modification, are permitted provided that the following conditions
15 * 1. Redistributions of source code must retain the above copyright
16 * notice, this list of conditions and the following disclaimer.
17 * 2. Redistributions in binary form must reproduce the above copyright
18 * notice, this list of conditions and the following disclaimer in the
19 * documentation and/or other materials provided with the distribution.
21 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
35 * this file contains a new buffer I/O scheme implementing a coherent
36 * VM object and buffer cache scheme. Pains have been taken to make
37 * sure that the performance degradation associated with schemes such
38 * as this is not realized.
40 * Author: John S. Dyson
41 * Significant help during the development and debugging phases
42 * had been provided by David Greenman, also of the FreeBSD core team.
44 * see man buf(9) for more info.
47 #include <sys/cdefs.h>
48 __FBSDID("$FreeBSD$");
50 #include <sys/param.h>
51 #include <sys/systm.h>
53 #include <sys/bitset.h>
55 #include <sys/counter.h>
57 #include <sys/devicestat.h>
58 #include <sys/eventhandler.h>
61 #include <sys/limits.h>
63 #include <sys/malloc.h>
64 #include <sys/mount.h>
65 #include <sys/mutex.h>
66 #include <sys/kernel.h>
67 #include <sys/kthread.h>
69 #include <sys/racct.h>
70 #include <sys/refcount.h>
71 #include <sys/resourcevar.h>
72 #include <sys/rwlock.h>
74 #include <sys/sysctl.h>
75 #include <sys/syscallsubr.h>
77 #include <sys/vmmeter.h>
78 #include <sys/vnode.h>
79 #include <sys/watchdog.h>
80 #include <geom/geom.h>
82 #include <vm/vm_param.h>
83 #include <vm/vm_kern.h>
84 #include <vm/vm_object.h>
85 #include <vm/vm_page.h>
86 #include <vm/vm_pageout.h>
87 #include <vm/vm_pager.h>
88 #include <vm/vm_extern.h>
89 #include <vm/vm_map.h>
90 #include <vm/swap_pager.h>
92 static MALLOC_DEFINE(M_BIOBUF, "biobuf", "BIO buffer");
94 struct bio_ops bioops; /* I/O operation notification */
96 struct buf_ops buf_ops_bio = {
97 .bop_name = "buf_ops_bio",
98 .bop_write = bufwrite,
99 .bop_strategy = bufstrategy,
101 .bop_bdflush = bufbdflush,
105 struct mtx_padalign bq_lock;
106 TAILQ_HEAD(, buf) bq_queue;
108 uint16_t bq_subqueue;
110 } __aligned(CACHE_LINE_SIZE);
112 #define BQ_LOCKPTR(bq) (&(bq)->bq_lock)
113 #define BQ_LOCK(bq) mtx_lock(BQ_LOCKPTR((bq)))
114 #define BQ_UNLOCK(bq) mtx_unlock(BQ_LOCKPTR((bq)))
115 #define BQ_ASSERT_LOCKED(bq) mtx_assert(BQ_LOCKPTR((bq)), MA_OWNED)
118 struct bufqueue bd_subq[MAXCPU + 1]; /* Per-cpu sub queues + global */
119 struct bufqueue bd_dirtyq;
120 struct bufqueue *bd_cleanq;
121 struct mtx_padalign bd_run_lock;
126 long bd_bufspacethresh;
127 int bd_hifreebuffers;
128 int bd_lofreebuffers;
129 int bd_hidirtybuffers;
130 int bd_lodirtybuffers;
131 int bd_dirtybufthresh;
135 int __aligned(CACHE_LINE_SIZE) bd_numdirtybuffers;
136 int __aligned(CACHE_LINE_SIZE) bd_running;
137 long __aligned(CACHE_LINE_SIZE) bd_bufspace;
138 int __aligned(CACHE_LINE_SIZE) bd_freebuffers;
139 } __aligned(CACHE_LINE_SIZE);
141 #define BD_LOCKPTR(bd) (&(bd)->bd_cleanq->bq_lock)
142 #define BD_LOCK(bd) mtx_lock(BD_LOCKPTR((bd)))
143 #define BD_UNLOCK(bd) mtx_unlock(BD_LOCKPTR((bd)))
144 #define BD_ASSERT_LOCKED(bd) mtx_assert(BD_LOCKPTR((bd)), MA_OWNED)
145 #define BD_RUN_LOCKPTR(bd) (&(bd)->bd_run_lock)
146 #define BD_RUN_LOCK(bd) mtx_lock(BD_RUN_LOCKPTR((bd)))
147 #define BD_RUN_UNLOCK(bd) mtx_unlock(BD_RUN_LOCKPTR((bd)))
148 #define BD_DOMAIN(bd) (bd - bdomain)
150 static struct buf *buf; /* buffer header pool */
151 extern struct buf *swbuf; /* Swap buffer header pool. */
152 caddr_t __read_mostly unmapped_buf;
154 /* Used below and for softdep flushing threads in ufs/ffs/ffs_softdep.c */
155 struct proc *bufdaemonproc;
157 static int inmem(struct vnode *vp, daddr_t blkno);
158 static void vm_hold_free_pages(struct buf *bp, int newbsize);
159 static void vm_hold_load_pages(struct buf *bp, vm_offset_t from,
161 static void vfs_page_set_valid(struct buf *bp, vm_ooffset_t off, vm_page_t m);
162 static void vfs_page_set_validclean(struct buf *bp, vm_ooffset_t off,
164 static void vfs_clean_pages_dirty_buf(struct buf *bp);
165 static void vfs_setdirty_range(struct buf *bp);
166 static void vfs_vmio_invalidate(struct buf *bp);
167 static void vfs_vmio_truncate(struct buf *bp, int npages);
168 static void vfs_vmio_extend(struct buf *bp, int npages, int size);
169 static int vfs_bio_clcheck(struct vnode *vp, int size,
170 daddr_t lblkno, daddr_t blkno);
171 static void breada(struct vnode *, daddr_t *, int *, int, struct ucred *, int,
172 void (*)(struct buf *));
173 static int buf_flush(struct vnode *vp, struct bufdomain *, int);
174 static int flushbufqueues(struct vnode *, struct bufdomain *, int, int);
175 static void buf_daemon(void);
176 static __inline void bd_wakeup(void);
177 static int sysctl_runningspace(SYSCTL_HANDLER_ARGS);
178 static void bufkva_reclaim(vmem_t *, int);
179 static void bufkva_free(struct buf *);
180 static int buf_import(void *, void **, int, int, int);
181 static void buf_release(void *, void **, int);
182 static void maxbcachebuf_adjust(void);
183 static inline struct bufdomain *bufdomain(struct buf *);
184 static void bq_remove(struct bufqueue *bq, struct buf *bp);
185 static void bq_insert(struct bufqueue *bq, struct buf *bp, bool unlock);
186 static int buf_recycle(struct bufdomain *, bool kva);
187 static void bq_init(struct bufqueue *bq, int qindex, int cpu,
188 const char *lockname);
189 static void bd_init(struct bufdomain *bd);
190 static int bd_flushall(struct bufdomain *bd);
191 static int sysctl_bufdomain_long(SYSCTL_HANDLER_ARGS);
192 static int sysctl_bufdomain_int(SYSCTL_HANDLER_ARGS);
194 static int sysctl_bufspace(SYSCTL_HANDLER_ARGS);
195 int vmiodirenable = TRUE;
196 SYSCTL_INT(_vfs, OID_AUTO, vmiodirenable, CTLFLAG_RW, &vmiodirenable, 0,
197 "Use the VM system for directory writes");
198 long runningbufspace;
199 SYSCTL_LONG(_vfs, OID_AUTO, runningbufspace, CTLFLAG_RD, &runningbufspace, 0,
200 "Amount of presently outstanding async buffer io");
201 SYSCTL_PROC(_vfs, OID_AUTO, bufspace, CTLTYPE_LONG|CTLFLAG_MPSAFE|CTLFLAG_RD,
202 NULL, 0, sysctl_bufspace, "L", "Physical memory used for buffers");
203 static counter_u64_t bufkvaspace;
204 SYSCTL_COUNTER_U64(_vfs, OID_AUTO, bufkvaspace, CTLFLAG_RD, &bufkvaspace,
205 "Kernel virtual memory used for buffers");
206 static long maxbufspace;
207 SYSCTL_PROC(_vfs, OID_AUTO, maxbufspace,
208 CTLTYPE_LONG|CTLFLAG_MPSAFE|CTLFLAG_RW, &maxbufspace,
209 __offsetof(struct bufdomain, bd_maxbufspace), sysctl_bufdomain_long, "L",
210 "Maximum allowed value of bufspace (including metadata)");
211 static long bufmallocspace;
212 SYSCTL_LONG(_vfs, OID_AUTO, bufmallocspace, CTLFLAG_RD, &bufmallocspace, 0,
213 "Amount of malloced memory for buffers");
214 static long maxbufmallocspace;
215 SYSCTL_LONG(_vfs, OID_AUTO, maxmallocbufspace, CTLFLAG_RW, &maxbufmallocspace,
216 0, "Maximum amount of malloced memory for buffers");
217 static long lobufspace;
218 SYSCTL_PROC(_vfs, OID_AUTO, lobufspace,
219 CTLTYPE_LONG|CTLFLAG_MPSAFE|CTLFLAG_RW, &lobufspace,
220 __offsetof(struct bufdomain, bd_lobufspace), sysctl_bufdomain_long, "L",
221 "Minimum amount of buffers we want to have");
223 SYSCTL_PROC(_vfs, OID_AUTO, hibufspace,
224 CTLTYPE_LONG|CTLFLAG_MPSAFE|CTLFLAG_RW, &hibufspace,
225 __offsetof(struct bufdomain, bd_hibufspace), sysctl_bufdomain_long, "L",
226 "Maximum allowed value of bufspace (excluding metadata)");
228 SYSCTL_PROC(_vfs, OID_AUTO, bufspacethresh,
229 CTLTYPE_LONG|CTLFLAG_MPSAFE|CTLFLAG_RW, &bufspacethresh,
230 __offsetof(struct bufdomain, bd_bufspacethresh), sysctl_bufdomain_long, "L",
231 "Bufspace consumed before waking the daemon to free some");
232 static counter_u64_t buffreekvacnt;
233 SYSCTL_COUNTER_U64(_vfs, OID_AUTO, buffreekvacnt, CTLFLAG_RW, &buffreekvacnt,
234 "Number of times we have freed the KVA space from some buffer");
235 static counter_u64_t bufdefragcnt;
236 SYSCTL_COUNTER_U64(_vfs, OID_AUTO, bufdefragcnt, CTLFLAG_RW, &bufdefragcnt,
237 "Number of times we have had to repeat buffer allocation to defragment");
238 static long lorunningspace;
239 SYSCTL_PROC(_vfs, OID_AUTO, lorunningspace, CTLTYPE_LONG | CTLFLAG_MPSAFE |
240 CTLFLAG_RW, &lorunningspace, 0, sysctl_runningspace, "L",
241 "Minimum preferred space used for in-progress I/O");
242 static long hirunningspace;
243 SYSCTL_PROC(_vfs, OID_AUTO, hirunningspace, CTLTYPE_LONG | CTLFLAG_MPSAFE |
244 CTLFLAG_RW, &hirunningspace, 0, sysctl_runningspace, "L",
245 "Maximum amount of space to use for in-progress I/O");
246 int dirtybufferflushes;
247 SYSCTL_INT(_vfs, OID_AUTO, dirtybufferflushes, CTLFLAG_RW, &dirtybufferflushes,
248 0, "Number of bdwrite to bawrite conversions to limit dirty buffers");
250 SYSCTL_INT(_vfs, OID_AUTO, bdwriteskip, CTLFLAG_RW, &bdwriteskip,
251 0, "Number of buffers supplied to bdwrite with snapshot deadlock risk");
252 int altbufferflushes;
253 SYSCTL_INT(_vfs, OID_AUTO, altbufferflushes, CTLFLAG_RW | CTLFLAG_STATS,
254 &altbufferflushes, 0, "Number of fsync flushes to limit dirty buffers");
255 static int recursiveflushes;
256 SYSCTL_INT(_vfs, OID_AUTO, recursiveflushes, CTLFLAG_RW | CTLFLAG_STATS,
257 &recursiveflushes, 0, "Number of flushes skipped due to being recursive");
258 static int sysctl_numdirtybuffers(SYSCTL_HANDLER_ARGS);
259 SYSCTL_PROC(_vfs, OID_AUTO, numdirtybuffers,
260 CTLTYPE_INT|CTLFLAG_MPSAFE|CTLFLAG_RD, NULL, 0, sysctl_numdirtybuffers, "I",
261 "Number of buffers that are dirty (has unwritten changes) at the moment");
262 static int lodirtybuffers;
263 SYSCTL_PROC(_vfs, OID_AUTO, lodirtybuffers,
264 CTLTYPE_INT|CTLFLAG_MPSAFE|CTLFLAG_RW, &lodirtybuffers,
265 __offsetof(struct bufdomain, bd_lodirtybuffers), sysctl_bufdomain_int, "I",
266 "How many buffers we want to have free before bufdaemon can sleep");
267 static int hidirtybuffers;
268 SYSCTL_PROC(_vfs, OID_AUTO, hidirtybuffers,
269 CTLTYPE_INT|CTLFLAG_MPSAFE|CTLFLAG_RW, &hidirtybuffers,
270 __offsetof(struct bufdomain, bd_hidirtybuffers), sysctl_bufdomain_int, "I",
271 "When the number of dirty buffers is considered severe");
273 SYSCTL_PROC(_vfs, OID_AUTO, dirtybufthresh,
274 CTLTYPE_INT|CTLFLAG_MPSAFE|CTLFLAG_RW, &dirtybufthresh,
275 __offsetof(struct bufdomain, bd_dirtybufthresh), sysctl_bufdomain_int, "I",
276 "Number of bdwrite to bawrite conversions to clear dirty buffers");
277 static int numfreebuffers;
278 SYSCTL_INT(_vfs, OID_AUTO, numfreebuffers, CTLFLAG_RD, &numfreebuffers, 0,
279 "Number of free buffers");
280 static int lofreebuffers;
281 SYSCTL_PROC(_vfs, OID_AUTO, lofreebuffers,
282 CTLTYPE_INT|CTLFLAG_MPSAFE|CTLFLAG_RW, &lofreebuffers,
283 __offsetof(struct bufdomain, bd_lofreebuffers), sysctl_bufdomain_int, "I",
284 "Target number of free buffers");
285 static int hifreebuffers;
286 SYSCTL_PROC(_vfs, OID_AUTO, hifreebuffers,
287 CTLTYPE_INT|CTLFLAG_MPSAFE|CTLFLAG_RW, &hifreebuffers,
288 __offsetof(struct bufdomain, bd_hifreebuffers), sysctl_bufdomain_int, "I",
289 "Threshold for clean buffer recycling");
290 static counter_u64_t getnewbufcalls;
291 SYSCTL_COUNTER_U64(_vfs, OID_AUTO, getnewbufcalls, CTLFLAG_RD,
292 &getnewbufcalls, "Number of calls to getnewbuf");
293 static counter_u64_t getnewbufrestarts;
294 SYSCTL_COUNTER_U64(_vfs, OID_AUTO, getnewbufrestarts, CTLFLAG_RD,
296 "Number of times getnewbuf has had to restart a buffer acquisition");
297 static counter_u64_t mappingrestarts;
298 SYSCTL_COUNTER_U64(_vfs, OID_AUTO, mappingrestarts, CTLFLAG_RD,
300 "Number of times getblk has had to restart a buffer mapping for "
302 static counter_u64_t numbufallocfails;
303 SYSCTL_COUNTER_U64(_vfs, OID_AUTO, numbufallocfails, CTLFLAG_RW,
304 &numbufallocfails, "Number of times buffer allocations failed");
305 static int flushbufqtarget = 100;
306 SYSCTL_INT(_vfs, OID_AUTO, flushbufqtarget, CTLFLAG_RW, &flushbufqtarget, 0,
307 "Amount of work to do in flushbufqueues when helping bufdaemon");
308 static counter_u64_t notbufdflushes;
309 SYSCTL_COUNTER_U64(_vfs, OID_AUTO, notbufdflushes, CTLFLAG_RD, ¬bufdflushes,
310 "Number of dirty buffer flushes done by the bufdaemon helpers");
311 static long barrierwrites;
312 SYSCTL_LONG(_vfs, OID_AUTO, barrierwrites, CTLFLAG_RW | CTLFLAG_STATS,
313 &barrierwrites, 0, "Number of barrier writes");
314 SYSCTL_INT(_vfs, OID_AUTO, unmapped_buf_allowed, CTLFLAG_RD,
315 &unmapped_buf_allowed, 0,
316 "Permit the use of the unmapped i/o");
317 int maxbcachebuf = MAXBCACHEBUF;
318 SYSCTL_INT(_vfs, OID_AUTO, maxbcachebuf, CTLFLAG_RDTUN, &maxbcachebuf, 0,
319 "Maximum size of a buffer cache block");
322 * This lock synchronizes access to bd_request.
324 static struct mtx_padalign __exclusive_cache_line bdlock;
327 * This lock protects the runningbufreq and synchronizes runningbufwakeup and
328 * waitrunningbufspace().
330 static struct mtx_padalign __exclusive_cache_line rbreqlock;
333 * Lock that protects bdirtywait.
335 static struct mtx_padalign __exclusive_cache_line bdirtylock;
338 * Wakeup point for bufdaemon, as well as indicator of whether it is already
339 * active. Set to 1 when the bufdaemon is already "on" the queue, 0 when it
342 static int bd_request;
345 * Request for the buf daemon to write more buffers than is indicated by
346 * lodirtybuf. This may be necessary to push out excess dependencies or
347 * defragment the address space where a simple count of the number of dirty
348 * buffers is insufficient to characterize the demand for flushing them.
350 static int bd_speedupreq;
353 * Synchronization (sleep/wakeup) variable for active buffer space requests.
354 * Set when wait starts, cleared prior to wakeup().
355 * Used in runningbufwakeup() and waitrunningbufspace().
357 static int runningbufreq;
360 * Synchronization for bwillwrite() waiters.
362 static int bdirtywait;
365 * Definitions for the buffer free lists.
367 #define QUEUE_NONE 0 /* on no queue */
368 #define QUEUE_EMPTY 1 /* empty buffer headers */
369 #define QUEUE_DIRTY 2 /* B_DELWRI buffers */
370 #define QUEUE_CLEAN 3 /* non-B_DELWRI buffers */
371 #define QUEUE_SENTINEL 4 /* not an queue index, but mark for sentinel */
373 /* Maximum number of buffer domains. */
374 #define BUF_DOMAINS 8
376 struct bufdomainset bdlodirty; /* Domains > lodirty */
377 struct bufdomainset bdhidirty; /* Domains > hidirty */
379 /* Configured number of clean queues. */
380 static int __read_mostly buf_domains;
382 BITSET_DEFINE(bufdomainset, BUF_DOMAINS);
383 struct bufdomain __exclusive_cache_line bdomain[BUF_DOMAINS];
384 struct bufqueue __exclusive_cache_line bqempty;
387 * per-cpu empty buffer cache.
392 * Single global constant for BUF_WMESG, to avoid getting multiple references.
393 * buf_wmesg is referred from macros.
395 const char *buf_wmesg = BUF_WMESG;
398 sysctl_runningspace(SYSCTL_HANDLER_ARGS)
403 value = *(long *)arg1;
404 error = sysctl_handle_long(oidp, &value, 0, req);
405 if (error != 0 || req->newptr == NULL)
407 mtx_lock(&rbreqlock);
408 if (arg1 == &hirunningspace) {
409 if (value < lorunningspace)
412 hirunningspace = value;
414 KASSERT(arg1 == &lorunningspace,
415 ("%s: unknown arg1", __func__));
416 if (value > hirunningspace)
419 lorunningspace = value;
421 mtx_unlock(&rbreqlock);
426 sysctl_bufdomain_int(SYSCTL_HANDLER_ARGS)
432 value = *(int *)arg1;
433 error = sysctl_handle_int(oidp, &value, 0, req);
434 if (error != 0 || req->newptr == NULL)
436 *(int *)arg1 = value;
437 for (i = 0; i < buf_domains; i++)
438 *(int *)(uintptr_t)(((uintptr_t)&bdomain[i]) + arg2) =
445 sysctl_bufdomain_long(SYSCTL_HANDLER_ARGS)
451 value = *(long *)arg1;
452 error = sysctl_handle_long(oidp, &value, 0, req);
453 if (error != 0 || req->newptr == NULL)
455 *(long *)arg1 = value;
456 for (i = 0; i < buf_domains; i++)
457 *(long *)(uintptr_t)(((uintptr_t)&bdomain[i]) + arg2) =
463 #if defined(COMPAT_FREEBSD4) || defined(COMPAT_FREEBSD5) || \
464 defined(COMPAT_FREEBSD6) || defined(COMPAT_FREEBSD7)
466 sysctl_bufspace(SYSCTL_HANDLER_ARGS)
473 for (i = 0; i < buf_domains; i++)
474 lvalue += bdomain[i].bd_bufspace;
475 if (sizeof(int) == sizeof(long) || req->oldlen >= sizeof(long))
476 return (sysctl_handle_long(oidp, &lvalue, 0, req));
477 if (lvalue > INT_MAX)
478 /* On overflow, still write out a long to trigger ENOMEM. */
479 return (sysctl_handle_long(oidp, &lvalue, 0, req));
481 return (sysctl_handle_int(oidp, &ivalue, 0, req));
485 sysctl_bufspace(SYSCTL_HANDLER_ARGS)
491 for (i = 0; i < buf_domains; i++)
492 lvalue += bdomain[i].bd_bufspace;
493 return (sysctl_handle_long(oidp, &lvalue, 0, req));
498 sysctl_numdirtybuffers(SYSCTL_HANDLER_ARGS)
504 for (i = 0; i < buf_domains; i++)
505 value += bdomain[i].bd_numdirtybuffers;
506 return (sysctl_handle_int(oidp, &value, 0, req));
512 * Wakeup any bwillwrite() waiters.
517 mtx_lock(&bdirtylock);
522 mtx_unlock(&bdirtylock);
528 * Clear a domain from the appropriate bitsets when dirtybuffers
532 bd_clear(struct bufdomain *bd)
535 mtx_lock(&bdirtylock);
536 if (bd->bd_numdirtybuffers <= bd->bd_lodirtybuffers)
537 BIT_CLR(BUF_DOMAINS, BD_DOMAIN(bd), &bdlodirty);
538 if (bd->bd_numdirtybuffers <= bd->bd_hidirtybuffers)
539 BIT_CLR(BUF_DOMAINS, BD_DOMAIN(bd), &bdhidirty);
540 mtx_unlock(&bdirtylock);
546 * Set a domain in the appropriate bitsets when dirtybuffers
550 bd_set(struct bufdomain *bd)
553 mtx_lock(&bdirtylock);
554 if (bd->bd_numdirtybuffers > bd->bd_lodirtybuffers)
555 BIT_SET(BUF_DOMAINS, BD_DOMAIN(bd), &bdlodirty);
556 if (bd->bd_numdirtybuffers > bd->bd_hidirtybuffers)
557 BIT_SET(BUF_DOMAINS, BD_DOMAIN(bd), &bdhidirty);
558 mtx_unlock(&bdirtylock);
564 * Decrement the numdirtybuffers count by one and wakeup any
565 * threads blocked in bwillwrite().
568 bdirtysub(struct buf *bp)
570 struct bufdomain *bd;
574 num = atomic_fetchadd_int(&bd->bd_numdirtybuffers, -1);
575 if (num == (bd->bd_lodirtybuffers + bd->bd_hidirtybuffers) / 2)
577 if (num == bd->bd_lodirtybuffers || num == bd->bd_hidirtybuffers)
584 * Increment the numdirtybuffers count by one and wakeup the buf
588 bdirtyadd(struct buf *bp)
590 struct bufdomain *bd;
594 * Only do the wakeup once as we cross the boundary. The
595 * buf daemon will keep running until the condition clears.
598 num = atomic_fetchadd_int(&bd->bd_numdirtybuffers, 1);
599 if (num == (bd->bd_lodirtybuffers + bd->bd_hidirtybuffers) / 2)
601 if (num == bd->bd_lodirtybuffers || num == bd->bd_hidirtybuffers)
606 * bufspace_daemon_wakeup:
608 * Wakeup the daemons responsible for freeing clean bufs.
611 bufspace_daemon_wakeup(struct bufdomain *bd)
615 * avoid the lock if the daemon is running.
617 if (atomic_fetchadd_int(&bd->bd_running, 1) == 0) {
619 atomic_store_int(&bd->bd_running, 1);
620 wakeup(&bd->bd_running);
626 * bufspace_daemon_wait:
628 * Sleep until the domain falls below a limit or one second passes.
631 bufspace_daemon_wait(struct bufdomain *bd)
634 * Re-check our limits and sleep. bd_running must be
635 * cleared prior to checking the limits to avoid missed
636 * wakeups. The waker will adjust one of bufspace or
637 * freebuffers prior to checking bd_running.
640 atomic_store_int(&bd->bd_running, 0);
641 if (bd->bd_bufspace < bd->bd_bufspacethresh &&
642 bd->bd_freebuffers > bd->bd_lofreebuffers) {
643 msleep(&bd->bd_running, BD_RUN_LOCKPTR(bd), PRIBIO|PDROP,
646 /* Avoid spurious wakeups while running. */
647 atomic_store_int(&bd->bd_running, 1);
655 * Adjust the reported bufspace for a KVA managed buffer, possibly
656 * waking any waiters.
659 bufspace_adjust(struct buf *bp, int bufsize)
661 struct bufdomain *bd;
665 KASSERT((bp->b_flags & B_MALLOC) == 0,
666 ("bufspace_adjust: malloc buf %p", bp));
668 diff = bufsize - bp->b_bufsize;
670 atomic_subtract_long(&bd->bd_bufspace, -diff);
671 } else if (diff > 0) {
672 space = atomic_fetchadd_long(&bd->bd_bufspace, diff);
673 /* Wake up the daemon on the transition. */
674 if (space < bd->bd_bufspacethresh &&
675 space + diff >= bd->bd_bufspacethresh)
676 bufspace_daemon_wakeup(bd);
678 bp->b_bufsize = bufsize;
684 * Reserve bufspace before calling allocbuf(). metadata has a
685 * different space limit than data.
688 bufspace_reserve(struct bufdomain *bd, int size, bool metadata)
694 limit = bd->bd_maxbufspace;
696 limit = bd->bd_hibufspace;
697 space = atomic_fetchadd_long(&bd->bd_bufspace, size);
700 atomic_subtract_long(&bd->bd_bufspace, size);
704 /* Wake up the daemon on the transition. */
705 if (space < bd->bd_bufspacethresh && new >= bd->bd_bufspacethresh)
706 bufspace_daemon_wakeup(bd);
714 * Release reserved bufspace after bufspace_adjust() has consumed it.
717 bufspace_release(struct bufdomain *bd, int size)
720 atomic_subtract_long(&bd->bd_bufspace, size);
726 * Wait for bufspace, acting as the buf daemon if a locked vnode is
727 * supplied. bd_wanted must be set prior to polling for space. The
728 * operation must be re-tried on return.
731 bufspace_wait(struct bufdomain *bd, struct vnode *vp, int gbflags,
732 int slpflag, int slptimeo)
735 int error, fl, norunbuf;
737 if ((gbflags & GB_NOWAIT_BD) != 0)
742 while (bd->bd_wanted) {
743 if (vp != NULL && vp->v_type != VCHR &&
744 (td->td_pflags & TDP_BUFNEED) == 0) {
747 * getblk() is called with a vnode locked, and
748 * some majority of the dirty buffers may as
749 * well belong to the vnode. Flushing the
750 * buffers there would make a progress that
751 * cannot be achieved by the buf_daemon, that
752 * cannot lock the vnode.
754 norunbuf = ~(TDP_BUFNEED | TDP_NORUNNINGBUF) |
755 (td->td_pflags & TDP_NORUNNINGBUF);
758 * Play bufdaemon. The getnewbuf() function
759 * may be called while the thread owns lock
760 * for another dirty buffer for the same
761 * vnode, which makes it impossible to use
762 * VOP_FSYNC() there, due to the buffer lock
765 td->td_pflags |= TDP_BUFNEED | TDP_NORUNNINGBUF;
766 fl = buf_flush(vp, bd, flushbufqtarget);
767 td->td_pflags &= norunbuf;
771 if (bd->bd_wanted == 0)
774 error = msleep(&bd->bd_wanted, BD_LOCKPTR(bd),
775 (PRIBIO + 4) | slpflag, "newbuf", slptimeo);
785 * buffer space management daemon. Tries to maintain some marginal
786 * amount of free buffer space so that requesting processes neither
787 * block nor work to reclaim buffers.
790 bufspace_daemon(void *arg)
792 struct bufdomain *bd;
794 EVENTHANDLER_REGISTER(shutdown_pre_sync, kthread_shutdown, curthread,
795 SHUTDOWN_PRI_LAST + 100);
799 kthread_suspend_check();
802 * Free buffers from the clean queue until we meet our
805 * Theory of operation: The buffer cache is most efficient
806 * when some free buffer headers and space are always
807 * available to getnewbuf(). This daemon attempts to prevent
808 * the excessive blocking and synchronization associated
809 * with shortfall. It goes through three phases according
812 * 1) The daemon wakes up voluntarily once per-second
813 * during idle periods when the counters are below
814 * the wakeup thresholds (bufspacethresh, lofreebuffers).
816 * 2) The daemon wakes up as we cross the thresholds
817 * ahead of any potential blocking. This may bounce
818 * slightly according to the rate of consumption and
821 * 3) The daemon and consumers are starved for working
822 * clean buffers. This is the 'bufspace' sleep below
823 * which will inefficiently trade bufs with bqrelse
824 * until we return to condition 2.
826 while (bd->bd_bufspace > bd->bd_lobufspace ||
827 bd->bd_freebuffers < bd->bd_hifreebuffers) {
828 if (buf_recycle(bd, false) != 0) {
832 * Speedup dirty if we've run out of clean
833 * buffers. This is possible in particular
834 * because softdep may held many bufs locked
835 * pending writes to other bufs which are
836 * marked for delayed write, exhausting
837 * clean space until they are written.
842 msleep(&bd->bd_wanted, BD_LOCKPTR(bd),
843 PRIBIO|PDROP, "bufspace", hz/10);
849 bufspace_daemon_wait(bd);
856 * Adjust the reported bufspace for a malloc managed buffer, possibly
857 * waking any waiters.
860 bufmallocadjust(struct buf *bp, int bufsize)
864 KASSERT((bp->b_flags & B_MALLOC) != 0,
865 ("bufmallocadjust: non-malloc buf %p", bp));
866 diff = bufsize - bp->b_bufsize;
868 atomic_subtract_long(&bufmallocspace, -diff);
870 atomic_add_long(&bufmallocspace, diff);
871 bp->b_bufsize = bufsize;
877 * Wake up processes that are waiting on asynchronous writes to fall
878 * below lorunningspace.
884 mtx_lock(&rbreqlock);
887 wakeup(&runningbufreq);
889 mtx_unlock(&rbreqlock);
895 * Decrement the outstanding write count according.
898 runningbufwakeup(struct buf *bp)
902 bspace = bp->b_runningbufspace;
905 space = atomic_fetchadd_long(&runningbufspace, -bspace);
906 KASSERT(space >= bspace, ("runningbufspace underflow %ld %ld",
908 bp->b_runningbufspace = 0;
910 * Only acquire the lock and wakeup on the transition from exceeding
911 * the threshold to falling below it.
913 if (space < lorunningspace)
915 if (space - bspace > lorunningspace)
921 * waitrunningbufspace()
923 * runningbufspace is a measure of the amount of I/O currently
924 * running. This routine is used in async-write situations to
925 * prevent creating huge backups of pending writes to a device.
926 * Only asynchronous writes are governed by this function.
928 * This does NOT turn an async write into a sync write. It waits
929 * for earlier writes to complete and generally returns before the
930 * caller's write has reached the device.
933 waitrunningbufspace(void)
936 mtx_lock(&rbreqlock);
937 while (runningbufspace > hirunningspace) {
939 msleep(&runningbufreq, &rbreqlock, PVM, "wdrain", 0);
941 mtx_unlock(&rbreqlock);
945 * vfs_buf_test_cache:
947 * Called when a buffer is extended. This function clears the B_CACHE
948 * bit if the newly extended portion of the buffer does not contain
952 vfs_buf_test_cache(struct buf *bp, vm_ooffset_t foff, vm_offset_t off,
953 vm_offset_t size, vm_page_t m)
957 * This function and its results are protected by higher level
958 * synchronization requiring vnode and buf locks to page in and
961 if (bp->b_flags & B_CACHE) {
962 int base = (foff + off) & PAGE_MASK;
963 if (vm_page_is_valid(m, base, size) == 0)
964 bp->b_flags &= ~B_CACHE;
968 /* Wake up the buffer daemon if necessary */
974 if (bd_request == 0) {
982 * Adjust the maxbcachbuf tunable.
985 maxbcachebuf_adjust(void)
990 * maxbcachebuf must be a power of 2 >= MAXBSIZE.
993 while (i * 2 <= maxbcachebuf)
996 if (maxbcachebuf < MAXBSIZE)
997 maxbcachebuf = MAXBSIZE;
998 if (maxbcachebuf > MAXPHYS)
999 maxbcachebuf = MAXPHYS;
1000 if (bootverbose != 0 && maxbcachebuf != MAXBCACHEBUF)
1001 printf("maxbcachebuf=%d\n", maxbcachebuf);
1005 * bd_speedup - speedup the buffer cache flushing code
1014 if (bd_speedupreq == 0 || bd_request == 0)
1019 wakeup(&bd_request);
1020 mtx_unlock(&bdlock);
1024 #define TRANSIENT_DENOM 5
1026 #define TRANSIENT_DENOM 10
1030 * Calculating buffer cache scaling values and reserve space for buffer
1031 * headers. This is called during low level kernel initialization and
1032 * may be called more then once. We CANNOT write to the memory area
1033 * being reserved at this time.
1036 kern_vfs_bio_buffer_alloc(caddr_t v, long physmem_est)
1039 long maxbuf, maxbuf_sz, buf_sz, biotmap_sz;
1042 * physmem_est is in pages. Convert it to kilobytes (assumes
1043 * PAGE_SIZE is >= 1K)
1045 physmem_est = physmem_est * (PAGE_SIZE / 1024);
1047 maxbcachebuf_adjust();
1049 * The nominal buffer size (and minimum KVA allocation) is BKVASIZE.
1050 * For the first 64MB of ram nominally allocate sufficient buffers to
1051 * cover 1/4 of our ram. Beyond the first 64MB allocate additional
1052 * buffers to cover 1/10 of our ram over 64MB. When auto-sizing
1053 * the buffer cache we limit the eventual kva reservation to
1056 * factor represents the 1/4 x ram conversion.
1059 int factor = 4 * BKVASIZE / 1024;
1062 if (physmem_est > 4096)
1063 nbuf += min((physmem_est - 4096) / factor,
1065 if (physmem_est > 65536)
1066 nbuf += min((physmem_est - 65536) * 2 / (factor * 5),
1067 32 * 1024 * 1024 / (factor * 5));
1069 if (maxbcache && nbuf > maxbcache / BKVASIZE)
1070 nbuf = maxbcache / BKVASIZE;
1075 /* XXX Avoid unsigned long overflows later on with maxbufspace. */
1076 maxbuf = (LONG_MAX / 3) / BKVASIZE;
1077 if (nbuf > maxbuf) {
1079 printf("Warning: nbufs lowered from %d to %ld\n", nbuf,
1085 * Ideal allocation size for the transient bio submap is 10%
1086 * of the maximal space buffer map. This roughly corresponds
1087 * to the amount of the buffer mapped for typical UFS load.
1089 * Clip the buffer map to reserve space for the transient
1090 * BIOs, if its extent is bigger than 90% (80% on i386) of the
1091 * maximum buffer map extent on the platform.
1093 * The fall-back to the maxbuf in case of maxbcache unset,
1094 * allows to not trim the buffer KVA for the architectures
1095 * with ample KVA space.
1097 if (bio_transient_maxcnt == 0 && unmapped_buf_allowed) {
1098 maxbuf_sz = maxbcache != 0 ? maxbcache : maxbuf * BKVASIZE;
1099 buf_sz = (long)nbuf * BKVASIZE;
1100 if (buf_sz < maxbuf_sz / TRANSIENT_DENOM *
1101 (TRANSIENT_DENOM - 1)) {
1103 * There is more KVA than memory. Do not
1104 * adjust buffer map size, and assign the rest
1105 * of maxbuf to transient map.
1107 biotmap_sz = maxbuf_sz - buf_sz;
1110 * Buffer map spans all KVA we could afford on
1111 * this platform. Give 10% (20% on i386) of
1112 * the buffer map to the transient bio map.
1114 biotmap_sz = buf_sz / TRANSIENT_DENOM;
1115 buf_sz -= biotmap_sz;
1117 if (biotmap_sz / INT_MAX > MAXPHYS)
1118 bio_transient_maxcnt = INT_MAX;
1120 bio_transient_maxcnt = biotmap_sz / MAXPHYS;
1122 * Artificially limit to 1024 simultaneous in-flight I/Os
1123 * using the transient mapping.
1125 if (bio_transient_maxcnt > 1024)
1126 bio_transient_maxcnt = 1024;
1128 nbuf = buf_sz / BKVASIZE;
1132 nswbuf = min(nbuf / 4, 256);
1133 if (nswbuf < NSWBUF_MIN)
1134 nswbuf = NSWBUF_MIN;
1138 * Reserve space for the buffer cache buffers
1141 v = (caddr_t)(buf + nbuf);
1146 /* Initialize the buffer subsystem. Called before use of any buffers. */
1153 KASSERT(maxbcachebuf >= MAXBSIZE,
1154 ("maxbcachebuf (%d) must be >= MAXBSIZE (%d)\n", maxbcachebuf,
1156 bq_init(&bqempty, QUEUE_EMPTY, -1, "bufq empty lock");
1157 mtx_init(&rbreqlock, "runningbufspace lock", NULL, MTX_DEF);
1158 mtx_init(&bdlock, "buffer daemon lock", NULL, MTX_DEF);
1159 mtx_init(&bdirtylock, "dirty buf lock", NULL, MTX_DEF);
1161 unmapped_buf = (caddr_t)kva_alloc(MAXPHYS);
1163 /* finally, initialize each buffer header and stick on empty q */
1164 for (i = 0; i < nbuf; i++) {
1166 bzero(bp, sizeof *bp);
1167 bp->b_flags = B_INVAL;
1168 bp->b_rcred = NOCRED;
1169 bp->b_wcred = NOCRED;
1170 bp->b_qindex = QUEUE_NONE;
1172 bp->b_subqueue = mp_maxid + 1;
1174 bp->b_data = bp->b_kvabase = unmapped_buf;
1175 LIST_INIT(&bp->b_dep);
1177 bq_insert(&bqempty, bp, false);
1181 * maxbufspace is the absolute maximum amount of buffer space we are
1182 * allowed to reserve in KVM and in real terms. The absolute maximum
1183 * is nominally used by metadata. hibufspace is the nominal maximum
1184 * used by most other requests. The differential is required to
1185 * ensure that metadata deadlocks don't occur.
1187 * maxbufspace is based on BKVASIZE. Allocating buffers larger then
1188 * this may result in KVM fragmentation which is not handled optimally
1189 * by the system. XXX This is less true with vmem. We could use
1192 maxbufspace = (long)nbuf * BKVASIZE;
1193 hibufspace = lmax(3 * maxbufspace / 4, maxbufspace - maxbcachebuf * 10);
1194 lobufspace = (hibufspace / 20) * 19; /* 95% */
1195 bufspacethresh = lobufspace + (hibufspace - lobufspace) / 2;
1198 * Note: The 16 MiB upper limit for hirunningspace was chosen
1199 * arbitrarily and may need further tuning. It corresponds to
1200 * 128 outstanding write IO requests (if IO size is 128 KiB),
1201 * which fits with many RAID controllers' tagged queuing limits.
1202 * The lower 1 MiB limit is the historical upper limit for
1205 hirunningspace = lmax(lmin(roundup(hibufspace / 64, maxbcachebuf),
1206 16 * 1024 * 1024), 1024 * 1024);
1207 lorunningspace = roundup((hirunningspace * 2) / 3, maxbcachebuf);
1210 * Limit the amount of malloc memory since it is wired permanently into
1211 * the kernel space. Even though this is accounted for in the buffer
1212 * allocation, we don't want the malloced region to grow uncontrolled.
1213 * The malloc scheme improves memory utilization significantly on
1214 * average (small) directories.
1216 maxbufmallocspace = hibufspace / 20;
1219 * Reduce the chance of a deadlock occurring by limiting the number
1220 * of delayed-write dirty buffers we allow to stack up.
1222 hidirtybuffers = nbuf / 4 + 20;
1223 dirtybufthresh = hidirtybuffers * 9 / 10;
1225 * To support extreme low-memory systems, make sure hidirtybuffers
1226 * cannot eat up all available buffer space. This occurs when our
1227 * minimum cannot be met. We try to size hidirtybuffers to 3/4 our
1228 * buffer space assuming BKVASIZE'd buffers.
1230 while ((long)hidirtybuffers * BKVASIZE > 3 * hibufspace / 4) {
1231 hidirtybuffers >>= 1;
1233 lodirtybuffers = hidirtybuffers / 2;
1236 * lofreebuffers should be sufficient to avoid stalling waiting on
1237 * buf headers under heavy utilization. The bufs in per-cpu caches
1238 * are counted as free but will be unavailable to threads executing
1241 * hifreebuffers is the free target for the bufspace daemon. This
1242 * should be set appropriately to limit work per-iteration.
1244 lofreebuffers = MIN((nbuf / 25) + (20 * mp_ncpus), 128 * mp_ncpus);
1245 hifreebuffers = (3 * lofreebuffers) / 2;
1246 numfreebuffers = nbuf;
1248 /* Setup the kva and free list allocators. */
1249 vmem_set_reclaim(buffer_arena, bufkva_reclaim);
1250 buf_zone = uma_zcache_create("buf free cache", sizeof(struct buf),
1251 NULL, NULL, NULL, NULL, buf_import, buf_release, NULL, 0);
1254 * Size the clean queue according to the amount of buffer space.
1255 * One queue per-256mb up to the max. More queues gives better
1256 * concurrency but less accurate LRU.
1258 buf_domains = MIN(howmany(maxbufspace, 256*1024*1024), BUF_DOMAINS);
1259 for (i = 0 ; i < buf_domains; i++) {
1260 struct bufdomain *bd;
1264 bd->bd_freebuffers = nbuf / buf_domains;
1265 bd->bd_hifreebuffers = hifreebuffers / buf_domains;
1266 bd->bd_lofreebuffers = lofreebuffers / buf_domains;
1267 bd->bd_bufspace = 0;
1268 bd->bd_maxbufspace = maxbufspace / buf_domains;
1269 bd->bd_hibufspace = hibufspace / buf_domains;
1270 bd->bd_lobufspace = lobufspace / buf_domains;
1271 bd->bd_bufspacethresh = bufspacethresh / buf_domains;
1272 bd->bd_numdirtybuffers = 0;
1273 bd->bd_hidirtybuffers = hidirtybuffers / buf_domains;
1274 bd->bd_lodirtybuffers = lodirtybuffers / buf_domains;
1275 bd->bd_dirtybufthresh = dirtybufthresh / buf_domains;
1276 /* Don't allow more than 2% of bufs in the per-cpu caches. */
1277 bd->bd_lim = nbuf / buf_domains / 50 / mp_ncpus;
1279 getnewbufcalls = counter_u64_alloc(M_WAITOK);
1280 getnewbufrestarts = counter_u64_alloc(M_WAITOK);
1281 mappingrestarts = counter_u64_alloc(M_WAITOK);
1282 numbufallocfails = counter_u64_alloc(M_WAITOK);
1283 notbufdflushes = counter_u64_alloc(M_WAITOK);
1284 buffreekvacnt = counter_u64_alloc(M_WAITOK);
1285 bufdefragcnt = counter_u64_alloc(M_WAITOK);
1286 bufkvaspace = counter_u64_alloc(M_WAITOK);
1291 vfs_buf_check_mapped(struct buf *bp)
1294 KASSERT(bp->b_kvabase != unmapped_buf,
1295 ("mapped buf: b_kvabase was not updated %p", bp));
1296 KASSERT(bp->b_data != unmapped_buf,
1297 ("mapped buf: b_data was not updated %p", bp));
1298 KASSERT(bp->b_data < unmapped_buf || bp->b_data >= unmapped_buf +
1299 MAXPHYS, ("b_data + b_offset unmapped %p", bp));
1303 vfs_buf_check_unmapped(struct buf *bp)
1306 KASSERT(bp->b_data == unmapped_buf,
1307 ("unmapped buf: corrupted b_data %p", bp));
1310 #define BUF_CHECK_MAPPED(bp) vfs_buf_check_mapped(bp)
1311 #define BUF_CHECK_UNMAPPED(bp) vfs_buf_check_unmapped(bp)
1313 #define BUF_CHECK_MAPPED(bp) do {} while (0)
1314 #define BUF_CHECK_UNMAPPED(bp) do {} while (0)
1318 isbufbusy(struct buf *bp)
1320 if (((bp->b_flags & B_INVAL) == 0 && BUF_ISLOCKED(bp)) ||
1321 ((bp->b_flags & (B_DELWRI | B_INVAL)) == B_DELWRI))
1327 * Shutdown the system cleanly to prepare for reboot, halt, or power off.
1330 bufshutdown(int show_busybufs)
1332 static int first_buf_printf = 1;
1334 int iter, nbusy, pbusy;
1340 * Sync filesystems for shutdown
1342 wdog_kern_pat(WD_LASTVAL);
1343 kern_sync(curthread);
1346 * With soft updates, some buffers that are
1347 * written will be remarked as dirty until other
1348 * buffers are written.
1350 for (iter = pbusy = 0; iter < 20; iter++) {
1352 for (bp = &buf[nbuf]; --bp >= buf; )
1356 if (first_buf_printf)
1357 printf("All buffers synced.");
1360 if (first_buf_printf) {
1361 printf("Syncing disks, buffers remaining... ");
1362 first_buf_printf = 0;
1364 printf("%d ", nbusy);
1369 wdog_kern_pat(WD_LASTVAL);
1370 kern_sync(curthread);
1374 * Spin for a while to allow interrupt threads to run.
1376 DELAY(50000 * iter);
1379 * Context switch several times to allow interrupt
1382 for (subiter = 0; subiter < 50 * iter; subiter++) {
1383 thread_lock(curthread);
1391 * Count only busy local buffers to prevent forcing
1392 * a fsck if we're just a client of a wedged NFS server
1395 for (bp = &buf[nbuf]; --bp >= buf; ) {
1396 if (isbufbusy(bp)) {
1398 /* XXX: This is bogus. We should probably have a BO_REMOTE flag instead */
1399 if (bp->b_dev == NULL) {
1400 TAILQ_REMOVE(&mountlist,
1401 bp->b_vp->v_mount, mnt_list);
1406 if (show_busybufs > 0) {
1408 "%d: buf:%p, vnode:%p, flags:%0x, blkno:%jd, lblkno:%jd, buflock:",
1409 nbusy, bp, bp->b_vp, bp->b_flags,
1410 (intmax_t)bp->b_blkno,
1411 (intmax_t)bp->b_lblkno);
1412 BUF_LOCKPRINTINFO(bp);
1413 if (show_busybufs > 1)
1421 * Failed to sync all blocks. Indicate this and don't
1422 * unmount filesystems (thus forcing an fsck on reboot).
1424 printf("Giving up on %d buffers\n", nbusy);
1425 DELAY(5000000); /* 5 seconds */
1427 if (!first_buf_printf)
1428 printf("Final sync complete\n");
1430 * Unmount filesystems
1432 if (!KERNEL_PANICKED())
1436 DELAY(100000); /* wait for console output to finish */
1440 bpmap_qenter(struct buf *bp)
1443 BUF_CHECK_MAPPED(bp);
1446 * bp->b_data is relative to bp->b_offset, but
1447 * bp->b_offset may be offset into the first page.
1449 bp->b_data = (caddr_t)trunc_page((vm_offset_t)bp->b_data);
1450 pmap_qenter((vm_offset_t)bp->b_data, bp->b_pages, bp->b_npages);
1451 bp->b_data = (caddr_t)((vm_offset_t)bp->b_data |
1452 (vm_offset_t)(bp->b_offset & PAGE_MASK));
1455 static inline struct bufdomain *
1456 bufdomain(struct buf *bp)
1459 return (&bdomain[bp->b_domain]);
1462 static struct bufqueue *
1463 bufqueue(struct buf *bp)
1466 switch (bp->b_qindex) {
1469 case QUEUE_SENTINEL:
1474 return (&bufdomain(bp)->bd_dirtyq);
1476 return (&bufdomain(bp)->bd_subq[bp->b_subqueue]);
1480 panic("bufqueue(%p): Unhandled type %d\n", bp, bp->b_qindex);
1484 * Return the locked bufqueue that bp is a member of.
1486 static struct bufqueue *
1487 bufqueue_acquire(struct buf *bp)
1489 struct bufqueue *bq, *nbq;
1492 * bp can be pushed from a per-cpu queue to the
1493 * cleanq while we're waiting on the lock. Retry
1494 * if the queues don't match.
1512 * Insert the buffer into the appropriate free list. Requires a
1513 * locked buffer on entry and buffer is unlocked before return.
1516 binsfree(struct buf *bp, int qindex)
1518 struct bufdomain *bd;
1519 struct bufqueue *bq;
1521 KASSERT(qindex == QUEUE_CLEAN || qindex == QUEUE_DIRTY,
1522 ("binsfree: Invalid qindex %d", qindex));
1523 BUF_ASSERT_XLOCKED(bp);
1526 * Handle delayed bremfree() processing.
1528 if (bp->b_flags & B_REMFREE) {
1529 if (bp->b_qindex == qindex) {
1530 bp->b_flags |= B_REUSE;
1531 bp->b_flags &= ~B_REMFREE;
1535 bq = bufqueue_acquire(bp);
1540 if (qindex == QUEUE_CLEAN) {
1541 if (bd->bd_lim != 0)
1542 bq = &bd->bd_subq[PCPU_GET(cpuid)];
1546 bq = &bd->bd_dirtyq;
1547 bq_insert(bq, bp, true);
1553 * Free a buffer to the buf zone once it no longer has valid contents.
1556 buf_free(struct buf *bp)
1559 if (bp->b_flags & B_REMFREE)
1561 if (bp->b_vflags & BV_BKGRDINPROG)
1562 panic("losing buffer 1");
1563 if (bp->b_rcred != NOCRED) {
1564 crfree(bp->b_rcred);
1565 bp->b_rcred = NOCRED;
1567 if (bp->b_wcred != NOCRED) {
1568 crfree(bp->b_wcred);
1569 bp->b_wcred = NOCRED;
1571 if (!LIST_EMPTY(&bp->b_dep))
1574 atomic_add_int(&bufdomain(bp)->bd_freebuffers, 1);
1576 uma_zfree(buf_zone, bp);
1582 * Import bufs into the uma cache from the buf list. The system still
1583 * expects a static array of bufs and much of the synchronization
1584 * around bufs assumes type stable storage. As a result, UMA is used
1585 * only as a per-cpu cache of bufs still maintained on a global list.
1588 buf_import(void *arg, void **store, int cnt, int domain, int flags)
1594 for (i = 0; i < cnt; i++) {
1595 bp = TAILQ_FIRST(&bqempty.bq_queue);
1598 bq_remove(&bqempty, bp);
1601 BQ_UNLOCK(&bqempty);
1609 * Release bufs from the uma cache back to the buffer queues.
1612 buf_release(void *arg, void **store, int cnt)
1614 struct bufqueue *bq;
1620 for (i = 0; i < cnt; i++) {
1622 /* Inline bq_insert() to batch locking. */
1623 TAILQ_INSERT_TAIL(&bq->bq_queue, bp, b_freelist);
1624 bp->b_flags &= ~(B_AGE | B_REUSE);
1626 bp->b_qindex = bq->bq_index;
1634 * Allocate an empty buffer header.
1637 buf_alloc(struct bufdomain *bd)
1643 * We can only run out of bufs in the buf zone if the average buf
1644 * is less than BKVASIZE. In this case the actual wait/block will
1645 * come from buf_reycle() failing to flush one of these small bufs.
1648 freebufs = atomic_fetchadd_int(&bd->bd_freebuffers, -1);
1650 bp = uma_zalloc(buf_zone, M_NOWAIT);
1652 atomic_add_int(&bd->bd_freebuffers, 1);
1653 bufspace_daemon_wakeup(bd);
1654 counter_u64_add(numbufallocfails, 1);
1658 * Wake-up the bufspace daemon on transition below threshold.
1660 if (freebufs == bd->bd_lofreebuffers)
1661 bufspace_daemon_wakeup(bd);
1663 if (BUF_LOCK(bp, LK_EXCLUSIVE | LK_NOWAIT, NULL) != 0)
1664 panic("getnewbuf_empty: Locked buf %p on free queue.", bp);
1666 KASSERT(bp->b_vp == NULL,
1667 ("bp: %p still has vnode %p.", bp, bp->b_vp));
1668 KASSERT((bp->b_flags & (B_DELWRI | B_NOREUSE)) == 0,
1669 ("invalid buffer %p flags %#x", bp, bp->b_flags));
1670 KASSERT((bp->b_xflags & (BX_VNCLEAN|BX_VNDIRTY)) == 0,
1671 ("bp: %p still on a buffer list. xflags %X", bp, bp->b_xflags));
1672 KASSERT(bp->b_npages == 0,
1673 ("bp: %p still has %d vm pages\n", bp, bp->b_npages));
1674 KASSERT(bp->b_kvasize == 0, ("bp: %p still has kva\n", bp));
1675 KASSERT(bp->b_bufsize == 0, ("bp: %p still has bufspace\n", bp));
1677 bp->b_domain = BD_DOMAIN(bd);
1683 bp->b_blkno = bp->b_lblkno = 0;
1684 bp->b_offset = NOOFFSET;
1690 bp->b_dirtyoff = bp->b_dirtyend = 0;
1691 bp->b_bufobj = NULL;
1692 bp->b_data = bp->b_kvabase = unmapped_buf;
1693 bp->b_fsprivate1 = NULL;
1694 bp->b_fsprivate2 = NULL;
1695 bp->b_fsprivate3 = NULL;
1696 LIST_INIT(&bp->b_dep);
1704 * Free a buffer from the given bufqueue. kva controls whether the
1705 * freed buf must own some kva resources. This is used for
1709 buf_recycle(struct bufdomain *bd, bool kva)
1711 struct bufqueue *bq;
1712 struct buf *bp, *nbp;
1715 counter_u64_add(bufdefragcnt, 1);
1719 KASSERT(BQ_LOCKPTR(bq) == BD_LOCKPTR(bd),
1720 ("buf_recycle: Locks don't match"));
1721 nbp = TAILQ_FIRST(&bq->bq_queue);
1724 * Run scan, possibly freeing data and/or kva mappings on the fly
1727 while ((bp = nbp) != NULL) {
1729 * Calculate next bp (we can only use it if we do not
1730 * release the bqlock).
1732 nbp = TAILQ_NEXT(bp, b_freelist);
1735 * If we are defragging then we need a buffer with
1736 * some kva to reclaim.
1738 if (kva && bp->b_kvasize == 0)
1741 if (BUF_LOCK(bp, LK_EXCLUSIVE | LK_NOWAIT, NULL) != 0)
1745 * Implement a second chance algorithm for frequently
1748 if ((bp->b_flags & B_REUSE) != 0) {
1749 TAILQ_REMOVE(&bq->bq_queue, bp, b_freelist);
1750 TAILQ_INSERT_TAIL(&bq->bq_queue, bp, b_freelist);
1751 bp->b_flags &= ~B_REUSE;
1757 * Skip buffers with background writes in progress.
1759 if ((bp->b_vflags & BV_BKGRDINPROG) != 0) {
1764 KASSERT(bp->b_qindex == QUEUE_CLEAN,
1765 ("buf_recycle: inconsistent queue %d bp %p",
1767 KASSERT(bp->b_domain == BD_DOMAIN(bd),
1768 ("getnewbuf: queue domain %d doesn't match request %d",
1769 bp->b_domain, (int)BD_DOMAIN(bd)));
1771 * NOTE: nbp is now entirely invalid. We can only restart
1772 * the scan from this point on.
1778 * Requeue the background write buffer with error and
1781 if ((bp->b_vflags & BV_BKGRDERR) != 0) {
1784 nbp = TAILQ_FIRST(&bq->bq_queue);
1787 bp->b_flags |= B_INVAL;
1800 * Mark the buffer for removal from the appropriate free list.
1804 bremfree(struct buf *bp)
1807 CTR3(KTR_BUF, "bremfree(%p) vp %p flags %X", bp, bp->b_vp, bp->b_flags);
1808 KASSERT((bp->b_flags & B_REMFREE) == 0,
1809 ("bremfree: buffer %p already marked for delayed removal.", bp));
1810 KASSERT(bp->b_qindex != QUEUE_NONE,
1811 ("bremfree: buffer %p not on a queue.", bp));
1812 BUF_ASSERT_XLOCKED(bp);
1814 bp->b_flags |= B_REMFREE;
1820 * Force an immediate removal from a free list. Used only in nfs when
1821 * it abuses the b_freelist pointer.
1824 bremfreef(struct buf *bp)
1826 struct bufqueue *bq;
1828 bq = bufqueue_acquire(bp);
1834 bq_init(struct bufqueue *bq, int qindex, int subqueue, const char *lockname)
1837 mtx_init(&bq->bq_lock, lockname, NULL, MTX_DEF);
1838 TAILQ_INIT(&bq->bq_queue);
1840 bq->bq_index = qindex;
1841 bq->bq_subqueue = subqueue;
1845 bd_init(struct bufdomain *bd)
1849 bd->bd_cleanq = &bd->bd_subq[mp_maxid + 1];
1850 bq_init(bd->bd_cleanq, QUEUE_CLEAN, mp_maxid + 1, "bufq clean lock");
1851 bq_init(&bd->bd_dirtyq, QUEUE_DIRTY, -1, "bufq dirty lock");
1852 for (i = 0; i <= mp_maxid; i++)
1853 bq_init(&bd->bd_subq[i], QUEUE_CLEAN, i,
1854 "bufq clean subqueue lock");
1855 mtx_init(&bd->bd_run_lock, "bufspace daemon run lock", NULL, MTX_DEF);
1861 * Removes a buffer from the free list, must be called with the
1862 * correct qlock held.
1865 bq_remove(struct bufqueue *bq, struct buf *bp)
1868 CTR3(KTR_BUF, "bq_remove(%p) vp %p flags %X",
1869 bp, bp->b_vp, bp->b_flags);
1870 KASSERT(bp->b_qindex != QUEUE_NONE,
1871 ("bq_remove: buffer %p not on a queue.", bp));
1872 KASSERT(bufqueue(bp) == bq,
1873 ("bq_remove: Remove buffer %p from wrong queue.", bp));
1875 BQ_ASSERT_LOCKED(bq);
1876 if (bp->b_qindex != QUEUE_EMPTY) {
1877 BUF_ASSERT_XLOCKED(bp);
1879 KASSERT(bq->bq_len >= 1,
1880 ("queue %d underflow", bp->b_qindex));
1881 TAILQ_REMOVE(&bq->bq_queue, bp, b_freelist);
1883 bp->b_qindex = QUEUE_NONE;
1884 bp->b_flags &= ~(B_REMFREE | B_REUSE);
1888 bd_flush(struct bufdomain *bd, struct bufqueue *bq)
1892 BQ_ASSERT_LOCKED(bq);
1893 if (bq != bd->bd_cleanq) {
1895 while ((bp = TAILQ_FIRST(&bq->bq_queue)) != NULL) {
1896 TAILQ_REMOVE(&bq->bq_queue, bp, b_freelist);
1897 TAILQ_INSERT_TAIL(&bd->bd_cleanq->bq_queue, bp,
1899 bp->b_subqueue = bd->bd_cleanq->bq_subqueue;
1901 bd->bd_cleanq->bq_len += bq->bq_len;
1904 if (bd->bd_wanted) {
1906 wakeup(&bd->bd_wanted);
1908 if (bq != bd->bd_cleanq)
1913 bd_flushall(struct bufdomain *bd)
1915 struct bufqueue *bq;
1919 if (bd->bd_lim == 0)
1922 for (i = 0; i <= mp_maxid; i++) {
1923 bq = &bd->bd_subq[i];
1924 if (bq->bq_len == 0)
1936 bq_insert(struct bufqueue *bq, struct buf *bp, bool unlock)
1938 struct bufdomain *bd;
1940 if (bp->b_qindex != QUEUE_NONE)
1941 panic("bq_insert: free buffer %p onto another queue?", bp);
1944 if (bp->b_flags & B_AGE) {
1945 /* Place this buf directly on the real queue. */
1946 if (bq->bq_index == QUEUE_CLEAN)
1949 TAILQ_INSERT_HEAD(&bq->bq_queue, bp, b_freelist);
1952 TAILQ_INSERT_TAIL(&bq->bq_queue, bp, b_freelist);
1954 bp->b_flags &= ~(B_AGE | B_REUSE);
1956 bp->b_qindex = bq->bq_index;
1957 bp->b_subqueue = bq->bq_subqueue;
1960 * Unlock before we notify so that we don't wakeup a waiter that
1961 * fails a trylock on the buf and sleeps again.
1966 if (bp->b_qindex == QUEUE_CLEAN) {
1968 * Flush the per-cpu queue and notify any waiters.
1970 if (bd->bd_wanted || (bq != bd->bd_cleanq &&
1971 bq->bq_len >= bd->bd_lim))
1980 * Free the kva allocation for a buffer.
1984 bufkva_free(struct buf *bp)
1988 if (bp->b_kvasize == 0) {
1989 KASSERT(bp->b_kvabase == unmapped_buf &&
1990 bp->b_data == unmapped_buf,
1991 ("Leaked KVA space on %p", bp));
1992 } else if (buf_mapped(bp))
1993 BUF_CHECK_MAPPED(bp);
1995 BUF_CHECK_UNMAPPED(bp);
1997 if (bp->b_kvasize == 0)
2000 vmem_free(buffer_arena, (vm_offset_t)bp->b_kvabase, bp->b_kvasize);
2001 counter_u64_add(bufkvaspace, -bp->b_kvasize);
2002 counter_u64_add(buffreekvacnt, 1);
2003 bp->b_data = bp->b_kvabase = unmapped_buf;
2010 * Allocate the buffer KVA and set b_kvasize and b_kvabase.
2013 bufkva_alloc(struct buf *bp, int maxsize, int gbflags)
2018 KASSERT((gbflags & GB_UNMAPPED) == 0 || (gbflags & GB_KVAALLOC) != 0,
2019 ("Invalid gbflags 0x%x in %s", gbflags, __func__));
2024 error = vmem_alloc(buffer_arena, maxsize, M_BESTFIT | M_NOWAIT, &addr);
2027 * Buffer map is too fragmented. Request the caller
2028 * to defragment the map.
2032 bp->b_kvabase = (caddr_t)addr;
2033 bp->b_kvasize = maxsize;
2034 counter_u64_add(bufkvaspace, bp->b_kvasize);
2035 if ((gbflags & GB_UNMAPPED) != 0) {
2036 bp->b_data = unmapped_buf;
2037 BUF_CHECK_UNMAPPED(bp);
2039 bp->b_data = bp->b_kvabase;
2040 BUF_CHECK_MAPPED(bp);
2048 * Reclaim buffer kva by freeing buffers holding kva. This is a vmem
2049 * callback that fires to avoid returning failure.
2052 bufkva_reclaim(vmem_t *vmem, int flags)
2059 for (i = 0; i < 5; i++) {
2060 for (q = 0; q < buf_domains; q++)
2061 if (buf_recycle(&bdomain[q], true) != 0)
2070 * Attempt to initiate asynchronous I/O on read-ahead blocks. We must
2071 * clear BIO_ERROR and B_INVAL prior to initiating I/O . If B_CACHE is set,
2072 * the buffer is valid and we do not have to do anything.
2075 breada(struct vnode * vp, daddr_t * rablkno, int * rabsize, int cnt,
2076 struct ucred * cred, int flags, void (*ckhashfunc)(struct buf *))
2084 for (i = 0; i < cnt; i++, rablkno++, rabsize++) {
2085 if (inmem(vp, *rablkno))
2087 rabp = getblk(vp, *rablkno, *rabsize, 0, 0, 0);
2088 if ((rabp->b_flags & B_CACHE) != 0) {
2095 racct_add_buf(curproc, rabp, 0);
2096 PROC_UNLOCK(curproc);
2099 td->td_ru.ru_inblock++;
2100 rabp->b_flags |= B_ASYNC;
2101 rabp->b_flags &= ~B_INVAL;
2102 if ((flags & GB_CKHASH) != 0) {
2103 rabp->b_flags |= B_CKHASH;
2104 rabp->b_ckhashcalc = ckhashfunc;
2106 rabp->b_ioflags &= ~BIO_ERROR;
2107 rabp->b_iocmd = BIO_READ;
2108 if (rabp->b_rcred == NOCRED && cred != NOCRED)
2109 rabp->b_rcred = crhold(cred);
2110 vfs_busy_pages(rabp, 0);
2112 rabp->b_iooffset = dbtob(rabp->b_blkno);
2118 * Entry point for bread() and breadn() via #defines in sys/buf.h.
2120 * Get a buffer with the specified data. Look in the cache first. We
2121 * must clear BIO_ERROR and B_INVAL prior to initiating I/O. If B_CACHE
2122 * is set, the buffer is valid and we do not have to do anything, see
2123 * getblk(). Also starts asynchronous I/O on read-ahead blocks.
2125 * Always return a NULL buffer pointer (in bpp) when returning an error.
2127 * The blkno parameter is the logical block being requested. Normally
2128 * the mapping of logical block number to disk block address is done
2129 * by calling VOP_BMAP(). However, if the mapping is already known, the
2130 * disk block address can be passed using the dblkno parameter. If the
2131 * disk block address is not known, then the same value should be passed
2132 * for blkno and dblkno.
2135 breadn_flags(struct vnode *vp, daddr_t blkno, daddr_t dblkno, int size,
2136 daddr_t *rablkno, int *rabsize, int cnt, struct ucred *cred, int flags,
2137 void (*ckhashfunc)(struct buf *), struct buf **bpp)
2141 int error, readwait, rv;
2143 CTR3(KTR_BUF, "breadn(%p, %jd, %d)", vp, blkno, size);
2146 * Can only return NULL if GB_LOCK_NOWAIT or GB_SPARSE flags
2149 error = getblkx(vp, blkno, dblkno, size, 0, 0, flags, &bp);
2154 KASSERT(blkno == bp->b_lblkno,
2155 ("getblkx returned buffer for blkno %jd instead of blkno %jd",
2156 (intmax_t)bp->b_lblkno, (intmax_t)blkno));
2157 flags &= ~GB_NOSPARSE;
2161 * If not found in cache, do some I/O
2164 if ((bp->b_flags & B_CACHE) == 0) {
2167 PROC_LOCK(td->td_proc);
2168 racct_add_buf(td->td_proc, bp, 0);
2169 PROC_UNLOCK(td->td_proc);
2172 td->td_ru.ru_inblock++;
2173 bp->b_iocmd = BIO_READ;
2174 bp->b_flags &= ~B_INVAL;
2175 if ((flags & GB_CKHASH) != 0) {
2176 bp->b_flags |= B_CKHASH;
2177 bp->b_ckhashcalc = ckhashfunc;
2179 if ((flags & GB_CVTENXIO) != 0)
2180 bp->b_xflags |= BX_CVTENXIO;
2181 bp->b_ioflags &= ~BIO_ERROR;
2182 if (bp->b_rcred == NOCRED && cred != NOCRED)
2183 bp->b_rcred = crhold(cred);
2184 vfs_busy_pages(bp, 0);
2185 bp->b_iooffset = dbtob(bp->b_blkno);
2191 * Attempt to initiate asynchronous I/O on read-ahead blocks.
2193 breada(vp, rablkno, rabsize, cnt, cred, flags, ckhashfunc);
2207 * Write, release buffer on completion. (Done by iodone
2208 * if async). Do not bother writing anything if the buffer
2211 * Note that we set B_CACHE here, indicating that buffer is
2212 * fully valid and thus cacheable. This is true even of NFS
2213 * now so we set it generally. This could be set either here
2214 * or in biodone() since the I/O is synchronous. We put it
2218 bufwrite(struct buf *bp)
2225 CTR3(KTR_BUF, "bufwrite(%p) vp %p flags %X", bp, bp->b_vp, bp->b_flags);
2226 if ((bp->b_bufobj->bo_flag & BO_DEAD) != 0) {
2227 bp->b_flags |= B_INVAL | B_RELBUF;
2228 bp->b_flags &= ~B_CACHE;
2232 if (bp->b_flags & B_INVAL) {
2237 if (bp->b_flags & B_BARRIER)
2238 atomic_add_long(&barrierwrites, 1);
2240 oldflags = bp->b_flags;
2242 KASSERT(!(bp->b_vflags & BV_BKGRDINPROG),
2243 ("FFS background buffer should not get here %p", bp));
2247 vp_md = vp->v_vflag & VV_MD;
2252 * Mark the buffer clean. Increment the bufobj write count
2253 * before bundirty() call, to prevent other thread from seeing
2254 * empty dirty list and zero counter for writes in progress,
2255 * falsely indicating that the bufobj is clean.
2257 bufobj_wref(bp->b_bufobj);
2260 bp->b_flags &= ~B_DONE;
2261 bp->b_ioflags &= ~BIO_ERROR;
2262 bp->b_flags |= B_CACHE;
2263 bp->b_iocmd = BIO_WRITE;
2265 vfs_busy_pages(bp, 1);
2268 * Normal bwrites pipeline writes
2270 bp->b_runningbufspace = bp->b_bufsize;
2271 space = atomic_fetchadd_long(&runningbufspace, bp->b_runningbufspace);
2276 racct_add_buf(curproc, bp, 1);
2277 PROC_UNLOCK(curproc);
2280 curthread->td_ru.ru_oublock++;
2281 if (oldflags & B_ASYNC)
2283 bp->b_iooffset = dbtob(bp->b_blkno);
2284 buf_track(bp, __func__);
2287 if ((oldflags & B_ASYNC) == 0) {
2288 int rtval = bufwait(bp);
2291 } else if (space > hirunningspace) {
2293 * don't allow the async write to saturate the I/O
2294 * system. We will not deadlock here because
2295 * we are blocking waiting for I/O that is already in-progress
2296 * to complete. We do not block here if it is the update
2297 * or syncer daemon trying to clean up as that can lead
2300 if ((curthread->td_pflags & TDP_NORUNNINGBUF) == 0 && !vp_md)
2301 waitrunningbufspace();
2308 bufbdflush(struct bufobj *bo, struct buf *bp)
2312 if (bo->bo_dirty.bv_cnt > dirtybufthresh + 10) {
2313 (void) VOP_FSYNC(bp->b_vp, MNT_NOWAIT, curthread);
2315 } else if (bo->bo_dirty.bv_cnt > dirtybufthresh) {
2318 * Try to find a buffer to flush.
2320 TAILQ_FOREACH(nbp, &bo->bo_dirty.bv_hd, b_bobufs) {
2321 if ((nbp->b_vflags & BV_BKGRDINPROG) ||
2323 LK_EXCLUSIVE | LK_NOWAIT, NULL))
2326 panic("bdwrite: found ourselves");
2328 /* Don't countdeps with the bo lock held. */
2329 if (buf_countdeps(nbp, 0)) {
2334 if (nbp->b_flags & B_CLUSTEROK) {
2335 vfs_bio_awrite(nbp);
2340 dirtybufferflushes++;
2349 * Delayed write. (Buffer is marked dirty). Do not bother writing
2350 * anything if the buffer is marked invalid.
2352 * Note that since the buffer must be completely valid, we can safely
2353 * set B_CACHE. In fact, we have to set B_CACHE here rather then in
2354 * biodone() in order to prevent getblk from writing the buffer
2355 * out synchronously.
2358 bdwrite(struct buf *bp)
2360 struct thread *td = curthread;
2364 CTR3(KTR_BUF, "bdwrite(%p) vp %p flags %X", bp, bp->b_vp, bp->b_flags);
2365 KASSERT(bp->b_bufobj != NULL, ("No b_bufobj %p", bp));
2366 KASSERT((bp->b_flags & B_BARRIER) == 0,
2367 ("Barrier request in delayed write %p", bp));
2369 if (bp->b_flags & B_INVAL) {
2375 * If we have too many dirty buffers, don't create any more.
2376 * If we are wildly over our limit, then force a complete
2377 * cleanup. Otherwise, just keep the situation from getting
2378 * out of control. Note that we have to avoid a recursive
2379 * disaster and not try to clean up after our own cleanup!
2383 if ((td->td_pflags & (TDP_COWINPROGRESS|TDP_INBDFLUSH)) == 0) {
2384 td->td_pflags |= TDP_INBDFLUSH;
2386 td->td_pflags &= ~TDP_INBDFLUSH;
2392 * Set B_CACHE, indicating that the buffer is fully valid. This is
2393 * true even of NFS now.
2395 bp->b_flags |= B_CACHE;
2398 * This bmap keeps the system from needing to do the bmap later,
2399 * perhaps when the system is attempting to do a sync. Since it
2400 * is likely that the indirect block -- or whatever other datastructure
2401 * that the filesystem needs is still in memory now, it is a good
2402 * thing to do this. Note also, that if the pageout daemon is
2403 * requesting a sync -- there might not be enough memory to do
2404 * the bmap then... So, this is important to do.
2406 if (vp->v_type != VCHR && bp->b_lblkno == bp->b_blkno) {
2407 VOP_BMAP(vp, bp->b_lblkno, NULL, &bp->b_blkno, NULL, NULL);
2410 buf_track(bp, __func__);
2413 * Set the *dirty* buffer range based upon the VM system dirty
2416 * Mark the buffer pages as clean. We need to do this here to
2417 * satisfy the vnode_pager and the pageout daemon, so that it
2418 * thinks that the pages have been "cleaned". Note that since
2419 * the pages are in a delayed write buffer -- the VFS layer
2420 * "will" see that the pages get written out on the next sync,
2421 * or perhaps the cluster will be completed.
2423 vfs_clean_pages_dirty_buf(bp);
2427 * note: we cannot initiate I/O from a bdwrite even if we wanted to,
2428 * due to the softdep code.
2435 * Turn buffer into delayed write request. We must clear BIO_READ and
2436 * B_RELBUF, and we must set B_DELWRI. We reassign the buffer to
2437 * itself to properly update it in the dirty/clean lists. We mark it
2438 * B_DONE to ensure that any asynchronization of the buffer properly
2439 * clears B_DONE ( else a panic will occur later ).
2441 * bdirty() is kinda like bdwrite() - we have to clear B_INVAL which
2442 * might have been set pre-getblk(). Unlike bwrite/bdwrite, bdirty()
2443 * should only be called if the buffer is known-good.
2445 * Since the buffer is not on a queue, we do not update the numfreebuffers
2448 * The buffer must be on QUEUE_NONE.
2451 bdirty(struct buf *bp)
2454 CTR3(KTR_BUF, "bdirty(%p) vp %p flags %X",
2455 bp, bp->b_vp, bp->b_flags);
2456 KASSERT(bp->b_bufobj != NULL, ("No b_bufobj %p", bp));
2457 KASSERT(bp->b_flags & B_REMFREE || bp->b_qindex == QUEUE_NONE,
2458 ("bdirty: buffer %p still on queue %d", bp, bp->b_qindex));
2459 bp->b_flags &= ~(B_RELBUF);
2460 bp->b_iocmd = BIO_WRITE;
2462 if ((bp->b_flags & B_DELWRI) == 0) {
2463 bp->b_flags |= /* XXX B_DONE | */ B_DELWRI;
2472 * Clear B_DELWRI for buffer.
2474 * Since the buffer is not on a queue, we do not update the numfreebuffers
2477 * The buffer must be on QUEUE_NONE.
2481 bundirty(struct buf *bp)
2484 CTR3(KTR_BUF, "bundirty(%p) vp %p flags %X", bp, bp->b_vp, bp->b_flags);
2485 KASSERT(bp->b_bufobj != NULL, ("No b_bufobj %p", bp));
2486 KASSERT(bp->b_flags & B_REMFREE || bp->b_qindex == QUEUE_NONE,
2487 ("bundirty: buffer %p still on queue %d", bp, bp->b_qindex));
2489 if (bp->b_flags & B_DELWRI) {
2490 bp->b_flags &= ~B_DELWRI;
2495 * Since it is now being written, we can clear its deferred write flag.
2497 bp->b_flags &= ~B_DEFERRED;
2503 * Asynchronous write. Start output on a buffer, but do not wait for
2504 * it to complete. The buffer is released when the output completes.
2506 * bwrite() ( or the VOP routine anyway ) is responsible for handling
2507 * B_INVAL buffers. Not us.
2510 bawrite(struct buf *bp)
2513 bp->b_flags |= B_ASYNC;
2520 * Asynchronous barrier write. Start output on a buffer, but do not
2521 * wait for it to complete. Place a write barrier after this write so
2522 * that this buffer and all buffers written before it are committed to
2523 * the disk before any buffers written after this write are committed
2524 * to the disk. The buffer is released when the output completes.
2527 babarrierwrite(struct buf *bp)
2530 bp->b_flags |= B_ASYNC | B_BARRIER;
2537 * Synchronous barrier write. Start output on a buffer and wait for
2538 * it to complete. Place a write barrier after this write so that
2539 * this buffer and all buffers written before it are committed to
2540 * the disk before any buffers written after this write are committed
2541 * to the disk. The buffer is released when the output completes.
2544 bbarrierwrite(struct buf *bp)
2547 bp->b_flags |= B_BARRIER;
2548 return (bwrite(bp));
2554 * Called prior to the locking of any vnodes when we are expecting to
2555 * write. We do not want to starve the buffer cache with too many
2556 * dirty buffers so we block here. By blocking prior to the locking
2557 * of any vnodes we attempt to avoid the situation where a locked vnode
2558 * prevents the various system daemons from flushing related buffers.
2564 if (buf_dirty_count_severe()) {
2565 mtx_lock(&bdirtylock);
2566 while (buf_dirty_count_severe()) {
2568 msleep(&bdirtywait, &bdirtylock, (PRIBIO + 4),
2571 mtx_unlock(&bdirtylock);
2576 * Return true if we have too many dirty buffers.
2579 buf_dirty_count_severe(void)
2582 return (!BIT_EMPTY(BUF_DOMAINS, &bdhidirty));
2588 * Release a busy buffer and, if requested, free its resources. The
2589 * buffer will be stashed in the appropriate bufqueue[] allowing it
2590 * to be accessed later as a cache entity or reused for other purposes.
2593 brelse(struct buf *bp)
2595 struct mount *v_mnt;
2599 * Many functions erroneously call brelse with a NULL bp under rare
2600 * error conditions. Simply return when called with a NULL bp.
2604 CTR3(KTR_BUF, "brelse(%p) vp %p flags %X",
2605 bp, bp->b_vp, bp->b_flags);
2606 KASSERT(!(bp->b_flags & (B_CLUSTER|B_PAGING)),
2607 ("brelse: inappropriate B_PAGING or B_CLUSTER bp %p", bp));
2608 KASSERT((bp->b_flags & B_VMIO) != 0 || (bp->b_flags & B_NOREUSE) == 0,
2609 ("brelse: non-VMIO buffer marked NOREUSE"));
2611 if (BUF_LOCKRECURSED(bp)) {
2613 * Do not process, in particular, do not handle the
2614 * B_INVAL/B_RELBUF and do not release to free list.
2620 if (bp->b_flags & B_MANAGED) {
2625 if ((bp->b_vflags & (BV_BKGRDINPROG | BV_BKGRDERR)) == BV_BKGRDERR) {
2626 BO_LOCK(bp->b_bufobj);
2627 bp->b_vflags &= ~BV_BKGRDERR;
2628 BO_UNLOCK(bp->b_bufobj);
2632 if (bp->b_iocmd == BIO_WRITE && (bp->b_ioflags & BIO_ERROR) &&
2633 (bp->b_flags & B_INVALONERR)) {
2635 * Forced invalidation of dirty buffer contents, to be used
2636 * after a failed write in the rare case that the loss of the
2637 * contents is acceptable. The buffer is invalidated and
2640 bp->b_flags |= B_INVAL | B_RELBUF | B_NOCACHE;
2641 bp->b_flags &= ~(B_ASYNC | B_CACHE);
2644 if (bp->b_iocmd == BIO_WRITE && (bp->b_ioflags & BIO_ERROR) &&
2645 (bp->b_error != ENXIO || !LIST_EMPTY(&bp->b_dep)) &&
2646 !(bp->b_flags & B_INVAL)) {
2648 * Failed write, redirty. All errors except ENXIO (which
2649 * means the device is gone) are treated as being
2652 * XXX Treating EIO as transient is not correct; the
2653 * contract with the local storage device drivers is that
2654 * they will only return EIO once the I/O is no longer
2655 * retriable. Network I/O also respects this through the
2656 * guarantees of TCP and/or the internal retries of NFS.
2657 * ENOMEM might be transient, but we also have no way of
2658 * knowing when its ok to retry/reschedule. In general,
2659 * this entire case should be made obsolete through better
2660 * error handling/recovery and resource scheduling.
2662 * Do this also for buffers that failed with ENXIO, but have
2663 * non-empty dependencies - the soft updates code might need
2664 * to access the buffer to untangle them.
2666 * Must clear BIO_ERROR to prevent pages from being scrapped.
2668 bp->b_ioflags &= ~BIO_ERROR;
2670 } else if ((bp->b_flags & (B_NOCACHE | B_INVAL)) ||
2671 (bp->b_ioflags & BIO_ERROR) || (bp->b_bufsize <= 0)) {
2673 * Either a failed read I/O, or we were asked to free or not
2674 * cache the buffer, or we failed to write to a device that's
2675 * no longer present.
2677 bp->b_flags |= B_INVAL;
2678 if (!LIST_EMPTY(&bp->b_dep))
2680 if (bp->b_flags & B_DELWRI)
2682 bp->b_flags &= ~(B_DELWRI | B_CACHE);
2683 if ((bp->b_flags & B_VMIO) == 0) {
2691 * We must clear B_RELBUF if B_DELWRI is set. If vfs_vmio_truncate()
2692 * is called with B_DELWRI set, the underlying pages may wind up
2693 * getting freed causing a previous write (bdwrite()) to get 'lost'
2694 * because pages associated with a B_DELWRI bp are marked clean.
2696 * We still allow the B_INVAL case to call vfs_vmio_truncate(), even
2697 * if B_DELWRI is set.
2699 if (bp->b_flags & B_DELWRI)
2700 bp->b_flags &= ~B_RELBUF;
2703 * VMIO buffer rundown. It is not very necessary to keep a VMIO buffer
2704 * constituted, not even NFS buffers now. Two flags effect this. If
2705 * B_INVAL, the struct buf is invalidated but the VM object is kept
2706 * around ( i.e. so it is trivial to reconstitute the buffer later ).
2708 * If BIO_ERROR or B_NOCACHE is set, pages in the VM object will be
2709 * invalidated. BIO_ERROR cannot be set for a failed write unless the
2710 * buffer is also B_INVAL because it hits the re-dirtying code above.
2712 * Normally we can do this whether a buffer is B_DELWRI or not. If
2713 * the buffer is an NFS buffer, it is tracking piecemeal writes or
2714 * the commit state and we cannot afford to lose the buffer. If the
2715 * buffer has a background write in progress, we need to keep it
2716 * around to prevent it from being reconstituted and starting a second
2720 v_mnt = bp->b_vp != NULL ? bp->b_vp->v_mount : NULL;
2722 if ((bp->b_flags & B_VMIO) && (bp->b_flags & B_NOCACHE ||
2723 (bp->b_ioflags & BIO_ERROR && bp->b_iocmd == BIO_READ)) &&
2724 (v_mnt == NULL || (v_mnt->mnt_vfc->vfc_flags & VFCF_NETWORK) == 0 ||
2725 vn_isdisk(bp->b_vp, NULL) || (bp->b_flags & B_DELWRI) == 0)) {
2726 vfs_vmio_invalidate(bp);
2730 if ((bp->b_flags & (B_INVAL | B_RELBUF)) != 0 ||
2731 (bp->b_flags & (B_DELWRI | B_NOREUSE)) == B_NOREUSE) {
2733 bp->b_flags &= ~B_NOREUSE;
2734 if (bp->b_vp != NULL)
2739 * If the buffer has junk contents signal it and eventually
2740 * clean up B_DELWRI and diassociate the vnode so that gbincore()
2743 if (bp->b_bufsize == 0 || (bp->b_ioflags & BIO_ERROR) != 0 ||
2744 (bp->b_flags & (B_INVAL | B_NOCACHE | B_RELBUF)) != 0)
2745 bp->b_flags |= B_INVAL;
2746 if (bp->b_flags & B_INVAL) {
2747 if (bp->b_flags & B_DELWRI)
2753 buf_track(bp, __func__);
2755 /* buffers with no memory */
2756 if (bp->b_bufsize == 0) {
2760 /* buffers with junk contents */
2761 if (bp->b_flags & (B_INVAL | B_NOCACHE | B_RELBUF) ||
2762 (bp->b_ioflags & BIO_ERROR)) {
2763 bp->b_xflags &= ~(BX_BKGRDWRITE | BX_ALTDATA);
2764 if (bp->b_vflags & BV_BKGRDINPROG)
2765 panic("losing buffer 2");
2766 qindex = QUEUE_CLEAN;
2767 bp->b_flags |= B_AGE;
2768 /* remaining buffers */
2769 } else if (bp->b_flags & B_DELWRI)
2770 qindex = QUEUE_DIRTY;
2772 qindex = QUEUE_CLEAN;
2774 if ((bp->b_flags & B_DELWRI) == 0 && (bp->b_xflags & BX_VNDIRTY))
2775 panic("brelse: not dirty");
2777 bp->b_flags &= ~(B_ASYNC | B_NOCACHE | B_RELBUF | B_DIRECT);
2778 bp->b_xflags &= ~(BX_CVTENXIO);
2779 /* binsfree unlocks bp. */
2780 binsfree(bp, qindex);
2784 * Release a buffer back to the appropriate queue but do not try to free
2785 * it. The buffer is expected to be used again soon.
2787 * bqrelse() is used by bdwrite() to requeue a delayed write, and used by
2788 * biodone() to requeue an async I/O on completion. It is also used when
2789 * known good buffers need to be requeued but we think we may need the data
2792 * XXX we should be able to leave the B_RELBUF hint set on completion.
2795 bqrelse(struct buf *bp)
2799 CTR3(KTR_BUF, "bqrelse(%p) vp %p flags %X", bp, bp->b_vp, bp->b_flags);
2800 KASSERT(!(bp->b_flags & (B_CLUSTER|B_PAGING)),
2801 ("bqrelse: inappropriate B_PAGING or B_CLUSTER bp %p", bp));
2803 qindex = QUEUE_NONE;
2804 if (BUF_LOCKRECURSED(bp)) {
2805 /* do not release to free list */
2809 bp->b_flags &= ~(B_ASYNC | B_NOCACHE | B_AGE | B_RELBUF);
2810 bp->b_xflags &= ~(BX_CVTENXIO);
2812 if (bp->b_flags & B_MANAGED) {
2813 if (bp->b_flags & B_REMFREE)
2818 /* buffers with stale but valid contents */
2819 if ((bp->b_flags & B_DELWRI) != 0 || (bp->b_vflags & (BV_BKGRDINPROG |
2820 BV_BKGRDERR)) == BV_BKGRDERR) {
2821 BO_LOCK(bp->b_bufobj);
2822 bp->b_vflags &= ~BV_BKGRDERR;
2823 BO_UNLOCK(bp->b_bufobj);
2824 qindex = QUEUE_DIRTY;
2826 if ((bp->b_flags & B_DELWRI) == 0 &&
2827 (bp->b_xflags & BX_VNDIRTY))
2828 panic("bqrelse: not dirty");
2829 if ((bp->b_flags & B_NOREUSE) != 0) {
2833 qindex = QUEUE_CLEAN;
2835 buf_track(bp, __func__);
2836 /* binsfree unlocks bp. */
2837 binsfree(bp, qindex);
2841 buf_track(bp, __func__);
2847 * Complete I/O to a VMIO backed page. Validate the pages as appropriate,
2848 * restore bogus pages.
2851 vfs_vmio_iodone(struct buf *bp)
2856 struct vnode *vp __unused;
2857 int i, iosize, resid;
2860 obj = bp->b_bufobj->bo_object;
2861 KASSERT(blockcount_read(&obj->paging_in_progress) >= bp->b_npages,
2862 ("vfs_vmio_iodone: paging in progress(%d) < b_npages(%d)",
2863 blockcount_read(&obj->paging_in_progress), bp->b_npages));
2866 VNPASS(vp->v_holdcnt > 0, vp);
2867 VNPASS(vp->v_object != NULL, vp);
2869 foff = bp->b_offset;
2870 KASSERT(bp->b_offset != NOOFFSET,
2871 ("vfs_vmio_iodone: bp %p has no buffer offset", bp));
2874 iosize = bp->b_bcount - bp->b_resid;
2875 for (i = 0; i < bp->b_npages; i++) {
2876 resid = ((foff + PAGE_SIZE) & ~(off_t)PAGE_MASK) - foff;
2881 * cleanup bogus pages, restoring the originals
2884 if (m == bogus_page) {
2886 m = vm_page_relookup(obj, OFF_TO_IDX(foff));
2888 panic("biodone: page disappeared!");
2890 } else if ((bp->b_iocmd == BIO_READ) && resid > 0) {
2892 * In the write case, the valid and clean bits are
2893 * already changed correctly ( see bdwrite() ), so we
2894 * only need to do this here in the read case.
2896 KASSERT((m->dirty & vm_page_bits(foff & PAGE_MASK,
2897 resid)) == 0, ("vfs_vmio_iodone: page %p "
2898 "has unexpected dirty bits", m));
2899 vfs_page_set_valid(bp, foff, m);
2901 KASSERT(OFF_TO_IDX(foff) == m->pindex,
2902 ("vfs_vmio_iodone: foff(%jd)/pindex(%ju) mismatch",
2903 (intmax_t)foff, (uintmax_t)m->pindex));
2906 foff = (foff + PAGE_SIZE) & ~(off_t)PAGE_MASK;
2909 vm_object_pip_wakeupn(obj, bp->b_npages);
2910 if (bogus && buf_mapped(bp)) {
2911 BUF_CHECK_MAPPED(bp);
2912 pmap_qenter(trunc_page((vm_offset_t)bp->b_data),
2913 bp->b_pages, bp->b_npages);
2918 * Perform page invalidation when a buffer is released. The fully invalid
2919 * pages will be reclaimed later in vfs_vmio_truncate().
2922 vfs_vmio_invalidate(struct buf *bp)
2926 int flags, i, resid, poffset, presid;
2928 if (buf_mapped(bp)) {
2929 BUF_CHECK_MAPPED(bp);
2930 pmap_qremove(trunc_page((vm_offset_t)bp->b_data), bp->b_npages);
2932 BUF_CHECK_UNMAPPED(bp);
2934 * Get the base offset and length of the buffer. Note that
2935 * in the VMIO case if the buffer block size is not
2936 * page-aligned then b_data pointer may not be page-aligned.
2937 * But our b_pages[] array *IS* page aligned.
2939 * block sizes less then DEV_BSIZE (usually 512) are not
2940 * supported due to the page granularity bits (m->valid,
2941 * m->dirty, etc...).
2943 * See man buf(9) for more information
2945 flags = (bp->b_flags & B_NOREUSE) != 0 ? VPR_NOREUSE : 0;
2946 obj = bp->b_bufobj->bo_object;
2947 resid = bp->b_bufsize;
2948 poffset = bp->b_offset & PAGE_MASK;
2949 VM_OBJECT_WLOCK(obj);
2950 for (i = 0; i < bp->b_npages; i++) {
2952 if (m == bogus_page)
2953 panic("vfs_vmio_invalidate: Unexpected bogus page.");
2954 bp->b_pages[i] = NULL;
2956 presid = resid > (PAGE_SIZE - poffset) ?
2957 (PAGE_SIZE - poffset) : resid;
2958 KASSERT(presid >= 0, ("brelse: extra page"));
2959 vm_page_busy_acquire(m, VM_ALLOC_SBUSY);
2960 if (pmap_page_wired_mappings(m) == 0)
2961 vm_page_set_invalid(m, poffset, presid);
2963 vm_page_release_locked(m, flags);
2967 VM_OBJECT_WUNLOCK(obj);
2972 * Page-granular truncation of an existing VMIO buffer.
2975 vfs_vmio_truncate(struct buf *bp, int desiredpages)
2981 if (bp->b_npages == desiredpages)
2984 if (buf_mapped(bp)) {
2985 BUF_CHECK_MAPPED(bp);
2986 pmap_qremove((vm_offset_t)trunc_page((vm_offset_t)bp->b_data) +
2987 (desiredpages << PAGE_SHIFT), bp->b_npages - desiredpages);
2989 BUF_CHECK_UNMAPPED(bp);
2992 * The object lock is needed only if we will attempt to free pages.
2994 flags = (bp->b_flags & B_NOREUSE) != 0 ? VPR_NOREUSE : 0;
2995 if ((bp->b_flags & B_DIRECT) != 0) {
2996 flags |= VPR_TRYFREE;
2997 obj = bp->b_bufobj->bo_object;
2998 VM_OBJECT_WLOCK(obj);
3002 for (i = desiredpages; i < bp->b_npages; i++) {
3004 KASSERT(m != bogus_page, ("allocbuf: bogus page found"));
3005 bp->b_pages[i] = NULL;
3007 vm_page_release_locked(m, flags);
3009 vm_page_release(m, flags);
3012 VM_OBJECT_WUNLOCK(obj);
3013 bp->b_npages = desiredpages;
3017 * Byte granular extension of VMIO buffers.
3020 vfs_vmio_extend(struct buf *bp, int desiredpages, int size)
3023 * We are growing the buffer, possibly in a
3024 * byte-granular fashion.
3032 * Step 1, bring in the VM pages from the object, allocating
3033 * them if necessary. We must clear B_CACHE if these pages
3034 * are not valid for the range covered by the buffer.
3036 obj = bp->b_bufobj->bo_object;
3037 if (bp->b_npages < desiredpages) {
3039 * We must allocate system pages since blocking
3040 * here could interfere with paging I/O, no
3041 * matter which process we are.
3043 * Only exclusive busy can be tested here.
3044 * Blocking on shared busy might lead to
3045 * deadlocks once allocbuf() is called after
3046 * pages are vfs_busy_pages().
3048 (void)vm_page_grab_pages_unlocked(obj,
3049 OFF_TO_IDX(bp->b_offset) + bp->b_npages,
3050 VM_ALLOC_SYSTEM | VM_ALLOC_IGN_SBUSY |
3051 VM_ALLOC_NOBUSY | VM_ALLOC_WIRED,
3052 &bp->b_pages[bp->b_npages], desiredpages - bp->b_npages);
3053 bp->b_npages = desiredpages;
3057 * Step 2. We've loaded the pages into the buffer,
3058 * we have to figure out if we can still have B_CACHE
3059 * set. Note that B_CACHE is set according to the
3060 * byte-granular range ( bcount and size ), not the
3061 * aligned range ( newbsize ).
3063 * The VM test is against m->valid, which is DEV_BSIZE
3064 * aligned. Needless to say, the validity of the data
3065 * needs to also be DEV_BSIZE aligned. Note that this
3066 * fails with NFS if the server or some other client
3067 * extends the file's EOF. If our buffer is resized,
3068 * B_CACHE may remain set! XXX
3070 toff = bp->b_bcount;
3071 tinc = PAGE_SIZE - ((bp->b_offset + toff) & PAGE_MASK);
3072 while ((bp->b_flags & B_CACHE) && toff < size) {
3075 if (tinc > (size - toff))
3077 pi = ((bp->b_offset & PAGE_MASK) + toff) >> PAGE_SHIFT;
3078 m = bp->b_pages[pi];
3079 vfs_buf_test_cache(bp, bp->b_offset, toff, tinc, m);
3085 * Step 3, fixup the KVA pmap.
3090 BUF_CHECK_UNMAPPED(bp);
3094 * Check to see if a block at a particular lbn is available for a clustered
3098 vfs_bio_clcheck(struct vnode *vp, int size, daddr_t lblkno, daddr_t blkno)
3105 /* If the buf isn't in core skip it */
3106 if ((bpa = gbincore(&vp->v_bufobj, lblkno)) == NULL)
3109 /* If the buf is busy we don't want to wait for it */
3110 if (BUF_LOCK(bpa, LK_EXCLUSIVE | LK_NOWAIT, NULL) != 0)
3113 /* Only cluster with valid clusterable delayed write buffers */
3114 if ((bpa->b_flags & (B_DELWRI | B_CLUSTEROK | B_INVAL)) !=
3115 (B_DELWRI | B_CLUSTEROK))
3118 if (bpa->b_bufsize != size)
3122 * Check to see if it is in the expected place on disk and that the
3123 * block has been mapped.
3125 if ((bpa->b_blkno != bpa->b_lblkno) && (bpa->b_blkno == blkno))
3135 * Implement clustered async writes for clearing out B_DELWRI buffers.
3136 * This is much better then the old way of writing only one buffer at
3137 * a time. Note that we may not be presented with the buffers in the
3138 * correct order, so we search for the cluster in both directions.
3141 vfs_bio_awrite(struct buf *bp)
3146 daddr_t lblkno = bp->b_lblkno;
3147 struct vnode *vp = bp->b_vp;
3155 gbflags = (bp->b_data == unmapped_buf) ? GB_UNMAPPED : 0;
3157 * right now we support clustered writing only to regular files. If
3158 * we find a clusterable block we could be in the middle of a cluster
3159 * rather then at the beginning.
3161 if ((vp->v_type == VREG) &&
3162 (vp->v_mount != 0) && /* Only on nodes that have the size info */
3163 (bp->b_flags & (B_CLUSTEROK | B_INVAL)) == B_CLUSTEROK) {
3165 size = vp->v_mount->mnt_stat.f_iosize;
3166 maxcl = MAXPHYS / size;
3169 for (i = 1; i < maxcl; i++)
3170 if (vfs_bio_clcheck(vp, size, lblkno + i,
3171 bp->b_blkno + ((i * size) >> DEV_BSHIFT)) == 0)
3174 for (j = 1; i + j <= maxcl && j <= lblkno; j++)
3175 if (vfs_bio_clcheck(vp, size, lblkno - j,
3176 bp->b_blkno - ((j * size) >> DEV_BSHIFT)) == 0)
3182 * this is a possible cluster write
3186 nwritten = cluster_wbuild(vp, size, lblkno - j, ncl,
3192 bp->b_flags |= B_ASYNC;
3194 * default (old) behavior, writing out only one block
3196 * XXX returns b_bufsize instead of b_bcount for nwritten?
3198 nwritten = bp->b_bufsize;
3207 * Allocate KVA for an empty buf header according to gbflags.
3210 getnewbuf_kva(struct buf *bp, int gbflags, int maxsize)
3213 if ((gbflags & (GB_UNMAPPED | GB_KVAALLOC)) != GB_UNMAPPED) {
3215 * In order to keep fragmentation sane we only allocate kva
3216 * in BKVASIZE chunks. XXX with vmem we can do page size.
3218 maxsize = (maxsize + BKVAMASK) & ~BKVAMASK;
3220 if (maxsize != bp->b_kvasize &&
3221 bufkva_alloc(bp, maxsize, gbflags))
3230 * Find and initialize a new buffer header, freeing up existing buffers
3231 * in the bufqueues as necessary. The new buffer is returned locked.
3234 * We have insufficient buffer headers
3235 * We have insufficient buffer space
3236 * buffer_arena is too fragmented ( space reservation fails )
3237 * If we have to flush dirty buffers ( but we try to avoid this )
3239 * The caller is responsible for releasing the reserved bufspace after
3240 * allocbuf() is called.
3243 getnewbuf(struct vnode *vp, int slpflag, int slptimeo, int maxsize, int gbflags)
3245 struct bufdomain *bd;
3247 bool metadata, reserved;
3250 KASSERT((gbflags & (GB_UNMAPPED | GB_KVAALLOC)) != GB_KVAALLOC,
3251 ("GB_KVAALLOC only makes sense with GB_UNMAPPED"));
3252 if (!unmapped_buf_allowed)
3253 gbflags &= ~(GB_UNMAPPED | GB_KVAALLOC);
3255 if (vp == NULL || (vp->v_vflag & (VV_MD | VV_SYSTEM)) != 0 ||
3263 bd = &bdomain[vp->v_bufobj.bo_domain];
3265 counter_u64_add(getnewbufcalls, 1);
3268 if (reserved == false &&
3269 bufspace_reserve(bd, maxsize, metadata) != 0) {
3270 counter_u64_add(getnewbufrestarts, 1);
3274 if ((bp = buf_alloc(bd)) == NULL) {
3275 counter_u64_add(getnewbufrestarts, 1);
3278 if (getnewbuf_kva(bp, gbflags, maxsize) == 0)
3281 } while (buf_recycle(bd, false) == 0);
3284 bufspace_release(bd, maxsize);
3286 bp->b_flags |= B_INVAL;
3289 bufspace_wait(bd, vp, gbflags, slpflag, slptimeo);
3297 * buffer flushing daemon. Buffers are normally flushed by the
3298 * update daemon but if it cannot keep up this process starts to
3299 * take the load in an attempt to prevent getnewbuf() from blocking.
3301 static struct kproc_desc buf_kp = {
3306 SYSINIT(bufdaemon, SI_SUB_KTHREAD_BUF, SI_ORDER_FIRST, kproc_start, &buf_kp);
3309 buf_flush(struct vnode *vp, struct bufdomain *bd, int target)
3313 flushed = flushbufqueues(vp, bd, target, 0);
3316 * Could not find any buffers without rollback
3317 * dependencies, so just write the first one
3318 * in the hopes of eventually making progress.
3320 if (vp != NULL && target > 2)
3322 flushbufqueues(vp, bd, target, 1);
3330 struct bufdomain *bd;
3336 * This process needs to be suspended prior to shutdown sync.
3338 EVENTHANDLER_REGISTER(shutdown_pre_sync, kthread_shutdown, curthread,
3339 SHUTDOWN_PRI_LAST + 100);
3342 * Start the buf clean daemons as children threads.
3344 for (i = 0 ; i < buf_domains; i++) {
3347 error = kthread_add((void (*)(void *))bufspace_daemon,
3348 &bdomain[i], curproc, NULL, 0, 0, "bufspacedaemon-%d", i);
3350 panic("error %d spawning bufspace daemon", error);
3354 * This process is allowed to take the buffer cache to the limit
3356 curthread->td_pflags |= TDP_NORUNNINGBUF | TDP_BUFNEED;
3360 mtx_unlock(&bdlock);
3362 kthread_suspend_check();
3365 * Save speedupreq for this pass and reset to capture new
3368 speedupreq = bd_speedupreq;
3372 * Flush each domain sequentially according to its level and
3373 * the speedup request.
3375 for (i = 0; i < buf_domains; i++) {
3378 lodirty = bd->bd_numdirtybuffers / 2;
3380 lodirty = bd->bd_lodirtybuffers;
3381 while (bd->bd_numdirtybuffers > lodirty) {
3382 if (buf_flush(NULL, bd,
3383 bd->bd_numdirtybuffers - lodirty) == 0)
3385 kern_yield(PRI_USER);
3390 * Only clear bd_request if we have reached our low water
3391 * mark. The buf_daemon normally waits 1 second and
3392 * then incrementally flushes any dirty buffers that have
3393 * built up, within reason.
3395 * If we were unable to hit our low water mark and couldn't
3396 * find any flushable buffers, we sleep for a short period
3397 * to avoid endless loops on unlockable buffers.
3400 if (!BIT_EMPTY(BUF_DOMAINS, &bdlodirty)) {
3402 * We reached our low water mark, reset the
3403 * request and sleep until we are needed again.
3404 * The sleep is just so the suspend code works.
3408 * Do an extra wakeup in case dirty threshold
3409 * changed via sysctl and the explicit transition
3410 * out of shortfall was missed.
3413 if (runningbufspace <= lorunningspace)
3415 msleep(&bd_request, &bdlock, PVM, "psleep", hz);
3418 * We couldn't find any flushable dirty buffers but
3419 * still have too many dirty buffers, we
3420 * have to sleep and try again. (rare)
3422 msleep(&bd_request, &bdlock, PVM, "qsleep", hz / 10);
3430 * Try to flush a buffer in the dirty queue. We must be careful to
3431 * free up B_INVAL buffers instead of write them, which NFS is
3432 * particularly sensitive to.
3434 static int flushwithdeps = 0;
3435 SYSCTL_INT(_vfs, OID_AUTO, flushwithdeps, CTLFLAG_RW | CTLFLAG_STATS,
3437 "Number of buffers flushed with dependecies that require rollbacks");
3440 flushbufqueues(struct vnode *lvp, struct bufdomain *bd, int target,
3443 struct bufqueue *bq;
3444 struct buf *sentinel;
3454 bq = &bd->bd_dirtyq;
3456 sentinel = malloc(sizeof(struct buf), M_TEMP, M_WAITOK | M_ZERO);
3457 sentinel->b_qindex = QUEUE_SENTINEL;
3459 TAILQ_INSERT_HEAD(&bq->bq_queue, sentinel, b_freelist);
3461 while (flushed != target) {
3464 bp = TAILQ_NEXT(sentinel, b_freelist);
3466 TAILQ_REMOVE(&bq->bq_queue, sentinel, b_freelist);
3467 TAILQ_INSERT_AFTER(&bq->bq_queue, bp, sentinel,
3474 * Skip sentinels inserted by other invocations of the
3475 * flushbufqueues(), taking care to not reorder them.
3477 * Only flush the buffers that belong to the
3478 * vnode locked by the curthread.
3480 if (bp->b_qindex == QUEUE_SENTINEL || (lvp != NULL &&
3485 error = BUF_LOCK(bp, LK_EXCLUSIVE | LK_NOWAIT, NULL);
3491 * BKGRDINPROG can only be set with the buf and bufobj
3492 * locks both held. We tolerate a race to clear it here.
3494 if ((bp->b_vflags & BV_BKGRDINPROG) != 0 ||
3495 (bp->b_flags & B_DELWRI) == 0) {
3499 if (bp->b_flags & B_INVAL) {
3506 if (!LIST_EMPTY(&bp->b_dep) && buf_countdeps(bp, 0)) {
3507 if (flushdeps == 0) {
3515 * We must hold the lock on a vnode before writing
3516 * one of its buffers. Otherwise we may confuse, or
3517 * in the case of a snapshot vnode, deadlock the
3520 * The lock order here is the reverse of the normal
3521 * of vnode followed by buf lock. This is ok because
3522 * the NOWAIT will prevent deadlock.
3525 if (vn_start_write(vp, &mp, V_NOWAIT) != 0) {
3531 error = vn_lock(vp, LK_EXCLUSIVE | LK_NOWAIT);
3533 ASSERT_VOP_LOCKED(vp, "getbuf");
3535 error = VOP_ISLOCKED(vp) == LK_EXCLUSIVE ? 0 :
3536 vn_lock(vp, LK_TRYUPGRADE);
3539 CTR3(KTR_BUF, "flushbufqueue(%p) vp %p flags %X",
3540 bp, bp->b_vp, bp->b_flags);
3541 if (curproc == bufdaemonproc) {
3546 counter_u64_add(notbufdflushes, 1);
3548 vn_finished_write(mp);
3551 flushwithdeps += hasdeps;
3555 * Sleeping on runningbufspace while holding
3556 * vnode lock leads to deadlock.
3558 if (curproc == bufdaemonproc &&
3559 runningbufspace > hirunningspace)
3560 waitrunningbufspace();
3563 vn_finished_write(mp);
3567 TAILQ_REMOVE(&bq->bq_queue, sentinel, b_freelist);
3569 free(sentinel, M_TEMP);
3574 * Check to see if a block is currently memory resident.
3577 incore(struct bufobj *bo, daddr_t blkno)
3582 bp = gbincore(bo, blkno);
3588 * Returns true if no I/O is needed to access the
3589 * associated VM object. This is like incore except
3590 * it also hunts around in the VM system for the data.
3594 inmem(struct vnode * vp, daddr_t blkno)
3597 vm_offset_t toff, tinc, size;
3601 ASSERT_VOP_LOCKED(vp, "inmem");
3603 if (incore(&vp->v_bufobj, blkno))
3605 if (vp->v_mount == NULL)
3612 if (size > vp->v_mount->mnt_stat.f_iosize)
3613 size = vp->v_mount->mnt_stat.f_iosize;
3614 off = (vm_ooffset_t)blkno * (vm_ooffset_t)vp->v_mount->mnt_stat.f_iosize;
3616 VM_OBJECT_RLOCK(obj);
3617 for (toff = 0; toff < vp->v_mount->mnt_stat.f_iosize; toff += tinc) {
3618 m = vm_page_lookup(obj, OFF_TO_IDX(off + toff));
3622 if (tinc > PAGE_SIZE - ((toff + off) & PAGE_MASK))
3623 tinc = PAGE_SIZE - ((toff + off) & PAGE_MASK);
3624 if (vm_page_is_valid(m,
3625 (vm_offset_t) ((toff + off) & PAGE_MASK), tinc) == 0)
3628 VM_OBJECT_RUNLOCK(obj);
3632 VM_OBJECT_RUNLOCK(obj);
3637 * Set the dirty range for a buffer based on the status of the dirty
3638 * bits in the pages comprising the buffer. The range is limited
3639 * to the size of the buffer.
3641 * Tell the VM system that the pages associated with this buffer
3642 * are clean. This is used for delayed writes where the data is
3643 * going to go to disk eventually without additional VM intevention.
3645 * Note that while we only really need to clean through to b_bcount, we
3646 * just go ahead and clean through to b_bufsize.
3649 vfs_clean_pages_dirty_buf(struct buf *bp)
3651 vm_ooffset_t foff, noff, eoff;
3655 if ((bp->b_flags & B_VMIO) == 0 || bp->b_bufsize == 0)
3658 foff = bp->b_offset;
3659 KASSERT(bp->b_offset != NOOFFSET,
3660 ("vfs_clean_pages_dirty_buf: no buffer offset"));
3662 vfs_busy_pages_acquire(bp);
3663 vfs_setdirty_range(bp);
3664 for (i = 0; i < bp->b_npages; i++) {
3665 noff = (foff + PAGE_SIZE) & ~(off_t)PAGE_MASK;
3667 if (eoff > bp->b_offset + bp->b_bufsize)
3668 eoff = bp->b_offset + bp->b_bufsize;
3670 vfs_page_set_validclean(bp, foff, m);
3671 /* vm_page_clear_dirty(m, foff & PAGE_MASK, eoff - foff); */
3674 vfs_busy_pages_release(bp);
3678 vfs_setdirty_range(struct buf *bp)
3680 vm_offset_t boffset;
3681 vm_offset_t eoffset;
3685 * test the pages to see if they have been modified directly
3686 * by users through the VM system.
3688 for (i = 0; i < bp->b_npages; i++)
3689 vm_page_test_dirty(bp->b_pages[i]);
3692 * Calculate the encompassing dirty range, boffset and eoffset,
3693 * (eoffset - boffset) bytes.
3696 for (i = 0; i < bp->b_npages; i++) {
3697 if (bp->b_pages[i]->dirty)
3700 boffset = (i << PAGE_SHIFT) - (bp->b_offset & PAGE_MASK);
3702 for (i = bp->b_npages - 1; i >= 0; --i) {
3703 if (bp->b_pages[i]->dirty) {
3707 eoffset = ((i + 1) << PAGE_SHIFT) - (bp->b_offset & PAGE_MASK);
3710 * Fit it to the buffer.
3713 if (eoffset > bp->b_bcount)
3714 eoffset = bp->b_bcount;
3717 * If we have a good dirty range, merge with the existing
3721 if (boffset < eoffset) {
3722 if (bp->b_dirtyoff > boffset)
3723 bp->b_dirtyoff = boffset;
3724 if (bp->b_dirtyend < eoffset)
3725 bp->b_dirtyend = eoffset;
3730 * Allocate the KVA mapping for an existing buffer.
3731 * If an unmapped buffer is provided but a mapped buffer is requested, take
3732 * also care to properly setup mappings between pages and KVA.
3735 bp_unmapped_get_kva(struct buf *bp, daddr_t blkno, int size, int gbflags)
3737 int bsize, maxsize, need_mapping, need_kva;
3740 need_mapping = bp->b_data == unmapped_buf &&
3741 (gbflags & GB_UNMAPPED) == 0;
3742 need_kva = bp->b_kvabase == unmapped_buf &&
3743 bp->b_data == unmapped_buf &&
3744 (gbflags & GB_KVAALLOC) != 0;
3745 if (!need_mapping && !need_kva)
3748 BUF_CHECK_UNMAPPED(bp);
3750 if (need_mapping && bp->b_kvabase != unmapped_buf) {
3752 * Buffer is not mapped, but the KVA was already
3753 * reserved at the time of the instantiation. Use the
3760 * Calculate the amount of the address space we would reserve
3761 * if the buffer was mapped.
3763 bsize = vn_isdisk(bp->b_vp, NULL) ? DEV_BSIZE : bp->b_bufobj->bo_bsize;
3764 KASSERT(bsize != 0, ("bsize == 0, check bo->bo_bsize"));
3765 offset = blkno * bsize;
3766 maxsize = size + (offset & PAGE_MASK);
3767 maxsize = imax(maxsize, bsize);
3769 while (bufkva_alloc(bp, maxsize, gbflags) != 0) {
3770 if ((gbflags & GB_NOWAIT_BD) != 0) {
3772 * XXXKIB: defragmentation cannot
3773 * succeed, not sure what else to do.
3775 panic("GB_NOWAIT_BD and GB_UNMAPPED %p", bp);
3777 counter_u64_add(mappingrestarts, 1);
3778 bufspace_wait(bufdomain(bp), bp->b_vp, gbflags, 0, 0);
3782 /* b_offset is handled by bpmap_qenter. */
3783 bp->b_data = bp->b_kvabase;
3784 BUF_CHECK_MAPPED(bp);
3790 getblk(struct vnode *vp, daddr_t blkno, int size, int slpflag, int slptimeo,
3796 error = getblkx(vp, blkno, blkno, size, slpflag, slptimeo, flags, &bp);
3805 * Get a block given a specified block and offset into a file/device.
3806 * The buffers B_DONE bit will be cleared on return, making it almost
3807 * ready for an I/O initiation. B_INVAL may or may not be set on
3808 * return. The caller should clear B_INVAL prior to initiating a
3811 * For a non-VMIO buffer, B_CACHE is set to the opposite of B_INVAL for
3812 * an existing buffer.
3814 * For a VMIO buffer, B_CACHE is modified according to the backing VM.
3815 * If getblk()ing a previously 0-sized invalid buffer, B_CACHE is set
3816 * and then cleared based on the backing VM. If the previous buffer is
3817 * non-0-sized but invalid, B_CACHE will be cleared.
3819 * If getblk() must create a new buffer, the new buffer is returned with
3820 * both B_INVAL and B_CACHE clear unless it is a VMIO buffer, in which
3821 * case it is returned with B_INVAL clear and B_CACHE set based on the
3824 * getblk() also forces a bwrite() for any B_DELWRI buffer whose
3825 * B_CACHE bit is clear.
3827 * What this means, basically, is that the caller should use B_CACHE to
3828 * determine whether the buffer is fully valid or not and should clear
3829 * B_INVAL prior to issuing a read. If the caller intends to validate
3830 * the buffer by loading its data area with something, the caller needs
3831 * to clear B_INVAL. If the caller does this without issuing an I/O,
3832 * the caller should set B_CACHE ( as an optimization ), else the caller
3833 * should issue the I/O and biodone() will set B_CACHE if the I/O was
3834 * a write attempt or if it was a successful read. If the caller
3835 * intends to issue a READ, the caller must clear B_INVAL and BIO_ERROR
3836 * prior to issuing the READ. biodone() will *not* clear B_INVAL.
3838 * The blkno parameter is the logical block being requested. Normally
3839 * the mapping of logical block number to disk block address is done
3840 * by calling VOP_BMAP(). However, if the mapping is already known, the
3841 * disk block address can be passed using the dblkno parameter. If the
3842 * disk block address is not known, then the same value should be passed
3843 * for blkno and dblkno.
3846 getblkx(struct vnode *vp, daddr_t blkno, daddr_t dblkno, int size, int slpflag,
3847 int slptimeo, int flags, struct buf **bpp)
3852 int bsize, error, maxsize, vmio;
3855 CTR3(KTR_BUF, "getblk(%p, %ld, %d)", vp, (long)blkno, size);
3856 KASSERT((flags & (GB_UNMAPPED | GB_KVAALLOC)) != GB_KVAALLOC,
3857 ("GB_KVAALLOC only makes sense with GB_UNMAPPED"));
3858 ASSERT_VOP_LOCKED(vp, "getblk");
3859 if (size > maxbcachebuf)
3860 panic("getblk: size(%d) > maxbcachebuf(%d)\n", size,
3862 if (!unmapped_buf_allowed)
3863 flags &= ~(GB_UNMAPPED | GB_KVAALLOC);
3869 bp = gbincore(bo, blkno);
3873 * Buffer is in-core. If the buffer is not busy nor managed,
3874 * it must be on a queue.
3876 lockflags = LK_EXCLUSIVE | LK_SLEEPFAIL | LK_INTERLOCK;
3878 if ((flags & GB_LOCK_NOWAIT) != 0)
3879 lockflags |= LK_NOWAIT;
3881 error = BUF_TIMELOCK(bp, lockflags,
3882 BO_LOCKPTR(bo), "getblk", slpflag, slptimeo);
3885 * If we slept and got the lock we have to restart in case
3886 * the buffer changed identities.
3888 if (error == ENOLCK)
3890 /* We timed out or were interrupted. */
3891 else if (error != 0)
3893 /* If recursed, assume caller knows the rules. */
3894 else if (BUF_LOCKRECURSED(bp))
3898 * The buffer is locked. B_CACHE is cleared if the buffer is
3899 * invalid. Otherwise, for a non-VMIO buffer, B_CACHE is set
3900 * and for a VMIO buffer B_CACHE is adjusted according to the
3903 if (bp->b_flags & B_INVAL)
3904 bp->b_flags &= ~B_CACHE;
3905 else if ((bp->b_flags & (B_VMIO | B_INVAL)) == 0)
3906 bp->b_flags |= B_CACHE;
3907 if (bp->b_flags & B_MANAGED)
3908 MPASS(bp->b_qindex == QUEUE_NONE);
3913 * check for size inconsistencies for non-VMIO case.
3915 if (bp->b_bcount != size) {
3916 if ((bp->b_flags & B_VMIO) == 0 ||
3917 (size > bp->b_kvasize)) {
3918 if (bp->b_flags & B_DELWRI) {
3919 bp->b_flags |= B_NOCACHE;
3922 if (LIST_EMPTY(&bp->b_dep)) {
3923 bp->b_flags |= B_RELBUF;
3926 bp->b_flags |= B_NOCACHE;
3935 * Handle the case of unmapped buffer which should
3936 * become mapped, or the buffer for which KVA
3937 * reservation is requested.
3939 bp_unmapped_get_kva(bp, blkno, size, flags);
3942 * If the size is inconsistent in the VMIO case, we can resize
3943 * the buffer. This might lead to B_CACHE getting set or
3944 * cleared. If the size has not changed, B_CACHE remains
3945 * unchanged from its previous state.
3949 KASSERT(bp->b_offset != NOOFFSET,
3950 ("getblk: no buffer offset"));
3953 * A buffer with B_DELWRI set and B_CACHE clear must
3954 * be committed before we can return the buffer in
3955 * order to prevent the caller from issuing a read
3956 * ( due to B_CACHE not being set ) and overwriting
3959 * Most callers, including NFS and FFS, need this to
3960 * operate properly either because they assume they
3961 * can issue a read if B_CACHE is not set, or because
3962 * ( for example ) an uncached B_DELWRI might loop due
3963 * to softupdates re-dirtying the buffer. In the latter
3964 * case, B_CACHE is set after the first write completes,
3965 * preventing further loops.
3966 * NOTE! b*write() sets B_CACHE. If we cleared B_CACHE
3967 * above while extending the buffer, we cannot allow the
3968 * buffer to remain with B_CACHE set after the write
3969 * completes or it will represent a corrupt state. To
3970 * deal with this we set B_NOCACHE to scrap the buffer
3973 * We might be able to do something fancy, like setting
3974 * B_CACHE in bwrite() except if B_DELWRI is already set,
3975 * so the below call doesn't set B_CACHE, but that gets real
3976 * confusing. This is much easier.
3979 if ((bp->b_flags & (B_CACHE|B_DELWRI)) == B_DELWRI) {
3980 bp->b_flags |= B_NOCACHE;
3984 bp->b_flags &= ~B_DONE;
3987 * Buffer is not in-core, create new buffer. The buffer
3988 * returned by getnewbuf() is locked. Note that the returned
3989 * buffer is also considered valid (not marked B_INVAL).
3993 * If the user does not want us to create the buffer, bail out
3996 if (flags & GB_NOCREAT)
3999 bsize = vn_isdisk(vp, NULL) ? DEV_BSIZE : bo->bo_bsize;
4000 KASSERT(bsize != 0, ("bsize == 0, check bo->bo_bsize"));
4001 offset = blkno * bsize;
4002 vmio = vp->v_object != NULL;
4004 maxsize = size + (offset & PAGE_MASK);
4007 /* Do not allow non-VMIO notmapped buffers. */
4008 flags &= ~(GB_UNMAPPED | GB_KVAALLOC);
4010 maxsize = imax(maxsize, bsize);
4011 if ((flags & GB_NOSPARSE) != 0 && vmio &&
4012 !vn_isdisk(vp, NULL)) {
4013 error = VOP_BMAP(vp, blkno, NULL, &d_blkno, 0, 0);
4014 KASSERT(error != EOPNOTSUPP,
4015 ("GB_NOSPARSE from fs not supporting bmap, vp %p",
4020 return (EJUSTRETURN);
4023 bp = getnewbuf(vp, slpflag, slptimeo, maxsize, flags);
4025 if (slpflag || slptimeo)
4028 * XXX This is here until the sleep path is diagnosed
4029 * enough to work under very low memory conditions.
4031 * There's an issue on low memory, 4BSD+non-preempt
4032 * systems (eg MIPS routers with 32MB RAM) where buffer
4033 * exhaustion occurs without sleeping for buffer
4034 * reclaimation. This just sticks in a loop and
4035 * constantly attempts to allocate a buffer, which
4036 * hits exhaustion and tries to wakeup bufdaemon.
4037 * This never happens because we never yield.
4039 * The real solution is to identify and fix these cases
4040 * so we aren't effectively busy-waiting in a loop
4041 * until the reclaimation path has cycles to run.
4043 kern_yield(PRI_USER);
4048 * This code is used to make sure that a buffer is not
4049 * created while the getnewbuf routine is blocked.
4050 * This can be a problem whether the vnode is locked or not.
4051 * If the buffer is created out from under us, we have to
4052 * throw away the one we just created.
4054 * Note: this must occur before we associate the buffer
4055 * with the vp especially considering limitations in
4056 * the splay tree implementation when dealing with duplicate
4060 if (gbincore(bo, blkno)) {
4062 bp->b_flags |= B_INVAL;
4063 bufspace_release(bufdomain(bp), maxsize);
4069 * Insert the buffer into the hash, so that it can
4070 * be found by incore.
4072 bp->b_lblkno = blkno;
4073 bp->b_blkno = d_blkno;
4074 bp->b_offset = offset;
4079 * set B_VMIO bit. allocbuf() the buffer bigger. Since the
4080 * buffer size starts out as 0, B_CACHE will be set by
4081 * allocbuf() for the VMIO case prior to it testing the
4082 * backing store for validity.
4086 bp->b_flags |= B_VMIO;
4087 KASSERT(vp->v_object == bp->b_bufobj->bo_object,
4088 ("ARGH! different b_bufobj->bo_object %p %p %p\n",
4089 bp, vp->v_object, bp->b_bufobj->bo_object));
4091 bp->b_flags &= ~B_VMIO;
4092 KASSERT(bp->b_bufobj->bo_object == NULL,
4093 ("ARGH! has b_bufobj->bo_object %p %p\n",
4094 bp, bp->b_bufobj->bo_object));
4095 BUF_CHECK_MAPPED(bp);
4099 bufspace_release(bufdomain(bp), maxsize);
4100 bp->b_flags &= ~B_DONE;
4102 CTR4(KTR_BUF, "getblk(%p, %ld, %d) = %p", vp, (long)blkno, size, bp);
4104 buf_track(bp, __func__);
4105 KASSERT(bp->b_bufobj == bo,
4106 ("bp %p wrong b_bufobj %p should be %p", bp, bp->b_bufobj, bo));
4112 * Get an empty, disassociated buffer of given size. The buffer is initially
4116 geteblk(int size, int flags)
4121 maxsize = (size + BKVAMASK) & ~BKVAMASK;
4122 while ((bp = getnewbuf(NULL, 0, 0, maxsize, flags)) == NULL) {
4123 if ((flags & GB_NOWAIT_BD) &&
4124 (curthread->td_pflags & TDP_BUFNEED) != 0)
4128 bufspace_release(bufdomain(bp), maxsize);
4129 bp->b_flags |= B_INVAL; /* b_dep cleared by getnewbuf() */
4134 * Truncate the backing store for a non-vmio buffer.
4137 vfs_nonvmio_truncate(struct buf *bp, int newbsize)
4140 if (bp->b_flags & B_MALLOC) {
4142 * malloced buffers are not shrunk
4144 if (newbsize == 0) {
4145 bufmallocadjust(bp, 0);
4146 free(bp->b_data, M_BIOBUF);
4147 bp->b_data = bp->b_kvabase;
4148 bp->b_flags &= ~B_MALLOC;
4152 vm_hold_free_pages(bp, newbsize);
4153 bufspace_adjust(bp, newbsize);
4157 * Extend the backing for a non-VMIO buffer.
4160 vfs_nonvmio_extend(struct buf *bp, int newbsize)
4166 * We only use malloced memory on the first allocation.
4167 * and revert to page-allocated memory when the buffer
4170 * There is a potential smp race here that could lead
4171 * to bufmallocspace slightly passing the max. It
4172 * is probably extremely rare and not worth worrying
4175 if (bp->b_bufsize == 0 && newbsize <= PAGE_SIZE/2 &&
4176 bufmallocspace < maxbufmallocspace) {
4177 bp->b_data = malloc(newbsize, M_BIOBUF, M_WAITOK);
4178 bp->b_flags |= B_MALLOC;
4179 bufmallocadjust(bp, newbsize);
4184 * If the buffer is growing on its other-than-first
4185 * allocation then we revert to the page-allocation
4190 if (bp->b_flags & B_MALLOC) {
4191 origbuf = bp->b_data;
4192 origbufsize = bp->b_bufsize;
4193 bp->b_data = bp->b_kvabase;
4194 bufmallocadjust(bp, 0);
4195 bp->b_flags &= ~B_MALLOC;
4196 newbsize = round_page(newbsize);
4198 vm_hold_load_pages(bp, (vm_offset_t) bp->b_data + bp->b_bufsize,
4199 (vm_offset_t) bp->b_data + newbsize);
4200 if (origbuf != NULL) {
4201 bcopy(origbuf, bp->b_data, origbufsize);
4202 free(origbuf, M_BIOBUF);
4204 bufspace_adjust(bp, newbsize);
4208 * This code constitutes the buffer memory from either anonymous system
4209 * memory (in the case of non-VMIO operations) or from an associated
4210 * VM object (in the case of VMIO operations). This code is able to
4211 * resize a buffer up or down.
4213 * Note that this code is tricky, and has many complications to resolve
4214 * deadlock or inconsistent data situations. Tread lightly!!!
4215 * There are B_CACHE and B_DELWRI interactions that must be dealt with by
4216 * the caller. Calling this code willy nilly can result in the loss of data.
4218 * allocbuf() only adjusts B_CACHE for VMIO buffers. getblk() deals with
4219 * B_CACHE for the non-VMIO case.
4222 allocbuf(struct buf *bp, int size)
4226 if (bp->b_bcount == size)
4229 if (bp->b_kvasize != 0 && bp->b_kvasize < size)
4230 panic("allocbuf: buffer too small");
4232 newbsize = roundup2(size, DEV_BSIZE);
4233 if ((bp->b_flags & B_VMIO) == 0) {
4234 if ((bp->b_flags & B_MALLOC) == 0)
4235 newbsize = round_page(newbsize);
4237 * Just get anonymous memory from the kernel. Don't
4238 * mess with B_CACHE.
4240 if (newbsize < bp->b_bufsize)
4241 vfs_nonvmio_truncate(bp, newbsize);
4242 else if (newbsize > bp->b_bufsize)
4243 vfs_nonvmio_extend(bp, newbsize);
4247 desiredpages = (size == 0) ? 0 :
4248 num_pages((bp->b_offset & PAGE_MASK) + newbsize);
4250 if (bp->b_flags & B_MALLOC)
4251 panic("allocbuf: VMIO buffer can't be malloced");
4253 * Set B_CACHE initially if buffer is 0 length or will become
4256 if (size == 0 || bp->b_bufsize == 0)
4257 bp->b_flags |= B_CACHE;
4259 if (newbsize < bp->b_bufsize)
4260 vfs_vmio_truncate(bp, desiredpages);
4261 /* XXX This looks as if it should be newbsize > b_bufsize */
4262 else if (size > bp->b_bcount)
4263 vfs_vmio_extend(bp, desiredpages, size);
4264 bufspace_adjust(bp, newbsize);
4266 bp->b_bcount = size; /* requested buffer size. */
4270 extern int inflight_transient_maps;
4272 static struct bio_queue nondump_bios;
4275 biodone(struct bio *bp)
4278 void (*done)(struct bio *);
4279 vm_offset_t start, end;
4281 biotrack(bp, __func__);
4284 * Avoid completing I/O when dumping after a panic since that may
4285 * result in a deadlock in the filesystem or pager code. Note that
4286 * this doesn't affect dumps that were started manually since we aim
4287 * to keep the system usable after it has been resumed.
4289 if (__predict_false(dumping && SCHEDULER_STOPPED())) {
4290 TAILQ_INSERT_HEAD(&nondump_bios, bp, bio_queue);
4293 if ((bp->bio_flags & BIO_TRANSIENT_MAPPING) != 0) {
4294 bp->bio_flags &= ~BIO_TRANSIENT_MAPPING;
4295 bp->bio_flags |= BIO_UNMAPPED;
4296 start = trunc_page((vm_offset_t)bp->bio_data);
4297 end = round_page((vm_offset_t)bp->bio_data + bp->bio_length);
4298 bp->bio_data = unmapped_buf;
4299 pmap_qremove(start, atop(end - start));
4300 vmem_free(transient_arena, start, end - start);
4301 atomic_add_int(&inflight_transient_maps, -1);
4303 done = bp->bio_done;
4305 mtxp = mtx_pool_find(mtxpool_sleep, bp);
4307 bp->bio_flags |= BIO_DONE;
4315 * Wait for a BIO to finish.
4318 biowait(struct bio *bp, const char *wchan)
4322 mtxp = mtx_pool_find(mtxpool_sleep, bp);
4324 while ((bp->bio_flags & BIO_DONE) == 0)
4325 msleep(bp, mtxp, PRIBIO, wchan, 0);
4327 if (bp->bio_error != 0)
4328 return (bp->bio_error);
4329 if (!(bp->bio_flags & BIO_ERROR))
4335 biofinish(struct bio *bp, struct devstat *stat, int error)
4339 bp->bio_error = error;
4340 bp->bio_flags |= BIO_ERROR;
4343 devstat_end_transaction_bio(stat, bp);
4347 #if defined(BUF_TRACKING) || defined(FULL_BUF_TRACKING)
4349 biotrack_buf(struct bio *bp, const char *location)
4352 buf_track(bp->bio_track_bp, location);
4359 * Wait for buffer I/O completion, returning error status. The buffer
4360 * is left locked and B_DONE on return. B_EINTR is converted into an EINTR
4361 * error and cleared.
4364 bufwait(struct buf *bp)
4366 if (bp->b_iocmd == BIO_READ)
4367 bwait(bp, PRIBIO, "biord");
4369 bwait(bp, PRIBIO, "biowr");
4370 if (bp->b_flags & B_EINTR) {
4371 bp->b_flags &= ~B_EINTR;
4374 if (bp->b_ioflags & BIO_ERROR) {
4375 return (bp->b_error ? bp->b_error : EIO);
4384 * Finish I/O on a buffer, optionally calling a completion function.
4385 * This is usually called from an interrupt so process blocking is
4388 * biodone is also responsible for setting B_CACHE in a B_VMIO bp.
4389 * In a non-VMIO bp, B_CACHE will be set on the next getblk()
4390 * assuming B_INVAL is clear.
4392 * For the VMIO case, we set B_CACHE if the op was a read and no
4393 * read error occurred, or if the op was a write. B_CACHE is never
4394 * set if the buffer is invalid or otherwise uncacheable.
4396 * bufdone does not mess with B_INVAL, allowing the I/O routine or the
4397 * initiator to leave B_INVAL set to brelse the buffer out of existence
4398 * in the biodone routine.
4401 bufdone(struct buf *bp)
4403 struct bufobj *dropobj;
4404 void (*biodone)(struct buf *);
4406 buf_track(bp, __func__);
4407 CTR3(KTR_BUF, "bufdone(%p) vp %p flags %X", bp, bp->b_vp, bp->b_flags);
4410 KASSERT(!(bp->b_flags & B_DONE), ("biodone: bp %p already done", bp));
4412 runningbufwakeup(bp);
4413 if (bp->b_iocmd == BIO_WRITE)
4414 dropobj = bp->b_bufobj;
4415 /* call optional completion function if requested */
4416 if (bp->b_iodone != NULL) {
4417 biodone = bp->b_iodone;
4418 bp->b_iodone = NULL;
4421 bufobj_wdrop(dropobj);
4424 if (bp->b_flags & B_VMIO) {
4426 * Set B_CACHE if the op was a normal read and no error
4427 * occurred. B_CACHE is set for writes in the b*write()
4430 if (bp->b_iocmd == BIO_READ &&
4431 !(bp->b_flags & (B_INVAL|B_NOCACHE)) &&
4432 !(bp->b_ioflags & BIO_ERROR))
4433 bp->b_flags |= B_CACHE;
4434 vfs_vmio_iodone(bp);
4436 if (!LIST_EMPTY(&bp->b_dep))
4438 if ((bp->b_flags & B_CKHASH) != 0) {
4439 KASSERT(bp->b_iocmd == BIO_READ,
4440 ("bufdone: b_iocmd %d not BIO_READ", bp->b_iocmd));
4441 KASSERT(buf_mapped(bp), ("bufdone: bp %p not mapped", bp));
4442 (*bp->b_ckhashcalc)(bp);
4445 * For asynchronous completions, release the buffer now. The brelse
4446 * will do a wakeup there if necessary - so no need to do a wakeup
4447 * here in the async case. The sync case always needs to do a wakeup.
4449 if (bp->b_flags & B_ASYNC) {
4450 if ((bp->b_flags & (B_NOCACHE | B_INVAL | B_RELBUF)) ||
4451 (bp->b_ioflags & BIO_ERROR))
4458 bufobj_wdrop(dropobj);
4462 * This routine is called in lieu of iodone in the case of
4463 * incomplete I/O. This keeps the busy status for pages
4467 vfs_unbusy_pages(struct buf *bp)
4473 runningbufwakeup(bp);
4474 if (!(bp->b_flags & B_VMIO))
4477 obj = bp->b_bufobj->bo_object;
4478 for (i = 0; i < bp->b_npages; i++) {
4480 if (m == bogus_page) {
4481 m = vm_page_relookup(obj, OFF_TO_IDX(bp->b_offset) + i);
4483 panic("vfs_unbusy_pages: page missing\n");
4485 if (buf_mapped(bp)) {
4486 BUF_CHECK_MAPPED(bp);
4487 pmap_qenter(trunc_page((vm_offset_t)bp->b_data),
4488 bp->b_pages, bp->b_npages);
4490 BUF_CHECK_UNMAPPED(bp);
4494 vm_object_pip_wakeupn(obj, bp->b_npages);
4498 * vfs_page_set_valid:
4500 * Set the valid bits in a page based on the supplied offset. The
4501 * range is restricted to the buffer's size.
4503 * This routine is typically called after a read completes.
4506 vfs_page_set_valid(struct buf *bp, vm_ooffset_t off, vm_page_t m)
4511 * Compute the end offset, eoff, such that [off, eoff) does not span a
4512 * page boundary and eoff is not greater than the end of the buffer.
4513 * The end of the buffer, in this case, is our file EOF, not the
4514 * allocation size of the buffer.
4516 eoff = (off + PAGE_SIZE) & ~(vm_ooffset_t)PAGE_MASK;
4517 if (eoff > bp->b_offset + bp->b_bcount)
4518 eoff = bp->b_offset + bp->b_bcount;
4521 * Set valid range. This is typically the entire buffer and thus the
4525 vm_page_set_valid_range(m, off & PAGE_MASK, eoff - off);
4529 * vfs_page_set_validclean:
4531 * Set the valid bits and clear the dirty bits in a page based on the
4532 * supplied offset. The range is restricted to the buffer's size.
4535 vfs_page_set_validclean(struct buf *bp, vm_ooffset_t off, vm_page_t m)
4537 vm_ooffset_t soff, eoff;
4540 * Start and end offsets in buffer. eoff - soff may not cross a
4541 * page boundary or cross the end of the buffer. The end of the
4542 * buffer, in this case, is our file EOF, not the allocation size
4546 eoff = (off + PAGE_SIZE) & ~(off_t)PAGE_MASK;
4547 if (eoff > bp->b_offset + bp->b_bcount)
4548 eoff = bp->b_offset + bp->b_bcount;
4551 * Set valid range. This is typically the entire buffer and thus the
4555 vm_page_set_validclean(
4557 (vm_offset_t) (soff & PAGE_MASK),
4558 (vm_offset_t) (eoff - soff)
4564 * Acquire a shared busy on all pages in the buf.
4567 vfs_busy_pages_acquire(struct buf *bp)
4571 for (i = 0; i < bp->b_npages; i++)
4572 vm_page_busy_acquire(bp->b_pages[i], VM_ALLOC_SBUSY);
4576 vfs_busy_pages_release(struct buf *bp)
4580 for (i = 0; i < bp->b_npages; i++)
4581 vm_page_sunbusy(bp->b_pages[i]);
4585 * This routine is called before a device strategy routine.
4586 * It is used to tell the VM system that paging I/O is in
4587 * progress, and treat the pages associated with the buffer
4588 * almost as being exclusive busy. Also the object paging_in_progress
4589 * flag is handled to make sure that the object doesn't become
4592 * Since I/O has not been initiated yet, certain buffer flags
4593 * such as BIO_ERROR or B_INVAL may be in an inconsistent state
4594 * and should be ignored.
4597 vfs_busy_pages(struct buf *bp, int clear_modify)
4605 if (!(bp->b_flags & B_VMIO))
4608 obj = bp->b_bufobj->bo_object;
4609 foff = bp->b_offset;
4610 KASSERT(bp->b_offset != NOOFFSET,
4611 ("vfs_busy_pages: no buffer offset"));
4612 if ((bp->b_flags & B_CLUSTER) == 0) {
4613 vm_object_pip_add(obj, bp->b_npages);
4614 vfs_busy_pages_acquire(bp);
4616 if (bp->b_bufsize != 0)
4617 vfs_setdirty_range(bp);
4619 for (i = 0; i < bp->b_npages; i++) {
4621 vm_page_assert_sbusied(m);
4624 * When readying a buffer for a read ( i.e
4625 * clear_modify == 0 ), it is important to do
4626 * bogus_page replacement for valid pages in
4627 * partially instantiated buffers. Partially
4628 * instantiated buffers can, in turn, occur when
4629 * reconstituting a buffer from its VM backing store
4630 * base. We only have to do this if B_CACHE is
4631 * clear ( which causes the I/O to occur in the
4632 * first place ). The replacement prevents the read
4633 * I/O from overwriting potentially dirty VM-backed
4634 * pages. XXX bogus page replacement is, uh, bogus.
4635 * It may not work properly with small-block devices.
4636 * We need to find a better way.
4639 pmap_remove_write(m);
4640 vfs_page_set_validclean(bp, foff, m);
4641 } else if (vm_page_all_valid(m) &&
4642 (bp->b_flags & B_CACHE) == 0) {
4643 bp->b_pages[i] = bogus_page;
4646 foff = (foff + PAGE_SIZE) & ~(off_t)PAGE_MASK;
4648 if (bogus && buf_mapped(bp)) {
4649 BUF_CHECK_MAPPED(bp);
4650 pmap_qenter(trunc_page((vm_offset_t)bp->b_data),
4651 bp->b_pages, bp->b_npages);
4656 * vfs_bio_set_valid:
4658 * Set the range within the buffer to valid. The range is
4659 * relative to the beginning of the buffer, b_offset. Note that
4660 * b_offset itself may be offset from the beginning of the first
4664 vfs_bio_set_valid(struct buf *bp, int base, int size)
4669 if (!(bp->b_flags & B_VMIO))
4673 * Fixup base to be relative to beginning of first page.
4674 * Set initial n to be the maximum number of bytes in the
4675 * first page that can be validated.
4677 base += (bp->b_offset & PAGE_MASK);
4678 n = PAGE_SIZE - (base & PAGE_MASK);
4681 * Busy may not be strictly necessary here because the pages are
4682 * unlikely to be fully valid and the vnode lock will synchronize
4683 * their access via getpages. It is grabbed for consistency with
4684 * other page validation.
4686 vfs_busy_pages_acquire(bp);
4687 for (i = base / PAGE_SIZE; size > 0 && i < bp->b_npages; ++i) {
4691 vm_page_set_valid_range(m, base & PAGE_MASK, n);
4696 vfs_busy_pages_release(bp);
4702 * If the specified buffer is a non-VMIO buffer, clear the entire
4703 * buffer. If the specified buffer is a VMIO buffer, clear and
4704 * validate only the previously invalid portions of the buffer.
4705 * This routine essentially fakes an I/O, so we need to clear
4706 * BIO_ERROR and B_INVAL.
4708 * Note that while we only theoretically need to clear through b_bcount,
4709 * we go ahead and clear through b_bufsize.
4712 vfs_bio_clrbuf(struct buf *bp)
4714 int i, j, mask, sa, ea, slide;
4716 if ((bp->b_flags & (B_VMIO | B_MALLOC)) != B_VMIO) {
4720 bp->b_flags &= ~B_INVAL;
4721 bp->b_ioflags &= ~BIO_ERROR;
4722 vfs_busy_pages_acquire(bp);
4723 sa = bp->b_offset & PAGE_MASK;
4725 for (i = 0; i < bp->b_npages; i++, sa = 0) {
4726 slide = imin(slide + PAGE_SIZE, bp->b_offset + bp->b_bufsize);
4727 ea = slide & PAGE_MASK;
4730 if (bp->b_pages[i] == bogus_page)
4733 mask = ((1 << ((ea - sa) / DEV_BSIZE)) - 1) << j;
4734 if ((bp->b_pages[i]->valid & mask) == mask)
4736 if ((bp->b_pages[i]->valid & mask) == 0)
4737 pmap_zero_page_area(bp->b_pages[i], sa, ea - sa);
4739 for (; sa < ea; sa += DEV_BSIZE, j++) {
4740 if ((bp->b_pages[i]->valid & (1 << j)) == 0) {
4741 pmap_zero_page_area(bp->b_pages[i],
4746 vm_page_set_valid_range(bp->b_pages[i], j * DEV_BSIZE,
4747 roundup2(ea - sa, DEV_BSIZE));
4749 vfs_busy_pages_release(bp);
4754 vfs_bio_bzero_buf(struct buf *bp, int base, int size)
4759 if (buf_mapped(bp)) {
4760 BUF_CHECK_MAPPED(bp);
4761 bzero(bp->b_data + base, size);
4763 BUF_CHECK_UNMAPPED(bp);
4764 n = PAGE_SIZE - (base & PAGE_MASK);
4765 for (i = base / PAGE_SIZE; size > 0 && i < bp->b_npages; ++i) {
4769 pmap_zero_page_area(m, base & PAGE_MASK, n);
4778 * Update buffer flags based on I/O request parameters, optionally releasing the
4779 * buffer. If it's VMIO or direct I/O, the buffer pages are released to the VM,
4780 * where they may be placed on a page queue (VMIO) or freed immediately (direct
4781 * I/O). Otherwise the buffer is released to the cache.
4784 b_io_dismiss(struct buf *bp, int ioflag, bool release)
4787 KASSERT((ioflag & IO_NOREUSE) == 0 || (ioflag & IO_VMIO) != 0,
4788 ("buf %p non-VMIO noreuse", bp));
4790 if ((ioflag & IO_DIRECT) != 0)
4791 bp->b_flags |= B_DIRECT;
4792 if ((ioflag & IO_EXT) != 0)
4793 bp->b_xflags |= BX_ALTDATA;
4794 if ((ioflag & (IO_VMIO | IO_DIRECT)) != 0 && LIST_EMPTY(&bp->b_dep)) {
4795 bp->b_flags |= B_RELBUF;
4796 if ((ioflag & IO_NOREUSE) != 0)
4797 bp->b_flags |= B_NOREUSE;
4805 vfs_bio_brelse(struct buf *bp, int ioflag)
4808 b_io_dismiss(bp, ioflag, true);
4812 vfs_bio_set_flags(struct buf *bp, int ioflag)
4815 b_io_dismiss(bp, ioflag, false);
4819 * vm_hold_load_pages and vm_hold_free_pages get pages into
4820 * a buffers address space. The pages are anonymous and are
4821 * not associated with a file object.
4824 vm_hold_load_pages(struct buf *bp, vm_offset_t from, vm_offset_t to)
4830 BUF_CHECK_MAPPED(bp);
4832 to = round_page(to);
4833 from = round_page(from);
4834 index = (from - trunc_page((vm_offset_t)bp->b_data)) >> PAGE_SHIFT;
4836 for (pg = from; pg < to; pg += PAGE_SIZE, index++) {
4838 * note: must allocate system pages since blocking here
4839 * could interfere with paging I/O, no matter which
4842 p = vm_page_alloc(NULL, 0, VM_ALLOC_SYSTEM | VM_ALLOC_NOOBJ |
4843 VM_ALLOC_WIRED | VM_ALLOC_COUNT((to - pg) >> PAGE_SHIFT) |
4845 pmap_qenter(pg, &p, 1);
4846 bp->b_pages[index] = p;
4848 bp->b_npages = index;
4851 /* Return pages associated with this buf to the vm system */
4853 vm_hold_free_pages(struct buf *bp, int newbsize)
4857 int index, newnpages;
4859 BUF_CHECK_MAPPED(bp);
4861 from = round_page((vm_offset_t)bp->b_data + newbsize);
4862 newnpages = (from - trunc_page((vm_offset_t)bp->b_data)) >> PAGE_SHIFT;
4863 if (bp->b_npages > newnpages)
4864 pmap_qremove(from, bp->b_npages - newnpages);
4865 for (index = newnpages; index < bp->b_npages; index++) {
4866 p = bp->b_pages[index];
4867 bp->b_pages[index] = NULL;
4868 vm_page_unwire_noq(p);
4871 bp->b_npages = newnpages;
4875 * Map an IO request into kernel virtual address space.
4877 * All requests are (re)mapped into kernel VA space.
4878 * Notice that we use b_bufsize for the size of the buffer
4879 * to be mapped. b_bcount might be modified by the driver.
4881 * Note that even if the caller determines that the address space should
4882 * be valid, a race or a smaller-file mapped into a larger space may
4883 * actually cause vmapbuf() to fail, so all callers of vmapbuf() MUST
4884 * check the return value.
4886 * This function only works with pager buffers.
4889 vmapbuf(struct buf *bp, int mapbuf)
4894 if (bp->b_bufsize < 0)
4896 prot = VM_PROT_READ;
4897 if (bp->b_iocmd == BIO_READ)
4898 prot |= VM_PROT_WRITE; /* Less backwards than it looks */
4899 if ((pidx = vm_fault_quick_hold_pages(&curproc->p_vmspace->vm_map,
4900 (vm_offset_t)bp->b_data, bp->b_bufsize, prot, bp->b_pages,
4901 btoc(MAXPHYS))) < 0)
4903 bp->b_npages = pidx;
4904 bp->b_offset = ((vm_offset_t)bp->b_data) & PAGE_MASK;
4905 if (mapbuf || !unmapped_buf_allowed) {
4906 pmap_qenter((vm_offset_t)bp->b_kvabase, bp->b_pages, pidx);
4907 bp->b_data = bp->b_kvabase + bp->b_offset;
4909 bp->b_data = unmapped_buf;
4914 * Free the io map PTEs associated with this IO operation.
4915 * We also invalidate the TLB entries and restore the original b_addr.
4917 * This function only works with pager buffers.
4920 vunmapbuf(struct buf *bp)
4924 npages = bp->b_npages;
4926 pmap_qremove(trunc_page((vm_offset_t)bp->b_data), npages);
4927 vm_page_unhold_pages(bp->b_pages, npages);
4929 bp->b_data = unmapped_buf;
4933 bdone(struct buf *bp)
4937 mtxp = mtx_pool_find(mtxpool_sleep, bp);
4939 bp->b_flags |= B_DONE;
4945 bwait(struct buf *bp, u_char pri, const char *wchan)
4949 mtxp = mtx_pool_find(mtxpool_sleep, bp);
4951 while ((bp->b_flags & B_DONE) == 0)
4952 msleep(bp, mtxp, pri, wchan, 0);
4957 bufsync(struct bufobj *bo, int waitfor)
4960 return (VOP_FSYNC(bo2vnode(bo), waitfor, curthread));
4964 bufstrategy(struct bufobj *bo, struct buf *bp)
4970 KASSERT(vp == bo->bo_private, ("Inconsistent vnode bufstrategy"));
4971 KASSERT(vp->v_type != VCHR && vp->v_type != VBLK,
4972 ("Wrong vnode in bufstrategy(bp=%p, vp=%p)", bp, vp));
4973 i = VOP_STRATEGY(vp, bp);
4974 KASSERT(i == 0, ("VOP_STRATEGY failed bp=%p vp=%p", bp, bp->b_vp));
4978 * Initialize a struct bufobj before use. Memory is assumed zero filled.
4981 bufobj_init(struct bufobj *bo, void *private)
4983 static volatile int bufobj_cleanq;
4986 atomic_fetchadd_int(&bufobj_cleanq, 1) % buf_domains;
4987 rw_init(BO_LOCKPTR(bo), "bufobj interlock");
4988 bo->bo_private = private;
4989 TAILQ_INIT(&bo->bo_clean.bv_hd);
4990 TAILQ_INIT(&bo->bo_dirty.bv_hd);
4994 bufobj_wrefl(struct bufobj *bo)
4997 KASSERT(bo != NULL, ("NULL bo in bufobj_wref"));
4998 ASSERT_BO_WLOCKED(bo);
5003 bufobj_wref(struct bufobj *bo)
5006 KASSERT(bo != NULL, ("NULL bo in bufobj_wref"));
5013 bufobj_wdrop(struct bufobj *bo)
5016 KASSERT(bo != NULL, ("NULL bo in bufobj_wdrop"));
5018 KASSERT(bo->bo_numoutput > 0, ("bufobj_wdrop non-positive count"));
5019 if ((--bo->bo_numoutput == 0) && (bo->bo_flag & BO_WWAIT)) {
5020 bo->bo_flag &= ~BO_WWAIT;
5021 wakeup(&bo->bo_numoutput);
5027 bufobj_wwait(struct bufobj *bo, int slpflag, int timeo)
5031 KASSERT(bo != NULL, ("NULL bo in bufobj_wwait"));
5032 ASSERT_BO_WLOCKED(bo);
5034 while (bo->bo_numoutput) {
5035 bo->bo_flag |= BO_WWAIT;
5036 error = msleep(&bo->bo_numoutput, BO_LOCKPTR(bo),
5037 slpflag | (PRIBIO + 1), "bo_wwait", timeo);
5045 * Set bio_data or bio_ma for struct bio from the struct buf.
5048 bdata2bio(struct buf *bp, struct bio *bip)
5051 if (!buf_mapped(bp)) {
5052 KASSERT(unmapped_buf_allowed, ("unmapped"));
5053 bip->bio_ma = bp->b_pages;
5054 bip->bio_ma_n = bp->b_npages;
5055 bip->bio_data = unmapped_buf;
5056 bip->bio_ma_offset = (vm_offset_t)bp->b_offset & PAGE_MASK;
5057 bip->bio_flags |= BIO_UNMAPPED;
5058 KASSERT(round_page(bip->bio_ma_offset + bip->bio_length) /
5059 PAGE_SIZE == bp->b_npages,
5060 ("Buffer %p too short: %d %lld %d", bp, bip->bio_ma_offset,
5061 (long long)bip->bio_length, bip->bio_ma_n));
5063 bip->bio_data = bp->b_data;
5069 * The MIPS pmap code currently doesn't handle aliased pages.
5070 * The VIPT caches may not handle page aliasing themselves, leading
5071 * to data corruption.
5073 * As such, this code makes a system extremely unhappy if said
5074 * system doesn't support unaliasing the above situation in hardware.
5075 * Some "recent" systems (eg some mips24k/mips74k cores) don't enable
5076 * this feature at build time, so it has to be handled in software.
5078 * Once the MIPS pmap/cache code grows to support this function on
5079 * earlier chips, it should be flipped back off.
5082 static int buf_pager_relbuf = 1;
5084 static int buf_pager_relbuf = 0;
5086 SYSCTL_INT(_vfs, OID_AUTO, buf_pager_relbuf, CTLFLAG_RWTUN,
5087 &buf_pager_relbuf, 0,
5088 "Make buffer pager release buffers after reading");
5091 * The buffer pager. It uses buffer reads to validate pages.
5093 * In contrast to the generic local pager from vm/vnode_pager.c, this
5094 * pager correctly and easily handles volumes where the underlying
5095 * device block size is greater than the machine page size. The
5096 * buffer cache transparently extends the requested page run to be
5097 * aligned at the block boundary, and does the necessary bogus page
5098 * replacements in the addends to avoid obliterating already valid
5101 * The only non-trivial issue is that the exclusive busy state for
5102 * pages, which is assumed by the vm_pager_getpages() interface, is
5103 * incompatible with the VMIO buffer cache's desire to share-busy the
5104 * pages. This function performs a trivial downgrade of the pages'
5105 * state before reading buffers, and a less trivial upgrade from the
5106 * shared-busy to excl-busy state after the read.
5109 vfs_bio_getpages(struct vnode *vp, vm_page_t *ma, int count,
5110 int *rbehind, int *rahead, vbg_get_lblkno_t get_lblkno,
5111 vbg_get_blksize_t get_blksize)
5118 vm_ooffset_t la, lb, poff, poffe;
5120 int bo_bs, br_flags, error, i, pgsin, pgsin_a, pgsin_b;
5123 object = vp->v_object;
5126 la = IDX_TO_OFF(ma[count - 1]->pindex);
5127 if (la >= object->un_pager.vnp.vnp_size)
5128 return (VM_PAGER_BAD);
5131 * Change the meaning of la from where the last requested page starts
5132 * to where it ends, because that's the end of the requested region
5133 * and the start of the potential read-ahead region.
5136 lpart = la > object->un_pager.vnp.vnp_size;
5137 bo_bs = get_blksize(vp, get_lblkno(vp, IDX_TO_OFF(ma[0]->pindex)));
5140 * Calculate read-ahead, behind and total pages.
5143 lb = IDX_TO_OFF(ma[0]->pindex);
5144 pgsin_b = OFF_TO_IDX(lb - rounddown2(lb, bo_bs));
5146 if (rbehind != NULL)
5148 pgsin_a = OFF_TO_IDX(roundup2(la, bo_bs) - la);
5149 if (la + IDX_TO_OFF(pgsin_a) >= object->un_pager.vnp.vnp_size)
5150 pgsin_a = OFF_TO_IDX(roundup2(object->un_pager.vnp.vnp_size,
5155 VM_CNT_INC(v_vnodein);
5156 VM_CNT_ADD(v_vnodepgsin, pgsin);
5158 br_flags = (mp != NULL && (mp->mnt_kern_flag & MNTK_UNMAPPED_BUFS)
5159 != 0) ? GB_UNMAPPED : 0;
5161 for (i = 0; i < count; i++) {
5162 if (ma[i] != bogus_page)
5163 vm_page_busy_downgrade(ma[i]);
5167 for (i = 0; i < count; i++) {
5169 if (m == bogus_page)
5173 * Pages are shared busy and the object lock is not
5174 * owned, which together allow for the pages'
5175 * invalidation. The racy test for validity avoids
5176 * useless creation of the buffer for the most typical
5177 * case when invalidation is not used in redo or for
5178 * parallel read. The shared->excl upgrade loop at
5179 * the end of the function catches the race in a
5180 * reliable way (protected by the object lock).
5182 if (vm_page_all_valid(m))
5185 poff = IDX_TO_OFF(m->pindex);
5186 poffe = MIN(poff + PAGE_SIZE, object->un_pager.vnp.vnp_size);
5187 for (; poff < poffe; poff += bsize) {
5188 lbn = get_lblkno(vp, poff);
5193 bsize = get_blksize(vp, lbn);
5194 error = bread_gb(vp, lbn, bsize, curthread->td_ucred,
5198 if (bp->b_rcred == curthread->td_ucred) {
5199 crfree(bp->b_rcred);
5200 bp->b_rcred = NOCRED;
5202 if (LIST_EMPTY(&bp->b_dep)) {
5204 * Invalidation clears m->valid, but
5205 * may leave B_CACHE flag if the
5206 * buffer existed at the invalidation
5207 * time. In this case, recycle the
5208 * buffer to do real read on next
5209 * bread() after redo.
5211 * Otherwise B_RELBUF is not strictly
5212 * necessary, enable to reduce buf
5215 if (buf_pager_relbuf ||
5216 !vm_page_all_valid(m))
5217 bp->b_flags |= B_RELBUF;
5219 bp->b_flags &= ~B_NOCACHE;
5225 KASSERT(1 /* racy, enable for debugging */ ||
5226 vm_page_all_valid(m) || i == count - 1,
5227 ("buf %d %p invalid", i, m));
5228 if (i == count - 1 && lpart) {
5229 if (!vm_page_none_valid(m) &&
5230 !vm_page_all_valid(m))
5231 vm_page_zero_invalid(m, TRUE);
5238 for (i = 0; i < count; i++) {
5239 if (ma[i] == bogus_page)
5241 if (vm_page_busy_tryupgrade(ma[i]) == 0) {
5242 vm_page_sunbusy(ma[i]);
5243 ma[i] = vm_page_grab_unlocked(object, ma[i]->pindex,
5248 * Since the pages were only sbusy while neither the
5249 * buffer nor the object lock was held by us, or
5250 * reallocated while vm_page_grab() slept for busy
5251 * relinguish, they could have been invalidated.
5252 * Recheck the valid bits and re-read as needed.
5254 * Note that the last page is made fully valid in the
5255 * read loop, and partial validity for the page at
5256 * index count - 1 could mean that the page was
5257 * invalidated or removed, so we must restart for
5260 if (!vm_page_all_valid(ma[i]))
5263 if (redo && error == 0)
5265 return (error != 0 ? VM_PAGER_ERROR : VM_PAGER_OK);
5268 #include "opt_ddb.h"
5270 #include <ddb/ddb.h>
5272 /* DDB command to show buffer data */
5273 DB_SHOW_COMMAND(buffer, db_show_buffer)
5276 struct buf *bp = (struct buf *)addr;
5277 #ifdef FULL_BUF_TRACKING
5282 db_printf("usage: show buffer <addr>\n");
5286 db_printf("buf at %p\n", bp);
5287 db_printf("b_flags = 0x%b, b_xflags=0x%b\n",
5288 (u_int)bp->b_flags, PRINT_BUF_FLAGS,
5289 (u_int)bp->b_xflags, PRINT_BUF_XFLAGS);
5290 db_printf("b_vflags=0x%b b_ioflags0x%b\n",
5291 (u_int)bp->b_vflags, PRINT_BUF_VFLAGS,
5292 (u_int)bp->b_ioflags, PRINT_BIO_FLAGS);
5294 "b_error = %d, b_bufsize = %ld, b_bcount = %ld, b_resid = %ld\n"
5295 "b_bufobj = (%p), b_data = %p\n, b_blkno = %jd, b_lblkno = %jd, "
5296 "b_vp = %p, b_dep = %p\n",
5297 bp->b_error, bp->b_bufsize, bp->b_bcount, bp->b_resid,
5298 bp->b_bufobj, bp->b_data, (intmax_t)bp->b_blkno,
5299 (intmax_t)bp->b_lblkno, bp->b_vp, bp->b_dep.lh_first);
5300 db_printf("b_kvabase = %p, b_kvasize = %d\n",
5301 bp->b_kvabase, bp->b_kvasize);
5304 db_printf("b_npages = %d, pages(OBJ, IDX, PA): ", bp->b_npages);
5305 for (i = 0; i < bp->b_npages; i++) {
5309 db_printf("(%p, 0x%lx, 0x%lx)", m->object,
5311 (u_long)VM_PAGE_TO_PHYS(m));
5313 db_printf("( ??? )");
5314 if ((i + 1) < bp->b_npages)
5319 BUF_LOCKPRINTINFO(bp);
5320 #if defined(FULL_BUF_TRACKING)
5321 db_printf("b_io_tracking: b_io_tcnt = %u\n", bp->b_io_tcnt);
5323 i = bp->b_io_tcnt % BUF_TRACKING_SIZE;
5324 for (j = 1; j <= BUF_TRACKING_SIZE; j++) {
5325 if (bp->b_io_tracking[BUF_TRACKING_ENTRY(i - j)] == NULL)
5327 db_printf(" %2u: %s\n", j,
5328 bp->b_io_tracking[BUF_TRACKING_ENTRY(i - j)]);
5330 #elif defined(BUF_TRACKING)
5331 db_printf("b_io_tracking: %s\n", bp->b_io_tracking);
5336 DB_SHOW_COMMAND(bufqueues, bufqueues)
5338 struct bufdomain *bd;
5343 db_printf("bqempty: %d\n", bqempty.bq_len);
5345 for (i = 0; i < buf_domains; i++) {
5347 db_printf("Buf domain %d\n", i);
5348 db_printf("\tfreebufs\t%d\n", bd->bd_freebuffers);
5349 db_printf("\tlofreebufs\t%d\n", bd->bd_lofreebuffers);
5350 db_printf("\thifreebufs\t%d\n", bd->bd_hifreebuffers);
5352 db_printf("\tbufspace\t%ld\n", bd->bd_bufspace);
5353 db_printf("\tmaxbufspace\t%ld\n", bd->bd_maxbufspace);
5354 db_printf("\thibufspace\t%ld\n", bd->bd_hibufspace);
5355 db_printf("\tlobufspace\t%ld\n", bd->bd_lobufspace);
5356 db_printf("\tbufspacethresh\t%ld\n", bd->bd_bufspacethresh);
5358 db_printf("\tnumdirtybuffers\t%d\n", bd->bd_numdirtybuffers);
5359 db_printf("\tlodirtybuffers\t%d\n", bd->bd_lodirtybuffers);
5360 db_printf("\thidirtybuffers\t%d\n", bd->bd_hidirtybuffers);
5361 db_printf("\tdirtybufthresh\t%d\n", bd->bd_dirtybufthresh);
5364 TAILQ_FOREACH(bp, &bd->bd_cleanq->bq_queue, b_freelist)
5365 total += bp->b_bufsize;
5366 db_printf("\tcleanq count\t%d (%ld)\n",
5367 bd->bd_cleanq->bq_len, total);
5369 TAILQ_FOREACH(bp, &bd->bd_dirtyq.bq_queue, b_freelist)
5370 total += bp->b_bufsize;
5371 db_printf("\tdirtyq count\t%d (%ld)\n",
5372 bd->bd_dirtyq.bq_len, total);
5373 db_printf("\twakeup\t\t%d\n", bd->bd_wanted);
5374 db_printf("\tlim\t\t%d\n", bd->bd_lim);
5375 db_printf("\tCPU ");
5376 for (j = 0; j <= mp_maxid; j++)
5377 db_printf("%d, ", bd->bd_subq[j].bq_len);
5381 for (j = 0; j < nbuf; j++)
5382 if (buf[j].b_domain == i && BUF_ISLOCKED(&buf[j])) {
5384 total += buf[j].b_bufsize;
5386 db_printf("\tLocked buffers: %d space %ld\n", cnt, total);
5389 for (j = 0; j < nbuf; j++)
5390 if (buf[j].b_domain == i) {
5392 total += buf[j].b_bufsize;
5394 db_printf("\tTotal buffers: %d space %ld\n", cnt, total);
5398 DB_SHOW_COMMAND(lockedbufs, lockedbufs)
5403 for (i = 0; i < nbuf; i++) {
5405 if (BUF_ISLOCKED(bp)) {
5406 db_show_buffer((uintptr_t)bp, 1, 0, NULL);
5414 DB_SHOW_COMMAND(vnodebufs, db_show_vnodebufs)
5420 db_printf("usage: show vnodebufs <addr>\n");
5423 vp = (struct vnode *)addr;
5424 db_printf("Clean buffers:\n");
5425 TAILQ_FOREACH(bp, &vp->v_bufobj.bo_clean.bv_hd, b_bobufs) {
5426 db_show_buffer((uintptr_t)bp, 1, 0, NULL);
5429 db_printf("Dirty buffers:\n");
5430 TAILQ_FOREACH(bp, &vp->v_bufobj.bo_dirty.bv_hd, b_bobufs) {
5431 db_show_buffer((uintptr_t)bp, 1, 0, NULL);
5436 DB_COMMAND(countfreebufs, db_coundfreebufs)
5439 int i, used = 0, nfree = 0;
5442 db_printf("usage: countfreebufs\n");
5446 for (i = 0; i < nbuf; i++) {
5448 if (bp->b_qindex == QUEUE_EMPTY)
5454 db_printf("Counted %d free, %d used (%d tot)\n", nfree, used,
5456 db_printf("numfreebuffers is %d\n", numfreebuffers);