uvm_pager.c revision 1.13.2.3 1 1.13.2.3 chs /* $NetBSD: uvm_pager.c,v 1.13.2.3 1999/04/09 04:39:39 chs Exp $ */
2 1.1 mrg
3 1.1 mrg /*
4 1.1 mrg * XXXCDC: "ROUGH DRAFT" QUALITY UVM PRE-RELEASE FILE!
5 1.1 mrg * >>>USE AT YOUR OWN RISK, WORK IS NOT FINISHED<<<
6 1.1 mrg */
7 1.1 mrg /*
8 1.1 mrg *
9 1.1 mrg * Copyright (c) 1997 Charles D. Cranor and Washington University.
10 1.1 mrg * All rights reserved.
11 1.1 mrg *
12 1.1 mrg * Redistribution and use in source and binary forms, with or without
13 1.1 mrg * modification, are permitted provided that the following conditions
14 1.1 mrg * are met:
15 1.1 mrg * 1. Redistributions of source code must retain the above copyright
16 1.1 mrg * notice, this list of conditions and the following disclaimer.
17 1.1 mrg * 2. Redistributions in binary form must reproduce the above copyright
18 1.1 mrg * notice, this list of conditions and the following disclaimer in the
19 1.1 mrg * documentation and/or other materials provided with the distribution.
20 1.1 mrg * 3. All advertising materials mentioning features or use of this software
21 1.1 mrg * must display the following acknowledgement:
22 1.1 mrg * This product includes software developed by Charles D. Cranor and
23 1.1 mrg * Washington University.
24 1.1 mrg * 4. The name of the author may not be used to endorse or promote products
25 1.1 mrg * derived from this software without specific prior written permission.
26 1.1 mrg *
27 1.1 mrg * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
28 1.1 mrg * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
29 1.1 mrg * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
30 1.1 mrg * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
31 1.1 mrg * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
32 1.1 mrg * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
33 1.1 mrg * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
34 1.1 mrg * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
35 1.1 mrg * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
36 1.1 mrg * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
37 1.3 mrg *
38 1.3 mrg * from: Id: uvm_pager.c,v 1.1.2.23 1998/02/02 20:38:06 chuck Exp
39 1.1 mrg */
40 1.1 mrg
41 1.5 mrg #include "opt_pmap_new.h"
42 1.5 mrg
43 1.1 mrg /*
44 1.1 mrg * uvm_pager.c: generic functions used to assist the pagers.
45 1.1 mrg */
46 1.1 mrg
47 1.1 mrg #include <sys/param.h>
48 1.1 mrg #include <sys/systm.h>
49 1.1 mrg #include <sys/proc.h>
50 1.1 mrg #include <sys/malloc.h>
51 1.13.2.2 chs #include <sys/pool.h>
52 1.1 mrg
53 1.1 mrg #include <vm/vm.h>
54 1.1 mrg #include <vm/vm_page.h>
55 1.1 mrg #include <vm/vm_kern.h>
56 1.1 mrg
57 1.1 mrg #define UVM_PAGER
58 1.1 mrg #include <uvm/uvm.h>
59 1.1 mrg
60 1.13.2.2 chs struct pool *uvm_aiobuf_pool;
61 1.13.2.2 chs
62 1.1 mrg /*
63 1.1 mrg * list of uvm pagers in the system
64 1.1 mrg */
65 1.1 mrg
66 1.10 thorpej extern struct uvm_pagerops aobj_pager;
67 1.1 mrg extern struct uvm_pagerops uvm_deviceops;
68 1.1 mrg extern struct uvm_pagerops uvm_vnodeops;
69 1.13.2.1 chs #ifdef UBC
70 1.13.2.1 chs extern struct uvm_pagerops ubc_pager;
71 1.13.2.1 chs #endif
72 1.1 mrg
73 1.1 mrg struct uvm_pagerops *uvmpagerops[] = {
74 1.10 thorpej &aobj_pager,
75 1.6 mrg &uvm_deviceops,
76 1.6 mrg &uvm_vnodeops,
77 1.13.2.1 chs #ifdef UBC
78 1.13.2.1 chs &ubc_pager,
79 1.13.2.1 chs #endif
80 1.1 mrg };
81 1.1 mrg
82 1.1 mrg /*
83 1.1 mrg * the pager map: provides KVA for I/O
84 1.1 mrg */
85 1.1 mrg
86 1.1 mrg #define PAGER_MAP_SIZE (4 * 1024 * 1024)
87 1.1 mrg vm_map_t pager_map; /* XXX */
88 1.1 mrg simple_lock_data_t pager_map_wanted_lock;
89 1.1 mrg boolean_t pager_map_wanted; /* locked by pager map */
90 1.1 mrg
91 1.1 mrg
92 1.1 mrg /*
93 1.1 mrg * uvm_pager_init: init pagers (at boot time)
94 1.1 mrg */
95 1.1 mrg
96 1.6 mrg void
97 1.6 mrg uvm_pager_init()
98 1.6 mrg {
99 1.6 mrg int lcv;
100 1.1 mrg
101 1.6 mrg /*
102 1.6 mrg * init pager map
103 1.6 mrg */
104 1.6 mrg
105 1.13.2.2 chs pager_map = uvm_km_suballoc(kernel_map, &uvm.pager_sva, &uvm.pager_eva,
106 1.13.2.2 chs PAGER_MAP_SIZE, FALSE, FALSE, NULL);
107 1.13.2.2 chs simple_lock_init(&pager_map_wanted_lock);
108 1.13.2.2 chs pager_map_wanted = FALSE;
109 1.6 mrg
110 1.6 mrg /*
111 1.6 mrg * init ASYNC I/O queue
112 1.6 mrg */
113 1.6 mrg
114 1.6 mrg TAILQ_INIT(&uvm.aio_done);
115 1.13.2.2 chs uvm_aiobuf_pool = pool_create(sizeof(struct uvm_aiobuf),
116 1.13.2.2 chs 0, 0, 0, "aiobuf", 0, NULL, NULL, 0);
117 1.13.2.2 chs
118 1.1 mrg
119 1.6 mrg /*
120 1.6 mrg * call pager init functions
121 1.6 mrg */
122 1.6 mrg for (lcv = 0 ; lcv < sizeof(uvmpagerops)/sizeof(struct uvm_pagerops *);
123 1.6 mrg lcv++) {
124 1.6 mrg if (uvmpagerops[lcv]->pgo_init)
125 1.6 mrg uvmpagerops[lcv]->pgo_init();
126 1.6 mrg }
127 1.1 mrg }
128 1.1 mrg
129 1.1 mrg /*
130 1.1 mrg * uvm_pagermapin: map pages into KVA (pager_map) for I/O that needs mappings
131 1.1 mrg *
132 1.1 mrg * we basically just map in a blank map entry to reserve the space in the
133 1.1 mrg * map and then use pmap_enter() to put the mappings in by hand.
134 1.1 mrg */
135 1.1 mrg
136 1.9 eeh vaddr_t
137 1.6 mrg uvm_pagermapin(pps, npages, aiop, waitf)
138 1.6 mrg struct vm_page **pps;
139 1.6 mrg int npages;
140 1.6 mrg struct uvm_aiodesc **aiop; /* OUT */
141 1.6 mrg int waitf;
142 1.1 mrg {
143 1.9 eeh vsize_t size;
144 1.9 eeh vaddr_t kva;
145 1.6 mrg struct uvm_aiodesc *aio;
146 1.1 mrg #if !defined(PMAP_NEW)
147 1.9 eeh vaddr_t cva;
148 1.6 mrg struct vm_page *pp;
149 1.1 mrg #endif
150 1.6 mrg UVMHIST_FUNC("uvm_pagermapin"); UVMHIST_CALLED(maphist);
151 1.1 mrg
152 1.6 mrg UVMHIST_LOG(maphist,"(pps=0x%x, npages=%d, aiop=0x%x, waitf=%d)",
153 1.1 mrg pps, npages, aiop, waitf);
154 1.1 mrg
155 1.1 mrg ReStart:
156 1.6 mrg if (aiop) {
157 1.6 mrg MALLOC(aio, struct uvm_aiodesc *, sizeof(*aio), M_TEMP, waitf);
158 1.6 mrg if (aio == NULL)
159 1.6 mrg return(0);
160 1.6 mrg *aiop = aio;
161 1.6 mrg } else {
162 1.6 mrg aio = NULL;
163 1.6 mrg }
164 1.1 mrg
165 1.12 chs size = npages << PAGE_SHIFT;
166 1.6 mrg kva = NULL; /* let system choose VA */
167 1.1 mrg
168 1.6 mrg if (uvm_map(pager_map, &kva, size, NULL,
169 1.1 mrg UVM_UNKNOWN_OFFSET, UVM_FLAG_NOMERGE) != KERN_SUCCESS) {
170 1.6 mrg if (waitf == M_NOWAIT) {
171 1.6 mrg if (aio)
172 1.6 mrg FREE(aio, M_TEMP);
173 1.6 mrg UVMHIST_LOG(maphist,"<- NOWAIT failed", 0,0,0,0);
174 1.6 mrg return(NULL);
175 1.6 mrg }
176 1.6 mrg simple_lock(&pager_map_wanted_lock);
177 1.6 mrg pager_map_wanted = TRUE;
178 1.6 mrg UVMHIST_LOG(maphist, " SLEEPING on pager_map",0,0,0,0);
179 1.6 mrg UVM_UNLOCK_AND_WAIT(pager_map, &pager_map_wanted_lock, FALSE,
180 1.6 mrg "pager_map",0);
181 1.6 mrg goto ReStart;
182 1.6 mrg }
183 1.1 mrg
184 1.1 mrg #if defined(PMAP_NEW)
185 1.6 mrg /*
186 1.6 mrg * XXX: (ab)using the pmap module to store state info for us.
187 1.6 mrg * (pmap stores the PAs... we fetch them back later and convert back
188 1.6 mrg * to pages with PHYS_TO_VM_PAGE).
189 1.6 mrg */
190 1.6 mrg pmap_kenter_pgs(kva, pps, npages);
191 1.1 mrg
192 1.1 mrg #else /* PMAP_NEW */
193 1.1 mrg
194 1.6 mrg /* got it */
195 1.6 mrg for (cva = kva ; size != 0 ; size -= PAGE_SIZE, cva += PAGE_SIZE) {
196 1.6 mrg pp = *pps++;
197 1.1 mrg #ifdef DEBUG
198 1.6 mrg if ((pp->flags & PG_BUSY) == 0)
199 1.6 mrg panic("uvm_pagermapin: page not busy");
200 1.1 mrg #endif
201 1.1 mrg
202 1.6 mrg pmap_enter(vm_map_pmap(pager_map), cva, VM_PAGE_TO_PHYS(pp),
203 1.6 mrg VM_PROT_DEFAULT, TRUE);
204 1.6 mrg }
205 1.1 mrg
206 1.1 mrg #endif /* PMAP_NEW */
207 1.1 mrg
208 1.6 mrg UVMHIST_LOG(maphist, "<- done (KVA=0x%x)", kva,0,0,0);
209 1.6 mrg return(kva);
210 1.1 mrg }
211 1.1 mrg
212 1.1 mrg /*
213 1.1 mrg * uvm_pagermapout: remove pager_map mapping
214 1.1 mrg *
215 1.1 mrg * we remove our mappings by hand and then remove the mapping (waking
216 1.1 mrg * up anyone wanting space).
217 1.1 mrg */
218 1.1 mrg
219 1.6 mrg void
220 1.6 mrg uvm_pagermapout(kva, npages)
221 1.9 eeh vaddr_t kva;
222 1.6 mrg int npages;
223 1.6 mrg {
224 1.12 chs vsize_t size = npages << PAGE_SHIFT;
225 1.6 mrg vm_map_entry_t entries;
226 1.6 mrg UVMHIST_FUNC("uvm_pagermapout"); UVMHIST_CALLED(maphist);
227 1.6 mrg
228 1.6 mrg UVMHIST_LOG(maphist, " (kva=0x%x, npages=%d)", kva, npages,0,0);
229 1.1 mrg
230 1.6 mrg /*
231 1.6 mrg * duplicate uvm_unmap, but add in pager_map_wanted handling.
232 1.6 mrg */
233 1.6 mrg
234 1.6 mrg vm_map_lock(pager_map);
235 1.11 chuck (void) uvm_unmap_remove(pager_map, kva, kva + size, &entries);
236 1.6 mrg simple_lock(&pager_map_wanted_lock);
237 1.6 mrg if (pager_map_wanted) {
238 1.6 mrg pager_map_wanted = FALSE;
239 1.6 mrg wakeup(pager_map);
240 1.6 mrg }
241 1.6 mrg simple_unlock(&pager_map_wanted_lock);
242 1.6 mrg vm_map_unlock(pager_map);
243 1.6 mrg if (entries)
244 1.6 mrg uvm_unmap_detach(entries, 0);
245 1.1 mrg
246 1.6 mrg UVMHIST_LOG(maphist,"<- done",0,0,0,0);
247 1.1 mrg }
248 1.1 mrg
249 1.1 mrg /*
250 1.1 mrg * uvm_mk_pcluster
251 1.1 mrg *
252 1.1 mrg * generic "make 'pager put' cluster" function. a pager can either
253 1.1 mrg * [1] set pgo_mk_pcluster to NULL (never cluster), [2] set it to this
254 1.1 mrg * generic function, or [3] set it to a pager specific function.
255 1.1 mrg *
256 1.1 mrg * => caller must lock object _and_ pagequeues (since we need to look
257 1.1 mrg * at active vs. inactive bits, etc.)
258 1.1 mrg * => caller must make center page busy and write-protect it
259 1.1 mrg * => we mark all cluster pages busy for the caller
260 1.1 mrg * => the caller must unbusy all pages (and check wanted/released
261 1.1 mrg * status if it drops the object lock)
262 1.1 mrg * => flags:
263 1.1 mrg * PGO_ALLPAGES: all pages in object are valid targets
264 1.1 mrg * !PGO_ALLPAGES: use "lo" and "hi" to limit range of cluster
265 1.1 mrg * PGO_DOACTCLUST: include active pages in cluster.
266 1.1 mrg * NOTE: the caller should clear PG_CLEANCHK bits if PGO_DOACTCLUST.
267 1.1 mrg * PG_CLEANCHK is only a hint, but clearing will help reduce
268 1.1 mrg * the number of calls we make to the pmap layer.
269 1.1 mrg */
270 1.1 mrg
271 1.6 mrg struct vm_page **
272 1.6 mrg uvm_mk_pcluster(uobj, pps, npages, center, flags, mlo, mhi)
273 1.6 mrg struct uvm_object *uobj; /* IN */
274 1.6 mrg struct vm_page **pps, *center; /* IN/OUT, IN */
275 1.6 mrg int *npages, flags; /* IN/OUT, IN */
276 1.9 eeh vaddr_t mlo, mhi; /* IN (if !PGO_ALLPAGES) */
277 1.1 mrg {
278 1.6 mrg struct vm_page **ppsp, *pclust;
279 1.9 eeh vaddr_t lo, hi, curoff;
280 1.13.2.2 chs int center_idx, forward, incr;
281 1.6 mrg UVMHIST_FUNC("uvm_mk_pcluster"); UVMHIST_CALLED(maphist);
282 1.6 mrg
283 1.6 mrg /*
284 1.6 mrg * center page should already be busy and write protected. XXX:
285 1.6 mrg * suppose page is wired? if we lock, then a process could
286 1.6 mrg * fault/block on it. if we don't lock, a process could write the
287 1.6 mrg * pages in the middle of an I/O. (consider an msync()). let's
288 1.6 mrg * lock it for now (better to delay than corrupt data?).
289 1.6 mrg */
290 1.6 mrg
291 1.6 mrg /*
292 1.6 mrg * get cluster boundaries, check sanity, and apply our limits as well.
293 1.6 mrg */
294 1.6 mrg
295 1.6 mrg uobj->pgops->pgo_cluster(uobj, center->offset, &lo, &hi);
296 1.6 mrg if ((flags & PGO_ALLPAGES) == 0) {
297 1.6 mrg if (lo < mlo)
298 1.6 mrg lo = mlo;
299 1.6 mrg if (hi > mhi)
300 1.6 mrg hi = mhi;
301 1.6 mrg }
302 1.13.2.1 chs if ((hi - lo) >> PAGE_SHIFT > *npages) { /* pps too small, bail out! */
303 1.1 mrg #ifdef DIAGNOSTIC
304 1.6 mrg printf("uvm_mk_pcluster: provided page array too small (fixed)\n");
305 1.1 mrg #endif
306 1.6 mrg pps[0] = center;
307 1.6 mrg *npages = 1;
308 1.6 mrg return(pps);
309 1.6 mrg }
310 1.6 mrg
311 1.6 mrg /*
312 1.6 mrg * now determine the center and attempt to cluster around the
313 1.6 mrg * edges
314 1.6 mrg */
315 1.6 mrg
316 1.12 chs center_idx = (center->offset - lo) >> PAGE_SHIFT;
317 1.6 mrg pps[center_idx] = center; /* plug in the center page */
318 1.6 mrg ppsp = &pps[center_idx];
319 1.6 mrg *npages = 1;
320 1.13.2.2 chs
321 1.6 mrg /*
322 1.6 mrg * attempt to cluster around the left [backward], and then
323 1.6 mrg * the right side [forward].
324 1.6 mrg *
325 1.6 mrg * note that for inactive pages (pages that have been deactivated)
326 1.6 mrg * there are no valid mappings and PG_CLEAN should be up to date.
327 1.6 mrg * [i.e. there is no need to query the pmap with pmap_is_modified
328 1.6 mrg * since there are no mappings].
329 1.6 mrg */
330 1.6 mrg
331 1.6 mrg for (forward = 0 ; forward <= 1 ; forward++) {
332 1.13.2.2 chs incr = forward ? PAGE_SIZE : -PAGE_SIZE;
333 1.13.2.2 chs curoff = center->offset + incr;
334 1.6 mrg for ( ;(forward == 0 && curoff >= lo) ||
335 1.12 chs (forward && curoff < hi);
336 1.13.2.2 chs curoff += incr) {
337 1.6 mrg
338 1.6 mrg pclust = uvm_pagelookup(uobj, curoff); /* lookup page */
339 1.13.2.2 chs if (pclust == NULL) {
340 1.6 mrg break; /* no page */
341 1.13.2.2 chs }
342 1.6 mrg /* handle active pages */
343 1.6 mrg /* NOTE: inactive pages don't have pmap mappings */
344 1.6 mrg if ((pclust->pqflags & PQ_INACTIVE) == 0) {
345 1.13.2.2 chs if ((flags & PGO_DOACTCLUST) == 0) {
346 1.6 mrg /* dont want mapped pages at all */
347 1.6 mrg break;
348 1.13.2.2 chs }
349 1.6 mrg
350 1.6 mrg /* make sure "clean" bit is sync'd */
351 1.6 mrg if ((pclust->flags & PG_CLEANCHK) == 0) {
352 1.6 mrg if ((pclust->flags & (PG_CLEAN|PG_BUSY))
353 1.6 mrg == PG_CLEAN &&
354 1.6 mrg pmap_is_modified(PMAP_PGARG(pclust)))
355 1.6 mrg pclust->flags &= ~PG_CLEAN;
356 1.6 mrg /* now checked */
357 1.6 mrg pclust->flags |= PG_CLEANCHK;
358 1.6 mrg }
359 1.6 mrg }
360 1.13.2.2 chs
361 1.6 mrg /* is page available for cleaning and does it need it */
362 1.13.2.2 chs if ((pclust->flags & (PG_CLEAN|PG_BUSY)) != 0) {
363 1.6 mrg break; /* page is already clean or is busy */
364 1.13.2.2 chs }
365 1.13.2.2 chs
366 1.13.2.2 chs #ifdef UBC
367 1.13.2.2 chs /* XXX assumes blkno in units of DEV_BSIZE */
368 1.13.2.2 chs /* check physical adjacency too */
369 1.13.2.2 chs if (pclust->blkno != center->blkno +
370 1.13.2.2 chs ((pclust->offset - center->offset) >> DEV_BSHIFT)) {
371 1.13.2.2 chs break;
372 1.13.2.2 chs }
373 1.13.2.2 chs #endif
374 1.6 mrg
375 1.6 mrg /* yes! enroll the page in our array */
376 1.6 mrg pclust->flags |= PG_BUSY; /* busy! */
377 1.6 mrg UVM_PAGE_OWN(pclust, "uvm_mk_pcluster");
378 1.13.2.2 chs
379 1.6 mrg /* XXX: protect wired page? see above comment. */
380 1.6 mrg pmap_page_protect(PMAP_PGARG(pclust), VM_PROT_READ);
381 1.6 mrg if (!forward) {
382 1.6 mrg ppsp--; /* back up one page */
383 1.6 mrg *ppsp = pclust;
384 1.6 mrg } else {
385 1.6 mrg /* move forward one page */
386 1.6 mrg ppsp[*npages] = pclust;
387 1.6 mrg }
388 1.13.2.2 chs (*npages)++;
389 1.6 mrg }
390 1.6 mrg }
391 1.6 mrg
392 1.6 mrg /*
393 1.6 mrg * done! return the cluster array to the caller!!!
394 1.6 mrg */
395 1.1 mrg
396 1.6 mrg UVMHIST_LOG(maphist, "<- done",0,0,0,0);
397 1.6 mrg return(ppsp);
398 1.1 mrg }
399 1.1 mrg
400 1.1 mrg
401 1.1 mrg /*
402 1.1 mrg * uvm_shareprot: generic share protect routine
403 1.1 mrg *
404 1.1 mrg * => caller must lock map entry's map
405 1.1 mrg * => caller must lock object pointed to by map entry
406 1.1 mrg */
407 1.1 mrg
408 1.6 mrg void
409 1.6 mrg uvm_shareprot(entry, prot)
410 1.6 mrg vm_map_entry_t entry;
411 1.6 mrg vm_prot_t prot;
412 1.1 mrg {
413 1.6 mrg struct uvm_object *uobj = entry->object.uvm_obj;
414 1.6 mrg struct vm_page *pp;
415 1.9 eeh vaddr_t start, stop;
416 1.6 mrg UVMHIST_FUNC("uvm_shareprot"); UVMHIST_CALLED(maphist);
417 1.6 mrg
418 1.11 chuck if (UVM_ET_ISSUBMAP(entry))
419 1.6 mrg panic("uvm_shareprot: non-object attached");
420 1.6 mrg
421 1.6 mrg start = entry->offset;
422 1.6 mrg stop = start + (entry->end - entry->start);
423 1.6 mrg
424 1.6 mrg /*
425 1.6 mrg * traverse list of pages in object. if page in range, pmap_prot it
426 1.6 mrg */
427 1.6 mrg
428 1.6 mrg for (pp = uobj->memq.tqh_first ; pp != NULL ; pp = pp->listq.tqe_next) {
429 1.6 mrg if (pp->offset >= start && pp->offset < stop)
430 1.6 mrg pmap_page_protect(PMAP_PGARG(pp), prot);
431 1.6 mrg }
432 1.6 mrg UVMHIST_LOG(maphist, "<- done",0,0,0,0);
433 1.1 mrg }
434 1.1 mrg
435 1.1 mrg /*
436 1.1 mrg * uvm_pager_put: high level pageout routine
437 1.1 mrg *
438 1.1 mrg * we want to pageout page "pg" to backing store, clustering if
439 1.1 mrg * possible.
440 1.1 mrg *
441 1.1 mrg * => page queues must be locked by caller
442 1.1 mrg * => if page is not swap-backed, then "uobj" points to the object
443 1.1 mrg * backing it. this object should be locked by the caller.
444 1.1 mrg * => if page is swap-backed, then "uobj" should be NULL.
445 1.1 mrg * => "pg" should be PG_BUSY (by caller), and !PG_CLEAN
446 1.1 mrg * for swap-backed memory, "pg" can be NULL if there is no page
447 1.1 mrg * of interest [sometimes the case for the pagedaemon]
448 1.1 mrg * => "ppsp_ptr" should point to an array of npages vm_page pointers
449 1.1 mrg * for possible cluster building
450 1.1 mrg * => flags (first two for non-swap-backed pages)
451 1.1 mrg * PGO_ALLPAGES: all pages in uobj are valid targets
452 1.1 mrg * PGO_DOACTCLUST: include "PQ_ACTIVE" pages as valid targets
453 1.1 mrg * PGO_SYNCIO: do SYNC I/O (no async)
454 1.1 mrg * PGO_PDFREECLUST: pagedaemon: drop cluster on successful I/O
455 1.1 mrg * => start/stop: if (uobj && !PGO_ALLPAGES) limit targets to this range
456 1.1 mrg * if (!uobj) start is the (daddr_t) of the starting swapblk
457 1.1 mrg * => return state:
458 1.1 mrg * 1. we return the VM_PAGER status code of the pageout
459 1.1 mrg * 2. we return with the page queues unlocked
460 1.1 mrg * 3. if (uobj != NULL) [!swap_backed] we return with
461 1.1 mrg * uobj locked _only_ if PGO_PDFREECLUST is set
462 1.1 mrg * AND result != VM_PAGER_PEND. in all other cases
463 1.1 mrg * we return with uobj unlocked. [this is a hack
464 1.1 mrg * that allows the pagedaemon to save one lock/unlock
465 1.1 mrg * pair in the !swap_backed case since we have to
466 1.1 mrg * lock the uobj to drop the cluster anyway]
467 1.1 mrg * 4. on errors we always drop the cluster. thus, if we return
468 1.1 mrg * !PEND, !OK, then the caller only has to worry about
469 1.1 mrg * un-busying the main page (not the cluster pages).
470 1.1 mrg * 5. on success, if !PGO_PDFREECLUST, we return the cluster
471 1.1 mrg * with all pages busy (caller must un-busy and check
472 1.1 mrg * wanted/released flags).
473 1.1 mrg */
474 1.1 mrg
475 1.6 mrg int
476 1.6 mrg uvm_pager_put(uobj, pg, ppsp_ptr, npages, flags, start, stop)
477 1.6 mrg struct uvm_object *uobj; /* IN */
478 1.6 mrg struct vm_page *pg, ***ppsp_ptr;/* IN, IN/OUT */
479 1.6 mrg int *npages; /* IN/OUT */
480 1.6 mrg int flags; /* IN */
481 1.13.2.2 chs vaddr_t start, stop; /* IN, IN */
482 1.6 mrg {
483 1.6 mrg int result;
484 1.6 mrg daddr_t swblk;
485 1.6 mrg struct vm_page **ppsp = *ppsp_ptr;
486 1.6 mrg
487 1.6 mrg /*
488 1.6 mrg * note that uobj is null if we are doing a swap-backed pageout.
489 1.6 mrg * note that uobj is !null if we are doing normal object pageout.
490 1.6 mrg * note that the page queues must be locked to cluster.
491 1.6 mrg */
492 1.6 mrg
493 1.6 mrg if (uobj) { /* if !swap-backed */
494 1.6 mrg
495 1.6 mrg /*
496 1.6 mrg * attempt to build a cluster for pageout using its
497 1.6 mrg * make-put-cluster function (if it has one).
498 1.6 mrg */
499 1.6 mrg
500 1.6 mrg if (uobj->pgops->pgo_mk_pcluster) {
501 1.6 mrg ppsp = uobj->pgops->pgo_mk_pcluster(uobj, ppsp,
502 1.6 mrg npages, pg, flags, start, stop);
503 1.6 mrg *ppsp_ptr = ppsp; /* update caller's pointer */
504 1.6 mrg } else {
505 1.6 mrg ppsp[0] = pg;
506 1.6 mrg *npages = 1;
507 1.13.2.2 chs }
508 1.6 mrg
509 1.6 mrg swblk = 0; /* XXX: keep gcc happy */
510 1.1 mrg
511 1.6 mrg } else {
512 1.1 mrg
513 1.6 mrg /*
514 1.6 mrg * for swap-backed pageout, the caller (the pagedaemon) has
515 1.6 mrg * already built the cluster for us. the starting swap
516 1.6 mrg * block we are writing to has been passed in as "start."
517 1.6 mrg * "pg" could be NULL if there is no page we are especially
518 1.6 mrg * interested in (in which case the whole cluster gets dropped
519 1.6 mrg * in the event of an error or a sync "done").
520 1.6 mrg */
521 1.6 mrg swblk = (daddr_t) start;
522 1.6 mrg /* ppsp and npages should be ok */
523 1.6 mrg }
524 1.1 mrg
525 1.6 mrg /* now that we've clustered we can unlock the page queues */
526 1.6 mrg uvm_unlock_pageq();
527 1.1 mrg
528 1.6 mrg /*
529 1.6 mrg * now attempt the I/O. if we have a failure and we are
530 1.6 mrg * clustered, we will drop the cluster and try again.
531 1.6 mrg */
532 1.1 mrg
533 1.1 mrg ReTry:
534 1.6 mrg if (uobj) {
535 1.6 mrg /* object is locked */
536 1.13.2.2 chs simple_lock_assert(&uobj->vmobjlock, SLOCK_LOCKED);
537 1.13.2.1 chs result = uobj->pgops->pgo_put(uobj, ppsp, *npages, flags);
538 1.6 mrg /* object is now unlocked */
539 1.13.2.2 chs simple_lock_assert(&uobj->vmobjlock, SLOCK_UNLOCKED);
540 1.6 mrg } else {
541 1.6 mrg /* nothing locked */
542 1.13.2.1 chs /* XXX should we pass more than just PGO_SYNCIO here too? */
543 1.6 mrg result = uvm_swap_put(swblk, ppsp, *npages, flags & PGO_SYNCIO);
544 1.6 mrg /* nothing locked */
545 1.6 mrg }
546 1.6 mrg
547 1.6 mrg /*
548 1.6 mrg * we have attempted the I/O.
549 1.6 mrg *
550 1.6 mrg * if the I/O was a success then:
551 1.6 mrg * if !PGO_PDFREECLUST, we return the cluster to the
552 1.6 mrg * caller (who must un-busy all pages)
553 1.6 mrg * else we un-busy cluster pages for the pagedaemon
554 1.6 mrg *
555 1.6 mrg * if I/O is pending (async i/o) then we return the pending code.
556 1.6 mrg * [in this case the async i/o done function must clean up when
557 1.6 mrg * i/o is done...]
558 1.6 mrg */
559 1.6 mrg
560 1.6 mrg if (result == VM_PAGER_PEND || result == VM_PAGER_OK) {
561 1.6 mrg if (result == VM_PAGER_OK && (flags & PGO_PDFREECLUST)) {
562 1.6 mrg /*
563 1.6 mrg * drop cluster and relock object (only if I/O is
564 1.6 mrg * not pending)
565 1.6 mrg */
566 1.6 mrg if (uobj)
567 1.6 mrg /* required for dropcluster */
568 1.6 mrg simple_lock(&uobj->vmobjlock);
569 1.6 mrg if (*npages > 1 || pg == NULL)
570 1.6 mrg uvm_pager_dropcluster(uobj, pg, ppsp, npages,
571 1.6 mrg PGO_PDFREECLUST, 0);
572 1.6 mrg /* if (uobj): object still locked, as per
573 1.6 mrg * return-state item #3 */
574 1.6 mrg }
575 1.6 mrg return (result);
576 1.6 mrg }
577 1.6 mrg
578 1.6 mrg /*
579 1.6 mrg * a pager error occured. if we have clustered, we drop the
580 1.6 mrg * cluster and try again.
581 1.6 mrg */
582 1.6 mrg
583 1.6 mrg if (*npages > 1 || pg == NULL) {
584 1.6 mrg if (uobj)
585 1.6 mrg simple_lock(&uobj->vmobjlock);
586 1.6 mrg uvm_pager_dropcluster(uobj, pg, ppsp, npages, PGO_REALLOCSWAP,
587 1.6 mrg swblk);
588 1.6 mrg if (pg != NULL)
589 1.6 mrg goto ReTry;
590 1.6 mrg }
591 1.6 mrg
592 1.6 mrg /*
593 1.6 mrg * a pager error occured (even after dropping the cluster, if there
594 1.6 mrg * was one). give up! the caller only has one page ("pg")
595 1.6 mrg * to worry about.
596 1.6 mrg */
597 1.6 mrg
598 1.6 mrg if (uobj && (flags & PGO_PDFREECLUST) != 0)
599 1.6 mrg simple_lock(&uobj->vmobjlock);
600 1.6 mrg return(result);
601 1.1 mrg }
602 1.1 mrg
603 1.1 mrg /*
604 1.1 mrg * uvm_pager_dropcluster: drop a cluster we have built (because we
605 1.1 mrg * got an error, or, if PGO_PDFREECLUST we are un-busying the
606 1.1 mrg * cluster pages on behalf of the pagedaemon).
607 1.1 mrg *
608 1.1 mrg * => uobj, if non-null, is a non-swap-backed object that is
609 1.1 mrg * locked by the caller. we return with this object still
610 1.1 mrg * locked.
611 1.1 mrg * => page queues are not locked
612 1.1 mrg * => pg is our page of interest (the one we clustered around, can be null)
613 1.1 mrg * => ppsp/npages is our current cluster
614 1.1 mrg * => flags: PGO_PDFREECLUST: pageout was a success: un-busy cluster
615 1.1 mrg * pages on behalf of the pagedaemon.
616 1.1 mrg * PGO_REALLOCSWAP: drop previously allocated swap slots for
617 1.1 mrg * clustered swap-backed pages (except for "pg" if !NULL)
618 1.1 mrg * "swblk" is the start of swap alloc (e.g. for ppsp[0])
619 1.1 mrg * [only meaningful if swap-backed (uobj == NULL)]
620 1.1 mrg */
621 1.1 mrg
622 1.1 mrg
623 1.13.2.2 chs void
624 1.13.2.2 chs uvm_pager_dropcluster(uobj, pg, ppsp, npages, flags, swblk)
625 1.13.2.2 chs struct uvm_object *uobj; /* IN */
626 1.13.2.2 chs struct vm_page *pg, **ppsp; /* IN, IN/OUT */
627 1.13.2.2 chs int *npages; /* IN/OUT */
628 1.13.2.2 chs int flags;
629 1.13.2.2 chs int swblk; /* valid if (uobj == NULL &&
630 1.13.2.2 chs PGO_REALLOCSWAP) */
631 1.1 mrg {
632 1.6 mrg int lcv;
633 1.6 mrg boolean_t obj_is_alive;
634 1.7 chuck struct uvm_object *saved_uobj;
635 1.1 mrg
636 1.6 mrg /*
637 1.6 mrg * if we need to reallocate swap space for the cluster we are dropping
638 1.6 mrg * (true if swap-backed and PGO_REALLOCSWAP) then free the old
639 1.6 mrg * allocation now. save a block for "pg" if it is non-NULL.
640 1.6 mrg *
641 1.6 mrg * note that we will zap the object's pointer to swap in the "for" loop
642 1.6 mrg * below...
643 1.6 mrg */
644 1.6 mrg
645 1.6 mrg if (uobj == NULL && (flags & PGO_REALLOCSWAP)) {
646 1.6 mrg if (pg)
647 1.6 mrg uvm_swap_free(swblk + 1, *npages - 1);
648 1.6 mrg else
649 1.6 mrg uvm_swap_free(swblk, *npages);
650 1.6 mrg }
651 1.6 mrg
652 1.6 mrg /*
653 1.6 mrg * drop all pages but "pg"
654 1.6 mrg */
655 1.1 mrg
656 1.6 mrg for (lcv = 0 ; lcv < *npages ; lcv++) {
657 1.1 mrg
658 1.13.2.2 chs /* skip "pg" or empty slot */
659 1.13.2.2 chs if (ppsp[lcv] == pg || ppsp[lcv] == NULL)
660 1.6 mrg continue;
661 1.1 mrg
662 1.6 mrg /*
663 1.6 mrg * if swap-backed, gain lock on object that owns page. note
664 1.6 mrg * that PQ_ANON bit can't change as long as we are holding
665 1.6 mrg * the PG_BUSY bit (so there is no need to lock the page
666 1.6 mrg * queues to test it).
667 1.6 mrg *
668 1.6 mrg * once we have the lock, dispose of the pointer to swap, if
669 1.6 mrg * requested
670 1.6 mrg */
671 1.6 mrg if (!uobj) {
672 1.6 mrg if (ppsp[lcv]->pqflags & PQ_ANON) {
673 1.6 mrg simple_lock(&ppsp[lcv]->uanon->an_lock);
674 1.6 mrg if (flags & PGO_REALLOCSWAP)
675 1.6 mrg /* zap swap block */
676 1.6 mrg ppsp[lcv]->uanon->an_swslot = 0;
677 1.6 mrg } else {
678 1.6 mrg simple_lock(&ppsp[lcv]->uobject->vmobjlock);
679 1.6 mrg if (flags & PGO_REALLOCSWAP)
680 1.6 mrg uao_set_swslot(ppsp[lcv]->uobject,
681 1.12 chs ppsp[lcv]->offset >> PAGE_SHIFT, 0);
682 1.6 mrg }
683 1.6 mrg }
684 1.6 mrg
685 1.6 mrg /* did someone want the page while we had it busy-locked? */
686 1.13.2.2 chs if (ppsp[lcv]->flags & PG_WANTED) {
687 1.6 mrg /* still holding obj lock */
688 1.13.2.2 chs wakeup(ppsp[lcv]);
689 1.13.2.2 chs }
690 1.6 mrg
691 1.6 mrg /* if page was released, release it. otherwise un-busy it */
692 1.6 mrg if (ppsp[lcv]->flags & PG_RELEASED) {
693 1.6 mrg
694 1.6 mrg if (ppsp[lcv]->pqflags & PQ_ANON) {
695 1.6 mrg /* so that anfree will free */
696 1.6 mrg ppsp[lcv]->flags &= ~(PG_BUSY);
697 1.6 mrg UVM_PAGE_OWN(ppsp[lcv], NULL);
698 1.6 mrg
699 1.6 mrg pmap_page_protect(PMAP_PGARG(ppsp[lcv]),
700 1.6 mrg VM_PROT_NONE); /* be safe */
701 1.13 chs simple_unlock(&ppsp[lcv]->uanon->an_lock);
702 1.6 mrg /* kills anon and frees pg */
703 1.13 chs uvm_anfree(ppsp[lcv]->uanon);
704 1.6 mrg
705 1.6 mrg continue;
706 1.6 mrg }
707 1.6 mrg
708 1.6 mrg /*
709 1.6 mrg * pgo_releasepg will dump the page for us
710 1.6 mrg */
711 1.1 mrg
712 1.1 mrg #ifdef DIAGNOSTIC
713 1.6 mrg if (ppsp[lcv]->uobject->pgops->pgo_releasepg == NULL)
714 1.6 mrg panic("uvm_pager_dropcluster: no releasepg "
715 1.6 mrg "function");
716 1.1 mrg #endif
717 1.7 chuck saved_uobj = ppsp[lcv]->uobject;
718 1.6 mrg obj_is_alive =
719 1.7 chuck saved_uobj->pgops->pgo_releasepg(ppsp[lcv], NULL);
720 1.6 mrg
721 1.1 mrg #ifdef DIAGNOSTIC
722 1.6 mrg /* for normal objects, "pg" is still PG_BUSY by us,
723 1.6 mrg * so obj can't die */
724 1.6 mrg if (uobj && !obj_is_alive)
725 1.6 mrg panic("uvm_pager_dropcluster: object died "
726 1.6 mrg "with active page");
727 1.1 mrg #endif
728 1.7 chuck /* only unlock the object if it is still alive... */
729 1.7 chuck if (obj_is_alive && saved_uobj != uobj)
730 1.7 chuck simple_unlock(&saved_uobj->vmobjlock);
731 1.7 chuck
732 1.7 chuck /*
733 1.7 chuck * XXXCDC: suppose uobj died in the pgo_releasepg?
734 1.7 chuck * how pass that
735 1.7 chuck * info up to caller. we are currently ignoring it...
736 1.7 chuck */
737 1.7 chuck
738 1.7 chuck continue; /* next page */
739 1.1 mrg
740 1.6 mrg } else {
741 1.6 mrg ppsp[lcv]->flags &= ~(PG_BUSY|PG_WANTED);
742 1.6 mrg UVM_PAGE_OWN(ppsp[lcv], NULL);
743 1.6 mrg }
744 1.6 mrg
745 1.6 mrg /*
746 1.6 mrg * if we are operating on behalf of the pagedaemon and we
747 1.6 mrg * had a successful pageout update the page!
748 1.6 mrg */
749 1.6 mrg if (flags & PGO_PDFREECLUST) {
750 1.6 mrg /* XXX: with PMAP_NEW ref should already be clear,
751 1.6 mrg * but don't trust! */
752 1.6 mrg pmap_clear_reference(PMAP_PGARG(ppsp[lcv]));
753 1.6 mrg pmap_clear_modify(PMAP_PGARG(ppsp[lcv]));
754 1.6 mrg ppsp[lcv]->flags |= PG_CLEAN;
755 1.6 mrg }
756 1.6 mrg
757 1.6 mrg /* if anonymous cluster, unlock object and move on */
758 1.6 mrg if (!uobj) {
759 1.6 mrg if (ppsp[lcv]->pqflags & PQ_ANON)
760 1.6 mrg simple_unlock(&ppsp[lcv]->uanon->an_lock);
761 1.6 mrg else
762 1.6 mrg simple_unlock(&ppsp[lcv]->uobject->vmobjlock);
763 1.6 mrg }
764 1.1 mrg
765 1.6 mrg }
766 1.6 mrg
767 1.6 mrg /*
768 1.6 mrg * drop to a cluster of 1 page ("pg") if requested
769 1.6 mrg */
770 1.6 mrg
771 1.6 mrg if (pg && (flags & PGO_PDFREECLUST) == 0) {
772 1.6 mrg /*
773 1.6 mrg * if we are not a successful pageout, we make a 1 page cluster.
774 1.6 mrg */
775 1.6 mrg ppsp[0] = pg;
776 1.6 mrg *npages = 1;
777 1.6 mrg
778 1.6 mrg /*
779 1.6 mrg * assign new swap block to new cluster, if anon backed
780 1.6 mrg */
781 1.6 mrg if (uobj == NULL && (flags & PGO_REALLOCSWAP)) {
782 1.6 mrg if (pg->pqflags & PQ_ANON) {
783 1.6 mrg simple_lock(&pg->uanon->an_lock);
784 1.6 mrg pg->uanon->an_swslot = swblk; /* reassign */
785 1.6 mrg simple_unlock(&pg->uanon->an_lock);
786 1.6 mrg } else {
787 1.6 mrg simple_lock(&pg->uobject->vmobjlock);
788 1.6 mrg uao_set_swslot(pg->uobject,
789 1.12 chs pg->offset >> PAGE_SHIFT, swblk);
790 1.6 mrg simple_unlock(&pg->uobject->vmobjlock);
791 1.6 mrg }
792 1.6 mrg }
793 1.6 mrg }
794 1.13.2.2 chs }
795 1.13.2.2 chs
796 1.13.2.2 chs void
797 1.13.2.2 chs uvm_aio_biodone(bp)
798 1.13.2.2 chs struct buf *bp;
799 1.13.2.2 chs {
800 1.13.2.2 chs struct uvm_aiobuf *abp = (void *)bp;
801 1.13.2.2 chs int s;
802 1.13.2.2 chs
803 1.13.2.2 chs s = splbio();
804 1.13.2.3 chs simple_lock(&uvm.aiodoned_lock); /* locks uvm.aio_done */
805 1.13.2.2 chs TAILQ_INSERT_TAIL(&uvm.aio_done, &abp->aio, aioq);
806 1.13.2.3 chs wakeup(&uvm.aiodoned);
807 1.13.2.3 chs simple_unlock(&uvm.aiodoned_lock);
808 1.13.2.2 chs splx(s);
809 1.13.2.2 chs }
810 1.13.2.2 chs
811 1.13.2.2 chs void
812 1.13.2.2 chs uvm_aio_aiodone(aio)
813 1.13.2.2 chs struct uvm_aiodesc *aio;
814 1.13.2.2 chs {
815 1.13.2.2 chs struct uvm_aiobuf *abp = aio->pd_ptr;
816 1.13.2.2 chs struct vm_page *pgs[aio->npages];
817 1.13.2.2 chs struct uvm_object *uobj;
818 1.13.2.2 chs struct vnode *vp;
819 1.13.2.2 chs int s, i;
820 1.13.2.2 chs
821 1.13.2.2 chs for (i = 0; i < aio->npages; i++) {
822 1.13.2.2 chs pgs[i] = uvm_pageratop(aio->kva + (i << PAGE_SHIFT));
823 1.13.2.2 chs }
824 1.13.2.2 chs uvm_pagermapout(aio->kva, aio->npages);
825 1.13.2.2 chs
826 1.13.2.2 chs uobj = pgs[0]->uobject;
827 1.13.2.2 chs vp = (struct vnode *)uobj;
828 1.13.2.2 chs
829 1.13.2.2 chs /* XXX why don't we need to do this? */
830 1.13.2.2 chs #if 0
831 1.13.2.2 chs vp->v_numoutput--;
832 1.13.2.2 chs if (vp->v_flag & VBWAIT && vp->v_numoutput == 0) {
833 1.13.2.2 chs vp->v_flag &= ~VBWAIT;
834 1.13.2.2 chs wakeup(&vp->v_numoutput);
835 1.13.2.2 chs }
836 1.13.2.2 chs if (vp->v_numoutput < 0) {
837 1.13.2.2 chs panic("uvn_aiodone: neg numoutput vp %p", vp);
838 1.13.2.2 chs }
839 1.13.2.2 chs #endif
840 1.13.2.2 chs
841 1.13.2.2 chs uvm_pager_dropcluster(uobj, NULL, pgs, &aio->npages,
842 1.13.2.2 chs PGO_PDFREECLUST, 0);
843 1.13.2.2 chs
844 1.13.2.2 chs s = splbio();
845 1.13.2.2 chs pool_put(uvm_aiobuf_pool, abp);
846 1.13.2.2 chs splx(s);
847 1.1 mrg }
848