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 "opt_ktrace.h"
80 #include <sys/param.h>
81 #include <sys/systm.h>
82 #include <sys/kernel.h>
85 #include <sys/resourcevar.h>
86 #include <sys/rwlock.h>
87 #include <sys/sysctl.h>
88 #include <sys/vmmeter.h>
89 #include <sys/vnode.h>
91 #include <sys/ktrace.h>
95 #include <vm/vm_param.h>
97 #include <vm/vm_map.h>
98 #include <vm/vm_object.h>
99 #include <vm/vm_page.h>
100 #include <vm/vm_pageout.h>
101 #include <vm/vm_kern.h>
102 #include <vm/vm_pager.h>
103 #include <vm/vm_extern.h>
104 #include <vm/vm_reserv.h>
109 static int vm_fault_additional_pages(vm_page_t, int, int, vm_page_t *, int *);
111 #define VM_FAULT_READ_BEHIND 8
112 #define VM_FAULT_READ_MAX (1 + VM_FAULT_READ_AHEAD_MAX)
113 #define VM_FAULT_NINCR (VM_FAULT_READ_MAX / VM_FAULT_READ_BEHIND)
114 #define VM_FAULT_SUM (VM_FAULT_NINCR * (VM_FAULT_NINCR + 1) / 2)
115 #define VM_FAULT_CACHE_BEHIND (VM_FAULT_READ_BEHIND * VM_FAULT_SUM)
122 vm_object_t first_object;
123 vm_pindex_t first_pindex;
125 vm_map_entry_t entry;
126 int lookup_still_valid;
131 static void vm_fault_cache_behind(const struct faultstate *fs, int distance);
132 static void vm_fault_prefault(const struct faultstate *fs, vm_offset_t addra,
133 int faultcount, int reqpage);
136 release_page(struct faultstate *fs)
139 vm_page_xunbusy(fs->m);
141 vm_page_deactivate(fs->m);
142 vm_page_unlock(fs->m);
147 unlock_map(struct faultstate *fs)
150 if (fs->lookup_still_valid) {
151 vm_map_lookup_done(fs->map, fs->entry);
152 fs->lookup_still_valid = FALSE;
157 unlock_vp(struct faultstate *fs)
160 if (fs->vp != NULL) {
167 unlock_and_deallocate(struct faultstate *fs)
170 vm_object_pip_wakeup(fs->object);
171 VM_OBJECT_WUNLOCK(fs->object);
172 if (fs->object != fs->first_object) {
173 VM_OBJECT_WLOCK(fs->first_object);
174 vm_page_lock(fs->first_m);
175 vm_page_free(fs->first_m);
176 vm_page_unlock(fs->first_m);
177 vm_object_pip_wakeup(fs->first_object);
178 VM_OBJECT_WUNLOCK(fs->first_object);
181 vm_object_deallocate(fs->first_object);
187 vm_fault_dirty(vm_map_entry_t entry, vm_page_t m, vm_prot_t prot,
188 vm_prot_t fault_type, int fault_flags, bool set_wd)
192 if (((prot & VM_PROT_WRITE) == 0 &&
193 (fault_flags & VM_FAULT_DIRTY) == 0) ||
194 (m->oflags & VPO_UNMANAGED) != 0)
197 VM_OBJECT_ASSERT_LOCKED(m->object);
199 need_dirty = ((fault_type & VM_PROT_WRITE) != 0 &&
200 (fault_flags & VM_FAULT_WIRE) == 0) ||
201 (fault_flags & VM_FAULT_DIRTY) != 0;
204 vm_object_set_writeable_dirty(m->object);
207 * If two callers of vm_fault_dirty() with set_wd ==
208 * FALSE, one for the map entry with MAP_ENTRY_NOSYNC
209 * flag set, other with flag clear, race, it is
210 * possible for the no-NOSYNC thread to see m->dirty
211 * != 0 and not clear VPO_NOSYNC. Take vm_page lock
212 * around manipulation of VPO_NOSYNC and
213 * vm_page_dirty() call, to avoid the race and keep
214 * m->oflags consistent.
219 * If this is a NOSYNC mmap we do not want to set VPO_NOSYNC
220 * if the page is already dirty to prevent data written with
221 * the expectation of being synced from not being synced.
222 * Likewise if this entry does not request NOSYNC then make
223 * sure the page isn't marked NOSYNC. Applications sharing
224 * data should use the same flags to avoid ping ponging.
226 if ((entry->eflags & MAP_ENTRY_NOSYNC) != 0) {
228 m->oflags |= VPO_NOSYNC;
231 m->oflags &= ~VPO_NOSYNC;
235 * If the fault is a write, we know that this page is being
236 * written NOW so dirty it explicitly to save on
237 * pmap_is_modified() calls later.
239 * Also tell the backing pager, if any, that it should remove
240 * any swap backing since the page is now dirty.
247 vm_pager_page_unswapped(m);
251 vm_fault_fill_hold(vm_page_t *m_hold, vm_page_t m)
254 if (m_hold != NULL) {
263 * Unlocks fs.first_object and fs.map on success.
266 vm_fault_soft_fast(struct faultstate *fs, vm_offset_t vaddr, vm_prot_t prot,
267 int fault_type, int fault_flags, boolean_t wired, vm_page_t *m_hold)
272 MPASS(fs->vp == NULL);
273 m = vm_page_lookup(fs->first_object, fs->first_pindex);
274 /* A busy page can be mapped for read|execute access. */
275 if (m == NULL || ((prot & VM_PROT_WRITE) != 0 &&
276 vm_page_busied(m)) || m->valid != VM_PAGE_BITS_ALL)
277 return (KERN_FAILURE);
278 rv = pmap_enter(fs->map->pmap, vaddr, m, prot, fault_type |
279 PMAP_ENTER_NOSLEEP | (wired ? PMAP_ENTER_WIRED : 0), 0);
280 if (rv != KERN_SUCCESS)
282 vm_fault_fill_hold(m_hold, m);
283 vm_fault_dirty(fs->entry, m, prot, fault_type, fault_flags, false);
284 VM_OBJECT_RUNLOCK(fs->first_object);
286 vm_fault_prefault(fs, vaddr, 0, 0);
287 vm_map_lookup_done(fs->map, fs->entry);
288 curthread->td_ru.ru_minflt++;
289 return (KERN_SUCCESS);
295 * Handle a page fault occurring at the given address,
296 * requiring the given permissions, in the map specified.
297 * If successful, the page is inserted into the
298 * associated physical map.
300 * NOTE: the given address should be truncated to the
301 * proper page address.
303 * KERN_SUCCESS is returned if the page fault is handled; otherwise,
304 * a standard error specifying why the fault is fatal is returned.
306 * The map in question must be referenced, and remains so.
307 * Caller may hold no locks.
310 vm_fault(vm_map_t map, vm_offset_t vaddr, vm_prot_t fault_type,
317 if ((td->td_pflags & TDP_NOFAULTING) != 0)
318 return (KERN_PROTECTION_FAILURE);
320 if (map != kernel_map && KTRPOINT(td, KTR_FAULT))
321 ktrfault(vaddr, fault_type);
323 result = vm_fault_hold(map, trunc_page(vaddr), fault_type, fault_flags,
326 if (map != kernel_map && KTRPOINT(td, KTR_FAULTEND))
333 vm_fault_hold(vm_map_t map, vm_offset_t vaddr, vm_prot_t fault_type,
334 int fault_flags, vm_page_t *m_hold)
338 int alloc_req, era, faultcount, nera, reqpage, result;
339 boolean_t dead, is_first_object_locked, wired;
340 vm_object_t next_object;
341 vm_page_t marray[VM_FAULT_READ_MAX];
343 struct faultstate fs;
348 PCPU_INC(cnt.v_vm_faults);
350 faultcount = reqpage = 0;
355 * Find the backing store object and offset into it to begin the
359 result = vm_map_lookup(&fs.map, vaddr, fault_type |
360 VM_PROT_FAULT_LOOKUP, &fs.entry, &fs.first_object,
361 &fs.first_pindex, &prot, &wired);
362 if (result != KERN_SUCCESS) {
367 fs.map_generation = fs.map->timestamp;
369 if (fs.entry->eflags & MAP_ENTRY_NOFAULT) {
370 panic("vm_fault: fault on nofault entry, addr: %lx",
374 if (fs.entry->eflags & MAP_ENTRY_IN_TRANSITION &&
375 fs.entry->wiring_thread != curthread) {
376 vm_map_unlock_read(fs.map);
378 if (vm_map_lookup_entry(fs.map, vaddr, &fs.entry) &&
379 (fs.entry->eflags & MAP_ENTRY_IN_TRANSITION)) {
381 fs.entry->eflags |= MAP_ENTRY_NEEDS_WAKEUP;
382 vm_map_unlock_and_wait(fs.map, 0);
384 vm_map_unlock(fs.map);
388 MPASS((fs.entry->eflags & MAP_ENTRY_GUARD) == 0);
391 fault_type = prot | (fault_type & VM_PROT_COPY);
393 KASSERT((fault_flags & VM_FAULT_WIRE) == 0,
394 ("!wired && VM_FAULT_WIRE"));
397 * Try to avoid lock contention on the top-level object through
398 * special-case handling of some types of page faults, specifically,
399 * those that are both (1) mapping an existing page from the top-
400 * level object and (2) not having to mark that object as containing
401 * dirty pages. Under these conditions, a read lock on the top-level
402 * object suffices, allowing multiple page faults of a similar type to
403 * run in parallel on the same top-level object.
405 if (fs.vp == NULL /* avoid locked vnode leak */ &&
406 (fault_flags & (VM_FAULT_WIRE | VM_FAULT_DIRTY)) == 0 &&
407 /* avoid calling vm_object_set_writeable_dirty() */
408 ((prot & VM_PROT_WRITE) == 0 ||
409 (fs.first_object->type != OBJT_VNODE &&
410 (fs.first_object->flags & OBJ_TMPFS_NODE) == 0) ||
411 (fs.first_object->flags & OBJ_MIGHTBEDIRTY) != 0)) {
412 VM_OBJECT_RLOCK(fs.first_object);
413 if ((prot & VM_PROT_WRITE) == 0 ||
414 (fs.first_object->type != OBJT_VNODE &&
415 (fs.first_object->flags & OBJ_TMPFS_NODE) == 0) ||
416 (fs.first_object->flags & OBJ_MIGHTBEDIRTY) != 0) {
417 result = vm_fault_soft_fast(&fs, vaddr, prot,
418 fault_type, fault_flags, wired, m_hold);
419 if (result == KERN_SUCCESS)
422 if (!VM_OBJECT_TRYUPGRADE(fs.first_object)) {
423 VM_OBJECT_RUNLOCK(fs.first_object);
424 VM_OBJECT_WLOCK(fs.first_object);
427 VM_OBJECT_WLOCK(fs.first_object);
431 * Make a reference to this object to prevent its disposal while we
432 * are messing with it. Once we have the reference, the map is free
433 * to be diddled. Since objects reference their shadows (and copies),
434 * they will stay around as well.
436 * Bump the paging-in-progress count to prevent size changes (e.g.
437 * truncation operations) during I/O. This must be done after
438 * obtaining the vnode lock in order to avoid possible deadlocks.
440 vm_object_reference_locked(fs.first_object);
441 vm_object_pip_add(fs.first_object, 1);
443 fs.lookup_still_valid = TRUE;
448 * Search for the page at object/offset.
450 fs.object = fs.first_object;
451 fs.pindex = fs.first_pindex;
454 * If the object is marked for imminent termination,
455 * we retry here, since the collapse pass has raced
456 * with us. Otherwise, if we see terminally dead
457 * object, return fail.
459 if ((fs.object->flags & OBJ_DEAD) != 0) {
460 dead = fs.object->type == OBJT_DEAD;
461 unlock_and_deallocate(&fs);
463 return (KERN_PROTECTION_FAILURE);
469 * See if page is resident
471 fs.m = vm_page_lookup(fs.object, fs.pindex);
474 * Wait/Retry if the page is busy. We have to do this
475 * if the page is either exclusive or shared busy
476 * because the vm_pager may be using read busy for
477 * pageouts (and even pageins if it is the vnode
478 * pager), and we could end up trying to pagein and
479 * pageout the same page simultaneously.
481 * We can theoretically allow the busy case on a read
482 * fault if the page is marked valid, but since such
483 * pages are typically already pmap'd, putting that
484 * special case in might be more effort then it is
485 * worth. We cannot under any circumstances mess
486 * around with a shared busied page except, perhaps,
489 if (vm_page_busied(fs.m)) {
491 * Reference the page before unlocking and
492 * sleeping so that the page daemon is less
493 * likely to reclaim it.
495 vm_page_aflag_set(fs.m, PGA_REFERENCED);
496 if (fs.object != fs.first_object) {
497 if (!VM_OBJECT_TRYWLOCK(
499 VM_OBJECT_WUNLOCK(fs.object);
500 VM_OBJECT_WLOCK(fs.first_object);
501 VM_OBJECT_WLOCK(fs.object);
503 vm_page_lock(fs.first_m);
504 vm_page_free(fs.first_m);
505 vm_page_unlock(fs.first_m);
506 vm_object_pip_wakeup(fs.first_object);
507 VM_OBJECT_WUNLOCK(fs.first_object);
511 if (fs.m == vm_page_lookup(fs.object,
513 vm_page_sleep_if_busy(fs.m, "vmpfw");
515 vm_object_pip_wakeup(fs.object);
516 VM_OBJECT_WUNLOCK(fs.object);
517 PCPU_INC(cnt.v_intrans);
518 vm_object_deallocate(fs.first_object);
522 vm_page_remque(fs.m);
523 vm_page_unlock(fs.m);
526 * Mark page busy for other processes, and the
527 * pagedaemon. If it still isn't completely valid
528 * (readable), jump to readrest, else break-out ( we
532 if (fs.m->valid != VM_PAGE_BITS_ALL)
538 * Page is not resident. If this is the search termination
539 * or the pager might contain the page, allocate a new page.
540 * Default objects are zero-fill, there is no real pager.
542 if (fs.object->type != OBJT_DEFAULT ||
543 fs.object == fs.first_object) {
544 if (fs.pindex >= fs.object->size) {
545 unlock_and_deallocate(&fs);
546 return (KERN_PROTECTION_FAILURE);
550 * Allocate a new page for this object/offset pair.
552 * Unlocked read of the p_flag is harmless. At
553 * worst, the P_KILLED might be not observed
554 * there, and allocation can fail, causing
555 * restart and new reading of the p_flag.
558 if (!vm_page_count_severe() || P_KILLED(curproc)) {
559 #if VM_NRESERVLEVEL > 0
560 if ((fs.object->flags & OBJ_COLORED) == 0) {
561 fs.object->flags |= OBJ_COLORED;
562 fs.object->pg_color = atop(vaddr) -
566 alloc_req = P_KILLED(curproc) ?
567 VM_ALLOC_SYSTEM : VM_ALLOC_NORMAL;
568 if (fs.object->type != OBJT_VNODE &&
569 fs.object->backing_object == NULL)
570 alloc_req |= VM_ALLOC_ZERO;
571 fs.m = vm_page_alloc(fs.object, fs.pindex,
575 unlock_and_deallocate(&fs);
578 } else if (fs.m->valid == VM_PAGE_BITS_ALL)
584 * We have found a valid page or we have allocated a new page.
585 * The page thus may not be valid or may not be entirely
588 * Attempt to fault-in the page if there is a chance that the
589 * pager has it, and potentially fault in additional pages
590 * at the same time. For default objects simply provide
593 if (fs.object->type != OBJT_DEFAULT) {
595 u_char behavior = vm_map_entry_behavior(fs.entry);
597 if (behavior == MAP_ENTRY_BEHAV_RANDOM ||
601 } else if (behavior == MAP_ENTRY_BEHAV_SEQUENTIAL) {
603 ahead = atop(fs.entry->end - vaddr) - 1;
604 if (ahead > VM_FAULT_READ_AHEAD_MAX)
605 ahead = VM_FAULT_READ_AHEAD_MAX;
606 if (fs.pindex == fs.entry->next_read)
607 vm_fault_cache_behind(&fs,
611 * If this is a sequential page fault, then
612 * arithmetically increase the number of pages
613 * in the read-ahead window. Otherwise, reset
614 * the read-ahead window to its smallest size.
616 behind = atop(vaddr - fs.entry->start);
617 if (behind > VM_FAULT_READ_BEHIND)
618 behind = VM_FAULT_READ_BEHIND;
619 ahead = atop(fs.entry->end - vaddr) - 1;
620 era = fs.entry->read_ahead;
621 if (fs.pindex == fs.entry->next_read) {
623 if (nera > VM_FAULT_READ_AHEAD_MAX)
624 nera = VM_FAULT_READ_AHEAD_MAX;
628 if (era == VM_FAULT_READ_AHEAD_MAX)
629 vm_fault_cache_behind(&fs,
630 VM_FAULT_CACHE_BEHIND);
631 } else if (ahead > VM_FAULT_READ_AHEAD_MIN)
632 ahead = VM_FAULT_READ_AHEAD_MIN;
634 fs.entry->read_ahead = ahead;
638 * Call the pager to retrieve the data, if any, after
639 * releasing the lock on the map. We hold a ref on
640 * fs.object and the pages are exclusive busied.
644 if (fs.object->type == OBJT_VNODE &&
645 (vp = fs.object->handle) != fs.vp) {
647 locked = VOP_ISLOCKED(vp);
649 if (locked != LK_EXCLUSIVE)
651 /* Do not sleep for vnode lock while fs.m is busy */
652 error = vget(vp, locked | LK_CANRECURSE |
653 LK_NOWAIT, curthread);
657 unlock_and_deallocate(&fs);
658 error = vget(vp, locked | LK_RETRY |
659 LK_CANRECURSE, curthread);
663 ("vm_fault: vget failed"));
668 KASSERT(fs.vp == NULL || !fs.map->system_map,
669 ("vm_fault: vnode-backed object mapped by system map"));
672 * now we find out if any other pages should be paged
673 * in at this time this routine checks to see if the
674 * pages surrounding this fault reside in the same
675 * object as the page for this fault. If they do,
676 * then they are faulted in also into the object. The
677 * array "marray" returned contains an array of
678 * vm_page_t structs where one of them is the
679 * vm_page_t passed to the routine. The reqpage
680 * return value is the index into the marray for the
681 * vm_page_t passed to the routine.
683 * fs.m plus the additional pages are exclusive busied.
685 faultcount = vm_fault_additional_pages(
686 fs.m, behind, ahead, marray, &reqpage);
689 vm_pager_get_pages(fs.object, marray, faultcount,
690 reqpage) : VM_PAGER_FAIL;
692 if (rv == VM_PAGER_OK) {
694 * Found the page. Leave it busy while we play
699 * Relookup in case pager changed page. Pager
700 * is responsible for disposition of old page
703 fs.m = vm_page_lookup(fs.object, fs.pindex);
705 unlock_and_deallocate(&fs);
710 break; /* break to PAGE HAS BEEN FOUND */
713 * Remove the bogus page (which does not exist at this
714 * object/offset); before doing so, we must get back
715 * our object lock to preserve our invariant.
717 * Also wake up any other process that may want to bring
720 * If this is the top-level object, we must leave the
721 * busy page to prevent another process from rushing
722 * past us, and inserting the page in that object at
723 * the same time that we are.
725 if (rv == VM_PAGER_ERROR)
726 printf("vm_fault: pager read error, pid %d (%s)\n",
727 curproc->p_pid, curproc->p_comm);
729 * Data outside the range of the pager or an I/O error
732 * XXX - the check for kernel_map is a kludge to work
733 * around having the machine panic on a kernel space
734 * fault w/ I/O error.
736 if (((fs.map != kernel_map) && (rv == VM_PAGER_ERROR)) ||
737 (rv == VM_PAGER_BAD)) {
740 vm_page_unlock(fs.m);
742 unlock_and_deallocate(&fs);
743 return ((rv == VM_PAGER_ERROR) ? KERN_FAILURE : KERN_PROTECTION_FAILURE);
745 if (fs.object != fs.first_object) {
748 vm_page_unlock(fs.m);
751 * XXX - we cannot just fall out at this
752 * point, m has been freed and is invalid!
758 * We get here if the object has default pager (or unwiring)
759 * or the pager doesn't have the page.
761 if (fs.object == fs.first_object)
765 * Move on to the next object. Lock the next object before
766 * unlocking the current one.
768 fs.pindex += OFF_TO_IDX(fs.object->backing_object_offset);
769 next_object = fs.object->backing_object;
770 if (next_object == NULL) {
772 * If there's no object left, fill the page in the top
775 if (fs.object != fs.first_object) {
776 vm_object_pip_wakeup(fs.object);
777 VM_OBJECT_WUNLOCK(fs.object);
779 fs.object = fs.first_object;
780 fs.pindex = fs.first_pindex;
782 VM_OBJECT_WLOCK(fs.object);
787 * Zero the page if necessary and mark it valid.
789 if ((fs.m->flags & PG_ZERO) == 0) {
790 pmap_zero_page(fs.m);
792 PCPU_INC(cnt.v_ozfod);
794 PCPU_INC(cnt.v_zfod);
795 fs.m->valid = VM_PAGE_BITS_ALL;
796 /* Don't try to prefault neighboring pages. */
798 break; /* break to PAGE HAS BEEN FOUND */
800 KASSERT(fs.object != next_object,
801 ("object loop %p", next_object));
802 VM_OBJECT_WLOCK(next_object);
803 vm_object_pip_add(next_object, 1);
804 if (fs.object != fs.first_object)
805 vm_object_pip_wakeup(fs.object);
806 VM_OBJECT_WUNLOCK(fs.object);
807 fs.object = next_object;
811 vm_page_assert_xbusied(fs.m);
814 * PAGE HAS BEEN FOUND. [Loop invariant still holds -- the object lock
819 * If the page is being written, but isn't already owned by the
820 * top-level object, we have to copy it into a new page owned by the
823 if (fs.object != fs.first_object) {
825 * We only really need to copy if we want to write it.
827 if ((fault_type & (VM_PROT_COPY | VM_PROT_WRITE)) != 0) {
829 * This allows pages to be virtually copied from a
830 * backing_object into the first_object, where the
831 * backing object has no other refs to it, and cannot
832 * gain any more refs. Instead of a bcopy, we just
833 * move the page from the backing object to the
834 * first object. Note that we must mark the page
835 * dirty in the first object so that it will go out
836 * to swap when needed.
838 is_first_object_locked = FALSE;
841 * Only one shadow object
843 (fs.object->shadow_count == 1) &&
845 * No COW refs, except us
847 (fs.object->ref_count == 1) &&
849 * No one else can look this object up
851 (fs.object->handle == NULL) &&
853 * No other ways to look the object up
855 ((fs.object->type == OBJT_DEFAULT) ||
856 (fs.object->type == OBJT_SWAP)) &&
857 (is_first_object_locked = VM_OBJECT_TRYWLOCK(fs.first_object)) &&
859 * We don't chase down the shadow chain
861 fs.object == fs.first_object->backing_object) {
863 * get rid of the unnecessary page
865 vm_page_lock(fs.first_m);
866 vm_page_free(fs.first_m);
867 vm_page_unlock(fs.first_m);
869 * grab the page and put it into the
870 * process'es object. The page is
871 * automatically made dirty.
873 if (vm_page_rename(fs.m, fs.first_object,
875 unlock_and_deallocate(&fs);
878 #if VM_NRESERVLEVEL > 0
880 * Rename the reservation.
882 vm_reserv_rename(fs.m, fs.first_object,
883 fs.object, OFF_TO_IDX(
884 fs.first_object->backing_object_offset));
889 PCPU_INC(cnt.v_cow_optim);
892 * Oh, well, lets copy it.
894 pmap_copy_page(fs.m, fs.first_m);
895 fs.first_m->valid = VM_PAGE_BITS_ALL;
896 if (wired && (fault_flags &
897 VM_FAULT_WIRE) == 0) {
898 vm_page_lock(fs.first_m);
899 vm_page_wire(fs.first_m);
900 vm_page_unlock(fs.first_m);
903 vm_page_unwire(fs.m, FALSE);
904 vm_page_unlock(fs.m);
907 * We no longer need the old page or object.
912 * fs.object != fs.first_object due to above
915 vm_object_pip_wakeup(fs.object);
916 VM_OBJECT_WUNLOCK(fs.object);
918 * Only use the new page below...
920 fs.object = fs.first_object;
921 fs.pindex = fs.first_pindex;
923 if (!is_first_object_locked)
924 VM_OBJECT_WLOCK(fs.object);
925 PCPU_INC(cnt.v_cow_faults);
928 prot &= ~VM_PROT_WRITE;
933 * We must verify that the maps have not changed since our last
936 if (!fs.lookup_still_valid) {
937 vm_object_t retry_object;
938 vm_pindex_t retry_pindex;
939 vm_prot_t retry_prot;
941 if (!vm_map_trylock_read(fs.map)) {
943 unlock_and_deallocate(&fs);
946 fs.lookup_still_valid = TRUE;
947 if (fs.map->timestamp != fs.map_generation) {
948 result = vm_map_lookup_locked(&fs.map, vaddr, fault_type,
949 &fs.entry, &retry_object, &retry_pindex, &retry_prot, &wired);
952 * If we don't need the page any longer, put it on the inactive
953 * list (the easiest thing to do here). If no one needs it,
954 * pageout will grab it eventually.
956 if (result != KERN_SUCCESS) {
958 unlock_and_deallocate(&fs);
961 * If retry of map lookup would have blocked then
962 * retry fault from start.
964 if (result == KERN_FAILURE)
968 if ((retry_object != fs.first_object) ||
969 (retry_pindex != fs.first_pindex)) {
971 unlock_and_deallocate(&fs);
976 * Check whether the protection has changed or the object has
977 * been copied while we left the map unlocked. Changing from
978 * read to write permission is OK - we leave the page
979 * write-protected, and catch the write fault. Changing from
980 * write to read permission means that we can't mark the page
981 * write-enabled after all.
987 * If the page was filled by a pager, update the map entry's
988 * last read offset. Since the pager does not return the
989 * actual set of pages that it read, this update is based on
990 * the requested set. Typically, the requested and actual
993 * XXX The following assignment modifies the map
994 * without holding a write lock on it.
997 fs.entry->next_read = fs.pindex + faultcount - reqpage;
999 vm_fault_dirty(fs.entry, fs.m, prot, fault_type, fault_flags, true);
1000 vm_page_assert_xbusied(fs.m);
1003 * Page must be completely valid or it is not fit to
1004 * map into user space. vm_pager_get_pages() ensures this.
1006 KASSERT(fs.m->valid == VM_PAGE_BITS_ALL,
1007 ("vm_fault: page %p partially invalid", fs.m));
1008 VM_OBJECT_WUNLOCK(fs.object);
1011 * Put this page into the physical map. We had to do the unlock above
1012 * because pmap_enter() may sleep. We don't put the page
1013 * back on the active queue until later so that the pageout daemon
1014 * won't find it (yet).
1016 pmap_enter(fs.map->pmap, vaddr, fs.m, prot,
1017 fault_type | (wired ? PMAP_ENTER_WIRED : 0), 0);
1018 if (faultcount != 1 && (fault_flags & VM_FAULT_WIRE) == 0 &&
1020 vm_fault_prefault(&fs, vaddr, faultcount, reqpage);
1021 VM_OBJECT_WLOCK(fs.object);
1025 * If the page is not wired down, then put it where the pageout daemon
1028 if ((fault_flags & VM_FAULT_WIRE) != 0) {
1029 KASSERT(wired, ("VM_FAULT_WIRE && !wired"));
1032 vm_page_activate(fs.m);
1033 if (m_hold != NULL) {
1037 vm_page_unlock(fs.m);
1038 vm_page_xunbusy(fs.m);
1041 * Unlock everything, and return
1043 unlock_and_deallocate(&fs);
1045 PCPU_INC(cnt.v_io_faults);
1046 curthread->td_ru.ru_majflt++;
1048 curthread->td_ru.ru_minflt++;
1050 return (KERN_SUCCESS);
1054 * Speed up the reclamation of up to "distance" pages that precede the
1055 * faulting pindex within the first object of the shadow chain.
1058 vm_fault_cache_behind(const struct faultstate *fs, int distance)
1060 vm_object_t first_object, object;
1061 vm_page_t m, m_prev;
1064 object = fs->object;
1065 VM_OBJECT_ASSERT_WLOCKED(object);
1066 first_object = fs->first_object;
1067 if (first_object != object) {
1068 if (!VM_OBJECT_TRYWLOCK(first_object)) {
1069 VM_OBJECT_WUNLOCK(object);
1070 VM_OBJECT_WLOCK(first_object);
1071 VM_OBJECT_WLOCK(object);
1074 /* Neither fictitious nor unmanaged pages can be cached. */
1075 if ((first_object->flags & (OBJ_FICTITIOUS | OBJ_UNMANAGED)) == 0) {
1076 if (fs->first_pindex < distance)
1079 pindex = fs->first_pindex - distance;
1080 if (pindex < OFF_TO_IDX(fs->entry->offset))
1081 pindex = OFF_TO_IDX(fs->entry->offset);
1082 m = first_object != object ? fs->first_m : fs->m;
1083 vm_page_assert_xbusied(m);
1084 m_prev = vm_page_prev(m);
1085 while ((m = m_prev) != NULL && m->pindex >= pindex &&
1086 m->valid == VM_PAGE_BITS_ALL) {
1087 m_prev = vm_page_prev(m);
1088 if (vm_page_busied(m))
1091 if (m->hold_count == 0 && m->wire_count == 0) {
1093 vm_page_aflag_clear(m, PGA_REFERENCED);
1095 vm_page_deactivate(m);
1102 if (first_object != object)
1103 VM_OBJECT_WUNLOCK(first_object);
1107 * vm_fault_prefault provides a quick way of clustering
1108 * pagefaults into a processes address space. It is a "cousin"
1109 * of vm_map_pmap_enter, except it runs at page fault time instead
1113 vm_fault_prefault(const struct faultstate *fs, vm_offset_t addra,
1114 int faultcount, int reqpage)
1117 vm_map_entry_t entry;
1118 vm_object_t backing_object, lobject;
1119 vm_offset_t addr, starta;
1122 int backward, forward, i;
1124 pmap = fs->map->pmap;
1125 if (pmap != vmspace_pmap(curthread->td_proc->p_vmspace))
1128 if (faultcount > 0) {
1130 forward = faultcount - reqpage - 1;
1137 if (addra < backward * PAGE_SIZE) {
1138 starta = entry->start;
1140 starta = addra - backward * PAGE_SIZE;
1141 if (starta < entry->start)
1142 starta = entry->start;
1146 * Generate the sequence of virtual addresses that are candidates for
1147 * prefaulting in an outward spiral from the faulting virtual address,
1148 * "addra". Specifically, the sequence is "addra - PAGE_SIZE", "addra
1149 * + PAGE_SIZE", "addra - 2 * PAGE_SIZE", "addra + 2 * PAGE_SIZE", ...
1150 * If the candidate address doesn't have a backing physical page, then
1151 * the loop immediately terminates.
1153 for (i = 0; i < 2 * imax(backward, forward); i++) {
1154 addr = addra + ((i >> 1) + 1) * ((i & 1) == 0 ? -PAGE_SIZE :
1156 if (addr > addra + forward * PAGE_SIZE)
1159 if (addr < starta || addr >= entry->end)
1162 if (!pmap_is_prefaultable(pmap, addr))
1165 pindex = ((addr - entry->start) + entry->offset) >> PAGE_SHIFT;
1166 lobject = entry->object.vm_object;
1167 VM_OBJECT_RLOCK(lobject);
1168 while ((m = vm_page_lookup(lobject, pindex)) == NULL &&
1169 lobject->type == OBJT_DEFAULT &&
1170 (backing_object = lobject->backing_object) != NULL) {
1171 KASSERT((lobject->backing_object_offset & PAGE_MASK) ==
1172 0, ("vm_fault_prefault: unaligned object offset"));
1173 pindex += lobject->backing_object_offset >> PAGE_SHIFT;
1174 VM_OBJECT_RLOCK(backing_object);
1175 VM_OBJECT_RUNLOCK(lobject);
1176 lobject = backing_object;
1179 VM_OBJECT_RUNLOCK(lobject);
1182 if (m->valid == VM_PAGE_BITS_ALL &&
1183 (m->flags & PG_FICTITIOUS) == 0)
1184 pmap_enter_quick(pmap, addr, m, entry->protection);
1185 VM_OBJECT_RUNLOCK(lobject);
1190 * Hold each of the physical pages that are mapped by the specified range of
1191 * virtual addresses, ["addr", "addr" + "len"), if those mappings are valid
1192 * and allow the specified types of access, "prot". If all of the implied
1193 * pages are successfully held, then the number of held pages is returned
1194 * together with pointers to those pages in the array "ma". However, if any
1195 * of the pages cannot be held, -1 is returned.
1198 vm_fault_quick_hold_pages(vm_map_t map, vm_offset_t addr, vm_size_t len,
1199 vm_prot_t prot, vm_page_t *ma, int max_count)
1201 vm_offset_t end, va;
1204 boolean_t pmap_failed;
1208 end = round_page(addr + len);
1209 addr = trunc_page(addr);
1212 * Check for illegal addresses.
1214 if (addr < vm_map_min(map) || addr > end || end > vm_map_max(map))
1217 if (atop(end - addr) > max_count)
1218 panic("vm_fault_quick_hold_pages: count > max_count");
1219 count = atop(end - addr);
1222 * Most likely, the physical pages are resident in the pmap, so it is
1223 * faster to try pmap_extract_and_hold() first.
1225 pmap_failed = FALSE;
1226 for (mp = ma, va = addr; va < end; mp++, va += PAGE_SIZE) {
1227 *mp = pmap_extract_and_hold(map->pmap, va, prot);
1230 else if ((prot & VM_PROT_WRITE) != 0 &&
1231 (*mp)->dirty != VM_PAGE_BITS_ALL) {
1233 * Explicitly dirty the physical page. Otherwise, the
1234 * caller's changes may go unnoticed because they are
1235 * performed through an unmanaged mapping or by a DMA
1238 * The object lock is not held here.
1239 * See vm_page_clear_dirty_mask().
1246 * One or more pages could not be held by the pmap. Either no
1247 * page was mapped at the specified virtual address or that
1248 * mapping had insufficient permissions. Attempt to fault in
1249 * and hold these pages.
1251 for (mp = ma, va = addr; va < end; mp++, va += PAGE_SIZE)
1252 if (*mp == NULL && vm_fault_hold(map, va, prot,
1253 VM_FAULT_NORMAL, mp) != KERN_SUCCESS)
1258 for (mp = ma; mp < ma + count; mp++)
1261 vm_page_unhold(*mp);
1262 vm_page_unlock(*mp);
1269 * vm_fault_copy_entry
1271 * Create new shadow object backing dst_entry with private copy of
1272 * all underlying pages. When src_entry is equal to dst_entry,
1273 * function implements COW for wired-down map entry. Otherwise,
1274 * it forks wired entry into dst_map.
1276 * In/out conditions:
1277 * The source and destination maps must be locked for write.
1278 * The source map entry must be wired down (or be a sharing map
1279 * entry corresponding to a main map entry that is wired down).
1282 vm_fault_copy_entry(vm_map_t dst_map, vm_map_t src_map,
1283 vm_map_entry_t dst_entry, vm_map_entry_t src_entry,
1284 vm_ooffset_t *fork_charge)
1286 vm_object_t backing_object, dst_object, object, src_object;
1287 vm_pindex_t dst_pindex, pindex, src_pindex;
1288 vm_prot_t access, prot;
1298 upgrade = src_entry == dst_entry;
1299 access = prot = dst_entry->protection;
1301 src_object = src_entry->object.vm_object;
1302 src_pindex = OFF_TO_IDX(src_entry->offset);
1304 if (upgrade && (dst_entry->eflags & MAP_ENTRY_NEEDS_COPY) == 0) {
1305 dst_object = src_object;
1306 vm_object_reference(dst_object);
1309 * Create the top-level object for the destination entry. (Doesn't
1310 * actually shadow anything - we copy the pages directly.)
1312 dst_object = vm_object_allocate(OBJT_DEFAULT,
1313 OFF_TO_IDX(dst_entry->end - dst_entry->start));
1314 #if VM_NRESERVLEVEL > 0
1315 dst_object->flags |= OBJ_COLORED;
1316 dst_object->pg_color = atop(dst_entry->start);
1320 VM_OBJECT_WLOCK(dst_object);
1321 KASSERT(upgrade || dst_entry->object.vm_object == NULL,
1322 ("vm_fault_copy_entry: vm_object not NULL"));
1323 if (src_object != dst_object) {
1324 dst_entry->object.vm_object = dst_object;
1325 dst_entry->offset = 0;
1326 dst_object->charge = dst_entry->end - dst_entry->start;
1328 if (fork_charge != NULL) {
1329 KASSERT(dst_entry->cred == NULL,
1330 ("vm_fault_copy_entry: leaked swp charge"));
1331 dst_object->cred = curthread->td_ucred;
1332 crhold(dst_object->cred);
1333 *fork_charge += dst_object->charge;
1334 } else if (dst_object->cred == NULL) {
1335 KASSERT(dst_entry->cred != NULL, ("no cred for entry %p",
1337 dst_object->cred = dst_entry->cred;
1338 dst_entry->cred = NULL;
1342 * If not an upgrade, then enter the mappings in the pmap as
1343 * read and/or execute accesses. Otherwise, enter them as
1346 * A writeable large page mapping is only created if all of
1347 * the constituent small page mappings are modified. Marking
1348 * PTEs as modified on inception allows promotion to happen
1349 * without taking potentially large number of soft faults.
1352 access &= ~VM_PROT_WRITE;
1355 * Loop through all of the virtual pages within the entry's
1356 * range, copying each page from the source object to the
1357 * destination object. Since the source is wired, those pages
1358 * must exist. In contrast, the destination is pageable.
1359 * Since the destination object does share any backing storage
1360 * with the source object, all of its pages must be dirtied,
1361 * regardless of whether they can be written.
1363 for (vaddr = dst_entry->start, dst_pindex = 0;
1364 vaddr < dst_entry->end;
1365 vaddr += PAGE_SIZE, dst_pindex++) {
1368 * Find the page in the source object, and copy it in.
1369 * Because the source is wired down, the page will be
1372 if (src_object != dst_object)
1373 VM_OBJECT_RLOCK(src_object);
1374 object = src_object;
1375 pindex = src_pindex + dst_pindex;
1376 while ((src_m = vm_page_lookup(object, pindex)) == NULL &&
1377 (backing_object = object->backing_object) != NULL) {
1379 * Unless the source mapping is read-only or
1380 * it is presently being upgraded from
1381 * read-only, the first object in the shadow
1382 * chain should provide all of the pages. In
1383 * other words, this loop body should never be
1384 * executed when the source mapping is already
1387 KASSERT((src_entry->protection & VM_PROT_WRITE) == 0 ||
1389 ("vm_fault_copy_entry: main object missing page"));
1391 VM_OBJECT_RLOCK(backing_object);
1392 pindex += OFF_TO_IDX(object->backing_object_offset);
1393 if (object != dst_object)
1394 VM_OBJECT_RUNLOCK(object);
1395 object = backing_object;
1397 KASSERT(src_m != NULL, ("vm_fault_copy_entry: page missing"));
1399 if (object != dst_object) {
1401 * Allocate a page in the destination object.
1403 dst_m = vm_page_alloc(dst_object, (src_object ==
1404 dst_object ? src_pindex : 0) + dst_pindex,
1406 if (dst_m == NULL) {
1407 VM_OBJECT_WUNLOCK(dst_object);
1408 VM_OBJECT_RUNLOCK(object);
1410 VM_OBJECT_WLOCK(dst_object);
1413 pmap_copy_page(src_m, dst_m);
1414 VM_OBJECT_RUNLOCK(object);
1415 dst_m->valid = VM_PAGE_BITS_ALL;
1416 dst_m->dirty = VM_PAGE_BITS_ALL;
1419 if (vm_page_sleep_if_busy(dst_m, "fltupg"))
1421 vm_page_xbusy(dst_m);
1422 KASSERT(dst_m->valid == VM_PAGE_BITS_ALL,
1423 ("invalid dst page %p", dst_m));
1425 VM_OBJECT_WUNLOCK(dst_object);
1428 * Enter it in the pmap. If a wired, copy-on-write
1429 * mapping is being replaced by a write-enabled
1430 * mapping, then wire that new mapping.
1432 pmap_enter(dst_map->pmap, vaddr, dst_m, prot,
1433 access | (upgrade ? PMAP_ENTER_WIRED : 0), 0);
1436 * Mark it no longer busy, and put it on the active list.
1438 VM_OBJECT_WLOCK(dst_object);
1441 if (src_m != dst_m) {
1442 vm_page_lock(src_m);
1443 vm_page_unwire(src_m, 0);
1444 vm_page_unlock(src_m);
1445 vm_page_lock(dst_m);
1446 vm_page_wire(dst_m);
1447 vm_page_unlock(dst_m);
1449 KASSERT(dst_m->wire_count > 0,
1450 ("dst_m %p is not wired", dst_m));
1453 vm_page_lock(dst_m);
1454 vm_page_activate(dst_m);
1455 vm_page_unlock(dst_m);
1457 vm_page_xunbusy(dst_m);
1459 VM_OBJECT_WUNLOCK(dst_object);
1461 dst_entry->eflags &= ~(MAP_ENTRY_COW | MAP_ENTRY_NEEDS_COPY);
1462 vm_object_deallocate(src_object);
1468 * This routine checks around the requested page for other pages that
1469 * might be able to be faulted in. This routine brackets the viable
1470 * pages for the pages to be paged in.
1473 * m, rbehind, rahead
1476 * marray (array of vm_page_t), reqpage (index of requested page)
1479 * number of pages in marray
1482 vm_fault_additional_pages(m, rbehind, rahead, marray, reqpage)
1491 vm_pindex_t pindex, startpindex, endpindex, tpindex;
1493 int cbehind, cahead;
1495 VM_OBJECT_ASSERT_WLOCKED(m->object);
1499 cbehind = cahead = 0;
1502 * if the requested page is not available, then give up now
1504 if (!vm_pager_has_page(object, pindex, &cbehind, &cahead)) {
1508 if ((cbehind == 0) && (cahead == 0)) {
1514 if (rahead > cahead) {
1518 if (rbehind > cbehind) {
1523 * scan backward for the read behind pages -- in memory
1526 if (rbehind > pindex) {
1530 startpindex = pindex - rbehind;
1533 if ((rtm = TAILQ_PREV(m, pglist, listq)) != NULL &&
1534 rtm->pindex >= startpindex)
1535 startpindex = rtm->pindex + 1;
1537 /* tpindex is unsigned; beware of numeric underflow. */
1538 for (i = 0, tpindex = pindex - 1; tpindex >= startpindex &&
1539 tpindex < pindex; i++, tpindex--) {
1541 rtm = vm_page_alloc(object, tpindex, VM_ALLOC_NORMAL |
1542 VM_ALLOC_IFNOTCACHED);
1545 * Shift the allocated pages to the
1546 * beginning of the array.
1548 for (j = 0; j < i; j++) {
1549 marray[j] = marray[j + tpindex + 1 -
1555 marray[tpindex - startpindex] = rtm;
1563 /* page offset of the required page */
1566 tpindex = pindex + 1;
1570 * scan forward for the read ahead pages
1572 endpindex = tpindex + rahead;
1573 if ((rtm = TAILQ_NEXT(m, listq)) != NULL && rtm->pindex < endpindex)
1574 endpindex = rtm->pindex;
1575 if (endpindex > object->size)
1576 endpindex = object->size;
1578 for (; tpindex < endpindex; i++, tpindex++) {
1580 rtm = vm_page_alloc(object, tpindex, VM_ALLOC_NORMAL |
1581 VM_ALLOC_IFNOTCACHED);
1589 /* return number of pages */
1594 * Block entry into the machine-independent layer's page fault handler by
1595 * the calling thread. Subsequent calls to vm_fault() by that thread will
1596 * return KERN_PROTECTION_FAILURE. Enable machine-dependent handling of
1597 * spurious page faults.
1600 vm_fault_disable_pagefaults(void)
1603 return (curthread_pflags_set(TDP_NOFAULTING | TDP_RESETSPUR));
1607 vm_fault_enable_pagefaults(int save)
1610 curthread_pflags_restore(save);