1 /* 2 * Copyright (c) 1990 University of Utah. 3 * Copyright (c) 1991 The Regents of the University of California. 4 * All rights reserved. 5 * Copyright (c) 1993, 1994 John S. Dyson 6 * Copyright (c) 1995, David Greenman 7 * 8 * This code is derived from software contributed to Berkeley by 9 * the Systems Programming Group of the University of Utah Computer 10 * Science Department. 11 * 12 * Redistribution and use in source and binary forms, with or without 13 * modification, are permitted provided that the following conditions 14 * are met: 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. 27 * 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 38 * SUCH DAMAGE. 39 * 40 * from: @(#)vnode_pager.c 7.5 (Berkeley) 4/20/91 41 * $Id: vnode_pager.c,v 1.109 1999/05/06 20:00:34 phk Exp $ 42 */ 43 44 /* 45 * Page to/from files (vnodes). 46 */ 47 48 /* 49 * TODO: 50 * Implement VOP_GETPAGES/PUTPAGES interface for filesystems. Will 51 * greatly re-simplify the vnode_pager. 52 */ 53 54 #include <sys/param.h> 55 #include <sys/systm.h> 56 #include <sys/proc.h> 57 #include <sys/vnode.h> 58 #include <sys/mount.h> 59 #include <sys/buf.h> 60 #include <sys/vmmeter.h> 61 62 #include <vm/vm.h> 63 #include <vm/vm_prot.h> 64 #include <vm/vm_object.h> 65 #include <vm/vm_page.h> 66 #include <vm/vm_pager.h> 67 #include <vm/vm_map.h> 68 #include <vm/vnode_pager.h> 69 #include <vm/vm_extern.h> 70 71 static vm_offset_t vnode_pager_addr __P((struct vnode *vp, vm_ooffset_t address, 72 int *run)); 73 static void vnode_pager_iodone __P((struct buf *bp)); 74 static int vnode_pager_input_smlfs __P((vm_object_t object, vm_page_t m)); 75 static int vnode_pager_input_old __P((vm_object_t object, vm_page_t m)); 76 static void vnode_pager_dealloc __P((vm_object_t)); 77 static int vnode_pager_getpages __P((vm_object_t, vm_page_t *, int, int)); 78 static void vnode_pager_putpages __P((vm_object_t, vm_page_t *, int, boolean_t, int *)); 79 static boolean_t vnode_pager_haspage __P((vm_object_t, vm_pindex_t, int *, int *)); 80 81 struct pagerops vnodepagerops = { 82 NULL, 83 vnode_pager_alloc, 84 vnode_pager_dealloc, 85 vnode_pager_getpages, 86 vnode_pager_putpages, 87 vnode_pager_haspage, 88 NULL 89 }; 90 91 int vnode_pbuf_freecnt = -1; /* start out unlimited */ 92 93 94 /* 95 * Allocate (or lookup) pager for a vnode. 96 * Handle is a vnode pointer. 97 */ 98 vm_object_t 99 vnode_pager_alloc(void *handle, vm_ooffset_t size, vm_prot_t prot, 100 vm_ooffset_t offset) 101 { 102 vm_object_t object; 103 struct vnode *vp; 104 105 /* 106 * Pageout to vnode, no can do yet. 107 */ 108 if (handle == NULL) 109 return (NULL); 110 111 /* 112 * XXX hack - This initialization should be put somewhere else. 113 */ 114 if (vnode_pbuf_freecnt < 0) { 115 vnode_pbuf_freecnt = nswbuf / 2 + 1; 116 } 117 118 vp = (struct vnode *) handle; 119 120 /* 121 * Prevent race condition when allocating the object. This 122 * can happen with NFS vnodes since the nfsnode isn't locked. 123 */ 124 while (vp->v_flag & VOLOCK) { 125 vp->v_flag |= VOWANT; 126 tsleep(vp, PVM, "vnpobj", 0); 127 } 128 vp->v_flag |= VOLOCK; 129 130 /* 131 * If the object is being terminated, wait for it to 132 * go away. 133 */ 134 while (((object = vp->v_object) != NULL) && 135 (object->flags & OBJ_DEAD)) { 136 tsleep(object, PVM, "vadead", 0); 137 } 138 139 if (vp->v_usecount == 0) 140 panic("vnode_pager_alloc: no vnode reference"); 141 142 if (object == NULL) { 143 /* 144 * And an object of the appropriate size 145 */ 146 object = vm_object_allocate(OBJT_VNODE, OFF_TO_IDX(round_page(size))); 147 object->flags = 0; 148 149 object->un_pager.vnp.vnp_size = size; 150 151 object->handle = handle; 152 vp->v_object = object; 153 vp->v_usecount++; 154 } else { 155 object->ref_count++; 156 vp->v_usecount++; 157 } 158 159 vp->v_flag &= ~VOLOCK; 160 if (vp->v_flag & VOWANT) { 161 vp->v_flag &= ~VOWANT; 162 wakeup(vp); 163 } 164 return (object); 165 } 166 167 static void 168 vnode_pager_dealloc(object) 169 vm_object_t object; 170 { 171 register struct vnode *vp = object->handle; 172 173 if (vp == NULL) 174 panic("vnode_pager_dealloc: pager already dealloced"); 175 176 vm_object_pip_wait(object, "vnpdea"); 177 178 object->handle = NULL; 179 object->type = OBJT_DEAD; 180 vp->v_object = NULL; 181 vp->v_flag &= ~(VTEXT | VOBJBUF); 182 } 183 184 static boolean_t 185 vnode_pager_haspage(object, pindex, before, after) 186 vm_object_t object; 187 vm_pindex_t pindex; 188 int *before; 189 int *after; 190 { 191 struct vnode *vp = object->handle; 192 daddr_t bn; 193 int err; 194 daddr_t reqblock; 195 int poff; 196 int bsize; 197 int pagesperblock, blocksperpage; 198 199 if ((vp == NULL) || (vp->v_flag & VDOOMED)) 200 return FALSE; 201 202 /* 203 * If filesystem no longer mounted or offset beyond end of file we do 204 * not have the page. 205 */ 206 if ((vp->v_mount == NULL) || 207 (IDX_TO_OFF(pindex) >= object->un_pager.vnp.vnp_size)) 208 return FALSE; 209 210 bsize = vp->v_mount->mnt_stat.f_iosize; 211 pagesperblock = bsize / PAGE_SIZE; 212 blocksperpage = 0; 213 if (pagesperblock > 0) { 214 reqblock = pindex / pagesperblock; 215 } else { 216 blocksperpage = (PAGE_SIZE / bsize); 217 reqblock = pindex * blocksperpage; 218 } 219 err = VOP_BMAP(vp, reqblock, (struct vnode **) 0, &bn, 220 after, before); 221 if (err) 222 return TRUE; 223 if ( bn == -1) 224 return FALSE; 225 if (pagesperblock > 0) { 226 poff = pindex - (reqblock * pagesperblock); 227 if (before) { 228 *before *= pagesperblock; 229 *before += poff; 230 } 231 if (after) { 232 int numafter; 233 *after *= pagesperblock; 234 numafter = pagesperblock - (poff + 1); 235 if (IDX_TO_OFF(pindex + numafter) > object->un_pager.vnp.vnp_size) { 236 numafter = OFF_TO_IDX((object->un_pager.vnp.vnp_size - IDX_TO_OFF(pindex))); 237 } 238 *after += numafter; 239 } 240 } else { 241 if (before) { 242 *before /= blocksperpage; 243 } 244 245 if (after) { 246 *after /= blocksperpage; 247 } 248 } 249 return TRUE; 250 } 251 252 /* 253 * Lets the VM system know about a change in size for a file. 254 * We adjust our own internal size and flush any cached pages in 255 * the associated object that are affected by the size change. 256 * 257 * Note: this routine may be invoked as a result of a pager put 258 * operation (possibly at object termination time), so we must be careful. 259 */ 260 void 261 vnode_pager_setsize(vp, nsize) 262 struct vnode *vp; 263 vm_ooffset_t nsize; 264 { 265 vm_pindex_t nobjsize; 266 vm_object_t object = vp->v_object; 267 268 if (object == NULL) 269 return; 270 271 /* 272 * Hasn't changed size 273 */ 274 if (nsize == object->un_pager.vnp.vnp_size) 275 return; 276 277 nobjsize = OFF_TO_IDX(nsize + PAGE_MASK); 278 279 /* 280 * File has shrunk. Toss any cached pages beyond the new EOF. 281 */ 282 if (nsize < object->un_pager.vnp.vnp_size) { 283 vm_freeze_copyopts(object, OFF_TO_IDX(nsize), object->size); 284 if (nobjsize < object->size) { 285 vm_object_page_remove(object, nobjsize, object->size, 286 FALSE); 287 } 288 /* 289 * this gets rid of garbage at the end of a page that is now 290 * only partially backed by the vnode... 291 */ 292 if (nsize & PAGE_MASK) { 293 vm_offset_t kva; 294 vm_page_t m; 295 296 m = vm_page_lookup(object, OFF_TO_IDX(nsize)); 297 if (m) { 298 kva = vm_pager_map_page(m); 299 bzero((caddr_t) kva + (nsize & PAGE_MASK), 300 (int) (round_page(nsize) - nsize)); 301 vm_pager_unmap_page(kva); 302 } 303 } 304 } 305 object->un_pager.vnp.vnp_size = nsize; 306 object->size = nobjsize; 307 } 308 309 void 310 vnode_pager_freepage(m) 311 vm_page_t m; 312 { 313 vm_page_free(m); 314 } 315 316 /* 317 * calculate the linear (byte) disk address of specified virtual 318 * file address 319 */ 320 static vm_offset_t 321 vnode_pager_addr(vp, address, run) 322 struct vnode *vp; 323 vm_ooffset_t address; 324 int *run; 325 { 326 int rtaddress; 327 int bsize; 328 daddr_t block; 329 struct vnode *rtvp; 330 int err; 331 daddr_t vblock; 332 int voffset; 333 334 if ((int) address < 0) 335 return -1; 336 337 if (vp->v_mount == NULL) 338 return -1; 339 340 bsize = vp->v_mount->mnt_stat.f_iosize; 341 vblock = address / bsize; 342 voffset = address % bsize; 343 344 err = VOP_BMAP(vp, vblock, &rtvp, &block, run, NULL); 345 346 if (err || (block == -1)) 347 rtaddress = -1; 348 else { 349 rtaddress = block + voffset / DEV_BSIZE; 350 if( run) { 351 *run += 1; 352 *run *= bsize/PAGE_SIZE; 353 *run -= voffset/PAGE_SIZE; 354 } 355 } 356 357 return rtaddress; 358 } 359 360 /* 361 * interrupt routine for I/O completion 362 */ 363 static void 364 vnode_pager_iodone(bp) 365 struct buf *bp; 366 { 367 bp->b_flags |= B_DONE; 368 wakeup(bp); 369 } 370 371 /* 372 * small block file system vnode pager input 373 */ 374 static int 375 vnode_pager_input_smlfs(object, m) 376 vm_object_t object; 377 vm_page_t m; 378 { 379 int i; 380 int s; 381 struct vnode *dp, *vp; 382 struct buf *bp; 383 vm_offset_t kva; 384 int fileaddr; 385 vm_offset_t bsize; 386 int error = 0; 387 388 vp = object->handle; 389 if (vp->v_mount == NULL) 390 return VM_PAGER_BAD; 391 392 bsize = vp->v_mount->mnt_stat.f_iosize; 393 394 395 VOP_BMAP(vp, 0, &dp, 0, NULL, NULL); 396 397 kva = vm_pager_map_page(m); 398 399 for (i = 0; i < PAGE_SIZE / bsize; i++) { 400 401 if (vm_page_bits(i * bsize, bsize) & m->valid) 402 continue; 403 404 fileaddr = vnode_pager_addr(vp, 405 IDX_TO_OFF(m->pindex) + i * bsize, (int *)0); 406 if (fileaddr != -1) { 407 bp = getpbuf(&vnode_pbuf_freecnt); 408 409 /* build a minimal buffer header */ 410 bp->b_flags = B_BUSY | B_READ | B_CALL; 411 bp->b_iodone = vnode_pager_iodone; 412 bp->b_rcred = bp->b_wcred = curproc->p_ucred; 413 if (bp->b_rcred != NOCRED) 414 crhold(bp->b_rcred); 415 if (bp->b_wcred != NOCRED) 416 crhold(bp->b_wcred); 417 bp->b_data = (caddr_t) kva + i * bsize; 418 bp->b_blkno = fileaddr; 419 pbgetvp(dp, bp); 420 bp->b_bcount = bsize; 421 bp->b_bufsize = bsize; 422 423 /* do the input */ 424 VOP_STRATEGY(bp->b_vp, bp); 425 426 /* we definitely need to be at splvm here */ 427 428 s = splvm(); 429 while ((bp->b_flags & B_DONE) == 0) { 430 tsleep(bp, PVM, "vnsrd", 0); 431 } 432 splx(s); 433 if ((bp->b_flags & B_ERROR) != 0) 434 error = EIO; 435 436 /* 437 * free the buffer header back to the swap buffer pool 438 */ 439 relpbuf(bp, &vnode_pbuf_freecnt); 440 if (error) 441 break; 442 443 vm_page_set_validclean(m, (i * bsize) & PAGE_MASK, bsize); 444 } else { 445 vm_page_set_validclean(m, (i * bsize) & PAGE_MASK, bsize); 446 bzero((caddr_t) kva + i * bsize, bsize); 447 } 448 } 449 vm_pager_unmap_page(kva); 450 pmap_clear_modify(VM_PAGE_TO_PHYS(m)); 451 vm_page_flag_clear(m, PG_ZERO); 452 if (error) { 453 return VM_PAGER_ERROR; 454 } 455 return VM_PAGER_OK; 456 457 } 458 459 460 /* 461 * old style vnode pager output routine 462 */ 463 static int 464 vnode_pager_input_old(object, m) 465 vm_object_t object; 466 vm_page_t m; 467 { 468 struct uio auio; 469 struct iovec aiov; 470 int error; 471 int size; 472 vm_offset_t kva; 473 474 error = 0; 475 476 /* 477 * Return failure if beyond current EOF 478 */ 479 if (IDX_TO_OFF(m->pindex) >= object->un_pager.vnp.vnp_size) { 480 return VM_PAGER_BAD; 481 } else { 482 size = PAGE_SIZE; 483 if (IDX_TO_OFF(m->pindex) + size > object->un_pager.vnp.vnp_size) 484 size = object->un_pager.vnp.vnp_size - IDX_TO_OFF(m->pindex); 485 486 /* 487 * Allocate a kernel virtual address and initialize so that 488 * we can use VOP_READ/WRITE routines. 489 */ 490 kva = vm_pager_map_page(m); 491 492 aiov.iov_base = (caddr_t) kva; 493 aiov.iov_len = size; 494 auio.uio_iov = &aiov; 495 auio.uio_iovcnt = 1; 496 auio.uio_offset = IDX_TO_OFF(m->pindex); 497 auio.uio_segflg = UIO_SYSSPACE; 498 auio.uio_rw = UIO_READ; 499 auio.uio_resid = size; 500 auio.uio_procp = curproc; 501 502 error = VOP_READ(object->handle, &auio, 0, curproc->p_ucred); 503 if (!error) { 504 register int count = size - auio.uio_resid; 505 506 if (count == 0) 507 error = EINVAL; 508 else if (count != PAGE_SIZE) 509 bzero((caddr_t) kva + count, PAGE_SIZE - count); 510 } 511 vm_pager_unmap_page(kva); 512 } 513 pmap_clear_modify(VM_PAGE_TO_PHYS(m)); 514 m->dirty = 0; 515 vm_page_flag_clear(m, PG_ZERO); 516 if (!error) 517 m->valid = VM_PAGE_BITS_ALL; 518 return error ? VM_PAGER_ERROR : VM_PAGER_OK; 519 } 520 521 /* 522 * generic vnode pager input routine 523 */ 524 525 /* 526 * EOPNOTSUPP is no longer legal. For local media VFS's that do not 527 * implement their own VOP_GETPAGES, their VOP_GETPAGES should call to 528 * vnode_pager_generic_getpages() to implement the previous behaviour. 529 * 530 * All other FS's should use the bypass to get to the local media 531 * backing vp's VOP_GETPAGES. 532 */ 533 static int 534 vnode_pager_getpages(object, m, count, reqpage) 535 vm_object_t object; 536 vm_page_t *m; 537 int count; 538 int reqpage; 539 { 540 int rtval; 541 struct vnode *vp; 542 int bytes = count * PAGE_SIZE; 543 544 vp = object->handle; 545 /* 546 * XXX temporary diagnostic message to help track stale FS code, 547 * Returning EOPNOTSUPP from here may make things unhappy. 548 */ 549 rtval = VOP_GETPAGES(vp, m, bytes, reqpage, 0); 550 if (rtval == EOPNOTSUPP) { 551 printf("vnode_pager: *** WARNING *** stale FS getpages\n"); 552 rtval = vnode_pager_generic_getpages( vp, m, bytes, reqpage); 553 } 554 return rtval; 555 } 556 557 558 /* 559 * This is now called from local media FS's to operate against their 560 * own vnodes if they fail to implement VOP_GETPAGES. 561 */ 562 int 563 vnode_pager_generic_getpages(vp, m, bytecount, reqpage) 564 struct vnode *vp; 565 vm_page_t *m; 566 int bytecount; 567 int reqpage; 568 { 569 vm_object_t object; 570 vm_offset_t kva; 571 off_t foff, tfoff, nextoff; 572 int i, size, bsize, first, firstaddr; 573 struct vnode *dp; 574 int runpg; 575 int runend; 576 struct buf *bp; 577 int s; 578 int count; 579 int error = 0; 580 581 object = vp->v_object; 582 count = bytecount / PAGE_SIZE; 583 584 if (vp->v_mount == NULL) 585 return VM_PAGER_BAD; 586 587 bsize = vp->v_mount->mnt_stat.f_iosize; 588 589 /* get the UNDERLYING device for the file with VOP_BMAP() */ 590 591 /* 592 * originally, we did not check for an error return value -- assuming 593 * an fs always has a bmap entry point -- that assumption is wrong!!! 594 */ 595 foff = IDX_TO_OFF(m[reqpage]->pindex); 596 597 /* 598 * if we can't bmap, use old VOP code 599 */ 600 if (VOP_BMAP(vp, 0, &dp, 0, NULL, NULL)) { 601 for (i = 0; i < count; i++) { 602 if (i != reqpage) { 603 vnode_pager_freepage(m[i]); 604 } 605 } 606 cnt.v_vnodein++; 607 cnt.v_vnodepgsin++; 608 return vnode_pager_input_old(object, m[reqpage]); 609 610 /* 611 * if the blocksize is smaller than a page size, then use 612 * special small filesystem code. NFS sometimes has a small 613 * blocksize, but it can handle large reads itself. 614 */ 615 } else if ((PAGE_SIZE / bsize) > 1 && 616 (vp->v_mount->mnt_stat.f_type != nfs_mount_type)) { 617 for (i = 0; i < count; i++) { 618 if (i != reqpage) { 619 vnode_pager_freepage(m[i]); 620 } 621 } 622 cnt.v_vnodein++; 623 cnt.v_vnodepgsin++; 624 return vnode_pager_input_smlfs(object, m[reqpage]); 625 } 626 627 /* 628 * If we have a completely valid page available to us, we can 629 * clean up and return. Otherwise we have to re-read the 630 * media. 631 */ 632 633 if (m[reqpage]->valid == VM_PAGE_BITS_ALL) { 634 for (i = 0; i < count; i++) { 635 if (i != reqpage) 636 vnode_pager_freepage(m[i]); 637 } 638 return VM_PAGER_OK; 639 } 640 m[reqpage]->valid = 0; 641 642 /* 643 * here on direct device I/O 644 */ 645 646 firstaddr = -1; 647 /* 648 * calculate the run that includes the required page 649 */ 650 for(first = 0, i = 0; i < count; i = runend) { 651 firstaddr = vnode_pager_addr(vp, 652 IDX_TO_OFF(m[i]->pindex), &runpg); 653 if (firstaddr == -1) { 654 if (i == reqpage && foff < object->un_pager.vnp.vnp_size) { 655 /* XXX no %qd in kernel. */ 656 panic("vnode_pager_getpages: unexpected missing page: firstaddr: %d, foff: 0x%lx%08lx, vnp_size: 0x%lx%08lx", 657 firstaddr, (u_long)(foff >> 32), 658 (u_long)(u_int32_t)foff, 659 (u_long)(u_int32_t) 660 (object->un_pager.vnp.vnp_size >> 32), 661 (u_long)(u_int32_t) 662 object->un_pager.vnp.vnp_size); 663 } 664 vnode_pager_freepage(m[i]); 665 runend = i + 1; 666 first = runend; 667 continue; 668 } 669 runend = i + runpg; 670 if (runend <= reqpage) { 671 int j; 672 for (j = i; j < runend; j++) { 673 vnode_pager_freepage(m[j]); 674 } 675 } else { 676 if (runpg < (count - first)) { 677 for (i = first + runpg; i < count; i++) 678 vnode_pager_freepage(m[i]); 679 count = first + runpg; 680 } 681 break; 682 } 683 first = runend; 684 } 685 686 /* 687 * the first and last page have been calculated now, move input pages 688 * to be zero based... 689 */ 690 if (first != 0) { 691 for (i = first; i < count; i++) { 692 m[i - first] = m[i]; 693 } 694 count -= first; 695 reqpage -= first; 696 } 697 698 /* 699 * calculate the file virtual address for the transfer 700 */ 701 foff = IDX_TO_OFF(m[0]->pindex); 702 703 /* 704 * calculate the size of the transfer 705 */ 706 size = count * PAGE_SIZE; 707 if ((foff + size) > object->un_pager.vnp.vnp_size) 708 size = object->un_pager.vnp.vnp_size - foff; 709 710 /* 711 * round up physical size for real devices 712 */ 713 if (dp->v_type == VBLK || dp->v_type == VCHR) 714 size = (size + DEV_BSIZE - 1) & ~(DEV_BSIZE - 1); 715 716 bp = getpbuf(&vnode_pbuf_freecnt); 717 kva = (vm_offset_t) bp->b_data; 718 719 /* 720 * and map the pages to be read into the kva 721 */ 722 pmap_qenter(kva, m, count); 723 724 /* build a minimal buffer header */ 725 bp->b_flags = B_BUSY | B_READ | B_CALL; 726 bp->b_iodone = vnode_pager_iodone; 727 /* B_PHYS is not set, but it is nice to fill this in */ 728 bp->b_rcred = bp->b_wcred = curproc->p_ucred; 729 if (bp->b_rcred != NOCRED) 730 crhold(bp->b_rcred); 731 if (bp->b_wcred != NOCRED) 732 crhold(bp->b_wcred); 733 bp->b_blkno = firstaddr; 734 pbgetvp(dp, bp); 735 bp->b_bcount = size; 736 bp->b_bufsize = size; 737 738 cnt.v_vnodein++; 739 cnt.v_vnodepgsin += count; 740 741 /* do the input */ 742 VOP_STRATEGY(bp->b_vp, bp); 743 744 s = splvm(); 745 /* we definitely need to be at splvm here */ 746 747 while ((bp->b_flags & B_DONE) == 0) { 748 tsleep(bp, PVM, "vnread", 0); 749 } 750 splx(s); 751 if ((bp->b_flags & B_ERROR) != 0) 752 error = EIO; 753 754 if (!error) { 755 if (size != count * PAGE_SIZE) 756 bzero((caddr_t) kva + size, PAGE_SIZE * count - size); 757 } 758 pmap_qremove(kva, count); 759 760 /* 761 * free the buffer header back to the swap buffer pool 762 */ 763 relpbuf(bp, &vnode_pbuf_freecnt); 764 765 for (i = 0, tfoff = foff; i < count; i++, tfoff = nextoff) { 766 vm_page_t mt; 767 768 nextoff = tfoff + PAGE_SIZE; 769 mt = m[i]; 770 771 if (nextoff <= object->un_pager.vnp.vnp_size) { 772 /* 773 * Read filled up entire page. 774 */ 775 mt->valid = VM_PAGE_BITS_ALL; 776 mt->dirty = 0; 777 pmap_clear_modify(VM_PAGE_TO_PHYS(mt)); 778 } else { 779 /* 780 * Read did not fill up entire page. Since this 781 * is getpages, the page may be mapped, so we have 782 * to zero the invalid portions of the page even 783 * though we aren't setting them valid. 784 * 785 * Currently we do not set the entire page valid, 786 * we just try to clear the piece that we couldn't 787 * read. 788 */ 789 vm_page_set_validclean(mt, 0, 790 object->un_pager.vnp.vnp_size - tfoff); 791 /* handled by vm_fault now */ 792 /* vm_page_zero_invalid(mt, FALSE); */ 793 } 794 795 vm_page_flag_clear(mt, PG_ZERO); 796 if (i != reqpage) { 797 798 /* 799 * whether or not to leave the page activated is up in 800 * the air, but we should put the page on a page queue 801 * somewhere. (it already is in the object). Result: 802 * It appears that emperical results show that 803 * deactivating pages is best. 804 */ 805 806 /* 807 * just in case someone was asking for this page we 808 * now tell them that it is ok to use 809 */ 810 if (!error) { 811 if (mt->flags & PG_WANTED) 812 vm_page_activate(mt); 813 else 814 vm_page_deactivate(mt); 815 vm_page_wakeup(mt); 816 } else { 817 vnode_pager_freepage(mt); 818 } 819 } 820 } 821 if (error) { 822 printf("vnode_pager_getpages: I/O read error\n"); 823 } 824 return (error ? VM_PAGER_ERROR : VM_PAGER_OK); 825 } 826 827 /* 828 * EOPNOTSUPP is no longer legal. For local media VFS's that do not 829 * implement their own VOP_PUTPAGES, their VOP_PUTPAGES should call to 830 * vnode_pager_generic_putpages() to implement the previous behaviour. 831 * 832 * All other FS's should use the bypass to get to the local media 833 * backing vp's VOP_PUTPAGES. 834 */ 835 static void 836 vnode_pager_putpages(object, m, count, sync, rtvals) 837 vm_object_t object; 838 vm_page_t *m; 839 int count; 840 boolean_t sync; 841 int *rtvals; 842 { 843 int rtval; 844 struct vnode *vp; 845 int bytes = count * PAGE_SIZE; 846 847 /* 848 * Force synchronous operation if we are extremely low on memory 849 * to prevent a low-memory deadlock. VOP operations often need to 850 * allocate more memory to initiate the I/O ( i.e. do a BMAP 851 * operation ). The swapper handles the case by limiting the amount 852 * of asynchronous I/O, but that sort of solution doesn't scale well 853 * for the vnode pager without a lot of work. 854 * 855 * Also, the backing vnode's iodone routine may not wake the pageout 856 * daemon up. This should be probably be addressed XXX. 857 */ 858 859 if ((cnt.v_free_count + cnt.v_cache_count) < cnt.v_pageout_free_min) 860 sync |= OBJPC_SYNC; 861 862 /* 863 * Call device-specific putpages function 864 */ 865 866 vp = object->handle; 867 rtval = VOP_PUTPAGES(vp, m, bytes, sync, rtvals, 0); 868 if (rtval == EOPNOTSUPP) { 869 printf("vnode_pager: *** WARNING *** stale FS putpages\n"); 870 rtval = vnode_pager_generic_putpages( vp, m, bytes, sync, rtvals); 871 } 872 } 873 874 875 /* 876 * This is now called from local media FS's to operate against their 877 * own vnodes if they fail to implement VOP_PUTPAGES. 878 */ 879 int 880 vnode_pager_generic_putpages(vp, m, bytecount, flags, rtvals) 881 struct vnode *vp; 882 vm_page_t *m; 883 int bytecount; 884 int flags; 885 int *rtvals; 886 { 887 int i; 888 vm_object_t object; 889 int count; 890 891 int maxsize, ncount; 892 vm_ooffset_t poffset; 893 struct uio auio; 894 struct iovec aiov; 895 int error; 896 int ioflags; 897 898 object = vp->v_object; 899 count = bytecount / PAGE_SIZE; 900 901 for (i = 0; i < count; i++) 902 rtvals[i] = VM_PAGER_AGAIN; 903 904 if ((int) m[0]->pindex < 0) { 905 printf("vnode_pager_putpages: attempt to write meta-data!!! -- 0x%x(%x)\n", 906 m[0]->pindex, m[0]->dirty); 907 rtvals[0] = VM_PAGER_BAD; 908 return VM_PAGER_BAD; 909 } 910 911 maxsize = count * PAGE_SIZE; 912 ncount = count; 913 914 poffset = IDX_TO_OFF(m[0]->pindex); 915 if (maxsize + poffset > object->un_pager.vnp.vnp_size) { 916 if (object->un_pager.vnp.vnp_size > poffset) 917 maxsize = object->un_pager.vnp.vnp_size - poffset; 918 else 919 maxsize = 0; 920 ncount = btoc(maxsize); 921 if (ncount < count) { 922 for (i = ncount; i < count; i++) { 923 rtvals[i] = VM_PAGER_BAD; 924 } 925 } 926 } 927 928 ioflags = IO_VMIO; 929 ioflags |= (flags & (VM_PAGER_PUT_SYNC | VM_PAGER_PUT_INVAL)) ? IO_SYNC: 0; 930 ioflags |= (flags & VM_PAGER_PUT_INVAL) ? IO_INVAL: 0; 931 932 aiov.iov_base = (caddr_t) 0; 933 aiov.iov_len = maxsize; 934 auio.uio_iov = &aiov; 935 auio.uio_iovcnt = 1; 936 auio.uio_offset = poffset; 937 auio.uio_segflg = UIO_NOCOPY; 938 auio.uio_rw = UIO_WRITE; 939 auio.uio_resid = maxsize; 940 auio.uio_procp = (struct proc *) 0; 941 error = VOP_WRITE(vp, &auio, ioflags, curproc->p_ucred); 942 cnt.v_vnodeout++; 943 cnt.v_vnodepgsout += ncount; 944 945 if (error) { 946 printf("vnode_pager_putpages: I/O error %d\n", error); 947 } 948 if (auio.uio_resid) { 949 printf("vnode_pager_putpages: residual I/O %d at %lu\n", 950 auio.uio_resid, (u_long)m[0]->pindex); 951 } 952 for (i = 0; i < ncount; i++) { 953 rtvals[i] = VM_PAGER_OK; 954 } 955 return rtvals[0]; 956 } 957 958 struct vnode * 959 vnode_pager_lock(object) 960 vm_object_t object; 961 { 962 struct proc *p = curproc; /* XXX */ 963 964 for (; object != NULL; object = object->backing_object) { 965 if (object->type != OBJT_VNODE) 966 continue; 967 if (object->flags & OBJ_DEAD) 968 return NULL; 969 970 while (vget(object->handle, 971 LK_NOPAUSE | LK_SHARED | LK_RETRY | LK_CANRECURSE, p)) { 972 if ((object->flags & OBJ_DEAD) || (object->type != OBJT_VNODE)) 973 return NULL; 974 printf("vnode_pager_lock: retrying\n"); 975 } 976 return object->handle; 977 } 978 return NULL; 979 } 980