uvm_pager.c revision 1.52 1 1.52 simonb /* $NetBSD: uvm_pager.c,v 1.52 2001/11/06 06:28:22 simonb 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.5 mrg #include "opt_uvmhist.h"
38 1.5 mrg
39 1.1 mrg /*
40 1.1 mrg * uvm_pager.c: generic functions used to assist the pagers.
41 1.1 mrg */
42 1.1 mrg
43 1.1 mrg #include <sys/param.h>
44 1.1 mrg #include <sys/systm.h>
45 1.1 mrg #include <sys/proc.h>
46 1.1 mrg #include <sys/malloc.h>
47 1.35 chs #include <sys/pool.h>
48 1.35 chs #include <sys/vnode.h>
49 1.1 mrg
50 1.1 mrg #define UVM_PAGER
51 1.1 mrg #include <uvm/uvm.h>
52 1.1 mrg
53 1.35 chs struct pool *uvm_aiobuf_pool;
54 1.35 chs
55 1.1 mrg /*
56 1.1 mrg * list of uvm pagers in the system
57 1.1 mrg */
58 1.1 mrg
59 1.1 mrg extern struct uvm_pagerops uvm_deviceops;
60 1.1 mrg extern struct uvm_pagerops uvm_vnodeops;
61 1.35 chs extern struct uvm_pagerops ubc_pager;
62 1.1 mrg
63 1.1 mrg struct uvm_pagerops *uvmpagerops[] = {
64 1.10 thorpej &aobj_pager,
65 1.6 mrg &uvm_deviceops,
66 1.6 mrg &uvm_vnodeops,
67 1.35 chs &ubc_pager,
68 1.1 mrg };
69 1.1 mrg
70 1.1 mrg /*
71 1.1 mrg * the pager map: provides KVA for I/O
72 1.1 mrg */
73 1.1 mrg
74 1.47 chs struct vm_map *pager_map; /* XXX */
75 1.46 chs struct simplelock pager_map_wanted_lock;
76 1.1 mrg boolean_t pager_map_wanted; /* locked by pager map */
77 1.35 chs static vaddr_t emergva;
78 1.35 chs static boolean_t emerginuse;
79 1.1 mrg
80 1.1 mrg /*
81 1.1 mrg * uvm_pager_init: init pagers (at boot time)
82 1.1 mrg */
83 1.1 mrg
84 1.6 mrg void
85 1.6 mrg uvm_pager_init()
86 1.6 mrg {
87 1.6 mrg int lcv;
88 1.50 chs vaddr_t sva, eva;
89 1.1 mrg
90 1.6 mrg /*
91 1.6 mrg * init pager map
92 1.6 mrg */
93 1.6 mrg
94 1.50 chs sva = 0;
95 1.50 chs pager_map = uvm_km_suballoc(kernel_map, &sva, &eva, PAGER_MAP_SIZE, 0,
96 1.50 chs FALSE, NULL);
97 1.35 chs simple_lock_init(&pager_map_wanted_lock);
98 1.35 chs pager_map_wanted = FALSE;
99 1.35 chs emergva = uvm_km_valloc(kernel_map, MAXBSIZE);
100 1.35 chs emerginuse = FALSE;
101 1.6 mrg
102 1.6 mrg /*
103 1.6 mrg * init ASYNC I/O queue
104 1.6 mrg */
105 1.45 chs
106 1.6 mrg TAILQ_INIT(&uvm.aio_done);
107 1.1 mrg
108 1.6 mrg /*
109 1.6 mrg * call pager init functions
110 1.6 mrg */
111 1.6 mrg for (lcv = 0 ; lcv < sizeof(uvmpagerops)/sizeof(struct uvm_pagerops *);
112 1.6 mrg lcv++) {
113 1.6 mrg if (uvmpagerops[lcv]->pgo_init)
114 1.6 mrg uvmpagerops[lcv]->pgo_init();
115 1.6 mrg }
116 1.1 mrg }
117 1.1 mrg
118 1.1 mrg /*
119 1.1 mrg * uvm_pagermapin: map pages into KVA (pager_map) for I/O that needs mappings
120 1.1 mrg *
121 1.1 mrg * we basically just map in a blank map entry to reserve the space in the
122 1.1 mrg * map and then use pmap_enter() to put the mappings in by hand.
123 1.1 mrg */
124 1.1 mrg
125 1.9 eeh vaddr_t
126 1.35 chs uvm_pagermapin(pps, npages, flags)
127 1.6 mrg struct vm_page **pps;
128 1.6 mrg int npages;
129 1.29 thorpej int flags;
130 1.1 mrg {
131 1.9 eeh vsize_t size;
132 1.9 eeh vaddr_t kva;
133 1.9 eeh vaddr_t cva;
134 1.6 mrg struct vm_page *pp;
135 1.29 thorpej vm_prot_t prot;
136 1.6 mrg UVMHIST_FUNC("uvm_pagermapin"); UVMHIST_CALLED(maphist);
137 1.1 mrg
138 1.35 chs UVMHIST_LOG(maphist,"(pps=0x%x, npages=%d)", pps, npages,0,0);
139 1.29 thorpej
140 1.29 thorpej /*
141 1.29 thorpej * compute protection. outgoing I/O only needs read
142 1.29 thorpej * access to the page, whereas incoming needs read/write.
143 1.29 thorpej */
144 1.29 thorpej
145 1.29 thorpej prot = VM_PROT_READ;
146 1.29 thorpej if (flags & UVMPAGER_MAPIN_READ)
147 1.29 thorpej prot |= VM_PROT_WRITE;
148 1.1 mrg
149 1.1 mrg ReStart:
150 1.12 chs size = npages << PAGE_SHIFT;
151 1.29 thorpej kva = 0; /* let system choose VA */
152 1.1 mrg
153 1.45 chs if (uvm_map(pager_map, &kva, size, NULL,
154 1.43 chs UVM_UNKNOWN_OFFSET, 0, UVM_FLAG_NOMERGE) != 0) {
155 1.35 chs if (curproc == uvm.pagedaemon_proc) {
156 1.35 chs simple_lock(&pager_map_wanted_lock);
157 1.35 chs if (emerginuse) {
158 1.35 chs UVM_UNLOCK_AND_WAIT(&emergva,
159 1.35 chs &pager_map_wanted_lock, FALSE,
160 1.35 chs "emergva", 0);
161 1.35 chs goto ReStart;
162 1.35 chs }
163 1.35 chs emerginuse = TRUE;
164 1.35 chs simple_unlock(&pager_map_wanted_lock);
165 1.35 chs kva = emergva;
166 1.35 chs KASSERT(npages <= MAXBSIZE >> PAGE_SHIFT);
167 1.35 chs goto enter;
168 1.35 chs }
169 1.29 thorpej if ((flags & UVMPAGER_MAPIN_WAITOK) == 0) {
170 1.6 mrg UVMHIST_LOG(maphist,"<- NOWAIT failed", 0,0,0,0);
171 1.29 thorpej return(0);
172 1.6 mrg }
173 1.6 mrg simple_lock(&pager_map_wanted_lock);
174 1.45 chs pager_map_wanted = TRUE;
175 1.6 mrg UVMHIST_LOG(maphist, " SLEEPING on pager_map",0,0,0,0);
176 1.45 chs UVM_UNLOCK_AND_WAIT(pager_map, &pager_map_wanted_lock, FALSE,
177 1.35 chs "pager_map", 0);
178 1.6 mrg goto ReStart;
179 1.6 mrg }
180 1.1 mrg
181 1.35 chs enter:
182 1.6 mrg /* got it */
183 1.6 mrg for (cva = kva ; size != 0 ; size -= PAGE_SIZE, cva += PAGE_SIZE) {
184 1.6 mrg pp = *pps++;
185 1.40 mrg KASSERT(pp);
186 1.38 chs KASSERT(pp->flags & PG_BUSY);
187 1.50 chs pmap_kenter_pa(cva, VM_PAGE_TO_PHYS(pp), prot);
188 1.6 mrg }
189 1.49 chris pmap_update(vm_map_pmap(pager_map));
190 1.1 mrg
191 1.6 mrg UVMHIST_LOG(maphist, "<- done (KVA=0x%x)", kva,0,0,0);
192 1.6 mrg return(kva);
193 1.1 mrg }
194 1.1 mrg
195 1.1 mrg /*
196 1.1 mrg * uvm_pagermapout: remove pager_map mapping
197 1.1 mrg *
198 1.1 mrg * we remove our mappings by hand and then remove the mapping (waking
199 1.1 mrg * up anyone wanting space).
200 1.1 mrg */
201 1.1 mrg
202 1.6 mrg void
203 1.6 mrg uvm_pagermapout(kva, npages)
204 1.9 eeh vaddr_t kva;
205 1.6 mrg int npages;
206 1.6 mrg {
207 1.12 chs vsize_t size = npages << PAGE_SHIFT;
208 1.47 chs struct vm_map_entry *entries;
209 1.6 mrg UVMHIST_FUNC("uvm_pagermapout"); UVMHIST_CALLED(maphist);
210 1.35 chs
211 1.6 mrg UVMHIST_LOG(maphist, " (kva=0x%x, npages=%d)", kva, npages,0,0);
212 1.1 mrg
213 1.6 mrg /*
214 1.6 mrg * duplicate uvm_unmap, but add in pager_map_wanted handling.
215 1.6 mrg */
216 1.6 mrg
217 1.50 chs pmap_kremove(kva, npages << PAGE_SHIFT);
218 1.35 chs if (kva == emergva) {
219 1.35 chs simple_lock(&pager_map_wanted_lock);
220 1.35 chs emerginuse = FALSE;
221 1.35 chs wakeup(&emergva);
222 1.35 chs simple_unlock(&pager_map_wanted_lock);
223 1.50 chs return;
224 1.35 chs }
225 1.35 chs
226 1.6 mrg vm_map_lock(pager_map);
227 1.43 chs uvm_unmap_remove(pager_map, kva, kva + size, &entries);
228 1.6 mrg simple_lock(&pager_map_wanted_lock);
229 1.6 mrg if (pager_map_wanted) {
230 1.6 mrg pager_map_wanted = FALSE;
231 1.6 mrg wakeup(pager_map);
232 1.6 mrg }
233 1.6 mrg simple_unlock(&pager_map_wanted_lock);
234 1.6 mrg vm_map_unlock(pager_map);
235 1.6 mrg if (entries)
236 1.6 mrg uvm_unmap_detach(entries, 0);
237 1.49 chris pmap_update(pmap_kernel());
238 1.6 mrg UVMHIST_LOG(maphist,"<- done",0,0,0,0);
239 1.1 mrg }
240 1.1 mrg
241 1.1 mrg /*
242 1.35 chs * interrupt-context iodone handler for nested i/o bufs.
243 1.35 chs *
244 1.35 chs * => must be at splbio().
245 1.35 chs */
246 1.35 chs
247 1.35 chs void
248 1.35 chs uvm_aio_biodone1(bp)
249 1.35 chs struct buf *bp;
250 1.35 chs {
251 1.35 chs struct buf *mbp = bp->b_private;
252 1.35 chs
253 1.35 chs KASSERT(mbp != bp);
254 1.35 chs if (bp->b_flags & B_ERROR) {
255 1.35 chs mbp->b_flags |= B_ERROR;
256 1.35 chs mbp->b_error = bp->b_error;
257 1.35 chs }
258 1.35 chs mbp->b_resid -= bp->b_bcount;
259 1.35 chs pool_put(&bufpool, bp);
260 1.35 chs if (mbp->b_resid == 0) {
261 1.35 chs biodone(mbp);
262 1.35 chs }
263 1.35 chs }
264 1.35 chs
265 1.35 chs /*
266 1.35 chs * interrupt-context iodone handler for single-buf i/os
267 1.35 chs * or the top-level buf of a nested-buf i/o.
268 1.35 chs *
269 1.35 chs * => must be at splbio().
270 1.35 chs */
271 1.35 chs
272 1.35 chs void
273 1.35 chs uvm_aio_biodone(bp)
274 1.35 chs struct buf *bp;
275 1.35 chs {
276 1.35 chs /* reset b_iodone for when this is a single-buf i/o. */
277 1.35 chs bp->b_iodone = uvm_aio_aiodone;
278 1.35 chs
279 1.35 chs simple_lock(&uvm.aiodoned_lock); /* locks uvm.aio_done */
280 1.35 chs TAILQ_INSERT_TAIL(&uvm.aio_done, bp, b_freelist);
281 1.35 chs wakeup(&uvm.aiodoned);
282 1.35 chs simple_unlock(&uvm.aiodoned_lock);
283 1.35 chs }
284 1.35 chs
285 1.35 chs /*
286 1.35 chs * uvm_aio_aiodone: do iodone processing for async i/os.
287 1.35 chs * this should be called in thread context, not interrupt context.
288 1.35 chs */
289 1.35 chs
290 1.35 chs void
291 1.35 chs uvm_aio_aiodone(bp)
292 1.35 chs struct buf *bp;
293 1.35 chs {
294 1.35 chs int npages = bp->b_bufsize >> PAGE_SHIFT;
295 1.35 chs struct vm_page *pg, *pgs[npages];
296 1.35 chs struct uvm_object *uobj;
297 1.50 chs struct simplelock *slock;
298 1.50 chs int s, i, error, swslot;
299 1.52 simonb boolean_t write, swap, pageout;
300 1.35 chs UVMHIST_FUNC("uvm_aio_aiodone"); UVMHIST_CALLED(ubchist);
301 1.35 chs UVMHIST_LOG(ubchist, "bp %p", bp, 0,0,0);
302 1.35 chs
303 1.41 chs error = (bp->b_flags & B_ERROR) ? (bp->b_error ? bp->b_error : EIO) : 0;
304 1.35 chs write = (bp->b_flags & B_READ) == 0;
305 1.35 chs /* XXXUBC B_NOCACHE is for swap pager, should be done differently */
306 1.36 chs if (write && !(bp->b_flags & B_NOCACHE) && bioops.io_pageiodone) {
307 1.36 chs (*bioops.io_pageiodone)(bp);
308 1.35 chs }
309 1.35 chs
310 1.35 chs uobj = NULL;
311 1.35 chs for (i = 0; i < npages; i++) {
312 1.35 chs pgs[i] = uvm_pageratop((vaddr_t)bp->b_data + (i << PAGE_SHIFT));
313 1.35 chs UVMHIST_LOG(ubchist, "pgs[%d] = %p", i, pgs[i],0,0);
314 1.35 chs }
315 1.35 chs uvm_pagermapout((vaddr_t)bp->b_data, npages);
316 1.50 chs
317 1.50 chs swap = (pgs[0]->pqflags & PQ_SWAPBACKED) != 0;
318 1.50 chs swslot = 0;
319 1.50 chs slock = NULL;
320 1.50 chs pageout = (pgs[0]->flags & PG_PAGEOUT) != 0;
321 1.50 chs if (!swap) {
322 1.50 chs uobj = pgs[0]->uobject;
323 1.50 chs slock = &uobj->vmobjlock;
324 1.50 chs simple_lock(slock);
325 1.50 chs uvm_lock_pageq();
326 1.50 chs } else if (error) {
327 1.51 chs pg = pgs[0];
328 1.51 chs if (pg->pqflags & PQ_ANON) {
329 1.50 chs swslot = pg->uanon->an_swslot;
330 1.50 chs } else {
331 1.50 chs swslot = uao_find_swslot(pg->uobject, pg->offset);
332 1.50 chs }
333 1.50 chs KASSERT(swslot);
334 1.50 chs }
335 1.35 chs for (i = 0; i < npages; i++) {
336 1.35 chs pg = pgs[i];
337 1.50 chs KASSERT(swap || pg->uobject == uobj);
338 1.50 chs KASSERT(pageout ^ ((pg->flags & PG_PAGEOUT) == 0));
339 1.50 chs UVMHIST_LOG(ubchist, "pg %p", pg, 0,0,0);
340 1.50 chs
341 1.50 chs /*
342 1.50 chs * for swap i/os, lock each page's object (or anon)
343 1.50 chs * individually since each page may need a different lock.
344 1.50 chs */
345 1.35 chs
346 1.35 chs if (swap) {
347 1.35 chs if (pg->pqflags & PQ_ANON) {
348 1.50 chs slock = &pg->uanon->an_lock;
349 1.35 chs } else {
350 1.50 chs slock = &pg->uobject->vmobjlock;
351 1.35 chs }
352 1.50 chs simple_lock(slock);
353 1.50 chs uvm_lock_pageq();
354 1.50 chs }
355 1.50 chs
356 1.50 chs /*
357 1.50 chs * process errors. for reads, just mark the page to be freed.
358 1.50 chs * for writes, if the error was ENOMEM, we assume this was
359 1.50 chs * a transient failure so we mark the page dirty so that
360 1.50 chs * we'll try to write it again later. for all other write
361 1.50 chs * errors, we assume the error is permanent, thus the data
362 1.50 chs * in the page is lost. bummer.
363 1.50 chs */
364 1.50 chs
365 1.50 chs if (error) {
366 1.50 chs if (!write) {
367 1.50 chs KASSERT(!swap);
368 1.50 chs pg->flags |= PG_RELEASED;
369 1.50 chs continue;
370 1.50 chs } else if (error == ENOMEM) {
371 1.50 chs if (pg->flags & PG_PAGEOUT) {
372 1.50 chs pg->flags &= ~PG_PAGEOUT;
373 1.50 chs uvmexp.paging--;
374 1.50 chs }
375 1.50 chs pg->flags &= ~PG_CLEAN;
376 1.50 chs uvm_pageactivate(pg);
377 1.50 chs }
378 1.50 chs }
379 1.50 chs
380 1.50 chs /*
381 1.50 chs * if the page is PG_FAKE, this must have been a read to
382 1.50 chs * initialize the page. clear PG_FAKE and activate the page.
383 1.50 chs */
384 1.50 chs
385 1.50 chs if (pg->flags & PG_FAKE) {
386 1.50 chs KASSERT(!write);
387 1.50 chs pg->flags &= ~PG_FAKE;
388 1.50 chs uvm_pageactivate(pg);
389 1.50 chs pmap_clear_modify(pg);
390 1.35 chs }
391 1.35 chs
392 1.35 chs /*
393 1.50 chs * for async reads, this may be the first time the page
394 1.50 chs * is unlocked after being created, so we need to be sure
395 1.50 chs * the page is on a paging queue.
396 1.35 chs */
397 1.35 chs
398 1.50 chs if (!write) {
399 1.50 chs uvm_pageactivate(pg);
400 1.50 chs } else if (pg->flags & PG_PAGEOUT) {
401 1.50 chs pg->flags &= ~PG_PAGEOUT;
402 1.50 chs uvmexp.paging--;
403 1.35 chs pg->flags |= PG_RELEASED;
404 1.35 chs }
405 1.35 chs
406 1.35 chs /*
407 1.50 chs * for swap pages, unlock everything for this page now.
408 1.35 chs */
409 1.35 chs
410 1.35 chs if (swap) {
411 1.50 chs uvm_page_unbusy(&pg, 1);
412 1.50 chs uvm_unlock_pageq();
413 1.50 chs simple_unlock(slock);
414 1.35 chs }
415 1.35 chs }
416 1.35 chs if (!swap) {
417 1.50 chs uvm_page_unbusy(pgs, npages);
418 1.50 chs uvm_unlock_pageq();
419 1.50 chs simple_unlock(slock);
420 1.50 chs } else {
421 1.50 chs KASSERT(write && pageout);
422 1.50 chs if (error) {
423 1.50 chs uvm_swap_markbad(swslot, npages);
424 1.50 chs }
425 1.35 chs }
426 1.35 chs s = splbio();
427 1.35 chs if (write && (bp->b_flags & B_AGE) != 0) {
428 1.35 chs vwakeup(bp);
429 1.35 chs }
430 1.35 chs pool_put(&bufpool, bp);
431 1.35 chs splx(s);
432 1.1 mrg }
433