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. All advertising materials mentioning features or use of this software
19 * must display the following acknowledgement:
20 * This product includes software developed by the University of
21 * California, Berkeley and its contributors.
22 * 4. Neither the name of the University nor the names of its contributors
23 * may be used to endorse or promote products derived from this software
24 * without specific prior written permission.
26 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
27 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
29 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
30 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
31 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
32 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
33 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
34 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
35 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
38 * from: @(#)vm_object.c 8.5 (Berkeley) 3/22/94
41 * Copyright (c) 1987, 1990 Carnegie-Mellon University.
42 * All rights reserved.
44 * Authors: Avadis Tevanian, Jr., Michael Wayne Young
46 * Permission to use, copy, modify and distribute this software and
47 * its documentation is hereby granted, provided that both the copyright
48 * notice and this permission notice appear in all copies of the
49 * software, derivative works or modified versions, and any portions
50 * thereof, and that both notices appear in supporting documentation.
52 * CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS"
53 * CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND
54 * FOR ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
56 * Carnegie Mellon requests users of this software to return to
58 * Software Distribution Coordinator or Software.Distribution@CS.CMU.EDU
59 * School of Computer Science
60 * Carnegie Mellon University
61 * Pittsburgh PA 15213-3890
63 * any improvements or extensions that they make and grant Carnegie the
64 * rights to redistribute these changes.
66 * $FreeBSD: src/sys/vm/vm_object.c,v 1.171.2.8 2003/05/26 19:17:56 alc Exp $
67 * $DragonFly: src/sys/vm/vm_object.c,v 1.33 2008/05/09 07:24:48 dillon Exp $
71 * Virtual memory object module.
74 #include <sys/param.h>
75 #include <sys/systm.h>
76 #include <sys/proc.h> /* for curproc, pageproc */
77 #include <sys/thread.h>
78 #include <sys/vnode.h>
79 #include <sys/vmmeter.h>
81 #include <sys/mount.h>
82 #include <sys/kernel.h>
83 #include <sys/sysctl.h>
86 #include <vm/vm_param.h>
88 #include <vm/vm_map.h>
89 #include <vm/vm_object.h>
90 #include <vm/vm_page.h>
91 #include <vm/vm_pageout.h>
92 #include <vm/vm_pager.h>
93 #include <vm/swap_pager.h>
94 #include <vm/vm_kern.h>
95 #include <vm/vm_extern.h>
96 #include <vm/vm_zone.h>
98 #define EASY_SCAN_FACTOR 8
100 static void vm_object_qcollapse(vm_object_t object);
101 static int vm_object_page_collect_flush(vm_object_t object, vm_page_t p,
105 * Virtual memory objects maintain the actual data
106 * associated with allocated virtual memory. A given
107 * page of memory exists within exactly one object.
109 * An object is only deallocated when all "references"
110 * are given up. Only one "reference" to a given
111 * region of an object should be writeable.
113 * Associated with each object is a list of all resident
114 * memory pages belonging to that object; this list is
115 * maintained by the "vm_page" module, and locked by the object's
118 * Each object also records a "pager" routine which is
119 * used to retrieve (and store) pages to the proper backing
120 * storage. In addition, objects may be backed by other
121 * objects from which they were virtual-copied.
123 * The only items within the object structure which are
124 * modified after time of creation are:
125 * reference count locked by object's lock
126 * pager routine locked by object's lock
130 struct object_q vm_object_list; /* locked by vmobj_token */
131 struct vm_object kernel_object;
133 static long vm_object_count; /* locked by vmobj_token */
134 extern int vm_pageout_page_count;
136 static long object_collapses;
137 static long object_bypasses;
138 static int next_index;
139 static vm_zone_t obj_zone;
140 static struct vm_zone obj_zone_store;
141 static int object_hash_rand;
142 #define VM_OBJECTS_INIT 256
143 static struct vm_object vm_objects_init[VM_OBJECTS_INIT];
146 * Initialize a freshly allocated object
148 * Used only by vm_object_allocate() and zinitna().
153 _vm_object_allocate(objtype_t type, vm_pindex_t size, vm_object_t object)
157 RB_INIT(&object->rb_memq);
158 LIST_INIT(&object->shadow_head);
162 object->ref_count = 1;
164 if ((object->type == OBJT_DEFAULT) || (object->type == OBJT_SWAP))
165 vm_object_set_flag(object, OBJ_ONEMAPPING);
166 object->paging_in_progress = 0;
167 object->resident_page_count = 0;
168 object->agg_pv_list_count = 0;
169 object->shadow_count = 0;
170 object->pg_color = next_index;
171 if ( size > (PQ_L2_SIZE / 3 + PQ_PRIME1))
172 incr = PQ_L2_SIZE / 3 + PQ_PRIME1;
175 next_index = (next_index + incr) & PQ_L2_MASK;
176 object->handle = NULL;
177 object->backing_object = NULL;
178 object->backing_object_offset = (vm_ooffset_t) 0;
180 * Try to generate a number that will spread objects out in the
181 * hash table. We 'wipe' new objects across the hash in 128 page
182 * increments plus 1 more to offset it a little more by the time
185 object->hash_rand = object_hash_rand - 129;
187 object->generation++;
188 object->swblock_count = 0;
189 RB_INIT(&object->swblock_root);
190 lwkt_token_init(&object->tok, "vmobjtk");
192 lwkt_gettoken(&vmobj_token);
193 TAILQ_INSERT_TAIL(&vm_object_list, object, object_list);
195 object_hash_rand = object->hash_rand;
196 lwkt_reltoken(&vmobj_token);
200 * Initialize the VM objects module.
202 * Called from the low level boot code only.
207 TAILQ_INIT(&vm_object_list);
209 _vm_object_allocate(OBJT_DEFAULT, OFF_TO_IDX(KvaEnd),
212 obj_zone = &obj_zone_store;
213 zbootinit(obj_zone, "VM OBJECT", sizeof (struct vm_object),
214 vm_objects_init, VM_OBJECTS_INIT);
218 vm_object_init2(void)
220 zinitna(obj_zone, NULL, NULL, 0, 0, ZONE_PANICFAIL, 1);
224 * Allocate and return a new object of the specified type and size.
229 vm_object_allocate(objtype_t type, vm_pindex_t size)
233 result = (vm_object_t) zalloc(obj_zone);
235 _vm_object_allocate(type, size, result);
241 * Add an additional reference to a vm_object.
243 * Object passed by caller must be stable or caller must already
244 * hold vmobj_token to avoid races.
247 vm_object_reference(vm_object_t object)
250 lwkt_gettoken(&vmobj_token);
252 if (object->type == OBJT_VNODE) {
253 vref(object->handle);
254 /* XXX what if the vnode is being destroyed? */
256 lwkt_reltoken(&vmobj_token);
261 vm_object_reference_locked(vm_object_t object)
264 ASSERT_LWKT_TOKEN_HELD(&vmobj_token);
266 if (object->type == OBJT_VNODE) {
267 vref(object->handle);
268 /* XXX what if the vnode is being destroyed? */
274 * Dereference an object and its underlying vnode.
276 * The caller must hold vmobj_token.
279 vm_object_vndeallocate(vm_object_t object)
281 struct vnode *vp = (struct vnode *) object->handle;
283 KASSERT(object->type == OBJT_VNODE,
284 ("vm_object_vndeallocate: not a vnode object"));
285 KASSERT(vp != NULL, ("vm_object_vndeallocate: missing vp"));
286 ASSERT_LWKT_TOKEN_HELD(&vmobj_token);
288 if (object->ref_count == 0) {
289 vprint("vm_object_vndeallocate", vp);
290 panic("vm_object_vndeallocate: bad object reference count");
295 if (object->ref_count == 0)
296 vclrflags(vp, VTEXT);
301 * Release a reference to the specified object, gained either through a
302 * vm_object_allocate or a vm_object_reference call. When all references
303 * are gone, storage associated with this object may be relinquished.
306 vm_object_deallocate(vm_object_t object)
308 lwkt_gettoken(&vmobj_token);
309 vm_object_deallocate_locked(object);
310 lwkt_reltoken(&vmobj_token);
314 vm_object_deallocate_locked(vm_object_t object)
318 ASSERT_LWKT_TOKEN_HELD(&vmobj_token);
320 while (object != NULL) {
321 if (object->type == OBJT_VNODE) {
322 vm_object_vndeallocate(object);
326 if (object->ref_count == 0) {
327 panic("vm_object_deallocate: object deallocated "
328 "too many times: %d", object->type);
330 if (object->ref_count > 2) {
336 * We currently need the vm_token from this point on, and
337 * we must recheck ref_count after acquiring it.
339 lwkt_gettoken(&vm_token);
341 if (object->ref_count > 2) {
343 lwkt_reltoken(&vm_token);
348 * Here on ref_count of one or two, which are special cases for
351 if ((object->ref_count == 2) && (object->shadow_count == 0)) {
352 vm_object_set_flag(object, OBJ_ONEMAPPING);
354 lwkt_reltoken(&vm_token);
357 if ((object->ref_count == 2) && (object->shadow_count == 1)) {
359 if ((object->handle == NULL) &&
360 (object->type == OBJT_DEFAULT ||
361 object->type == OBJT_SWAP)) {
364 robject = LIST_FIRST(&object->shadow_head);
365 KASSERT(robject != NULL,
366 ("vm_object_deallocate: ref_count: "
367 "%d, shadow_count: %d",
369 object->shadow_count));
371 if ((robject->handle == NULL) &&
372 (robject->type == OBJT_DEFAULT ||
373 robject->type == OBJT_SWAP)) {
375 robject->ref_count++;
378 robject->paging_in_progress ||
379 object->paging_in_progress
381 vm_object_pip_sleep(robject, "objde1");
382 vm_object_pip_sleep(object, "objde2");
385 if (robject->ref_count == 1) {
386 robject->ref_count--;
392 vm_object_collapse(object);
393 lwkt_reltoken(&vm_token);
397 lwkt_reltoken(&vm_token);
402 * Normal dereferencing path
405 if (object->ref_count != 0) {
406 lwkt_reltoken(&vm_token);
414 temp = object->backing_object;
416 LIST_REMOVE(object, shadow_list);
417 temp->shadow_count--;
419 object->backing_object = NULL;
421 lwkt_reltoken(&vm_token);
424 * Don't double-terminate, we could be in a termination
425 * recursion due to the terminate having to sync data
428 if ((object->flags & OBJ_DEAD) == 0)
429 vm_object_terminate(object);
435 * Destroy the specified object, freeing up related resources.
437 * The object must have zero references.
439 * The caller must be holding vmobj_token and properly interlock with
442 static int vm_object_terminate_callback(vm_page_t p, void *data);
445 vm_object_terminate(vm_object_t object)
448 * Make sure no one uses us. Once we set OBJ_DEAD we should be
449 * able to safely block.
451 KKASSERT((object->flags & OBJ_DEAD) == 0);
452 ASSERT_LWKT_TOKEN_HELD(&vmobj_token);
453 vm_object_set_flag(object, OBJ_DEAD);
456 * Wait for the pageout daemon to be done with the object
458 vm_object_pip_wait(object, "objtrm");
460 KASSERT(!object->paging_in_progress,
461 ("vm_object_terminate: pageout in progress"));
464 * Clean and free the pages, as appropriate. All references to the
465 * object are gone, so we don't need to lock it.
467 if (object->type == OBJT_VNODE) {
471 * Clean pages and flush buffers.
473 vm_object_page_clean(object, 0, 0, OBJPC_SYNC);
475 vp = (struct vnode *) object->handle;
476 vinvalbuf(vp, V_SAVE, 0, 0);
480 * Wait for any I/O to complete, after which there had better not
481 * be any references left on the object.
483 vm_object_pip_wait(object, "objtrm");
485 if (object->ref_count != 0) {
486 panic("vm_object_terminate: object with references, "
487 "ref_count=%d", object->ref_count);
491 * Now free any remaining pages. For internal objects, this also
492 * removes them from paging queues. Don't free wired pages, just
493 * remove them from the object.
495 lwkt_gettoken(&vm_token);
496 vm_page_rb_tree_RB_SCAN(&object->rb_memq, NULL,
497 vm_object_terminate_callback, NULL);
498 lwkt_reltoken(&vm_token);
501 * Let the pager know object is dead.
503 vm_pager_deallocate(object);
506 * Remove the object from the global object list.
508 * (we are holding vmobj_token)
510 TAILQ_REMOVE(&vm_object_list, object, object_list);
512 vm_object_dead_wakeup(object);
514 if (object->ref_count != 0) {
515 panic("vm_object_terminate2: object with references, "
516 "ref_count=%d", object->ref_count);
520 * Free the space for the object.
522 zfree(obj_zone, object);
526 * The caller must hold vm_token.
529 vm_object_terminate_callback(vm_page_t p, void *data __unused)
531 if (p->busy || (p->flags & PG_BUSY))
532 panic("vm_object_terminate: freeing busy page %p", p);
533 if (p->wire_count == 0) {
536 mycpu->gd_cnt.v_pfree++;
538 if (p->queue != PQ_NONE)
539 kprintf("vm_object_terminate: Warning: Encountered wired page %p on queue %d\n", p, p->queue);
548 * The object is dead but still has an object<->pager association. Sleep
549 * and return. The caller typically retests the association in a loop.
551 * Must be called with the vmobj_token held.
554 vm_object_dead_sleep(vm_object_t object, const char *wmesg)
556 ASSERT_LWKT_TOKEN_HELD(&vmobj_token);
557 if (object->handle) {
558 vm_object_set_flag(object, OBJ_DEADWNT);
559 tsleep(object, 0, wmesg, 0);
560 /* object may be invalid after this point */
565 * Wakeup anyone waiting for the object<->pager disassociation on
568 * Must be called with the vmobj_token held.
571 vm_object_dead_wakeup(vm_object_t object)
573 ASSERT_LWKT_TOKEN_HELD(&vmobj_token);
574 if (object->flags & OBJ_DEADWNT) {
575 vm_object_clear_flag(object, OBJ_DEADWNT);
581 * Clean all dirty pages in the specified range of object. Leaves page
582 * on whatever queue it is currently on. If NOSYNC is set then do not
583 * write out pages with PG_NOSYNC set (originally comes from MAP_NOSYNC),
584 * leaving the object dirty.
586 * When stuffing pages asynchronously, allow clustering. XXX we need a
587 * synchronous clustering mode implementation.
589 * Odd semantics: if start == end, we clean everything.
591 * The object must be locked? XXX
593 static int vm_object_page_clean_pass1(struct vm_page *p, void *data);
594 static int vm_object_page_clean_pass2(struct vm_page *p, void *data);
597 vm_object_page_clean(vm_object_t object, vm_pindex_t start, vm_pindex_t end,
600 struct rb_vm_page_scan_info info;
606 lwkt_gettoken(&vm_token);
607 if (object->type != OBJT_VNODE ||
608 (object->flags & OBJ_MIGHTBEDIRTY) == 0) {
609 lwkt_reltoken(&vm_token);
613 pagerflags = (flags & (OBJPC_SYNC | OBJPC_INVAL)) ?
614 VM_PAGER_PUT_SYNC : VM_PAGER_CLUSTER_OK;
615 pagerflags |= (flags & OBJPC_INVAL) ? VM_PAGER_PUT_INVAL : 0;
620 * Interlock other major object operations. This allows us to
621 * temporarily clear OBJ_WRITEABLE and OBJ_MIGHTBEDIRTY.
624 vm_object_set_flag(object, OBJ_CLEANING);
627 * Handle 'entire object' case
629 info.start_pindex = start;
631 info.end_pindex = object->size - 1;
633 info.end_pindex = end - 1;
635 wholescan = (start == 0 && info.end_pindex == object->size - 1);
637 info.pagerflags = pagerflags;
638 info.object = object;
641 * If cleaning the entire object do a pass to mark the pages read-only.
642 * If everything worked out ok, clear OBJ_WRITEABLE and
647 vm_page_rb_tree_RB_SCAN(&object->rb_memq, rb_vm_page_scancmp,
648 vm_object_page_clean_pass1, &info);
649 if (info.error == 0) {
650 vm_object_clear_flag(object,
651 OBJ_WRITEABLE|OBJ_MIGHTBEDIRTY);
652 if (object->type == OBJT_VNODE &&
653 (vp = (struct vnode *)object->handle) != NULL) {
654 if (vp->v_flag & VOBJDIRTY)
655 vclrflags(vp, VOBJDIRTY);
661 * Do a pass to clean all the dirty pages we find.
665 curgeneration = object->generation;
666 vm_page_rb_tree_RB_SCAN(&object->rb_memq, rb_vm_page_scancmp,
667 vm_object_page_clean_pass2, &info);
668 } while (info.error || curgeneration != object->generation);
670 vm_object_clear_flag(object, OBJ_CLEANING);
672 lwkt_reltoken(&vm_token);
676 * The caller must hold vm_token.
680 vm_object_page_clean_pass1(struct vm_page *p, void *data)
682 struct rb_vm_page_scan_info *info = data;
684 vm_page_flag_set(p, PG_CLEANCHK);
685 if ((info->limit & OBJPC_NOSYNC) && (p->flags & PG_NOSYNC))
688 vm_page_protect(p, VM_PROT_READ); /* must not block */
693 * The caller must hold vm_token.
697 vm_object_page_clean_pass2(struct vm_page *p, void *data)
699 struct rb_vm_page_scan_info *info = data;
703 * Do not mess with pages that were inserted after we started
706 if ((p->flags & PG_CLEANCHK) == 0)
710 * Before wasting time traversing the pmaps, check for trivial
711 * cases where the page cannot be dirty.
713 if (p->valid == 0 || (p->queue - p->pc) == PQ_CACHE) {
714 KKASSERT((p->dirty & p->valid) == 0);
719 * Check whether the page is dirty or not. The page has been set
720 * to be read-only so the check will not race a user dirtying the
723 vm_page_test_dirty(p);
724 if ((p->dirty & p->valid) == 0) {
725 vm_page_flag_clear(p, PG_CLEANCHK);
730 * If we have been asked to skip nosync pages and this is a
731 * nosync page, skip it. Note that the object flags were
732 * not cleared in this case (because pass1 will have returned an
733 * error), so we do not have to set them.
735 if ((info->limit & OBJPC_NOSYNC) && (p->flags & PG_NOSYNC)) {
736 vm_page_flag_clear(p, PG_CLEANCHK);
741 * Flush as many pages as we can. PG_CLEANCHK will be cleared on
742 * the pages that get successfully flushed. Set info->error if
743 * we raced an object modification.
745 n = vm_object_page_collect_flush(info->object, p, info->pagerflags);
752 * Collect the specified page and nearby pages and flush them out.
753 * The number of pages flushed is returned.
755 * The caller must hold vm_token.
758 vm_object_page_collect_flush(vm_object_t object, vm_page_t p, int pagerflags)
767 vm_page_t maf[vm_pageout_page_count];
768 vm_page_t mab[vm_pageout_page_count];
769 vm_page_t ma[vm_pageout_page_count];
771 curgeneration = object->generation;
774 while (vm_page_sleep_busy(p, TRUE, "vpcwai")) {
775 if (object->generation != curgeneration) {
779 KKASSERT(p->object == object && p->pindex == pi);
782 for(i = 1; i < vm_pageout_page_count; i++) {
785 if ((tp = vm_page_lookup(object, pi + i)) != NULL) {
786 if ((tp->flags & PG_BUSY) ||
787 ((pagerflags & VM_PAGER_IGNORE_CLEANCHK) == 0 &&
788 (tp->flags & PG_CLEANCHK) == 0) ||
791 if((tp->queue - tp->pc) == PQ_CACHE) {
792 vm_page_flag_clear(tp, PG_CLEANCHK);
795 vm_page_test_dirty(tp);
796 if ((tp->dirty & tp->valid) == 0) {
797 vm_page_flag_clear(tp, PG_CLEANCHK);
808 chkb = vm_pageout_page_count - maxf;
810 for(i = 1; i < chkb;i++) {
813 if ((tp = vm_page_lookup(object, pi - i)) != NULL) {
814 if ((tp->flags & PG_BUSY) ||
815 ((pagerflags & VM_PAGER_IGNORE_CLEANCHK) == 0 &&
816 (tp->flags & PG_CLEANCHK) == 0) ||
819 if((tp->queue - tp->pc) == PQ_CACHE) {
820 vm_page_flag_clear(tp, PG_CLEANCHK);
823 vm_page_test_dirty(tp);
824 if ((tp->dirty & tp->valid) == 0) {
825 vm_page_flag_clear(tp, PG_CLEANCHK);
836 for(i = 0; i < maxb; i++) {
837 int index = (maxb - i) - 1;
839 vm_page_flag_clear(ma[index], PG_CLEANCHK);
841 vm_page_flag_clear(p, PG_CLEANCHK);
843 for(i = 0; i < maxf; i++) {
844 int index = (maxb + i) + 1;
846 vm_page_flag_clear(ma[index], PG_CLEANCHK);
848 runlen = maxb + maxf + 1;
850 vm_pageout_flush(ma, runlen, pagerflags);
851 for (i = 0; i < runlen; i++) {
852 if (ma[i]->valid & ma[i]->dirty) {
853 vm_page_protect(ma[i], VM_PROT_READ);
854 vm_page_flag_set(ma[i], PG_CLEANCHK);
857 * maxf will end up being the actual number of pages
858 * we wrote out contiguously, non-inclusive of the
859 * first page. We do not count look-behind pages.
861 if (i >= maxb + 1 && (maxf > i - maxb - 1))
869 * Same as vm_object_pmap_copy, except range checking really
870 * works, and is meant for small sections of an object.
872 * This code protects resident pages by making them read-only
873 * and is typically called on a fork or split when a page
874 * is converted to copy-on-write.
876 * NOTE: If the page is already at VM_PROT_NONE, calling
877 * vm_page_protect will have no effect.
880 vm_object_pmap_copy_1(vm_object_t object, vm_pindex_t start, vm_pindex_t end)
885 if (object == NULL || (object->flags & OBJ_WRITEABLE) == 0)
889 * spl protection needed to prevent races between the lookup,
890 * an interrupt unbusy/free, and our protect call.
893 lwkt_gettoken(&vm_token);
894 for (idx = start; idx < end; idx++) {
895 p = vm_page_lookup(object, idx);
898 vm_page_protect(p, VM_PROT_READ);
900 lwkt_reltoken(&vm_token);
905 * Removes all physical pages in the specified object range from all
908 * The object must *not* be locked.
911 static int vm_object_pmap_remove_callback(vm_page_t p, void *data);
914 vm_object_pmap_remove(vm_object_t object, vm_pindex_t start, vm_pindex_t end)
916 struct rb_vm_page_scan_info info;
920 info.start_pindex = start;
921 info.end_pindex = end - 1;
924 lwkt_gettoken(&vm_token);
925 vm_page_rb_tree_RB_SCAN(&object->rb_memq, rb_vm_page_scancmp,
926 vm_object_pmap_remove_callback, &info);
927 if (start == 0 && end == object->size)
928 vm_object_clear_flag(object, OBJ_WRITEABLE);
929 lwkt_reltoken(&vm_token);
934 * The caller must hold vm_token.
937 vm_object_pmap_remove_callback(vm_page_t p, void *data __unused)
939 vm_page_protect(p, VM_PROT_NONE);
944 * Implements the madvise function at the object/page level.
946 * MADV_WILLNEED (any object)
948 * Activate the specified pages if they are resident.
950 * MADV_DONTNEED (any object)
952 * Deactivate the specified pages if they are resident.
954 * MADV_FREE (OBJT_DEFAULT/OBJT_SWAP objects, OBJ_ONEMAPPING only)
956 * Deactivate and clean the specified pages if they are
957 * resident. This permits the process to reuse the pages
958 * without faulting or the kernel to reclaim the pages
964 vm_object_madvise(vm_object_t object, vm_pindex_t pindex, int count, int advise)
966 vm_pindex_t end, tpindex;
973 end = pindex + count;
975 lwkt_gettoken(&vm_token);
978 * Locate and adjust resident pages
980 for (; pindex < end; pindex += 1) {
986 * MADV_FREE only operates on OBJT_DEFAULT or OBJT_SWAP pages
987 * and those pages must be OBJ_ONEMAPPING.
989 if (advise == MADV_FREE) {
990 if ((tobject->type != OBJT_DEFAULT &&
991 tobject->type != OBJT_SWAP) ||
992 (tobject->flags & OBJ_ONEMAPPING) == 0) {
998 * spl protection is required to avoid a race between the
999 * lookup, an interrupt unbusy/free, and our busy check.
1003 m = vm_page_lookup(tobject, tpindex);
1007 * There may be swap even if there is no backing page
1009 if (advise == MADV_FREE && tobject->type == OBJT_SWAP)
1010 swap_pager_freespace(tobject, tpindex, 1);
1016 if (tobject->backing_object == NULL)
1018 tpindex += OFF_TO_IDX(tobject->backing_object_offset);
1019 tobject = tobject->backing_object;
1024 * If the page is busy or not in a normal active state,
1025 * we skip it. If the page is not managed there are no
1026 * page queues to mess with. Things can break if we mess
1027 * with pages in any of the below states.
1032 (m->flags & PG_UNMANAGED) ||
1033 m->valid != VM_PAGE_BITS_ALL
1039 if (vm_page_sleep_busy(m, TRUE, "madvpo")) {
1047 * Theoretically once a page is known not to be busy, an
1048 * interrupt cannot come along and rip it out from under us.
1051 if (advise == MADV_WILLNEED) {
1052 vm_page_activate(m);
1053 } else if (advise == MADV_DONTNEED) {
1054 vm_page_dontneed(m);
1055 } else if (advise == MADV_FREE) {
1057 * Mark the page clean. This will allow the page
1058 * to be freed up by the system. However, such pages
1059 * are often reused quickly by malloc()/free()
1060 * so we do not do anything that would cause
1061 * a page fault if we can help it.
1063 * Specifically, we do not try to actually free
1064 * the page now nor do we try to put it in the
1065 * cache (which would cause a page fault on reuse).
1067 * But we do make the page is freeable as we
1068 * can without actually taking the step of unmapping
1071 pmap_clear_modify(m);
1074 vm_page_dontneed(m);
1075 if (tobject->type == OBJT_SWAP)
1076 swap_pager_freespace(tobject, tpindex, 1);
1080 lwkt_reltoken(&vm_token);
1084 * Create a new object which is backed by the specified existing object
1085 * range. The source object reference is deallocated.
1087 * The new object and offset into that object are returned in the source
1090 * No other requirements.
1093 vm_object_shadow(vm_object_t *object, vm_ooffset_t *offset, vm_size_t length)
1101 * Don't create the new object if the old object isn't shared.
1103 lwkt_gettoken(&vm_token);
1105 if (source != NULL &&
1106 source->ref_count == 1 &&
1107 source->handle == NULL &&
1108 (source->type == OBJT_DEFAULT ||
1109 source->type == OBJT_SWAP)) {
1110 lwkt_reltoken(&vm_token);
1115 * Allocate a new object with the given length
1118 if ((result = vm_object_allocate(OBJT_DEFAULT, length)) == NULL)
1119 panic("vm_object_shadow: no object for shadowing");
1122 * The new object shadows the source object, adding a reference to it.
1123 * Our caller changes his reference to point to the new object,
1124 * removing a reference to the source object. Net result: no change
1125 * of reference count.
1127 * Try to optimize the result object's page color when shadowing
1128 * in order to maintain page coloring consistency in the combined
1131 result->backing_object = source;
1133 LIST_INSERT_HEAD(&source->shadow_head, result, shadow_list);
1134 source->shadow_count++;
1135 source->generation++;
1136 result->pg_color = (source->pg_color + OFF_TO_IDX(*offset)) & PQ_L2_MASK;
1140 * Store the offset into the source object, and fix up the offset into
1143 result->backing_object_offset = *offset;
1144 lwkt_reltoken(&vm_token);
1147 * Return the new things
1153 #define OBSC_TEST_ALL_SHADOWED 0x0001
1154 #define OBSC_COLLAPSE_NOWAIT 0x0002
1155 #define OBSC_COLLAPSE_WAIT 0x0004
1157 static int vm_object_backing_scan_callback(vm_page_t p, void *data);
1160 * The caller must hold vm_token.
1163 vm_object_backing_scan(vm_object_t object, int op)
1165 struct rb_vm_page_scan_info info;
1166 vm_object_t backing_object;
1170 backing_object = object->backing_object;
1171 info.backing_offset_index = OFF_TO_IDX(object->backing_object_offset);
1174 * Initial conditions
1177 if (op & OBSC_TEST_ALL_SHADOWED) {
1179 * We do not want to have to test for the existence of
1180 * swap pages in the backing object. XXX but with the
1181 * new swapper this would be pretty easy to do.
1183 * XXX what about anonymous MAP_SHARED memory that hasn't
1184 * been ZFOD faulted yet? If we do not test for this, the
1185 * shadow test may succeed! XXX
1187 if (backing_object->type != OBJT_DEFAULT) {
1192 if (op & OBSC_COLLAPSE_WAIT) {
1193 KKASSERT((backing_object->flags & OBJ_DEAD) == 0);
1194 vm_object_set_flag(backing_object, OBJ_DEAD);
1198 * Our scan. We have to retry if a negative error code is returned,
1199 * otherwise 0 or 1 will be returned in info.error. 0 Indicates that
1200 * the scan had to be stopped because the parent does not completely
1203 info.object = object;
1204 info.backing_object = backing_object;
1208 vm_page_rb_tree_RB_SCAN(&backing_object->rb_memq, NULL,
1209 vm_object_backing_scan_callback,
1211 } while (info.error < 0);
1217 * The caller must hold vm_token.
1220 vm_object_backing_scan_callback(vm_page_t p, void *data)
1222 struct rb_vm_page_scan_info *info = data;
1223 vm_object_t backing_object;
1225 vm_pindex_t new_pindex;
1226 vm_pindex_t backing_offset_index;
1229 new_pindex = p->pindex - info->backing_offset_index;
1231 object = info->object;
1232 backing_object = info->backing_object;
1233 backing_offset_index = info->backing_offset_index;
1235 if (op & OBSC_TEST_ALL_SHADOWED) {
1239 * Ignore pages outside the parent object's range
1240 * and outside the parent object's mapping of the
1243 * note that we do not busy the backing object's
1247 p->pindex < backing_offset_index ||
1248 new_pindex >= object->size
1254 * See if the parent has the page or if the parent's
1255 * object pager has the page. If the parent has the
1256 * page but the page is not valid, the parent's
1257 * object pager must have the page.
1259 * If this fails, the parent does not completely shadow
1260 * the object and we might as well give up now.
1263 pp = vm_page_lookup(object, new_pindex);
1264 if ((pp == NULL || pp->valid == 0) &&
1265 !vm_pager_has_page(object, new_pindex)
1267 info->error = 0; /* problemo */
1268 return(-1); /* stop the scan */
1273 * Check for busy page
1276 if (op & (OBSC_COLLAPSE_WAIT | OBSC_COLLAPSE_NOWAIT)) {
1279 if (op & OBSC_COLLAPSE_NOWAIT) {
1281 (p->flags & PG_BUSY) ||
1289 } else if (op & OBSC_COLLAPSE_WAIT) {
1290 if (vm_page_sleep_busy(p, TRUE, "vmocol")) {
1292 * If we slept, anything could have
1293 * happened. Ask that the scan be restarted.
1295 * Since the object is marked dead, the
1296 * backing offset should not have changed.
1309 p->object == backing_object,
1310 ("vm_object_qcollapse(): object mismatch")
1314 * Destroy any associated swap
1316 if (backing_object->type == OBJT_SWAP)
1317 swap_pager_freespace(backing_object, p->pindex, 1);
1320 p->pindex < backing_offset_index ||
1321 new_pindex >= object->size
1324 * Page is out of the parent object's range, we
1325 * can simply destroy it.
1327 vm_page_protect(p, VM_PROT_NONE);
1332 pp = vm_page_lookup(object, new_pindex);
1333 if (pp != NULL || vm_pager_has_page(object, new_pindex)) {
1335 * page already exists in parent OR swap exists
1336 * for this location in the parent. Destroy
1337 * the original page from the backing object.
1339 * Leave the parent's page alone
1341 vm_page_protect(p, VM_PROT_NONE);
1347 * Page does not exist in parent, rename the
1348 * page from the backing object to the main object.
1350 * If the page was mapped to a process, it can remain
1351 * mapped through the rename.
1353 if ((p->queue - p->pc) == PQ_CACHE)
1354 vm_page_deactivate(p);
1356 vm_page_rename(p, object, new_pindex);
1357 /* page automatically made dirty by rename */
1363 * This version of collapse allows the operation to occur earlier and
1364 * when paging_in_progress is true for an object... This is not a complete
1365 * operation, but should plug 99.9% of the rest of the leaks.
1367 * The caller must hold vm_token and vmobj_token.
1368 * (only called from vm_object_collapse)
1371 vm_object_qcollapse(vm_object_t object)
1373 vm_object_t backing_object = object->backing_object;
1375 if (backing_object->ref_count != 1)
1378 backing_object->ref_count += 2;
1380 vm_object_backing_scan(object, OBSC_COLLAPSE_NOWAIT);
1382 backing_object->ref_count -= 2;
1386 * Collapse an object with the object backing it. Pages in the backing
1387 * object are moved into the parent, and the backing object is deallocated.
1390 vm_object_collapse(vm_object_t object)
1392 ASSERT_LWKT_TOKEN_HELD(&vm_token);
1393 ASSERT_LWKT_TOKEN_HELD(&vmobj_token);
1396 vm_object_t backing_object;
1399 * Verify that the conditions are right for collapse:
1401 * The object exists and the backing object exists.
1406 if ((backing_object = object->backing_object) == NULL)
1410 * we check the backing object first, because it is most likely
1413 if (backing_object->handle != NULL ||
1414 (backing_object->type != OBJT_DEFAULT &&
1415 backing_object->type != OBJT_SWAP) ||
1416 (backing_object->flags & OBJ_DEAD) ||
1417 object->handle != NULL ||
1418 (object->type != OBJT_DEFAULT &&
1419 object->type != OBJT_SWAP) ||
1420 (object->flags & OBJ_DEAD)) {
1425 object->paging_in_progress != 0 ||
1426 backing_object->paging_in_progress != 0
1428 vm_object_qcollapse(object);
1433 * We know that we can either collapse the backing object (if
1434 * the parent is the only reference to it) or (perhaps) have
1435 * the parent bypass the object if the parent happens to shadow
1436 * all the resident pages in the entire backing object.
1438 * This is ignoring pager-backed pages such as swap pages.
1439 * vm_object_backing_scan fails the shadowing test in this
1443 if (backing_object->ref_count == 1) {
1445 * If there is exactly one reference to the backing
1446 * object, we can collapse it into the parent.
1448 vm_object_backing_scan(object, OBSC_COLLAPSE_WAIT);
1451 * Move the pager from backing_object to object.
1454 if (backing_object->type == OBJT_SWAP) {
1455 vm_object_pip_add(backing_object, 1);
1458 * scrap the paging_offset junk and do a
1459 * discrete copy. This also removes major
1460 * assumptions about how the swap-pager
1461 * works from where it doesn't belong. The
1462 * new swapper is able to optimize the
1463 * destroy-source case.
1466 vm_object_pip_add(object, 1);
1470 OFF_TO_IDX(object->backing_object_offset), TRUE);
1471 vm_object_pip_wakeup(object);
1473 vm_object_pip_wakeup(backing_object);
1476 * Object now shadows whatever backing_object did.
1477 * Note that the reference to
1478 * backing_object->backing_object moves from within
1479 * backing_object to within object.
1482 LIST_REMOVE(object, shadow_list);
1483 object->backing_object->shadow_count--;
1484 object->backing_object->generation++;
1485 if (backing_object->backing_object) {
1486 LIST_REMOVE(backing_object, shadow_list);
1487 backing_object->backing_object->shadow_count--;
1488 backing_object->backing_object->generation++;
1490 object->backing_object = backing_object->backing_object;
1491 if (object->backing_object) {
1493 &object->backing_object->shadow_head,
1497 object->backing_object->shadow_count++;
1498 object->backing_object->generation++;
1501 object->backing_object_offset +=
1502 backing_object->backing_object_offset;
1505 * Discard backing_object.
1507 * Since the backing object has no pages, no pager left,
1508 * and no object references within it, all that is
1509 * necessary is to dispose of it.
1512 KASSERT(backing_object->ref_count == 1,
1513 ("backing_object %p was somehow "
1514 "re-referenced during collapse!",
1516 KASSERT(RB_EMPTY(&backing_object->rb_memq),
1517 ("backing_object %p somehow has left "
1518 "over pages during collapse!",
1521 /* (we are holding vmobj_token) */
1522 TAILQ_REMOVE(&vm_object_list, backing_object,
1526 zfree(obj_zone, backing_object);
1530 vm_object_t new_backing_object;
1533 * If we do not entirely shadow the backing object,
1534 * there is nothing we can do so we give up.
1537 if (vm_object_backing_scan(object, OBSC_TEST_ALL_SHADOWED) == 0) {
1542 * Make the parent shadow the next object in the
1543 * chain. Deallocating backing_object will not remove
1544 * it, since its reference count is at least 2.
1547 LIST_REMOVE(object, shadow_list);
1548 backing_object->shadow_count--;
1549 backing_object->generation++;
1551 new_backing_object = backing_object->backing_object;
1552 if ((object->backing_object = new_backing_object) != NULL) {
1553 vm_object_reference(new_backing_object);
1555 &new_backing_object->shadow_head,
1559 new_backing_object->shadow_count++;
1560 new_backing_object->generation++;
1561 object->backing_object_offset +=
1562 backing_object->backing_object_offset;
1566 * Drop the reference count on backing_object. Since
1567 * its ref_count was at least 2, it will not vanish;
1568 * so we don't need to call vm_object_deallocate, but
1571 vm_object_deallocate_locked(backing_object);
1576 * Try again with this object's new backing object.
1582 * Removes all physical pages in the specified object range from the
1583 * object's list of pages.
1587 static int vm_object_page_remove_callback(vm_page_t p, void *data);
1590 vm_object_page_remove(vm_object_t object, vm_pindex_t start, vm_pindex_t end,
1591 boolean_t clean_only)
1593 struct rb_vm_page_scan_info info;
1597 * Degenerate cases and assertions
1599 lwkt_gettoken(&vm_token);
1600 if (object == NULL ||
1601 (object->resident_page_count == 0 && object->swblock_count == 0)) {
1602 lwkt_reltoken(&vm_token);
1605 KASSERT(object->type != OBJT_PHYS,
1606 ("attempt to remove pages from a physical object"));
1609 * Indicate that paging is occuring on the object
1612 vm_object_pip_add(object, 1);
1615 * Figure out the actual removal range and whether we are removing
1616 * the entire contents of the object or not. If removing the entire
1617 * contents, be sure to get all pages, even those that might be
1618 * beyond the end of the object.
1620 info.start_pindex = start;
1622 info.end_pindex = (vm_pindex_t)-1;
1624 info.end_pindex = end - 1;
1625 info.limit = clean_only;
1626 all = (start == 0 && info.end_pindex >= object->size - 1);
1629 * Loop until we are sure we have gotten them all.
1633 vm_page_rb_tree_RB_SCAN(&object->rb_memq, rb_vm_page_scancmp,
1634 vm_object_page_remove_callback, &info);
1635 } while (info.error);
1638 * Remove any related swap if throwing away pages, or for
1639 * non-swap objects (the swap is a clean copy in that case).
1641 if (object->type != OBJT_SWAP || clean_only == FALSE) {
1643 swap_pager_freespace_all(object);
1645 swap_pager_freespace(object, info.start_pindex,
1646 info.end_pindex - info.start_pindex + 1);
1652 vm_object_pip_wakeup(object);
1654 lwkt_reltoken(&vm_token);
1658 * The caller must hold vm_token.
1661 vm_object_page_remove_callback(vm_page_t p, void *data)
1663 struct rb_vm_page_scan_info *info = data;
1666 * Wired pages cannot be destroyed, but they can be invalidated
1667 * and we do so if clean_only (limit) is not set.
1669 * WARNING! The page may be wired due to being part of a buffer
1670 * cache buffer, and the buffer might be marked B_CACHE.
1671 * This is fine as part of a truncation but VFSs must be
1672 * sure to fix the buffer up when re-extending the file.
1674 if (p->wire_count != 0) {
1675 vm_page_protect(p, VM_PROT_NONE);
1676 if (info->limit == 0)
1682 * The busy flags are only cleared at
1683 * interrupt -- minimize the spl transitions
1686 if (vm_page_sleep_busy(p, TRUE, "vmopar")) {
1692 * limit is our clean_only flag. If set and the page is dirty, do
1693 * not free it. If set and the page is being held by someone, do
1696 if (info->limit && p->valid) {
1697 vm_page_test_dirty(p);
1698 if (p->valid & p->dirty)
1708 vm_page_protect(p, VM_PROT_NONE);
1714 * Coalesces two objects backing up adjoining regions of memory into a
1717 * returns TRUE if objects were combined.
1719 * NOTE: Only works at the moment if the second object is NULL -
1720 * if it's not, which object do we lock first?
1723 * prev_object First object to coalesce
1724 * prev_offset Offset into prev_object
1725 * next_object Second object into coalesce
1726 * next_offset Offset into next_object
1728 * prev_size Size of reference to prev_object
1729 * next_size Size of reference to next_object
1731 * The object must not be locked.
1732 * The caller must hold vm_token and vmobj_token.
1735 vm_object_coalesce(vm_object_t prev_object, vm_pindex_t prev_pindex,
1736 vm_size_t prev_size, vm_size_t next_size)
1738 vm_pindex_t next_pindex;
1740 ASSERT_LWKT_TOKEN_HELD(&vm_token);
1741 ASSERT_LWKT_TOKEN_HELD(&vmobj_token);
1743 if (prev_object == NULL) {
1747 vm_object_lock(prev_object);
1748 if (prev_object->type != OBJT_DEFAULT &&
1749 prev_object->type != OBJT_SWAP) {
1750 vm_object_unlock(prev_object);
1755 * Try to collapse the object first
1757 vm_object_collapse(prev_object);
1760 * Can't coalesce if: . more than one reference . paged out . shadows
1761 * another object . has a copy elsewhere (any of which mean that the
1762 * pages not mapped to prev_entry may be in use anyway)
1765 if (prev_object->backing_object != NULL) {
1766 vm_object_unlock(prev_object);
1770 prev_size >>= PAGE_SHIFT;
1771 next_size >>= PAGE_SHIFT;
1772 next_pindex = prev_pindex + prev_size;
1774 if ((prev_object->ref_count > 1) &&
1775 (prev_object->size != next_pindex)) {
1776 vm_object_unlock(prev_object);
1781 * Remove any pages that may still be in the object from a previous
1784 if (next_pindex < prev_object->size) {
1785 vm_object_page_remove(prev_object,
1787 next_pindex + next_size, FALSE);
1788 if (prev_object->type == OBJT_SWAP)
1789 swap_pager_freespace(prev_object,
1790 next_pindex, next_size);
1794 * Extend the object if necessary.
1796 if (next_pindex + next_size > prev_object->size)
1797 prev_object->size = next_pindex + next_size;
1799 vm_object_unlock(prev_object);
1804 * Make the object writable and flag is being possibly dirty.
1809 vm_object_set_writeable_dirty(vm_object_t object)
1813 lwkt_gettoken(&vm_token);
1814 vm_object_set_flag(object, OBJ_WRITEABLE|OBJ_MIGHTBEDIRTY);
1815 if (object->type == OBJT_VNODE &&
1816 (vp = (struct vnode *)object->handle) != NULL) {
1817 if ((vp->v_flag & VOBJDIRTY) == 0) {
1818 vsetflags(vp, VOBJDIRTY);
1821 lwkt_reltoken(&vm_token);
1825 vm_object_lock(vm_object_t object)
1827 lwkt_gettoken(&object->tok);
1831 vm_object_unlock(vm_object_t object)
1833 lwkt_reltoken(&object->tok);
1836 #include "opt_ddb.h"
1838 #include <sys/kernel.h>
1840 #include <sys/cons.h>
1842 #include <ddb/ddb.h>
1844 static int _vm_object_in_map (vm_map_t map, vm_object_t object,
1845 vm_map_entry_t entry);
1846 static int vm_object_in_map (vm_object_t object);
1849 * The caller must hold vm_token.
1852 _vm_object_in_map(vm_map_t map, vm_object_t object, vm_map_entry_t entry)
1855 vm_map_entry_t tmpe;
1862 tmpe = map->header.next;
1863 entcount = map->nentries;
1864 while (entcount-- && (tmpe != &map->header)) {
1865 if( _vm_object_in_map(map, object, tmpe)) {
1872 switch(entry->maptype) {
1873 case VM_MAPTYPE_SUBMAP:
1874 tmpm = entry->object.sub_map;
1875 tmpe = tmpm->header.next;
1876 entcount = tmpm->nentries;
1877 while (entcount-- && tmpe != &tmpm->header) {
1878 if( _vm_object_in_map(tmpm, object, tmpe)) {
1884 case VM_MAPTYPE_NORMAL:
1885 case VM_MAPTYPE_VPAGETABLE:
1886 obj = entry->object.vm_object;
1890 obj = obj->backing_object;
1899 static int vm_object_in_map_callback(struct proc *p, void *data);
1901 struct vm_object_in_map_info {
1910 vm_object_in_map(vm_object_t object)
1912 struct vm_object_in_map_info info;
1915 info.object = object;
1917 allproc_scan(vm_object_in_map_callback, &info);
1920 if( _vm_object_in_map(&kernel_map, object, 0))
1922 if( _vm_object_in_map(&pager_map, object, 0))
1924 if( _vm_object_in_map(&buffer_map, object, 0))
1933 vm_object_in_map_callback(struct proc *p, void *data)
1935 struct vm_object_in_map_info *info = data;
1938 if (_vm_object_in_map(&p->p_vmspace->vm_map, info->object, 0)) {
1946 DB_SHOW_COMMAND(vmochk, vm_object_check)
1951 * make sure that internal objs are in a map somewhere
1952 * and none have zero ref counts.
1954 for (object = TAILQ_FIRST(&vm_object_list);
1956 object = TAILQ_NEXT(object, object_list)) {
1957 if (object->type == OBJT_MARKER)
1959 if (object->handle == NULL &&
1960 (object->type == OBJT_DEFAULT || object->type == OBJT_SWAP)) {
1961 if (object->ref_count == 0) {
1962 db_printf("vmochk: internal obj has zero ref count: %ld\n",
1963 (long)object->size);
1965 if (!vm_object_in_map(object)) {
1967 "vmochk: internal obj is not in a map: "
1968 "ref: %d, size: %lu: 0x%lx, backing_object: %p\n",
1969 object->ref_count, (u_long)object->size,
1970 (u_long)object->size,
1971 (void *)object->backing_object);
1980 DB_SHOW_COMMAND(object, vm_object_print_static)
1982 /* XXX convert args. */
1983 vm_object_t object = (vm_object_t)addr;
1984 boolean_t full = have_addr;
1988 /* XXX count is an (unused) arg. Avoid shadowing it. */
1989 #define count was_count
1997 "Object %p: type=%d, size=0x%lx, res=%d, ref=%d, flags=0x%x\n",
1998 object, (int)object->type, (u_long)object->size,
1999 object->resident_page_count, object->ref_count, object->flags);
2001 * XXX no %qd in kernel. Truncate object->backing_object_offset.
2003 db_iprintf(" sref=%d, backing_object(%d)=(%p)+0x%lx\n",
2004 object->shadow_count,
2005 object->backing_object ? object->backing_object->ref_count : 0,
2006 object->backing_object, (long)object->backing_object_offset);
2013 RB_FOREACH(p, vm_page_rb_tree, &object->rb_memq) {
2015 db_iprintf("memory:=");
2016 else if (count == 6) {
2024 db_printf("(off=0x%lx,page=0x%lx)",
2025 (u_long) p->pindex, (u_long) VM_PAGE_TO_PHYS(p));
2036 * XXX need this non-static entry for calling from vm_map_print.
2041 vm_object_print(/* db_expr_t */ long addr,
2042 boolean_t have_addr,
2043 /* db_expr_t */ long count,
2046 vm_object_print_static(addr, have_addr, count, modif);
2052 DB_SHOW_COMMAND(vmopag, vm_object_print_pages)
2057 for (object = TAILQ_FIRST(&vm_object_list);
2059 object = TAILQ_NEXT(object, object_list)) {
2060 vm_pindex_t idx, fidx;
2062 vm_paddr_t pa = -1, padiff;
2066 if (object->type == OBJT_MARKER)
2068 db_printf("new object: %p\n", (void *)object);
2078 osize = object->size;
2081 for (idx = 0; idx < osize; idx++) {
2082 m = vm_page_lookup(object, idx);
2085 db_printf(" index(%ld)run(%d)pa(0x%lx)\n",
2086 (long)fidx, rcount, (long)pa);
2101 (VM_PAGE_TO_PHYS(m) == pa + rcount * PAGE_SIZE)) {
2106 padiff = pa + rcount * PAGE_SIZE - VM_PAGE_TO_PHYS(m);
2107 padiff >>= PAGE_SHIFT;
2108 padiff &= PQ_L2_MASK;
2110 pa = VM_PAGE_TO_PHYS(m) - rcount * PAGE_SIZE;
2114 db_printf(" index(%ld)run(%d)pa(0x%lx)",
2115 (long)fidx, rcount, (long)pa);
2116 db_printf("pd(%ld)\n", (long)padiff);
2126 pa = VM_PAGE_TO_PHYS(m);
2130 db_printf(" index(%ld)run(%d)pa(0x%lx)\n",
2131 (long)fidx, rcount, (long)pa);