Home | History | Annotate | Line # | Download | only in rumpkern
vm.c revision 1.5
      1 /*	$NetBSD: vm.c,v 1.5 2007/08/07 19:37:05 pooka Exp $	*/
      2 
      3 /*
      4  * Copyright (c) 2007 Antti Kantee.  All Rights Reserved.
      5  *
      6  * Development of this software was supported by Google Summer of Code.
      7  *
      8  * Redistribution and use in source and binary forms, with or without
      9  * modification, are permitted provided that the following conditions
     10  * are met:
     11  * 1. Redistributions of source code must retain the above copyright
     12  *    notice, this list of conditions and the following disclaimer.
     13  * 2. Redistributions in binary form must reproduce the above copyright
     14  *    notice, this list of conditions and the following disclaimer in the
     15  *    documentation and/or other materials provided with the distribution.
     16  *
     17  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS
     18  * OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
     19  * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
     20  * DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
     21  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     22  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
     23  * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     24  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     25  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     26  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     27  * SUCH DAMAGE.
     28  */
     29 
     30 /*
     31  * Virtual memory emulation routines.  Contents:
     32  *  + UBC
     33  *  + anon objects & pager
     34  *  + vnode objects & pager
     35  *  + misc support routines
     36  */
     37 
     38 /*
     39  * XXX: we abuse pg->uanon for the virtual address of the storage
     40  * for each page.  phys_addr would fit the job description better,
     41  * except that it will create unnecessary lossage on some platforms
     42  * due to not being a pointer type.
     43  */
     44 
     45 #include <sys/param.h>
     46 #include <sys/null.h>
     47 #include <sys/vnode.h>
     48 #include <sys/buf.h>
     49 
     50 #include <uvm/uvm.h>
     51 #include <uvm/uvm_prot.h>
     52 
     53 #include <machine/pmap.h>
     54 
     55 #include "rump.h"
     56 #include "rumpuser.h"
     57 
     58 /* dumdidumdum */
     59 #define len2npages(off, len)						\
     60   (((((len) + PAGE_MASK) & ~(PAGE_MASK)) >> PAGE_SHIFT)			\
     61     + (((off & PAGE_MASK) + (len & PAGE_MASK)) > PAGE_SIZE))
     62 
     63 static int ubc_winvalid;
     64 static struct uvm_object *ubc_uobj;
     65 static off_t ubc_offset;
     66 static int ubc_flags;
     67 
     68 struct uvm_pagerops uvm_vnodeops;
     69 struct uvm_pagerops aobj_pager;
     70 struct uvmexp uvmexp;
     71 
     72 struct vmspace rump_vmspace;
     73 struct vm_map rump_vmmap;
     74 
     75 /*
     76  * vm pages
     77  */
     78 
     79 /* XXX: we could be smarter about this */
     80 struct vm_page *
     81 rumpvm_findpage(struct uvm_object *uobj, voff_t off)
     82 {
     83 	struct vm_page *pg;
     84 
     85 	TAILQ_FOREACH(pg, &uobj->memq, listq)
     86 		if (pg->offset == off)
     87 			return pg;
     88 
     89 	return NULL;
     90 }
     91 
     92 struct vm_page *
     93 rumpvm_makepage(struct uvm_object *uobj, voff_t off, int allocstorage)
     94 {
     95 	struct vm_page *pg;
     96 
     97 	pg = rumpuser_malloc(sizeof(struct vm_page), 0);
     98 	memset(pg, 0, sizeof(struct vm_page));
     99 	TAILQ_INSERT_TAIL(&uobj->memq, pg, listq);
    100 	pg->offset = off;
    101 	pg->uobject = uobj;
    102 
    103 	if (allocstorage) {
    104 		pg->uanon = (void *)rumpuser_malloc(PAGE_SIZE, 0);
    105 		memset((void *)pg->uanon, 0, PAGE_SIZE);
    106 		pg->flags = PG_CLEAN;
    107 	}
    108 
    109 	return pg;
    110 }
    111 
    112 void
    113 rumpvm_freepage(struct vm_page *pg)
    114 {
    115 	struct uvm_object *uobj = pg->uobject;
    116 
    117 	TAILQ_REMOVE(&uobj->memq, pg, listq);
    118 	rumpuser_free((void *)pg->uanon);
    119 	rumpuser_free(pg);
    120 }
    121 
    122 /*
    123  * vnode pager
    124  */
    125 
    126 int
    127 rump_vopwrite_fault(struct vnode *vp, voff_t offset, size_t len,
    128 	kauth_cred_t cred)
    129 {
    130 	int npages = len2npages(offset, len);
    131 	struct vm_page *pgs[npages];
    132 	int rv;
    133 
    134 	if (trunc_page(offset) >= vp->v_size)
    135 		return 0;
    136 
    137 	rv = VOP_GETPAGES(vp, trunc_page(offset), pgs, &npages, 0, 0, 0, 0);
    138 	if (rv)
    139 		return rv;
    140 
    141 	assert(npages == len2npages(offset, len));
    142 
    143 	return 0;
    144 }
    145 
    146 static int
    147 vn_get(struct uvm_object *uobj, voff_t off, struct vm_page **pgs,
    148 	int *npages, int centeridx, vm_prot_t access_type,
    149 	int advice, int flags)
    150 {
    151 	struct vnode *vp = (struct vnode *)uobj;
    152 
    153 	return VOP_GETPAGES(vp, off, pgs, npages, centeridx, access_type,
    154 	    advice, flags);
    155 }
    156 
    157 static int
    158 vn_put(struct uvm_object *uobj, voff_t offlo, voff_t offhi, int flags)
    159 {
    160 	struct vnode *vp = (struct vnode *)uobj;
    161 
    162 	return VOP_PUTPAGES(vp, offlo, offhi, flags);
    163 }
    164 
    165 /*
    166  * Anon object stuff
    167  */
    168 
    169 static int
    170 ao_get(struct uvm_object *uobj, voff_t off, struct vm_page **pgs,
    171 	int *npages, int centeridx, vm_prot_t access_type,
    172 	int advice, int flags)
    173 {
    174 	struct vm_page *pg;
    175 	int i;
    176 
    177 	if (centeridx)
    178 		panic("%s: centeridx != 0 not supported", __func__);
    179 
    180 	/* loop over pages */
    181 	off = trunc_page(off);
    182 	for (i = 0; i < *npages; i++) {
    183 		pg = rumpvm_findpage(uobj, off + (i << PAGE_SHIFT));
    184 		if (pg) {
    185 			pgs[i] = pg;
    186 		} else {
    187 			pg = rumpvm_makepage(uobj, off + (i << PAGE_SHIFT), 1);
    188 			pgs[i] = pg;
    189 		}
    190 	}
    191 
    192 	return 0;
    193 
    194 }
    195 
    196 static int
    197 ao_put(struct uvm_object *uobj, voff_t start, voff_t stop, int flags)
    198 {
    199 	struct vm_page *pg;
    200 
    201 	/* we only free all pages for now */
    202 	if ((flags & PGO_FREE) == 0 || (flags & PGO_ALLPAGES) == 0)
    203 		return 0;
    204 
    205 	while ((pg = TAILQ_FIRST(&uobj->memq)) != NULL)
    206 		rumpvm_freepage(pg);
    207 
    208 	return 0;
    209 }
    210 
    211 struct uvm_object *
    212 uao_create(vsize_t size, int flags)
    213 {
    214 	struct uvm_object *uobj;
    215 
    216 	uobj = rumpuser_malloc(sizeof(struct uvm_object), 0);
    217 	memset(uobj, 0, sizeof(struct uvm_object));
    218 	uobj->pgops = &aobj_pager;
    219 	TAILQ_INIT(&uobj->memq);
    220 
    221 	return uobj;
    222 }
    223 
    224 void
    225 uao_detach(struct uvm_object *uobj)
    226 {
    227 
    228 	ao_put(uobj, 0, 0, PGO_ALLPAGES | PGO_FREE);
    229 	rumpuser_free(uobj);
    230 }
    231 
    232 /*
    233  * UBC
    234  */
    235 
    236 int
    237 rump_ubc_magic_uiomove(size_t n, struct uio *uio)
    238 {
    239 	int npages = len2npages(uio->uio_offset, n);
    240 	struct vm_page *pgs[npages];
    241 	int i, rv;
    242 
    243 	if (ubc_winvalid == 0)
    244 		panic("%s: ubc window not allocated", __func__);
    245 
    246 	rv = ubc_uobj->pgops->pgo_get(ubc_uobj, ubc_offset,
    247 	    pgs, &npages, 0, 0, 0, 0);
    248 	if (rv)
    249 		return rv;
    250 
    251 	for (i = 0; i < npages; i++) {
    252 		size_t xfersize;
    253 		off_t pageoff;
    254 
    255 		pageoff = uio->uio_offset & PAGE_MASK;
    256 		xfersize = MIN(MIN(n, PAGE_SIZE), PAGE_SIZE-pageoff);
    257 		uiomove((uint8_t *)pgs[i]->uanon + pageoff, xfersize, uio);
    258 		if (uio->uio_rw == UIO_WRITE)
    259 			RUMPVM_SOILPAGE(pgs[i]);
    260 		ubc_offset += xfersize;
    261 		n -= xfersize;
    262 	}
    263 
    264 	return 0;
    265 }
    266 
    267 void *
    268 ubc_alloc(struct uvm_object *uobj, voff_t offset, vsize_t *lenp, int advice,
    269 	int flags)
    270 {
    271 	vsize_t reallen;
    272 
    273 	/* XXX: only one window, but that's ok for now */
    274 	if (ubc_winvalid == 1)
    275 		panic("%s: ubc window already allocated", __func__);
    276 
    277 	printf("UBC_ALLOC offset 0x%x\n", (int)offset);
    278 	ubc_uobj = uobj;
    279 	ubc_offset = offset;
    280 	reallen = round_page(*lenp);
    281 	ubc_flags = flags;
    282 
    283 	ubc_winvalid = 1;
    284 
    285 	return RUMP_UBC_MAGIC_WINDOW;
    286 }
    287 
    288 void
    289 ubc_release(void *va, int flags)
    290 {
    291 
    292 	ubc_winvalid = 0;
    293 }
    294 
    295 int
    296 ubc_uiomove(struct uvm_object *uobj, struct uio *uio, vsize_t todo,
    297 	int advice, int flags)
    298 {
    299 	void *win;
    300 	vsize_t len;
    301 
    302 	while (todo > 0) {
    303 		len = todo;
    304 
    305 		win = ubc_alloc(uobj, uio->uio_offset, &len, 0, flags);
    306 		rump_ubc_magic_uiomove(len, uio);
    307 		ubc_release(win, 0);
    308 
    309 		todo -= len;
    310 	}
    311 	return 0;
    312 }
    313 
    314 
    315 /*
    316  * Misc routines
    317  */
    318 
    319 void
    320 rumpvm_init()
    321 {
    322 
    323 	uvm_vnodeops.pgo_get = vn_get;
    324 	uvm_vnodeops.pgo_put = vn_put;
    325 	aobj_pager.pgo_get = ao_get;
    326 	aobj_pager.pgo_put = ao_put;
    327 	uvmexp.free = 1024*1024; /* XXX */
    328 }
    329 
    330 void
    331 uvm_pageactivate(struct vm_page *pg)
    332 {
    333 
    334 	/* nada */
    335 }
    336 
    337 void
    338 uvm_page_unbusy(struct vm_page **pgs, int npgs)
    339 {
    340 
    341 	/* nada */
    342 }
    343 
    344 void
    345 uvm_vnp_setsize(struct vnode *vp, voff_t newsize)
    346 {
    347 
    348 	vp->v_size = vp->v_writesize = newsize;
    349 }
    350 
    351 void
    352 uvm_vnp_setwritesize(struct vnode *vp, voff_t newsize)
    353 {
    354 
    355 	vp->v_writesize = newsize;
    356 }
    357 
    358 void
    359 uvm_vnp_zerorange(struct vnode *vp, off_t off, size_t len)
    360 {
    361 	int maxpages = MIN(32, round_page(len) >> PAGE_SHIFT);
    362 	struct vm_page *pgs[maxpages];
    363 	struct uvm_object *uobj = &vp->v_uobj;
    364 	int rv, npages, i;
    365 
    366 	while (len) {
    367 		npages = MIN(maxpages, round_page(len) >> PAGE_SHIFT);
    368 		rv = uobj->pgops->pgo_get(uobj, off, pgs, &npages, 0, 0, 0, 0);
    369 		assert(npages > 0);
    370 
    371 		for (i = 0; i < npages; i++) {
    372 			uint8_t *start;
    373 			size_t chunkoff, chunklen;
    374 
    375 			chunkoff = off & PAGE_MASK;
    376 			chunklen = MIN(PAGE_SIZE - chunkoff, len);
    377 			start = (uint8_t *)pgs[i]->uanon + chunkoff;
    378 
    379 			memset(start, 0, chunklen);
    380 			pgs[i]->flags &= PG_CLEAN;
    381 
    382 			off += chunklen;
    383 			len -= chunklen;
    384 		}
    385 	}
    386 
    387 	return;
    388 }
    389 
    390 bool
    391 uvn_clean_p(struct uvm_object *uobj)
    392 {
    393 
    394 	printf("pages %d\n", (int)uobj->uo_npages);
    395 	if (uobj->uo_npages < 0)
    396 		panic("%s: uo_npages < 0", __func__);
    397 	return uobj->uo_npages == 0;
    398 }
    399