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