4 * Copyright (c) 1991, 1993
5 * The Regents of the University of California. All rights reserved.
6 * Copyright (c) 1994 John S. Dyson
8 * Copyright (c) 1994 David Greenman
12 * This code is derived from software contributed to Berkeley by
13 * The Mach Operating System project at Carnegie-Mellon University.
15 * Redistribution and use in source and binary forms, with or without
16 * modification, are permitted provided that the following conditions
18 * 1. Redistributions of source code must retain the above copyright
19 * notice, this list of conditions and the following disclaimer.
20 * 2. Redistributions in binary form must reproduce the above copyright
21 * notice, this list of conditions and the following disclaimer in the
22 * documentation and/or other materials provided with the distribution.
23 * 3. All advertising materials mentioning features or use of this software
24 * must display the following acknowledgement:
25 * This product includes software developed by the University of
26 * California, Berkeley and its contributors.
27 * 4. Neither the name of the University nor the names of its contributors
28 * may be used to endorse or promote products derived from this software
29 * without specific prior written permission.
31 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
32 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
33 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
34 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
35 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
36 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
37 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
38 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
39 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
40 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
43 * from: @(#)vm_fault.c 8.4 (Berkeley) 1/12/94
46 * Copyright (c) 1987, 1990 Carnegie-Mellon University.
47 * All rights reserved.
49 * Authors: Avadis Tevanian, Jr., Michael Wayne Young
51 * Permission to use, copy, modify and distribute this software and
52 * its documentation is hereby granted, provided that both the copyright
53 * notice and this permission notice appear in all copies of the
54 * software, derivative works or modified versions, and any portions
55 * thereof, and that both notices appear in supporting documentation.
57 * CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS"
58 * CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND
59 * FOR ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
61 * Carnegie Mellon requests users of this software to return to
63 * Software Distribution Coordinator or Software.Distribution@CS.CMU.EDU
64 * School of Computer Science
65 * Carnegie Mellon University
66 * Pittsburgh PA 15213-3890
68 * any improvements or extensions that they make and grant Carnegie the
69 * rights to redistribute these changes.
71 * $FreeBSD: src/sys/vm/vm_fault.c,v 1.108.2.8 2002/02/26 05:49:27 silby Exp $
72 * $DragonFly: src/sys/vm/vm_fault.c,v 1.47 2008/07/01 02:02:56 dillon Exp $
76 * Page fault handling module.
79 #include <sys/param.h>
80 #include <sys/systm.h>
81 #include <sys/kernel.h>
83 #include <sys/vnode.h>
84 #include <sys/resourcevar.h>
85 #include <sys/vmmeter.h>
86 #include <sys/vkernel.h>
88 #include <sys/sysctl.h>
90 #include <cpu/lwbuf.h>
93 #include <vm/vm_param.h>
95 #include <vm/vm_map.h>
96 #include <vm/vm_object.h>
97 #include <vm/vm_page.h>
98 #include <vm/vm_pageout.h>
99 #include <vm/vm_kern.h>
100 #include <vm/vm_pager.h>
101 #include <vm/vnode_pager.h>
102 #include <vm/vm_extern.h>
104 #include <sys/thread2.h>
105 #include <vm/vm_page2.h>
113 vm_object_t first_object;
114 vm_prot_t first_prot;
116 vm_map_entry_t entry;
117 int lookup_still_valid;
126 static int debug_cluster = 0;
127 SYSCTL_INT(_vm, OID_AUTO, debug_cluster, CTLFLAG_RW, &debug_cluster, 0, "");
129 static int vm_fault_object(struct faultstate *, vm_pindex_t, vm_prot_t);
130 static int vm_fault_vpagetable(struct faultstate *, vm_pindex_t *, vpte_t, int);
132 static int vm_fault_additional_pages (vm_page_t, int, int, vm_page_t *, int *);
134 static int vm_fault_ratelimit(struct vmspace *);
135 static void vm_set_nosync(vm_page_t m, vm_map_entry_t entry);
136 static void vm_prefault(pmap_t pmap, vm_offset_t addra, vm_map_entry_t entry,
140 release_page(struct faultstate *fs)
142 vm_page_deactivate(fs->m);
143 vm_page_wakeup(fs->m);
148 * NOTE: Once unlocked any cached fs->entry becomes invalid, any reuse
149 * requires relocking and then checking the timestamp.
151 * NOTE: vm_map_lock_read() does not bump fs->map->timestamp so we do
152 * not have to update fs->map_generation here.
154 * NOTE: This function can fail due to a deadlock against the caller's
155 * holding of a vm_page BUSY.
158 relock_map(struct faultstate *fs)
162 if (fs->lookup_still_valid == FALSE && fs->map) {
163 error = vm_map_lock_read_to(fs->map);
165 fs->lookup_still_valid = TRUE;
173 unlock_map(struct faultstate *fs)
175 if (fs->lookup_still_valid && fs->map) {
176 vm_map_lookup_done(fs->map, fs->entry, 0);
177 fs->lookup_still_valid = FALSE;
182 * Clean up after a successful call to vm_fault_object() so another call
183 * to vm_fault_object() can be made.
186 _cleanup_successful_fault(struct faultstate *fs, int relock)
188 if (fs->object != fs->first_object) {
189 vm_page_free(fs->first_m);
190 vm_object_pip_wakeup(fs->object);
193 fs->object = fs->first_object;
194 if (relock && fs->lookup_still_valid == FALSE) {
196 vm_map_lock_read(fs->map);
197 fs->lookup_still_valid = TRUE;
202 _unlock_things(struct faultstate *fs, int dealloc)
204 _cleanup_successful_fault(fs, 0);
206 /*vm_object_deallocate(fs->first_object);*/
207 /*fs->first_object = NULL; drop used later on */
210 if (fs->vp != NULL) {
216 #define unlock_things(fs) _unlock_things(fs, 0)
217 #define unlock_and_deallocate(fs) _unlock_things(fs, 1)
218 #define cleanup_successful_fault(fs) _cleanup_successful_fault(fs, 1)
223 * Determine if the pager for the current object *might* contain the page.
225 * We only need to try the pager if this is not a default object (default
226 * objects are zero-fill and have no real pager), and if we are not taking
227 * a wiring fault or if the FS entry is wired.
229 #define TRYPAGER(fs) \
230 (fs->object->type != OBJT_DEFAULT && \
231 (((fs->fault_flags & VM_FAULT_WIRE_MASK) == 0) || fs->wired))
236 * Handle a page fault occuring at the given address, requiring the given
237 * permissions, in the map specified. If successful, the page is inserted
238 * into the associated physical map.
240 * NOTE: The given address should be truncated to the proper page address.
242 * KERN_SUCCESS is returned if the page fault is handled; otherwise,
243 * a standard error specifying why the fault is fatal is returned.
245 * The map in question must be referenced, and remains so.
246 * The caller may hold no locks.
247 * No other requirements.
250 vm_fault(vm_map_t map, vm_offset_t vaddr, vm_prot_t fault_type, int fault_flags)
253 vm_pindex_t first_pindex;
254 struct faultstate fs;
257 mycpu->gd_cnt.v_vm_faults++;
261 fs.fault_flags = fault_flags;
264 lwkt_gettoken(&map->token);
268 * Find the vm_map_entry representing the backing store and resolve
269 * the top level object and page index. This may have the side
270 * effect of executing a copy-on-write on the map entry and/or
271 * creating a shadow object, but will not COW any actual VM pages.
273 * On success fs.map is left read-locked and various other fields
274 * are initialized but not otherwise referenced or locked.
276 * NOTE! vm_map_lookup will try to upgrade the fault_type to
277 * VM_FAULT_WRITE if the map entry is a virtual page table and also
278 * writable, so we can set the 'A'accessed bit in the virtual page
282 result = vm_map_lookup(&fs.map, vaddr, fault_type,
283 &fs.entry, &fs.first_object,
284 &first_pindex, &fs.first_prot, &fs.wired);
287 * If the lookup failed or the map protections are incompatible,
288 * the fault generally fails. However, if the caller is trying
289 * to do a user wiring we have more work to do.
291 if (result != KERN_SUCCESS) {
292 if (result != KERN_PROTECTION_FAILURE ||
293 (fs.fault_flags & VM_FAULT_WIRE_MASK) != VM_FAULT_USER_WIRE)
295 if (result == KERN_INVALID_ADDRESS && growstack &&
296 map != &kernel_map && curproc != NULL) {
297 result = vm_map_growstack(curproc, vaddr);
298 if (result == KERN_SUCCESS) {
302 result = KERN_FAILURE;
308 * If we are user-wiring a r/w segment, and it is COW, then
309 * we need to do the COW operation. Note that we don't
310 * currently COW RO sections now, because it is NOT desirable
311 * to COW .text. We simply keep .text from ever being COW'ed
312 * and take the heat that one cannot debug wired .text sections.
314 result = vm_map_lookup(&fs.map, vaddr,
315 VM_PROT_READ|VM_PROT_WRITE|
316 VM_PROT_OVERRIDE_WRITE,
317 &fs.entry, &fs.first_object,
318 &first_pindex, &fs.first_prot,
320 if (result != KERN_SUCCESS) {
321 result = KERN_FAILURE;
326 * If we don't COW now, on a user wire, the user will never
327 * be able to write to the mapping. If we don't make this
328 * restriction, the bookkeeping would be nearly impossible.
330 if ((fs.entry->protection & VM_PROT_WRITE) == 0)
331 fs.entry->max_protection &= ~VM_PROT_WRITE;
335 * fs.map is read-locked
337 * Misc checks. Save the map generation number to detect races.
339 fs.map_generation = fs.map->timestamp;
341 if (fs.entry->eflags & (MAP_ENTRY_NOFAULT | MAP_ENTRY_KSTACK)) {
342 if (fs.entry->eflags & MAP_ENTRY_NOFAULT) {
343 panic("vm_fault: fault on nofault entry, addr: %p",
346 if ((fs.entry->eflags & MAP_ENTRY_KSTACK) &&
347 vaddr >= fs.entry->start &&
348 vaddr < fs.entry->start + PAGE_SIZE) {
349 panic("vm_fault: fault on stack guard, addr: %p",
355 * A system map entry may return a NULL object. No object means
356 * no pager means an unrecoverable kernel fault.
358 if (fs.first_object == NULL) {
359 panic("vm_fault: unrecoverable fault at %p in entry %p",
360 (void *)vaddr, fs.entry);
364 * Bump the paging-in-progress count to prevent size changes (e.g.
365 * truncation operations) during I/O. This must be done after
366 * obtaining the vnode lock in order to avoid possible deadlocks.
368 vm_object_hold(fs.first_object);
369 fs.vp = vnode_pager_lock(fs.first_object);
371 fs.lookup_still_valid = TRUE;
373 fs.object = fs.first_object; /* so unlock_and_deallocate works */
376 * If the entry is wired we cannot change the page protection.
379 fault_type = fs.first_prot;
382 * The page we want is at (first_object, first_pindex), but if the
383 * vm_map_entry is VM_MAPTYPE_VPAGETABLE we have to traverse the
384 * page table to figure out the actual pindex.
386 * NOTE! DEVELOPMENT IN PROGRESS, THIS IS AN INITIAL IMPLEMENTATION
389 if (fs.entry->maptype == VM_MAPTYPE_VPAGETABLE) {
390 result = vm_fault_vpagetable(&fs, &first_pindex,
391 fs.entry->aux.master_pde,
393 if (result == KERN_TRY_AGAIN) {
394 vm_object_drop(fs.first_object);
397 if (result != KERN_SUCCESS)
402 * Now we have the actual (object, pindex), fault in the page. If
403 * vm_fault_object() fails it will unlock and deallocate the FS
404 * data. If it succeeds everything remains locked and fs->object
405 * will have an additional PIP count if it is not equal to
408 * vm_fault_object will set fs->prot for the pmap operation. It is
409 * allowed to set VM_PROT_WRITE if fault_type == VM_PROT_READ if the
410 * page can be safely written. However, it will force a read-only
411 * mapping for a read fault if the memory is managed by a virtual
415 result = vm_fault_object(&fs, first_pindex, fault_type);
417 if (result == KERN_TRY_AGAIN) {
418 vm_object_drop(fs.first_object);
421 if (result != KERN_SUCCESS)
425 * On success vm_fault_object() does not unlock or deallocate, and fs.m
426 * will contain a busied page.
428 * Enter the page into the pmap and do pmap-related adjustments.
430 vm_page_flag_set(fs.m, PG_REFERENCED);
431 pmap_enter(fs.map->pmap, vaddr, fs.m, fs.prot, fs.wired);
433 /*KKASSERT(fs.m->queue == PQ_NONE); page-in op may deactivate page */
434 KKASSERT(fs.m->flags & PG_BUSY);
437 * If the page is not wired down, then put it where the pageout daemon
440 if (fs.fault_flags & VM_FAULT_WIRE_MASK) {
444 vm_page_unwire(fs.m, 1);
446 vm_page_activate(fs.m);
448 vm_page_wakeup(fs.m);
451 * Burst in a few more pages if possible. The fs.map should still
452 * be locked. To avoid interlocking against a vnode->getblk
453 * operation we had to be sure to unbusy our primary vm_page above
456 if (fault_flags & VM_FAULT_BURST) {
457 if ((fs.fault_flags & VM_FAULT_WIRE_MASK) == 0 &&
459 vm_prefault(fs.map->pmap, vaddr, fs.entry, fs.prot);
464 * Unlock everything, and return
468 if (curthread->td_lwp) {
470 curthread->td_lwp->lwp_ru.ru_majflt++;
472 curthread->td_lwp->lwp_ru.ru_minflt++;
476 /*vm_object_deallocate(fs.first_object);*/
478 /*fs.first_object = NULL; must still drop later */
480 result = KERN_SUCCESS;
483 vm_object_drop(fs.first_object);
484 lwkt_reltoken(&map->token);
489 * Fault in the specified virtual address in the current process map,
490 * returning a held VM page or NULL. See vm_fault_page() for more
496 vm_fault_page_quick(vm_offset_t va, vm_prot_t fault_type, int *errorp)
498 struct lwp *lp = curthread->td_lwp;
501 m = vm_fault_page(&lp->lwp_vmspace->vm_map, va,
502 fault_type, VM_FAULT_NORMAL, errorp);
507 * Fault in the specified virtual address in the specified map, doing all
508 * necessary manipulation of the object store and all necessary I/O. Return
509 * a held VM page or NULL, and set *errorp. The related pmap is not
512 * The returned page will be properly dirtied if VM_PROT_WRITE was specified,
513 * and marked PG_REFERENCED as well.
515 * If the page cannot be faulted writable and VM_PROT_WRITE was specified, an
516 * error will be returned.
521 vm_fault_page(vm_map_t map, vm_offset_t vaddr, vm_prot_t fault_type,
522 int fault_flags, int *errorp)
524 vm_pindex_t first_pindex;
525 struct faultstate fs;
527 vm_prot_t orig_fault_type = fault_type;
529 mycpu->gd_cnt.v_vm_faults++;
533 fs.fault_flags = fault_flags;
534 KKASSERT((fault_flags & VM_FAULT_WIRE_MASK) == 0);
536 lwkt_gettoken(&map->token);
540 * Find the vm_map_entry representing the backing store and resolve
541 * the top level object and page index. This may have the side
542 * effect of executing a copy-on-write on the map entry and/or
543 * creating a shadow object, but will not COW any actual VM pages.
545 * On success fs.map is left read-locked and various other fields
546 * are initialized but not otherwise referenced or locked.
548 * NOTE! vm_map_lookup will upgrade the fault_type to VM_FAULT_WRITE
549 * if the map entry is a virtual page table and also writable,
550 * so we can set the 'A'accessed bit in the virtual page table entry.
553 result = vm_map_lookup(&fs.map, vaddr, fault_type,
554 &fs.entry, &fs.first_object,
555 &first_pindex, &fs.first_prot, &fs.wired);
557 if (result != KERN_SUCCESS) {
564 * fs.map is read-locked
566 * Misc checks. Save the map generation number to detect races.
568 fs.map_generation = fs.map->timestamp;
570 if (fs.entry->eflags & MAP_ENTRY_NOFAULT) {
571 panic("vm_fault: fault on nofault entry, addr: %lx",
576 * A system map entry may return a NULL object. No object means
577 * no pager means an unrecoverable kernel fault.
579 if (fs.first_object == NULL) {
580 panic("vm_fault: unrecoverable fault at %p in entry %p",
581 (void *)vaddr, fs.entry);
585 * Make a reference to this object to prevent its disposal while we
586 * are messing with it. Once we have the reference, the map is free
587 * to be diddled. Since objects reference their shadows (and copies),
588 * they will stay around as well.
590 * The reference should also prevent an unexpected collapse of the
591 * parent that might move pages from the current object into the
592 * parent unexpectedly, resulting in corruption.
594 * Bump the paging-in-progress count to prevent size changes (e.g.
595 * truncation operations) during I/O. This must be done after
596 * obtaining the vnode lock in order to avoid possible deadlocks.
598 vm_object_hold(fs.first_object);
599 fs.vp = vnode_pager_lock(fs.first_object);
601 fs.lookup_still_valid = TRUE;
603 fs.object = fs.first_object; /* so unlock_and_deallocate works */
606 * If the entry is wired we cannot change the page protection.
609 fault_type = fs.first_prot;
612 * The page we want is at (first_object, first_pindex), but if the
613 * vm_map_entry is VM_MAPTYPE_VPAGETABLE we have to traverse the
614 * page table to figure out the actual pindex.
616 * NOTE! DEVELOPMENT IN PROGRESS, THIS IS AN INITIAL IMPLEMENTATION
619 if (fs.entry->maptype == VM_MAPTYPE_VPAGETABLE) {
620 result = vm_fault_vpagetable(&fs, &first_pindex,
621 fs.entry->aux.master_pde,
623 if (result == KERN_TRY_AGAIN) {
624 vm_object_drop(fs.first_object);
627 if (result != KERN_SUCCESS) {
635 * Now we have the actual (object, pindex), fault in the page. If
636 * vm_fault_object() fails it will unlock and deallocate the FS
637 * data. If it succeeds everything remains locked and fs->object
638 * will have an additinal PIP count if it is not equal to
641 result = vm_fault_object(&fs, first_pindex, fault_type);
643 if (result == KERN_TRY_AGAIN) {
644 vm_object_drop(fs.first_object);
647 if (result != KERN_SUCCESS) {
653 if ((orig_fault_type & VM_PROT_WRITE) &&
654 (fs.prot & VM_PROT_WRITE) == 0) {
655 *errorp = KERN_PROTECTION_FAILURE;
656 unlock_and_deallocate(&fs);
662 * Update the pmap. We really only have to do this if a COW
663 * occured to replace the read-only page with the new page. For
664 * now just do it unconditionally. XXX
666 pmap_enter(fs.map->pmap, vaddr, fs.m, fs.prot, fs.wired);
667 vm_page_flag_set(fs.m, PG_REFERENCED);
670 * On success vm_fault_object() does not unlock or deallocate, and fs.m
671 * will contain a busied page. So we must unlock here after having
672 * messed with the pmap.
677 * Return a held page. We are not doing any pmap manipulation so do
678 * not set PG_MAPPED. However, adjust the page flags according to
679 * the fault type because the caller may not use a managed pmapping
680 * (so we don't want to lose the fact that the page will be dirtied
681 * if a write fault was specified).
684 if (fault_type & VM_PROT_WRITE)
688 * Unbusy the page by activating it. It remains held and will not
691 vm_page_activate(fs.m);
693 if (curthread->td_lwp) {
695 curthread->td_lwp->lwp_ru.ru_majflt++;
697 curthread->td_lwp->lwp_ru.ru_minflt++;
702 * Unlock everything, and return the held page.
704 vm_page_wakeup(fs.m);
705 /*vm_object_deallocate(fs.first_object);*/
706 /*fs.first_object = NULL; */
711 vm_object_drop(fs.first_object);
712 lwkt_reltoken(&map->token);
717 * Fault in the specified (object,offset), dirty the returned page as
718 * needed. If the requested fault_type cannot be done NULL and an
721 * A held (but not busied) page is returned.
726 vm_fault_object_page(vm_object_t object, vm_ooffset_t offset,
727 vm_prot_t fault_type, int fault_flags, int *errorp)
730 vm_pindex_t first_pindex;
731 struct faultstate fs;
732 struct vm_map_entry entry;
734 ASSERT_LWKT_TOKEN_HELD(vm_object_token(object));
735 bzero(&entry, sizeof(entry));
736 entry.object.vm_object = object;
737 entry.maptype = VM_MAPTYPE_NORMAL;
738 entry.protection = entry.max_protection = fault_type;
742 fs.fault_flags = fault_flags;
744 KKASSERT((fault_flags & VM_FAULT_WIRE_MASK) == 0);
748 fs.first_object = object;
749 first_pindex = OFF_TO_IDX(offset);
751 fs.first_prot = fault_type;
753 /*fs.map_generation = 0; unused */
756 * Make a reference to this object to prevent its disposal while we
757 * are messing with it. Once we have the reference, the map is free
758 * to be diddled. Since objects reference their shadows (and copies),
759 * they will stay around as well.
761 * The reference should also prevent an unexpected collapse of the
762 * parent that might move pages from the current object into the
763 * parent unexpectedly, resulting in corruption.
765 * Bump the paging-in-progress count to prevent size changes (e.g.
766 * truncation operations) during I/O. This must be done after
767 * obtaining the vnode lock in order to avoid possible deadlocks.
769 fs.vp = vnode_pager_lock(fs.first_object);
771 fs.lookup_still_valid = TRUE;
773 fs.object = fs.first_object; /* so unlock_and_deallocate works */
776 /* XXX future - ability to operate on VM object using vpagetable */
777 if (fs.entry->maptype == VM_MAPTYPE_VPAGETABLE) {
778 result = vm_fault_vpagetable(&fs, &first_pindex,
779 fs.entry->aux.master_pde,
781 if (result == KERN_TRY_AGAIN)
783 if (result != KERN_SUCCESS) {
791 * Now we have the actual (object, pindex), fault in the page. If
792 * vm_fault_object() fails it will unlock and deallocate the FS
793 * data. If it succeeds everything remains locked and fs->object
794 * will have an additinal PIP count if it is not equal to
797 result = vm_fault_object(&fs, first_pindex, fault_type);
799 if (result == KERN_TRY_AGAIN)
801 if (result != KERN_SUCCESS) {
806 if ((fault_type & VM_PROT_WRITE) && (fs.prot & VM_PROT_WRITE) == 0) {
807 *errorp = KERN_PROTECTION_FAILURE;
808 unlock_and_deallocate(&fs);
813 * On success vm_fault_object() does not unlock or deallocate, so we
814 * do it here. Note that the returned fs.m will be busied.
819 * Return a held page. We are not doing any pmap manipulation so do
820 * not set PG_MAPPED. However, adjust the page flags according to
821 * the fault type because the caller may not use a managed pmapping
822 * (so we don't want to lose the fact that the page will be dirtied
823 * if a write fault was specified).
826 if (fault_type & VM_PROT_WRITE)
829 if (fault_flags & VM_FAULT_DIRTY)
831 if (fault_flags & VM_FAULT_UNSWAP)
832 swap_pager_unswapped(fs.m);
835 * Indicate that the page was accessed.
837 vm_page_flag_set(fs.m, PG_REFERENCED);
840 * Unbusy the page by activating it. It remains held and will not
843 vm_page_activate(fs.m);
845 if (curthread->td_lwp) {
847 mycpu->gd_cnt.v_vm_faults++;
848 curthread->td_lwp->lwp_ru.ru_majflt++;
850 curthread->td_lwp->lwp_ru.ru_minflt++;
855 * Unlock everything, and return the held page.
857 vm_page_wakeup(fs.m);
858 /*vm_object_deallocate(fs.first_object);*/
859 /*fs.first_object = NULL; */
866 * Translate the virtual page number (first_pindex) that is relative
867 * to the address space into a logical page number that is relative to the
868 * backing object. Use the virtual page table pointed to by (vpte).
870 * This implements an N-level page table. Any level can terminate the
871 * scan by setting VPTE_PS. A linear mapping is accomplished by setting
872 * VPTE_PS in the master page directory entry set via mcontrol(MADV_SETMAP).
876 vm_fault_vpagetable(struct faultstate *fs, vm_pindex_t *pindex,
877 vpte_t vpte, int fault_type)
880 struct lwbuf lwb_cache;
881 int vshift = VPTE_FRAME_END - PAGE_SHIFT; /* index bits remaining */
882 int result = KERN_SUCCESS;
885 ASSERT_LWKT_TOKEN_HELD(vm_object_token(fs->first_object));
888 * We cannot proceed if the vpte is not valid, not readable
889 * for a read fault, or not writable for a write fault.
891 if ((vpte & VPTE_V) == 0) {
892 unlock_and_deallocate(fs);
893 return (KERN_FAILURE);
895 if ((fault_type & VM_PROT_READ) && (vpte & VPTE_R) == 0) {
896 unlock_and_deallocate(fs);
897 return (KERN_FAILURE);
899 if ((fault_type & VM_PROT_WRITE) && (vpte & VPTE_W) == 0) {
900 unlock_and_deallocate(fs);
901 return (KERN_FAILURE);
903 if ((vpte & VPTE_PS) || vshift == 0)
905 KKASSERT(vshift >= VPTE_PAGE_BITS);
908 * Get the page table page. Nominally we only read the page
909 * table, but since we are actively setting VPTE_M and VPTE_A,
910 * tell vm_fault_object() that we are writing it.
912 * There is currently no real need to optimize this.
914 result = vm_fault_object(fs, (vpte & VPTE_FRAME) >> PAGE_SHIFT,
915 VM_PROT_READ|VM_PROT_WRITE);
916 if (result != KERN_SUCCESS)
920 * Process the returned fs.m and look up the page table
921 * entry in the page table page.
923 vshift -= VPTE_PAGE_BITS;
924 lwb = lwbuf_alloc(fs->m, &lwb_cache);
925 ptep = ((vpte_t *)lwbuf_kva(lwb) +
926 ((*pindex >> vshift) & VPTE_PAGE_MASK));
930 * Page table write-back. If the vpte is valid for the
931 * requested operation, do a write-back to the page table.
933 * XXX VPTE_M is not set properly for page directory pages.
934 * It doesn't get set in the page directory if the page table
935 * is modified during a read access.
937 if ((fault_type & VM_PROT_WRITE) && (vpte & VPTE_V) &&
939 if ((vpte & (VPTE_M|VPTE_A)) != (VPTE_M|VPTE_A)) {
940 atomic_set_long(ptep, VPTE_M | VPTE_A);
941 vm_page_dirty(fs->m);
944 if ((fault_type & VM_PROT_READ) && (vpte & VPTE_V) &&
946 if ((vpte & VPTE_A) == 0) {
947 atomic_set_long(ptep, VPTE_A);
948 vm_page_dirty(fs->m);
952 vm_page_flag_set(fs->m, PG_REFERENCED);
953 vm_page_activate(fs->m);
954 vm_page_wakeup(fs->m);
956 cleanup_successful_fault(fs);
959 * Combine remaining address bits with the vpte.
961 /* JG how many bits from each? */
962 *pindex = ((vpte & VPTE_FRAME) >> PAGE_SHIFT) +
963 (*pindex & ((1L << vshift) - 1));
964 return (KERN_SUCCESS);
969 * This is the core of the vm_fault code.
971 * Do all operations required to fault-in (fs.first_object, pindex). Run
972 * through the shadow chain as necessary and do required COW or virtual
973 * copy operations. The caller has already fully resolved the vm_map_entry
974 * and, if appropriate, has created a copy-on-write layer. All we need to
975 * do is iterate the object chain.
977 * On failure (fs) is unlocked and deallocated and the caller may return or
978 * retry depending on the failure code. On success (fs) is NOT unlocked or
979 * deallocated, fs.m will contained a resolved, busied page, and fs.object
980 * will have an additional PIP count if it is not equal to fs.first_object.
982 * fs->first_object must be held on call.
986 vm_fault_object(struct faultstate *fs,
987 vm_pindex_t first_pindex, vm_prot_t fault_type)
989 vm_object_t next_object;
993 ASSERT_LWKT_TOKEN_HELD(vm_object_token(fs->first_object));
994 fs->prot = fs->first_prot;
995 fs->object = fs->first_object;
996 pindex = first_pindex;
998 vm_object_chain_acquire(fs->first_object);
999 vm_object_pip_add(fs->first_object, 1);
1002 * If a read fault occurs we try to make the page writable if
1003 * possible. There are three cases where we cannot make the
1004 * page mapping writable:
1006 * (1) The mapping is read-only or the VM object is read-only,
1007 * fs->prot above will simply not have VM_PROT_WRITE set.
1009 * (2) If the mapping is a virtual page table we need to be able
1010 * to detect writes so we can set VPTE_M in the virtual page
1013 * (3) If the VM page is read-only or copy-on-write, upgrading would
1014 * just result in an unnecessary COW fault.
1016 * VM_PROT_VPAGED is set if faulting via a virtual page table and
1017 * causes adjustments to the 'M'odify bit to also turn off write
1018 * access to force a re-fault.
1020 if (fs->entry->maptype == VM_MAPTYPE_VPAGETABLE) {
1021 if ((fault_type & VM_PROT_WRITE) == 0)
1022 fs->prot &= ~VM_PROT_WRITE;
1025 /* vm_object_hold(fs->object); implied b/c object == first_object */
1029 * The entire backing chain from first_object to object
1030 * inclusive is chainlocked.
1032 * If the object is dead, we stop here
1034 if (fs->object->flags & OBJ_DEAD) {
1035 vm_object_pip_wakeup(fs->first_object);
1036 vm_object_chain_release_all(fs->first_object,
1038 if (fs->object != fs->first_object)
1039 vm_object_drop(fs->object);
1040 unlock_and_deallocate(fs);
1041 return (KERN_PROTECTION_FAILURE);
1045 * See if the page is resident. Wait/Retry if the page is
1046 * busy (lots of stuff may have changed so we can't continue
1049 * We can theoretically allow the soft-busy case on a read
1050 * fault if the page is marked valid, but since such
1051 * pages are typically already pmap'd, putting that
1052 * special case in might be more effort then it is
1053 * worth. We cannot under any circumstances mess
1054 * around with a vm_page_t->busy page except, perhaps,
1057 fs->m = vm_page_lookup_busy_try(fs->object, pindex,
1060 vm_object_pip_wakeup(fs->first_object);
1061 vm_object_chain_release_all(fs->first_object,
1063 if (fs->object != fs->first_object)
1064 vm_object_drop(fs->object);
1066 vm_page_sleep_busy(fs->m, TRUE, "vmpfw");
1067 mycpu->gd_cnt.v_intrans++;
1068 /*vm_object_deallocate(fs->first_object);*/
1069 /*fs->first_object = NULL;*/
1071 return (KERN_TRY_AGAIN);
1075 * The page is busied for us.
1077 * If reactivating a page from PQ_CACHE we may have
1080 int queue = fs->m->queue;
1081 vm_page_unqueue_nowakeup(fs->m);
1083 if ((queue - fs->m->pc) == PQ_CACHE &&
1084 vm_page_count_severe()) {
1085 vm_page_activate(fs->m);
1086 vm_page_wakeup(fs->m);
1088 vm_object_pip_wakeup(fs->first_object);
1089 vm_object_chain_release_all(fs->first_object,
1091 if (fs->object != fs->first_object)
1092 vm_object_drop(fs->object);
1093 unlock_and_deallocate(fs);
1095 return (KERN_TRY_AGAIN);
1099 * If it still isn't completely valid (readable),
1100 * or if a read-ahead-mark is set on the VM page,
1101 * jump to readrest, else we found the page and
1104 * We can release the spl once we have marked the
1107 if (fs->m->object != &kernel_object) {
1108 if ((fs->m->valid & VM_PAGE_BITS_ALL) !=
1112 if (fs->m->flags & PG_RAM) {
1115 vm_page_flag_clear(fs->m, PG_RAM);
1119 break; /* break to PAGE HAS BEEN FOUND */
1123 * Page is not resident, If this is the search termination
1124 * or the pager might contain the page, allocate a new page.
1126 if (TRYPAGER(fs) || fs->object == fs->first_object) {
1128 * If the page is beyond the object size we fail
1130 if (pindex >= fs->object->size) {
1131 vm_object_pip_wakeup(fs->first_object);
1132 vm_object_chain_release_all(fs->first_object,
1134 if (fs->object != fs->first_object)
1135 vm_object_drop(fs->object);
1136 unlock_and_deallocate(fs);
1137 return (KERN_PROTECTION_FAILURE);
1143 if (fs->didlimit == 0 && curproc != NULL) {
1146 limticks = vm_fault_ratelimit(curproc->p_vmspace);
1148 vm_object_pip_wakeup(fs->first_object);
1149 vm_object_chain_release_all(
1150 fs->first_object, fs->object);
1151 if (fs->object != fs->first_object)
1152 vm_object_drop(fs->object);
1153 unlock_and_deallocate(fs);
1154 tsleep(curproc, 0, "vmrate", limticks);
1156 return (KERN_TRY_AGAIN);
1161 * Allocate a new page for this object/offset pair.
1163 * It is possible for the allocation to race, so
1167 if (!vm_page_count_severe()) {
1168 fs->m = vm_page_alloc(fs->object, pindex,
1169 ((fs->vp || fs->object->backing_object) ?
1170 VM_ALLOC_NULL_OK | VM_ALLOC_NORMAL :
1171 VM_ALLOC_NULL_OK | VM_ALLOC_NORMAL |
1174 if (fs->m == NULL) {
1175 vm_object_pip_wakeup(fs->first_object);
1176 vm_object_chain_release_all(fs->first_object,
1178 if (fs->object != fs->first_object)
1179 vm_object_drop(fs->object);
1180 unlock_and_deallocate(fs);
1182 return (KERN_TRY_AGAIN);
1186 * Fall through to readrest. We have a new page which
1187 * will have to be paged (since m->valid will be 0).
1193 * We have found an invalid or partially valid page, a
1194 * page with a read-ahead mark which might be partially or
1195 * fully valid (and maybe dirty too), or we have allocated
1198 * Attempt to fault-in the page if there is a chance that the
1199 * pager has it, and potentially fault in additional pages
1202 * If TRYPAGER is true then fs.m will be non-NULL and busied
1208 u_char behavior = vm_map_entry_behavior(fs->entry);
1210 if (behavior == MAP_ENTRY_BEHAV_RANDOM)
1216 * If sequential access is detected then attempt
1217 * to deactivate/cache pages behind the scan to
1218 * prevent resource hogging.
1220 * Use of PG_RAM to detect sequential access
1221 * also simulates multi-zone sequential access
1222 * detection for free.
1224 * NOTE: Partially valid dirty pages cannot be
1225 * deactivated without causing NFS picemeal
1228 if ((fs->first_object->type != OBJT_DEVICE) &&
1229 (behavior == MAP_ENTRY_BEHAV_SEQUENTIAL ||
1230 (behavior != MAP_ENTRY_BEHAV_RANDOM &&
1231 (fs->m->flags & PG_RAM)))
1233 vm_pindex_t scan_pindex;
1234 int scan_count = 16;
1236 if (first_pindex < 16) {
1240 scan_pindex = first_pindex - 16;
1241 if (scan_pindex < 16)
1242 scan_count = scan_pindex;
1247 while (scan_count) {
1250 mt = vm_page_lookup(fs->first_object,
1254 if (vm_page_busy_try(mt, TRUE))
1257 if (mt->valid != VM_PAGE_BITS_ALL) {
1262 (PG_FICTITIOUS | PG_UNMANAGED)) ||
1269 vm_page_test_dirty(mt);
1273 vm_page_deactivate(mt);
1287 * Avoid deadlocking against the map when doing I/O.
1288 * fs.object and the page is PG_BUSY'd.
1290 * NOTE: Once unlocked, fs->entry can become stale
1291 * so this will NULL it out.
1293 * NOTE: fs->entry is invalid until we relock the
1294 * map and verify that the timestamp has not
1300 * Acquire the page data. We still hold a ref on
1301 * fs.object and the page has been PG_BUSY's.
1303 * The pager may replace the page (for example, in
1304 * order to enter a fictitious page into the
1305 * object). If it does so it is responsible for
1306 * cleaning up the passed page and properly setting
1307 * the new page PG_BUSY.
1309 * If we got here through a PG_RAM read-ahead
1310 * mark the page may be partially dirty and thus
1311 * not freeable. Don't bother checking to see
1312 * if the pager has the page because we can't free
1313 * it anyway. We have to depend on the get_page
1314 * operation filling in any gaps whether there is
1315 * backing store or not.
1317 rv = vm_pager_get_page(fs->object, &fs->m, seqaccess);
1319 if (rv == VM_PAGER_OK) {
1321 * Relookup in case pager changed page. Pager
1322 * is responsible for disposition of old page
1325 * XXX other code segments do relookups too.
1326 * It's a bad abstraction that needs to be
1329 fs->m = vm_page_lookup(fs->object, pindex);
1330 if (fs->m == NULL) {
1331 vm_object_pip_wakeup(fs->first_object);
1332 vm_object_chain_release_all(
1333 fs->first_object, fs->object);
1334 if (fs->object != fs->first_object)
1335 vm_object_drop(fs->object);
1336 unlock_and_deallocate(fs);
1337 return (KERN_TRY_AGAIN);
1341 break; /* break to PAGE HAS BEEN FOUND */
1345 * Remove the bogus page (which does not exist at this
1346 * object/offset); before doing so, we must get back
1347 * our object lock to preserve our invariant.
1349 * Also wake up any other process that may want to bring
1352 * If this is the top-level object, we must leave the
1353 * busy page to prevent another process from rushing
1354 * past us, and inserting the page in that object at
1355 * the same time that we are.
1357 if (rv == VM_PAGER_ERROR) {
1359 kprintf("vm_fault: pager read error, "
1364 kprintf("vm_fault: pager read error, "
1372 * Data outside the range of the pager or an I/O error
1374 * The page may have been wired during the pagein,
1375 * e.g. by the buffer cache, and cannot simply be
1376 * freed. Call vnode_pager_freepage() to deal with it.
1379 * XXX - the check for kernel_map is a kludge to work
1380 * around having the machine panic on a kernel space
1381 * fault w/ I/O error.
1383 if (((fs->map != &kernel_map) &&
1384 (rv == VM_PAGER_ERROR)) || (rv == VM_PAGER_BAD)) {
1385 vnode_pager_freepage(fs->m);
1387 vm_object_pip_wakeup(fs->first_object);
1388 vm_object_chain_release_all(fs->first_object,
1390 if (fs->object != fs->first_object)
1391 vm_object_drop(fs->object);
1392 unlock_and_deallocate(fs);
1393 if (rv == VM_PAGER_ERROR)
1394 return (KERN_FAILURE);
1396 return (KERN_PROTECTION_FAILURE);
1399 if (fs->object != fs->first_object) {
1400 vnode_pager_freepage(fs->m);
1403 * XXX - we cannot just fall out at this
1404 * point, m has been freed and is invalid!
1410 * We get here if the object has a default pager (or unwiring)
1411 * or the pager doesn't have the page.
1413 if (fs->object == fs->first_object)
1414 fs->first_m = fs->m;
1417 * Move on to the next object. The chain lock should prevent
1418 * the backing_object from getting ripped out from under us.
1420 if ((next_object = fs->object->backing_object) != NULL) {
1421 vm_object_hold(next_object);
1422 vm_object_chain_acquire(next_object);
1423 KKASSERT(next_object == fs->object->backing_object);
1424 pindex += OFF_TO_IDX(fs->object->backing_object_offset);
1427 if (next_object == NULL) {
1429 * If there's no object left, fill the page in the top
1430 * object with zeros.
1432 if (fs->object != fs->first_object) {
1433 if (fs->first_object->backing_object !=
1435 vm_object_hold(fs->first_object->backing_object);
1437 vm_object_chain_release_all(
1438 fs->first_object->backing_object,
1440 if (fs->first_object->backing_object !=
1442 vm_object_drop(fs->first_object->backing_object);
1444 vm_object_pip_wakeup(fs->object);
1445 vm_object_drop(fs->object);
1446 fs->object = fs->first_object;
1447 pindex = first_pindex;
1448 fs->m = fs->first_m;
1453 * Zero the page if necessary and mark it valid.
1455 if ((fs->m->flags & PG_ZERO) == 0) {
1456 vm_page_zero_fill(fs->m);
1459 pmap_page_assertzero(VM_PAGE_TO_PHYS(fs->m));
1461 vm_page_flag_clear(fs->m, PG_ZERO);
1462 mycpu->gd_cnt.v_ozfod++;
1464 mycpu->gd_cnt.v_zfod++;
1465 fs->m->valid = VM_PAGE_BITS_ALL;
1466 break; /* break to PAGE HAS BEEN FOUND */
1468 if (fs->object != fs->first_object) {
1469 vm_object_pip_wakeup(fs->object);
1470 vm_object_lock_swap();
1471 vm_object_drop(fs->object);
1473 KASSERT(fs->object != next_object,
1474 ("object loop %p", next_object));
1475 fs->object = next_object;
1476 vm_object_pip_add(fs->object, 1);
1480 * PAGE HAS BEEN FOUND. [Loop invariant still holds -- the object lock
1483 * object still held.
1485 * If the page is being written, but isn't already owned by the
1486 * top-level object, we have to copy it into a new page owned by the
1489 KASSERT((fs->m->flags & PG_BUSY) != 0,
1490 ("vm_fault: not busy after main loop"));
1492 if (fs->object != fs->first_object) {
1494 * We only really need to copy if we want to write it.
1496 if (fault_type & VM_PROT_WRITE) {
1498 * This allows pages to be virtually copied from a
1499 * backing_object into the first_object, where the
1500 * backing object has no other refs to it, and cannot
1501 * gain any more refs. Instead of a bcopy, we just
1502 * move the page from the backing object to the
1503 * first object. Note that we must mark the page
1504 * dirty in the first object so that it will go out
1505 * to swap when needed.
1509 * Map, if present, has not changed
1512 fs->map_generation == fs->map->timestamp) &&
1514 * Only one shadow object
1516 (fs->object->shadow_count == 1) &&
1518 * No COW refs, except us
1520 (fs->object->ref_count == 1) &&
1522 * No one else can look this object up
1524 (fs->object->handle == NULL) &&
1526 * No other ways to look the object up
1528 ((fs->object->type == OBJT_DEFAULT) ||
1529 (fs->object->type == OBJT_SWAP)) &&
1531 * We don't chase down the shadow chain
1533 (fs->object == fs->first_object->backing_object) &&
1536 * grab the lock if we need to
1538 (fs->lookup_still_valid ||
1540 lockmgr(&fs->map->lock, LK_EXCLUSIVE|LK_NOWAIT) == 0)
1543 * (first_m) and (m) are both busied. We have
1544 * move (m) into (first_m)'s object/pindex
1545 * in an atomic fashion, then free (first_m).
1547 * first_object is held so second remove
1548 * followed by the rename should wind
1549 * up being atomic. vm_page_free() might
1550 * block so we don't do it until after the
1553 fs->lookup_still_valid = 1;
1554 vm_page_protect(fs->first_m, VM_PROT_NONE);
1555 vm_page_remove(fs->first_m);
1556 vm_page_rename(fs->m, fs->first_object,
1558 vm_page_free(fs->first_m);
1559 fs->first_m = fs->m;
1561 mycpu->gd_cnt.v_cow_optim++;
1564 * Oh, well, lets copy it.
1566 vm_page_copy(fs->m, fs->first_m);
1567 vm_page_event(fs->m, VMEVENT_COW);
1572 * We no longer need the old page or object.
1578 * We intend to revert to first_object, undo the
1579 * chain lock through to that.
1581 if (fs->first_object->backing_object != fs->object)
1582 vm_object_hold(fs->first_object->backing_object);
1583 vm_object_chain_release_all(
1584 fs->first_object->backing_object,
1586 if (fs->first_object->backing_object != fs->object)
1587 vm_object_drop(fs->first_object->backing_object);
1590 * fs->object != fs->first_object due to above
1593 vm_object_pip_wakeup(fs->object);
1594 vm_object_drop(fs->object);
1597 * Only use the new page below...
1600 mycpu->gd_cnt.v_cow_faults++;
1601 fs->m = fs->first_m;
1602 fs->object = fs->first_object;
1603 pindex = first_pindex;
1606 * If it wasn't a write fault avoid having to copy
1607 * the page by mapping it read-only.
1609 fs->prot &= ~VM_PROT_WRITE;
1614 * Relock the map if necessary, then check the generation count.
1615 * relock_map() will update fs->timestamp to account for the
1616 * relocking if necessary.
1618 * If the count has changed after relocking then all sorts of
1619 * crap may have happened and we have to retry.
1621 * NOTE: The relock_map() can fail due to a deadlock against
1622 * the vm_page we are holding BUSY.
1624 if (fs->lookup_still_valid == FALSE && fs->map) {
1625 if (relock_map(fs) ||
1626 fs->map->timestamp != fs->map_generation) {
1628 vm_object_pip_wakeup(fs->first_object);
1629 vm_object_chain_release_all(fs->first_object,
1631 if (fs->object != fs->first_object)
1632 vm_object_drop(fs->object);
1633 unlock_and_deallocate(fs);
1634 return (KERN_TRY_AGAIN);
1639 * If the fault is a write, we know that this page is being
1640 * written NOW so dirty it explicitly to save on pmap_is_modified()
1643 * If this is a NOSYNC mmap we do not want to set PG_NOSYNC
1644 * if the page is already dirty to prevent data written with
1645 * the expectation of being synced from not being synced.
1646 * Likewise if this entry does not request NOSYNC then make
1647 * sure the page isn't marked NOSYNC. Applications sharing
1648 * data should use the same flags to avoid ping ponging.
1650 * Also tell the backing pager, if any, that it should remove
1651 * any swap backing since the page is now dirty.
1653 if (fs->prot & VM_PROT_WRITE) {
1654 vm_object_set_writeable_dirty(fs->m->object);
1655 vm_set_nosync(fs->m, fs->entry);
1656 if (fs->fault_flags & VM_FAULT_DIRTY) {
1657 vm_page_dirty(fs->m);
1658 swap_pager_unswapped(fs->m);
1662 vm_object_pip_wakeup(fs->first_object);
1663 vm_object_chain_release_all(fs->first_object, fs->object);
1664 if (fs->object != fs->first_object)
1665 vm_object_drop(fs->object);
1668 * Page had better still be busy. We are still locked up and
1669 * fs->object will have another PIP reference if it is not equal
1670 * to fs->first_object.
1672 KASSERT(fs->m->flags & PG_BUSY,
1673 ("vm_fault: page %p not busy!", fs->m));
1676 * Sanity check: page must be completely valid or it is not fit to
1677 * map into user space. vm_pager_get_pages() ensures this.
1679 if (fs->m->valid != VM_PAGE_BITS_ALL) {
1680 vm_page_zero_invalid(fs->m, TRUE);
1681 kprintf("Warning: page %p partially invalid on fault\n", fs->m);
1683 vm_page_flag_clear(fs->m, PG_ZERO);
1685 return (KERN_SUCCESS);
1689 * Wire down a range of virtual addresses in a map. The entry in question
1690 * should be marked in-transition and the map must be locked. We must
1691 * release the map temporarily while faulting-in the page to avoid a
1692 * deadlock. Note that the entry may be clipped while we are blocked but
1693 * will never be freed.
1698 vm_fault_wire(vm_map_t map, vm_map_entry_t entry, boolean_t user_wire)
1700 boolean_t fictitious;
1709 lwkt_gettoken(&map->token);
1711 pmap = vm_map_pmap(map);
1712 start = entry->start;
1714 fictitious = entry->object.vm_object &&
1715 (entry->object.vm_object->type == OBJT_DEVICE);
1716 if (entry->eflags & MAP_ENTRY_KSTACK)
1722 * We simulate a fault to get the page and enter it in the physical
1725 for (va = start; va < end; va += PAGE_SIZE) {
1727 rv = vm_fault(map, va, VM_PROT_READ,
1728 VM_FAULT_USER_WIRE);
1730 rv = vm_fault(map, va, VM_PROT_READ|VM_PROT_WRITE,
1731 VM_FAULT_CHANGE_WIRING);
1734 while (va > start) {
1736 if ((pa = pmap_extract(pmap, va)) == 0)
1738 pmap_change_wiring(pmap, va, FALSE);
1740 m = PHYS_TO_VM_PAGE(pa);
1741 vm_page_busy_wait(m, FALSE, "vmwrpg");
1742 vm_page_unwire(m, 1);
1752 lwkt_reltoken(&map->token);
1757 * Unwire a range of virtual addresses in a map. The map should be
1761 vm_fault_unwire(vm_map_t map, vm_map_entry_t entry)
1763 boolean_t fictitious;
1771 lwkt_gettoken(&map->token);
1773 pmap = vm_map_pmap(map);
1774 start = entry->start;
1776 fictitious = entry->object.vm_object &&
1777 (entry->object.vm_object->type == OBJT_DEVICE);
1778 if (entry->eflags & MAP_ENTRY_KSTACK)
1782 * Since the pages are wired down, we must be able to get their
1783 * mappings from the physical map system.
1785 for (va = start; va < end; va += PAGE_SIZE) {
1786 pa = pmap_extract(pmap, va);
1788 pmap_change_wiring(pmap, va, FALSE);
1790 m = PHYS_TO_VM_PAGE(pa);
1791 vm_page_busy_wait(m, FALSE, "vmwupg");
1792 vm_page_unwire(m, 1);
1797 lwkt_reltoken(&map->token);
1801 * Reduce the rate at which memory is allocated to a process based
1802 * on the perceived load on the VM system. As the load increases
1803 * the allocation burst rate goes down and the delay increases.
1805 * Rate limiting does not apply when faulting active or inactive
1806 * pages. When faulting 'cache' pages, rate limiting only applies
1807 * if the system currently has a severe page deficit.
1809 * XXX vm_pagesupply should be increased when a page is freed.
1811 * We sleep up to 1/10 of a second.
1814 vm_fault_ratelimit(struct vmspace *vmspace)
1816 if (vm_load_enable == 0)
1818 if (vmspace->vm_pagesupply > 0) {
1819 --vmspace->vm_pagesupply; /* SMP race ok */
1823 if (vm_load_debug) {
1824 kprintf("load %-4d give %d pgs, wait %d, pid %-5d (%s)\n",
1826 (1000 - vm_load ) / 10, vm_load * hz / 10000,
1827 curproc->p_pid, curproc->p_comm);
1830 vmspace->vm_pagesupply = (1000 - vm_load) / 10;
1831 return(vm_load * hz / 10000);
1835 * Copy all of the pages from a wired-down map entry to another.
1837 * The source and destination maps must be locked for write.
1838 * The source and destination maps token must be held
1839 * The source map entry must be wired down (or be a sharing map
1840 * entry corresponding to a main map entry that is wired down).
1842 * No other requirements.
1845 vm_fault_copy_entry(vm_map_t dst_map, vm_map_t src_map,
1846 vm_map_entry_t dst_entry, vm_map_entry_t src_entry)
1848 vm_object_t dst_object;
1849 vm_object_t src_object;
1850 vm_ooffset_t dst_offset;
1851 vm_ooffset_t src_offset;
1857 src_object = src_entry->object.vm_object;
1858 src_offset = src_entry->offset;
1861 * Create the top-level object for the destination entry. (Doesn't
1862 * actually shadow anything - we copy the pages directly.)
1864 vm_map_entry_allocate_object(dst_entry);
1865 dst_object = dst_entry->object.vm_object;
1867 prot = dst_entry->max_protection;
1870 * Loop through all of the pages in the entry's range, copying each
1871 * one from the source object (it should be there) to the destination
1874 for (vaddr = dst_entry->start, dst_offset = 0;
1875 vaddr < dst_entry->end;
1876 vaddr += PAGE_SIZE, dst_offset += PAGE_SIZE) {
1879 * Allocate a page in the destination object
1882 dst_m = vm_page_alloc(dst_object,
1883 OFF_TO_IDX(dst_offset),
1885 if (dst_m == NULL) {
1888 } while (dst_m == NULL);
1891 * Find the page in the source object, and copy it in.
1892 * (Because the source is wired down, the page will be in
1895 src_m = vm_page_lookup(src_object,
1896 OFF_TO_IDX(dst_offset + src_offset));
1898 panic("vm_fault_copy_wired: page missing");
1900 vm_page_copy(src_m, dst_m);
1901 vm_page_event(src_m, VMEVENT_COW);
1904 * Enter it in the pmap...
1907 vm_page_flag_clear(dst_m, PG_ZERO);
1908 pmap_enter(dst_map->pmap, vaddr, dst_m, prot, FALSE);
1911 * Mark it no longer busy, and put it on the active list.
1913 vm_page_activate(dst_m);
1914 vm_page_wakeup(dst_m);
1921 * This routine checks around the requested page for other pages that
1922 * might be able to be faulted in. This routine brackets the viable
1923 * pages for the pages to be paged in.
1926 * m, rbehind, rahead
1929 * marray (array of vm_page_t), reqpage (index of requested page)
1932 * number of pages in marray
1935 vm_fault_additional_pages(vm_page_t m, int rbehind, int rahead,
1936 vm_page_t *marray, int *reqpage)
1940 vm_pindex_t pindex, startpindex, endpindex, tpindex;
1942 int cbehind, cahead;
1948 * we don't fault-ahead for device pager
1950 if (object->type == OBJT_DEVICE) {
1957 * if the requested page is not available, then give up now
1959 if (!vm_pager_has_page(object, pindex, &cbehind, &cahead)) {
1960 *reqpage = 0; /* not used by caller, fix compiler warn */
1964 if ((cbehind == 0) && (cahead == 0)) {
1970 if (rahead > cahead) {
1974 if (rbehind > cbehind) {
1979 * Do not do any readahead if we have insufficient free memory.
1981 * XXX code was broken disabled before and has instability
1982 * with this conditonal fixed, so shortcut for now.
1984 if (burst_fault == 0 || vm_page_count_severe()) {
1991 * scan backward for the read behind pages -- in memory
1993 * Assume that if the page is not found an interrupt will not
1994 * create it. Theoretically interrupts can only remove (busy)
1995 * pages, not create new associations.
1998 if (rbehind > pindex) {
2002 startpindex = pindex - rbehind;
2005 vm_object_hold(object);
2006 for (tpindex = pindex; tpindex > startpindex; --tpindex) {
2007 if (vm_page_lookup(object, tpindex - 1))
2012 while (tpindex < pindex) {
2013 rtm = vm_page_alloc(object, tpindex, VM_ALLOC_SYSTEM |
2016 for (j = 0; j < i; j++) {
2017 vm_page_free(marray[j]);
2019 vm_object_drop(object);
2028 vm_object_drop(object);
2034 * Assign requested page
2041 * Scan forwards for read-ahead pages
2043 tpindex = pindex + 1;
2044 endpindex = tpindex + rahead;
2045 if (endpindex > object->size)
2046 endpindex = object->size;
2048 vm_object_hold(object);
2049 while (tpindex < endpindex) {
2050 if (vm_page_lookup(object, tpindex))
2052 rtm = vm_page_alloc(object, tpindex, VM_ALLOC_SYSTEM |
2060 vm_object_drop(object);
2068 * vm_prefault() provides a quick way of clustering pagefaults into a
2069 * processes address space. It is a "cousin" of pmap_object_init_pt,
2070 * except it runs at page fault time instead of mmap time.
2072 * vm.fast_fault Enables pre-faulting zero-fill pages
2074 * vm.prefault_pages Number of pages (1/2 negative, 1/2 positive) to
2075 * prefault. Scan stops in either direction when
2076 * a page is found to already exist.
2078 * This code used to be per-platform pmap_prefault(). It is now
2079 * machine-independent and enhanced to also pre-fault zero-fill pages
2080 * (see vm.fast_fault) as well as make them writable, which greatly
2081 * reduces the number of page faults programs incur.
2083 * Application performance when pre-faulting zero-fill pages is heavily
2084 * dependent on the application. Very tiny applications like /bin/echo
2085 * lose a little performance while applications of any appreciable size
2086 * gain performance. Prefaulting multiple pages also reduces SMP
2087 * congestion and can improve SMP performance significantly.
2089 * NOTE! prot may allow writing but this only applies to the top level
2090 * object. If we wind up mapping a page extracted from a backing
2091 * object we have to make sure it is read-only.
2093 * NOTE! The caller has already handled any COW operations on the
2094 * vm_map_entry via the normal fault code. Do NOT call this
2095 * shortcut unless the normal fault code has run on this entry.
2097 * The related map must be locked.
2098 * No other requirements.
2100 static int vm_prefault_pages = 8;
2101 SYSCTL_INT(_vm, OID_AUTO, prefault_pages, CTLFLAG_RW, &vm_prefault_pages, 0,
2102 "Maximum number of pages to pre-fault");
2103 static int vm_fast_fault = 1;
2104 SYSCTL_INT(_vm, OID_AUTO, fast_fault, CTLFLAG_RW, &vm_fast_fault, 0,
2105 "Burst fault zero-fill regions");
2108 * Set PG_NOSYNC if the map entry indicates so, but only if the page
2109 * is not already dirty by other means. This will prevent passive
2110 * filesystem syncing as well as 'sync' from writing out the page.
2113 vm_set_nosync(vm_page_t m, vm_map_entry_t entry)
2115 if (entry->eflags & MAP_ENTRY_NOSYNC) {
2117 vm_page_flag_set(m, PG_NOSYNC);
2119 vm_page_flag_clear(m, PG_NOSYNC);
2124 vm_prefault(pmap_t pmap, vm_offset_t addra, vm_map_entry_t entry, int prot)
2139 * Get stable max count value, disabled if set to 0
2141 maxpages = vm_prefault_pages;
2147 * We do not currently prefault mappings that use virtual page
2148 * tables. We do not prefault foreign pmaps.
2150 if (entry->maptype == VM_MAPTYPE_VPAGETABLE)
2152 lp = curthread->td_lwp;
2153 if (lp == NULL || (pmap != vmspace_pmap(lp->lwp_vmspace)))
2157 * Limit pre-fault count to 1024 pages.
2159 if (maxpages > 1024)
2162 object = entry->object.vm_object;
2163 KKASSERT(object != NULL);
2164 vm_object_hold(object);
2165 KKASSERT(object == entry->object.vm_object);
2166 vm_object_chain_acquire(object);
2170 for (i = 0; i < maxpages; ++i) {
2171 vm_object_t lobject;
2172 vm_object_t nobject;
2177 * This can eat a lot of time on a heavily contended
2178 * machine so yield on the tick if needed.
2184 * Calculate the page to pre-fault, stopping the scan in
2185 * each direction separately if the limit is reached.
2190 addr = addra - ((i + 1) >> 1) * PAGE_SIZE;
2194 addr = addra + ((i + 2) >> 1) * PAGE_SIZE;
2196 if (addr < entry->start) {
2202 if (addr >= entry->end) {
2210 * Skip pages already mapped, and stop scanning in that
2211 * direction. When the scan terminates in both directions
2214 if (pmap_prefault_ok(pmap, addr) == 0) {
2225 * Follow the VM object chain to obtain the page to be mapped
2228 * If we reach the terminal object without finding a page
2229 * and we determine it would be advantageous, then allocate
2230 * a zero-fill page for the base object. The base object
2231 * is guaranteed to be OBJT_DEFAULT for this case.
2233 * In order to not have to check the pager via *haspage*()
2234 * we stop if any non-default object is encountered. e.g.
2235 * a vnode or swap object would stop the loop.
2237 index = ((addr - entry->start) + entry->offset) >> PAGE_SHIFT;
2242 KKASSERT(lobject == entry->object.vm_object);
2243 /*vm_object_hold(lobject); implied */
2245 while ((m = vm_page_lookup_busy_try(lobject, pindex,
2246 TRUE, &error)) == NULL) {
2247 if (lobject->type != OBJT_DEFAULT)
2249 if (lobject->backing_object == NULL) {
2250 if (vm_fast_fault == 0)
2252 if ((prot & VM_PROT_WRITE) == 0 ||
2253 vm_page_count_min(0)) {
2258 * NOTE: Allocated from base object
2260 m = vm_page_alloc(object, index,
2267 if ((m->flags & PG_ZERO) == 0) {
2268 vm_page_zero_fill(m);
2271 pmap_page_assertzero(
2272 VM_PAGE_TO_PHYS(m));
2274 vm_page_flag_clear(m, PG_ZERO);
2275 mycpu->gd_cnt.v_ozfod++;
2277 mycpu->gd_cnt.v_zfod++;
2278 m->valid = VM_PAGE_BITS_ALL;
2281 /* lobject = object .. not needed */
2284 if (lobject->backing_object_offset & PAGE_MASK)
2286 nobject = lobject->backing_object;
2287 vm_object_hold(nobject);
2288 KKASSERT(nobject == lobject->backing_object);
2289 pindex += lobject->backing_object_offset >> PAGE_SHIFT;
2290 if (lobject != object) {
2291 vm_object_lock_swap();
2292 vm_object_drop(lobject);
2295 pprot &= ~VM_PROT_WRITE;
2296 vm_object_chain_acquire(lobject);
2300 * NOTE: A non-NULL (m) will be associated with lobject if
2301 * it was found there, otherwise it is probably a
2302 * zero-fill page associated with the base object.
2304 * Give-up if no page is available.
2307 if (lobject != object) {
2308 if (object->backing_object != lobject)
2309 vm_object_hold(object->backing_object);
2310 vm_object_chain_release_all(
2311 object->backing_object, lobject);
2312 if (object->backing_object != lobject)
2313 vm_object_drop(object->backing_object);
2314 vm_object_drop(lobject);
2320 * Do not conditionalize on PG_RAM. If pages are present in
2321 * the VM system we assume optimal caching. If caching is
2322 * not optimal the I/O gravy train will be restarted when we
2323 * hit an unavailable page. We do not want to try to restart
2324 * the gravy train now because we really don't know how much
2325 * of the object has been cached. The cost for restarting
2326 * the gravy train should be low (since accesses will likely
2327 * be I/O bound anyway).
2329 * The object must be marked dirty if we are mapping a
2330 * writable page. m->object is either lobject or object,
2331 * both of which are still held.
2333 if (pprot & VM_PROT_WRITE)
2334 vm_object_set_writeable_dirty(m->object);
2336 if (lobject != object) {
2337 if (object->backing_object != lobject)
2338 vm_object_hold(object->backing_object);
2339 vm_object_chain_release_all(object->backing_object,
2341 if (object->backing_object != lobject)
2342 vm_object_drop(object->backing_object);
2343 vm_object_drop(lobject);
2347 * Enter the page into the pmap if appropriate. If we had
2348 * allocated the page we have to place it on a queue. If not
2349 * we just have to make sure it isn't on the cache queue
2350 * (pages on the cache queue are not allowed to be mapped).
2353 if (pprot & VM_PROT_WRITE)
2354 vm_set_nosync(m, entry);
2355 pmap_enter(pmap, addr, m, pprot, 0);
2356 vm_page_deactivate(m);
2359 /* couldn't busy page, no wakeup */
2361 ((m->valid & VM_PAGE_BITS_ALL) == VM_PAGE_BITS_ALL) &&
2362 (m->flags & PG_FICTITIOUS) == 0) {
2364 * A fully valid page not undergoing soft I/O can
2365 * be immediately entered into the pmap.
2367 if ((m->queue - m->pc) == PQ_CACHE)
2368 vm_page_deactivate(m);
2369 if (pprot & VM_PROT_WRITE)
2370 vm_set_nosync(m, entry);
2371 pmap_enter(pmap, addr, m, pprot, 0);
2377 vm_object_chain_release(object);
2378 vm_object_drop(object);