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/blockcount.h>
75 #include <sys/cpuset.h>
76 #include <sys/limits.h>
79 #include <sys/mount.h>
80 #include <sys/kernel.h>
81 #include <sys/pctrie.h>
82 #include <sys/sysctl.h>
83 #include <sys/mutex.h>
84 #include <sys/proc.h> /* for curproc, pageproc */
85 #include <sys/refcount.h>
86 #include <sys/socket.h>
87 #include <sys/resourcevar.h>
88 #include <sys/refcount.h>
89 #include <sys/rwlock.h>
91 #include <sys/vnode.h>
92 #include <sys/vmmeter.h>
96 #include <vm/vm_param.h>
98 #include <vm/vm_map.h>
99 #include <vm/vm_object.h>
100 #include <vm/vm_page.h>
101 #include <vm/vm_pageout.h>
102 #include <vm/vm_pager.h>
103 #include <vm/vm_phys.h>
104 #include <vm/vm_pagequeue.h>
105 #include <vm/swap_pager.h>
106 #include <vm/vm_kern.h>
107 #include <vm/vm_extern.h>
108 #include <vm/vm_radix.h>
109 #include <vm/vm_reserv.h>
112 static int old_msync;
113 SYSCTL_INT(_vm, OID_AUTO, old_msync, CTLFLAG_RW, &old_msync, 0,
114 "Use old (insecure) msync behavior");
116 static int vm_object_page_collect_flush(vm_object_t object, vm_page_t p,
117 int pagerflags, int flags, boolean_t *allclean,
119 static boolean_t vm_object_page_remove_write(vm_page_t p, int flags,
120 boolean_t *allclean);
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 | CTLFLAG_MPSAFE, 0,
157 static COUNTER_U64_DEFINE_EARLY(object_collapses);
158 SYSCTL_COUNTER_U64(_vm_stats_object, OID_AUTO, collapses, CTLFLAG_RD,
160 "VM object collapses");
162 static COUNTER_U64_DEFINE_EARLY(object_bypasses);
163 SYSCTL_COUNTER_U64(_vm_stats_object, OID_AUTO, bypasses, CTLFLAG_RD,
165 "VM object bypasses");
167 static COUNTER_U64_DEFINE_EARLY(object_collapse_waits);
168 SYSCTL_COUNTER_U64(_vm_stats_object, OID_AUTO, collapse_waits, CTLFLAG_RD,
169 &object_collapse_waits,
170 "Number of sleeps for collapse");
172 static uma_zone_t obj_zone;
174 static int vm_object_zinit(void *mem, int size, int flags);
177 static void vm_object_zdtor(void *mem, int size, void *arg);
180 vm_object_zdtor(void *mem, int size, void *arg)
184 object = (vm_object_t)mem;
185 KASSERT(object->ref_count == 0,
186 ("object %p ref_count = %d", object, object->ref_count));
187 KASSERT(TAILQ_EMPTY(&object->memq),
188 ("object %p has resident pages in its memq", object));
189 KASSERT(vm_radix_is_empty(&object->rtree),
190 ("object %p has resident pages in its trie", object));
191 #if VM_NRESERVLEVEL > 0
192 KASSERT(LIST_EMPTY(&object->rvq),
193 ("object %p has reservations",
196 KASSERT(!vm_object_busied(object),
197 ("object %p busy = %d", object, blockcount_read(&object->busy)));
198 KASSERT(object->resident_page_count == 0,
199 ("object %p resident_page_count = %d",
200 object, object->resident_page_count));
201 KASSERT(atomic_load_int(&object->shadow_count) == 0,
202 ("object %p shadow_count = %d",
203 object, atomic_load_int(&object->shadow_count)));
204 KASSERT(object->type == OBJT_DEAD,
205 ("object %p has non-dead type %d",
206 object, object->type));
207 KASSERT(object->charge == 0 && object->cred == NULL,
208 ("object %p has non-zero charge %ju (%p)",
209 object, (uintmax_t)object->charge, object->cred));
214 vm_object_zinit(void *mem, int size, int flags)
218 object = (vm_object_t)mem;
219 rw_init_flags(&object->lock, "vm object", RW_DUPOK | RW_NEW);
221 /* These are true for any object that has been freed */
222 object->type = OBJT_DEAD;
223 vm_radix_init(&object->rtree);
224 refcount_init(&object->ref_count, 0);
225 blockcount_init(&object->paging_in_progress);
226 blockcount_init(&object->busy);
227 object->resident_page_count = 0;
228 atomic_store_int(&object->shadow_count, 0);
229 object->flags = OBJ_DEAD;
231 mtx_lock(&vm_object_list_mtx);
232 TAILQ_INSERT_TAIL(&vm_object_list, object, object_list);
233 mtx_unlock(&vm_object_list_mtx);
238 _vm_object_allocate(objtype_t type, vm_pindex_t size, u_short flags,
239 vm_object_t object, void *handle)
242 TAILQ_INIT(&object->memq);
243 LIST_INIT(&object->shadow_head);
246 object->flags = flags;
247 if ((flags & OBJ_SWAP) != 0)
248 pctrie_init(&object->un_pager.swp.swp_blks);
251 * Ensure that swap_pager_swapoff() iteration over object_list
252 * sees up to date type and pctrie head if it observed
255 atomic_thread_fence_rel();
257 object->pg_color = 0;
259 object->domain.dr_policy = NULL;
260 object->generation = 1;
261 object->cleangeneration = 1;
262 refcount_init(&object->ref_count, 1);
263 object->memattr = VM_MEMATTR_DEFAULT;
266 object->handle = handle;
267 object->backing_object = NULL;
268 object->backing_object_offset = (vm_ooffset_t) 0;
269 #if VM_NRESERVLEVEL > 0
270 LIST_INIT(&object->rvq);
272 umtx_shm_object_init(object);
278 * Initialize the VM objects module.
283 TAILQ_INIT(&vm_object_list);
284 mtx_init(&vm_object_list_mtx, "vm object_list", NULL, MTX_DEF);
286 rw_init(&kernel_object->lock, "kernel vm object");
287 _vm_object_allocate(OBJT_PHYS, atop(VM_MAX_KERNEL_ADDRESS -
288 VM_MIN_KERNEL_ADDRESS), OBJ_UNMANAGED, kernel_object, NULL);
289 #if VM_NRESERVLEVEL > 0
290 kernel_object->flags |= OBJ_COLORED;
291 kernel_object->pg_color = (u_short)atop(VM_MIN_KERNEL_ADDRESS);
293 kernel_object->un_pager.phys.ops = &default_phys_pg_ops;
296 * The lock portion of struct vm_object must be type stable due
297 * to vm_pageout_fallback_object_lock locking a vm object
298 * without holding any references to it.
300 * paging_in_progress is valid always. Lockless references to
301 * the objects may acquire pip and then check OBJ_DEAD.
303 obj_zone = uma_zcreate("VM OBJECT", sizeof (struct vm_object), NULL,
309 vm_object_zinit, NULL, UMA_ALIGN_PTR, UMA_ZONE_NOFREE);
315 vm_object_clear_flag(vm_object_t object, u_short bits)
318 VM_OBJECT_ASSERT_WLOCKED(object);
319 object->flags &= ~bits;
323 * Sets the default memory attribute for the specified object. Pages
324 * that are allocated to this object are by default assigned this memory
327 * Presently, this function must be called before any pages are allocated
328 * to the object. In the future, this requirement may be relaxed for
329 * "default" and "swap" objects.
332 vm_object_set_memattr(vm_object_t object, vm_memattr_t memattr)
335 VM_OBJECT_ASSERT_WLOCKED(object);
337 if (object->type == OBJT_DEAD)
338 return (KERN_INVALID_ARGUMENT);
339 if (!TAILQ_EMPTY(&object->memq))
340 return (KERN_FAILURE);
342 object->memattr = memattr;
343 return (KERN_SUCCESS);
347 vm_object_pip_add(vm_object_t object, short i)
351 blockcount_acquire(&object->paging_in_progress, i);
355 vm_object_pip_wakeup(vm_object_t object)
358 vm_object_pip_wakeupn(object, 1);
362 vm_object_pip_wakeupn(vm_object_t object, short i)
366 blockcount_release(&object->paging_in_progress, i);
370 * Atomically drop the object lock and wait for pip to drain. This protects
371 * from sleep/wakeup races due to identity changes. The lock is not re-acquired
375 vm_object_pip_sleep(vm_object_t object, const char *waitid)
378 (void)blockcount_sleep(&object->paging_in_progress, &object->lock,
379 waitid, PVM | PDROP);
383 vm_object_pip_wait(vm_object_t object, const char *waitid)
386 VM_OBJECT_ASSERT_WLOCKED(object);
388 blockcount_wait(&object->paging_in_progress, &object->lock, waitid,
393 vm_object_pip_wait_unlocked(vm_object_t object, const char *waitid)
396 VM_OBJECT_ASSERT_UNLOCKED(object);
398 blockcount_wait(&object->paging_in_progress, NULL, waitid, PVM);
402 * vm_object_allocate:
404 * Returns a new object with the given size.
407 vm_object_allocate(objtype_t type, vm_pindex_t size)
414 panic("vm_object_allocate: can't create OBJT_DEAD");
419 flags = OBJ_COLORED | OBJ_SWAP;
423 flags = OBJ_FICTITIOUS | OBJ_UNMANAGED;
426 flags = OBJ_FICTITIOUS;
429 flags = OBJ_UNMANAGED;
435 panic("vm_object_allocate: type %d is undefined or dynamic",
438 object = (vm_object_t)uma_zalloc(obj_zone, M_WAITOK);
439 _vm_object_allocate(type, size, flags, object, NULL);
445 vm_object_allocate_dyn(objtype_t dyntype, vm_pindex_t size, u_short flags)
449 MPASS(dyntype >= OBJT_FIRST_DYN /* && dyntype < nitems(pagertab) */);
450 object = (vm_object_t)uma_zalloc(obj_zone, M_WAITOK);
451 _vm_object_allocate(dyntype, size, flags, object, NULL);
457 * vm_object_allocate_anon:
459 * Returns a new default object of the given size and marked as
460 * anonymous memory for special split/collapse handling. Color
461 * to be initialized by the caller.
464 vm_object_allocate_anon(vm_pindex_t size, vm_object_t backing_object,
465 struct ucred *cred, vm_size_t charge)
467 vm_object_t handle, object;
469 if (backing_object == NULL)
471 else if ((backing_object->flags & OBJ_ANON) != 0)
472 handle = backing_object->handle;
474 handle = backing_object;
475 object = uma_zalloc(obj_zone, M_WAITOK);
476 _vm_object_allocate(OBJT_DEFAULT, size, OBJ_ANON | OBJ_ONEMAPPING,
479 object->charge = cred != NULL ? charge : 0;
484 vm_object_reference_vnode(vm_object_t object)
489 * vnode objects need the lock for the first reference
490 * to serialize with vnode_object_deallocate().
492 if (!refcount_acquire_if_gt(&object->ref_count, 0)) {
493 VM_OBJECT_RLOCK(object);
494 old = refcount_acquire(&object->ref_count);
495 if (object->type == OBJT_VNODE && old == 0)
496 vref(object->handle);
497 VM_OBJECT_RUNLOCK(object);
502 * vm_object_reference:
504 * Acquires a reference to the given object.
507 vm_object_reference(vm_object_t object)
513 if (object->type == OBJT_VNODE)
514 vm_object_reference_vnode(object);
516 refcount_acquire(&object->ref_count);
517 KASSERT((object->flags & OBJ_DEAD) == 0,
518 ("vm_object_reference: Referenced dead object."));
522 * vm_object_reference_locked:
524 * Gets another reference to the given object.
526 * The object must be locked.
529 vm_object_reference_locked(vm_object_t object)
533 VM_OBJECT_ASSERT_LOCKED(object);
534 old = refcount_acquire(&object->ref_count);
535 if (object->type == OBJT_VNODE && old == 0)
536 vref(object->handle);
537 KASSERT((object->flags & OBJ_DEAD) == 0,
538 ("vm_object_reference: Referenced dead object."));
542 * Handle deallocating an object of type OBJT_VNODE.
545 vm_object_deallocate_vnode(vm_object_t object)
547 struct vnode *vp = (struct vnode *) object->handle;
550 KASSERT(object->type == OBJT_VNODE,
551 ("vm_object_deallocate_vnode: not a vnode object"));
552 KASSERT(vp != NULL, ("vm_object_deallocate_vnode: missing vp"));
554 /* Object lock to protect handle lookup. */
555 last = refcount_release(&object->ref_count);
556 VM_OBJECT_RUNLOCK(object);
561 if (!umtx_shm_vnobj_persistent)
562 umtx_shm_object_terminated(object);
564 /* vrele may need the vnode lock. */
569 * We dropped a reference on an object and discovered that it had a
570 * single remaining shadow. This is a sibling of the reference we
571 * dropped. Attempt to collapse the sibling and backing object.
574 vm_object_deallocate_anon(vm_object_t backing_object)
578 /* Fetch the final shadow. */
579 object = LIST_FIRST(&backing_object->shadow_head);
580 KASSERT(object != NULL &&
581 atomic_load_int(&backing_object->shadow_count) == 1,
582 ("vm_object_anon_deallocate: ref_count: %d, shadow_count: %d",
583 backing_object->ref_count,
584 atomic_load_int(&backing_object->shadow_count)));
585 KASSERT((object->flags & OBJ_ANON) != 0,
586 ("invalid shadow object %p", object));
588 if (!VM_OBJECT_TRYWLOCK(object)) {
590 * Prevent object from disappearing since we do not have a
593 vm_object_pip_add(object, 1);
594 VM_OBJECT_WUNLOCK(backing_object);
595 VM_OBJECT_WLOCK(object);
596 vm_object_pip_wakeup(object);
598 VM_OBJECT_WUNLOCK(backing_object);
601 * Check for a collapse/terminate race with the last reference holder.
603 if ((object->flags & (OBJ_DEAD | OBJ_COLLAPSING)) != 0 ||
604 !refcount_acquire_if_not_zero(&object->ref_count)) {
605 VM_OBJECT_WUNLOCK(object);
608 backing_object = object->backing_object;
609 if (backing_object != NULL && (backing_object->flags & OBJ_ANON) != 0)
610 vm_object_collapse(object);
611 VM_OBJECT_WUNLOCK(object);
617 * vm_object_deallocate:
619 * Release a reference to the specified object,
620 * gained either through a vm_object_allocate
621 * or a vm_object_reference call. When all references
622 * are gone, storage associated with this object
623 * may be relinquished.
625 * No object may be locked.
628 vm_object_deallocate(vm_object_t object)
633 while (object != NULL) {
635 * If the reference count goes to 0 we start calling
636 * vm_object_terminate() on the object chain. A ref count
637 * of 1 may be a special case depending on the shadow count
638 * being 0 or 1. These cases require a write lock on the
641 if ((object->flags & OBJ_ANON) == 0)
642 released = refcount_release_if_gt(&object->ref_count, 1);
644 released = refcount_release_if_gt(&object->ref_count, 2);
648 if (object->type == OBJT_VNODE) {
649 VM_OBJECT_RLOCK(object);
650 if (object->type == OBJT_VNODE) {
651 vm_object_deallocate_vnode(object);
654 VM_OBJECT_RUNLOCK(object);
657 VM_OBJECT_WLOCK(object);
658 KASSERT(object->ref_count > 0,
659 ("vm_object_deallocate: object deallocated too many times: %d",
663 * If this is not the final reference to an anonymous
664 * object we may need to collapse the shadow chain.
666 if (!refcount_release(&object->ref_count)) {
667 if (object->ref_count > 1 ||
668 atomic_load_int(&object->shadow_count) == 0) {
669 if ((object->flags & OBJ_ANON) != 0 &&
670 object->ref_count == 1)
671 vm_object_set_flag(object,
673 VM_OBJECT_WUNLOCK(object);
677 /* Handle collapsing last ref on anonymous objects. */
678 object = vm_object_deallocate_anon(object);
683 * Handle the final reference to an object. We restart
684 * the loop with the backing object to avoid recursion.
686 umtx_shm_object_terminated(object);
687 temp = object->backing_object;
689 KASSERT(object->type == OBJT_DEFAULT ||
690 object->type == OBJT_SWAP,
691 ("shadowed tmpfs v_object 2 %p", object));
692 vm_object_backing_remove(object);
695 KASSERT((object->flags & OBJ_DEAD) == 0,
696 ("vm_object_deallocate: Terminating dead object."));
697 vm_object_set_flag(object, OBJ_DEAD);
698 vm_object_terminate(object);
704 * vm_object_destroy removes the object from the global object list
705 * and frees the space for the object.
708 vm_object_destroy(vm_object_t object)
712 * Release the allocation charge.
714 if (object->cred != NULL) {
715 swap_release_by_cred(object->charge, object->cred);
717 crfree(object->cred);
722 * Free the space for the object.
724 uma_zfree(obj_zone, object);
728 vm_object_sub_shadow(vm_object_t object)
730 KASSERT(object->shadow_count >= 1,
731 ("object %p sub_shadow count zero", object));
732 atomic_subtract_int(&object->shadow_count, 1);
736 vm_object_backing_remove_locked(vm_object_t object)
738 vm_object_t backing_object;
740 backing_object = object->backing_object;
741 VM_OBJECT_ASSERT_WLOCKED(object);
742 VM_OBJECT_ASSERT_WLOCKED(backing_object);
744 KASSERT((object->flags & OBJ_COLLAPSING) == 0,
745 ("vm_object_backing_remove: Removing collapsing object."));
747 vm_object_sub_shadow(backing_object);
748 if ((object->flags & OBJ_SHADOWLIST) != 0) {
749 LIST_REMOVE(object, shadow_list);
750 vm_object_clear_flag(object, OBJ_SHADOWLIST);
752 object->backing_object = NULL;
756 vm_object_backing_remove(vm_object_t object)
758 vm_object_t backing_object;
760 VM_OBJECT_ASSERT_WLOCKED(object);
762 backing_object = object->backing_object;
763 if ((object->flags & OBJ_SHADOWLIST) != 0) {
764 VM_OBJECT_WLOCK(backing_object);
765 vm_object_backing_remove_locked(object);
766 VM_OBJECT_WUNLOCK(backing_object);
768 object->backing_object = NULL;
769 vm_object_sub_shadow(backing_object);
774 vm_object_backing_insert_locked(vm_object_t object, vm_object_t backing_object)
777 VM_OBJECT_ASSERT_WLOCKED(object);
779 atomic_add_int(&backing_object->shadow_count, 1);
780 if ((backing_object->flags & OBJ_ANON) != 0) {
781 VM_OBJECT_ASSERT_WLOCKED(backing_object);
782 LIST_INSERT_HEAD(&backing_object->shadow_head, object,
784 vm_object_set_flag(object, OBJ_SHADOWLIST);
786 object->backing_object = backing_object;
790 vm_object_backing_insert(vm_object_t object, vm_object_t backing_object)
793 VM_OBJECT_ASSERT_WLOCKED(object);
795 if ((backing_object->flags & OBJ_ANON) != 0) {
796 VM_OBJECT_WLOCK(backing_object);
797 vm_object_backing_insert_locked(object, backing_object);
798 VM_OBJECT_WUNLOCK(backing_object);
800 object->backing_object = backing_object;
801 atomic_add_int(&backing_object->shadow_count, 1);
806 * Insert an object into a backing_object's shadow list with an additional
807 * reference to the backing_object added.
810 vm_object_backing_insert_ref(vm_object_t object, vm_object_t backing_object)
813 VM_OBJECT_ASSERT_WLOCKED(object);
815 if ((backing_object->flags & OBJ_ANON) != 0) {
816 VM_OBJECT_WLOCK(backing_object);
817 KASSERT((backing_object->flags & OBJ_DEAD) == 0,
818 ("shadowing dead anonymous object"));
819 vm_object_reference_locked(backing_object);
820 vm_object_backing_insert_locked(object, backing_object);
821 vm_object_clear_flag(backing_object, OBJ_ONEMAPPING);
822 VM_OBJECT_WUNLOCK(backing_object);
824 vm_object_reference(backing_object);
825 atomic_add_int(&backing_object->shadow_count, 1);
826 object->backing_object = backing_object;
831 * Transfer a backing reference from backing_object to object.
834 vm_object_backing_transfer(vm_object_t object, vm_object_t backing_object)
836 vm_object_t new_backing_object;
839 * Note that the reference to backing_object->backing_object
840 * moves from within backing_object to within object.
842 vm_object_backing_remove_locked(object);
843 new_backing_object = backing_object->backing_object;
844 if (new_backing_object == NULL)
846 if ((new_backing_object->flags & OBJ_ANON) != 0) {
847 VM_OBJECT_WLOCK(new_backing_object);
848 vm_object_backing_remove_locked(backing_object);
849 vm_object_backing_insert_locked(object, new_backing_object);
850 VM_OBJECT_WUNLOCK(new_backing_object);
853 * shadow_count for new_backing_object is left
854 * unchanged, its reference provided by backing_object
855 * is replaced by object.
857 object->backing_object = new_backing_object;
858 backing_object->backing_object = NULL;
863 * Wait for a concurrent collapse to settle.
866 vm_object_collapse_wait(vm_object_t object)
869 VM_OBJECT_ASSERT_WLOCKED(object);
871 while ((object->flags & OBJ_COLLAPSING) != 0) {
872 vm_object_pip_wait(object, "vmcolwait");
873 counter_u64_add(object_collapse_waits, 1);
878 * Waits for a backing object to clear a pending collapse and returns
879 * it locked if it is an ANON object.
882 vm_object_backing_collapse_wait(vm_object_t object)
884 vm_object_t backing_object;
886 VM_OBJECT_ASSERT_WLOCKED(object);
889 backing_object = object->backing_object;
890 if (backing_object == NULL ||
891 (backing_object->flags & OBJ_ANON) == 0)
893 VM_OBJECT_WLOCK(backing_object);
894 if ((backing_object->flags & (OBJ_DEAD | OBJ_COLLAPSING)) == 0)
896 VM_OBJECT_WUNLOCK(object);
897 vm_object_pip_sleep(backing_object, "vmbckwait");
898 counter_u64_add(object_collapse_waits, 1);
899 VM_OBJECT_WLOCK(object);
901 return (backing_object);
905 * vm_object_terminate_pages removes any remaining pageable pages
906 * from the object and resets the object to an empty state.
909 vm_object_terminate_pages(vm_object_t object)
913 VM_OBJECT_ASSERT_WLOCKED(object);
916 * Free any remaining pageable pages. This also removes them from the
917 * paging queues. However, don't free wired pages, just remove them
918 * from the object. Rather than incrementally removing each page from
919 * the object, the page and object are reset to any empty state.
921 TAILQ_FOREACH_SAFE(p, &object->memq, listq, p_next) {
922 vm_page_assert_unbusied(p);
923 KASSERT(p->object == object &&
924 (p->ref_count & VPRC_OBJREF) != 0,
925 ("vm_object_terminate_pages: page %p is inconsistent", p));
928 if (vm_page_drop(p, VPRC_OBJREF) == VPRC_OBJREF) {
935 * If the object contained any pages, then reset it to an empty state.
936 * None of the object's fields, including "resident_page_count", were
937 * modified by the preceding loop.
939 if (object->resident_page_count != 0) {
940 vm_radix_reclaim_allnodes(&object->rtree);
941 TAILQ_INIT(&object->memq);
942 object->resident_page_count = 0;
943 if (object->type == OBJT_VNODE)
944 vdrop(object->handle);
949 * vm_object_terminate actually destroys the specified object, freeing
950 * up all previously used resources.
952 * The object must be locked.
953 * This routine may block.
956 vm_object_terminate(vm_object_t object)
959 VM_OBJECT_ASSERT_WLOCKED(object);
960 KASSERT((object->flags & OBJ_DEAD) != 0,
961 ("terminating non-dead obj %p", object));
962 KASSERT((object->flags & OBJ_COLLAPSING) == 0,
963 ("terminating collapsing obj %p", object));
964 KASSERT(object->backing_object == NULL,
965 ("terminating shadow obj %p", object));
968 * Wait for the pageout daemon and other current users to be
969 * done with the object. Note that new paging_in_progress
970 * users can come after this wait, but they must check
971 * OBJ_DEAD flag set (without unlocking the object), and avoid
972 * the object being terminated.
974 vm_object_pip_wait(object, "objtrm");
976 KASSERT(object->ref_count == 0,
977 ("vm_object_terminate: object with references, ref_count=%d",
980 if ((object->flags & OBJ_PG_DTOR) == 0)
981 vm_object_terminate_pages(object);
983 #if VM_NRESERVLEVEL > 0
984 if (__predict_false(!LIST_EMPTY(&object->rvq)))
985 vm_reserv_break_all(object);
988 KASSERT(object->cred == NULL || object->type == OBJT_DEFAULT ||
989 (object->flags & OBJ_SWAP) != 0,
990 ("%s: non-swap obj %p has cred", __func__, object));
993 * Let the pager know object is dead.
995 vm_pager_deallocate(object);
996 VM_OBJECT_WUNLOCK(object);
998 vm_object_destroy(object);
1002 * Make the page read-only so that we can clear the object flags. However, if
1003 * this is a nosync mmap then the object is likely to stay dirty so do not
1004 * mess with the page and do not clear the object flags. Returns TRUE if the
1005 * page should be flushed, and FALSE otherwise.
1008 vm_object_page_remove_write(vm_page_t p, int flags, boolean_t *allclean)
1011 vm_page_assert_busied(p);
1014 * If we have been asked to skip nosync pages and this is a
1015 * nosync page, skip it. Note that the object flags were not
1016 * cleared in this case so we do not have to set them.
1018 if ((flags & OBJPC_NOSYNC) != 0 && (p->a.flags & PGA_NOSYNC) != 0) {
1022 pmap_remove_write(p);
1023 return (p->dirty != 0);
1028 * vm_object_page_clean
1030 * Clean all dirty pages in the specified range of object. Leaves page
1031 * on whatever queue it is currently on. If NOSYNC is set then do not
1032 * write out pages with PGA_NOSYNC set (originally comes from MAP_NOSYNC),
1033 * leaving the object dirty.
1035 * For swap objects backing tmpfs regular files, do not flush anything,
1036 * but remove write protection on the mapped pages to update mtime through
1039 * When stuffing pages asynchronously, allow clustering. XXX we need a
1040 * synchronous clustering mode implementation.
1042 * Odd semantics: if start == end, we clean everything.
1044 * The object must be locked.
1046 * Returns FALSE if some page from the range was not written, as
1047 * reported by the pager, and TRUE otherwise.
1050 vm_object_page_clean(vm_object_t object, vm_ooffset_t start, vm_ooffset_t end,
1054 vm_pindex_t pi, tend, tstart;
1055 int curgeneration, n, pagerflags;
1056 boolean_t eio, res, allclean;
1058 VM_OBJECT_ASSERT_WLOCKED(object);
1060 if (!vm_object_mightbedirty(object) || object->resident_page_count == 0)
1063 pagerflags = (flags & (OBJPC_SYNC | OBJPC_INVAL)) != 0 ?
1064 VM_PAGER_PUT_SYNC : VM_PAGER_CLUSTER_OK;
1065 pagerflags |= (flags & OBJPC_INVAL) != 0 ? VM_PAGER_PUT_INVAL : 0;
1067 tstart = OFF_TO_IDX(start);
1068 tend = (end == 0) ? object->size : OFF_TO_IDX(end + PAGE_MASK);
1069 allclean = tstart == 0 && tend >= object->size;
1073 curgeneration = object->generation;
1075 for (p = vm_page_find_least(object, tstart); p != NULL; p = np) {
1079 np = TAILQ_NEXT(p, listq);
1080 if (vm_page_none_valid(p))
1082 if (vm_page_busy_acquire(p, VM_ALLOC_WAITFAIL) == 0) {
1083 if (object->generation != curgeneration &&
1084 (flags & OBJPC_SYNC) != 0)
1086 np = vm_page_find_least(object, pi);
1089 if (!vm_object_page_remove_write(p, flags, &allclean)) {
1093 if (object->type == OBJT_VNODE) {
1094 n = vm_object_page_collect_flush(object, p, pagerflags,
1095 flags, &allclean, &eio);
1100 if (object->generation != curgeneration &&
1101 (flags & OBJPC_SYNC) != 0)
1105 * If the VOP_PUTPAGES() did a truncated write, so
1106 * that even the first page of the run is not fully
1107 * written, vm_pageout_flush() returns 0 as the run
1108 * length. Since the condition that caused truncated
1109 * write may be permanent, e.g. exhausted free space,
1110 * accepting n == 0 would cause an infinite loop.
1112 * Forwarding the iterator leaves the unwritten page
1113 * behind, but there is not much we can do there if
1114 * filesystem refuses to write it.
1124 np = vm_page_find_least(object, pi + n);
1127 VOP_FSYNC(vp, (pagerflags & VM_PAGER_PUT_SYNC) ? MNT_WAIT : 0);
1131 * Leave updating cleangeneration for tmpfs objects to tmpfs
1132 * scan. It needs to update mtime, which happens for other
1133 * filesystems during page writeouts.
1135 if (allclean && object->type == OBJT_VNODE)
1136 object->cleangeneration = curgeneration;
1141 vm_object_page_collect_flush(vm_object_t object, vm_page_t p, int pagerflags,
1142 int flags, boolean_t *allclean, boolean_t *eio)
1144 vm_page_t ma[vm_pageout_page_count], p_first, tp;
1145 int count, i, mreq, runlen;
1147 vm_page_lock_assert(p, MA_NOTOWNED);
1148 vm_page_assert_xbusied(p);
1149 VM_OBJECT_ASSERT_WLOCKED(object);
1154 for (tp = p; count < vm_pageout_page_count; count++) {
1155 tp = vm_page_next(tp);
1156 if (tp == NULL || vm_page_tryxbusy(tp) == 0)
1158 if (!vm_object_page_remove_write(tp, flags, allclean)) {
1159 vm_page_xunbusy(tp);
1164 for (p_first = p; count < vm_pageout_page_count; count++) {
1165 tp = vm_page_prev(p_first);
1166 if (tp == NULL || vm_page_tryxbusy(tp) == 0)
1168 if (!vm_object_page_remove_write(tp, flags, allclean)) {
1169 vm_page_xunbusy(tp);
1176 for (tp = p_first, i = 0; i < count; tp = TAILQ_NEXT(tp, listq), i++)
1179 vm_pageout_flush(ma, count, pagerflags, mreq, &runlen, eio);
1184 * Note that there is absolutely no sense in writing out
1185 * anonymous objects, so we track down the vnode object
1187 * We invalidate (remove) all pages from the address space
1188 * for semantic correctness.
1190 * If the backing object is a device object with unmanaged pages, then any
1191 * mappings to the specified range of pages must be removed before this
1192 * function is called.
1194 * Note: certain anonymous maps, such as MAP_NOSYNC maps,
1195 * may start out with a NULL object.
1198 vm_object_sync(vm_object_t object, vm_ooffset_t offset, vm_size_t size,
1199 boolean_t syncio, boolean_t invalidate)
1201 vm_object_t backing_object;
1204 int error, flags, fsync_after;
1211 VM_OBJECT_WLOCK(object);
1212 while ((backing_object = object->backing_object) != NULL) {
1213 VM_OBJECT_WLOCK(backing_object);
1214 offset += object->backing_object_offset;
1215 VM_OBJECT_WUNLOCK(object);
1216 object = backing_object;
1217 if (object->size < OFF_TO_IDX(offset + size))
1218 size = IDX_TO_OFF(object->size) - offset;
1221 * Flush pages if writing is allowed, invalidate them
1222 * if invalidation requested. Pages undergoing I/O
1223 * will be ignored by vm_object_page_remove().
1225 * We cannot lock the vnode and then wait for paging
1226 * to complete without deadlocking against vm_fault.
1227 * Instead we simply call vm_object_page_remove() and
1228 * allow it to block internally on a page-by-page
1229 * basis when it encounters pages undergoing async
1232 if (object->type == OBJT_VNODE &&
1233 vm_object_mightbedirty(object) != 0 &&
1234 ((vp = object->handle)->v_vflag & VV_NOSYNC) == 0) {
1235 VM_OBJECT_WUNLOCK(object);
1236 (void) vn_start_write(vp, &mp, V_WAIT);
1237 vn_lock(vp, LK_EXCLUSIVE | LK_RETRY);
1238 if (syncio && !invalidate && offset == 0 &&
1239 atop(size) == object->size) {
1241 * If syncing the whole mapping of the file,
1242 * it is faster to schedule all the writes in
1243 * async mode, also allowing the clustering,
1244 * and then wait for i/o to complete.
1249 flags = (syncio || invalidate) ? OBJPC_SYNC : 0;
1250 flags |= invalidate ? (OBJPC_SYNC | OBJPC_INVAL) : 0;
1251 fsync_after = FALSE;
1253 VM_OBJECT_WLOCK(object);
1254 res = vm_object_page_clean(object, offset, offset + size,
1256 VM_OBJECT_WUNLOCK(object);
1258 error = VOP_FSYNC(vp, MNT_WAIT, curthread);
1260 vn_finished_write(mp);
1263 VM_OBJECT_WLOCK(object);
1265 if ((object->type == OBJT_VNODE ||
1266 object->type == OBJT_DEVICE) && invalidate) {
1267 if (object->type == OBJT_DEVICE)
1269 * The option OBJPR_NOTMAPPED must be passed here
1270 * because vm_object_page_remove() cannot remove
1271 * unmanaged mappings.
1273 flags = OBJPR_NOTMAPPED;
1277 flags = OBJPR_CLEANONLY;
1278 vm_object_page_remove(object, OFF_TO_IDX(offset),
1279 OFF_TO_IDX(offset + size + PAGE_MASK), flags);
1281 VM_OBJECT_WUNLOCK(object);
1286 * Determine whether the given advice can be applied to the object. Advice is
1287 * not applied to unmanaged pages since they never belong to page queues, and
1288 * since MADV_FREE is destructive, it can apply only to anonymous pages that
1289 * have been mapped at most once.
1292 vm_object_advice_applies(vm_object_t object, int advice)
1295 if ((object->flags & OBJ_UNMANAGED) != 0)
1297 if (advice != MADV_FREE)
1299 return ((object->flags & (OBJ_ONEMAPPING | OBJ_ANON)) ==
1300 (OBJ_ONEMAPPING | OBJ_ANON));
1304 vm_object_madvise_freespace(vm_object_t object, int advice, vm_pindex_t pindex,
1308 if (advice == MADV_FREE)
1309 vm_pager_freespace(object, pindex, size);
1313 * vm_object_madvise:
1315 * Implements the madvise function at the object/page level.
1317 * MADV_WILLNEED (any object)
1319 * Activate the specified pages if they are resident.
1321 * MADV_DONTNEED (any object)
1323 * Deactivate the specified pages if they are resident.
1325 * MADV_FREE (OBJT_DEFAULT/OBJT_SWAP objects,
1326 * OBJ_ONEMAPPING only)
1328 * Deactivate and clean the specified pages if they are
1329 * resident. This permits the process to reuse the pages
1330 * without faulting or the kernel to reclaim the pages
1334 vm_object_madvise(vm_object_t object, vm_pindex_t pindex, vm_pindex_t end,
1337 vm_pindex_t tpindex;
1338 vm_object_t backing_object, tobject;
1345 VM_OBJECT_WLOCK(object);
1346 if (!vm_object_advice_applies(object, advice)) {
1347 VM_OBJECT_WUNLOCK(object);
1350 for (m = vm_page_find_least(object, pindex); pindex < end; pindex++) {
1354 * If the next page isn't resident in the top-level object, we
1355 * need to search the shadow chain. When applying MADV_FREE, we
1356 * take care to release any swap space used to store
1357 * non-resident pages.
1359 if (m == NULL || pindex < m->pindex) {
1361 * Optimize a common case: if the top-level object has
1362 * no backing object, we can skip over the non-resident
1363 * range in constant time.
1365 if (object->backing_object == NULL) {
1366 tpindex = (m != NULL && m->pindex < end) ?
1368 vm_object_madvise_freespace(object, advice,
1369 pindex, tpindex - pindex);
1370 if ((pindex = tpindex) == end)
1377 vm_object_madvise_freespace(tobject, advice,
1380 * Prepare to search the next object in the
1383 backing_object = tobject->backing_object;
1384 if (backing_object == NULL)
1386 VM_OBJECT_WLOCK(backing_object);
1388 OFF_TO_IDX(tobject->backing_object_offset);
1389 if (tobject != object)
1390 VM_OBJECT_WUNLOCK(tobject);
1391 tobject = backing_object;
1392 if (!vm_object_advice_applies(tobject, advice))
1394 } while ((tm = vm_page_lookup(tobject, tpindex)) ==
1399 m = TAILQ_NEXT(m, listq);
1403 * If the page is not in a normal state, skip it. The page
1404 * can not be invalidated while the object lock is held.
1406 if (!vm_page_all_valid(tm) || vm_page_wired(tm))
1408 KASSERT((tm->flags & PG_FICTITIOUS) == 0,
1409 ("vm_object_madvise: page %p is fictitious", tm));
1410 KASSERT((tm->oflags & VPO_UNMANAGED) == 0,
1411 ("vm_object_madvise: page %p is not managed", tm));
1412 if (vm_page_tryxbusy(tm) == 0) {
1413 if (object != tobject)
1414 VM_OBJECT_WUNLOCK(object);
1415 if (advice == MADV_WILLNEED) {
1417 * Reference the page before unlocking and
1418 * sleeping so that the page daemon is less
1419 * likely to reclaim it.
1421 vm_page_aflag_set(tm, PGA_REFERENCED);
1423 if (!vm_page_busy_sleep(tm, "madvpo", 0))
1424 VM_OBJECT_WUNLOCK(tobject);
1427 vm_page_advise(tm, advice);
1428 vm_page_xunbusy(tm);
1429 vm_object_madvise_freespace(tobject, advice, tm->pindex, 1);
1431 if (tobject != object)
1432 VM_OBJECT_WUNLOCK(tobject);
1434 VM_OBJECT_WUNLOCK(object);
1440 * Create a new object which is backed by the
1441 * specified existing object range. The source
1442 * object reference is deallocated.
1444 * The new object and offset into that object
1445 * are returned in the source parameters.
1448 vm_object_shadow(vm_object_t *object, vm_ooffset_t *offset, vm_size_t length,
1449 struct ucred *cred, bool shared)
1457 * Don't create the new object if the old object isn't shared.
1459 * If we hold the only reference we can guarantee that it won't
1460 * increase while we have the map locked. Otherwise the race is
1461 * harmless and we will end up with an extra shadow object that
1462 * will be collapsed later.
1464 if (source != NULL && source->ref_count == 1 &&
1465 (source->flags & OBJ_ANON) != 0)
1469 * Allocate a new object with the given length.
1471 result = vm_object_allocate_anon(atop(length), source, cred, length);
1474 * Store the offset into the source object, and fix up the offset into
1477 result->backing_object_offset = *offset;
1479 if (shared || source != NULL) {
1480 VM_OBJECT_WLOCK(result);
1483 * The new object shadows the source object, adding a
1484 * reference to it. Our caller changes his reference
1485 * to point to the new object, removing a reference to
1486 * the source object. Net result: no change of
1487 * reference count, unless the caller needs to add one
1488 * more reference due to forking a shared map entry.
1491 vm_object_reference_locked(result);
1492 vm_object_clear_flag(result, OBJ_ONEMAPPING);
1496 * Try to optimize the result object's page color when
1497 * shadowing in order to maintain page coloring
1498 * consistency in the combined shadowed object.
1500 if (source != NULL) {
1501 vm_object_backing_insert(result, source);
1502 result->domain = source->domain;
1503 #if VM_NRESERVLEVEL > 0
1504 vm_object_set_flag(result,
1505 (source->flags & OBJ_COLORED));
1506 result->pg_color = (source->pg_color +
1507 OFF_TO_IDX(*offset)) & ((1 << (VM_NFREEORDER -
1511 VM_OBJECT_WUNLOCK(result);
1515 * Return the new things
1524 * Split the pages in a map entry into a new object. This affords
1525 * easier removal of unused pages, and keeps object inheritance from
1526 * being a negative impact on memory usage.
1529 vm_object_split(vm_map_entry_t entry)
1531 vm_page_t m, m_busy, m_next;
1532 vm_object_t orig_object, new_object, backing_object;
1533 vm_pindex_t idx, offidxstart;
1536 orig_object = entry->object.vm_object;
1537 KASSERT((orig_object->flags & OBJ_ONEMAPPING) != 0,
1538 ("vm_object_split: Splitting object with multiple mappings."));
1539 if ((orig_object->flags & OBJ_ANON) == 0)
1541 if (orig_object->ref_count <= 1)
1543 VM_OBJECT_WUNLOCK(orig_object);
1545 offidxstart = OFF_TO_IDX(entry->offset);
1546 size = atop(entry->end - entry->start);
1549 * If swap_pager_copy() is later called, it will convert new_object
1550 * into a swap object.
1552 new_object = vm_object_allocate_anon(size, orig_object,
1553 orig_object->cred, ptoa(size));
1556 * We must wait for the orig_object to complete any in-progress
1557 * collapse so that the swap blocks are stable below. The
1558 * additional reference on backing_object by new object will
1559 * prevent further collapse operations until split completes.
1561 VM_OBJECT_WLOCK(orig_object);
1562 vm_object_collapse_wait(orig_object);
1565 * At this point, the new object is still private, so the order in
1566 * which the original and new objects are locked does not matter.
1568 VM_OBJECT_WLOCK(new_object);
1569 new_object->domain = orig_object->domain;
1570 backing_object = orig_object->backing_object;
1571 if (backing_object != NULL) {
1572 vm_object_backing_insert_ref(new_object, backing_object);
1573 new_object->backing_object_offset =
1574 orig_object->backing_object_offset + entry->offset;
1576 if (orig_object->cred != NULL) {
1577 crhold(orig_object->cred);
1578 KASSERT(orig_object->charge >= ptoa(size),
1579 ("orig_object->charge < 0"));
1580 orig_object->charge -= ptoa(size);
1584 * Mark the split operation so that swap_pager_getpages() knows
1585 * that the object is in transition.
1587 vm_object_set_flag(orig_object, OBJ_SPLIT);
1593 m = vm_page_find_least(orig_object, offidxstart);
1594 KASSERT(m == NULL || idx <= m->pindex - offidxstart,
1595 ("%s: object %p was repopulated", __func__, orig_object));
1596 for (; m != NULL && (idx = m->pindex - offidxstart) < size;
1598 m_next = TAILQ_NEXT(m, listq);
1601 * We must wait for pending I/O to complete before we can
1604 * We do not have to VM_PROT_NONE the page as mappings should
1605 * not be changed by this operation.
1607 if (vm_page_tryxbusy(m) == 0) {
1608 VM_OBJECT_WUNLOCK(new_object);
1609 if (vm_page_busy_sleep(m, "spltwt", 0))
1610 VM_OBJECT_WLOCK(orig_object);
1611 VM_OBJECT_WLOCK(new_object);
1616 * The page was left invalid. Likely placed there by
1617 * an incomplete fault. Just remove and ignore.
1619 if (vm_page_none_valid(m)) {
1620 if (vm_page_remove(m))
1625 /* vm_page_rename() will dirty the page. */
1626 if (vm_page_rename(m, new_object, idx)) {
1628 VM_OBJECT_WUNLOCK(new_object);
1629 VM_OBJECT_WUNLOCK(orig_object);
1631 VM_OBJECT_WLOCK(orig_object);
1632 VM_OBJECT_WLOCK(new_object);
1636 #if VM_NRESERVLEVEL > 0
1638 * If some of the reservation's allocated pages remain with
1639 * the original object, then transferring the reservation to
1640 * the new object is neither particularly beneficial nor
1641 * particularly harmful as compared to leaving the reservation
1642 * with the original object. If, however, all of the
1643 * reservation's allocated pages are transferred to the new
1644 * object, then transferring the reservation is typically
1645 * beneficial. Determining which of these two cases applies
1646 * would be more costly than unconditionally renaming the
1649 vm_reserv_rename(m, new_object, orig_object, offidxstart);
1653 * orig_object's type may change while sleeping, so keep track
1654 * of the beginning of the busied range.
1656 if (orig_object->type != OBJT_SWAP)
1658 else if (m_busy == NULL)
1661 if ((orig_object->flags & OBJ_SWAP) != 0) {
1663 * swap_pager_copy() can sleep, in which case the orig_object's
1664 * and new_object's locks are released and reacquired.
1666 swap_pager_copy(orig_object, new_object, offidxstart, 0);
1668 TAILQ_FOREACH_FROM(m_busy, &new_object->memq, listq)
1669 vm_page_xunbusy(m_busy);
1671 vm_object_clear_flag(orig_object, OBJ_SPLIT);
1672 VM_OBJECT_WUNLOCK(orig_object);
1673 VM_OBJECT_WUNLOCK(new_object);
1674 entry->object.vm_object = new_object;
1675 entry->offset = 0LL;
1676 vm_object_deallocate(orig_object);
1677 VM_OBJECT_WLOCK(new_object);
1681 vm_object_collapse_scan_wait(vm_object_t object, vm_page_t p)
1683 vm_object_t backing_object;
1685 VM_OBJECT_ASSERT_WLOCKED(object);
1686 backing_object = object->backing_object;
1687 VM_OBJECT_ASSERT_WLOCKED(backing_object);
1689 KASSERT(p == NULL || p->object == object || p->object == backing_object,
1690 ("invalid ownership %p %p %p", p, object, backing_object));
1691 /* The page is only NULL when rename fails. */
1693 VM_OBJECT_WUNLOCK(object);
1694 VM_OBJECT_WUNLOCK(backing_object);
1696 VM_OBJECT_WLOCK(object);
1697 } else if (p->object == object) {
1698 VM_OBJECT_WUNLOCK(backing_object);
1699 if (vm_page_busy_sleep(p, "vmocol", 0))
1700 VM_OBJECT_WLOCK(object);
1702 VM_OBJECT_WUNLOCK(object);
1703 if (!vm_page_busy_sleep(p, "vmocol", 0))
1704 VM_OBJECT_WUNLOCK(backing_object);
1705 VM_OBJECT_WLOCK(object);
1707 VM_OBJECT_WLOCK(backing_object);
1708 return (TAILQ_FIRST(&backing_object->memq));
1712 vm_object_scan_all_shadowed(vm_object_t object)
1714 vm_object_t backing_object;
1716 vm_pindex_t backing_offset_index, new_pindex, pi, ps;
1718 VM_OBJECT_ASSERT_WLOCKED(object);
1719 VM_OBJECT_ASSERT_WLOCKED(object->backing_object);
1721 backing_object = object->backing_object;
1723 if ((backing_object->flags & OBJ_ANON) == 0)
1726 pi = backing_offset_index = OFF_TO_IDX(object->backing_object_offset);
1727 p = vm_page_find_least(backing_object, pi);
1728 ps = swap_pager_find_least(backing_object, pi);
1731 * Only check pages inside the parent object's range and
1732 * inside the parent object's mapping of the backing object.
1735 if (p != NULL && p->pindex < pi)
1736 p = TAILQ_NEXT(p, listq);
1738 ps = swap_pager_find_least(backing_object, pi);
1739 if (p == NULL && ps >= backing_object->size)
1744 pi = MIN(p->pindex, ps);
1746 new_pindex = pi - backing_offset_index;
1747 if (new_pindex >= object->size)
1752 * If the backing object page is busy a
1753 * grandparent or older page may still be
1754 * undergoing CoW. It is not safe to collapse
1755 * the backing object until it is quiesced.
1757 if (vm_page_tryxbusy(p) == 0)
1761 * We raced with the fault handler that left
1762 * newly allocated invalid page on the object
1763 * queue and retried.
1765 if (!vm_page_all_valid(p))
1770 * See if the parent has the page or if the parent's object
1771 * pager has the page. If the parent has the page but the page
1772 * is not valid, the parent's object pager must have the page.
1774 * If this fails, the parent does not completely shadow the
1775 * object and we might as well give up now.
1777 pp = vm_page_lookup(object, new_pindex);
1780 * The valid check here is stable due to object lock
1781 * being required to clear valid and initiate paging.
1782 * Busy of p disallows fault handler to validate pp.
1784 if ((pp == NULL || vm_page_none_valid(pp)) &&
1785 !vm_pager_has_page(object, new_pindex, NULL, NULL))
1799 vm_object_collapse_scan(vm_object_t object)
1801 vm_object_t backing_object;
1802 vm_page_t next, p, pp;
1803 vm_pindex_t backing_offset_index, new_pindex;
1805 VM_OBJECT_ASSERT_WLOCKED(object);
1806 VM_OBJECT_ASSERT_WLOCKED(object->backing_object);
1808 backing_object = object->backing_object;
1809 backing_offset_index = OFF_TO_IDX(object->backing_object_offset);
1814 for (p = TAILQ_FIRST(&backing_object->memq); p != NULL; p = next) {
1815 next = TAILQ_NEXT(p, listq);
1816 new_pindex = p->pindex - backing_offset_index;
1819 * Check for busy page
1821 if (vm_page_tryxbusy(p) == 0) {
1822 next = vm_object_collapse_scan_wait(object, p);
1826 KASSERT(object->backing_object == backing_object,
1827 ("vm_object_collapse_scan: backing object mismatch %p != %p",
1828 object->backing_object, backing_object));
1829 KASSERT(p->object == backing_object,
1830 ("vm_object_collapse_scan: object mismatch %p != %p",
1831 p->object, backing_object));
1833 if (p->pindex < backing_offset_index ||
1834 new_pindex >= object->size) {
1835 vm_pager_freespace(backing_object, p->pindex, 1);
1837 KASSERT(!pmap_page_is_mapped(p),
1838 ("freeing mapped page %p", p));
1839 if (vm_page_remove(p))
1844 if (!vm_page_all_valid(p)) {
1845 KASSERT(!pmap_page_is_mapped(p),
1846 ("freeing mapped page %p", p));
1847 if (vm_page_remove(p))
1852 pp = vm_page_lookup(object, new_pindex);
1853 if (pp != NULL && vm_page_tryxbusy(pp) == 0) {
1856 * The page in the parent is busy and possibly not
1857 * (yet) valid. Until its state is finalized by the
1858 * busy bit owner, we can't tell whether it shadows the
1861 next = vm_object_collapse_scan_wait(object, pp);
1865 if (pp != NULL && vm_page_none_valid(pp)) {
1867 * The page was invalid in the parent. Likely placed
1868 * there by an incomplete fault. Just remove and
1869 * ignore. p can replace it.
1871 if (vm_page_remove(pp))
1876 if (pp != NULL || vm_pager_has_page(object, new_pindex, NULL,
1879 * The page already exists in the parent OR swap exists
1880 * for this location in the parent. Leave the parent's
1881 * page alone. Destroy the original page from the
1884 vm_pager_freespace(backing_object, p->pindex, 1);
1885 KASSERT(!pmap_page_is_mapped(p),
1886 ("freeing mapped page %p", p));
1887 if (vm_page_remove(p))
1890 vm_page_xunbusy(pp);
1895 * Page does not exist in parent, rename the page from the
1896 * backing object to the main object.
1898 * If the page was mapped to a process, it can remain mapped
1899 * through the rename. vm_page_rename() will dirty the page.
1901 if (vm_page_rename(p, object, new_pindex)) {
1903 next = vm_object_collapse_scan_wait(object, NULL);
1907 /* Use the old pindex to free the right page. */
1908 vm_pager_freespace(backing_object, new_pindex +
1909 backing_offset_index, 1);
1911 #if VM_NRESERVLEVEL > 0
1913 * Rename the reservation.
1915 vm_reserv_rename(p, object, backing_object,
1916 backing_offset_index);
1924 * vm_object_collapse:
1926 * Collapse an object with the object backing it.
1927 * Pages in the backing object are moved into the
1928 * parent, and the backing object is deallocated.
1931 vm_object_collapse(vm_object_t object)
1933 vm_object_t backing_object, new_backing_object;
1935 VM_OBJECT_ASSERT_WLOCKED(object);
1938 KASSERT((object->flags & (OBJ_DEAD | OBJ_ANON)) == OBJ_ANON,
1939 ("collapsing invalid object"));
1942 * Wait for the backing_object to finish any pending
1943 * collapse so that the caller sees the shortest possible
1946 backing_object = vm_object_backing_collapse_wait(object);
1947 if (backing_object == NULL)
1950 KASSERT(object->ref_count > 0 &&
1951 object->ref_count > atomic_load_int(&object->shadow_count),
1952 ("collapse with invalid ref %d or shadow %d count.",
1953 object->ref_count, atomic_load_int(&object->shadow_count)));
1954 KASSERT((backing_object->flags &
1955 (OBJ_COLLAPSING | OBJ_DEAD)) == 0,
1956 ("vm_object_collapse: Backing object already collapsing."));
1957 KASSERT((object->flags & (OBJ_COLLAPSING | OBJ_DEAD)) == 0,
1958 ("vm_object_collapse: object is already collapsing."));
1961 * We know that we can either collapse the backing object if
1962 * the parent is the only reference to it, or (perhaps) have
1963 * the parent bypass the object if the parent happens to shadow
1964 * all the resident pages in the entire backing object.
1966 if (backing_object->ref_count == 1) {
1967 KASSERT(atomic_load_int(&backing_object->shadow_count)
1969 ("vm_object_collapse: shadow_count: %d",
1970 atomic_load_int(&backing_object->shadow_count)));
1971 vm_object_pip_add(object, 1);
1972 vm_object_set_flag(object, OBJ_COLLAPSING);
1973 vm_object_pip_add(backing_object, 1);
1974 vm_object_set_flag(backing_object, OBJ_DEAD);
1977 * If there is exactly one reference to the backing
1978 * object, we can collapse it into the parent.
1980 vm_object_collapse_scan(object);
1982 #if VM_NRESERVLEVEL > 0
1984 * Break any reservations from backing_object.
1986 if (__predict_false(!LIST_EMPTY(&backing_object->rvq)))
1987 vm_reserv_break_all(backing_object);
1991 * Move the pager from backing_object to object.
1993 if ((backing_object->flags & OBJ_SWAP) != 0) {
1995 * swap_pager_copy() can sleep, in which case
1996 * the backing_object's and object's locks are
1997 * released and reacquired.
1998 * Since swap_pager_copy() is being asked to
1999 * destroy backing_object, it will change the
2000 * type to OBJT_DEFAULT.
2005 OFF_TO_IDX(object->backing_object_offset), TRUE);
2009 * Object now shadows whatever backing_object did.
2011 vm_object_clear_flag(object, OBJ_COLLAPSING);
2012 vm_object_backing_transfer(object, backing_object);
2013 object->backing_object_offset +=
2014 backing_object->backing_object_offset;
2015 VM_OBJECT_WUNLOCK(object);
2016 vm_object_pip_wakeup(object);
2019 * Discard backing_object.
2021 * Since the backing object has no pages, no pager left,
2022 * and no object references within it, all that is
2023 * necessary is to dispose of it.
2025 KASSERT(backing_object->ref_count == 1, (
2026 "backing_object %p was somehow re-referenced during collapse!",
2028 vm_object_pip_wakeup(backing_object);
2029 (void)refcount_release(&backing_object->ref_count);
2030 vm_object_terminate(backing_object);
2031 counter_u64_add(object_collapses, 1);
2032 VM_OBJECT_WLOCK(object);
2035 * If we do not entirely shadow the backing object,
2036 * there is nothing we can do so we give up.
2038 * The object lock and backing_object lock must not
2039 * be dropped during this sequence.
2041 if (!vm_object_scan_all_shadowed(object)) {
2042 VM_OBJECT_WUNLOCK(backing_object);
2047 * Make the parent shadow the next object in the
2048 * chain. Deallocating backing_object will not remove
2049 * it, since its reference count is at least 2.
2051 vm_object_backing_remove_locked(object);
2052 new_backing_object = backing_object->backing_object;
2053 if (new_backing_object != NULL) {
2054 vm_object_backing_insert_ref(object,
2055 new_backing_object);
2056 object->backing_object_offset +=
2057 backing_object->backing_object_offset;
2061 * Drop the reference count on backing_object. Since
2062 * its ref_count was at least 2, it will not vanish.
2064 (void)refcount_release(&backing_object->ref_count);
2065 KASSERT(backing_object->ref_count >= 1, (
2066 "backing_object %p was somehow dereferenced during collapse!",
2068 VM_OBJECT_WUNLOCK(backing_object);
2069 counter_u64_add(object_bypasses, 1);
2073 * Try again with this object's new backing object.
2079 * vm_object_page_remove:
2081 * For the given object, either frees or invalidates each of the
2082 * specified pages. In general, a page is freed. However, if a page is
2083 * wired for any reason other than the existence of a managed, wired
2084 * mapping, then it may be invalidated but not removed from the object.
2085 * Pages are specified by the given range ["start", "end") and the option
2086 * OBJPR_CLEANONLY. As a special case, if "end" is zero, then the range
2087 * extends from "start" to the end of the object. If the option
2088 * OBJPR_CLEANONLY is specified, then only the non-dirty pages within the
2089 * specified range are affected. If the option OBJPR_NOTMAPPED is
2090 * specified, then the pages within the specified range must have no
2091 * mappings. Otherwise, if this option is not specified, any mappings to
2092 * the specified pages are removed before the pages are freed or
2095 * In general, this operation should only be performed on objects that
2096 * contain managed pages. There are, however, two exceptions. First, it
2097 * is performed on the kernel and kmem objects by vm_map_entry_delete().
2098 * Second, it is used by msync(..., MS_INVALIDATE) to invalidate device-
2099 * backed pages. In both of these cases, the option OBJPR_CLEANONLY must
2100 * not be specified and the option OBJPR_NOTMAPPED must be specified.
2102 * The object must be locked.
2105 vm_object_page_remove(vm_object_t object, vm_pindex_t start, vm_pindex_t end,
2110 VM_OBJECT_ASSERT_WLOCKED(object);
2111 KASSERT((object->flags & OBJ_UNMANAGED) == 0 ||
2112 (options & (OBJPR_CLEANONLY | OBJPR_NOTMAPPED)) == OBJPR_NOTMAPPED,
2113 ("vm_object_page_remove: illegal options for object %p", object));
2114 if (object->resident_page_count == 0)
2116 vm_object_pip_add(object, 1);
2118 p = vm_page_find_least(object, start);
2121 * Here, the variable "p" is either (1) the page with the least pindex
2122 * greater than or equal to the parameter "start" or (2) NULL.
2124 for (; p != NULL && (p->pindex < end || end == 0); p = next) {
2125 next = TAILQ_NEXT(p, listq);
2128 * Skip invalid pages if asked to do so. Try to avoid acquiring
2129 * the busy lock, as some consumers rely on this to avoid
2132 * A thread may concurrently transition the page from invalid to
2133 * valid using only the busy lock, so the result of this check
2134 * is immediately stale. It is up to consumers to handle this,
2135 * for instance by ensuring that all invalid->valid transitions
2136 * happen with a mutex held, as may be possible for a
2139 if ((options & OBJPR_VALIDONLY) != 0 && vm_page_none_valid(p))
2143 * If the page is wired for any reason besides the existence
2144 * of managed, wired mappings, then it cannot be freed. For
2145 * example, fictitious pages, which represent device memory,
2146 * are inherently wired and cannot be freed. They can,
2147 * however, be invalidated if the option OBJPR_CLEANONLY is
2150 if (vm_page_tryxbusy(p) == 0) {
2151 if (vm_page_busy_sleep(p, "vmopar", 0))
2152 VM_OBJECT_WLOCK(object);
2155 if ((options & OBJPR_VALIDONLY) != 0 && vm_page_none_valid(p)) {
2159 if (vm_page_wired(p)) {
2161 if ((options & OBJPR_NOTMAPPED) == 0 &&
2162 object->ref_count != 0)
2164 if ((options & OBJPR_CLEANONLY) == 0) {
2171 KASSERT((p->flags & PG_FICTITIOUS) == 0,
2172 ("vm_object_page_remove: page %p is fictitious", p));
2173 if ((options & OBJPR_CLEANONLY) != 0 &&
2174 !vm_page_none_valid(p)) {
2175 if ((options & OBJPR_NOTMAPPED) == 0 &&
2176 object->ref_count != 0 &&
2177 !vm_page_try_remove_write(p))
2179 if (p->dirty != 0) {
2184 if ((options & OBJPR_NOTMAPPED) == 0 &&
2185 object->ref_count != 0 && !vm_page_try_remove_all(p))
2189 vm_object_pip_wakeup(object);
2191 vm_pager_freespace(object, start, (end == 0 ? object->size : end) -
2196 * vm_object_page_noreuse:
2198 * For the given object, attempt to move the specified pages to
2199 * the head of the inactive queue. This bypasses regular LRU
2200 * operation and allows the pages to be reused quickly under memory
2201 * pressure. If a page is wired for any reason, then it will not
2202 * be queued. Pages are specified by the range ["start", "end").
2203 * As a special case, if "end" is zero, then the range extends from
2204 * "start" to the end of the object.
2206 * This operation should only be performed on objects that
2207 * contain non-fictitious, managed pages.
2209 * The object must be locked.
2212 vm_object_page_noreuse(vm_object_t object, vm_pindex_t start, vm_pindex_t end)
2216 VM_OBJECT_ASSERT_LOCKED(object);
2217 KASSERT((object->flags & (OBJ_FICTITIOUS | OBJ_UNMANAGED)) == 0,
2218 ("vm_object_page_noreuse: illegal object %p", object));
2219 if (object->resident_page_count == 0)
2221 p = vm_page_find_least(object, start);
2224 * Here, the variable "p" is either (1) the page with the least pindex
2225 * greater than or equal to the parameter "start" or (2) NULL.
2227 for (; p != NULL && (p->pindex < end || end == 0); p = next) {
2228 next = TAILQ_NEXT(p, listq);
2229 vm_page_deactivate_noreuse(p);
2234 * Populate the specified range of the object with valid pages. Returns
2235 * TRUE if the range is successfully populated and FALSE otherwise.
2237 * Note: This function should be optimized to pass a larger array of
2238 * pages to vm_pager_get_pages() before it is applied to a non-
2239 * OBJT_DEVICE object.
2241 * The object must be locked.
2244 vm_object_populate(vm_object_t object, vm_pindex_t start, vm_pindex_t end)
2250 VM_OBJECT_ASSERT_WLOCKED(object);
2251 for (pindex = start; pindex < end; pindex++) {
2252 rv = vm_page_grab_valid(&m, object, pindex, VM_ALLOC_NORMAL);
2253 if (rv != VM_PAGER_OK)
2257 * Keep "m" busy because a subsequent iteration may unlock
2261 if (pindex > start) {
2262 m = vm_page_lookup(object, start);
2263 while (m != NULL && m->pindex < pindex) {
2265 m = TAILQ_NEXT(m, listq);
2268 return (pindex == end);
2272 * Routine: vm_object_coalesce
2273 * Function: Coalesces two objects backing up adjoining
2274 * regions of memory into a single object.
2276 * returns TRUE if objects were combined.
2278 * NOTE: Only works at the moment if the second object is NULL -
2279 * if it's not, which object do we lock first?
2282 * prev_object First object to coalesce
2283 * prev_offset Offset into prev_object
2284 * prev_size Size of reference to prev_object
2285 * next_size Size of reference to the second object
2286 * reserved Indicator that extension region has
2287 * swap accounted for
2290 * The object must *not* be locked.
2293 vm_object_coalesce(vm_object_t prev_object, vm_ooffset_t prev_offset,
2294 vm_size_t prev_size, vm_size_t next_size, boolean_t reserved)
2296 vm_pindex_t next_pindex;
2298 if (prev_object == NULL)
2300 if ((prev_object->flags & OBJ_ANON) == 0)
2303 VM_OBJECT_WLOCK(prev_object);
2305 * Try to collapse the object first.
2307 vm_object_collapse(prev_object);
2310 * Can't coalesce if: . more than one reference . paged out . shadows
2311 * another object . has a copy elsewhere (any of which mean that the
2312 * pages not mapped to prev_entry may be in use anyway)
2314 if (prev_object->backing_object != NULL) {
2315 VM_OBJECT_WUNLOCK(prev_object);
2319 prev_size >>= PAGE_SHIFT;
2320 next_size >>= PAGE_SHIFT;
2321 next_pindex = OFF_TO_IDX(prev_offset) + prev_size;
2323 if (prev_object->ref_count > 1 &&
2324 prev_object->size != next_pindex &&
2325 (prev_object->flags & OBJ_ONEMAPPING) == 0) {
2326 VM_OBJECT_WUNLOCK(prev_object);
2331 * Account for the charge.
2333 if (prev_object->cred != NULL) {
2335 * If prev_object was charged, then this mapping,
2336 * although not charged now, may become writable
2337 * later. Non-NULL cred in the object would prevent
2338 * swap reservation during enabling of the write
2339 * access, so reserve swap now. Failed reservation
2340 * cause allocation of the separate object for the map
2341 * entry, and swap reservation for this entry is
2342 * managed in appropriate time.
2344 if (!reserved && !swap_reserve_by_cred(ptoa(next_size),
2345 prev_object->cred)) {
2346 VM_OBJECT_WUNLOCK(prev_object);
2349 prev_object->charge += ptoa(next_size);
2353 * Remove any pages that may still be in the object from a previous
2356 if (next_pindex < prev_object->size) {
2357 vm_object_page_remove(prev_object, next_pindex, next_pindex +
2360 if (prev_object->cred != NULL) {
2361 KASSERT(prev_object->charge >=
2362 ptoa(prev_object->size - next_pindex),
2363 ("object %p overcharged 1 %jx %jx", prev_object,
2364 (uintmax_t)next_pindex, (uintmax_t)next_size));
2365 prev_object->charge -= ptoa(prev_object->size -
2372 * Extend the object if necessary.
2374 if (next_pindex + next_size > prev_object->size)
2375 prev_object->size = next_pindex + next_size;
2377 VM_OBJECT_WUNLOCK(prev_object);
2382 vm_object_set_writeable_dirty_(vm_object_t object)
2384 atomic_add_int(&object->generation, 1);
2388 vm_object_mightbedirty_(vm_object_t object)
2390 return (object->generation != object->cleangeneration);
2396 * For each page offset within the specified range of the given object,
2397 * find the highest-level page in the shadow chain and unwire it. A page
2398 * must exist at every page offset, and the highest-level page must be
2402 vm_object_unwire(vm_object_t object, vm_ooffset_t offset, vm_size_t length,
2405 vm_object_t tobject, t1object;
2407 vm_pindex_t end_pindex, pindex, tpindex;
2408 int depth, locked_depth;
2410 KASSERT((offset & PAGE_MASK) == 0,
2411 ("vm_object_unwire: offset is not page aligned"));
2412 KASSERT((length & PAGE_MASK) == 0,
2413 ("vm_object_unwire: length is not a multiple of PAGE_SIZE"));
2414 /* The wired count of a fictitious page never changes. */
2415 if ((object->flags & OBJ_FICTITIOUS) != 0)
2417 pindex = OFF_TO_IDX(offset);
2418 end_pindex = pindex + atop(length);
2421 VM_OBJECT_RLOCK(object);
2422 m = vm_page_find_least(object, pindex);
2423 while (pindex < end_pindex) {
2424 if (m == NULL || pindex < m->pindex) {
2426 * The first object in the shadow chain doesn't
2427 * contain a page at the current index. Therefore,
2428 * the page must exist in a backing object.
2435 OFF_TO_IDX(tobject->backing_object_offset);
2436 tobject = tobject->backing_object;
2437 KASSERT(tobject != NULL,
2438 ("vm_object_unwire: missing page"));
2439 if ((tobject->flags & OBJ_FICTITIOUS) != 0)
2442 if (depth == locked_depth) {
2444 VM_OBJECT_RLOCK(tobject);
2446 } while ((tm = vm_page_lookup(tobject, tpindex)) ==
2450 m = TAILQ_NEXT(m, listq);
2452 if (vm_page_trysbusy(tm) == 0) {
2453 for (tobject = object; locked_depth >= 1;
2455 t1object = tobject->backing_object;
2456 if (tm->object != tobject)
2457 VM_OBJECT_RUNLOCK(tobject);
2460 tobject = tm->object;
2461 if (!vm_page_busy_sleep(tm, "unwbo",
2462 VM_ALLOC_IGN_SBUSY))
2463 VM_OBJECT_RUNLOCK(tobject);
2466 vm_page_unwire(tm, queue);
2467 vm_page_sunbusy(tm);
2471 /* Release the accumulated object locks. */
2472 for (tobject = object; locked_depth >= 1; locked_depth--) {
2473 t1object = tobject->backing_object;
2474 VM_OBJECT_RUNLOCK(tobject);
2480 * Return the vnode for the given object, or NULL if none exists.
2481 * For tmpfs objects, the function may return NULL if there is
2482 * no vnode allocated at the time of the call.
2485 vm_object_vnode(vm_object_t object)
2489 VM_OBJECT_ASSERT_LOCKED(object);
2490 vm_pager_getvp(object, &vp, NULL);
2495 * Busy the vm object. This prevents new pages belonging to the object from
2496 * becoming busy. Existing pages persist as busy. Callers are responsible
2497 * for checking page state before proceeding.
2500 vm_object_busy(vm_object_t obj)
2503 VM_OBJECT_ASSERT_LOCKED(obj);
2505 blockcount_acquire(&obj->busy, 1);
2506 /* The fence is required to order loads of page busy. */
2507 atomic_thread_fence_acq_rel();
2511 vm_object_unbusy(vm_object_t obj)
2514 blockcount_release(&obj->busy, 1);
2518 vm_object_busy_wait(vm_object_t obj, const char *wmesg)
2521 VM_OBJECT_ASSERT_UNLOCKED(obj);
2523 (void)blockcount_sleep(&obj->busy, NULL, wmesg, PVM);
2527 * This function aims to determine if the object is mapped,
2528 * specifically, if it is referenced by a vm_map_entry. Because
2529 * objects occasionally acquire transient references that do not
2530 * represent a mapping, the method used here is inexact. However, it
2531 * has very low overhead and is good enough for the advisory
2532 * vm.vmtotal sysctl.
2535 vm_object_is_active(vm_object_t obj)
2538 return (obj->ref_count > atomic_load_int(&obj->shadow_count));
2542 vm_object_list_handler(struct sysctl_req *req, bool swap_only)
2544 struct kinfo_vmobject *kvo;
2545 char *fullpath, *freepath;
2553 if (req->oldptr == NULL) {
2555 * If an old buffer has not been provided, generate an
2556 * estimate of the space needed for a subsequent call.
2558 mtx_lock(&vm_object_list_mtx);
2560 TAILQ_FOREACH(obj, &vm_object_list, object_list) {
2561 if (obj->type == OBJT_DEAD)
2565 mtx_unlock(&vm_object_list_mtx);
2566 return (SYSCTL_OUT(req, NULL, sizeof(struct kinfo_vmobject) *
2570 kvo = malloc(sizeof(*kvo), M_TEMP, M_WAITOK);
2574 * VM objects are type stable and are never removed from the
2575 * list once added. This allows us to safely read obj->object_list
2576 * after reacquiring the VM object lock.
2578 mtx_lock(&vm_object_list_mtx);
2579 TAILQ_FOREACH(obj, &vm_object_list, object_list) {
2580 if (obj->type == OBJT_DEAD ||
2581 (swap_only && (obj->flags & (OBJ_ANON | OBJ_SWAP)) == 0))
2583 VM_OBJECT_RLOCK(obj);
2584 if (obj->type == OBJT_DEAD ||
2585 (swap_only && (obj->flags & (OBJ_ANON | OBJ_SWAP)) == 0)) {
2586 VM_OBJECT_RUNLOCK(obj);
2589 mtx_unlock(&vm_object_list_mtx);
2590 kvo->kvo_size = ptoa(obj->size);
2591 kvo->kvo_resident = obj->resident_page_count;
2592 kvo->kvo_ref_count = obj->ref_count;
2593 kvo->kvo_shadow_count = atomic_load_int(&obj->shadow_count);
2594 kvo->kvo_memattr = obj->memattr;
2595 kvo->kvo_active = 0;
2596 kvo->kvo_inactive = 0;
2598 TAILQ_FOREACH(m, &obj->memq, listq) {
2600 * A page may belong to the object but be
2601 * dequeued and set to PQ_NONE while the
2602 * object lock is not held. This makes the
2603 * reads of m->queue below racy, and we do not
2604 * count pages set to PQ_NONE. However, this
2605 * sysctl is only meant to give an
2606 * approximation of the system anyway.
2608 if (m->a.queue == PQ_ACTIVE)
2610 else if (m->a.queue == PQ_INACTIVE)
2611 kvo->kvo_inactive++;
2615 kvo->kvo_vn_fileid = 0;
2616 kvo->kvo_vn_fsid = 0;
2617 kvo->kvo_vn_fsid_freebsd11 = 0;
2621 kvo->kvo_type = vm_object_kvme_type(obj, swap_only ? NULL : &vp);
2624 } else if ((obj->flags & OBJ_ANON) != 0) {
2625 MPASS(kvo->kvo_type == KVME_TYPE_DEFAULT ||
2626 kvo->kvo_type == KVME_TYPE_SWAP);
2627 kvo->kvo_me = (uintptr_t)obj;
2628 /* tmpfs objs are reported as vnodes */
2629 kvo->kvo_backing_obj = (uintptr_t)obj->backing_object;
2630 sp = swap_pager_swapped_pages(obj);
2631 kvo->kvo_swapped = sp > UINT32_MAX ? UINT32_MAX : sp;
2633 VM_OBJECT_RUNLOCK(obj);
2635 vn_fullpath(vp, &fullpath, &freepath);
2636 vn_lock(vp, LK_SHARED | LK_RETRY);
2637 if (VOP_GETATTR(vp, &va, curthread->td_ucred) == 0) {
2638 kvo->kvo_vn_fileid = va.va_fileid;
2639 kvo->kvo_vn_fsid = va.va_fsid;
2640 kvo->kvo_vn_fsid_freebsd11 = va.va_fsid;
2646 strlcpy(kvo->kvo_path, fullpath, sizeof(kvo->kvo_path));
2647 if (freepath != NULL)
2648 free(freepath, M_TEMP);
2650 /* Pack record size down */
2651 kvo->kvo_structsize = offsetof(struct kinfo_vmobject, kvo_path)
2652 + strlen(kvo->kvo_path) + 1;
2653 kvo->kvo_structsize = roundup(kvo->kvo_structsize,
2655 error = SYSCTL_OUT(req, kvo, kvo->kvo_structsize);
2657 mtx_lock(&vm_object_list_mtx);
2661 mtx_unlock(&vm_object_list_mtx);
2667 sysctl_vm_object_list(SYSCTL_HANDLER_ARGS)
2669 return (vm_object_list_handler(req, false));
2672 SYSCTL_PROC(_vm, OID_AUTO, objects, CTLTYPE_STRUCT | CTLFLAG_RW | CTLFLAG_SKIP |
2673 CTLFLAG_MPSAFE, NULL, 0, sysctl_vm_object_list, "S,kinfo_vmobject",
2674 "List of VM objects");
2677 sysctl_vm_object_list_swap(SYSCTL_HANDLER_ARGS)
2679 return (vm_object_list_handler(req, true));
2683 * This sysctl returns list of the anonymous or swap objects. Intent
2684 * is to provide stripped optimized list useful to analyze swap use.
2685 * Since technically non-swap (default) objects participate in the
2686 * shadow chains, and are converted to swap type as needed by swap
2687 * pager, we must report them.
2689 SYSCTL_PROC(_vm, OID_AUTO, swap_objects,
2690 CTLTYPE_STRUCT | CTLFLAG_RW | CTLFLAG_SKIP | CTLFLAG_MPSAFE, NULL, 0,
2691 sysctl_vm_object_list_swap, "S,kinfo_vmobject",
2692 "List of swap VM objects");
2694 #include "opt_ddb.h"
2696 #include <sys/kernel.h>
2698 #include <sys/cons.h>
2700 #include <ddb/ddb.h>
2703 _vm_object_in_map(vm_map_t map, vm_object_t object, vm_map_entry_t entry)
2706 vm_map_entry_t tmpe;
2713 VM_MAP_ENTRY_FOREACH(tmpe, map) {
2714 if (_vm_object_in_map(map, object, tmpe)) {
2718 } else if (entry->eflags & MAP_ENTRY_IS_SUB_MAP) {
2719 tmpm = entry->object.sub_map;
2720 VM_MAP_ENTRY_FOREACH(tmpe, tmpm) {
2721 if (_vm_object_in_map(tmpm, object, tmpe)) {
2725 } else if ((obj = entry->object.vm_object) != NULL) {
2726 for (; obj; obj = obj->backing_object)
2727 if (obj == object) {
2735 vm_object_in_map(vm_object_t object)
2739 /* sx_slock(&allproc_lock); */
2740 FOREACH_PROC_IN_SYSTEM(p) {
2741 if (!p->p_vmspace /* || (p->p_flag & (P_SYSTEM|P_WEXIT)) */)
2743 if (_vm_object_in_map(&p->p_vmspace->vm_map, object, 0)) {
2744 /* sx_sunlock(&allproc_lock); */
2748 /* sx_sunlock(&allproc_lock); */
2749 if (_vm_object_in_map(kernel_map, object, 0))
2754 DB_SHOW_COMMAND(vmochk, vm_object_check)
2759 * make sure that internal objs are in a map somewhere
2760 * and none have zero ref counts.
2762 TAILQ_FOREACH(object, &vm_object_list, object_list) {
2763 if ((object->flags & OBJ_ANON) != 0) {
2764 if (object->ref_count == 0) {
2765 db_printf("vmochk: internal obj has zero ref count: %ld\n",
2766 (long)object->size);
2768 if (!vm_object_in_map(object)) {
2770 "vmochk: internal obj is not in a map: "
2771 "ref: %d, size: %lu: 0x%lx, backing_object: %p\n",
2772 object->ref_count, (u_long)object->size,
2773 (u_long)object->size,
2774 (void *)object->backing_object);
2783 * vm_object_print: [ debug ]
2785 DB_SHOW_COMMAND(object, vm_object_print_static)
2787 /* XXX convert args. */
2788 vm_object_t object = (vm_object_t)addr;
2789 boolean_t full = have_addr;
2793 /* XXX count is an (unused) arg. Avoid shadowing it. */
2794 #define count was_count
2802 "Object %p: type=%d, size=0x%jx, res=%d, ref=%d, flags=0x%x ruid %d charge %jx\n",
2803 object, (int)object->type, (uintmax_t)object->size,
2804 object->resident_page_count, object->ref_count, object->flags,
2805 object->cred ? object->cred->cr_ruid : -1, (uintmax_t)object->charge);
2806 db_iprintf(" sref=%d, backing_object(%d)=(%p)+0x%jx\n",
2807 atomic_load_int(&object->shadow_count),
2808 object->backing_object ? object->backing_object->ref_count : 0,
2809 object->backing_object, (uintmax_t)object->backing_object_offset);
2816 TAILQ_FOREACH(p, &object->memq, listq) {
2818 db_iprintf("memory:=");
2819 else if (count == 6) {
2827 db_printf("(off=0x%jx,page=0x%jx)",
2828 (uintmax_t)p->pindex, (uintmax_t)VM_PAGE_TO_PHYS(p));
2841 /* XXX need this non-static entry for calling from vm_map_print. */
2844 /* db_expr_t */ long addr,
2845 boolean_t have_addr,
2846 /* db_expr_t */ long count,
2849 vm_object_print_static(addr, have_addr, count, modif);
2852 DB_SHOW_COMMAND(vmopag, vm_object_print_pages)
2857 vm_page_t m, prev_m;
2860 TAILQ_FOREACH(object, &vm_object_list, object_list) {
2861 db_printf("new object: %p\n", (void *)object);
2868 TAILQ_FOREACH(m, &object->memq, listq) {
2869 if ((prev_m = TAILQ_PREV(m, pglist, listq)) != NULL &&
2870 prev_m->pindex + 1 != m->pindex) {
2872 db_printf(" index(%ld)run(%d)pa(0x%lx)\n",
2873 (long)fidx, rcount, (long)pa);
2880 (VM_PAGE_TO_PHYS(m) == pa + rcount * PAGE_SIZE)) {
2885 db_printf(" index(%ld)run(%d)pa(0x%lx)\n",
2886 (long)fidx, rcount, (long)pa);
2891 pa = VM_PAGE_TO_PHYS(m);
2895 db_printf(" index(%ld)run(%d)pa(0x%lx)\n",
2896 (long)fidx, rcount, (long)pa);