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
45 * Page to/from files (vnodes).
50 * Implement VOP_GETPAGES/PUTPAGES interface for filesystems. Will
51 * greatly re-simplify the vnode_pager.
54 #include <sys/param.h>
55 #include <sys/systm.h>
57 #include <sys/vnode.h>
58 #include <sys/mount.h>
61 #include <sys/vmmeter.h>
65 #include <vm/vm_object.h>
66 #include <vm/vm_page.h>
67 #include <vm/vm_pager.h>
68 #include <vm/vm_map.h>
69 #include <vm/vnode_pager.h>
70 #include <vm/vm_extern.h>
72 static void vnode_pager_init __P((void));
73 static vm_offset_t vnode_pager_addr __P((struct vnode *vp, vm_ooffset_t address,
75 static void vnode_pager_iodone __P((struct buf *bp));
76 static int vnode_pager_input_smlfs __P((vm_object_t object, vm_page_t m));
77 static int vnode_pager_input_old __P((vm_object_t object, vm_page_t m));
78 static void vnode_pager_dealloc __P((vm_object_t));
79 static int vnode_pager_getpages __P((vm_object_t, vm_page_t *, int, int));
80 static void vnode_pager_putpages __P((vm_object_t, vm_page_t *, int, boolean_t, int *));
81 static boolean_t vnode_pager_haspage __P((vm_object_t, vm_pindex_t, int *, int *));
83 struct pagerops vnodepagerops = {
93 int vnode_pbuf_freecnt;
96 vnode_pager_init(void)
99 vnode_pbuf_freecnt = nswbuf / 2 + 1;
103 * Allocate (or lookup) pager for a vnode.
104 * Handle is a vnode pointer.
107 vnode_pager_alloc(void *handle, vm_ooffset_t size, vm_prot_t prot,
116 * Pageout to vnode, no can do yet.
121 vp = (struct vnode *) handle;
124 * Prevent race condition when allocating the object. This
125 * can happen with NFS vnodes since the nfsnode isn't locked.
127 while (vp->v_flag & VOLOCK) {
128 vp->v_flag |= VOWANT;
129 tsleep(vp, PVM, "vnpobj", 0);
131 vp->v_flag |= VOLOCK;
134 * If the object is being terminated, wait for it to
137 while (((object = vp->v_object) != NULL) &&
138 (object->flags & OBJ_DEAD)) {
139 tsleep(object, PVM, "vadead", 0);
142 if (vp->v_usecount == 0)
143 panic("vnode_pager_alloc: no vnode reference");
145 if (object == NULL) {
147 * And an object of the appropriate size
149 object = vm_object_allocate(OBJT_VNODE, OFF_TO_IDX(round_page(size)));
152 object->un_pager.vnp.vnp_size = size;
154 object->handle = handle;
155 vp->v_object = object;
162 vp->v_flag &= ~VOLOCK;
163 if (vp->v_flag & VOWANT) {
164 vp->v_flag &= ~VOWANT;
171 vnode_pager_dealloc(object)
174 struct vnode *vp = object->handle;
178 panic("vnode_pager_dealloc: pager already dealloced");
180 vm_object_pip_wait(object, "vnpdea");
182 object->handle = NULL;
183 object->type = OBJT_DEAD;
185 vp->v_flag &= ~(VTEXT | VOBJBUF);
189 vnode_pager_haspage(object, pindex, before, after)
195 struct vnode *vp = object->handle;
201 int pagesperblock, blocksperpage;
205 * If no vp or vp is doomed or marked transparent to VM, we do not
208 if ((vp == NULL) || (vp->v_flag & VDOOMED))
212 * If filesystem no longer mounted or offset beyond end of file we do
215 if ((vp->v_mount == NULL) ||
216 (IDX_TO_OFF(pindex) >= object->un_pager.vnp.vnp_size))
219 bsize = vp->v_mount->mnt_stat.f_iosize;
220 pagesperblock = bsize / PAGE_SIZE;
222 if (pagesperblock > 0) {
223 reqblock = pindex / pagesperblock;
225 blocksperpage = (PAGE_SIZE / bsize);
226 reqblock = pindex * blocksperpage;
228 err = VOP_BMAP(vp, reqblock, (struct vnode **) 0, &bn,
234 if (pagesperblock > 0) {
235 poff = pindex - (reqblock * pagesperblock);
237 *before *= pagesperblock;
242 *after *= pagesperblock;
243 numafter = pagesperblock - (poff + 1);
244 if (IDX_TO_OFF(pindex + numafter) > object->un_pager.vnp.vnp_size) {
245 numafter = OFF_TO_IDX((object->un_pager.vnp.vnp_size - IDX_TO_OFF(pindex)));
251 *before /= blocksperpage;
255 *after /= blocksperpage;
262 * Lets the VM system know about a change in size for a file.
263 * We adjust our own internal size and flush any cached pages in
264 * the associated object that are affected by the size change.
266 * Note: this routine may be invoked as a result of a pager put
267 * operation (possibly at object termination time), so we must be careful.
270 vnode_pager_setsize(vp, nsize)
274 vm_pindex_t nobjsize;
275 vm_object_t object = vp->v_object;
283 * Hasn't changed size
285 if (nsize == object->un_pager.vnp.vnp_size)
288 nobjsize = OFF_TO_IDX(nsize + PAGE_MASK);
291 * File has shrunk. Toss any cached pages beyond the new EOF.
293 if (nsize < object->un_pager.vnp.vnp_size) {
294 vm_freeze_copyopts(object, OFF_TO_IDX(nsize), object->size);
295 if (nobjsize < object->size) {
296 vm_object_page_remove(object, nobjsize, object->size,
300 * this gets rid of garbage at the end of a page that is now
301 * only partially backed by the vnode.
303 * XXX for some reason (I don't know yet), if we take a
304 * completely invalid page and mark it partially valid
305 * it can screw up NFS reads, so we don't allow the case.
307 if (nsize & PAGE_MASK) {
311 m = vm_page_lookup(object, OFF_TO_IDX(nsize));
313 int base = (int)nsize & PAGE_MASK;
314 int size = PAGE_SIZE - base;
317 * Clear out partial-page garbage in case
318 * the page has been mapped.
320 kva = vm_pager_map_page(m);
321 bzero((caddr_t)kva + base, size);
322 vm_pager_unmap_page(kva);
325 * XXX work around SMP data integrity race
326 * by unmapping the page from user processes.
327 * The garbage we just cleared may be mapped
328 * to a user process running on another cpu
329 * and this code is not running through normal
330 * I/O channels which handle SMP issues for
331 * us, so unmap page to synchronize all cpus.
333 * XXX should vm_pager_unmap_page() have
336 vm_page_protect(m, VM_PROT_NONE);
339 * Clear out partial-page dirty bits. This
340 * has the side effect of setting the valid
341 * bits, but that is ok. There are a bunch
342 * of places in the VM system where we expected
343 * m->dirty == VM_PAGE_BITS_ALL. The file EOF
344 * case is one of them. If the page is still
345 * partially dirty, make it fully dirty.
347 * note that we do not clear out the valid
348 * bits. This would prevent bogus_page
349 * replacement from working properly.
351 vm_page_set_validclean(m, base, size);
353 m->dirty = VM_PAGE_BITS_ALL;
357 object->un_pager.vnp.vnp_size = nsize;
358 object->size = nobjsize;
362 * calculate the linear (byte) disk address of specified virtual
366 vnode_pager_addr(vp, address, run)
368 vm_ooffset_t address;
380 if ((int) address < 0)
383 if (vp->v_mount == NULL)
386 bsize = vp->v_mount->mnt_stat.f_iosize;
387 vblock = address / bsize;
388 voffset = address % bsize;
390 err = VOP_BMAP(vp, vblock, &rtvp, &block, run, NULL);
392 if (err || (block == -1))
395 rtaddress = block + voffset / DEV_BSIZE;
398 *run *= bsize/PAGE_SIZE;
399 *run -= voffset/PAGE_SIZE;
407 * interrupt routine for I/O completion
410 vnode_pager_iodone(bp)
413 bp->b_flags |= B_DONE;
418 * small block file system vnode pager input
421 vnode_pager_input_smlfs(object, m)
427 struct vnode *dp, *vp;
437 if (vp->v_mount == NULL)
440 bsize = vp->v_mount->mnt_stat.f_iosize;
442 VOP_BMAP(vp, 0, &dp, 0, NULL, NULL);
444 kva = vm_pager_map_page(m);
446 for (i = 0; i < PAGE_SIZE / bsize; i++) {
447 vm_ooffset_t address;
449 if (vm_page_bits(i * bsize, bsize) & m->valid)
452 address = IDX_TO_OFF(m->pindex) + i * bsize;
453 if (address >= object->un_pager.vnp.vnp_size) {
456 fileaddr = vnode_pager_addr(vp, address, NULL);
458 if (fileaddr != -1) {
459 bp = getpbuf(&vnode_pbuf_freecnt);
461 /* build a minimal buffer header */
462 bp->b_iocmd = BIO_READ;
463 bp->b_iodone = vnode_pager_iodone;
464 KASSERT(bp->b_rcred == NOCRED, ("leaking read ucred"));
465 KASSERT(bp->b_wcred == NOCRED, ("leaking write ucred"));
466 bp->b_rcred = crhold(curthread->td_proc->p_ucred);
467 bp->b_wcred = crhold(curthread->td_proc->p_ucred);
468 bp->b_data = (caddr_t) kva + i * bsize;
469 bp->b_blkno = fileaddr;
471 bp->b_bcount = bsize;
472 bp->b_bufsize = bsize;
473 bp->b_runningbufspace = bp->b_bufsize;
474 runningbufspace += bp->b_runningbufspace;
479 /* we definitely need to be at splvm here */
482 while ((bp->b_flags & B_DONE) == 0) {
483 tsleep(bp, PVM, "vnsrd", 0);
486 if ((bp->b_ioflags & BIO_ERROR) != 0)
490 * free the buffer header back to the swap buffer pool
492 relpbuf(bp, &vnode_pbuf_freecnt);
496 vm_page_set_validclean(m, (i * bsize) & PAGE_MASK, bsize);
498 vm_page_set_validclean(m, (i * bsize) & PAGE_MASK, bsize);
499 bzero((caddr_t) kva + i * bsize, bsize);
502 vm_pager_unmap_page(kva);
503 pmap_clear_modify(m);
504 vm_page_flag_clear(m, PG_ZERO);
506 return VM_PAGER_ERROR;
514 * old style vnode pager output routine
517 vnode_pager_input_old(object, m)
532 * Return failure if beyond current EOF
534 if (IDX_TO_OFF(m->pindex) >= object->un_pager.vnp.vnp_size) {
538 if (IDX_TO_OFF(m->pindex) + size > object->un_pager.vnp.vnp_size)
539 size = object->un_pager.vnp.vnp_size - IDX_TO_OFF(m->pindex);
542 * Allocate a kernel virtual address and initialize so that
543 * we can use VOP_READ/WRITE routines.
545 kva = vm_pager_map_page(m);
548 aiov.iov_base = (caddr_t) kva;
550 auio.uio_iov = &aiov;
552 auio.uio_offset = IDX_TO_OFF(m->pindex);
553 auio.uio_segflg = UIO_SYSSPACE;
554 auio.uio_rw = UIO_READ;
555 auio.uio_resid = size;
556 auio.uio_td = curthread;
558 error = VOP_READ(vp, &auio, 0, curthread->td_proc->p_ucred);
560 int count = size - auio.uio_resid;
564 else if (count != PAGE_SIZE)
565 bzero((caddr_t) kva + count, PAGE_SIZE - count);
567 vm_pager_unmap_page(kva);
569 pmap_clear_modify(m);
571 vm_page_flag_clear(m, PG_ZERO);
573 m->valid = VM_PAGE_BITS_ALL;
574 return error ? VM_PAGER_ERROR : VM_PAGER_OK;
578 * generic vnode pager input routine
582 * Local media VFS's that do not implement their own VOP_GETPAGES
583 * should have their VOP_GETPAGES should call to
584 * vnode_pager_generic_getpages() to implement the previous behaviour.
586 * All other FS's should use the bypass to get to the local media
587 * backing vp's VOP_GETPAGES.
590 vnode_pager_getpages(object, m, count, reqpage)
598 int bytes = count * PAGE_SIZE;
602 rtval = VOP_GETPAGES(vp, m, bytes, reqpage, 0);
603 KASSERT(rtval != EOPNOTSUPP,
604 ("vnode_pager: FS getpages not implemented\n"));
610 * This is now called from local media FS's to operate against their
611 * own vnodes if they fail to implement VOP_GETPAGES.
614 vnode_pager_generic_getpages(vp, m, bytecount, reqpage)
622 off_t foff, tfoff, nextoff;
623 int i, size, bsize, first, firstaddr;
633 object = vp->v_object;
634 count = bytecount / PAGE_SIZE;
636 if (vp->v_mount == NULL)
639 bsize = vp->v_mount->mnt_stat.f_iosize;
641 /* get the UNDERLYING device for the file with VOP_BMAP() */
644 * originally, we did not check for an error return value -- assuming
645 * an fs always has a bmap entry point -- that assumption is wrong!!!
647 foff = IDX_TO_OFF(m[reqpage]->pindex);
650 * if we can't bmap, use old VOP code
652 if (VOP_BMAP(vp, 0, &dp, 0, NULL, NULL)) {
653 for (i = 0; i < count; i++) {
660 return vnode_pager_input_old(object, m[reqpage]);
663 * if the blocksize is smaller than a page size, then use
664 * special small filesystem code. NFS sometimes has a small
665 * blocksize, but it can handle large reads itself.
667 } else if ((PAGE_SIZE / bsize) > 1 &&
668 (vp->v_mount->mnt_stat.f_type != nfs_mount_type)) {
669 for (i = 0; i < count; i++) {
676 return vnode_pager_input_smlfs(object, m[reqpage]);
680 * If we have a completely valid page available to us, we can
681 * clean up and return. Otherwise we have to re-read the
685 if (m[reqpage]->valid == VM_PAGE_BITS_ALL) {
686 for (i = 0; i < count; i++) {
692 m[reqpage]->valid = 0;
695 * here on direct device I/O
700 * calculate the run that includes the required page
702 for(first = 0, i = 0; i < count; i = runend) {
703 firstaddr = vnode_pager_addr(vp,
704 IDX_TO_OFF(m[i]->pindex), &runpg);
705 if (firstaddr == -1) {
706 if (i == reqpage && foff < object->un_pager.vnp.vnp_size) {
707 /* XXX no %qd in kernel. */
708 panic("vnode_pager_getpages: unexpected missing page: firstaddr: %d, foff: 0x%lx%08lx, vnp_size: 0x%lx%08lx",
709 firstaddr, (u_long)(foff >> 32),
710 (u_long)(u_int32_t)foff,
712 (object->un_pager.vnp.vnp_size >> 32),
714 object->un_pager.vnp.vnp_size);
722 if (runend <= reqpage) {
724 for (j = i; j < runend; j++) {
728 if (runpg < (count - first)) {
729 for (i = first + runpg; i < count; i++)
731 count = first + runpg;
739 * the first and last page have been calculated now, move input pages
740 * to be zero based...
743 for (i = first; i < count; i++) {
751 * calculate the file virtual address for the transfer
753 foff = IDX_TO_OFF(m[0]->pindex);
756 * calculate the size of the transfer
758 size = count * PAGE_SIZE;
759 if ((foff + size) > object->un_pager.vnp.vnp_size)
760 size = object->un_pager.vnp.vnp_size - foff;
763 * round up physical size for real devices.
765 if (dp->v_type == VBLK || dp->v_type == VCHR) {
766 int secmask = dp->v_rdev->si_bsize_phys - 1;
767 KASSERT(secmask < PAGE_SIZE, ("vnode_pager_generic_getpages: sector size %d too large\n", secmask + 1));
768 size = (size + secmask) & ~secmask;
771 bp = getpbuf(&vnode_pbuf_freecnt);
772 kva = (vm_offset_t) bp->b_data;
775 * and map the pages to be read into the kva
777 pmap_qenter(kva, m, count);
779 /* build a minimal buffer header */
780 bp->b_iocmd = BIO_READ;
781 bp->b_iodone = vnode_pager_iodone;
782 /* B_PHYS is not set, but it is nice to fill this in */
783 KASSERT(bp->b_rcred == NOCRED, ("leaking read ucred"));
784 KASSERT(bp->b_wcred == NOCRED, ("leaking write ucred"));
785 bp->b_rcred = crhold(curthread->td_proc->p_ucred);
786 bp->b_wcred = crhold(curthread->td_proc->p_ucred);
787 bp->b_blkno = firstaddr;
790 bp->b_bufsize = size;
791 bp->b_runningbufspace = bp->b_bufsize;
792 runningbufspace += bp->b_runningbufspace;
795 cnt.v_vnodepgsin += count;
801 /* we definitely need to be at splvm here */
803 while ((bp->b_flags & B_DONE) == 0) {
804 tsleep(bp, PVM, "vnread", 0);
807 if ((bp->b_ioflags & BIO_ERROR) != 0)
811 if (size != count * PAGE_SIZE)
812 bzero((caddr_t) kva + size, PAGE_SIZE * count - size);
814 pmap_qremove(kva, count);
817 * free the buffer header back to the swap buffer pool
819 relpbuf(bp, &vnode_pbuf_freecnt);
821 for (i = 0, tfoff = foff; i < count; i++, tfoff = nextoff) {
824 nextoff = tfoff + PAGE_SIZE;
827 if (nextoff <= object->un_pager.vnp.vnp_size) {
829 * Read filled up entire page.
831 mt->valid = VM_PAGE_BITS_ALL;
832 vm_page_undirty(mt); /* should be an assert? XXX */
833 pmap_clear_modify(mt);
836 * Read did not fill up entire page. Since this
837 * is getpages, the page may be mapped, so we have
838 * to zero the invalid portions of the page even
839 * though we aren't setting them valid.
841 * Currently we do not set the entire page valid,
842 * we just try to clear the piece that we couldn't
845 vm_page_set_validclean(mt, 0,
846 object->un_pager.vnp.vnp_size - tfoff);
847 /* handled by vm_fault now */
848 /* vm_page_zero_invalid(mt, FALSE); */
851 vm_page_flag_clear(mt, PG_ZERO);
855 * whether or not to leave the page activated is up in
856 * the air, but we should put the page on a page queue
857 * somewhere. (it already is in the object). Result:
858 * It appears that empirical results show that
859 * deactivating pages is best.
863 * just in case someone was asking for this page we
864 * now tell them that it is ok to use
867 if (mt->flags & PG_WANTED)
868 vm_page_activate(mt);
870 vm_page_deactivate(mt);
878 printf("vnode_pager_getpages: I/O read error\n");
880 return (error ? VM_PAGER_ERROR : VM_PAGER_OK);
884 * EOPNOTSUPP is no longer legal. For local media VFS's that do not
885 * implement their own VOP_PUTPAGES, their VOP_PUTPAGES should call to
886 * vnode_pager_generic_putpages() to implement the previous behaviour.
888 * All other FS's should use the bypass to get to the local media
889 * backing vp's VOP_PUTPAGES.
892 vnode_pager_putpages(object, m, count, sync, rtvals)
902 int bytes = count * PAGE_SIZE;
906 * Force synchronous operation if we are extremely low on memory
907 * to prevent a low-memory deadlock. VOP operations often need to
908 * allocate more memory to initiate the I/O ( i.e. do a BMAP
909 * operation ). The swapper handles the case by limiting the amount
910 * of asynchronous I/O, but that sort of solution doesn't scale well
911 * for the vnode pager without a lot of work.
913 * Also, the backing vnode's iodone routine may not wake the pageout
914 * daemon up. This should be probably be addressed XXX.
917 if ((cnt.v_free_count + cnt.v_cache_count) < cnt.v_pageout_free_min)
921 * Call device-specific putpages function
925 if (vp->v_type != VREG)
927 (void)vn_start_write(vp, &mp, V_WAIT);
928 rtval = VOP_PUTPAGES(vp, m, bytes, sync, rtvals, 0);
929 KASSERT(rtval != EOPNOTSUPP,
930 ("vnode_pager: stale FS putpages\n"));
931 vn_finished_write(mp);
936 * This is now called from local media FS's to operate against their
937 * own vnodes if they fail to implement VOP_PUTPAGES.
939 * This is typically called indirectly via the pageout daemon and
940 * clustering has already typically occured, so in general we ask the
941 * underlying filesystem to write the data out asynchronously rather
945 vnode_pager_generic_putpages(vp, m, bytecount, flags, rtvals)
957 vm_ooffset_t poffset;
964 object = vp->v_object;
965 count = bytecount / PAGE_SIZE;
967 for (i = 0; i < count; i++)
968 rtvals[i] = VM_PAGER_AGAIN;
970 if ((int) m[0]->pindex < 0) {
971 printf("vnode_pager_putpages: attempt to write meta-data!!! -- 0x%lx(%x)\n",
972 (long)m[0]->pindex, m[0]->dirty);
973 rtvals[0] = VM_PAGER_BAD;
977 maxsize = count * PAGE_SIZE;
980 poffset = IDX_TO_OFF(m[0]->pindex);
983 * If the page-aligned write is larger then the actual file we
984 * have to invalidate pages occuring beyond the file EOF. However,
985 * there is an edge case where a file may not be page-aligned where
986 * the last page is partially invalid. In this case the filesystem
987 * may not properly clear the dirty bits for the entire page (which
988 * could be VM_PAGE_BITS_ALL due to the page having been mmap()d).
989 * With the page locked we are free to fix-up the dirty bits here.
991 * We do not under any circumstances truncate the valid bits, as
992 * this will screw up bogus page replacement.
994 if (maxsize + poffset > object->un_pager.vnp.vnp_size) {
995 if (object->un_pager.vnp.vnp_size > poffset) {
998 maxsize = object->un_pager.vnp.vnp_size - poffset;
999 ncount = btoc(maxsize);
1000 if ((pgoff = (int)maxsize & PAGE_MASK) != 0) {
1001 vm_page_clear_dirty(m[ncount - 1], pgoff,
1008 if (ncount < count) {
1009 for (i = ncount; i < count; i++) {
1010 rtvals[i] = VM_PAGER_BAD;
1016 * pageouts are already clustered, use IO_ASYNC t o force a bawrite()
1017 * rather then a bdwrite() to prevent paging I/O from saturating
1021 ioflags |= (flags & (VM_PAGER_PUT_SYNC | VM_PAGER_PUT_INVAL)) ? IO_SYNC: IO_ASYNC;
1022 ioflags |= (flags & VM_PAGER_PUT_INVAL) ? IO_INVAL: 0;
1024 aiov.iov_base = (caddr_t) 0;
1025 aiov.iov_len = maxsize;
1026 auio.uio_iov = &aiov;
1027 auio.uio_iovcnt = 1;
1028 auio.uio_offset = poffset;
1029 auio.uio_segflg = UIO_NOCOPY;
1030 auio.uio_rw = UIO_WRITE;
1031 auio.uio_resid = maxsize;
1032 auio.uio_td = (struct thread *) 0;
1033 error = VOP_WRITE(vp, &auio, ioflags, curthread->td_proc->p_ucred);
1035 cnt.v_vnodepgsout += ncount;
1038 printf("vnode_pager_putpages: I/O error %d\n", error);
1040 if (auio.uio_resid) {
1041 printf("vnode_pager_putpages: residual I/O %d at %lu\n",
1042 auio.uio_resid, (u_long)m[0]->pindex);
1044 for (i = 0; i < ncount; i++) {
1045 rtvals[i] = VM_PAGER_OK;
1051 vnode_pager_lock(object)
1054 struct thread *td = curthread; /* XXX */
1058 for (; object != NULL; object = object->backing_object) {
1059 if (object->type != OBJT_VNODE)
1061 if (object->flags & OBJ_DEAD) {
1065 /* XXX; If object->handle can change, we need to cache it. */
1066 while (vget(object->handle,
1067 LK_NOPAUSE | LK_SHARED | LK_RETRY | LK_CANRECURSE, td)){
1068 if ((object->flags & OBJ_DEAD) || (object->type != OBJT_VNODE))
1070 printf("vnode_pager_lock: retrying\n");
1072 return object->handle;