2 * Copyright (c) 1991 Regents of the University of California.
5 * This code is derived from software contributed to Berkeley by
6 * The Mach Operating System project at Carnegie-Mellon University.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 4. Neither the name of the University nor the names of its contributors
17 * may be used to endorse or promote products derived from this software
18 * without specific prior written permission.
20 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
21 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
24 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
25 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
26 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
28 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
29 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 * from: @(#)vm_page.c 7.4 (Berkeley) 5/7/91
36 * Copyright (c) 1987, 1990 Carnegie-Mellon University.
37 * All rights reserved.
39 * Authors: Avadis Tevanian, Jr., Michael Wayne Young
41 * Permission to use, copy, modify and distribute this software and
42 * its documentation is hereby granted, provided that both the copyright
43 * notice and this permission notice appear in all copies of the
44 * software, derivative works or modified versions, and any portions
45 * thereof, and that both notices appear in supporting documentation.
47 * CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS"
48 * CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND
49 * FOR ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
51 * Carnegie Mellon requests users of this software to return to
53 * Software Distribution Coordinator or Software.Distribution@CS.CMU.EDU
54 * School of Computer Science
55 * Carnegie Mellon University
56 * Pittsburgh PA 15213-3890
58 * any improvements or extensions that they make and grant Carnegie the
59 * rights to redistribute these changes.
63 * GENERAL RULES ON VM_PAGE MANIPULATION
65 * - a pageq mutex is required when adding or removing a page from a
66 * page queue (vm_page_queue[]), regardless of other mutexes or the
67 * busy state of a page.
69 * - a hash chain mutex is required when associating or disassociating
70 * a page from the VM PAGE CACHE hash table (vm_page_buckets),
71 * regardless of other mutexes or the busy state of a page.
73 * - either a hash chain mutex OR a busied page is required in order
74 * to modify the page flags. A hash chain mutex must be obtained in
75 * order to busy a page. A page's flags cannot be modified by a
76 * hash chain mutex if the page is marked busy.
78 * - The object memq mutex is held when inserting or removing
79 * pages from an object (vm_page_insert() or vm_page_remove()). This
80 * is different from the object's main mutex.
82 * Generally speaking, you have to be aware of side effects when running
83 * vm_page ops. A vm_page_lookup() will return with the hash chain
84 * locked, whether it was able to lookup the page or not. vm_page_free(),
85 * vm_page_cache(), vm_page_activate(), and a number of other routines
86 * will release the hash chain mutex for you. Intermediate manipulation
87 * routines such as vm_page_flag_set() expect the hash chain to be held
88 * on entry and the hash chain will remain held on return.
90 * pageq scanning can only occur with the pageq in question locked.
91 * We have a known bottleneck with the active queue, but the cache
92 * and free queues are actually arrays already.
96 * Resident memory management module.
99 #include <sys/cdefs.h>
100 __FBSDID("$FreeBSD$");
102 #include <sys/param.h>
103 #include <sys/systm.h>
104 #include <sys/lock.h>
105 #include <sys/kernel.h>
106 #include <sys/malloc.h>
107 #include <sys/mutex.h>
108 #include <sys/proc.h>
109 #include <sys/sysctl.h>
110 #include <sys/vmmeter.h>
111 #include <sys/vnode.h>
114 #include <vm/vm_param.h>
115 #include <vm/vm_kern.h>
116 #include <vm/vm_object.h>
117 #include <vm/vm_page.h>
118 #include <vm/vm_pageout.h>
119 #include <vm/vm_pager.h>
120 #include <vm/vm_extern.h>
122 #include <vm/uma_int.h>
124 #include <machine/md_var.h>
127 * Associated with page of user-allocatable memory is a
131 struct mtx vm_page_queue_mtx;
132 struct mtx vm_page_queue_free_mtx;
134 vm_page_t vm_page_array = 0;
135 int vm_page_array_size = 0;
137 int vm_page_zero_count = 0;
139 static int boot_pages = UMA_BOOT_PAGES;
140 TUNABLE_INT("vm.boot_pages", &boot_pages);
141 SYSCTL_INT(_vm, OID_AUTO, boot_pages, CTLFLAG_RD, &boot_pages, 0,
142 "number of pages allocated for bootstrapping the VM system");
147 * Sets the page size, perhaps based upon the memory
148 * size. Must be called before any use of page-size
149 * dependent functions.
152 vm_set_page_size(void)
154 if (cnt.v_page_size == 0)
155 cnt.v_page_size = PAGE_SIZE;
156 if (((cnt.v_page_size - 1) & cnt.v_page_size) != 0)
157 panic("vm_set_page_size: page size not a power of two");
161 * vm_page_blacklist_lookup:
163 * See if a physical address in this page has been listed
164 * in the blacklist tunable. Entries in the tunable are
165 * separated by spaces or commas. If an invalid integer is
166 * encountered then the rest of the string is skipped.
169 vm_page_blacklist_lookup(char *list, vm_paddr_t pa)
174 for (pos = list; *pos != '\0'; pos = cp) {
175 bad = strtoq(pos, &cp, 0);
177 if (*cp == ' ' || *cp == ',') {
184 if (pa == trunc_page(bad))
193 * Initializes the resident memory module.
195 * Allocates memory for the page cells, and
196 * for the object/offset-to-page hash table headers.
197 * Each page cell is initialized and placed on the free list.
200 vm_page_startup(vm_offset_t vaddr)
204 vm_paddr_t page_range;
212 /* the biggest memory array is the second group of pages */
214 vm_paddr_t biggestsize;
215 vm_paddr_t low_water, high_water;
224 vaddr = round_page(vaddr);
226 for (i = 0; phys_avail[i + 1]; i += 2) {
227 phys_avail[i] = round_page(phys_avail[i]);
228 phys_avail[i + 1] = trunc_page(phys_avail[i + 1]);
231 low_water = phys_avail[0];
232 high_water = phys_avail[1];
234 for (i = 0; phys_avail[i + 1]; i += 2) {
235 vm_paddr_t size = phys_avail[i + 1] - phys_avail[i];
237 if (size > biggestsize) {
241 if (phys_avail[i] < low_water)
242 low_water = phys_avail[i];
243 if (phys_avail[i + 1] > high_water)
244 high_water = phys_avail[i + 1];
249 end = phys_avail[biggestone+1];
252 * Initialize the locks.
254 mtx_init(&vm_page_queue_mtx, "vm page queue mutex", NULL, MTX_DEF |
256 mtx_init(&vm_page_queue_free_mtx, "vm page queue free mutex", NULL,
260 * Initialize the queue headers for the free queue, the active queue
261 * and the inactive queue.
266 * Allocate memory for use when boot strapping the kernel memory
269 new_end = end - (boot_pages * UMA_SLAB_SIZE);
270 new_end = trunc_page(new_end);
271 mapped = pmap_map(&vaddr, new_end, end,
272 VM_PROT_READ | VM_PROT_WRITE);
273 bzero((void *)mapped, end - new_end);
274 uma_startup((void *)mapped, boot_pages);
276 #if defined(__amd64__) || defined(__i386__)
278 * Allocate a bitmap to indicate that a random physical page
279 * needs to be included in a minidump.
281 * The amd64 port needs this to indicate which direct map pages
282 * need to be dumped, via calls to dump_add_page()/dump_drop_page().
284 * However, i386 still needs this workspace internally within the
285 * minidump code. In theory, they are not needed on i386, but are
286 * included should the sf_buf code decide to use them.
288 page_range = phys_avail[(nblocks - 1) * 2 + 1] / PAGE_SIZE;
289 vm_page_dump_size = round_page(roundup2(page_range, NBBY) / NBBY);
290 new_end -= vm_page_dump_size;
291 vm_page_dump = (void *)(uintptr_t)pmap_map(&vaddr, new_end,
292 new_end + vm_page_dump_size, VM_PROT_READ | VM_PROT_WRITE);
293 bzero((void *)vm_page_dump, vm_page_dump_size);
296 * Compute the number of pages of memory that will be available for
297 * use (taking into account the overhead of a page structure per
300 first_page = low_water / PAGE_SIZE;
301 #ifdef VM_PHYSSEG_SPARSE
303 for (i = 0; phys_avail[i + 1] != 0; i += 2)
304 page_range += atop(phys_avail[i + 1] - phys_avail[i]);
305 #elif defined(VM_PHYSSEG_DENSE)
306 page_range = high_water / PAGE_SIZE - first_page;
308 #error "Either VM_PHYSSEG_DENSE or VM_PHYSSEG_SPARSE must be defined."
310 npages = (total - (page_range * sizeof(struct vm_page)) -
311 (end - new_end)) / PAGE_SIZE;
315 * Reserve an unmapped guard page to trap access to vm_page_array[-1].
320 * Initialize the mem entry structures now, and put them in the free
323 new_end = trunc_page(end - page_range * sizeof(struct vm_page));
324 mapped = pmap_map(&vaddr, new_end, end,
325 VM_PROT_READ | VM_PROT_WRITE);
326 vm_page_array = (vm_page_t) mapped;
329 * pmap_map on amd64 comes out of the direct-map, not kvm like i386,
330 * so the pages must be tracked for a crashdump to include this data.
331 * This includes the vm_page_array and the early UMA bootstrap pages.
333 for (pa = new_end; pa < phys_avail[biggestone + 1]; pa += PAGE_SIZE)
336 phys_avail[biggestone + 1] = new_end;
339 * Clear all of the page structures
341 bzero((caddr_t) vm_page_array, page_range * sizeof(struct vm_page));
342 vm_page_array_size = page_range;
345 * This assertion tests the hypothesis that npages and total are
349 for (i = 0; phys_avail[i + 1] != 0; i += 2)
350 page_range += atop(phys_avail[i + 1] - phys_avail[i]);
351 KASSERT(page_range == npages,
352 ("vm_page_startup: inconsistent page counts"));
355 * Construct the free queue(s) in descending order (by physical
356 * address) so that the first 16MB of physical memory is allocated
357 * last rather than first. On large-memory machines, this avoids
358 * the exhaustion of low physical memory before isa_dma_init has run.
360 cnt.v_page_count = 0;
361 cnt.v_free_count = 0;
362 list = getenv("vm.blacklist");
363 for (i = 0; phys_avail[i + 1] != 0; i += 2) {
365 last_pa = phys_avail[i + 1];
366 while (pa < last_pa) {
368 vm_page_blacklist_lookup(list, pa))
369 printf("Skipping page with pa 0x%jx\n",
372 vm_pageq_add_new_page(pa);
381 vm_page_flag_set(vm_page_t m, unsigned short bits)
384 mtx_assert(&vm_page_queue_mtx, MA_OWNED);
389 vm_page_flag_clear(vm_page_t m, unsigned short bits)
392 mtx_assert(&vm_page_queue_mtx, MA_OWNED);
397 vm_page_busy(vm_page_t m)
400 VM_OBJECT_LOCK_ASSERT(m->object, MA_OWNED);
401 KASSERT((m->oflags & VPO_BUSY) == 0,
402 ("vm_page_busy: page already busy!!!"));
403 m->oflags |= VPO_BUSY;
409 * wakeup anyone waiting for the page.
412 vm_page_flash(vm_page_t m)
415 VM_OBJECT_LOCK_ASSERT(m->object, MA_OWNED);
416 if (m->oflags & VPO_WANTED) {
417 m->oflags &= ~VPO_WANTED;
425 * clear the VPO_BUSY flag and wakeup anyone waiting for the
430 vm_page_wakeup(vm_page_t m)
433 VM_OBJECT_LOCK_ASSERT(m->object, MA_OWNED);
434 KASSERT(m->oflags & VPO_BUSY, ("vm_page_wakeup: page not busy!!!"));
435 m->oflags &= ~VPO_BUSY;
440 vm_page_io_start(vm_page_t m)
443 VM_OBJECT_LOCK_ASSERT(m->object, MA_OWNED);
448 vm_page_io_finish(vm_page_t m)
451 VM_OBJECT_LOCK_ASSERT(m->object, MA_OWNED);
458 * Keep page from being freed by the page daemon
459 * much of the same effect as wiring, except much lower
460 * overhead and should be used only for *very* temporary
461 * holding ("wiring").
464 vm_page_hold(vm_page_t mem)
467 mtx_assert(&vm_page_queue_mtx, MA_OWNED);
472 vm_page_unhold(vm_page_t mem)
475 mtx_assert(&vm_page_queue_mtx, MA_OWNED);
477 KASSERT(mem->hold_count >= 0, ("vm_page_unhold: hold count < 0!!!"));
478 if (mem->hold_count == 0 && VM_PAGE_INQUEUE2(mem, PQ_HOLD))
479 vm_page_free_toq(mem);
488 vm_page_free(vm_page_t m)
491 m->flags &= ~PG_ZERO;
498 * Free a page to the zerod-pages queue
501 vm_page_free_zero(vm_page_t m)
511 * Sleep and release the page queues lock.
513 * The object containing the given page must be locked.
516 vm_page_sleep(vm_page_t m, const char *msg)
519 VM_OBJECT_LOCK_ASSERT(m->object, MA_OWNED);
520 if (!mtx_owned(&vm_page_queue_mtx))
521 vm_page_lock_queues();
522 vm_page_flag_set(m, PG_REFERENCED);
523 vm_page_unlock_queues();
526 * It's possible that while we sleep, the page will get
527 * unbusied and freed. If we are holding the object
528 * lock, we will assume we hold a reference to the object
529 * such that even if m->object changes, we can re-lock
532 m->oflags |= VPO_WANTED;
533 msleep(m, VM_OBJECT_MTX(m->object), PVM, msg, 0);
539 * make page all dirty
542 vm_page_dirty(vm_page_t m)
544 KASSERT(VM_PAGE_GETKNOWNQUEUE1(m) != PQ_CACHE,
545 ("vm_page_dirty: page in cache!"));
546 KASSERT(VM_PAGE_GETKNOWNQUEUE1(m) != PQ_FREE,
547 ("vm_page_dirty: page is free!"));
548 m->dirty = VM_PAGE_BITS_ALL;
554 * Implements Sleator and Tarjan's top-down splay algorithm. Returns
555 * the vm_page containing the given pindex. If, however, that
556 * pindex is not found in the vm_object, returns a vm_page that is
557 * adjacent to the pindex, coming before or after it.
560 vm_page_splay(vm_pindex_t pindex, vm_page_t root)
562 struct vm_page dummy;
563 vm_page_t lefttreemax, righttreemin, y;
567 lefttreemax = righttreemin = &dummy;
569 if (pindex < root->pindex) {
570 if ((y = root->left) == NULL)
572 if (pindex < y->pindex) {
574 root->left = y->right;
577 if ((y = root->left) == NULL)
580 /* Link into the new root's right tree. */
581 righttreemin->left = root;
583 } else if (pindex > root->pindex) {
584 if ((y = root->right) == NULL)
586 if (pindex > y->pindex) {
588 root->right = y->left;
591 if ((y = root->right) == NULL)
594 /* Link into the new root's left tree. */
595 lefttreemax->right = root;
600 /* Assemble the new root. */
601 lefttreemax->right = root->left;
602 righttreemin->left = root->right;
603 root->left = dummy.right;
604 root->right = dummy.left;
609 * vm_page_insert: [ internal use only ]
611 * Inserts the given mem entry into the object and object list.
613 * The pagetables are not updated but will presumably fault the page
614 * in if necessary, or if a kernel page the caller will at some point
615 * enter the page into the kernel's pmap. We are not allowed to block
616 * here so we *can't* do this anyway.
618 * The object and page must be locked.
619 * This routine may not block.
622 vm_page_insert(vm_page_t m, vm_object_t object, vm_pindex_t pindex)
626 VM_OBJECT_LOCK_ASSERT(object, MA_OWNED);
627 if (m->object != NULL)
628 panic("vm_page_insert: page already inserted");
631 * Record the object/offset pair in this page
637 * Now link into the object's ordered list of backed pages.
643 TAILQ_INSERT_TAIL(&object->memq, m, listq);
645 root = vm_page_splay(pindex, root);
646 if (pindex < root->pindex) {
647 m->left = root->left;
650 TAILQ_INSERT_BEFORE(root, m, listq);
651 } else if (pindex == root->pindex)
652 panic("vm_page_insert: offset already allocated");
654 m->right = root->right;
657 TAILQ_INSERT_AFTER(&object->memq, root, m, listq);
661 object->generation++;
664 * show that the object has one more resident page.
666 object->resident_page_count++;
668 * Hold the vnode until the last page is released.
670 if (object->resident_page_count == 1 && object->type == OBJT_VNODE)
671 vhold((struct vnode *)object->handle);
674 * Since we are inserting a new and possibly dirty page,
675 * update the object's OBJ_MIGHTBEDIRTY flag.
677 if (m->flags & PG_WRITEABLE)
678 vm_object_set_writeable_dirty(object);
683 * NOTE: used by device pager as well -wfj
685 * Removes the given mem entry from the object/offset-page
686 * table and the object page list, but do not invalidate/terminate
689 * The object and page must be locked.
690 * The underlying pmap entry (if any) is NOT removed here.
691 * This routine may not block.
694 vm_page_remove(vm_page_t m)
699 if ((object = m->object) == NULL)
701 VM_OBJECT_LOCK_ASSERT(object, MA_OWNED);
702 if (m->oflags & VPO_BUSY) {
703 m->oflags &= ~VPO_BUSY;
706 mtx_assert(&vm_page_queue_mtx, MA_OWNED);
709 * Now remove from the object's list of backed pages.
711 if (m != object->root)
712 vm_page_splay(m->pindex, object->root);
716 root = vm_page_splay(m->pindex, m->left);
717 root->right = m->right;
720 TAILQ_REMOVE(&object->memq, m, listq);
723 * And show that the object has one fewer resident page.
725 object->resident_page_count--;
726 object->generation++;
728 * The vnode may now be recycled.
730 if (object->resident_page_count == 0 && object->type == OBJT_VNODE)
731 vdrop((struct vnode *)object->handle);
739 * Returns the page associated with the object/offset
740 * pair specified; if none is found, NULL is returned.
742 * The object must be locked.
743 * This routine may not block.
744 * This is a critical path routine
747 vm_page_lookup(vm_object_t object, vm_pindex_t pindex)
751 VM_OBJECT_LOCK_ASSERT(object, MA_OWNED);
752 if ((m = object->root) != NULL && m->pindex != pindex) {
753 m = vm_page_splay(pindex, m);
754 if ((object->root = m)->pindex != pindex)
763 * Move the given memory entry from its
764 * current object to the specified target object/offset.
766 * The object must be locked.
767 * This routine may not block.
769 * Note: swap associated with the page must be invalidated by the move. We
770 * have to do this for several reasons: (1) we aren't freeing the
771 * page, (2) we are dirtying the page, (3) the VM system is probably
772 * moving the page from object A to B, and will then later move
773 * the backing store from A to B and we can't have a conflict.
775 * Note: we *always* dirty the page. It is necessary both for the
776 * fact that we moved it, and because we may be invalidating
777 * swap. If the page is on the cache, we have to deactivate it
778 * or vm_page_dirty() will panic. Dirty pages are not allowed
782 vm_page_rename(vm_page_t m, vm_object_t new_object, vm_pindex_t new_pindex)
786 vm_page_insert(m, new_object, new_pindex);
787 if (VM_PAGE_INQUEUE1(m, PQ_CACHE))
788 vm_page_deactivate(m);
793 * vm_page_select_cache:
795 * Move a page of the given color from the cache queue to the free
796 * queue. As pages might be found, but are not applicable, they are
799 * This routine may not block.
802 vm_page_select_cache(int color)
806 boolean_t was_trylocked;
808 mtx_assert(&vm_page_queue_mtx, MA_OWNED);
809 while ((m = vm_pageq_find(PQ_CACHE, color, FALSE)) != NULL) {
810 KASSERT(m->dirty == 0, ("Found dirty cache page %p", m));
811 KASSERT(!pmap_page_is_mapped(m),
812 ("Found mapped cache page %p", m));
813 KASSERT((m->flags & PG_UNMANAGED) == 0,
814 ("Found unmanaged cache page %p", m));
815 KASSERT(m->wire_count == 0, ("Found wired cache page %p", m));
816 if (m->hold_count == 0 && (object = m->object,
817 (was_trylocked = VM_OBJECT_TRYLOCK(object)) ||
818 VM_OBJECT_LOCKED(object))) {
819 KASSERT((m->oflags & VPO_BUSY) == 0 && m->busy == 0,
820 ("Found busy cache page %p", m));
823 VM_OBJECT_UNLOCK(object);
826 vm_page_deactivate(m);
834 * Allocate and return a memory cell associated
835 * with this VM object/offset pair.
838 * VM_ALLOC_NORMAL normal process request
839 * VM_ALLOC_SYSTEM system *really* needs a page
840 * VM_ALLOC_INTERRUPT interrupt time request
841 * VM_ALLOC_ZERO zero page
843 * This routine may not block.
845 * Additional special handling is required when called from an
846 * interrupt (VM_ALLOC_INTERRUPT). We are not allowed to mess with
847 * the page cache in this case.
850 vm_page_alloc(vm_object_t object, vm_pindex_t pindex, int req)
853 int color, flags, page_req;
855 page_req = req & VM_ALLOC_CLASS_MASK;
856 KASSERT(curthread->td_intr_nesting_level == 0 ||
857 page_req == VM_ALLOC_INTERRUPT,
858 ("vm_page_alloc(NORMAL|SYSTEM) in interrupt context"));
860 if ((req & VM_ALLOC_NOOBJ) == 0) {
861 KASSERT(object != NULL,
862 ("vm_page_alloc: NULL object."));
863 VM_OBJECT_LOCK_ASSERT(object, MA_OWNED);
864 color = (pindex + object->pg_color) & PQ_COLORMASK;
866 color = pindex & PQ_COLORMASK;
869 * The pager is allowed to eat deeper into the free page list.
871 if ((curproc == pageproc) && (page_req != VM_ALLOC_INTERRUPT)) {
872 page_req = VM_ALLOC_SYSTEM;
876 mtx_lock(&vm_page_queue_free_mtx);
877 if (cnt.v_free_count > cnt.v_free_reserved ||
878 (page_req == VM_ALLOC_SYSTEM &&
879 cnt.v_cache_count == 0 &&
880 cnt.v_free_count > cnt.v_interrupt_free_min) ||
881 (page_req == VM_ALLOC_INTERRUPT && cnt.v_free_count > 0)) {
883 * Allocate from the free queue if the number of free pages
884 * exceeds the minimum for the request class.
886 m = vm_pageq_find(PQ_FREE, color, (req & VM_ALLOC_ZERO) != 0);
887 } else if (page_req != VM_ALLOC_INTERRUPT) {
888 mtx_unlock(&vm_page_queue_free_mtx);
890 * Allocatable from cache (non-interrupt only). On success,
891 * we must free the page and try again, thus ensuring that
892 * cnt.v_*_free_min counters are replenished.
894 vm_page_lock_queues();
895 if ((m = vm_page_select_cache(color)) == NULL) {
896 KASSERT(cnt.v_cache_count == 0,
897 ("vm_page_alloc: cache queue is missing %d pages",
899 vm_page_unlock_queues();
900 atomic_add_int(&vm_pageout_deficit, 1);
903 if (page_req != VM_ALLOC_SYSTEM)
906 mtx_lock(&vm_page_queue_free_mtx);
907 if (cnt.v_free_count <= cnt.v_interrupt_free_min) {
908 mtx_unlock(&vm_page_queue_free_mtx);
911 m = vm_pageq_find(PQ_FREE, color, (req & VM_ALLOC_ZERO) != 0);
913 vm_page_unlock_queues();
918 * Not allocatable from cache from interrupt, give up.
920 mtx_unlock(&vm_page_queue_free_mtx);
921 atomic_add_int(&vm_pageout_deficit, 1);
927 * At this point we had better have found a good page.
932 ("vm_page_alloc(): missing page on free queue")
936 * Remove from free queue
938 vm_pageq_remove_nowakeup(m);
941 * Initialize structure. Only the PG_ZERO flag is inherited.
944 if (m->flags & PG_ZERO) {
945 vm_page_zero_count--;
946 if (req & VM_ALLOC_ZERO)
949 if (object != NULL && object->type == OBJT_PHYS)
950 flags |= PG_UNMANAGED;
952 if (req & (VM_ALLOC_NOBUSY | VM_ALLOC_NOOBJ))
955 m->oflags = VPO_BUSY;
956 if (req & VM_ALLOC_WIRED) {
957 atomic_add_int(&cnt.v_wire_count, 1);
965 KASSERT(m->dirty == 0, ("vm_page_alloc: free/cache page %p was dirty", m));
966 mtx_unlock(&vm_page_queue_free_mtx);
968 if ((req & VM_ALLOC_NOOBJ) == 0)
969 vm_page_insert(m, object, pindex);
974 * Don't wakeup too often - wakeup the pageout daemon when
975 * we would be nearly out of memory.
977 if (vm_paging_needed())
984 * vm_wait: (also see VM_WAIT macro)
986 * Block until free pages are available for allocation
987 * - Called in various places before memory allocations.
993 mtx_lock(&vm_page_queue_free_mtx);
994 if (curproc == pageproc) {
995 vm_pageout_pages_needed = 1;
996 msleep(&vm_pageout_pages_needed, &vm_page_queue_free_mtx,
997 PDROP | PSWP, "VMWait", 0);
999 if (!vm_pages_needed) {
1000 vm_pages_needed = 1;
1001 wakeup(&vm_pages_needed);
1003 msleep(&cnt.v_free_count, &vm_page_queue_free_mtx, PDROP | PVM,
1009 * vm_waitpfault: (also see VM_WAITPFAULT macro)
1011 * Block until free pages are available for allocation
1012 * - Called only in vm_fault so that processes page faulting
1013 * can be easily tracked.
1014 * - Sleeps at a lower priority than vm_wait() so that vm_wait()ing
1015 * processes will be able to grab memory first. Do not change
1016 * this balance without careful testing first.
1022 mtx_lock(&vm_page_queue_free_mtx);
1023 if (!vm_pages_needed) {
1024 vm_pages_needed = 1;
1025 wakeup(&vm_pages_needed);
1027 msleep(&cnt.v_free_count, &vm_page_queue_free_mtx, PDROP | PUSER,
1034 * Put the specified page on the active list (if appropriate).
1035 * Ensure that act_count is at least ACT_INIT but do not otherwise
1038 * The page queues must be locked.
1039 * This routine may not block.
1042 vm_page_activate(vm_page_t m)
1045 mtx_assert(&vm_page_queue_mtx, MA_OWNED);
1046 if (VM_PAGE_GETKNOWNQUEUE2(m) != PQ_ACTIVE) {
1047 if (VM_PAGE_INQUEUE1(m, PQ_CACHE))
1048 PCPU_INC(cnt.v_reactivated);
1050 if (m->wire_count == 0 && (m->flags & PG_UNMANAGED) == 0) {
1051 if (m->act_count < ACT_INIT)
1052 m->act_count = ACT_INIT;
1053 vm_pageq_enqueue(PQ_ACTIVE, m);
1056 if (m->act_count < ACT_INIT)
1057 m->act_count = ACT_INIT;
1062 * vm_page_free_wakeup:
1064 * Helper routine for vm_page_free_toq() and vm_page_cache(). This
1065 * routine is called when a page has been added to the cache or free
1068 * The page queues must be locked.
1069 * This routine may not block.
1072 vm_page_free_wakeup(void)
1075 mtx_assert(&vm_page_queue_free_mtx, MA_OWNED);
1077 * if pageout daemon needs pages, then tell it that there are
1080 if (vm_pageout_pages_needed &&
1081 cnt.v_cache_count + cnt.v_free_count >= cnt.v_pageout_free_min) {
1082 wakeup(&vm_pageout_pages_needed);
1083 vm_pageout_pages_needed = 0;
1086 * wakeup processes that are waiting on memory if we hit a
1087 * high water mark. And wakeup scheduler process if we have
1088 * lots of memory. this process will swapin processes.
1090 if (vm_pages_needed && !vm_page_count_min()) {
1091 vm_pages_needed = 0;
1092 wakeup(&cnt.v_free_count);
1099 * Returns the given page to the PQ_FREE list,
1100 * disassociating it with any VM object.
1102 * Object and page must be locked prior to entry.
1103 * This routine may not block.
1107 vm_page_free_toq(vm_page_t m)
1109 struct vpgqueues *pq;
1111 if (VM_PAGE_GETQUEUE(m) != PQ_NONE)
1112 mtx_assert(&vm_page_queue_mtx, MA_OWNED);
1113 KASSERT(!pmap_page_is_mapped(m),
1114 ("vm_page_free_toq: freeing mapped page %p", m));
1115 PCPU_INC(cnt.v_tfree);
1117 if (m->busy || VM_PAGE_INQUEUE1(m, PQ_FREE)) {
1119 "vm_page_free: pindex(%lu), busy(%d), VPO_BUSY(%d), hold(%d)\n",
1120 (u_long)m->pindex, m->busy, (m->oflags & VPO_BUSY) ? 1 : 0,
1122 if (VM_PAGE_INQUEUE1(m, PQ_FREE))
1123 panic("vm_page_free: freeing free page");
1125 panic("vm_page_free: freeing busy page");
1129 * unqueue, then remove page. Note that we cannot destroy
1130 * the page here because we do not want to call the pager's
1131 * callback routine until after we've put the page on the
1132 * appropriate free queue.
1134 vm_pageq_remove_nowakeup(m);
1138 * If fictitious remove object association and
1139 * return, otherwise delay object association removal.
1141 if ((m->flags & PG_FICTITIOUS) != 0) {
1148 if (m->wire_count != 0) {
1149 if (m->wire_count > 1) {
1150 panic("vm_page_free: invalid wire count (%d), pindex: 0x%lx",
1151 m->wire_count, (long)m->pindex);
1153 panic("vm_page_free: freeing wired page");
1155 if (m->hold_count != 0) {
1156 m->flags &= ~PG_ZERO;
1157 vm_pageq_enqueue(PQ_HOLD, m);
1160 VM_PAGE_SETQUEUE1(m, PQ_FREE);
1161 mtx_lock(&vm_page_queue_free_mtx);
1162 pq = &vm_page_queues[VM_PAGE_GETQUEUE(m)];
1167 * Put zero'd pages on the end ( where we look for zero'd pages
1168 * first ) and non-zerod pages at the head.
1170 if (m->flags & PG_ZERO) {
1171 TAILQ_INSERT_TAIL(&pq->pl, m, pageq);
1172 ++vm_page_zero_count;
1174 TAILQ_INSERT_HEAD(&pq->pl, m, pageq);
1175 vm_page_zero_idle_wakeup();
1177 vm_page_free_wakeup();
1178 mtx_unlock(&vm_page_queue_free_mtx);
1184 * Mark this page as wired down by yet
1185 * another map, removing it from paging queues
1188 * The page queues must be locked.
1189 * This routine may not block.
1192 vm_page_wire(vm_page_t m)
1196 * Only bump the wire statistics if the page is not already wired,
1197 * and only unqueue the page if it is on some queue (if it is unmanaged
1198 * it is already off the queues).
1200 mtx_assert(&vm_page_queue_mtx, MA_OWNED);
1201 if (m->flags & PG_FICTITIOUS)
1203 if (m->wire_count == 0) {
1204 if ((m->flags & PG_UNMANAGED) == 0)
1206 atomic_add_int(&cnt.v_wire_count, 1);
1209 KASSERT(m->wire_count != 0, ("vm_page_wire: wire_count overflow m=%p", m));
1215 * Release one wiring of this page, potentially
1216 * enabling it to be paged again.
1218 * Many pages placed on the inactive queue should actually go
1219 * into the cache, but it is difficult to figure out which. What
1220 * we do instead, if the inactive target is well met, is to put
1221 * clean pages at the head of the inactive queue instead of the tail.
1222 * This will cause them to be moved to the cache more quickly and
1223 * if not actively re-referenced, freed more quickly. If we just
1224 * stick these pages at the end of the inactive queue, heavy filesystem
1225 * meta-data accesses can cause an unnecessary paging load on memory bound
1226 * processes. This optimization causes one-time-use metadata to be
1227 * reused more quickly.
1229 * BUT, if we are in a low-memory situation we have no choice but to
1230 * put clean pages on the cache queue.
1232 * A number of routines use vm_page_unwire() to guarantee that the page
1233 * will go into either the inactive or active queues, and will NEVER
1234 * be placed in the cache - for example, just after dirtying a page.
1235 * dirty pages in the cache are not allowed.
1237 * The page queues must be locked.
1238 * This routine may not block.
1241 vm_page_unwire(vm_page_t m, int activate)
1244 mtx_assert(&vm_page_queue_mtx, MA_OWNED);
1245 if (m->flags & PG_FICTITIOUS)
1247 if (m->wire_count > 0) {
1249 if (m->wire_count == 0) {
1250 atomic_subtract_int(&cnt.v_wire_count, 1);
1251 if (m->flags & PG_UNMANAGED) {
1253 } else if (activate)
1254 vm_pageq_enqueue(PQ_ACTIVE, m);
1256 vm_page_flag_clear(m, PG_WINATCFLS);
1257 vm_pageq_enqueue(PQ_INACTIVE, m);
1261 panic("vm_page_unwire: invalid wire count: %d", m->wire_count);
1267 * Move the specified page to the inactive queue. If the page has
1268 * any associated swap, the swap is deallocated.
1270 * Normally athead is 0 resulting in LRU operation. athead is set
1271 * to 1 if we want this page to be 'as if it were placed in the cache',
1272 * except without unmapping it from the process address space.
1274 * This routine may not block.
1277 _vm_page_deactivate(vm_page_t m, int athead)
1280 mtx_assert(&vm_page_queue_mtx, MA_OWNED);
1283 * Ignore if already inactive.
1285 if (VM_PAGE_INQUEUE2(m, PQ_INACTIVE))
1287 if (m->wire_count == 0 && (m->flags & PG_UNMANAGED) == 0) {
1288 if (VM_PAGE_INQUEUE1(m, PQ_CACHE))
1289 PCPU_INC(cnt.v_reactivated);
1290 vm_page_flag_clear(m, PG_WINATCFLS);
1293 TAILQ_INSERT_HEAD(&vm_page_queues[PQ_INACTIVE].pl, m, pageq);
1295 TAILQ_INSERT_TAIL(&vm_page_queues[PQ_INACTIVE].pl, m, pageq);
1296 VM_PAGE_SETQUEUE2(m, PQ_INACTIVE);
1297 vm_page_queues[PQ_INACTIVE].lcnt++;
1300 * Just not use an atomic here since vm_page_queues_lock
1301 * alredy protects this field.
1303 cnt.v_inactive_count++;
1308 vm_page_deactivate(vm_page_t m)
1310 _vm_page_deactivate(m, 0);
1314 * vm_page_try_to_cache:
1316 * Returns 0 on failure, 1 on success
1319 vm_page_try_to_cache(vm_page_t m)
1322 mtx_assert(&vm_page_queue_mtx, MA_OWNED);
1323 VM_OBJECT_LOCK_ASSERT(m->object, MA_OWNED);
1324 if (m->dirty || m->hold_count || m->busy || m->wire_count ||
1325 (m->oflags & VPO_BUSY) || (m->flags & PG_UNMANAGED)) {
1336 * vm_page_try_to_free()
1338 * Attempt to free the page. If we cannot free it, we do nothing.
1339 * 1 is returned on success, 0 on failure.
1342 vm_page_try_to_free(vm_page_t m)
1345 mtx_assert(&vm_page_queue_mtx, MA_OWNED);
1346 if (m->object != NULL)
1347 VM_OBJECT_LOCK_ASSERT(m->object, MA_OWNED);
1348 if (m->dirty || m->hold_count || m->busy || m->wire_count ||
1349 (m->oflags & VPO_BUSY) || (m->flags & PG_UNMANAGED)) {
1362 * Put the specified page onto the page cache queue (if appropriate).
1364 * This routine may not block.
1367 vm_page_cache(vm_page_t m)
1370 mtx_assert(&vm_page_queue_mtx, MA_OWNED);
1371 VM_OBJECT_LOCK_ASSERT(m->object, MA_OWNED);
1372 if ((m->flags & PG_UNMANAGED) || (m->oflags & VPO_BUSY) || m->busy ||
1373 m->hold_count || m->wire_count) {
1374 printf("vm_page_cache: attempting to cache busy page\n");
1377 if (VM_PAGE_INQUEUE1(m, PQ_CACHE))
1381 * Remove all pmaps and indicate that the page is not
1382 * writeable or mapped.
1385 if (m->dirty != 0) {
1386 panic("vm_page_cache: caching a dirty page, pindex: %ld",
1389 vm_pageq_remove_nowakeup(m);
1390 vm_pageq_enqueue(PQ_CACHE + m->pc, m);
1391 mtx_lock(&vm_page_queue_free_mtx);
1392 vm_page_free_wakeup();
1393 mtx_unlock(&vm_page_queue_free_mtx);
1399 * Cache, deactivate, or do nothing as appropriate. This routine
1400 * is typically used by madvise() MADV_DONTNEED.
1402 * Generally speaking we want to move the page into the cache so
1403 * it gets reused quickly. However, this can result in a silly syndrome
1404 * due to the page recycling too quickly. Small objects will not be
1405 * fully cached. On the otherhand, if we move the page to the inactive
1406 * queue we wind up with a problem whereby very large objects
1407 * unnecessarily blow away our inactive and cache queues.
1409 * The solution is to move the pages based on a fixed weighting. We
1410 * either leave them alone, deactivate them, or move them to the cache,
1411 * where moving them to the cache has the highest weighting.
1412 * By forcing some pages into other queues we eventually force the
1413 * system to balance the queues, potentially recovering other unrelated
1414 * space from active. The idea is to not force this to happen too
1418 vm_page_dontneed(vm_page_t m)
1420 static int dnweight;
1424 mtx_assert(&vm_page_queue_mtx, MA_OWNED);
1428 * occassionally leave the page alone
1430 if ((dnw & 0x01F0) == 0 ||
1431 VM_PAGE_INQUEUE2(m, PQ_INACTIVE) ||
1432 VM_PAGE_INQUEUE1(m, PQ_CACHE)
1434 if (m->act_count >= ACT_INIT)
1439 if (m->dirty == 0 && pmap_is_modified(m))
1442 if (m->dirty || (dnw & 0x0070) == 0) {
1444 * Deactivate the page 3 times out of 32.
1449 * Cache the page 28 times out of every 32. Note that
1450 * the page is deactivated instead of cached, but placed
1451 * at the head of the queue instead of the tail.
1455 _vm_page_deactivate(m, head);
1459 * Grab a page, waiting until we are waken up due to the page
1460 * changing state. We keep on waiting, if the page continues
1461 * to be in the object. If the page doesn't exist, first allocate it
1462 * and then conditionally zero it.
1464 * This routine may block.
1467 vm_page_grab(vm_object_t object, vm_pindex_t pindex, int allocflags)
1471 VM_OBJECT_LOCK_ASSERT(object, MA_OWNED);
1473 if ((m = vm_page_lookup(object, pindex)) != NULL) {
1474 if (vm_page_sleep_if_busy(m, TRUE, "pgrbwt")) {
1475 if ((allocflags & VM_ALLOC_RETRY) == 0)
1479 if ((allocflags & VM_ALLOC_WIRED) != 0) {
1480 vm_page_lock_queues();
1482 vm_page_unlock_queues();
1484 if ((allocflags & VM_ALLOC_NOBUSY) == 0)
1489 m = vm_page_alloc(object, pindex, allocflags & ~VM_ALLOC_RETRY);
1491 VM_OBJECT_UNLOCK(object);
1493 VM_OBJECT_LOCK(object);
1494 if ((allocflags & VM_ALLOC_RETRY) == 0)
1498 if (allocflags & VM_ALLOC_ZERO && (m->flags & PG_ZERO) == 0)
1504 * Mapping function for valid bits or for dirty bits in
1505 * a page. May not block.
1507 * Inputs are required to range within a page.
1510 vm_page_bits(int base, int size)
1516 base + size <= PAGE_SIZE,
1517 ("vm_page_bits: illegal base/size %d/%d", base, size)
1520 if (size == 0) /* handle degenerate case */
1523 first_bit = base >> DEV_BSHIFT;
1524 last_bit = (base + size - 1) >> DEV_BSHIFT;
1526 return ((2 << last_bit) - (1 << first_bit));
1530 * vm_page_set_validclean:
1532 * Sets portions of a page valid and clean. The arguments are expected
1533 * to be DEV_BSIZE aligned but if they aren't the bitmap is inclusive
1534 * of any partial chunks touched by the range. The invalid portion of
1535 * such chunks will be zero'd.
1537 * This routine may not block.
1539 * (base + size) must be less then or equal to PAGE_SIZE.
1542 vm_page_set_validclean(vm_page_t m, int base, int size)
1548 mtx_assert(&vm_page_queue_mtx, MA_OWNED);
1549 VM_OBJECT_LOCK_ASSERT(m->object, MA_OWNED);
1550 if (size == 0) /* handle degenerate case */
1554 * If the base is not DEV_BSIZE aligned and the valid
1555 * bit is clear, we have to zero out a portion of the
1558 if ((frag = base & ~(DEV_BSIZE - 1)) != base &&
1559 (m->valid & (1 << (base >> DEV_BSHIFT))) == 0)
1560 pmap_zero_page_area(m, frag, base - frag);
1563 * If the ending offset is not DEV_BSIZE aligned and the
1564 * valid bit is clear, we have to zero out a portion of
1567 endoff = base + size;
1568 if ((frag = endoff & ~(DEV_BSIZE - 1)) != endoff &&
1569 (m->valid & (1 << (endoff >> DEV_BSHIFT))) == 0)
1570 pmap_zero_page_area(m, endoff,
1571 DEV_BSIZE - (endoff & (DEV_BSIZE - 1)));
1574 * Set valid, clear dirty bits. If validating the entire
1575 * page we can safely clear the pmap modify bit. We also
1576 * use this opportunity to clear the VPO_NOSYNC flag. If a process
1577 * takes a write fault on a MAP_NOSYNC memory area the flag will
1580 * We set valid bits inclusive of any overlap, but we can only
1581 * clear dirty bits for DEV_BSIZE chunks that are fully within
1584 pagebits = vm_page_bits(base, size);
1585 m->valid |= pagebits;
1587 if ((frag = base & (DEV_BSIZE - 1)) != 0) {
1588 frag = DEV_BSIZE - frag;
1594 pagebits = vm_page_bits(base, size & (DEV_BSIZE - 1));
1596 m->dirty &= ~pagebits;
1597 if (base == 0 && size == PAGE_SIZE) {
1598 pmap_clear_modify(m);
1599 m->oflags &= ~VPO_NOSYNC;
1604 vm_page_clear_dirty(vm_page_t m, int base, int size)
1607 mtx_assert(&vm_page_queue_mtx, MA_OWNED);
1608 m->dirty &= ~vm_page_bits(base, size);
1612 * vm_page_set_invalid:
1614 * Invalidates DEV_BSIZE'd chunks within a page. Both the
1615 * valid and dirty bits for the effected areas are cleared.
1620 vm_page_set_invalid(vm_page_t m, int base, int size)
1624 VM_OBJECT_LOCK_ASSERT(m->object, MA_OWNED);
1625 bits = vm_page_bits(base, size);
1626 mtx_assert(&vm_page_queue_mtx, MA_OWNED);
1627 if (m->valid == VM_PAGE_BITS_ALL && bits != 0)
1631 m->object->generation++;
1635 * vm_page_zero_invalid()
1637 * The kernel assumes that the invalid portions of a page contain
1638 * garbage, but such pages can be mapped into memory by user code.
1639 * When this occurs, we must zero out the non-valid portions of the
1640 * page so user code sees what it expects.
1642 * Pages are most often semi-valid when the end of a file is mapped
1643 * into memory and the file's size is not page aligned.
1646 vm_page_zero_invalid(vm_page_t m, boolean_t setvalid)
1651 VM_OBJECT_LOCK_ASSERT(m->object, MA_OWNED);
1653 * Scan the valid bits looking for invalid sections that
1654 * must be zerod. Invalid sub-DEV_BSIZE'd areas ( where the
1655 * valid bit may be set ) have already been zerod by
1656 * vm_page_set_validclean().
1658 for (b = i = 0; i <= PAGE_SIZE / DEV_BSIZE; ++i) {
1659 if (i == (PAGE_SIZE / DEV_BSIZE) ||
1660 (m->valid & (1 << i))
1663 pmap_zero_page_area(m,
1664 b << DEV_BSHIFT, (i - b) << DEV_BSHIFT);
1671 * setvalid is TRUE when we can safely set the zero'd areas
1672 * as being valid. We can do this if there are no cache consistancy
1673 * issues. e.g. it is ok to do with UFS, but not ok to do with NFS.
1676 m->valid = VM_PAGE_BITS_ALL;
1682 * Is (partial) page valid? Note that the case where size == 0
1683 * will return FALSE in the degenerate case where the page is
1684 * entirely invalid, and TRUE otherwise.
1689 vm_page_is_valid(vm_page_t m, int base, int size)
1691 int bits = vm_page_bits(base, size);
1693 VM_OBJECT_LOCK_ASSERT(m->object, MA_OWNED);
1694 if (m->valid && ((m->valid & bits) == bits))
1701 * update dirty bits from pmap/mmu. May not block.
1704 vm_page_test_dirty(vm_page_t m)
1706 if ((m->dirty != VM_PAGE_BITS_ALL) && pmap_is_modified(m)) {
1711 int so_zerocp_fullpage = 0;
1714 vm_page_cowfault(vm_page_t m)
1726 mnew = vm_page_alloc(object, pindex, VM_ALLOC_NORMAL | VM_ALLOC_NOBUSY);
1728 vm_page_insert(m, object, pindex);
1729 vm_page_unlock_queues();
1730 VM_OBJECT_UNLOCK(object);
1732 VM_OBJECT_LOCK(object);
1733 vm_page_lock_queues();
1739 * check to see if we raced with an xmit complete when
1740 * waiting to allocate a page. If so, put things back
1744 vm_page_insert(m, object, pindex);
1745 } else { /* clear COW & copy page */
1746 if (!so_zerocp_fullpage)
1747 pmap_copy_page(m, mnew);
1748 mnew->valid = VM_PAGE_BITS_ALL;
1749 vm_page_dirty(mnew);
1750 mnew->wire_count = m->wire_count - m->cow;
1751 m->wire_count = m->cow;
1756 vm_page_cowclear(vm_page_t m)
1759 mtx_assert(&vm_page_queue_mtx, MA_OWNED);
1763 * let vm_fault add back write permission lazily
1767 * sf_buf_free() will free the page, so we needn't do it here
1772 vm_page_cowsetup(vm_page_t m)
1775 mtx_assert(&vm_page_queue_mtx, MA_OWNED);
1777 pmap_remove_write(m);
1780 #include "opt_ddb.h"
1782 #include <sys/kernel.h>
1784 #include <ddb/ddb.h>
1786 DB_SHOW_COMMAND(page, vm_page_print_page_info)
1788 db_printf("cnt.v_free_count: %d\n", cnt.v_free_count);
1789 db_printf("cnt.v_cache_count: %d\n", cnt.v_cache_count);
1790 db_printf("cnt.v_inactive_count: %d\n", cnt.v_inactive_count);
1791 db_printf("cnt.v_active_count: %d\n", cnt.v_active_count);
1792 db_printf("cnt.v_wire_count: %d\n", cnt.v_wire_count);
1793 db_printf("cnt.v_free_reserved: %d\n", cnt.v_free_reserved);
1794 db_printf("cnt.v_free_min: %d\n", cnt.v_free_min);
1795 db_printf("cnt.v_free_target: %d\n", cnt.v_free_target);
1796 db_printf("cnt.v_cache_min: %d\n", cnt.v_cache_min);
1797 db_printf("cnt.v_inactive_target: %d\n", cnt.v_inactive_target);
1800 DB_SHOW_COMMAND(pageq, vm_page_print_pageq_info)
1803 db_printf("PQ_FREE:");
1804 for (i = 0; i < PQ_NUMCOLORS; i++) {
1805 db_printf(" %d", vm_page_queues[PQ_FREE + i].lcnt);
1809 db_printf("PQ_CACHE:");
1810 for (i = 0; i < PQ_NUMCOLORS; i++) {
1811 db_printf(" %d", vm_page_queues[PQ_CACHE + i].lcnt);
1815 db_printf("PQ_ACTIVE: %d, PQ_INACTIVE: %d\n",
1816 vm_page_queues[PQ_ACTIVE].lcnt,
1817 vm_page_queues[PQ_INACTIVE].lcnt);