uvm_pager.c revision 1.92.18.4 1 /* $NetBSD: uvm_pager.c,v 1.92.18.4 2012/02/09 03:05:01 matt Exp $ */
2
3 /*
4 *
5 * Copyright (c) 1997 Charles D. Cranor and Washington University.
6 * All rights reserved.
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 * 3. All advertising materials mentioning features or use of this software
17 * must display the following acknowledgement:
18 * This product includes software developed by Charles D. Cranor and
19 * Washington University.
20 * 4. The name of the author may not be used to endorse or promote products
21 * derived from this software without specific prior written permission.
22 *
23 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
24 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
25 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
26 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
27 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
28 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
29 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
30 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
31 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
32 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
33 *
34 * from: Id: uvm_pager.c,v 1.1.2.23 1998/02/02 20:38:06 chuck Exp
35 */
36
37 /*
38 * uvm_pager.c: generic functions used to assist the pagers.
39 */
40
41 #include <sys/cdefs.h>
42 __KERNEL_RCSID(0, "$NetBSD: uvm_pager.c,v 1.92.18.4 2012/02/09 03:05:01 matt Exp $");
43
44 #include "opt_uvmhist.h"
45 #include "opt_readahead.h"
46 #include "opt_pagermap.h"
47
48 #include <sys/param.h>
49 #include <sys/systm.h>
50 #include <sys/proc.h>
51 #include <sys/malloc.h>
52 #include <sys/pool.h>
53 #include <sys/vnode.h>
54
55 #include <uvm/uvm.h>
56
57 /*
58 * XXX
59 * this is needed until the device strategy interface
60 * is changed to do physically-addressed i/o.
61 */
62
63 #ifndef PAGER_MAP_DEFAULT_SIZE
64 #define PAGER_MAP_DEFAULT_SIZE (16 * 1024 * 1024)
65 #endif
66
67 #ifndef PAGER_MAP_SIZE
68 #define PAGER_MAP_SIZE PAGER_MAP_DEFAULT_SIZE
69 #endif
70
71 size_t pager_map_size = PAGER_MAP_SIZE;
72
73 struct pool *uvm_aiobuf_pool;
74
75 /*
76 * list of uvm pagers in the system
77 */
78
79 const struct uvm_pagerops * const uvmpagerops[] = {
80 &aobj_pager,
81 &uvm_deviceops,
82 &uvm_vnodeops,
83 &ubc_pager,
84 };
85
86 /*
87 * the pager map: provides KVA for I/O
88 */
89
90 struct vm_map *pager_map; /* XXX */
91 kmutex_t pager_map_wanted_lock;
92 bool pager_map_wanted; /* locked by pager map */
93 static vaddr_t emergva;
94 static bool emerginuse;
95
96 /*
97 * uvm_pager_init: init pagers (at boot time)
98 */
99
100 void
101 uvm_pager_init(void)
102 {
103 u_int lcv;
104 vaddr_t sva, eva;
105
106 /*
107 * init pager map
108 */
109
110 sva = 0;
111 pager_map = uvm_km_suballoc(kernel_map, &sva, &eva, pager_map_size, 0,
112 false, NULL);
113 mutex_init(&pager_map_wanted_lock, MUTEX_DEFAULT, IPL_NONE);
114 pager_map_wanted = false;
115 emergva = uvm_km_alloc(kernel_map,
116 round_page(MAXPHYS) + ptoa(uvmexp.ncolors), 0,
117 UVM_KMF_VAONLY);
118 #if defined(DEBUG)
119 if (emergva == 0)
120 panic("emergva");
121 #endif
122 emerginuse = false;
123
124 /*
125 * init ASYNC I/O queue
126 */
127
128 TAILQ_INIT(&uvm.aio_done);
129
130 /*
131 * call pager init functions
132 */
133 for (lcv = 0 ; lcv < __arraycount(uvmpagerops); lcv++) {
134 if (uvmpagerops[lcv]->pgo_init)
135 uvmpagerops[lcv]->pgo_init();
136 }
137 }
138
139 /*
140 * uvm_pagermapin: map pages into KVA (pager_map) for I/O that needs mappings
141 *
142 * we basically just map in a blank map entry to reserve the space in the
143 * map and then use pmap_enter() to put the mappings in by hand.
144 */
145
146 vaddr_t
147 uvm_pagermapin(struct vm_page **pps, int npages, int flags)
148 {
149 vsize_t size;
150 vaddr_t kva;
151 vaddr_t cva;
152 struct vm_page *pp;
153 vm_prot_t prot;
154 const bool pdaemon = (curlwp == uvm.pagedaemon_lwp);
155 const u_int first_color = VM_PGCOLOR_BUCKET(*pps);
156 UVMHIST_FUNC("uvm_pagermapin"); UVMHIST_CALLED(maphist);
157
158 UVMHIST_LOG(maphist,"(pps=0x%x, npages=%d, first_color=%u)",
159 pps, npages, first_color, 0);
160
161 /*
162 * compute protection. outgoing I/O only needs read
163 * access to the page, whereas incoming needs read/write.
164 */
165
166 prot = VM_PROT_READ;
167 if (flags & UVMPAGER_MAPIN_READ)
168 prot |= VM_PROT_WRITE;
169
170 ReStart:
171 size = ptoa(npages);
172 kva = 0; /* let system choose VA */
173
174 if (uvm_map(pager_map, &kva, size, NULL, UVM_UNKNOWN_OFFSET,
175 first_color, UVM_FLAG_COLORMATCH | UVM_FLAG_NOMERGE
176 | (pdaemon ? UVM_FLAG_NOWAIT : 0)) != 0) {
177 if (pdaemon) {
178 mutex_enter(&pager_map_wanted_lock);
179 if (emerginuse) {
180 UVM_UNLOCK_AND_WAIT(&emergva,
181 &pager_map_wanted_lock, false,
182 "emergva", 0);
183 goto ReStart;
184 }
185 emerginuse = true;
186 mutex_exit(&pager_map_wanted_lock);
187 kva = emergva + ptoa(first_color);
188 /* The shift implicitly truncates to PAGE_SIZE */
189 KASSERT(npages <= (MAXPHYS >> PAGE_SHIFT));
190 goto enter;
191 }
192 if ((flags & UVMPAGER_MAPIN_WAITOK) == 0) {
193 UVMHIST_LOG(maphist,"<- NOWAIT failed", 0,0,0,0);
194 return(0);
195 }
196 mutex_enter(&pager_map_wanted_lock);
197 pager_map_wanted = true;
198 UVMHIST_LOG(maphist, " SLEEPING on pager_map",0,0,0,0);
199 UVM_UNLOCK_AND_WAIT(pager_map, &pager_map_wanted_lock, false,
200 "pager_map", 0);
201 goto ReStart;
202 }
203
204 enter:
205 /* got it */
206 for (cva = kva; npages != 0; npages--, cva += PAGE_SIZE) {
207 pp = *pps++;
208 KASSERT(pp);
209 KASSERT(VM_PGCOLOR_BUCKET(pp) == (atop(cva) & uvmexp.colormask));
210 KASSERT(pp->flags & PG_BUSY);
211 pmap_kenter_pa(cva, VM_PAGE_TO_PHYS(pp), prot);
212 }
213 pmap_update(vm_map_pmap(pager_map));
214
215 UVMHIST_LOG(maphist, "<- done (KVA=0x%x)", kva,0,0,0);
216 return(kva);
217 }
218
219 /*
220 * uvm_pagermapout: remove pager_map mapping
221 *
222 * we remove our mappings by hand and then remove the mapping (waking
223 * up anyone wanting space).
224 */
225
226 void
227 uvm_pagermapout(vaddr_t kva, int npages)
228 {
229 vsize_t size = ptoa(npages);
230 struct vm_map_entry *entries;
231 UVMHIST_FUNC("uvm_pagermapout"); UVMHIST_CALLED(maphist);
232
233 UVMHIST_LOG(maphist, " (kva=0x%x, npages=%d)", kva, npages,0,0);
234
235 /*
236 * duplicate uvm_unmap, but add in pager_map_wanted handling.
237 */
238
239 pmap_kremove(kva, size);
240
241 if ((kva & ~ptoa(uvmexp.colormask)) == emergva) {
242 mutex_enter(&pager_map_wanted_lock);
243 emerginuse = false;
244 wakeup(&emergva);
245 mutex_exit(&pager_map_wanted_lock);
246 return;
247 }
248
249 vm_map_lock(pager_map);
250 uvm_unmap_remove(pager_map, kva, kva + size, &entries, NULL, 0);
251 mutex_enter(&pager_map_wanted_lock);
252 if (pager_map_wanted) {
253 pager_map_wanted = false;
254 wakeup(pager_map);
255 }
256 mutex_exit(&pager_map_wanted_lock);
257 vm_map_unlock(pager_map);
258 if (entries)
259 uvm_unmap_detach(entries, 0);
260 pmap_update(pmap_kernel());
261 UVMHIST_LOG(maphist,"<- done",0,0,0,0);
262 }
263
264 /*
265 * interrupt-context iodone handler for nested i/o bufs.
266 *
267 * => the buffer is private so need not be locked here
268 */
269
270 void
271 uvm_aio_biodone1(struct buf *bp)
272 {
273 struct buf *mbp = bp->b_private;
274
275 KASSERT(mbp != bp);
276 if (bp->b_error != 0) {
277 mbp->b_error = bp->b_error;
278 }
279 mbp->b_resid -= bp->b_bcount;
280 putiobuf(bp);
281 if (mbp->b_resid == 0) {
282 biodone(mbp);
283 }
284 }
285
286 /*
287 * interrupt-context iodone handler for single-buf i/os
288 * or the top-level buf of a nested-buf i/o.
289 */
290
291 void
292 uvm_aio_biodone(struct buf *bp)
293 {
294 /* reset b_iodone for when this is a single-buf i/o. */
295 bp->b_iodone = uvm_aio_aiodone;
296
297 workqueue_enqueue(uvm.aiodone_queue, &bp->b_work, NULL);
298 }
299
300 void
301 uvm_aio_aiodone_pages(struct vm_page **pgs, int npages, bool write, int error)
302 {
303 struct uvm_object *uobj;
304 struct vm_page *pg;
305 kmutex_t *slock;
306 int swslot;
307 int i;
308 bool swap;
309 UVMHIST_FUNC("uvm_aio_aiodone_pages"); UVMHIST_CALLED(ubchist);
310
311 swslot = 0;
312 slock = NULL;
313 uobj = NULL;
314 pg = pgs[0];
315 swap = (pg->uanon != NULL && pg->uobject == NULL) ||
316 (pg->pqflags & PQ_AOBJ) != 0;
317 if (!swap) {
318 uobj = pg->uobject;
319 slock = &uobj->vmobjlock;
320 mutex_enter(slock);
321 mutex_enter(&uvm_pageqlock);
322 } else {
323 #if defined(VMSWAP)
324 if (error) {
325 if (pg->uobject != NULL) {
326 swslot = uao_find_swslot(pg->uobject,
327 pg->offset >> PAGE_SHIFT);
328 } else {
329 KASSERT(pg->uanon != NULL);
330 swslot = pg->uanon->an_swslot;
331 }
332 KASSERT(swslot);
333 }
334 #else /* defined(VMSWAP) */
335 panic("%s: swap", __func__);
336 #endif /* defined(VMSWAP) */
337 }
338 for (i = 0; i < npages; i++) {
339 pg = pgs[i];
340 KASSERT(swap || pg->uobject == uobj);
341 UVMHIST_LOG(ubchist, "pg %p", pg, 0,0,0);
342
343 #if defined(VMSWAP)
344 /*
345 * for swap i/os, lock each page's object (or anon)
346 * individually since each page may need a different lock.
347 */
348
349 if (swap) {
350 if (pg->uobject != NULL) {
351 slock = &pg->uobject->vmobjlock;
352 } else {
353 slock = &pg->uanon->an_lock;
354 }
355 mutex_enter(slock);
356 mutex_enter(&uvm_pageqlock);
357 }
358 #endif /* defined(VMSWAP) */
359
360 /*
361 * process errors. for reads, just mark the page to be freed.
362 * for writes, if the error was ENOMEM, we assume this was
363 * a transient failure so we mark the page dirty so that
364 * we'll try to write it again later. for all other write
365 * errors, we assume the error is permanent, thus the data
366 * in the page is lost. bummer.
367 */
368
369 if (error) {
370 int slot;
371 if (!write) {
372 pg->flags |= PG_RELEASED;
373 continue;
374 } else if (error == ENOMEM) {
375 if (pg->flags & PG_PAGEOUT) {
376 uvm_pageout_done(pg, false);
377 }
378 pg->flags &= ~PG_CLEAN;
379 uvm_pageactivate(pg);
380 slot = 0;
381 } else
382 slot = SWSLOT_BAD;
383
384 #if defined(VMSWAP)
385 if (swap) {
386 if (pg->uobject != NULL) {
387 int oldslot;
388 oldslot = uao_set_swslot(pg->uobject,
389 pg->offset >> PAGE_SHIFT, slot);
390 KASSERT(oldslot == swslot + i);
391 } else {
392 KASSERT(pg->uanon->an_swslot ==
393 swslot + i);
394 pg->uanon->an_swslot = slot;
395 }
396 }
397 #endif /* defined(VMSWAP) */
398 }
399
400 /*
401 * if the page is PG_FAKE, this must have been a read to
402 * initialize the page. clear PG_FAKE and activate the page.
403 * we must also clear the pmap "modified" flag since it may
404 * still be set from the page's previous identity.
405 */
406
407 if (pg->flags & PG_FAKE) {
408 KASSERT(!write);
409 pg->flags &= ~PG_FAKE;
410 #if defined(READAHEAD_STATS)
411 pg->pqflags |= PQ_READAHEAD;
412 uvm_ra_total.ev_count++;
413 #endif /* defined(READAHEAD_STATS) */
414 KASSERT((pg->flags & PG_CLEAN) != 0);
415 uvm_pageenqueue(pg);
416 pmap_clear_modify(pg);
417 }
418
419 /*
420 * do accounting for pagedaemon i/o and arrange to free
421 * the pages instead of just unbusying them.
422 */
423
424 if (pg->flags & PG_PAGEOUT) {
425 pg->flags &= ~PG_PAGEOUT;
426 uvm_pageout_done(pg, true);
427 pg->flags |= PG_RELEASED;
428 }
429
430 #if defined(VMSWAP)
431 /*
432 * for swap pages, unlock everything for this page now.
433 */
434
435 if (swap) {
436 if (pg->uobject == NULL && pg->uanon->an_ref == 0 &&
437 (pg->flags & PG_RELEASED) != 0) {
438 mutex_exit(&uvm_pageqlock);
439 uvm_anon_release(pg->uanon);
440 } else {
441 uvm_page_unbusy(&pg, 1);
442 mutex_exit(&uvm_pageqlock);
443 mutex_exit(slock);
444 }
445 }
446 #endif /* defined(VMSWAP) */
447 }
448 if (!swap) {
449 uvm_page_unbusy(pgs, npages);
450 mutex_exit(&uvm_pageqlock);
451 mutex_exit(slock);
452 } else {
453 #if defined(VMSWAP)
454 KASSERT(write);
455
456 /* these pages are now only in swap. */
457 mutex_enter(&uvm_swap_data_lock);
458 KASSERT(uvmexp.swpgonly + npages <= uvmexp.swpginuse);
459 if (error != ENOMEM)
460 uvmexp.swpgonly += npages;
461 mutex_exit(&uvm_swap_data_lock);
462 if (error) {
463 if (error != ENOMEM)
464 uvm_swap_markbad(swslot, npages);
465 else
466 uvm_swap_free(swslot, npages);
467 }
468 uvmexp.pdpending--;
469 #endif /* defined(VMSWAP) */
470 }
471 }
472
473 /*
474 * uvm_aio_aiodone: do iodone processing for async i/os.
475 * this should be called in thread context, not interrupt context.
476 */
477
478 void
479 uvm_aio_aiodone(struct buf *bp)
480 {
481 int npages = bp->b_bufsize >> PAGE_SHIFT;
482 struct vm_page *pgs[npages];
483 int i, error;
484 bool write;
485 UVMHIST_FUNC("uvm_aio_aiodone"); UVMHIST_CALLED(ubchist);
486 UVMHIST_LOG(ubchist, "bp %p", bp, 0,0,0);
487
488 error = bp->b_error;
489 write = (bp->b_flags & B_READ) == 0;
490 /* XXXUBC BC_NOCACHE is for swap pager, should be done differently */
491 if (write && !(bp->b_cflags & BC_NOCACHE) && bioopsp != NULL)
492 (*bioopsp->io_pageiodone)(bp);
493
494 for (i = 0; i < npages; i++) {
495 pgs[i] = uvm_pageratop((vaddr_t)bp->b_data + (i << PAGE_SHIFT));
496 UVMHIST_LOG(ubchist, "pgs[%d] = %p", i, pgs[i],0,0);
497 }
498 uvm_pagermapout((vaddr_t)bp->b_data, npages);
499
500 uvm_aio_aiodone_pages(pgs, npages, write, error);
501
502 if (write && (bp->b_cflags & BC_AGE) != 0) {
503 mutex_enter(bp->b_objlock);
504 vwakeup(bp);
505 mutex_exit(bp->b_objlock);
506 }
507 putiobuf(bp);
508 }
509
510 /*
511 * uvm_pageratop: convert KVAs in the pager map back to their page
512 * structures.
513 */
514
515 struct vm_page *
516 uvm_pageratop(vaddr_t kva)
517 {
518 struct vm_page *pg;
519 paddr_t pa;
520 bool rv;
521
522 rv = pmap_extract(pmap_kernel(), kva, &pa);
523 KASSERT(rv);
524 pg = PHYS_TO_VM_PAGE(pa);
525 KASSERT(pg != NULL);
526 return (pg);
527 }
528