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>
76 #include <sys/mount.h>
77 #include <sys/kernel.h>
78 #include <sys/pctrie.h>
79 #include <sys/sysctl.h>
80 #include <sys/mutex.h>
81 #include <sys/proc.h> /* for curproc, pageproc */
82 #include <sys/socket.h>
83 #include <sys/resourcevar.h>
84 #include <sys/rwlock.h>
86 #include <sys/vnode.h>
87 #include <sys/vmmeter.h>
91 #include <vm/vm_param.h>
93 #include <vm/vm_map.h>
94 #include <vm/vm_object.h>
95 #include <vm/vm_page.h>
96 #include <vm/vm_pageout.h>
97 #include <vm/vm_pager.h>
98 #include <vm/swap_pager.h>
99 #include <vm/vm_kern.h>
100 #include <vm/vm_extern.h>
101 #include <vm/vm_radix.h>
102 #include <vm/vm_reserv.h>
105 static int old_msync;
106 SYSCTL_INT(_vm, OID_AUTO, old_msync, CTLFLAG_RW, &old_msync, 0,
107 "Use old (insecure) msync behavior");
109 static int vm_object_page_collect_flush(vm_object_t object, vm_page_t p,
110 int pagerflags, int flags, boolean_t *clearobjflags,
112 static boolean_t vm_object_page_remove_write(vm_page_t p, int flags,
113 boolean_t *clearobjflags);
114 static void vm_object_qcollapse(vm_object_t object);
115 static void vm_object_vndeallocate(vm_object_t object);
118 * Virtual memory objects maintain the actual data
119 * associated with allocated virtual memory. A given
120 * page of memory exists within exactly one object.
122 * An object is only deallocated when all "references"
123 * are given up. Only one "reference" to a given
124 * region of an object should be writeable.
126 * Associated with each object is a list of all resident
127 * memory pages belonging to that object; this list is
128 * maintained by the "vm_page" module, and locked by the object's
131 * Each object also records a "pager" routine which is
132 * used to retrieve (and store) pages to the proper backing
133 * storage. In addition, objects may be backed by other
134 * objects from which they were virtual-copied.
136 * The only items within the object structure which are
137 * modified after time of creation are:
138 * reference count locked by object's lock
139 * pager routine locked by object's lock
143 struct object_q vm_object_list;
144 struct mtx vm_object_list_mtx; /* lock for object list and count */
146 struct vm_object kernel_object_store;
148 static SYSCTL_NODE(_vm_stats, OID_AUTO, object, CTLFLAG_RD, 0,
151 static long object_collapses;
152 SYSCTL_LONG(_vm_stats_object, OID_AUTO, collapses, CTLFLAG_RD,
153 &object_collapses, 0, "VM object collapses");
155 static long object_bypasses;
156 SYSCTL_LONG(_vm_stats_object, OID_AUTO, bypasses, CTLFLAG_RD,
157 &object_bypasses, 0, "VM object bypasses");
159 static uma_zone_t obj_zone;
161 static int vm_object_zinit(void *mem, int size, int flags);
164 static void vm_object_zdtor(void *mem, int size, void *arg);
167 vm_object_zdtor(void *mem, int size, void *arg)
171 object = (vm_object_t)mem;
172 KASSERT(object->ref_count == 0,
173 ("object %p ref_count = %d", object, object->ref_count));
174 KASSERT(TAILQ_EMPTY(&object->memq),
175 ("object %p has resident pages in its memq", object));
176 KASSERT(vm_radix_is_empty(&object->rtree),
177 ("object %p has resident pages in its trie", object));
178 #if VM_NRESERVLEVEL > 0
179 KASSERT(LIST_EMPTY(&object->rvq),
180 ("object %p has reservations",
183 KASSERT(object->paging_in_progress == 0,
184 ("object %p paging_in_progress = %d",
185 object, object->paging_in_progress));
186 KASSERT(object->resident_page_count == 0,
187 ("object %p resident_page_count = %d",
188 object, object->resident_page_count));
189 KASSERT(object->shadow_count == 0,
190 ("object %p shadow_count = %d",
191 object, object->shadow_count));
192 KASSERT(object->type == OBJT_DEAD,
193 ("object %p has non-dead type %d",
194 object, object->type));
199 vm_object_zinit(void *mem, int size, int flags)
203 object = (vm_object_t)mem;
204 rw_init_flags(&object->lock, "vm object", RW_DUPOK | RW_NEW);
206 /* These are true for any object that has been freed */
207 object->type = OBJT_DEAD;
208 object->ref_count = 0;
209 vm_radix_init(&object->rtree);
210 object->paging_in_progress = 0;
211 object->resident_page_count = 0;
212 object->shadow_count = 0;
213 object->flags = OBJ_DEAD;
215 mtx_lock(&vm_object_list_mtx);
216 TAILQ_INSERT_TAIL(&vm_object_list, object, object_list);
217 mtx_unlock(&vm_object_list_mtx);
222 _vm_object_allocate(objtype_t type, vm_pindex_t size, vm_object_t object)
225 TAILQ_INIT(&object->memq);
226 LIST_INIT(&object->shadow_head);
229 if (type == OBJT_SWAP)
230 pctrie_init(&object->un_pager.swp.swp_blks);
233 * Ensure that swap_pager_swapoff() iteration over object_list
234 * sees up to date type and pctrie head if it observed
237 atomic_thread_fence_rel();
241 panic("_vm_object_allocate: can't create OBJT_DEAD");
244 object->flags = OBJ_ONEMAPPING;
248 object->flags = OBJ_FICTITIOUS | OBJ_UNMANAGED;
251 object->flags = OBJ_FICTITIOUS;
254 object->flags = OBJ_UNMANAGED;
260 panic("_vm_object_allocate: type %d is undefined", type);
263 object->generation = 1;
264 object->ref_count = 1;
265 object->memattr = VM_MEMATTR_DEFAULT;
268 object->handle = NULL;
269 object->backing_object = NULL;
270 object->backing_object_offset = (vm_ooffset_t) 0;
271 #if VM_NRESERVLEVEL > 0
272 LIST_INIT(&object->rvq);
274 umtx_shm_object_init(object);
280 * Initialize the VM objects module.
285 TAILQ_INIT(&vm_object_list);
286 mtx_init(&vm_object_list_mtx, "vm object_list", NULL, MTX_DEF);
288 rw_init(&kernel_object->lock, "kernel vm object");
289 _vm_object_allocate(OBJT_PHYS, atop(VM_MAX_KERNEL_ADDRESS -
290 VM_MIN_KERNEL_ADDRESS), kernel_object);
291 #if VM_NRESERVLEVEL > 0
292 kernel_object->flags |= OBJ_COLORED;
293 kernel_object->pg_color = (u_short)atop(VM_MIN_KERNEL_ADDRESS);
297 * The lock portion of struct vm_object must be type stable due
298 * to vm_pageout_fallback_object_lock locking a vm object
299 * without holding any references to it.
301 obj_zone = uma_zcreate("VM OBJECT", sizeof (struct vm_object), NULL,
307 vm_object_zinit, NULL, UMA_ALIGN_PTR, UMA_ZONE_NOFREE);
313 vm_object_clear_flag(vm_object_t object, u_short bits)
316 VM_OBJECT_ASSERT_WLOCKED(object);
317 object->flags &= ~bits;
321 * Sets the default memory attribute for the specified object. Pages
322 * that are allocated to this object are by default assigned this memory
325 * Presently, this function must be called before any pages are allocated
326 * to the object. In the future, this requirement may be relaxed for
327 * "default" and "swap" objects.
330 vm_object_set_memattr(vm_object_t object, vm_memattr_t memattr)
333 VM_OBJECT_ASSERT_WLOCKED(object);
334 switch (object->type) {
342 if (!TAILQ_EMPTY(&object->memq))
343 return (KERN_FAILURE);
346 return (KERN_INVALID_ARGUMENT);
348 panic("vm_object_set_memattr: object %p is of undefined type",
351 object->memattr = memattr;
352 return (KERN_SUCCESS);
356 vm_object_pip_add(vm_object_t object, short i)
359 VM_OBJECT_ASSERT_WLOCKED(object);
360 object->paging_in_progress += i;
364 vm_object_pip_subtract(vm_object_t object, short i)
367 VM_OBJECT_ASSERT_WLOCKED(object);
368 object->paging_in_progress -= i;
372 vm_object_pip_wakeup(vm_object_t object)
375 VM_OBJECT_ASSERT_WLOCKED(object);
376 object->paging_in_progress--;
377 if ((object->flags & OBJ_PIPWNT) && object->paging_in_progress == 0) {
378 vm_object_clear_flag(object, OBJ_PIPWNT);
384 vm_object_pip_wakeupn(vm_object_t object, short i)
387 VM_OBJECT_ASSERT_WLOCKED(object);
389 object->paging_in_progress -= i;
390 if ((object->flags & OBJ_PIPWNT) && object->paging_in_progress == 0) {
391 vm_object_clear_flag(object, OBJ_PIPWNT);
397 vm_object_pip_wait(vm_object_t object, char *waitid)
400 VM_OBJECT_ASSERT_WLOCKED(object);
401 while (object->paging_in_progress) {
402 object->flags |= OBJ_PIPWNT;
403 VM_OBJECT_SLEEP(object, object, PVM, waitid, 0);
408 * vm_object_allocate:
410 * Returns a new object with the given size.
413 vm_object_allocate(objtype_t type, vm_pindex_t size)
417 object = (vm_object_t)uma_zalloc(obj_zone, M_WAITOK);
418 _vm_object_allocate(type, size, object);
424 * vm_object_reference:
426 * Gets another reference to the given object. Note: OBJ_DEAD
427 * objects can be referenced during final cleaning.
430 vm_object_reference(vm_object_t object)
434 VM_OBJECT_WLOCK(object);
435 vm_object_reference_locked(object);
436 VM_OBJECT_WUNLOCK(object);
440 * vm_object_reference_locked:
442 * Gets another reference to the given object.
444 * The object must be locked.
447 vm_object_reference_locked(vm_object_t object)
451 VM_OBJECT_ASSERT_WLOCKED(object);
453 if (object->type == OBJT_VNODE) {
460 * Handle deallocating an object of type OBJT_VNODE.
463 vm_object_vndeallocate(vm_object_t object)
465 struct vnode *vp = (struct vnode *) object->handle;
467 VM_OBJECT_ASSERT_WLOCKED(object);
468 KASSERT(object->type == OBJT_VNODE,
469 ("vm_object_vndeallocate: not a vnode object"));
470 KASSERT(vp != NULL, ("vm_object_vndeallocate: missing vp"));
472 if (object->ref_count == 0) {
473 vn_printf(vp, "vm_object_vndeallocate ");
474 panic("vm_object_vndeallocate: bad object reference count");
478 if (!umtx_shm_vnobj_persistent && object->ref_count == 1)
479 umtx_shm_object_terminated(object);
482 * The test for text of vp vnode does not need a bypass to
483 * reach right VV_TEXT there, since it is obtained from
486 if (object->ref_count > 1 || (vp->v_vflag & VV_TEXT) == 0) {
488 VM_OBJECT_WUNLOCK(object);
489 /* vrele may need the vnode lock. */
493 VM_OBJECT_WUNLOCK(object);
494 vn_lock(vp, LK_EXCLUSIVE | LK_RETRY);
496 VM_OBJECT_WLOCK(object);
498 if (object->type == OBJT_DEAD) {
499 VM_OBJECT_WUNLOCK(object);
502 if (object->ref_count == 0)
504 VM_OBJECT_WUNLOCK(object);
511 * vm_object_deallocate:
513 * Release a reference to the specified object,
514 * gained either through a vm_object_allocate
515 * or a vm_object_reference call. When all references
516 * are gone, storage associated with this object
517 * may be relinquished.
519 * No object may be locked.
522 vm_object_deallocate(vm_object_t object)
527 while (object != NULL) {
528 VM_OBJECT_WLOCK(object);
529 if (object->type == OBJT_VNODE) {
530 vm_object_vndeallocate(object);
534 KASSERT(object->ref_count != 0,
535 ("vm_object_deallocate: object deallocated too many times: %d", object->type));
538 * If the reference count goes to 0 we start calling
539 * vm_object_terminate() on the object chain.
540 * A ref count of 1 may be a special case depending on the
541 * shadow count being 0 or 1.
544 if (object->ref_count > 1) {
545 VM_OBJECT_WUNLOCK(object);
547 } else if (object->ref_count == 1) {
548 if (object->type == OBJT_SWAP &&
549 (object->flags & OBJ_TMPFS) != 0) {
550 vp = object->un_pager.swp.swp_tmpfs;
552 VM_OBJECT_WUNLOCK(object);
553 vn_lock(vp, LK_EXCLUSIVE | LK_RETRY);
554 VM_OBJECT_WLOCK(object);
555 if (object->type == OBJT_DEAD ||
556 object->ref_count != 1) {
557 VM_OBJECT_WUNLOCK(object);
562 if ((object->flags & OBJ_TMPFS) != 0)
567 if (object->shadow_count == 0 &&
568 object->handle == NULL &&
569 (object->type == OBJT_DEFAULT ||
570 (object->type == OBJT_SWAP &&
571 (object->flags & OBJ_TMPFS_NODE) == 0))) {
572 vm_object_set_flag(object, OBJ_ONEMAPPING);
573 } else if ((object->shadow_count == 1) &&
574 (object->handle == NULL) &&
575 (object->type == OBJT_DEFAULT ||
576 object->type == OBJT_SWAP)) {
579 robject = LIST_FIRST(&object->shadow_head);
580 KASSERT(robject != NULL,
581 ("vm_object_deallocate: ref_count: %d, shadow_count: %d",
583 object->shadow_count));
584 KASSERT((robject->flags & OBJ_TMPFS_NODE) == 0,
585 ("shadowed tmpfs v_object %p", object));
586 if (!VM_OBJECT_TRYWLOCK(robject)) {
588 * Avoid a potential deadlock.
591 VM_OBJECT_WUNLOCK(object);
593 * More likely than not the thread
594 * holding robject's lock has lower
595 * priority than the current thread.
596 * Let the lower priority thread run.
602 * Collapse object into its shadow unless its
603 * shadow is dead. In that case, object will
604 * be deallocated by the thread that is
605 * deallocating its shadow.
607 if ((robject->flags & OBJ_DEAD) == 0 &&
608 (robject->handle == NULL) &&
609 (robject->type == OBJT_DEFAULT ||
610 robject->type == OBJT_SWAP)) {
612 robject->ref_count++;
614 if (robject->paging_in_progress) {
615 VM_OBJECT_WUNLOCK(object);
616 vm_object_pip_wait(robject,
618 temp = robject->backing_object;
619 if (object == temp) {
620 VM_OBJECT_WLOCK(object);
623 } else if (object->paging_in_progress) {
624 VM_OBJECT_WUNLOCK(robject);
625 object->flags |= OBJ_PIPWNT;
626 VM_OBJECT_SLEEP(object, object,
627 PDROP | PVM, "objde2", 0);
628 VM_OBJECT_WLOCK(robject);
629 temp = robject->backing_object;
630 if (object == temp) {
631 VM_OBJECT_WLOCK(object);
635 VM_OBJECT_WUNLOCK(object);
637 if (robject->ref_count == 1) {
638 robject->ref_count--;
643 vm_object_collapse(object);
644 VM_OBJECT_WUNLOCK(object);
647 VM_OBJECT_WUNLOCK(robject);
649 VM_OBJECT_WUNLOCK(object);
653 umtx_shm_object_terminated(object);
654 temp = object->backing_object;
656 KASSERT((object->flags & OBJ_TMPFS_NODE) == 0,
657 ("shadowed tmpfs v_object 2 %p", object));
658 VM_OBJECT_WLOCK(temp);
659 LIST_REMOVE(object, shadow_list);
660 temp->shadow_count--;
661 VM_OBJECT_WUNLOCK(temp);
662 object->backing_object = NULL;
665 * Don't double-terminate, we could be in a termination
666 * recursion due to the terminate having to sync data
669 if ((object->flags & OBJ_DEAD) == 0)
670 vm_object_terminate(object);
672 VM_OBJECT_WUNLOCK(object);
678 * vm_object_destroy removes the object from the global object list
679 * and frees the space for the object.
682 vm_object_destroy(vm_object_t object)
686 * Release the allocation charge.
688 if (object->cred != NULL) {
689 swap_release_by_cred(object->charge, object->cred);
691 crfree(object->cred);
696 * Free the space for the object.
698 uma_zfree(obj_zone, object);
702 * vm_object_terminate_pages removes any remaining pageable pages
703 * from the object and resets the object to an empty state.
706 vm_object_terminate_pages(vm_object_t object)
709 struct mtx *mtx, *mtx1;
710 struct vm_pagequeue *pq, *pq1;
713 VM_OBJECT_ASSERT_WLOCKED(object);
719 * Free any remaining pageable pages. This also removes them from the
720 * paging queues. However, don't free wired pages, just remove them
721 * from the object. Rather than incrementally removing each page from
722 * the object, the page and object are reset to any empty state.
724 TAILQ_FOREACH_SAFE(p, &object->memq, listq, p_next) {
725 vm_page_assert_unbusied(p);
726 if ((object->flags & OBJ_UNMANAGED) == 0) {
728 * vm_page_free_prep() only needs the page
729 * lock for managed pages.
731 mtx1 = vm_page_lockptr(p);
736 vm_pagequeue_cnt_add(pq, dequeued);
737 vm_pagequeue_unlock(pq);
745 if (p->wire_count != 0)
748 p->flags &= ~PG_ZERO;
749 if (p->queue != PQ_NONE) {
750 KASSERT(p->queue < PQ_COUNT, ("vm_object_terminate: "
751 "page %p is not queued", p));
752 pq1 = vm_page_pagequeue(p);
755 vm_pagequeue_cnt_add(pq, dequeued);
756 vm_pagequeue_unlock(pq);
759 vm_pagequeue_lock(pq);
763 TAILQ_REMOVE(&pq->pq_pl, p, plinks.q);
766 if (vm_page_free_prep(p, true))
769 TAILQ_REMOVE(&object->memq, p, listq);
772 vm_pagequeue_cnt_add(pq, dequeued);
773 vm_pagequeue_unlock(pq);
778 vm_page_free_phys_pglist(&object->memq);
781 * If the object contained any pages, then reset it to an empty state.
782 * None of the object's fields, including "resident_page_count", were
783 * modified by the preceding loop.
785 if (object->resident_page_count != 0) {
786 vm_radix_reclaim_allnodes(&object->rtree);
787 TAILQ_INIT(&object->memq);
788 object->resident_page_count = 0;
789 if (object->type == OBJT_VNODE)
790 vdrop(object->handle);
795 * vm_object_terminate actually destroys the specified object, freeing
796 * up all previously used resources.
798 * The object must be locked.
799 * This routine may block.
802 vm_object_terminate(vm_object_t object)
805 VM_OBJECT_ASSERT_WLOCKED(object);
808 * Make sure no one uses us.
810 vm_object_set_flag(object, OBJ_DEAD);
813 * wait for the pageout daemon to be done with the object
815 vm_object_pip_wait(object, "objtrm");
817 KASSERT(!object->paging_in_progress,
818 ("vm_object_terminate: pageout in progress"));
821 * Clean and free the pages, as appropriate. All references to the
822 * object are gone, so we don't need to lock it.
824 if (object->type == OBJT_VNODE) {
825 struct vnode *vp = (struct vnode *)object->handle;
828 * Clean pages and flush buffers.
830 vm_object_page_clean(object, 0, 0, OBJPC_SYNC);
831 VM_OBJECT_WUNLOCK(object);
833 vinvalbuf(vp, V_SAVE, 0, 0);
835 BO_LOCK(&vp->v_bufobj);
836 vp->v_bufobj.bo_flag |= BO_DEAD;
837 BO_UNLOCK(&vp->v_bufobj);
839 VM_OBJECT_WLOCK(object);
842 KASSERT(object->ref_count == 0,
843 ("vm_object_terminate: object with references, ref_count=%d",
846 if ((object->flags & OBJ_PG_DTOR) == 0)
847 vm_object_terminate_pages(object);
849 #if VM_NRESERVLEVEL > 0
850 if (__predict_false(!LIST_EMPTY(&object->rvq)))
851 vm_reserv_break_all(object);
854 KASSERT(object->cred == NULL || object->type == OBJT_DEFAULT ||
855 object->type == OBJT_SWAP,
856 ("%s: non-swap obj %p has cred", __func__, object));
859 * Let the pager know object is dead.
861 vm_pager_deallocate(object);
862 VM_OBJECT_WUNLOCK(object);
864 vm_object_destroy(object);
868 * Make the page read-only so that we can clear the object flags. However, if
869 * this is a nosync mmap then the object is likely to stay dirty so do not
870 * mess with the page and do not clear the object flags. Returns TRUE if the
871 * page should be flushed, and FALSE otherwise.
874 vm_object_page_remove_write(vm_page_t p, int flags, boolean_t *clearobjflags)
878 * If we have been asked to skip nosync pages and this is a
879 * nosync page, skip it. Note that the object flags were not
880 * cleared in this case so we do not have to set them.
882 if ((flags & OBJPC_NOSYNC) != 0 && (p->oflags & VPO_NOSYNC) != 0) {
883 *clearobjflags = FALSE;
886 pmap_remove_write(p);
887 return (p->dirty != 0);
892 * vm_object_page_clean
894 * Clean all dirty pages in the specified range of object. Leaves page
895 * on whatever queue it is currently on. If NOSYNC is set then do not
896 * write out pages with VPO_NOSYNC set (originally comes from MAP_NOSYNC),
897 * leaving the object dirty.
899 * When stuffing pages asynchronously, allow clustering. XXX we need a
900 * synchronous clustering mode implementation.
902 * Odd semantics: if start == end, we clean everything.
904 * The object must be locked.
906 * Returns FALSE if some page from the range was not written, as
907 * reported by the pager, and TRUE otherwise.
910 vm_object_page_clean(vm_object_t object, vm_ooffset_t start, vm_ooffset_t end,
914 vm_pindex_t pi, tend, tstart;
915 int curgeneration, n, pagerflags;
916 boolean_t clearobjflags, eio, res;
918 VM_OBJECT_ASSERT_WLOCKED(object);
921 * The OBJ_MIGHTBEDIRTY flag is only set for OBJT_VNODE
922 * objects. The check below prevents the function from
923 * operating on non-vnode objects.
925 if ((object->flags & OBJ_MIGHTBEDIRTY) == 0 ||
926 object->resident_page_count == 0)
929 pagerflags = (flags & (OBJPC_SYNC | OBJPC_INVAL)) != 0 ?
930 VM_PAGER_PUT_SYNC : VM_PAGER_CLUSTER_OK;
931 pagerflags |= (flags & OBJPC_INVAL) != 0 ? VM_PAGER_PUT_INVAL : 0;
933 tstart = OFF_TO_IDX(start);
934 tend = (end == 0) ? object->size : OFF_TO_IDX(end + PAGE_MASK);
935 clearobjflags = tstart == 0 && tend >= object->size;
939 curgeneration = object->generation;
941 for (p = vm_page_find_least(object, tstart); p != NULL; p = np) {
945 np = TAILQ_NEXT(p, listq);
948 if (vm_page_sleep_if_busy(p, "vpcwai")) {
949 if (object->generation != curgeneration) {
950 if ((flags & OBJPC_SYNC) != 0)
953 clearobjflags = FALSE;
955 np = vm_page_find_least(object, pi);
958 if (!vm_object_page_remove_write(p, flags, &clearobjflags))
961 n = vm_object_page_collect_flush(object, p, pagerflags,
962 flags, &clearobjflags, &eio);
965 clearobjflags = FALSE;
967 if (object->generation != curgeneration) {
968 if ((flags & OBJPC_SYNC) != 0)
971 clearobjflags = FALSE;
975 * If the VOP_PUTPAGES() did a truncated write, so
976 * that even the first page of the run is not fully
977 * written, vm_pageout_flush() returns 0 as the run
978 * length. Since the condition that caused truncated
979 * write may be permanent, e.g. exhausted free space,
980 * accepting n == 0 would cause an infinite loop.
982 * Forwarding the iterator leaves the unwritten page
983 * behind, but there is not much we can do there if
984 * filesystem refuses to write it.
988 clearobjflags = FALSE;
990 np = vm_page_find_least(object, pi + n);
993 VOP_FSYNC(vp, (pagerflags & VM_PAGER_PUT_SYNC) ? MNT_WAIT : 0);
997 vm_object_clear_flag(object, OBJ_MIGHTBEDIRTY);
1002 vm_object_page_collect_flush(vm_object_t object, vm_page_t p, int pagerflags,
1003 int flags, boolean_t *clearobjflags, boolean_t *eio)
1005 vm_page_t ma[vm_pageout_page_count], p_first, tp;
1006 int count, i, mreq, runlen;
1008 vm_page_lock_assert(p, MA_NOTOWNED);
1009 VM_OBJECT_ASSERT_WLOCKED(object);
1014 for (tp = p; count < vm_pageout_page_count; count++) {
1015 tp = vm_page_next(tp);
1016 if (tp == NULL || vm_page_busied(tp))
1018 if (!vm_object_page_remove_write(tp, flags, clearobjflags))
1022 for (p_first = p; count < vm_pageout_page_count; count++) {
1023 tp = vm_page_prev(p_first);
1024 if (tp == NULL || vm_page_busied(tp))
1026 if (!vm_object_page_remove_write(tp, flags, clearobjflags))
1032 for (tp = p_first, i = 0; i < count; tp = TAILQ_NEXT(tp, listq), i++)
1035 vm_pageout_flush(ma, count, pagerflags, mreq, &runlen, eio);
1040 * Note that there is absolutely no sense in writing out
1041 * anonymous objects, so we track down the vnode object
1043 * We invalidate (remove) all pages from the address space
1044 * for semantic correctness.
1046 * If the backing object is a device object with unmanaged pages, then any
1047 * mappings to the specified range of pages must be removed before this
1048 * function is called.
1050 * Note: certain anonymous maps, such as MAP_NOSYNC maps,
1051 * may start out with a NULL object.
1054 vm_object_sync(vm_object_t object, vm_ooffset_t offset, vm_size_t size,
1055 boolean_t syncio, boolean_t invalidate)
1057 vm_object_t backing_object;
1060 int error, flags, fsync_after;
1067 VM_OBJECT_WLOCK(object);
1068 while ((backing_object = object->backing_object) != NULL) {
1069 VM_OBJECT_WLOCK(backing_object);
1070 offset += object->backing_object_offset;
1071 VM_OBJECT_WUNLOCK(object);
1072 object = backing_object;
1073 if (object->size < OFF_TO_IDX(offset + size))
1074 size = IDX_TO_OFF(object->size) - offset;
1077 * Flush pages if writing is allowed, invalidate them
1078 * if invalidation requested. Pages undergoing I/O
1079 * will be ignored by vm_object_page_remove().
1081 * We cannot lock the vnode and then wait for paging
1082 * to complete without deadlocking against vm_fault.
1083 * Instead we simply call vm_object_page_remove() and
1084 * allow it to block internally on a page-by-page
1085 * basis when it encounters pages undergoing async
1088 if (object->type == OBJT_VNODE &&
1089 (object->flags & OBJ_MIGHTBEDIRTY) != 0 &&
1090 ((vp = object->handle)->v_vflag & VV_NOSYNC) == 0) {
1091 VM_OBJECT_WUNLOCK(object);
1092 (void) vn_start_write(vp, &mp, V_WAIT);
1093 vn_lock(vp, LK_EXCLUSIVE | LK_RETRY);
1094 if (syncio && !invalidate && offset == 0 &&
1095 atop(size) == object->size) {
1097 * If syncing the whole mapping of the file,
1098 * it is faster to schedule all the writes in
1099 * async mode, also allowing the clustering,
1100 * and then wait for i/o to complete.
1105 flags = (syncio || invalidate) ? OBJPC_SYNC : 0;
1106 flags |= invalidate ? (OBJPC_SYNC | OBJPC_INVAL) : 0;
1107 fsync_after = FALSE;
1109 VM_OBJECT_WLOCK(object);
1110 res = vm_object_page_clean(object, offset, offset + size,
1112 VM_OBJECT_WUNLOCK(object);
1114 error = VOP_FSYNC(vp, MNT_WAIT, curthread);
1116 vn_finished_write(mp);
1119 VM_OBJECT_WLOCK(object);
1121 if ((object->type == OBJT_VNODE ||
1122 object->type == OBJT_DEVICE) && invalidate) {
1123 if (object->type == OBJT_DEVICE)
1125 * The option OBJPR_NOTMAPPED must be passed here
1126 * because vm_object_page_remove() cannot remove
1127 * unmanaged mappings.
1129 flags = OBJPR_NOTMAPPED;
1133 flags = OBJPR_CLEANONLY;
1134 vm_object_page_remove(object, OFF_TO_IDX(offset),
1135 OFF_TO_IDX(offset + size + PAGE_MASK), flags);
1137 VM_OBJECT_WUNLOCK(object);
1142 * Determine whether the given advice can be applied to the object. Advice is
1143 * not applied to unmanaged pages since they never belong to page queues, and
1144 * since MADV_FREE is destructive, it can apply only to anonymous pages that
1145 * have been mapped at most once.
1148 vm_object_advice_applies(vm_object_t object, int advice)
1151 if ((object->flags & OBJ_UNMANAGED) != 0)
1153 if (advice != MADV_FREE)
1155 return ((object->type == OBJT_DEFAULT || object->type == OBJT_SWAP) &&
1156 (object->flags & OBJ_ONEMAPPING) != 0);
1160 vm_object_madvise_freespace(vm_object_t object, int advice, vm_pindex_t pindex,
1164 if (advice == MADV_FREE && object->type == OBJT_SWAP)
1165 swap_pager_freespace(object, pindex, size);
1169 * vm_object_madvise:
1171 * Implements the madvise function at the object/page level.
1173 * MADV_WILLNEED (any object)
1175 * Activate the specified pages if they are resident.
1177 * MADV_DONTNEED (any object)
1179 * Deactivate the specified pages if they are resident.
1181 * MADV_FREE (OBJT_DEFAULT/OBJT_SWAP objects,
1182 * OBJ_ONEMAPPING only)
1184 * Deactivate and clean the specified pages if they are
1185 * resident. This permits the process to reuse the pages
1186 * without faulting or the kernel to reclaim the pages
1190 vm_object_madvise(vm_object_t object, vm_pindex_t pindex, vm_pindex_t end,
1193 vm_pindex_t tpindex;
1194 vm_object_t backing_object, tobject;
1201 VM_OBJECT_WLOCK(object);
1202 if (!vm_object_advice_applies(object, advice)) {
1203 VM_OBJECT_WUNLOCK(object);
1206 for (m = vm_page_find_least(object, pindex); pindex < end; pindex++) {
1210 * If the next page isn't resident in the top-level object, we
1211 * need to search the shadow chain. When applying MADV_FREE, we
1212 * take care to release any swap space used to store
1213 * non-resident pages.
1215 if (m == NULL || pindex < m->pindex) {
1217 * Optimize a common case: if the top-level object has
1218 * no backing object, we can skip over the non-resident
1219 * range in constant time.
1221 if (object->backing_object == NULL) {
1222 tpindex = (m != NULL && m->pindex < end) ?
1224 vm_object_madvise_freespace(object, advice,
1225 pindex, tpindex - pindex);
1226 if ((pindex = tpindex) == end)
1233 vm_object_madvise_freespace(tobject, advice,
1236 * Prepare to search the next object in the
1239 backing_object = tobject->backing_object;
1240 if (backing_object == NULL)
1242 VM_OBJECT_WLOCK(backing_object);
1244 OFF_TO_IDX(tobject->backing_object_offset);
1245 if (tobject != object)
1246 VM_OBJECT_WUNLOCK(tobject);
1247 tobject = backing_object;
1248 if (!vm_object_advice_applies(tobject, advice))
1250 } while ((tm = vm_page_lookup(tobject, tpindex)) ==
1255 m = TAILQ_NEXT(m, listq);
1259 * If the page is not in a normal state, skip it.
1261 if (tm->valid != VM_PAGE_BITS_ALL)
1264 if (tm->hold_count != 0 || tm->wire_count != 0) {
1268 KASSERT((tm->flags & PG_FICTITIOUS) == 0,
1269 ("vm_object_madvise: page %p is fictitious", tm));
1270 KASSERT((tm->oflags & VPO_UNMANAGED) == 0,
1271 ("vm_object_madvise: page %p is not managed", tm));
1272 if (vm_page_busied(tm)) {
1273 if (object != tobject)
1274 VM_OBJECT_WUNLOCK(tobject);
1275 VM_OBJECT_WUNLOCK(object);
1276 if (advice == MADV_WILLNEED) {
1278 * Reference the page before unlocking and
1279 * sleeping so that the page daemon is less
1280 * likely to reclaim it.
1282 vm_page_aflag_set(tm, PGA_REFERENCED);
1284 vm_page_busy_sleep(tm, "madvpo", false);
1287 vm_page_advise(tm, advice);
1289 vm_object_madvise_freespace(tobject, advice, tm->pindex, 1);
1291 if (tobject != object)
1292 VM_OBJECT_WUNLOCK(tobject);
1294 VM_OBJECT_WUNLOCK(object);
1300 * Create a new object which is backed by the
1301 * specified existing object range. The source
1302 * object reference is deallocated.
1304 * The new object and offset into that object
1305 * are returned in the source parameters.
1309 vm_object_t *object, /* IN/OUT */
1310 vm_ooffset_t *offset, /* IN/OUT */
1319 * Don't create the new object if the old object isn't shared.
1321 if (source != NULL) {
1322 VM_OBJECT_WLOCK(source);
1323 if (source->ref_count == 1 &&
1324 source->handle == NULL &&
1325 (source->type == OBJT_DEFAULT ||
1326 source->type == OBJT_SWAP)) {
1327 VM_OBJECT_WUNLOCK(source);
1330 VM_OBJECT_WUNLOCK(source);
1334 * Allocate a new object with the given length.
1336 result = vm_object_allocate(OBJT_DEFAULT, atop(length));
1339 * The new object shadows the source object, adding a reference to it.
1340 * Our caller changes his reference to point to the new object,
1341 * removing a reference to the source object. Net result: no change
1342 * of reference count.
1344 * Try to optimize the result object's page color when shadowing
1345 * in order to maintain page coloring consistency in the combined
1348 result->backing_object = source;
1350 * Store the offset into the source object, and fix up the offset into
1353 result->backing_object_offset = *offset;
1354 if (source != NULL) {
1355 VM_OBJECT_WLOCK(source);
1356 LIST_INSERT_HEAD(&source->shadow_head, result, shadow_list);
1357 source->shadow_count++;
1358 #if VM_NRESERVLEVEL > 0
1359 result->flags |= source->flags & OBJ_COLORED;
1360 result->pg_color = (source->pg_color + OFF_TO_IDX(*offset)) &
1361 ((1 << (VM_NFREEORDER - 1)) - 1);
1363 VM_OBJECT_WUNLOCK(source);
1368 * Return the new things
1377 * Split the pages in a map entry into a new object. This affords
1378 * easier removal of unused pages, and keeps object inheritance from
1379 * being a negative impact on memory usage.
1382 vm_object_split(vm_map_entry_t entry)
1384 vm_page_t m, m_next;
1385 vm_object_t orig_object, new_object, source;
1386 vm_pindex_t idx, offidxstart;
1389 orig_object = entry->object.vm_object;
1390 if (orig_object->type != OBJT_DEFAULT && orig_object->type != OBJT_SWAP)
1392 if (orig_object->ref_count <= 1)
1394 VM_OBJECT_WUNLOCK(orig_object);
1396 offidxstart = OFF_TO_IDX(entry->offset);
1397 size = atop(entry->end - entry->start);
1400 * If swap_pager_copy() is later called, it will convert new_object
1401 * into a swap object.
1403 new_object = vm_object_allocate(OBJT_DEFAULT, size);
1406 * At this point, the new object is still private, so the order in
1407 * which the original and new objects are locked does not matter.
1409 VM_OBJECT_WLOCK(new_object);
1410 VM_OBJECT_WLOCK(orig_object);
1411 source = orig_object->backing_object;
1412 if (source != NULL) {
1413 VM_OBJECT_WLOCK(source);
1414 if ((source->flags & OBJ_DEAD) != 0) {
1415 VM_OBJECT_WUNLOCK(source);
1416 VM_OBJECT_WUNLOCK(orig_object);
1417 VM_OBJECT_WUNLOCK(new_object);
1418 vm_object_deallocate(new_object);
1419 VM_OBJECT_WLOCK(orig_object);
1422 LIST_INSERT_HEAD(&source->shadow_head,
1423 new_object, shadow_list);
1424 source->shadow_count++;
1425 vm_object_reference_locked(source); /* for new_object */
1426 vm_object_clear_flag(source, OBJ_ONEMAPPING);
1427 VM_OBJECT_WUNLOCK(source);
1428 new_object->backing_object_offset =
1429 orig_object->backing_object_offset + entry->offset;
1430 new_object->backing_object = source;
1432 if (orig_object->cred != NULL) {
1433 new_object->cred = orig_object->cred;
1434 crhold(orig_object->cred);
1435 new_object->charge = ptoa(size);
1436 KASSERT(orig_object->charge >= ptoa(size),
1437 ("orig_object->charge < 0"));
1438 orig_object->charge -= ptoa(size);
1441 m = vm_page_find_least(orig_object, offidxstart);
1442 for (; m != NULL && (idx = m->pindex - offidxstart) < size;
1444 m_next = TAILQ_NEXT(m, listq);
1447 * We must wait for pending I/O to complete before we can
1450 * We do not have to VM_PROT_NONE the page as mappings should
1451 * not be changed by this operation.
1453 if (vm_page_busied(m)) {
1454 VM_OBJECT_WUNLOCK(new_object);
1456 VM_OBJECT_WUNLOCK(orig_object);
1457 vm_page_busy_sleep(m, "spltwt", false);
1458 VM_OBJECT_WLOCK(orig_object);
1459 VM_OBJECT_WLOCK(new_object);
1463 /* vm_page_rename() will dirty the page. */
1464 if (vm_page_rename(m, new_object, idx)) {
1465 VM_OBJECT_WUNLOCK(new_object);
1466 VM_OBJECT_WUNLOCK(orig_object);
1468 VM_OBJECT_WLOCK(orig_object);
1469 VM_OBJECT_WLOCK(new_object);
1472 #if VM_NRESERVLEVEL > 0
1474 * If some of the reservation's allocated pages remain with
1475 * the original object, then transferring the reservation to
1476 * the new object is neither particularly beneficial nor
1477 * particularly harmful as compared to leaving the reservation
1478 * with the original object. If, however, all of the
1479 * reservation's allocated pages are transferred to the new
1480 * object, then transferring the reservation is typically
1481 * beneficial. Determining which of these two cases applies
1482 * would be more costly than unconditionally renaming the
1485 vm_reserv_rename(m, new_object, orig_object, offidxstart);
1487 if (orig_object->type == OBJT_SWAP)
1490 if (orig_object->type == OBJT_SWAP) {
1492 * swap_pager_copy() can sleep, in which case the orig_object's
1493 * and new_object's locks are released and reacquired.
1495 swap_pager_copy(orig_object, new_object, offidxstart, 0);
1496 TAILQ_FOREACH(m, &new_object->memq, listq)
1499 VM_OBJECT_WUNLOCK(orig_object);
1500 VM_OBJECT_WUNLOCK(new_object);
1501 entry->object.vm_object = new_object;
1502 entry->offset = 0LL;
1503 vm_object_deallocate(orig_object);
1504 VM_OBJECT_WLOCK(new_object);
1507 #define OBSC_COLLAPSE_NOWAIT 0x0002
1508 #define OBSC_COLLAPSE_WAIT 0x0004
1511 vm_object_collapse_scan_wait(vm_object_t object, vm_page_t p, vm_page_t next,
1514 vm_object_t backing_object;
1516 VM_OBJECT_ASSERT_WLOCKED(object);
1517 backing_object = object->backing_object;
1518 VM_OBJECT_ASSERT_WLOCKED(backing_object);
1520 KASSERT(p == NULL || vm_page_busied(p), ("unbusy page %p", p));
1521 KASSERT(p == NULL || p->object == object || p->object == backing_object,
1522 ("invalid ownership %p %p %p", p, object, backing_object));
1523 if ((op & OBSC_COLLAPSE_NOWAIT) != 0)
1527 VM_OBJECT_WUNLOCK(object);
1528 VM_OBJECT_WUNLOCK(backing_object);
1529 /* The page is only NULL when rename fails. */
1533 vm_page_busy_sleep(p, "vmocol", false);
1534 VM_OBJECT_WLOCK(object);
1535 VM_OBJECT_WLOCK(backing_object);
1536 return (TAILQ_FIRST(&backing_object->memq));
1540 vm_object_scan_all_shadowed(vm_object_t object)
1542 vm_object_t backing_object;
1544 vm_pindex_t backing_offset_index, new_pindex, pi, ps;
1546 VM_OBJECT_ASSERT_WLOCKED(object);
1547 VM_OBJECT_ASSERT_WLOCKED(object->backing_object);
1549 backing_object = object->backing_object;
1551 if (backing_object->type != OBJT_DEFAULT &&
1552 backing_object->type != OBJT_SWAP)
1555 pi = backing_offset_index = OFF_TO_IDX(object->backing_object_offset);
1556 p = vm_page_find_least(backing_object, pi);
1557 ps = swap_pager_find_least(backing_object, pi);
1560 * Only check pages inside the parent object's range and
1561 * inside the parent object's mapping of the backing object.
1564 if (p != NULL && p->pindex < pi)
1565 p = TAILQ_NEXT(p, listq);
1567 ps = swap_pager_find_least(backing_object, pi);
1568 if (p == NULL && ps >= backing_object->size)
1573 pi = MIN(p->pindex, ps);
1575 new_pindex = pi - backing_offset_index;
1576 if (new_pindex >= object->size)
1580 * See if the parent has the page or if the parent's object
1581 * pager has the page. If the parent has the page but the page
1582 * is not valid, the parent's object pager must have the page.
1584 * If this fails, the parent does not completely shadow the
1585 * object and we might as well give up now.
1587 pp = vm_page_lookup(object, new_pindex);
1588 if ((pp == NULL || pp->valid == 0) &&
1589 !vm_pager_has_page(object, new_pindex, NULL, NULL))
1596 vm_object_collapse_scan(vm_object_t object, int op)
1598 vm_object_t backing_object;
1599 vm_page_t next, p, pp;
1600 vm_pindex_t backing_offset_index, new_pindex;
1602 VM_OBJECT_ASSERT_WLOCKED(object);
1603 VM_OBJECT_ASSERT_WLOCKED(object->backing_object);
1605 backing_object = object->backing_object;
1606 backing_offset_index = OFF_TO_IDX(object->backing_object_offset);
1609 * Initial conditions
1611 if ((op & OBSC_COLLAPSE_WAIT) != 0)
1612 vm_object_set_flag(backing_object, OBJ_DEAD);
1617 for (p = TAILQ_FIRST(&backing_object->memq); p != NULL; p = next) {
1618 next = TAILQ_NEXT(p, listq);
1619 new_pindex = p->pindex - backing_offset_index;
1622 * Check for busy page
1624 if (vm_page_busied(p)) {
1625 next = vm_object_collapse_scan_wait(object, p, next, op);
1629 KASSERT(p->object == backing_object,
1630 ("vm_object_collapse_scan: object mismatch"));
1632 if (p->pindex < backing_offset_index ||
1633 new_pindex >= object->size) {
1634 if (backing_object->type == OBJT_SWAP)
1635 swap_pager_freespace(backing_object, p->pindex,
1639 * Page is out of the parent object's range, we can
1640 * simply destroy it.
1643 KASSERT(!pmap_page_is_mapped(p),
1644 ("freeing mapped page %p", p));
1645 if (p->wire_count == 0)
1653 pp = vm_page_lookup(object, new_pindex);
1654 if (pp != NULL && vm_page_busied(pp)) {
1656 * The page in the parent is busy and possibly not
1657 * (yet) valid. Until its state is finalized by the
1658 * busy bit owner, we can't tell whether it shadows the
1659 * original page. Therefore, we must either skip it
1660 * and the original (backing_object) page or wait for
1661 * its state to be finalized.
1663 * This is due to a race with vm_fault() where we must
1664 * unbusy the original (backing_obj) page before we can
1665 * (re)lock the parent. Hence we can get here.
1667 next = vm_object_collapse_scan_wait(object, pp, next,
1672 KASSERT(pp == NULL || pp->valid != 0,
1673 ("unbusy invalid page %p", pp));
1675 if (pp != NULL || vm_pager_has_page(object, new_pindex, NULL,
1678 * The page already exists in the parent OR swap exists
1679 * for this location in the parent. Leave the parent's
1680 * page alone. Destroy the original page from the
1683 if (backing_object->type == OBJT_SWAP)
1684 swap_pager_freespace(backing_object, p->pindex,
1687 KASSERT(!pmap_page_is_mapped(p),
1688 ("freeing mapped page %p", p));
1689 if (p->wire_count == 0)
1698 * Page does not exist in parent, rename the page from the
1699 * backing object to the main object.
1701 * If the page was mapped to a process, it can remain mapped
1702 * through the rename. vm_page_rename() will dirty the page.
1704 if (vm_page_rename(p, object, new_pindex)) {
1705 next = vm_object_collapse_scan_wait(object, NULL, next,
1710 /* Use the old pindex to free the right page. */
1711 if (backing_object->type == OBJT_SWAP)
1712 swap_pager_freespace(backing_object,
1713 new_pindex + backing_offset_index, 1);
1715 #if VM_NRESERVLEVEL > 0
1717 * Rename the reservation.
1719 vm_reserv_rename(p, object, backing_object,
1720 backing_offset_index);
1728 * this version of collapse allows the operation to occur earlier and
1729 * when paging_in_progress is true for an object... This is not a complete
1730 * operation, but should plug 99.9% of the rest of the leaks.
1733 vm_object_qcollapse(vm_object_t object)
1735 vm_object_t backing_object = object->backing_object;
1737 VM_OBJECT_ASSERT_WLOCKED(object);
1738 VM_OBJECT_ASSERT_WLOCKED(backing_object);
1740 if (backing_object->ref_count != 1)
1743 vm_object_collapse_scan(object, OBSC_COLLAPSE_NOWAIT);
1747 * vm_object_collapse:
1749 * Collapse an object with the object backing it.
1750 * Pages in the backing object are moved into the
1751 * parent, and the backing object is deallocated.
1754 vm_object_collapse(vm_object_t object)
1756 vm_object_t backing_object, new_backing_object;
1758 VM_OBJECT_ASSERT_WLOCKED(object);
1762 * Verify that the conditions are right for collapse:
1764 * The object exists and the backing object exists.
1766 if ((backing_object = object->backing_object) == NULL)
1770 * we check the backing object first, because it is most likely
1773 VM_OBJECT_WLOCK(backing_object);
1774 if (backing_object->handle != NULL ||
1775 (backing_object->type != OBJT_DEFAULT &&
1776 backing_object->type != OBJT_SWAP) ||
1777 (backing_object->flags & OBJ_DEAD) ||
1778 object->handle != NULL ||
1779 (object->type != OBJT_DEFAULT &&
1780 object->type != OBJT_SWAP) ||
1781 (object->flags & OBJ_DEAD)) {
1782 VM_OBJECT_WUNLOCK(backing_object);
1786 if (object->paging_in_progress != 0 ||
1787 backing_object->paging_in_progress != 0) {
1788 vm_object_qcollapse(object);
1789 VM_OBJECT_WUNLOCK(backing_object);
1794 * We know that we can either collapse the backing object (if
1795 * the parent is the only reference to it) or (perhaps) have
1796 * the parent bypass the object if the parent happens to shadow
1797 * all the resident pages in the entire backing object.
1799 * This is ignoring pager-backed pages such as swap pages.
1800 * vm_object_collapse_scan fails the shadowing test in this
1803 if (backing_object->ref_count == 1) {
1804 vm_object_pip_add(object, 1);
1805 vm_object_pip_add(backing_object, 1);
1808 * If there is exactly one reference to the backing
1809 * object, we can collapse it into the parent.
1811 vm_object_collapse_scan(object, OBSC_COLLAPSE_WAIT);
1813 #if VM_NRESERVLEVEL > 0
1815 * Break any reservations from backing_object.
1817 if (__predict_false(!LIST_EMPTY(&backing_object->rvq)))
1818 vm_reserv_break_all(backing_object);
1822 * Move the pager from backing_object to object.
1824 if (backing_object->type == OBJT_SWAP) {
1826 * swap_pager_copy() can sleep, in which case
1827 * the backing_object's and object's locks are
1828 * released and reacquired.
1829 * Since swap_pager_copy() is being asked to
1830 * destroy the source, it will change the
1831 * backing_object's type to OBJT_DEFAULT.
1836 OFF_TO_IDX(object->backing_object_offset), TRUE);
1839 * Object now shadows whatever backing_object did.
1840 * Note that the reference to
1841 * backing_object->backing_object moves from within
1842 * backing_object to within object.
1844 LIST_REMOVE(object, shadow_list);
1845 backing_object->shadow_count--;
1846 if (backing_object->backing_object) {
1847 VM_OBJECT_WLOCK(backing_object->backing_object);
1848 LIST_REMOVE(backing_object, shadow_list);
1850 &backing_object->backing_object->shadow_head,
1851 object, shadow_list);
1853 * The shadow_count has not changed.
1855 VM_OBJECT_WUNLOCK(backing_object->backing_object);
1857 object->backing_object = backing_object->backing_object;
1858 object->backing_object_offset +=
1859 backing_object->backing_object_offset;
1862 * Discard backing_object.
1864 * Since the backing object has no pages, no pager left,
1865 * and no object references within it, all that is
1866 * necessary is to dispose of it.
1868 KASSERT(backing_object->ref_count == 1, (
1869 "backing_object %p was somehow re-referenced during collapse!",
1871 vm_object_pip_wakeup(backing_object);
1872 backing_object->type = OBJT_DEAD;
1873 backing_object->ref_count = 0;
1874 VM_OBJECT_WUNLOCK(backing_object);
1875 vm_object_destroy(backing_object);
1877 vm_object_pip_wakeup(object);
1881 * If we do not entirely shadow the backing object,
1882 * there is nothing we can do so we give up.
1884 if (object->resident_page_count != object->size &&
1885 !vm_object_scan_all_shadowed(object)) {
1886 VM_OBJECT_WUNLOCK(backing_object);
1891 * Make the parent shadow the next object in the
1892 * chain. Deallocating backing_object will not remove
1893 * it, since its reference count is at least 2.
1895 LIST_REMOVE(object, shadow_list);
1896 backing_object->shadow_count--;
1898 new_backing_object = backing_object->backing_object;
1899 if ((object->backing_object = new_backing_object) != NULL) {
1900 VM_OBJECT_WLOCK(new_backing_object);
1902 &new_backing_object->shadow_head,
1906 new_backing_object->shadow_count++;
1907 vm_object_reference_locked(new_backing_object);
1908 VM_OBJECT_WUNLOCK(new_backing_object);
1909 object->backing_object_offset +=
1910 backing_object->backing_object_offset;
1914 * Drop the reference count on backing_object. Since
1915 * its ref_count was at least 2, it will not vanish.
1917 backing_object->ref_count--;
1918 VM_OBJECT_WUNLOCK(backing_object);
1923 * Try again with this object's new backing object.
1929 * vm_object_page_remove:
1931 * For the given object, either frees or invalidates each of the
1932 * specified pages. In general, a page is freed. However, if a page is
1933 * wired for any reason other than the existence of a managed, wired
1934 * mapping, then it may be invalidated but not removed from the object.
1935 * Pages are specified by the given range ["start", "end") and the option
1936 * OBJPR_CLEANONLY. As a special case, if "end" is zero, then the range
1937 * extends from "start" to the end of the object. If the option
1938 * OBJPR_CLEANONLY is specified, then only the non-dirty pages within the
1939 * specified range are affected. If the option OBJPR_NOTMAPPED is
1940 * specified, then the pages within the specified range must have no
1941 * mappings. Otherwise, if this option is not specified, any mappings to
1942 * the specified pages are removed before the pages are freed or
1945 * In general, this operation should only be performed on objects that
1946 * contain managed pages. There are, however, two exceptions. First, it
1947 * is performed on the kernel and kmem objects by vm_map_entry_delete().
1948 * Second, it is used by msync(..., MS_INVALIDATE) to invalidate device-
1949 * backed pages. In both of these cases, the option OBJPR_CLEANONLY must
1950 * not be specified and the option OBJPR_NOTMAPPED must be specified.
1952 * The object must be locked.
1955 vm_object_page_remove(vm_object_t object, vm_pindex_t start, vm_pindex_t end,
1962 VM_OBJECT_ASSERT_WLOCKED(object);
1963 KASSERT((object->flags & OBJ_UNMANAGED) == 0 ||
1964 (options & (OBJPR_CLEANONLY | OBJPR_NOTMAPPED)) == OBJPR_NOTMAPPED,
1965 ("vm_object_page_remove: illegal options for object %p", object));
1966 if (object->resident_page_count == 0)
1968 vm_object_pip_add(object, 1);
1971 p = vm_page_find_least(object, start);
1975 * Here, the variable "p" is either (1) the page with the least pindex
1976 * greater than or equal to the parameter "start" or (2) NULL.
1978 for (; p != NULL && (p->pindex < end || end == 0); p = next) {
1979 next = TAILQ_NEXT(p, listq);
1982 * If the page is wired for any reason besides the existence
1983 * of managed, wired mappings, then it cannot be freed. For
1984 * example, fictitious pages, which represent device memory,
1985 * are inherently wired and cannot be freed. They can,
1986 * however, be invalidated if the option OBJPR_CLEANONLY is
1989 vm_page_change_lock(p, &mtx);
1990 if (vm_page_xbusied(p)) {
1991 VM_OBJECT_WUNLOCK(object);
1992 vm_page_busy_sleep(p, "vmopax", true);
1993 VM_OBJECT_WLOCK(object);
1996 if (p->wire_count != 0) {
1997 if ((options & OBJPR_NOTMAPPED) == 0 &&
1998 object->ref_count != 0)
2000 if ((options & OBJPR_CLEANONLY) == 0) {
2006 if (vm_page_busied(p)) {
2007 VM_OBJECT_WUNLOCK(object);
2008 vm_page_busy_sleep(p, "vmopar", false);
2009 VM_OBJECT_WLOCK(object);
2012 KASSERT((p->flags & PG_FICTITIOUS) == 0,
2013 ("vm_object_page_remove: page %p is fictitious", p));
2014 if ((options & OBJPR_CLEANONLY) != 0 && p->valid != 0) {
2015 if ((options & OBJPR_NOTMAPPED) == 0 &&
2016 object->ref_count != 0)
2017 pmap_remove_write(p);
2021 if ((options & OBJPR_NOTMAPPED) == 0 && object->ref_count != 0)
2023 p->flags &= ~PG_ZERO;
2024 if (vm_page_free_prep(p, false))
2025 TAILQ_INSERT_TAIL(&pgl, p, listq);
2029 vm_page_free_phys_pglist(&pgl);
2030 vm_object_pip_wakeup(object);
2034 * vm_object_page_noreuse:
2036 * For the given object, attempt to move the specified pages to
2037 * the head of the inactive queue. This bypasses regular LRU
2038 * operation and allows the pages to be reused quickly under memory
2039 * pressure. If a page is wired for any reason, then it will not
2040 * be queued. Pages are specified by the range ["start", "end").
2041 * As a special case, if "end" is zero, then the range extends from
2042 * "start" to the end of the object.
2044 * This operation should only be performed on objects that
2045 * contain non-fictitious, managed pages.
2047 * The object must be locked.
2050 vm_object_page_noreuse(vm_object_t object, vm_pindex_t start, vm_pindex_t end)
2055 VM_OBJECT_ASSERT_LOCKED(object);
2056 KASSERT((object->flags & (OBJ_FICTITIOUS | OBJ_UNMANAGED)) == 0,
2057 ("vm_object_page_noreuse: illegal object %p", object));
2058 if (object->resident_page_count == 0)
2060 p = vm_page_find_least(object, start);
2063 * Here, the variable "p" is either (1) the page with the least pindex
2064 * greater than or equal to the parameter "start" or (2) NULL.
2067 for (; p != NULL && (p->pindex < end || end == 0); p = next) {
2068 next = TAILQ_NEXT(p, listq);
2069 vm_page_change_lock(p, &mtx);
2070 vm_page_deactivate_noreuse(p);
2077 * Populate the specified range of the object with valid pages. Returns
2078 * TRUE if the range is successfully populated and FALSE otherwise.
2080 * Note: This function should be optimized to pass a larger array of
2081 * pages to vm_pager_get_pages() before it is applied to a non-
2082 * OBJT_DEVICE object.
2084 * The object must be locked.
2087 vm_object_populate(vm_object_t object, vm_pindex_t start, vm_pindex_t end)
2093 VM_OBJECT_ASSERT_WLOCKED(object);
2094 for (pindex = start; pindex < end; pindex++) {
2095 m = vm_page_grab(object, pindex, VM_ALLOC_NORMAL);
2096 if (m->valid != VM_PAGE_BITS_ALL) {
2097 rv = vm_pager_get_pages(object, &m, 1, NULL, NULL);
2098 if (rv != VM_PAGER_OK) {
2106 * Keep "m" busy because a subsequent iteration may unlock
2110 if (pindex > start) {
2111 m = vm_page_lookup(object, start);
2112 while (m != NULL && m->pindex < pindex) {
2114 m = TAILQ_NEXT(m, listq);
2117 return (pindex == end);
2121 * Routine: vm_object_coalesce
2122 * Function: Coalesces two objects backing up adjoining
2123 * regions of memory into a single object.
2125 * returns TRUE if objects were combined.
2127 * NOTE: Only works at the moment if the second object is NULL -
2128 * if it's not, which object do we lock first?
2131 * prev_object First object to coalesce
2132 * prev_offset Offset into prev_object
2133 * prev_size Size of reference to prev_object
2134 * next_size Size of reference to the second object
2135 * reserved Indicator that extension region has
2136 * swap accounted for
2139 * The object must *not* be locked.
2142 vm_object_coalesce(vm_object_t prev_object, vm_ooffset_t prev_offset,
2143 vm_size_t prev_size, vm_size_t next_size, boolean_t reserved)
2145 vm_pindex_t next_pindex;
2147 if (prev_object == NULL)
2149 VM_OBJECT_WLOCK(prev_object);
2150 if ((prev_object->type != OBJT_DEFAULT &&
2151 prev_object->type != OBJT_SWAP) ||
2152 (prev_object->flags & OBJ_TMPFS_NODE) != 0) {
2153 VM_OBJECT_WUNLOCK(prev_object);
2158 * Try to collapse the object first
2160 vm_object_collapse(prev_object);
2163 * Can't coalesce if: . more than one reference . paged out . shadows
2164 * another object . has a copy elsewhere (any of which mean that the
2165 * pages not mapped to prev_entry may be in use anyway)
2167 if (prev_object->backing_object != NULL) {
2168 VM_OBJECT_WUNLOCK(prev_object);
2172 prev_size >>= PAGE_SHIFT;
2173 next_size >>= PAGE_SHIFT;
2174 next_pindex = OFF_TO_IDX(prev_offset) + prev_size;
2176 if ((prev_object->ref_count > 1) &&
2177 (prev_object->size != next_pindex)) {
2178 VM_OBJECT_WUNLOCK(prev_object);
2183 * Account for the charge.
2185 if (prev_object->cred != NULL) {
2188 * If prev_object was charged, then this mapping,
2189 * although not charged now, may become writable
2190 * later. Non-NULL cred in the object would prevent
2191 * swap reservation during enabling of the write
2192 * access, so reserve swap now. Failed reservation
2193 * cause allocation of the separate object for the map
2194 * entry, and swap reservation for this entry is
2195 * managed in appropriate time.
2197 if (!reserved && !swap_reserve_by_cred(ptoa(next_size),
2198 prev_object->cred)) {
2199 VM_OBJECT_WUNLOCK(prev_object);
2202 prev_object->charge += ptoa(next_size);
2206 * Remove any pages that may still be in the object from a previous
2209 if (next_pindex < prev_object->size) {
2210 vm_object_page_remove(prev_object, next_pindex, next_pindex +
2212 if (prev_object->type == OBJT_SWAP)
2213 swap_pager_freespace(prev_object,
2214 next_pindex, next_size);
2216 if (prev_object->cred != NULL) {
2217 KASSERT(prev_object->charge >=
2218 ptoa(prev_object->size - next_pindex),
2219 ("object %p overcharged 1 %jx %jx", prev_object,
2220 (uintmax_t)next_pindex, (uintmax_t)next_size));
2221 prev_object->charge -= ptoa(prev_object->size -
2228 * Extend the object if necessary.
2230 if (next_pindex + next_size > prev_object->size)
2231 prev_object->size = next_pindex + next_size;
2233 VM_OBJECT_WUNLOCK(prev_object);
2238 vm_object_set_writeable_dirty(vm_object_t object)
2241 VM_OBJECT_ASSERT_WLOCKED(object);
2242 if (object->type != OBJT_VNODE) {
2243 if ((object->flags & OBJ_TMPFS_NODE) != 0) {
2244 KASSERT(object->type == OBJT_SWAP, ("non-swap tmpfs"));
2245 vm_object_set_flag(object, OBJ_TMPFS_DIRTY);
2249 object->generation++;
2250 if ((object->flags & OBJ_MIGHTBEDIRTY) != 0)
2252 vm_object_set_flag(object, OBJ_MIGHTBEDIRTY);
2258 * For each page offset within the specified range of the given object,
2259 * find the highest-level page in the shadow chain and unwire it. A page
2260 * must exist at every page offset, and the highest-level page must be
2264 vm_object_unwire(vm_object_t object, vm_ooffset_t offset, vm_size_t length,
2267 vm_object_t tobject;
2269 vm_pindex_t end_pindex, pindex, tpindex;
2270 int depth, locked_depth;
2272 KASSERT((offset & PAGE_MASK) == 0,
2273 ("vm_object_unwire: offset is not page aligned"));
2274 KASSERT((length & PAGE_MASK) == 0,
2275 ("vm_object_unwire: length is not a multiple of PAGE_SIZE"));
2276 /* The wired count of a fictitious page never changes. */
2277 if ((object->flags & OBJ_FICTITIOUS) != 0)
2279 pindex = OFF_TO_IDX(offset);
2280 end_pindex = pindex + atop(length);
2282 VM_OBJECT_RLOCK(object);
2283 m = vm_page_find_least(object, pindex);
2284 while (pindex < end_pindex) {
2285 if (m == NULL || pindex < m->pindex) {
2287 * The first object in the shadow chain doesn't
2288 * contain a page at the current index. Therefore,
2289 * the page must exist in a backing object.
2296 OFF_TO_IDX(tobject->backing_object_offset);
2297 tobject = tobject->backing_object;
2298 KASSERT(tobject != NULL,
2299 ("vm_object_unwire: missing page"));
2300 if ((tobject->flags & OBJ_FICTITIOUS) != 0)
2303 if (depth == locked_depth) {
2305 VM_OBJECT_RLOCK(tobject);
2307 } while ((tm = vm_page_lookup(tobject, tpindex)) ==
2311 m = TAILQ_NEXT(m, listq);
2314 vm_page_unwire(tm, queue);
2319 /* Release the accumulated object locks. */
2320 for (depth = 0; depth < locked_depth; depth++) {
2321 tobject = object->backing_object;
2322 VM_OBJECT_RUNLOCK(object);
2328 vm_object_vnode(vm_object_t object)
2331 VM_OBJECT_ASSERT_LOCKED(object);
2332 if (object->type == OBJT_VNODE)
2333 return (object->handle);
2334 if (object->type == OBJT_SWAP && (object->flags & OBJ_TMPFS) != 0)
2335 return (object->un_pager.swp.swp_tmpfs);
2340 sysctl_vm_object_list(SYSCTL_HANDLER_ARGS)
2342 struct kinfo_vmobject *kvo;
2343 char *fullpath, *freepath;
2350 if (req->oldptr == NULL) {
2352 * If an old buffer has not been provided, generate an
2353 * estimate of the space needed for a subsequent call.
2355 mtx_lock(&vm_object_list_mtx);
2357 TAILQ_FOREACH(obj, &vm_object_list, object_list) {
2358 if (obj->type == OBJT_DEAD)
2362 mtx_unlock(&vm_object_list_mtx);
2363 return (SYSCTL_OUT(req, NULL, sizeof(struct kinfo_vmobject) *
2367 kvo = malloc(sizeof(*kvo), M_TEMP, M_WAITOK);
2371 * VM objects are type stable and are never removed from the
2372 * list once added. This allows us to safely read obj->object_list
2373 * after reacquiring the VM object lock.
2375 mtx_lock(&vm_object_list_mtx);
2376 TAILQ_FOREACH(obj, &vm_object_list, object_list) {
2377 if (obj->type == OBJT_DEAD)
2379 VM_OBJECT_RLOCK(obj);
2380 if (obj->type == OBJT_DEAD) {
2381 VM_OBJECT_RUNLOCK(obj);
2384 mtx_unlock(&vm_object_list_mtx);
2385 kvo->kvo_size = ptoa(obj->size);
2386 kvo->kvo_resident = obj->resident_page_count;
2387 kvo->kvo_ref_count = obj->ref_count;
2388 kvo->kvo_shadow_count = obj->shadow_count;
2389 kvo->kvo_memattr = obj->memattr;
2390 kvo->kvo_active = 0;
2391 kvo->kvo_inactive = 0;
2392 TAILQ_FOREACH(m, &obj->memq, listq) {
2394 * A page may belong to the object but be
2395 * dequeued and set to PQ_NONE while the
2396 * object lock is not held. This makes the
2397 * reads of m->queue below racy, and we do not
2398 * count pages set to PQ_NONE. However, this
2399 * sysctl is only meant to give an
2400 * approximation of the system anyway.
2402 if (vm_page_active(m))
2404 else if (vm_page_inactive(m))
2405 kvo->kvo_inactive++;
2408 kvo->kvo_vn_fileid = 0;
2409 kvo->kvo_vn_fsid = 0;
2410 kvo->kvo_vn_fsid_freebsd11 = 0;
2414 switch (obj->type) {
2416 kvo->kvo_type = KVME_TYPE_DEFAULT;
2419 kvo->kvo_type = KVME_TYPE_VNODE;
2424 kvo->kvo_type = KVME_TYPE_SWAP;
2427 kvo->kvo_type = KVME_TYPE_DEVICE;
2430 kvo->kvo_type = KVME_TYPE_PHYS;
2433 kvo->kvo_type = KVME_TYPE_DEAD;
2436 kvo->kvo_type = KVME_TYPE_SG;
2438 case OBJT_MGTDEVICE:
2439 kvo->kvo_type = KVME_TYPE_MGTDEVICE;
2442 kvo->kvo_type = KVME_TYPE_UNKNOWN;
2445 VM_OBJECT_RUNLOCK(obj);
2447 vn_fullpath(curthread, vp, &fullpath, &freepath);
2448 vn_lock(vp, LK_SHARED | LK_RETRY);
2449 if (VOP_GETATTR(vp, &va, curthread->td_ucred) == 0) {
2450 kvo->kvo_vn_fileid = va.va_fileid;
2451 kvo->kvo_vn_fsid = va.va_fsid;
2452 kvo->kvo_vn_fsid_freebsd11 = va.va_fsid;
2458 strlcpy(kvo->kvo_path, fullpath, sizeof(kvo->kvo_path));
2459 if (freepath != NULL)
2460 free(freepath, M_TEMP);
2462 /* Pack record size down */
2463 kvo->kvo_structsize = offsetof(struct kinfo_vmobject, kvo_path)
2464 + strlen(kvo->kvo_path) + 1;
2465 kvo->kvo_structsize = roundup(kvo->kvo_structsize,
2467 error = SYSCTL_OUT(req, kvo, kvo->kvo_structsize);
2468 mtx_lock(&vm_object_list_mtx);
2472 mtx_unlock(&vm_object_list_mtx);
2476 SYSCTL_PROC(_vm, OID_AUTO, objects, CTLTYPE_STRUCT | CTLFLAG_RW | CTLFLAG_SKIP |
2477 CTLFLAG_MPSAFE, NULL, 0, sysctl_vm_object_list, "S,kinfo_vmobject",
2478 "List of VM objects");
2480 #include "opt_ddb.h"
2482 #include <sys/kernel.h>
2484 #include <sys/cons.h>
2486 #include <ddb/ddb.h>
2489 _vm_object_in_map(vm_map_t map, vm_object_t object, vm_map_entry_t entry)
2492 vm_map_entry_t tmpe;
2500 tmpe = map->header.next;
2501 entcount = map->nentries;
2502 while (entcount-- && (tmpe != &map->header)) {
2503 if (_vm_object_in_map(map, object, tmpe)) {
2508 } else if (entry->eflags & MAP_ENTRY_IS_SUB_MAP) {
2509 tmpm = entry->object.sub_map;
2510 tmpe = tmpm->header.next;
2511 entcount = tmpm->nentries;
2512 while (entcount-- && tmpe != &tmpm->header) {
2513 if (_vm_object_in_map(tmpm, object, tmpe)) {
2518 } else if ((obj = entry->object.vm_object) != NULL) {
2519 for (; obj; obj = obj->backing_object)
2520 if (obj == object) {
2528 vm_object_in_map(vm_object_t object)
2532 /* sx_slock(&allproc_lock); */
2533 FOREACH_PROC_IN_SYSTEM(p) {
2534 if (!p->p_vmspace /* || (p->p_flag & (P_SYSTEM|P_WEXIT)) */)
2536 if (_vm_object_in_map(&p->p_vmspace->vm_map, object, 0)) {
2537 /* sx_sunlock(&allproc_lock); */
2541 /* sx_sunlock(&allproc_lock); */
2542 if (_vm_object_in_map(kernel_map, object, 0))
2547 DB_SHOW_COMMAND(vmochk, vm_object_check)
2552 * make sure that internal objs are in a map somewhere
2553 * and none have zero ref counts.
2555 TAILQ_FOREACH(object, &vm_object_list, object_list) {
2556 if (object->handle == NULL &&
2557 (object->type == OBJT_DEFAULT || object->type == OBJT_SWAP)) {
2558 if (object->ref_count == 0) {
2559 db_printf("vmochk: internal obj has zero ref count: %ld\n",
2560 (long)object->size);
2562 if (!vm_object_in_map(object)) {
2564 "vmochk: internal obj is not in a map: "
2565 "ref: %d, size: %lu: 0x%lx, backing_object: %p\n",
2566 object->ref_count, (u_long)object->size,
2567 (u_long)object->size,
2568 (void *)object->backing_object);
2575 * vm_object_print: [ debug ]
2577 DB_SHOW_COMMAND(object, vm_object_print_static)
2579 /* XXX convert args. */
2580 vm_object_t object = (vm_object_t)addr;
2581 boolean_t full = have_addr;
2585 /* XXX count is an (unused) arg. Avoid shadowing it. */
2586 #define count was_count
2594 "Object %p: type=%d, size=0x%jx, res=%d, ref=%d, flags=0x%x ruid %d charge %jx\n",
2595 object, (int)object->type, (uintmax_t)object->size,
2596 object->resident_page_count, object->ref_count, object->flags,
2597 object->cred ? object->cred->cr_ruid : -1, (uintmax_t)object->charge);
2598 db_iprintf(" sref=%d, backing_object(%d)=(%p)+0x%jx\n",
2599 object->shadow_count,
2600 object->backing_object ? object->backing_object->ref_count : 0,
2601 object->backing_object, (uintmax_t)object->backing_object_offset);
2608 TAILQ_FOREACH(p, &object->memq, listq) {
2610 db_iprintf("memory:=");
2611 else if (count == 6) {
2619 db_printf("(off=0x%jx,page=0x%jx)",
2620 (uintmax_t)p->pindex, (uintmax_t)VM_PAGE_TO_PHYS(p));
2630 /* XXX need this non-static entry for calling from vm_map_print. */
2633 /* db_expr_t */ long addr,
2634 boolean_t have_addr,
2635 /* db_expr_t */ long count,
2638 vm_object_print_static(addr, have_addr, count, modif);
2641 DB_SHOW_COMMAND(vmopag, vm_object_print_pages)
2646 vm_page_t m, prev_m;
2650 TAILQ_FOREACH(object, &vm_object_list, object_list) {
2651 db_printf("new object: %p\n", (void *)object);
2662 TAILQ_FOREACH(m, &object->memq, listq) {
2663 if (m->pindex > 128)
2665 if ((prev_m = TAILQ_PREV(m, pglist, listq)) != NULL &&
2666 prev_m->pindex + 1 != m->pindex) {
2668 db_printf(" index(%ld)run(%d)pa(0x%lx)\n",
2669 (long)fidx, rcount, (long)pa);
2681 (VM_PAGE_TO_PHYS(m) == pa + rcount * PAGE_SIZE)) {
2686 db_printf(" index(%ld)run(%d)pa(0x%lx)\n",
2687 (long)fidx, rcount, (long)pa);
2697 pa = VM_PAGE_TO_PHYS(m);
2701 db_printf(" index(%ld)run(%d)pa(0x%lx)\n",
2702 (long)fidx, rcount, (long)pa);