2 * Copyright (c) 1990 University of Utah.
3 * Copyright (c) 1991 The Regents of the University of California.
5 * Copyright (c) 1993, 1994 John S. Dyson
6 * Copyright (c) 1995, David Greenman
8 * This code is derived from software contributed to Berkeley by
9 * the Systems Programming Group of the University of Utah Computer
12 * Redistribution and use in source and binary forms, with or without
13 * modification, are permitted provided that the following conditions
15 * 1. Redistributions of source code must retain the above copyright
16 * notice, this list of conditions and the following disclaimer.
17 * 2. Redistributions in binary form must reproduce the above copyright
18 * notice, this list of conditions and the following disclaimer in the
19 * documentation and/or other materials provided with the distribution.
20 * 3. All advertising materials mentioning features or use of this software
21 * must display the following acknowledgement:
22 * This product includes software developed by the University of
23 * California, Berkeley and its contributors.
24 * 4. Neither the name of the University nor the names of its contributors
25 * may be used to endorse or promote products derived from this software
26 * without specific prior written permission.
28 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
29 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
30 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
31 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
32 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
33 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
34 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
35 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
36 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
37 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
40 * from: @(#)vnode_pager.c 7.5 (Berkeley) 4/20/91
41 * $FreeBSD: src/sys/vm/vnode_pager.c,v 1.116.2.7 2002/12/31 09:34:51 dillon Exp $
42 * $DragonFly: src/sys/vm/vnode_pager.c,v 1.37 2007/08/13 17:31:53 dillon Exp $
46 * Page to/from files (vnodes).
51 * Implement VOP_GETPAGES/PUTPAGES interface for filesystems. Will
52 * greatly re-simplify the vnode_pager.
55 #include <sys/param.h>
56 #include <sys/systm.h>
57 #include <sys/kernel.h>
59 #include <sys/vnode.h>
60 #include <sys/mount.h>
62 #include <sys/vmmeter.h>
64 #include <sys/sfbuf.h>
65 #include <sys/thread2.h>
68 #include <vm/vm_object.h>
69 #include <vm/vm_page.h>
70 #include <vm/vm_pager.h>
71 #include <vm/vm_map.h>
72 #include <vm/vnode_pager.h>
73 #include <vm/vm_extern.h>
75 static void vnode_pager_dealloc (vm_object_t);
76 static int vnode_pager_getpages (vm_object_t, vm_page_t *, int, int);
77 static void vnode_pager_putpages (vm_object_t, vm_page_t *, int, boolean_t, int *);
78 static boolean_t vnode_pager_haspage (vm_object_t, vm_pindex_t, int *, int *);
80 struct pagerops vnodepagerops = {
90 static struct krate vbadrate = { 1 };
91 static struct krate vresrate = { 1 };
93 int vnode_pbuf_freecnt = -1; /* start out unlimited */
96 * Allocate (or lookup) pager for a vnode.
97 * Handle is a vnode pointer.
100 vnode_pager_alloc(void *handle, off_t size, vm_prot_t prot, off_t offset)
106 * Pageout to vnode, no can do yet.
112 * XXX hack - This initialization should be put somewhere else.
114 if (vnode_pbuf_freecnt < 0) {
115 vnode_pbuf_freecnt = nswbuf / 2 + 1;
118 vp = (struct vnode *) handle;
121 * Prevent race condition when allocating the object. This
122 * can happen with NFS vnodes since the nfsnode isn't locked.
124 while (vp->v_flag & VOLOCK) {
125 vp->v_flag |= VOWANT;
126 tsleep(vp, 0, "vnpobj", 0);
128 vp->v_flag |= VOLOCK;
131 * If the object is being terminated, wait for it to
134 while (((object = vp->v_object) != NULL) &&
135 (object->flags & OBJ_DEAD)) {
136 vm_object_dead_sleep(object, "vadead");
139 if (vp->v_sysref.refcnt <= 0)
140 panic("vnode_pager_alloc: no vnode reference");
142 if (object == NULL) {
144 * And an object of the appropriate size
146 object = vm_object_allocate(OBJT_VNODE, OFF_TO_IDX(round_page(size)));
148 object->handle = handle;
149 vp->v_object = object;
150 vp->v_filesize = size;
153 if (vp->v_filesize != size)
154 kprintf("vnode_pager_alloc: Warning, filesize mismatch %lld/%lld\n", vp->v_filesize, size);
158 vp->v_flag &= ~VOLOCK;
159 if (vp->v_flag & VOWANT) {
160 vp->v_flag &= ~VOWANT;
167 vnode_pager_dealloc(vm_object_t object)
169 struct vnode *vp = object->handle;
172 panic("vnode_pager_dealloc: pager already dealloced");
174 vm_object_pip_wait(object, "vnpdea");
176 object->handle = NULL;
177 object->type = OBJT_DEAD;
179 vp->v_filesize = NOOFFSET;
180 vp->v_flag &= ~(VTEXT | VOBJBUF);
184 * Return whether the vnode pager has the requested page. Return the
185 * number of disk-contiguous pages before and after the requested page,
186 * not including the requested page.
189 vnode_pager_haspage(vm_object_t object, vm_pindex_t pindex, int *before,
192 struct vnode *vp = object->handle;
200 * If no vp or vp is doomed or marked transparent to VM, we do not
203 if ((vp == NULL) || (vp->v_flag & VRECLAIMED))
207 * If filesystem no longer mounted or offset beyond end of file we do
210 loffset = IDX_TO_OFF(pindex);
212 if (vp->v_mount == NULL || loffset >= vp->v_filesize)
215 bsize = vp->v_mount->mnt_stat.f_iosize;
216 voff = loffset % bsize;
218 error = VOP_BMAP(vp, loffset - voff, &doffset, after, before);
221 if (doffset == NOOFFSET)
225 *before = (*before + voff) >> PAGE_SHIFT;
229 if (loffset + *after > vp->v_filesize)
230 *after = vp->v_filesize - loffset;
231 *after >>= PAGE_SHIFT;
239 * Lets the VM system know about a change in size for a file.
240 * We adjust our own internal size and flush any cached pages in
241 * the associated object that are affected by the size change.
243 * NOTE: This routine may be invoked as a result of a pager put
244 * operation (possibly at object termination time), so we must be careful.
246 * NOTE: vp->v_filesize is initialized to NOOFFSET (-1), be sure that
247 * we do not blow up on the case. nsize will always be >= 0, however.
250 vnode_pager_setsize(struct vnode *vp, vm_ooffset_t nsize)
252 vm_pindex_t nobjsize;
253 vm_pindex_t oobjsize;
254 vm_object_t object = vp->v_object;
260 * Hasn't changed size
262 if (nsize == vp->v_filesize)
266 * Has changed size. Adjust the VM object's size and v_filesize
267 * before we start scanning pages to prevent new pages from being
268 * allocated during the scan.
270 nobjsize = OFF_TO_IDX(nsize + PAGE_MASK);
271 oobjsize = object->size;
272 object->size = nobjsize;
275 * File has shrunk. Toss any cached pages beyond the new EOF.
277 if (nsize < vp->v_filesize) {
278 vp->v_filesize = nsize;
279 if (nobjsize < oobjsize) {
280 vm_object_page_remove(object, nobjsize, oobjsize,
284 * This gets rid of garbage at the end of a page that is now
285 * only partially backed by the vnode. Since we are setting
286 * the entire page valid & clean after we are done we have
287 * to be sure that the portion of the page within the file
288 * bounds is already valid. If it isn't then making it
289 * valid would create a corrupt block.
291 if (nsize & PAGE_MASK) {
295 m = vm_page_lookup(object, OFF_TO_IDX(nsize));
297 int base = (int)nsize & PAGE_MASK;
298 int size = PAGE_SIZE - base;
302 * Clear out partial-page garbage in case
303 * the page has been mapped.
305 sf = sf_buf_alloc(m, SFB_CPUPRIVATE);
306 kva = sf_buf_kva(sf);
307 bzero((caddr_t)kva + base, size);
311 * XXX work around SMP data integrity race
312 * by unmapping the page from user processes.
313 * The garbage we just cleared may be mapped
314 * to a user process running on another cpu
315 * and this code is not running through normal
316 * I/O channels which handle SMP issues for
317 * us, so unmap page to synchronize all cpus.
319 * XXX should vm_pager_unmap_page() have
322 vm_page_protect(m, VM_PROT_NONE);
325 * Clear out partial-page dirty bits. This
326 * has the side effect of setting the valid
327 * bits, but that is ok. There are a bunch
328 * of places in the VM system where we expected
329 * m->dirty == VM_PAGE_BITS_ALL. The file EOF
330 * case is one of them. If the page is still
331 * partially dirty, make it fully dirty.
333 * note that we do not clear out the valid
334 * bits. This would prevent bogus_page
335 * replacement from working properly.
337 vm_page_set_validclean(m, base, size);
339 m->dirty = VM_PAGE_BITS_ALL;
343 vp->v_filesize = nsize;
348 vnode_pager_freepage(vm_page_t m)
354 * EOPNOTSUPP is no longer legal. For local media VFS's that do not
355 * implement their own VOP_GETPAGES, their VOP_GETPAGES should call to
356 * vnode_pager_generic_getpages() to implement the previous behaviour.
358 * All other FS's should use the bypass to get to the local media
359 * backing vp's VOP_GETPAGES.
362 vnode_pager_getpages(vm_object_t object, vm_page_t *m, int count, int reqpage)
366 int bytes = count * PAGE_SIZE;
369 rtval = VOP_GETPAGES(vp, m, bytes, reqpage, 0);
370 if (rtval == EOPNOTSUPP)
371 panic("vnode_pager: vfs's must implement vop_getpages\n");
376 * This is now called from local media FS's to operate against their
377 * own vnodes if they fail to implement VOP_GETPAGES.
379 * With all the caching local media devices do these days there is really
380 * very little point to attempting to restrict the I/O size to contiguous
381 * blocks on-disk, especially if our caller thinks we need all the specified
382 * pages. Just construct and issue a READ.
385 vnode_pager_generic_getpages(struct vnode *vp, vm_page_t *m, int bytecount,
397 * Do not do anything if the vnode is bad.
399 if (vp->v_mount == NULL)
403 * Calculate the number of pages. Since we are paging in whole
404 * pages, adjust bytecount to be an integral multiple of the page
405 * size. It will be clipped to the file EOF later on.
407 bytecount = round_page(bytecount);
408 count = bytecount / PAGE_SIZE;
411 * If we have a completely valid page available to us, we can
412 * clean up and return. Otherwise we have to re-read the
415 * Note that this does not work with NFS, so NFS has its own
416 * getpages routine. The problem is that NFS can have partially
417 * valid pages associated with the buffer cache due to the piecemeal
418 * write support. If we were to fall through and re-read the media
419 * as we do here, dirty data could be lost.
421 if (m[reqpage]->valid == VM_PAGE_BITS_ALL) {
422 for (i = 0; i < count; i++) {
424 vnode_pager_freepage(m[i]);
428 m[reqpage]->valid = 0;
431 * Discard pages past the file EOF. If the requested page is past
432 * the file EOF we just leave its valid bits set to 0, the caller
433 * expects to maintain ownership of the requested page. If the
434 * entire range is past file EOF discard everything and generate
437 foff = IDX_TO_OFF(m[0]->pindex);
438 if (foff >= vp->v_filesize) {
439 for (i = 0; i < count; i++) {
441 vnode_pager_freepage(m[i]);
443 m[reqpage]->valid = 0;
444 return VM_PAGER_ERROR;
447 if (foff + bytecount > vp->v_filesize) {
448 bytecount = vp->v_filesize - foff;
449 i = round_page(bytecount) / PAGE_SIZE;
452 if (count != reqpage)
453 vnode_pager_freepage(m[count]);
458 * The size of the transfer is bytecount. bytecount will be an
459 * integral multiple of the page size unless it has been clipped
460 * to the file EOF. The transfer cannot exceed the file EOF.
462 * When dealing with real devices we must round-up to the device
465 if (vp->v_type == VBLK || vp->v_type == VCHR) {
466 int secmask = vp->v_rdev->si_bsize_phys - 1;
467 KASSERT(secmask < PAGE_SIZE, ("vnode_pager_generic_getpages: sector size %d too large\n", secmask + 1));
468 bytecount = (bytecount + secmask) & ~secmask;
472 * Issue the I/O without any read-ahead
475 /*ioflags |= IO_SEQMAX << IO_SEQSHIFT;*/
477 aiov.iov_base = (caddr_t) 0;
478 aiov.iov_len = bytecount;
479 auio.uio_iov = &aiov;
481 auio.uio_offset = foff;
482 auio.uio_segflg = UIO_NOCOPY;
483 auio.uio_rw = UIO_READ;
484 auio.uio_resid = bytecount;
486 mycpu->gd_cnt.v_vnodein++;
487 mycpu->gd_cnt.v_vnodepgsin += count;
489 error = VOP_READ(vp, &auio, ioflags, proc0.p_ucred);
492 * Calculate the actual number of bytes read and clean up the
495 bytecount -= auio.uio_resid;
497 for (i = 0; i < count; ++i) {
501 if (mt->flags & PG_WANTED)
502 vm_page_activate(mt);
504 vm_page_deactivate(mt);
507 vnode_pager_freepage(mt);
512 kprintf("vnode_pager_getpages: I/O read error\n");
514 return (error ? VM_PAGER_ERROR : VM_PAGER_OK);
518 * EOPNOTSUPP is no longer legal. For local media VFS's that do not
519 * implement their own VOP_PUTPAGES, their VOP_PUTPAGES should call to
520 * vnode_pager_generic_putpages() to implement the previous behaviour.
522 * All other FS's should use the bypass to get to the local media
523 * backing vp's VOP_PUTPAGES.
526 vnode_pager_putpages(vm_object_t object, vm_page_t *m, int count,
527 boolean_t sync, int *rtvals)
531 int bytes = count * PAGE_SIZE;
534 * Force synchronous operation if we are extremely low on memory
535 * to prevent a low-memory deadlock. VOP operations often need to
536 * allocate more memory to initiate the I/O ( i.e. do a BMAP
537 * operation ). The swapper handles the case by limiting the amount
538 * of asynchronous I/O, but that sort of solution doesn't scale well
539 * for the vnode pager without a lot of work.
541 * Also, the backing vnode's iodone routine may not wake the pageout
542 * daemon up. This should be probably be addressed XXX.
545 if ((vmstats.v_free_count + vmstats.v_cache_count) < vmstats.v_pageout_free_min)
549 * Call device-specific putpages function
553 rtval = VOP_PUTPAGES(vp, m, bytes, sync, rtvals, 0);
554 if (rtval == EOPNOTSUPP) {
555 kprintf("vnode_pager: *** WARNING *** stale FS putpages\n");
556 rtval = vnode_pager_generic_putpages( vp, m, bytes, sync, rtvals);
562 * This is now called from local media FS's to operate against their
563 * own vnodes if they fail to implement VOP_PUTPAGES.
565 * This is typically called indirectly via the pageout daemon and
566 * clustering has already typically occured, so in general we ask the
567 * underlying filesystem to write the data out asynchronously rather
571 vnode_pager_generic_putpages(struct vnode *vp, vm_page_t *m, int bytecount,
572 int flags, int *rtvals)
579 vm_ooffset_t poffset;
585 object = vp->v_object;
586 count = bytecount / PAGE_SIZE;
588 for (i = 0; i < count; i++)
589 rtvals[i] = VM_PAGER_AGAIN;
591 if ((int) m[0]->pindex < 0) {
592 kprintf("vnode_pager_putpages: attempt to write meta-data!!! -- 0x%lx(%x)\n",
593 (long)m[0]->pindex, m[0]->dirty);
594 rtvals[0] = VM_PAGER_BAD;
598 maxsize = count * PAGE_SIZE;
601 poffset = IDX_TO_OFF(m[0]->pindex);
604 * If the page-aligned write is larger then the actual file we
605 * have to invalidate pages occuring beyond the file EOF. However,
606 * there is an edge case where a file may not be page-aligned where
607 * the last page is partially invalid. In this case the filesystem
608 * may not properly clear the dirty bits for the entire page (which
609 * could be VM_PAGE_BITS_ALL due to the page having been mmap()d).
610 * With the page locked we are free to fix-up the dirty bits here.
612 * We do not under any circumstances truncate the valid bits, as
613 * this will screw up bogus page replacement.
615 if (maxsize + poffset > vp->v_filesize) {
616 if (vp->v_filesize > poffset) {
619 maxsize = vp->v_filesize - poffset;
620 ncount = btoc(maxsize);
621 if ((pgoff = (int)maxsize & PAGE_MASK) != 0) {
622 vm_page_clear_dirty(m[ncount - 1], pgoff,
629 if (ncount < count) {
630 for (i = ncount; i < count; i++) {
631 rtvals[i] = VM_PAGER_BAD;
637 * pageouts are already clustered, use IO_ASYNC to force a bawrite()
638 * rather then a bdwrite() to prevent paging I/O from saturating
639 * the buffer cache. Dummy-up the sequential heuristic to cause
640 * large ranges to cluster. If neither IO_SYNC or IO_ASYNC is set,
641 * the system decides how to cluster.
644 if (flags & (VM_PAGER_PUT_SYNC | VM_PAGER_PUT_INVAL))
646 else if ((flags & VM_PAGER_CLUSTER_OK) == 0)
648 ioflags |= (flags & VM_PAGER_PUT_INVAL) ? IO_INVAL: 0;
649 ioflags |= IO_SEQMAX << IO_SEQSHIFT;
651 aiov.iov_base = (caddr_t) 0;
652 aiov.iov_len = maxsize;
653 auio.uio_iov = &aiov;
655 auio.uio_offset = poffset;
656 auio.uio_segflg = UIO_NOCOPY;
657 auio.uio_rw = UIO_WRITE;
658 auio.uio_resid = maxsize;
660 error = VOP_WRITE(vp, &auio, ioflags, proc0.p_ucred);
661 mycpu->gd_cnt.v_vnodeout++;
662 mycpu->gd_cnt.v_vnodepgsout += ncount;
665 krateprintf(&vbadrate,
666 "vnode_pager_putpages: I/O error %d\n", error);
668 if (auio.uio_resid) {
669 krateprintf(&vresrate,
670 "vnode_pager_putpages: residual I/O %d at %lu\n",
671 auio.uio_resid, (u_long)m[0]->pindex);
673 for (i = 0; i < ncount; i++) {
674 rtvals[i] = VM_PAGER_OK;
680 vnode_pager_lock(vm_object_t object)
682 struct thread *td = curthread; /* XXX */
685 for (; object != NULL; object = object->backing_object) {
686 if (object->type != OBJT_VNODE)
688 if (object->flags & OBJ_DEAD)
692 struct vnode *vp = object->handle;
693 error = vget(vp, LK_SHARED | LK_RETRY | LK_CANRECURSE);
695 if (object->handle != vp) {
701 if ((object->flags & OBJ_DEAD) ||
702 (object->type != OBJT_VNODE)) {
705 kprintf("vnode_pager_lock: vp %p error %d lockstatus %d, retrying\n", vp, error, lockstatus(&vp->v_lock, td));
706 tsleep(object->handle, 0, "vnpgrl", hz);