2 * Copyright (c) 2004 Poul-Henning Kamp
3 * Copyright (c) 1994,1997 John S. Dyson
4 * Copyright (c) 2013 The FreeBSD Foundation
7 * Portions of this software were developed by Konstantin Belousov
8 * under sponsorship from the FreeBSD Foundation.
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
19 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
20 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
23 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 * this file contains a new buffer I/O scheme implementing a coherent
34 * VM object and buffer cache scheme. Pains have been taken to make
35 * sure that the performance degradation associated with schemes such
36 * as this is not realized.
38 * Author: John S. Dyson
39 * Significant help during the development and debugging phases
40 * had been provided by David Greenman, also of the FreeBSD core team.
42 * see man buf(9) for more info.
45 #include <sys/cdefs.h>
46 __FBSDID("$FreeBSD$");
48 #include <sys/param.h>
49 #include <sys/systm.h>
53 #include <sys/devicestat.h>
54 #include <sys/eventhandler.h>
56 #include <sys/limits.h>
58 #include <sys/malloc.h>
59 #include <sys/mount.h>
60 #include <sys/mutex.h>
61 #include <sys/kernel.h>
62 #include <sys/kthread.h>
64 #include <sys/resourcevar.h>
65 #include <sys/sysctl.h>
66 #include <sys/vmmeter.h>
67 #include <sys/vnode.h>
68 #include <geom/geom.h>
70 #include <vm/vm_param.h>
71 #include <vm/vm_kern.h>
72 #include <vm/vm_pageout.h>
73 #include <vm/vm_page.h>
74 #include <vm/vm_object.h>
75 #include <vm/vm_extern.h>
76 #include <vm/vm_map.h>
77 #include "opt_compat.h"
78 #include "opt_directio.h"
81 static MALLOC_DEFINE(M_BIOBUF, "biobuf", "BIO buffer");
83 struct bio_ops bioops; /* I/O operation notification */
85 struct buf_ops buf_ops_bio = {
86 .bop_name = "buf_ops_bio",
87 .bop_write = bufwrite,
88 .bop_strategy = bufstrategy,
90 .bop_bdflush = bufbdflush,
94 * XXX buf is global because kern_shutdown.c and ffs_checkoverlap has
95 * carnal knowledge of buffers. This knowledge should be moved to vfs_bio.c.
97 struct buf *buf; /* buffer header pool */
100 static struct proc *bufdaemonproc;
102 static int inmem(struct vnode *vp, daddr_t blkno);
103 static void vm_hold_free_pages(struct buf *bp, int newbsize);
104 static void vm_hold_load_pages(struct buf *bp, vm_offset_t from,
106 static void vfs_page_set_valid(struct buf *bp, vm_ooffset_t off, vm_page_t m);
107 static void vfs_page_set_validclean(struct buf *bp, vm_ooffset_t off,
109 static void vfs_drain_busy_pages(struct buf *bp);
110 static void vfs_clean_pages_dirty_buf(struct buf *bp);
111 static void vfs_setdirty_locked_object(struct buf *bp);
112 static void vfs_vmio_release(struct buf *bp);
113 static int vfs_bio_clcheck(struct vnode *vp, int size,
114 daddr_t lblkno, daddr_t blkno);
115 static int buf_do_flush(struct vnode *vp);
116 static int flushbufqueues(struct vnode *, int, int);
117 static void buf_daemon(void);
118 static void bremfreel(struct buf *bp);
119 #if defined(COMPAT_FREEBSD4) || defined(COMPAT_FREEBSD5) || \
120 defined(COMPAT_FREEBSD6) || defined(COMPAT_FREEBSD7)
121 static int sysctl_bufspace(SYSCTL_HANDLER_ARGS);
124 int vmiodirenable = TRUE;
125 SYSCTL_INT(_vfs, OID_AUTO, vmiodirenable, CTLFLAG_RW, &vmiodirenable, 0,
126 "Use the VM system for directory writes");
127 long runningbufspace;
128 SYSCTL_LONG(_vfs, OID_AUTO, runningbufspace, CTLFLAG_RD, &runningbufspace, 0,
129 "Amount of presently outstanding async buffer io");
130 static long bufspace;
131 #if defined(COMPAT_FREEBSD4) || defined(COMPAT_FREEBSD5) || \
132 defined(COMPAT_FREEBSD6) || defined(COMPAT_FREEBSD7)
133 SYSCTL_PROC(_vfs, OID_AUTO, bufspace, CTLTYPE_LONG|CTLFLAG_MPSAFE|CTLFLAG_RD,
134 &bufspace, 0, sysctl_bufspace, "L", "Virtual memory used for buffers");
136 SYSCTL_LONG(_vfs, OID_AUTO, bufspace, CTLFLAG_RD, &bufspace, 0,
137 "Virtual memory used for buffers");
139 static long unmapped_bufspace;
140 SYSCTL_LONG(_vfs, OID_AUTO, unmapped_bufspace, CTLFLAG_RD,
141 &unmapped_bufspace, 0,
142 "Amount of unmapped buffers, inclusive in the bufspace");
143 static long maxbufspace;
144 SYSCTL_LONG(_vfs, OID_AUTO, maxbufspace, CTLFLAG_RD, &maxbufspace, 0,
145 "Maximum allowed value of bufspace (including buf_daemon)");
146 static long bufmallocspace;
147 SYSCTL_LONG(_vfs, OID_AUTO, bufmallocspace, CTLFLAG_RD, &bufmallocspace, 0,
148 "Amount of malloced memory for buffers");
149 static long maxbufmallocspace;
150 SYSCTL_LONG(_vfs, OID_AUTO, maxmallocbufspace, CTLFLAG_RW, &maxbufmallocspace, 0,
151 "Maximum amount of malloced memory for buffers");
152 static long lobufspace;
153 SYSCTL_LONG(_vfs, OID_AUTO, lobufspace, CTLFLAG_RD, &lobufspace, 0,
154 "Minimum amount of buffers we want to have");
156 SYSCTL_LONG(_vfs, OID_AUTO, hibufspace, CTLFLAG_RD, &hibufspace, 0,
157 "Maximum allowed value of bufspace (excluding buf_daemon)");
158 static int bufreusecnt;
159 SYSCTL_INT(_vfs, OID_AUTO, bufreusecnt, CTLFLAG_RW, &bufreusecnt, 0,
160 "Number of times we have reused a buffer");
161 static int buffreekvacnt;
162 SYSCTL_INT(_vfs, OID_AUTO, buffreekvacnt, CTLFLAG_RW, &buffreekvacnt, 0,
163 "Number of times we have freed the KVA space from some buffer");
164 static int bufdefragcnt;
165 SYSCTL_INT(_vfs, OID_AUTO, bufdefragcnt, CTLFLAG_RW, &bufdefragcnt, 0,
166 "Number of times we have had to repeat buffer allocation to defragment");
167 static long lorunningspace;
168 SYSCTL_LONG(_vfs, OID_AUTO, lorunningspace, CTLFLAG_RW, &lorunningspace, 0,
169 "Minimum preferred space used for in-progress I/O");
170 static long hirunningspace;
171 SYSCTL_LONG(_vfs, OID_AUTO, hirunningspace, CTLFLAG_RW, &hirunningspace, 0,
172 "Maximum amount of space to use for in-progress I/O");
173 int dirtybufferflushes;
174 SYSCTL_INT(_vfs, OID_AUTO, dirtybufferflushes, CTLFLAG_RW, &dirtybufferflushes,
175 0, "Number of bdwrite to bawrite conversions to limit dirty buffers");
177 SYSCTL_INT(_vfs, OID_AUTO, bdwriteskip, CTLFLAG_RW, &bdwriteskip,
178 0, "Number of buffers supplied to bdwrite with snapshot deadlock risk");
179 int altbufferflushes;
180 SYSCTL_INT(_vfs, OID_AUTO, altbufferflushes, CTLFLAG_RW, &altbufferflushes,
181 0, "Number of fsync flushes to limit dirty buffers");
182 static int recursiveflushes;
183 SYSCTL_INT(_vfs, OID_AUTO, recursiveflushes, CTLFLAG_RW, &recursiveflushes,
184 0, "Number of flushes skipped due to being recursive");
185 static int numdirtybuffers;
186 SYSCTL_INT(_vfs, OID_AUTO, numdirtybuffers, CTLFLAG_RD, &numdirtybuffers, 0,
187 "Number of buffers that are dirty (has unwritten changes) at the moment");
188 static int lodirtybuffers;
189 SYSCTL_INT(_vfs, OID_AUTO, lodirtybuffers, CTLFLAG_RW, &lodirtybuffers, 0,
190 "How many buffers we want to have free before bufdaemon can sleep");
191 static int hidirtybuffers;
192 SYSCTL_INT(_vfs, OID_AUTO, hidirtybuffers, CTLFLAG_RW, &hidirtybuffers, 0,
193 "When the number of dirty buffers is considered severe");
195 SYSCTL_INT(_vfs, OID_AUTO, dirtybufthresh, CTLFLAG_RW, &dirtybufthresh,
196 0, "Number of bdwrite to bawrite conversions to clear dirty buffers");
197 static int numfreebuffers;
198 SYSCTL_INT(_vfs, OID_AUTO, numfreebuffers, CTLFLAG_RD, &numfreebuffers, 0,
199 "Number of free buffers");
200 static int lofreebuffers;
201 SYSCTL_INT(_vfs, OID_AUTO, lofreebuffers, CTLFLAG_RW, &lofreebuffers, 0,
203 static int hifreebuffers;
204 SYSCTL_INT(_vfs, OID_AUTO, hifreebuffers, CTLFLAG_RW, &hifreebuffers, 0,
205 "XXX Complicatedly unused");
206 static int getnewbufcalls;
207 SYSCTL_INT(_vfs, OID_AUTO, getnewbufcalls, CTLFLAG_RW, &getnewbufcalls, 0,
208 "Number of calls to getnewbuf");
209 static int getnewbufrestarts;
210 SYSCTL_INT(_vfs, OID_AUTO, getnewbufrestarts, CTLFLAG_RW, &getnewbufrestarts, 0,
211 "Number of times getnewbuf has had to restart a buffer aquisition");
212 static int mappingrestarts;
213 SYSCTL_INT(_vfs, OID_AUTO, mappingrestarts, CTLFLAG_RW, &mappingrestarts, 0,
214 "Number of times getblk has had to restart a buffer mapping for "
216 static int flushbufqtarget = 100;
217 SYSCTL_INT(_vfs, OID_AUTO, flushbufqtarget, CTLFLAG_RW, &flushbufqtarget, 0,
218 "Amount of work to do in flushbufqueues when helping bufdaemon");
219 static long notbufdflashes;
220 SYSCTL_LONG(_vfs, OID_AUTO, notbufdflashes, CTLFLAG_RD, ¬bufdflashes, 0,
221 "Number of dirty buffer flushes done by the bufdaemon helpers");
222 static long barrierwrites;
223 SYSCTL_LONG(_vfs, OID_AUTO, barrierwrites, CTLFLAG_RW, &barrierwrites, 0,
224 "Number of barrier writes");
225 SYSCTL_INT(_vfs, OID_AUTO, unmapped_buf_allowed, CTLFLAG_RD,
226 &unmapped_buf_allowed, 0,
227 "Permit the use of the unmapped i/o");
230 * Wakeup point for bufdaemon, as well as indicator of whether it is already
231 * active. Set to 1 when the bufdaemon is already "on" the queue, 0 when it
234 static int bd_request;
237 * Request for the buf daemon to write more buffers than is indicated by
238 * lodirtybuf. This may be necessary to push out excess dependencies or
239 * defragment the address space where a simple count of the number of dirty
240 * buffers is insufficient to characterize the demand for flushing them.
242 static int bd_speedupreq;
245 * This lock synchronizes access to bd_request.
247 static struct mtx bdlock;
250 * bogus page -- for I/O to/from partially complete buffers
251 * this is a temporary solution to the problem, but it is not
252 * really that bad. it would be better to split the buffer
253 * for input in the case of buffers partially already in memory,
254 * but the code is intricate enough already.
256 vm_page_t bogus_page;
259 * Synchronization (sleep/wakeup) variable for active buffer space requests.
260 * Set when wait starts, cleared prior to wakeup().
261 * Used in runningbufwakeup() and waitrunningbufspace().
263 static int runningbufreq;
266 * This lock protects the runningbufreq and synchronizes runningbufwakeup and
267 * waitrunningbufspace().
269 static struct mtx rbreqlock;
272 * Synchronization (sleep/wakeup) variable for buffer requests.
273 * Can contain the VFS_BIO_NEED flags defined below; setting/clearing is done
275 * Used in numdirtywakeup(), bufspacewakeup(), bufcountwakeup(), bwillwrite(),
276 * getnewbuf(), and getblk().
278 static int needsbuffer;
281 * Lock that protects needsbuffer and the sleeps/wakeups surrounding it.
283 static struct mtx nblock;
286 * Definitions for the buffer free lists.
288 #define BUFFER_QUEUES 6 /* number of free buffer queues */
290 #define QUEUE_NONE 0 /* on no queue */
291 #define QUEUE_CLEAN 1 /* non-B_DELWRI buffers */
292 #define QUEUE_DIRTY 2 /* B_DELWRI buffers */
293 #define QUEUE_DIRTY_GIANT 3 /* B_DELWRI buffers that need giant */
294 #define QUEUE_EMPTYKVA 4 /* empty buffer headers w/KVA assignment */
295 #define QUEUE_EMPTY 5 /* empty buffer headers */
296 #define QUEUE_SENTINEL 1024 /* not an queue index, but mark for sentinel */
298 /* Queues for free buffers with various properties */
299 static TAILQ_HEAD(bqueues, buf) bufqueues[BUFFER_QUEUES] = { { 0 } };
301 static int bq_len[BUFFER_QUEUES];
304 /* Lock for the bufqueues */
305 static struct mtx bqlock;
308 * Single global constant for BUF_WMESG, to avoid getting multiple references.
309 * buf_wmesg is referred from macros.
311 const char *buf_wmesg = BUF_WMESG;
313 #define VFS_BIO_NEED_ANY 0x01 /* any freeable buffer */
314 #define VFS_BIO_NEED_DIRTYFLUSH 0x02 /* waiting for dirty buffer flush */
315 #define VFS_BIO_NEED_FREE 0x04 /* wait for free bufs, hi hysteresis */
316 #define VFS_BIO_NEED_BUFSPACE 0x08 /* wait for buf space, lo hysteresis */
318 #if defined(COMPAT_FREEBSD4) || defined(COMPAT_FREEBSD5) || \
319 defined(COMPAT_FREEBSD6) || defined(COMPAT_FREEBSD7)
321 sysctl_bufspace(SYSCTL_HANDLER_ARGS)
326 if (sizeof(int) == sizeof(long) || req->oldlen >= sizeof(long))
327 return (sysctl_handle_long(oidp, arg1, arg2, req));
328 lvalue = *(long *)arg1;
329 if (lvalue > INT_MAX)
330 /* On overflow, still write out a long to trigger ENOMEM. */
331 return (sysctl_handle_long(oidp, &lvalue, 0, req));
333 return (sysctl_handle_int(oidp, &ivalue, 0, req));
338 extern void ffs_rawread_setup(void);
339 #endif /* DIRECTIO */
343 * If someone is blocked due to there being too many dirty buffers,
344 * and numdirtybuffers is now reasonable, wake them up.
348 numdirtywakeup(int level)
351 if (numdirtybuffers <= level) {
353 if (needsbuffer & VFS_BIO_NEED_DIRTYFLUSH) {
354 needsbuffer &= ~VFS_BIO_NEED_DIRTYFLUSH;
355 wakeup(&needsbuffer);
364 * Called when buffer space is potentially available for recovery.
365 * getnewbuf() will block on this flag when it is unable to free
366 * sufficient buffer space. Buffer space becomes recoverable when
367 * bp's get placed back in the queues.
375 * If someone is waiting for BUF space, wake them up. Even
376 * though we haven't freed the kva space yet, the waiting
377 * process will be able to now.
380 if (needsbuffer & VFS_BIO_NEED_BUFSPACE) {
381 needsbuffer &= ~VFS_BIO_NEED_BUFSPACE;
382 wakeup(&needsbuffer);
388 * runningbufwakeup() - in-progress I/O accounting.
392 runningbufwakeup(struct buf *bp)
395 if (bp->b_runningbufspace) {
396 atomic_subtract_long(&runningbufspace, bp->b_runningbufspace);
397 bp->b_runningbufspace = 0;
398 mtx_lock(&rbreqlock);
399 if (runningbufreq && runningbufspace <= lorunningspace) {
401 wakeup(&runningbufreq);
403 mtx_unlock(&rbreqlock);
410 * Called when a buffer has been added to one of the free queues to
411 * account for the buffer and to wakeup anyone waiting for free buffers.
412 * This typically occurs when large amounts of metadata are being handled
413 * by the buffer cache ( else buffer space runs out first, usually ).
417 bufcountwakeup(struct buf *bp)
421 KASSERT((bp->b_vflags & BV_INFREECNT) == 0,
422 ("buf %p already counted as free", bp));
423 if (bp->b_bufobj != NULL)
424 mtx_assert(BO_MTX(bp->b_bufobj), MA_OWNED);
425 bp->b_vflags |= BV_INFREECNT;
426 old = atomic_fetchadd_int(&numfreebuffers, 1);
427 KASSERT(old >= 0 && old < nbuf,
428 ("numfreebuffers climbed to %d", old + 1));
431 needsbuffer &= ~VFS_BIO_NEED_ANY;
432 if (numfreebuffers >= hifreebuffers)
433 needsbuffer &= ~VFS_BIO_NEED_FREE;
434 wakeup(&needsbuffer);
440 * waitrunningbufspace()
442 * runningbufspace is a measure of the amount of I/O currently
443 * running. This routine is used in async-write situations to
444 * prevent creating huge backups of pending writes to a device.
445 * Only asynchronous writes are governed by this function.
447 * Reads will adjust runningbufspace, but will not block based on it.
448 * The read load has a side effect of reducing the allowed write load.
450 * This does NOT turn an async write into a sync write. It waits
451 * for earlier writes to complete and generally returns before the
452 * caller's write has reached the device.
455 waitrunningbufspace(void)
458 mtx_lock(&rbreqlock);
459 while (runningbufspace > hirunningspace) {
461 msleep(&runningbufreq, &rbreqlock, PVM, "wdrain", 0);
463 mtx_unlock(&rbreqlock);
468 * vfs_buf_test_cache:
470 * Called when a buffer is extended. This function clears the B_CACHE
471 * bit if the newly extended portion of the buffer does not contain
476 vfs_buf_test_cache(struct buf *bp,
477 vm_ooffset_t foff, vm_offset_t off, vm_offset_t size,
481 VM_OBJECT_LOCK_ASSERT(m->object, MA_OWNED);
482 if (bp->b_flags & B_CACHE) {
483 int base = (foff + off) & PAGE_MASK;
484 if (vm_page_is_valid(m, base, size) == 0)
485 bp->b_flags &= ~B_CACHE;
489 /* Wake up the buffer daemon if necessary */
492 bd_wakeup(int dirtybuflevel)
496 if (bd_request == 0 && numdirtybuffers >= dirtybuflevel) {
504 * bd_speedup - speedup the buffer cache flushing code
514 if (bd_speedupreq == 0 || bd_request == 0)
524 #define TRANSIENT_DENOM 5
526 #define TRANSIENT_DENOM 10
530 * Calculating buffer cache scaling values and reserve space for buffer
531 * headers. This is called during low level kernel initialization and
532 * may be called more then once. We CANNOT write to the memory area
533 * being reserved at this time.
536 kern_vfs_bio_buffer_alloc(caddr_t v, long physmem_est)
539 long maxbuf, maxbuf_sz, buf_sz, biotmap_sz;
542 * physmem_est is in pages. Convert it to kilobytes (assumes
543 * PAGE_SIZE is >= 1K)
545 physmem_est = physmem_est * (PAGE_SIZE / 1024);
548 * The nominal buffer size (and minimum KVA allocation) is BKVASIZE.
549 * For the first 64MB of ram nominally allocate sufficient buffers to
550 * cover 1/4 of our ram. Beyond the first 64MB allocate additional
551 * buffers to cover 1/10 of our ram over 64MB. When auto-sizing
552 * the buffer cache we limit the eventual kva reservation to
555 * factor represents the 1/4 x ram conversion.
558 int factor = 4 * BKVASIZE / 1024;
561 if (physmem_est > 4096)
562 nbuf += min((physmem_est - 4096) / factor,
564 if (physmem_est > 65536)
565 nbuf += (physmem_est - 65536) * 2 / (factor * 5);
567 if (maxbcache && nbuf > maxbcache / BKVASIZE)
568 nbuf = maxbcache / BKVASIZE;
573 /* XXX Avoid unsigned long overflows later on with maxbufspace. */
574 maxbuf = (LONG_MAX / 3) / BKVASIZE;
577 printf("Warning: nbufs lowered from %d to %ld\n", nbuf,
583 * Ideal allocation size for the transient bio submap if 10%
584 * of the maximal space buffer map. This roughly corresponds
585 * to the amount of the buffer mapped for typical UFS load.
587 * Clip the buffer map to reserve space for the transient
588 * BIOs, if its extent is bigger than 90% (80% on i386) of the
589 * maximum buffer map extent on the platform.
591 * The fall-back to the maxbuf in case of maxbcache unset,
592 * allows to not trim the buffer KVA for the architectures
593 * with ample KVA space.
595 if (bio_transient_maxcnt == 0) {
596 maxbuf_sz = maxbcache != 0 ? maxbcache : maxbuf * BKVASIZE;
597 buf_sz = (long)nbuf * BKVASIZE;
598 if (buf_sz < maxbuf_sz / TRANSIENT_DENOM *
599 (TRANSIENT_DENOM - 1)) {
601 * There is more KVA than memory. Do not
602 * adjust buffer map size, and assign the rest
603 * of maxbuf to transient map.
605 biotmap_sz = maxbuf_sz - buf_sz;
608 * Buffer map spans all KVA we could afford on
609 * this platform. Give 10% (20% on i386) of
610 * the buffer map to the transient bio map.
612 biotmap_sz = buf_sz / TRANSIENT_DENOM;
613 buf_sz -= biotmap_sz;
615 if (biotmap_sz / INT_MAX > MAXPHYS)
616 bio_transient_maxcnt = INT_MAX;
618 bio_transient_maxcnt = biotmap_sz / MAXPHYS;
620 * Artifically limit to 1024 simultaneous in-flight I/Os
621 * using the transient mapping.
623 if (bio_transient_maxcnt > 1024)
624 bio_transient_maxcnt = 1024;
626 nbuf = buf_sz / BKVASIZE;
630 * swbufs are used as temporary holders for I/O, such as paging I/O.
631 * We have no less then 16 and no more then 256.
633 nswbuf = max(min(nbuf/4, 256), 16);
635 if (nswbuf < NSWBUF_MIN)
643 * Reserve space for the buffer cache buffers
646 v = (caddr_t)(swbuf + nswbuf);
648 v = (caddr_t)(buf + nbuf);
653 /* Initialize the buffer subsystem. Called before use of any buffers. */
660 mtx_init(&bqlock, "buf queue lock", NULL, MTX_DEF);
661 mtx_init(&rbreqlock, "runningbufspace lock", NULL, MTX_DEF);
662 mtx_init(&nblock, "needsbuffer lock", NULL, MTX_DEF);
663 mtx_init(&bdlock, "buffer daemon lock", NULL, MTX_DEF);
665 /* next, make a null set of free lists */
666 for (i = 0; i < BUFFER_QUEUES; i++)
667 TAILQ_INIT(&bufqueues[i]);
669 /* finally, initialize each buffer header and stick on empty q */
670 for (i = 0; i < nbuf; i++) {
672 bzero(bp, sizeof *bp);
673 bp->b_flags = B_INVAL; /* we're just an empty header */
674 bp->b_rcred = NOCRED;
675 bp->b_wcred = NOCRED;
676 bp->b_qindex = QUEUE_EMPTY;
677 bp->b_vflags = BV_INFREECNT; /* buf is counted as free */
679 LIST_INIT(&bp->b_dep);
681 TAILQ_INSERT_TAIL(&bufqueues[QUEUE_EMPTY], bp, b_freelist);
683 bq_len[QUEUE_EMPTY]++;
688 * maxbufspace is the absolute maximum amount of buffer space we are
689 * allowed to reserve in KVM and in real terms. The absolute maximum
690 * is nominally used by buf_daemon. hibufspace is the nominal maximum
691 * used by most other processes. The differential is required to
692 * ensure that buf_daemon is able to run when other processes might
693 * be blocked waiting for buffer space.
695 * maxbufspace is based on BKVASIZE. Allocating buffers larger then
696 * this may result in KVM fragmentation which is not handled optimally
699 maxbufspace = (long)nbuf * BKVASIZE;
700 hibufspace = lmax(3 * maxbufspace / 4, maxbufspace - MAXBSIZE * 10);
701 lobufspace = hibufspace - MAXBSIZE;
704 * Note: The 16 MiB upper limit for hirunningspace was chosen
705 * arbitrarily and may need further tuning. It corresponds to
706 * 128 outstanding write IO requests (if IO size is 128 KiB),
707 * which fits with many RAID controllers' tagged queuing limits.
708 * The lower 1 MiB limit is the historical upper limit for
711 hirunningspace = lmax(lmin(roundup(hibufspace / 64, MAXBSIZE),
712 16 * 1024 * 1024), 1024 * 1024);
713 lorunningspace = roundup((hirunningspace * 2) / 3, MAXBSIZE);
716 * Limit the amount of malloc memory since it is wired permanently into
717 * the kernel space. Even though this is accounted for in the buffer
718 * allocation, we don't want the malloced region to grow uncontrolled.
719 * The malloc scheme improves memory utilization significantly on average
720 * (small) directories.
722 maxbufmallocspace = hibufspace / 20;
725 * Reduce the chance of a deadlock occuring by limiting the number
726 * of delayed-write dirty buffers we allow to stack up.
728 hidirtybuffers = nbuf / 4 + 20;
729 dirtybufthresh = hidirtybuffers * 9 / 10;
732 * To support extreme low-memory systems, make sure hidirtybuffers cannot
733 * eat up all available buffer space. This occurs when our minimum cannot
734 * be met. We try to size hidirtybuffers to 3/4 our buffer space assuming
735 * BKVASIZE'd buffers.
737 while ((long)hidirtybuffers * BKVASIZE > 3 * hibufspace / 4) {
738 hidirtybuffers >>= 1;
740 lodirtybuffers = hidirtybuffers / 2;
743 * Try to keep the number of free buffers in the specified range,
744 * and give special processes (e.g. like buf_daemon) access to an
747 lofreebuffers = nbuf / 18 + 5;
748 hifreebuffers = 2 * lofreebuffers;
749 numfreebuffers = nbuf;
751 bogus_page = vm_page_alloc(NULL, 0, VM_ALLOC_NOOBJ |
752 VM_ALLOC_NORMAL | VM_ALLOC_WIRED);
753 unmapped_buf = (caddr_t)kmem_alloc_nofault(kernel_map, MAXPHYS);
758 vfs_buf_check_mapped(struct buf *bp)
761 KASSERT((bp->b_flags & B_UNMAPPED) == 0,
762 ("mapped buf %p %x", bp, bp->b_flags));
763 KASSERT(bp->b_kvabase != unmapped_buf,
764 ("mapped buf: b_kvabase was not updated %p", bp));
765 KASSERT(bp->b_data != unmapped_buf,
766 ("mapped buf: b_data was not updated %p", bp));
770 vfs_buf_check_unmapped(struct buf *bp)
773 KASSERT((bp->b_flags & B_UNMAPPED) == B_UNMAPPED,
774 ("unmapped buf %p %x", bp, bp->b_flags));
775 KASSERT(bp->b_kvabase == unmapped_buf,
776 ("unmapped buf: corrupted b_kvabase %p", bp));
777 KASSERT(bp->b_data == unmapped_buf,
778 ("unmapped buf: corrupted b_data %p", bp));
781 #define BUF_CHECK_MAPPED(bp) vfs_buf_check_mapped(bp)
782 #define BUF_CHECK_UNMAPPED(bp) vfs_buf_check_unmapped(bp)
784 #define BUF_CHECK_MAPPED(bp) do {} while (0)
785 #define BUF_CHECK_UNMAPPED(bp) do {} while (0)
789 bpmap_qenter(struct buf *bp)
792 BUF_CHECK_MAPPED(bp);
795 * bp->b_data is relative to bp->b_offset, but
796 * bp->b_offset may be offset into the first page.
798 bp->b_data = (caddr_t)trunc_page((vm_offset_t)bp->b_data);
799 pmap_qenter((vm_offset_t)bp->b_data, bp->b_pages, bp->b_npages);
800 bp->b_data = (caddr_t)((vm_offset_t)bp->b_data |
801 (vm_offset_t)(bp->b_offset & PAGE_MASK));
805 * bfreekva() - free the kva allocation for a buffer.
807 * Since this call frees up buffer space, we call bufspacewakeup().
810 bfreekva(struct buf *bp)
813 if (bp->b_kvasize == 0)
816 atomic_add_int(&buffreekvacnt, 1);
817 atomic_subtract_long(&bufspace, bp->b_kvasize);
818 if ((bp->b_flags & B_UNMAPPED) == 0) {
819 BUF_CHECK_MAPPED(bp);
820 vm_map_remove(buffer_map, (vm_offset_t)bp->b_kvabase,
821 (vm_offset_t)bp->b_kvabase + bp->b_kvasize);
823 BUF_CHECK_UNMAPPED(bp);
824 if ((bp->b_flags & B_KVAALLOC) != 0) {
825 vm_map_remove(buffer_map, (vm_offset_t)bp->b_kvaalloc,
826 (vm_offset_t)bp->b_kvaalloc + bp->b_kvasize);
828 atomic_subtract_long(&unmapped_bufspace, bp->b_kvasize);
829 bp->b_flags &= ~(B_UNMAPPED | B_KVAALLOC);
838 * Mark the buffer for removal from the appropriate free list in brelse.
842 bremfree(struct buf *bp)
846 CTR3(KTR_BUF, "bremfree(%p) vp %p flags %X", bp, bp->b_vp, bp->b_flags);
847 KASSERT((bp->b_flags & B_REMFREE) == 0,
848 ("bremfree: buffer %p already marked for delayed removal.", bp));
849 KASSERT(bp->b_qindex != QUEUE_NONE,
850 ("bremfree: buffer %p not on a queue.", bp));
853 bp->b_flags |= B_REMFREE;
854 /* Fixup numfreebuffers count. */
855 if ((bp->b_flags & B_INVAL) || (bp->b_flags & B_DELWRI) == 0) {
856 KASSERT((bp->b_vflags & BV_INFREECNT) != 0,
857 ("buf %p not counted in numfreebuffers", bp));
858 if (bp->b_bufobj != NULL)
859 mtx_assert(BO_MTX(bp->b_bufobj), MA_OWNED);
860 bp->b_vflags &= ~BV_INFREECNT;
861 old = atomic_fetchadd_int(&numfreebuffers, -1);
862 KASSERT(old > 0, ("numfreebuffers dropped to %d", old - 1));
869 * Force an immediate removal from a free list. Used only in nfs when
870 * it abuses the b_freelist pointer.
873 bremfreef(struct buf *bp)
883 * Removes a buffer from the free list, must be called with the
887 bremfreel(struct buf *bp)
891 CTR3(KTR_BUF, "bremfreel(%p) vp %p flags %X",
892 bp, bp->b_vp, bp->b_flags);
893 KASSERT(bp->b_qindex != QUEUE_NONE,
894 ("bremfreel: buffer %p not on a queue.", bp));
896 mtx_assert(&bqlock, MA_OWNED);
898 TAILQ_REMOVE(&bufqueues[bp->b_qindex], bp, b_freelist);
900 KASSERT(bq_len[bp->b_qindex] >= 1, ("queue %d underflow",
902 bq_len[bp->b_qindex]--;
904 bp->b_qindex = QUEUE_NONE;
906 * If this was a delayed bremfree() we only need to remove the buffer
907 * from the queue and return the stats are already done.
909 if (bp->b_flags & B_REMFREE) {
910 bp->b_flags &= ~B_REMFREE;
914 * Fixup numfreebuffers count. If the buffer is invalid or not
915 * delayed-write, the buffer was free and we must decrement
918 if ((bp->b_flags & B_INVAL) || (bp->b_flags & B_DELWRI) == 0) {
919 KASSERT((bp->b_vflags & BV_INFREECNT) != 0,
920 ("buf %p not counted in numfreebuffers", bp));
921 if (bp->b_bufobj != NULL)
922 mtx_assert(BO_MTX(bp->b_bufobj), MA_OWNED);
923 bp->b_vflags &= ~BV_INFREECNT;
924 old = atomic_fetchadd_int(&numfreebuffers, -1);
925 KASSERT(old > 0, ("numfreebuffers dropped to %d", old - 1));
930 * Get a buffer with the specified data.
933 bread(struct vnode * vp, daddr_t blkno, int size, struct ucred * cred,
937 return (breadn_flags(vp, blkno, size, 0, 0, 0, cred, 0, bpp));
941 * Attempt to initiate asynchronous I/O on read-ahead blocks. We must
942 * clear BIO_ERROR and B_INVAL prior to initiating I/O . If B_CACHE is set,
943 * the buffer is valid and we do not have to do anything.
946 breada(struct vnode * vp, daddr_t * rablkno, int * rabsize,
947 int cnt, struct ucred * cred)
952 for (i = 0; i < cnt; i++, rablkno++, rabsize++) {
953 if (inmem(vp, *rablkno))
955 rabp = getblk(vp, *rablkno, *rabsize, 0, 0, 0);
957 if ((rabp->b_flags & B_CACHE) == 0) {
958 if (!TD_IS_IDLETHREAD(curthread))
959 curthread->td_ru.ru_inblock++;
960 rabp->b_flags |= B_ASYNC;
961 rabp->b_flags &= ~B_INVAL;
962 rabp->b_ioflags &= ~BIO_ERROR;
963 rabp->b_iocmd = BIO_READ;
964 if (rabp->b_rcred == NOCRED && cred != NOCRED)
965 rabp->b_rcred = crhold(cred);
966 vfs_busy_pages(rabp, 0);
968 rabp->b_iooffset = dbtob(rabp->b_blkno);
977 * Operates like bread, but with getblk flags.
980 bread_gb(struct vnode * vp, daddr_t blkno, int cnt, struct ucred * cred,
981 int gbflags, struct buf **bpp)
984 return (breadn_flags(vp, blkno, cnt, NULL, NULL, 0,
985 cred, gbflags, bpp));
989 * Operates like bread, but also starts asynchronous I/O on
993 breadn(struct vnode * vp, daddr_t blkno, int size,
994 daddr_t * rablkno, int *rabsize,
995 int cnt, struct ucred * cred, struct buf **bpp)
998 return (breadn_flags(vp, blkno, size, rablkno, rabsize, cnt,
1003 * Entry point for bread() and breadn().
1005 * Get a buffer with the specified data. Look in the cache first. We
1006 * must clear BIO_ERROR and B_INVAL prior to initiating I/O. If B_CACHE
1007 * is set, the buffer is valid and we do not have to do anything, see
1008 * getblk(). Also starts asynchronous I/O on read-ahead blocks.
1011 breadn_flags(struct vnode *vp, daddr_t blkno, int size, daddr_t *rablkno,
1012 int *rabsize, int cnt, struct ucred *cred, int flags, struct buf **bpp)
1015 int rv = 0, readwait = 0;
1017 CTR3(KTR_BUF, "breadn(%p, %jd, %d)", vp, blkno, size);
1019 * Can only return NULL if GB_LOCK_NOWAIT flag is specified.
1021 *bpp = bp = getblk(vp, blkno, size, 0, 0, flags);
1025 /* if not found in cache, do some I/O */
1026 if ((bp->b_flags & B_CACHE) == 0) {
1027 if (!TD_IS_IDLETHREAD(curthread))
1028 curthread->td_ru.ru_inblock++;
1029 bp->b_iocmd = BIO_READ;
1030 bp->b_flags &= ~B_INVAL;
1031 bp->b_ioflags &= ~BIO_ERROR;
1032 if (bp->b_rcred == NOCRED && cred != NOCRED)
1033 bp->b_rcred = crhold(cred);
1034 vfs_busy_pages(bp, 0);
1035 bp->b_iooffset = dbtob(bp->b_blkno);
1040 breada(vp, rablkno, rabsize, cnt, cred);
1049 * Write, release buffer on completion. (Done by iodone
1050 * if async). Do not bother writing anything if the buffer
1053 * Note that we set B_CACHE here, indicating that buffer is
1054 * fully valid and thus cacheable. This is true even of NFS
1055 * now so we set it generally. This could be set either here
1056 * or in biodone() since the I/O is synchronous. We put it
1060 bufwrite(struct buf *bp)
1066 CTR3(KTR_BUF, "bufwrite(%p) vp %p flags %X", bp, bp->b_vp, bp->b_flags);
1067 if (bp->b_flags & B_INVAL) {
1072 if (bp->b_flags & B_BARRIER)
1075 oldflags = bp->b_flags;
1077 BUF_ASSERT_HELD(bp);
1079 if (bp->b_pin_count > 0)
1082 KASSERT(!(bp->b_vflags & BV_BKGRDINPROG),
1083 ("FFS background buffer should not get here %p", bp));
1087 vp_md = vp->v_vflag & VV_MD;
1092 * Mark the buffer clean. Increment the bufobj write count
1093 * before bundirty() call, to prevent other thread from seeing
1094 * empty dirty list and zero counter for writes in progress,
1095 * falsely indicating that the bufobj is clean.
1097 bufobj_wref(bp->b_bufobj);
1100 bp->b_flags &= ~B_DONE;
1101 bp->b_ioflags &= ~BIO_ERROR;
1102 bp->b_flags |= B_CACHE;
1103 bp->b_iocmd = BIO_WRITE;
1105 vfs_busy_pages(bp, 1);
1108 * Normal bwrites pipeline writes
1110 bp->b_runningbufspace = bp->b_bufsize;
1111 atomic_add_long(&runningbufspace, bp->b_runningbufspace);
1113 if (!TD_IS_IDLETHREAD(curthread))
1114 curthread->td_ru.ru_oublock++;
1115 if (oldflags & B_ASYNC)
1117 bp->b_iooffset = dbtob(bp->b_blkno);
1120 if ((oldflags & B_ASYNC) == 0) {
1121 int rtval = bufwait(bp);
1126 * don't allow the async write to saturate the I/O
1127 * system. We will not deadlock here because
1128 * we are blocking waiting for I/O that is already in-progress
1129 * to complete. We do not block here if it is the update
1130 * or syncer daemon trying to clean up as that can lead
1133 if ((curthread->td_pflags & TDP_NORUNNINGBUF) == 0 && !vp_md)
1134 waitrunningbufspace();
1141 bufbdflush(struct bufobj *bo, struct buf *bp)
1145 if (bo->bo_dirty.bv_cnt > dirtybufthresh + 10) {
1146 (void) VOP_FSYNC(bp->b_vp, MNT_NOWAIT, curthread);
1148 } else if (bo->bo_dirty.bv_cnt > dirtybufthresh) {
1151 * Try to find a buffer to flush.
1153 TAILQ_FOREACH(nbp, &bo->bo_dirty.bv_hd, b_bobufs) {
1154 if ((nbp->b_vflags & BV_BKGRDINPROG) ||
1156 LK_EXCLUSIVE | LK_NOWAIT, NULL))
1159 panic("bdwrite: found ourselves");
1161 /* Don't countdeps with the bo lock held. */
1162 if (buf_countdeps(nbp, 0)) {
1167 if (nbp->b_flags & B_CLUSTEROK) {
1168 vfs_bio_awrite(nbp);
1173 dirtybufferflushes++;
1182 * Delayed write. (Buffer is marked dirty). Do not bother writing
1183 * anything if the buffer is marked invalid.
1185 * Note that since the buffer must be completely valid, we can safely
1186 * set B_CACHE. In fact, we have to set B_CACHE here rather then in
1187 * biodone() in order to prevent getblk from writing the buffer
1188 * out synchronously.
1191 bdwrite(struct buf *bp)
1193 struct thread *td = curthread;
1197 CTR3(KTR_BUF, "bdwrite(%p) vp %p flags %X", bp, bp->b_vp, bp->b_flags);
1198 KASSERT(bp->b_bufobj != NULL, ("No b_bufobj %p", bp));
1199 KASSERT((bp->b_flags & B_BARRIER) == 0,
1200 ("Barrier request in delayed write %p", bp));
1201 BUF_ASSERT_HELD(bp);
1203 if (bp->b_flags & B_INVAL) {
1209 * If we have too many dirty buffers, don't create any more.
1210 * If we are wildly over our limit, then force a complete
1211 * cleanup. Otherwise, just keep the situation from getting
1212 * out of control. Note that we have to avoid a recursive
1213 * disaster and not try to clean up after our own cleanup!
1217 if ((td->td_pflags & (TDP_COWINPROGRESS|TDP_INBDFLUSH)) == 0) {
1218 td->td_pflags |= TDP_INBDFLUSH;
1220 td->td_pflags &= ~TDP_INBDFLUSH;
1226 * Set B_CACHE, indicating that the buffer is fully valid. This is
1227 * true even of NFS now.
1229 bp->b_flags |= B_CACHE;
1232 * This bmap keeps the system from needing to do the bmap later,
1233 * perhaps when the system is attempting to do a sync. Since it
1234 * is likely that the indirect block -- or whatever other datastructure
1235 * that the filesystem needs is still in memory now, it is a good
1236 * thing to do this. Note also, that if the pageout daemon is
1237 * requesting a sync -- there might not be enough memory to do
1238 * the bmap then... So, this is important to do.
1240 if (vp->v_type != VCHR && bp->b_lblkno == bp->b_blkno) {
1241 VOP_BMAP(vp, bp->b_lblkno, NULL, &bp->b_blkno, NULL, NULL);
1245 * Set the *dirty* buffer range based upon the VM system dirty
1248 * Mark the buffer pages as clean. We need to do this here to
1249 * satisfy the vnode_pager and the pageout daemon, so that it
1250 * thinks that the pages have been "cleaned". Note that since
1251 * the pages are in a delayed write buffer -- the VFS layer
1252 * "will" see that the pages get written out on the next sync,
1253 * or perhaps the cluster will be completed.
1255 vfs_clean_pages_dirty_buf(bp);
1259 * Wakeup the buffer flushing daemon if we have a lot of dirty
1260 * buffers (midpoint between our recovery point and our stall
1263 bd_wakeup((lodirtybuffers + hidirtybuffers) / 2);
1266 * note: we cannot initiate I/O from a bdwrite even if we wanted to,
1267 * due to the softdep code.
1274 * Turn buffer into delayed write request. We must clear BIO_READ and
1275 * B_RELBUF, and we must set B_DELWRI. We reassign the buffer to
1276 * itself to properly update it in the dirty/clean lists. We mark it
1277 * B_DONE to ensure that any asynchronization of the buffer properly
1278 * clears B_DONE ( else a panic will occur later ).
1280 * bdirty() is kinda like bdwrite() - we have to clear B_INVAL which
1281 * might have been set pre-getblk(). Unlike bwrite/bdwrite, bdirty()
1282 * should only be called if the buffer is known-good.
1284 * Since the buffer is not on a queue, we do not update the numfreebuffers
1287 * The buffer must be on QUEUE_NONE.
1290 bdirty(struct buf *bp)
1293 CTR3(KTR_BUF, "bdirty(%p) vp %p flags %X",
1294 bp, bp->b_vp, bp->b_flags);
1295 KASSERT(bp->b_bufobj != NULL, ("No b_bufobj %p", bp));
1296 KASSERT(bp->b_flags & B_REMFREE || bp->b_qindex == QUEUE_NONE,
1297 ("bdirty: buffer %p still on queue %d", bp, bp->b_qindex));
1298 BUF_ASSERT_HELD(bp);
1299 bp->b_flags &= ~(B_RELBUF);
1300 bp->b_iocmd = BIO_WRITE;
1302 if ((bp->b_flags & B_DELWRI) == 0) {
1303 bp->b_flags |= /* XXX B_DONE | */ B_DELWRI;
1305 atomic_add_int(&numdirtybuffers, 1);
1306 bd_wakeup((lodirtybuffers + hidirtybuffers) / 2);
1313 * Clear B_DELWRI for buffer.
1315 * Since the buffer is not on a queue, we do not update the numfreebuffers
1318 * The buffer must be on QUEUE_NONE.
1322 bundirty(struct buf *bp)
1325 CTR3(KTR_BUF, "bundirty(%p) vp %p flags %X", bp, bp->b_vp, bp->b_flags);
1326 KASSERT(bp->b_bufobj != NULL, ("No b_bufobj %p", bp));
1327 KASSERT(bp->b_flags & B_REMFREE || bp->b_qindex == QUEUE_NONE,
1328 ("bundirty: buffer %p still on queue %d", bp, bp->b_qindex));
1329 BUF_ASSERT_HELD(bp);
1331 if (bp->b_flags & B_DELWRI) {
1332 bp->b_flags &= ~B_DELWRI;
1334 atomic_subtract_int(&numdirtybuffers, 1);
1335 numdirtywakeup(lodirtybuffers);
1338 * Since it is now being written, we can clear its deferred write flag.
1340 bp->b_flags &= ~B_DEFERRED;
1346 * Asynchronous write. Start output on a buffer, but do not wait for
1347 * it to complete. The buffer is released when the output completes.
1349 * bwrite() ( or the VOP routine anyway ) is responsible for handling
1350 * B_INVAL buffers. Not us.
1353 bawrite(struct buf *bp)
1356 bp->b_flags |= B_ASYNC;
1363 * Asynchronous barrier write. Start output on a buffer, but do not
1364 * wait for it to complete. Place a write barrier after this write so
1365 * that this buffer and all buffers written before it are committed to
1366 * the disk before any buffers written after this write are committed
1367 * to the disk. The buffer is released when the output completes.
1370 babarrierwrite(struct buf *bp)
1373 bp->b_flags |= B_ASYNC | B_BARRIER;
1380 * Synchronous barrier write. Start output on a buffer and wait for
1381 * it to complete. Place a write barrier after this write so that
1382 * this buffer and all buffers written before it are committed to
1383 * the disk before any buffers written after this write are committed
1384 * to the disk. The buffer is released when the output completes.
1387 bbarrierwrite(struct buf *bp)
1390 bp->b_flags |= B_BARRIER;
1391 return (bwrite(bp));
1397 * Called prior to the locking of any vnodes when we are expecting to
1398 * write. We do not want to starve the buffer cache with too many
1399 * dirty buffers so we block here. By blocking prior to the locking
1400 * of any vnodes we attempt to avoid the situation where a locked vnode
1401 * prevents the various system daemons from flushing related buffers.
1408 if (numdirtybuffers >= hidirtybuffers) {
1410 while (numdirtybuffers >= hidirtybuffers) {
1412 needsbuffer |= VFS_BIO_NEED_DIRTYFLUSH;
1413 msleep(&needsbuffer, &nblock,
1414 (PRIBIO + 4), "flswai", 0);
1416 mtx_unlock(&nblock);
1421 * Return true if we have too many dirty buffers.
1424 buf_dirty_count_severe(void)
1427 return(numdirtybuffers >= hidirtybuffers);
1430 static __noinline int
1431 buf_vm_page_count_severe(void)
1434 KFAIL_POINT_CODE(DEBUG_FP, buf_pressure, return 1);
1436 return vm_page_count_severe();
1442 * Release a busy buffer and, if requested, free its resources. The
1443 * buffer will be stashed in the appropriate bufqueue[] allowing it
1444 * to be accessed later as a cache entity or reused for other purposes.
1447 brelse(struct buf *bp)
1449 CTR3(KTR_BUF, "brelse(%p) vp %p flags %X",
1450 bp, bp->b_vp, bp->b_flags);
1451 KASSERT(!(bp->b_flags & (B_CLUSTER|B_PAGING)),
1452 ("brelse: inappropriate B_PAGING or B_CLUSTER bp %p", bp));
1454 if (BUF_LOCKRECURSED(bp)) {
1456 * Do not process, in particular, do not handle the
1457 * B_INVAL/B_RELBUF and do not release to free list.
1463 if (bp->b_flags & B_MANAGED) {
1468 if (bp->b_iocmd == BIO_WRITE && (bp->b_ioflags & BIO_ERROR) &&
1469 bp->b_error == EIO && !(bp->b_flags & B_INVAL)) {
1471 * Failed write, redirty. Must clear BIO_ERROR to prevent
1472 * pages from being scrapped. If the error is anything
1473 * other than an I/O error (EIO), assume that retrying
1476 bp->b_ioflags &= ~BIO_ERROR;
1478 } else if ((bp->b_flags & (B_NOCACHE | B_INVAL)) ||
1479 (bp->b_ioflags & BIO_ERROR) || (bp->b_bufsize <= 0)) {
1481 * Either a failed I/O or we were asked to free or not
1484 bp->b_flags |= B_INVAL;
1485 if (!LIST_EMPTY(&bp->b_dep))
1487 if (bp->b_flags & B_DELWRI) {
1488 atomic_subtract_int(&numdirtybuffers, 1);
1489 numdirtywakeup(lodirtybuffers);
1491 bp->b_flags &= ~(B_DELWRI | B_CACHE);
1492 if ((bp->b_flags & B_VMIO) == 0) {
1501 * We must clear B_RELBUF if B_DELWRI is set. If vfs_vmio_release()
1502 * is called with B_DELWRI set, the underlying pages may wind up
1503 * getting freed causing a previous write (bdwrite()) to get 'lost'
1504 * because pages associated with a B_DELWRI bp are marked clean.
1506 * We still allow the B_INVAL case to call vfs_vmio_release(), even
1507 * if B_DELWRI is set.
1509 * If B_DELWRI is not set we may have to set B_RELBUF if we are low
1510 * on pages to return pages to the VM page queues.
1512 if (bp->b_flags & B_DELWRI)
1513 bp->b_flags &= ~B_RELBUF;
1514 else if (buf_vm_page_count_severe()) {
1516 * The locking of the BO_LOCK is not necessary since
1517 * BKGRDINPROG cannot be set while we hold the buf
1518 * lock, it can only be cleared if it is already
1522 if (!(bp->b_vflags & BV_BKGRDINPROG))
1523 bp->b_flags |= B_RELBUF;
1525 bp->b_flags |= B_RELBUF;
1529 * VMIO buffer rundown. It is not very necessary to keep a VMIO buffer
1530 * constituted, not even NFS buffers now. Two flags effect this. If
1531 * B_INVAL, the struct buf is invalidated but the VM object is kept
1532 * around ( i.e. so it is trivial to reconstitute the buffer later ).
1534 * If BIO_ERROR or B_NOCACHE is set, pages in the VM object will be
1535 * invalidated. BIO_ERROR cannot be set for a failed write unless the
1536 * buffer is also B_INVAL because it hits the re-dirtying code above.
1538 * Normally we can do this whether a buffer is B_DELWRI or not. If
1539 * the buffer is an NFS buffer, it is tracking piecemeal writes or
1540 * the commit state and we cannot afford to lose the buffer. If the
1541 * buffer has a background write in progress, we need to keep it
1542 * around to prevent it from being reconstituted and starting a second
1545 if ((bp->b_flags & B_VMIO)
1546 && !(bp->b_vp->v_mount != NULL &&
1547 (bp->b_vp->v_mount->mnt_vfc->vfc_flags & VFCF_NETWORK) != 0 &&
1548 !vn_isdisk(bp->b_vp, NULL) &&
1549 (bp->b_flags & B_DELWRI))
1558 obj = bp->b_bufobj->bo_object;
1561 * Get the base offset and length of the buffer. Note that
1562 * in the VMIO case if the buffer block size is not
1563 * page-aligned then b_data pointer may not be page-aligned.
1564 * But our b_pages[] array *IS* page aligned.
1566 * block sizes less then DEV_BSIZE (usually 512) are not
1567 * supported due to the page granularity bits (m->valid,
1568 * m->dirty, etc...).
1570 * See man buf(9) for more information
1572 resid = bp->b_bufsize;
1573 foff = bp->b_offset;
1574 VM_OBJECT_LOCK(obj);
1575 for (i = 0; i < bp->b_npages; i++) {
1581 * If we hit a bogus page, fixup *all* the bogus pages
1584 if (m == bogus_page) {
1585 poff = OFF_TO_IDX(bp->b_offset);
1588 for (j = i; j < bp->b_npages; j++) {
1590 mtmp = bp->b_pages[j];
1591 if (mtmp == bogus_page) {
1592 mtmp = vm_page_lookup(obj, poff + j);
1594 panic("brelse: page missing\n");
1596 bp->b_pages[j] = mtmp;
1600 if ((bp->b_flags & (B_INVAL | B_UNMAPPED)) == 0) {
1601 BUF_CHECK_MAPPED(bp);
1603 trunc_page((vm_offset_t)bp->b_data),
1604 bp->b_pages, bp->b_npages);
1608 if ((bp->b_flags & B_NOCACHE) ||
1609 (bp->b_ioflags & BIO_ERROR &&
1610 bp->b_iocmd == BIO_READ)) {
1611 int poffset = foff & PAGE_MASK;
1612 int presid = resid > (PAGE_SIZE - poffset) ?
1613 (PAGE_SIZE - poffset) : resid;
1615 KASSERT(presid >= 0, ("brelse: extra page"));
1616 vm_page_set_invalid(m, poffset, presid);
1618 printf("avoided corruption bug in bogus_page/brelse code\n");
1620 resid -= PAGE_SIZE - (foff & PAGE_MASK);
1621 foff = (foff + PAGE_SIZE) & ~(off_t)PAGE_MASK;
1623 VM_OBJECT_UNLOCK(obj);
1624 if (bp->b_flags & (B_INVAL | B_RELBUF))
1625 vfs_vmio_release(bp);
1627 } else if (bp->b_flags & B_VMIO) {
1629 if (bp->b_flags & (B_INVAL | B_RELBUF)) {
1630 vfs_vmio_release(bp);
1633 } else if ((bp->b_flags & (B_INVAL | B_RELBUF)) != 0) {
1634 if (bp->b_bufsize != 0)
1636 if (bp->b_vp != NULL)
1642 /* Handle delayed bremfree() processing. */
1643 if (bp->b_flags & B_REMFREE) {
1653 if (bp->b_qindex != QUEUE_NONE)
1654 panic("brelse: free buffer onto another queue???");
1657 * If the buffer has junk contents signal it and eventually
1658 * clean up B_DELWRI and diassociate the vnode so that gbincore()
1661 if (bp->b_bufsize == 0 || (bp->b_ioflags & BIO_ERROR) != 0 ||
1662 (bp->b_flags & (B_INVAL | B_NOCACHE | B_RELBUF)) != 0)
1663 bp->b_flags |= B_INVAL;
1664 if (bp->b_flags & B_INVAL) {
1665 if (bp->b_flags & B_DELWRI)
1671 /* buffers with no memory */
1672 if (bp->b_bufsize == 0) {
1673 bp->b_xflags &= ~(BX_BKGRDWRITE | BX_ALTDATA);
1674 if (bp->b_vflags & BV_BKGRDINPROG)
1675 panic("losing buffer 1");
1676 if (bp->b_kvasize) {
1677 bp->b_qindex = QUEUE_EMPTYKVA;
1679 bp->b_qindex = QUEUE_EMPTY;
1681 TAILQ_INSERT_HEAD(&bufqueues[bp->b_qindex], bp, b_freelist);
1682 /* buffers with junk contents */
1683 } else if (bp->b_flags & (B_INVAL | B_NOCACHE | B_RELBUF) ||
1684 (bp->b_ioflags & BIO_ERROR)) {
1685 bp->b_xflags &= ~(BX_BKGRDWRITE | BX_ALTDATA);
1686 if (bp->b_vflags & BV_BKGRDINPROG)
1687 panic("losing buffer 2");
1688 bp->b_qindex = QUEUE_CLEAN;
1689 TAILQ_INSERT_HEAD(&bufqueues[QUEUE_CLEAN], bp, b_freelist);
1690 /* remaining buffers */
1692 if ((bp->b_flags & (B_DELWRI|B_NEEDSGIANT)) ==
1693 (B_DELWRI|B_NEEDSGIANT))
1694 bp->b_qindex = QUEUE_DIRTY_GIANT;
1695 else if (bp->b_flags & B_DELWRI)
1696 bp->b_qindex = QUEUE_DIRTY;
1698 bp->b_qindex = QUEUE_CLEAN;
1699 if (bp->b_flags & B_AGE) {
1700 TAILQ_INSERT_HEAD(&bufqueues[bp->b_qindex], bp,
1703 TAILQ_INSERT_TAIL(&bufqueues[bp->b_qindex], bp,
1708 bq_len[bp->b_qindex]++;
1710 mtx_unlock(&bqlock);
1713 * Fixup numfreebuffers count. The bp is on an appropriate queue
1714 * unless locked. We then bump numfreebuffers if it is not B_DELWRI.
1715 * We've already handled the B_INVAL case ( B_DELWRI will be clear
1716 * if B_INVAL is set ).
1719 if (!(bp->b_flags & B_DELWRI)) {
1731 * Something we can maybe free or reuse
1733 if (bp->b_bufsize || bp->b_kvasize)
1736 bp->b_flags &= ~(B_ASYNC | B_NOCACHE | B_AGE | B_RELBUF | B_DIRECT);
1737 if ((bp->b_flags & B_DELWRI) == 0 && (bp->b_xflags & BX_VNDIRTY))
1738 panic("brelse: not dirty");
1744 * Release a buffer back to the appropriate queue but do not try to free
1745 * it. The buffer is expected to be used again soon.
1747 * bqrelse() is used by bdwrite() to requeue a delayed write, and used by
1748 * biodone() to requeue an async I/O on completion. It is also used when
1749 * known good buffers need to be requeued but we think we may need the data
1752 * XXX we should be able to leave the B_RELBUF hint set on completion.
1755 bqrelse(struct buf *bp)
1759 CTR3(KTR_BUF, "bqrelse(%p) vp %p flags %X", bp, bp->b_vp, bp->b_flags);
1760 KASSERT(!(bp->b_flags & (B_CLUSTER|B_PAGING)),
1761 ("bqrelse: inappropriate B_PAGING or B_CLUSTER bp %p", bp));
1763 if (BUF_LOCKRECURSED(bp)) {
1764 /* do not release to free list */
1770 if (bp->b_flags & B_MANAGED) {
1771 if (bp->b_flags & B_REMFREE) {
1778 mtx_unlock(&bqlock);
1780 bp->b_flags &= ~(B_ASYNC | B_NOCACHE | B_AGE | B_RELBUF);
1786 /* Handle delayed bremfree() processing. */
1787 if (bp->b_flags & B_REMFREE) {
1794 if (bp->b_qindex != QUEUE_NONE)
1795 panic("bqrelse: free buffer onto another queue???");
1796 /* buffers with stale but valid contents */
1797 if (bp->b_flags & B_DELWRI) {
1798 if (bp->b_flags & B_NEEDSGIANT)
1799 bp->b_qindex = QUEUE_DIRTY_GIANT;
1801 bp->b_qindex = QUEUE_DIRTY;
1802 TAILQ_INSERT_TAIL(&bufqueues[bp->b_qindex], bp, b_freelist);
1804 bq_len[bp->b_qindex]++;
1808 * The locking of the BO_LOCK for checking of the
1809 * BV_BKGRDINPROG is not necessary since the
1810 * BV_BKGRDINPROG cannot be set while we hold the buf
1811 * lock, it can only be cleared if it is already
1814 if (!buf_vm_page_count_severe() || (bp->b_vflags & BV_BKGRDINPROG)) {
1815 bp->b_qindex = QUEUE_CLEAN;
1816 TAILQ_INSERT_TAIL(&bufqueues[QUEUE_CLEAN], bp,
1819 bq_len[QUEUE_CLEAN]++;
1823 * We are too low on memory, we have to try to free
1824 * the buffer (most importantly: the wired pages
1825 * making up its backing store) *now*.
1827 mtx_unlock(&bqlock);
1832 mtx_unlock(&bqlock);
1834 if ((bp->b_flags & B_INVAL) || !(bp->b_flags & B_DELWRI)) {
1843 * Something we can maybe free or reuse.
1845 if (bp->b_bufsize && !(bp->b_flags & B_DELWRI))
1848 bp->b_flags &= ~(B_ASYNC | B_NOCACHE | B_AGE | B_RELBUF);
1849 if ((bp->b_flags & B_DELWRI) == 0 && (bp->b_xflags & BX_VNDIRTY))
1850 panic("bqrelse: not dirty");
1855 /* Give pages used by the bp back to the VM system (where possible) */
1857 vfs_vmio_release(struct buf *bp)
1862 if ((bp->b_flags & B_UNMAPPED) == 0) {
1863 BUF_CHECK_MAPPED(bp);
1864 pmap_qremove(trunc_page((vm_offset_t)bp->b_data), bp->b_npages);
1866 BUF_CHECK_UNMAPPED(bp);
1867 VM_OBJECT_LOCK(bp->b_bufobj->bo_object);
1868 for (i = 0; i < bp->b_npages; i++) {
1870 bp->b_pages[i] = NULL;
1872 * In order to keep page LRU ordering consistent, put
1873 * everything on the inactive queue.
1876 vm_page_unwire(m, 0);
1878 * We don't mess with busy pages, it is
1879 * the responsibility of the process that
1880 * busied the pages to deal with them.
1882 if ((m->oflags & VPO_BUSY) == 0 && m->busy == 0 &&
1883 m->wire_count == 0) {
1885 * Might as well free the page if we can and it has
1886 * no valid data. We also free the page if the
1887 * buffer was used for direct I/O
1889 if ((bp->b_flags & B_ASYNC) == 0 && !m->valid) {
1891 } else if (bp->b_flags & B_DIRECT) {
1892 vm_page_try_to_free(m);
1893 } else if (buf_vm_page_count_severe()) {
1894 vm_page_try_to_cache(m);
1899 VM_OBJECT_UNLOCK(bp->b_bufobj->bo_object);
1901 if (bp->b_bufsize) {
1906 bp->b_flags &= ~B_VMIO;
1912 * Check to see if a block at a particular lbn is available for a clustered
1916 vfs_bio_clcheck(struct vnode *vp, int size, daddr_t lblkno, daddr_t blkno)
1923 /* If the buf isn't in core skip it */
1924 if ((bpa = gbincore(&vp->v_bufobj, lblkno)) == NULL)
1927 /* If the buf is busy we don't want to wait for it */
1928 if (BUF_LOCK(bpa, LK_EXCLUSIVE | LK_NOWAIT, NULL) != 0)
1931 /* Only cluster with valid clusterable delayed write buffers */
1932 if ((bpa->b_flags & (B_DELWRI | B_CLUSTEROK | B_INVAL)) !=
1933 (B_DELWRI | B_CLUSTEROK))
1936 if (bpa->b_bufsize != size)
1940 * Check to see if it is in the expected place on disk and that the
1941 * block has been mapped.
1943 if ((bpa->b_blkno != bpa->b_lblkno) && (bpa->b_blkno == blkno))
1953 * Implement clustered async writes for clearing out B_DELWRI buffers.
1954 * This is much better then the old way of writing only one buffer at
1955 * a time. Note that we may not be presented with the buffers in the
1956 * correct order, so we search for the cluster in both directions.
1959 vfs_bio_awrite(struct buf *bp)
1964 daddr_t lblkno = bp->b_lblkno;
1965 struct vnode *vp = bp->b_vp;
1973 gbflags = (bp->b_flags & B_UNMAPPED) != 0 ? GB_UNMAPPED : 0;
1975 * right now we support clustered writing only to regular files. If
1976 * we find a clusterable block we could be in the middle of a cluster
1977 * rather then at the beginning.
1979 if ((vp->v_type == VREG) &&
1980 (vp->v_mount != 0) && /* Only on nodes that have the size info */
1981 (bp->b_flags & (B_CLUSTEROK | B_INVAL)) == B_CLUSTEROK) {
1983 size = vp->v_mount->mnt_stat.f_iosize;
1984 maxcl = MAXPHYS / size;
1987 for (i = 1; i < maxcl; i++)
1988 if (vfs_bio_clcheck(vp, size, lblkno + i,
1989 bp->b_blkno + ((i * size) >> DEV_BSHIFT)) == 0)
1992 for (j = 1; i + j <= maxcl && j <= lblkno; j++)
1993 if (vfs_bio_clcheck(vp, size, lblkno - j,
1994 bp->b_blkno - ((j * size) >> DEV_BSHIFT)) == 0)
2000 * this is a possible cluster write
2004 nwritten = cluster_wbuild_gb(vp, size, lblkno - j,
2010 bp->b_flags |= B_ASYNC;
2012 * default (old) behavior, writing out only one block
2014 * XXX returns b_bufsize instead of b_bcount for nwritten?
2016 nwritten = bp->b_bufsize;
2023 setbufkva(struct buf *bp, vm_offset_t addr, int maxsize, int gbflags)
2026 KASSERT((bp->b_flags & (B_UNMAPPED | B_KVAALLOC)) == 0 &&
2027 bp->b_kvasize == 0, ("call bfreekva(%p)", bp));
2028 if ((gbflags & GB_UNMAPPED) == 0) {
2029 bp->b_kvabase = (caddr_t)addr;
2030 } else if ((gbflags & GB_KVAALLOC) != 0) {
2031 KASSERT((gbflags & GB_UNMAPPED) != 0,
2032 ("GB_KVAALLOC without GB_UNMAPPED"));
2033 bp->b_kvaalloc = (caddr_t)addr;
2034 bp->b_flags |= B_UNMAPPED | B_KVAALLOC;
2035 atomic_add_long(&unmapped_bufspace, bp->b_kvasize);
2037 bp->b_kvasize = maxsize;
2041 * Allocate the buffer KVA and set b_kvasize. Also set b_kvabase if
2045 allocbufkva(struct buf *bp, int maxsize, int gbflags)
2053 vm_map_lock(buffer_map);
2054 if (vm_map_findspace(buffer_map, vm_map_min(buffer_map), maxsize,
2056 vm_map_unlock(buffer_map);
2058 * Buffer map is too fragmented. Request the caller
2059 * to defragment the map.
2061 atomic_add_int(&bufdefragcnt, 1);
2064 rv = vm_map_insert(buffer_map, NULL, 0, addr, addr + maxsize,
2065 VM_PROT_RW, VM_PROT_RW, MAP_NOFAULT);
2066 KASSERT(rv == KERN_SUCCESS, ("vm_map_insert(buffer_map) rv %d", rv));
2067 vm_map_unlock(buffer_map);
2068 setbufkva(bp, addr, maxsize, gbflags);
2069 atomic_add_long(&bufspace, bp->b_kvasize);
2074 * Ask the bufdaemon for help, or act as bufdaemon itself, when a
2075 * locked vnode is supplied.
2078 getnewbuf_bufd_help(struct vnode *vp, int gbflags, int slpflag, int slptimeo,
2083 int fl, flags, norunbuf;
2085 mtx_assert(&bqlock, MA_OWNED);
2088 flags = VFS_BIO_NEED_BUFSPACE;
2090 } else if (bufspace >= hibufspace) {
2092 flags = VFS_BIO_NEED_BUFSPACE;
2095 flags = VFS_BIO_NEED_ANY;
2098 needsbuffer |= flags;
2099 mtx_unlock(&nblock);
2100 mtx_unlock(&bqlock);
2102 bd_speedup(); /* heeeelp */
2103 if ((gbflags & GB_NOWAIT_BD) != 0)
2108 while (needsbuffer & flags) {
2109 if (vp != NULL && (td->td_pflags & TDP_BUFNEED) == 0) {
2110 mtx_unlock(&nblock);
2112 * getblk() is called with a vnode locked, and
2113 * some majority of the dirty buffers may as
2114 * well belong to the vnode. Flushing the
2115 * buffers there would make a progress that
2116 * cannot be achieved by the buf_daemon, that
2117 * cannot lock the vnode.
2119 norunbuf = ~(TDP_BUFNEED | TDP_NORUNNINGBUF) |
2120 (td->td_pflags & TDP_NORUNNINGBUF);
2121 /* play bufdaemon */
2122 td->td_pflags |= TDP_BUFNEED | TDP_NORUNNINGBUF;
2123 fl = buf_do_flush(vp);
2124 td->td_pflags &= norunbuf;
2128 if ((needsbuffer & flags) == 0)
2131 if (msleep(&needsbuffer, &nblock, (PRIBIO + 4) | slpflag,
2135 mtx_unlock(&nblock);
2139 getnewbuf_reuse_bp(struct buf *bp, int qindex)
2142 CTR6(KTR_BUF, "getnewbuf(%p) vp %p flags %X kvasize %d bufsize %d "
2143 "queue %d (recycling)", bp, bp->b_vp, bp->b_flags,
2144 bp->b_kvasize, bp->b_bufsize, qindex);
2145 mtx_assert(&bqlock, MA_NOTOWNED);
2148 * Note: we no longer distinguish between VMIO and non-VMIO
2151 KASSERT((bp->b_flags & B_DELWRI) == 0,
2152 ("delwri buffer %p found in queue %d", bp, qindex));
2154 if (qindex == QUEUE_CLEAN) {
2155 if (bp->b_flags & B_VMIO) {
2156 bp->b_flags &= ~B_ASYNC;
2157 vfs_vmio_release(bp);
2159 if (bp->b_vp != NULL)
2164 * Get the rest of the buffer freed up. b_kva* is still valid
2165 * after this operation.
2168 if (bp->b_rcred != NOCRED) {
2169 crfree(bp->b_rcred);
2170 bp->b_rcred = NOCRED;
2172 if (bp->b_wcred != NOCRED) {
2173 crfree(bp->b_wcred);
2174 bp->b_wcred = NOCRED;
2176 if (!LIST_EMPTY(&bp->b_dep))
2178 if (bp->b_vflags & BV_BKGRDINPROG)
2179 panic("losing buffer 3");
2180 KASSERT(bp->b_vp == NULL, ("bp: %p still has vnode %p. qindex: %d",
2181 bp, bp->b_vp, qindex));
2182 KASSERT((bp->b_xflags & (BX_VNCLEAN|BX_VNDIRTY)) == 0,
2183 ("bp: %p still on a buffer list. xflags %X", bp, bp->b_xflags));
2188 bp->b_flags &= B_UNMAPPED | B_KVAALLOC;
2191 KASSERT((bp->b_vflags & BV_INFREECNT) == 0,
2192 ("buf %p still counted as free?", bp));
2195 bp->b_blkno = bp->b_lblkno = 0;
2196 bp->b_offset = NOOFFSET;
2202 bp->b_dirtyoff = bp->b_dirtyend = 0;
2203 bp->b_bufobj = NULL;
2204 bp->b_pin_count = 0;
2205 bp->b_fsprivate1 = NULL;
2206 bp->b_fsprivate2 = NULL;
2207 bp->b_fsprivate3 = NULL;
2209 LIST_INIT(&bp->b_dep);
2212 static int flushingbufs;
2215 getnewbuf_scan(int maxsize, int defrag, int unmapped, int metadata)
2217 struct buf *bp, *nbp;
2218 int nqindex, qindex, pass;
2220 KASSERT(!unmapped || !defrag, ("both unmapped and defrag"));
2224 atomic_add_int(&getnewbufrestarts, 1);
2227 * Setup for scan. If we do not have enough free buffers,
2228 * we setup a degenerate case that immediately fails. Note
2229 * that if we are specially marked process, we are allowed to
2230 * dip into our reserves.
2232 * The scanning sequence is nominally: EMPTY->EMPTYKVA->CLEAN
2233 * for the allocation of the mapped buffer. For unmapped, the
2234 * easiest is to start with EMPTY outright.
2236 * We start with EMPTYKVA. If the list is empty we backup to EMPTY.
2237 * However, there are a number of cases (defragging, reusing, ...)
2238 * where we cannot backup.
2242 if (!defrag && unmapped) {
2243 nqindex = QUEUE_EMPTY;
2244 nbp = TAILQ_FIRST(&bufqueues[QUEUE_EMPTY]);
2247 nqindex = QUEUE_EMPTYKVA;
2248 nbp = TAILQ_FIRST(&bufqueues[QUEUE_EMPTYKVA]);
2252 * If no EMPTYKVA buffers and we are either defragging or
2253 * reusing, locate a CLEAN buffer to free or reuse. If
2254 * bufspace useage is low skip this step so we can allocate a
2257 if (nbp == NULL && (defrag || bufspace >= lobufspace)) {
2258 nqindex = QUEUE_CLEAN;
2259 nbp = TAILQ_FIRST(&bufqueues[QUEUE_CLEAN]);
2263 * If we could not find or were not allowed to reuse a CLEAN
2264 * buffer, check to see if it is ok to use an EMPTY buffer.
2265 * We can only use an EMPTY buffer if allocating its KVA would
2266 * not otherwise run us out of buffer space. No KVA is needed
2267 * for the unmapped allocation.
2269 if (nbp == NULL && defrag == 0 && (bufspace + maxsize < hibufspace ||
2271 nqindex = QUEUE_EMPTY;
2272 nbp = TAILQ_FIRST(&bufqueues[QUEUE_EMPTY]);
2276 * All available buffers might be clean, retry ignoring the
2277 * lobufspace as the last resort.
2279 if (nbp == NULL && !TAILQ_EMPTY(&bufqueues[QUEUE_CLEAN])) {
2280 nqindex = QUEUE_CLEAN;
2281 nbp = TAILQ_FIRST(&bufqueues[QUEUE_CLEAN]);
2285 * Run scan, possibly freeing data and/or kva mappings on the fly
2288 while ((bp = nbp) != NULL) {
2292 * Calculate next bp (we can only use it if we do not
2293 * block or do other fancy things).
2295 if ((nbp = TAILQ_NEXT(bp, b_freelist)) == NULL) {
2298 nqindex = QUEUE_EMPTYKVA;
2299 nbp = TAILQ_FIRST(&bufqueues[QUEUE_EMPTYKVA]);
2303 case QUEUE_EMPTYKVA:
2304 nqindex = QUEUE_CLEAN;
2305 nbp = TAILQ_FIRST(&bufqueues[QUEUE_CLEAN]);
2310 if (metadata && pass == 1) {
2312 nqindex = QUEUE_EMPTY;
2314 &bufqueues[QUEUE_EMPTY]);
2323 * If we are defragging then we need a buffer with
2324 * b_kvasize != 0. XXX this situation should no longer
2325 * occur, if defrag is non-zero the buffer's b_kvasize
2326 * should also be non-zero at this point. XXX
2328 if (defrag && bp->b_kvasize == 0) {
2329 printf("Warning: defrag empty buffer %p\n", bp);
2334 * Start freeing the bp. This is somewhat involved. nbp
2335 * remains valid only for QUEUE_EMPTY[KVA] bp's.
2337 if (BUF_LOCK(bp, LK_EXCLUSIVE | LK_NOWAIT, NULL) != 0)
2340 BO_LOCK(bp->b_bufobj);
2341 if (bp->b_vflags & BV_BKGRDINPROG) {
2342 BO_UNLOCK(bp->b_bufobj);
2346 BO_UNLOCK(bp->b_bufobj);
2349 KASSERT(bp->b_qindex == qindex,
2350 ("getnewbuf: inconsistent queue %d bp %p", qindex, bp));
2352 if (bp->b_bufobj != NULL)
2353 BO_LOCK(bp->b_bufobj);
2355 if (bp->b_bufobj != NULL)
2356 BO_UNLOCK(bp->b_bufobj);
2357 mtx_unlock(&bqlock);
2359 * NOTE: nbp is now entirely invalid. We can only restart
2360 * the scan from this point on.
2363 getnewbuf_reuse_bp(bp, qindex);
2364 mtx_assert(&bqlock, MA_NOTOWNED);
2367 * If we are defragging then free the buffer.
2370 bp->b_flags |= B_INVAL;
2378 * Notify any waiters for the buffer lock about
2379 * identity change by freeing the buffer.
2381 if (qindex == QUEUE_CLEAN && BUF_LOCKWAITERS(bp)) {
2382 bp->b_flags |= B_INVAL;
2392 * If we are overcomitted then recover the buffer and its
2393 * KVM space. This occurs in rare situations when multiple
2394 * processes are blocked in getnewbuf() or allocbuf().
2396 if (bufspace >= hibufspace)
2398 if (flushingbufs && bp->b_kvasize != 0) {
2399 bp->b_flags |= B_INVAL;
2404 if (bufspace < lobufspace)
2414 * Find and initialize a new buffer header, freeing up existing buffers
2415 * in the bufqueues as necessary. The new buffer is returned locked.
2417 * Important: B_INVAL is not set. If the caller wishes to throw the
2418 * buffer away, the caller must set B_INVAL prior to calling brelse().
2421 * We have insufficient buffer headers
2422 * We have insufficient buffer space
2423 * buffer_map is too fragmented ( space reservation fails )
2424 * If we have to flush dirty buffers ( but we try to avoid this )
2426 * To avoid VFS layer recursion we do not flush dirty buffers ourselves.
2427 * Instead we ask the buf daemon to do it for us. We attempt to
2428 * avoid piecemeal wakeups of the pageout daemon.
2431 getnewbuf(struct vnode *vp, int slpflag, int slptimeo, int size, int maxsize,
2435 int defrag, metadata;
2437 KASSERT((gbflags & (GB_UNMAPPED | GB_KVAALLOC)) != GB_KVAALLOC,
2438 ("GB_KVAALLOC only makes sense with GB_UNMAPPED"));
2439 if (!unmapped_buf_allowed)
2440 gbflags &= ~(GB_UNMAPPED | GB_KVAALLOC);
2443 if (vp == NULL || (vp->v_vflag & (VV_MD | VV_SYSTEM)) != 0 ||
2449 * We can't afford to block since we might be holding a vnode lock,
2450 * which may prevent system daemons from running. We deal with
2451 * low-memory situations by proactively returning memory and running
2452 * async I/O rather then sync I/O.
2454 atomic_add_int(&getnewbufcalls, 1);
2455 atomic_subtract_int(&getnewbufrestarts, 1);
2457 bp = getnewbuf_scan(maxsize, defrag, (gbflags & (GB_UNMAPPED |
2458 GB_KVAALLOC)) == GB_UNMAPPED, metadata);
2463 * If we exhausted our list, sleep as appropriate. We may have to
2464 * wakeup various daemons and write out some dirty buffers.
2466 * Generally we are sleeping due to insufficient buffer space.
2469 mtx_assert(&bqlock, MA_OWNED);
2470 getnewbuf_bufd_help(vp, gbflags, slpflag, slptimeo, defrag);
2471 mtx_assert(&bqlock, MA_NOTOWNED);
2472 } else if ((gbflags & (GB_UNMAPPED | GB_KVAALLOC)) == GB_UNMAPPED) {
2473 mtx_assert(&bqlock, MA_NOTOWNED);
2476 bp->b_flags |= B_UNMAPPED;
2477 bp->b_kvabase = bp->b_data = unmapped_buf;
2478 bp->b_kvasize = maxsize;
2479 atomic_add_long(&bufspace, bp->b_kvasize);
2480 atomic_add_long(&unmapped_bufspace, bp->b_kvasize);
2481 atomic_add_int(&bufreusecnt, 1);
2483 mtx_assert(&bqlock, MA_NOTOWNED);
2486 * We finally have a valid bp. We aren't quite out of the
2487 * woods, we still have to reserve kva space. In order
2488 * to keep fragmentation sane we only allocate kva in
2491 maxsize = (maxsize + BKVAMASK) & ~BKVAMASK;
2493 if (maxsize != bp->b_kvasize || (bp->b_flags & (B_UNMAPPED |
2494 B_KVAALLOC)) == B_UNMAPPED) {
2495 if (allocbufkva(bp, maxsize, gbflags)) {
2497 bp->b_flags |= B_INVAL;
2501 atomic_add_int(&bufreusecnt, 1);
2502 } else if ((bp->b_flags & B_KVAALLOC) != 0 &&
2503 (gbflags & (GB_UNMAPPED | GB_KVAALLOC)) == 0) {
2505 * If the reused buffer has KVA allocated,
2506 * reassign b_kvaalloc to b_kvabase.
2508 bp->b_kvabase = bp->b_kvaalloc;
2509 bp->b_flags &= ~B_KVAALLOC;
2510 atomic_subtract_long(&unmapped_bufspace,
2512 atomic_add_int(&bufreusecnt, 1);
2513 } else if ((bp->b_flags & (B_UNMAPPED | B_KVAALLOC)) == 0 &&
2514 (gbflags & (GB_UNMAPPED | GB_KVAALLOC)) == (GB_UNMAPPED |
2517 * The case of reused buffer already have KVA
2518 * mapped, but the request is for unmapped
2519 * buffer with KVA allocated.
2521 bp->b_kvaalloc = bp->b_kvabase;
2522 bp->b_data = bp->b_kvabase = unmapped_buf;
2523 bp->b_flags |= B_UNMAPPED | B_KVAALLOC;
2524 atomic_add_long(&unmapped_bufspace,
2526 atomic_add_int(&bufreusecnt, 1);
2528 if ((gbflags & GB_UNMAPPED) == 0) {
2529 bp->b_saveaddr = bp->b_kvabase;
2530 bp->b_data = bp->b_saveaddr;
2531 bp->b_flags &= ~B_UNMAPPED;
2532 BUF_CHECK_MAPPED(bp);
2541 * buffer flushing daemon. Buffers are normally flushed by the
2542 * update daemon but if it cannot keep up this process starts to
2543 * take the load in an attempt to prevent getnewbuf() from blocking.
2546 static struct kproc_desc buf_kp = {
2551 SYSINIT(bufdaemon, SI_SUB_KTHREAD_BUF, SI_ORDER_FIRST, kproc_start, &buf_kp);
2554 buf_do_flush(struct vnode *vp)
2558 flushed = flushbufqueues(vp, QUEUE_DIRTY, 0);
2559 /* The list empty check here is slightly racy */
2560 if (!TAILQ_EMPTY(&bufqueues[QUEUE_DIRTY_GIANT])) {
2562 flushed += flushbufqueues(vp, QUEUE_DIRTY_GIANT, 0);
2567 * Could not find any buffers without rollback
2568 * dependencies, so just write the first one
2569 * in the hopes of eventually making progress.
2571 flushbufqueues(vp, QUEUE_DIRTY, 1);
2573 &bufqueues[QUEUE_DIRTY_GIANT])) {
2575 flushbufqueues(vp, QUEUE_DIRTY_GIANT, 1);
2588 * This process needs to be suspended prior to shutdown sync.
2590 EVENTHANDLER_REGISTER(shutdown_pre_sync, kproc_shutdown, bufdaemonproc,
2594 * This process is allowed to take the buffer cache to the limit
2596 curthread->td_pflags |= TDP_NORUNNINGBUF | TDP_BUFNEED;
2600 mtx_unlock(&bdlock);
2602 kproc_suspend_check(bufdaemonproc);
2603 lodirtysave = lodirtybuffers;
2604 if (bd_speedupreq) {
2605 lodirtybuffers = numdirtybuffers / 2;
2609 * Do the flush. Limit the amount of in-transit I/O we
2610 * allow to build up, otherwise we would completely saturate
2611 * the I/O system. Wakeup any waiting processes before we
2612 * normally would so they can run in parallel with our drain.
2614 while (numdirtybuffers > lodirtybuffers) {
2615 if (buf_do_flush(NULL) == 0)
2617 kern_yield(PRI_UNCHANGED);
2619 lodirtybuffers = lodirtysave;
2622 * Only clear bd_request if we have reached our low water
2623 * mark. The buf_daemon normally waits 1 second and
2624 * then incrementally flushes any dirty buffers that have
2625 * built up, within reason.
2627 * If we were unable to hit our low water mark and couldn't
2628 * find any flushable buffers, we sleep half a second.
2629 * Otherwise we loop immediately.
2632 if (numdirtybuffers <= lodirtybuffers) {
2634 * We reached our low water mark, reset the
2635 * request and sleep until we are needed again.
2636 * The sleep is just so the suspend code works.
2639 msleep(&bd_request, &bdlock, PVM, "psleep", hz);
2642 * We couldn't find any flushable dirty buffers but
2643 * still have too many dirty buffers, we
2644 * have to sleep and try again. (rare)
2646 msleep(&bd_request, &bdlock, PVM, "qsleep", hz / 10);
2654 * Try to flush a buffer in the dirty queue. We must be careful to
2655 * free up B_INVAL buffers instead of write them, which NFS is
2656 * particularly sensitive to.
2658 static int flushwithdeps = 0;
2659 SYSCTL_INT(_vfs, OID_AUTO, flushwithdeps, CTLFLAG_RW, &flushwithdeps,
2660 0, "Number of buffers flushed with dependecies that require rollbacks");
2663 flushbufqueues(struct vnode *lvp, int queue, int flushdeps)
2665 struct buf *sentinel;
2674 target = numdirtybuffers - lodirtybuffers;
2675 if (flushdeps && target > 2)
2678 target = flushbufqtarget;
2681 sentinel = malloc(sizeof(struct buf), M_TEMP, M_WAITOK | M_ZERO);
2682 sentinel->b_qindex = QUEUE_SENTINEL;
2684 TAILQ_INSERT_HEAD(&bufqueues[queue], sentinel, b_freelist);
2685 while (flushed != target) {
2686 bp = TAILQ_NEXT(sentinel, b_freelist);
2688 TAILQ_REMOVE(&bufqueues[queue], sentinel, b_freelist);
2689 TAILQ_INSERT_AFTER(&bufqueues[queue], bp, sentinel,
2694 * Skip sentinels inserted by other invocations of the
2695 * flushbufqueues(), taking care to not reorder them.
2697 if (bp->b_qindex == QUEUE_SENTINEL)
2700 * Only flush the buffers that belong to the
2701 * vnode locked by the curthread.
2703 if (lvp != NULL && bp->b_vp != lvp)
2705 if (BUF_LOCK(bp, LK_EXCLUSIVE | LK_NOWAIT, NULL) != 0)
2707 if (bp->b_pin_count > 0) {
2711 BO_LOCK(bp->b_bufobj);
2712 if ((bp->b_vflags & BV_BKGRDINPROG) != 0 ||
2713 (bp->b_flags & B_DELWRI) == 0) {
2714 BO_UNLOCK(bp->b_bufobj);
2718 BO_UNLOCK(bp->b_bufobj);
2719 if (bp->b_flags & B_INVAL) {
2721 mtx_unlock(&bqlock);
2724 numdirtywakeup((lodirtybuffers + hidirtybuffers) / 2);
2729 if (!LIST_EMPTY(&bp->b_dep) && buf_countdeps(bp, 0)) {
2730 if (flushdeps == 0) {
2738 * We must hold the lock on a vnode before writing
2739 * one of its buffers. Otherwise we may confuse, or
2740 * in the case of a snapshot vnode, deadlock the
2743 * The lock order here is the reverse of the normal
2744 * of vnode followed by buf lock. This is ok because
2745 * the NOWAIT will prevent deadlock.
2748 if (vn_start_write(vp, &mp, V_NOWAIT) != 0) {
2752 if (vn_lock(vp, LK_EXCLUSIVE | LK_NOWAIT | LK_CANRECURSE) == 0) {
2753 mtx_unlock(&bqlock);
2754 CTR3(KTR_BUF, "flushbufqueue(%p) vp %p flags %X",
2755 bp, bp->b_vp, bp->b_flags);
2756 if (curproc == bufdaemonproc)
2763 vn_finished_write(mp);
2765 flushwithdeps += hasdeps;
2769 * Sleeping on runningbufspace while holding
2770 * vnode lock leads to deadlock.
2772 if (curproc == bufdaemonproc)
2773 waitrunningbufspace();
2774 numdirtywakeup((lodirtybuffers + hidirtybuffers) / 2);
2778 vn_finished_write(mp);
2781 TAILQ_REMOVE(&bufqueues[queue], sentinel, b_freelist);
2782 mtx_unlock(&bqlock);
2783 free(sentinel, M_TEMP);
2788 * Check to see if a block is currently memory resident.
2791 incore(struct bufobj *bo, daddr_t blkno)
2796 bp = gbincore(bo, blkno);
2802 * Returns true if no I/O is needed to access the
2803 * associated VM object. This is like incore except
2804 * it also hunts around in the VM system for the data.
2808 inmem(struct vnode * vp, daddr_t blkno)
2811 vm_offset_t toff, tinc, size;
2815 ASSERT_VOP_LOCKED(vp, "inmem");
2817 if (incore(&vp->v_bufobj, blkno))
2819 if (vp->v_mount == NULL)
2826 if (size > vp->v_mount->mnt_stat.f_iosize)
2827 size = vp->v_mount->mnt_stat.f_iosize;
2828 off = (vm_ooffset_t)blkno * (vm_ooffset_t)vp->v_mount->mnt_stat.f_iosize;
2830 VM_OBJECT_LOCK(obj);
2831 for (toff = 0; toff < vp->v_mount->mnt_stat.f_iosize; toff += tinc) {
2832 m = vm_page_lookup(obj, OFF_TO_IDX(off + toff));
2836 if (tinc > PAGE_SIZE - ((toff + off) & PAGE_MASK))
2837 tinc = PAGE_SIZE - ((toff + off) & PAGE_MASK);
2838 if (vm_page_is_valid(m,
2839 (vm_offset_t) ((toff + off) & PAGE_MASK), tinc) == 0)
2842 VM_OBJECT_UNLOCK(obj);
2846 VM_OBJECT_UNLOCK(obj);
2851 * Set the dirty range for a buffer based on the status of the dirty
2852 * bits in the pages comprising the buffer. The range is limited
2853 * to the size of the buffer.
2855 * Tell the VM system that the pages associated with this buffer
2856 * are clean. This is used for delayed writes where the data is
2857 * going to go to disk eventually without additional VM intevention.
2859 * Note that while we only really need to clean through to b_bcount, we
2860 * just go ahead and clean through to b_bufsize.
2863 vfs_clean_pages_dirty_buf(struct buf *bp)
2865 vm_ooffset_t foff, noff, eoff;
2869 if ((bp->b_flags & B_VMIO) == 0 || bp->b_bufsize == 0)
2872 foff = bp->b_offset;
2873 KASSERT(bp->b_offset != NOOFFSET,
2874 ("vfs_clean_pages_dirty_buf: no buffer offset"));
2876 VM_OBJECT_LOCK(bp->b_bufobj->bo_object);
2877 vfs_drain_busy_pages(bp);
2878 vfs_setdirty_locked_object(bp);
2879 for (i = 0; i < bp->b_npages; i++) {
2880 noff = (foff + PAGE_SIZE) & ~(off_t)PAGE_MASK;
2882 if (eoff > bp->b_offset + bp->b_bufsize)
2883 eoff = bp->b_offset + bp->b_bufsize;
2885 vfs_page_set_validclean(bp, foff, m);
2886 /* vm_page_clear_dirty(m, foff & PAGE_MASK, eoff - foff); */
2889 VM_OBJECT_UNLOCK(bp->b_bufobj->bo_object);
2893 vfs_setdirty_locked_object(struct buf *bp)
2898 object = bp->b_bufobj->bo_object;
2899 VM_OBJECT_LOCK_ASSERT(object, MA_OWNED);
2902 * We qualify the scan for modified pages on whether the
2903 * object has been flushed yet.
2905 if ((object->flags & OBJ_MIGHTBEDIRTY) != 0) {
2906 vm_offset_t boffset;
2907 vm_offset_t eoffset;
2910 * test the pages to see if they have been modified directly
2911 * by users through the VM system.
2913 for (i = 0; i < bp->b_npages; i++)
2914 vm_page_test_dirty(bp->b_pages[i]);
2917 * Calculate the encompassing dirty range, boffset and eoffset,
2918 * (eoffset - boffset) bytes.
2921 for (i = 0; i < bp->b_npages; i++) {
2922 if (bp->b_pages[i]->dirty)
2925 boffset = (i << PAGE_SHIFT) - (bp->b_offset & PAGE_MASK);
2927 for (i = bp->b_npages - 1; i >= 0; --i) {
2928 if (bp->b_pages[i]->dirty) {
2932 eoffset = ((i + 1) << PAGE_SHIFT) - (bp->b_offset & PAGE_MASK);
2935 * Fit it to the buffer.
2938 if (eoffset > bp->b_bcount)
2939 eoffset = bp->b_bcount;
2942 * If we have a good dirty range, merge with the existing
2946 if (boffset < eoffset) {
2947 if (bp->b_dirtyoff > boffset)
2948 bp->b_dirtyoff = boffset;
2949 if (bp->b_dirtyend < eoffset)
2950 bp->b_dirtyend = eoffset;
2956 * Allocate the KVA mapping for an existing buffer. It handles the
2957 * cases of both B_UNMAPPED buffer, and buffer with the preallocated
2958 * KVA which is not mapped (B_KVAALLOC).
2961 bp_unmapped_get_kva(struct buf *bp, daddr_t blkno, int size, int gbflags)
2963 struct buf *scratch_bp;
2964 int bsize, maxsize, need_mapping, need_kva;
2967 need_mapping = (bp->b_flags & B_UNMAPPED) != 0 &&
2968 (gbflags & GB_UNMAPPED) == 0;
2969 need_kva = (bp->b_flags & (B_KVAALLOC | B_UNMAPPED)) == B_UNMAPPED &&
2970 (gbflags & GB_KVAALLOC) != 0;
2971 if (!need_mapping && !need_kva)
2974 BUF_CHECK_UNMAPPED(bp);
2976 if (need_mapping && (bp->b_flags & B_KVAALLOC) != 0) {
2978 * Buffer is not mapped, but the KVA was already
2979 * reserved at the time of the instantiation. Use the
2982 bp->b_flags &= ~B_KVAALLOC;
2983 KASSERT(bp->b_kvaalloc != 0, ("kvaalloc == 0"));
2984 bp->b_kvabase = bp->b_kvaalloc;
2985 atomic_subtract_long(&unmapped_bufspace, bp->b_kvasize);
2990 * Calculate the amount of the address space we would reserve
2991 * if the buffer was mapped.
2993 bsize = vn_isdisk(bp->b_vp, NULL) ? DEV_BSIZE : bp->b_bufobj->bo_bsize;
2994 offset = blkno * bsize;
2995 maxsize = size + (offset & PAGE_MASK);
2996 maxsize = imax(maxsize, bsize);
2999 if (allocbufkva(bp, maxsize, gbflags)) {
3001 * Request defragmentation. getnewbuf() returns us the
3002 * allocated space by the scratch buffer KVA.
3004 scratch_bp = getnewbuf(bp->b_vp, 0, 0, size, maxsize, gbflags |
3005 (GB_UNMAPPED | GB_KVAALLOC));
3006 if (scratch_bp == NULL) {
3007 if ((gbflags & GB_NOWAIT_BD) != 0) {
3009 * XXXKIB: defragmentation cannot
3010 * succeed, not sure what else to do.
3012 panic("GB_NOWAIT_BD and B_UNMAPPED %p", bp);
3014 atomic_add_int(&mappingrestarts, 1);
3017 KASSERT((scratch_bp->b_flags & B_KVAALLOC) != 0,
3018 ("scratch bp !B_KVAALLOC %p", scratch_bp));
3019 setbufkva(bp, (vm_offset_t)scratch_bp->b_kvaalloc,
3020 scratch_bp->b_kvasize, gbflags);
3022 /* Get rid of the scratch buffer. */
3023 scratch_bp->b_kvasize = 0;
3024 scratch_bp->b_flags |= B_INVAL;
3025 scratch_bp->b_flags &= ~(B_UNMAPPED | B_KVAALLOC);
3032 bp->b_saveaddr = bp->b_kvabase;
3033 bp->b_data = bp->b_saveaddr; /* b_offset is handled by bpmap_qenter */
3034 bp->b_flags &= ~B_UNMAPPED;
3035 BUF_CHECK_MAPPED(bp);
3042 * Get a block given a specified block and offset into a file/device.
3043 * The buffers B_DONE bit will be cleared on return, making it almost
3044 * ready for an I/O initiation. B_INVAL may or may not be set on
3045 * return. The caller should clear B_INVAL prior to initiating a
3048 * For a non-VMIO buffer, B_CACHE is set to the opposite of B_INVAL for
3049 * an existing buffer.
3051 * For a VMIO buffer, B_CACHE is modified according to the backing VM.
3052 * If getblk()ing a previously 0-sized invalid buffer, B_CACHE is set
3053 * and then cleared based on the backing VM. If the previous buffer is
3054 * non-0-sized but invalid, B_CACHE will be cleared.
3056 * If getblk() must create a new buffer, the new buffer is returned with
3057 * both B_INVAL and B_CACHE clear unless it is a VMIO buffer, in which
3058 * case it is returned with B_INVAL clear and B_CACHE set based on the
3061 * getblk() also forces a bwrite() for any B_DELWRI buffer whos
3062 * B_CACHE bit is clear.
3064 * What this means, basically, is that the caller should use B_CACHE to
3065 * determine whether the buffer is fully valid or not and should clear
3066 * B_INVAL prior to issuing a read. If the caller intends to validate
3067 * the buffer by loading its data area with something, the caller needs
3068 * to clear B_INVAL. If the caller does this without issuing an I/O,
3069 * the caller should set B_CACHE ( as an optimization ), else the caller
3070 * should issue the I/O and biodone() will set B_CACHE if the I/O was
3071 * a write attempt or if it was a successfull read. If the caller
3072 * intends to issue a READ, the caller must clear B_INVAL and BIO_ERROR
3073 * prior to issuing the READ. biodone() will *not* clear B_INVAL.
3076 getblk(struct vnode *vp, daddr_t blkno, int size, int slpflag, int slptimeo,
3081 int bsize, error, maxsize, vmio;
3084 CTR3(KTR_BUF, "getblk(%p, %ld, %d)", vp, (long)blkno, size);
3085 KASSERT((flags & (GB_UNMAPPED | GB_KVAALLOC)) != GB_KVAALLOC,
3086 ("GB_KVAALLOC only makes sense with GB_UNMAPPED"));
3087 ASSERT_VOP_LOCKED(vp, "getblk");
3088 if (size > MAXBSIZE)
3089 panic("getblk: size(%d) > MAXBSIZE(%d)\n", size, MAXBSIZE);
3090 if (!unmapped_buf_allowed)
3091 flags &= ~(GB_UNMAPPED | GB_KVAALLOC);
3096 * Block if we are low on buffers. Certain processes are allowed
3097 * to completely exhaust the buffer cache.
3099 * If this check ever becomes a bottleneck it may be better to
3100 * move it into the else, when gbincore() fails. At the moment
3101 * it isn't a problem.
3103 if (numfreebuffers == 0) {
3104 if (TD_IS_IDLETHREAD(curthread))
3107 needsbuffer |= VFS_BIO_NEED_ANY;
3108 mtx_unlock(&nblock);
3112 bp = gbincore(bo, blkno);
3116 * Buffer is in-core. If the buffer is not busy, it must
3119 lockflags = LK_EXCLUSIVE | LK_SLEEPFAIL | LK_INTERLOCK;
3121 if (flags & GB_LOCK_NOWAIT)
3122 lockflags |= LK_NOWAIT;
3124 error = BUF_TIMELOCK(bp, lockflags,
3125 BO_MTX(bo), "getblk", slpflag, slptimeo);
3128 * If we slept and got the lock we have to restart in case
3129 * the buffer changed identities.
3131 if (error == ENOLCK)
3133 /* We timed out or were interrupted. */
3136 /* If recursed, assume caller knows the rules. */
3137 else if (BUF_LOCKRECURSED(bp))
3141 * The buffer is locked. B_CACHE is cleared if the buffer is
3142 * invalid. Otherwise, for a non-VMIO buffer, B_CACHE is set
3143 * and for a VMIO buffer B_CACHE is adjusted according to the
3146 if (bp->b_flags & B_INVAL)
3147 bp->b_flags &= ~B_CACHE;
3148 else if ((bp->b_flags & (B_VMIO | B_INVAL)) == 0)
3149 bp->b_flags |= B_CACHE;
3155 * check for size inconsistencies for non-VMIO case.
3157 if (bp->b_bcount != size) {
3158 if ((bp->b_flags & B_VMIO) == 0 ||
3159 (size > bp->b_kvasize)) {
3160 if (bp->b_flags & B_DELWRI) {
3162 * If buffer is pinned and caller does
3163 * not want sleep waiting for it to be
3164 * unpinned, bail out
3166 if (bp->b_pin_count > 0) {
3167 if (flags & GB_LOCK_NOWAIT) {
3174 bp->b_flags |= B_NOCACHE;
3177 if (LIST_EMPTY(&bp->b_dep)) {
3178 bp->b_flags |= B_RELBUF;
3181 bp->b_flags |= B_NOCACHE;
3190 * Handle the case of unmapped buffer which should
3191 * become mapped, or the buffer for which KVA
3192 * reservation is requested.
3194 bp_unmapped_get_kva(bp, blkno, size, flags);
3197 * If the size is inconsistant in the VMIO case, we can resize
3198 * the buffer. This might lead to B_CACHE getting set or
3199 * cleared. If the size has not changed, B_CACHE remains
3200 * unchanged from its previous state.
3202 if (bp->b_bcount != size)
3205 KASSERT(bp->b_offset != NOOFFSET,
3206 ("getblk: no buffer offset"));
3209 * A buffer with B_DELWRI set and B_CACHE clear must
3210 * be committed before we can return the buffer in
3211 * order to prevent the caller from issuing a read
3212 * ( due to B_CACHE not being set ) and overwriting
3215 * Most callers, including NFS and FFS, need this to
3216 * operate properly either because they assume they
3217 * can issue a read if B_CACHE is not set, or because
3218 * ( for example ) an uncached B_DELWRI might loop due
3219 * to softupdates re-dirtying the buffer. In the latter
3220 * case, B_CACHE is set after the first write completes,
3221 * preventing further loops.
3222 * NOTE! b*write() sets B_CACHE. If we cleared B_CACHE
3223 * above while extending the buffer, we cannot allow the
3224 * buffer to remain with B_CACHE set after the write
3225 * completes or it will represent a corrupt state. To
3226 * deal with this we set B_NOCACHE to scrap the buffer
3229 * We might be able to do something fancy, like setting
3230 * B_CACHE in bwrite() except if B_DELWRI is already set,
3231 * so the below call doesn't set B_CACHE, but that gets real
3232 * confusing. This is much easier.
3235 if ((bp->b_flags & (B_CACHE|B_DELWRI)) == B_DELWRI) {
3236 bp->b_flags |= B_NOCACHE;
3240 bp->b_flags &= ~B_DONE;
3243 * Buffer is not in-core, create new buffer. The buffer
3244 * returned by getnewbuf() is locked. Note that the returned
3245 * buffer is also considered valid (not marked B_INVAL).
3249 * If the user does not want us to create the buffer, bail out
3252 if (flags & GB_NOCREAT)
3254 bsize = vn_isdisk(vp, NULL) ? DEV_BSIZE : bo->bo_bsize;
3255 offset = blkno * bsize;
3256 vmio = vp->v_object != NULL;
3258 maxsize = size + (offset & PAGE_MASK);
3261 /* Do not allow non-VMIO notmapped buffers. */
3262 flags &= ~GB_UNMAPPED;
3264 maxsize = imax(maxsize, bsize);
3266 bp = getnewbuf(vp, slpflag, slptimeo, size, maxsize, flags);
3268 if (slpflag || slptimeo)
3274 * This code is used to make sure that a buffer is not
3275 * created while the getnewbuf routine is blocked.
3276 * This can be a problem whether the vnode is locked or not.
3277 * If the buffer is created out from under us, we have to
3278 * throw away the one we just created.
3280 * Note: this must occur before we associate the buffer
3281 * with the vp especially considering limitations in
3282 * the splay tree implementation when dealing with duplicate
3286 if (gbincore(bo, blkno)) {
3288 bp->b_flags |= B_INVAL;
3294 * Insert the buffer into the hash, so that it can
3295 * be found by incore.
3297 bp->b_blkno = bp->b_lblkno = blkno;
3298 bp->b_offset = offset;
3303 * set B_VMIO bit. allocbuf() the buffer bigger. Since the
3304 * buffer size starts out as 0, B_CACHE will be set by
3305 * allocbuf() for the VMIO case prior to it testing the
3306 * backing store for validity.
3310 bp->b_flags |= B_VMIO;
3311 KASSERT(vp->v_object == bp->b_bufobj->bo_object,
3312 ("ARGH! different b_bufobj->bo_object %p %p %p\n",
3313 bp, vp->v_object, bp->b_bufobj->bo_object));
3315 bp->b_flags &= ~B_VMIO;
3316 KASSERT(bp->b_bufobj->bo_object == NULL,
3317 ("ARGH! has b_bufobj->bo_object %p %p\n",
3318 bp, bp->b_bufobj->bo_object));
3319 BUF_CHECK_MAPPED(bp);
3323 bp->b_flags &= ~B_DONE;
3325 CTR4(KTR_BUF, "getblk(%p, %ld, %d) = %p", vp, (long)blkno, size, bp);
3326 BUF_ASSERT_HELD(bp);
3328 KASSERT(bp->b_bufobj == bo,
3329 ("bp %p wrong b_bufobj %p should be %p", bp, bp->b_bufobj, bo));
3334 * Get an empty, disassociated buffer of given size. The buffer is initially
3338 geteblk(int size, int flags)
3343 maxsize = (size + BKVAMASK) & ~BKVAMASK;
3344 while ((bp = getnewbuf(NULL, 0, 0, size, maxsize, flags)) == NULL) {
3345 if ((flags & GB_NOWAIT_BD) &&
3346 (curthread->td_pflags & TDP_BUFNEED) != 0)
3350 bp->b_flags |= B_INVAL; /* b_dep cleared by getnewbuf() */
3351 BUF_ASSERT_HELD(bp);
3357 * This code constitutes the buffer memory from either anonymous system
3358 * memory (in the case of non-VMIO operations) or from an associated
3359 * VM object (in the case of VMIO operations). This code is able to
3360 * resize a buffer up or down.
3362 * Note that this code is tricky, and has many complications to resolve
3363 * deadlock or inconsistant data situations. Tread lightly!!!
3364 * There are B_CACHE and B_DELWRI interactions that must be dealt with by
3365 * the caller. Calling this code willy nilly can result in the loss of data.
3367 * allocbuf() only adjusts B_CACHE for VMIO buffers. getblk() deals with
3368 * B_CACHE for the non-VMIO case.
3372 allocbuf(struct buf *bp, int size)
3374 int newbsize, mbsize;
3377 BUF_ASSERT_HELD(bp);
3379 if (bp->b_kvasize < size)
3380 panic("allocbuf: buffer too small");
3382 if ((bp->b_flags & B_VMIO) == 0) {
3386 * Just get anonymous memory from the kernel. Don't
3387 * mess with B_CACHE.
3389 mbsize = (size + DEV_BSIZE - 1) & ~(DEV_BSIZE - 1);
3390 if (bp->b_flags & B_MALLOC)
3393 newbsize = round_page(size);
3395 if (newbsize < bp->b_bufsize) {
3397 * malloced buffers are not shrunk
3399 if (bp->b_flags & B_MALLOC) {
3401 bp->b_bcount = size;
3403 free(bp->b_data, M_BIOBUF);
3404 if (bp->b_bufsize) {
3405 atomic_subtract_long(
3411 bp->b_saveaddr = bp->b_kvabase;
3412 bp->b_data = bp->b_saveaddr;
3414 bp->b_flags &= ~B_MALLOC;
3418 vm_hold_free_pages(bp, newbsize);
3419 } else if (newbsize > bp->b_bufsize) {
3421 * We only use malloced memory on the first allocation.
3422 * and revert to page-allocated memory when the buffer
3426 * There is a potential smp race here that could lead
3427 * to bufmallocspace slightly passing the max. It
3428 * is probably extremely rare and not worth worrying
3431 if ( (bufmallocspace < maxbufmallocspace) &&
3432 (bp->b_bufsize == 0) &&
3433 (mbsize <= PAGE_SIZE/2)) {
3435 bp->b_data = malloc(mbsize, M_BIOBUF, M_WAITOK);
3436 bp->b_bufsize = mbsize;
3437 bp->b_bcount = size;
3438 bp->b_flags |= B_MALLOC;
3439 atomic_add_long(&bufmallocspace, mbsize);
3445 * If the buffer is growing on its other-than-first allocation,
3446 * then we revert to the page-allocation scheme.
3448 if (bp->b_flags & B_MALLOC) {
3449 origbuf = bp->b_data;
3450 origbufsize = bp->b_bufsize;
3451 bp->b_data = bp->b_kvabase;
3452 if (bp->b_bufsize) {
3453 atomic_subtract_long(&bufmallocspace,
3458 bp->b_flags &= ~B_MALLOC;
3459 newbsize = round_page(newbsize);
3463 (vm_offset_t) bp->b_data + bp->b_bufsize,
3464 (vm_offset_t) bp->b_data + newbsize);
3466 bcopy(origbuf, bp->b_data, origbufsize);
3467 free(origbuf, M_BIOBUF);
3473 newbsize = (size + DEV_BSIZE - 1) & ~(DEV_BSIZE - 1);
3474 desiredpages = (size == 0) ? 0 :
3475 num_pages((bp->b_offset & PAGE_MASK) + newbsize);
3477 if (bp->b_flags & B_MALLOC)
3478 panic("allocbuf: VMIO buffer can't be malloced");
3480 * Set B_CACHE initially if buffer is 0 length or will become
3483 if (size == 0 || bp->b_bufsize == 0)
3484 bp->b_flags |= B_CACHE;
3486 if (newbsize < bp->b_bufsize) {
3488 * DEV_BSIZE aligned new buffer size is less then the
3489 * DEV_BSIZE aligned existing buffer size. Figure out
3490 * if we have to remove any pages.
3492 if (desiredpages < bp->b_npages) {
3495 if ((bp->b_flags & B_UNMAPPED) == 0) {
3496 BUF_CHECK_MAPPED(bp);
3497 pmap_qremove((vm_offset_t)trunc_page(
3498 (vm_offset_t)bp->b_data) +
3499 (desiredpages << PAGE_SHIFT),
3500 (bp->b_npages - desiredpages));
3502 BUF_CHECK_UNMAPPED(bp);
3503 VM_OBJECT_LOCK(bp->b_bufobj->bo_object);
3504 for (i = desiredpages; i < bp->b_npages; i++) {
3506 * the page is not freed here -- it
3507 * is the responsibility of
3508 * vnode_pager_setsize
3511 KASSERT(m != bogus_page,
3512 ("allocbuf: bogus page found"));
3513 while (vm_page_sleep_if_busy(m, TRUE,
3517 bp->b_pages[i] = NULL;
3519 vm_page_unwire(m, 0);
3522 VM_OBJECT_UNLOCK(bp->b_bufobj->bo_object);
3523 bp->b_npages = desiredpages;
3525 } else if (size > bp->b_bcount) {
3527 * We are growing the buffer, possibly in a
3528 * byte-granular fashion.
3535 * Step 1, bring in the VM pages from the object,
3536 * allocating them if necessary. We must clear
3537 * B_CACHE if these pages are not valid for the
3538 * range covered by the buffer.
3541 obj = bp->b_bufobj->bo_object;
3543 VM_OBJECT_LOCK(obj);
3544 while (bp->b_npages < desiredpages) {
3548 * We must allocate system pages since blocking
3549 * here could interfere with paging I/O, no
3550 * matter which process we are.
3552 * We can only test VPO_BUSY here. Blocking on
3553 * m->busy might lead to a deadlock:
3554 * vm_fault->getpages->cluster_read->allocbuf
3555 * Thus, we specify VM_ALLOC_IGN_SBUSY.
3557 m = vm_page_grab(obj, OFF_TO_IDX(bp->b_offset) +
3558 bp->b_npages, VM_ALLOC_NOBUSY |
3559 VM_ALLOC_SYSTEM | VM_ALLOC_WIRED |
3560 VM_ALLOC_RETRY | VM_ALLOC_IGN_SBUSY |
3561 VM_ALLOC_COUNT(desiredpages - bp->b_npages));
3563 bp->b_flags &= ~B_CACHE;
3564 bp->b_pages[bp->b_npages] = m;
3569 * Step 2. We've loaded the pages into the buffer,
3570 * we have to figure out if we can still have B_CACHE
3571 * set. Note that B_CACHE is set according to the
3572 * byte-granular range ( bcount and size ), new the
3573 * aligned range ( newbsize ).
3575 * The VM test is against m->valid, which is DEV_BSIZE
3576 * aligned. Needless to say, the validity of the data
3577 * needs to also be DEV_BSIZE aligned. Note that this
3578 * fails with NFS if the server or some other client
3579 * extends the file's EOF. If our buffer is resized,
3580 * B_CACHE may remain set! XXX
3583 toff = bp->b_bcount;
3584 tinc = PAGE_SIZE - ((bp->b_offset + toff) & PAGE_MASK);
3586 while ((bp->b_flags & B_CACHE) && toff < size) {
3589 if (tinc > (size - toff))
3592 pi = ((bp->b_offset & PAGE_MASK) + toff) >>
3605 VM_OBJECT_UNLOCK(obj);
3608 * Step 3, fixup the KVM pmap.
3610 if ((bp->b_flags & B_UNMAPPED) == 0)
3613 BUF_CHECK_UNMAPPED(bp);
3616 if (newbsize < bp->b_bufsize)
3618 bp->b_bufsize = newbsize; /* actual buffer allocation */
3619 bp->b_bcount = size; /* requested buffer size */
3623 extern int inflight_transient_maps;
3626 biodone(struct bio *bp)
3629 void (*done)(struct bio *);
3630 vm_offset_t start, end;
3633 mtxp = mtx_pool_find(mtxpool_sleep, bp);
3635 bp->bio_flags |= BIO_DONE;
3636 if ((bp->bio_flags & BIO_TRANSIENT_MAPPING) != 0) {
3637 start = trunc_page((vm_offset_t)bp->bio_data);
3638 end = round_page((vm_offset_t)bp->bio_data + bp->bio_length);
3644 done = bp->bio_done;
3651 pmap_qremove(start, OFF_TO_IDX(end - start));
3652 vm_map_remove(bio_transient_map, start, end);
3653 atomic_add_int(&inflight_transient_maps, -1);
3658 * Wait for a BIO to finish.
3660 * XXX: resort to a timeout for now. The optimal locking (if any) for this
3661 * case is not yet clear.
3664 biowait(struct bio *bp, const char *wchan)
3668 mtxp = mtx_pool_find(mtxpool_sleep, bp);
3670 while ((bp->bio_flags & BIO_DONE) == 0)
3671 msleep(bp, mtxp, PRIBIO, wchan, hz / 10);
3673 if (bp->bio_error != 0)
3674 return (bp->bio_error);
3675 if (!(bp->bio_flags & BIO_ERROR))
3681 biofinish(struct bio *bp, struct devstat *stat, int error)
3685 bp->bio_error = error;
3686 bp->bio_flags |= BIO_ERROR;
3689 devstat_end_transaction_bio(stat, bp);
3696 * Wait for buffer I/O completion, returning error status. The buffer
3697 * is left locked and B_DONE on return. B_EINTR is converted into an EINTR
3698 * error and cleared.
3701 bufwait(struct buf *bp)
3703 if (bp->b_iocmd == BIO_READ)
3704 bwait(bp, PRIBIO, "biord");
3706 bwait(bp, PRIBIO, "biowr");
3707 if (bp->b_flags & B_EINTR) {
3708 bp->b_flags &= ~B_EINTR;
3711 if (bp->b_ioflags & BIO_ERROR) {
3712 return (bp->b_error ? bp->b_error : EIO);
3719 * Call back function from struct bio back up to struct buf.
3722 bufdonebio(struct bio *bip)
3726 bp = bip->bio_caller2;
3727 bp->b_resid = bp->b_bcount - bip->bio_completed;
3728 bp->b_resid = bip->bio_resid; /* XXX: remove */
3729 bp->b_ioflags = bip->bio_flags;
3730 bp->b_error = bip->bio_error;
3732 bp->b_ioflags |= BIO_ERROR;
3738 dev_strategy(struct cdev *dev, struct buf *bp)
3743 KASSERT(dev->si_refcount > 0,
3744 ("dev_strategy on un-referenced struct cdev *(%s) %p",
3745 devtoname(dev), dev));
3747 csw = dev_refthread(dev, &ref);
3748 dev_strategy_csw(dev, csw, bp);
3749 dev_relthread(dev, ref);
3753 dev_strategy_csw(struct cdev *dev, struct cdevsw *csw, struct buf *bp)
3757 KASSERT(bp->b_iocmd == BIO_READ || bp->b_iocmd == BIO_WRITE,
3759 KASSERT(((dev->si_flags & SI_ETERNAL) != 0 && csw != NULL) ||
3760 dev->si_threadcount > 0,
3761 ("dev_strategy_csw threadcount cdev *(%s) %p", devtoname(dev),
3764 bp->b_error = ENXIO;
3765 bp->b_ioflags = BIO_ERROR;
3773 /* Try again later */
3774 tsleep(&bp, PRIBIO, "dev_strat", hz/10);
3776 bip->bio_cmd = bp->b_iocmd;
3777 bip->bio_offset = bp->b_iooffset;
3778 bip->bio_length = bp->b_bcount;
3779 bip->bio_bcount = bp->b_bcount; /* XXX: remove */
3781 bip->bio_done = bufdonebio;
3782 bip->bio_caller2 = bp;
3784 (*csw->d_strategy)(bip);
3790 * Finish I/O on a buffer, optionally calling a completion function.
3791 * This is usually called from an interrupt so process blocking is
3794 * biodone is also responsible for setting B_CACHE in a B_VMIO bp.
3795 * In a non-VMIO bp, B_CACHE will be set on the next getblk()
3796 * assuming B_INVAL is clear.
3798 * For the VMIO case, we set B_CACHE if the op was a read and no
3799 * read error occured, or if the op was a write. B_CACHE is never
3800 * set if the buffer is invalid or otherwise uncacheable.
3802 * biodone does not mess with B_INVAL, allowing the I/O routine or the
3803 * initiator to leave B_INVAL set to brelse the buffer out of existance
3804 * in the biodone routine.
3807 bufdone(struct buf *bp)
3809 struct bufobj *dropobj;
3810 void (*biodone)(struct buf *);
3812 CTR3(KTR_BUF, "bufdone(%p) vp %p flags %X", bp, bp->b_vp, bp->b_flags);
3815 KASSERT(!(bp->b_flags & B_DONE), ("biodone: bp %p already done", bp));
3816 BUF_ASSERT_HELD(bp);
3818 runningbufwakeup(bp);
3819 if (bp->b_iocmd == BIO_WRITE)
3820 dropobj = bp->b_bufobj;
3821 /* call optional completion function if requested */
3822 if (bp->b_iodone != NULL) {
3823 biodone = bp->b_iodone;
3824 bp->b_iodone = NULL;
3827 bufobj_wdrop(dropobj);
3834 bufobj_wdrop(dropobj);
3838 bufdone_finish(struct buf *bp)
3840 BUF_ASSERT_HELD(bp);
3842 if (!LIST_EMPTY(&bp->b_dep))
3845 if (bp->b_flags & B_VMIO) {
3850 int bogus, i, iosize;
3852 obj = bp->b_bufobj->bo_object;
3853 KASSERT(obj->paging_in_progress >= bp->b_npages,
3854 ("biodone_finish: paging in progress(%d) < b_npages(%d)",
3855 obj->paging_in_progress, bp->b_npages));
3858 KASSERT(vp->v_holdcnt > 0,
3859 ("biodone_finish: vnode %p has zero hold count", vp));
3860 KASSERT(vp->v_object != NULL,
3861 ("biodone_finish: vnode %p has no vm_object", vp));
3863 foff = bp->b_offset;
3864 KASSERT(bp->b_offset != NOOFFSET,
3865 ("biodone_finish: bp %p has no buffer offset", bp));
3868 * Set B_CACHE if the op was a normal read and no error
3869 * occured. B_CACHE is set for writes in the b*write()
3872 iosize = bp->b_bcount - bp->b_resid;
3873 if (bp->b_iocmd == BIO_READ &&
3874 !(bp->b_flags & (B_INVAL|B_NOCACHE)) &&
3875 !(bp->b_ioflags & BIO_ERROR)) {
3876 bp->b_flags |= B_CACHE;
3879 VM_OBJECT_LOCK(obj);
3880 for (i = 0; i < bp->b_npages; i++) {
3884 resid = ((foff + PAGE_SIZE) & ~(off_t)PAGE_MASK) - foff;
3889 * cleanup bogus pages, restoring the originals
3892 if (m == bogus_page) {
3893 bogus = bogusflag = 1;
3894 m = vm_page_lookup(obj, OFF_TO_IDX(foff));
3896 panic("biodone: page disappeared!");
3899 KASSERT(OFF_TO_IDX(foff) == m->pindex,
3900 ("biodone_finish: foff(%jd)/pindex(%ju) mismatch",
3901 (intmax_t)foff, (uintmax_t)m->pindex));
3904 * In the write case, the valid and clean bits are
3905 * already changed correctly ( see bdwrite() ), so we
3906 * only need to do this here in the read case.
3908 if ((bp->b_iocmd == BIO_READ) && !bogusflag && resid > 0) {
3909 KASSERT((m->dirty & vm_page_bits(foff &
3910 PAGE_MASK, resid)) == 0, ("bufdone_finish:"
3911 " page %p has unexpected dirty bits", m));
3912 vfs_page_set_valid(bp, foff, m);
3915 vm_page_io_finish(m);
3916 vm_object_pip_subtract(obj, 1);
3917 foff = (foff + PAGE_SIZE) & ~(off_t)PAGE_MASK;
3920 vm_object_pip_wakeupn(obj, 0);
3921 VM_OBJECT_UNLOCK(obj);
3922 if (bogus && (bp->b_flags & B_UNMAPPED) == 0) {
3923 BUF_CHECK_MAPPED(bp);
3924 pmap_qenter(trunc_page((vm_offset_t)bp->b_data),
3925 bp->b_pages, bp->b_npages);
3930 * For asynchronous completions, release the buffer now. The brelse
3931 * will do a wakeup there if necessary - so no need to do a wakeup
3932 * here in the async case. The sync case always needs to do a wakeup.
3935 if (bp->b_flags & B_ASYNC) {
3936 if ((bp->b_flags & (B_NOCACHE | B_INVAL | B_RELBUF)) || (bp->b_ioflags & BIO_ERROR))
3945 * This routine is called in lieu of iodone in the case of
3946 * incomplete I/O. This keeps the busy status for pages
3950 vfs_unbusy_pages(struct buf *bp)
3956 runningbufwakeup(bp);
3957 if (!(bp->b_flags & B_VMIO))
3960 obj = bp->b_bufobj->bo_object;
3961 VM_OBJECT_LOCK(obj);
3962 for (i = 0; i < bp->b_npages; i++) {
3964 if (m == bogus_page) {
3965 m = vm_page_lookup(obj, OFF_TO_IDX(bp->b_offset) + i);
3967 panic("vfs_unbusy_pages: page missing\n");
3969 if ((bp->b_flags & B_UNMAPPED) == 0) {
3970 BUF_CHECK_MAPPED(bp);
3971 pmap_qenter(trunc_page((vm_offset_t)bp->b_data),
3972 bp->b_pages, bp->b_npages);
3974 BUF_CHECK_UNMAPPED(bp);
3976 vm_object_pip_subtract(obj, 1);
3977 vm_page_io_finish(m);
3979 vm_object_pip_wakeupn(obj, 0);
3980 VM_OBJECT_UNLOCK(obj);
3984 * vfs_page_set_valid:
3986 * Set the valid bits in a page based on the supplied offset. The
3987 * range is restricted to the buffer's size.
3989 * This routine is typically called after a read completes.
3992 vfs_page_set_valid(struct buf *bp, vm_ooffset_t off, vm_page_t m)
3997 * Compute the end offset, eoff, such that [off, eoff) does not span a
3998 * page boundary and eoff is not greater than the end of the buffer.
3999 * The end of the buffer, in this case, is our file EOF, not the
4000 * allocation size of the buffer.
4002 eoff = (off + PAGE_SIZE) & ~(vm_ooffset_t)PAGE_MASK;
4003 if (eoff > bp->b_offset + bp->b_bcount)
4004 eoff = bp->b_offset + bp->b_bcount;
4007 * Set valid range. This is typically the entire buffer and thus the
4011 vm_page_set_valid(m, off & PAGE_MASK, eoff - off);
4015 * vfs_page_set_validclean:
4017 * Set the valid bits and clear the dirty bits in a page based on the
4018 * supplied offset. The range is restricted to the buffer's size.
4021 vfs_page_set_validclean(struct buf *bp, vm_ooffset_t off, vm_page_t m)
4023 vm_ooffset_t soff, eoff;
4026 * Start and end offsets in buffer. eoff - soff may not cross a
4027 * page boundry or cross the end of the buffer. The end of the
4028 * buffer, in this case, is our file EOF, not the allocation size
4032 eoff = (off + PAGE_SIZE) & ~(off_t)PAGE_MASK;
4033 if (eoff > bp->b_offset + bp->b_bcount)
4034 eoff = bp->b_offset + bp->b_bcount;
4037 * Set valid range. This is typically the entire buffer and thus the
4041 vm_page_set_validclean(
4043 (vm_offset_t) (soff & PAGE_MASK),
4044 (vm_offset_t) (eoff - soff)
4050 * Ensure that all buffer pages are not busied by VPO_BUSY flag. If
4051 * any page is busy, drain the flag.
4054 vfs_drain_busy_pages(struct buf *bp)
4059 VM_OBJECT_LOCK_ASSERT(bp->b_bufobj->bo_object, MA_OWNED);
4061 for (i = 0; i < bp->b_npages; i++) {
4063 if ((m->oflags & VPO_BUSY) != 0) {
4064 for (; last_busied < i; last_busied++)
4065 vm_page_busy(bp->b_pages[last_busied]);
4066 while ((m->oflags & VPO_BUSY) != 0)
4067 vm_page_sleep(m, "vbpage");
4070 for (i = 0; i < last_busied; i++)
4071 vm_page_wakeup(bp->b_pages[i]);
4075 * This routine is called before a device strategy routine.
4076 * It is used to tell the VM system that paging I/O is in
4077 * progress, and treat the pages associated with the buffer
4078 * almost as being VPO_BUSY. Also the object paging_in_progress
4079 * flag is handled to make sure that the object doesn't become
4082 * Since I/O has not been initiated yet, certain buffer flags
4083 * such as BIO_ERROR or B_INVAL may be in an inconsistant state
4084 * and should be ignored.
4087 vfs_busy_pages(struct buf *bp, int clear_modify)
4094 if (!(bp->b_flags & B_VMIO))
4097 obj = bp->b_bufobj->bo_object;
4098 foff = bp->b_offset;
4099 KASSERT(bp->b_offset != NOOFFSET,
4100 ("vfs_busy_pages: no buffer offset"));
4101 VM_OBJECT_LOCK(obj);
4102 vfs_drain_busy_pages(bp);
4103 if (bp->b_bufsize != 0)
4104 vfs_setdirty_locked_object(bp);
4106 for (i = 0; i < bp->b_npages; i++) {
4109 if ((bp->b_flags & B_CLUSTER) == 0) {
4110 vm_object_pip_add(obj, 1);
4111 vm_page_io_start(m);
4114 * When readying a buffer for a read ( i.e
4115 * clear_modify == 0 ), it is important to do
4116 * bogus_page replacement for valid pages in
4117 * partially instantiated buffers. Partially
4118 * instantiated buffers can, in turn, occur when
4119 * reconstituting a buffer from its VM backing store
4120 * base. We only have to do this if B_CACHE is
4121 * clear ( which causes the I/O to occur in the
4122 * first place ). The replacement prevents the read
4123 * I/O from overwriting potentially dirty VM-backed
4124 * pages. XXX bogus page replacement is, uh, bogus.
4125 * It may not work properly with small-block devices.
4126 * We need to find a better way.
4129 pmap_remove_write(m);
4130 vfs_page_set_validclean(bp, foff, m);
4131 } else if (m->valid == VM_PAGE_BITS_ALL &&
4132 (bp->b_flags & B_CACHE) == 0) {
4133 bp->b_pages[i] = bogus_page;
4136 foff = (foff + PAGE_SIZE) & ~(off_t)PAGE_MASK;
4138 VM_OBJECT_UNLOCK(obj);
4139 if (bogus && (bp->b_flags & B_UNMAPPED) == 0) {
4140 BUF_CHECK_MAPPED(bp);
4141 pmap_qenter(trunc_page((vm_offset_t)bp->b_data),
4142 bp->b_pages, bp->b_npages);
4147 * vfs_bio_set_valid:
4149 * Set the range within the buffer to valid. The range is
4150 * relative to the beginning of the buffer, b_offset. Note that
4151 * b_offset itself may be offset from the beginning of the first
4155 vfs_bio_set_valid(struct buf *bp, int base, int size)
4160 if (!(bp->b_flags & B_VMIO))
4164 * Fixup base to be relative to beginning of first page.
4165 * Set initial n to be the maximum number of bytes in the
4166 * first page that can be validated.
4168 base += (bp->b_offset & PAGE_MASK);
4169 n = PAGE_SIZE - (base & PAGE_MASK);
4171 VM_OBJECT_LOCK(bp->b_bufobj->bo_object);
4172 for (i = base / PAGE_SIZE; size > 0 && i < bp->b_npages; ++i) {
4176 vm_page_set_valid(m, base & PAGE_MASK, n);
4181 VM_OBJECT_UNLOCK(bp->b_bufobj->bo_object);
4187 * If the specified buffer is a non-VMIO buffer, clear the entire
4188 * buffer. If the specified buffer is a VMIO buffer, clear and
4189 * validate only the previously invalid portions of the buffer.
4190 * This routine essentially fakes an I/O, so we need to clear
4191 * BIO_ERROR and B_INVAL.
4193 * Note that while we only theoretically need to clear through b_bcount,
4194 * we go ahead and clear through b_bufsize.
4197 vfs_bio_clrbuf(struct buf *bp)
4199 int i, j, mask, sa, ea, slide;
4201 if ((bp->b_flags & (B_VMIO | B_MALLOC)) != B_VMIO) {
4205 bp->b_flags &= ~B_INVAL;
4206 bp->b_ioflags &= ~BIO_ERROR;
4207 VM_OBJECT_LOCK(bp->b_bufobj->bo_object);
4208 if ((bp->b_npages == 1) && (bp->b_bufsize < PAGE_SIZE) &&
4209 (bp->b_offset & PAGE_MASK) == 0) {
4210 if (bp->b_pages[0] == bogus_page)
4212 mask = (1 << (bp->b_bufsize / DEV_BSIZE)) - 1;
4213 VM_OBJECT_LOCK_ASSERT(bp->b_pages[0]->object, MA_OWNED);
4214 if ((bp->b_pages[0]->valid & mask) == mask)
4216 if ((bp->b_pages[0]->valid & mask) == 0) {
4217 pmap_zero_page_area(bp->b_pages[0], 0, bp->b_bufsize);
4218 bp->b_pages[0]->valid |= mask;
4222 sa = bp->b_offset & PAGE_MASK;
4224 for (i = 0; i < bp->b_npages; i++, sa = 0) {
4225 slide = imin(slide + PAGE_SIZE, bp->b_offset + bp->b_bufsize);
4226 ea = slide & PAGE_MASK;
4229 if (bp->b_pages[i] == bogus_page)
4232 mask = ((1 << ((ea - sa) / DEV_BSIZE)) - 1) << j;
4233 VM_OBJECT_LOCK_ASSERT(bp->b_pages[i]->object, MA_OWNED);
4234 if ((bp->b_pages[i]->valid & mask) == mask)
4236 if ((bp->b_pages[i]->valid & mask) == 0)
4237 pmap_zero_page_area(bp->b_pages[i], sa, ea - sa);
4239 for (; sa < ea; sa += DEV_BSIZE, j++) {
4240 if ((bp->b_pages[i]->valid & (1 << j)) == 0) {
4241 pmap_zero_page_area(bp->b_pages[i],
4246 bp->b_pages[i]->valid |= mask;
4249 VM_OBJECT_UNLOCK(bp->b_bufobj->bo_object);
4254 vfs_bio_bzero_buf(struct buf *bp, int base, int size)
4259 if ((bp->b_flags & B_UNMAPPED) == 0) {
4260 BUF_CHECK_MAPPED(bp);
4261 bzero(bp->b_data + base, size);
4263 BUF_CHECK_UNMAPPED(bp);
4264 n = PAGE_SIZE - (base & PAGE_MASK);
4265 VM_OBJECT_LOCK(bp->b_bufobj->bo_object);
4266 for (i = base / PAGE_SIZE; size > 0 && i < bp->b_npages; ++i) {
4270 pmap_zero_page_area(m, base & PAGE_MASK, n);
4275 VM_OBJECT_UNLOCK(bp->b_bufobj->bo_object);
4280 * vm_hold_load_pages and vm_hold_free_pages get pages into
4281 * a buffers address space. The pages are anonymous and are
4282 * not associated with a file object.
4285 vm_hold_load_pages(struct buf *bp, vm_offset_t from, vm_offset_t to)
4291 BUF_CHECK_MAPPED(bp);
4293 to = round_page(to);
4294 from = round_page(from);
4295 index = (from - trunc_page((vm_offset_t)bp->b_data)) >> PAGE_SHIFT;
4297 for (pg = from; pg < to; pg += PAGE_SIZE, index++) {
4300 * note: must allocate system pages since blocking here
4301 * could interfere with paging I/O, no matter which
4304 p = vm_page_alloc(NULL, 0, VM_ALLOC_SYSTEM | VM_ALLOC_NOOBJ |
4305 VM_ALLOC_WIRED | VM_ALLOC_COUNT((to - pg) >> PAGE_SHIFT));
4310 pmap_qenter(pg, &p, 1);
4311 bp->b_pages[index] = p;
4313 bp->b_npages = index;
4316 /* Return pages associated with this buf to the vm system */
4318 vm_hold_free_pages(struct buf *bp, int newbsize)
4322 int index, newnpages;
4324 BUF_CHECK_MAPPED(bp);
4326 from = round_page((vm_offset_t)bp->b_data + newbsize);
4327 newnpages = (from - trunc_page((vm_offset_t)bp->b_data)) >> PAGE_SHIFT;
4328 if (bp->b_npages > newnpages)
4329 pmap_qremove(from, bp->b_npages - newnpages);
4330 for (index = newnpages; index < bp->b_npages; index++) {
4331 p = bp->b_pages[index];
4332 bp->b_pages[index] = NULL;
4334 printf("vm_hold_free_pages: blkno: %jd, lblkno: %jd\n",
4335 (intmax_t)bp->b_blkno, (intmax_t)bp->b_lblkno);
4338 atomic_subtract_int(&cnt.v_wire_count, 1);
4340 bp->b_npages = newnpages;
4344 * Map an IO request into kernel virtual address space.
4346 * All requests are (re)mapped into kernel VA space.
4347 * Notice that we use b_bufsize for the size of the buffer
4348 * to be mapped. b_bcount might be modified by the driver.
4350 * Note that even if the caller determines that the address space should
4351 * be valid, a race or a smaller-file mapped into a larger space may
4352 * actually cause vmapbuf() to fail, so all callers of vmapbuf() MUST
4353 * check the return value.
4356 vmapbuf(struct buf *bp, int mapbuf)
4362 if (bp->b_bufsize < 0)
4364 prot = VM_PROT_READ;
4365 if (bp->b_iocmd == BIO_READ)
4366 prot |= VM_PROT_WRITE; /* Less backwards than it looks */
4367 if ((pidx = vm_fault_quick_hold_pages(&curproc->p_vmspace->vm_map,
4368 (vm_offset_t)bp->b_data, bp->b_bufsize, prot, bp->b_pages,
4369 btoc(MAXPHYS))) < 0)
4371 bp->b_npages = pidx;
4372 if (mapbuf || !unmapped_buf_allowed) {
4373 pmap_qenter((vm_offset_t)bp->b_saveaddr, bp->b_pages, pidx);
4374 kva = bp->b_saveaddr;
4375 bp->b_saveaddr = bp->b_data;
4376 bp->b_data = kva + (((vm_offset_t)bp->b_data) & PAGE_MASK);
4377 bp->b_flags &= ~B_UNMAPPED;
4379 bp->b_flags |= B_UNMAPPED;
4380 bp->b_offset = ((vm_offset_t)bp->b_data) & PAGE_MASK;
4381 bp->b_saveaddr = bp->b_data;
4382 bp->b_data = unmapped_buf;
4388 * Free the io map PTEs associated with this IO operation.
4389 * We also invalidate the TLB entries and restore the original b_addr.
4392 vunmapbuf(struct buf *bp)
4396 npages = bp->b_npages;
4397 if (bp->b_flags & B_UNMAPPED)
4398 bp->b_flags &= ~B_UNMAPPED;
4400 pmap_qremove(trunc_page((vm_offset_t)bp->b_data), npages);
4401 vm_page_unhold_pages(bp->b_pages, npages);
4403 bp->b_data = bp->b_saveaddr;
4407 bdone(struct buf *bp)
4411 mtxp = mtx_pool_find(mtxpool_sleep, bp);
4413 bp->b_flags |= B_DONE;
4419 bwait(struct buf *bp, u_char pri, const char *wchan)
4423 mtxp = mtx_pool_find(mtxpool_sleep, bp);
4425 while ((bp->b_flags & B_DONE) == 0)
4426 msleep(bp, mtxp, pri, wchan, 0);
4431 bufsync(struct bufobj *bo, int waitfor)
4434 return (VOP_FSYNC(bo->__bo_vnode, waitfor, curthread));
4438 bufstrategy(struct bufobj *bo, struct buf *bp)
4444 KASSERT(vp == bo->bo_private, ("Inconsistent vnode bufstrategy"));
4445 KASSERT(vp->v_type != VCHR && vp->v_type != VBLK,
4446 ("Wrong vnode in bufstrategy(bp=%p, vp=%p)", bp, vp));
4447 i = VOP_STRATEGY(vp, bp);
4448 KASSERT(i == 0, ("VOP_STRATEGY failed bp=%p vp=%p", bp, bp->b_vp));
4452 bufobj_wrefl(struct bufobj *bo)
4455 KASSERT(bo != NULL, ("NULL bo in bufobj_wref"));
4456 ASSERT_BO_LOCKED(bo);
4461 bufobj_wref(struct bufobj *bo)
4464 KASSERT(bo != NULL, ("NULL bo in bufobj_wref"));
4471 bufobj_wdrop(struct bufobj *bo)
4474 KASSERT(bo != NULL, ("NULL bo in bufobj_wdrop"));
4476 KASSERT(bo->bo_numoutput > 0, ("bufobj_wdrop non-positive count"));
4477 if ((--bo->bo_numoutput == 0) && (bo->bo_flag & BO_WWAIT)) {
4478 bo->bo_flag &= ~BO_WWAIT;
4479 wakeup(&bo->bo_numoutput);
4485 bufobj_wwait(struct bufobj *bo, int slpflag, int timeo)
4489 KASSERT(bo != NULL, ("NULL bo in bufobj_wwait"));
4490 ASSERT_BO_LOCKED(bo);
4492 while (bo->bo_numoutput) {
4493 bo->bo_flag |= BO_WWAIT;
4494 error = msleep(&bo->bo_numoutput, BO_MTX(bo),
4495 slpflag | (PRIBIO + 1), "bo_wwait", timeo);
4503 bpin(struct buf *bp)
4507 mtxp = mtx_pool_find(mtxpool_sleep, bp);
4514 bunpin(struct buf *bp)
4518 mtxp = mtx_pool_find(mtxpool_sleep, bp);
4520 if (--bp->b_pin_count == 0)
4526 bunpin_wait(struct buf *bp)
4530 mtxp = mtx_pool_find(mtxpool_sleep, bp);
4532 while (bp->b_pin_count > 0)
4533 msleep(bp, mtxp, PRIBIO, "bwunpin", 0);
4538 * Set bio_data or bio_ma for struct bio from the struct buf.
4541 bdata2bio(struct buf *bp, struct bio *bip)
4544 if ((bp->b_flags & B_UNMAPPED) != 0) {
4545 KASSERT(unmapped_buf_allowed, ("unmapped"));
4546 bip->bio_ma = bp->b_pages;
4547 bip->bio_ma_n = bp->b_npages;
4548 bip->bio_data = unmapped_buf;
4549 bip->bio_ma_offset = (vm_offset_t)bp->b_offset & PAGE_MASK;
4550 bip->bio_flags |= BIO_UNMAPPED;
4551 KASSERT(round_page(bip->bio_ma_offset + bip->bio_length) /
4552 PAGE_SIZE == bp->b_npages,
4553 ("Buffer %p too short: %d %jd %d", bp, bip->bio_ma_offset,
4554 (uintmax_t)bip->bio_length, bip->bio_ma_n));
4556 bip->bio_data = bp->b_data;
4561 #include "opt_ddb.h"
4563 #include <ddb/ddb.h>
4565 /* DDB command to show buffer data */
4566 DB_SHOW_COMMAND(buffer, db_show_buffer)
4569 struct buf *bp = (struct buf *)addr;
4572 db_printf("usage: show buffer <addr>\n");
4576 db_printf("buf at %p\n", bp);
4577 db_printf("b_flags = 0x%b, b_xflags=0x%b, b_vflags=0x%b\n",
4578 (u_int)bp->b_flags, PRINT_BUF_FLAGS, (u_int)bp->b_xflags,
4579 PRINT_BUF_XFLAGS, (u_int)bp->b_vflags, PRINT_BUF_VFLAGS);
4581 "b_error = %d, b_bufsize = %ld, b_bcount = %ld, b_resid = %ld\n"
4582 "b_bufobj = (%p), b_data = %p, b_blkno = %jd, b_lblkno = %jd, "
4584 bp->b_error, bp->b_bufsize, bp->b_bcount, bp->b_resid,
4585 bp->b_bufobj, bp->b_data, (intmax_t)bp->b_blkno,
4586 (intmax_t)bp->b_lblkno, bp->b_dep.lh_first);
4589 db_printf("b_npages = %d, pages(OBJ, IDX, PA): ", bp->b_npages);
4590 for (i = 0; i < bp->b_npages; i++) {
4593 db_printf("(%p, 0x%lx, 0x%lx)", (void *)m->object,
4594 (u_long)m->pindex, (u_long)VM_PAGE_TO_PHYS(m));
4595 if ((i + 1) < bp->b_npages)
4601 BUF_LOCKPRINTINFO(bp);
4604 DB_SHOW_COMMAND(lockedbufs, lockedbufs)
4609 for (i = 0; i < nbuf; i++) {
4611 if (BUF_ISLOCKED(bp)) {
4612 db_show_buffer((uintptr_t)bp, 1, 0, NULL);
4618 DB_SHOW_COMMAND(vnodebufs, db_show_vnodebufs)
4624 db_printf("usage: show vnodebufs <addr>\n");
4627 vp = (struct vnode *)addr;
4628 db_printf("Clean buffers:\n");
4629 TAILQ_FOREACH(bp, &vp->v_bufobj.bo_clean.bv_hd, b_bobufs) {
4630 db_show_buffer((uintptr_t)bp, 1, 0, NULL);
4633 db_printf("Dirty buffers:\n");
4634 TAILQ_FOREACH(bp, &vp->v_bufobj.bo_dirty.bv_hd, b_bobufs) {
4635 db_show_buffer((uintptr_t)bp, 1, 0, NULL);
4640 DB_COMMAND(countfreebufs, db_coundfreebufs)
4643 int i, used = 0, nfree = 0;
4646 db_printf("usage: countfreebufs\n");
4650 for (i = 0; i < nbuf; i++) {
4652 if ((bp->b_vflags & BV_INFREECNT) != 0)
4658 db_printf("Counted %d free, %d used (%d tot)\n", nfree, used,
4660 db_printf("numfreebuffers is %d\n", numfreebuffers);