2 * Copyright (c) 1991, 1993
3 * The Regents of the University of California. All rights reserved.
4 * Copyright (c) 1994 John S. Dyson
6 * Copyright (c) 1994 David Greenman
10 * This code is derived from software contributed to Berkeley by
11 * The Mach Operating System project at Carnegie-Mellon University.
13 * Redistribution and use in source and binary forms, with or without
14 * modification, are permitted provided that the following conditions
16 * 1. Redistributions of source code must retain the above copyright
17 * notice, this list of conditions and the following disclaimer.
18 * 2. Redistributions in binary form must reproduce the above copyright
19 * notice, this list of conditions and the following disclaimer in the
20 * documentation and/or other materials provided with the distribution.
21 * 3. All advertising materials mentioning features or use of this software
22 * must display the following acknowledgement:
23 * This product includes software developed by the University of
24 * California, Berkeley and its contributors.
25 * 4. Neither the name of the University nor the names of its contributors
26 * may be used to endorse or promote products derived from this software
27 * without specific prior written permission.
29 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
30 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
31 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
32 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
33 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
34 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
35 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
36 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
37 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
38 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
41 * from: @(#)vm_fault.c 8.4 (Berkeley) 1/12/94
44 * Copyright (c) 1987, 1990 Carnegie-Mellon University.
45 * All rights reserved.
47 * Authors: Avadis Tevanian, Jr., Michael Wayne Young
49 * Permission to use, copy, modify and distribute this software and
50 * its documentation is hereby granted, provided that both the copyright
51 * notice and this permission notice appear in all copies of the
52 * software, derivative works or modified versions, and any portions
53 * thereof, and that both notices appear in supporting documentation.
55 * CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS"
56 * CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND
57 * FOR ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
59 * Carnegie Mellon requests users of this software to return to
61 * Software Distribution Coordinator or Software.Distribution@CS.CMU.EDU
62 * School of Computer Science
63 * Carnegie Mellon University
64 * Pittsburgh PA 15213-3890
66 * any improvements or extensions that they make and grant Carnegie the
67 * rights to redistribute these changes.
69 * $FreeBSD: src/sys/vm/vm_fault.c,v 1.108.2.8 2002/02/26 05:49:27 silby Exp $
70 * $DragonFly: src/sys/vm/vm_fault.c,v 1.31 2006/12/23 00:41:31 swildner Exp $
74 * Page fault handling module.
77 #include <sys/param.h>
78 #include <sys/systm.h>
79 #include <sys/kernel.h>
81 #include <sys/vnode.h>
82 #include <sys/resourcevar.h>
83 #include <sys/vmmeter.h>
84 #include <sys/vkernel.h>
85 #include <sys/sfbuf.h>
89 #include <vm/vm_param.h>
91 #include <vm/vm_map.h>
92 #include <vm/vm_object.h>
93 #include <vm/vm_page.h>
94 #include <vm/vm_pageout.h>
95 #include <vm/vm_kern.h>
96 #include <vm/vm_pager.h>
97 #include <vm/vnode_pager.h>
98 #include <vm/vm_extern.h>
100 #include <sys/thread2.h>
101 #include <vm/vm_page2.h>
103 #define VM_FAULT_READ_AHEAD 8
104 #define VM_FAULT_READ_BEHIND 7
105 #define VM_FAULT_READ (VM_FAULT_READ_AHEAD+VM_FAULT_READ_BEHIND+1)
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 vm_fault_object(struct faultstate *, vm_pindex_t, vm_prot_t);
127 static int vm_fault_vpagetable(struct faultstate *, vm_pindex_t *, vpte_t);
128 static int vm_fault_additional_pages (vm_page_t, int, int, vm_page_t *, int *);
129 static int vm_fault_ratelimit(struct vmspace *);
132 release_page(struct faultstate *fs)
134 vm_page_wakeup(fs->m);
135 vm_page_deactivate(fs->m);
140 unlock_map(struct faultstate *fs)
142 if (fs->lookup_still_valid) {
143 vm_map_lookup_done(fs->map, fs->entry, 0);
144 fs->lookup_still_valid = FALSE;
149 * Clean up after a successful call to vm_fault_object() so another call
150 * to vm_fault_object() can be made.
153 _cleanup_successful_fault(struct faultstate *fs, int relock)
155 if (fs->object != fs->first_object) {
156 vm_page_free(fs->first_m);
157 vm_object_pip_wakeup(fs->object);
160 fs->object = fs->first_object;
161 if (relock && fs->lookup_still_valid == FALSE) {
162 vm_map_lock_read(fs->map);
163 fs->lookup_still_valid = TRUE;
168 _unlock_things(struct faultstate *fs, int dealloc)
170 vm_object_pip_wakeup(fs->first_object);
171 _cleanup_successful_fault(fs, 0);
173 vm_object_deallocate(fs->first_object);
176 if (fs->vp != NULL) {
182 #define unlock_things(fs) _unlock_things(fs, 0)
183 #define unlock_and_deallocate(fs) _unlock_things(fs, 1)
184 #define cleanup_successful_fault(fs) _cleanup_successful_fault(fs, 1)
189 * Determine if the pager for the current object *might* contain the page.
191 * We only need to try the pager if this is not a default object (default
192 * objects are zero-fill and have no real pager), and if we are not taking
193 * a wiring fault or if the FS entry is wired.
195 #define TRYPAGER(fs) \
196 (fs->object->type != OBJT_DEFAULT && \
197 (((fs->fault_flags & VM_FAULT_WIRE_MASK) == 0) || fs->wired))
202 * Handle a page fault occuring at the given address, requiring the given
203 * permissions, in the map specified. If successful, the page is inserted
204 * into the associated physical map.
206 * NOTE: The given address should be truncated to the proper page address.
208 * KERN_SUCCESS is returned if the page fault is handled; otherwise,
209 * a standard error specifying why the fault is fatal is returned.
211 * The map in question must be referenced, and remains so.
212 * The caller may hold no locks.
215 vm_fault(vm_map_t map, vm_offset_t vaddr, vm_prot_t fault_type, int fault_flags)
218 vm_pindex_t first_pindex;
219 struct faultstate fs;
221 mycpu->gd_cnt.v_vm_faults++;
225 fs.fault_flags = fault_flags;
229 * Find the vm_map_entry representing the backing store and resolve
230 * the top level object and page index. This may have the side
231 * effect of executing a copy-on-write on the map entry and/or
232 * creating a shadow object, but will not COW any actual VM pages.
234 * On success fs.map is left read-locked and various other fields
235 * are initialized but not otherwise referenced or locked.
237 * NOTE! vm_map_lookup will upgrade the fault_type to VM_FAULT_WRITE
238 * if the map entry is a virtual page table and also writable,
239 * so we can set the 'A'accessed bit in the virtual page table entry.
242 result = vm_map_lookup(&fs.map, vaddr, fault_type,
243 &fs.entry, &fs.first_object,
244 &first_pindex, &fs.first_prot, &fs.wired);
247 * If the lookup failed or the map protections are incompatible,
248 * the fault generally fails. However, if the caller is trying
249 * to do a user wiring we have more work to do.
251 if (result != KERN_SUCCESS) {
252 if (result != KERN_PROTECTION_FAILURE)
254 if ((fs.fault_flags & VM_FAULT_WIRE_MASK) != VM_FAULT_USER_WIRE)
258 * If we are user-wiring a r/w segment, and it is COW, then
259 * we need to do the COW operation. Note that we don't
260 * currently COW RO sections now, because it is NOT desirable
261 * to COW .text. We simply keep .text from ever being COW'ed
262 * and take the heat that one cannot debug wired .text sections.
264 result = vm_map_lookup(&fs.map, vaddr,
265 VM_PROT_READ|VM_PROT_WRITE|
266 VM_PROT_OVERRIDE_WRITE,
267 &fs.entry, &fs.first_object,
268 &first_pindex, &fs.first_prot,
270 if (result != KERN_SUCCESS)
274 * If we don't COW now, on a user wire, the user will never
275 * be able to write to the mapping. If we don't make this
276 * restriction, the bookkeeping would be nearly impossible.
278 if ((fs.entry->protection & VM_PROT_WRITE) == 0)
279 fs.entry->max_protection &= ~VM_PROT_WRITE;
283 * fs.map is read-locked
285 * Misc checks. Save the map generation number to detect races.
287 fs.map_generation = fs.map->timestamp;
289 if (fs.entry->eflags & MAP_ENTRY_NOFAULT) {
290 panic("vm_fault: fault on nofault entry, addr: %lx",
295 * A system map entry may return a NULL object. No object means
296 * no pager means an unrecoverable kernel fault.
298 if (fs.first_object == NULL) {
299 panic("vm_fault: unrecoverable fault at %p in entry %p",
300 (void *)vaddr, fs.entry);
304 * Make a reference to this object to prevent its disposal while we
305 * are messing with it. Once we have the reference, the map is free
306 * to be diddled. Since objects reference their shadows (and copies),
307 * they will stay around as well.
309 * Bump the paging-in-progress count to prevent size changes (e.g.
310 * truncation operations) during I/O. This must be done after
311 * obtaining the vnode lock in order to avoid possible deadlocks.
313 vm_object_reference(fs.first_object);
314 fs.vp = vnode_pager_lock(fs.first_object);
315 vm_object_pip_add(fs.first_object, 1);
317 fs.lookup_still_valid = TRUE;
319 fs.object = fs.first_object; /* so unlock_and_deallocate works */
322 * If the entry is wired we cannot change the page protection.
325 fault_type = fs.first_prot;
328 * The page we want is at (first_object, first_pindex), but if the
329 * vm_map_entry is VM_MAPTYPE_VPAGETABLE we have to traverse the
330 * page table to figure out the actual pindex.
332 * NOTE! DEVELOPMENT IN PROGRESS, THIS IS AN INITIAL IMPLEMENTATION
335 if (fs.entry->maptype == VM_MAPTYPE_VPAGETABLE) {
336 result = vm_fault_vpagetable(&fs, &first_pindex,
337 fs.entry->aux.master_pde);
338 if (result == KERN_TRY_AGAIN)
340 if (result != KERN_SUCCESS)
345 * Now we have the actual (object, pindex), fault in the page. If
346 * vm_fault_object() fails it will unlock and deallocate the FS
347 * data. If it succeeds everything remains locked and fs->object
348 * will have an additinal PIP count if it is not equal to
351 result = vm_fault_object(&fs, first_pindex, fault_type);
353 if (result == KERN_TRY_AGAIN)
355 if (result != KERN_SUCCESS)
359 * On success vm_fault_object() does not unlock or deallocate, and fs.m
360 * will contain a busied page.
362 * Enter the page into the pmap and do pmap-related adjustments.
365 pmap_enter(fs.map->pmap, vaddr, fs.m, fs.prot, fs.wired);
367 if (((fs.fault_flags & VM_FAULT_WIRE_MASK) == 0) && (fs.wired == 0)) {
368 pmap_prefault(fs.map->pmap, vaddr, fs.entry);
371 vm_page_flag_clear(fs.m, PG_ZERO);
372 vm_page_flag_set(fs.m, PG_MAPPED|PG_REFERENCED);
373 if (fs.fault_flags & VM_FAULT_HOLD)
377 * If the page is not wired down, then put it where the pageout daemon
380 if (fs.fault_flags & VM_FAULT_WIRE_MASK) {
384 vm_page_unwire(fs.m, 1);
386 vm_page_activate(fs.m);
389 if (curproc && (curproc->p_flag & P_SWAPPEDOUT) == 0 &&
392 curproc->p_stats->p_ru.ru_majflt++;
394 curproc->p_stats->p_ru.ru_minflt++;
399 * Unlock everything, and return
401 vm_page_wakeup(fs.m);
402 vm_object_deallocate(fs.first_object);
404 return (KERN_SUCCESS);
408 * Translate the virtual page number (first_pindex) that is relative
409 * to the address space into a logical page number that is relative to the
410 * backing object. Use the virtual page table pointed to by (vpte).
412 * This implements an N-level page table. Any level can terminate the
413 * scan by setting VPTE_PS. A linear mapping is accomplished by setting
414 * VPTE_PS in the master page directory entry set via mcontrol(MADV_SETMAP).
418 vm_fault_vpagetable(struct faultstate *fs, vm_pindex_t *pindex, vpte_t vpte)
421 int vshift = 32 - PAGE_SHIFT; /* page index bits remaining */
422 int result = KERN_SUCCESS;
425 if ((vpte & VPTE_V) == 0) {
426 unlock_and_deallocate(fs);
427 return (KERN_FAILURE);
429 if ((vpte & VPTE_PS) || vshift == 0)
431 KKASSERT(vshift >= VPTE_PAGE_BITS);
434 * Get the page table page
436 result = vm_fault_object(fs, vpte >> PAGE_SHIFT, VM_PROT_READ);
437 if (result != KERN_SUCCESS)
441 * Process the returned fs.m and look up the page table
442 * entry in the page table page.
444 vshift -= VPTE_PAGE_BITS;
445 sf = sf_buf_alloc(fs->m, SFB_CPUPRIVATE);
446 vpte = *((vpte_t *)sf_buf_kva(sf) +
447 ((*pindex >> vshift) & VPTE_PAGE_MASK));
449 vm_page_flag_set(fs->m, PG_REFERENCED);
450 vm_page_activate(fs->m);
451 vm_page_wakeup(fs->m);
452 cleanup_successful_fault(fs);
455 * Combine remaining address bits with the vpte.
457 *pindex = (vpte >> PAGE_SHIFT) +
458 (*pindex & ((1 << vshift) - 1));
459 return (KERN_SUCCESS);
464 * Do all operations required to fault-in (fs.first_object, pindex). Run
465 * through the shadow chain as necessary and do required COW or virtual
466 * copy operations. The caller has already fully resolved the vm_map_entry
467 * and, if appropriate, has created a copy-on-write layer. All we need to
468 * do is iterate the object chain.
470 * On failure (fs) is unlocked and deallocated and the caller may return or
471 * retry depending on the failure code. On success (fs) is NOT unlocked or
472 * deallocated, fs.m will contained a resolved, busied page, and fs.object
473 * will have an additional PIP count if it is not equal to fs.first_object.
477 vm_fault_object(struct faultstate *fs,
478 vm_pindex_t first_pindex, vm_prot_t fault_type)
480 vm_object_t next_object;
481 vm_page_t marray[VM_FAULT_READ];
485 fs->prot = fs->first_prot;
486 fs->object = fs->first_object;
487 pindex = first_pindex;
491 * If the object is dead, we stop here
493 if (fs->object->flags & OBJ_DEAD) {
494 unlock_and_deallocate(fs);
495 return (KERN_PROTECTION_FAILURE);
499 * See if page is resident. spl protection is required
500 * to avoid an interrupt unbusy/free race against our
501 * lookup. We must hold the protection through a page
502 * allocation or busy.
505 fs->m = vm_page_lookup(fs->object, pindex);
509 * Wait/Retry if the page is busy. We have to do this
510 * if the page is busy via either PG_BUSY or
511 * vm_page_t->busy because the vm_pager may be using
512 * vm_page_t->busy for pageouts ( and even pageins if
513 * it is the vnode pager ), and we could end up trying
514 * to pagein and pageout the same page simultaneously.
516 * We can theoretically allow the busy case on a read
517 * fault if the page is marked valid, but since such
518 * pages are typically already pmap'd, putting that
519 * special case in might be more effort then it is
520 * worth. We cannot under any circumstances mess
521 * around with a vm_page_t->busy page except, perhaps,
524 if ((fs->m->flags & PG_BUSY) || fs->m->busy) {
526 vm_page_sleep_busy(fs->m, TRUE, "vmpfw");
527 mycpu->gd_cnt.v_intrans++;
528 vm_object_deallocate(fs->first_object);
530 return (KERN_TRY_AGAIN);
534 * If reactivating a page from PQ_CACHE we may have
537 queue = fs->m->queue;
538 vm_page_unqueue_nowakeup(fs->m);
540 if ((queue - fs->m->pc) == PQ_CACHE &&
541 vm_page_count_severe()) {
542 vm_page_activate(fs->m);
543 unlock_and_deallocate(fs);
546 return (KERN_TRY_AGAIN);
550 * Mark page busy for other processes, and the
551 * pagedaemon. If it still isn't completely valid
552 * (readable), jump to readrest, else we found the
553 * page and can return.
555 * We can release the spl once we have marked the
561 if (((fs->m->valid & VM_PAGE_BITS_ALL) != VM_PAGE_BITS_ALL) &&
562 fs->m->object != kernel_object &&
563 fs->m->object != kmem_object) {
566 break; /* break to PAGE HAS BEEN FOUND */
570 * Page is not resident, If this is the search termination
571 * or the pager might contain the page, allocate a new page.
573 * NOTE: We are still in a critical section.
575 if (TRYPAGER(fs) || fs->object == fs->first_object) {
577 * If the page is beyond the object size we fail
579 if (pindex >= fs->object->size) {
581 unlock_and_deallocate(fs);
582 return (KERN_PROTECTION_FAILURE);
588 if (fs->didlimit == 0 && curproc != NULL) {
591 limticks = vm_fault_ratelimit(curproc->p_vmspace);
594 unlock_and_deallocate(fs);
595 tsleep(curproc, 0, "vmrate", limticks);
597 return (KERN_TRY_AGAIN);
602 * Allocate a new page for this object/offset pair.
605 if (!vm_page_count_severe()) {
606 fs->m = vm_page_alloc(fs->object, pindex,
607 (fs->vp || fs->object->backing_object) ? VM_ALLOC_NORMAL : VM_ALLOC_NORMAL | VM_ALLOC_ZERO);
611 unlock_and_deallocate(fs);
613 return (KERN_TRY_AGAIN);
620 * We have found a valid page or we have allocated a new page.
621 * The page thus may not be valid or may not be entirely
624 * Attempt to fault-in the page if there is a chance that the
625 * pager has it, and potentially fault in additional pages
628 * We are NOT in splvm here and if TRYPAGER is true then
629 * fs.m will be non-NULL and will be PG_BUSY for us.
636 u_char behavior = vm_map_entry_behavior(fs->entry);
638 if (behavior == MAP_ENTRY_BEHAV_RANDOM) {
643 if (behind > VM_FAULT_READ_BEHIND)
644 behind = VM_FAULT_READ_BEHIND;
646 ahead = fs->object->size - pindex;
649 if (ahead > VM_FAULT_READ_AHEAD)
650 ahead = VM_FAULT_READ_AHEAD;
653 if ((fs->first_object->type != OBJT_DEVICE) &&
654 (behavior == MAP_ENTRY_BEHAV_SEQUENTIAL ||
655 (behavior != MAP_ENTRY_BEHAV_RANDOM &&
656 pindex >= fs->entry->lastr &&
657 pindex < fs->entry->lastr + VM_FAULT_READ))
659 vm_pindex_t firstpindex, tmppindex;
661 if (first_pindex < 2 * VM_FAULT_READ)
664 firstpindex = first_pindex - 2 * VM_FAULT_READ;
667 * note: partially valid pages cannot be
668 * included in the lookahead - NFS piecemeal
669 * writes will barf on it badly.
671 * spl protection is required to avoid races
672 * between the lookup and an interrupt
673 * unbusy/free sequence occuring prior to
677 for (tmppindex = first_pindex - 1;
678 tmppindex >= firstpindex;
683 mt = vm_page_lookup(fs->first_object, tmppindex);
684 if (mt == NULL || (mt->valid != VM_PAGE_BITS_ALL))
687 (mt->flags & (PG_BUSY | PG_FICTITIOUS | PG_UNMANAGED)) ||
692 vm_page_test_dirty(mt);
694 vm_page_protect(mt, VM_PROT_NONE);
695 vm_page_deactivate(mt);
707 * now we find out if any other pages should be paged
708 * in at this time this routine checks to see if the
709 * pages surrounding this fault reside in the same
710 * object as the page for this fault. If they do,
711 * then they are faulted in also into the object. The
712 * array "marray" returned contains an array of
713 * vm_page_t structs where one of them is the
714 * vm_page_t passed to the routine. The reqpage
715 * return value is the index into the marray for the
716 * vm_page_t passed to the routine.
718 * fs.m plus the additional pages are PG_BUSY'd.
720 faultcount = vm_fault_additional_pages(
721 fs->m, behind, ahead, marray, &reqpage);
724 * update lastr imperfectly (we do not know how much
725 * getpages will actually read), but good enough.
727 fs->entry->lastr = pindex + faultcount - behind;
730 * Call the pager to retrieve the data, if any, after
731 * releasing the lock on the map. We hold a ref on
732 * fs.object and the pages are PG_BUSY'd.
737 rv = vm_pager_get_pages(fs->object, marray,
738 faultcount, reqpage);
743 if (rv == VM_PAGER_OK) {
745 * Found the page. Leave it busy while we play
750 * Relookup in case pager changed page. Pager
751 * is responsible for disposition of old page
754 * XXX other code segments do relookups too.
755 * It's a bad abstraction that needs to be
758 fs->m = vm_page_lookup(fs->object, pindex);
760 unlock_and_deallocate(fs);
761 return (KERN_TRY_AGAIN);
765 break; /* break to PAGE HAS BEEN FOUND */
769 * Remove the bogus page (which does not exist at this
770 * object/offset); before doing so, we must get back
771 * our object lock to preserve our invariant.
773 * Also wake up any other process that may want to bring
776 * If this is the top-level object, we must leave the
777 * busy page to prevent another process from rushing
778 * past us, and inserting the page in that object at
779 * the same time that we are.
781 if (rv == VM_PAGER_ERROR) {
783 kprintf("vm_fault: pager read error, pid %d (%s)\n", curproc->p_pid, curproc->p_comm);
785 kprintf("vm_fault: pager read error, thread %p (%s)\n", curthread, curproc->p_comm);
788 * Data outside the range of the pager or an I/O error
791 * XXX - the check for kernel_map is a kludge to work
792 * around having the machine panic on a kernel space
793 * fault w/ I/O error.
795 if (((fs->map != kernel_map) && (rv == VM_PAGER_ERROR)) ||
796 (rv == VM_PAGER_BAD)) {
799 unlock_and_deallocate(fs);
800 if (rv == VM_PAGER_ERROR)
801 return (KERN_FAILURE);
803 return (KERN_PROTECTION_FAILURE);
806 if (fs->object != fs->first_object) {
810 * XXX - we cannot just fall out at this
811 * point, m has been freed and is invalid!
817 * We get here if the object has a default pager (or unwiring)
818 * or the pager doesn't have the page.
820 if (fs->object == fs->first_object)
824 * Move on to the next object. Lock the next object before
825 * unlocking the current one.
827 pindex += OFF_TO_IDX(fs->object->backing_object_offset);
828 next_object = fs->object->backing_object;
829 if (next_object == NULL) {
831 * If there's no object left, fill the page in the top
834 if (fs->object != fs->first_object) {
835 vm_object_pip_wakeup(fs->object);
837 fs->object = fs->first_object;
838 pindex = first_pindex;
844 * Zero the page if necessary and mark it valid.
846 if ((fs->m->flags & PG_ZERO) == 0) {
847 vm_page_zero_fill(fs->m);
849 mycpu->gd_cnt.v_ozfod++;
851 mycpu->gd_cnt.v_zfod++;
852 fs->m->valid = VM_PAGE_BITS_ALL;
853 break; /* break to PAGE HAS BEEN FOUND */
855 if (fs->object != fs->first_object) {
856 vm_object_pip_wakeup(fs->object);
858 KASSERT(fs->object != next_object, ("object loop %p", next_object));
859 fs->object = next_object;
860 vm_object_pip_add(fs->object, 1);
864 KASSERT((fs->m->flags & PG_BUSY) != 0,
865 ("vm_fault: not busy after main loop"));
868 * PAGE HAS BEEN FOUND. [Loop invariant still holds -- the object lock
873 * If the page is being written, but isn't already owned by the
874 * top-level object, we have to copy it into a new page owned by the
877 if (fs->object != fs->first_object) {
879 * We only really need to copy if we want to write it.
881 if (fault_type & VM_PROT_WRITE) {
883 * This allows pages to be virtually copied from a
884 * backing_object into the first_object, where the
885 * backing object has no other refs to it, and cannot
886 * gain any more refs. Instead of a bcopy, we just
887 * move the page from the backing object to the
888 * first object. Note that we must mark the page
889 * dirty in the first object so that it will go out
890 * to swap when needed.
892 if (fs->map_generation == fs->map->timestamp &&
894 * Only one shadow object
896 (fs->object->shadow_count == 1) &&
898 * No COW refs, except us
900 (fs->object->ref_count == 1) &&
902 * No one else can look this object up
904 (fs->object->handle == NULL) &&
906 * No other ways to look the object up
908 ((fs->object->type == OBJT_DEFAULT) ||
909 (fs->object->type == OBJT_SWAP)) &&
911 * We don't chase down the shadow chain
913 (fs->object == fs->first_object->backing_object) &&
916 * grab the lock if we need to
918 (fs->lookup_still_valid ||
919 lockmgr(&fs->map->lock, LK_EXCLUSIVE|LK_NOWAIT) == 0)
922 fs->lookup_still_valid = 1;
924 * get rid of the unnecessary page
926 vm_page_protect(fs->first_m, VM_PROT_NONE);
927 vm_page_free(fs->first_m);
931 * grab the page and put it into the
932 * process'es object. The page is
933 * automatically made dirty.
935 vm_page_rename(fs->m, fs->first_object, first_pindex);
937 vm_page_busy(fs->first_m);
939 mycpu->gd_cnt.v_cow_optim++;
942 * Oh, well, lets copy it.
944 vm_page_copy(fs->m, fs->first_m);
949 * We no longer need the old page or object.
955 * fs->object != fs->first_object due to above
958 vm_object_pip_wakeup(fs->object);
961 * Only use the new page below...
964 mycpu->gd_cnt.v_cow_faults++;
966 fs->object = fs->first_object;
967 pindex = first_pindex;
970 * If it wasn't a write fault avoid having to copy
971 * the page by mapping it read-only.
973 fs->prot &= ~VM_PROT_WRITE;
978 * We may have had to unlock a map to do I/O. If we did then
979 * lookup_still_valid will be FALSE. If the map generation count
980 * also changed then all sorts of things could have happened while
981 * we were doing the I/O and we need to retry.
984 if (!fs->lookup_still_valid &&
985 (fs->map->timestamp != fs->map_generation)) {
987 unlock_and_deallocate(fs);
988 return (KERN_TRY_AGAIN);
992 * Put this page into the physical map. We had to do the unlock above
993 * because pmap_enter may cause other faults. We don't put the page
994 * back on the active queue until later so that the page-out daemon
995 * won't find us (yet).
997 if (fs->prot & VM_PROT_WRITE) {
998 vm_page_flag_set(fs->m, PG_WRITEABLE);
999 vm_object_set_writeable_dirty(fs->m->object);
1002 * If the fault is a write, we know that this page is being
1003 * written NOW so dirty it explicitly to save on
1004 * pmap_is_modified() calls later.
1006 * If this is a NOSYNC mmap we do not want to set PG_NOSYNC
1007 * if the page is already dirty to prevent data written with
1008 * the expectation of being synced from not being synced.
1009 * Likewise if this entry does not request NOSYNC then make
1010 * sure the page isn't marked NOSYNC. Applications sharing
1011 * data should use the same flags to avoid ping ponging.
1013 * Also tell the backing pager, if any, that it should remove
1014 * any swap backing since the page is now dirty.
1016 if (fs->entry->eflags & MAP_ENTRY_NOSYNC) {
1017 if (fs->m->dirty == 0)
1018 vm_page_flag_set(fs->m, PG_NOSYNC);
1020 vm_page_flag_clear(fs->m, PG_NOSYNC);
1022 if (fs->fault_flags & VM_FAULT_DIRTY) {
1024 vm_page_dirty(fs->m);
1025 vm_pager_page_unswapped(fs->m);
1031 * Page had better still be busy. We are still locked up and
1032 * fs->object will have another PIP reference if it is not equal
1033 * to fs->first_object.
1035 KASSERT(fs->m->flags & PG_BUSY,
1036 ("vm_fault: page %p not busy!", fs->m));
1039 * Sanity check: page must be completely valid or it is not fit to
1040 * map into user space. vm_pager_get_pages() ensures this.
1042 if (fs->m->valid != VM_PAGE_BITS_ALL) {
1043 vm_page_zero_invalid(fs->m, TRUE);
1044 kprintf("Warning: page %p partially invalid on fault\n", fs->m);
1047 return (KERN_SUCCESS);
1051 * quick version of vm_fault
1054 vm_fault_quick(caddr_t v, int prot)
1058 if (prot & VM_PROT_WRITE)
1059 r = subyte(v, fubyte(v));
1066 * Wire down a range of virtual addresses in a map. The entry in question
1067 * should be marked in-transition and the map must be locked. We must
1068 * release the map temporarily while faulting-in the page to avoid a
1069 * deadlock. Note that the entry may be clipped while we are blocked but
1070 * will never be freed.
1073 vm_fault_wire(vm_map_t map, vm_map_entry_t entry, boolean_t user_wire)
1075 boolean_t fictitious;
1083 pmap = vm_map_pmap(map);
1084 start = entry->start;
1086 fictitious = entry->object.vm_object &&
1087 (entry->object.vm_object->type == OBJT_DEVICE);
1093 * We simulate a fault to get the page and enter it in the physical
1096 for (va = start; va < end; va += PAGE_SIZE) {
1098 rv = vm_fault(map, va, VM_PROT_READ,
1099 VM_FAULT_USER_WIRE);
1101 rv = vm_fault(map, va, VM_PROT_READ|VM_PROT_WRITE,
1102 VM_FAULT_CHANGE_WIRING);
1105 while (va > start) {
1107 if ((pa = pmap_extract(pmap, va)) == 0)
1109 pmap_change_wiring(pmap, va, FALSE);
1111 vm_page_unwire(PHYS_TO_VM_PAGE(pa), 1);
1118 return (KERN_SUCCESS);
1122 * Unwire a range of virtual addresses in a map. The map should be
1126 vm_fault_unwire(vm_map_t map, vm_map_entry_t entry)
1128 boolean_t fictitious;
1135 pmap = vm_map_pmap(map);
1136 start = entry->start;
1138 fictitious = entry->object.vm_object &&
1139 (entry->object.vm_object->type == OBJT_DEVICE);
1142 * Since the pages are wired down, we must be able to get their
1143 * mappings from the physical map system.
1145 for (va = start; va < end; va += PAGE_SIZE) {
1146 pa = pmap_extract(pmap, va);
1148 pmap_change_wiring(pmap, va, FALSE);
1150 vm_page_unwire(PHYS_TO_VM_PAGE(pa), 1);
1156 * Reduce the rate at which memory is allocated to a process based
1157 * on the perceived load on the VM system. As the load increases
1158 * the allocation burst rate goes down and the delay increases.
1160 * Rate limiting does not apply when faulting active or inactive
1161 * pages. When faulting 'cache' pages, rate limiting only applies
1162 * if the system currently has a severe page deficit.
1164 * XXX vm_pagesupply should be increased when a page is freed.
1166 * We sleep up to 1/10 of a second.
1169 vm_fault_ratelimit(struct vmspace *vmspace)
1171 if (vm_load_enable == 0)
1173 if (vmspace->vm_pagesupply > 0) {
1174 --vmspace->vm_pagesupply;
1178 if (vm_load_debug) {
1179 kprintf("load %-4d give %d pgs, wait %d, pid %-5d (%s)\n",
1181 (1000 - vm_load ) / 10, vm_load * hz / 10000,
1182 curproc->p_pid, curproc->p_comm);
1185 vmspace->vm_pagesupply = (1000 - vm_load) / 10;
1186 return(vm_load * hz / 10000);
1191 * vm_fault_copy_entry
1193 * Copy all of the pages from a wired-down map entry to another.
1195 * In/out conditions:
1196 * The source and destination maps must be locked for write.
1197 * The source map entry must be wired down (or be a sharing map
1198 * entry corresponding to a main map entry that is wired down).
1202 vm_fault_copy_entry(vm_map_t dst_map, vm_map_t src_map,
1203 vm_map_entry_t dst_entry, vm_map_entry_t src_entry)
1205 vm_object_t dst_object;
1206 vm_object_t src_object;
1207 vm_ooffset_t dst_offset;
1208 vm_ooffset_t src_offset;
1218 src_object = src_entry->object.vm_object;
1219 src_offset = src_entry->offset;
1222 * Create the top-level object for the destination entry. (Doesn't
1223 * actually shadow anything - we copy the pages directly.)
1225 vm_map_entry_allocate_object(dst_entry);
1226 dst_object = dst_entry->object.vm_object;
1228 prot = dst_entry->max_protection;
1231 * Loop through all of the pages in the entry's range, copying each
1232 * one from the source object (it should be there) to the destination
1235 for (vaddr = dst_entry->start, dst_offset = 0;
1236 vaddr < dst_entry->end;
1237 vaddr += PAGE_SIZE, dst_offset += PAGE_SIZE) {
1240 * Allocate a page in the destination object
1243 dst_m = vm_page_alloc(dst_object,
1244 OFF_TO_IDX(dst_offset), VM_ALLOC_NORMAL);
1245 if (dst_m == NULL) {
1248 } while (dst_m == NULL);
1251 * Find the page in the source object, and copy it in.
1252 * (Because the source is wired down, the page will be in
1255 src_m = vm_page_lookup(src_object,
1256 OFF_TO_IDX(dst_offset + src_offset));
1258 panic("vm_fault_copy_wired: page missing");
1260 vm_page_copy(src_m, dst_m);
1263 * Enter it in the pmap...
1266 vm_page_flag_clear(dst_m, PG_ZERO);
1267 pmap_enter(dst_map->pmap, vaddr, dst_m, prot, FALSE);
1268 vm_page_flag_set(dst_m, PG_WRITEABLE|PG_MAPPED);
1271 * Mark it no longer busy, and put it on the active list.
1273 vm_page_activate(dst_m);
1274 vm_page_wakeup(dst_m);
1280 * This routine checks around the requested page for other pages that
1281 * might be able to be faulted in. This routine brackets the viable
1282 * pages for the pages to be paged in.
1285 * m, rbehind, rahead
1288 * marray (array of vm_page_t), reqpage (index of requested page)
1291 * number of pages in marray
1294 vm_fault_additional_pages(vm_page_t m, int rbehind, int rahead,
1295 vm_page_t *marray, int *reqpage)
1299 vm_pindex_t pindex, startpindex, endpindex, tpindex;
1301 int cbehind, cahead;
1307 * we don't fault-ahead for device pager
1309 if (object->type == OBJT_DEVICE) {
1316 * if the requested page is not available, then give up now
1319 if (!vm_pager_has_page(object, pindex, &cbehind, &cahead)) {
1323 if ((cbehind == 0) && (cahead == 0)) {
1329 if (rahead > cahead) {
1333 if (rbehind > cbehind) {
1338 * try to do any readahead that we might have free pages for.
1340 if ((rahead + rbehind) >
1341 ((vmstats.v_free_count + vmstats.v_cache_count) - vmstats.v_free_reserved)) {
1342 pagedaemon_wakeup();
1349 * scan backward for the read behind pages -- in memory
1351 * Assume that if the page is not found an interrupt will not
1352 * create it. Theoretically interrupts can only remove (busy)
1353 * pages, not create new associations.
1356 if (rbehind > pindex) {
1360 startpindex = pindex - rbehind;
1364 for ( tpindex = pindex - 1; tpindex >= startpindex; tpindex -= 1) {
1365 if (vm_page_lookup( object, tpindex)) {
1366 startpindex = tpindex + 1;
1373 for(i = 0, tpindex = startpindex; tpindex < pindex; i++, tpindex++) {
1375 rtm = vm_page_alloc(object, tpindex, VM_ALLOC_NORMAL);
1378 for (j = 0; j < i; j++) {
1379 vm_page_free(marray[j]);
1395 /* page offset of the required page */
1398 tpindex = pindex + 1;
1402 * scan forward for the read ahead pages
1404 endpindex = tpindex + rahead;
1405 if (endpindex > object->size)
1406 endpindex = object->size;
1409 for( ; tpindex < endpindex; i++, tpindex++) {
1411 if (vm_page_lookup(object, tpindex)) {
1415 rtm = vm_page_alloc(object, tpindex, VM_ALLOC_NORMAL);
1424 /* return number of bytes of pages */