uvm_bio.c revision 1.37 1 1.37 perry /* $NetBSD: uvm_bio.c,v 1.37 2005/02/26 22:31:44 perry Exp $ */
2 1.2 chs
3 1.13 chs /*
4 1.2 chs * Copyright (c) 1998 Chuck Silvers.
5 1.2 chs * All rights reserved.
6 1.2 chs *
7 1.2 chs * Redistribution and use in source and binary forms, with or without
8 1.2 chs * modification, are permitted provided that the following conditions
9 1.2 chs * are met:
10 1.2 chs * 1. Redistributions of source code must retain the above copyright
11 1.2 chs * notice, this list of conditions and the following disclaimer.
12 1.2 chs * 2. Redistributions in binary form must reproduce the above copyright
13 1.2 chs * notice, this list of conditions and the following disclaimer in the
14 1.2 chs * documentation and/or other materials provided with the distribution.
15 1.2 chs * 3. The name of the author may not be used to endorse or promote products
16 1.2 chs * derived from this software without specific prior written permission.
17 1.2 chs *
18 1.2 chs * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
19 1.2 chs * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
20 1.2 chs * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
21 1.2 chs * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
22 1.2 chs * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
23 1.2 chs * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
24 1.2 chs * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
25 1.2 chs * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
26 1.2 chs * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
27 1.2 chs * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
28 1.2 chs * SUCH DAMAGE.
29 1.2 chs *
30 1.2 chs */
31 1.2 chs
32 1.2 chs /*
33 1.33 chs * uvm_bio.c: buffered i/o object mapping cache
34 1.2 chs */
35 1.2 chs
36 1.21 lukem #include <sys/cdefs.h>
37 1.37 perry __KERNEL_RCSID(0, "$NetBSD: uvm_bio.c,v 1.37 2005/02/26 22:31:44 perry Exp $");
38 1.21 lukem
39 1.21 lukem #include "opt_uvmhist.h"
40 1.2 chs
41 1.2 chs #include <sys/param.h>
42 1.2 chs #include <sys/systm.h>
43 1.2 chs #include <sys/malloc.h>
44 1.2 chs #include <sys/kernel.h>
45 1.2 chs
46 1.2 chs #include <uvm/uvm.h>
47 1.2 chs
48 1.2 chs /*
49 1.2 chs * global data structures
50 1.2 chs */
51 1.2 chs
52 1.2 chs /*
53 1.2 chs * local functions
54 1.2 chs */
55 1.2 chs
56 1.31 junyoung int ubc_fault(struct uvm_faultinfo *, vaddr_t, struct vm_page **, int,
57 1.31 junyoung int, vm_fault_t, vm_prot_t, int);
58 1.31 junyoung struct ubc_map *ubc_find_mapping(struct uvm_object *, voff_t);
59 1.2 chs
60 1.2 chs /*
61 1.2 chs * local data structues
62 1.2 chs */
63 1.2 chs
64 1.18 chs #define UBC_HASH(uobj, offset) \
65 1.18 chs (((((u_long)(uobj)) >> 8) + (((u_long)(offset)) >> PAGE_SHIFT)) & \
66 1.2 chs ubc_object.hashmask)
67 1.2 chs
68 1.18 chs #define UBC_QUEUE(offset) \
69 1.18 chs (&ubc_object.inactive[(((u_long)(offset)) >> ubc_winshift) & \
70 1.18 chs (UBC_NQUEUES - 1)])
71 1.18 chs
72 1.18 chs #define UBC_UMAP_ADDR(u) \
73 1.18 chs (vaddr_t)(ubc_object.kva + (((u) - ubc_object.umap) << ubc_winshift))
74 1.18 chs
75 1.18 chs
76 1.18 chs #define UMAP_PAGES_LOCKED 0x0001
77 1.18 chs #define UMAP_MAPPING_CACHED 0x0002
78 1.2 chs
79 1.2 chs struct ubc_map
80 1.2 chs {
81 1.2 chs struct uvm_object * uobj; /* mapped object */
82 1.2 chs voff_t offset; /* offset into uobj */
83 1.33 chs voff_t writeoff; /* write offset */
84 1.33 chs vsize_t writelen; /* write len */
85 1.18 chs int refcount; /* refcount on mapping */
86 1.18 chs int flags; /* extra state */
87 1.2 chs
88 1.2 chs LIST_ENTRY(ubc_map) hash; /* hash table */
89 1.2 chs TAILQ_ENTRY(ubc_map) inactive; /* inactive queue */
90 1.2 chs };
91 1.2 chs
92 1.2 chs static struct ubc_object
93 1.2 chs {
94 1.2 chs struct uvm_object uobj; /* glue for uvm_map() */
95 1.2 chs char *kva; /* where ubc_object is mapped */
96 1.2 chs struct ubc_map *umap; /* array of ubc_map's */
97 1.2 chs
98 1.2 chs LIST_HEAD(, ubc_map) *hash; /* hashtable for cached ubc_map's */
99 1.2 chs u_long hashmask; /* mask for hashtable */
100 1.2 chs
101 1.2 chs TAILQ_HEAD(ubc_inactive_head, ubc_map) *inactive;
102 1.2 chs /* inactive queues for ubc_map's */
103 1.2 chs
104 1.2 chs } ubc_object;
105 1.2 chs
106 1.2 chs struct uvm_pagerops ubc_pager =
107 1.2 chs {
108 1.2 chs NULL, /* init */
109 1.2 chs NULL, /* reference */
110 1.2 chs NULL, /* detach */
111 1.2 chs ubc_fault, /* fault */
112 1.2 chs /* ... rest are NULL */
113 1.2 chs };
114 1.2 chs
115 1.2 chs int ubc_nwins = UBC_NWINS;
116 1.11 chs int ubc_winshift = UBC_WINSHIFT;
117 1.11 chs int ubc_winsize;
118 1.27 thorpej #if defined(PMAP_PREFER)
119 1.2 chs int ubc_nqueues;
120 1.2 chs #define UBC_NQUEUES ubc_nqueues
121 1.2 chs #else
122 1.2 chs #define UBC_NQUEUES 1
123 1.2 chs #endif
124 1.2 chs
125 1.2 chs /*
126 1.2 chs * ubc_init
127 1.2 chs *
128 1.2 chs * init pager private data structures.
129 1.2 chs */
130 1.2 chs
131 1.2 chs void
132 1.2 chs ubc_init(void)
133 1.2 chs {
134 1.2 chs struct ubc_map *umap;
135 1.2 chs vaddr_t va;
136 1.2 chs int i;
137 1.15 simonb
138 1.15 simonb /*
139 1.15 simonb * Make sure ubc_winshift is sane.
140 1.15 simonb */
141 1.15 simonb if (ubc_winshift < PAGE_SHIFT)
142 1.15 simonb ubc_winshift = PAGE_SHIFT;
143 1.2 chs
144 1.2 chs /*
145 1.2 chs * init ubc_object.
146 1.2 chs * alloc and init ubc_map's.
147 1.2 chs * init inactive queues.
148 1.2 chs * alloc and init hashtable.
149 1.2 chs * map in ubc_object.
150 1.2 chs */
151 1.2 chs
152 1.2 chs simple_lock_init(&ubc_object.uobj.vmobjlock);
153 1.2 chs ubc_object.uobj.pgops = &ubc_pager;
154 1.2 chs TAILQ_INIT(&ubc_object.uobj.memq);
155 1.2 chs ubc_object.uobj.uo_npages = 0;
156 1.2 chs ubc_object.uobj.uo_refs = UVM_OBJ_KERN;
157 1.2 chs
158 1.2 chs ubc_object.umap = malloc(ubc_nwins * sizeof(struct ubc_map),
159 1.2 chs M_TEMP, M_NOWAIT);
160 1.7 enami if (ubc_object.umap == NULL)
161 1.7 enami panic("ubc_init: failed to allocate ubc_map");
162 1.16 thorpej memset(ubc_object.umap, 0, ubc_nwins * sizeof(struct ubc_map));
163 1.2 chs
164 1.18 chs if (ubc_winshift < PAGE_SHIFT) {
165 1.18 chs ubc_winshift = PAGE_SHIFT;
166 1.18 chs }
167 1.2 chs va = (vaddr_t)1L;
168 1.2 chs #ifdef PMAP_PREFER
169 1.36 atatat PMAP_PREFER(0, &va, 0, 0); /* kernel is never topdown */
170 1.11 chs ubc_nqueues = va >> ubc_winshift;
171 1.11 chs if (ubc_nqueues == 0) {
172 1.11 chs ubc_nqueues = 1;
173 1.2 chs }
174 1.2 chs #endif
175 1.11 chs ubc_winsize = 1 << ubc_winshift;
176 1.2 chs ubc_object.inactive = malloc(UBC_NQUEUES *
177 1.18 chs sizeof(struct ubc_inactive_head), M_TEMP, M_NOWAIT);
178 1.7 enami if (ubc_object.inactive == NULL)
179 1.7 enami panic("ubc_init: failed to allocate inactive queue heads");
180 1.2 chs for (i = 0; i < UBC_NQUEUES; i++) {
181 1.2 chs TAILQ_INIT(&ubc_object.inactive[i]);
182 1.2 chs }
183 1.2 chs for (i = 0; i < ubc_nwins; i++) {
184 1.2 chs umap = &ubc_object.umap[i];
185 1.2 chs TAILQ_INSERT_TAIL(&ubc_object.inactive[i & (UBC_NQUEUES - 1)],
186 1.2 chs umap, inactive);
187 1.2 chs }
188 1.2 chs
189 1.2 chs ubc_object.hash = hashinit(ubc_nwins, HASH_LIST, M_TEMP, M_NOWAIT,
190 1.2 chs &ubc_object.hashmask);
191 1.2 chs for (i = 0; i <= ubc_object.hashmask; i++) {
192 1.2 chs LIST_INIT(&ubc_object.hash[i]);
193 1.2 chs }
194 1.2 chs
195 1.2 chs if (uvm_map(kernel_map, (vaddr_t *)&ubc_object.kva,
196 1.11 chs ubc_nwins << ubc_winshift, &ubc_object.uobj, 0, (vsize_t)va,
197 1.2 chs UVM_MAPFLAG(UVM_PROT_ALL, UVM_PROT_ALL, UVM_INH_NONE,
198 1.9 chs UVM_ADV_RANDOM, UVM_FLAG_NOMERGE)) != 0) {
199 1.26 provos panic("ubc_init: failed to map ubc_object");
200 1.2 chs }
201 1.2 chs UVMHIST_INIT(ubchist, 300);
202 1.2 chs }
203 1.2 chs
204 1.2 chs /*
205 1.2 chs * ubc_fault: fault routine for ubc mapping
206 1.2 chs */
207 1.18 chs
208 1.11 chs int
209 1.2 chs ubc_fault(ufi, ign1, ign2, ign3, ign4, fault_type, access_type, flags)
210 1.2 chs struct uvm_faultinfo *ufi;
211 1.2 chs vaddr_t ign1;
212 1.14 chs struct vm_page **ign2;
213 1.2 chs int ign3, ign4;
214 1.2 chs vm_fault_t fault_type;
215 1.2 chs vm_prot_t access_type;
216 1.2 chs int flags;
217 1.2 chs {
218 1.2 chs struct uvm_object *uobj;
219 1.2 chs struct ubc_map *umap;
220 1.2 chs vaddr_t va, eva, ubc_offset, slot_offset;
221 1.18 chs int i, error, npages;
222 1.18 chs struct vm_page *pgs[ubc_winsize >> PAGE_SHIFT], *pg;
223 1.23 chs vm_prot_t prot;
224 1.2 chs UVMHIST_FUNC("ubc_fault"); UVMHIST_CALLED(ubchist);
225 1.2 chs
226 1.2 chs /*
227 1.2 chs * no need to try with PGO_LOCKED...
228 1.2 chs * we don't need to have the map locked since we know that
229 1.2 chs * no one will mess with it until our reference is released.
230 1.2 chs */
231 1.18 chs
232 1.2 chs if (flags & PGO_LOCKED) {
233 1.2 chs uvmfault_unlockall(ufi, NULL, &ubc_object.uobj, NULL);
234 1.2 chs flags &= ~PGO_LOCKED;
235 1.2 chs }
236 1.2 chs
237 1.2 chs va = ufi->orig_rvaddr;
238 1.2 chs ubc_offset = va - (vaddr_t)ubc_object.kva;
239 1.11 chs umap = &ubc_object.umap[ubc_offset >> ubc_winshift];
240 1.2 chs KASSERT(umap->refcount != 0);
241 1.18 chs slot_offset = ubc_offset & (ubc_winsize - 1);
242 1.2 chs
243 1.34 chs /*
244 1.34 chs * some platforms cannot write to individual bytes atomically, so
245 1.34 chs * software has to do read/modify/write of larger quantities instead.
246 1.34 chs * this means that the access_type for "write" operations
247 1.34 chs * can be VM_PROT_READ, which confuses us mightily.
248 1.37 perry *
249 1.34 chs * deal with this by resetting access_type based on the info
250 1.34 chs * that ubc_alloc() stores for us.
251 1.34 chs */
252 1.34 chs
253 1.34 chs access_type = umap->writelen ? VM_PROT_WRITE : VM_PROT_READ;
254 1.34 chs UVMHIST_LOG(ubchist, "va 0x%lx ubc_offset 0x%lx access_type %d",
255 1.34 chs va, ubc_offset, access_type, 0);
256 1.34 chs
257 1.33 chs #ifdef DIAGNOSTIC
258 1.33 chs if ((access_type & VM_PROT_WRITE) != 0) {
259 1.33 chs if (slot_offset < trunc_page(umap->writeoff) ||
260 1.33 chs umap->writeoff + umap->writelen <= slot_offset) {
261 1.33 chs panic("ubc_fault: out of range write");
262 1.33 chs }
263 1.33 chs }
264 1.33 chs #endif
265 1.33 chs
266 1.2 chs /* no umap locking needed since we have a ref on the umap */
267 1.2 chs uobj = umap->uobj;
268 1.2 chs
269 1.33 chs if ((access_type & VM_PROT_WRITE) == 0) {
270 1.33 chs npages = (ubc_winsize - slot_offset) >> PAGE_SHIFT;
271 1.33 chs } else {
272 1.33 chs npages = (round_page(umap->offset + umap->writeoff +
273 1.33 chs umap->writelen) - (umap->offset + slot_offset))
274 1.33 chs >> PAGE_SHIFT;
275 1.33 chs flags |= PGO_PASTEOF;
276 1.33 chs }
277 1.2 chs
278 1.2 chs again:
279 1.2 chs memset(pgs, 0, sizeof (pgs));
280 1.2 chs simple_lock(&uobj->vmobjlock);
281 1.2 chs
282 1.33 chs UVMHIST_LOG(ubchist, "slot_offset 0x%x writeoff 0x%x writelen 0x%x ",
283 1.33 chs slot_offset, umap->writeoff, umap->writelen, 0);
284 1.33 chs UVMHIST_LOG(ubchist, "getpages uobj %p offset 0x%x npages %d",
285 1.18 chs uobj, umap->offset + slot_offset, npages, 0);
286 1.2 chs
287 1.33 chs error = (*uobj->pgops->pgo_get)(uobj, umap->offset + slot_offset, pgs,
288 1.33 chs &npages, 0, access_type, 0, flags);
289 1.24 simonb UVMHIST_LOG(ubchist, "getpages error %d npages %d", error, npages, 0,
290 1.24 simonb 0);
291 1.2 chs
292 1.5 chs if (error == EAGAIN) {
293 1.2 chs tsleep(&lbolt, PVM, "ubc_fault", 0);
294 1.2 chs goto again;
295 1.2 chs }
296 1.5 chs if (error) {
297 1.10 chs return error;
298 1.5 chs }
299 1.2 chs
300 1.2 chs va = ufi->orig_rvaddr;
301 1.2 chs eva = ufi->orig_rvaddr + (npages << PAGE_SHIFT);
302 1.2 chs
303 1.28 yamt UVMHIST_LOG(ubchist, "va 0x%lx eva 0x%lx", va, eva, 0, 0);
304 1.28 yamt simple_lock(&uobj->vmobjlock);
305 1.28 yamt uvm_lock_pageq();
306 1.28 yamt for (i = 0; va < eva; i++, va += PAGE_SIZE) {
307 1.34 chs
308 1.28 yamt /*
309 1.28 yamt * for virtually-indexed, virtually-tagged caches we should
310 1.28 yamt * avoid creating writable mappings when we don't absolutely
311 1.28 yamt * need them, since the "compatible alias" trick doesn't work
312 1.28 yamt * on such caches. otherwise, we can always map the pages
313 1.28 yamt * writable.
314 1.28 yamt */
315 1.23 chs
316 1.23 chs #ifdef PMAP_CACHE_VIVT
317 1.28 yamt prot = VM_PROT_READ | access_type;
318 1.23 chs #else
319 1.28 yamt prot = VM_PROT_READ | VM_PROT_WRITE;
320 1.23 chs #endif
321 1.24 simonb UVMHIST_LOG(ubchist, "pgs[%d] = %p", i, pgs[i], 0, 0);
322 1.2 chs pg = pgs[i];
323 1.2 chs
324 1.2 chs if (pg == NULL || pg == PGO_DONTCARE) {
325 1.2 chs continue;
326 1.2 chs }
327 1.2 chs if (pg->flags & PG_WANTED) {
328 1.2 chs wakeup(pg);
329 1.2 chs }
330 1.2 chs KASSERT((pg->flags & PG_FAKE) == 0);
331 1.2 chs if (pg->flags & PG_RELEASED) {
332 1.18 chs uvm_pagefree(pg);
333 1.2 chs continue;
334 1.2 chs }
335 1.28 yamt if (pg->loan_count != 0) {
336 1.34 chs
337 1.28 yamt /*
338 1.28 yamt * avoid unneeded loan break if possible.
339 1.28 yamt */
340 1.34 chs
341 1.28 yamt if ((access_type & VM_PROT_WRITE) == 0)
342 1.28 yamt prot &= ~VM_PROT_WRITE;
343 1.28 yamt
344 1.28 yamt if (prot & VM_PROT_WRITE) {
345 1.28 yamt uvm_unlock_pageq();
346 1.28 yamt pg = uvm_loanbreak(pg);
347 1.28 yamt uvm_lock_pageq();
348 1.28 yamt if (pg == NULL)
349 1.28 yamt continue; /* will re-fault */
350 1.28 yamt }
351 1.28 yamt }
352 1.2 chs KASSERT(access_type == VM_PROT_READ ||
353 1.18 chs (pg->flags & PG_RDONLY) == 0);
354 1.18 chs pmap_enter(ufi->orig_map->pmap, va, VM_PAGE_TO_PHYS(pg),
355 1.25 chs (pg->flags & PG_RDONLY) ? prot & ~VM_PROT_WRITE : prot,
356 1.25 chs access_type);
357 1.2 chs uvm_pageactivate(pg);
358 1.2 chs pg->flags &= ~(PG_BUSY);
359 1.2 chs UVM_PAGE_OWN(pg, NULL);
360 1.2 chs }
361 1.18 chs uvm_unlock_pageq();
362 1.2 chs simple_unlock(&uobj->vmobjlock);
363 1.17 chris pmap_update(ufi->orig_map->pmap);
364 1.8 chs return 0;
365 1.2 chs }
366 1.2 chs
367 1.2 chs /*
368 1.2 chs * local functions
369 1.2 chs */
370 1.2 chs
371 1.11 chs struct ubc_map *
372 1.2 chs ubc_find_mapping(uobj, offset)
373 1.2 chs struct uvm_object *uobj;
374 1.2 chs voff_t offset;
375 1.2 chs {
376 1.2 chs struct ubc_map *umap;
377 1.2 chs
378 1.2 chs LIST_FOREACH(umap, &ubc_object.hash[UBC_HASH(uobj, offset)], hash) {
379 1.2 chs if (umap->uobj == uobj && umap->offset == offset) {
380 1.2 chs return umap;
381 1.2 chs }
382 1.2 chs }
383 1.2 chs return NULL;
384 1.2 chs }
385 1.2 chs
386 1.2 chs
387 1.2 chs /*
388 1.2 chs * ubc interface functions
389 1.2 chs */
390 1.2 chs
391 1.2 chs /*
392 1.18 chs * ubc_alloc: allocate a file mapping window
393 1.2 chs */
394 1.18 chs
395 1.2 chs void *
396 1.2 chs ubc_alloc(uobj, offset, lenp, flags)
397 1.2 chs struct uvm_object *uobj;
398 1.2 chs voff_t offset;
399 1.2 chs vsize_t *lenp;
400 1.2 chs int flags;
401 1.2 chs {
402 1.6 chs vaddr_t slot_offset, va;
403 1.2 chs struct ubc_map *umap;
404 1.6 chs voff_t umap_offset;
405 1.18 chs int error;
406 1.2 chs UVMHIST_FUNC("ubc_alloc"); UVMHIST_CALLED(ubchist);
407 1.2 chs
408 1.33 chs UVMHIST_LOG(ubchist, "uobj %p offset 0x%lx len 0x%lx",
409 1.33 chs uobj, offset, *lenp, 0);
410 1.2 chs
411 1.34 chs KASSERT(*lenp > 0);
412 1.6 chs umap_offset = (offset & ~((voff_t)ubc_winsize - 1));
413 1.4 enami slot_offset = (vaddr_t)(offset & ((voff_t)ubc_winsize - 1));
414 1.18 chs *lenp = MIN(*lenp, ubc_winsize - slot_offset);
415 1.2 chs
416 1.2 chs /*
417 1.33 chs * the object is always locked here, so we don't need to add a ref.
418 1.2 chs */
419 1.2 chs
420 1.2 chs again:
421 1.2 chs simple_lock(&ubc_object.uobj.vmobjlock);
422 1.2 chs umap = ubc_find_mapping(uobj, umap_offset);
423 1.2 chs if (umap == NULL) {
424 1.2 chs umap = TAILQ_FIRST(UBC_QUEUE(offset));
425 1.2 chs if (umap == NULL) {
426 1.2 chs simple_unlock(&ubc_object.uobj.vmobjlock);
427 1.2 chs tsleep(&lbolt, PVM, "ubc_alloc", 0);
428 1.2 chs goto again;
429 1.2 chs }
430 1.2 chs
431 1.2 chs /*
432 1.18 chs * remove from old hash (if any), add to new hash.
433 1.2 chs */
434 1.2 chs
435 1.2 chs if (umap->uobj != NULL) {
436 1.2 chs LIST_REMOVE(umap, hash);
437 1.2 chs }
438 1.2 chs umap->uobj = uobj;
439 1.2 chs umap->offset = umap_offset;
440 1.2 chs LIST_INSERT_HEAD(&ubc_object.hash[UBC_HASH(uobj, umap_offset)],
441 1.18 chs umap, hash);
442 1.18 chs va = UBC_UMAP_ADDR(umap);
443 1.18 chs if (umap->flags & UMAP_MAPPING_CACHED) {
444 1.18 chs umap->flags &= ~UMAP_MAPPING_CACHED;
445 1.18 chs pmap_remove(pmap_kernel(), va, va + ubc_winsize);
446 1.18 chs pmap_update(pmap_kernel());
447 1.18 chs }
448 1.18 chs } else {
449 1.18 chs va = UBC_UMAP_ADDR(umap);
450 1.2 chs }
451 1.2 chs
452 1.2 chs if (umap->refcount == 0) {
453 1.2 chs TAILQ_REMOVE(UBC_QUEUE(offset), umap, inactive);
454 1.2 chs }
455 1.2 chs
456 1.2 chs #ifdef DIAGNOSTIC
457 1.18 chs if ((flags & UBC_WRITE) && (umap->writeoff || umap->writelen)) {
458 1.33 chs panic("ubc_alloc: concurrent writes uobj %p", uobj);
459 1.2 chs }
460 1.2 chs #endif
461 1.2 chs if (flags & UBC_WRITE) {
462 1.2 chs umap->writeoff = slot_offset;
463 1.2 chs umap->writelen = *lenp;
464 1.2 chs }
465 1.2 chs
466 1.2 chs umap->refcount++;
467 1.2 chs simple_unlock(&ubc_object.uobj.vmobjlock);
468 1.18 chs UVMHIST_LOG(ubchist, "umap %p refs %d va %p flags 0x%x",
469 1.18 chs umap, umap->refcount, va, flags);
470 1.18 chs
471 1.18 chs if (flags & UBC_FAULTBUSY) {
472 1.18 chs int npages = (*lenp + PAGE_SIZE - 1) >> PAGE_SHIFT;
473 1.18 chs struct vm_page *pgs[npages];
474 1.18 chs int gpflags = PGO_SYNCIO|PGO_OVERWRITE|PGO_PASTEOF;
475 1.18 chs int i;
476 1.30 dbj KDASSERT(flags & UBC_WRITE);
477 1.2 chs
478 1.18 chs if (umap->flags & UMAP_MAPPING_CACHED) {
479 1.18 chs umap->flags &= ~UMAP_MAPPING_CACHED;
480 1.18 chs pmap_remove(pmap_kernel(), va, va + ubc_winsize);
481 1.18 chs }
482 1.22 enami memset(pgs, 0, sizeof(pgs));
483 1.18 chs simple_lock(&uobj->vmobjlock);
484 1.33 chs error = (*uobj->pgops->pgo_get)(uobj, trunc_page(offset), pgs,
485 1.33 chs &npages, 0, VM_PROT_READ | VM_PROT_WRITE, 0, gpflags);
486 1.24 simonb UVMHIST_LOG(ubchist, "faultbusy getpages %d", error, 0, 0, 0);
487 1.18 chs if (error) {
488 1.18 chs goto out;
489 1.18 chs }
490 1.18 chs for (i = 0; i < npages; i++) {
491 1.18 chs pmap_kenter_pa(va + slot_offset + (i << PAGE_SHIFT),
492 1.18 chs VM_PAGE_TO_PHYS(pgs[i]),
493 1.18 chs VM_PROT_READ | VM_PROT_WRITE);
494 1.18 chs }
495 1.18 chs pmap_update(pmap_kernel());
496 1.18 chs umap->flags |= UMAP_PAGES_LOCKED;
497 1.18 chs }
498 1.18 chs
499 1.18 chs out:
500 1.18 chs return (void *)(va + slot_offset);
501 1.2 chs }
502 1.2 chs
503 1.18 chs /*
504 1.18 chs * ubc_release: free a file mapping window.
505 1.18 chs */
506 1.2 chs
507 1.2 chs void
508 1.18 chs ubc_release(va, flags)
509 1.2 chs void *va;
510 1.18 chs int flags;
511 1.2 chs {
512 1.2 chs struct ubc_map *umap;
513 1.2 chs struct uvm_object *uobj;
514 1.18 chs vaddr_t umapva;
515 1.18 chs boolean_t unmapped;
516 1.2 chs UVMHIST_FUNC("ubc_release"); UVMHIST_CALLED(ubchist);
517 1.2 chs
518 1.24 simonb UVMHIST_LOG(ubchist, "va %p", va, 0, 0, 0);
519 1.11 chs umap = &ubc_object.umap[((char *)va - ubc_object.kva) >> ubc_winshift];
520 1.18 chs umapva = UBC_UMAP_ADDR(umap);
521 1.2 chs uobj = umap->uobj;
522 1.2 chs KASSERT(uobj != NULL);
523 1.2 chs
524 1.18 chs if (umap->flags & UMAP_PAGES_LOCKED) {
525 1.18 chs int slot_offset = umap->writeoff;
526 1.18 chs int endoff = umap->writeoff + umap->writelen;
527 1.18 chs int zerolen = round_page(endoff) - endoff;
528 1.18 chs int npages = (int)(round_page(umap->writeoff + umap->writelen)
529 1.18 chs - trunc_page(umap->writeoff)) >> PAGE_SHIFT;
530 1.18 chs struct vm_page *pgs[npages];
531 1.18 chs paddr_t pa;
532 1.18 chs int i;
533 1.18 chs boolean_t rv;
534 1.18 chs
535 1.18 chs if (zerolen) {
536 1.18 chs memset((char *)umapva + endoff, 0, zerolen);
537 1.18 chs }
538 1.18 chs umap->flags &= ~UMAP_PAGES_LOCKED;
539 1.18 chs uvm_lock_pageq();
540 1.18 chs for (i = 0; i < npages; i++) {
541 1.18 chs rv = pmap_extract(pmap_kernel(),
542 1.18 chs umapva + slot_offset + (i << PAGE_SHIFT), &pa);
543 1.18 chs KASSERT(rv);
544 1.18 chs pgs[i] = PHYS_TO_VM_PAGE(pa);
545 1.18 chs pgs[i]->flags &= ~(PG_FAKE|PG_CLEAN);
546 1.28 yamt KASSERT(pgs[i]->loan_count == 0);
547 1.18 chs uvm_pageactivate(pgs[i]);
548 1.18 chs }
549 1.18 chs uvm_unlock_pageq();
550 1.18 chs pmap_kremove(umapva, ubc_winsize);
551 1.18 chs pmap_update(pmap_kernel());
552 1.32 yamt simple_lock(&uobj->vmobjlock);
553 1.18 chs uvm_page_unbusy(pgs, npages);
554 1.32 yamt simple_unlock(&uobj->vmobjlock);
555 1.18 chs unmapped = TRUE;
556 1.18 chs } else {
557 1.18 chs unmapped = FALSE;
558 1.18 chs }
559 1.18 chs
560 1.18 chs simple_lock(&ubc_object.uobj.vmobjlock);
561 1.2 chs umap->writeoff = 0;
562 1.2 chs umap->writelen = 0;
563 1.2 chs umap->refcount--;
564 1.2 chs if (umap->refcount == 0) {
565 1.33 chs if (flags & UBC_UNMAP) {
566 1.2 chs
567 1.2 chs /*
568 1.33 chs * Invalidate any cached mappings if requested.
569 1.33 chs * This is typically used to avoid leaving
570 1.33 chs * incompatible cache aliases around indefinitely.
571 1.2 chs */
572 1.2 chs
573 1.18 chs pmap_remove(pmap_kernel(), umapva,
574 1.18 chs umapva + ubc_winsize);
575 1.18 chs umap->flags &= ~UMAP_MAPPING_CACHED;
576 1.17 chris pmap_update(pmap_kernel());
577 1.2 chs LIST_REMOVE(umap, hash);
578 1.2 chs umap->uobj = NULL;
579 1.2 chs TAILQ_INSERT_HEAD(UBC_QUEUE(umap->offset), umap,
580 1.2 chs inactive);
581 1.2 chs } else {
582 1.18 chs if (!unmapped) {
583 1.18 chs umap->flags |= UMAP_MAPPING_CACHED;
584 1.18 chs }
585 1.2 chs TAILQ_INSERT_TAIL(UBC_QUEUE(umap->offset), umap,
586 1.2 chs inactive);
587 1.2 chs }
588 1.2 chs }
589 1.24 simonb UVMHIST_LOG(ubchist, "umap %p refs %d", umap, umap->refcount, 0, 0);
590 1.2 chs simple_unlock(&ubc_object.uobj.vmobjlock);
591 1.2 chs }
592 1.2 chs
593 1.2 chs
594 1.29 yamt #if 0 /* notused */
595 1.2 chs /*
596 1.2 chs * removing a range of mappings from the ubc mapping cache.
597 1.2 chs */
598 1.2 chs
599 1.2 chs void
600 1.2 chs ubc_flush(uobj, start, end)
601 1.2 chs struct uvm_object *uobj;
602 1.2 chs voff_t start, end;
603 1.2 chs {
604 1.2 chs struct ubc_map *umap;
605 1.2 chs vaddr_t va;
606 1.2 chs UVMHIST_FUNC("ubc_flush"); UVMHIST_CALLED(ubchist);
607 1.2 chs
608 1.2 chs UVMHIST_LOG(ubchist, "uobj %p start 0x%lx end 0x%lx",
609 1.24 simonb uobj, start, end, 0);
610 1.2 chs
611 1.2 chs simple_lock(&ubc_object.uobj.vmobjlock);
612 1.2 chs for (umap = ubc_object.umap;
613 1.2 chs umap < &ubc_object.umap[ubc_nwins];
614 1.2 chs umap++) {
615 1.2 chs
616 1.18 chs if (umap->uobj != uobj || umap->offset < start ||
617 1.2 chs (umap->offset >= end && end != 0) ||
618 1.2 chs umap->refcount > 0) {
619 1.2 chs continue;
620 1.2 chs }
621 1.2 chs
622 1.2 chs /*
623 1.2 chs * remove from hash,
624 1.2 chs * move to head of inactive queue.
625 1.2 chs */
626 1.2 chs
627 1.2 chs va = (vaddr_t)(ubc_object.kva +
628 1.18 chs ((umap - ubc_object.umap) << ubc_winshift));
629 1.4 enami pmap_remove(pmap_kernel(), va, va + ubc_winsize);
630 1.2 chs
631 1.2 chs LIST_REMOVE(umap, hash);
632 1.2 chs umap->uobj = NULL;
633 1.2 chs TAILQ_REMOVE(UBC_QUEUE(umap->offset), umap, inactive);
634 1.2 chs TAILQ_INSERT_HEAD(UBC_QUEUE(umap->offset), umap, inactive);
635 1.2 chs }
636 1.18 chs pmap_update(pmap_kernel());
637 1.2 chs simple_unlock(&ubc_object.uobj.vmobjlock);
638 1.2 chs }
639 1.29 yamt #endif /* notused */
640