vm_vfs.c revision 1.23
1 /* $NetBSD: vm_vfs.c,v 1.23 2010/09/09 12:18:39 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.23 2010/09/09 12:18:39 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 struct uvm_object *uobj; 51 int i, npages = bp->b_bufsize >> PAGE_SHIFT; 52 struct vm_page **pgs; 53 vaddr_t va; 54 int pageout = 0; 55 56 KASSERT(npages > 0); 57 pgs = kmem_alloc(npages * sizeof(*pgs), KM_SLEEP); 58 for (i = 0; i < npages; i++) { 59 va = (vaddr_t)bp->b_data + (i << PAGE_SHIFT); 60 pgs[i] = uvm_pageratop(va); 61 if (pgs[i]->flags & PG_PAGEOUT) { 62 KASSERT((pgs[i]->flags & PG_FAKE) == 0); 63 pageout++; 64 pgs[i]->flags &= ~PG_PAGEOUT; 65 pgs[i]->flags |= PG_RELEASED; 66 } 67 } 68 69 uvm_pagermapout((vaddr_t)bp->b_data, npages); 70 uvm_pageout_done(pageout); 71 72 /* get uobj because we need it after pages might be recycled */ 73 uobj = pgs[0]->uobject; 74 KASSERT(uobj); 75 76 mutex_enter(&uobj->vmobjlock); 77 mutex_enter(&uvm_pageqlock); 78 uvm_page_unbusy(pgs, npages); 79 mutex_exit(&uvm_pageqlock); 80 mutex_exit(&uobj->vmobjlock); 81 82 if (BUF_ISWRITE(bp) && (bp->b_cflags & BC_AGE) != 0) { 83 mutex_enter(bp->b_objlock); 84 vwakeup(bp); 85 mutex_exit(bp->b_objlock); 86 } 87 88 putiobuf(bp); 89 90 kmem_free(pgs, npages * sizeof(*pgs)); 91 } 92 93 void 94 uvm_aio_biodone(struct buf *bp) 95 { 96 97 uvm_aio_aiodone(bp); 98 } 99 100 /* 101 * UBC 102 */ 103 104 #define PAGERFLAGS (PGO_SYNCIO | PGO_NOBLOCKALLOC | PGO_NOTIMESTAMP) 105 106 void 107 uvm_vnp_zerorange(struct vnode *vp, off_t off, size_t len) 108 { 109 struct uvm_object *uobj = &vp->v_uobj; 110 struct vm_page **pgs; 111 int maxpages = MIN(32, round_page(len) >> PAGE_SHIFT); 112 int rv, npages, i; 113 114 if (maxpages == 0) 115 return; 116 117 pgs = kmem_alloc(maxpages * sizeof(pgs), KM_SLEEP); 118 mutex_enter(&uobj->vmobjlock); 119 while (len) { 120 npages = MIN(maxpages, round_page(len) >> PAGE_SHIFT); 121 memset(pgs, 0, npages * sizeof(struct vm_page *)); 122 rv = uobj->pgops->pgo_get(uobj, trunc_page(off), 123 pgs, &npages, 0, VM_PROT_READ | VM_PROT_WRITE, 124 0, PAGERFLAGS | PGO_PASTEOF); 125 KASSERT(npages > 0); 126 127 for (i = 0; i < npages; i++) { 128 struct vm_page *pg; 129 uint8_t *start; 130 size_t chunkoff, chunklen; 131 132 pg = pgs[i]; 133 if (pg == NULL) 134 break; 135 136 chunkoff = off & PAGE_MASK; 137 chunklen = MIN(PAGE_SIZE - chunkoff, len); 138 start = (uint8_t *)pg->uanon + chunkoff; 139 140 memset(start, 0, chunklen); 141 pg->flags &= ~PG_CLEAN; 142 143 off += chunklen; 144 len -= chunklen; 145 } 146 mutex_enter(&uobj->vmobjlock); 147 uvm_page_unbusy(pgs, npages); 148 } 149 mutex_exit(&uobj->vmobjlock); 150 kmem_free(pgs, maxpages * sizeof(pgs)); 151 152 return; 153 } 154 155 #define len2npages(off, len) \ 156 ((round_page(off+len) - trunc_page(off)) >> PAGE_SHIFT) 157 158 int 159 ubc_uiomove(struct uvm_object *uobj, struct uio *uio, vsize_t todo, 160 int advice, int flags) 161 { 162 struct vm_page **pgs; 163 int npages = len2npages(uio->uio_offset, todo); 164 size_t pgalloc; 165 int i, rv, pagerflags; 166 167 pgalloc = npages * sizeof(pgs); 168 pgs = kmem_alloc(pgalloc, KM_SLEEP); 169 170 pagerflags = PAGERFLAGS; 171 if (flags & UBC_WRITE) 172 pagerflags |= PGO_PASTEOF; 173 if (flags & UBC_FAULTBUSY) 174 pagerflags |= PGO_OVERWRITE; 175 176 mutex_enter(&uobj->vmobjlock); 177 do { 178 npages = len2npages(uio->uio_offset, todo); 179 memset(pgs, 0, pgalloc); 180 rv = uobj->pgops->pgo_get(uobj, trunc_page(uio->uio_offset), 181 pgs, &npages, 0, VM_PROT_READ | VM_PROT_WRITE, 0, 182 pagerflags); 183 if (rv) 184 goto out; 185 186 for (i = 0; i < npages; i++) { 187 struct vm_page *pg; 188 size_t xfersize; 189 off_t pageoff; 190 191 pg = pgs[i]; 192 if (pg == NULL) 193 break; 194 195 pageoff = uio->uio_offset & PAGE_MASK; 196 xfersize = MIN(MIN(todo, PAGE_SIZE), PAGE_SIZE-pageoff); 197 KASSERT(xfersize > 0); 198 uiomove((uint8_t *)pg->uanon + pageoff, 199 xfersize, uio); 200 if (uio->uio_rw == UIO_WRITE) 201 pg->flags &= ~(PG_CLEAN | PG_FAKE); 202 todo -= xfersize; 203 } 204 mutex_enter(&uobj->vmobjlock); 205 uvm_page_unbusy(pgs, npages); 206 } while (todo); 207 mutex_exit(&uobj->vmobjlock); 208 209 out: 210 kmem_free(pgs, pgalloc); 211 return rv; 212 } 213
Indexes created Tue Sep 30 10:09:55 GMT 2025