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.
71 * Page fault handling module.
74 #include <sys/cdefs.h>
75 __FBSDID("$FreeBSD$");
77 #include <sys/param.h>
78 #include <sys/systm.h>
79 #include <sys/kernel.h>
81 #include <sys/mutex.h>
83 #include <sys/resourcevar.h>
84 #include <sys/sysctl.h>
85 #include <sys/vmmeter.h>
86 #include <sys/vnode.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/mount.h> /* XXX Temporary for VFS_LOCK_GIANT() */
104 #define PAGEORDER_SIZE (PFBAK+PFFOR)
106 static int prefault_pageorder[] = {
107 -1 * PAGE_SIZE, 1 * PAGE_SIZE,
108 -2 * PAGE_SIZE, 2 * PAGE_SIZE,
109 -3 * PAGE_SIZE, 3 * PAGE_SIZE,
110 -4 * PAGE_SIZE, 4 * PAGE_SIZE
113 static int vm_fault_additional_pages(vm_page_t, int, int, vm_page_t *, int *);
114 static void vm_fault_prefault(pmap_t, vm_offset_t, vm_map_entry_t);
116 #define VM_FAULT_READ_AHEAD 8
117 #define VM_FAULT_READ_BEHIND 7
118 #define VM_FAULT_READ (VM_FAULT_READ_AHEAD+VM_FAULT_READ_BEHIND+1)
125 vm_object_t first_object;
126 vm_pindex_t first_pindex;
128 vm_map_entry_t entry;
129 int lookup_still_valid;
134 release_page(struct faultstate *fs)
136 vm_page_wakeup(fs->m);
137 vm_page_lock_queues();
138 vm_page_deactivate(fs->m);
139 vm_page_unlock_queues();
144 unlock_map(struct faultstate *fs)
146 if (fs->lookup_still_valid) {
147 vm_map_lookup_done(fs->map, fs->entry);
148 fs->lookup_still_valid = FALSE;
153 unlock_and_deallocate(struct faultstate *fs)
156 vm_object_pip_wakeup(fs->object);
157 VM_OBJECT_UNLOCK(fs->object);
158 if (fs->object != fs->first_object) {
159 VM_OBJECT_LOCK(fs->first_object);
160 vm_page_lock_queues();
161 vm_page_free(fs->first_m);
162 vm_page_unlock_queues();
163 vm_object_pip_wakeup(fs->first_object);
164 VM_OBJECT_UNLOCK(fs->first_object);
167 vm_object_deallocate(fs->first_object);
169 if (fs->vp != NULL) {
172 vfslocked = VFS_LOCK_GIANT(fs->vp->v_mount);
175 VFS_UNLOCK_GIANT(vfslocked);
180 * TRYPAGER - used by vm_fault to calculate whether the pager for the
181 * current object *might* contain the page.
183 * default objects are zero-fill, there is no real pager.
185 #define TRYPAGER (fs.object->type != OBJT_DEFAULT && \
186 (((fault_flags & VM_FAULT_WIRE_MASK) == 0) || wired))
191 * Handle a page fault occurring at the given address,
192 * requiring the given permissions, in the map specified.
193 * If successful, the page is inserted into the
194 * associated physical map.
196 * NOTE: the given address should be truncated to the
197 * proper page address.
199 * KERN_SUCCESS is returned if the page fault is handled; otherwise,
200 * a standard error specifying why the fault is fatal is returned.
203 * The map in question must be referenced, and remains so.
204 * Caller may hold no locks.
207 vm_fault(vm_map_t map, vm_offset_t vaddr, vm_prot_t fault_type,
211 int is_first_object_locked, result;
212 boolean_t growstack, wired;
214 vm_object_t next_object;
215 vm_page_t marray[VM_FAULT_READ];
218 struct faultstate fs;
222 PCPU_LAZY_INC(cnt.v_vm_faults);
227 * Find the backing store object and offset into it to begin the
231 result = vm_map_lookup(&fs.map, vaddr, fault_type, &fs.entry,
232 &fs.first_object, &fs.first_pindex, &prot, &wired);
233 if (result != KERN_SUCCESS) {
234 if (result != KERN_PROTECTION_FAILURE ||
235 (fault_flags & VM_FAULT_WIRE_MASK) != VM_FAULT_USER_WIRE) {
236 if (growstack && result == KERN_INVALID_ADDRESS &&
237 map != kernel_map && curproc != NULL) {
238 result = vm_map_growstack(curproc, vaddr);
239 if (result != KERN_SUCCESS)
240 return (KERN_FAILURE);
248 * If we are user-wiring a r/w segment, and it is COW, then
249 * we need to do the COW operation. Note that we don't COW
250 * currently RO sections now, because it is NOT desirable
251 * to COW .text. We simply keep .text from ever being COW'ed
252 * and take the heat that one cannot debug wired .text sections.
254 result = vm_map_lookup(&fs.map, vaddr,
255 VM_PROT_READ|VM_PROT_WRITE|VM_PROT_OVERRIDE_WRITE,
256 &fs.entry, &fs.first_object, &fs.first_pindex, &prot, &wired);
257 if (result != KERN_SUCCESS)
261 * If we don't COW now, on a user wire, the user will never
262 * be able to write to the mapping. If we don't make this
263 * restriction, the bookkeeping would be nearly impossible.
265 * XXX The following assignment modifies the map without
266 * holding a write lock on it.
268 if ((fs.entry->protection & VM_PROT_WRITE) == 0)
269 fs.entry->max_protection &= ~VM_PROT_WRITE;
272 map_generation = fs.map->timestamp;
274 if (fs.entry->eflags & MAP_ENTRY_NOFAULT) {
275 panic("vm_fault: fault on nofault entry, addr: %lx",
280 * Make a reference to this object to prevent its disposal while we
281 * are messing with it. Once we have the reference, the map is free
282 * to be diddled. Since objects reference their shadows (and copies),
283 * they will stay around as well.
285 * Bump the paging-in-progress count to prevent size changes (e.g.
286 * truncation operations) during I/O. This must be done after
287 * obtaining the vnode lock in order to avoid possible deadlocks.
289 * XXX vnode_pager_lock() can block without releasing the map lock.
291 if (fs.first_object->flags & OBJ_NEEDGIANT)
293 VM_OBJECT_LOCK(fs.first_object);
294 vm_object_reference_locked(fs.first_object);
295 fs.vp = vnode_pager_lock(fs.first_object);
296 KASSERT(fs.vp == NULL || !fs.map->system_map,
297 ("vm_fault: vnode-backed object mapped by system map"));
298 KASSERT((fs.first_object->flags & OBJ_NEEDGIANT) == 0 ||
300 ("vm_fault: Object requiring giant mapped by system map"));
301 if (fs.first_object->flags & OBJ_NEEDGIANT)
303 vm_object_pip_add(fs.first_object, 1);
305 fs.lookup_still_valid = TRUE;
313 * Search for the page at object/offset.
315 fs.object = fs.first_object;
316 fs.pindex = fs.first_pindex;
319 * If the object is dead, we stop here
321 if (fs.object->flags & OBJ_DEAD) {
322 unlock_and_deallocate(&fs);
323 return (KERN_PROTECTION_FAILURE);
327 * See if page is resident
329 fs.m = vm_page_lookup(fs.object, fs.pindex);
334 * check for page-based copy on write.
335 * We check fs.object == fs.first_object so
336 * as to ensure the legacy COW mechanism is
337 * used when the page in question is part of
338 * a shadow object. Otherwise, vm_page_cowfault()
339 * removes the page from the backing object,
340 * which is not what we want.
342 vm_page_lock_queues();
344 (fault_type & VM_PROT_WRITE) &&
345 (fs.object == fs.first_object)) {
346 vm_page_cowfault(fs.m);
347 vm_page_unlock_queues();
348 unlock_and_deallocate(&fs);
353 * Wait/Retry if the page is busy. We have to do this
354 * if the page is busy via either VPO_BUSY or
355 * vm_page_t->busy because the vm_pager may be using
356 * vm_page_t->busy for pageouts ( and even pageins if
357 * it is the vnode pager ), and we could end up trying
358 * to pagein and pageout the same page simultaneously.
360 * We can theoretically allow the busy case on a read
361 * fault if the page is marked valid, but since such
362 * pages are typically already pmap'd, putting that
363 * special case in might be more effort then it is
364 * worth. We cannot under any circumstances mess
365 * around with a vm_page_t->busy page except, perhaps,
368 if ((fs.m->oflags & VPO_BUSY) || fs.m->busy) {
369 vm_page_unlock_queues();
370 VM_OBJECT_UNLOCK(fs.object);
371 if (fs.object != fs.first_object) {
372 VM_OBJECT_LOCK(fs.first_object);
373 vm_page_lock_queues();
374 vm_page_free(fs.first_m);
375 vm_page_unlock_queues();
376 vm_object_pip_wakeup(fs.first_object);
377 VM_OBJECT_UNLOCK(fs.first_object);
384 vfslck = VFS_LOCK_GIANT(fs.vp->v_mount);
387 VFS_UNLOCK_GIANT(vfslck);
389 VM_OBJECT_LOCK(fs.object);
390 if (fs.m == vm_page_lookup(fs.object,
392 vm_page_sleep_if_busy(fs.m, TRUE,
395 vm_object_pip_wakeup(fs.object);
396 VM_OBJECT_UNLOCK(fs.object);
397 PCPU_LAZY_INC(cnt.v_intrans);
398 vm_object_deallocate(fs.first_object);
403 vm_pageq_remove_nowakeup(fs.m);
405 if (VM_PAGE_RESOLVEQUEUE(fs.m, queue) == PQ_CACHE &&
406 vm_page_count_severe()) {
407 vm_page_activate(fs.m);
408 vm_page_unlock_queues();
409 unlock_and_deallocate(&fs);
413 vm_page_unlock_queues();
416 * Mark page busy for other processes, and the
417 * pagedaemon. If it still isn't completely valid
418 * (readable), jump to readrest, else break-out ( we
422 if (((fs.m->valid & VM_PAGE_BITS_ALL) != VM_PAGE_BITS_ALL) &&
423 fs.m->object != kernel_object && fs.m->object != kmem_object) {
431 * Page is not resident, If this is the search termination
432 * or the pager might contain the page, allocate a new page.
434 if (TRYPAGER || fs.object == fs.first_object) {
435 if (fs.pindex >= fs.object->size) {
436 unlock_and_deallocate(&fs);
437 return (KERN_PROTECTION_FAILURE);
441 * Allocate a new page for this object/offset pair.
444 if (!vm_page_count_severe()) {
445 fs.m = vm_page_alloc(fs.object, fs.pindex,
446 (fs.vp || fs.object->backing_object)? VM_ALLOC_NORMAL: VM_ALLOC_ZERO);
449 unlock_and_deallocate(&fs);
457 * We have found a valid page or we have allocated a new page.
458 * The page thus may not be valid or may not be entirely
461 * Attempt to fault-in the page if there is a chance that the
462 * pager has it, and potentially fault in additional pages
469 u_char behavior = vm_map_entry_behavior(fs.entry);
471 if (behavior == MAP_ENTRY_BEHAV_RANDOM) {
475 behind = (vaddr - fs.entry->start) >> PAGE_SHIFT;
476 if (behind > VM_FAULT_READ_BEHIND)
477 behind = VM_FAULT_READ_BEHIND;
479 ahead = ((fs.entry->end - vaddr) >> PAGE_SHIFT) - 1;
480 if (ahead > VM_FAULT_READ_AHEAD)
481 ahead = VM_FAULT_READ_AHEAD;
483 is_first_object_locked = FALSE;
484 if ((behavior == MAP_ENTRY_BEHAV_SEQUENTIAL ||
485 (behavior != MAP_ENTRY_BEHAV_RANDOM &&
486 fs.pindex >= fs.entry->lastr &&
487 fs.pindex < fs.entry->lastr + VM_FAULT_READ)) &&
488 (fs.first_object == fs.object ||
489 (is_first_object_locked = VM_OBJECT_TRYLOCK(fs.first_object))) &&
490 fs.first_object->type != OBJT_DEVICE) {
491 vm_pindex_t firstpindex, tmppindex;
493 if (fs.first_pindex < 2 * VM_FAULT_READ)
496 firstpindex = fs.first_pindex - 2 * VM_FAULT_READ;
498 vm_page_lock_queues();
500 * note: partially valid pages cannot be
501 * included in the lookahead - NFS piecemeal
502 * writes will barf on it badly.
504 for (tmppindex = fs.first_pindex - 1;
505 tmppindex >= firstpindex;
509 mt = vm_page_lookup(fs.first_object, tmppindex);
510 if (mt == NULL || (mt->valid != VM_PAGE_BITS_ALL))
513 (mt->oflags & VPO_BUSY) ||
514 (mt->flags & (PG_FICTITIOUS | PG_UNMANAGED)) ||
520 vm_page_deactivate(mt);
525 vm_page_unlock_queues();
529 if (is_first_object_locked)
530 VM_OBJECT_UNLOCK(fs.first_object);
532 * now we find out if any other pages should be paged
533 * in at this time this routine checks to see if the
534 * pages surrounding this fault reside in the same
535 * object as the page for this fault. If they do,
536 * then they are faulted in also into the object. The
537 * array "marray" returned contains an array of
538 * vm_page_t structs where one of them is the
539 * vm_page_t passed to the routine. The reqpage
540 * return value is the index into the marray for the
541 * vm_page_t passed to the routine.
543 * fs.m plus the additional pages are VPO_BUSY'd.
545 * XXX vm_fault_additional_pages() can block
546 * without releasing the map lock.
548 faultcount = vm_fault_additional_pages(
549 fs.m, behind, ahead, marray, &reqpage);
552 * update lastr imperfectly (we do not know how much
553 * getpages will actually read), but good enough.
555 * XXX The following assignment modifies the map
556 * without holding a write lock on it.
558 fs.entry->lastr = fs.pindex + faultcount - behind;
561 * Call the pager to retrieve the data, if any, after
562 * releasing the lock on the map. We hold a ref on
563 * fs.object and the pages are VPO_BUSY'd.
568 vm_pager_get_pages(fs.object, marray, faultcount,
569 reqpage) : VM_PAGER_FAIL;
571 if (rv == VM_PAGER_OK) {
573 * Found the page. Leave it busy while we play
578 * Relookup in case pager changed page. Pager
579 * is responsible for disposition of old page
582 fs.m = vm_page_lookup(fs.object, fs.pindex);
584 unlock_and_deallocate(&fs);
589 break; /* break to PAGE HAS BEEN FOUND */
592 * Remove the bogus page (which does not exist at this
593 * object/offset); before doing so, we must get back
594 * our object lock to preserve our invariant.
596 * Also wake up any other process that may want to bring
599 * If this is the top-level object, we must leave the
600 * busy page to prevent another process from rushing
601 * past us, and inserting the page in that object at
602 * the same time that we are.
604 if (rv == VM_PAGER_ERROR)
605 printf("vm_fault: pager read error, pid %d (%s)\n",
606 curproc->p_pid, curproc->p_comm);
608 * Data outside the range of the pager or an I/O error
611 * XXX - the check for kernel_map is a kludge to work
612 * around having the machine panic on a kernel space
613 * fault w/ I/O error.
615 if (((fs.map != kernel_map) && (rv == VM_PAGER_ERROR)) ||
616 (rv == VM_PAGER_BAD)) {
617 vm_page_lock_queues();
619 vm_page_unlock_queues();
621 unlock_and_deallocate(&fs);
622 return ((rv == VM_PAGER_ERROR) ? KERN_FAILURE : KERN_PROTECTION_FAILURE);
624 if (fs.object != fs.first_object) {
625 vm_page_lock_queues();
627 vm_page_unlock_queues();
630 * XXX - we cannot just fall out at this
631 * point, m has been freed and is invalid!
637 * We get here if the object has default pager (or unwiring)
638 * or the pager doesn't have the page.
640 if (fs.object == fs.first_object)
644 * Move on to the next object. Lock the next object before
645 * unlocking the current one.
647 fs.pindex += OFF_TO_IDX(fs.object->backing_object_offset);
648 next_object = fs.object->backing_object;
649 if (next_object == NULL) {
651 * If there's no object left, fill the page in the top
654 if (fs.object != fs.first_object) {
655 vm_object_pip_wakeup(fs.object);
656 VM_OBJECT_UNLOCK(fs.object);
658 fs.object = fs.first_object;
659 fs.pindex = fs.first_pindex;
661 VM_OBJECT_LOCK(fs.object);
666 * Zero the page if necessary and mark it valid.
668 if ((fs.m->flags & PG_ZERO) == 0) {
669 pmap_zero_page(fs.m);
671 PCPU_LAZY_INC(cnt.v_ozfod);
673 PCPU_LAZY_INC(cnt.v_zfod);
674 fs.m->valid = VM_PAGE_BITS_ALL;
675 break; /* break to PAGE HAS BEEN FOUND */
677 KASSERT(fs.object != next_object,
678 ("object loop %p", next_object));
679 VM_OBJECT_LOCK(next_object);
680 vm_object_pip_add(next_object, 1);
681 if (fs.object != fs.first_object)
682 vm_object_pip_wakeup(fs.object);
683 VM_OBJECT_UNLOCK(fs.object);
684 fs.object = next_object;
688 KASSERT((fs.m->oflags & VPO_BUSY) != 0,
689 ("vm_fault: not busy after main loop"));
692 * PAGE HAS BEEN FOUND. [Loop invariant still holds -- the object lock
697 * If the page is being written, but isn't already owned by the
698 * top-level object, we have to copy it into a new page owned by the
701 if (fs.object != fs.first_object) {
703 * We only really need to copy if we want to write it.
705 if (fault_type & VM_PROT_WRITE) {
707 * This allows pages to be virtually copied from a
708 * backing_object into the first_object, where the
709 * backing object has no other refs to it, and cannot
710 * gain any more refs. Instead of a bcopy, we just
711 * move the page from the backing object to the
712 * first object. Note that we must mark the page
713 * dirty in the first object so that it will go out
714 * to swap when needed.
716 is_first_object_locked = FALSE;
719 * Only one shadow object
721 (fs.object->shadow_count == 1) &&
723 * No COW refs, except us
725 (fs.object->ref_count == 1) &&
727 * No one else can look this object up
729 (fs.object->handle == NULL) &&
731 * No other ways to look the object up
733 ((fs.object->type == OBJT_DEFAULT) ||
734 (fs.object->type == OBJT_SWAP)) &&
735 (is_first_object_locked = VM_OBJECT_TRYLOCK(fs.first_object)) &&
737 * We don't chase down the shadow chain
739 fs.object == fs.first_object->backing_object) {
740 vm_page_lock_queues();
742 * get rid of the unnecessary page
744 vm_page_free(fs.first_m);
746 * grab the page and put it into the
747 * process'es object. The page is
748 * automatically made dirty.
750 vm_page_rename(fs.m, fs.first_object, fs.first_pindex);
751 vm_page_unlock_queues();
755 PCPU_LAZY_INC(cnt.v_cow_optim);
758 * Oh, well, lets copy it.
760 pmap_copy_page(fs.m, fs.first_m);
761 fs.first_m->valid = VM_PAGE_BITS_ALL;
765 * We no longer need the old page or object.
770 * fs.object != fs.first_object due to above
773 vm_object_pip_wakeup(fs.object);
774 VM_OBJECT_UNLOCK(fs.object);
776 * Only use the new page below...
778 fs.object = fs.first_object;
779 fs.pindex = fs.first_pindex;
781 if (!is_first_object_locked)
782 VM_OBJECT_LOCK(fs.object);
783 PCPU_LAZY_INC(cnt.v_cow_faults);
785 prot &= ~VM_PROT_WRITE;
790 * We must verify that the maps have not changed since our last
793 if (!fs.lookup_still_valid) {
794 vm_object_t retry_object;
795 vm_pindex_t retry_pindex;
796 vm_prot_t retry_prot;
798 if (!vm_map_trylock_read(fs.map)) {
800 unlock_and_deallocate(&fs);
803 fs.lookup_still_valid = TRUE;
804 if (fs.map->timestamp != map_generation) {
805 result = vm_map_lookup_locked(&fs.map, vaddr, fault_type,
806 &fs.entry, &retry_object, &retry_pindex, &retry_prot, &wired);
809 * If we don't need the page any longer, put it on the inactive
810 * list (the easiest thing to do here). If no one needs it,
811 * pageout will grab it eventually.
813 if (result != KERN_SUCCESS) {
815 unlock_and_deallocate(&fs);
818 * If retry of map lookup would have blocked then
819 * retry fault from start.
821 if (result == KERN_FAILURE)
825 if ((retry_object != fs.first_object) ||
826 (retry_pindex != fs.first_pindex)) {
828 unlock_and_deallocate(&fs);
833 * Check whether the protection has changed or the object has
834 * been copied while we left the map unlocked. Changing from
835 * read to write permission is OK - we leave the page
836 * write-protected, and catch the write fault. Changing from
837 * write to read permission means that we can't mark the page
838 * write-enabled after all.
843 if (prot & VM_PROT_WRITE) {
844 vm_object_set_writeable_dirty(fs.object);
847 * If the fault is a write, we know that this page is being
848 * written NOW so dirty it explicitly to save on
849 * pmap_is_modified() calls later.
851 * If this is a NOSYNC mmap we do not want to set VPO_NOSYNC
852 * if the page is already dirty to prevent data written with
853 * the expectation of being synced from not being synced.
854 * Likewise if this entry does not request NOSYNC then make
855 * sure the page isn't marked NOSYNC. Applications sharing
856 * data should use the same flags to avoid ping ponging.
858 * Also tell the backing pager, if any, that it should remove
859 * any swap backing since the page is now dirty.
861 if (fs.entry->eflags & MAP_ENTRY_NOSYNC) {
862 if (fs.m->dirty == 0)
863 fs.m->oflags |= VPO_NOSYNC;
865 fs.m->oflags &= ~VPO_NOSYNC;
867 if (fault_flags & VM_FAULT_DIRTY) {
869 vm_pager_page_unswapped(fs.m);
874 * Page had better still be busy
876 KASSERT(fs.m->oflags & VPO_BUSY,
877 ("vm_fault: page %p not busy!", fs.m));
879 * Sanity check: page must be completely valid or it is not fit to
880 * map into user space. vm_pager_get_pages() ensures this.
882 if (fs.m->valid != VM_PAGE_BITS_ALL) {
883 vm_page_zero_invalid(fs.m, TRUE);
884 printf("Warning: page %p partially invalid on fault\n", fs.m);
886 VM_OBJECT_UNLOCK(fs.object);
889 * Put this page into the physical map. We had to do the unlock above
890 * because pmap_enter() may sleep. We don't put the page
891 * back on the active queue until later so that the pageout daemon
892 * won't find it (yet).
894 pmap_enter(fs.map->pmap, vaddr, fs.m, prot, wired);
895 if (((fault_flags & VM_FAULT_WIRE_MASK) == 0) && (wired == 0)) {
896 vm_fault_prefault(fs.map->pmap, vaddr, fs.entry);
898 VM_OBJECT_LOCK(fs.object);
899 vm_page_lock_queues();
900 vm_page_flag_set(fs.m, PG_REFERENCED);
903 * If the page is not wired down, then put it where the pageout daemon
906 if (fault_flags & VM_FAULT_WIRE_MASK) {
910 vm_page_unwire(fs.m, 1);
912 vm_page_activate(fs.m);
914 vm_page_unlock_queues();
915 vm_page_wakeup(fs.m);
918 * Unlock everything, and return
920 unlock_and_deallocate(&fs);
922 curthread->td_ru.ru_majflt++;
924 curthread->td_ru.ru_minflt++;
926 return (KERN_SUCCESS);
930 * vm_fault_prefault provides a quick way of clustering
931 * pagefaults into a processes address space. It is a "cousin"
932 * of vm_map_pmap_enter, except it runs at page fault time instead
936 vm_fault_prefault(pmap_t pmap, vm_offset_t addra, vm_map_entry_t entry)
939 vm_offset_t addr, starta;
944 if (pmap != vmspace_pmap(curthread->td_proc->p_vmspace))
947 object = entry->object.vm_object;
949 starta = addra - PFBAK * PAGE_SIZE;
950 if (starta < entry->start) {
951 starta = entry->start;
952 } else if (starta > addra) {
956 for (i = 0; i < PAGEORDER_SIZE; i++) {
957 vm_object_t backing_object, lobject;
959 addr = addra + prefault_pageorder[i];
960 if (addr > addra + (PFFOR * PAGE_SIZE))
963 if (addr < starta || addr >= entry->end)
966 if (!pmap_is_prefaultable(pmap, addr))
969 pindex = ((addr - entry->start) + entry->offset) >> PAGE_SHIFT;
971 VM_OBJECT_LOCK(lobject);
972 while ((m = vm_page_lookup(lobject, pindex)) == NULL &&
973 lobject->type == OBJT_DEFAULT &&
974 (backing_object = lobject->backing_object) != NULL) {
975 if (lobject->backing_object_offset & PAGE_MASK)
977 pindex += lobject->backing_object_offset >> PAGE_SHIFT;
978 VM_OBJECT_LOCK(backing_object);
979 VM_OBJECT_UNLOCK(lobject);
980 lobject = backing_object;
983 * give-up when a page is not in memory
986 VM_OBJECT_UNLOCK(lobject);
989 if (((m->valid & VM_PAGE_BITS_ALL) == VM_PAGE_BITS_ALL) &&
991 (m->flags & PG_FICTITIOUS) == 0) {
993 vm_page_lock_queues();
994 if (!VM_PAGE_INQUEUE1(m, PQ_CACHE))
995 pmap_enter_quick(pmap, addr, m,
997 vm_page_unlock_queues();
999 VM_OBJECT_UNLOCK(lobject);
1006 * Ensure that the requested virtual address, which may be in userland,
1007 * is valid. Fault-in the page if necessary. Return -1 on failure.
1010 vm_fault_quick(caddr_t v, int prot)
1014 if (prot & VM_PROT_WRITE)
1015 r = subyte(v, fubyte(v));
1024 * Wire down a range of virtual addresses in a map.
1027 vm_fault_wire(vm_map_t map, vm_offset_t start, vm_offset_t end,
1028 boolean_t user_wire, boolean_t fictitious)
1034 * We simulate a fault to get the page and enter it in the physical
1035 * map. For user wiring, we only ask for read access on currently
1036 * read-only sections.
1038 for (va = start; va < end; va += PAGE_SIZE) {
1039 rv = vm_fault(map, va,
1040 user_wire ? VM_PROT_READ : VM_PROT_READ | VM_PROT_WRITE,
1041 user_wire ? VM_FAULT_USER_WIRE : VM_FAULT_CHANGE_WIRING);
1044 vm_fault_unwire(map, start, va, fictitious);
1048 return (KERN_SUCCESS);
1054 * Unwire a range of virtual addresses in a map.
1057 vm_fault_unwire(vm_map_t map, vm_offset_t start, vm_offset_t end,
1058 boolean_t fictitious)
1064 pmap = vm_map_pmap(map);
1067 * Since the pages are wired down, we must be able to get their
1068 * mappings from the physical map system.
1070 for (va = start; va < end; va += PAGE_SIZE) {
1071 pa = pmap_extract(pmap, va);
1073 pmap_change_wiring(pmap, va, FALSE);
1075 vm_page_lock_queues();
1076 vm_page_unwire(PHYS_TO_VM_PAGE(pa), 1);
1077 vm_page_unlock_queues();
1085 * vm_fault_copy_entry
1087 * Copy all of the pages from a wired-down map entry to another.
1089 * In/out conditions:
1090 * The source and destination maps must be locked for write.
1091 * The source map entry must be wired down (or be a sharing map
1092 * entry corresponding to a main map entry that is wired down).
1095 vm_fault_copy_entry(dst_map, src_map, dst_entry, src_entry)
1098 vm_map_entry_t dst_entry;
1099 vm_map_entry_t src_entry;
1101 vm_object_t backing_object, dst_object, object;
1102 vm_object_t src_object;
1103 vm_ooffset_t dst_offset;
1104 vm_ooffset_t src_offset;
1115 src_object = src_entry->object.vm_object;
1116 src_offset = src_entry->offset;
1119 * Create the top-level object for the destination entry. (Doesn't
1120 * actually shadow anything - we copy the pages directly.)
1122 dst_object = vm_object_allocate(OBJT_DEFAULT,
1123 OFF_TO_IDX(dst_entry->end - dst_entry->start));
1125 VM_OBJECT_LOCK(dst_object);
1126 dst_entry->object.vm_object = dst_object;
1127 dst_entry->offset = 0;
1129 prot = dst_entry->max_protection;
1132 * Loop through all of the pages in the entry's range, copying each
1133 * one from the source object (it should be there) to the destination
1136 for (vaddr = dst_entry->start, dst_offset = 0;
1137 vaddr < dst_entry->end;
1138 vaddr += PAGE_SIZE, dst_offset += PAGE_SIZE) {
1141 * Allocate a page in the destination object
1144 dst_m = vm_page_alloc(dst_object,
1145 OFF_TO_IDX(dst_offset), VM_ALLOC_NORMAL);
1146 if (dst_m == NULL) {
1147 VM_OBJECT_UNLOCK(dst_object);
1149 VM_OBJECT_LOCK(dst_object);
1151 } while (dst_m == NULL);
1154 * Find the page in the source object, and copy it in.
1155 * (Because the source is wired down, the page will be in
1158 VM_OBJECT_LOCK(src_object);
1159 object = src_object;
1161 while ((src_m = vm_page_lookup(object, pindex +
1162 OFF_TO_IDX(dst_offset + src_offset))) == NULL &&
1163 (src_entry->protection & VM_PROT_WRITE) == 0 &&
1164 (backing_object = object->backing_object) != NULL) {
1166 * Allow fallback to backing objects if we are reading.
1168 VM_OBJECT_LOCK(backing_object);
1169 pindex += OFF_TO_IDX(object->backing_object_offset);
1170 VM_OBJECT_UNLOCK(object);
1171 object = backing_object;
1174 panic("vm_fault_copy_wired: page missing");
1175 pmap_copy_page(src_m, dst_m);
1176 VM_OBJECT_UNLOCK(object);
1177 dst_m->valid = VM_PAGE_BITS_ALL;
1178 VM_OBJECT_UNLOCK(dst_object);
1181 * Enter it in the pmap...
1183 pmap_enter(dst_map->pmap, vaddr, dst_m, prot, FALSE);
1186 * Mark it no longer busy, and put it on the active list.
1188 VM_OBJECT_LOCK(dst_object);
1189 vm_page_lock_queues();
1190 vm_page_activate(dst_m);
1191 vm_page_unlock_queues();
1192 vm_page_wakeup(dst_m);
1194 VM_OBJECT_UNLOCK(dst_object);
1199 * This routine checks around the requested page for other pages that
1200 * might be able to be faulted in. This routine brackets the viable
1201 * pages for the pages to be paged in.
1204 * m, rbehind, rahead
1207 * marray (array of vm_page_t), reqpage (index of requested page)
1210 * number of pages in marray
1212 * This routine can't block.
1215 vm_fault_additional_pages(m, rbehind, rahead, marray, reqpage)
1224 vm_pindex_t pindex, startpindex, endpindex, tpindex;
1226 int cbehind, cahead;
1228 VM_OBJECT_LOCK_ASSERT(m->object, MA_OWNED);
1234 * we don't fault-ahead for device pager
1236 if (object->type == OBJT_DEVICE) {
1242 cbehind = cahead = 0;
1245 * if the requested page is not available, then give up now
1247 if (!vm_pager_has_page(object, pindex, &cbehind, &cahead)) {
1251 if ((cbehind == 0) && (cahead == 0)) {
1257 if (rahead > cahead) {
1261 if (rbehind > cbehind) {
1266 * try to do any readahead that we might have free pages for.
1268 if ((rahead + rbehind) >
1269 ((cnt.v_free_count + cnt.v_cache_count) - cnt.v_free_reserved)) {
1270 pagedaemon_wakeup();
1277 * scan backward for the read behind pages -- in memory
1280 if (rbehind > pindex) {
1284 startpindex = pindex - rbehind;
1287 if ((rtm = TAILQ_PREV(m, pglist, listq)) != NULL &&
1288 rtm->pindex >= startpindex)
1289 startpindex = rtm->pindex + 1;
1291 for (i = 0, tpindex = startpindex; tpindex < pindex; i++, tpindex++) {
1293 rtm = vm_page_alloc(object, tpindex, VM_ALLOC_NORMAL);
1295 vm_page_lock_queues();
1296 for (j = 0; j < i; j++) {
1297 vm_page_free(marray[j]);
1299 vm_page_unlock_queues();
1313 /* page offset of the required page */
1316 tpindex = pindex + 1;
1320 * scan forward for the read ahead pages
1322 endpindex = tpindex + rahead;
1323 if ((rtm = TAILQ_NEXT(m, listq)) != NULL && rtm->pindex < endpindex)
1324 endpindex = rtm->pindex;
1325 if (endpindex > object->size)
1326 endpindex = object->size;
1328 for (; tpindex < endpindex; i++, tpindex++) {
1330 rtm = vm_page_alloc(object, tpindex, VM_ALLOC_NORMAL);
1338 /* return number of bytes of pages */