uvm_pager.c revision 1.55 1 1.55 chs /* $NetBSD: uvm_pager.c,v 1.55 2001/12/31 19:21:38 chs Exp $ */
2 1.1 mrg
3 1.1 mrg /*
4 1.1 mrg *
5 1.1 mrg * Copyright (c) 1997 Charles D. Cranor and Washington University.
6 1.1 mrg * All rights reserved.
7 1.1 mrg *
8 1.1 mrg * Redistribution and use in source and binary forms, with or without
9 1.1 mrg * modification, are permitted provided that the following conditions
10 1.1 mrg * are met:
11 1.1 mrg * 1. Redistributions of source code must retain the above copyright
12 1.1 mrg * notice, this list of conditions and the following disclaimer.
13 1.1 mrg * 2. Redistributions in binary form must reproduce the above copyright
14 1.1 mrg * notice, this list of conditions and the following disclaimer in the
15 1.1 mrg * documentation and/or other materials provided with the distribution.
16 1.1 mrg * 3. All advertising materials mentioning features or use of this software
17 1.1 mrg * must display the following acknowledgement:
18 1.1 mrg * This product includes software developed by Charles D. Cranor and
19 1.1 mrg * Washington University.
20 1.1 mrg * 4. The name of the author may not be used to endorse or promote products
21 1.1 mrg * derived from this software without specific prior written permission.
22 1.1 mrg *
23 1.1 mrg * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
24 1.1 mrg * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
25 1.1 mrg * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
26 1.1 mrg * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
27 1.1 mrg * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
28 1.1 mrg * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
29 1.1 mrg * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
30 1.1 mrg * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
31 1.1 mrg * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
32 1.1 mrg * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
33 1.3 mrg *
34 1.3 mrg * from: Id: uvm_pager.c,v 1.1.2.23 1998/02/02 20:38:06 chuck Exp
35 1.1 mrg */
36 1.1 mrg
37 1.1 mrg /*
38 1.1 mrg * uvm_pager.c: generic functions used to assist the pagers.
39 1.1 mrg */
40 1.54 lukem
41 1.54 lukem #include <sys/cdefs.h>
42 1.55 chs __KERNEL_RCSID(0, "$NetBSD: uvm_pager.c,v 1.55 2001/12/31 19:21:38 chs Exp $");
43 1.54 lukem
44 1.54 lukem #include "opt_uvmhist.h"
45 1.1 mrg
46 1.1 mrg #include <sys/param.h>
47 1.1 mrg #include <sys/systm.h>
48 1.1 mrg #include <sys/proc.h>
49 1.1 mrg #include <sys/malloc.h>
50 1.35 chs #include <sys/pool.h>
51 1.35 chs #include <sys/vnode.h>
52 1.1 mrg
53 1.1 mrg #define UVM_PAGER
54 1.1 mrg #include <uvm/uvm.h>
55 1.1 mrg
56 1.35 chs struct pool *uvm_aiobuf_pool;
57 1.35 chs
58 1.1 mrg /*
59 1.1 mrg * list of uvm pagers in the system
60 1.1 mrg */
61 1.1 mrg
62 1.1 mrg extern struct uvm_pagerops uvm_deviceops;
63 1.1 mrg extern struct uvm_pagerops uvm_vnodeops;
64 1.35 chs extern struct uvm_pagerops ubc_pager;
65 1.1 mrg
66 1.1 mrg struct uvm_pagerops *uvmpagerops[] = {
67 1.10 thorpej &aobj_pager,
68 1.6 mrg &uvm_deviceops,
69 1.6 mrg &uvm_vnodeops,
70 1.35 chs &ubc_pager,
71 1.1 mrg };
72 1.1 mrg
73 1.1 mrg /*
74 1.1 mrg * the pager map: provides KVA for I/O
75 1.1 mrg */
76 1.1 mrg
77 1.47 chs struct vm_map *pager_map; /* XXX */
78 1.46 chs struct simplelock pager_map_wanted_lock;
79 1.1 mrg boolean_t pager_map_wanted; /* locked by pager map */
80 1.35 chs static vaddr_t emergva;
81 1.35 chs static boolean_t emerginuse;
82 1.1 mrg
83 1.1 mrg /*
84 1.1 mrg * uvm_pager_init: init pagers (at boot time)
85 1.1 mrg */
86 1.1 mrg
87 1.6 mrg void
88 1.6 mrg uvm_pager_init()
89 1.6 mrg {
90 1.6 mrg int lcv;
91 1.50 chs vaddr_t sva, eva;
92 1.1 mrg
93 1.6 mrg /*
94 1.6 mrg * init pager map
95 1.6 mrg */
96 1.6 mrg
97 1.50 chs sva = 0;
98 1.50 chs pager_map = uvm_km_suballoc(kernel_map, &sva, &eva, PAGER_MAP_SIZE, 0,
99 1.50 chs FALSE, NULL);
100 1.35 chs simple_lock_init(&pager_map_wanted_lock);
101 1.35 chs pager_map_wanted = FALSE;
102 1.35 chs emergva = uvm_km_valloc(kernel_map, MAXBSIZE);
103 1.35 chs emerginuse = FALSE;
104 1.6 mrg
105 1.6 mrg /*
106 1.6 mrg * init ASYNC I/O queue
107 1.6 mrg */
108 1.45 chs
109 1.6 mrg TAILQ_INIT(&uvm.aio_done);
110 1.1 mrg
111 1.6 mrg /*
112 1.6 mrg * call pager init functions
113 1.6 mrg */
114 1.6 mrg for (lcv = 0 ; lcv < sizeof(uvmpagerops)/sizeof(struct uvm_pagerops *);
115 1.6 mrg lcv++) {
116 1.6 mrg if (uvmpagerops[lcv]->pgo_init)
117 1.6 mrg uvmpagerops[lcv]->pgo_init();
118 1.6 mrg }
119 1.1 mrg }
120 1.1 mrg
121 1.1 mrg /*
122 1.1 mrg * uvm_pagermapin: map pages into KVA (pager_map) for I/O that needs mappings
123 1.1 mrg *
124 1.1 mrg * we basically just map in a blank map entry to reserve the space in the
125 1.1 mrg * map and then use pmap_enter() to put the mappings in by hand.
126 1.1 mrg */
127 1.1 mrg
128 1.9 eeh vaddr_t
129 1.35 chs uvm_pagermapin(pps, npages, flags)
130 1.6 mrg struct vm_page **pps;
131 1.6 mrg int npages;
132 1.29 thorpej int flags;
133 1.1 mrg {
134 1.9 eeh vsize_t size;
135 1.9 eeh vaddr_t kva;
136 1.9 eeh vaddr_t cva;
137 1.6 mrg struct vm_page *pp;
138 1.29 thorpej vm_prot_t prot;
139 1.6 mrg UVMHIST_FUNC("uvm_pagermapin"); UVMHIST_CALLED(maphist);
140 1.1 mrg
141 1.35 chs UVMHIST_LOG(maphist,"(pps=0x%x, npages=%d)", pps, npages,0,0);
142 1.29 thorpej
143 1.29 thorpej /*
144 1.29 thorpej * compute protection. outgoing I/O only needs read
145 1.29 thorpej * access to the page, whereas incoming needs read/write.
146 1.29 thorpej */
147 1.29 thorpej
148 1.29 thorpej prot = VM_PROT_READ;
149 1.29 thorpej if (flags & UVMPAGER_MAPIN_READ)
150 1.29 thorpej prot |= VM_PROT_WRITE;
151 1.1 mrg
152 1.1 mrg ReStart:
153 1.12 chs size = npages << PAGE_SHIFT;
154 1.29 thorpej kva = 0; /* let system choose VA */
155 1.1 mrg
156 1.45 chs if (uvm_map(pager_map, &kva, size, NULL,
157 1.43 chs UVM_UNKNOWN_OFFSET, 0, UVM_FLAG_NOMERGE) != 0) {
158 1.35 chs if (curproc == uvm.pagedaemon_proc) {
159 1.35 chs simple_lock(&pager_map_wanted_lock);
160 1.35 chs if (emerginuse) {
161 1.35 chs UVM_UNLOCK_AND_WAIT(&emergva,
162 1.35 chs &pager_map_wanted_lock, FALSE,
163 1.35 chs "emergva", 0);
164 1.35 chs goto ReStart;
165 1.35 chs }
166 1.35 chs emerginuse = TRUE;
167 1.35 chs simple_unlock(&pager_map_wanted_lock);
168 1.35 chs kva = emergva;
169 1.35 chs KASSERT(npages <= MAXBSIZE >> PAGE_SHIFT);
170 1.35 chs goto enter;
171 1.35 chs }
172 1.29 thorpej if ((flags & UVMPAGER_MAPIN_WAITOK) == 0) {
173 1.6 mrg UVMHIST_LOG(maphist,"<- NOWAIT failed", 0,0,0,0);
174 1.29 thorpej return(0);
175 1.6 mrg }
176 1.6 mrg simple_lock(&pager_map_wanted_lock);
177 1.45 chs pager_map_wanted = TRUE;
178 1.6 mrg UVMHIST_LOG(maphist, " SLEEPING on pager_map",0,0,0,0);
179 1.45 chs UVM_UNLOCK_AND_WAIT(pager_map, &pager_map_wanted_lock, FALSE,
180 1.35 chs "pager_map", 0);
181 1.6 mrg goto ReStart;
182 1.6 mrg }
183 1.1 mrg
184 1.35 chs enter:
185 1.6 mrg /* got it */
186 1.6 mrg for (cva = kva ; size != 0 ; size -= PAGE_SIZE, cva += PAGE_SIZE) {
187 1.6 mrg pp = *pps++;
188 1.40 mrg KASSERT(pp);
189 1.38 chs KASSERT(pp->flags & PG_BUSY);
190 1.50 chs pmap_kenter_pa(cva, VM_PAGE_TO_PHYS(pp), prot);
191 1.6 mrg }
192 1.49 chris pmap_update(vm_map_pmap(pager_map));
193 1.1 mrg
194 1.6 mrg UVMHIST_LOG(maphist, "<- done (KVA=0x%x)", kva,0,0,0);
195 1.6 mrg return(kva);
196 1.1 mrg }
197 1.1 mrg
198 1.1 mrg /*
199 1.1 mrg * uvm_pagermapout: remove pager_map mapping
200 1.1 mrg *
201 1.1 mrg * we remove our mappings by hand and then remove the mapping (waking
202 1.1 mrg * up anyone wanting space).
203 1.1 mrg */
204 1.1 mrg
205 1.6 mrg void
206 1.6 mrg uvm_pagermapout(kva, npages)
207 1.9 eeh vaddr_t kva;
208 1.6 mrg int npages;
209 1.6 mrg {
210 1.12 chs vsize_t size = npages << PAGE_SHIFT;
211 1.47 chs struct vm_map_entry *entries;
212 1.6 mrg UVMHIST_FUNC("uvm_pagermapout"); UVMHIST_CALLED(maphist);
213 1.35 chs
214 1.6 mrg UVMHIST_LOG(maphist, " (kva=0x%x, npages=%d)", kva, npages,0,0);
215 1.1 mrg
216 1.6 mrg /*
217 1.6 mrg * duplicate uvm_unmap, but add in pager_map_wanted handling.
218 1.6 mrg */
219 1.6 mrg
220 1.50 chs pmap_kremove(kva, npages << PAGE_SHIFT);
221 1.35 chs if (kva == emergva) {
222 1.35 chs simple_lock(&pager_map_wanted_lock);
223 1.35 chs emerginuse = FALSE;
224 1.35 chs wakeup(&emergva);
225 1.35 chs simple_unlock(&pager_map_wanted_lock);
226 1.50 chs return;
227 1.35 chs }
228 1.35 chs
229 1.6 mrg vm_map_lock(pager_map);
230 1.43 chs uvm_unmap_remove(pager_map, kva, kva + size, &entries);
231 1.6 mrg simple_lock(&pager_map_wanted_lock);
232 1.6 mrg if (pager_map_wanted) {
233 1.6 mrg pager_map_wanted = FALSE;
234 1.6 mrg wakeup(pager_map);
235 1.6 mrg }
236 1.6 mrg simple_unlock(&pager_map_wanted_lock);
237 1.6 mrg vm_map_unlock(pager_map);
238 1.6 mrg if (entries)
239 1.6 mrg uvm_unmap_detach(entries, 0);
240 1.49 chris pmap_update(pmap_kernel());
241 1.6 mrg UVMHIST_LOG(maphist,"<- done",0,0,0,0);
242 1.1 mrg }
243 1.1 mrg
244 1.1 mrg /*
245 1.35 chs * interrupt-context iodone handler for nested i/o bufs.
246 1.35 chs *
247 1.35 chs * => must be at splbio().
248 1.35 chs */
249 1.35 chs
250 1.35 chs void
251 1.35 chs uvm_aio_biodone1(bp)
252 1.35 chs struct buf *bp;
253 1.35 chs {
254 1.35 chs struct buf *mbp = bp->b_private;
255 1.35 chs
256 1.35 chs KASSERT(mbp != bp);
257 1.35 chs if (bp->b_flags & B_ERROR) {
258 1.35 chs mbp->b_flags |= B_ERROR;
259 1.35 chs mbp->b_error = bp->b_error;
260 1.35 chs }
261 1.35 chs mbp->b_resid -= bp->b_bcount;
262 1.35 chs pool_put(&bufpool, bp);
263 1.35 chs if (mbp->b_resid == 0) {
264 1.35 chs biodone(mbp);
265 1.35 chs }
266 1.35 chs }
267 1.35 chs
268 1.35 chs /*
269 1.35 chs * interrupt-context iodone handler for single-buf i/os
270 1.35 chs * or the top-level buf of a nested-buf i/o.
271 1.35 chs *
272 1.35 chs * => must be at splbio().
273 1.35 chs */
274 1.35 chs
275 1.35 chs void
276 1.35 chs uvm_aio_biodone(bp)
277 1.35 chs struct buf *bp;
278 1.35 chs {
279 1.35 chs /* reset b_iodone for when this is a single-buf i/o. */
280 1.35 chs bp->b_iodone = uvm_aio_aiodone;
281 1.35 chs
282 1.35 chs simple_lock(&uvm.aiodoned_lock); /* locks uvm.aio_done */
283 1.35 chs TAILQ_INSERT_TAIL(&uvm.aio_done, bp, b_freelist);
284 1.35 chs wakeup(&uvm.aiodoned);
285 1.35 chs simple_unlock(&uvm.aiodoned_lock);
286 1.35 chs }
287 1.35 chs
288 1.35 chs /*
289 1.35 chs * uvm_aio_aiodone: do iodone processing for async i/os.
290 1.35 chs * this should be called in thread context, not interrupt context.
291 1.35 chs */
292 1.35 chs
293 1.35 chs void
294 1.35 chs uvm_aio_aiodone(bp)
295 1.35 chs struct buf *bp;
296 1.35 chs {
297 1.35 chs int npages = bp->b_bufsize >> PAGE_SHIFT;
298 1.35 chs struct vm_page *pg, *pgs[npages];
299 1.35 chs struct uvm_object *uobj;
300 1.50 chs struct simplelock *slock;
301 1.50 chs int s, i, error, swslot;
302 1.52 simonb boolean_t write, swap, pageout;
303 1.35 chs UVMHIST_FUNC("uvm_aio_aiodone"); UVMHIST_CALLED(ubchist);
304 1.35 chs UVMHIST_LOG(ubchist, "bp %p", bp, 0,0,0);
305 1.35 chs
306 1.41 chs error = (bp->b_flags & B_ERROR) ? (bp->b_error ? bp->b_error : EIO) : 0;
307 1.35 chs write = (bp->b_flags & B_READ) == 0;
308 1.35 chs /* XXXUBC B_NOCACHE is for swap pager, should be done differently */
309 1.36 chs if (write && !(bp->b_flags & B_NOCACHE) && bioops.io_pageiodone) {
310 1.36 chs (*bioops.io_pageiodone)(bp);
311 1.35 chs }
312 1.35 chs
313 1.35 chs uobj = NULL;
314 1.35 chs for (i = 0; i < npages; i++) {
315 1.35 chs pgs[i] = uvm_pageratop((vaddr_t)bp->b_data + (i << PAGE_SHIFT));
316 1.35 chs UVMHIST_LOG(ubchist, "pgs[%d] = %p", i, pgs[i],0,0);
317 1.35 chs }
318 1.35 chs uvm_pagermapout((vaddr_t)bp->b_data, npages);
319 1.50 chs
320 1.50 chs swslot = 0;
321 1.50 chs slock = NULL;
322 1.55 chs pg = pgs[0];
323 1.55 chs swap = (pg->uanon != NULL && pg->uobject == NULL) ||
324 1.55 chs (pg->pqflags & PQ_AOBJ) != 0;
325 1.55 chs pageout = (pg->flags & PG_PAGEOUT) != 0;
326 1.50 chs if (!swap) {
327 1.55 chs uobj = pg->uobject;
328 1.50 chs slock = &uobj->vmobjlock;
329 1.50 chs simple_lock(slock);
330 1.50 chs uvm_lock_pageq();
331 1.50 chs } else if (error) {
332 1.55 chs if (pg->uobject != NULL) {
333 1.55 chs swslot = uao_find_swslot(pg->uobject, pg->offset);
334 1.55 chs } else {
335 1.50 chs swslot = pg->uanon->an_swslot;
336 1.50 chs }
337 1.50 chs KASSERT(swslot);
338 1.50 chs }
339 1.35 chs for (i = 0; i < npages; i++) {
340 1.35 chs pg = pgs[i];
341 1.50 chs KASSERT(swap || pg->uobject == uobj);
342 1.50 chs KASSERT(pageout ^ ((pg->flags & PG_PAGEOUT) == 0));
343 1.50 chs UVMHIST_LOG(ubchist, "pg %p", pg, 0,0,0);
344 1.50 chs
345 1.50 chs /*
346 1.50 chs * for swap i/os, lock each page's object (or anon)
347 1.50 chs * individually since each page may need a different lock.
348 1.50 chs */
349 1.35 chs
350 1.35 chs if (swap) {
351 1.55 chs if (pg->uobject != NULL) {
352 1.55 chs slock = &pg->uobject->vmobjlock;
353 1.55 chs } else {
354 1.50 chs slock = &pg->uanon->an_lock;
355 1.35 chs }
356 1.50 chs simple_lock(slock);
357 1.50 chs uvm_lock_pageq();
358 1.50 chs }
359 1.50 chs
360 1.50 chs /*
361 1.50 chs * process errors. for reads, just mark the page to be freed.
362 1.50 chs * for writes, if the error was ENOMEM, we assume this was
363 1.50 chs * a transient failure so we mark the page dirty so that
364 1.50 chs * we'll try to write it again later. for all other write
365 1.50 chs * errors, we assume the error is permanent, thus the data
366 1.50 chs * in the page is lost. bummer.
367 1.50 chs */
368 1.50 chs
369 1.50 chs if (error) {
370 1.50 chs if (!write) {
371 1.50 chs pg->flags |= PG_RELEASED;
372 1.50 chs continue;
373 1.50 chs } else if (error == ENOMEM) {
374 1.50 chs if (pg->flags & PG_PAGEOUT) {
375 1.50 chs pg->flags &= ~PG_PAGEOUT;
376 1.50 chs uvmexp.paging--;
377 1.50 chs }
378 1.50 chs pg->flags &= ~PG_CLEAN;
379 1.50 chs uvm_pageactivate(pg);
380 1.50 chs }
381 1.50 chs }
382 1.50 chs
383 1.50 chs /*
384 1.50 chs * if the page is PG_FAKE, this must have been a read to
385 1.50 chs * initialize the page. clear PG_FAKE and activate the page.
386 1.53 chs * we must also clear the pmap "modified" flag since it may
387 1.53 chs * still be set from the page's previous identity.
388 1.50 chs */
389 1.50 chs
390 1.50 chs if (pg->flags & PG_FAKE) {
391 1.50 chs KASSERT(!write);
392 1.50 chs pg->flags &= ~PG_FAKE;
393 1.50 chs uvm_pageactivate(pg);
394 1.50 chs pmap_clear_modify(pg);
395 1.35 chs }
396 1.35 chs
397 1.35 chs /*
398 1.53 chs * do accounting for pagedaemon i/o and arrange to free
399 1.53 chs * the pages instead of just unbusying them.
400 1.35 chs */
401 1.35 chs
402 1.53 chs if (pg->flags & PG_PAGEOUT) {
403 1.50 chs pg->flags &= ~PG_PAGEOUT;
404 1.50 chs uvmexp.paging--;
405 1.35 chs pg->flags |= PG_RELEASED;
406 1.35 chs }
407 1.35 chs
408 1.35 chs /*
409 1.50 chs * for swap pages, unlock everything for this page now.
410 1.35 chs */
411 1.35 chs
412 1.35 chs if (swap) {
413 1.50 chs uvm_page_unbusy(&pg, 1);
414 1.50 chs uvm_unlock_pageq();
415 1.50 chs simple_unlock(slock);
416 1.35 chs }
417 1.35 chs }
418 1.35 chs if (!swap) {
419 1.50 chs uvm_page_unbusy(pgs, npages);
420 1.50 chs uvm_unlock_pageq();
421 1.50 chs simple_unlock(slock);
422 1.50 chs } else {
423 1.53 chs KASSERT(write);
424 1.53 chs KASSERT(pageout);
425 1.53 chs
426 1.53 chs /* these pages are now only in swap. */
427 1.53 chs simple_lock(&uvm.swap_data_lock);
428 1.53 chs KASSERT(uvmexp.swpgonly + npages <= uvmexp.swpginuse);
429 1.53 chs uvmexp.swpgonly += npages;
430 1.53 chs simple_unlock(&uvm.swap_data_lock);
431 1.50 chs if (error) {
432 1.50 chs uvm_swap_markbad(swslot, npages);
433 1.50 chs }
434 1.35 chs }
435 1.35 chs s = splbio();
436 1.35 chs if (write && (bp->b_flags & B_AGE) != 0) {
437 1.35 chs vwakeup(bp);
438 1.35 chs }
439 1.35 chs pool_put(&bufpool, bp);
440 1.35 chs splx(s);
441 1.1 mrg }
442