2 * Copyright (c) 1991, 1993
3 * The Regents of the University of California. All rights reserved.
5 * This code is derived from software contributed to Berkeley by
6 * The Mach Operating System project at Carnegie-Mellon University.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 4. Neither the name of the University nor the names of its contributors
17 * may be used to endorse or promote products derived from this software
18 * without specific prior written permission.
20 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
21 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
24 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
25 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
26 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
28 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
29 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 * from: @(#)vm_object.c 8.5 (Berkeley) 3/22/94
35 * Copyright (c) 1987, 1990 Carnegie-Mellon University.
36 * All rights reserved.
38 * Authors: Avadis Tevanian, Jr., Michael Wayne Young
40 * Permission to use, copy, modify and distribute this software and
41 * its documentation is hereby granted, provided that both the copyright
42 * notice and this permission notice appear in all copies of the
43 * software, derivative works or modified versions, and any portions
44 * thereof, and that both notices appear in supporting documentation.
46 * CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS"
47 * CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND
48 * FOR ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
50 * Carnegie Mellon requests users of this software to return to
52 * Software Distribution Coordinator or Software.Distribution@CS.CMU.EDU
53 * School of Computer Science
54 * Carnegie Mellon University
55 * Pittsburgh PA 15213-3890
57 * any improvements or extensions that they make and grant Carnegie the
58 * rights to redistribute these changes.
62 * Virtual memory object module.
65 #include <sys/cdefs.h>
66 __FBSDID("$FreeBSD$");
70 #include <sys/param.h>
71 #include <sys/systm.h>
74 #include <sys/mount.h>
75 #include <sys/kernel.h>
76 #include <sys/sysctl.h>
77 #include <sys/mutex.h>
78 #include <sys/proc.h> /* for curproc, pageproc */
79 #include <sys/socket.h>
80 #include <sys/resourcevar.h>
81 #include <sys/rwlock.h>
83 #include <sys/vnode.h>
84 #include <sys/vmmeter.h>
88 #include <vm/vm_param.h>
90 #include <vm/vm_map.h>
91 #include <vm/vm_object.h>
92 #include <vm/vm_page.h>
93 #include <vm/vm_pageout.h>
94 #include <vm/vm_pager.h>
95 #include <vm/swap_pager.h>
96 #include <vm/vm_kern.h>
97 #include <vm/vm_extern.h>
98 #include <vm/vm_radix.h>
99 #include <vm/vm_reserv.h>
102 static int old_msync;
103 SYSCTL_INT(_vm, OID_AUTO, old_msync, CTLFLAG_RW, &old_msync, 0,
104 "Use old (insecure) msync behavior");
106 static int vm_object_page_collect_flush(vm_object_t object, vm_page_t p,
107 int pagerflags, int flags, boolean_t *clearobjflags,
109 static boolean_t vm_object_page_remove_write(vm_page_t p, int flags,
110 boolean_t *clearobjflags);
111 static void vm_object_qcollapse(vm_object_t object);
112 static void vm_object_vndeallocate(vm_object_t object);
115 * Virtual memory objects maintain the actual data
116 * associated with allocated virtual memory. A given
117 * page of memory exists within exactly one object.
119 * An object is only deallocated when all "references"
120 * are given up. Only one "reference" to a given
121 * region of an object should be writeable.
123 * Associated with each object is a list of all resident
124 * memory pages belonging to that object; this list is
125 * maintained by the "vm_page" module, and locked by the object's
128 * Each object also records a "pager" routine which is
129 * used to retrieve (and store) pages to the proper backing
130 * storage. In addition, objects may be backed by other
131 * objects from which they were virtual-copied.
133 * The only items within the object structure which are
134 * modified after time of creation are:
135 * reference count locked by object's lock
136 * pager routine locked by object's lock
140 struct object_q vm_object_list;
141 struct mtx vm_object_list_mtx; /* lock for object list and count */
143 struct vm_object kernel_object_store;
144 struct vm_object kmem_object_store;
146 static SYSCTL_NODE(_vm_stats, OID_AUTO, object, CTLFLAG_RD, 0,
149 static long object_collapses;
150 SYSCTL_LONG(_vm_stats_object, OID_AUTO, collapses, CTLFLAG_RD,
151 &object_collapses, 0, "VM object collapses");
153 static long object_bypasses;
154 SYSCTL_LONG(_vm_stats_object, OID_AUTO, bypasses, CTLFLAG_RD,
155 &object_bypasses, 0, "VM object bypasses");
157 static uma_zone_t obj_zone;
159 static int vm_object_zinit(void *mem, int size, int flags);
162 static void vm_object_zdtor(void *mem, int size, void *arg);
165 vm_object_zdtor(void *mem, int size, void *arg)
169 object = (vm_object_t)mem;
170 KASSERT(object->ref_count == 0,
171 ("object %p ref_count = %d", object, object->ref_count));
172 KASSERT(TAILQ_EMPTY(&object->memq),
173 ("object %p has resident pages in its memq", object));
174 KASSERT(vm_radix_is_empty(&object->rtree),
175 ("object %p has resident pages in its trie", object));
176 #if VM_NRESERVLEVEL > 0
177 KASSERT(LIST_EMPTY(&object->rvq),
178 ("object %p has reservations",
181 KASSERT(vm_object_cache_is_empty(object),
182 ("object %p has cached pages",
184 KASSERT(object->paging_in_progress == 0,
185 ("object %p paging_in_progress = %d",
186 object, object->paging_in_progress));
187 KASSERT(object->resident_page_count == 0,
188 ("object %p resident_page_count = %d",
189 object, object->resident_page_count));
190 KASSERT(object->shadow_count == 0,
191 ("object %p shadow_count = %d",
192 object, object->shadow_count));
193 KASSERT(object->type == OBJT_DEAD,
194 ("object %p has non-dead type %d",
195 object, object->type));
200 vm_object_zinit(void *mem, int size, int flags)
204 object = (vm_object_t)mem;
205 bzero(&object->lock, sizeof(object->lock));
206 rw_init_flags(&object->lock, "vm object", RW_DUPOK);
208 /* These are true for any object that has been freed */
209 object->type = OBJT_DEAD;
210 object->ref_count = 0;
211 object->rtree.rt_root = 0;
212 object->rtree.rt_flags = 0;
213 object->paging_in_progress = 0;
214 object->resident_page_count = 0;
215 object->shadow_count = 0;
216 object->cache.rt_root = 0;
217 object->cache.rt_flags = 0;
219 mtx_lock(&vm_object_list_mtx);
220 TAILQ_INSERT_TAIL(&vm_object_list, object, object_list);
221 mtx_unlock(&vm_object_list_mtx);
226 _vm_object_allocate(objtype_t type, vm_pindex_t size, vm_object_t object)
229 TAILQ_INIT(&object->memq);
230 LIST_INIT(&object->shadow_head);
235 panic("_vm_object_allocate: can't create OBJT_DEAD");
238 object->flags = OBJ_ONEMAPPING;
242 object->flags = OBJ_FICTITIOUS | OBJ_UNMANAGED;
245 object->flags = OBJ_FICTITIOUS;
248 object->flags = OBJ_UNMANAGED;
254 panic("_vm_object_allocate: type %d is undefined", type);
257 object->generation = 1;
258 object->ref_count = 1;
259 object->memattr = VM_MEMATTR_DEFAULT;
262 object->handle = NULL;
263 object->backing_object = NULL;
264 object->backing_object_offset = (vm_ooffset_t) 0;
265 #if VM_NRESERVLEVEL > 0
266 LIST_INIT(&object->rvq);
273 * Initialize the VM objects module.
278 TAILQ_INIT(&vm_object_list);
279 mtx_init(&vm_object_list_mtx, "vm object_list", NULL, MTX_DEF);
281 rw_init(&kernel_object->lock, "kernel vm object");
282 _vm_object_allocate(OBJT_PHYS, OFF_TO_IDX(VM_MAX_KERNEL_ADDRESS - VM_MIN_KERNEL_ADDRESS),
284 #if VM_NRESERVLEVEL > 0
285 kernel_object->flags |= OBJ_COLORED;
286 kernel_object->pg_color = (u_short)atop(VM_MIN_KERNEL_ADDRESS);
289 rw_init(&kmem_object->lock, "kmem vm object");
290 _vm_object_allocate(OBJT_PHYS, OFF_TO_IDX(VM_MAX_KERNEL_ADDRESS - VM_MIN_KERNEL_ADDRESS),
292 #if VM_NRESERVLEVEL > 0
293 kmem_object->flags |= OBJ_COLORED;
294 kmem_object->pg_color = (u_short)atop(VM_MIN_KERNEL_ADDRESS);
298 * The lock portion of struct vm_object must be type stable due
299 * to vm_pageout_fallback_object_lock locking a vm object
300 * without holding any references to it.
302 obj_zone = uma_zcreate("VM OBJECT", sizeof (struct vm_object), NULL,
308 vm_object_zinit, NULL, UMA_ALIGN_PTR, UMA_ZONE_NOFREE);
314 vm_object_clear_flag(vm_object_t object, u_short bits)
317 VM_OBJECT_ASSERT_WLOCKED(object);
318 object->flags &= ~bits;
322 * Sets the default memory attribute for the specified object. Pages
323 * that are allocated to this object are by default assigned this memory
326 * Presently, this function must be called before any pages are allocated
327 * to the object. In the future, this requirement may be relaxed for
328 * "default" and "swap" objects.
331 vm_object_set_memattr(vm_object_t object, vm_memattr_t memattr)
334 VM_OBJECT_ASSERT_WLOCKED(object);
335 switch (object->type) {
343 if (!TAILQ_EMPTY(&object->memq))
344 return (KERN_FAILURE);
347 return (KERN_INVALID_ARGUMENT);
349 panic("vm_object_set_memattr: object %p is of undefined type",
352 object->memattr = memattr;
353 return (KERN_SUCCESS);
357 vm_object_pip_add(vm_object_t object, short i)
360 VM_OBJECT_ASSERT_WLOCKED(object);
361 object->paging_in_progress += i;
365 vm_object_pip_subtract(vm_object_t object, short i)
368 VM_OBJECT_ASSERT_WLOCKED(object);
369 object->paging_in_progress -= i;
373 vm_object_pip_wakeup(vm_object_t object)
376 VM_OBJECT_ASSERT_WLOCKED(object);
377 object->paging_in_progress--;
378 if ((object->flags & OBJ_PIPWNT) && object->paging_in_progress == 0) {
379 vm_object_clear_flag(object, OBJ_PIPWNT);
385 vm_object_pip_wakeupn(vm_object_t object, short i)
388 VM_OBJECT_ASSERT_WLOCKED(object);
390 object->paging_in_progress -= i;
391 if ((object->flags & OBJ_PIPWNT) && object->paging_in_progress == 0) {
392 vm_object_clear_flag(object, OBJ_PIPWNT);
398 vm_object_pip_wait(vm_object_t object, char *waitid)
401 VM_OBJECT_ASSERT_WLOCKED(object);
402 while (object->paging_in_progress) {
403 object->flags |= OBJ_PIPWNT;
404 VM_OBJECT_SLEEP(object, object, PVM, waitid, 0);
409 * vm_object_allocate:
411 * Returns a new object with the given size.
414 vm_object_allocate(objtype_t type, vm_pindex_t size)
418 object = (vm_object_t)uma_zalloc(obj_zone, M_WAITOK);
419 _vm_object_allocate(type, size, object);
425 * vm_object_reference:
427 * Gets another reference to the given object. Note: OBJ_DEAD
428 * objects can be referenced during final cleaning.
431 vm_object_reference(vm_object_t object)
435 VM_OBJECT_WLOCK(object);
436 vm_object_reference_locked(object);
437 VM_OBJECT_WUNLOCK(object);
441 * vm_object_reference_locked:
443 * Gets another reference to the given object.
445 * The object must be locked.
448 vm_object_reference_locked(vm_object_t object)
452 VM_OBJECT_ASSERT_WLOCKED(object);
454 if (object->type == OBJT_VNODE) {
461 * Handle deallocating an object of type OBJT_VNODE.
464 vm_object_vndeallocate(vm_object_t object)
466 struct vnode *vp = (struct vnode *) object->handle;
468 VM_OBJECT_ASSERT_WLOCKED(object);
469 KASSERT(object->type == OBJT_VNODE,
470 ("vm_object_vndeallocate: not a vnode object"));
471 KASSERT(vp != NULL, ("vm_object_vndeallocate: missing vp"));
473 if (object->ref_count == 0) {
474 vprint("vm_object_vndeallocate", vp);
475 panic("vm_object_vndeallocate: bad object reference count");
480 * The test for text of vp vnode does not need a bypass to
481 * reach right VV_TEXT there, since it is obtained from
484 if (object->ref_count > 1 || (vp->v_vflag & VV_TEXT) == 0) {
486 VM_OBJECT_WUNLOCK(object);
487 /* vrele may need the vnode lock. */
491 VM_OBJECT_WUNLOCK(object);
492 vn_lock(vp, LK_EXCLUSIVE | LK_RETRY);
494 VM_OBJECT_WLOCK(object);
496 if (object->type == OBJT_DEAD) {
497 VM_OBJECT_WUNLOCK(object);
500 if (object->ref_count == 0)
502 VM_OBJECT_WUNLOCK(object);
509 * vm_object_deallocate:
511 * Release a reference to the specified object,
512 * gained either through a vm_object_allocate
513 * or a vm_object_reference call. When all references
514 * are gone, storage associated with this object
515 * may be relinquished.
517 * No object may be locked.
520 vm_object_deallocate(vm_object_t object)
525 while (object != NULL) {
526 VM_OBJECT_WLOCK(object);
527 if (object->type == OBJT_VNODE) {
528 vm_object_vndeallocate(object);
532 KASSERT(object->ref_count != 0,
533 ("vm_object_deallocate: object deallocated too many times: %d", object->type));
536 * If the reference count goes to 0 we start calling
537 * vm_object_terminate() on the object chain.
538 * A ref count of 1 may be a special case depending on the
539 * shadow count being 0 or 1.
542 if (object->ref_count > 1) {
543 VM_OBJECT_WUNLOCK(object);
545 } else if (object->ref_count == 1) {
546 if (object->type == OBJT_SWAP &&
547 (object->flags & OBJ_TMPFS) != 0) {
548 vp = object->un_pager.swp.swp_tmpfs;
550 VM_OBJECT_WUNLOCK(object);
551 vn_lock(vp, LK_EXCLUSIVE | LK_RETRY);
552 VM_OBJECT_WLOCK(object);
553 if (object->type == OBJT_DEAD ||
554 object->ref_count != 1) {
555 VM_OBJECT_WUNLOCK(object);
560 if ((object->flags & OBJ_TMPFS) != 0)
565 if (object->shadow_count == 0 &&
566 object->handle == NULL &&
567 (object->type == OBJT_DEFAULT ||
568 (object->type == OBJT_SWAP &&
569 (object->flags & OBJ_TMPFS_NODE) == 0))) {
570 vm_object_set_flag(object, OBJ_ONEMAPPING);
571 } else if ((object->shadow_count == 1) &&
572 (object->handle == NULL) &&
573 (object->type == OBJT_DEFAULT ||
574 object->type == OBJT_SWAP)) {
577 robject = LIST_FIRST(&object->shadow_head);
578 KASSERT(robject != NULL,
579 ("vm_object_deallocate: ref_count: %d, shadow_count: %d",
581 object->shadow_count));
582 KASSERT((robject->flags & OBJ_TMPFS_NODE) == 0,
583 ("shadowed tmpfs v_object %p", object));
584 if (!VM_OBJECT_TRYWLOCK(robject)) {
586 * Avoid a potential deadlock.
589 VM_OBJECT_WUNLOCK(object);
591 * More likely than not the thread
592 * holding robject's lock has lower
593 * priority than the current thread.
594 * Let the lower priority thread run.
600 * Collapse object into its shadow unless its
601 * shadow is dead. In that case, object will
602 * be deallocated by the thread that is
603 * deallocating its shadow.
605 if ((robject->flags & OBJ_DEAD) == 0 &&
606 (robject->handle == NULL) &&
607 (robject->type == OBJT_DEFAULT ||
608 robject->type == OBJT_SWAP)) {
610 robject->ref_count++;
612 if (robject->paging_in_progress) {
613 VM_OBJECT_WUNLOCK(object);
614 vm_object_pip_wait(robject,
616 temp = robject->backing_object;
617 if (object == temp) {
618 VM_OBJECT_WLOCK(object);
621 } else if (object->paging_in_progress) {
622 VM_OBJECT_WUNLOCK(robject);
623 object->flags |= OBJ_PIPWNT;
624 VM_OBJECT_SLEEP(object, object,
625 PDROP | PVM, "objde2", 0);
626 VM_OBJECT_WLOCK(robject);
627 temp = robject->backing_object;
628 if (object == temp) {
629 VM_OBJECT_WLOCK(object);
633 VM_OBJECT_WUNLOCK(object);
635 if (robject->ref_count == 1) {
636 robject->ref_count--;
641 vm_object_collapse(object);
642 VM_OBJECT_WUNLOCK(object);
645 VM_OBJECT_WUNLOCK(robject);
647 VM_OBJECT_WUNLOCK(object);
651 temp = object->backing_object;
653 KASSERT((object->flags & OBJ_TMPFS_NODE) == 0,
654 ("shadowed tmpfs v_object 2 %p", object));
655 VM_OBJECT_WLOCK(temp);
656 LIST_REMOVE(object, shadow_list);
657 temp->shadow_count--;
658 VM_OBJECT_WUNLOCK(temp);
659 object->backing_object = NULL;
662 * Don't double-terminate, we could be in a termination
663 * recursion due to the terminate having to sync data
666 if ((object->flags & OBJ_DEAD) == 0)
667 vm_object_terminate(object);
669 VM_OBJECT_WUNLOCK(object);
675 * vm_object_destroy removes the object from the global object list
676 * and frees the space for the object.
679 vm_object_destroy(vm_object_t object)
683 * Release the allocation charge.
685 if (object->cred != NULL) {
686 swap_release_by_cred(object->charge, object->cred);
688 crfree(object->cred);
693 * Free the space for the object.
695 uma_zfree(obj_zone, object);
699 * vm_object_terminate actually destroys the specified object, freeing
700 * up all previously used resources.
702 * The object must be locked.
703 * This routine may block.
706 vm_object_terminate(vm_object_t object)
710 VM_OBJECT_ASSERT_WLOCKED(object);
713 * Make sure no one uses us.
715 vm_object_set_flag(object, OBJ_DEAD);
718 * wait for the pageout daemon to be done with the object
720 vm_object_pip_wait(object, "objtrm");
722 KASSERT(!object->paging_in_progress,
723 ("vm_object_terminate: pageout in progress"));
726 * Clean and free the pages, as appropriate. All references to the
727 * object are gone, so we don't need to lock it.
729 if (object->type == OBJT_VNODE) {
730 struct vnode *vp = (struct vnode *)object->handle;
733 * Clean pages and flush buffers.
735 vm_object_page_clean(object, 0, 0, OBJPC_SYNC);
736 VM_OBJECT_WUNLOCK(object);
738 vinvalbuf(vp, V_SAVE, 0, 0);
740 VM_OBJECT_WLOCK(object);
743 KASSERT(object->ref_count == 0,
744 ("vm_object_terminate: object with references, ref_count=%d",
748 * Free any remaining pageable pages. This also removes them from the
749 * paging queues. However, don't free wired pages, just remove them
750 * from the object. Rather than incrementally removing each page from
751 * the object, the page and object are reset to any empty state.
753 TAILQ_FOREACH_SAFE(p, &object->memq, listq, p_next) {
754 vm_page_assert_unbusied(p);
757 * Optimize the page's removal from the object by resetting
758 * its "object" field. Specifically, if the page is not
759 * wired, then the effect of this assignment is that
760 * vm_page_free()'s call to vm_page_remove() will return
761 * immediately without modifying the page or the object.
764 if (p->wire_count == 0) {
766 PCPU_INC(cnt.v_pfree);
771 * If the object contained any pages, then reset it to an empty state.
772 * None of the object's fields, including "resident_page_count", were
773 * modified by the preceding loop.
775 if (object->resident_page_count != 0) {
776 vm_radix_reclaim_allnodes(&object->rtree);
777 TAILQ_INIT(&object->memq);
778 object->resident_page_count = 0;
779 if (object->type == OBJT_VNODE)
780 vdrop(object->handle);
783 #if VM_NRESERVLEVEL > 0
784 if (__predict_false(!LIST_EMPTY(&object->rvq)))
785 vm_reserv_break_all(object);
787 if (__predict_false(!vm_object_cache_is_empty(object)))
788 vm_page_cache_free(object, 0, 0);
790 KASSERT(object->cred == NULL || object->type == OBJT_DEFAULT ||
791 object->type == OBJT_SWAP,
792 ("%s: non-swap obj %p has cred", __func__, object));
795 * Let the pager know object is dead.
797 vm_pager_deallocate(object);
798 VM_OBJECT_WUNLOCK(object);
800 vm_object_destroy(object);
804 * Make the page read-only so that we can clear the object flags. However, if
805 * this is a nosync mmap then the object is likely to stay dirty so do not
806 * mess with the page and do not clear the object flags. Returns TRUE if the
807 * page should be flushed, and FALSE otherwise.
810 vm_object_page_remove_write(vm_page_t p, int flags, boolean_t *clearobjflags)
814 * If we have been asked to skip nosync pages and this is a
815 * nosync page, skip it. Note that the object flags were not
816 * cleared in this case so we do not have to set them.
818 if ((flags & OBJPC_NOSYNC) != 0 && (p->oflags & VPO_NOSYNC) != 0) {
819 *clearobjflags = FALSE;
822 pmap_remove_write(p);
823 return (p->dirty != 0);
828 * vm_object_page_clean
830 * Clean all dirty pages in the specified range of object. Leaves page
831 * on whatever queue it is currently on. If NOSYNC is set then do not
832 * write out pages with VPO_NOSYNC set (originally comes from MAP_NOSYNC),
833 * leaving the object dirty.
835 * When stuffing pages asynchronously, allow clustering. XXX we need a
836 * synchronous clustering mode implementation.
838 * Odd semantics: if start == end, we clean everything.
840 * The object must be locked.
842 * Returns FALSE if some page from the range was not written, as
843 * reported by the pager, and TRUE otherwise.
846 vm_object_page_clean(vm_object_t object, vm_ooffset_t start, vm_ooffset_t end,
850 vm_pindex_t pi, tend, tstart;
851 int curgeneration, n, pagerflags;
852 boolean_t clearobjflags, eio, res;
854 VM_OBJECT_ASSERT_WLOCKED(object);
857 * The OBJ_MIGHTBEDIRTY flag is only set for OBJT_VNODE
858 * objects. The check below prevents the function from
859 * operating on non-vnode objects.
861 if ((object->flags & OBJ_MIGHTBEDIRTY) == 0 ||
862 object->resident_page_count == 0)
865 pagerflags = (flags & (OBJPC_SYNC | OBJPC_INVAL)) != 0 ?
866 VM_PAGER_PUT_SYNC : VM_PAGER_CLUSTER_OK;
867 pagerflags |= (flags & OBJPC_INVAL) != 0 ? VM_PAGER_PUT_INVAL : 0;
869 tstart = OFF_TO_IDX(start);
870 tend = (end == 0) ? object->size : OFF_TO_IDX(end + PAGE_MASK);
871 clearobjflags = tstart == 0 && tend >= object->size;
875 curgeneration = object->generation;
877 for (p = vm_page_find_least(object, tstart); p != NULL; p = np) {
881 np = TAILQ_NEXT(p, listq);
884 if (vm_page_sleep_if_busy(p, "vpcwai")) {
885 if (object->generation != curgeneration) {
886 if ((flags & OBJPC_SYNC) != 0)
889 clearobjflags = FALSE;
891 np = vm_page_find_least(object, pi);
894 if (!vm_object_page_remove_write(p, flags, &clearobjflags))
897 n = vm_object_page_collect_flush(object, p, pagerflags,
898 flags, &clearobjflags, &eio);
901 clearobjflags = FALSE;
903 if (object->generation != curgeneration) {
904 if ((flags & OBJPC_SYNC) != 0)
907 clearobjflags = FALSE;
911 * If the VOP_PUTPAGES() did a truncated write, so
912 * that even the first page of the run is not fully
913 * written, vm_pageout_flush() returns 0 as the run
914 * length. Since the condition that caused truncated
915 * write may be permanent, e.g. exhausted free space,
916 * accepting n == 0 would cause an infinite loop.
918 * Forwarding the iterator leaves the unwritten page
919 * behind, but there is not much we can do there if
920 * filesystem refuses to write it.
924 clearobjflags = FALSE;
926 np = vm_page_find_least(object, pi + n);
929 VOP_FSYNC(vp, (pagerflags & VM_PAGER_PUT_SYNC) ? MNT_WAIT : 0);
933 vm_object_clear_flag(object, OBJ_MIGHTBEDIRTY);
938 vm_object_page_collect_flush(vm_object_t object, vm_page_t p, int pagerflags,
939 int flags, boolean_t *clearobjflags, boolean_t *eio)
941 vm_page_t ma[vm_pageout_page_count], p_first, tp;
942 int count, i, mreq, runlen;
944 vm_page_lock_assert(p, MA_NOTOWNED);
945 VM_OBJECT_ASSERT_WLOCKED(object);
950 for (tp = p; count < vm_pageout_page_count; count++) {
951 tp = vm_page_next(tp);
952 if (tp == NULL || vm_page_busied(tp))
954 if (!vm_object_page_remove_write(tp, flags, clearobjflags))
958 for (p_first = p; count < vm_pageout_page_count; count++) {
959 tp = vm_page_prev(p_first);
960 if (tp == NULL || vm_page_busied(tp))
962 if (!vm_object_page_remove_write(tp, flags, clearobjflags))
968 for (tp = p_first, i = 0; i < count; tp = TAILQ_NEXT(tp, listq), i++)
971 vm_pageout_flush(ma, count, pagerflags, mreq, &runlen, eio);
976 * Note that there is absolutely no sense in writing out
977 * anonymous objects, so we track down the vnode object
979 * We invalidate (remove) all pages from the address space
980 * for semantic correctness.
982 * If the backing object is a device object with unmanaged pages, then any
983 * mappings to the specified range of pages must be removed before this
984 * function is called.
986 * Note: certain anonymous maps, such as MAP_NOSYNC maps,
987 * may start out with a NULL object.
990 vm_object_sync(vm_object_t object, vm_ooffset_t offset, vm_size_t size,
991 boolean_t syncio, boolean_t invalidate)
993 vm_object_t backing_object;
996 int error, flags, fsync_after;
1003 VM_OBJECT_WLOCK(object);
1004 while ((backing_object = object->backing_object) != NULL) {
1005 VM_OBJECT_WLOCK(backing_object);
1006 offset += object->backing_object_offset;
1007 VM_OBJECT_WUNLOCK(object);
1008 object = backing_object;
1009 if (object->size < OFF_TO_IDX(offset + size))
1010 size = IDX_TO_OFF(object->size) - offset;
1013 * Flush pages if writing is allowed, invalidate them
1014 * if invalidation requested. Pages undergoing I/O
1015 * will be ignored by vm_object_page_remove().
1017 * We cannot lock the vnode and then wait for paging
1018 * to complete without deadlocking against vm_fault.
1019 * Instead we simply call vm_object_page_remove() and
1020 * allow it to block internally on a page-by-page
1021 * basis when it encounters pages undergoing async
1024 if (object->type == OBJT_VNODE &&
1025 (object->flags & OBJ_MIGHTBEDIRTY) != 0) {
1026 vp = object->handle;
1027 VM_OBJECT_WUNLOCK(object);
1028 (void) vn_start_write(vp, &mp, V_WAIT);
1029 vn_lock(vp, LK_EXCLUSIVE | LK_RETRY);
1030 if (syncio && !invalidate && offset == 0 &&
1031 OFF_TO_IDX(size) == object->size) {
1033 * If syncing the whole mapping of the file,
1034 * it is faster to schedule all the writes in
1035 * async mode, also allowing the clustering,
1036 * and then wait for i/o to complete.
1041 flags = (syncio || invalidate) ? OBJPC_SYNC : 0;
1042 flags |= invalidate ? (OBJPC_SYNC | OBJPC_INVAL) : 0;
1043 fsync_after = FALSE;
1045 VM_OBJECT_WLOCK(object);
1046 res = vm_object_page_clean(object, offset, offset + size,
1048 VM_OBJECT_WUNLOCK(object);
1050 error = VOP_FSYNC(vp, MNT_WAIT, curthread);
1052 vn_finished_write(mp);
1055 VM_OBJECT_WLOCK(object);
1057 if ((object->type == OBJT_VNODE ||
1058 object->type == OBJT_DEVICE) && invalidate) {
1059 if (object->type == OBJT_DEVICE)
1061 * The option OBJPR_NOTMAPPED must be passed here
1062 * because vm_object_page_remove() cannot remove
1063 * unmanaged mappings.
1065 flags = OBJPR_NOTMAPPED;
1069 flags = OBJPR_CLEANONLY;
1070 vm_object_page_remove(object, OFF_TO_IDX(offset),
1071 OFF_TO_IDX(offset + size + PAGE_MASK), flags);
1073 VM_OBJECT_WUNLOCK(object);
1078 * vm_object_madvise:
1080 * Implements the madvise function at the object/page level.
1082 * MADV_WILLNEED (any object)
1084 * Activate the specified pages if they are resident.
1086 * MADV_DONTNEED (any object)
1088 * Deactivate the specified pages if they are resident.
1090 * MADV_FREE (OBJT_DEFAULT/OBJT_SWAP objects,
1091 * OBJ_ONEMAPPING only)
1093 * Deactivate and clean the specified pages if they are
1094 * resident. This permits the process to reuse the pages
1095 * without faulting or the kernel to reclaim the pages
1099 vm_object_madvise(vm_object_t object, vm_pindex_t pindex, vm_pindex_t end,
1102 vm_pindex_t tpindex;
1103 vm_object_t backing_object, tobject;
1108 VM_OBJECT_WLOCK(object);
1110 * Locate and adjust resident pages
1112 for (; pindex < end; pindex += 1) {
1118 * MADV_FREE only operates on OBJT_DEFAULT or OBJT_SWAP pages
1119 * and those pages must be OBJ_ONEMAPPING.
1121 if (advise == MADV_FREE) {
1122 if ((tobject->type != OBJT_DEFAULT &&
1123 tobject->type != OBJT_SWAP) ||
1124 (tobject->flags & OBJ_ONEMAPPING) == 0) {
1125 goto unlock_tobject;
1127 } else if ((tobject->flags & OBJ_UNMANAGED) != 0)
1128 goto unlock_tobject;
1129 m = vm_page_lookup(tobject, tpindex);
1130 if (m == NULL && advise == MADV_WILLNEED) {
1132 * If the page is cached, reactivate it.
1134 m = vm_page_alloc(tobject, tpindex, VM_ALLOC_IFCACHED |
1139 * There may be swap even if there is no backing page
1141 if (advise == MADV_FREE && tobject->type == OBJT_SWAP)
1142 swap_pager_freespace(tobject, tpindex, 1);
1146 backing_object = tobject->backing_object;
1147 if (backing_object == NULL)
1148 goto unlock_tobject;
1149 VM_OBJECT_WLOCK(backing_object);
1150 tpindex += OFF_TO_IDX(tobject->backing_object_offset);
1151 if (tobject != object)
1152 VM_OBJECT_WUNLOCK(tobject);
1153 tobject = backing_object;
1155 } else if (m->valid != VM_PAGE_BITS_ALL)
1156 goto unlock_tobject;
1158 * If the page is not in a normal state, skip it.
1161 if (m->hold_count != 0 || m->wire_count != 0) {
1163 goto unlock_tobject;
1165 KASSERT((m->flags & PG_FICTITIOUS) == 0,
1166 ("vm_object_madvise: page %p is fictitious", m));
1167 KASSERT((m->oflags & VPO_UNMANAGED) == 0,
1168 ("vm_object_madvise: page %p is not managed", m));
1169 if (vm_page_busied(m)) {
1170 if (advise == MADV_WILLNEED) {
1172 * Reference the page before unlocking and
1173 * sleeping so that the page daemon is less
1174 * likely to reclaim it.
1176 vm_page_aflag_set(m, PGA_REFERENCED);
1178 if (object != tobject)
1179 VM_OBJECT_WUNLOCK(object);
1180 VM_OBJECT_WUNLOCK(tobject);
1181 vm_page_busy_sleep(m, "madvpo");
1182 VM_OBJECT_WLOCK(object);
1185 if (advise == MADV_WILLNEED) {
1186 vm_page_activate(m);
1188 vm_page_advise(m, advise);
1191 if (advise == MADV_FREE && tobject->type == OBJT_SWAP)
1192 swap_pager_freespace(tobject, tpindex, 1);
1194 if (tobject != object)
1195 VM_OBJECT_WUNLOCK(tobject);
1197 VM_OBJECT_WUNLOCK(object);
1203 * Create a new object which is backed by the
1204 * specified existing object range. The source
1205 * object reference is deallocated.
1207 * The new object and offset into that object
1208 * are returned in the source parameters.
1212 vm_object_t *object, /* IN/OUT */
1213 vm_ooffset_t *offset, /* IN/OUT */
1222 * Don't create the new object if the old object isn't shared.
1224 if (source != NULL) {
1225 VM_OBJECT_WLOCK(source);
1226 if (source->ref_count == 1 &&
1227 source->handle == NULL &&
1228 (source->type == OBJT_DEFAULT ||
1229 source->type == OBJT_SWAP)) {
1230 VM_OBJECT_WUNLOCK(source);
1233 VM_OBJECT_WUNLOCK(source);
1237 * Allocate a new object with the given length.
1239 result = vm_object_allocate(OBJT_DEFAULT, atop(length));
1242 * The new object shadows the source object, adding a reference to it.
1243 * Our caller changes his reference to point to the new object,
1244 * removing a reference to the source object. Net result: no change
1245 * of reference count.
1247 * Try to optimize the result object's page color when shadowing
1248 * in order to maintain page coloring consistency in the combined
1251 result->backing_object = source;
1253 * Store the offset into the source object, and fix up the offset into
1256 result->backing_object_offset = *offset;
1257 if (source != NULL) {
1258 VM_OBJECT_WLOCK(source);
1259 LIST_INSERT_HEAD(&source->shadow_head, result, shadow_list);
1260 source->shadow_count++;
1261 #if VM_NRESERVLEVEL > 0
1262 result->flags |= source->flags & OBJ_COLORED;
1263 result->pg_color = (source->pg_color + OFF_TO_IDX(*offset)) &
1264 ((1 << (VM_NFREEORDER - 1)) - 1);
1266 VM_OBJECT_WUNLOCK(source);
1271 * Return the new things
1280 * Split the pages in a map entry into a new object. This affords
1281 * easier removal of unused pages, and keeps object inheritance from
1282 * being a negative impact on memory usage.
1285 vm_object_split(vm_map_entry_t entry)
1287 vm_page_t m, m_next;
1288 vm_object_t orig_object, new_object, source;
1289 vm_pindex_t idx, offidxstart;
1292 orig_object = entry->object.vm_object;
1293 if (orig_object->type != OBJT_DEFAULT && orig_object->type != OBJT_SWAP)
1295 if (orig_object->ref_count <= 1)
1297 VM_OBJECT_WUNLOCK(orig_object);
1299 offidxstart = OFF_TO_IDX(entry->offset);
1300 size = atop(entry->end - entry->start);
1303 * If swap_pager_copy() is later called, it will convert new_object
1304 * into a swap object.
1306 new_object = vm_object_allocate(OBJT_DEFAULT, size);
1309 * At this point, the new object is still private, so the order in
1310 * which the original and new objects are locked does not matter.
1312 VM_OBJECT_WLOCK(new_object);
1313 VM_OBJECT_WLOCK(orig_object);
1314 source = orig_object->backing_object;
1315 if (source != NULL) {
1316 VM_OBJECT_WLOCK(source);
1317 if ((source->flags & OBJ_DEAD) != 0) {
1318 VM_OBJECT_WUNLOCK(source);
1319 VM_OBJECT_WUNLOCK(orig_object);
1320 VM_OBJECT_WUNLOCK(new_object);
1321 vm_object_deallocate(new_object);
1322 VM_OBJECT_WLOCK(orig_object);
1325 LIST_INSERT_HEAD(&source->shadow_head,
1326 new_object, shadow_list);
1327 source->shadow_count++;
1328 vm_object_reference_locked(source); /* for new_object */
1329 vm_object_clear_flag(source, OBJ_ONEMAPPING);
1330 VM_OBJECT_WUNLOCK(source);
1331 new_object->backing_object_offset =
1332 orig_object->backing_object_offset + entry->offset;
1333 new_object->backing_object = source;
1335 if (orig_object->cred != NULL) {
1336 new_object->cred = orig_object->cred;
1337 crhold(orig_object->cred);
1338 new_object->charge = ptoa(size);
1339 KASSERT(orig_object->charge >= ptoa(size),
1340 ("orig_object->charge < 0"));
1341 orig_object->charge -= ptoa(size);
1344 m = vm_page_find_least(orig_object, offidxstart);
1345 for (; m != NULL && (idx = m->pindex - offidxstart) < size;
1347 m_next = TAILQ_NEXT(m, listq);
1350 * We must wait for pending I/O to complete before we can
1353 * We do not have to VM_PROT_NONE the page as mappings should
1354 * not be changed by this operation.
1356 if (vm_page_busied(m)) {
1357 VM_OBJECT_WUNLOCK(new_object);
1359 VM_OBJECT_WUNLOCK(orig_object);
1360 vm_page_busy_sleep(m, "spltwt");
1361 VM_OBJECT_WLOCK(orig_object);
1362 VM_OBJECT_WLOCK(new_object);
1366 /* vm_page_rename() will handle dirty and cache. */
1367 if (vm_page_rename(m, new_object, idx)) {
1368 VM_OBJECT_WUNLOCK(new_object);
1369 VM_OBJECT_WUNLOCK(orig_object);
1371 VM_OBJECT_WLOCK(orig_object);
1372 VM_OBJECT_WLOCK(new_object);
1375 #if VM_NRESERVLEVEL > 0
1377 * If some of the reservation's allocated pages remain with
1378 * the original object, then transferring the reservation to
1379 * the new object is neither particularly beneficial nor
1380 * particularly harmful as compared to leaving the reservation
1381 * with the original object. If, however, all of the
1382 * reservation's allocated pages are transferred to the new
1383 * object, then transferring the reservation is typically
1384 * beneficial. Determining which of these two cases applies
1385 * would be more costly than unconditionally renaming the
1388 vm_reserv_rename(m, new_object, orig_object, offidxstart);
1390 if (orig_object->type == OBJT_SWAP)
1393 if (orig_object->type == OBJT_SWAP) {
1395 * swap_pager_copy() can sleep, in which case the orig_object's
1396 * and new_object's locks are released and reacquired.
1398 swap_pager_copy(orig_object, new_object, offidxstart, 0);
1399 TAILQ_FOREACH(m, &new_object->memq, listq)
1403 * Transfer any cached pages from orig_object to new_object.
1404 * If swap_pager_copy() found swapped out pages within the
1405 * specified range of orig_object, then it changed
1406 * new_object's type to OBJT_SWAP when it transferred those
1407 * pages to new_object. Otherwise, new_object's type
1408 * should still be OBJT_DEFAULT and orig_object should not
1409 * contain any cached pages within the specified range.
1411 if (__predict_false(!vm_object_cache_is_empty(orig_object)))
1412 vm_page_cache_transfer(orig_object, offidxstart,
1415 VM_OBJECT_WUNLOCK(orig_object);
1416 VM_OBJECT_WUNLOCK(new_object);
1417 entry->object.vm_object = new_object;
1418 entry->offset = 0LL;
1419 vm_object_deallocate(orig_object);
1420 VM_OBJECT_WLOCK(new_object);
1423 #define OBSC_TEST_ALL_SHADOWED 0x0001
1424 #define OBSC_COLLAPSE_NOWAIT 0x0002
1425 #define OBSC_COLLAPSE_WAIT 0x0004
1428 vm_object_backing_scan_wait(vm_object_t object, vm_page_t p, vm_page_t next,
1431 vm_object_t backing_object;
1433 VM_OBJECT_ASSERT_WLOCKED(object);
1434 backing_object = object->backing_object;
1435 VM_OBJECT_ASSERT_WLOCKED(backing_object);
1437 KASSERT(p == NULL || vm_page_busied(p), ("unbusy page %p", p));
1438 KASSERT(p == NULL || p->object == object || p->object == backing_object,
1439 ("invalid ownership %p %p %p", p, object, backing_object));
1440 if ((op & OBSC_COLLAPSE_NOWAIT) != 0)
1444 VM_OBJECT_WUNLOCK(object);
1445 VM_OBJECT_WUNLOCK(backing_object);
1449 vm_page_busy_sleep(p, "vmocol");
1450 VM_OBJECT_WLOCK(object);
1451 VM_OBJECT_WLOCK(backing_object);
1452 return (TAILQ_FIRST(&backing_object->memq));
1456 vm_object_backing_scan(vm_object_t object, int op)
1458 vm_object_t backing_object;
1459 vm_page_t next, p, pp;
1460 vm_pindex_t backing_offset_index, new_pindex;
1462 VM_OBJECT_ASSERT_WLOCKED(object);
1463 VM_OBJECT_ASSERT_WLOCKED(object->backing_object);
1465 backing_object = object->backing_object;
1466 backing_offset_index = OFF_TO_IDX(object->backing_object_offset);
1469 * Initial conditions
1471 if (op & OBSC_TEST_ALL_SHADOWED) {
1473 * We do not want to have to test for the existence of cache
1474 * or swap pages in the backing object. XXX but with the
1475 * new swapper this would be pretty easy to do.
1477 * XXX what about anonymous MAP_SHARED memory that hasn't
1478 * been ZFOD faulted yet? If we do not test for this, the
1479 * shadow test may succeed! XXX
1481 if (backing_object->type != OBJT_DEFAULT) {
1485 if (op & OBSC_COLLAPSE_WAIT) {
1486 vm_object_set_flag(backing_object, OBJ_DEAD);
1492 p = TAILQ_FIRST(&backing_object->memq);
1494 next = TAILQ_NEXT(p, listq);
1495 new_pindex = p->pindex - backing_offset_index;
1496 if (op & OBSC_TEST_ALL_SHADOWED) {
1498 * Ignore pages outside the parent object's range
1499 * and outside the parent object's mapping of the
1502 * Note that we do not busy the backing object's
1505 if (p->pindex < backing_offset_index ||
1506 new_pindex >= object->size) {
1512 * See if the parent has the page or if the parent's
1513 * object pager has the page. If the parent has the
1514 * page but the page is not valid, the parent's
1515 * object pager must have the page.
1517 * If this fails, the parent does not completely shadow
1518 * the object and we might as well give up now.
1521 pp = vm_page_lookup(object, new_pindex);
1522 if ((pp == NULL || pp->valid == 0) &&
1523 !vm_pager_has_page(object, new_pindex, NULL, NULL))
1528 * Check for busy page
1530 if (op & (OBSC_COLLAPSE_WAIT | OBSC_COLLAPSE_NOWAIT)) {
1531 if (vm_page_busied(p)) {
1532 p = vm_object_backing_scan_wait(object, p,
1537 KASSERT(p->object == backing_object,
1538 ("vm_object_backing_scan: object mismatch"));
1540 if (p->pindex < backing_offset_index ||
1541 new_pindex >= object->size) {
1542 if (backing_object->type == OBJT_SWAP)
1543 swap_pager_freespace(backing_object,
1547 * Page is out of the parent object's range, we
1548 * can simply destroy it.
1551 KASSERT(!pmap_page_is_mapped(p),
1552 ("freeing mapped page %p", p));
1553 if (p->wire_count == 0)
1562 pp = vm_page_lookup(object, new_pindex);
1563 if (pp != NULL && vm_page_busied(pp)) {
1565 * The page in the parent is busy and
1566 * possibly not (yet) valid. Until
1567 * its state is finalized by the busy
1568 * bit owner, we can't tell whether it
1569 * shadows the original page.
1570 * Therefore, we must either skip it
1571 * and the original (backing_object)
1572 * page or wait for its state to be
1575 * This is due to a race with vm_fault()
1576 * where we must unbusy the original
1577 * (backing_obj) page before we can
1578 * (re)lock the parent. Hence we can
1581 p = vm_object_backing_scan_wait(object, pp,
1586 KASSERT(pp == NULL || pp->valid != 0,
1587 ("unbusy invalid page %p", pp));
1589 if (pp != NULL || vm_pager_has_page(object,
1590 new_pindex, NULL, NULL)) {
1592 * The page already exists in the
1593 * parent OR swap exists for this
1594 * location in the parent. Leave the
1595 * parent's page alone. Destroy the
1596 * original page from the backing
1599 if (backing_object->type == OBJT_SWAP)
1600 swap_pager_freespace(backing_object,
1603 KASSERT(!pmap_page_is_mapped(p),
1604 ("freeing mapped page %p", p));
1605 if (p->wire_count == 0)
1615 * Page does not exist in parent, rename the
1616 * page from the backing object to the main object.
1618 * If the page was mapped to a process, it can remain
1619 * mapped through the rename.
1620 * vm_page_rename() will handle dirty and cache.
1622 if (vm_page_rename(p, object, new_pindex)) {
1623 p = vm_object_backing_scan_wait(object, NULL,
1628 /* Use the old pindex to free the right page. */
1629 if (backing_object->type == OBJT_SWAP)
1630 swap_pager_freespace(backing_object,
1631 new_pindex + backing_offset_index, 1);
1633 #if VM_NRESERVLEVEL > 0
1635 * Rename the reservation.
1637 vm_reserv_rename(p, object, backing_object,
1638 backing_offset_index);
1648 * this version of collapse allows the operation to occur earlier and
1649 * when paging_in_progress is true for an object... This is not a complete
1650 * operation, but should plug 99.9% of the rest of the leaks.
1653 vm_object_qcollapse(vm_object_t object)
1655 vm_object_t backing_object = object->backing_object;
1657 VM_OBJECT_ASSERT_WLOCKED(object);
1658 VM_OBJECT_ASSERT_WLOCKED(backing_object);
1660 if (backing_object->ref_count != 1)
1663 vm_object_backing_scan(object, OBSC_COLLAPSE_NOWAIT);
1667 * vm_object_collapse:
1669 * Collapse an object with the object backing it.
1670 * Pages in the backing object are moved into the
1671 * parent, and the backing object is deallocated.
1674 vm_object_collapse(vm_object_t object)
1676 VM_OBJECT_ASSERT_WLOCKED(object);
1679 vm_object_t backing_object;
1682 * Verify that the conditions are right for collapse:
1684 * The object exists and the backing object exists.
1686 if ((backing_object = object->backing_object) == NULL)
1690 * we check the backing object first, because it is most likely
1693 VM_OBJECT_WLOCK(backing_object);
1694 if (backing_object->handle != NULL ||
1695 (backing_object->type != OBJT_DEFAULT &&
1696 backing_object->type != OBJT_SWAP) ||
1697 (backing_object->flags & OBJ_DEAD) ||
1698 object->handle != NULL ||
1699 (object->type != OBJT_DEFAULT &&
1700 object->type != OBJT_SWAP) ||
1701 (object->flags & OBJ_DEAD)) {
1702 VM_OBJECT_WUNLOCK(backing_object);
1707 object->paging_in_progress != 0 ||
1708 backing_object->paging_in_progress != 0
1710 vm_object_qcollapse(object);
1711 VM_OBJECT_WUNLOCK(backing_object);
1715 * We know that we can either collapse the backing object (if
1716 * the parent is the only reference to it) or (perhaps) have
1717 * the parent bypass the object if the parent happens to shadow
1718 * all the resident pages in the entire backing object.
1720 * This is ignoring pager-backed pages such as swap pages.
1721 * vm_object_backing_scan fails the shadowing test in this
1724 if (backing_object->ref_count == 1) {
1726 * If there is exactly one reference to the backing
1727 * object, we can collapse it into the parent.
1729 vm_object_backing_scan(object, OBSC_COLLAPSE_WAIT);
1731 #if VM_NRESERVLEVEL > 0
1733 * Break any reservations from backing_object.
1735 if (__predict_false(!LIST_EMPTY(&backing_object->rvq)))
1736 vm_reserv_break_all(backing_object);
1740 * Move the pager from backing_object to object.
1742 if (backing_object->type == OBJT_SWAP) {
1744 * swap_pager_copy() can sleep, in which case
1745 * the backing_object's and object's locks are
1746 * released and reacquired.
1747 * Since swap_pager_copy() is being asked to
1748 * destroy the source, it will change the
1749 * backing_object's type to OBJT_DEFAULT.
1754 OFF_TO_IDX(object->backing_object_offset), TRUE);
1757 * Free any cached pages from backing_object.
1759 if (__predict_false(
1760 !vm_object_cache_is_empty(backing_object)))
1761 vm_page_cache_free(backing_object, 0, 0);
1764 * Object now shadows whatever backing_object did.
1765 * Note that the reference to
1766 * backing_object->backing_object moves from within
1767 * backing_object to within object.
1769 LIST_REMOVE(object, shadow_list);
1770 backing_object->shadow_count--;
1771 if (backing_object->backing_object) {
1772 VM_OBJECT_WLOCK(backing_object->backing_object);
1773 LIST_REMOVE(backing_object, shadow_list);
1775 &backing_object->backing_object->shadow_head,
1776 object, shadow_list);
1778 * The shadow_count has not changed.
1780 VM_OBJECT_WUNLOCK(backing_object->backing_object);
1782 object->backing_object = backing_object->backing_object;
1783 object->backing_object_offset +=
1784 backing_object->backing_object_offset;
1787 * Discard backing_object.
1789 * Since the backing object has no pages, no pager left,
1790 * and no object references within it, all that is
1791 * necessary is to dispose of it.
1793 KASSERT(backing_object->ref_count == 1, (
1794 "backing_object %p was somehow re-referenced during collapse!",
1796 backing_object->type = OBJT_DEAD;
1797 backing_object->ref_count = 0;
1798 VM_OBJECT_WUNLOCK(backing_object);
1799 vm_object_destroy(backing_object);
1803 vm_object_t new_backing_object;
1806 * If we do not entirely shadow the backing object,
1807 * there is nothing we can do so we give up.
1809 if (object->resident_page_count != object->size &&
1810 !vm_object_backing_scan(object,
1811 OBSC_TEST_ALL_SHADOWED)) {
1812 VM_OBJECT_WUNLOCK(backing_object);
1817 * Make the parent shadow the next object in the
1818 * chain. Deallocating backing_object will not remove
1819 * it, since its reference count is at least 2.
1821 LIST_REMOVE(object, shadow_list);
1822 backing_object->shadow_count--;
1824 new_backing_object = backing_object->backing_object;
1825 if ((object->backing_object = new_backing_object) != NULL) {
1826 VM_OBJECT_WLOCK(new_backing_object);
1828 &new_backing_object->shadow_head,
1832 new_backing_object->shadow_count++;
1833 vm_object_reference_locked(new_backing_object);
1834 VM_OBJECT_WUNLOCK(new_backing_object);
1835 object->backing_object_offset +=
1836 backing_object->backing_object_offset;
1840 * Drop the reference count on backing_object. Since
1841 * its ref_count was at least 2, it will not vanish.
1843 backing_object->ref_count--;
1844 VM_OBJECT_WUNLOCK(backing_object);
1849 * Try again with this object's new backing object.
1855 * vm_object_page_remove:
1857 * For the given object, either frees or invalidates each of the
1858 * specified pages. In general, a page is freed. However, if a page is
1859 * wired for any reason other than the existence of a managed, wired
1860 * mapping, then it may be invalidated but not removed from the object.
1861 * Pages are specified by the given range ["start", "end") and the option
1862 * OBJPR_CLEANONLY. As a special case, if "end" is zero, then the range
1863 * extends from "start" to the end of the object. If the option
1864 * OBJPR_CLEANONLY is specified, then only the non-dirty pages within the
1865 * specified range are affected. If the option OBJPR_NOTMAPPED is
1866 * specified, then the pages within the specified range must have no
1867 * mappings. Otherwise, if this option is not specified, any mappings to
1868 * the specified pages are removed before the pages are freed or
1871 * In general, this operation should only be performed on objects that
1872 * contain managed pages. There are, however, two exceptions. First, it
1873 * is performed on the kernel and kmem objects by vm_map_entry_delete().
1874 * Second, it is used by msync(..., MS_INVALIDATE) to invalidate device-
1875 * backed pages. In both of these cases, the option OBJPR_CLEANONLY must
1876 * not be specified and the option OBJPR_NOTMAPPED must be specified.
1878 * The object must be locked.
1881 vm_object_page_remove(vm_object_t object, vm_pindex_t start, vm_pindex_t end,
1886 VM_OBJECT_ASSERT_WLOCKED(object);
1887 KASSERT((object->flags & OBJ_UNMANAGED) == 0 ||
1888 (options & (OBJPR_CLEANONLY | OBJPR_NOTMAPPED)) == OBJPR_NOTMAPPED,
1889 ("vm_object_page_remove: illegal options for object %p", object));
1890 if (object->resident_page_count == 0)
1892 vm_object_pip_add(object, 1);
1894 p = vm_page_find_least(object, start);
1897 * Here, the variable "p" is either (1) the page with the least pindex
1898 * greater than or equal to the parameter "start" or (2) NULL.
1900 for (; p != NULL && (p->pindex < end || end == 0); p = next) {
1901 next = TAILQ_NEXT(p, listq);
1904 * If the page is wired for any reason besides the existence
1905 * of managed, wired mappings, then it cannot be freed. For
1906 * example, fictitious pages, which represent device memory,
1907 * are inherently wired and cannot be freed. They can,
1908 * however, be invalidated if the option OBJPR_CLEANONLY is
1912 if (vm_page_xbusied(p)) {
1913 VM_OBJECT_WUNLOCK(object);
1914 vm_page_busy_sleep(p, "vmopax");
1915 VM_OBJECT_WLOCK(object);
1918 if (p->wire_count != 0) {
1919 if ((options & OBJPR_NOTMAPPED) == 0)
1921 if ((options & OBJPR_CLEANONLY) == 0) {
1927 if (vm_page_busied(p)) {
1928 VM_OBJECT_WUNLOCK(object);
1929 vm_page_busy_sleep(p, "vmopar");
1930 VM_OBJECT_WLOCK(object);
1933 KASSERT((p->flags & PG_FICTITIOUS) == 0,
1934 ("vm_object_page_remove: page %p is fictitious", p));
1935 if ((options & OBJPR_CLEANONLY) != 0 && p->valid != 0) {
1936 if ((options & OBJPR_NOTMAPPED) == 0)
1937 pmap_remove_write(p);
1941 if ((options & OBJPR_NOTMAPPED) == 0)
1947 vm_object_pip_wakeup(object);
1949 if (__predict_false(!vm_object_cache_is_empty(object)))
1950 vm_page_cache_free(object, start, end);
1954 * vm_object_page_cache:
1956 * For the given object, attempt to move the specified clean
1957 * pages to the cache queue. If a page is wired for any reason,
1958 * then it will not be changed. Pages are specified by the given
1959 * range ["start", "end"). As a special case, if "end" is zero,
1960 * then the range extends from "start" to the end of the object.
1961 * Any mappings to the specified pages are removed before the
1962 * pages are moved to the cache queue.
1964 * This operation should only be performed on objects that
1965 * contain non-fictitious, managed pages.
1967 * The object must be locked.
1970 vm_object_page_cache(vm_object_t object, vm_pindex_t start, vm_pindex_t end)
1972 struct mtx *mtx, *new_mtx;
1975 VM_OBJECT_ASSERT_WLOCKED(object);
1976 KASSERT((object->flags & (OBJ_FICTITIOUS | OBJ_UNMANAGED)) == 0,
1977 ("vm_object_page_cache: illegal object %p", object));
1978 if (object->resident_page_count == 0)
1980 p = vm_page_find_least(object, start);
1983 * Here, the variable "p" is either (1) the page with the least pindex
1984 * greater than or equal to the parameter "start" or (2) NULL.
1987 for (; p != NULL && (p->pindex < end || end == 0); p = next) {
1988 next = TAILQ_NEXT(p, listq);
1991 * Avoid releasing and reacquiring the same page lock.
1993 new_mtx = vm_page_lockptr(p);
1994 if (mtx != new_mtx) {
2000 vm_page_try_to_cache(p);
2007 * Populate the specified range of the object with valid pages. Returns
2008 * TRUE if the range is successfully populated and FALSE otherwise.
2010 * Note: This function should be optimized to pass a larger array of
2011 * pages to vm_pager_get_pages() before it is applied to a non-
2012 * OBJT_DEVICE object.
2014 * The object must be locked.
2017 vm_object_populate(vm_object_t object, vm_pindex_t start, vm_pindex_t end)
2023 VM_OBJECT_ASSERT_WLOCKED(object);
2024 for (pindex = start; pindex < end; pindex++) {
2025 m = vm_page_grab(object, pindex, VM_ALLOC_NORMAL);
2026 if (m->valid != VM_PAGE_BITS_ALL) {
2028 rv = vm_pager_get_pages(object, ma, 1, 0);
2029 m = vm_page_lookup(object, pindex);
2032 if (rv != VM_PAGER_OK) {
2040 * Keep "m" busy because a subsequent iteration may unlock
2044 if (pindex > start) {
2045 m = vm_page_lookup(object, start);
2046 while (m != NULL && m->pindex < pindex) {
2048 m = TAILQ_NEXT(m, listq);
2051 return (pindex == end);
2055 * Routine: vm_object_coalesce
2056 * Function: Coalesces two objects backing up adjoining
2057 * regions of memory into a single object.
2059 * returns TRUE if objects were combined.
2061 * NOTE: Only works at the moment if the second object is NULL -
2062 * if it's not, which object do we lock first?
2065 * prev_object First object to coalesce
2066 * prev_offset Offset into prev_object
2067 * prev_size Size of reference to prev_object
2068 * next_size Size of reference to the second object
2069 * reserved Indicator that extension region has
2070 * swap accounted for
2073 * The object must *not* be locked.
2076 vm_object_coalesce(vm_object_t prev_object, vm_ooffset_t prev_offset,
2077 vm_size_t prev_size, vm_size_t next_size, boolean_t reserved)
2079 vm_pindex_t next_pindex;
2081 if (prev_object == NULL)
2083 VM_OBJECT_WLOCK(prev_object);
2084 if ((prev_object->type != OBJT_DEFAULT &&
2085 prev_object->type != OBJT_SWAP) ||
2086 (prev_object->flags & OBJ_TMPFS_NODE) != 0) {
2087 VM_OBJECT_WUNLOCK(prev_object);
2092 * Try to collapse the object first
2094 vm_object_collapse(prev_object);
2097 * Can't coalesce if: . more than one reference . paged out . shadows
2098 * another object . has a copy elsewhere (any of which mean that the
2099 * pages not mapped to prev_entry may be in use anyway)
2101 if (prev_object->backing_object != NULL) {
2102 VM_OBJECT_WUNLOCK(prev_object);
2106 prev_size >>= PAGE_SHIFT;
2107 next_size >>= PAGE_SHIFT;
2108 next_pindex = OFF_TO_IDX(prev_offset) + prev_size;
2110 if ((prev_object->ref_count > 1) &&
2111 (prev_object->size != next_pindex)) {
2112 VM_OBJECT_WUNLOCK(prev_object);
2117 * Account for the charge.
2119 if (prev_object->cred != NULL) {
2122 * If prev_object was charged, then this mapping,
2123 * althought not charged now, may become writable
2124 * later. Non-NULL cred in the object would prevent
2125 * swap reservation during enabling of the write
2126 * access, so reserve swap now. Failed reservation
2127 * cause allocation of the separate object for the map
2128 * entry, and swap reservation for this entry is
2129 * managed in appropriate time.
2131 if (!reserved && !swap_reserve_by_cred(ptoa(next_size),
2132 prev_object->cred)) {
2135 prev_object->charge += ptoa(next_size);
2139 * Remove any pages that may still be in the object from a previous
2142 if (next_pindex < prev_object->size) {
2143 vm_object_page_remove(prev_object, next_pindex, next_pindex +
2145 if (prev_object->type == OBJT_SWAP)
2146 swap_pager_freespace(prev_object,
2147 next_pindex, next_size);
2149 if (prev_object->cred != NULL) {
2150 KASSERT(prev_object->charge >=
2151 ptoa(prev_object->size - next_pindex),
2152 ("object %p overcharged 1 %jx %jx", prev_object,
2153 (uintmax_t)next_pindex, (uintmax_t)next_size));
2154 prev_object->charge -= ptoa(prev_object->size -
2161 * Extend the object if necessary.
2163 if (next_pindex + next_size > prev_object->size)
2164 prev_object->size = next_pindex + next_size;
2166 VM_OBJECT_WUNLOCK(prev_object);
2171 vm_object_set_writeable_dirty(vm_object_t object)
2174 VM_OBJECT_ASSERT_WLOCKED(object);
2175 if (object->type != OBJT_VNODE) {
2176 if ((object->flags & OBJ_TMPFS_NODE) != 0) {
2177 KASSERT(object->type == OBJT_SWAP, ("non-swap tmpfs"));
2178 vm_object_set_flag(object, OBJ_TMPFS_DIRTY);
2182 object->generation++;
2183 if ((object->flags & OBJ_MIGHTBEDIRTY) != 0)
2185 vm_object_set_flag(object, OBJ_MIGHTBEDIRTY);
2191 * For each page offset within the specified range of the given object,
2192 * find the highest-level page in the shadow chain and unwire it. A page
2193 * must exist at every page offset, and the highest-level page must be
2197 vm_object_unwire(vm_object_t object, vm_ooffset_t offset, vm_size_t length,
2200 vm_object_t tobject;
2202 vm_pindex_t end_pindex, pindex, tpindex;
2203 int depth, locked_depth;
2205 KASSERT((offset & PAGE_MASK) == 0,
2206 ("vm_object_unwire: offset is not page aligned"));
2207 KASSERT((length & PAGE_MASK) == 0,
2208 ("vm_object_unwire: length is not a multiple of PAGE_SIZE"));
2209 /* The wired count of a fictitious page never changes. */
2210 if ((object->flags & OBJ_FICTITIOUS) != 0)
2212 pindex = OFF_TO_IDX(offset);
2213 end_pindex = pindex + atop(length);
2215 VM_OBJECT_RLOCK(object);
2216 m = vm_page_find_least(object, pindex);
2217 while (pindex < end_pindex) {
2218 if (m == NULL || pindex < m->pindex) {
2220 * The first object in the shadow chain doesn't
2221 * contain a page at the current index. Therefore,
2222 * the page must exist in a backing object.
2229 OFF_TO_IDX(tobject->backing_object_offset);
2230 tobject = tobject->backing_object;
2231 KASSERT(tobject != NULL,
2232 ("vm_object_unwire: missing page"));
2233 if ((tobject->flags & OBJ_FICTITIOUS) != 0)
2236 if (depth == locked_depth) {
2238 VM_OBJECT_RLOCK(tobject);
2240 } while ((tm = vm_page_lookup(tobject, tpindex)) ==
2244 m = TAILQ_NEXT(m, listq);
2247 vm_page_unwire(tm, queue);
2252 /* Release the accumulated object locks. */
2253 for (depth = 0; depth < locked_depth; depth++) {
2254 tobject = object->backing_object;
2255 VM_OBJECT_RUNLOCK(object);
2261 vm_object_vnode(vm_object_t object)
2264 VM_OBJECT_ASSERT_LOCKED(object);
2265 if (object->type == OBJT_VNODE)
2266 return (object->handle);
2267 if (object->type == OBJT_SWAP && (object->flags & OBJ_TMPFS) != 0)
2268 return (object->un_pager.swp.swp_tmpfs);
2273 sysctl_vm_object_list(SYSCTL_HANDLER_ARGS)
2275 struct kinfo_vmobject kvo;
2276 char *fullpath, *freepath;
2283 if (req->oldptr == NULL) {
2285 * If an old buffer has not been provided, generate an
2286 * estimate of the space needed for a subsequent call.
2288 mtx_lock(&vm_object_list_mtx);
2290 TAILQ_FOREACH(obj, &vm_object_list, object_list) {
2291 if (obj->type == OBJT_DEAD)
2295 mtx_unlock(&vm_object_list_mtx);
2296 return (SYSCTL_OUT(req, NULL, sizeof(struct kinfo_vmobject) *
2303 * VM objects are type stable and are never removed from the
2304 * list once added. This allows us to safely read obj->object_list
2305 * after reacquiring the VM object lock.
2307 mtx_lock(&vm_object_list_mtx);
2308 TAILQ_FOREACH(obj, &vm_object_list, object_list) {
2309 if (obj->type == OBJT_DEAD)
2311 VM_OBJECT_RLOCK(obj);
2312 if (obj->type == OBJT_DEAD) {
2313 VM_OBJECT_RUNLOCK(obj);
2316 mtx_unlock(&vm_object_list_mtx);
2317 kvo.kvo_size = ptoa(obj->size);
2318 kvo.kvo_resident = obj->resident_page_count;
2319 kvo.kvo_ref_count = obj->ref_count;
2320 kvo.kvo_shadow_count = obj->shadow_count;
2321 kvo.kvo_memattr = obj->memattr;
2323 kvo.kvo_inactive = 0;
2324 TAILQ_FOREACH(m, &obj->memq, listq) {
2326 * A page may belong to the object but be
2327 * dequeued and set to PQ_NONE while the
2328 * object lock is not held. This makes the
2329 * reads of m->queue below racy, and we do not
2330 * count pages set to PQ_NONE. However, this
2331 * sysctl is only meant to give an
2332 * approximation of the system anyway.
2334 if (m->queue == PQ_ACTIVE)
2336 else if (m->queue == PQ_INACTIVE)
2340 kvo.kvo_vn_fileid = 0;
2341 kvo.kvo_vn_fsid = 0;
2345 switch (obj->type) {
2347 kvo.kvo_type = KVME_TYPE_DEFAULT;
2350 kvo.kvo_type = KVME_TYPE_VNODE;
2355 kvo.kvo_type = KVME_TYPE_SWAP;
2358 kvo.kvo_type = KVME_TYPE_DEVICE;
2361 kvo.kvo_type = KVME_TYPE_PHYS;
2364 kvo.kvo_type = KVME_TYPE_DEAD;
2367 kvo.kvo_type = KVME_TYPE_SG;
2369 case OBJT_MGTDEVICE:
2370 kvo.kvo_type = KVME_TYPE_MGTDEVICE;
2373 kvo.kvo_type = KVME_TYPE_UNKNOWN;
2376 VM_OBJECT_RUNLOCK(obj);
2378 vn_fullpath(curthread, vp, &fullpath, &freepath);
2379 vn_lock(vp, LK_SHARED | LK_RETRY);
2380 if (VOP_GETATTR(vp, &va, curthread->td_ucred) == 0) {
2381 kvo.kvo_vn_fileid = va.va_fileid;
2382 kvo.kvo_vn_fsid = va.va_fsid;
2387 strlcpy(kvo.kvo_path, fullpath, sizeof(kvo.kvo_path));
2388 if (freepath != NULL)
2389 free(freepath, M_TEMP);
2391 /* Pack record size down */
2392 kvo.kvo_structsize = offsetof(struct kinfo_vmobject, kvo_path) +
2393 strlen(kvo.kvo_path) + 1;
2394 kvo.kvo_structsize = roundup(kvo.kvo_structsize,
2396 error = SYSCTL_OUT(req, &kvo, kvo.kvo_structsize);
2397 mtx_lock(&vm_object_list_mtx);
2401 mtx_unlock(&vm_object_list_mtx);
2404 SYSCTL_PROC(_vm, OID_AUTO, objects, CTLTYPE_STRUCT | CTLFLAG_RW | CTLFLAG_SKIP |
2405 CTLFLAG_MPSAFE, NULL, 0, sysctl_vm_object_list, "S,kinfo_vmobject",
2406 "List of VM objects");
2408 #include "opt_ddb.h"
2410 #include <sys/kernel.h>
2412 #include <sys/cons.h>
2414 #include <ddb/ddb.h>
2417 _vm_object_in_map(vm_map_t map, vm_object_t object, vm_map_entry_t entry)
2420 vm_map_entry_t tmpe;
2428 tmpe = map->header.next;
2429 entcount = map->nentries;
2430 while (entcount-- && (tmpe != &map->header)) {
2431 if (_vm_object_in_map(map, object, tmpe)) {
2436 } else if (entry->eflags & MAP_ENTRY_IS_SUB_MAP) {
2437 tmpm = entry->object.sub_map;
2438 tmpe = tmpm->header.next;
2439 entcount = tmpm->nentries;
2440 while (entcount-- && tmpe != &tmpm->header) {
2441 if (_vm_object_in_map(tmpm, object, tmpe)) {
2446 } else if ((obj = entry->object.vm_object) != NULL) {
2447 for (; obj; obj = obj->backing_object)
2448 if (obj == object) {
2456 vm_object_in_map(vm_object_t object)
2460 /* sx_slock(&allproc_lock); */
2461 FOREACH_PROC_IN_SYSTEM(p) {
2462 if (!p->p_vmspace /* || (p->p_flag & (P_SYSTEM|P_WEXIT)) */)
2464 if (_vm_object_in_map(&p->p_vmspace->vm_map, object, 0)) {
2465 /* sx_sunlock(&allproc_lock); */
2469 /* sx_sunlock(&allproc_lock); */
2470 if (_vm_object_in_map(kernel_map, object, 0))
2475 DB_SHOW_COMMAND(vmochk, vm_object_check)
2480 * make sure that internal objs are in a map somewhere
2481 * and none have zero ref counts.
2483 TAILQ_FOREACH(object, &vm_object_list, object_list) {
2484 if (object->handle == NULL &&
2485 (object->type == OBJT_DEFAULT || object->type == OBJT_SWAP)) {
2486 if (object->ref_count == 0) {
2487 db_printf("vmochk: internal obj has zero ref count: %ld\n",
2488 (long)object->size);
2490 if (!vm_object_in_map(object)) {
2492 "vmochk: internal obj is not in a map: "
2493 "ref: %d, size: %lu: 0x%lx, backing_object: %p\n",
2494 object->ref_count, (u_long)object->size,
2495 (u_long)object->size,
2496 (void *)object->backing_object);
2503 * vm_object_print: [ debug ]
2505 DB_SHOW_COMMAND(object, vm_object_print_static)
2507 /* XXX convert args. */
2508 vm_object_t object = (vm_object_t)addr;
2509 boolean_t full = have_addr;
2513 /* XXX count is an (unused) arg. Avoid shadowing it. */
2514 #define count was_count
2522 "Object %p: type=%d, size=0x%jx, res=%d, ref=%d, flags=0x%x ruid %d charge %jx\n",
2523 object, (int)object->type, (uintmax_t)object->size,
2524 object->resident_page_count, object->ref_count, object->flags,
2525 object->cred ? object->cred->cr_ruid : -1, (uintmax_t)object->charge);
2526 db_iprintf(" sref=%d, backing_object(%d)=(%p)+0x%jx\n",
2527 object->shadow_count,
2528 object->backing_object ? object->backing_object->ref_count : 0,
2529 object->backing_object, (uintmax_t)object->backing_object_offset);
2536 TAILQ_FOREACH(p, &object->memq, listq) {
2538 db_iprintf("memory:=");
2539 else if (count == 6) {
2547 db_printf("(off=0x%jx,page=0x%jx)",
2548 (uintmax_t)p->pindex, (uintmax_t)VM_PAGE_TO_PHYS(p));
2558 /* XXX need this non-static entry for calling from vm_map_print. */
2561 /* db_expr_t */ long addr,
2562 boolean_t have_addr,
2563 /* db_expr_t */ long count,
2566 vm_object_print_static(addr, have_addr, count, modif);
2569 DB_SHOW_COMMAND(vmopag, vm_object_print_pages)
2574 vm_page_t m, prev_m;
2578 TAILQ_FOREACH(object, &vm_object_list, object_list) {
2579 db_printf("new object: %p\n", (void *)object);
2590 TAILQ_FOREACH(m, &object->memq, listq) {
2591 if (m->pindex > 128)
2593 if ((prev_m = TAILQ_PREV(m, pglist, listq)) != NULL &&
2594 prev_m->pindex + 1 != m->pindex) {
2596 db_printf(" index(%ld)run(%d)pa(0x%lx)\n",
2597 (long)fidx, rcount, (long)pa);
2609 (VM_PAGE_TO_PHYS(m) == pa + rcount * PAGE_SIZE)) {
2614 db_printf(" index(%ld)run(%d)pa(0x%lx)\n",
2615 (long)fidx, rcount, (long)pa);
2625 pa = VM_PAGE_TO_PHYS(m);
2629 db_printf(" index(%ld)run(%d)pa(0x%lx)\n",
2630 (long)fidx, rcount, (long)pa);