uvm_bio.c revision 1.11 1 1.11 chs /* $NetBSD: uvm_bio.c,v 1.11 2001/03/19 00:29:04 chs Exp $ */
2 1.2 chs
3 1.2 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 #include "opt_uvmhist.h"
33 1.2 chs
34 1.2 chs /*
35 1.2 chs * uvm_bio.c: buffered i/o vnode mapping cache
36 1.2 chs */
37 1.2 chs
38 1.2 chs
39 1.2 chs #include <sys/param.h>
40 1.2 chs #include <sys/systm.h>
41 1.2 chs #include <sys/malloc.h>
42 1.2 chs #include <sys/kernel.h>
43 1.2 chs #include <sys/vnode.h>
44 1.2 chs
45 1.2 chs #include <uvm/uvm.h>
46 1.2 chs #include <uvm/uvm_page.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.2 chs static int ubc_fault __P((struct uvm_faultinfo *, vaddr_t,
57 1.2 chs vm_page_t *, int, int, vm_fault_t, vm_prot_t,
58 1.2 chs int));
59 1.2 chs static struct ubc_map *ubc_find_mapping __P((struct uvm_object *, voff_t));
60 1.2 chs
61 1.2 chs /*
62 1.2 chs * local data structues
63 1.2 chs */
64 1.2 chs
65 1.2 chs #define UBC_HASH(uobj, offset) (((((u_long)(uobj)) >> 8) + \
66 1.2 chs (((u_long)(offset)) >> PAGE_SHIFT)) & \
67 1.2 chs ubc_object.hashmask)
68 1.2 chs
69 1.11 chs #define UBC_QUEUE(offset) (&ubc_object.inactive[((offset) >> ubc_winshift) & \
70 1.2 chs (UBC_NQUEUES - 1)])
71 1.2 chs
72 1.2 chs struct ubc_map
73 1.2 chs {
74 1.2 chs struct uvm_object * uobj; /* mapped object */
75 1.2 chs voff_t offset; /* offset into uobj */
76 1.2 chs int refcount; /* refcount on mapping */
77 1.2 chs voff_t writeoff; /* overwrite offset */
78 1.2 chs vsize_t writelen; /* overwrite len */
79 1.2 chs
80 1.2 chs LIST_ENTRY(ubc_map) hash; /* hash table */
81 1.2 chs TAILQ_ENTRY(ubc_map) inactive; /* inactive queue */
82 1.2 chs };
83 1.2 chs
84 1.2 chs static struct ubc_object
85 1.2 chs {
86 1.2 chs struct uvm_object uobj; /* glue for uvm_map() */
87 1.2 chs char *kva; /* where ubc_object is mapped */
88 1.2 chs struct ubc_map *umap; /* array of ubc_map's */
89 1.2 chs
90 1.2 chs LIST_HEAD(, ubc_map) *hash; /* hashtable for cached ubc_map's */
91 1.2 chs u_long hashmask; /* mask for hashtable */
92 1.2 chs
93 1.2 chs TAILQ_HEAD(ubc_inactive_head, ubc_map) *inactive;
94 1.2 chs /* inactive queues for ubc_map's */
95 1.2 chs
96 1.2 chs } ubc_object;
97 1.2 chs
98 1.2 chs struct uvm_pagerops ubc_pager =
99 1.2 chs {
100 1.2 chs NULL, /* init */
101 1.2 chs NULL, /* reference */
102 1.2 chs NULL, /* detach */
103 1.2 chs ubc_fault, /* fault */
104 1.2 chs /* ... rest are NULL */
105 1.2 chs };
106 1.2 chs
107 1.2 chs int ubc_nwins = UBC_NWINS;
108 1.11 chs int ubc_winshift = UBC_WINSHIFT;
109 1.11 chs int ubc_winsize;
110 1.2 chs #ifdef PMAP_PREFER
111 1.2 chs int ubc_nqueues;
112 1.2 chs boolean_t ubc_release_unmap = FALSE;
113 1.2 chs #define UBC_NQUEUES ubc_nqueues
114 1.2 chs #define UBC_RELEASE_UNMAP ubc_release_unmap
115 1.2 chs #else
116 1.2 chs #define UBC_NQUEUES 1
117 1.2 chs #define UBC_RELEASE_UNMAP FALSE
118 1.2 chs #endif
119 1.2 chs
120 1.2 chs /*
121 1.2 chs * ubc_init
122 1.2 chs *
123 1.2 chs * init pager private data structures.
124 1.2 chs */
125 1.2 chs
126 1.2 chs void
127 1.2 chs ubc_init(void)
128 1.2 chs {
129 1.2 chs struct ubc_map *umap;
130 1.2 chs vaddr_t va;
131 1.2 chs int i;
132 1.2 chs
133 1.2 chs /*
134 1.2 chs * init ubc_object.
135 1.2 chs * alloc and init ubc_map's.
136 1.2 chs * init inactive queues.
137 1.2 chs * alloc and init hashtable.
138 1.2 chs * map in ubc_object.
139 1.2 chs */
140 1.2 chs
141 1.2 chs simple_lock_init(&ubc_object.uobj.vmobjlock);
142 1.2 chs ubc_object.uobj.pgops = &ubc_pager;
143 1.2 chs TAILQ_INIT(&ubc_object.uobj.memq);
144 1.2 chs ubc_object.uobj.uo_npages = 0;
145 1.2 chs ubc_object.uobj.uo_refs = UVM_OBJ_KERN;
146 1.2 chs
147 1.2 chs ubc_object.umap = malloc(ubc_nwins * sizeof(struct ubc_map),
148 1.2 chs M_TEMP, M_NOWAIT);
149 1.7 enami if (ubc_object.umap == NULL)
150 1.7 enami panic("ubc_init: failed to allocate ubc_map");
151 1.2 chs bzero(ubc_object.umap, ubc_nwins * sizeof(struct ubc_map));
152 1.2 chs
153 1.2 chs va = (vaddr_t)1L;
154 1.2 chs #ifdef PMAP_PREFER
155 1.2 chs PMAP_PREFER(0, &va);
156 1.11 chs ubc_nqueues = va >> ubc_winshift;
157 1.11 chs if (ubc_nqueues == 0) {
158 1.11 chs ubc_nqueues = 1;
159 1.2 chs }
160 1.2 chs if (ubc_nqueues != 1) {
161 1.2 chs ubc_release_unmap = TRUE;
162 1.2 chs }
163 1.2 chs #endif
164 1.11 chs ubc_winsize = 1 << ubc_winshift;
165 1.2 chs ubc_object.inactive = malloc(UBC_NQUEUES *
166 1.2 chs sizeof(struct ubc_inactive_head),
167 1.2 chs M_TEMP, M_NOWAIT);
168 1.7 enami if (ubc_object.inactive == NULL)
169 1.7 enami panic("ubc_init: failed to allocate inactive queue heads");
170 1.2 chs for (i = 0; i < UBC_NQUEUES; i++) {
171 1.2 chs TAILQ_INIT(&ubc_object.inactive[i]);
172 1.2 chs }
173 1.2 chs for (i = 0; i < ubc_nwins; i++) {
174 1.2 chs umap = &ubc_object.umap[i];
175 1.2 chs TAILQ_INSERT_TAIL(&ubc_object.inactive[i & (UBC_NQUEUES - 1)],
176 1.2 chs umap, inactive);
177 1.2 chs }
178 1.2 chs
179 1.2 chs ubc_object.hash = hashinit(ubc_nwins, HASH_LIST, M_TEMP, M_NOWAIT,
180 1.2 chs &ubc_object.hashmask);
181 1.2 chs for (i = 0; i <= ubc_object.hashmask; i++) {
182 1.2 chs LIST_INIT(&ubc_object.hash[i]);
183 1.2 chs }
184 1.2 chs
185 1.2 chs if (uvm_map(kernel_map, (vaddr_t *)&ubc_object.kva,
186 1.11 chs ubc_nwins << ubc_winshift, &ubc_object.uobj, 0, (vsize_t)va,
187 1.2 chs UVM_MAPFLAG(UVM_PROT_ALL, UVM_PROT_ALL, UVM_INH_NONE,
188 1.9 chs UVM_ADV_RANDOM, UVM_FLAG_NOMERGE)) != 0) {
189 1.2 chs panic("ubc_init: failed to map ubc_object\n");
190 1.2 chs }
191 1.2 chs UVMHIST_INIT(ubchist, 300);
192 1.2 chs }
193 1.2 chs
194 1.2 chs
195 1.2 chs /*
196 1.2 chs * ubc_fault: fault routine for ubc mapping
197 1.2 chs */
198 1.11 chs int
199 1.2 chs ubc_fault(ufi, ign1, ign2, ign3, ign4, fault_type, access_type, flags)
200 1.2 chs struct uvm_faultinfo *ufi;
201 1.2 chs vaddr_t ign1;
202 1.2 chs vm_page_t *ign2;
203 1.2 chs int ign3, ign4;
204 1.2 chs vm_fault_t fault_type;
205 1.2 chs vm_prot_t access_type;
206 1.2 chs int flags;
207 1.2 chs {
208 1.2 chs struct uvm_object *uobj;
209 1.2 chs struct vnode *vp;
210 1.2 chs struct ubc_map *umap;
211 1.2 chs vaddr_t va, eva, ubc_offset, slot_offset;
212 1.5 chs int i, error, rv, npages;
213 1.11 chs struct vm_page *pgs[(1 << ubc_winshift) >> PAGE_SHIFT], *pg;
214 1.2 chs UVMHIST_FUNC("ubc_fault"); UVMHIST_CALLED(ubchist);
215 1.2 chs
216 1.2 chs /*
217 1.2 chs * no need to try with PGO_LOCKED...
218 1.2 chs * we don't need to have the map locked since we know that
219 1.2 chs * no one will mess with it until our reference is released.
220 1.2 chs */
221 1.2 chs if (flags & PGO_LOCKED) {
222 1.2 chs #if 0
223 1.8 chs return EBUSY;
224 1.2 chs #else
225 1.2 chs uvmfault_unlockall(ufi, NULL, &ubc_object.uobj, NULL);
226 1.2 chs flags &= ~PGO_LOCKED;
227 1.2 chs #endif
228 1.2 chs }
229 1.2 chs
230 1.2 chs va = ufi->orig_rvaddr;
231 1.2 chs ubc_offset = va - (vaddr_t)ubc_object.kva;
232 1.2 chs
233 1.2 chs UVMHIST_LOG(ubchist, "va 0x%lx ubc_offset 0x%lx at %d",
234 1.2 chs va, ubc_offset, access_type,0);
235 1.2 chs
236 1.11 chs umap = &ubc_object.umap[ubc_offset >> ubc_winshift];
237 1.2 chs KASSERT(umap->refcount != 0);
238 1.4 enami slot_offset = trunc_page(ubc_offset & (ubc_winsize - 1));
239 1.2 chs
240 1.2 chs /* no umap locking needed since we have a ref on the umap */
241 1.2 chs uobj = umap->uobj;
242 1.2 chs vp = (struct vnode *)uobj;
243 1.2 chs KASSERT(uobj != NULL);
244 1.2 chs
245 1.4 enami npages = (ubc_winsize - slot_offset) >> PAGE_SHIFT;
246 1.2 chs
247 1.2 chs /*
248 1.2 chs * XXXUBC
249 1.2 chs * if npages is more than 1 we have to be sure that
250 1.2 chs * we set PGO_OVERWRITE correctly.
251 1.2 chs */
252 1.2 chs if (access_type == VM_PROT_WRITE) {
253 1.2 chs npages = 1;
254 1.2 chs }
255 1.2 chs
256 1.2 chs again:
257 1.2 chs memset(pgs, 0, sizeof (pgs));
258 1.2 chs simple_lock(&uobj->vmobjlock);
259 1.2 chs
260 1.2 chs UVMHIST_LOG(ubchist, "slot_offset 0x%x writeoff 0x%x writelen 0x%x "
261 1.2 chs "u_size 0x%x", slot_offset, umap->writeoff, umap->writelen,
262 1.2 chs vp->v_uvm.u_size);
263 1.2 chs
264 1.2 chs if (access_type & VM_PROT_WRITE &&
265 1.2 chs slot_offset >= umap->writeoff &&
266 1.2 chs (slot_offset + PAGE_SIZE <= umap->writeoff + umap->writelen ||
267 1.2 chs slot_offset + PAGE_SIZE >= vp->v_uvm.u_size - umap->offset)) {
268 1.2 chs UVMHIST_LOG(ubchist, "setting PGO_OVERWRITE", 0,0,0,0);
269 1.2 chs flags |= PGO_OVERWRITE;
270 1.2 chs }
271 1.2 chs else { UVMHIST_LOG(ubchist, "NOT setting PGO_OVERWRITE", 0,0,0,0); }
272 1.2 chs /* XXX be sure to zero any part of the page past EOF */
273 1.2 chs
274 1.2 chs /*
275 1.2 chs * XXX
276 1.2 chs * ideally we'd like to pre-fault all of the pages we're overwriting.
277 1.2 chs * so for PGO_OVERWRITE, we should call VOP_GETPAGES() with all of the
278 1.2 chs * pages in [writeoff, writeoff+writesize] instead of just the one.
279 1.2 chs */
280 1.2 chs
281 1.2 chs UVMHIST_LOG(ubchist, "getpages vp %p offset 0x%x npages %d",
282 1.2 chs uobj, umap->offset + slot_offset, npages, 0);
283 1.2 chs
284 1.5 chs error = VOP_GETPAGES(vp, umap->offset + slot_offset, pgs, &npages, 0,
285 1.5 chs access_type, 0, flags);
286 1.5 chs UVMHIST_LOG(ubchist, "getpages error %d npages %d", error, npages,0,0);
287 1.2 chs
288 1.5 chs if (error == EAGAIN) {
289 1.2 chs tsleep(&lbolt, PVM, "ubc_fault", 0);
290 1.2 chs goto again;
291 1.2 chs }
292 1.5 chs if (error) {
293 1.10 chs return error;
294 1.5 chs }
295 1.2 chs if (npages == 0) {
296 1.8 chs return 0;
297 1.2 chs }
298 1.2 chs
299 1.2 chs va = ufi->orig_rvaddr;
300 1.2 chs eva = ufi->orig_rvaddr + (npages << PAGE_SHIFT);
301 1.2 chs
302 1.2 chs UVMHIST_LOG(ubchist, "va 0x%lx eva 0x%lx", va, eva, 0,0);
303 1.2 chs simple_lock(&uobj->vmobjlock);
304 1.2 chs for (i = 0; va < eva; i++, va += PAGE_SIZE) {
305 1.2 chs UVMHIST_LOG(ubchist, "pgs[%d] = %p", i, pgs[i],0,0);
306 1.2 chs pg = pgs[i];
307 1.2 chs
308 1.2 chs if (pg == NULL || pg == PGO_DONTCARE) {
309 1.2 chs continue;
310 1.2 chs }
311 1.2 chs if (pg->flags & PG_WANTED) {
312 1.2 chs wakeup(pg);
313 1.2 chs }
314 1.2 chs KASSERT((pg->flags & PG_FAKE) == 0);
315 1.2 chs if (pg->flags & PG_RELEASED) {
316 1.2 chs rv = uobj->pgops->pgo_releasepg(pg, NULL);
317 1.2 chs KASSERT(rv);
318 1.2 chs continue;
319 1.2 chs }
320 1.2 chs KASSERT(access_type == VM_PROT_READ ||
321 1.2 chs (pg->flags & PG_RDONLY) == 0);
322 1.2 chs
323 1.2 chs uvm_lock_pageq();
324 1.2 chs uvm_pageactivate(pg);
325 1.2 chs uvm_unlock_pageq();
326 1.2 chs
327 1.2 chs pmap_enter(ufi->orig_map->pmap, va, VM_PAGE_TO_PHYS(pg),
328 1.3 chs VM_PROT_READ | VM_PROT_WRITE, access_type);
329 1.2 chs
330 1.2 chs pg->flags &= ~(PG_BUSY);
331 1.2 chs UVM_PAGE_OWN(pg, NULL);
332 1.2 chs }
333 1.2 chs simple_unlock(&uobj->vmobjlock);
334 1.8 chs return 0;
335 1.2 chs }
336 1.2 chs
337 1.2 chs /*
338 1.2 chs * local functions
339 1.2 chs */
340 1.2 chs
341 1.11 chs struct ubc_map *
342 1.2 chs ubc_find_mapping(uobj, offset)
343 1.2 chs struct uvm_object *uobj;
344 1.2 chs voff_t offset;
345 1.2 chs {
346 1.2 chs struct ubc_map *umap;
347 1.2 chs
348 1.2 chs LIST_FOREACH(umap, &ubc_object.hash[UBC_HASH(uobj, offset)], hash) {
349 1.2 chs if (umap->uobj == uobj && umap->offset == offset) {
350 1.2 chs return umap;
351 1.2 chs }
352 1.2 chs }
353 1.2 chs return NULL;
354 1.2 chs }
355 1.2 chs
356 1.2 chs
357 1.2 chs /*
358 1.2 chs * ubc interface functions
359 1.2 chs */
360 1.2 chs
361 1.2 chs /*
362 1.2 chs * ubc_alloc: allocate a buffer mapping
363 1.2 chs */
364 1.2 chs void *
365 1.2 chs ubc_alloc(uobj, offset, lenp, flags)
366 1.2 chs struct uvm_object *uobj;
367 1.2 chs voff_t offset;
368 1.2 chs vsize_t *lenp;
369 1.2 chs int flags;
370 1.2 chs {
371 1.2 chs int s;
372 1.6 chs vaddr_t slot_offset, va;
373 1.2 chs struct ubc_map *umap;
374 1.6 chs voff_t umap_offset;
375 1.2 chs UVMHIST_FUNC("ubc_alloc"); UVMHIST_CALLED(ubchist);
376 1.2 chs
377 1.2 chs UVMHIST_LOG(ubchist, "uobj %p offset 0x%lx len 0x%lx filesize 0x%x",
378 1.2 chs uobj, offset, *lenp, ((struct uvm_vnode *)uobj)->u_size);
379 1.2 chs
380 1.6 chs umap_offset = (offset & ~((voff_t)ubc_winsize - 1));
381 1.4 enami slot_offset = (vaddr_t)(offset & ((voff_t)ubc_winsize - 1));
382 1.4 enami *lenp = min(*lenp, ubc_winsize - slot_offset);
383 1.2 chs
384 1.2 chs /*
385 1.2 chs * the vnode is always locked here, so we don't need to add a ref.
386 1.2 chs */
387 1.2 chs
388 1.2 chs s = splbio();
389 1.2 chs
390 1.2 chs again:
391 1.2 chs simple_lock(&ubc_object.uobj.vmobjlock);
392 1.2 chs umap = ubc_find_mapping(uobj, umap_offset);
393 1.2 chs if (umap == NULL) {
394 1.2 chs umap = TAILQ_FIRST(UBC_QUEUE(offset));
395 1.2 chs if (umap == NULL) {
396 1.2 chs simple_unlock(&ubc_object.uobj.vmobjlock);
397 1.2 chs tsleep(&lbolt, PVM, "ubc_alloc", 0);
398 1.2 chs goto again;
399 1.2 chs }
400 1.2 chs
401 1.2 chs /*
402 1.2 chs * remove from old hash (if any),
403 1.2 chs * add to new hash.
404 1.2 chs */
405 1.2 chs
406 1.2 chs if (umap->uobj != NULL) {
407 1.2 chs LIST_REMOVE(umap, hash);
408 1.2 chs }
409 1.2 chs
410 1.2 chs umap->uobj = uobj;
411 1.2 chs umap->offset = umap_offset;
412 1.2 chs
413 1.2 chs LIST_INSERT_HEAD(&ubc_object.hash[UBC_HASH(uobj, umap_offset)],
414 1.2 chs umap, hash);
415 1.2 chs
416 1.2 chs va = (vaddr_t)(ubc_object.kva +
417 1.11 chs ((umap - ubc_object.umap) << ubc_winshift));
418 1.4 enami pmap_remove(pmap_kernel(), va, va + ubc_winsize);
419 1.2 chs }
420 1.2 chs
421 1.2 chs if (umap->refcount == 0) {
422 1.2 chs TAILQ_REMOVE(UBC_QUEUE(offset), umap, inactive);
423 1.2 chs }
424 1.2 chs
425 1.2 chs #ifdef DIAGNOSTIC
426 1.2 chs if ((flags & UBC_WRITE) &&
427 1.2 chs (umap->writeoff || umap->writelen)) {
428 1.2 chs panic("ubc_fault: concurrent writes vp %p", uobj);
429 1.2 chs }
430 1.2 chs #endif
431 1.2 chs if (flags & UBC_WRITE) {
432 1.2 chs umap->writeoff = slot_offset;
433 1.2 chs umap->writelen = *lenp;
434 1.2 chs }
435 1.2 chs
436 1.2 chs umap->refcount++;
437 1.2 chs simple_unlock(&ubc_object.uobj.vmobjlock);
438 1.2 chs splx(s);
439 1.2 chs UVMHIST_LOG(ubchist, "umap %p refs %d va %p",
440 1.2 chs umap, umap->refcount,
441 1.11 chs ubc_object.kva + ((umap - ubc_object.umap) << ubc_winshift),
442 1.11 chs 0);
443 1.2 chs
444 1.2 chs return ubc_object.kva +
445 1.11 chs ((umap - ubc_object.umap) << ubc_winshift) + slot_offset;
446 1.2 chs }
447 1.2 chs
448 1.2 chs
449 1.2 chs void
450 1.2 chs ubc_release(va, wlen)
451 1.2 chs void *va;
452 1.2 chs vsize_t wlen;
453 1.2 chs {
454 1.2 chs struct ubc_map *umap;
455 1.2 chs struct uvm_object *uobj;
456 1.2 chs int s;
457 1.2 chs UVMHIST_FUNC("ubc_release"); UVMHIST_CALLED(ubchist);
458 1.2 chs
459 1.2 chs UVMHIST_LOG(ubchist, "va %p", va,0,0,0);
460 1.2 chs
461 1.2 chs s = splbio();
462 1.2 chs simple_lock(&ubc_object.uobj.vmobjlock);
463 1.2 chs
464 1.11 chs umap = &ubc_object.umap[((char *)va - ubc_object.kva) >> ubc_winshift];
465 1.2 chs uobj = umap->uobj;
466 1.2 chs KASSERT(uobj != NULL);
467 1.2 chs
468 1.2 chs umap->writeoff = 0;
469 1.2 chs umap->writelen = 0;
470 1.2 chs umap->refcount--;
471 1.2 chs if (umap->refcount == 0) {
472 1.2 chs if (UBC_RELEASE_UNMAP &&
473 1.2 chs (((struct vnode *)uobj)->v_flag & VTEXT)) {
474 1.2 chs vaddr_t va;
475 1.2 chs
476 1.2 chs /*
477 1.2 chs * if this file is the executable image of
478 1.2 chs * some process, that process will likely have
479 1.2 chs * the file mapped at an alignment other than
480 1.2 chs * what PMAP_PREFER() would like. we'd like
481 1.2 chs * to have process text be able to use the
482 1.2 chs * cache even if someone is also reading the
483 1.2 chs * file, so invalidate mappings of such files
484 1.2 chs * as soon as possible.
485 1.2 chs */
486 1.2 chs
487 1.2 chs va = (vaddr_t)(ubc_object.kva +
488 1.11 chs ((umap - ubc_object.umap) << ubc_winshift));
489 1.4 enami pmap_remove(pmap_kernel(), va, va + ubc_winsize);
490 1.2 chs LIST_REMOVE(umap, hash);
491 1.2 chs umap->uobj = NULL;
492 1.2 chs TAILQ_INSERT_HEAD(UBC_QUEUE(umap->offset), umap,
493 1.2 chs inactive);
494 1.2 chs } else {
495 1.2 chs TAILQ_INSERT_TAIL(UBC_QUEUE(umap->offset), umap,
496 1.2 chs inactive);
497 1.2 chs }
498 1.2 chs }
499 1.2 chs UVMHIST_LOG(ubchist, "umap %p refs %d", umap, umap->refcount,0,0);
500 1.2 chs simple_unlock(&ubc_object.uobj.vmobjlock);
501 1.2 chs splx(s);
502 1.2 chs }
503 1.2 chs
504 1.2 chs
505 1.2 chs /*
506 1.2 chs * removing a range of mappings from the ubc mapping cache.
507 1.2 chs */
508 1.2 chs
509 1.2 chs void
510 1.2 chs ubc_flush(uobj, start, end)
511 1.2 chs struct uvm_object *uobj;
512 1.2 chs voff_t start, end;
513 1.2 chs {
514 1.2 chs struct ubc_map *umap;
515 1.2 chs vaddr_t va;
516 1.2 chs int s;
517 1.2 chs UVMHIST_FUNC("ubc_flush"); UVMHIST_CALLED(ubchist);
518 1.2 chs
519 1.2 chs UVMHIST_LOG(ubchist, "uobj %p start 0x%lx end 0x%lx",
520 1.2 chs uobj, start, end,0);
521 1.2 chs
522 1.2 chs s = splbio();
523 1.2 chs simple_lock(&ubc_object.uobj.vmobjlock);
524 1.2 chs for (umap = ubc_object.umap;
525 1.2 chs umap < &ubc_object.umap[ubc_nwins];
526 1.2 chs umap++) {
527 1.2 chs
528 1.2 chs if (umap->uobj != uobj ||
529 1.2 chs umap->offset < start ||
530 1.2 chs (umap->offset >= end && end != 0) ||
531 1.2 chs umap->refcount > 0) {
532 1.2 chs continue;
533 1.2 chs }
534 1.2 chs
535 1.2 chs /*
536 1.2 chs * remove from hash,
537 1.2 chs * move to head of inactive queue.
538 1.2 chs */
539 1.2 chs
540 1.2 chs va = (vaddr_t)(ubc_object.kva +
541 1.11 chs ((umap - ubc_object.umap) << ubc_winshift));
542 1.4 enami pmap_remove(pmap_kernel(), va, va + ubc_winsize);
543 1.2 chs
544 1.2 chs LIST_REMOVE(umap, hash);
545 1.2 chs umap->uobj = NULL;
546 1.2 chs TAILQ_REMOVE(UBC_QUEUE(umap->offset), umap, inactive);
547 1.2 chs TAILQ_INSERT_HEAD(UBC_QUEUE(umap->offset), umap, inactive);
548 1.2 chs }
549 1.2 chs simple_unlock(&ubc_object.uobj.vmobjlock);
550 1.2 chs splx(s);
551 1.2 chs }
552