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.34 2007/06/08 02:00:47 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 off_t
vnode_pager_addr (struct vnode
*vp
, off_t loffset
, int *run
);
76 static void vnode_pager_iodone (struct bio
*bio
);
77 static int vnode_pager_input_smlfs (vm_object_t object
, vm_page_t m
);
78 static int vnode_pager_input_old (vm_object_t object
, vm_page_t m
);
79 static void vnode_pager_dealloc (vm_object_t
);
80 static int vnode_pager_getpages (vm_object_t
, vm_page_t
*, int, int);
81 static void vnode_pager_putpages (vm_object_t
, vm_page_t
*, int, boolean_t
, int *);
82 static boolean_t
vnode_pager_haspage (vm_object_t
, vm_pindex_t
, int *, int *);
84 struct pagerops vnodepagerops
= {
94 int vnode_pbuf_freecnt
= -1; /* start out unlimited */
97 * Allocate (or lookup) pager for a vnode.
98 * Handle is a vnode pointer.
101 vnode_pager_alloc(void *handle
, off_t size
, vm_prot_t prot
, off_t offset
)
107 * Pageout to vnode, no can do yet.
113 * XXX hack - This initialization should be put somewhere else.
115 if (vnode_pbuf_freecnt
< 0) {
116 vnode_pbuf_freecnt
= nswbuf
/ 2 + 1;
119 vp
= (struct vnode
*) handle
;
122 * Prevent race condition when allocating the object. This
123 * can happen with NFS vnodes since the nfsnode isn't locked.
125 while (vp
->v_flag
& VOLOCK
) {
126 vp
->v_flag
|= VOWANT
;
127 tsleep(vp
, 0, "vnpobj", 0);
129 vp
->v_flag
|= VOLOCK
;
132 * If the object is being terminated, wait for it to
135 while (((object
= vp
->v_object
) != NULL
) &&
136 (object
->flags
& OBJ_DEAD
)) {
137 vm_object_dead_sleep(object
, "vadead");
140 if (vp
->v_sysref
.refcnt
<= 0)
141 panic("vnode_pager_alloc: no vnode reference");
143 if (object
== NULL
) {
145 * And an object of the appropriate size
147 object
= vm_object_allocate(OBJT_VNODE
, OFF_TO_IDX(round_page(size
)));
149 object
->handle
= handle
;
150 vp
->v_object
= object
;
151 vp
->v_filesize
= size
;
154 if (vp
->v_filesize
!= size
)
155 kprintf("vnode_pager_alloc: Warning, filesize mismatch %lld/%lld\n", vp
->v_filesize
, size
);
159 vp
->v_flag
&= ~VOLOCK
;
160 if (vp
->v_flag
& VOWANT
) {
161 vp
->v_flag
&= ~VOWANT
;
168 vnode_pager_dealloc(vm_object_t object
)
170 struct vnode
*vp
= object
->handle
;
173 panic("vnode_pager_dealloc: pager already dealloced");
175 vm_object_pip_wait(object
, "vnpdea");
177 object
->handle
= NULL
;
178 object
->type
= OBJT_DEAD
;
180 vp
->v_filesize
= NOOFFSET
;
181 vp
->v_flag
&= ~(VTEXT
| VOBJBUF
);
185 * Return whether the vnode pager has the requested page. Return the
186 * number of disk-contiguous pages before and after the requested page,
187 * not including the requested page.
190 vnode_pager_haspage(vm_object_t object
, vm_pindex_t pindex
, int *before
,
193 struct vnode
*vp
= object
->handle
;
201 * If no vp or vp is doomed or marked transparent to VM, we do not
204 if ((vp
== NULL
) || (vp
->v_flag
& VRECLAIMED
))
208 * If filesystem no longer mounted or offset beyond end of file we do
211 loffset
= IDX_TO_OFF(pindex
);
213 if (vp
->v_mount
== NULL
|| loffset
>= vp
->v_filesize
)
216 bsize
= vp
->v_mount
->mnt_stat
.f_iosize
;
217 voff
= loffset
% bsize
;
219 error
= VOP_BMAP(vp
, loffset
- voff
, NULL
, &doffset
, after
, before
);
222 if (doffset
== NOOFFSET
)
226 *before
= (*before
+ voff
) >> PAGE_SHIFT
;
230 if (loffset
+ *after
> vp
->v_filesize
)
231 *after
= vp
->v_filesize
- loffset
;
232 *after
>>= PAGE_SHIFT
;
240 * Lets the VM system know about a change in size for a file.
241 * We adjust our own internal size and flush any cached pages in
242 * the associated object that are affected by the size change.
244 * NOTE: This routine may be invoked as a result of a pager put
245 * operation (possibly at object termination time), so we must be careful.
247 * NOTE: vp->v_filesize is initialized to NOOFFSET (-1), be sure that
248 * we do not blow up on the case. nsize will always be >= 0, however.
251 vnode_pager_setsize(struct vnode
*vp
, vm_ooffset_t nsize
)
253 vm_pindex_t nobjsize
;
254 vm_pindex_t oobjsize
;
255 vm_object_t object
= vp
->v_object
;
261 * Hasn't changed size
263 if (nsize
== vp
->v_filesize
)
267 * Has changed size. Adjust the VM object's size and v_filesize
268 * before we start scanning pages to prevent new pages from being
269 * allocated during the scan.
271 nobjsize
= OFF_TO_IDX(nsize
+ PAGE_MASK
);
272 oobjsize
= object
->size
;
273 object
->size
= nobjsize
;
276 * File has shrunk. Toss any cached pages beyond the new EOF.
278 if (nsize
< vp
->v_filesize
) {
279 vp
->v_filesize
= nsize
;
280 if (nobjsize
< oobjsize
) {
281 vm_object_page_remove(object
, nobjsize
, oobjsize
,
285 * This gets rid of garbage at the end of a page that is now
286 * only partially backed by the vnode. Since we are setting
287 * the entire page valid & clean after we are done we have
288 * to be sure that the portion of the page within the file
289 * bounds is already valid. If it isn't then making it
290 * valid would create a corrupt block.
292 if (nsize
& PAGE_MASK
) {
296 m
= vm_page_lookup(object
, OFF_TO_IDX(nsize
));
298 int base
= (int)nsize
& PAGE_MASK
;
299 int size
= PAGE_SIZE
- base
;
303 * Clear out partial-page garbage in case
304 * the page has been mapped.
306 sf
= sf_buf_alloc(m
, SFB_CPUPRIVATE
);
307 kva
= sf_buf_kva(sf
);
308 bzero((caddr_t
)kva
+ base
, size
);
312 * XXX work around SMP data integrity race
313 * by unmapping the page from user processes.
314 * The garbage we just cleared may be mapped
315 * to a user process running on another cpu
316 * and this code is not running through normal
317 * I/O channels which handle SMP issues for
318 * us, so unmap page to synchronize all cpus.
320 * XXX should vm_pager_unmap_page() have
323 vm_page_protect(m
, VM_PROT_NONE
);
326 * Clear out partial-page dirty bits. This
327 * has the side effect of setting the valid
328 * bits, but that is ok. There are a bunch
329 * of places in the VM system where we expected
330 * m->dirty == VM_PAGE_BITS_ALL. The file EOF
331 * case is one of them. If the page is still
332 * partially dirty, make it fully dirty.
334 * note that we do not clear out the valid
335 * bits. This would prevent bogus_page
336 * replacement from working properly.
338 vm_page_set_validclean(m
, base
, size
);
340 m
->dirty
= VM_PAGE_BITS_ALL
;
344 vp
->v_filesize
= nsize
;
349 vnode_pager_freepage(vm_page_t m
)
355 * calculate the disk byte address of specified logical byte offset. The
356 * logical offset will be block-aligned. Return the number of contiguous
357 * pages that may be read from the underlying block device in *run. If
358 * *run is non-NULL, it will be set to a value of at least 1.
361 vnode_pager_addr(struct vnode
*vp
, off_t loffset
, int *run
)
372 if (vp
->v_mount
== NULL
)
376 * Align loffset to a block boundary for the BMAP, then adjust the
377 * returned disk address appropriately.
379 bsize
= vp
->v_mount
->mnt_stat
.f_iosize
;
380 voff
= loffset
% bsize
;
383 * Map the block, adjust the disk offset so it represents the
384 * passed loffset rather then the block containing loffset.
386 error
= VOP_BMAP(vp
, loffset
- voff
, &rtvp
, &doffset
, run
, NULL
);
387 if (error
|| doffset
== NOOFFSET
) {
393 * When calculating *run, which is the number of pages
394 * worth of data which can be read linearly from disk,
395 * the minimum return value is 1 page.
398 *run
= (*run
- voff
) >> PAGE_SHIFT
;
408 * interrupt routine for I/O completion
411 vnode_pager_iodone(struct bio
*bio
)
413 struct buf
*bp
= bio
->bio_buf
;
415 bp
->b_cmd
= BUF_CMD_DONE
;
420 * small block file system vnode pager input
423 vnode_pager_input_smlfs(vm_object_t object
, vm_page_t m
)
426 struct vnode
*dp
, *vp
;
435 if (vp
->v_mount
== NULL
)
438 bsize
= vp
->v_mount
->mnt_stat
.f_iosize
;
441 VOP_BMAP(vp
, (off_t
)0, &dp
, NULL
, NULL
, NULL
);
443 sf
= sf_buf_alloc(m
, 0);
444 kva
= sf_buf_kva(sf
);
446 for (i
= 0; i
< PAGE_SIZE
/ bsize
; i
++) {
449 if (vm_page_bits(i
* bsize
, bsize
) & m
->valid
)
452 loffset
= IDX_TO_OFF(m
->pindex
) + i
* bsize
;
453 if (loffset
>= vp
->v_filesize
) {
456 doffset
= vnode_pager_addr(vp
, loffset
, NULL
);
458 if (doffset
!= NOOFFSET
) {
459 bp
= getpbuf(&vnode_pbuf_freecnt
);
461 /* build a minimal buffer header */
462 bp
->b_data
= (caddr_t
) kva
+ i
* bsize
;
463 bp
->b_bio1
.bio_done
= vnode_pager_iodone
;
464 bp
->b_bio1
.bio_offset
= doffset
;
465 bp
->b_bcount
= bsize
;
466 bp
->b_runningbufspace
= bsize
;
467 runningbufspace
+= bp
->b_runningbufspace
;
468 bp
->b_cmd
= BUF_CMD_READ
;
471 vn_strategy(dp
, &bp
->b_bio1
);
473 /* we definitely need to be at splvm here */
476 while (bp
->b_cmd
!= BUF_CMD_DONE
)
477 tsleep(bp
, 0, "vnsrd", 0);
479 if ((bp
->b_flags
& B_ERROR
) != 0)
483 * free the buffer header back to the swap buffer pool
485 relpbuf(bp
, &vnode_pbuf_freecnt
);
489 vm_page_set_validclean(m
, (i
* bsize
) & PAGE_MASK
, bsize
);
491 vm_page_set_validclean(m
, (i
* bsize
) & PAGE_MASK
, bsize
);
492 bzero((caddr_t
) kva
+ i
* bsize
, bsize
);
496 pmap_clear_modify(m
);
497 vm_page_flag_clear(m
, PG_ZERO
);
499 return VM_PAGER_ERROR
;
507 * old style vnode pager output routine
510 vnode_pager_input_old(vm_object_t object
, vm_page_t m
)
524 * Return failure if beyond current EOF
526 if (IDX_TO_OFF(m
->pindex
) >= vp
->v_filesize
) {
530 if (IDX_TO_OFF(m
->pindex
) + size
> vp
->v_filesize
)
531 size
= vp
->v_filesize
- IDX_TO_OFF(m
->pindex
);
534 * Allocate a kernel virtual address and initialize so that
535 * we can use VOP_READ/WRITE routines.
537 sf
= sf_buf_alloc(m
, 0);
538 kva
= sf_buf_kva(sf
);
540 aiov
.iov_base
= (caddr_t
) kva
;
542 auio
.uio_iov
= &aiov
;
544 auio
.uio_offset
= IDX_TO_OFF(m
->pindex
);
545 auio
.uio_segflg
= UIO_SYSSPACE
;
546 auio
.uio_rw
= UIO_READ
;
547 auio
.uio_resid
= size
;
548 auio
.uio_td
= curthread
;
550 error
= VOP_READ(((struct vnode
*)object
->handle
),
551 &auio
, 0, proc0
.p_ucred
);
553 int count
= size
- auio
.uio_resid
;
557 else if (count
!= PAGE_SIZE
)
558 bzero((caddr_t
) kva
+ count
, PAGE_SIZE
- count
);
562 pmap_clear_modify(m
);
564 vm_page_flag_clear(m
, PG_ZERO
);
566 m
->valid
= VM_PAGE_BITS_ALL
;
567 return error
? VM_PAGER_ERROR
: VM_PAGER_OK
;
571 * generic vnode pager input routine
575 * EOPNOTSUPP is no longer legal. For local media VFS's that do not
576 * implement their own VOP_GETPAGES, their VOP_GETPAGES should call to
577 * vnode_pager_generic_getpages() to implement the previous behaviour.
579 * All other FS's should use the bypass to get to the local media
580 * backing vp's VOP_GETPAGES.
583 vnode_pager_getpages(vm_object_t object
, vm_page_t
*m
, int count
, int reqpage
)
587 int bytes
= count
* PAGE_SIZE
;
591 * XXX temporary diagnostic message to help track stale FS code,
592 * Returning EOPNOTSUPP from here may make things unhappy.
594 rtval
= VOP_GETPAGES(vp
, m
, bytes
, reqpage
, 0);
595 if (rtval
== EOPNOTSUPP
) {
596 kprintf("vnode_pager: *** WARNING *** stale FS getpages\n");
597 rtval
= vnode_pager_generic_getpages( vp
, m
, bytes
, reqpage
);
604 * This is now called from local media FS's to operate against their
605 * own vnodes if they fail to implement VOP_GETPAGES.
608 vnode_pager_generic_getpages(struct vnode
*vp
, vm_page_t
*m
, int bytecount
,
613 off_t foff
, tfoff
, nextoff
;
614 int i
, size
, bsize
, first
;
623 object
= vp
->v_object
;
624 count
= bytecount
/ PAGE_SIZE
;
626 if (vp
->v_mount
== NULL
)
629 bsize
= vp
->v_mount
->mnt_stat
.f_iosize
;
631 /* get the UNDERLYING device for the file with VOP_BMAP() */
634 * originally, we did not check for an error return value -- assuming
635 * an fs always has a bmap entry point -- that assumption is wrong!!!
637 foff
= IDX_TO_OFF(m
[reqpage
]->pindex
);
640 * if we can't bmap, use old VOP code
642 if (VOP_BMAP(vp
, (off_t
)0, &dp
, NULL
, NULL
, NULL
)) {
643 for (i
= 0; i
< count
; i
++) {
645 vnode_pager_freepage(m
[i
]);
648 mycpu
->gd_cnt
.v_vnodein
++;
649 mycpu
->gd_cnt
.v_vnodepgsin
++;
650 return vnode_pager_input_old(object
, m
[reqpage
]);
653 * if the blocksize is smaller than a page size, then use
654 * special small filesystem code. NFS sometimes has a small
655 * blocksize, but it can handle large reads itself.
657 } else if ((PAGE_SIZE
/ bsize
) > 1 &&
658 (vp
->v_mount
->mnt_stat
.f_type
!= nfs_mount_type
)) {
659 for (i
= 0; i
< count
; i
++) {
661 vnode_pager_freepage(m
[i
]);
664 mycpu
->gd_cnt
.v_vnodein
++;
665 mycpu
->gd_cnt
.v_vnodepgsin
++;
666 return vnode_pager_input_smlfs(object
, m
[reqpage
]);
670 * If we have a completely valid page available to us, we can
671 * clean up and return. Otherwise we have to re-read the
674 * Note that this does not work with NFS, so NFS has its own
675 * getpages routine. The problem is that NFS can have partially
676 * valid pages associated with the buffer cache due to the piecemeal
677 * write support. If we were to fall through and re-read the media
678 * as we do here, dirty data could be lost.
681 if (m
[reqpage
]->valid
== VM_PAGE_BITS_ALL
) {
682 for (i
= 0; i
< count
; i
++) {
684 vnode_pager_freepage(m
[i
]);
688 m
[reqpage
]->valid
= 0;
691 * here on direct device I/O
696 * calculate the run that includes the required page
698 for(first
= 0, i
= 0; i
< count
; i
= runend
) {
699 firstaddr
= vnode_pager_addr(vp
, IDX_TO_OFF(m
[i
]->pindex
),
701 if (firstaddr
== -1) {
702 if (i
== reqpage
&& foff
< vp
->v_filesize
) {
703 /* XXX no %qd in kernel. */
704 panic("vnode_pager_getpages: unexpected missing page: firstaddr: %012llx, foff: 0x%012llx, v_filesize: 0x%012llx",
705 firstaddr
, foff
, vp
->v_filesize
);
707 vnode_pager_freepage(m
[i
]);
713 if (runend
<= reqpage
) {
715 for (j
= i
; j
< runend
; j
++) {
716 vnode_pager_freepage(m
[j
]);
719 if (runpg
< (count
- first
)) {
720 for (i
= first
+ runpg
; i
< count
; i
++)
721 vnode_pager_freepage(m
[i
]);
722 count
= first
+ runpg
;
730 * the first and last page have been calculated now, move input pages
731 * to be zero based...
734 for (i
= first
; i
< count
; i
++) {
742 * calculate the file virtual address for the transfer
744 foff
= IDX_TO_OFF(m
[0]->pindex
);
747 * calculate the size of the transfer
749 size
= count
* PAGE_SIZE
;
750 if ((foff
+ size
) > vp
->v_filesize
)
751 size
= vp
->v_filesize
- foff
;
754 * round up physical size for real devices.
756 if (dp
->v_type
== VBLK
|| dp
->v_type
== VCHR
) {
757 int secmask
= dp
->v_rdev
->si_bsize_phys
- 1;
758 KASSERT(secmask
< PAGE_SIZE
, ("vnode_pager_generic_getpages: sector size %d too large\n", secmask
+ 1));
759 size
= (size
+ secmask
) & ~secmask
;
762 bp
= getpbuf(&vnode_pbuf_freecnt
);
763 kva
= (vm_offset_t
) bp
->b_data
;
766 * and map the pages to be read into the kva
768 pmap_qenter(kva
, m
, count
);
770 /* build a minimal buffer header */
771 bp
->b_bio1
.bio_done
= vnode_pager_iodone
;
772 bp
->b_bio1
.bio_offset
= firstaddr
;
774 bp
->b_runningbufspace
= size
;
775 runningbufspace
+= bp
->b_runningbufspace
;
776 bp
->b_cmd
= BUF_CMD_READ
;
778 mycpu
->gd_cnt
.v_vnodein
++;
779 mycpu
->gd_cnt
.v_vnodepgsin
+= count
;
782 vn_strategy(dp
, &bp
->b_bio1
);
785 /* we definitely need to be at splvm here */
787 while (bp
->b_cmd
!= BUF_CMD_DONE
)
788 tsleep(bp
, 0, "vnread", 0);
790 if ((bp
->b_flags
& B_ERROR
) != 0)
794 if (size
!= count
* PAGE_SIZE
)
795 bzero((caddr_t
) kva
+ size
, PAGE_SIZE
* count
- size
);
797 pmap_qremove(kva
, count
);
800 * free the buffer header back to the swap buffer pool
802 relpbuf(bp
, &vnode_pbuf_freecnt
);
804 for (i
= 0, tfoff
= foff
; i
< count
; i
++, tfoff
= nextoff
) {
807 nextoff
= tfoff
+ PAGE_SIZE
;
810 if (nextoff
<= vp
->v_filesize
) {
812 * Read filled up entire page.
814 mt
->valid
= VM_PAGE_BITS_ALL
;
815 vm_page_undirty(mt
); /* should be an assert? XXX */
816 pmap_clear_modify(mt
);
819 * Read did not fill up entire page. Since this
820 * is getpages, the page may be mapped, so we have
821 * to zero the invalid portions of the page even
822 * though we aren't setting them valid.
824 * Currently we do not set the entire page valid,
825 * we just try to clear the piece that we couldn't
828 vm_page_set_validclean(mt
, 0, vp
->v_filesize
- tfoff
);
829 /* handled by vm_fault now */
830 /* vm_page_zero_invalid(mt, FALSE); */
833 vm_page_flag_clear(mt
, PG_ZERO
);
837 * whether or not to leave the page activated is up in
838 * the air, but we should put the page on a page queue
839 * somewhere. (it already is in the object). Result:
840 * It appears that empirical results show that
841 * deactivating pages is best.
845 * just in case someone was asking for this page we
846 * now tell them that it is ok to use
849 if (mt
->flags
& PG_WANTED
)
850 vm_page_activate(mt
);
852 vm_page_deactivate(mt
);
855 vnode_pager_freepage(mt
);
860 kprintf("vnode_pager_getpages: I/O read error\n");
862 return (error
? VM_PAGER_ERROR
: VM_PAGER_OK
);
866 * EOPNOTSUPP is no longer legal. For local media VFS's that do not
867 * implement their own VOP_PUTPAGES, their VOP_PUTPAGES should call to
868 * vnode_pager_generic_putpages() to implement the previous behaviour.
870 * All other FS's should use the bypass to get to the local media
871 * backing vp's VOP_PUTPAGES.
874 vnode_pager_putpages(vm_object_t object
, vm_page_t
*m
, int count
,
875 boolean_t sync
, int *rtvals
)
879 int bytes
= count
* PAGE_SIZE
;
882 * Force synchronous operation if we are extremely low on memory
883 * to prevent a low-memory deadlock. VOP operations often need to
884 * allocate more memory to initiate the I/O ( i.e. do a BMAP
885 * operation ). The swapper handles the case by limiting the amount
886 * of asynchronous I/O, but that sort of solution doesn't scale well
887 * for the vnode pager without a lot of work.
889 * Also, the backing vnode's iodone routine may not wake the pageout
890 * daemon up. This should be probably be addressed XXX.
893 if ((vmstats
.v_free_count
+ vmstats
.v_cache_count
) < vmstats
.v_pageout_free_min
)
897 * Call device-specific putpages function
901 rtval
= VOP_PUTPAGES(vp
, m
, bytes
, sync
, rtvals
, 0);
902 if (rtval
== EOPNOTSUPP
) {
903 kprintf("vnode_pager: *** WARNING *** stale FS putpages\n");
904 rtval
= vnode_pager_generic_putpages( vp
, m
, bytes
, sync
, rtvals
);
910 * This is now called from local media FS's to operate against their
911 * own vnodes if they fail to implement VOP_PUTPAGES.
913 * This is typically called indirectly via the pageout daemon and
914 * clustering has already typically occured, so in general we ask the
915 * underlying filesystem to write the data out asynchronously rather
919 vnode_pager_generic_putpages(struct vnode
*vp
, vm_page_t
*m
, int bytecount
,
920 int flags
, int *rtvals
)
927 vm_ooffset_t poffset
;
933 object
= vp
->v_object
;
934 count
= bytecount
/ PAGE_SIZE
;
936 for (i
= 0; i
< count
; i
++)
937 rtvals
[i
] = VM_PAGER_AGAIN
;
939 if ((int) m
[0]->pindex
< 0) {
940 kprintf("vnode_pager_putpages: attempt to write meta-data!!! -- 0x%lx(%x)\n",
941 (long)m
[0]->pindex
, m
[0]->dirty
);
942 rtvals
[0] = VM_PAGER_BAD
;
946 maxsize
= count
* PAGE_SIZE
;
949 poffset
= IDX_TO_OFF(m
[0]->pindex
);
952 * If the page-aligned write is larger then the actual file we
953 * have to invalidate pages occuring beyond the file EOF. However,
954 * there is an edge case where a file may not be page-aligned where
955 * the last page is partially invalid. In this case the filesystem
956 * may not properly clear the dirty bits for the entire page (which
957 * could be VM_PAGE_BITS_ALL due to the page having been mmap()d).
958 * With the page locked we are free to fix-up the dirty bits here.
960 * We do not under any circumstances truncate the valid bits, as
961 * this will screw up bogus page replacement.
963 if (maxsize
+ poffset
> vp
->v_filesize
) {
964 if (vp
->v_filesize
> poffset
) {
967 maxsize
= vp
->v_filesize
- poffset
;
968 ncount
= btoc(maxsize
);
969 if ((pgoff
= (int)maxsize
& PAGE_MASK
) != 0) {
970 vm_page_clear_dirty(m
[ncount
- 1], pgoff
,
977 if (ncount
< count
) {
978 for (i
= ncount
; i
< count
; i
++) {
979 rtvals
[i
] = VM_PAGER_BAD
;
985 * pageouts are already clustered, use IO_ASYNC to force a bawrite()
986 * rather then a bdwrite() to prevent paging I/O from saturating
987 * the buffer cache. Dummy-up the sequential heuristic to cause
988 * large ranges to cluster. If neither IO_SYNC or IO_ASYNC is set,
989 * the system decides how to cluster.
992 if (flags
& (VM_PAGER_PUT_SYNC
| VM_PAGER_PUT_INVAL
))
994 else if ((flags
& VM_PAGER_CLUSTER_OK
) == 0)
996 ioflags
|= (flags
& VM_PAGER_PUT_INVAL
) ? IO_INVAL
: 0;
997 ioflags
|= IO_SEQMAX
<< IO_SEQSHIFT
;
999 aiov
.iov_base
= (caddr_t
) 0;
1000 aiov
.iov_len
= maxsize
;
1001 auio
.uio_iov
= &aiov
;
1002 auio
.uio_iovcnt
= 1;
1003 auio
.uio_offset
= poffset
;
1004 auio
.uio_segflg
= UIO_NOCOPY
;
1005 auio
.uio_rw
= UIO_WRITE
;
1006 auio
.uio_resid
= maxsize
;
1008 error
= VOP_WRITE(vp
, &auio
, ioflags
, proc0
.p_ucred
);
1009 mycpu
->gd_cnt
.v_vnodeout
++;
1010 mycpu
->gd_cnt
.v_vnodepgsout
+= ncount
;
1013 kprintf("vnode_pager_putpages: I/O error %d\n", error
);
1015 if (auio
.uio_resid
) {
1016 kprintf("vnode_pager_putpages: residual I/O %d at %lu\n",
1017 auio
.uio_resid
, (u_long
)m
[0]->pindex
);
1019 for (i
= 0; i
< ncount
; i
++) {
1020 rtvals
[i
] = VM_PAGER_OK
;
1026 vnode_pager_lock(vm_object_t object
)
1028 struct thread
*td
= curthread
; /* XXX */
1031 for (; object
!= NULL
; object
= object
->backing_object
) {
1032 if (object
->type
!= OBJT_VNODE
)
1034 if (object
->flags
& OBJ_DEAD
)
1038 struct vnode
*vp
= object
->handle
;
1039 error
= vget(vp
, LK_SHARED
| LK_RETRY
| LK_CANRECURSE
);
1041 if (object
->handle
!= vp
) {
1047 if ((object
->flags
& OBJ_DEAD
) ||
1048 (object
->type
!= OBJT_VNODE
)) {
1051 kprintf("vnode_pager_lock: vp %p error %d lockstatus %d, retrying\n", vp
, error
, lockstatus(&vp
->v_lock
, td
));
1052 tsleep(object
->handle
, 0, "vnpgrl", hz
);