2 * SPDX-License-Identifier: (BSD-3-Clause AND MIT-CMU)
4 * Copyright (c) 1991, 1993
5 * The Regents of the University of California. All rights reserved.
7 * This code is derived from software contributed to Berkeley by
8 * The Mach Operating System project at Carnegie-Mellon University.
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
18 * 3. Neither the name of the University nor the names of its contributors
19 * may be used to endorse or promote products derived from this software
20 * without specific prior written permission.
22 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 * from: @(#)vm_object.c 8.5 (Berkeley) 3/22/94
37 * Copyright (c) 1987, 1990 Carnegie-Mellon University.
38 * All rights reserved.
40 * Authors: Avadis Tevanian, Jr., Michael Wayne Young
42 * Permission to use, copy, modify and distribute this software and
43 * its documentation is hereby granted, provided that both the copyright
44 * notice and this permission notice appear in all copies of the
45 * software, derivative works or modified versions, and any portions
46 * thereof, and that both notices appear in supporting documentation.
48 * CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS"
49 * CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND
50 * FOR ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
52 * Carnegie Mellon requests users of this software to return to
54 * Software Distribution Coordinator or Software.Distribution@CS.CMU.EDU
55 * School of Computer Science
56 * Carnegie Mellon University
57 * Pittsburgh PA 15213-3890
59 * any improvements or extensions that they make and grant Carnegie the
60 * rights to redistribute these changes.
64 * Virtual memory object module.
67 #include <sys/cdefs.h>
68 __FBSDID("$FreeBSD$");
72 #include <sys/param.h>
73 #include <sys/systm.h>
74 #include <sys/cpuset.h>
77 #include <sys/mount.h>
78 #include <sys/kernel.h>
79 #include <sys/pctrie.h>
80 #include <sys/sysctl.h>
81 #include <sys/mutex.h>
82 #include <sys/proc.h> /* for curproc, pageproc */
83 #include <sys/socket.h>
84 #include <sys/resourcevar.h>
85 #include <sys/rwlock.h>
87 #include <sys/vnode.h>
88 #include <sys/vmmeter.h>
92 #include <vm/vm_param.h>
94 #include <vm/vm_map.h>
95 #include <vm/vm_object.h>
96 #include <vm/vm_page.h>
97 #include <vm/vm_pageout.h>
98 #include <vm/vm_pager.h>
99 #include <vm/vm_phys.h>
100 #include <vm/vm_pagequeue.h>
101 #include <vm/swap_pager.h>
102 #include <vm/vm_kern.h>
103 #include <vm/vm_extern.h>
104 #include <vm/vm_radix.h>
105 #include <vm/vm_reserv.h>
108 static int old_msync;
109 SYSCTL_INT(_vm, OID_AUTO, old_msync, CTLFLAG_RW, &old_msync, 0,
110 "Use old (insecure) msync behavior");
112 static int vm_object_page_collect_flush(vm_object_t object, vm_page_t p,
113 int pagerflags, int flags, boolean_t *clearobjflags,
115 static boolean_t vm_object_page_remove_write(vm_page_t p, int flags,
116 boolean_t *clearobjflags);
117 static void vm_object_qcollapse(vm_object_t object);
118 static void vm_object_vndeallocate(vm_object_t object);
121 * Virtual memory objects maintain the actual data
122 * associated with allocated virtual memory. A given
123 * page of memory exists within exactly one object.
125 * An object is only deallocated when all "references"
126 * are given up. Only one "reference" to a given
127 * region of an object should be writeable.
129 * Associated with each object is a list of all resident
130 * memory pages belonging to that object; this list is
131 * maintained by the "vm_page" module, and locked by the object's
134 * Each object also records a "pager" routine which is
135 * used to retrieve (and store) pages to the proper backing
136 * storage. In addition, objects may be backed by other
137 * objects from which they were virtual-copied.
139 * The only items within the object structure which are
140 * modified after time of creation are:
141 * reference count locked by object's lock
142 * pager routine locked by object's lock
146 struct object_q vm_object_list;
147 struct mtx vm_object_list_mtx; /* lock for object list and count */
149 struct vm_object kernel_object_store;
151 static SYSCTL_NODE(_vm_stats, OID_AUTO, object, CTLFLAG_RD, 0,
154 static counter_u64_t object_collapses = EARLY_COUNTER;
155 SYSCTL_COUNTER_U64(_vm_stats_object, OID_AUTO, collapses, CTLFLAG_RD,
157 "VM object collapses");
159 static counter_u64_t object_bypasses = EARLY_COUNTER;
160 SYSCTL_COUNTER_U64(_vm_stats_object, OID_AUTO, bypasses, CTLFLAG_RD,
162 "VM object bypasses");
165 counter_startup(void)
168 object_collapses = counter_u64_alloc(M_WAITOK);
169 object_bypasses = counter_u64_alloc(M_WAITOK);
171 SYSINIT(object_counters, SI_SUB_CPU, SI_ORDER_ANY, counter_startup, NULL);
173 static uma_zone_t obj_zone;
175 static int vm_object_zinit(void *mem, int size, int flags);
178 static void vm_object_zdtor(void *mem, int size, void *arg);
181 vm_object_zdtor(void *mem, int size, void *arg)
185 object = (vm_object_t)mem;
186 KASSERT(object->ref_count == 0,
187 ("object %p ref_count = %d", object, object->ref_count));
188 KASSERT(TAILQ_EMPTY(&object->memq),
189 ("object %p has resident pages in its memq", object));
190 KASSERT(vm_radix_is_empty(&object->rtree),
191 ("object %p has resident pages in its trie", object));
192 #if VM_NRESERVLEVEL > 0
193 KASSERT(LIST_EMPTY(&object->rvq),
194 ("object %p has reservations",
197 KASSERT(object->paging_in_progress == 0,
198 ("object %p paging_in_progress = %d",
199 object, object->paging_in_progress));
200 KASSERT(object->resident_page_count == 0,
201 ("object %p resident_page_count = %d",
202 object, object->resident_page_count));
203 KASSERT(object->shadow_count == 0,
204 ("object %p shadow_count = %d",
205 object, object->shadow_count));
206 KASSERT(object->type == OBJT_DEAD,
207 ("object %p has non-dead type %d",
208 object, object->type));
213 vm_object_zinit(void *mem, int size, int flags)
217 object = (vm_object_t)mem;
218 rw_init_flags(&object->lock, "vm object", RW_DUPOK | RW_NEW);
220 /* These are true for any object that has been freed */
221 object->type = OBJT_DEAD;
222 object->ref_count = 0;
223 vm_radix_init(&object->rtree);
224 object->paging_in_progress = 0;
225 object->resident_page_count = 0;
226 object->shadow_count = 0;
227 object->flags = OBJ_DEAD;
229 mtx_lock(&vm_object_list_mtx);
230 TAILQ_INSERT_TAIL(&vm_object_list, object, object_list);
231 mtx_unlock(&vm_object_list_mtx);
236 _vm_object_allocate(objtype_t type, vm_pindex_t size, vm_object_t object)
239 TAILQ_INIT(&object->memq);
240 LIST_INIT(&object->shadow_head);
243 if (type == OBJT_SWAP)
244 pctrie_init(&object->un_pager.swp.swp_blks);
247 * Ensure that swap_pager_swapoff() iteration over object_list
248 * sees up to date type and pctrie head if it observed
251 atomic_thread_fence_rel();
255 panic("_vm_object_allocate: can't create OBJT_DEAD");
258 object->flags = OBJ_ONEMAPPING;
262 object->flags = OBJ_FICTITIOUS | OBJ_UNMANAGED;
265 object->flags = OBJ_FICTITIOUS;
268 object->flags = OBJ_UNMANAGED;
274 panic("_vm_object_allocate: type %d is undefined", type);
277 object->domain.dr_policy = NULL;
278 object->generation = 1;
279 object->ref_count = 1;
280 object->memattr = VM_MEMATTR_DEFAULT;
283 object->handle = NULL;
284 object->backing_object = NULL;
285 object->backing_object_offset = (vm_ooffset_t) 0;
286 #if VM_NRESERVLEVEL > 0
287 LIST_INIT(&object->rvq);
289 umtx_shm_object_init(object);
295 * Initialize the VM objects module.
300 TAILQ_INIT(&vm_object_list);
301 mtx_init(&vm_object_list_mtx, "vm object_list", NULL, MTX_DEF);
303 rw_init(&kernel_object->lock, "kernel vm object");
304 _vm_object_allocate(OBJT_PHYS, atop(VM_MAX_KERNEL_ADDRESS -
305 VM_MIN_KERNEL_ADDRESS), kernel_object);
306 #if VM_NRESERVLEVEL > 0
307 kernel_object->flags |= OBJ_COLORED;
308 kernel_object->pg_color = (u_short)atop(VM_MIN_KERNEL_ADDRESS);
312 * The lock portion of struct vm_object must be type stable due
313 * to vm_pageout_fallback_object_lock locking a vm object
314 * without holding any references to it.
316 obj_zone = uma_zcreate("VM OBJECT", sizeof (struct vm_object), NULL,
322 vm_object_zinit, NULL, UMA_ALIGN_PTR, UMA_ZONE_NOFREE);
328 vm_object_clear_flag(vm_object_t object, u_short bits)
331 VM_OBJECT_ASSERT_WLOCKED(object);
332 object->flags &= ~bits;
336 * Sets the default memory attribute for the specified object. Pages
337 * that are allocated to this object are by default assigned this memory
340 * Presently, this function must be called before any pages are allocated
341 * to the object. In the future, this requirement may be relaxed for
342 * "default" and "swap" objects.
345 vm_object_set_memattr(vm_object_t object, vm_memattr_t memattr)
348 VM_OBJECT_ASSERT_WLOCKED(object);
349 switch (object->type) {
357 if (!TAILQ_EMPTY(&object->memq))
358 return (KERN_FAILURE);
361 return (KERN_INVALID_ARGUMENT);
363 panic("vm_object_set_memattr: object %p is of undefined type",
366 object->memattr = memattr;
367 return (KERN_SUCCESS);
371 vm_object_pip_add(vm_object_t object, short i)
374 VM_OBJECT_ASSERT_WLOCKED(object);
375 object->paging_in_progress += i;
379 vm_object_pip_subtract(vm_object_t object, short i)
382 VM_OBJECT_ASSERT_WLOCKED(object);
383 object->paging_in_progress -= i;
387 vm_object_pip_wakeup(vm_object_t object)
390 VM_OBJECT_ASSERT_WLOCKED(object);
391 object->paging_in_progress--;
392 if ((object->flags & OBJ_PIPWNT) && object->paging_in_progress == 0) {
393 vm_object_clear_flag(object, OBJ_PIPWNT);
399 vm_object_pip_wakeupn(vm_object_t object, short i)
402 VM_OBJECT_ASSERT_WLOCKED(object);
404 object->paging_in_progress -= i;
405 if ((object->flags & OBJ_PIPWNT) && object->paging_in_progress == 0) {
406 vm_object_clear_flag(object, OBJ_PIPWNT);
412 vm_object_pip_wait(vm_object_t object, char *waitid)
415 VM_OBJECT_ASSERT_WLOCKED(object);
416 while (object->paging_in_progress) {
417 object->flags |= OBJ_PIPWNT;
418 VM_OBJECT_SLEEP(object, object, PVM, waitid, 0);
423 * vm_object_allocate:
425 * Returns a new object with the given size.
428 vm_object_allocate(objtype_t type, vm_pindex_t size)
432 object = (vm_object_t)uma_zalloc(obj_zone, M_WAITOK);
433 _vm_object_allocate(type, size, object);
439 * vm_object_reference:
441 * Gets another reference to the given object. Note: OBJ_DEAD
442 * objects can be referenced during final cleaning.
445 vm_object_reference(vm_object_t object)
449 VM_OBJECT_WLOCK(object);
450 vm_object_reference_locked(object);
451 VM_OBJECT_WUNLOCK(object);
455 * vm_object_reference_locked:
457 * Gets another reference to the given object.
459 * The object must be locked.
462 vm_object_reference_locked(vm_object_t object)
466 VM_OBJECT_ASSERT_WLOCKED(object);
468 if (object->type == OBJT_VNODE) {
475 * Handle deallocating an object of type OBJT_VNODE.
478 vm_object_vndeallocate(vm_object_t object)
480 struct vnode *vp = (struct vnode *) object->handle;
482 VM_OBJECT_ASSERT_WLOCKED(object);
483 KASSERT(object->type == OBJT_VNODE,
484 ("vm_object_vndeallocate: not a vnode object"));
485 KASSERT(vp != NULL, ("vm_object_vndeallocate: missing vp"));
487 if (object->ref_count == 0) {
488 vn_printf(vp, "vm_object_vndeallocate ");
489 panic("vm_object_vndeallocate: bad object reference count");
493 if (!umtx_shm_vnobj_persistent && object->ref_count == 1)
494 umtx_shm_object_terminated(object);
498 /* vrele may need the vnode lock. */
499 VM_OBJECT_WUNLOCK(object);
504 * vm_object_deallocate:
506 * Release a reference to the specified object,
507 * gained either through a vm_object_allocate
508 * or a vm_object_reference call. When all references
509 * are gone, storage associated with this object
510 * may be relinquished.
512 * No object may be locked.
515 vm_object_deallocate(vm_object_t object)
519 while (object != NULL) {
520 VM_OBJECT_WLOCK(object);
521 if (object->type == OBJT_VNODE) {
522 vm_object_vndeallocate(object);
526 KASSERT(object->ref_count != 0,
527 ("vm_object_deallocate: object deallocated too many times: %d", object->type));
530 * If the reference count goes to 0 we start calling
531 * vm_object_terminate() on the object chain.
532 * A ref count of 1 may be a special case depending on the
533 * shadow count being 0 or 1.
536 if (object->ref_count > 1) {
537 VM_OBJECT_WUNLOCK(object);
539 } else if (object->ref_count == 1) {
540 if (object->shadow_count == 0 &&
541 object->handle == NULL &&
542 (object->type == OBJT_DEFAULT ||
543 (object->type == OBJT_SWAP &&
544 (object->flags & OBJ_TMPFS_NODE) == 0))) {
545 vm_object_set_flag(object, OBJ_ONEMAPPING);
546 } else if ((object->shadow_count == 1) &&
547 (object->handle == NULL) &&
548 (object->type == OBJT_DEFAULT ||
549 object->type == OBJT_SWAP)) {
552 robject = LIST_FIRST(&object->shadow_head);
553 KASSERT(robject != NULL,
554 ("vm_object_deallocate: ref_count: %d, shadow_count: %d",
556 object->shadow_count));
557 KASSERT((robject->flags & OBJ_TMPFS_NODE) == 0,
558 ("shadowed tmpfs v_object %p", object));
559 if (!VM_OBJECT_TRYWLOCK(robject)) {
561 * Avoid a potential deadlock.
564 VM_OBJECT_WUNLOCK(object);
566 * More likely than not the thread
567 * holding robject's lock has lower
568 * priority than the current thread.
569 * Let the lower priority thread run.
575 * Collapse object into its shadow unless its
576 * shadow is dead. In that case, object will
577 * be deallocated by the thread that is
578 * deallocating its shadow.
580 if ((robject->flags & OBJ_DEAD) == 0 &&
581 (robject->handle == NULL) &&
582 (robject->type == OBJT_DEFAULT ||
583 robject->type == OBJT_SWAP)) {
585 robject->ref_count++;
587 if (robject->paging_in_progress) {
588 VM_OBJECT_WUNLOCK(object);
589 vm_object_pip_wait(robject,
591 temp = robject->backing_object;
592 if (object == temp) {
593 VM_OBJECT_WLOCK(object);
596 } else if (object->paging_in_progress) {
597 VM_OBJECT_WUNLOCK(robject);
598 object->flags |= OBJ_PIPWNT;
599 VM_OBJECT_SLEEP(object, object,
600 PDROP | PVM, "objde2", 0);
601 VM_OBJECT_WLOCK(robject);
602 temp = robject->backing_object;
603 if (object == temp) {
604 VM_OBJECT_WLOCK(object);
608 VM_OBJECT_WUNLOCK(object);
610 if (robject->ref_count == 1) {
611 robject->ref_count--;
616 vm_object_collapse(object);
617 VM_OBJECT_WUNLOCK(object);
620 VM_OBJECT_WUNLOCK(robject);
622 VM_OBJECT_WUNLOCK(object);
626 umtx_shm_object_terminated(object);
627 temp = object->backing_object;
629 KASSERT((object->flags & OBJ_TMPFS_NODE) == 0,
630 ("shadowed tmpfs v_object 2 %p", object));
631 VM_OBJECT_WLOCK(temp);
632 LIST_REMOVE(object, shadow_list);
633 temp->shadow_count--;
634 VM_OBJECT_WUNLOCK(temp);
635 object->backing_object = NULL;
638 * Don't double-terminate, we could be in a termination
639 * recursion due to the terminate having to sync data
642 if ((object->flags & OBJ_DEAD) == 0)
643 vm_object_terminate(object);
645 VM_OBJECT_WUNLOCK(object);
651 * vm_object_destroy removes the object from the global object list
652 * and frees the space for the object.
655 vm_object_destroy(vm_object_t object)
659 * Release the allocation charge.
661 if (object->cred != NULL) {
662 swap_release_by_cred(object->charge, object->cred);
664 crfree(object->cred);
669 * Free the space for the object.
671 uma_zfree(obj_zone, object);
675 * vm_object_terminate_pages removes any remaining pageable pages
676 * from the object and resets the object to an empty state.
679 vm_object_terminate_pages(vm_object_t object)
684 VM_OBJECT_ASSERT_WLOCKED(object);
689 * Free any remaining pageable pages. This also removes them from the
690 * paging queues. However, don't free wired pages, just remove them
691 * from the object. Rather than incrementally removing each page from
692 * the object, the page and object are reset to any empty state.
694 TAILQ_FOREACH_SAFE(p, &object->memq, listq, p_next) {
695 vm_page_assert_unbusied(p);
696 if ((object->flags & OBJ_UNMANAGED) == 0)
698 * vm_page_free_prep() only needs the page
699 * lock for managed pages.
701 vm_page_change_lock(p, &mtx);
703 if (vm_page_wired(p))
712 * If the object contained any pages, then reset it to an empty state.
713 * None of the object's fields, including "resident_page_count", were
714 * modified by the preceding loop.
716 if (object->resident_page_count != 0) {
717 vm_radix_reclaim_allnodes(&object->rtree);
718 TAILQ_INIT(&object->memq);
719 object->resident_page_count = 0;
720 if (object->type == OBJT_VNODE)
721 vdrop(object->handle);
726 * vm_object_terminate actually destroys the specified object, freeing
727 * up all previously used resources.
729 * The object must be locked.
730 * This routine may block.
733 vm_object_terminate(vm_object_t object)
736 VM_OBJECT_ASSERT_WLOCKED(object);
739 * Make sure no one uses us.
741 vm_object_set_flag(object, OBJ_DEAD);
744 * wait for the pageout daemon to be done with the object
746 vm_object_pip_wait(object, "objtrm");
748 KASSERT(!object->paging_in_progress,
749 ("vm_object_terminate: pageout in progress"));
752 * Clean and free the pages, as appropriate. All references to the
753 * object are gone, so we don't need to lock it.
755 if (object->type == OBJT_VNODE) {
756 struct vnode *vp = (struct vnode *)object->handle;
759 * Clean pages and flush buffers.
761 vm_object_page_clean(object, 0, 0, OBJPC_SYNC);
762 VM_OBJECT_WUNLOCK(object);
764 vinvalbuf(vp, V_SAVE, 0, 0);
766 BO_LOCK(&vp->v_bufobj);
767 vp->v_bufobj.bo_flag |= BO_DEAD;
768 BO_UNLOCK(&vp->v_bufobj);
770 VM_OBJECT_WLOCK(object);
773 KASSERT(object->ref_count == 0,
774 ("vm_object_terminate: object with references, ref_count=%d",
777 if ((object->flags & OBJ_PG_DTOR) == 0)
778 vm_object_terminate_pages(object);
780 #if VM_NRESERVLEVEL > 0
781 if (__predict_false(!LIST_EMPTY(&object->rvq)))
782 vm_reserv_break_all(object);
785 KASSERT(object->cred == NULL || object->type == OBJT_DEFAULT ||
786 object->type == OBJT_SWAP,
787 ("%s: non-swap obj %p has cred", __func__, object));
790 * Let the pager know object is dead.
792 vm_pager_deallocate(object);
793 VM_OBJECT_WUNLOCK(object);
795 vm_object_destroy(object);
799 * Make the page read-only so that we can clear the object flags. However, if
800 * this is a nosync mmap then the object is likely to stay dirty so do not
801 * mess with the page and do not clear the object flags. Returns TRUE if the
802 * page should be flushed, and FALSE otherwise.
805 vm_object_page_remove_write(vm_page_t p, int flags, boolean_t *clearobjflags)
809 * If we have been asked to skip nosync pages and this is a
810 * nosync page, skip it. Note that the object flags were not
811 * cleared in this case so we do not have to set them.
813 if ((flags & OBJPC_NOSYNC) != 0 && (p->oflags & VPO_NOSYNC) != 0) {
814 *clearobjflags = FALSE;
817 pmap_remove_write(p);
818 return (p->dirty != 0);
823 * vm_object_page_clean
825 * Clean all dirty pages in the specified range of object. Leaves page
826 * on whatever queue it is currently on. If NOSYNC is set then do not
827 * write out pages with VPO_NOSYNC set (originally comes from MAP_NOSYNC),
828 * leaving the object dirty.
830 * When stuffing pages asynchronously, allow clustering. XXX we need a
831 * synchronous clustering mode implementation.
833 * Odd semantics: if start == end, we clean everything.
835 * The object must be locked.
837 * Returns FALSE if some page from the range was not written, as
838 * reported by the pager, and TRUE otherwise.
841 vm_object_page_clean(vm_object_t object, vm_ooffset_t start, vm_ooffset_t end,
845 vm_pindex_t pi, tend, tstart;
846 int curgeneration, n, pagerflags;
847 boolean_t clearobjflags, eio, res;
849 VM_OBJECT_ASSERT_WLOCKED(object);
852 * The OBJ_MIGHTBEDIRTY flag is only set for OBJT_VNODE
853 * objects. The check below prevents the function from
854 * operating on non-vnode objects.
856 if ((object->flags & OBJ_MIGHTBEDIRTY) == 0 ||
857 object->resident_page_count == 0)
860 pagerflags = (flags & (OBJPC_SYNC | OBJPC_INVAL)) != 0 ?
861 VM_PAGER_PUT_SYNC : VM_PAGER_CLUSTER_OK;
862 pagerflags |= (flags & OBJPC_INVAL) != 0 ? VM_PAGER_PUT_INVAL : 0;
864 tstart = OFF_TO_IDX(start);
865 tend = (end == 0) ? object->size : OFF_TO_IDX(end + PAGE_MASK);
866 clearobjflags = tstart == 0 && tend >= object->size;
870 curgeneration = object->generation;
872 for (p = vm_page_find_least(object, tstart); p != NULL; p = np) {
876 np = TAILQ_NEXT(p, listq);
879 if (vm_page_sleep_if_busy(p, "vpcwai")) {
880 if (object->generation != curgeneration) {
881 if ((flags & OBJPC_SYNC) != 0)
884 clearobjflags = FALSE;
886 np = vm_page_find_least(object, pi);
889 if (!vm_object_page_remove_write(p, flags, &clearobjflags))
892 n = vm_object_page_collect_flush(object, p, pagerflags,
893 flags, &clearobjflags, &eio);
896 clearobjflags = FALSE;
898 if (object->generation != curgeneration) {
899 if ((flags & OBJPC_SYNC) != 0)
902 clearobjflags = FALSE;
906 * If the VOP_PUTPAGES() did a truncated write, so
907 * that even the first page of the run is not fully
908 * written, vm_pageout_flush() returns 0 as the run
909 * length. Since the condition that caused truncated
910 * write may be permanent, e.g. exhausted free space,
911 * accepting n == 0 would cause an infinite loop.
913 * Forwarding the iterator leaves the unwritten page
914 * behind, but there is not much we can do there if
915 * filesystem refuses to write it.
919 clearobjflags = FALSE;
921 np = vm_page_find_least(object, pi + n);
924 VOP_FSYNC(vp, (pagerflags & VM_PAGER_PUT_SYNC) ? MNT_WAIT : 0);
928 vm_object_clear_flag(object, OBJ_MIGHTBEDIRTY);
933 vm_object_page_collect_flush(vm_object_t object, vm_page_t p, int pagerflags,
934 int flags, boolean_t *clearobjflags, boolean_t *eio)
936 vm_page_t ma[vm_pageout_page_count], p_first, tp;
937 int count, i, mreq, runlen;
939 vm_page_lock_assert(p, MA_NOTOWNED);
940 VM_OBJECT_ASSERT_WLOCKED(object);
945 for (tp = p; count < vm_pageout_page_count; count++) {
946 tp = vm_page_next(tp);
947 if (tp == NULL || vm_page_busied(tp))
949 if (!vm_object_page_remove_write(tp, flags, clearobjflags))
953 for (p_first = p; count < vm_pageout_page_count; count++) {
954 tp = vm_page_prev(p_first);
955 if (tp == NULL || vm_page_busied(tp))
957 if (!vm_object_page_remove_write(tp, flags, clearobjflags))
963 for (tp = p_first, i = 0; i < count; tp = TAILQ_NEXT(tp, listq), i++)
966 vm_pageout_flush(ma, count, pagerflags, mreq, &runlen, eio);
971 * Note that there is absolutely no sense in writing out
972 * anonymous objects, so we track down the vnode object
974 * We invalidate (remove) all pages from the address space
975 * for semantic correctness.
977 * If the backing object is a device object with unmanaged pages, then any
978 * mappings to the specified range of pages must be removed before this
979 * function is called.
981 * Note: certain anonymous maps, such as MAP_NOSYNC maps,
982 * may start out with a NULL object.
985 vm_object_sync(vm_object_t object, vm_ooffset_t offset, vm_size_t size,
986 boolean_t syncio, boolean_t invalidate)
988 vm_object_t backing_object;
991 int error, flags, fsync_after;
998 VM_OBJECT_WLOCK(object);
999 while ((backing_object = object->backing_object) != NULL) {
1000 VM_OBJECT_WLOCK(backing_object);
1001 offset += object->backing_object_offset;
1002 VM_OBJECT_WUNLOCK(object);
1003 object = backing_object;
1004 if (object->size < OFF_TO_IDX(offset + size))
1005 size = IDX_TO_OFF(object->size) - offset;
1008 * Flush pages if writing is allowed, invalidate them
1009 * if invalidation requested. Pages undergoing I/O
1010 * will be ignored by vm_object_page_remove().
1012 * We cannot lock the vnode and then wait for paging
1013 * to complete without deadlocking against vm_fault.
1014 * Instead we simply call vm_object_page_remove() and
1015 * allow it to block internally on a page-by-page
1016 * basis when it encounters pages undergoing async
1019 if (object->type == OBJT_VNODE &&
1020 (object->flags & OBJ_MIGHTBEDIRTY) != 0 &&
1021 ((vp = object->handle)->v_vflag & VV_NOSYNC) == 0) {
1022 VM_OBJECT_WUNLOCK(object);
1023 (void) vn_start_write(vp, &mp, V_WAIT);
1024 vn_lock(vp, LK_EXCLUSIVE | LK_RETRY);
1025 if (syncio && !invalidate && offset == 0 &&
1026 atop(size) == object->size) {
1028 * If syncing the whole mapping of the file,
1029 * it is faster to schedule all the writes in
1030 * async mode, also allowing the clustering,
1031 * and then wait for i/o to complete.
1036 flags = (syncio || invalidate) ? OBJPC_SYNC : 0;
1037 flags |= invalidate ? (OBJPC_SYNC | OBJPC_INVAL) : 0;
1038 fsync_after = FALSE;
1040 VM_OBJECT_WLOCK(object);
1041 res = vm_object_page_clean(object, offset, offset + size,
1043 VM_OBJECT_WUNLOCK(object);
1045 error = VOP_FSYNC(vp, MNT_WAIT, curthread);
1047 vn_finished_write(mp);
1050 VM_OBJECT_WLOCK(object);
1052 if ((object->type == OBJT_VNODE ||
1053 object->type == OBJT_DEVICE) && invalidate) {
1054 if (object->type == OBJT_DEVICE)
1056 * The option OBJPR_NOTMAPPED must be passed here
1057 * because vm_object_page_remove() cannot remove
1058 * unmanaged mappings.
1060 flags = OBJPR_NOTMAPPED;
1064 flags = OBJPR_CLEANONLY;
1065 vm_object_page_remove(object, OFF_TO_IDX(offset),
1066 OFF_TO_IDX(offset + size + PAGE_MASK), flags);
1068 VM_OBJECT_WUNLOCK(object);
1073 * Determine whether the given advice can be applied to the object. Advice is
1074 * not applied to unmanaged pages since they never belong to page queues, and
1075 * since MADV_FREE is destructive, it can apply only to anonymous pages that
1076 * have been mapped at most once.
1079 vm_object_advice_applies(vm_object_t object, int advice)
1082 if ((object->flags & OBJ_UNMANAGED) != 0)
1084 if (advice != MADV_FREE)
1086 return ((object->type == OBJT_DEFAULT || object->type == OBJT_SWAP) &&
1087 (object->flags & OBJ_ONEMAPPING) != 0);
1091 vm_object_madvise_freespace(vm_object_t object, int advice, vm_pindex_t pindex,
1095 if (advice == MADV_FREE && object->type == OBJT_SWAP)
1096 swap_pager_freespace(object, pindex, size);
1100 * vm_object_madvise:
1102 * Implements the madvise function at the object/page level.
1104 * MADV_WILLNEED (any object)
1106 * Activate the specified pages if they are resident.
1108 * MADV_DONTNEED (any object)
1110 * Deactivate the specified pages if they are resident.
1112 * MADV_FREE (OBJT_DEFAULT/OBJT_SWAP objects,
1113 * OBJ_ONEMAPPING only)
1115 * Deactivate and clean the specified pages if they are
1116 * resident. This permits the process to reuse the pages
1117 * without faulting or the kernel to reclaim the pages
1121 vm_object_madvise(vm_object_t object, vm_pindex_t pindex, vm_pindex_t end,
1124 vm_pindex_t tpindex;
1125 vm_object_t backing_object, tobject;
1132 VM_OBJECT_WLOCK(object);
1133 if (!vm_object_advice_applies(object, advice)) {
1134 VM_OBJECT_WUNLOCK(object);
1137 for (m = vm_page_find_least(object, pindex); pindex < end; pindex++) {
1141 * If the next page isn't resident in the top-level object, we
1142 * need to search the shadow chain. When applying MADV_FREE, we
1143 * take care to release any swap space used to store
1144 * non-resident pages.
1146 if (m == NULL || pindex < m->pindex) {
1148 * Optimize a common case: if the top-level object has
1149 * no backing object, we can skip over the non-resident
1150 * range in constant time.
1152 if (object->backing_object == NULL) {
1153 tpindex = (m != NULL && m->pindex < end) ?
1155 vm_object_madvise_freespace(object, advice,
1156 pindex, tpindex - pindex);
1157 if ((pindex = tpindex) == end)
1164 vm_object_madvise_freespace(tobject, advice,
1167 * Prepare to search the next object in the
1170 backing_object = tobject->backing_object;
1171 if (backing_object == NULL)
1173 VM_OBJECT_WLOCK(backing_object);
1175 OFF_TO_IDX(tobject->backing_object_offset);
1176 if (tobject != object)
1177 VM_OBJECT_WUNLOCK(tobject);
1178 tobject = backing_object;
1179 if (!vm_object_advice_applies(tobject, advice))
1181 } while ((tm = vm_page_lookup(tobject, tpindex)) ==
1186 m = TAILQ_NEXT(m, listq);
1190 * If the page is not in a normal state, skip it.
1192 if (tm->valid != VM_PAGE_BITS_ALL)
1195 if (vm_page_held(tm)) {
1199 KASSERT((tm->flags & PG_FICTITIOUS) == 0,
1200 ("vm_object_madvise: page %p is fictitious", tm));
1201 KASSERT((tm->oflags & VPO_UNMANAGED) == 0,
1202 ("vm_object_madvise: page %p is not managed", tm));
1203 if (vm_page_busied(tm)) {
1204 if (object != tobject)
1205 VM_OBJECT_WUNLOCK(tobject);
1206 VM_OBJECT_WUNLOCK(object);
1207 if (advice == MADV_WILLNEED) {
1209 * Reference the page before unlocking and
1210 * sleeping so that the page daemon is less
1211 * likely to reclaim it.
1213 vm_page_aflag_set(tm, PGA_REFERENCED);
1215 vm_page_busy_sleep(tm, "madvpo", false);
1218 vm_page_advise(tm, advice);
1220 vm_object_madvise_freespace(tobject, advice, tm->pindex, 1);
1222 if (tobject != object)
1223 VM_OBJECT_WUNLOCK(tobject);
1225 VM_OBJECT_WUNLOCK(object);
1231 * Create a new object which is backed by the
1232 * specified existing object range. The source
1233 * object reference is deallocated.
1235 * The new object and offset into that object
1236 * are returned in the source parameters.
1240 vm_object_t *object, /* IN/OUT */
1241 vm_ooffset_t *offset, /* IN/OUT */
1250 * Don't create the new object if the old object isn't shared.
1252 if (source != NULL) {
1253 VM_OBJECT_WLOCK(source);
1254 if (source->ref_count == 1 &&
1255 source->handle == NULL &&
1256 (source->type == OBJT_DEFAULT ||
1257 source->type == OBJT_SWAP)) {
1258 VM_OBJECT_WUNLOCK(source);
1261 VM_OBJECT_WUNLOCK(source);
1265 * Allocate a new object with the given length.
1267 result = vm_object_allocate(OBJT_DEFAULT, atop(length));
1270 * The new object shadows the source object, adding a reference to it.
1271 * Our caller changes his reference to point to the new object,
1272 * removing a reference to the source object. Net result: no change
1273 * of reference count.
1275 * Try to optimize the result object's page color when shadowing
1276 * in order to maintain page coloring consistency in the combined
1279 result->backing_object = source;
1281 * Store the offset into the source object, and fix up the offset into
1284 result->backing_object_offset = *offset;
1285 if (source != NULL) {
1286 VM_OBJECT_WLOCK(source);
1287 result->domain = source->domain;
1288 LIST_INSERT_HEAD(&source->shadow_head, result, shadow_list);
1289 source->shadow_count++;
1290 #if VM_NRESERVLEVEL > 0
1291 result->flags |= source->flags & OBJ_COLORED;
1292 result->pg_color = (source->pg_color + OFF_TO_IDX(*offset)) &
1293 ((1 << (VM_NFREEORDER - 1)) - 1);
1295 VM_OBJECT_WUNLOCK(source);
1300 * Return the new things
1309 * Split the pages in a map entry into a new object. This affords
1310 * easier removal of unused pages, and keeps object inheritance from
1311 * being a negative impact on memory usage.
1314 vm_object_split(vm_map_entry_t entry)
1316 vm_page_t m, m_next;
1317 vm_object_t orig_object, new_object, source;
1318 vm_pindex_t idx, offidxstart;
1321 orig_object = entry->object.vm_object;
1322 if (orig_object->type != OBJT_DEFAULT && orig_object->type != OBJT_SWAP)
1324 if (orig_object->ref_count <= 1)
1326 VM_OBJECT_WUNLOCK(orig_object);
1328 offidxstart = OFF_TO_IDX(entry->offset);
1329 size = atop(entry->end - entry->start);
1332 * If swap_pager_copy() is later called, it will convert new_object
1333 * into a swap object.
1335 new_object = vm_object_allocate(OBJT_DEFAULT, size);
1338 * At this point, the new object is still private, so the order in
1339 * which the original and new objects are locked does not matter.
1341 VM_OBJECT_WLOCK(new_object);
1342 VM_OBJECT_WLOCK(orig_object);
1343 new_object->domain = orig_object->domain;
1344 source = orig_object->backing_object;
1345 if (source != NULL) {
1346 VM_OBJECT_WLOCK(source);
1347 if ((source->flags & OBJ_DEAD) != 0) {
1348 VM_OBJECT_WUNLOCK(source);
1349 VM_OBJECT_WUNLOCK(orig_object);
1350 VM_OBJECT_WUNLOCK(new_object);
1351 vm_object_deallocate(new_object);
1352 VM_OBJECT_WLOCK(orig_object);
1355 LIST_INSERT_HEAD(&source->shadow_head,
1356 new_object, shadow_list);
1357 source->shadow_count++;
1358 vm_object_reference_locked(source); /* for new_object */
1359 vm_object_clear_flag(source, OBJ_ONEMAPPING);
1360 VM_OBJECT_WUNLOCK(source);
1361 new_object->backing_object_offset =
1362 orig_object->backing_object_offset + entry->offset;
1363 new_object->backing_object = source;
1365 if (orig_object->cred != NULL) {
1366 new_object->cred = orig_object->cred;
1367 crhold(orig_object->cred);
1368 new_object->charge = ptoa(size);
1369 KASSERT(orig_object->charge >= ptoa(size),
1370 ("orig_object->charge < 0"));
1371 orig_object->charge -= ptoa(size);
1374 m = vm_page_find_least(orig_object, offidxstart);
1375 for (; m != NULL && (idx = m->pindex - offidxstart) < size;
1377 m_next = TAILQ_NEXT(m, listq);
1380 * We must wait for pending I/O to complete before we can
1383 * We do not have to VM_PROT_NONE the page as mappings should
1384 * not be changed by this operation.
1386 if (vm_page_busied(m)) {
1387 VM_OBJECT_WUNLOCK(new_object);
1389 VM_OBJECT_WUNLOCK(orig_object);
1390 vm_page_busy_sleep(m, "spltwt", false);
1391 VM_OBJECT_WLOCK(orig_object);
1392 VM_OBJECT_WLOCK(new_object);
1396 /* vm_page_rename() will dirty the page. */
1397 if (vm_page_rename(m, new_object, idx)) {
1398 VM_OBJECT_WUNLOCK(new_object);
1399 VM_OBJECT_WUNLOCK(orig_object);
1401 VM_OBJECT_WLOCK(orig_object);
1402 VM_OBJECT_WLOCK(new_object);
1405 #if VM_NRESERVLEVEL > 0
1407 * If some of the reservation's allocated pages remain with
1408 * the original object, then transferring the reservation to
1409 * the new object is neither particularly beneficial nor
1410 * particularly harmful as compared to leaving the reservation
1411 * with the original object. If, however, all of the
1412 * reservation's allocated pages are transferred to the new
1413 * object, then transferring the reservation is typically
1414 * beneficial. Determining which of these two cases applies
1415 * would be more costly than unconditionally renaming the
1418 vm_reserv_rename(m, new_object, orig_object, offidxstart);
1420 if (orig_object->type == OBJT_SWAP)
1423 if (orig_object->type == OBJT_SWAP) {
1425 * swap_pager_copy() can sleep, in which case the orig_object's
1426 * and new_object's locks are released and reacquired.
1428 swap_pager_copy(orig_object, new_object, offidxstart, 0);
1429 TAILQ_FOREACH(m, &new_object->memq, listq)
1432 VM_OBJECT_WUNLOCK(orig_object);
1433 VM_OBJECT_WUNLOCK(new_object);
1434 entry->object.vm_object = new_object;
1435 entry->offset = 0LL;
1436 vm_object_deallocate(orig_object);
1437 VM_OBJECT_WLOCK(new_object);
1440 #define OBSC_COLLAPSE_NOWAIT 0x0002
1441 #define OBSC_COLLAPSE_WAIT 0x0004
1444 vm_object_collapse_scan_wait(vm_object_t object, vm_page_t p, vm_page_t next,
1447 vm_object_t backing_object;
1449 VM_OBJECT_ASSERT_WLOCKED(object);
1450 backing_object = object->backing_object;
1451 VM_OBJECT_ASSERT_WLOCKED(backing_object);
1453 KASSERT(p == NULL || vm_page_busied(p), ("unbusy page %p", p));
1454 KASSERT(p == NULL || p->object == object || p->object == backing_object,
1455 ("invalid ownership %p %p %p", p, object, backing_object));
1456 if ((op & OBSC_COLLAPSE_NOWAIT) != 0)
1460 VM_OBJECT_WUNLOCK(object);
1461 VM_OBJECT_WUNLOCK(backing_object);
1462 /* The page is only NULL when rename fails. */
1466 vm_page_busy_sleep(p, "vmocol", false);
1467 VM_OBJECT_WLOCK(object);
1468 VM_OBJECT_WLOCK(backing_object);
1469 return (TAILQ_FIRST(&backing_object->memq));
1473 vm_object_scan_all_shadowed(vm_object_t object)
1475 vm_object_t backing_object;
1477 vm_pindex_t backing_offset_index, new_pindex, pi, ps;
1479 VM_OBJECT_ASSERT_WLOCKED(object);
1480 VM_OBJECT_ASSERT_WLOCKED(object->backing_object);
1482 backing_object = object->backing_object;
1484 if (backing_object->type != OBJT_DEFAULT &&
1485 backing_object->type != OBJT_SWAP)
1488 pi = backing_offset_index = OFF_TO_IDX(object->backing_object_offset);
1489 p = vm_page_find_least(backing_object, pi);
1490 ps = swap_pager_find_least(backing_object, pi);
1493 * Only check pages inside the parent object's range and
1494 * inside the parent object's mapping of the backing object.
1497 if (p != NULL && p->pindex < pi)
1498 p = TAILQ_NEXT(p, listq);
1500 ps = swap_pager_find_least(backing_object, pi);
1501 if (p == NULL && ps >= backing_object->size)
1506 pi = MIN(p->pindex, ps);
1508 new_pindex = pi - backing_offset_index;
1509 if (new_pindex >= object->size)
1513 * See if the parent has the page or if the parent's object
1514 * pager has the page. If the parent has the page but the page
1515 * is not valid, the parent's object pager must have the page.
1517 * If this fails, the parent does not completely shadow the
1518 * object and we might as well give up now.
1520 pp = vm_page_lookup(object, new_pindex);
1521 if ((pp == NULL || pp->valid == 0) &&
1522 !vm_pager_has_page(object, new_pindex, NULL, NULL))
1529 vm_object_collapse_scan(vm_object_t object, int op)
1531 vm_object_t backing_object;
1532 vm_page_t next, p, pp;
1533 vm_pindex_t backing_offset_index, new_pindex;
1535 VM_OBJECT_ASSERT_WLOCKED(object);
1536 VM_OBJECT_ASSERT_WLOCKED(object->backing_object);
1538 backing_object = object->backing_object;
1539 backing_offset_index = OFF_TO_IDX(object->backing_object_offset);
1542 * Initial conditions
1544 if ((op & OBSC_COLLAPSE_WAIT) != 0)
1545 vm_object_set_flag(backing_object, OBJ_DEAD);
1550 for (p = TAILQ_FIRST(&backing_object->memq); p != NULL; p = next) {
1551 next = TAILQ_NEXT(p, listq);
1552 new_pindex = p->pindex - backing_offset_index;
1555 * Check for busy page
1557 if (vm_page_busied(p)) {
1558 next = vm_object_collapse_scan_wait(object, p, next, op);
1562 KASSERT(p->object == backing_object,
1563 ("vm_object_collapse_scan: object mismatch"));
1565 if (p->pindex < backing_offset_index ||
1566 new_pindex >= object->size) {
1567 if (backing_object->type == OBJT_SWAP)
1568 swap_pager_freespace(backing_object, p->pindex,
1572 * Page is out of the parent object's range, we can
1573 * simply destroy it.
1576 KASSERT(!pmap_page_is_mapped(p),
1577 ("freeing mapped page %p", p));
1578 if (vm_page_remove(p))
1584 pp = vm_page_lookup(object, new_pindex);
1585 if (pp != NULL && vm_page_busied(pp)) {
1587 * The page in the parent is busy and possibly not
1588 * (yet) valid. Until its state is finalized by the
1589 * busy bit owner, we can't tell whether it shadows the
1590 * original page. Therefore, we must either skip it
1591 * and the original (backing_object) page or wait for
1592 * its state to be finalized.
1594 * This is due to a race with vm_fault() where we must
1595 * unbusy the original (backing_obj) page before we can
1596 * (re)lock the parent. Hence we can get here.
1598 next = vm_object_collapse_scan_wait(object, pp, next,
1603 KASSERT(pp == NULL || pp->valid != 0,
1604 ("unbusy invalid page %p", pp));
1606 if (pp != NULL || vm_pager_has_page(object, new_pindex, NULL,
1609 * The page already exists in the parent OR swap exists
1610 * for this location in the parent. Leave the parent's
1611 * page alone. Destroy the original page from the
1614 if (backing_object->type == OBJT_SWAP)
1615 swap_pager_freespace(backing_object, p->pindex,
1618 KASSERT(!pmap_page_is_mapped(p),
1619 ("freeing mapped page %p", p));
1620 if (vm_page_remove(p))
1627 * Page does not exist in parent, rename the page from the
1628 * backing object to the main object.
1630 * If the page was mapped to a process, it can remain mapped
1631 * through the rename. vm_page_rename() will dirty the page.
1633 if (vm_page_rename(p, object, new_pindex)) {
1634 next = vm_object_collapse_scan_wait(object, NULL, next,
1639 /* Use the old pindex to free the right page. */
1640 if (backing_object->type == OBJT_SWAP)
1641 swap_pager_freespace(backing_object,
1642 new_pindex + backing_offset_index, 1);
1644 #if VM_NRESERVLEVEL > 0
1646 * Rename the reservation.
1648 vm_reserv_rename(p, object, backing_object,
1649 backing_offset_index);
1657 * this version of collapse allows the operation to occur earlier and
1658 * when paging_in_progress is true for an object... This is not a complete
1659 * operation, but should plug 99.9% of the rest of the leaks.
1662 vm_object_qcollapse(vm_object_t object)
1664 vm_object_t backing_object = object->backing_object;
1666 VM_OBJECT_ASSERT_WLOCKED(object);
1667 VM_OBJECT_ASSERT_WLOCKED(backing_object);
1669 if (backing_object->ref_count != 1)
1672 vm_object_collapse_scan(object, OBSC_COLLAPSE_NOWAIT);
1676 * vm_object_collapse:
1678 * Collapse an object with the object backing it.
1679 * Pages in the backing object are moved into the
1680 * parent, and the backing object is deallocated.
1683 vm_object_collapse(vm_object_t object)
1685 vm_object_t backing_object, new_backing_object;
1687 VM_OBJECT_ASSERT_WLOCKED(object);
1691 * Verify that the conditions are right for collapse:
1693 * The object exists and the backing object exists.
1695 if ((backing_object = object->backing_object) == NULL)
1699 * we check the backing object first, because it is most likely
1702 VM_OBJECT_WLOCK(backing_object);
1703 if (backing_object->handle != NULL ||
1704 (backing_object->type != OBJT_DEFAULT &&
1705 backing_object->type != OBJT_SWAP) ||
1706 (backing_object->flags & (OBJ_DEAD | OBJ_NOSPLIT)) != 0 ||
1707 object->handle != NULL ||
1708 (object->type != OBJT_DEFAULT &&
1709 object->type != OBJT_SWAP) ||
1710 (object->flags & OBJ_DEAD)) {
1711 VM_OBJECT_WUNLOCK(backing_object);
1715 if (object->paging_in_progress != 0 ||
1716 backing_object->paging_in_progress != 0) {
1717 vm_object_qcollapse(object);
1718 VM_OBJECT_WUNLOCK(backing_object);
1723 * We know that we can either collapse the backing object (if
1724 * the parent is the only reference to it) or (perhaps) have
1725 * the parent bypass the object if the parent happens to shadow
1726 * all the resident pages in the entire backing object.
1728 * This is ignoring pager-backed pages such as swap pages.
1729 * vm_object_collapse_scan fails the shadowing test in this
1732 if (backing_object->ref_count == 1) {
1733 vm_object_pip_add(object, 1);
1734 vm_object_pip_add(backing_object, 1);
1737 * If there is exactly one reference to the backing
1738 * object, we can collapse it into the parent.
1740 vm_object_collapse_scan(object, OBSC_COLLAPSE_WAIT);
1742 #if VM_NRESERVLEVEL > 0
1744 * Break any reservations from backing_object.
1746 if (__predict_false(!LIST_EMPTY(&backing_object->rvq)))
1747 vm_reserv_break_all(backing_object);
1751 * Move the pager from backing_object to object.
1753 if (backing_object->type == OBJT_SWAP) {
1755 * swap_pager_copy() can sleep, in which case
1756 * the backing_object's and object's locks are
1757 * released and reacquired.
1758 * Since swap_pager_copy() is being asked to
1759 * destroy the source, it will change the
1760 * backing_object's type to OBJT_DEFAULT.
1765 OFF_TO_IDX(object->backing_object_offset), TRUE);
1768 * Object now shadows whatever backing_object did.
1769 * Note that the reference to
1770 * backing_object->backing_object moves from within
1771 * backing_object to within object.
1773 LIST_REMOVE(object, shadow_list);
1774 backing_object->shadow_count--;
1775 if (backing_object->backing_object) {
1776 VM_OBJECT_WLOCK(backing_object->backing_object);
1777 LIST_REMOVE(backing_object, shadow_list);
1779 &backing_object->backing_object->shadow_head,
1780 object, shadow_list);
1782 * The shadow_count has not changed.
1784 VM_OBJECT_WUNLOCK(backing_object->backing_object);
1786 object->backing_object = backing_object->backing_object;
1787 object->backing_object_offset +=
1788 backing_object->backing_object_offset;
1791 * Discard backing_object.
1793 * Since the backing object has no pages, no pager left,
1794 * and no object references within it, all that is
1795 * necessary is to dispose of it.
1797 KASSERT(backing_object->ref_count == 1, (
1798 "backing_object %p was somehow re-referenced during collapse!",
1800 vm_object_pip_wakeup(backing_object);
1801 backing_object->type = OBJT_DEAD;
1802 backing_object->ref_count = 0;
1803 VM_OBJECT_WUNLOCK(backing_object);
1804 vm_object_destroy(backing_object);
1806 vm_object_pip_wakeup(object);
1807 counter_u64_add(object_collapses, 1);
1810 * If we do not entirely shadow the backing object,
1811 * there is nothing we can do so we give up.
1813 if (object->resident_page_count != object->size &&
1814 !vm_object_scan_all_shadowed(object)) {
1815 VM_OBJECT_WUNLOCK(backing_object);
1820 * Make the parent shadow the next object in the
1821 * chain. Deallocating backing_object will not remove
1822 * it, since its reference count is at least 2.
1824 LIST_REMOVE(object, shadow_list);
1825 backing_object->shadow_count--;
1827 new_backing_object = backing_object->backing_object;
1828 if ((object->backing_object = new_backing_object) != NULL) {
1829 VM_OBJECT_WLOCK(new_backing_object);
1831 &new_backing_object->shadow_head,
1835 new_backing_object->shadow_count++;
1836 vm_object_reference_locked(new_backing_object);
1837 VM_OBJECT_WUNLOCK(new_backing_object);
1838 object->backing_object_offset +=
1839 backing_object->backing_object_offset;
1843 * Drop the reference count on backing_object. Since
1844 * its ref_count was at least 2, it will not vanish.
1846 backing_object->ref_count--;
1847 VM_OBJECT_WUNLOCK(backing_object);
1848 counter_u64_add(object_bypasses, 1);
1852 * Try again with this object's new backing object.
1858 * vm_object_page_remove:
1860 * For the given object, either frees or invalidates each of the
1861 * specified pages. In general, a page is freed. However, if a page is
1862 * wired for any reason other than the existence of a managed, wired
1863 * mapping, then it may be invalidated but not removed from the object.
1864 * Pages are specified by the given range ["start", "end") and the option
1865 * OBJPR_CLEANONLY. As a special case, if "end" is zero, then the range
1866 * extends from "start" to the end of the object. If the option
1867 * OBJPR_CLEANONLY is specified, then only the non-dirty pages within the
1868 * specified range are affected. If the option OBJPR_NOTMAPPED is
1869 * specified, then the pages within the specified range must have no
1870 * mappings. Otherwise, if this option is not specified, any mappings to
1871 * the specified pages are removed before the pages are freed or
1874 * In general, this operation should only be performed on objects that
1875 * contain managed pages. There are, however, two exceptions. First, it
1876 * is performed on the kernel and kmem objects by vm_map_entry_delete().
1877 * Second, it is used by msync(..., MS_INVALIDATE) to invalidate device-
1878 * backed pages. In both of these cases, the option OBJPR_CLEANONLY must
1879 * not be specified and the option OBJPR_NOTMAPPED must be specified.
1881 * The object must be locked.
1884 vm_object_page_remove(vm_object_t object, vm_pindex_t start, vm_pindex_t end,
1890 VM_OBJECT_ASSERT_WLOCKED(object);
1891 KASSERT((object->flags & OBJ_UNMANAGED) == 0 ||
1892 (options & (OBJPR_CLEANONLY | OBJPR_NOTMAPPED)) == OBJPR_NOTMAPPED,
1893 ("vm_object_page_remove: illegal options for object %p", object));
1894 if (object->resident_page_count == 0)
1896 vm_object_pip_add(object, 1);
1898 p = vm_page_find_least(object, start);
1902 * Here, the variable "p" is either (1) the page with the least pindex
1903 * greater than or equal to the parameter "start" or (2) NULL.
1905 for (; p != NULL && (p->pindex < end || end == 0); p = next) {
1906 next = TAILQ_NEXT(p, listq);
1909 * If the page is wired for any reason besides the existence
1910 * of managed, wired mappings, then it cannot be freed. For
1911 * example, fictitious pages, which represent device memory,
1912 * are inherently wired and cannot be freed. They can,
1913 * however, be invalidated if the option OBJPR_CLEANONLY is
1916 vm_page_change_lock(p, &mtx);
1917 if (vm_page_xbusied(p)) {
1918 VM_OBJECT_WUNLOCK(object);
1919 vm_page_busy_sleep(p, "vmopax", true);
1920 VM_OBJECT_WLOCK(object);
1923 if (vm_page_wired(p)) {
1924 if ((options & OBJPR_NOTMAPPED) == 0 &&
1925 object->ref_count != 0)
1927 if ((options & OBJPR_CLEANONLY) == 0) {
1933 if (vm_page_busied(p)) {
1934 VM_OBJECT_WUNLOCK(object);
1935 vm_page_busy_sleep(p, "vmopar", false);
1936 VM_OBJECT_WLOCK(object);
1939 KASSERT((p->flags & PG_FICTITIOUS) == 0,
1940 ("vm_object_page_remove: page %p is fictitious", p));
1941 if ((options & OBJPR_CLEANONLY) != 0 && p->valid != 0) {
1942 if ((options & OBJPR_NOTMAPPED) == 0 &&
1943 object->ref_count != 0)
1944 pmap_remove_write(p);
1948 if ((options & OBJPR_NOTMAPPED) == 0 && object->ref_count != 0)
1954 vm_object_pip_wakeup(object);
1958 * vm_object_page_noreuse:
1960 * For the given object, attempt to move the specified pages to
1961 * the head of the inactive queue. This bypasses regular LRU
1962 * operation and allows the pages to be reused quickly under memory
1963 * pressure. If a page is wired for any reason, then it will not
1964 * be queued. Pages are specified by the range ["start", "end").
1965 * As a special case, if "end" is zero, then the range extends from
1966 * "start" to the end of the object.
1968 * This operation should only be performed on objects that
1969 * contain non-fictitious, managed pages.
1971 * The object must be locked.
1974 vm_object_page_noreuse(vm_object_t object, vm_pindex_t start, vm_pindex_t end)
1979 VM_OBJECT_ASSERT_LOCKED(object);
1980 KASSERT((object->flags & (OBJ_FICTITIOUS | OBJ_UNMANAGED)) == 0,
1981 ("vm_object_page_noreuse: illegal object %p", object));
1982 if (object->resident_page_count == 0)
1984 p = vm_page_find_least(object, start);
1987 * Here, the variable "p" is either (1) the page with the least pindex
1988 * greater than or equal to the parameter "start" or (2) NULL.
1991 for (; p != NULL && (p->pindex < end || end == 0); p = next) {
1992 next = TAILQ_NEXT(p, listq);
1993 vm_page_change_lock(p, &mtx);
1994 vm_page_deactivate_noreuse(p);
2001 * Populate the specified range of the object with valid pages. Returns
2002 * TRUE if the range is successfully populated and FALSE otherwise.
2004 * Note: This function should be optimized to pass a larger array of
2005 * pages to vm_pager_get_pages() before it is applied to a non-
2006 * OBJT_DEVICE object.
2008 * The object must be locked.
2011 vm_object_populate(vm_object_t object, vm_pindex_t start, vm_pindex_t end)
2017 VM_OBJECT_ASSERT_WLOCKED(object);
2018 for (pindex = start; pindex < end; pindex++) {
2019 m = vm_page_grab(object, pindex, VM_ALLOC_NORMAL);
2020 if (m->valid != VM_PAGE_BITS_ALL) {
2021 rv = vm_pager_get_pages(object, &m, 1, NULL, NULL);
2022 if (rv != VM_PAGER_OK) {
2030 * Keep "m" busy because a subsequent iteration may unlock
2034 if (pindex > start) {
2035 m = vm_page_lookup(object, start);
2036 while (m != NULL && m->pindex < pindex) {
2038 m = TAILQ_NEXT(m, listq);
2041 return (pindex == end);
2045 * Routine: vm_object_coalesce
2046 * Function: Coalesces two objects backing up adjoining
2047 * regions of memory into a single object.
2049 * returns TRUE if objects were combined.
2051 * NOTE: Only works at the moment if the second object is NULL -
2052 * if it's not, which object do we lock first?
2055 * prev_object First object to coalesce
2056 * prev_offset Offset into prev_object
2057 * prev_size Size of reference to prev_object
2058 * next_size Size of reference to the second object
2059 * reserved Indicator that extension region has
2060 * swap accounted for
2063 * The object must *not* be locked.
2066 vm_object_coalesce(vm_object_t prev_object, vm_ooffset_t prev_offset,
2067 vm_size_t prev_size, vm_size_t next_size, boolean_t reserved)
2069 vm_pindex_t next_pindex;
2071 if (prev_object == NULL)
2073 VM_OBJECT_WLOCK(prev_object);
2074 if ((prev_object->type != OBJT_DEFAULT &&
2075 prev_object->type != OBJT_SWAP) ||
2076 (prev_object->flags & OBJ_NOSPLIT) != 0) {
2077 VM_OBJECT_WUNLOCK(prev_object);
2082 * Try to collapse the object first
2084 vm_object_collapse(prev_object);
2087 * Can't coalesce if: . more than one reference . paged out . shadows
2088 * another object . has a copy elsewhere (any of which mean that the
2089 * pages not mapped to prev_entry may be in use anyway)
2091 if (prev_object->backing_object != NULL) {
2092 VM_OBJECT_WUNLOCK(prev_object);
2096 prev_size >>= PAGE_SHIFT;
2097 next_size >>= PAGE_SHIFT;
2098 next_pindex = OFF_TO_IDX(prev_offset) + prev_size;
2100 if (prev_object->ref_count > 1 &&
2101 prev_object->size != next_pindex &&
2102 (prev_object->flags & OBJ_ONEMAPPING) == 0) {
2103 VM_OBJECT_WUNLOCK(prev_object);
2108 * Account for the charge.
2110 if (prev_object->cred != NULL) {
2113 * If prev_object was charged, then this mapping,
2114 * although not charged now, may become writable
2115 * later. Non-NULL cred in the object would prevent
2116 * swap reservation during enabling of the write
2117 * access, so reserve swap now. Failed reservation
2118 * cause allocation of the separate object for the map
2119 * entry, and swap reservation for this entry is
2120 * managed in appropriate time.
2122 if (!reserved && !swap_reserve_by_cred(ptoa(next_size),
2123 prev_object->cred)) {
2124 VM_OBJECT_WUNLOCK(prev_object);
2127 prev_object->charge += ptoa(next_size);
2131 * Remove any pages that may still be in the object from a previous
2134 if (next_pindex < prev_object->size) {
2135 vm_object_page_remove(prev_object, next_pindex, next_pindex +
2137 if (prev_object->type == OBJT_SWAP)
2138 swap_pager_freespace(prev_object,
2139 next_pindex, next_size);
2141 if (prev_object->cred != NULL) {
2142 KASSERT(prev_object->charge >=
2143 ptoa(prev_object->size - next_pindex),
2144 ("object %p overcharged 1 %jx %jx", prev_object,
2145 (uintmax_t)next_pindex, (uintmax_t)next_size));
2146 prev_object->charge -= ptoa(prev_object->size -
2153 * Extend the object if necessary.
2155 if (next_pindex + next_size > prev_object->size)
2156 prev_object->size = next_pindex + next_size;
2158 VM_OBJECT_WUNLOCK(prev_object);
2163 vm_object_set_writeable_dirty(vm_object_t object)
2166 VM_OBJECT_ASSERT_WLOCKED(object);
2167 if (object->type != OBJT_VNODE) {
2168 if ((object->flags & OBJ_TMPFS_NODE) != 0) {
2169 KASSERT(object->type == OBJT_SWAP, ("non-swap tmpfs"));
2170 vm_object_set_flag(object, OBJ_TMPFS_DIRTY);
2174 object->generation++;
2175 if ((object->flags & OBJ_MIGHTBEDIRTY) != 0)
2177 vm_object_set_flag(object, OBJ_MIGHTBEDIRTY);
2183 * For each page offset within the specified range of the given object,
2184 * find the highest-level page in the shadow chain and unwire it. A page
2185 * must exist at every page offset, and the highest-level page must be
2189 vm_object_unwire(vm_object_t object, vm_ooffset_t offset, vm_size_t length,
2192 vm_object_t tobject, t1object;
2194 vm_pindex_t end_pindex, pindex, tpindex;
2195 int depth, locked_depth;
2197 KASSERT((offset & PAGE_MASK) == 0,
2198 ("vm_object_unwire: offset is not page aligned"));
2199 KASSERT((length & PAGE_MASK) == 0,
2200 ("vm_object_unwire: length is not a multiple of PAGE_SIZE"));
2201 /* The wired count of a fictitious page never changes. */
2202 if ((object->flags & OBJ_FICTITIOUS) != 0)
2204 pindex = OFF_TO_IDX(offset);
2205 end_pindex = pindex + atop(length);
2208 VM_OBJECT_RLOCK(object);
2209 m = vm_page_find_least(object, pindex);
2210 while (pindex < end_pindex) {
2211 if (m == NULL || pindex < m->pindex) {
2213 * The first object in the shadow chain doesn't
2214 * contain a page at the current index. Therefore,
2215 * the page must exist in a backing object.
2222 OFF_TO_IDX(tobject->backing_object_offset);
2223 tobject = tobject->backing_object;
2224 KASSERT(tobject != NULL,
2225 ("vm_object_unwire: missing page"));
2226 if ((tobject->flags & OBJ_FICTITIOUS) != 0)
2229 if (depth == locked_depth) {
2231 VM_OBJECT_RLOCK(tobject);
2233 } while ((tm = vm_page_lookup(tobject, tpindex)) ==
2237 m = TAILQ_NEXT(m, listq);
2240 if (vm_page_xbusied(tm)) {
2241 for (tobject = object; locked_depth >= 1;
2243 t1object = tobject->backing_object;
2244 VM_OBJECT_RUNLOCK(tobject);
2247 vm_page_busy_sleep(tm, "unwbo", true);
2250 vm_page_unwire(tm, queue);
2255 /* Release the accumulated object locks. */
2256 for (tobject = object; locked_depth >= 1; locked_depth--) {
2257 t1object = tobject->backing_object;
2258 VM_OBJECT_RUNLOCK(tobject);
2264 vm_object_vnode(vm_object_t object)
2267 VM_OBJECT_ASSERT_LOCKED(object);
2268 if (object->type == OBJT_VNODE)
2269 return (object->handle);
2270 if (object->type == OBJT_SWAP && (object->flags & OBJ_TMPFS) != 0)
2271 return (object->un_pager.swp.swp_tmpfs);
2276 sysctl_vm_object_list(SYSCTL_HANDLER_ARGS)
2278 struct kinfo_vmobject *kvo;
2279 char *fullpath, *freepath;
2286 if (req->oldptr == NULL) {
2288 * If an old buffer has not been provided, generate an
2289 * estimate of the space needed for a subsequent call.
2291 mtx_lock(&vm_object_list_mtx);
2293 TAILQ_FOREACH(obj, &vm_object_list, object_list) {
2294 if (obj->type == OBJT_DEAD)
2298 mtx_unlock(&vm_object_list_mtx);
2299 return (SYSCTL_OUT(req, NULL, sizeof(struct kinfo_vmobject) *
2303 kvo = malloc(sizeof(*kvo), M_TEMP, M_WAITOK);
2307 * VM objects are type stable and are never removed from the
2308 * list once added. This allows us to safely read obj->object_list
2309 * after reacquiring the VM object lock.
2311 mtx_lock(&vm_object_list_mtx);
2312 TAILQ_FOREACH(obj, &vm_object_list, object_list) {
2313 if (obj->type == OBJT_DEAD)
2315 VM_OBJECT_RLOCK(obj);
2316 if (obj->type == OBJT_DEAD) {
2317 VM_OBJECT_RUNLOCK(obj);
2320 mtx_unlock(&vm_object_list_mtx);
2321 kvo->kvo_size = ptoa(obj->size);
2322 kvo->kvo_resident = obj->resident_page_count;
2323 kvo->kvo_ref_count = obj->ref_count;
2324 kvo->kvo_shadow_count = obj->shadow_count;
2325 kvo->kvo_memattr = obj->memattr;
2326 kvo->kvo_active = 0;
2327 kvo->kvo_inactive = 0;
2328 TAILQ_FOREACH(m, &obj->memq, listq) {
2330 * A page may belong to the object but be
2331 * dequeued and set to PQ_NONE while the
2332 * object lock is not held. This makes the
2333 * reads of m->queue below racy, and we do not
2334 * count pages set to PQ_NONE. However, this
2335 * sysctl is only meant to give an
2336 * approximation of the system anyway.
2338 if (m->queue == PQ_ACTIVE)
2340 else if (m->queue == PQ_INACTIVE)
2341 kvo->kvo_inactive++;
2344 kvo->kvo_vn_fileid = 0;
2345 kvo->kvo_vn_fsid = 0;
2346 kvo->kvo_vn_fsid_freebsd11 = 0;
2350 switch (obj->type) {
2352 kvo->kvo_type = KVME_TYPE_DEFAULT;
2355 kvo->kvo_type = KVME_TYPE_VNODE;
2360 kvo->kvo_type = KVME_TYPE_SWAP;
2363 kvo->kvo_type = KVME_TYPE_DEVICE;
2366 kvo->kvo_type = KVME_TYPE_PHYS;
2369 kvo->kvo_type = KVME_TYPE_DEAD;
2372 kvo->kvo_type = KVME_TYPE_SG;
2374 case OBJT_MGTDEVICE:
2375 kvo->kvo_type = KVME_TYPE_MGTDEVICE;
2378 kvo->kvo_type = KVME_TYPE_UNKNOWN;
2381 VM_OBJECT_RUNLOCK(obj);
2383 vn_fullpath(curthread, vp, &fullpath, &freepath);
2384 vn_lock(vp, LK_SHARED | LK_RETRY);
2385 if (VOP_GETATTR(vp, &va, curthread->td_ucred) == 0) {
2386 kvo->kvo_vn_fileid = va.va_fileid;
2387 kvo->kvo_vn_fsid = va.va_fsid;
2388 kvo->kvo_vn_fsid_freebsd11 = va.va_fsid;
2394 strlcpy(kvo->kvo_path, fullpath, sizeof(kvo->kvo_path));
2395 if (freepath != NULL)
2396 free(freepath, M_TEMP);
2398 /* Pack record size down */
2399 kvo->kvo_structsize = offsetof(struct kinfo_vmobject, kvo_path)
2400 + strlen(kvo->kvo_path) + 1;
2401 kvo->kvo_structsize = roundup(kvo->kvo_structsize,
2403 error = SYSCTL_OUT(req, kvo, kvo->kvo_structsize);
2404 mtx_lock(&vm_object_list_mtx);
2408 mtx_unlock(&vm_object_list_mtx);
2412 SYSCTL_PROC(_vm, OID_AUTO, objects, CTLTYPE_STRUCT | CTLFLAG_RW | CTLFLAG_SKIP |
2413 CTLFLAG_MPSAFE, NULL, 0, sysctl_vm_object_list, "S,kinfo_vmobject",
2414 "List of VM objects");
2416 #include "opt_ddb.h"
2418 #include <sys/kernel.h>
2420 #include <sys/cons.h>
2422 #include <ddb/ddb.h>
2425 _vm_object_in_map(vm_map_t map, vm_object_t object, vm_map_entry_t entry)
2428 vm_map_entry_t tmpe;
2436 tmpe = map->header.next;
2437 entcount = map->nentries;
2438 while (entcount-- && (tmpe != &map->header)) {
2439 if (_vm_object_in_map(map, object, tmpe)) {
2444 } else if (entry->eflags & MAP_ENTRY_IS_SUB_MAP) {
2445 tmpm = entry->object.sub_map;
2446 tmpe = tmpm->header.next;
2447 entcount = tmpm->nentries;
2448 while (entcount-- && tmpe != &tmpm->header) {
2449 if (_vm_object_in_map(tmpm, object, tmpe)) {
2454 } else if ((obj = entry->object.vm_object) != NULL) {
2455 for (; obj; obj = obj->backing_object)
2456 if (obj == object) {
2464 vm_object_in_map(vm_object_t object)
2468 /* sx_slock(&allproc_lock); */
2469 FOREACH_PROC_IN_SYSTEM(p) {
2470 if (!p->p_vmspace /* || (p->p_flag & (P_SYSTEM|P_WEXIT)) */)
2472 if (_vm_object_in_map(&p->p_vmspace->vm_map, object, 0)) {
2473 /* sx_sunlock(&allproc_lock); */
2477 /* sx_sunlock(&allproc_lock); */
2478 if (_vm_object_in_map(kernel_map, object, 0))
2483 DB_SHOW_COMMAND(vmochk, vm_object_check)
2488 * make sure that internal objs are in a map somewhere
2489 * and none have zero ref counts.
2491 TAILQ_FOREACH(object, &vm_object_list, object_list) {
2492 if (object->handle == NULL &&
2493 (object->type == OBJT_DEFAULT || object->type == OBJT_SWAP)) {
2494 if (object->ref_count == 0) {
2495 db_printf("vmochk: internal obj has zero ref count: %ld\n",
2496 (long)object->size);
2498 if (!vm_object_in_map(object)) {
2500 "vmochk: internal obj is not in a map: "
2501 "ref: %d, size: %lu: 0x%lx, backing_object: %p\n",
2502 object->ref_count, (u_long)object->size,
2503 (u_long)object->size,
2504 (void *)object->backing_object);
2511 * vm_object_print: [ debug ]
2513 DB_SHOW_COMMAND(object, vm_object_print_static)
2515 /* XXX convert args. */
2516 vm_object_t object = (vm_object_t)addr;
2517 boolean_t full = have_addr;
2521 /* XXX count is an (unused) arg. Avoid shadowing it. */
2522 #define count was_count
2530 "Object %p: type=%d, size=0x%jx, res=%d, ref=%d, flags=0x%x ruid %d charge %jx\n",
2531 object, (int)object->type, (uintmax_t)object->size,
2532 object->resident_page_count, object->ref_count, object->flags,
2533 object->cred ? object->cred->cr_ruid : -1, (uintmax_t)object->charge);
2534 db_iprintf(" sref=%d, backing_object(%d)=(%p)+0x%jx\n",
2535 object->shadow_count,
2536 object->backing_object ? object->backing_object->ref_count : 0,
2537 object->backing_object, (uintmax_t)object->backing_object_offset);
2544 TAILQ_FOREACH(p, &object->memq, listq) {
2546 db_iprintf("memory:=");
2547 else if (count == 6) {
2555 db_printf("(off=0x%jx,page=0x%jx)",
2556 (uintmax_t)p->pindex, (uintmax_t)VM_PAGE_TO_PHYS(p));
2566 /* XXX need this non-static entry for calling from vm_map_print. */
2569 /* db_expr_t */ long addr,
2570 boolean_t have_addr,
2571 /* db_expr_t */ long count,
2574 vm_object_print_static(addr, have_addr, count, modif);
2577 DB_SHOW_COMMAND(vmopag, vm_object_print_pages)
2582 vm_page_t m, prev_m;
2586 TAILQ_FOREACH(object, &vm_object_list, object_list) {
2587 db_printf("new object: %p\n", (void *)object);
2598 TAILQ_FOREACH(m, &object->memq, listq) {
2599 if (m->pindex > 128)
2601 if ((prev_m = TAILQ_PREV(m, pglist, listq)) != NULL &&
2602 prev_m->pindex + 1 != m->pindex) {
2604 db_printf(" index(%ld)run(%d)pa(0x%lx)\n",
2605 (long)fidx, rcount, (long)pa);
2617 (VM_PAGE_TO_PHYS(m) == pa + rcount * PAGE_SIZE)) {
2622 db_printf(" index(%ld)run(%d)pa(0x%lx)\n",
2623 (long)fidx, rcount, (long)pa);
2633 pa = VM_PAGE_TO_PHYS(m);
2637 db_printf(" index(%ld)run(%d)pa(0x%lx)\n",
2638 (long)fidx, rcount, (long)pa);