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