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);
191 lwkt_gettoken(&vmobj_token);
192 TAILQ_INSERT_TAIL(&vm_object_list, object, object_list);
194 object_hash_rand = object->hash_rand;
195 lwkt_reltoken(&vmobj_token);
199 * Initialize the VM objects module.
201 * Called from the low level boot code only.
206 TAILQ_INIT(&vm_object_list);
208 _vm_object_allocate(OBJT_DEFAULT, OFF_TO_IDX(KvaEnd),
211 obj_zone = &obj_zone_store;
212 zbootinit(obj_zone, "VM OBJECT", sizeof (struct vm_object),
213 vm_objects_init, VM_OBJECTS_INIT);
217 vm_object_init2(void)
219 zinitna(obj_zone, NULL, NULL, 0, 0, ZONE_PANICFAIL, 1);
223 * Allocate and return a new object of the specified type and size.
228 vm_object_allocate(objtype_t type, vm_pindex_t size)
232 result = (vm_object_t) zalloc(obj_zone);
234 _vm_object_allocate(type, size, result);
240 * Add an additional reference to a vm_object.
242 * Object passed by caller must be stable or caller must already
243 * hold vmobj_token to avoid races.
246 vm_object_reference(vm_object_t object)
249 lwkt_gettoken(&vmobj_token);
251 if (object->type == OBJT_VNODE) {
252 vref(object->handle);
253 /* XXX what if the vnode is being destroyed? */
255 lwkt_reltoken(&vmobj_token);
260 vm_object_reference_locked(vm_object_t object)
263 ASSERT_LWKT_TOKEN_HELD(&vmobj_token);
265 if (object->type == OBJT_VNODE) {
266 vref(object->handle);
267 /* XXX what if the vnode is being destroyed? */
273 * Dereference an object and its underlying vnode.
275 * The caller must hold vmobj_token.
278 vm_object_vndeallocate(vm_object_t object)
280 struct vnode *vp = (struct vnode *) object->handle;
282 KASSERT(object->type == OBJT_VNODE,
283 ("vm_object_vndeallocate: not a vnode object"));
284 KASSERT(vp != NULL, ("vm_object_vndeallocate: missing vp"));
285 ASSERT_LWKT_TOKEN_HELD(&vmobj_token);
287 if (object->ref_count == 0) {
288 vprint("vm_object_vndeallocate", vp);
289 panic("vm_object_vndeallocate: bad object reference count");
294 if (object->ref_count == 0)
295 vclrflags(vp, VTEXT);
300 * Release a reference to the specified object, gained either through a
301 * vm_object_allocate or a vm_object_reference call. When all references
302 * are gone, storage associated with this object may be relinquished.
305 vm_object_deallocate(vm_object_t object)
307 lwkt_gettoken(&vmobj_token);
308 vm_object_deallocate_locked(object);
309 lwkt_reltoken(&vmobj_token);
313 vm_object_deallocate_locked(vm_object_t object)
317 ASSERT_LWKT_TOKEN_HELD(&vmobj_token);
319 while (object != NULL) {
320 if (object->type == OBJT_VNODE) {
321 vm_object_vndeallocate(object);
325 if (object->ref_count == 0) {
326 panic("vm_object_deallocate: object deallocated "
327 "too many times: %d", object->type);
329 if (object->ref_count > 2) {
335 * We currently need the vm_token from this point on, and
336 * we must recheck ref_count after acquiring it.
338 lwkt_gettoken(&vm_token);
340 if (object->ref_count > 2) {
342 lwkt_reltoken(&vm_token);
347 * Here on ref_count of one or two, which are special cases for
350 if ((object->ref_count == 2) && (object->shadow_count == 0)) {
351 vm_object_set_flag(object, OBJ_ONEMAPPING);
353 lwkt_reltoken(&vm_token);
356 if ((object->ref_count == 2) && (object->shadow_count == 1)) {
358 if ((object->handle == NULL) &&
359 (object->type == OBJT_DEFAULT ||
360 object->type == OBJT_SWAP)) {
363 robject = LIST_FIRST(&object->shadow_head);
364 KASSERT(robject != NULL,
365 ("vm_object_deallocate: ref_count: "
366 "%d, shadow_count: %d",
368 object->shadow_count));
370 if ((robject->handle == NULL) &&
371 (robject->type == OBJT_DEFAULT ||
372 robject->type == OBJT_SWAP)) {
374 robject->ref_count++;
377 robject->paging_in_progress ||
378 object->paging_in_progress
380 vm_object_pip_sleep(robject, "objde1");
381 vm_object_pip_sleep(object, "objde2");
384 if (robject->ref_count == 1) {
385 robject->ref_count--;
391 vm_object_collapse(object);
392 lwkt_reltoken(&vm_token);
396 lwkt_reltoken(&vm_token);
401 * Normal dereferencing path
404 if (object->ref_count != 0) {
405 lwkt_reltoken(&vm_token);
413 temp = object->backing_object;
415 LIST_REMOVE(object, shadow_list);
416 temp->shadow_count--;
418 object->backing_object = NULL;
420 lwkt_reltoken(&vm_token);
423 * Don't double-terminate, we could be in a termination
424 * recursion due to the terminate having to sync data
427 if ((object->flags & OBJ_DEAD) == 0)
428 vm_object_terminate(object);
434 * Destroy the specified object, freeing up related resources.
436 * The object must have zero references.
438 * The caller must be holding vmobj_token and properly interlock with
441 static int vm_object_terminate_callback(vm_page_t p, void *data);
444 vm_object_terminate(vm_object_t object)
447 * Make sure no one uses us. Once we set OBJ_DEAD we should be
448 * able to safely block.
450 KKASSERT((object->flags & OBJ_DEAD) == 0);
451 ASSERT_LWKT_TOKEN_HELD(&vmobj_token);
452 vm_object_set_flag(object, OBJ_DEAD);
455 * Wait for the pageout daemon to be done with the object
457 vm_object_pip_wait(object, "objtrm");
459 KASSERT(!object->paging_in_progress,
460 ("vm_object_terminate: pageout in progress"));
463 * Clean and free the pages, as appropriate. All references to the
464 * object are gone, so we don't need to lock it.
466 if (object->type == OBJT_VNODE) {
470 * Clean pages and flush buffers.
472 vm_object_page_clean(object, 0, 0, OBJPC_SYNC);
474 vp = (struct vnode *) object->handle;
475 vinvalbuf(vp, V_SAVE, 0, 0);
479 * Wait for any I/O to complete, after which there had better not
480 * be any references left on the object.
482 vm_object_pip_wait(object, "objtrm");
484 if (object->ref_count != 0) {
485 panic("vm_object_terminate: object with references, "
486 "ref_count=%d", object->ref_count);
490 * Now free any remaining pages. For internal objects, this also
491 * removes them from paging queues. Don't free wired pages, just
492 * remove them from the object.
494 lwkt_gettoken(&vm_token);
495 vm_page_rb_tree_RB_SCAN(&object->rb_memq, NULL,
496 vm_object_terminate_callback, NULL);
497 lwkt_reltoken(&vm_token);
500 * Let the pager know object is dead.
502 vm_pager_deallocate(object);
505 * Remove the object from the global object list.
507 * (we are holding vmobj_token)
509 TAILQ_REMOVE(&vm_object_list, object, object_list);
511 vm_object_dead_wakeup(object);
513 if (object->ref_count != 0) {
514 panic("vm_object_terminate2: object with references, "
515 "ref_count=%d", object->ref_count);
519 * Free the space for the object.
521 zfree(obj_zone, object);
525 * The caller must hold vm_token.
528 vm_object_terminate_callback(vm_page_t p, void *data __unused)
530 if (p->busy || (p->flags & PG_BUSY))
531 panic("vm_object_terminate: freeing busy page %p", p);
532 if (p->wire_count == 0) {
535 mycpu->gd_cnt.v_pfree++;
537 if (p->queue != PQ_NONE)
538 kprintf("vm_object_terminate: Warning: Encountered wired page %p on queue %d\n", p, p->queue);
547 * The object is dead but still has an object<->pager association. Sleep
548 * and return. The caller typically retests the association in a loop.
550 * Must be called with the vmobj_token held.
553 vm_object_dead_sleep(vm_object_t object, const char *wmesg)
555 ASSERT_LWKT_TOKEN_HELD(&vmobj_token);
556 if (object->handle) {
557 vm_object_set_flag(object, OBJ_DEADWNT);
558 tsleep(object, 0, wmesg, 0);
559 /* object may be invalid after this point */
564 * Wakeup anyone waiting for the object<->pager disassociation on
567 * Must be called with the vmobj_token held.
570 vm_object_dead_wakeup(vm_object_t object)
572 ASSERT_LWKT_TOKEN_HELD(&vmobj_token);
573 if (object->flags & OBJ_DEADWNT) {
574 vm_object_clear_flag(object, OBJ_DEADWNT);
580 * Clean all dirty pages in the specified range of object. Leaves page
581 * on whatever queue it is currently on. If NOSYNC is set then do not
582 * write out pages with PG_NOSYNC set (originally comes from MAP_NOSYNC),
583 * leaving the object dirty.
585 * When stuffing pages asynchronously, allow clustering. XXX we need a
586 * synchronous clustering mode implementation.
588 * Odd semantics: if start == end, we clean everything.
590 * The object must be locked? XXX
592 static int vm_object_page_clean_pass1(struct vm_page *p, void *data);
593 static int vm_object_page_clean_pass2(struct vm_page *p, void *data);
596 vm_object_page_clean(vm_object_t object, vm_pindex_t start, vm_pindex_t end,
599 struct rb_vm_page_scan_info info;
605 lwkt_gettoken(&vm_token);
606 if (object->type != OBJT_VNODE ||
607 (object->flags & OBJ_MIGHTBEDIRTY) == 0) {
608 lwkt_reltoken(&vm_token);
612 pagerflags = (flags & (OBJPC_SYNC | OBJPC_INVAL)) ?
613 VM_PAGER_PUT_SYNC : VM_PAGER_CLUSTER_OK;
614 pagerflags |= (flags & OBJPC_INVAL) ? VM_PAGER_PUT_INVAL : 0;
619 * Interlock other major object operations. This allows us to
620 * temporarily clear OBJ_WRITEABLE and OBJ_MIGHTBEDIRTY.
623 vm_object_set_flag(object, OBJ_CLEANING);
626 * Handle 'entire object' case
628 info.start_pindex = start;
630 info.end_pindex = object->size - 1;
632 info.end_pindex = end - 1;
634 wholescan = (start == 0 && info.end_pindex == object->size - 1);
636 info.pagerflags = pagerflags;
637 info.object = object;
640 * If cleaning the entire object do a pass to mark the pages read-only.
641 * If everything worked out ok, clear OBJ_WRITEABLE and
646 vm_page_rb_tree_RB_SCAN(&object->rb_memq, rb_vm_page_scancmp,
647 vm_object_page_clean_pass1, &info);
648 if (info.error == 0) {
649 vm_object_clear_flag(object,
650 OBJ_WRITEABLE|OBJ_MIGHTBEDIRTY);
651 if (object->type == OBJT_VNODE &&
652 (vp = (struct vnode *)object->handle) != NULL) {
653 if (vp->v_flag & VOBJDIRTY)
654 vclrflags(vp, VOBJDIRTY);
660 * Do a pass to clean all the dirty pages we find.
664 curgeneration = object->generation;
665 vm_page_rb_tree_RB_SCAN(&object->rb_memq, rb_vm_page_scancmp,
666 vm_object_page_clean_pass2, &info);
667 } while (info.error || curgeneration != object->generation);
669 vm_object_clear_flag(object, OBJ_CLEANING);
671 lwkt_reltoken(&vm_token);
675 * The caller must hold vm_token.
679 vm_object_page_clean_pass1(struct vm_page *p, void *data)
681 struct rb_vm_page_scan_info *info = data;
683 vm_page_flag_set(p, PG_CLEANCHK);
684 if ((info->limit & OBJPC_NOSYNC) && (p->flags & PG_NOSYNC))
687 vm_page_protect(p, VM_PROT_READ); /* must not block */
692 * The caller must hold vm_token.
696 vm_object_page_clean_pass2(struct vm_page *p, void *data)
698 struct rb_vm_page_scan_info *info = data;
702 * Do not mess with pages that were inserted after we started
705 if ((p->flags & PG_CLEANCHK) == 0)
709 * Before wasting time traversing the pmaps, check for trivial
710 * cases where the page cannot be dirty.
712 if (p->valid == 0 || (p->queue - p->pc) == PQ_CACHE) {
713 KKASSERT((p->dirty & p->valid) == 0);
718 * Check whether the page is dirty or not. The page has been set
719 * to be read-only so the check will not race a user dirtying the
722 vm_page_test_dirty(p);
723 if ((p->dirty & p->valid) == 0) {
724 vm_page_flag_clear(p, PG_CLEANCHK);
729 * If we have been asked to skip nosync pages and this is a
730 * nosync page, skip it. Note that the object flags were
731 * not cleared in this case (because pass1 will have returned an
732 * error), so we do not have to set them.
734 if ((info->limit & OBJPC_NOSYNC) && (p->flags & PG_NOSYNC)) {
735 vm_page_flag_clear(p, PG_CLEANCHK);
740 * Flush as many pages as we can. PG_CLEANCHK will be cleared on
741 * the pages that get successfully flushed. Set info->error if
742 * we raced an object modification.
744 n = vm_object_page_collect_flush(info->object, p, info->pagerflags);
751 * Collect the specified page and nearby pages and flush them out.
752 * The number of pages flushed is returned.
754 * The caller must hold vm_token.
757 vm_object_page_collect_flush(vm_object_t object, vm_page_t p, int pagerflags)
766 vm_page_t maf[vm_pageout_page_count];
767 vm_page_t mab[vm_pageout_page_count];
768 vm_page_t ma[vm_pageout_page_count];
770 curgeneration = object->generation;
773 while (vm_page_sleep_busy(p, TRUE, "vpcwai")) {
774 if (object->generation != curgeneration) {
778 KKASSERT(p->object == object && p->pindex == pi);
781 for(i = 1; i < vm_pageout_page_count; i++) {
784 if ((tp = vm_page_lookup(object, pi + i)) != NULL) {
785 if ((tp->flags & PG_BUSY) ||
786 ((pagerflags & VM_PAGER_IGNORE_CLEANCHK) == 0 &&
787 (tp->flags & PG_CLEANCHK) == 0) ||
790 if((tp->queue - tp->pc) == PQ_CACHE) {
791 vm_page_flag_clear(tp, PG_CLEANCHK);
794 vm_page_test_dirty(tp);
795 if ((tp->dirty & tp->valid) == 0) {
796 vm_page_flag_clear(tp, PG_CLEANCHK);
807 chkb = vm_pageout_page_count - maxf;
809 for(i = 1; i < chkb;i++) {
812 if ((tp = vm_page_lookup(object, pi - i)) != NULL) {
813 if ((tp->flags & PG_BUSY) ||
814 ((pagerflags & VM_PAGER_IGNORE_CLEANCHK) == 0 &&
815 (tp->flags & PG_CLEANCHK) == 0) ||
818 if((tp->queue - tp->pc) == PQ_CACHE) {
819 vm_page_flag_clear(tp, PG_CLEANCHK);
822 vm_page_test_dirty(tp);
823 if ((tp->dirty & tp->valid) == 0) {
824 vm_page_flag_clear(tp, PG_CLEANCHK);
835 for(i = 0; i < maxb; i++) {
836 int index = (maxb - i) - 1;
838 vm_page_flag_clear(ma[index], PG_CLEANCHK);
840 vm_page_flag_clear(p, PG_CLEANCHK);
842 for(i = 0; i < maxf; i++) {
843 int index = (maxb + i) + 1;
845 vm_page_flag_clear(ma[index], PG_CLEANCHK);
847 runlen = maxb + maxf + 1;
849 vm_pageout_flush(ma, runlen, pagerflags);
850 for (i = 0; i < runlen; i++) {
851 if (ma[i]->valid & ma[i]->dirty) {
852 vm_page_protect(ma[i], VM_PROT_READ);
853 vm_page_flag_set(ma[i], PG_CLEANCHK);
856 * maxf will end up being the actual number of pages
857 * we wrote out contiguously, non-inclusive of the
858 * first page. We do not count look-behind pages.
860 if (i >= maxb + 1 && (maxf > i - maxb - 1))
868 * Same as vm_object_pmap_copy, except range checking really
869 * works, and is meant for small sections of an object.
871 * This code protects resident pages by making them read-only
872 * and is typically called on a fork or split when a page
873 * is converted to copy-on-write.
875 * NOTE: If the page is already at VM_PROT_NONE, calling
876 * vm_page_protect will have no effect.
879 vm_object_pmap_copy_1(vm_object_t object, vm_pindex_t start, vm_pindex_t end)
884 if (object == NULL || (object->flags & OBJ_WRITEABLE) == 0)
888 * spl protection needed to prevent races between the lookup,
889 * an interrupt unbusy/free, and our protect call.
892 lwkt_gettoken(&vm_token);
893 for (idx = start; idx < end; idx++) {
894 p = vm_page_lookup(object, idx);
897 vm_page_protect(p, VM_PROT_READ);
899 lwkt_reltoken(&vm_token);
904 * Removes all physical pages in the specified object range from all
907 * The object must *not* be locked.
910 static int vm_object_pmap_remove_callback(vm_page_t p, void *data);
913 vm_object_pmap_remove(vm_object_t object, vm_pindex_t start, vm_pindex_t end)
915 struct rb_vm_page_scan_info info;
919 info.start_pindex = start;
920 info.end_pindex = end - 1;
923 lwkt_gettoken(&vm_token);
924 vm_page_rb_tree_RB_SCAN(&object->rb_memq, rb_vm_page_scancmp,
925 vm_object_pmap_remove_callback, &info);
926 if (start == 0 && end == object->size)
927 vm_object_clear_flag(object, OBJ_WRITEABLE);
928 lwkt_reltoken(&vm_token);
933 * The caller must hold vm_token.
936 vm_object_pmap_remove_callback(vm_page_t p, void *data __unused)
938 vm_page_protect(p, VM_PROT_NONE);
943 * Implements the madvise function at the object/page level.
945 * MADV_WILLNEED (any object)
947 * Activate the specified pages if they are resident.
949 * MADV_DONTNEED (any object)
951 * Deactivate the specified pages if they are resident.
953 * MADV_FREE (OBJT_DEFAULT/OBJT_SWAP objects, OBJ_ONEMAPPING only)
955 * Deactivate and clean the specified pages if they are
956 * resident. This permits the process to reuse the pages
957 * without faulting or the kernel to reclaim the pages
963 vm_object_madvise(vm_object_t object, vm_pindex_t pindex, int count, int advise)
965 vm_pindex_t end, tpindex;
972 end = pindex + count;
974 lwkt_gettoken(&vm_token);
977 * Locate and adjust resident pages
979 for (; pindex < end; pindex += 1) {
985 * MADV_FREE only operates on OBJT_DEFAULT or OBJT_SWAP pages
986 * and those pages must be OBJ_ONEMAPPING.
988 if (advise == MADV_FREE) {
989 if ((tobject->type != OBJT_DEFAULT &&
990 tobject->type != OBJT_SWAP) ||
991 (tobject->flags & OBJ_ONEMAPPING) == 0) {
997 * spl protection is required to avoid a race between the
998 * lookup, an interrupt unbusy/free, and our busy check.
1002 m = vm_page_lookup(tobject, tpindex);
1006 * There may be swap even if there is no backing page
1008 if (advise == MADV_FREE && tobject->type == OBJT_SWAP)
1009 swap_pager_freespace(tobject, tpindex, 1);
1015 if (tobject->backing_object == NULL)
1017 tpindex += OFF_TO_IDX(tobject->backing_object_offset);
1018 tobject = tobject->backing_object;
1023 * If the page is busy or not in a normal active state,
1024 * we skip it. If the page is not managed there are no
1025 * page queues to mess with. Things can break if we mess
1026 * with pages in any of the below states.
1031 (m->flags & PG_UNMANAGED) ||
1032 m->valid != VM_PAGE_BITS_ALL
1038 if (vm_page_sleep_busy(m, TRUE, "madvpo")) {
1046 * Theoretically once a page is known not to be busy, an
1047 * interrupt cannot come along and rip it out from under us.
1050 if (advise == MADV_WILLNEED) {
1051 vm_page_activate(m);
1052 } else if (advise == MADV_DONTNEED) {
1053 vm_page_dontneed(m);
1054 } else if (advise == MADV_FREE) {
1056 * Mark the page clean. This will allow the page
1057 * to be freed up by the system. However, such pages
1058 * are often reused quickly by malloc()/free()
1059 * so we do not do anything that would cause
1060 * a page fault if we can help it.
1062 * Specifically, we do not try to actually free
1063 * the page now nor do we try to put it in the
1064 * cache (which would cause a page fault on reuse).
1066 * But we do make the page is freeable as we
1067 * can without actually taking the step of unmapping
1070 pmap_clear_modify(m);
1073 vm_page_dontneed(m);
1074 if (tobject->type == OBJT_SWAP)
1075 swap_pager_freespace(tobject, tpindex, 1);
1079 lwkt_reltoken(&vm_token);
1083 * Create a new object which is backed by the specified existing object
1084 * range. The source object reference is deallocated.
1086 * The new object and offset into that object are returned in the source
1089 * No other requirements.
1092 vm_object_shadow(vm_object_t *object, vm_ooffset_t *offset, vm_size_t length)
1100 * Don't create the new object if the old object isn't shared.
1102 lwkt_gettoken(&vm_token);
1104 if (source != NULL &&
1105 source->ref_count == 1 &&
1106 source->handle == NULL &&
1107 (source->type == OBJT_DEFAULT ||
1108 source->type == OBJT_SWAP)) {
1109 lwkt_reltoken(&vm_token);
1114 * Allocate a new object with the given length
1117 if ((result = vm_object_allocate(OBJT_DEFAULT, length)) == NULL)
1118 panic("vm_object_shadow: no object for shadowing");
1121 * The new object shadows the source object, adding a reference to it.
1122 * Our caller changes his reference to point to the new object,
1123 * removing a reference to the source object. Net result: no change
1124 * of reference count.
1126 * Try to optimize the result object's page color when shadowing
1127 * in order to maintain page coloring consistency in the combined
1130 result->backing_object = source;
1132 LIST_INSERT_HEAD(&source->shadow_head, result, shadow_list);
1133 source->shadow_count++;
1134 source->generation++;
1135 result->pg_color = (source->pg_color + OFF_TO_IDX(*offset)) & PQ_L2_MASK;
1139 * Store the offset into the source object, and fix up the offset into
1142 result->backing_object_offset = *offset;
1143 lwkt_reltoken(&vm_token);
1146 * Return the new things
1152 #define OBSC_TEST_ALL_SHADOWED 0x0001
1153 #define OBSC_COLLAPSE_NOWAIT 0x0002
1154 #define OBSC_COLLAPSE_WAIT 0x0004
1156 static int vm_object_backing_scan_callback(vm_page_t p, void *data);
1159 * The caller must hold vm_token.
1162 vm_object_backing_scan(vm_object_t object, int op)
1164 struct rb_vm_page_scan_info info;
1165 vm_object_t backing_object;
1169 backing_object = object->backing_object;
1170 info.backing_offset_index = OFF_TO_IDX(object->backing_object_offset);
1173 * Initial conditions
1176 if (op & OBSC_TEST_ALL_SHADOWED) {
1178 * We do not want to have to test for the existence of
1179 * swap pages in the backing object. XXX but with the
1180 * new swapper this would be pretty easy to do.
1182 * XXX what about anonymous MAP_SHARED memory that hasn't
1183 * been ZFOD faulted yet? If we do not test for this, the
1184 * shadow test may succeed! XXX
1186 if (backing_object->type != OBJT_DEFAULT) {
1191 if (op & OBSC_COLLAPSE_WAIT) {
1192 KKASSERT((backing_object->flags & OBJ_DEAD) == 0);
1193 vm_object_set_flag(backing_object, OBJ_DEAD);
1197 * Our scan. We have to retry if a negative error code is returned,
1198 * otherwise 0 or 1 will be returned in info.error. 0 Indicates that
1199 * the scan had to be stopped because the parent does not completely
1202 info.object = object;
1203 info.backing_object = backing_object;
1207 vm_page_rb_tree_RB_SCAN(&backing_object->rb_memq, NULL,
1208 vm_object_backing_scan_callback,
1210 } while (info.error < 0);
1216 * The caller must hold vm_token.
1219 vm_object_backing_scan_callback(vm_page_t p, void *data)
1221 struct rb_vm_page_scan_info *info = data;
1222 vm_object_t backing_object;
1224 vm_pindex_t new_pindex;
1225 vm_pindex_t backing_offset_index;
1228 new_pindex = p->pindex - info->backing_offset_index;
1230 object = info->object;
1231 backing_object = info->backing_object;
1232 backing_offset_index = info->backing_offset_index;
1234 if (op & OBSC_TEST_ALL_SHADOWED) {
1238 * Ignore pages outside the parent object's range
1239 * and outside the parent object's mapping of the
1242 * note that we do not busy the backing object's
1246 p->pindex < backing_offset_index ||
1247 new_pindex >= object->size
1253 * See if the parent has the page or if the parent's
1254 * object pager has the page. If the parent has the
1255 * page but the page is not valid, the parent's
1256 * object pager must have the page.
1258 * If this fails, the parent does not completely shadow
1259 * the object and we might as well give up now.
1262 pp = vm_page_lookup(object, new_pindex);
1263 if ((pp == NULL || pp->valid == 0) &&
1264 !vm_pager_has_page(object, new_pindex)
1266 info->error = 0; /* problemo */
1267 return(-1); /* stop the scan */
1272 * Check for busy page
1275 if (op & (OBSC_COLLAPSE_WAIT | OBSC_COLLAPSE_NOWAIT)) {
1278 if (op & OBSC_COLLAPSE_NOWAIT) {
1280 (p->flags & PG_BUSY) ||
1288 } else if (op & OBSC_COLLAPSE_WAIT) {
1289 if (vm_page_sleep_busy(p, TRUE, "vmocol")) {
1291 * If we slept, anything could have
1292 * happened. Ask that the scan be restarted.
1294 * Since the object is marked dead, the
1295 * backing offset should not have changed.
1308 p->object == backing_object,
1309 ("vm_object_qcollapse(): object mismatch")
1313 * Destroy any associated swap
1315 if (backing_object->type == OBJT_SWAP)
1316 swap_pager_freespace(backing_object, p->pindex, 1);
1319 p->pindex < backing_offset_index ||
1320 new_pindex >= object->size
1323 * Page is out of the parent object's range, we
1324 * can simply destroy it.
1326 vm_page_protect(p, VM_PROT_NONE);
1331 pp = vm_page_lookup(object, new_pindex);
1332 if (pp != NULL || vm_pager_has_page(object, new_pindex)) {
1334 * page already exists in parent OR swap exists
1335 * for this location in the parent. Destroy
1336 * the original page from the backing object.
1338 * Leave the parent's page alone
1340 vm_page_protect(p, VM_PROT_NONE);
1346 * Page does not exist in parent, rename the
1347 * page from the backing object to the main object.
1349 * If the page was mapped to a process, it can remain
1350 * mapped through the rename.
1352 if ((p->queue - p->pc) == PQ_CACHE)
1353 vm_page_deactivate(p);
1355 vm_page_rename(p, object, new_pindex);
1356 /* page automatically made dirty by rename */
1362 * This version of collapse allows the operation to occur earlier and
1363 * when paging_in_progress is true for an object... This is not a complete
1364 * operation, but should plug 99.9% of the rest of the leaks.
1366 * The caller must hold vm_token and vmobj_token.
1367 * (only called from vm_object_collapse)
1370 vm_object_qcollapse(vm_object_t object)
1372 vm_object_t backing_object = object->backing_object;
1374 if (backing_object->ref_count != 1)
1377 backing_object->ref_count += 2;
1379 vm_object_backing_scan(object, OBSC_COLLAPSE_NOWAIT);
1381 backing_object->ref_count -= 2;
1385 * Collapse an object with the object backing it. Pages in the backing
1386 * object are moved into the parent, and the backing object is deallocated.
1389 vm_object_collapse(vm_object_t object)
1391 ASSERT_LWKT_TOKEN_HELD(&vm_token);
1392 ASSERT_LWKT_TOKEN_HELD(&vmobj_token);
1395 vm_object_t backing_object;
1398 * Verify that the conditions are right for collapse:
1400 * The object exists and the backing object exists.
1405 if ((backing_object = object->backing_object) == NULL)
1409 * we check the backing object first, because it is most likely
1412 if (backing_object->handle != NULL ||
1413 (backing_object->type != OBJT_DEFAULT &&
1414 backing_object->type != OBJT_SWAP) ||
1415 (backing_object->flags & OBJ_DEAD) ||
1416 object->handle != NULL ||
1417 (object->type != OBJT_DEFAULT &&
1418 object->type != OBJT_SWAP) ||
1419 (object->flags & OBJ_DEAD)) {
1424 object->paging_in_progress != 0 ||
1425 backing_object->paging_in_progress != 0
1427 vm_object_qcollapse(object);
1432 * We know that we can either collapse the backing object (if
1433 * the parent is the only reference to it) or (perhaps) have
1434 * the parent bypass the object if the parent happens to shadow
1435 * all the resident pages in the entire backing object.
1437 * This is ignoring pager-backed pages such as swap pages.
1438 * vm_object_backing_scan fails the shadowing test in this
1442 if (backing_object->ref_count == 1) {
1444 * If there is exactly one reference to the backing
1445 * object, we can collapse it into the parent.
1447 vm_object_backing_scan(object, OBSC_COLLAPSE_WAIT);
1450 * Move the pager from backing_object to object.
1453 if (backing_object->type == OBJT_SWAP) {
1454 vm_object_pip_add(backing_object, 1);
1457 * scrap the paging_offset junk and do a
1458 * discrete copy. This also removes major
1459 * assumptions about how the swap-pager
1460 * works from where it doesn't belong. The
1461 * new swapper is able to optimize the
1462 * destroy-source case.
1465 vm_object_pip_add(object, 1);
1469 OFF_TO_IDX(object->backing_object_offset), TRUE);
1470 vm_object_pip_wakeup(object);
1472 vm_object_pip_wakeup(backing_object);
1475 * Object now shadows whatever backing_object did.
1476 * Note that the reference to
1477 * backing_object->backing_object moves from within
1478 * backing_object to within object.
1481 LIST_REMOVE(object, shadow_list);
1482 object->backing_object->shadow_count--;
1483 object->backing_object->generation++;
1484 if (backing_object->backing_object) {
1485 LIST_REMOVE(backing_object, shadow_list);
1486 backing_object->backing_object->shadow_count--;
1487 backing_object->backing_object->generation++;
1489 object->backing_object = backing_object->backing_object;
1490 if (object->backing_object) {
1492 &object->backing_object->shadow_head,
1496 object->backing_object->shadow_count++;
1497 object->backing_object->generation++;
1500 object->backing_object_offset +=
1501 backing_object->backing_object_offset;
1504 * Discard backing_object.
1506 * Since the backing object has no pages, no pager left,
1507 * and no object references within it, all that is
1508 * necessary is to dispose of it.
1511 KASSERT(backing_object->ref_count == 1,
1512 ("backing_object %p was somehow "
1513 "re-referenced during collapse!",
1515 KASSERT(RB_EMPTY(&backing_object->rb_memq),
1516 ("backing_object %p somehow has left "
1517 "over pages during collapse!",
1520 /* (we are holding vmobj_token) */
1521 TAILQ_REMOVE(&vm_object_list, backing_object,
1525 zfree(obj_zone, backing_object);
1529 vm_object_t new_backing_object;
1532 * If we do not entirely shadow the backing object,
1533 * there is nothing we can do so we give up.
1536 if (vm_object_backing_scan(object, OBSC_TEST_ALL_SHADOWED) == 0) {
1541 * Make the parent shadow the next object in the
1542 * chain. Deallocating backing_object will not remove
1543 * it, since its reference count is at least 2.
1546 LIST_REMOVE(object, shadow_list);
1547 backing_object->shadow_count--;
1548 backing_object->generation++;
1550 new_backing_object = backing_object->backing_object;
1551 if ((object->backing_object = new_backing_object) != NULL) {
1552 vm_object_reference(new_backing_object);
1554 &new_backing_object->shadow_head,
1558 new_backing_object->shadow_count++;
1559 new_backing_object->generation++;
1560 object->backing_object_offset +=
1561 backing_object->backing_object_offset;
1565 * Drop the reference count on backing_object. Since
1566 * its ref_count was at least 2, it will not vanish;
1567 * so we don't need to call vm_object_deallocate, but
1570 vm_object_deallocate_locked(backing_object);
1575 * Try again with this object's new backing object.
1581 * Removes all physical pages in the specified object range from the
1582 * object's list of pages.
1586 static int vm_object_page_remove_callback(vm_page_t p, void *data);
1589 vm_object_page_remove(vm_object_t object, vm_pindex_t start, vm_pindex_t end,
1590 boolean_t clean_only)
1592 struct rb_vm_page_scan_info info;
1596 * Degenerate cases and assertions
1598 lwkt_gettoken(&vm_token);
1599 if (object == NULL ||
1600 (object->resident_page_count == 0 && object->swblock_count == 0)) {
1601 lwkt_reltoken(&vm_token);
1604 KASSERT(object->type != OBJT_PHYS,
1605 ("attempt to remove pages from a physical object"));
1608 * Indicate that paging is occuring on the object
1611 vm_object_pip_add(object, 1);
1614 * Figure out the actual removal range and whether we are removing
1615 * the entire contents of the object or not. If removing the entire
1616 * contents, be sure to get all pages, even those that might be
1617 * beyond the end of the object.
1619 info.start_pindex = start;
1621 info.end_pindex = (vm_pindex_t)-1;
1623 info.end_pindex = end - 1;
1624 info.limit = clean_only;
1625 all = (start == 0 && info.end_pindex >= object->size - 1);
1628 * Loop until we are sure we have gotten them all.
1632 vm_page_rb_tree_RB_SCAN(&object->rb_memq, rb_vm_page_scancmp,
1633 vm_object_page_remove_callback, &info);
1634 } while (info.error);
1637 * Remove any related swap if throwing away pages, or for
1638 * non-swap objects (the swap is a clean copy in that case).
1640 if (object->type != OBJT_SWAP || clean_only == FALSE) {
1642 swap_pager_freespace_all(object);
1644 swap_pager_freespace(object, info.start_pindex,
1645 info.end_pindex - info.start_pindex + 1);
1651 vm_object_pip_wakeup(object);
1653 lwkt_reltoken(&vm_token);
1657 * The caller must hold vm_token.
1660 vm_object_page_remove_callback(vm_page_t p, void *data)
1662 struct rb_vm_page_scan_info *info = data;
1665 * Wired pages cannot be destroyed, but they can be invalidated
1666 * and we do so if clean_only (limit) is not set.
1668 * WARNING! The page may be wired due to being part of a buffer
1669 * cache buffer, and the buffer might be marked B_CACHE.
1670 * This is fine as part of a truncation but VFSs must be
1671 * sure to fix the buffer up when re-extending the file.
1673 if (p->wire_count != 0) {
1674 vm_page_protect(p, VM_PROT_NONE);
1675 if (info->limit == 0)
1681 * The busy flags are only cleared at
1682 * interrupt -- minimize the spl transitions
1685 if (vm_page_sleep_busy(p, TRUE, "vmopar")) {
1691 * limit is our clean_only flag. If set and the page is dirty, do
1692 * not free it. If set and the page is being held by someone, do
1695 if (info->limit && p->valid) {
1696 vm_page_test_dirty(p);
1697 if (p->valid & p->dirty)
1707 vm_page_protect(p, VM_PROT_NONE);
1713 * Coalesces two objects backing up adjoining regions of memory into a
1716 * returns TRUE if objects were combined.
1718 * NOTE: Only works at the moment if the second object is NULL -
1719 * if it's not, which object do we lock first?
1722 * prev_object First object to coalesce
1723 * prev_offset Offset into prev_object
1724 * next_object Second object into coalesce
1725 * next_offset Offset into next_object
1727 * prev_size Size of reference to prev_object
1728 * next_size Size of reference to next_object
1730 * The object must not be locked.
1731 * The caller must hold vm_token and vmobj_token.
1734 vm_object_coalesce(vm_object_t prev_object, vm_pindex_t prev_pindex,
1735 vm_size_t prev_size, vm_size_t next_size)
1737 vm_pindex_t next_pindex;
1739 ASSERT_LWKT_TOKEN_HELD(&vm_token);
1740 ASSERT_LWKT_TOKEN_HELD(&vmobj_token);
1742 if (prev_object == NULL) {
1746 if (prev_object->type != OBJT_DEFAULT &&
1747 prev_object->type != OBJT_SWAP) {
1752 * Try to collapse the object first
1754 vm_object_collapse(prev_object);
1757 * Can't coalesce if: . more than one reference . paged out . shadows
1758 * another object . has a copy elsewhere (any of which mean that the
1759 * pages not mapped to prev_entry may be in use anyway)
1762 if (prev_object->backing_object != NULL)
1765 prev_size >>= PAGE_SHIFT;
1766 next_size >>= PAGE_SHIFT;
1767 next_pindex = prev_pindex + prev_size;
1769 if ((prev_object->ref_count > 1) &&
1770 (prev_object->size != next_pindex)) {
1775 * Remove any pages that may still be in the object from a previous
1778 if (next_pindex < prev_object->size) {
1779 vm_object_page_remove(prev_object,
1781 next_pindex + next_size, FALSE);
1782 if (prev_object->type == OBJT_SWAP)
1783 swap_pager_freespace(prev_object,
1784 next_pindex, next_size);
1788 * Extend the object if necessary.
1790 if (next_pindex + next_size > prev_object->size)
1791 prev_object->size = next_pindex + next_size;
1796 * Make the object writable and flag is being possibly dirty.
1801 vm_object_set_writeable_dirty(vm_object_t object)
1805 lwkt_gettoken(&vm_token);
1806 vm_object_set_flag(object, OBJ_WRITEABLE|OBJ_MIGHTBEDIRTY);
1807 if (object->type == OBJT_VNODE &&
1808 (vp = (struct vnode *)object->handle) != NULL) {
1809 if ((vp->v_flag & VOBJDIRTY) == 0) {
1810 vsetflags(vp, VOBJDIRTY);
1813 lwkt_reltoken(&vm_token);
1817 vm_object_lock(vm_object_t object)
1819 lwkt_gettoken(&object->tok);
1823 vm_object_unlock(vm_object_t object)
1825 lwkt_reltoken(&object->tok);
1828 #include "opt_ddb.h"
1830 #include <sys/kernel.h>
1832 #include <sys/cons.h>
1834 #include <ddb/ddb.h>
1836 static int _vm_object_in_map (vm_map_t map, vm_object_t object,
1837 vm_map_entry_t entry);
1838 static int vm_object_in_map (vm_object_t object);
1841 * The caller must hold vm_token.
1844 _vm_object_in_map(vm_map_t map, vm_object_t object, vm_map_entry_t entry)
1847 vm_map_entry_t tmpe;
1854 tmpe = map->header.next;
1855 entcount = map->nentries;
1856 while (entcount-- && (tmpe != &map->header)) {
1857 if( _vm_object_in_map(map, object, tmpe)) {
1864 switch(entry->maptype) {
1865 case VM_MAPTYPE_SUBMAP:
1866 tmpm = entry->object.sub_map;
1867 tmpe = tmpm->header.next;
1868 entcount = tmpm->nentries;
1869 while (entcount-- && tmpe != &tmpm->header) {
1870 if( _vm_object_in_map(tmpm, object, tmpe)) {
1876 case VM_MAPTYPE_NORMAL:
1877 case VM_MAPTYPE_VPAGETABLE:
1878 obj = entry->object.vm_object;
1882 obj = obj->backing_object;
1891 static int vm_object_in_map_callback(struct proc *p, void *data);
1893 struct vm_object_in_map_info {
1902 vm_object_in_map(vm_object_t object)
1904 struct vm_object_in_map_info info;
1907 info.object = object;
1909 allproc_scan(vm_object_in_map_callback, &info);
1912 if( _vm_object_in_map(&kernel_map, object, 0))
1914 if( _vm_object_in_map(&pager_map, object, 0))
1916 if( _vm_object_in_map(&buffer_map, object, 0))
1925 vm_object_in_map_callback(struct proc *p, void *data)
1927 struct vm_object_in_map_info *info = data;
1930 if (_vm_object_in_map(&p->p_vmspace->vm_map, info->object, 0)) {
1938 DB_SHOW_COMMAND(vmochk, vm_object_check)
1943 * make sure that internal objs are in a map somewhere
1944 * and none have zero ref counts.
1946 for (object = TAILQ_FIRST(&vm_object_list);
1948 object = TAILQ_NEXT(object, object_list)) {
1949 if (object->type == OBJT_MARKER)
1951 if (object->handle == NULL &&
1952 (object->type == OBJT_DEFAULT || object->type == OBJT_SWAP)) {
1953 if (object->ref_count == 0) {
1954 db_printf("vmochk: internal obj has zero ref count: %ld\n",
1955 (long)object->size);
1957 if (!vm_object_in_map(object)) {
1959 "vmochk: internal obj is not in a map: "
1960 "ref: %d, size: %lu: 0x%lx, backing_object: %p\n",
1961 object->ref_count, (u_long)object->size,
1962 (u_long)object->size,
1963 (void *)object->backing_object);
1972 DB_SHOW_COMMAND(object, vm_object_print_static)
1974 /* XXX convert args. */
1975 vm_object_t object = (vm_object_t)addr;
1976 boolean_t full = have_addr;
1980 /* XXX count is an (unused) arg. Avoid shadowing it. */
1981 #define count was_count
1989 "Object %p: type=%d, size=0x%lx, res=%d, ref=%d, flags=0x%x\n",
1990 object, (int)object->type, (u_long)object->size,
1991 object->resident_page_count, object->ref_count, object->flags);
1993 * XXX no %qd in kernel. Truncate object->backing_object_offset.
1995 db_iprintf(" sref=%d, backing_object(%d)=(%p)+0x%lx\n",
1996 object->shadow_count,
1997 object->backing_object ? object->backing_object->ref_count : 0,
1998 object->backing_object, (long)object->backing_object_offset);
2005 RB_FOREACH(p, vm_page_rb_tree, &object->rb_memq) {
2007 db_iprintf("memory:=");
2008 else if (count == 6) {
2016 db_printf("(off=0x%lx,page=0x%lx)",
2017 (u_long) p->pindex, (u_long) VM_PAGE_TO_PHYS(p));
2028 * XXX need this non-static entry for calling from vm_map_print.
2033 vm_object_print(/* db_expr_t */ long addr,
2034 boolean_t have_addr,
2035 /* db_expr_t */ long count,
2038 vm_object_print_static(addr, have_addr, count, modif);
2044 DB_SHOW_COMMAND(vmopag, vm_object_print_pages)
2049 for (object = TAILQ_FIRST(&vm_object_list);
2051 object = TAILQ_NEXT(object, object_list)) {
2052 vm_pindex_t idx, fidx;
2054 vm_paddr_t pa = -1, padiff;
2058 if (object->type == OBJT_MARKER)
2060 db_printf("new object: %p\n", (void *)object);
2070 osize = object->size;
2073 for (idx = 0; idx < osize; idx++) {
2074 m = vm_page_lookup(object, idx);
2077 db_printf(" index(%ld)run(%d)pa(0x%lx)\n",
2078 (long)fidx, rcount, (long)pa);
2093 (VM_PAGE_TO_PHYS(m) == pa + rcount * PAGE_SIZE)) {
2098 padiff = pa + rcount * PAGE_SIZE - VM_PAGE_TO_PHYS(m);
2099 padiff >>= PAGE_SHIFT;
2100 padiff &= PQ_L2_MASK;
2102 pa = VM_PAGE_TO_PHYS(m) - rcount * PAGE_SIZE;
2106 db_printf(" index(%ld)run(%d)pa(0x%lx)",
2107 (long)fidx, rcount, (long)pa);
2108 db_printf("pd(%ld)\n", (long)padiff);
2118 pa = VM_PAGE_TO_PHYS(m);
2122 db_printf(" index(%ld)run(%d)pa(0x%lx)\n",
2123 (long)fidx, rcount, (long)pa);