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/refcount.h>
84 #include <sys/socket.h>
85 #include <sys/resourcevar.h>
86 #include <sys/refcount.h>
87 #include <sys/rwlock.h>
89 #include <sys/vnode.h>
90 #include <sys/vmmeter.h>
94 #include <vm/vm_param.h>
96 #include <vm/vm_map.h>
97 #include <vm/vm_object.h>
98 #include <vm/vm_page.h>
99 #include <vm/vm_pageout.h>
100 #include <vm/vm_pager.h>
101 #include <vm/vm_phys.h>
102 #include <vm/vm_pagequeue.h>
103 #include <vm/swap_pager.h>
104 #include <vm/vm_kern.h>
105 #include <vm/vm_extern.h>
106 #include <vm/vm_radix.h>
107 #include <vm/vm_reserv.h>
110 static int old_msync;
111 SYSCTL_INT(_vm, OID_AUTO, old_msync, CTLFLAG_RW, &old_msync, 0,
112 "Use old (insecure) msync behavior");
114 static int vm_object_page_collect_flush(vm_object_t object, vm_page_t p,
115 int pagerflags, int flags, boolean_t *allclean,
117 static boolean_t vm_object_page_remove_write(vm_page_t p, int flags,
118 boolean_t *allclean);
119 static void vm_object_qcollapse(vm_object_t object);
120 static void vm_object_vndeallocate(vm_object_t object);
121 static void vm_object_backing_remove(vm_object_t object);
124 * Virtual memory objects maintain the actual data
125 * associated with allocated virtual memory. A given
126 * page of memory exists within exactly one object.
128 * An object is only deallocated when all "references"
129 * are given up. Only one "reference" to a given
130 * region of an object should be writeable.
132 * Associated with each object is a list of all resident
133 * memory pages belonging to that object; this list is
134 * maintained by the "vm_page" module, and locked by the object's
137 * Each object also records a "pager" routine which is
138 * used to retrieve (and store) pages to the proper backing
139 * storage. In addition, objects may be backed by other
140 * objects from which they were virtual-copied.
142 * The only items within the object structure which are
143 * modified after time of creation are:
144 * reference count locked by object's lock
145 * pager routine locked by object's lock
149 struct object_q vm_object_list;
150 struct mtx vm_object_list_mtx; /* lock for object list and count */
152 struct vm_object kernel_object_store;
154 static SYSCTL_NODE(_vm_stats, OID_AUTO, object, CTLFLAG_RD, 0,
157 static counter_u64_t object_collapses = EARLY_COUNTER;
158 SYSCTL_COUNTER_U64(_vm_stats_object, OID_AUTO, collapses, CTLFLAG_RD,
160 "VM object collapses");
162 static counter_u64_t object_bypasses = EARLY_COUNTER;
163 SYSCTL_COUNTER_U64(_vm_stats_object, OID_AUTO, bypasses, CTLFLAG_RD,
165 "VM object bypasses");
168 counter_startup(void)
171 object_collapses = counter_u64_alloc(M_WAITOK);
172 object_bypasses = counter_u64_alloc(M_WAITOK);
174 SYSINIT(object_counters, SI_SUB_CPU, SI_ORDER_ANY, counter_startup, NULL);
176 static uma_zone_t obj_zone;
178 static int vm_object_zinit(void *mem, int size, int flags);
181 static void vm_object_zdtor(void *mem, int size, void *arg);
184 vm_object_zdtor(void *mem, int size, void *arg)
188 object = (vm_object_t)mem;
189 KASSERT(object->ref_count == 0,
190 ("object %p ref_count = %d", object, object->ref_count));
191 KASSERT(TAILQ_EMPTY(&object->memq),
192 ("object %p has resident pages in its memq", object));
193 KASSERT(vm_radix_is_empty(&object->rtree),
194 ("object %p has resident pages in its trie", object));
195 #if VM_NRESERVLEVEL > 0
196 KASSERT(LIST_EMPTY(&object->rvq),
197 ("object %p has reservations",
200 KASSERT(REFCOUNT_COUNT(object->paging_in_progress) == 0,
201 ("object %p paging_in_progress = %d",
202 object, REFCOUNT_COUNT(object->paging_in_progress)));
203 KASSERT(object->busy == 0,
204 ("object %p busy = %d",
205 object, object->busy));
206 KASSERT(object->resident_page_count == 0,
207 ("object %p resident_page_count = %d",
208 object, object->resident_page_count));
209 KASSERT(object->shadow_count == 0,
210 ("object %p shadow_count = %d",
211 object, object->shadow_count));
212 KASSERT(object->type == OBJT_DEAD,
213 ("object %p has non-dead type %d",
214 object, object->type));
219 vm_object_zinit(void *mem, int size, int flags)
223 object = (vm_object_t)mem;
224 rw_init_flags(&object->lock, "vm object", RW_DUPOK | RW_NEW);
226 /* These are true for any object that has been freed */
227 object->type = OBJT_DEAD;
228 vm_radix_init(&object->rtree);
229 refcount_init(&object->ref_count, 0);
230 refcount_init(&object->paging_in_progress, 0);
231 refcount_init(&object->busy, 0);
232 object->resident_page_count = 0;
233 object->shadow_count = 0;
234 object->flags = OBJ_DEAD;
236 mtx_lock(&vm_object_list_mtx);
237 TAILQ_INSERT_TAIL(&vm_object_list, object, object_list);
238 mtx_unlock(&vm_object_list_mtx);
243 _vm_object_allocate(objtype_t type, vm_pindex_t size, u_short flags,
247 TAILQ_INIT(&object->memq);
248 LIST_INIT(&object->shadow_head);
251 if (type == OBJT_SWAP)
252 pctrie_init(&object->un_pager.swp.swp_blks);
255 * Ensure that swap_pager_swapoff() iteration over object_list
256 * sees up to date type and pctrie head if it observed
259 atomic_thread_fence_rel();
261 object->pg_color = 0;
262 object->flags = flags;
264 object->domain.dr_policy = NULL;
265 object->generation = 1;
266 object->cleangeneration = 1;
267 refcount_init(&object->ref_count, 1);
268 object->memattr = VM_MEMATTR_DEFAULT;
271 object->handle = NULL;
272 object->backing_object = NULL;
273 object->backing_object_offset = (vm_ooffset_t) 0;
274 #if VM_NRESERVLEVEL > 0
275 LIST_INIT(&object->rvq);
277 umtx_shm_object_init(object);
283 * Initialize the VM objects module.
288 TAILQ_INIT(&vm_object_list);
289 mtx_init(&vm_object_list_mtx, "vm object_list", NULL, MTX_DEF);
291 rw_init(&kernel_object->lock, "kernel vm object");
292 _vm_object_allocate(OBJT_PHYS, atop(VM_MAX_KERNEL_ADDRESS -
293 VM_MIN_KERNEL_ADDRESS), OBJ_UNMANAGED, kernel_object);
294 #if VM_NRESERVLEVEL > 0
295 kernel_object->flags |= OBJ_COLORED;
296 kernel_object->pg_color = (u_short)atop(VM_MIN_KERNEL_ADDRESS);
300 * The lock portion of struct vm_object must be type stable due
301 * to vm_pageout_fallback_object_lock locking a vm object
302 * without holding any references to it.
304 obj_zone = uma_zcreate("VM OBJECT", sizeof (struct vm_object), NULL,
310 vm_object_zinit, NULL, UMA_ALIGN_PTR, UMA_ZONE_NOFREE);
316 vm_object_clear_flag(vm_object_t object, u_short bits)
319 VM_OBJECT_ASSERT_WLOCKED(object);
320 object->flags &= ~bits;
324 * Sets the default memory attribute for the specified object. Pages
325 * that are allocated to this object are by default assigned this memory
328 * Presently, this function must be called before any pages are allocated
329 * to the object. In the future, this requirement may be relaxed for
330 * "default" and "swap" objects.
333 vm_object_set_memattr(vm_object_t object, vm_memattr_t memattr)
336 VM_OBJECT_ASSERT_WLOCKED(object);
337 switch (object->type) {
345 if (!TAILQ_EMPTY(&object->memq))
346 return (KERN_FAILURE);
349 return (KERN_INVALID_ARGUMENT);
351 panic("vm_object_set_memattr: object %p is of undefined type",
354 object->memattr = memattr;
355 return (KERN_SUCCESS);
359 vm_object_pip_add(vm_object_t object, short i)
362 refcount_acquiren(&object->paging_in_progress, i);
366 vm_object_pip_wakeup(vm_object_t object)
369 refcount_release(&object->paging_in_progress);
373 vm_object_pip_wakeupn(vm_object_t object, short i)
376 refcount_releasen(&object->paging_in_progress, i);
380 vm_object_pip_wait(vm_object_t object, char *waitid)
383 VM_OBJECT_ASSERT_WLOCKED(object);
385 while (REFCOUNT_COUNT(object->paging_in_progress) > 0) {
386 VM_OBJECT_WUNLOCK(object);
387 refcount_wait(&object->paging_in_progress, waitid, PVM);
388 VM_OBJECT_WLOCK(object);
393 vm_object_pip_wait_unlocked(vm_object_t object, char *waitid)
396 VM_OBJECT_ASSERT_UNLOCKED(object);
398 while (REFCOUNT_COUNT(object->paging_in_progress) > 0)
399 refcount_wait(&object->paging_in_progress, waitid, PVM);
403 * vm_object_allocate:
405 * Returns a new object with the given size.
408 vm_object_allocate(objtype_t type, vm_pindex_t size)
415 panic("vm_object_allocate: can't create OBJT_DEAD");
422 flags = OBJ_FICTITIOUS | OBJ_UNMANAGED;
425 flags = OBJ_FICTITIOUS;
428 flags = OBJ_UNMANAGED;
434 panic("vm_object_allocate: type %d is undefined", type);
436 object = (vm_object_t)uma_zalloc(obj_zone, M_WAITOK);
437 _vm_object_allocate(type, size, flags, object);
443 * vm_object_allocate_anon:
445 * Returns a new default object of the given size and marked as
446 * anonymous memory for special split/collapse handling. Color
447 * to be initialized by the caller.
450 vm_object_allocate_anon(vm_pindex_t size)
454 object = (vm_object_t)uma_zalloc(obj_zone, M_WAITOK);
455 _vm_object_allocate(OBJT_DEFAULT, size, OBJ_ANON | OBJ_ONEMAPPING,
463 * vm_object_reference:
465 * Gets another reference to the given object. Note: OBJ_DEAD
466 * objects can be referenced during final cleaning.
469 vm_object_reference(vm_object_t object)
473 VM_OBJECT_RLOCK(object);
474 vm_object_reference_locked(object);
475 VM_OBJECT_RUNLOCK(object);
479 * vm_object_reference_locked:
481 * Gets another reference to the given object.
483 * The object must be locked.
486 vm_object_reference_locked(vm_object_t object)
490 VM_OBJECT_ASSERT_LOCKED(object);
491 refcount_acquire(&object->ref_count);
492 if (object->type == OBJT_VNODE) {
499 * Handle deallocating an object of type OBJT_VNODE.
502 vm_object_vndeallocate(vm_object_t object)
504 struct vnode *vp = (struct vnode *) object->handle;
506 KASSERT(object->type == OBJT_VNODE,
507 ("vm_object_vndeallocate: not a vnode object"));
508 KASSERT(vp != NULL, ("vm_object_vndeallocate: missing vp"));
510 if (refcount_release(&object->ref_count) &&
511 !umtx_shm_vnobj_persistent)
512 umtx_shm_object_terminated(object);
514 VM_OBJECT_RUNLOCK(object);
515 /* vrele may need the vnode lock. */
520 * vm_object_deallocate:
522 * Release a reference to the specified object,
523 * gained either through a vm_object_allocate
524 * or a vm_object_reference call. When all references
525 * are gone, storage associated with this object
526 * may be relinquished.
528 * No object may be locked.
531 vm_object_deallocate(vm_object_t object)
536 while (object != NULL) {
537 VM_OBJECT_RLOCK(object);
538 if (object->type == OBJT_VNODE) {
539 vm_object_vndeallocate(object);
544 * If the reference count goes to 0 we start calling
545 * vm_object_terminate() on the object chain. A ref count
546 * of 1 may be a special case depending on the shadow count
547 * being 0 or 1. These cases require a write lock on the
550 if ((object->flags & OBJ_ANON) == 0)
551 released = refcount_release_if_gt(&object->ref_count, 1);
553 released = refcount_release_if_gt(&object->ref_count, 2);
554 VM_OBJECT_RUNLOCK(object);
558 VM_OBJECT_WLOCK(object);
559 KASSERT(object->ref_count != 0,
560 ("vm_object_deallocate: object deallocated too many times: %d", object->type));
562 refcount_release(&object->ref_count);
563 if (object->ref_count > 1) {
564 VM_OBJECT_WUNLOCK(object);
566 } else if (object->ref_count == 1) {
567 if (object->shadow_count == 0 &&
568 object->handle == NULL &&
569 (object->flags & OBJ_ANON) != 0) {
570 vm_object_set_flag(object, OBJ_ONEMAPPING);
571 } else if ((object->shadow_count == 1) &&
572 (object->handle == NULL) &&
573 (object->flags & OBJ_ANON) != 0) {
576 robject = LIST_FIRST(&object->shadow_head);
577 KASSERT(robject != NULL,
578 ("vm_object_deallocate: ref_count: %d, shadow_count: %d",
580 object->shadow_count));
581 KASSERT((robject->flags & OBJ_TMPFS_NODE) == 0,
582 ("shadowed tmpfs v_object %p", object));
583 if (!VM_OBJECT_TRYWLOCK(robject)) {
585 * Avoid a potential deadlock.
587 refcount_acquire(&object->ref_count);
588 VM_OBJECT_WUNLOCK(object);
590 * More likely than not the thread
591 * holding robject's lock has lower
592 * priority than the current thread.
593 * Let the lower priority thread run.
599 * Collapse object into its shadow unless its
600 * shadow is dead. In that case, object will
601 * be deallocated by the thread that is
602 * deallocating its shadow.
604 if ((robject->flags &
605 (OBJ_DEAD | OBJ_ANON)) == OBJ_ANON &&
606 robject->handle == NULL) {
608 refcount_acquire(&robject->ref_count);
610 if (REFCOUNT_COUNT(robject->paging_in_progress) > 0) {
611 VM_OBJECT_WUNLOCK(object);
612 vm_object_pip_wait(robject,
614 temp = robject->backing_object;
615 if (object == temp) {
616 VM_OBJECT_WLOCK(object);
619 } else if (REFCOUNT_COUNT(object->paging_in_progress) > 0) {
620 VM_OBJECT_WUNLOCK(robject);
621 VM_OBJECT_WUNLOCK(object);
623 &object->paging_in_progress,
625 VM_OBJECT_WLOCK(robject);
626 temp = robject->backing_object;
627 if (object == temp) {
628 VM_OBJECT_WLOCK(object);
632 VM_OBJECT_WUNLOCK(object);
634 if (robject->ref_count == 1) {
635 robject->ref_count--;
640 vm_object_collapse(object);
641 VM_OBJECT_WUNLOCK(object);
644 VM_OBJECT_WUNLOCK(robject);
646 VM_OBJECT_WUNLOCK(object);
650 umtx_shm_object_terminated(object);
651 temp = object->backing_object;
653 KASSERT((object->flags & OBJ_TMPFS_NODE) == 0,
654 ("shadowed tmpfs v_object 2 %p", object));
655 vm_object_backing_remove(object);
658 * Don't double-terminate, we could be in a termination
659 * recursion due to the terminate having to sync data
662 if ((object->flags & OBJ_DEAD) == 0) {
663 vm_object_set_flag(object, OBJ_DEAD);
664 vm_object_terminate(object);
666 VM_OBJECT_WUNLOCK(object);
672 * vm_object_destroy removes the object from the global object list
673 * and frees the space for the object.
676 vm_object_destroy(vm_object_t object)
680 * Release the allocation charge.
682 if (object->cred != NULL) {
683 swap_release_by_cred(object->charge, object->cred);
685 crfree(object->cred);
690 * Free the space for the object.
692 uma_zfree(obj_zone, object);
696 vm_object_backing_remove_locked(vm_object_t object)
698 vm_object_t backing_object;
700 backing_object = object->backing_object;
701 VM_OBJECT_ASSERT_WLOCKED(object);
702 VM_OBJECT_ASSERT_WLOCKED(backing_object);
704 if ((object->flags & OBJ_SHADOWLIST) != 0) {
705 LIST_REMOVE(object, shadow_list);
706 backing_object->shadow_count--;
707 object->flags &= ~OBJ_SHADOWLIST;
709 object->backing_object = NULL;
713 vm_object_backing_remove(vm_object_t object)
715 vm_object_t backing_object;
717 VM_OBJECT_ASSERT_WLOCKED(object);
719 if ((object->flags & OBJ_SHADOWLIST) != 0) {
720 backing_object = object->backing_object;
721 VM_OBJECT_WLOCK(backing_object);
722 vm_object_backing_remove_locked(object);
723 VM_OBJECT_WUNLOCK(backing_object);
725 object->backing_object = NULL;
729 vm_object_backing_insert_locked(vm_object_t object, vm_object_t backing_object)
732 VM_OBJECT_ASSERT_WLOCKED(object);
734 if ((backing_object->flags & OBJ_ANON) != 0) {
735 VM_OBJECT_ASSERT_WLOCKED(backing_object);
736 LIST_INSERT_HEAD(&backing_object->shadow_head, object,
738 backing_object->shadow_count++;
739 object->flags |= OBJ_SHADOWLIST;
741 object->backing_object = backing_object;
745 vm_object_backing_insert(vm_object_t object, vm_object_t backing_object)
748 VM_OBJECT_ASSERT_WLOCKED(object);
750 if ((backing_object->flags & OBJ_ANON) != 0) {
751 VM_OBJECT_WLOCK(backing_object);
752 vm_object_backing_insert_locked(object, backing_object);
753 VM_OBJECT_WUNLOCK(backing_object);
755 object->backing_object = backing_object;
760 * vm_object_terminate_pages removes any remaining pageable pages
761 * from the object and resets the object to an empty state.
764 vm_object_terminate_pages(vm_object_t object)
768 VM_OBJECT_ASSERT_WLOCKED(object);
771 * Free any remaining pageable pages. This also removes them from the
772 * paging queues. However, don't free wired pages, just remove them
773 * from the object. Rather than incrementally removing each page from
774 * the object, the page and object are reset to any empty state.
776 TAILQ_FOREACH_SAFE(p, &object->memq, listq, p_next) {
777 vm_page_assert_unbusied(p);
778 KASSERT(p->object == object &&
779 (p->ref_count & VPRC_OBJREF) != 0,
780 ("vm_object_terminate_pages: page %p is inconsistent", p));
783 if (vm_page_drop(p, VPRC_OBJREF) == VPRC_OBJREF) {
790 * If the object contained any pages, then reset it to an empty state.
791 * None of the object's fields, including "resident_page_count", were
792 * modified by the preceding loop.
794 if (object->resident_page_count != 0) {
795 vm_radix_reclaim_allnodes(&object->rtree);
796 TAILQ_INIT(&object->memq);
797 object->resident_page_count = 0;
798 if (object->type == OBJT_VNODE)
799 vdrop(object->handle);
804 * vm_object_terminate actually destroys the specified object, freeing
805 * up all previously used resources.
807 * The object must be locked.
808 * This routine may block.
811 vm_object_terminate(vm_object_t object)
813 VM_OBJECT_ASSERT_WLOCKED(object);
814 KASSERT((object->flags & OBJ_DEAD) != 0,
815 ("terminating non-dead obj %p", object));
818 * wait for the pageout daemon to be done with the object
820 vm_object_pip_wait(object, "objtrm");
822 KASSERT(!REFCOUNT_COUNT(object->paging_in_progress),
823 ("vm_object_terminate: pageout in progress"));
825 KASSERT(object->ref_count == 0,
826 ("vm_object_terminate: object with references, ref_count=%d",
829 if ((object->flags & OBJ_PG_DTOR) == 0)
830 vm_object_terminate_pages(object);
832 #if VM_NRESERVLEVEL > 0
833 if (__predict_false(!LIST_EMPTY(&object->rvq)))
834 vm_reserv_break_all(object);
837 KASSERT(object->cred == NULL || object->type == OBJT_DEFAULT ||
838 object->type == OBJT_SWAP,
839 ("%s: non-swap obj %p has cred", __func__, object));
842 * Let the pager know object is dead.
844 vm_pager_deallocate(object);
845 VM_OBJECT_WUNLOCK(object);
847 vm_object_destroy(object);
851 * Make the page read-only so that we can clear the object flags. However, if
852 * this is a nosync mmap then the object is likely to stay dirty so do not
853 * mess with the page and do not clear the object flags. Returns TRUE if the
854 * page should be flushed, and FALSE otherwise.
857 vm_object_page_remove_write(vm_page_t p, int flags, boolean_t *allclean)
860 vm_page_assert_busied(p);
863 * If we have been asked to skip nosync pages and this is a
864 * nosync page, skip it. Note that the object flags were not
865 * cleared in this case so we do not have to set them.
867 if ((flags & OBJPC_NOSYNC) != 0 && (p->aflags & PGA_NOSYNC) != 0) {
871 pmap_remove_write(p);
872 return (p->dirty != 0);
877 * vm_object_page_clean
879 * Clean all dirty pages in the specified range of object. Leaves page
880 * on whatever queue it is currently on. If NOSYNC is set then do not
881 * write out pages with PGA_NOSYNC set (originally comes from MAP_NOSYNC),
882 * leaving the object dirty.
884 * When stuffing pages asynchronously, allow clustering. XXX we need a
885 * synchronous clustering mode implementation.
887 * Odd semantics: if start == end, we clean everything.
889 * The object must be locked.
891 * Returns FALSE if some page from the range was not written, as
892 * reported by the pager, and TRUE otherwise.
895 vm_object_page_clean(vm_object_t object, vm_ooffset_t start, vm_ooffset_t end,
899 vm_pindex_t pi, tend, tstart;
900 int curgeneration, n, pagerflags;
901 boolean_t eio, res, allclean;
903 VM_OBJECT_ASSERT_WLOCKED(object);
905 if (object->type != OBJT_VNODE || !vm_object_mightbedirty(object) ||
906 object->resident_page_count == 0)
909 pagerflags = (flags & (OBJPC_SYNC | OBJPC_INVAL)) != 0 ?
910 VM_PAGER_PUT_SYNC : VM_PAGER_CLUSTER_OK;
911 pagerflags |= (flags & OBJPC_INVAL) != 0 ? VM_PAGER_PUT_INVAL : 0;
913 tstart = OFF_TO_IDX(start);
914 tend = (end == 0) ? object->size : OFF_TO_IDX(end + PAGE_MASK);
915 allclean = tstart == 0 && tend >= object->size;
919 curgeneration = object->generation;
921 for (p = vm_page_find_least(object, tstart); p != NULL; p = np) {
925 np = TAILQ_NEXT(p, listq);
926 if (vm_page_none_valid(p))
928 if (vm_page_busy_acquire(p, VM_ALLOC_WAITFAIL) == 0) {
929 if (object->generation != curgeneration &&
930 (flags & OBJPC_SYNC) != 0)
932 np = vm_page_find_least(object, pi);
935 if (!vm_object_page_remove_write(p, flags, &allclean)) {
940 n = vm_object_page_collect_flush(object, p, pagerflags,
941 flags, &allclean, &eio);
946 if (object->generation != curgeneration &&
947 (flags & OBJPC_SYNC) != 0)
951 * If the VOP_PUTPAGES() did a truncated write, so
952 * that even the first page of the run is not fully
953 * written, vm_pageout_flush() returns 0 as the run
954 * length. Since the condition that caused truncated
955 * write may be permanent, e.g. exhausted free space,
956 * accepting n == 0 would cause an infinite loop.
958 * Forwarding the iterator leaves the unwritten page
959 * behind, but there is not much we can do there if
960 * filesystem refuses to write it.
966 np = vm_page_find_least(object, pi + n);
969 VOP_FSYNC(vp, (pagerflags & VM_PAGER_PUT_SYNC) ? MNT_WAIT : 0);
973 object->cleangeneration = curgeneration;
978 vm_object_page_collect_flush(vm_object_t object, vm_page_t p, int pagerflags,
979 int flags, boolean_t *allclean, boolean_t *eio)
981 vm_page_t ma[vm_pageout_page_count], p_first, tp;
982 int count, i, mreq, runlen;
984 vm_page_lock_assert(p, MA_NOTOWNED);
985 vm_page_assert_xbusied(p);
986 VM_OBJECT_ASSERT_WLOCKED(object);
991 for (tp = p; count < vm_pageout_page_count; count++) {
992 tp = vm_page_next(tp);
993 if (tp == NULL || vm_page_tryxbusy(tp) == 0)
995 if (!vm_object_page_remove_write(tp, flags, allclean)) {
1001 for (p_first = p; count < vm_pageout_page_count; count++) {
1002 tp = vm_page_prev(p_first);
1003 if (tp == NULL || vm_page_tryxbusy(tp) == 0)
1005 if (!vm_object_page_remove_write(tp, flags, allclean)) {
1006 vm_page_xunbusy(tp);
1013 for (tp = p_first, i = 0; i < count; tp = TAILQ_NEXT(tp, listq), i++)
1016 vm_pageout_flush(ma, count, pagerflags, mreq, &runlen, eio);
1021 * Note that there is absolutely no sense in writing out
1022 * anonymous objects, so we track down the vnode object
1024 * We invalidate (remove) all pages from the address space
1025 * for semantic correctness.
1027 * If the backing object is a device object with unmanaged pages, then any
1028 * mappings to the specified range of pages must be removed before this
1029 * function is called.
1031 * Note: certain anonymous maps, such as MAP_NOSYNC maps,
1032 * may start out with a NULL object.
1035 vm_object_sync(vm_object_t object, vm_ooffset_t offset, vm_size_t size,
1036 boolean_t syncio, boolean_t invalidate)
1038 vm_object_t backing_object;
1041 int error, flags, fsync_after;
1048 VM_OBJECT_WLOCK(object);
1049 while ((backing_object = object->backing_object) != NULL) {
1050 VM_OBJECT_WLOCK(backing_object);
1051 offset += object->backing_object_offset;
1052 VM_OBJECT_WUNLOCK(object);
1053 object = backing_object;
1054 if (object->size < OFF_TO_IDX(offset + size))
1055 size = IDX_TO_OFF(object->size) - offset;
1058 * Flush pages if writing is allowed, invalidate them
1059 * if invalidation requested. Pages undergoing I/O
1060 * will be ignored by vm_object_page_remove().
1062 * We cannot lock the vnode and then wait for paging
1063 * to complete without deadlocking against vm_fault.
1064 * Instead we simply call vm_object_page_remove() and
1065 * allow it to block internally on a page-by-page
1066 * basis when it encounters pages undergoing async
1069 if (object->type == OBJT_VNODE &&
1070 vm_object_mightbedirty(object) != 0 &&
1071 ((vp = object->handle)->v_vflag & VV_NOSYNC) == 0) {
1072 VM_OBJECT_WUNLOCK(object);
1073 (void) vn_start_write(vp, &mp, V_WAIT);
1074 vn_lock(vp, LK_EXCLUSIVE | LK_RETRY);
1075 if (syncio && !invalidate && offset == 0 &&
1076 atop(size) == object->size) {
1078 * If syncing the whole mapping of the file,
1079 * it is faster to schedule all the writes in
1080 * async mode, also allowing the clustering,
1081 * and then wait for i/o to complete.
1086 flags = (syncio || invalidate) ? OBJPC_SYNC : 0;
1087 flags |= invalidate ? (OBJPC_SYNC | OBJPC_INVAL) : 0;
1088 fsync_after = FALSE;
1090 VM_OBJECT_WLOCK(object);
1091 res = vm_object_page_clean(object, offset, offset + size,
1093 VM_OBJECT_WUNLOCK(object);
1095 error = VOP_FSYNC(vp, MNT_WAIT, curthread);
1097 vn_finished_write(mp);
1100 VM_OBJECT_WLOCK(object);
1102 if ((object->type == OBJT_VNODE ||
1103 object->type == OBJT_DEVICE) && invalidate) {
1104 if (object->type == OBJT_DEVICE)
1106 * The option OBJPR_NOTMAPPED must be passed here
1107 * because vm_object_page_remove() cannot remove
1108 * unmanaged mappings.
1110 flags = OBJPR_NOTMAPPED;
1114 flags = OBJPR_CLEANONLY;
1115 vm_object_page_remove(object, OFF_TO_IDX(offset),
1116 OFF_TO_IDX(offset + size + PAGE_MASK), flags);
1118 VM_OBJECT_WUNLOCK(object);
1123 * Determine whether the given advice can be applied to the object. Advice is
1124 * not applied to unmanaged pages since they never belong to page queues, and
1125 * since MADV_FREE is destructive, it can apply only to anonymous pages that
1126 * have been mapped at most once.
1129 vm_object_advice_applies(vm_object_t object, int advice)
1132 if ((object->flags & OBJ_UNMANAGED) != 0)
1134 if (advice != MADV_FREE)
1136 return ((object->flags & (OBJ_ONEMAPPING | OBJ_ANON)) ==
1137 (OBJ_ONEMAPPING | OBJ_ANON));
1141 vm_object_madvise_freespace(vm_object_t object, int advice, vm_pindex_t pindex,
1145 if (advice == MADV_FREE && object->type == OBJT_SWAP)
1146 swap_pager_freespace(object, pindex, size);
1150 * vm_object_madvise:
1152 * Implements the madvise function at the object/page level.
1154 * MADV_WILLNEED (any object)
1156 * Activate the specified pages if they are resident.
1158 * MADV_DONTNEED (any object)
1160 * Deactivate the specified pages if they are resident.
1162 * MADV_FREE (OBJT_DEFAULT/OBJT_SWAP objects,
1163 * OBJ_ONEMAPPING only)
1165 * Deactivate and clean the specified pages if they are
1166 * resident. This permits the process to reuse the pages
1167 * without faulting or the kernel to reclaim the pages
1171 vm_object_madvise(vm_object_t object, vm_pindex_t pindex, vm_pindex_t end,
1174 vm_pindex_t tpindex;
1175 vm_object_t backing_object, tobject;
1182 VM_OBJECT_WLOCK(object);
1183 if (!vm_object_advice_applies(object, advice)) {
1184 VM_OBJECT_WUNLOCK(object);
1187 for (m = vm_page_find_least(object, pindex); pindex < end; pindex++) {
1191 * If the next page isn't resident in the top-level object, we
1192 * need to search the shadow chain. When applying MADV_FREE, we
1193 * take care to release any swap space used to store
1194 * non-resident pages.
1196 if (m == NULL || pindex < m->pindex) {
1198 * Optimize a common case: if the top-level object has
1199 * no backing object, we can skip over the non-resident
1200 * range in constant time.
1202 if (object->backing_object == NULL) {
1203 tpindex = (m != NULL && m->pindex < end) ?
1205 vm_object_madvise_freespace(object, advice,
1206 pindex, tpindex - pindex);
1207 if ((pindex = tpindex) == end)
1214 vm_object_madvise_freespace(tobject, advice,
1217 * Prepare to search the next object in the
1220 backing_object = tobject->backing_object;
1221 if (backing_object == NULL)
1223 VM_OBJECT_WLOCK(backing_object);
1225 OFF_TO_IDX(tobject->backing_object_offset);
1226 if (tobject != object)
1227 VM_OBJECT_WUNLOCK(tobject);
1228 tobject = backing_object;
1229 if (!vm_object_advice_applies(tobject, advice))
1231 } while ((tm = vm_page_lookup(tobject, tpindex)) ==
1236 m = TAILQ_NEXT(m, listq);
1240 * If the page is not in a normal state, skip it. The page
1241 * can not be invalidated while the object lock is held.
1243 if (!vm_page_all_valid(tm) || vm_page_wired(tm))
1245 KASSERT((tm->flags & PG_FICTITIOUS) == 0,
1246 ("vm_object_madvise: page %p is fictitious", tm));
1247 KASSERT((tm->oflags & VPO_UNMANAGED) == 0,
1248 ("vm_object_madvise: page %p is not managed", tm));
1249 if (vm_page_tryxbusy(tm) == 0) {
1250 if (object != tobject)
1251 VM_OBJECT_WUNLOCK(object);
1252 if (advice == MADV_WILLNEED) {
1254 * Reference the page before unlocking and
1255 * sleeping so that the page daemon is less
1256 * likely to reclaim it.
1258 vm_page_aflag_set(tm, PGA_REFERENCED);
1260 vm_page_busy_sleep(tm, "madvpo", false);
1264 vm_page_advise(tm, advice);
1266 vm_page_xunbusy(tm);
1267 vm_object_madvise_freespace(tobject, advice, tm->pindex, 1);
1269 if (tobject != object)
1270 VM_OBJECT_WUNLOCK(tobject);
1272 VM_OBJECT_WUNLOCK(object);
1278 * Create a new object which is backed by the
1279 * specified existing object range. The source
1280 * object reference is deallocated.
1282 * The new object and offset into that object
1283 * are returned in the source parameters.
1287 vm_object_t *object, /* IN/OUT */
1288 vm_ooffset_t *offset, /* IN/OUT */
1297 * Don't create the new object if the old object isn't shared.
1299 * If we hold the only reference we can guarantee that it won't
1300 * increase while we have the map locked. Otherwise the race is
1301 * harmless and we will end up with an extra shadow object that
1302 * will be collapsed later.
1304 if (source != NULL && source->ref_count == 1 &&
1305 source->handle == NULL && (source->flags & OBJ_ANON) != 0)
1309 * Allocate a new object with the given length.
1311 result = vm_object_allocate_anon(atop(length));
1314 * Store the offset into the source object, and fix up the offset into
1317 result->backing_object_offset = *offset;
1320 * The new object shadows the source object, adding a reference to it.
1321 * Our caller changes his reference to point to the new object,
1322 * removing a reference to the source object. Net result: no change
1323 * of reference count.
1325 * Try to optimize the result object's page color when shadowing
1326 * in order to maintain page coloring consistency in the combined
1329 if (source != NULL) {
1330 VM_OBJECT_WLOCK(result);
1331 vm_object_backing_insert(result, source);
1332 result->domain = source->domain;
1333 #if VM_NRESERVLEVEL > 0
1334 result->flags |= source->flags & OBJ_COLORED;
1335 result->pg_color = (source->pg_color + OFF_TO_IDX(*offset)) &
1336 ((1 << (VM_NFREEORDER - 1)) - 1);
1338 VM_OBJECT_WUNLOCK(result);
1342 * Return the new things
1351 * Split the pages in a map entry into a new object. This affords
1352 * easier removal of unused pages, and keeps object inheritance from
1353 * being a negative impact on memory usage.
1356 vm_object_split(vm_map_entry_t entry)
1358 vm_page_t m, m_next;
1359 vm_object_t orig_object, new_object, source;
1360 vm_pindex_t idx, offidxstart;
1363 orig_object = entry->object.vm_object;
1364 if ((orig_object->flags & OBJ_ANON) == 0)
1366 if (orig_object->ref_count <= 1)
1368 VM_OBJECT_WUNLOCK(orig_object);
1370 offidxstart = OFF_TO_IDX(entry->offset);
1371 size = atop(entry->end - entry->start);
1374 * If swap_pager_copy() is later called, it will convert new_object
1375 * into a swap object.
1377 new_object = vm_object_allocate_anon(size);
1380 * At this point, the new object is still private, so the order in
1381 * which the original and new objects are locked does not matter.
1383 VM_OBJECT_WLOCK(new_object);
1384 VM_OBJECT_WLOCK(orig_object);
1385 new_object->domain = orig_object->domain;
1386 source = orig_object->backing_object;
1387 if (source != NULL) {
1388 if ((source->flags & (OBJ_ANON | OBJ_DEAD)) != 0) {
1389 VM_OBJECT_WLOCK(source);
1390 if ((source->flags & OBJ_DEAD) != 0) {
1391 VM_OBJECT_WUNLOCK(source);
1392 VM_OBJECT_WUNLOCK(orig_object);
1393 VM_OBJECT_WUNLOCK(new_object);
1394 vm_object_deallocate(new_object);
1395 VM_OBJECT_WLOCK(orig_object);
1398 vm_object_backing_insert_locked(new_object, source);
1399 vm_object_reference_locked(source); /* for new_object */
1400 vm_object_clear_flag(source, OBJ_ONEMAPPING);
1401 VM_OBJECT_WUNLOCK(source);
1403 vm_object_backing_insert(new_object, source);
1404 vm_object_reference(source);
1406 new_object->backing_object_offset =
1407 orig_object->backing_object_offset + entry->offset;
1409 if (orig_object->cred != NULL) {
1410 new_object->cred = orig_object->cred;
1411 crhold(orig_object->cred);
1412 new_object->charge = ptoa(size);
1413 KASSERT(orig_object->charge >= ptoa(size),
1414 ("orig_object->charge < 0"));
1415 orig_object->charge -= ptoa(size);
1418 m = vm_page_find_least(orig_object, offidxstart);
1419 for (; m != NULL && (idx = m->pindex - offidxstart) < size;
1421 m_next = TAILQ_NEXT(m, listq);
1424 * We must wait for pending I/O to complete before we can
1427 * We do not have to VM_PROT_NONE the page as mappings should
1428 * not be changed by this operation.
1430 if (vm_page_tryxbusy(m) == 0) {
1431 VM_OBJECT_WUNLOCK(new_object);
1432 vm_page_sleep_if_busy(m, "spltwt");
1433 VM_OBJECT_WLOCK(new_object);
1437 /* vm_page_rename() will dirty the page. */
1438 if (vm_page_rename(m, new_object, idx)) {
1440 VM_OBJECT_WUNLOCK(new_object);
1441 VM_OBJECT_WUNLOCK(orig_object);
1443 VM_OBJECT_WLOCK(orig_object);
1444 VM_OBJECT_WLOCK(new_object);
1448 #if VM_NRESERVLEVEL > 0
1450 * If some of the reservation's allocated pages remain with
1451 * the original object, then transferring the reservation to
1452 * the new object is neither particularly beneficial nor
1453 * particularly harmful as compared to leaving the reservation
1454 * with the original object. If, however, all of the
1455 * reservation's allocated pages are transferred to the new
1456 * object, then transferring the reservation is typically
1457 * beneficial. Determining which of these two cases applies
1458 * would be more costly than unconditionally renaming the
1461 vm_reserv_rename(m, new_object, orig_object, offidxstart);
1463 if (orig_object->type != OBJT_SWAP)
1466 if (orig_object->type == OBJT_SWAP) {
1468 * swap_pager_copy() can sleep, in which case the orig_object's
1469 * and new_object's locks are released and reacquired.
1471 swap_pager_copy(orig_object, new_object, offidxstart, 0);
1472 TAILQ_FOREACH(m, &new_object->memq, listq)
1475 VM_OBJECT_WUNLOCK(orig_object);
1476 VM_OBJECT_WUNLOCK(new_object);
1477 entry->object.vm_object = new_object;
1478 entry->offset = 0LL;
1479 vm_object_deallocate(orig_object);
1480 VM_OBJECT_WLOCK(new_object);
1483 #define OBSC_COLLAPSE_NOWAIT 0x0002
1484 #define OBSC_COLLAPSE_WAIT 0x0004
1487 vm_object_collapse_scan_wait(vm_object_t object, vm_page_t p, vm_page_t next,
1490 vm_object_t backing_object;
1492 VM_OBJECT_ASSERT_WLOCKED(object);
1493 backing_object = object->backing_object;
1494 VM_OBJECT_ASSERT_WLOCKED(backing_object);
1496 KASSERT(p == NULL || p->object == object || p->object == backing_object,
1497 ("invalid ownership %p %p %p", p, object, backing_object));
1498 if ((op & OBSC_COLLAPSE_NOWAIT) != 0)
1500 /* The page is only NULL when rename fails. */
1504 if (p->object == object)
1505 VM_OBJECT_WUNLOCK(backing_object);
1507 VM_OBJECT_WUNLOCK(object);
1508 vm_page_busy_sleep(p, "vmocol", false);
1510 VM_OBJECT_WLOCK(object);
1511 VM_OBJECT_WLOCK(backing_object);
1512 return (TAILQ_FIRST(&backing_object->memq));
1516 vm_object_scan_all_shadowed(vm_object_t object)
1518 vm_object_t backing_object;
1520 vm_pindex_t backing_offset_index, new_pindex, pi, ps;
1522 VM_OBJECT_ASSERT_WLOCKED(object);
1523 VM_OBJECT_ASSERT_WLOCKED(object->backing_object);
1525 backing_object = object->backing_object;
1527 if ((backing_object->flags & OBJ_ANON) == 0)
1530 pi = backing_offset_index = OFF_TO_IDX(object->backing_object_offset);
1531 p = vm_page_find_least(backing_object, pi);
1532 ps = swap_pager_find_least(backing_object, pi);
1535 * Only check pages inside the parent object's range and
1536 * inside the parent object's mapping of the backing object.
1539 if (p != NULL && p->pindex < pi)
1540 p = TAILQ_NEXT(p, listq);
1542 ps = swap_pager_find_least(backing_object, pi);
1543 if (p == NULL && ps >= backing_object->size)
1548 pi = MIN(p->pindex, ps);
1550 new_pindex = pi - backing_offset_index;
1551 if (new_pindex >= object->size)
1555 * See if the parent has the page or if the parent's object
1556 * pager has the page. If the parent has the page but the page
1557 * is not valid, the parent's object pager must have the page.
1559 * If this fails, the parent does not completely shadow the
1560 * object and we might as well give up now.
1562 pp = vm_page_lookup(object, new_pindex);
1564 * The valid check here is stable due to object lock being
1565 * required to clear valid and initiate paging.
1567 if ((pp == NULL || vm_page_none_valid(pp)) &&
1568 !vm_pager_has_page(object, new_pindex, NULL, NULL))
1575 vm_object_collapse_scan(vm_object_t object, int op)
1577 vm_object_t backing_object;
1578 vm_page_t next, p, pp;
1579 vm_pindex_t backing_offset_index, new_pindex;
1581 VM_OBJECT_ASSERT_WLOCKED(object);
1582 VM_OBJECT_ASSERT_WLOCKED(object->backing_object);
1584 backing_object = object->backing_object;
1585 backing_offset_index = OFF_TO_IDX(object->backing_object_offset);
1588 * Initial conditions
1590 if ((op & OBSC_COLLAPSE_WAIT) != 0)
1591 vm_object_set_flag(backing_object, OBJ_DEAD);
1596 for (p = TAILQ_FIRST(&backing_object->memq); p != NULL; p = next) {
1597 next = TAILQ_NEXT(p, listq);
1598 new_pindex = p->pindex - backing_offset_index;
1601 * Check for busy page
1603 if (vm_page_tryxbusy(p) == 0) {
1604 next = vm_object_collapse_scan_wait(object, p, next, op);
1608 KASSERT(p->object == backing_object,
1609 ("vm_object_collapse_scan: object mismatch"));
1611 if (p->pindex < backing_offset_index ||
1612 new_pindex >= object->size) {
1613 if (backing_object->type == OBJT_SWAP)
1614 swap_pager_freespace(backing_object, p->pindex,
1617 KASSERT(!pmap_page_is_mapped(p),
1618 ("freeing mapped page %p", p));
1619 if (vm_page_remove(p))
1626 pp = vm_page_lookup(object, new_pindex);
1627 if (pp != NULL && vm_page_tryxbusy(pp) == 0) {
1630 * The page in the parent is busy and possibly not
1631 * (yet) valid. Until its state is finalized by the
1632 * busy bit owner, we can't tell whether it shadows the
1633 * original page. Therefore, we must either skip it
1634 * and the original (backing_object) page or wait for
1635 * its state to be finalized.
1637 * This is due to a race with vm_fault() where we must
1638 * unbusy the original (backing_obj) page before we can
1639 * (re)lock the parent. Hence we can get here.
1641 next = vm_object_collapse_scan_wait(object, pp, next,
1646 KASSERT(pp == NULL || !vm_page_none_valid(pp),
1647 ("unbusy invalid page %p", pp));
1649 if (pp != NULL || vm_pager_has_page(object, new_pindex, NULL,
1652 * The page already exists in the parent OR swap exists
1653 * for this location in the parent. Leave the parent's
1654 * page alone. Destroy the original page from the
1657 if (backing_object->type == OBJT_SWAP)
1658 swap_pager_freespace(backing_object, p->pindex,
1660 KASSERT(!pmap_page_is_mapped(p),
1661 ("freeing mapped page %p", p));
1662 if (vm_page_remove(p))
1667 vm_page_xunbusy(pp);
1672 * Page does not exist in parent, rename the page from the
1673 * backing object to the main object.
1675 * If the page was mapped to a process, it can remain mapped
1676 * through the rename. vm_page_rename() will dirty the page.
1678 if (vm_page_rename(p, object, new_pindex)) {
1681 vm_page_xunbusy(pp);
1682 next = vm_object_collapse_scan_wait(object, NULL, next,
1687 /* Use the old pindex to free the right page. */
1688 if (backing_object->type == OBJT_SWAP)
1689 swap_pager_freespace(backing_object,
1690 new_pindex + backing_offset_index, 1);
1692 #if VM_NRESERVLEVEL > 0
1694 * Rename the reservation.
1696 vm_reserv_rename(p, object, backing_object,
1697 backing_offset_index);
1706 * this version of collapse allows the operation to occur earlier and
1707 * when paging_in_progress is true for an object... This is not a complete
1708 * operation, but should plug 99.9% of the rest of the leaks.
1711 vm_object_qcollapse(vm_object_t object)
1713 vm_object_t backing_object = object->backing_object;
1715 VM_OBJECT_ASSERT_WLOCKED(object);
1716 VM_OBJECT_ASSERT_WLOCKED(backing_object);
1718 if (backing_object->ref_count != 1)
1721 vm_object_collapse_scan(object, OBSC_COLLAPSE_NOWAIT);
1725 * vm_object_collapse:
1727 * Collapse an object with the object backing it.
1728 * Pages in the backing object are moved into the
1729 * parent, and the backing object is deallocated.
1732 vm_object_collapse(vm_object_t object)
1734 vm_object_t backing_object, new_backing_object;
1736 VM_OBJECT_ASSERT_WLOCKED(object);
1740 * Verify that the conditions are right for collapse:
1742 * The object exists and the backing object exists.
1744 if ((backing_object = object->backing_object) == NULL)
1748 * we check the backing object first, because it is most likely
1751 if ((backing_object->flags & OBJ_ANON) == 0)
1753 VM_OBJECT_WLOCK(backing_object);
1754 if (backing_object->handle != NULL ||
1755 (backing_object->flags & OBJ_DEAD) != 0 ||
1756 object->handle != NULL ||
1757 (object->flags & OBJ_DEAD) != 0) {
1758 VM_OBJECT_WUNLOCK(backing_object);
1762 if (REFCOUNT_COUNT(object->paging_in_progress) > 0 ||
1763 REFCOUNT_COUNT(backing_object->paging_in_progress) > 0) {
1764 vm_object_qcollapse(object);
1765 VM_OBJECT_WUNLOCK(backing_object);
1770 * We know that we can either collapse the backing object (if
1771 * the parent is the only reference to it) or (perhaps) have
1772 * the parent bypass the object if the parent happens to shadow
1773 * all the resident pages in the entire backing object.
1775 * This is ignoring pager-backed pages such as swap pages.
1776 * vm_object_collapse_scan fails the shadowing test in this
1779 if (backing_object->ref_count == 1) {
1780 vm_object_pip_add(object, 1);
1781 vm_object_pip_add(backing_object, 1);
1784 * If there is exactly one reference to the backing
1785 * object, we can collapse it into the parent.
1787 vm_object_collapse_scan(object, OBSC_COLLAPSE_WAIT);
1789 #if VM_NRESERVLEVEL > 0
1791 * Break any reservations from backing_object.
1793 if (__predict_false(!LIST_EMPTY(&backing_object->rvq)))
1794 vm_reserv_break_all(backing_object);
1798 * Move the pager from backing_object to object.
1800 if (backing_object->type == OBJT_SWAP) {
1802 * swap_pager_copy() can sleep, in which case
1803 * the backing_object's and object's locks are
1804 * released and reacquired.
1805 * Since swap_pager_copy() is being asked to
1806 * destroy the source, it will change the
1807 * backing_object's type to OBJT_DEFAULT.
1812 OFF_TO_IDX(object->backing_object_offset), TRUE);
1815 * Object now shadows whatever backing_object did.
1816 * Note that the reference to
1817 * backing_object->backing_object moves from within
1818 * backing_object to within object.
1820 vm_object_backing_remove_locked(object);
1821 new_backing_object = backing_object->backing_object;
1822 if (new_backing_object != NULL) {
1823 VM_OBJECT_WLOCK(new_backing_object);
1824 vm_object_backing_remove_locked(backing_object);
1825 vm_object_backing_insert_locked(object,
1826 new_backing_object);
1827 VM_OBJECT_WUNLOCK(new_backing_object);
1829 object->backing_object_offset +=
1830 backing_object->backing_object_offset;
1833 * Discard backing_object.
1835 * Since the backing object has no pages, no pager left,
1836 * and no object references within it, all that is
1837 * necessary is to dispose of it.
1839 KASSERT(backing_object->ref_count == 1, (
1840 "backing_object %p was somehow re-referenced during collapse!",
1842 vm_object_pip_wakeup(backing_object);
1843 backing_object->type = OBJT_DEAD;
1844 backing_object->ref_count = 0;
1845 VM_OBJECT_WUNLOCK(backing_object);
1846 vm_object_destroy(backing_object);
1848 vm_object_pip_wakeup(object);
1849 counter_u64_add(object_collapses, 1);
1852 * If we do not entirely shadow the backing object,
1853 * there is nothing we can do so we give up.
1855 if (object->resident_page_count != object->size &&
1856 !vm_object_scan_all_shadowed(object)) {
1857 VM_OBJECT_WUNLOCK(backing_object);
1862 * Make the parent shadow the next object in the
1863 * chain. Deallocating backing_object will not remove
1864 * it, since its reference count is at least 2.
1866 vm_object_backing_remove_locked(object);
1868 new_backing_object = backing_object->backing_object;
1869 if (new_backing_object != NULL) {
1870 vm_object_backing_insert(object,
1871 new_backing_object);
1872 vm_object_reference(new_backing_object);
1873 object->backing_object_offset +=
1874 backing_object->backing_object_offset;
1878 * Drop the reference count on backing_object. Since
1879 * its ref_count was at least 2, it will not vanish.
1881 refcount_release(&backing_object->ref_count);
1882 VM_OBJECT_WUNLOCK(backing_object);
1883 counter_u64_add(object_bypasses, 1);
1887 * Try again with this object's new backing object.
1893 * vm_object_page_remove:
1895 * For the given object, either frees or invalidates each of the
1896 * specified pages. In general, a page is freed. However, if a page is
1897 * wired for any reason other than the existence of a managed, wired
1898 * mapping, then it may be invalidated but not removed from the object.
1899 * Pages are specified by the given range ["start", "end") and the option
1900 * OBJPR_CLEANONLY. As a special case, if "end" is zero, then the range
1901 * extends from "start" to the end of the object. If the option
1902 * OBJPR_CLEANONLY is specified, then only the non-dirty pages within the
1903 * specified range are affected. If the option OBJPR_NOTMAPPED is
1904 * specified, then the pages within the specified range must have no
1905 * mappings. Otherwise, if this option is not specified, any mappings to
1906 * the specified pages are removed before the pages are freed or
1909 * In general, this operation should only be performed on objects that
1910 * contain managed pages. There are, however, two exceptions. First, it
1911 * is performed on the kernel and kmem objects by vm_map_entry_delete().
1912 * Second, it is used by msync(..., MS_INVALIDATE) to invalidate device-
1913 * backed pages. In both of these cases, the option OBJPR_CLEANONLY must
1914 * not be specified and the option OBJPR_NOTMAPPED must be specified.
1916 * The object must be locked.
1919 vm_object_page_remove(vm_object_t object, vm_pindex_t start, vm_pindex_t end,
1924 VM_OBJECT_ASSERT_WLOCKED(object);
1925 KASSERT((object->flags & OBJ_UNMANAGED) == 0 ||
1926 (options & (OBJPR_CLEANONLY | OBJPR_NOTMAPPED)) == OBJPR_NOTMAPPED,
1927 ("vm_object_page_remove: illegal options for object %p", object));
1928 if (object->resident_page_count == 0)
1930 vm_object_pip_add(object, 1);
1932 p = vm_page_find_least(object, start);
1935 * Here, the variable "p" is either (1) the page with the least pindex
1936 * greater than or equal to the parameter "start" or (2) NULL.
1938 for (; p != NULL && (p->pindex < end || end == 0); p = next) {
1939 next = TAILQ_NEXT(p, listq);
1942 * If the page is wired for any reason besides the existence
1943 * of managed, wired mappings, then it cannot be freed. For
1944 * example, fictitious pages, which represent device memory,
1945 * are inherently wired and cannot be freed. They can,
1946 * however, be invalidated if the option OBJPR_CLEANONLY is
1949 if (vm_page_tryxbusy(p) == 0) {
1950 vm_page_sleep_if_busy(p, "vmopar");
1953 if (vm_page_wired(p)) {
1955 if ((options & OBJPR_NOTMAPPED) == 0 &&
1956 object->ref_count != 0)
1958 if ((options & OBJPR_CLEANONLY) == 0) {
1965 KASSERT((p->flags & PG_FICTITIOUS) == 0,
1966 ("vm_object_page_remove: page %p is fictitious", p));
1967 if ((options & OBJPR_CLEANONLY) != 0 &&
1968 !vm_page_none_valid(p)) {
1969 if ((options & OBJPR_NOTMAPPED) == 0 &&
1970 object->ref_count != 0 &&
1971 !vm_page_try_remove_write(p))
1973 if (p->dirty != 0) {
1978 if ((options & OBJPR_NOTMAPPED) == 0 &&
1979 object->ref_count != 0 && !vm_page_try_remove_all(p))
1983 vm_object_pip_wakeup(object);
1987 * vm_object_page_noreuse:
1989 * For the given object, attempt to move the specified pages to
1990 * the head of the inactive queue. This bypasses regular LRU
1991 * operation and allows the pages to be reused quickly under memory
1992 * pressure. If a page is wired for any reason, then it will not
1993 * be queued. Pages are specified by the range ["start", "end").
1994 * As a special case, if "end" is zero, then the range extends from
1995 * "start" to the end of the object.
1997 * This operation should only be performed on objects that
1998 * contain non-fictitious, managed pages.
2000 * The object must be locked.
2003 vm_object_page_noreuse(vm_object_t object, vm_pindex_t start, vm_pindex_t end)
2008 VM_OBJECT_ASSERT_LOCKED(object);
2009 KASSERT((object->flags & (OBJ_FICTITIOUS | OBJ_UNMANAGED)) == 0,
2010 ("vm_object_page_noreuse: illegal object %p", object));
2011 if (object->resident_page_count == 0)
2013 p = vm_page_find_least(object, start);
2016 * Here, the variable "p" is either (1) the page with the least pindex
2017 * greater than or equal to the parameter "start" or (2) NULL.
2020 for (; p != NULL && (p->pindex < end || end == 0); p = next) {
2021 next = TAILQ_NEXT(p, listq);
2022 vm_page_change_lock(p, &mtx);
2023 vm_page_deactivate_noreuse(p);
2030 * Populate the specified range of the object with valid pages. Returns
2031 * TRUE if the range is successfully populated and FALSE otherwise.
2033 * Note: This function should be optimized to pass a larger array of
2034 * pages to vm_pager_get_pages() before it is applied to a non-
2035 * OBJT_DEVICE object.
2037 * The object must be locked.
2040 vm_object_populate(vm_object_t object, vm_pindex_t start, vm_pindex_t end)
2046 VM_OBJECT_ASSERT_WLOCKED(object);
2047 for (pindex = start; pindex < end; pindex++) {
2048 rv = vm_page_grab_valid(&m, object, pindex, VM_ALLOC_NORMAL);
2049 if (rv != VM_PAGER_OK)
2053 * Keep "m" busy because a subsequent iteration may unlock
2057 if (pindex > start) {
2058 m = vm_page_lookup(object, start);
2059 while (m != NULL && m->pindex < pindex) {
2061 m = TAILQ_NEXT(m, listq);
2064 return (pindex == end);
2068 * Routine: vm_object_coalesce
2069 * Function: Coalesces two objects backing up adjoining
2070 * regions of memory into a single object.
2072 * returns TRUE if objects were combined.
2074 * NOTE: Only works at the moment if the second object is NULL -
2075 * if it's not, which object do we lock first?
2078 * prev_object First object to coalesce
2079 * prev_offset Offset into prev_object
2080 * prev_size Size of reference to prev_object
2081 * next_size Size of reference to the second object
2082 * reserved Indicator that extension region has
2083 * swap accounted for
2086 * The object must *not* be locked.
2089 vm_object_coalesce(vm_object_t prev_object, vm_ooffset_t prev_offset,
2090 vm_size_t prev_size, vm_size_t next_size, boolean_t reserved)
2092 vm_pindex_t next_pindex;
2094 if (prev_object == NULL)
2096 if ((prev_object->flags & OBJ_ANON) == 0)
2099 VM_OBJECT_WLOCK(prev_object);
2101 * Try to collapse the object first
2103 vm_object_collapse(prev_object);
2106 * Can't coalesce if: . more than one reference . paged out . shadows
2107 * another object . has a copy elsewhere (any of which mean that the
2108 * pages not mapped to prev_entry may be in use anyway)
2110 if (prev_object->backing_object != NULL) {
2111 VM_OBJECT_WUNLOCK(prev_object);
2115 prev_size >>= PAGE_SHIFT;
2116 next_size >>= PAGE_SHIFT;
2117 next_pindex = OFF_TO_IDX(prev_offset) + prev_size;
2119 if (prev_object->ref_count > 1 &&
2120 prev_object->size != next_pindex &&
2121 (prev_object->flags & OBJ_ONEMAPPING) == 0) {
2122 VM_OBJECT_WUNLOCK(prev_object);
2127 * Account for the charge.
2129 if (prev_object->cred != NULL) {
2132 * If prev_object was charged, then this mapping,
2133 * although not charged now, may become writable
2134 * later. Non-NULL cred in the object would prevent
2135 * swap reservation during enabling of the write
2136 * access, so reserve swap now. Failed reservation
2137 * cause allocation of the separate object for the map
2138 * entry, and swap reservation for this entry is
2139 * managed in appropriate time.
2141 if (!reserved && !swap_reserve_by_cred(ptoa(next_size),
2142 prev_object->cred)) {
2143 VM_OBJECT_WUNLOCK(prev_object);
2146 prev_object->charge += ptoa(next_size);
2150 * Remove any pages that may still be in the object from a previous
2153 if (next_pindex < prev_object->size) {
2154 vm_object_page_remove(prev_object, next_pindex, next_pindex +
2156 if (prev_object->type == OBJT_SWAP)
2157 swap_pager_freespace(prev_object,
2158 next_pindex, next_size);
2160 if (prev_object->cred != NULL) {
2161 KASSERT(prev_object->charge >=
2162 ptoa(prev_object->size - next_pindex),
2163 ("object %p overcharged 1 %jx %jx", prev_object,
2164 (uintmax_t)next_pindex, (uintmax_t)next_size));
2165 prev_object->charge -= ptoa(prev_object->size -
2172 * Extend the object if necessary.
2174 if (next_pindex + next_size > prev_object->size)
2175 prev_object->size = next_pindex + next_size;
2177 VM_OBJECT_WUNLOCK(prev_object);
2182 vm_object_set_writeable_dirty(vm_object_t object)
2185 VM_OBJECT_ASSERT_LOCKED(object);
2187 /* Only set for vnodes & tmpfs */
2188 if (object->type != OBJT_VNODE &&
2189 (object->flags & OBJ_TMPFS_NODE) == 0)
2191 atomic_add_int(&object->generation, 1);
2197 * For each page offset within the specified range of the given object,
2198 * find the highest-level page in the shadow chain and unwire it. A page
2199 * must exist at every page offset, and the highest-level page must be
2203 vm_object_unwire(vm_object_t object, vm_ooffset_t offset, vm_size_t length,
2206 vm_object_t tobject, t1object;
2208 vm_pindex_t end_pindex, pindex, tpindex;
2209 int depth, locked_depth;
2211 KASSERT((offset & PAGE_MASK) == 0,
2212 ("vm_object_unwire: offset is not page aligned"));
2213 KASSERT((length & PAGE_MASK) == 0,
2214 ("vm_object_unwire: length is not a multiple of PAGE_SIZE"));
2215 /* The wired count of a fictitious page never changes. */
2216 if ((object->flags & OBJ_FICTITIOUS) != 0)
2218 pindex = OFF_TO_IDX(offset);
2219 end_pindex = pindex + atop(length);
2222 VM_OBJECT_RLOCK(object);
2223 m = vm_page_find_least(object, pindex);
2224 while (pindex < end_pindex) {
2225 if (m == NULL || pindex < m->pindex) {
2227 * The first object in the shadow chain doesn't
2228 * contain a page at the current index. Therefore,
2229 * the page must exist in a backing object.
2236 OFF_TO_IDX(tobject->backing_object_offset);
2237 tobject = tobject->backing_object;
2238 KASSERT(tobject != NULL,
2239 ("vm_object_unwire: missing page"));
2240 if ((tobject->flags & OBJ_FICTITIOUS) != 0)
2243 if (depth == locked_depth) {
2245 VM_OBJECT_RLOCK(tobject);
2247 } while ((tm = vm_page_lookup(tobject, tpindex)) ==
2251 m = TAILQ_NEXT(m, listq);
2253 if (vm_page_trysbusy(tm) == 0) {
2254 for (tobject = object; locked_depth >= 1;
2256 t1object = tobject->backing_object;
2257 if (tm->object != tobject)
2258 VM_OBJECT_RUNLOCK(tobject);
2261 vm_page_busy_sleep(tm, "unwbo", true);
2264 vm_page_unwire(tm, queue);
2265 vm_page_sunbusy(tm);
2269 /* Release the accumulated object locks. */
2270 for (tobject = object; locked_depth >= 1; locked_depth--) {
2271 t1object = tobject->backing_object;
2272 VM_OBJECT_RUNLOCK(tobject);
2278 * Return the vnode for the given object, or NULL if none exists.
2279 * For tmpfs objects, the function may return NULL if there is
2280 * no vnode allocated at the time of the call.
2283 vm_object_vnode(vm_object_t object)
2287 VM_OBJECT_ASSERT_LOCKED(object);
2288 if (object->type == OBJT_VNODE) {
2289 vp = object->handle;
2290 KASSERT(vp != NULL, ("%s: OBJT_VNODE has no vnode", __func__));
2291 } else if (object->type == OBJT_SWAP &&
2292 (object->flags & OBJ_TMPFS) != 0) {
2293 vp = object->un_pager.swp.swp_tmpfs;
2294 KASSERT(vp != NULL, ("%s: OBJT_TMPFS has no vnode", __func__));
2303 * Busy the vm object. This prevents new pages belonging to the object from
2304 * becoming busy. Existing pages persist as busy. Callers are responsible
2305 * for checking page state before proceeding.
2308 vm_object_busy(vm_object_t obj)
2311 VM_OBJECT_ASSERT_LOCKED(obj);
2313 refcount_acquire(&obj->busy);
2314 /* The fence is required to order loads of page busy. */
2315 atomic_thread_fence_acq_rel();
2319 vm_object_unbusy(vm_object_t obj)
2323 refcount_release(&obj->busy);
2327 vm_object_busy_wait(vm_object_t obj, const char *wmesg)
2330 VM_OBJECT_ASSERT_UNLOCKED(obj);
2333 refcount_sleep(&obj->busy, wmesg, PVM);
2337 * Return the kvme type of the given object.
2338 * If vpp is not NULL, set it to the object's vm_object_vnode() or NULL.
2341 vm_object_kvme_type(vm_object_t object, struct vnode **vpp)
2344 VM_OBJECT_ASSERT_LOCKED(object);
2346 *vpp = vm_object_vnode(object);
2347 switch (object->type) {
2349 return (KVME_TYPE_DEFAULT);
2351 return (KVME_TYPE_VNODE);
2353 if ((object->flags & OBJ_TMPFS_NODE) != 0)
2354 return (KVME_TYPE_VNODE);
2355 return (KVME_TYPE_SWAP);
2357 return (KVME_TYPE_DEVICE);
2359 return (KVME_TYPE_PHYS);
2361 return (KVME_TYPE_DEAD);
2363 return (KVME_TYPE_SG);
2364 case OBJT_MGTDEVICE:
2365 return (KVME_TYPE_MGTDEVICE);
2367 return (KVME_TYPE_UNKNOWN);
2372 sysctl_vm_object_list(SYSCTL_HANDLER_ARGS)
2374 struct kinfo_vmobject *kvo;
2375 char *fullpath, *freepath;
2382 if (req->oldptr == NULL) {
2384 * If an old buffer has not been provided, generate an
2385 * estimate of the space needed for a subsequent call.
2387 mtx_lock(&vm_object_list_mtx);
2389 TAILQ_FOREACH(obj, &vm_object_list, object_list) {
2390 if (obj->type == OBJT_DEAD)
2394 mtx_unlock(&vm_object_list_mtx);
2395 return (SYSCTL_OUT(req, NULL, sizeof(struct kinfo_vmobject) *
2399 kvo = malloc(sizeof(*kvo), M_TEMP, M_WAITOK);
2403 * VM objects are type stable and are never removed from the
2404 * list once added. This allows us to safely read obj->object_list
2405 * after reacquiring the VM object lock.
2407 mtx_lock(&vm_object_list_mtx);
2408 TAILQ_FOREACH(obj, &vm_object_list, object_list) {
2409 if (obj->type == OBJT_DEAD)
2411 VM_OBJECT_RLOCK(obj);
2412 if (obj->type == OBJT_DEAD) {
2413 VM_OBJECT_RUNLOCK(obj);
2416 mtx_unlock(&vm_object_list_mtx);
2417 kvo->kvo_size = ptoa(obj->size);
2418 kvo->kvo_resident = obj->resident_page_count;
2419 kvo->kvo_ref_count = obj->ref_count;
2420 kvo->kvo_shadow_count = obj->shadow_count;
2421 kvo->kvo_memattr = obj->memattr;
2422 kvo->kvo_active = 0;
2423 kvo->kvo_inactive = 0;
2424 TAILQ_FOREACH(m, &obj->memq, listq) {
2426 * A page may belong to the object but be
2427 * dequeued and set to PQ_NONE while the
2428 * object lock is not held. This makes the
2429 * reads of m->queue below racy, and we do not
2430 * count pages set to PQ_NONE. However, this
2431 * sysctl is only meant to give an
2432 * approximation of the system anyway.
2434 if (m->queue == PQ_ACTIVE)
2436 else if (m->queue == PQ_INACTIVE)
2437 kvo->kvo_inactive++;
2440 kvo->kvo_vn_fileid = 0;
2441 kvo->kvo_vn_fsid = 0;
2442 kvo->kvo_vn_fsid_freebsd11 = 0;
2445 kvo->kvo_type = vm_object_kvme_type(obj, &vp);
2448 VM_OBJECT_RUNLOCK(obj);
2450 vn_fullpath(curthread, vp, &fullpath, &freepath);
2451 vn_lock(vp, LK_SHARED | LK_RETRY);
2452 if (VOP_GETATTR(vp, &va, curthread->td_ucred) == 0) {
2453 kvo->kvo_vn_fileid = va.va_fileid;
2454 kvo->kvo_vn_fsid = va.va_fsid;
2455 kvo->kvo_vn_fsid_freebsd11 = va.va_fsid;
2461 strlcpy(kvo->kvo_path, fullpath, sizeof(kvo->kvo_path));
2462 if (freepath != NULL)
2463 free(freepath, M_TEMP);
2465 /* Pack record size down */
2466 kvo->kvo_structsize = offsetof(struct kinfo_vmobject, kvo_path)
2467 + strlen(kvo->kvo_path) + 1;
2468 kvo->kvo_structsize = roundup(kvo->kvo_structsize,
2470 error = SYSCTL_OUT(req, kvo, kvo->kvo_structsize);
2471 mtx_lock(&vm_object_list_mtx);
2475 mtx_unlock(&vm_object_list_mtx);
2479 SYSCTL_PROC(_vm, OID_AUTO, objects, CTLTYPE_STRUCT | CTLFLAG_RW | CTLFLAG_SKIP |
2480 CTLFLAG_MPSAFE, NULL, 0, sysctl_vm_object_list, "S,kinfo_vmobject",
2481 "List of VM objects");
2483 #include "opt_ddb.h"
2485 #include <sys/kernel.h>
2487 #include <sys/cons.h>
2489 #include <ddb/ddb.h>
2492 _vm_object_in_map(vm_map_t map, vm_object_t object, vm_map_entry_t entry)
2495 vm_map_entry_t tmpe;
2502 VM_MAP_ENTRY_FOREACH(tmpe, map) {
2503 if (_vm_object_in_map(map, object, tmpe)) {
2507 } else if (entry->eflags & MAP_ENTRY_IS_SUB_MAP) {
2508 tmpm = entry->object.sub_map;
2509 VM_MAP_ENTRY_FOREACH(tmpe, tmpm) {
2510 if (_vm_object_in_map(tmpm, object, tmpe)) {
2514 } else if ((obj = entry->object.vm_object) != NULL) {
2515 for (; obj; obj = obj->backing_object)
2516 if (obj == object) {
2524 vm_object_in_map(vm_object_t object)
2528 /* sx_slock(&allproc_lock); */
2529 FOREACH_PROC_IN_SYSTEM(p) {
2530 if (!p->p_vmspace /* || (p->p_flag & (P_SYSTEM|P_WEXIT)) */)
2532 if (_vm_object_in_map(&p->p_vmspace->vm_map, object, 0)) {
2533 /* sx_sunlock(&allproc_lock); */
2537 /* sx_sunlock(&allproc_lock); */
2538 if (_vm_object_in_map(kernel_map, object, 0))
2543 DB_SHOW_COMMAND(vmochk, vm_object_check)
2548 * make sure that internal objs are in a map somewhere
2549 * and none have zero ref counts.
2551 TAILQ_FOREACH(object, &vm_object_list, object_list) {
2552 if (object->handle == NULL &&
2553 (object->type == OBJT_DEFAULT || object->type == OBJT_SWAP)) {
2554 if (object->ref_count == 0) {
2555 db_printf("vmochk: internal obj has zero ref count: %ld\n",
2556 (long)object->size);
2558 if (!vm_object_in_map(object)) {
2560 "vmochk: internal obj is not in a map: "
2561 "ref: %d, size: %lu: 0x%lx, backing_object: %p\n",
2562 object->ref_count, (u_long)object->size,
2563 (u_long)object->size,
2564 (void *)object->backing_object);
2571 * vm_object_print: [ debug ]
2573 DB_SHOW_COMMAND(object, vm_object_print_static)
2575 /* XXX convert args. */
2576 vm_object_t object = (vm_object_t)addr;
2577 boolean_t full = have_addr;
2581 /* XXX count is an (unused) arg. Avoid shadowing it. */
2582 #define count was_count
2590 "Object %p: type=%d, size=0x%jx, res=%d, ref=%d, flags=0x%x ruid %d charge %jx\n",
2591 object, (int)object->type, (uintmax_t)object->size,
2592 object->resident_page_count, object->ref_count, object->flags,
2593 object->cred ? object->cred->cr_ruid : -1, (uintmax_t)object->charge);
2594 db_iprintf(" sref=%d, backing_object(%d)=(%p)+0x%jx\n",
2595 object->shadow_count,
2596 object->backing_object ? object->backing_object->ref_count : 0,
2597 object->backing_object, (uintmax_t)object->backing_object_offset);
2604 TAILQ_FOREACH(p, &object->memq, listq) {
2606 db_iprintf("memory:=");
2607 else if (count == 6) {
2615 db_printf("(off=0x%jx,page=0x%jx)",
2616 (uintmax_t)p->pindex, (uintmax_t)VM_PAGE_TO_PHYS(p));
2626 /* XXX need this non-static entry for calling from vm_map_print. */
2629 /* db_expr_t */ long addr,
2630 boolean_t have_addr,
2631 /* db_expr_t */ long count,
2634 vm_object_print_static(addr, have_addr, count, modif);
2637 DB_SHOW_COMMAND(vmopag, vm_object_print_pages)
2642 vm_page_t m, prev_m;
2646 TAILQ_FOREACH(object, &vm_object_list, object_list) {
2647 db_printf("new object: %p\n", (void *)object);
2658 TAILQ_FOREACH(m, &object->memq, listq) {
2659 if (m->pindex > 128)
2661 if ((prev_m = TAILQ_PREV(m, pglist, listq)) != NULL &&
2662 prev_m->pindex + 1 != m->pindex) {
2664 db_printf(" index(%ld)run(%d)pa(0x%lx)\n",
2665 (long)fidx, rcount, (long)pa);
2677 (VM_PAGE_TO_PHYS(m) == pa + rcount * PAGE_SIZE)) {
2682 db_printf(" index(%ld)run(%d)pa(0x%lx)\n",
2683 (long)fidx, rcount, (long)pa);
2693 pa = VM_PAGE_TO_PHYS(m);
2697 db_printf(" index(%ld)run(%d)pa(0x%lx)\n",
2698 (long)fidx, rcount, (long)pa);