vm_vfs.c revision 1.9
1 /* $NetBSD: vm_vfs.c,v 1.9 2009/08/05 14:05:22 pooka Exp $ */ 2 3 /* 4 * Copyright (c) 2008 Antti Kantee. All Rights Reserved. 5 * 6 * Development of this software was supported by the 7 * Finnish Cultural Foundation. 8 * 9 * Redistribution and use in source and binary forms, with or without 10 * modification, are permitted provided that the following conditions 11 * are met: 12 * 1. Redistributions of source code must retain the above copyright 13 * notice, this list of conditions and the following disclaimer. 14 * 2. Redistributions in binary form must reproduce the above copyright 15 * notice, this list of conditions and the following disclaimer in the 16 * documentation and/or other materials provided with the distribution. 17 * 18 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS 19 * OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED 20 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE 21 * DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 22 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 23 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR 24 * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 25 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 26 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 27 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 28 * SUCH DAMAGE. 29 */ 30 31 #include <sys/cdefs.h> 32 __KERNEL_RCSID(0, "$NetBSD: vm_vfs.c,v 1.9 2009/08/05 14:05:22 pooka Exp $"); 33 34 #include <sys/param.h> 35 36 #include <sys/buf.h> 37 #include <sys/vnode.h> 38 39 #include <uvm/uvm.h> 40 #include <uvm/uvm_readahead.h> 41 42 /* 43 * release resources held during async io. this is almost the 44 * same as uvm_aio_aiodone() from uvm_pager.c and only lacks the 45 * call to uvm_aio_aiodone_pages(): unbusies pages directly here. 46 */ 47 void 48 uvm_aio_aiodone(struct buf *bp) 49 { 50 int i, npages = bp->b_bufsize >> PAGE_SHIFT; 51 struct vm_page **pgs; 52 vaddr_t va; 53 54 pgs = kmem_alloc(npages * sizeof(*pgs), KM_SLEEP); 55 for (i = 0; i < npages; i++) { 56 va = (vaddr_t)bp->b_data + (i << PAGE_SHIFT); 57 pgs[i] = uvm_pageratop(va); 58 pgs[i]->flags &= ~PG_PAGEOUT; 59 } 60 61 uvm_pagermapout((vaddr_t)bp->b_data, npages); 62 uvm_page_unbusy(pgs, npages); 63 64 if (BUF_ISWRITE(bp) && (bp->b_cflags & BC_AGE) != 0) { 65 mutex_enter(bp->b_objlock); 66 vwakeup(bp); 67 mutex_exit(bp->b_objlock); 68 } 69 70 putiobuf(bp); 71 72 kmem_free(pgs, npages * sizeof(*pgs)); 73 } 74 75 void 76 uvm_aio_biodone1(struct buf *bp) 77 { 78 79 panic("%s: unimplemented", __func__); 80 } 81 82 void 83 uvm_aio_biodone(struct buf *bp) 84 { 85 86 uvm_aio_aiodone(bp); 87 } 88 89 struct uvm_ractx * 90 uvm_ra_allocctx(void) 91 { 92 93 return NULL; 94 } 95 96 void 97 uvm_ra_request(struct uvm_ractx *ra, int advice, struct uvm_object *uobj, 98 off_t reqoff, size_t reqsize) 99 { 100 101 return; 102 } 103 104 void 105 uvm_ra_freectx(struct uvm_ractx *ra) 106 { 107 108 return; 109 } 110 111 /* 112 * UBC 113 */ 114 115 void 116 uvm_vnp_zerorange(struct vnode *vp, off_t off, size_t len) 117 { 118 struct uvm_object *uobj = &vp->v_uobj; 119 struct vm_page **pgs; 120 int maxpages = MIN(32, round_page(len) >> PAGE_SHIFT); 121 int rv, npages, i; 122 123 pgs = kmem_zalloc(maxpages * sizeof(pgs), KM_SLEEP); 124 while (len) { 125 npages = MIN(maxpages, round_page(len) >> PAGE_SHIFT); 126 memset(pgs, 0, npages * sizeof(struct vm_page *)); 127 mutex_enter(&uobj->vmobjlock); 128 rv = uobj->pgops->pgo_get(uobj, off, pgs, &npages, 0, 0, 0, 0); 129 KASSERT(npages > 0); 130 131 for (i = 0; i < npages; i++) { 132 uint8_t *start; 133 size_t chunkoff, chunklen; 134 135 chunkoff = off & PAGE_MASK; 136 chunklen = MIN(PAGE_SIZE - chunkoff, len); 137 start = (uint8_t *)pgs[i]->uanon + chunkoff; 138 139 memset(start, 0, chunklen); 140 pgs[i]->flags &= ~PG_CLEAN; 141 142 off += chunklen; 143 len -= chunklen; 144 } 145 uvm_page_unbusy(pgs, npages); 146 } 147 kmem_free(pgs, maxpages * sizeof(pgs)); 148 149 return; 150 } 151 152 /* dumdidumdum */ 153 #define len2npages(off, len) \ 154 (((((len) + PAGE_MASK) & ~(PAGE_MASK)) >> PAGE_SHIFT) \ 155 + (((off & PAGE_MASK) + (len & PAGE_MASK)) > PAGE_SIZE)) 156 157 int 158 ubc_uiomove(struct uvm_object *uobj, struct uio *uio, vsize_t todo, 159 int advice, int flags) 160 { 161 struct vm_page **pgs; 162 int npages = len2npages(uio->uio_offset, todo); 163 size_t pgalloc; 164 int i, rv, pagerflags; 165 166 pgalloc = npages * sizeof(pgs); 167 pgs = kmem_zalloc(pgalloc, KM_SLEEP); 168 169 pagerflags = PGO_SYNCIO | PGO_NOBLOCKALLOC | PGO_NOTIMESTAMP; 170 if (flags & UBC_WRITE) 171 pagerflags |= PGO_PASTEOF; 172 if (flags & UBC_FAULTBUSY) 173 pagerflags |= PGO_OVERWRITE; 174 175 do { 176 mutex_enter(&uobj->vmobjlock); 177 rv = uobj->pgops->pgo_get(uobj, uio->uio_offset, pgs, &npages, 178 0, VM_PROT_READ | VM_PROT_WRITE, 0, pagerflags); 179 if (rv) 180 goto out; 181 182 for (i = 0; i < npages; i++) { 183 size_t xfersize; 184 off_t pageoff; 185 186 pageoff = uio->uio_offset & PAGE_MASK; 187 xfersize = MIN(MIN(todo, PAGE_SIZE), PAGE_SIZE-pageoff); 188 uiomove((uint8_t *)pgs[i]->uanon + pageoff, 189 xfersize, uio); 190 if (uio->uio_rw == UIO_WRITE) 191 pgs[i]->flags &= ~PG_CLEAN; 192 todo -= xfersize; 193 } 194 uvm_page_unbusy(pgs, npages); 195 } while (todo); 196 197 out: 198 kmem_free(pgs, pgalloc); 199 return rv; 200 } 201
Indexes created Tue Sep 30 07:10:03 GMT 2025