2 * SPDX-License-Identifier: (BSD-3-Clause AND MIT-CMU)
4 * Copyright (c) 1991 Regents of the University of California.
6 * Copyright (c) 1998 Matthew Dillon. All Rights Reserved.
8 * This code is derived from software contributed to Berkeley by
9 * The Mach Operating System project at Carnegie-Mellon University.
11 * Redistribution and use in source and binary forms, with or without
12 * modification, are permitted provided that the following conditions
14 * 1. Redistributions of source code must retain the above copyright
15 * notice, this list of conditions and the following disclaimer.
16 * 2. Redistributions in binary form must reproduce the above copyright
17 * notice, this list of conditions and the following disclaimer in the
18 * documentation and/or other materials provided with the distribution.
19 * 3. Neither the name of the University nor the names of its contributors
20 * may be used to endorse or promote products derived from this software
21 * without specific prior written permission.
23 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
35 * from: @(#)vm_page.c 7.4 (Berkeley) 5/7/91
39 * Copyright (c) 1987, 1990 Carnegie-Mellon University.
40 * All rights reserved.
42 * Authors: Avadis Tevanian, Jr., Michael Wayne Young
44 * Permission to use, copy, modify and distribute this software and
45 * its documentation is hereby granted, provided that both the copyright
46 * notice and this permission notice appear in all copies of the
47 * software, derivative works or modified versions, and any portions
48 * thereof, and that both notices appear in supporting documentation.
50 * CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS"
51 * CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND
52 * FOR ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
54 * Carnegie Mellon requests users of this software to return to
56 * Software Distribution Coordinator or Software.Distribution@CS.CMU.EDU
57 * School of Computer Science
58 * Carnegie Mellon University
59 * Pittsburgh PA 15213-3890
61 * any improvements or extensions that they make and grant Carnegie the
62 * rights to redistribute these changes.
66 * GENERAL RULES ON VM_PAGE MANIPULATION
68 * - A page queue lock is required when adding or removing a page from a
69 * page queue regardless of other locks or the busy state of a page.
71 * * In general, no thread besides the page daemon can acquire or
72 * hold more than one page queue lock at a time.
74 * * The page daemon can acquire and hold any pair of page queue
77 * - The object lock is required when inserting or removing
78 * pages from an object (vm_page_insert() or vm_page_remove()).
83 * Resident memory management module.
86 #include <sys/cdefs.h>
87 __FBSDID("$FreeBSD$");
91 #include <sys/param.h>
92 #include <sys/systm.h>
94 #include <sys/domainset.h>
95 #include <sys/kernel.h>
96 #include <sys/limits.h>
97 #include <sys/linker.h>
98 #include <sys/malloc.h>
100 #include <sys/msgbuf.h>
101 #include <sys/mutex.h>
102 #include <sys/proc.h>
103 #include <sys/rwlock.h>
104 #include <sys/sbuf.h>
105 #include <sys/sched.h>
107 #include <sys/sysctl.h>
108 #include <sys/vmmeter.h>
109 #include <sys/vnode.h>
113 #include <vm/vm_param.h>
114 #include <vm/vm_domainset.h>
115 #include <vm/vm_kern.h>
116 #include <vm/vm_map.h>
117 #include <vm/vm_object.h>
118 #include <vm/vm_page.h>
119 #include <vm/vm_pageout.h>
120 #include <vm/vm_phys.h>
121 #include <vm/vm_pagequeue.h>
122 #include <vm/vm_pager.h>
123 #include <vm/vm_radix.h>
124 #include <vm/vm_reserv.h>
125 #include <vm/vm_extern.h>
127 #include <vm/uma_int.h>
129 #include <machine/md_var.h>
131 extern int uma_startup_count(int);
132 extern void uma_startup(void *, int);
133 extern int vmem_startup_count(void);
135 struct vm_domain vm_dom[MAXMEMDOM];
137 static DPCPU_DEFINE(struct vm_batchqueue, pqbatch[MAXMEMDOM][PQ_COUNT]);
139 struct mtx_padalign __exclusive_cache_line pa_lock[PA_LOCK_COUNT];
141 struct mtx_padalign __exclusive_cache_line vm_domainset_lock;
142 /* The following fields are protected by the domainset lock. */
143 domainset_t __exclusive_cache_line vm_min_domains;
144 domainset_t __exclusive_cache_line vm_severe_domains;
145 static int vm_min_waiters;
146 static int vm_severe_waiters;
147 static int vm_pageproc_waiters;
150 * bogus page -- for I/O to/from partially complete buffers,
151 * or for paging into sparsely invalid regions.
153 vm_page_t bogus_page;
155 vm_page_t vm_page_array;
156 long vm_page_array_size;
159 static int boot_pages;
160 SYSCTL_INT(_vm, OID_AUTO, boot_pages, CTLFLAG_RDTUN | CTLFLAG_NOFETCH,
162 "number of pages allocated for bootstrapping the VM system");
164 static int pa_tryrelock_restart;
165 SYSCTL_INT(_vm, OID_AUTO, tryrelock_restart, CTLFLAG_RD,
166 &pa_tryrelock_restart, 0, "Number of tryrelock restarts");
168 static TAILQ_HEAD(, vm_page) blacklist_head;
169 static int sysctl_vm_page_blacklist(SYSCTL_HANDLER_ARGS);
170 SYSCTL_PROC(_vm, OID_AUTO, page_blacklist, CTLTYPE_STRING | CTLFLAG_RD |
171 CTLFLAG_MPSAFE, NULL, 0, sysctl_vm_page_blacklist, "A", "Blacklist pages");
173 static uma_zone_t fakepg_zone;
175 static void vm_page_alloc_check(vm_page_t m);
176 static void vm_page_clear_dirty_mask(vm_page_t m, vm_page_bits_t pagebits);
177 static void vm_page_dequeue_complete(vm_page_t m);
178 static void vm_page_enqueue(vm_page_t m, uint8_t queue);
179 static void vm_page_init(void *dummy);
180 static int vm_page_insert_after(vm_page_t m, vm_object_t object,
181 vm_pindex_t pindex, vm_page_t mpred);
182 static void vm_page_insert_radixdone(vm_page_t m, vm_object_t object,
184 static int vm_page_reclaim_run(int req_class, int domain, u_long npages,
185 vm_page_t m_run, vm_paddr_t high);
186 static int vm_domain_alloc_fail(struct vm_domain *vmd, vm_object_t object,
188 static int vm_page_import(void *arg, void **store, int cnt, int domain,
190 static void vm_page_release(void *arg, void **store, int cnt);
192 SYSINIT(vm_page, SI_SUB_VM, SI_ORDER_SECOND, vm_page_init, NULL);
195 vm_page_init(void *dummy)
198 fakepg_zone = uma_zcreate("fakepg", sizeof(struct vm_page), NULL, NULL,
199 NULL, NULL, UMA_ALIGN_PTR, UMA_ZONE_NOFREE | UMA_ZONE_VM);
200 bogus_page = vm_page_alloc(NULL, 0, VM_ALLOC_NOOBJ |
201 VM_ALLOC_NORMAL | VM_ALLOC_WIRED);
205 * The cache page zone is initialized later since we need to be able to allocate
206 * pages before UMA is fully initialized.
209 vm_page_init_cache_zones(void *dummy __unused)
211 struct vm_domain *vmd;
214 for (i = 0; i < vm_ndomains; i++) {
217 * Don't allow the page cache to take up more than .25% of
220 if (vmd->vmd_page_count / 400 < 256 * mp_ncpus)
222 vmd->vmd_pgcache = uma_zcache_create("vm pgcache",
223 sizeof(struct vm_page), NULL, NULL, NULL, NULL,
224 vm_page_import, vm_page_release, vmd,
225 UMA_ZONE_NOBUCKETCACHE | UMA_ZONE_MAXBUCKET | UMA_ZONE_VM);
228 SYSINIT(vm_page2, SI_SUB_VM_CONF, SI_ORDER_ANY, vm_page_init_cache_zones, NULL);
230 /* Make sure that u_long is at least 64 bits when PAGE_SIZE is 32K. */
231 #if PAGE_SIZE == 32768
233 CTASSERT(sizeof(u_long) >= 8);
238 * Try to acquire a physical address lock while a pmap is locked. If we
239 * fail to trylock we unlock and lock the pmap directly and cache the
240 * locked pa in *locked. The caller should then restart their loop in case
241 * the virtual to physical mapping has changed.
244 vm_page_pa_tryrelock(pmap_t pmap, vm_paddr_t pa, vm_paddr_t *locked)
251 PA_LOCK_ASSERT(lockpa, MA_OWNED);
252 if (PA_LOCKPTR(pa) == PA_LOCKPTR(lockpa))
259 atomic_add_int(&pa_tryrelock_restart, 1);
268 * Sets the page size, perhaps based upon the memory
269 * size. Must be called before any use of page-size
270 * dependent functions.
273 vm_set_page_size(void)
275 if (vm_cnt.v_page_size == 0)
276 vm_cnt.v_page_size = PAGE_SIZE;
277 if (((vm_cnt.v_page_size - 1) & vm_cnt.v_page_size) != 0)
278 panic("vm_set_page_size: page size not a power of two");
282 * vm_page_blacklist_next:
284 * Find the next entry in the provided string of blacklist
285 * addresses. Entries are separated by space, comma, or newline.
286 * If an invalid integer is encountered then the rest of the
287 * string is skipped. Updates the list pointer to the next
288 * character, or NULL if the string is exhausted or invalid.
291 vm_page_blacklist_next(char **list, char *end)
296 if (list == NULL || *list == NULL)
304 * If there's no end pointer then the buffer is coming from
305 * the kenv and we know it's null-terminated.
308 end = *list + strlen(*list);
310 /* Ensure that strtoq() won't walk off the end */
312 if (*end == '\n' || *end == ' ' || *end == ',')
315 printf("Blacklist not terminated, skipping\n");
321 for (pos = *list; *pos != '\0'; pos = cp) {
322 bad = strtoq(pos, &cp, 0);
323 if (*cp == '\0' || *cp == ' ' || *cp == ',' || *cp == '\n') {
332 if (*cp == '\0' || ++cp >= end)
336 return (trunc_page(bad));
338 printf("Garbage in RAM blacklist, skipping\n");
344 vm_page_blacklist_add(vm_paddr_t pa, bool verbose)
346 struct vm_domain *vmd;
350 m = vm_phys_paddr_to_vm_page(pa);
352 return (true); /* page does not exist, no failure */
354 vmd = vm_pagequeue_domain(m);
355 vm_domain_free_lock(vmd);
356 ret = vm_phys_unfree_page(m);
357 vm_domain_free_unlock(vmd);
359 TAILQ_INSERT_TAIL(&blacklist_head, m, listq);
361 printf("Skipping page with pa 0x%jx\n", (uintmax_t)pa);
367 * vm_page_blacklist_check:
369 * Iterate through the provided string of blacklist addresses, pulling
370 * each entry out of the physical allocator free list and putting it
371 * onto a list for reporting via the vm.page_blacklist sysctl.
374 vm_page_blacklist_check(char *list, char *end)
380 while (next != NULL) {
381 if ((pa = vm_page_blacklist_next(&next, end)) == 0)
383 vm_page_blacklist_add(pa, bootverbose);
388 * vm_page_blacklist_load:
390 * Search for a special module named "ram_blacklist". It'll be a
391 * plain text file provided by the user via the loader directive
395 vm_page_blacklist_load(char **list, char **end)
404 mod = preload_search_by_type("ram_blacklist");
406 ptr = preload_fetch_addr(mod);
407 len = preload_fetch_size(mod);
418 sysctl_vm_page_blacklist(SYSCTL_HANDLER_ARGS)
425 error = sysctl_wire_old_buffer(req, 0);
428 sbuf_new_for_sysctl(&sbuf, NULL, 128, req);
429 TAILQ_FOREACH(m, &blacklist_head, listq) {
430 sbuf_printf(&sbuf, "%s%#jx", first ? "" : ",",
431 (uintmax_t)m->phys_addr);
434 error = sbuf_finish(&sbuf);
440 * Initialize a dummy page for use in scans of the specified paging queue.
441 * In principle, this function only needs to set the flag PG_MARKER.
442 * Nonetheless, it write busies and initializes the hold count to one as
443 * safety precautions.
446 vm_page_init_marker(vm_page_t marker, int queue, uint8_t aflags)
449 bzero(marker, sizeof(*marker));
450 marker->flags = PG_MARKER;
451 marker->aflags = aflags;
452 marker->busy_lock = VPB_SINGLE_EXCLUSIVER;
453 marker->queue = queue;
454 marker->hold_count = 1;
458 vm_page_domain_init(int domain)
460 struct vm_domain *vmd;
461 struct vm_pagequeue *pq;
464 vmd = VM_DOMAIN(domain);
465 bzero(vmd, sizeof(*vmd));
466 *__DECONST(char **, &vmd->vmd_pagequeues[PQ_INACTIVE].pq_name) =
467 "vm inactive pagequeue";
468 *__DECONST(char **, &vmd->vmd_pagequeues[PQ_ACTIVE].pq_name) =
469 "vm active pagequeue";
470 *__DECONST(char **, &vmd->vmd_pagequeues[PQ_LAUNDRY].pq_name) =
471 "vm laundry pagequeue";
472 *__DECONST(char **, &vmd->vmd_pagequeues[PQ_UNSWAPPABLE].pq_name) =
473 "vm unswappable pagequeue";
474 vmd->vmd_domain = domain;
475 vmd->vmd_page_count = 0;
476 vmd->vmd_free_count = 0;
478 vmd->vmd_oom = FALSE;
479 for (i = 0; i < PQ_COUNT; i++) {
480 pq = &vmd->vmd_pagequeues[i];
481 TAILQ_INIT(&pq->pq_pl);
482 mtx_init(&pq->pq_mutex, pq->pq_name, "vm pagequeue",
483 MTX_DEF | MTX_DUPOK);
484 vm_page_init_marker(&vmd->vmd_markers[i], i, 0);
486 mtx_init(&vmd->vmd_free_mtx, "vm page free queue", NULL, MTX_DEF);
487 mtx_init(&vmd->vmd_pageout_mtx, "vm pageout lock", NULL, MTX_DEF);
488 snprintf(vmd->vmd_name, sizeof(vmd->vmd_name), "%d", domain);
491 * inacthead is used to provide FIFO ordering for LRU-bypassing
494 vm_page_init_marker(&vmd->vmd_inacthead, PQ_INACTIVE, PGA_ENQUEUED);
495 TAILQ_INSERT_HEAD(&vmd->vmd_pagequeues[PQ_INACTIVE].pq_pl,
496 &vmd->vmd_inacthead, plinks.q);
499 * The clock pages are used to implement active queue scanning without
500 * requeues. Scans start at clock[0], which is advanced after the scan
501 * ends. When the two clock hands meet, they are reset and scanning
502 * resumes from the head of the queue.
504 vm_page_init_marker(&vmd->vmd_clock[0], PQ_ACTIVE, PGA_ENQUEUED);
505 vm_page_init_marker(&vmd->vmd_clock[1], PQ_ACTIVE, PGA_ENQUEUED);
506 TAILQ_INSERT_HEAD(&vmd->vmd_pagequeues[PQ_ACTIVE].pq_pl,
507 &vmd->vmd_clock[0], plinks.q);
508 TAILQ_INSERT_TAIL(&vmd->vmd_pagequeues[PQ_ACTIVE].pq_pl,
509 &vmd->vmd_clock[1], plinks.q);
513 * Initialize a physical page in preparation for adding it to the free
517 vm_page_init_page(vm_page_t m, vm_paddr_t pa, int segind)
522 m->busy_lock = VPB_UNBUSIED;
529 m->order = VM_NFREEORDER;
530 m->pool = VM_FREEPOOL_DEFAULT;
531 m->valid = m->dirty = 0;
538 * Initializes the resident memory module. Allocates physical memory for
539 * bootstrapping UMA and some data structures that are used to manage
540 * physical pages. Initializes these structures, and populates the free
544 vm_page_startup(vm_offset_t vaddr)
546 struct vm_phys_seg *seg;
548 char *list, *listend;
550 vm_paddr_t end, high_avail, low_avail, new_end, page_range, size;
551 vm_paddr_t biggestsize, last_pa, pa;
553 int biggestone, i, segind;
557 vaddr = round_page(vaddr);
559 for (i = 0; phys_avail[i + 1]; i += 2) {
560 phys_avail[i] = round_page(phys_avail[i]);
561 phys_avail[i + 1] = trunc_page(phys_avail[i + 1]);
563 for (i = 0; phys_avail[i + 1]; i += 2) {
564 size = phys_avail[i + 1] - phys_avail[i];
565 if (size > biggestsize) {
571 end = phys_avail[biggestone+1];
574 * Initialize the page and queue locks.
576 mtx_init(&vm_domainset_lock, "vm domainset lock", NULL, MTX_DEF);
577 for (i = 0; i < PA_LOCK_COUNT; i++)
578 mtx_init(&pa_lock[i], "vm page", NULL, MTX_DEF);
579 for (i = 0; i < vm_ndomains; i++)
580 vm_page_domain_init(i);
583 * Allocate memory for use when boot strapping the kernel memory
584 * allocator. Tell UMA how many zones we are going to create
585 * before going fully functional. UMA will add its zones.
587 * VM startup zones: vmem, vmem_btag, VM OBJECT, RADIX NODE, MAP,
588 * KMAP ENTRY, MAP ENTRY, VMSPACE.
590 boot_pages = uma_startup_count(8);
592 #ifndef UMA_MD_SMALL_ALLOC
593 /* vmem_startup() calls uma_prealloc(). */
594 boot_pages += vmem_startup_count();
595 /* vm_map_startup() calls uma_prealloc(). */
596 boot_pages += howmany(MAX_KMAP,
597 UMA_SLAB_SPACE / sizeof(struct vm_map));
600 * Before going fully functional kmem_init() does allocation
601 * from "KMAP ENTRY" and vmem_create() does allocation from "vmem".
606 * CTFLAG_RDTUN doesn't work during the early boot process, so we must
607 * manually fetch the value.
609 TUNABLE_INT_FETCH("vm.boot_pages", &boot_pages);
610 new_end = end - (boot_pages * UMA_SLAB_SIZE);
611 new_end = trunc_page(new_end);
612 mapped = pmap_map(&vaddr, new_end, end,
613 VM_PROT_READ | VM_PROT_WRITE);
614 bzero((void *)mapped, end - new_end);
615 uma_startup((void *)mapped, boot_pages);
619 new_end = end - round_page(witness_startup_count());
620 mapped = pmap_map(&vaddr, new_end, end,
621 VM_PROT_READ | VM_PROT_WRITE);
622 bzero((void *)mapped, end - new_end);
623 witness_startup((void *)mapped);
626 #if defined(__aarch64__) || defined(__amd64__) || defined(__arm__) || \
627 defined(__i386__) || defined(__mips__)
629 * Allocate a bitmap to indicate that a random physical page
630 * needs to be included in a minidump.
632 * The amd64 port needs this to indicate which direct map pages
633 * need to be dumped, via calls to dump_add_page()/dump_drop_page().
635 * However, i386 still needs this workspace internally within the
636 * minidump code. In theory, they are not needed on i386, but are
637 * included should the sf_buf code decide to use them.
640 for (i = 0; dump_avail[i + 1] != 0; i += 2)
641 if (dump_avail[i + 1] > last_pa)
642 last_pa = dump_avail[i + 1];
643 page_range = last_pa / PAGE_SIZE;
644 vm_page_dump_size = round_page(roundup2(page_range, NBBY) / NBBY);
645 new_end -= vm_page_dump_size;
646 vm_page_dump = (void *)(uintptr_t)pmap_map(&vaddr, new_end,
647 new_end + vm_page_dump_size, VM_PROT_READ | VM_PROT_WRITE);
648 bzero((void *)vm_page_dump, vm_page_dump_size);
652 #if defined(__aarch64__) || defined(__amd64__) || defined(__mips__)
654 * Include the UMA bootstrap pages and vm_page_dump in a crash dump.
655 * When pmap_map() uses the direct map, they are not automatically
658 for (pa = new_end; pa < end; pa += PAGE_SIZE)
661 phys_avail[biggestone + 1] = new_end;
664 * Request that the physical pages underlying the message buffer be
665 * included in a crash dump. Since the message buffer is accessed
666 * through the direct map, they are not automatically included.
668 pa = DMAP_TO_PHYS((vm_offset_t)msgbufp->msg_ptr);
669 last_pa = pa + round_page(msgbufsize);
670 while (pa < last_pa) {
676 * Compute the number of pages of memory that will be available for
677 * use, taking into account the overhead of a page structure per page.
678 * In other words, solve
679 * "available physical memory" - round_page(page_range *
680 * sizeof(struct vm_page)) = page_range * PAGE_SIZE
683 low_avail = phys_avail[0];
684 high_avail = phys_avail[1];
685 for (i = 0; i < vm_phys_nsegs; i++) {
686 if (vm_phys_segs[i].start < low_avail)
687 low_avail = vm_phys_segs[i].start;
688 if (vm_phys_segs[i].end > high_avail)
689 high_avail = vm_phys_segs[i].end;
691 /* Skip the first chunk. It is already accounted for. */
692 for (i = 2; phys_avail[i + 1] != 0; i += 2) {
693 if (phys_avail[i] < low_avail)
694 low_avail = phys_avail[i];
695 if (phys_avail[i + 1] > high_avail)
696 high_avail = phys_avail[i + 1];
698 first_page = low_avail / PAGE_SIZE;
699 #ifdef VM_PHYSSEG_SPARSE
701 for (i = 0; i < vm_phys_nsegs; i++)
702 size += vm_phys_segs[i].end - vm_phys_segs[i].start;
703 for (i = 0; phys_avail[i + 1] != 0; i += 2)
704 size += phys_avail[i + 1] - phys_avail[i];
705 #elif defined(VM_PHYSSEG_DENSE)
706 size = high_avail - low_avail;
708 #error "Either VM_PHYSSEG_DENSE or VM_PHYSSEG_SPARSE must be defined."
711 #ifdef VM_PHYSSEG_DENSE
713 * In the VM_PHYSSEG_DENSE case, the number of pages can account for
714 * the overhead of a page structure per page only if vm_page_array is
715 * allocated from the last physical memory chunk. Otherwise, we must
716 * allocate page structures representing the physical memory
717 * underlying vm_page_array, even though they will not be used.
719 if (new_end != high_avail)
720 page_range = size / PAGE_SIZE;
724 page_range = size / (PAGE_SIZE + sizeof(struct vm_page));
727 * If the partial bytes remaining are large enough for
728 * a page (PAGE_SIZE) without a corresponding
729 * 'struct vm_page', then new_end will contain an
730 * extra page after subtracting the length of the VM
731 * page array. Compensate by subtracting an extra
734 if (size % (PAGE_SIZE + sizeof(struct vm_page)) >= PAGE_SIZE) {
735 if (new_end == high_avail)
736 high_avail -= PAGE_SIZE;
737 new_end -= PAGE_SIZE;
743 * Reserve an unmapped guard page to trap access to vm_page_array[-1].
744 * However, because this page is allocated from KVM, out-of-bounds
745 * accesses using the direct map will not be trapped.
750 * Allocate physical memory for the page structures, and map it.
752 new_end = trunc_page(end - page_range * sizeof(struct vm_page));
753 mapped = pmap_map(&vaddr, new_end, end,
754 VM_PROT_READ | VM_PROT_WRITE);
755 vm_page_array = (vm_page_t)mapped;
756 vm_page_array_size = page_range;
758 #if VM_NRESERVLEVEL > 0
760 * Allocate physical memory for the reservation management system's
761 * data structures, and map it.
763 if (high_avail == end)
764 high_avail = new_end;
765 new_end = vm_reserv_startup(&vaddr, new_end, high_avail);
767 #if defined(__aarch64__) || defined(__amd64__) || defined(__mips__)
769 * Include vm_page_array and vm_reserv_array in a crash dump.
771 for (pa = new_end; pa < end; pa += PAGE_SIZE)
774 phys_avail[biggestone + 1] = new_end;
777 * Add physical memory segments corresponding to the available
780 for (i = 0; phys_avail[i + 1] != 0; i += 2)
781 vm_phys_add_seg(phys_avail[i], phys_avail[i + 1]);
784 * Initialize the physical memory allocator.
789 * Initialize the page structures and add every available page to the
790 * physical memory allocator's free lists.
792 vm_cnt.v_page_count = 0;
793 for (segind = 0; segind < vm_phys_nsegs; segind++) {
794 seg = &vm_phys_segs[segind];
795 for (m = seg->first_page, pa = seg->start; pa < seg->end;
796 m++, pa += PAGE_SIZE)
797 vm_page_init_page(m, pa, segind);
800 * Add the segment to the free lists only if it is covered by
801 * one of the ranges in phys_avail. Because we've added the
802 * ranges to the vm_phys_segs array, we can assume that each
803 * segment is either entirely contained in one of the ranges,
804 * or doesn't overlap any of them.
806 for (i = 0; phys_avail[i + 1] != 0; i += 2) {
807 struct vm_domain *vmd;
809 if (seg->start < phys_avail[i] ||
810 seg->end > phys_avail[i + 1])
814 pagecount = (u_long)atop(seg->end - seg->start);
816 vmd = VM_DOMAIN(seg->domain);
817 vm_domain_free_lock(vmd);
818 vm_phys_free_contig(m, pagecount);
819 vm_domain_free_unlock(vmd);
820 vm_domain_freecnt_inc(vmd, pagecount);
821 vm_cnt.v_page_count += (u_int)pagecount;
823 vmd = VM_DOMAIN(seg->domain);
824 vmd->vmd_page_count += (u_int)pagecount;
825 vmd->vmd_segs |= 1UL << m->segind;
831 * Remove blacklisted pages from the physical memory allocator.
833 TAILQ_INIT(&blacklist_head);
834 vm_page_blacklist_load(&list, &listend);
835 vm_page_blacklist_check(list, listend);
837 list = kern_getenv("vm.blacklist");
838 vm_page_blacklist_check(list, NULL);
841 #if VM_NRESERVLEVEL > 0
843 * Initialize the reservation management system.
848 * Set an initial domain policy for thread0 so that allocations
857 vm_page_reference(vm_page_t m)
860 vm_page_aflag_set(m, PGA_REFERENCED);
864 * vm_page_busy_downgrade:
866 * Downgrade an exclusive busy page into a single shared busy page.
869 vm_page_busy_downgrade(vm_page_t m)
874 vm_page_assert_xbusied(m);
875 locked = mtx_owned(vm_page_lockptr(m));
879 x &= VPB_BIT_WAITERS;
880 if (x != 0 && !locked)
882 if (atomic_cmpset_rel_int(&m->busy_lock,
883 VPB_SINGLE_EXCLUSIVER | x, VPB_SHARERS_WORD(1)))
885 if (x != 0 && !locked)
898 * Return a positive value if the page is shared busied, 0 otherwise.
901 vm_page_sbusied(vm_page_t m)
906 return ((x & VPB_BIT_SHARED) != 0 && x != VPB_UNBUSIED);
912 * Shared unbusy a page.
915 vm_page_sunbusy(vm_page_t m)
919 vm_page_lock_assert(m, MA_NOTOWNED);
920 vm_page_assert_sbusied(m);
924 if (VPB_SHARERS(x) > 1) {
925 if (atomic_cmpset_int(&m->busy_lock, x,
930 if ((x & VPB_BIT_WAITERS) == 0) {
931 KASSERT(x == VPB_SHARERS_WORD(1),
932 ("vm_page_sunbusy: invalid lock state"));
933 if (atomic_cmpset_int(&m->busy_lock,
934 VPB_SHARERS_WORD(1), VPB_UNBUSIED))
938 KASSERT(x == (VPB_SHARERS_WORD(1) | VPB_BIT_WAITERS),
939 ("vm_page_sunbusy: invalid lock state for waiters"));
942 if (!atomic_cmpset_int(&m->busy_lock, x, VPB_UNBUSIED)) {
953 * vm_page_busy_sleep:
955 * Sleep and release the page lock, using the page pointer as wchan.
956 * This is used to implement the hard-path of busying mechanism.
958 * The given page must be locked.
960 * If nonshared is true, sleep only if the page is xbusy.
963 vm_page_busy_sleep(vm_page_t m, const char *wmesg, bool nonshared)
967 vm_page_assert_locked(m);
970 if (x == VPB_UNBUSIED || (nonshared && (x & VPB_BIT_SHARED) != 0) ||
971 ((x & VPB_BIT_WAITERS) == 0 &&
972 !atomic_cmpset_int(&m->busy_lock, x, x | VPB_BIT_WAITERS))) {
976 msleep(m, vm_page_lockptr(m), PVM | PDROP, wmesg, 0);
982 * Try to shared busy a page.
983 * If the operation succeeds 1 is returned otherwise 0.
984 * The operation never sleeps.
987 vm_page_trysbusy(vm_page_t m)
993 if ((x & VPB_BIT_SHARED) == 0)
995 if (atomic_cmpset_acq_int(&m->busy_lock, x, x + VPB_ONE_SHARER))
1001 vm_page_xunbusy_locked(vm_page_t m)
1004 vm_page_assert_xbusied(m);
1005 vm_page_assert_locked(m);
1007 atomic_store_rel_int(&m->busy_lock, VPB_UNBUSIED);
1008 /* There is a waiter, do wakeup() instead of vm_page_flash(). */
1013 vm_page_xunbusy_maybelocked(vm_page_t m)
1017 vm_page_assert_xbusied(m);
1020 * Fast path for unbusy. If it succeeds, we know that there
1021 * are no waiters, so we do not need a wakeup.
1023 if (atomic_cmpset_rel_int(&m->busy_lock, VPB_SINGLE_EXCLUSIVER,
1027 lockacq = !mtx_owned(vm_page_lockptr(m));
1030 vm_page_xunbusy_locked(m);
1036 * vm_page_xunbusy_hard:
1038 * Called after the first try the exclusive unbusy of a page failed.
1039 * It is assumed that the waiters bit is on.
1042 vm_page_xunbusy_hard(vm_page_t m)
1045 vm_page_assert_xbusied(m);
1048 vm_page_xunbusy_locked(m);
1055 * Wakeup anyone waiting for the page.
1056 * The ownership bits do not change.
1058 * The given page must be locked.
1061 vm_page_flash(vm_page_t m)
1065 vm_page_lock_assert(m, MA_OWNED);
1069 if ((x & VPB_BIT_WAITERS) == 0)
1071 if (atomic_cmpset_int(&m->busy_lock, x,
1072 x & (~VPB_BIT_WAITERS)))
1079 * Avoid releasing and reacquiring the same page lock.
1082 vm_page_change_lock(vm_page_t m, struct mtx **mtx)
1086 mtx1 = vm_page_lockptr(m);
1096 * Keep page from being freed by the page daemon
1097 * much of the same effect as wiring, except much lower
1098 * overhead and should be used only for *very* temporary
1099 * holding ("wiring").
1102 vm_page_hold(vm_page_t mem)
1105 vm_page_lock_assert(mem, MA_OWNED);
1110 vm_page_unhold(vm_page_t mem)
1113 vm_page_lock_assert(mem, MA_OWNED);
1114 KASSERT(mem->hold_count >= 1, ("vm_page_unhold: hold count < 0!!!"));
1116 if (mem->hold_count == 0 && (mem->flags & PG_UNHOLDFREE) != 0)
1117 vm_page_free_toq(mem);
1121 * vm_page_unhold_pages:
1123 * Unhold each of the pages that is referenced by the given array.
1126 vm_page_unhold_pages(vm_page_t *ma, int count)
1131 for (; count != 0; count--) {
1132 vm_page_change_lock(*ma, &mtx);
1133 vm_page_unhold(*ma);
1141 PHYS_TO_VM_PAGE(vm_paddr_t pa)
1145 #ifdef VM_PHYSSEG_SPARSE
1146 m = vm_phys_paddr_to_vm_page(pa);
1148 m = vm_phys_fictitious_to_vm_page(pa);
1150 #elif defined(VM_PHYSSEG_DENSE)
1154 if (pi >= first_page && (pi - first_page) < vm_page_array_size) {
1155 m = &vm_page_array[pi - first_page];
1158 return (vm_phys_fictitious_to_vm_page(pa));
1160 #error "Either VM_PHYSSEG_DENSE or VM_PHYSSEG_SPARSE must be defined."
1167 * Create a fictitious page with the specified physical address and
1168 * memory attribute. The memory attribute is the only the machine-
1169 * dependent aspect of a fictitious page that must be initialized.
1172 vm_page_getfake(vm_paddr_t paddr, vm_memattr_t memattr)
1176 m = uma_zalloc(fakepg_zone, M_WAITOK | M_ZERO);
1177 vm_page_initfake(m, paddr, memattr);
1182 vm_page_initfake(vm_page_t m, vm_paddr_t paddr, vm_memattr_t memattr)
1185 if ((m->flags & PG_FICTITIOUS) != 0) {
1187 * The page's memattr might have changed since the
1188 * previous initialization. Update the pmap to the
1193 m->phys_addr = paddr;
1195 /* Fictitious pages don't use "segind". */
1196 m->flags = PG_FICTITIOUS;
1197 /* Fictitious pages don't use "order" or "pool". */
1198 m->oflags = VPO_UNMANAGED;
1199 m->busy_lock = VPB_SINGLE_EXCLUSIVER;
1203 pmap_page_set_memattr(m, memattr);
1209 * Release a fictitious page.
1212 vm_page_putfake(vm_page_t m)
1215 KASSERT((m->oflags & VPO_UNMANAGED) != 0, ("managed %p", m));
1216 KASSERT((m->flags & PG_FICTITIOUS) != 0,
1217 ("vm_page_putfake: bad page %p", m));
1218 uma_zfree(fakepg_zone, m);
1222 * vm_page_updatefake:
1224 * Update the given fictitious page to the specified physical address and
1228 vm_page_updatefake(vm_page_t m, vm_paddr_t paddr, vm_memattr_t memattr)
1231 KASSERT((m->flags & PG_FICTITIOUS) != 0,
1232 ("vm_page_updatefake: bad page %p", m));
1233 m->phys_addr = paddr;
1234 pmap_page_set_memattr(m, memattr);
1243 vm_page_free(vm_page_t m)
1246 m->flags &= ~PG_ZERO;
1247 vm_page_free_toq(m);
1251 * vm_page_free_zero:
1253 * Free a page to the zerod-pages queue
1256 vm_page_free_zero(vm_page_t m)
1259 m->flags |= PG_ZERO;
1260 vm_page_free_toq(m);
1264 * Unbusy and handle the page queueing for a page from a getpages request that
1265 * was optionally read ahead or behind.
1268 vm_page_readahead_finish(vm_page_t m)
1271 /* We shouldn't put invalid pages on queues. */
1272 KASSERT(m->valid != 0, ("%s: %p is invalid", __func__, m));
1275 * Since the page is not the actually needed one, whether it should
1276 * be activated or deactivated is not obvious. Empirical results
1277 * have shown that deactivating the page is usually the best choice,
1278 * unless the page is wanted by another thread.
1281 if ((m->busy_lock & VPB_BIT_WAITERS) != 0)
1282 vm_page_activate(m);
1284 vm_page_deactivate(m);
1290 * vm_page_sleep_if_busy:
1292 * Sleep and release the page queues lock if the page is busied.
1293 * Returns TRUE if the thread slept.
1295 * The given page must be unlocked and object containing it must
1299 vm_page_sleep_if_busy(vm_page_t m, const char *msg)
1303 vm_page_lock_assert(m, MA_NOTOWNED);
1304 VM_OBJECT_ASSERT_WLOCKED(m->object);
1306 if (vm_page_busied(m)) {
1308 * The page-specific object must be cached because page
1309 * identity can change during the sleep, causing the
1310 * re-lock of a different object.
1311 * It is assumed that a reference to the object is already
1312 * held by the callers.
1316 VM_OBJECT_WUNLOCK(obj);
1317 vm_page_busy_sleep(m, msg, false);
1318 VM_OBJECT_WLOCK(obj);
1325 * vm_page_dirty_KBI: [ internal use only ]
1327 * Set all bits in the page's dirty field.
1329 * The object containing the specified page must be locked if the
1330 * call is made from the machine-independent layer.
1332 * See vm_page_clear_dirty_mask().
1334 * This function should only be called by vm_page_dirty().
1337 vm_page_dirty_KBI(vm_page_t m)
1340 /* Refer to this operation by its public name. */
1341 KASSERT(m->valid == VM_PAGE_BITS_ALL,
1342 ("vm_page_dirty: page is invalid!"));
1343 m->dirty = VM_PAGE_BITS_ALL;
1347 * vm_page_insert: [ internal use only ]
1349 * Inserts the given mem entry into the object and object list.
1351 * The object must be locked.
1354 vm_page_insert(vm_page_t m, vm_object_t object, vm_pindex_t pindex)
1358 VM_OBJECT_ASSERT_WLOCKED(object);
1359 mpred = vm_radix_lookup_le(&object->rtree, pindex);
1360 return (vm_page_insert_after(m, object, pindex, mpred));
1364 * vm_page_insert_after:
1366 * Inserts the page "m" into the specified object at offset "pindex".
1368 * The page "mpred" must immediately precede the offset "pindex" within
1369 * the specified object.
1371 * The object must be locked.
1374 vm_page_insert_after(vm_page_t m, vm_object_t object, vm_pindex_t pindex,
1379 VM_OBJECT_ASSERT_WLOCKED(object);
1380 KASSERT(m->object == NULL,
1381 ("vm_page_insert_after: page already inserted"));
1382 if (mpred != NULL) {
1383 KASSERT(mpred->object == object,
1384 ("vm_page_insert_after: object doesn't contain mpred"));
1385 KASSERT(mpred->pindex < pindex,
1386 ("vm_page_insert_after: mpred doesn't precede pindex"));
1387 msucc = TAILQ_NEXT(mpred, listq);
1389 msucc = TAILQ_FIRST(&object->memq);
1391 KASSERT(msucc->pindex > pindex,
1392 ("vm_page_insert_after: msucc doesn't succeed pindex"));
1395 * Record the object/offset pair in this page
1401 * Now link into the object's ordered list of backed pages.
1403 if (vm_radix_insert(&object->rtree, m)) {
1408 vm_page_insert_radixdone(m, object, mpred);
1413 * vm_page_insert_radixdone:
1415 * Complete page "m" insertion into the specified object after the
1416 * radix trie hooking.
1418 * The page "mpred" must precede the offset "m->pindex" within the
1421 * The object must be locked.
1424 vm_page_insert_radixdone(vm_page_t m, vm_object_t object, vm_page_t mpred)
1427 VM_OBJECT_ASSERT_WLOCKED(object);
1428 KASSERT(object != NULL && m->object == object,
1429 ("vm_page_insert_radixdone: page %p has inconsistent object", m));
1430 if (mpred != NULL) {
1431 KASSERT(mpred->object == object,
1432 ("vm_page_insert_after: object doesn't contain mpred"));
1433 KASSERT(mpred->pindex < m->pindex,
1434 ("vm_page_insert_after: mpred doesn't precede pindex"));
1438 TAILQ_INSERT_AFTER(&object->memq, mpred, m, listq);
1440 TAILQ_INSERT_HEAD(&object->memq, m, listq);
1443 * Show that the object has one more resident page.
1445 object->resident_page_count++;
1448 * Hold the vnode until the last page is released.
1450 if (object->resident_page_count == 1 && object->type == OBJT_VNODE)
1451 vhold(object->handle);
1454 * Since we are inserting a new and possibly dirty page,
1455 * update the object's OBJ_MIGHTBEDIRTY flag.
1457 if (pmap_page_is_write_mapped(m))
1458 vm_object_set_writeable_dirty(object);
1464 * Removes the specified page from its containing object, but does not
1465 * invalidate any backing storage.
1467 * The object must be locked. The page must be locked if it is managed.
1470 vm_page_remove(vm_page_t m)
1475 if ((m->oflags & VPO_UNMANAGED) == 0)
1476 vm_page_assert_locked(m);
1477 if ((object = m->object) == NULL)
1479 VM_OBJECT_ASSERT_WLOCKED(object);
1480 if (vm_page_xbusied(m))
1481 vm_page_xunbusy_maybelocked(m);
1482 mrem = vm_radix_remove(&object->rtree, m->pindex);
1483 KASSERT(mrem == m, ("removed page %p, expected page %p", mrem, m));
1486 * Now remove from the object's list of backed pages.
1488 TAILQ_REMOVE(&object->memq, m, listq);
1491 * And show that the object has one fewer resident page.
1493 object->resident_page_count--;
1496 * The vnode may now be recycled.
1498 if (object->resident_page_count == 0 && object->type == OBJT_VNODE)
1499 vdrop(object->handle);
1507 * Returns the page associated with the object/offset
1508 * pair specified; if none is found, NULL is returned.
1510 * The object must be locked.
1513 vm_page_lookup(vm_object_t object, vm_pindex_t pindex)
1516 VM_OBJECT_ASSERT_LOCKED(object);
1517 return (vm_radix_lookup(&object->rtree, pindex));
1521 * vm_page_find_least:
1523 * Returns the page associated with the object with least pindex
1524 * greater than or equal to the parameter pindex, or NULL.
1526 * The object must be locked.
1529 vm_page_find_least(vm_object_t object, vm_pindex_t pindex)
1533 VM_OBJECT_ASSERT_LOCKED(object);
1534 if ((m = TAILQ_FIRST(&object->memq)) != NULL && m->pindex < pindex)
1535 m = vm_radix_lookup_ge(&object->rtree, pindex);
1540 * Returns the given page's successor (by pindex) within the object if it is
1541 * resident; if none is found, NULL is returned.
1543 * The object must be locked.
1546 vm_page_next(vm_page_t m)
1550 VM_OBJECT_ASSERT_LOCKED(m->object);
1551 if ((next = TAILQ_NEXT(m, listq)) != NULL) {
1552 MPASS(next->object == m->object);
1553 if (next->pindex != m->pindex + 1)
1560 * Returns the given page's predecessor (by pindex) within the object if it is
1561 * resident; if none is found, NULL is returned.
1563 * The object must be locked.
1566 vm_page_prev(vm_page_t m)
1570 VM_OBJECT_ASSERT_LOCKED(m->object);
1571 if ((prev = TAILQ_PREV(m, pglist, listq)) != NULL) {
1572 MPASS(prev->object == m->object);
1573 if (prev->pindex != m->pindex - 1)
1580 * Uses the page mnew as a replacement for an existing page at index
1581 * pindex which must be already present in the object.
1583 * The existing page must not be on a paging queue.
1586 vm_page_replace(vm_page_t mnew, vm_object_t object, vm_pindex_t pindex)
1590 VM_OBJECT_ASSERT_WLOCKED(object);
1591 KASSERT(mnew->object == NULL,
1592 ("vm_page_replace: page %p already in object", mnew));
1593 KASSERT(mnew->queue == PQ_NONE,
1594 ("vm_page_replace: new page %p is on a paging queue", mnew));
1597 * This function mostly follows vm_page_insert() and
1598 * vm_page_remove() without the radix, object count and vnode
1599 * dance. Double check such functions for more comments.
1602 mnew->object = object;
1603 mnew->pindex = pindex;
1604 mold = vm_radix_replace(&object->rtree, mnew);
1605 KASSERT(mold->queue == PQ_NONE,
1606 ("vm_page_replace: old page %p is on a paging queue", mold));
1608 /* Keep the resident page list in sorted order. */
1609 TAILQ_INSERT_AFTER(&object->memq, mold, mnew, listq);
1610 TAILQ_REMOVE(&object->memq, mold, listq);
1612 mold->object = NULL;
1613 vm_page_xunbusy_maybelocked(mold);
1616 * The object's resident_page_count does not change because we have
1617 * swapped one page for another, but OBJ_MIGHTBEDIRTY.
1619 if (pmap_page_is_write_mapped(mnew))
1620 vm_object_set_writeable_dirty(object);
1627 * Move the given memory entry from its
1628 * current object to the specified target object/offset.
1630 * Note: swap associated with the page must be invalidated by the move. We
1631 * have to do this for several reasons: (1) we aren't freeing the
1632 * page, (2) we are dirtying the page, (3) the VM system is probably
1633 * moving the page from object A to B, and will then later move
1634 * the backing store from A to B and we can't have a conflict.
1636 * Note: we *always* dirty the page. It is necessary both for the
1637 * fact that we moved it, and because we may be invalidating
1640 * The objects must be locked.
1643 vm_page_rename(vm_page_t m, vm_object_t new_object, vm_pindex_t new_pindex)
1648 VM_OBJECT_ASSERT_WLOCKED(new_object);
1650 mpred = vm_radix_lookup_le(&new_object->rtree, new_pindex);
1651 KASSERT(mpred == NULL || mpred->pindex != new_pindex,
1652 ("vm_page_rename: pindex already renamed"));
1655 * Create a custom version of vm_page_insert() which does not depend
1656 * by m_prev and can cheat on the implementation aspects of the
1660 m->pindex = new_pindex;
1661 if (vm_radix_insert(&new_object->rtree, m)) {
1667 * The operation cannot fail anymore. The removal must happen before
1668 * the listq iterator is tainted.
1674 /* Return back to the new pindex to complete vm_page_insert(). */
1675 m->pindex = new_pindex;
1676 m->object = new_object;
1678 vm_page_insert_radixdone(m, new_object, mpred);
1686 * Allocate and return a page that is associated with the specified
1687 * object and offset pair. By default, this page is exclusive busied.
1689 * The caller must always specify an allocation class.
1691 * allocation classes:
1692 * VM_ALLOC_NORMAL normal process request
1693 * VM_ALLOC_SYSTEM system *really* needs a page
1694 * VM_ALLOC_INTERRUPT interrupt time request
1696 * optional allocation flags:
1697 * VM_ALLOC_COUNT(number) the number of additional pages that the caller
1698 * intends to allocate
1699 * VM_ALLOC_NOBUSY do not exclusive busy the page
1700 * VM_ALLOC_NODUMP do not include the page in a kernel core dump
1701 * VM_ALLOC_NOOBJ page is not associated with an object and
1702 * should not be exclusive busy
1703 * VM_ALLOC_SBUSY shared busy the allocated page
1704 * VM_ALLOC_WIRED wire the allocated page
1705 * VM_ALLOC_ZERO prefer a zeroed page
1708 vm_page_alloc(vm_object_t object, vm_pindex_t pindex, int req)
1711 return (vm_page_alloc_after(object, pindex, req, object != NULL ?
1712 vm_radix_lookup_le(&object->rtree, pindex) : NULL));
1716 vm_page_alloc_domain(vm_object_t object, vm_pindex_t pindex, int domain,
1720 return (vm_page_alloc_domain_after(object, pindex, domain, req,
1721 object != NULL ? vm_radix_lookup_le(&object->rtree, pindex) :
1726 * Allocate a page in the specified object with the given page index. To
1727 * optimize insertion of the page into the object, the caller must also specifiy
1728 * the resident page in the object with largest index smaller than the given
1729 * page index, or NULL if no such page exists.
1732 vm_page_alloc_after(vm_object_t object, vm_pindex_t pindex,
1733 int req, vm_page_t mpred)
1735 struct vm_domainset_iter di;
1739 vm_domainset_iter_page_init(&di, object, pindex, &domain, &req);
1741 m = vm_page_alloc_domain_after(object, pindex, domain, req,
1745 } while (vm_domainset_iter_page(&di, &domain, &req) == 0);
1751 * Returns true if the number of free pages exceeds the minimum
1752 * for the request class and false otherwise.
1755 vm_domain_allocate(struct vm_domain *vmd, int req, int npages)
1757 u_int limit, old, new;
1759 req = req & VM_ALLOC_CLASS_MASK;
1762 * The page daemon is allowed to dig deeper into the free page list.
1764 if (curproc == pageproc && req != VM_ALLOC_INTERRUPT)
1765 req = VM_ALLOC_SYSTEM;
1766 if (req == VM_ALLOC_INTERRUPT)
1768 else if (req == VM_ALLOC_SYSTEM)
1769 limit = vmd->vmd_interrupt_free_min;
1771 limit = vmd->vmd_free_reserved;
1774 * Attempt to reserve the pages. Fail if we're below the limit.
1777 old = vmd->vmd_free_count;
1782 } while (atomic_fcmpset_int(&vmd->vmd_free_count, &old, new) == 0);
1784 /* Wake the page daemon if we've crossed the threshold. */
1785 if (vm_paging_needed(vmd, new) && !vm_paging_needed(vmd, old))
1786 pagedaemon_wakeup(vmd->vmd_domain);
1788 /* Only update bitsets on transitions. */
1789 if ((old >= vmd->vmd_free_min && new < vmd->vmd_free_min) ||
1790 (old >= vmd->vmd_free_severe && new < vmd->vmd_free_severe))
1797 vm_page_alloc_domain_after(vm_object_t object, vm_pindex_t pindex, int domain,
1798 int req, vm_page_t mpred)
1800 struct vm_domain *vmd;
1804 KASSERT((object != NULL) == ((req & VM_ALLOC_NOOBJ) == 0) &&
1805 (object != NULL || (req & VM_ALLOC_SBUSY) == 0) &&
1806 ((req & (VM_ALLOC_NOBUSY | VM_ALLOC_SBUSY)) !=
1807 (VM_ALLOC_NOBUSY | VM_ALLOC_SBUSY)),
1808 ("inconsistent object(%p)/req(%x)", object, req));
1809 KASSERT(object == NULL || (req & VM_ALLOC_WAITOK) == 0,
1810 ("Can't sleep and retry object insertion."));
1811 KASSERT(mpred == NULL || mpred->pindex < pindex,
1812 ("mpred %p doesn't precede pindex 0x%jx", mpred,
1813 (uintmax_t)pindex));
1815 VM_OBJECT_ASSERT_WLOCKED(object);
1819 #if VM_NRESERVLEVEL > 0
1821 * Can we allocate the page from a reservation?
1823 if (vm_object_reserv(object) &&
1824 ((m = vm_reserv_extend(req, object, pindex, domain, mpred)) != NULL ||
1825 (m = vm_reserv_alloc_page(req, object, pindex, domain, mpred)) != NULL)) {
1826 domain = vm_phys_domain(m);
1827 vmd = VM_DOMAIN(domain);
1831 vmd = VM_DOMAIN(domain);
1832 if (object != NULL && vmd->vmd_pgcache != NULL) {
1833 m = uma_zalloc(vmd->vmd_pgcache, M_NOWAIT);
1837 if (vm_domain_allocate(vmd, req, 1)) {
1839 * If not, allocate it from the free page queues.
1841 vm_domain_free_lock(vmd);
1842 m = vm_phys_alloc_pages(domain, object != NULL ?
1843 VM_FREEPOOL_DEFAULT : VM_FREEPOOL_DIRECT, 0);
1844 vm_domain_free_unlock(vmd);
1846 vm_domain_freecnt_inc(vmd, 1);
1847 #if VM_NRESERVLEVEL > 0
1848 if (vm_reserv_reclaim_inactive(domain))
1855 * Not allocatable, give up.
1857 if (vm_domain_alloc_fail(vmd, object, req))
1863 * At this point we had better have found a good page.
1865 KASSERT(m != NULL, ("missing page"));
1869 vm_page_alloc_check(m);
1872 * Initialize the page. Only the PG_ZERO flag is inherited.
1875 if ((req & VM_ALLOC_ZERO) != 0)
1878 if ((req & VM_ALLOC_NODUMP) != 0)
1882 m->oflags = object == NULL || (object->flags & OBJ_UNMANAGED) != 0 ?
1884 m->busy_lock = VPB_UNBUSIED;
1885 if ((req & (VM_ALLOC_NOBUSY | VM_ALLOC_NOOBJ | VM_ALLOC_SBUSY)) == 0)
1886 m->busy_lock = VPB_SINGLE_EXCLUSIVER;
1887 if ((req & VM_ALLOC_SBUSY) != 0)
1888 m->busy_lock = VPB_SHARERS_WORD(1);
1889 if (req & VM_ALLOC_WIRED) {
1891 * The page lock is not required for wiring a page until that
1892 * page is inserted into the object.
1899 if (object != NULL) {
1900 if (vm_page_insert_after(m, object, pindex, mpred)) {
1901 if (req & VM_ALLOC_WIRED) {
1905 KASSERT(m->object == NULL, ("page %p has object", m));
1906 m->oflags = VPO_UNMANAGED;
1907 m->busy_lock = VPB_UNBUSIED;
1908 /* Don't change PG_ZERO. */
1909 vm_page_free_toq(m);
1910 if (req & VM_ALLOC_WAITFAIL) {
1911 VM_OBJECT_WUNLOCK(object);
1913 VM_OBJECT_WLOCK(object);
1918 /* Ignore device objects; the pager sets "memattr" for them. */
1919 if (object->memattr != VM_MEMATTR_DEFAULT &&
1920 (object->flags & OBJ_FICTITIOUS) == 0)
1921 pmap_page_set_memattr(m, object->memattr);
1929 * vm_page_alloc_contig:
1931 * Allocate a contiguous set of physical pages of the given size "npages"
1932 * from the free lists. All of the physical pages must be at or above
1933 * the given physical address "low" and below the given physical address
1934 * "high". The given value "alignment" determines the alignment of the
1935 * first physical page in the set. If the given value "boundary" is
1936 * non-zero, then the set of physical pages cannot cross any physical
1937 * address boundary that is a multiple of that value. Both "alignment"
1938 * and "boundary" must be a power of two.
1940 * If the specified memory attribute, "memattr", is VM_MEMATTR_DEFAULT,
1941 * then the memory attribute setting for the physical pages is configured
1942 * to the object's memory attribute setting. Otherwise, the memory
1943 * attribute setting for the physical pages is configured to "memattr",
1944 * overriding the object's memory attribute setting. However, if the
1945 * object's memory attribute setting is not VM_MEMATTR_DEFAULT, then the
1946 * memory attribute setting for the physical pages cannot be configured
1947 * to VM_MEMATTR_DEFAULT.
1949 * The specified object may not contain fictitious pages.
1951 * The caller must always specify an allocation class.
1953 * allocation classes:
1954 * VM_ALLOC_NORMAL normal process request
1955 * VM_ALLOC_SYSTEM system *really* needs a page
1956 * VM_ALLOC_INTERRUPT interrupt time request
1958 * optional allocation flags:
1959 * VM_ALLOC_NOBUSY do not exclusive busy the page
1960 * VM_ALLOC_NODUMP do not include the page in a kernel core dump
1961 * VM_ALLOC_NOOBJ page is not associated with an object and
1962 * should not be exclusive busy
1963 * VM_ALLOC_SBUSY shared busy the allocated page
1964 * VM_ALLOC_WIRED wire the allocated page
1965 * VM_ALLOC_ZERO prefer a zeroed page
1968 vm_page_alloc_contig(vm_object_t object, vm_pindex_t pindex, int req,
1969 u_long npages, vm_paddr_t low, vm_paddr_t high, u_long alignment,
1970 vm_paddr_t boundary, vm_memattr_t memattr)
1972 struct vm_domainset_iter di;
1976 vm_domainset_iter_page_init(&di, object, pindex, &domain, &req);
1978 m = vm_page_alloc_contig_domain(object, pindex, domain, req,
1979 npages, low, high, alignment, boundary, memattr);
1982 } while (vm_domainset_iter_page(&di, &domain, &req) == 0);
1988 vm_page_alloc_contig_domain(vm_object_t object, vm_pindex_t pindex, int domain,
1989 int req, u_long npages, vm_paddr_t low, vm_paddr_t high, u_long alignment,
1990 vm_paddr_t boundary, vm_memattr_t memattr)
1992 struct vm_domain *vmd;
1993 vm_page_t m, m_ret, mpred;
1994 u_int busy_lock, flags, oflags;
1996 mpred = NULL; /* XXX: pacify gcc */
1997 KASSERT((object != NULL) == ((req & VM_ALLOC_NOOBJ) == 0) &&
1998 (object != NULL || (req & VM_ALLOC_SBUSY) == 0) &&
1999 ((req & (VM_ALLOC_NOBUSY | VM_ALLOC_SBUSY)) !=
2000 (VM_ALLOC_NOBUSY | VM_ALLOC_SBUSY)),
2001 ("vm_page_alloc_contig: inconsistent object(%p)/req(%x)", object,
2003 KASSERT(object == NULL || (req & VM_ALLOC_WAITOK) == 0,
2004 ("Can't sleep and retry object insertion."));
2005 if (object != NULL) {
2006 VM_OBJECT_ASSERT_WLOCKED(object);
2007 KASSERT((object->flags & OBJ_FICTITIOUS) == 0,
2008 ("vm_page_alloc_contig: object %p has fictitious pages",
2011 KASSERT(npages > 0, ("vm_page_alloc_contig: npages is zero"));
2013 if (object != NULL) {
2014 mpred = vm_radix_lookup_le(&object->rtree, pindex);
2015 KASSERT(mpred == NULL || mpred->pindex != pindex,
2016 ("vm_page_alloc_contig: pindex already allocated"));
2020 * Can we allocate the pages without the number of free pages falling
2021 * below the lower bound for the allocation class?
2024 #if VM_NRESERVLEVEL > 0
2026 * Can we allocate the pages from a reservation?
2028 if (vm_object_reserv(object) &&
2029 ((m_ret = vm_reserv_extend_contig(req, object, pindex, domain,
2030 npages, low, high, alignment, boundary, mpred)) != NULL ||
2031 (m_ret = vm_reserv_alloc_contig(req, object, pindex, domain,
2032 npages, low, high, alignment, boundary, mpred)) != NULL)) {
2033 domain = vm_phys_domain(m_ret);
2034 vmd = VM_DOMAIN(domain);
2039 vmd = VM_DOMAIN(domain);
2040 if (vm_domain_allocate(vmd, req, npages)) {
2042 * allocate them from the free page queues.
2044 vm_domain_free_lock(vmd);
2045 m_ret = vm_phys_alloc_contig(domain, npages, low, high,
2046 alignment, boundary);
2047 vm_domain_free_unlock(vmd);
2048 if (m_ret == NULL) {
2049 vm_domain_freecnt_inc(vmd, npages);
2050 #if VM_NRESERVLEVEL > 0
2051 if (vm_reserv_reclaim_contig(domain, npages, low,
2052 high, alignment, boundary))
2057 if (m_ret == NULL) {
2058 if (vm_domain_alloc_fail(vmd, object, req))
2062 #if VM_NRESERVLEVEL > 0
2065 for (m = m_ret; m < &m_ret[npages]; m++) {
2067 vm_page_alloc_check(m);
2071 * Initialize the pages. Only the PG_ZERO flag is inherited.
2074 if ((req & VM_ALLOC_ZERO) != 0)
2076 if ((req & VM_ALLOC_NODUMP) != 0)
2078 oflags = object == NULL || (object->flags & OBJ_UNMANAGED) != 0 ?
2080 busy_lock = VPB_UNBUSIED;
2081 if ((req & (VM_ALLOC_NOBUSY | VM_ALLOC_NOOBJ | VM_ALLOC_SBUSY)) == 0)
2082 busy_lock = VPB_SINGLE_EXCLUSIVER;
2083 if ((req & VM_ALLOC_SBUSY) != 0)
2084 busy_lock = VPB_SHARERS_WORD(1);
2085 if ((req & VM_ALLOC_WIRED) != 0)
2086 vm_wire_add(npages);
2087 if (object != NULL) {
2088 if (object->memattr != VM_MEMATTR_DEFAULT &&
2089 memattr == VM_MEMATTR_DEFAULT)
2090 memattr = object->memattr;
2092 for (m = m_ret; m < &m_ret[npages]; m++) {
2094 m->flags = (m->flags | PG_NODUMP) & flags;
2095 m->busy_lock = busy_lock;
2096 if ((req & VM_ALLOC_WIRED) != 0)
2100 if (object != NULL) {
2101 if (vm_page_insert_after(m, object, pindex, mpred)) {
2102 if ((req & VM_ALLOC_WIRED) != 0)
2103 vm_wire_sub(npages);
2104 KASSERT(m->object == NULL,
2105 ("page %p has object", m));
2107 for (m = m_ret; m < &m_ret[npages]; m++) {
2109 (req & VM_ALLOC_WIRED) != 0)
2111 m->oflags = VPO_UNMANAGED;
2112 m->busy_lock = VPB_UNBUSIED;
2113 /* Don't change PG_ZERO. */
2114 vm_page_free_toq(m);
2116 if (req & VM_ALLOC_WAITFAIL) {
2117 VM_OBJECT_WUNLOCK(object);
2119 VM_OBJECT_WLOCK(object);
2126 if (memattr != VM_MEMATTR_DEFAULT)
2127 pmap_page_set_memattr(m, memattr);
2134 * Check a page that has been freshly dequeued from a freelist.
2137 vm_page_alloc_check(vm_page_t m)
2140 KASSERT(m->object == NULL, ("page %p has object", m));
2141 KASSERT(m->queue == PQ_NONE,
2142 ("page %p has unexpected queue %d", m, m->queue));
2143 KASSERT(!vm_page_held(m), ("page %p is held", m));
2144 KASSERT(!vm_page_busied(m), ("page %p is busy", m));
2145 KASSERT(m->dirty == 0, ("page %p is dirty", m));
2146 KASSERT(pmap_page_get_memattr(m) == VM_MEMATTR_DEFAULT,
2147 ("page %p has unexpected memattr %d",
2148 m, pmap_page_get_memattr(m)));
2149 KASSERT(m->valid == 0, ("free page %p is valid", m));
2153 * vm_page_alloc_freelist:
2155 * Allocate a physical page from the specified free page list.
2157 * The caller must always specify an allocation class.
2159 * allocation classes:
2160 * VM_ALLOC_NORMAL normal process request
2161 * VM_ALLOC_SYSTEM system *really* needs a page
2162 * VM_ALLOC_INTERRUPT interrupt time request
2164 * optional allocation flags:
2165 * VM_ALLOC_COUNT(number) the number of additional pages that the caller
2166 * intends to allocate
2167 * VM_ALLOC_WIRED wire the allocated page
2168 * VM_ALLOC_ZERO prefer a zeroed page
2171 vm_page_alloc_freelist(int freelist, int req)
2173 struct vm_domainset_iter di;
2177 vm_domainset_iter_page_init(&di, NULL, 0, &domain, &req);
2179 m = vm_page_alloc_freelist_domain(domain, freelist, req);
2182 } while (vm_domainset_iter_page(&di, &domain, &req) == 0);
2188 vm_page_alloc_freelist_domain(int domain, int freelist, int req)
2190 struct vm_domain *vmd;
2195 * Do not allocate reserved pages unless the req has asked for it.
2197 vmd = VM_DOMAIN(domain);
2199 if (vm_domain_allocate(vmd, req, 1)) {
2200 vm_domain_free_lock(vmd);
2201 m = vm_phys_alloc_freelist_pages(domain, freelist,
2202 VM_FREEPOOL_DIRECT, 0);
2203 vm_domain_free_unlock(vmd);
2205 vm_domain_freecnt_inc(vmd, 1);
2208 if (vm_domain_alloc_fail(vmd, NULL, req))
2213 vm_page_alloc_check(m);
2216 * Initialize the page. Only the PG_ZERO flag is inherited.
2220 if ((req & VM_ALLOC_ZERO) != 0)
2223 if ((req & VM_ALLOC_WIRED) != 0) {
2225 * The page lock is not required for wiring a page that does
2226 * not belong to an object.
2231 /* Unmanaged pages don't use "act_count". */
2232 m->oflags = VPO_UNMANAGED;
2237 vm_page_import(void *arg, void **store, int cnt, int domain, int flags)
2239 struct vm_domain *vmd;
2244 /* Only import if we can bring in a full bucket. */
2245 if (cnt == 1 || !vm_domain_allocate(vmd, VM_ALLOC_NORMAL, cnt))
2247 domain = vmd->vmd_domain;
2248 n = 64; /* Starting stride, arbitrary. */
2249 vm_domain_free_lock(vmd);
2250 for (i = 0; i < cnt; i+=n) {
2251 n = vm_phys_alloc_npages(domain, VM_FREELIST_DEFAULT, &m,
2255 for (j = 0; j < n; j++)
2258 vm_domain_free_unlock(vmd);
2260 vm_domain_freecnt_inc(vmd, cnt - i);
2266 vm_page_release(void *arg, void **store, int cnt)
2268 struct vm_domain *vmd;
2273 vm_domain_free_lock(vmd);
2274 for (i = 0; i < cnt; i++) {
2275 m = (vm_page_t)store[i];
2276 vm_phys_free_pages(m, 0);
2278 vm_domain_free_unlock(vmd);
2279 vm_domain_freecnt_inc(vmd, cnt);
2282 #define VPSC_ANY 0 /* No restrictions. */
2283 #define VPSC_NORESERV 1 /* Skip reservations; implies VPSC_NOSUPER. */
2284 #define VPSC_NOSUPER 2 /* Skip superpages. */
2287 * vm_page_scan_contig:
2289 * Scan vm_page_array[] between the specified entries "m_start" and
2290 * "m_end" for a run of contiguous physical pages that satisfy the
2291 * specified conditions, and return the lowest page in the run. The
2292 * specified "alignment" determines the alignment of the lowest physical
2293 * page in the run. If the specified "boundary" is non-zero, then the
2294 * run of physical pages cannot span a physical address that is a
2295 * multiple of "boundary".
2297 * "m_end" is never dereferenced, so it need not point to a vm_page
2298 * structure within vm_page_array[].
2300 * "npages" must be greater than zero. "m_start" and "m_end" must not
2301 * span a hole (or discontiguity) in the physical address space. Both
2302 * "alignment" and "boundary" must be a power of two.
2305 vm_page_scan_contig(u_long npages, vm_page_t m_start, vm_page_t m_end,
2306 u_long alignment, vm_paddr_t boundary, int options)
2312 #if VM_NRESERVLEVEL > 0
2315 int m_inc, order, run_ext, run_len;
2317 KASSERT(npages > 0, ("npages is 0"));
2318 KASSERT(powerof2(alignment), ("alignment is not a power of 2"));
2319 KASSERT(powerof2(boundary), ("boundary is not a power of 2"));
2323 for (m = m_start; m < m_end && run_len < npages; m += m_inc) {
2324 KASSERT((m->flags & PG_MARKER) == 0,
2325 ("page %p is PG_MARKER", m));
2326 KASSERT((m->flags & PG_FICTITIOUS) == 0 || m->wire_count == 1,
2327 ("fictitious page %p has invalid wire count", m));
2330 * If the current page would be the start of a run, check its
2331 * physical address against the end, alignment, and boundary
2332 * conditions. If it doesn't satisfy these conditions, either
2333 * terminate the scan or advance to the next page that
2334 * satisfies the failed condition.
2337 KASSERT(m_run == NULL, ("m_run != NULL"));
2338 if (m + npages > m_end)
2340 pa = VM_PAGE_TO_PHYS(m);
2341 if ((pa & (alignment - 1)) != 0) {
2342 m_inc = atop(roundup2(pa, alignment) - pa);
2345 if (rounddown2(pa ^ (pa + ptoa(npages) - 1),
2347 m_inc = atop(roundup2(pa, boundary) - pa);
2351 KASSERT(m_run != NULL, ("m_run == NULL"));
2353 vm_page_change_lock(m, &m_mtx);
2356 if (vm_page_held(m))
2358 #if VM_NRESERVLEVEL > 0
2359 else if ((level = vm_reserv_level(m)) >= 0 &&
2360 (options & VPSC_NORESERV) != 0) {
2362 /* Advance to the end of the reservation. */
2363 pa = VM_PAGE_TO_PHYS(m);
2364 m_inc = atop(roundup2(pa + 1, vm_reserv_size(level)) -
2368 else if ((object = m->object) != NULL) {
2370 * The page is considered eligible for relocation if
2371 * and only if it could be laundered or reclaimed by
2374 if (!VM_OBJECT_TRYRLOCK(object)) {
2376 VM_OBJECT_RLOCK(object);
2378 if (m->object != object) {
2380 * The page may have been freed.
2382 VM_OBJECT_RUNLOCK(object);
2384 } else if (vm_page_held(m)) {
2389 KASSERT((m->flags & PG_UNHOLDFREE) == 0,
2390 ("page %p is PG_UNHOLDFREE", m));
2391 /* Don't care: PG_NODUMP, PG_ZERO. */
2392 if (object->type != OBJT_DEFAULT &&
2393 object->type != OBJT_SWAP &&
2394 object->type != OBJT_VNODE) {
2396 #if VM_NRESERVLEVEL > 0
2397 } else if ((options & VPSC_NOSUPER) != 0 &&
2398 (level = vm_reserv_level_iffullpop(m)) >= 0) {
2400 /* Advance to the end of the superpage. */
2401 pa = VM_PAGE_TO_PHYS(m);
2402 m_inc = atop(roundup2(pa + 1,
2403 vm_reserv_size(level)) - pa);
2405 } else if (object->memattr == VM_MEMATTR_DEFAULT &&
2406 vm_page_enqueued(m) && !vm_page_busied(m)) {
2408 * The page is allocated but eligible for
2409 * relocation. Extend the current run by one
2412 KASSERT(pmap_page_get_memattr(m) ==
2414 ("page %p has an unexpected memattr", m));
2415 KASSERT((m->oflags & (VPO_SWAPINPROG |
2416 VPO_SWAPSLEEP | VPO_UNMANAGED)) == 0,
2417 ("page %p has unexpected oflags", m));
2418 /* Don't care: VPO_NOSYNC. */
2423 VM_OBJECT_RUNLOCK(object);
2424 #if VM_NRESERVLEVEL > 0
2425 } else if (level >= 0) {
2427 * The page is reserved but not yet allocated. In
2428 * other words, it is still free. Extend the current
2433 } else if ((order = m->order) < VM_NFREEORDER) {
2435 * The page is enqueued in the physical memory
2436 * allocator's free page queues. Moreover, it is the
2437 * first page in a power-of-two-sized run of
2438 * contiguous free pages. Add these pages to the end
2439 * of the current run, and jump ahead.
2441 run_ext = 1 << order;
2445 * Skip the page for one of the following reasons: (1)
2446 * It is enqueued in the physical memory allocator's
2447 * free page queues. However, it is not the first
2448 * page in a run of contiguous free pages. (This case
2449 * rarely occurs because the scan is performed in
2450 * ascending order.) (2) It is not reserved, and it is
2451 * transitioning from free to allocated. (Conversely,
2452 * the transition from allocated to free for managed
2453 * pages is blocked by the page lock.) (3) It is
2454 * allocated but not contained by an object and not
2455 * wired, e.g., allocated by Xen's balloon driver.
2461 * Extend or reset the current run of pages.
2476 if (run_len >= npages)
2482 * vm_page_reclaim_run:
2484 * Try to relocate each of the allocated virtual pages within the
2485 * specified run of physical pages to a new physical address. Free the
2486 * physical pages underlying the relocated virtual pages. A virtual page
2487 * is relocatable if and only if it could be laundered or reclaimed by
2488 * the page daemon. Whenever possible, a virtual page is relocated to a
2489 * physical address above "high".
2491 * Returns 0 if every physical page within the run was already free or
2492 * just freed by a successful relocation. Otherwise, returns a non-zero
2493 * value indicating why the last attempt to relocate a virtual page was
2496 * "req_class" must be an allocation class.
2499 vm_page_reclaim_run(int req_class, int domain, u_long npages, vm_page_t m_run,
2502 struct vm_domain *vmd;
2504 struct spglist free;
2507 vm_page_t m, m_end, m_new;
2508 int error, order, req;
2510 KASSERT((req_class & VM_ALLOC_CLASS_MASK) == req_class,
2511 ("req_class is not an allocation class"));
2515 m_end = m_run + npages;
2517 for (; error == 0 && m < m_end; m++) {
2518 KASSERT((m->flags & (PG_FICTITIOUS | PG_MARKER)) == 0,
2519 ("page %p is PG_FICTITIOUS or PG_MARKER", m));
2522 * Avoid releasing and reacquiring the same page lock.
2524 vm_page_change_lock(m, &m_mtx);
2526 if (vm_page_held(m))
2528 else if ((object = m->object) != NULL) {
2530 * The page is relocated if and only if it could be
2531 * laundered or reclaimed by the page daemon.
2533 if (!VM_OBJECT_TRYWLOCK(object)) {
2535 VM_OBJECT_WLOCK(object);
2537 if (m->object != object) {
2539 * The page may have been freed.
2541 VM_OBJECT_WUNLOCK(object);
2543 } else if (vm_page_held(m)) {
2548 KASSERT((m->flags & PG_UNHOLDFREE) == 0,
2549 ("page %p is PG_UNHOLDFREE", m));
2550 /* Don't care: PG_NODUMP, PG_ZERO. */
2551 if (object->type != OBJT_DEFAULT &&
2552 object->type != OBJT_SWAP &&
2553 object->type != OBJT_VNODE)
2555 else if (object->memattr != VM_MEMATTR_DEFAULT)
2557 else if (vm_page_enqueued(m) && !vm_page_busied(m)) {
2558 KASSERT(pmap_page_get_memattr(m) ==
2560 ("page %p has an unexpected memattr", m));
2561 KASSERT((m->oflags & (VPO_SWAPINPROG |
2562 VPO_SWAPSLEEP | VPO_UNMANAGED)) == 0,
2563 ("page %p has unexpected oflags", m));
2564 /* Don't care: VPO_NOSYNC. */
2565 if (m->valid != 0) {
2567 * First, try to allocate a new page
2568 * that is above "high". Failing
2569 * that, try to allocate a new page
2570 * that is below "m_run". Allocate
2571 * the new page between the end of
2572 * "m_run" and "high" only as a last
2575 req = req_class | VM_ALLOC_NOOBJ;
2576 if ((m->flags & PG_NODUMP) != 0)
2577 req |= VM_ALLOC_NODUMP;
2578 if (trunc_page(high) !=
2579 ~(vm_paddr_t)PAGE_MASK) {
2580 m_new = vm_page_alloc_contig(
2585 VM_MEMATTR_DEFAULT);
2588 if (m_new == NULL) {
2589 pa = VM_PAGE_TO_PHYS(m_run);
2590 m_new = vm_page_alloc_contig(
2592 0, pa - 1, PAGE_SIZE, 0,
2593 VM_MEMATTR_DEFAULT);
2595 if (m_new == NULL) {
2597 m_new = vm_page_alloc_contig(
2599 pa, high, PAGE_SIZE, 0,
2600 VM_MEMATTR_DEFAULT);
2602 if (m_new == NULL) {
2606 KASSERT(m_new->wire_count == 0,
2607 ("page %p is wired", m_new));
2610 * Replace "m" with the new page. For
2611 * vm_page_replace(), "m" must be busy
2612 * and dequeued. Finally, change "m"
2613 * as if vm_page_free() was called.
2615 if (object->ref_count != 0)
2617 m_new->aflags = m->aflags &
2618 ~PGA_QUEUE_STATE_MASK;
2619 KASSERT(m_new->oflags == VPO_UNMANAGED,
2620 ("page %p is managed", m_new));
2621 m_new->oflags = m->oflags & VPO_NOSYNC;
2622 pmap_copy_page(m, m_new);
2623 m_new->valid = m->valid;
2624 m_new->dirty = m->dirty;
2625 m->flags &= ~PG_ZERO;
2628 vm_page_replace_checked(m_new, object,
2630 if (vm_page_free_prep(m))
2631 SLIST_INSERT_HEAD(&free, m,
2635 * The new page must be deactivated
2636 * before the object is unlocked.
2638 vm_page_change_lock(m_new, &m_mtx);
2639 vm_page_deactivate(m_new);
2641 m->flags &= ~PG_ZERO;
2644 if (vm_page_free_prep(m))
2645 SLIST_INSERT_HEAD(&free, m,
2647 KASSERT(m->dirty == 0,
2648 ("page %p is dirty", m));
2653 VM_OBJECT_WUNLOCK(object);
2655 MPASS(vm_phys_domain(m) == domain);
2656 vmd = VM_DOMAIN(domain);
2657 vm_domain_free_lock(vmd);
2659 if (order < VM_NFREEORDER) {
2661 * The page is enqueued in the physical memory
2662 * allocator's free page queues. Moreover, it
2663 * is the first page in a power-of-two-sized
2664 * run of contiguous free pages. Jump ahead
2665 * to the last page within that run, and
2666 * continue from there.
2668 m += (1 << order) - 1;
2670 #if VM_NRESERVLEVEL > 0
2671 else if (vm_reserv_is_page_free(m))
2674 vm_domain_free_unlock(vmd);
2675 if (order == VM_NFREEORDER)
2681 if ((m = SLIST_FIRST(&free)) != NULL) {
2684 vmd = VM_DOMAIN(domain);
2686 vm_domain_free_lock(vmd);
2688 MPASS(vm_phys_domain(m) == domain);
2689 SLIST_REMOVE_HEAD(&free, plinks.s.ss);
2690 vm_phys_free_pages(m, 0);
2692 } while ((m = SLIST_FIRST(&free)) != NULL);
2693 vm_domain_free_unlock(vmd);
2694 vm_domain_freecnt_inc(vmd, cnt);
2701 CTASSERT(powerof2(NRUNS));
2703 #define RUN_INDEX(count) ((count) & (NRUNS - 1))
2705 #define MIN_RECLAIM 8
2708 * vm_page_reclaim_contig:
2710 * Reclaim allocated, contiguous physical memory satisfying the specified
2711 * conditions by relocating the virtual pages using that physical memory.
2712 * Returns true if reclamation is successful and false otherwise. Since
2713 * relocation requires the allocation of physical pages, reclamation may
2714 * fail due to a shortage of free pages. When reclamation fails, callers
2715 * are expected to perform vm_wait() before retrying a failed allocation
2716 * operation, e.g., vm_page_alloc_contig().
2718 * The caller must always specify an allocation class through "req".
2720 * allocation classes:
2721 * VM_ALLOC_NORMAL normal process request
2722 * VM_ALLOC_SYSTEM system *really* needs a page
2723 * VM_ALLOC_INTERRUPT interrupt time request
2725 * The optional allocation flags are ignored.
2727 * "npages" must be greater than zero. Both "alignment" and "boundary"
2728 * must be a power of two.
2731 vm_page_reclaim_contig_domain(int domain, int req, u_long npages,
2732 vm_paddr_t low, vm_paddr_t high, u_long alignment, vm_paddr_t boundary)
2734 struct vm_domain *vmd;
2735 vm_paddr_t curr_low;
2736 vm_page_t m_run, m_runs[NRUNS];
2737 u_long count, reclaimed;
2738 int error, i, options, req_class;
2740 KASSERT(npages > 0, ("npages is 0"));
2741 KASSERT(powerof2(alignment), ("alignment is not a power of 2"));
2742 KASSERT(powerof2(boundary), ("boundary is not a power of 2"));
2743 req_class = req & VM_ALLOC_CLASS_MASK;
2746 * The page daemon is allowed to dig deeper into the free page list.
2748 if (curproc == pageproc && req_class != VM_ALLOC_INTERRUPT)
2749 req_class = VM_ALLOC_SYSTEM;
2752 * Return if the number of free pages cannot satisfy the requested
2755 vmd = VM_DOMAIN(domain);
2756 count = vmd->vmd_free_count;
2757 if (count < npages + vmd->vmd_free_reserved || (count < npages +
2758 vmd->vmd_interrupt_free_min && req_class == VM_ALLOC_SYSTEM) ||
2759 (count < npages && req_class == VM_ALLOC_INTERRUPT))
2763 * Scan up to three times, relaxing the restrictions ("options") on
2764 * the reclamation of reservations and superpages each time.
2766 for (options = VPSC_NORESERV;;) {
2768 * Find the highest runs that satisfy the given constraints
2769 * and restrictions, and record them in "m_runs".
2774 m_run = vm_phys_scan_contig(domain, npages, curr_low,
2775 high, alignment, boundary, options);
2778 curr_low = VM_PAGE_TO_PHYS(m_run) + ptoa(npages);
2779 m_runs[RUN_INDEX(count)] = m_run;
2784 * Reclaim the highest runs in LIFO (descending) order until
2785 * the number of reclaimed pages, "reclaimed", is at least
2786 * MIN_RECLAIM. Reset "reclaimed" each time because each
2787 * reclamation is idempotent, and runs will (likely) recur
2788 * from one scan to the next as restrictions are relaxed.
2791 for (i = 0; count > 0 && i < NRUNS; i++) {
2793 m_run = m_runs[RUN_INDEX(count)];
2794 error = vm_page_reclaim_run(req_class, domain, npages,
2797 reclaimed += npages;
2798 if (reclaimed >= MIN_RECLAIM)
2804 * Either relax the restrictions on the next scan or return if
2805 * the last scan had no restrictions.
2807 if (options == VPSC_NORESERV)
2808 options = VPSC_NOSUPER;
2809 else if (options == VPSC_NOSUPER)
2811 else if (options == VPSC_ANY)
2812 return (reclaimed != 0);
2817 vm_page_reclaim_contig(int req, u_long npages, vm_paddr_t low, vm_paddr_t high,
2818 u_long alignment, vm_paddr_t boundary)
2820 struct vm_domainset_iter di;
2824 vm_domainset_iter_page_init(&di, NULL, 0, &domain, &req);
2826 ret = vm_page_reclaim_contig_domain(domain, req, npages, low,
2827 high, alignment, boundary);
2830 } while (vm_domainset_iter_page(&di, &domain, &req) == 0);
2836 * Set the domain in the appropriate page level domainset.
2839 vm_domain_set(struct vm_domain *vmd)
2842 mtx_lock(&vm_domainset_lock);
2843 if (!vmd->vmd_minset && vm_paging_min(vmd)) {
2844 vmd->vmd_minset = 1;
2845 DOMAINSET_SET(vmd->vmd_domain, &vm_min_domains);
2847 if (!vmd->vmd_severeset && vm_paging_severe(vmd)) {
2848 vmd->vmd_severeset = 1;
2849 DOMAINSET_CLR(vmd->vmd_domain, &vm_severe_domains);
2851 mtx_unlock(&vm_domainset_lock);
2855 * Clear the domain from the appropriate page level domainset.
2858 vm_domain_clear(struct vm_domain *vmd)
2861 mtx_lock(&vm_domainset_lock);
2862 if (vmd->vmd_minset && !vm_paging_min(vmd)) {
2863 vmd->vmd_minset = 0;
2864 DOMAINSET_CLR(vmd->vmd_domain, &vm_min_domains);
2865 if (vm_min_waiters != 0) {
2867 wakeup(&vm_min_domains);
2870 if (vmd->vmd_severeset && !vm_paging_severe(vmd)) {
2871 vmd->vmd_severeset = 0;
2872 DOMAINSET_CLR(vmd->vmd_domain, &vm_severe_domains);
2873 if (vm_severe_waiters != 0) {
2874 vm_severe_waiters = 0;
2875 wakeup(&vm_severe_domains);
2880 * If pageout daemon needs pages, then tell it that there are
2883 if (vmd->vmd_pageout_pages_needed &&
2884 vmd->vmd_free_count >= vmd->vmd_pageout_free_min) {
2885 wakeup(&vmd->vmd_pageout_pages_needed);
2886 vmd->vmd_pageout_pages_needed = 0;
2889 /* See comments in vm_wait_doms(). */
2890 if (vm_pageproc_waiters) {
2891 vm_pageproc_waiters = 0;
2892 wakeup(&vm_pageproc_waiters);
2894 mtx_unlock(&vm_domainset_lock);
2898 * Wait for free pages to exceed the min threshold globally.
2904 mtx_lock(&vm_domainset_lock);
2905 while (vm_page_count_min()) {
2907 msleep(&vm_min_domains, &vm_domainset_lock, PVM, "vmwait", 0);
2909 mtx_unlock(&vm_domainset_lock);
2913 * Wait for free pages to exceed the severe threshold globally.
2916 vm_wait_severe(void)
2919 mtx_lock(&vm_domainset_lock);
2920 while (vm_page_count_severe()) {
2921 vm_severe_waiters++;
2922 msleep(&vm_severe_domains, &vm_domainset_lock, PVM,
2925 mtx_unlock(&vm_domainset_lock);
2932 return (vm_severe_waiters + vm_min_waiters + vm_pageproc_waiters);
2936 vm_wait_doms(const domainset_t *wdoms)
2940 * We use racey wakeup synchronization to avoid expensive global
2941 * locking for the pageproc when sleeping with a non-specific vm_wait.
2942 * To handle this, we only sleep for one tick in this instance. It
2943 * is expected that most allocations for the pageproc will come from
2944 * kmem or vm_page_grab* which will use the more specific and
2945 * race-free vm_wait_domain().
2947 if (curproc == pageproc) {
2948 mtx_lock(&vm_domainset_lock);
2949 vm_pageproc_waiters++;
2950 msleep(&vm_pageproc_waiters, &vm_domainset_lock, PVM | PDROP,
2954 * XXX Ideally we would wait only until the allocation could
2955 * be satisfied. This condition can cause new allocators to
2956 * consume all freed pages while old allocators wait.
2958 mtx_lock(&vm_domainset_lock);
2959 if (DOMAINSET_SUBSET(&vm_min_domains, wdoms)) {
2961 msleep(&vm_min_domains, &vm_domainset_lock, PVM,
2964 mtx_unlock(&vm_domainset_lock);
2971 * Sleep until free pages are available for allocation.
2972 * - Called in various places after failed memory allocations.
2975 vm_wait_domain(int domain)
2977 struct vm_domain *vmd;
2980 vmd = VM_DOMAIN(domain);
2981 vm_domain_free_assert_unlocked(vmd);
2983 if (curproc == pageproc) {
2984 mtx_lock(&vm_domainset_lock);
2985 if (vmd->vmd_free_count < vmd->vmd_pageout_free_min) {
2986 vmd->vmd_pageout_pages_needed = 1;
2987 msleep(&vmd->vmd_pageout_pages_needed,
2988 &vm_domainset_lock, PDROP | PSWP, "VMWait", 0);
2990 mtx_unlock(&vm_domainset_lock);
2992 if (pageproc == NULL)
2993 panic("vm_wait in early boot");
2994 DOMAINSET_ZERO(&wdom);
2995 DOMAINSET_SET(vmd->vmd_domain, &wdom);
2996 vm_wait_doms(&wdom);
3003 * Sleep until free pages are available for allocation in the
3004 * affinity domains of the obj. If obj is NULL, the domain set
3005 * for the calling thread is used.
3006 * Called in various places after failed memory allocations.
3009 vm_wait(vm_object_t obj)
3011 struct domainset *d;
3016 * Carefully fetch pointers only once: the struct domainset
3017 * itself is ummutable but the pointer might change.
3020 d = obj->domain.dr_policy;
3022 d = curthread->td_domain.dr_policy;
3024 vm_wait_doms(&d->ds_mask);
3028 * vm_domain_alloc_fail:
3030 * Called when a page allocation function fails. Informs the
3031 * pagedaemon and performs the requested wait. Requires the
3032 * domain_free and object lock on entry. Returns with the
3033 * object lock held and free lock released. Returns an error when
3034 * retry is necessary.
3038 vm_domain_alloc_fail(struct vm_domain *vmd, vm_object_t object, int req)
3041 vm_domain_free_assert_unlocked(vmd);
3043 atomic_add_int(&vmd->vmd_pageout_deficit,
3044 max((u_int)req >> VM_ALLOC_COUNT_SHIFT, 1));
3045 if (req & (VM_ALLOC_WAITOK | VM_ALLOC_WAITFAIL)) {
3047 VM_OBJECT_WUNLOCK(object);
3048 vm_wait_domain(vmd->vmd_domain);
3050 VM_OBJECT_WLOCK(object);
3051 if (req & VM_ALLOC_WAITOK)
3061 * Sleep until free pages are available for allocation.
3062 * - Called only in vm_fault so that processes page faulting
3063 * can be easily tracked.
3064 * - Sleeps at a lower priority than vm_wait() so that vm_wait()ing
3065 * processes will be able to grab memory first. Do not change
3066 * this balance without careful testing first.
3072 mtx_lock(&vm_domainset_lock);
3073 if (vm_page_count_min()) {
3075 msleep(&vm_min_domains, &vm_domainset_lock, PUSER, "pfault", 0);
3077 mtx_unlock(&vm_domainset_lock);
3080 struct vm_pagequeue *
3081 vm_page_pagequeue(vm_page_t m)
3084 return (&vm_pagequeue_domain(m)->vmd_pagequeues[m->queue]);
3088 vm_page_pagequeue_lockptr(vm_page_t m)
3091 if (m->queue == PQ_NONE)
3093 return (&vm_page_pagequeue(m)->pq_mutex);
3097 vm_pqbatch_process_page(struct vm_pagequeue *pq, vm_page_t m)
3099 struct vm_domain *vmd;
3102 vm_pagequeue_assert_locked(pq);
3103 KASSERT(pq == vm_page_pagequeue(m),
3104 ("page %p doesn't belong to %p", m, pq));
3107 if ((aflags & PGA_DEQUEUE) != 0) {
3108 if (__predict_true((aflags & PGA_ENQUEUED) != 0)) {
3109 TAILQ_REMOVE(&pq->pq_pl, m, plinks.q);
3110 vm_pagequeue_cnt_dec(pq);
3112 vm_page_dequeue_complete(m);
3113 } else if ((aflags & (PGA_REQUEUE | PGA_REQUEUE_HEAD)) != 0) {
3114 if ((aflags & PGA_ENQUEUED) != 0)
3115 TAILQ_REMOVE(&pq->pq_pl, m, plinks.q);
3117 vm_pagequeue_cnt_inc(pq);
3118 vm_page_aflag_set(m, PGA_ENQUEUED);
3120 if ((aflags & PGA_REQUEUE_HEAD) != 0) {
3121 KASSERT(m->queue == PQ_INACTIVE,
3122 ("head enqueue not supported for page %p", m));
3123 vmd = vm_pagequeue_domain(m);
3124 TAILQ_INSERT_BEFORE(&vmd->vmd_inacthead, m, plinks.q);
3126 TAILQ_INSERT_TAIL(&pq->pq_pl, m, plinks.q);
3129 * PGA_REQUEUE and PGA_REQUEUE_HEAD must be cleared after
3130 * setting PGA_ENQUEUED in order to synchronize with the
3133 vm_page_aflag_clear(m, PGA_REQUEUE | PGA_REQUEUE_HEAD);
3138 vm_pqbatch_process(struct vm_pagequeue *pq, struct vm_batchqueue *bq,
3144 for (i = 0; i < bq->bq_cnt; i++) {
3146 if (__predict_false(m->queue != queue))
3148 vm_pqbatch_process_page(pq, m);
3150 vm_batchqueue_init(bq);
3154 vm_pqbatch_submit_page(vm_page_t m, uint8_t queue)
3156 struct vm_batchqueue *bq;
3157 struct vm_pagequeue *pq;
3160 vm_page_assert_locked(m);
3161 KASSERT(queue < PQ_COUNT, ("invalid queue %d", queue));
3163 domain = vm_phys_domain(m);
3164 pq = &vm_pagequeue_domain(m)->vmd_pagequeues[queue];
3167 bq = DPCPU_PTR(pqbatch[domain][queue]);
3168 if (vm_batchqueue_insert(bq, m)) {
3172 if (!vm_pagequeue_trylock(pq)) {
3174 vm_pagequeue_lock(pq);
3176 bq = DPCPU_PTR(pqbatch[domain][queue]);
3178 vm_pqbatch_process(pq, bq, queue);
3181 * The page may have been logically dequeued before we acquired the
3182 * page queue lock. In this case, the page lock prevents the page
3183 * from being logically enqueued elsewhere.
3185 if (__predict_true(m->queue == queue))
3186 vm_pqbatch_process_page(pq, m);
3188 KASSERT(m->queue == PQ_NONE,
3189 ("invalid queue transition for page %p", m));
3190 KASSERT((m->aflags & PGA_ENQUEUED) == 0,
3191 ("page %p is enqueued with invalid queue index", m));
3192 vm_page_aflag_clear(m, PGA_QUEUE_STATE_MASK);
3194 vm_pagequeue_unlock(pq);
3199 * vm_page_drain_pqbatch: [ internal use only ]
3201 * Force all per-CPU page queue batch queues to be drained. This is
3202 * intended for use in severe memory shortages, to ensure that pages
3203 * do not remain stuck in the batch queues.
3206 vm_page_drain_pqbatch(void)
3209 struct vm_domain *vmd;
3210 struct vm_pagequeue *pq;
3211 int cpu, domain, queue;
3216 sched_bind(td, cpu);
3219 for (domain = 0; domain < vm_ndomains; domain++) {
3220 vmd = VM_DOMAIN(domain);
3221 for (queue = 0; queue < PQ_COUNT; queue++) {
3222 pq = &vmd->vmd_pagequeues[queue];
3223 vm_pagequeue_lock(pq);
3225 vm_pqbatch_process(pq,
3226 DPCPU_PTR(pqbatch[domain][queue]), queue);
3228 vm_pagequeue_unlock(pq);
3238 * Complete the logical removal of a page from a page queue. We must be
3239 * careful to synchronize with the page daemon, which may be concurrently
3240 * examining the page with only the page lock held. The page must not be
3241 * in a state where it appears to be logically enqueued.
3244 vm_page_dequeue_complete(vm_page_t m)
3248 atomic_thread_fence_rel();
3249 vm_page_aflag_clear(m, PGA_QUEUE_STATE_MASK);
3253 * vm_page_dequeue_deferred: [ internal use only ]
3255 * Request removal of the given page from its current page
3256 * queue. Physical removal from the queue may be deferred
3259 * The page must be locked.
3262 vm_page_dequeue_deferred(vm_page_t m)
3266 vm_page_assert_locked(m);
3269 if (queue == PQ_NONE) {
3270 KASSERT((m->aflags & PGA_QUEUE_STATE_MASK) == 0,
3271 ("page %p has queue state", m));
3274 if ((m->aflags & PGA_DEQUEUE) == 0)
3275 vm_page_aflag_set(m, PGA_DEQUEUE);
3276 vm_pqbatch_submit_page(m, queue);
3280 * vm_page_dequeue_locked:
3282 * Remove the page from its page queue, which must be locked.
3283 * If the page lock is not held, there is no guarantee that the
3284 * page will not be enqueued by another thread before this function
3285 * returns. In this case, it is up to the caller to ensure that
3286 * no other threads hold a reference to the page.
3288 * The page queue lock must be held. If the page is not already
3289 * logically dequeued, the page lock must be held as well.
3292 vm_page_dequeue_locked(vm_page_t m)
3294 struct vm_pagequeue *pq;
3296 pq = vm_page_pagequeue(m);
3298 KASSERT(m->queue != PQ_NONE,
3299 ("%s: page %p queue field is PQ_NONE", __func__, m));
3300 vm_pagequeue_assert_locked(pq);
3301 KASSERT((m->aflags & PGA_DEQUEUE) != 0 ||
3302 mtx_owned(vm_page_lockptr(m)),
3303 ("%s: queued unlocked page %p", __func__, m));
3305 if ((m->aflags & PGA_ENQUEUED) != 0) {
3306 TAILQ_REMOVE(&pq->pq_pl, m, plinks.q);
3307 vm_pagequeue_cnt_dec(pq);
3309 vm_page_dequeue_complete(m);
3315 * Remove the page from whichever page queue it's in, if any.
3316 * If the page lock is not held, there is no guarantee that the
3317 * page will not be enqueued by another thread before this function
3318 * returns. In this case, it is up to the caller to ensure that
3319 * no other threads hold a reference to the page.
3322 vm_page_dequeue(vm_page_t m)
3324 struct mtx *lock, *lock1;
3326 lock = vm_page_pagequeue_lockptr(m);
3331 if ((lock1 = vm_page_pagequeue_lockptr(m)) == lock)
3336 KASSERT(lock == vm_page_pagequeue_lockptr(m),
3337 ("%s: page %p migrated directly between queues", __func__, m));
3338 vm_page_dequeue_locked(m);
3343 * Schedule the given page for insertion into the specified page queue.
3344 * Physical insertion of the page may be deferred indefinitely.
3347 vm_page_enqueue(vm_page_t m, uint8_t queue)
3350 vm_page_assert_locked(m);
3351 KASSERT(m->queue == PQ_NONE && (m->aflags & PGA_QUEUE_STATE_MASK) == 0,
3352 ("%s: page %p is already enqueued", __func__, m));
3355 if ((m->aflags & PGA_REQUEUE) == 0)
3356 vm_page_aflag_set(m, PGA_REQUEUE);
3357 vm_pqbatch_submit_page(m, queue);
3361 * vm_page_requeue: [ internal use only ]
3363 * Schedule a requeue of the given page.
3365 * The page must be locked.
3368 vm_page_requeue(vm_page_t m)
3371 vm_page_assert_locked(m);
3372 KASSERT(m->queue != PQ_NONE,
3373 ("%s: page %p is not logically enqueued", __func__, m));
3375 if ((m->aflags & PGA_REQUEUE) == 0)
3376 vm_page_aflag_set(m, PGA_REQUEUE);
3377 vm_pqbatch_submit_page(m, m->queue);
3383 * Put the specified page on the active list (if appropriate).
3384 * Ensure that act_count is at least ACT_INIT but do not otherwise
3387 * The page must be locked.
3390 vm_page_activate(vm_page_t m)
3394 vm_page_lock_assert(m, MA_OWNED);
3396 if ((queue = m->queue) == PQ_ACTIVE || m->wire_count > 0 ||
3397 (m->oflags & VPO_UNMANAGED) != 0) {
3398 if (queue == PQ_ACTIVE && m->act_count < ACT_INIT)
3399 m->act_count = ACT_INIT;
3404 if (m->act_count < ACT_INIT)
3405 m->act_count = ACT_INIT;
3406 vm_page_enqueue(m, PQ_ACTIVE);
3410 * vm_page_free_prep:
3412 * Prepares the given page to be put on the free list,
3413 * disassociating it from any VM object. The caller may return
3414 * the page to the free list only if this function returns true.
3416 * The object must be locked. The page must be locked if it is
3420 vm_page_free_prep(vm_page_t m)
3423 #if defined(DIAGNOSTIC) && defined(PHYS_TO_DMAP)
3424 if (PMAP_HAS_DMAP && (m->flags & PG_ZERO) != 0) {
3427 p = (uint64_t *)PHYS_TO_DMAP(VM_PAGE_TO_PHYS(m));
3428 for (i = 0; i < PAGE_SIZE / sizeof(uint64_t); i++, p++)
3429 KASSERT(*p == 0, ("vm_page_free_prep %p PG_ZERO %d %jx",
3430 m, i, (uintmax_t)*p));
3433 if ((m->oflags & VPO_UNMANAGED) == 0) {
3434 vm_page_lock_assert(m, MA_OWNED);
3435 KASSERT(!pmap_page_is_mapped(m),
3436 ("vm_page_free_prep: freeing mapped page %p", m));
3438 KASSERT(m->queue == PQ_NONE,
3439 ("vm_page_free_prep: unmanaged page %p is queued", m));
3440 VM_CNT_INC(v_tfree);
3442 if (vm_page_sbusied(m))
3443 panic("vm_page_free_prep: freeing busy page %p", m);
3448 * If fictitious remove object association and
3451 if ((m->flags & PG_FICTITIOUS) != 0) {
3452 KASSERT(m->wire_count == 1,
3453 ("fictitious page %p is not wired", m));
3454 KASSERT(m->queue == PQ_NONE,
3455 ("fictitious page %p is queued", m));
3460 * Pages need not be dequeued before they are returned to the physical
3461 * memory allocator, but they must at least be marked for a deferred
3464 if ((m->oflags & VPO_UNMANAGED) == 0)
3465 vm_page_dequeue_deferred(m);
3470 if (m->wire_count != 0)
3471 panic("vm_page_free_prep: freeing wired page %p", m);
3472 if (m->hold_count != 0) {
3473 m->flags &= ~PG_ZERO;
3474 KASSERT((m->flags & PG_UNHOLDFREE) == 0,
3475 ("vm_page_free_prep: freeing PG_UNHOLDFREE page %p", m));
3476 m->flags |= PG_UNHOLDFREE;
3481 * Restore the default memory attribute to the page.
3483 if (pmap_page_get_memattr(m) != VM_MEMATTR_DEFAULT)
3484 pmap_page_set_memattr(m, VM_MEMATTR_DEFAULT);
3486 #if VM_NRESERVLEVEL > 0
3487 if (vm_reserv_free_page(m))
3497 * Returns the given page to the free list, disassociating it
3498 * from any VM object.
3500 * The object must be locked. The page must be locked if it is
3504 vm_page_free_toq(vm_page_t m)
3506 struct vm_domain *vmd;
3508 if (!vm_page_free_prep(m))
3511 vmd = vm_pagequeue_domain(m);
3512 if (m->pool == VM_FREEPOOL_DEFAULT && vmd->vmd_pgcache != NULL) {
3513 uma_zfree(vmd->vmd_pgcache, m);
3516 vm_domain_free_lock(vmd);
3517 vm_phys_free_pages(m, 0);
3518 vm_domain_free_unlock(vmd);
3519 vm_domain_freecnt_inc(vmd, 1);
3523 * vm_page_free_pages_toq:
3525 * Returns a list of pages to the free list, disassociating it
3526 * from any VM object. In other words, this is equivalent to
3527 * calling vm_page_free_toq() for each page of a list of VM objects.
3529 * The objects must be locked. The pages must be locked if it is
3533 vm_page_free_pages_toq(struct spglist *free, bool update_wire_count)
3538 if (SLIST_EMPTY(free))
3542 while ((m = SLIST_FIRST(free)) != NULL) {
3544 SLIST_REMOVE_HEAD(free, plinks.s.ss);
3545 vm_page_free_toq(m);
3548 if (update_wire_count)
3555 * Mark this page as wired down. If the page is fictitious, then
3556 * its wire count must remain one.
3558 * The page must be locked.
3561 vm_page_wire(vm_page_t m)
3564 vm_page_assert_locked(m);
3565 if ((m->flags & PG_FICTITIOUS) != 0) {
3566 KASSERT(m->wire_count == 1,
3567 ("vm_page_wire: fictitious page %p's wire count isn't one",
3571 if (m->wire_count == 0) {
3572 KASSERT((m->oflags & VPO_UNMANAGED) == 0 ||
3573 m->queue == PQ_NONE,
3574 ("vm_page_wire: unmanaged page %p is queued", m));
3578 KASSERT(m->wire_count != 0, ("vm_page_wire: wire_count overflow m=%p", m));
3584 * Release one wiring of the specified page, potentially allowing it to be
3585 * paged out. Returns TRUE if the number of wirings transitions to zero and
3588 * Only managed pages belonging to an object can be paged out. If the number
3589 * of wirings transitions to zero and the page is eligible for page out, then
3590 * the page is added to the specified paging queue (unless PQ_NONE is
3591 * specified, in which case the page is dequeued if it belongs to a paging
3594 * If a page is fictitious, then its wire count must always be one.
3596 * A managed page must be locked.
3599 vm_page_unwire(vm_page_t m, uint8_t queue)
3603 KASSERT(queue < PQ_COUNT || queue == PQ_NONE,
3604 ("vm_page_unwire: invalid queue %u request for page %p",
3606 if ((m->oflags & VPO_UNMANAGED) == 0)
3607 vm_page_assert_locked(m);
3609 unwired = vm_page_unwire_noq(m);
3610 if (!unwired || (m->oflags & VPO_UNMANAGED) != 0 || m->object == NULL)
3613 if (m->queue == queue) {
3614 if (queue == PQ_ACTIVE)
3615 vm_page_reference(m);
3616 else if (queue != PQ_NONE)
3620 if (queue != PQ_NONE) {
3621 vm_page_enqueue(m, queue);
3622 if (queue == PQ_ACTIVE)
3623 /* Initialize act_count. */
3624 vm_page_activate(m);
3632 * vm_page_unwire_noq:
3634 * Unwire a page without (re-)inserting it into a page queue. It is up
3635 * to the caller to enqueue, requeue, or free the page as appropriate.
3636 * In most cases, vm_page_unwire() should be used instead.
3639 vm_page_unwire_noq(vm_page_t m)
3642 if ((m->oflags & VPO_UNMANAGED) == 0)
3643 vm_page_assert_locked(m);
3644 if ((m->flags & PG_FICTITIOUS) != 0) {
3645 KASSERT(m->wire_count == 1,
3646 ("vm_page_unwire: fictitious page %p's wire count isn't one", m));
3649 if (m->wire_count == 0)
3650 panic("vm_page_unwire: page %p's wire count is zero", m);
3652 if (m->wire_count == 0) {
3660 * Move the specified page to the tail of the inactive queue, or requeue
3661 * the page if it is already in the inactive queue.
3663 * The page must be locked.
3666 vm_page_deactivate(vm_page_t m)
3669 vm_page_assert_locked(m);
3671 if (m->wire_count > 0 || (m->oflags & VPO_UNMANAGED) != 0)
3674 if (!vm_page_inactive(m)) {
3676 vm_page_enqueue(m, PQ_INACTIVE);
3682 * Move the specified page close to the head of the inactive queue,
3683 * bypassing LRU. A marker page is used to maintain FIFO ordering.
3684 * As with regular enqueues, we use a per-CPU batch queue to reduce
3685 * contention on the page queue lock.
3687 * The page must be locked.
3690 vm_page_deactivate_noreuse(vm_page_t m)
3693 vm_page_assert_locked(m);
3695 if (m->wire_count > 0 || (m->oflags & VPO_UNMANAGED) != 0)
3698 if (!vm_page_inactive(m))
3700 m->queue = PQ_INACTIVE;
3701 if ((m->aflags & PGA_REQUEUE_HEAD) == 0)
3702 vm_page_aflag_set(m, PGA_REQUEUE_HEAD);
3703 vm_pqbatch_submit_page(m, PQ_INACTIVE);
3709 * Put a page in the laundry, or requeue it if it is already there.
3712 vm_page_launder(vm_page_t m)
3715 vm_page_assert_locked(m);
3716 if (m->wire_count > 0 || (m->oflags & VPO_UNMANAGED) != 0)
3719 if (m->queue == PQ_LAUNDRY)
3723 vm_page_enqueue(m, PQ_LAUNDRY);
3728 * vm_page_unswappable
3730 * Put a page in the PQ_UNSWAPPABLE holding queue.
3733 vm_page_unswappable(vm_page_t m)
3736 vm_page_assert_locked(m);
3737 KASSERT(m->wire_count == 0 && (m->oflags & VPO_UNMANAGED) == 0,
3738 ("page %p already unswappable", m));
3741 vm_page_enqueue(m, PQ_UNSWAPPABLE);
3745 * Attempt to free the page. If it cannot be freed, do nothing. Returns true
3746 * if the page is freed and false otherwise.
3748 * The page must be managed. The page and its containing object must be
3752 vm_page_try_to_free(vm_page_t m)
3755 vm_page_assert_locked(m);
3756 VM_OBJECT_ASSERT_WLOCKED(m->object);
3757 KASSERT((m->oflags & VPO_UNMANAGED) == 0, ("page %p is unmanaged", m));
3758 if (m->dirty != 0 || vm_page_held(m) || vm_page_busied(m))
3760 if (m->object->ref_count != 0) {
3772 * Apply the specified advice to the given page.
3774 * The object and page must be locked.
3777 vm_page_advise(vm_page_t m, int advice)
3780 vm_page_assert_locked(m);
3781 VM_OBJECT_ASSERT_WLOCKED(m->object);
3782 if (advice == MADV_FREE)
3784 * Mark the page clean. This will allow the page to be freed
3785 * without first paging it out. MADV_FREE pages are often
3786 * quickly reused by malloc(3), so we do not do anything that
3787 * would result in a page fault on a later access.
3790 else if (advice != MADV_DONTNEED) {
3791 if (advice == MADV_WILLNEED)
3792 vm_page_activate(m);
3797 * Clear any references to the page. Otherwise, the page daemon will
3798 * immediately reactivate the page.
3800 vm_page_aflag_clear(m, PGA_REFERENCED);
3802 if (advice != MADV_FREE && m->dirty == 0 && pmap_is_modified(m))
3806 * Place clean pages near the head of the inactive queue rather than
3807 * the tail, thus defeating the queue's LRU operation and ensuring that
3808 * the page will be reused quickly. Dirty pages not already in the
3809 * laundry are moved there.
3812 vm_page_deactivate_noreuse(m);
3813 else if (!vm_page_in_laundry(m))
3818 * Grab a page, waiting until we are waken up due to the page
3819 * changing state. We keep on waiting, if the page continues
3820 * to be in the object. If the page doesn't exist, first allocate it
3821 * and then conditionally zero it.
3823 * This routine may sleep.
3825 * The object must be locked on entry. The lock will, however, be released
3826 * and reacquired if the routine sleeps.
3829 vm_page_grab(vm_object_t object, vm_pindex_t pindex, int allocflags)
3835 VM_OBJECT_ASSERT_WLOCKED(object);
3836 KASSERT((allocflags & VM_ALLOC_SBUSY) == 0 ||
3837 (allocflags & VM_ALLOC_IGN_SBUSY) != 0,
3838 ("vm_page_grab: VM_ALLOC_SBUSY/VM_ALLOC_IGN_SBUSY mismatch"));
3839 pflags = allocflags &
3840 ~(VM_ALLOC_NOWAIT | VM_ALLOC_WAITOK | VM_ALLOC_WAITFAIL);
3841 if ((allocflags & VM_ALLOC_NOWAIT) == 0)
3842 pflags |= VM_ALLOC_WAITFAIL;
3844 if ((m = vm_page_lookup(object, pindex)) != NULL) {
3845 sleep = (allocflags & VM_ALLOC_IGN_SBUSY) != 0 ?
3846 vm_page_xbusied(m) : vm_page_busied(m);
3848 if ((allocflags & VM_ALLOC_NOWAIT) != 0)
3851 * Reference the page before unlocking and
3852 * sleeping so that the page daemon is less
3853 * likely to reclaim it.
3855 vm_page_aflag_set(m, PGA_REFERENCED);
3857 VM_OBJECT_WUNLOCK(object);
3858 vm_page_busy_sleep(m, "pgrbwt", (allocflags &
3859 VM_ALLOC_IGN_SBUSY) != 0);
3860 VM_OBJECT_WLOCK(object);
3863 if ((allocflags & VM_ALLOC_WIRED) != 0) {
3869 (VM_ALLOC_NOBUSY | VM_ALLOC_SBUSY)) == 0)
3871 if ((allocflags & VM_ALLOC_SBUSY) != 0)
3876 m = vm_page_alloc(object, pindex, pflags);
3878 if ((allocflags & VM_ALLOC_NOWAIT) != 0)
3882 if (allocflags & VM_ALLOC_ZERO && (m->flags & PG_ZERO) == 0)
3888 * Return the specified range of pages from the given object. For each
3889 * page offset within the range, if a page already exists within the object
3890 * at that offset and it is busy, then wait for it to change state. If,
3891 * instead, the page doesn't exist, then allocate it.
3893 * The caller must always specify an allocation class.
3895 * allocation classes:
3896 * VM_ALLOC_NORMAL normal process request
3897 * VM_ALLOC_SYSTEM system *really* needs the pages
3899 * The caller must always specify that the pages are to be busied and/or
3902 * optional allocation flags:
3903 * VM_ALLOC_IGN_SBUSY do not sleep on soft busy pages
3904 * VM_ALLOC_NOBUSY do not exclusive busy the page
3905 * VM_ALLOC_NOWAIT do not sleep
3906 * VM_ALLOC_SBUSY set page to sbusy state
3907 * VM_ALLOC_WIRED wire the pages
3908 * VM_ALLOC_ZERO zero and validate any invalid pages
3910 * If VM_ALLOC_NOWAIT is not specified, this routine may sleep. Otherwise, it
3911 * may return a partial prefix of the requested range.
3914 vm_page_grab_pages(vm_object_t object, vm_pindex_t pindex, int allocflags,
3915 vm_page_t *ma, int count)
3922 VM_OBJECT_ASSERT_WLOCKED(object);
3923 KASSERT(((u_int)allocflags >> VM_ALLOC_COUNT_SHIFT) == 0,
3924 ("vm_page_grap_pages: VM_ALLOC_COUNT() is not allowed"));
3925 KASSERT((allocflags & VM_ALLOC_NOBUSY) == 0 ||
3926 (allocflags & VM_ALLOC_WIRED) != 0,
3927 ("vm_page_grab_pages: the pages must be busied or wired"));
3928 KASSERT((allocflags & VM_ALLOC_SBUSY) == 0 ||
3929 (allocflags & VM_ALLOC_IGN_SBUSY) != 0,
3930 ("vm_page_grab_pages: VM_ALLOC_SBUSY/IGN_SBUSY mismatch"));
3933 pflags = allocflags & ~(VM_ALLOC_NOWAIT | VM_ALLOC_WAITOK |
3934 VM_ALLOC_WAITFAIL | VM_ALLOC_IGN_SBUSY);
3935 if ((allocflags & VM_ALLOC_NOWAIT) == 0)
3936 pflags |= VM_ALLOC_WAITFAIL;
3939 m = vm_radix_lookup_le(&object->rtree, pindex + i);
3940 if (m == NULL || m->pindex != pindex + i) {
3944 mpred = TAILQ_PREV(m, pglist, listq);
3945 for (; i < count; i++) {
3947 sleep = (allocflags & VM_ALLOC_IGN_SBUSY) != 0 ?
3948 vm_page_xbusied(m) : vm_page_busied(m);
3950 if ((allocflags & VM_ALLOC_NOWAIT) != 0)
3953 * Reference the page before unlocking and
3954 * sleeping so that the page daemon is less
3955 * likely to reclaim it.
3957 vm_page_aflag_set(m, PGA_REFERENCED);
3959 VM_OBJECT_WUNLOCK(object);
3960 vm_page_busy_sleep(m, "grbmaw", (allocflags &
3961 VM_ALLOC_IGN_SBUSY) != 0);
3962 VM_OBJECT_WLOCK(object);
3965 if ((allocflags & VM_ALLOC_WIRED) != 0) {
3970 if ((allocflags & (VM_ALLOC_NOBUSY |
3971 VM_ALLOC_SBUSY)) == 0)
3973 if ((allocflags & VM_ALLOC_SBUSY) != 0)
3976 m = vm_page_alloc_after(object, pindex + i,
3977 pflags | VM_ALLOC_COUNT(count - i), mpred);
3979 if ((allocflags & VM_ALLOC_NOWAIT) != 0)
3984 if (m->valid == 0 && (allocflags & VM_ALLOC_ZERO) != 0) {
3985 if ((m->flags & PG_ZERO) == 0)
3987 m->valid = VM_PAGE_BITS_ALL;
3990 m = vm_page_next(m);
3996 * Mapping function for valid or dirty bits in a page.
3998 * Inputs are required to range within a page.
4001 vm_page_bits(int base, int size)
4007 base + size <= PAGE_SIZE,
4008 ("vm_page_bits: illegal base/size %d/%d", base, size)
4011 if (size == 0) /* handle degenerate case */
4014 first_bit = base >> DEV_BSHIFT;
4015 last_bit = (base + size - 1) >> DEV_BSHIFT;
4017 return (((vm_page_bits_t)2 << last_bit) -
4018 ((vm_page_bits_t)1 << first_bit));
4022 * vm_page_set_valid_range:
4024 * Sets portions of a page valid. The arguments are expected
4025 * to be DEV_BSIZE aligned but if they aren't the bitmap is inclusive
4026 * of any partial chunks touched by the range. The invalid portion of
4027 * such chunks will be zeroed.
4029 * (base + size) must be less then or equal to PAGE_SIZE.
4032 vm_page_set_valid_range(vm_page_t m, int base, int size)
4036 VM_OBJECT_ASSERT_WLOCKED(m->object);
4037 if (size == 0) /* handle degenerate case */
4041 * If the base is not DEV_BSIZE aligned and the valid
4042 * bit is clear, we have to zero out a portion of the
4045 if ((frag = rounddown2(base, DEV_BSIZE)) != base &&
4046 (m->valid & (1 << (base >> DEV_BSHIFT))) == 0)
4047 pmap_zero_page_area(m, frag, base - frag);
4050 * If the ending offset is not DEV_BSIZE aligned and the
4051 * valid bit is clear, we have to zero out a portion of
4054 endoff = base + size;
4055 if ((frag = rounddown2(endoff, DEV_BSIZE)) != endoff &&
4056 (m->valid & (1 << (endoff >> DEV_BSHIFT))) == 0)
4057 pmap_zero_page_area(m, endoff,
4058 DEV_BSIZE - (endoff & (DEV_BSIZE - 1)));
4061 * Assert that no previously invalid block that is now being validated
4064 KASSERT((~m->valid & vm_page_bits(base, size) & m->dirty) == 0,
4065 ("vm_page_set_valid_range: page %p is dirty", m));
4068 * Set valid bits inclusive of any overlap.
4070 m->valid |= vm_page_bits(base, size);
4074 * Clear the given bits from the specified page's dirty field.
4076 static __inline void
4077 vm_page_clear_dirty_mask(vm_page_t m, vm_page_bits_t pagebits)
4080 #if PAGE_SIZE < 16384
4085 * If the object is locked and the page is neither exclusive busy nor
4086 * write mapped, then the page's dirty field cannot possibly be
4087 * set by a concurrent pmap operation.
4089 VM_OBJECT_ASSERT_WLOCKED(m->object);
4090 if (!vm_page_xbusied(m) && !pmap_page_is_write_mapped(m))
4091 m->dirty &= ~pagebits;
4094 * The pmap layer can call vm_page_dirty() without
4095 * holding a distinguished lock. The combination of
4096 * the object's lock and an atomic operation suffice
4097 * to guarantee consistency of the page dirty field.
4099 * For PAGE_SIZE == 32768 case, compiler already
4100 * properly aligns the dirty field, so no forcible
4101 * alignment is needed. Only require existence of
4102 * atomic_clear_64 when page size is 32768.
4104 addr = (uintptr_t)&m->dirty;
4105 #if PAGE_SIZE == 32768
4106 atomic_clear_64((uint64_t *)addr, pagebits);
4107 #elif PAGE_SIZE == 16384
4108 atomic_clear_32((uint32_t *)addr, pagebits);
4109 #else /* PAGE_SIZE <= 8192 */
4111 * Use a trick to perform a 32-bit atomic on the
4112 * containing aligned word, to not depend on the existence
4113 * of atomic_clear_{8, 16}.
4115 shift = addr & (sizeof(uint32_t) - 1);
4116 #if BYTE_ORDER == BIG_ENDIAN
4117 shift = (sizeof(uint32_t) - sizeof(m->dirty) - shift) * NBBY;
4121 addr &= ~(sizeof(uint32_t) - 1);
4122 atomic_clear_32((uint32_t *)addr, pagebits << shift);
4123 #endif /* PAGE_SIZE */
4128 * vm_page_set_validclean:
4130 * Sets portions of a page valid and clean. The arguments are expected
4131 * to be DEV_BSIZE aligned but if they aren't the bitmap is inclusive
4132 * of any partial chunks touched by the range. The invalid portion of
4133 * such chunks will be zero'd.
4135 * (base + size) must be less then or equal to PAGE_SIZE.
4138 vm_page_set_validclean(vm_page_t m, int base, int size)
4140 vm_page_bits_t oldvalid, pagebits;
4143 VM_OBJECT_ASSERT_WLOCKED(m->object);
4144 if (size == 0) /* handle degenerate case */
4148 * If the base is not DEV_BSIZE aligned and the valid
4149 * bit is clear, we have to zero out a portion of the
4152 if ((frag = rounddown2(base, DEV_BSIZE)) != base &&
4153 (m->valid & ((vm_page_bits_t)1 << (base >> DEV_BSHIFT))) == 0)
4154 pmap_zero_page_area(m, frag, base - frag);
4157 * If the ending offset is not DEV_BSIZE aligned and the
4158 * valid bit is clear, we have to zero out a portion of
4161 endoff = base + size;
4162 if ((frag = rounddown2(endoff, DEV_BSIZE)) != endoff &&
4163 (m->valid & ((vm_page_bits_t)1 << (endoff >> DEV_BSHIFT))) == 0)
4164 pmap_zero_page_area(m, endoff,
4165 DEV_BSIZE - (endoff & (DEV_BSIZE - 1)));
4168 * Set valid, clear dirty bits. If validating the entire
4169 * page we can safely clear the pmap modify bit. We also
4170 * use this opportunity to clear the VPO_NOSYNC flag. If a process
4171 * takes a write fault on a MAP_NOSYNC memory area the flag will
4174 * We set valid bits inclusive of any overlap, but we can only
4175 * clear dirty bits for DEV_BSIZE chunks that are fully within
4178 oldvalid = m->valid;
4179 pagebits = vm_page_bits(base, size);
4180 m->valid |= pagebits;
4182 if ((frag = base & (DEV_BSIZE - 1)) != 0) {
4183 frag = DEV_BSIZE - frag;
4189 pagebits = vm_page_bits(base, size & (DEV_BSIZE - 1));
4191 if (base == 0 && size == PAGE_SIZE) {
4193 * The page can only be modified within the pmap if it is
4194 * mapped, and it can only be mapped if it was previously
4197 if (oldvalid == VM_PAGE_BITS_ALL)
4199 * Perform the pmap_clear_modify() first. Otherwise,
4200 * a concurrent pmap operation, such as
4201 * pmap_protect(), could clear a modification in the
4202 * pmap and set the dirty field on the page before
4203 * pmap_clear_modify() had begun and after the dirty
4204 * field was cleared here.
4206 pmap_clear_modify(m);
4208 m->oflags &= ~VPO_NOSYNC;
4209 } else if (oldvalid != VM_PAGE_BITS_ALL)
4210 m->dirty &= ~pagebits;
4212 vm_page_clear_dirty_mask(m, pagebits);
4216 vm_page_clear_dirty(vm_page_t m, int base, int size)
4219 vm_page_clear_dirty_mask(m, vm_page_bits(base, size));
4223 * vm_page_set_invalid:
4225 * Invalidates DEV_BSIZE'd chunks within a page. Both the
4226 * valid and dirty bits for the effected areas are cleared.
4229 vm_page_set_invalid(vm_page_t m, int base, int size)
4231 vm_page_bits_t bits;
4235 VM_OBJECT_ASSERT_WLOCKED(object);
4236 if (object->type == OBJT_VNODE && base == 0 && IDX_TO_OFF(m->pindex) +
4237 size >= object->un_pager.vnp.vnp_size)
4238 bits = VM_PAGE_BITS_ALL;
4240 bits = vm_page_bits(base, size);
4241 if (object->ref_count != 0 && m->valid == VM_PAGE_BITS_ALL &&
4244 KASSERT((bits == 0 && m->valid == VM_PAGE_BITS_ALL) ||
4245 !pmap_page_is_mapped(m),
4246 ("vm_page_set_invalid: page %p is mapped", m));
4252 * vm_page_zero_invalid()
4254 * The kernel assumes that the invalid portions of a page contain
4255 * garbage, but such pages can be mapped into memory by user code.
4256 * When this occurs, we must zero out the non-valid portions of the
4257 * page so user code sees what it expects.
4259 * Pages are most often semi-valid when the end of a file is mapped
4260 * into memory and the file's size is not page aligned.
4263 vm_page_zero_invalid(vm_page_t m, boolean_t setvalid)
4268 VM_OBJECT_ASSERT_WLOCKED(m->object);
4270 * Scan the valid bits looking for invalid sections that
4271 * must be zeroed. Invalid sub-DEV_BSIZE'd areas ( where the
4272 * valid bit may be set ) have already been zeroed by
4273 * vm_page_set_validclean().
4275 for (b = i = 0; i <= PAGE_SIZE / DEV_BSIZE; ++i) {
4276 if (i == (PAGE_SIZE / DEV_BSIZE) ||
4277 (m->valid & ((vm_page_bits_t)1 << i))) {
4279 pmap_zero_page_area(m,
4280 b << DEV_BSHIFT, (i - b) << DEV_BSHIFT);
4287 * setvalid is TRUE when we can safely set the zero'd areas
4288 * as being valid. We can do this if there are no cache consistancy
4289 * issues. e.g. it is ok to do with UFS, but not ok to do with NFS.
4292 m->valid = VM_PAGE_BITS_ALL;
4298 * Is (partial) page valid? Note that the case where size == 0
4299 * will return FALSE in the degenerate case where the page is
4300 * entirely invalid, and TRUE otherwise.
4303 vm_page_is_valid(vm_page_t m, int base, int size)
4305 vm_page_bits_t bits;
4307 VM_OBJECT_ASSERT_LOCKED(m->object);
4308 bits = vm_page_bits(base, size);
4309 return (m->valid != 0 && (m->valid & bits) == bits);
4313 * Returns true if all of the specified predicates are true for the entire
4314 * (super)page and false otherwise.
4317 vm_page_ps_test(vm_page_t m, int flags, vm_page_t skip_m)
4323 if (skip_m != NULL && skip_m->object != object)
4325 VM_OBJECT_ASSERT_LOCKED(object);
4326 npages = atop(pagesizes[m->psind]);
4329 * The physically contiguous pages that make up a superpage, i.e., a
4330 * page with a page size index ("psind") greater than zero, will
4331 * occupy adjacent entries in vm_page_array[].
4333 for (i = 0; i < npages; i++) {
4334 /* Always test object consistency, including "skip_m". */
4335 if (m[i].object != object)
4337 if (&m[i] == skip_m)
4339 if ((flags & PS_NONE_BUSY) != 0 && vm_page_busied(&m[i]))
4341 if ((flags & PS_ALL_DIRTY) != 0) {
4343 * Calling vm_page_test_dirty() or pmap_is_modified()
4344 * might stop this case from spuriously returning
4345 * "false". However, that would require a write lock
4346 * on the object containing "m[i]".
4348 if (m[i].dirty != VM_PAGE_BITS_ALL)
4351 if ((flags & PS_ALL_VALID) != 0 &&
4352 m[i].valid != VM_PAGE_BITS_ALL)
4359 * Set the page's dirty bits if the page is modified.
4362 vm_page_test_dirty(vm_page_t m)
4365 VM_OBJECT_ASSERT_WLOCKED(m->object);
4366 if (m->dirty != VM_PAGE_BITS_ALL && pmap_is_modified(m))
4371 vm_page_lock_KBI(vm_page_t m, const char *file, int line)
4374 mtx_lock_flags_(vm_page_lockptr(m), 0, file, line);
4378 vm_page_unlock_KBI(vm_page_t m, const char *file, int line)
4381 mtx_unlock_flags_(vm_page_lockptr(m), 0, file, line);
4385 vm_page_trylock_KBI(vm_page_t m, const char *file, int line)
4388 return (mtx_trylock_flags_(vm_page_lockptr(m), 0, file, line));
4391 #if defined(INVARIANTS) || defined(INVARIANT_SUPPORT)
4393 vm_page_assert_locked_KBI(vm_page_t m, const char *file, int line)
4396 vm_page_lock_assert_KBI(m, MA_OWNED, file, line);
4400 vm_page_lock_assert_KBI(vm_page_t m, int a, const char *file, int line)
4403 mtx_assert_(vm_page_lockptr(m), a, file, line);
4409 vm_page_object_lock_assert(vm_page_t m)
4413 * Certain of the page's fields may only be modified by the
4414 * holder of the containing object's lock or the exclusive busy.
4415 * holder. Unfortunately, the holder of the write busy is
4416 * not recorded, and thus cannot be checked here.
4418 if (m->object != NULL && !vm_page_xbusied(m))
4419 VM_OBJECT_ASSERT_WLOCKED(m->object);
4423 vm_page_assert_pga_writeable(vm_page_t m, uint8_t bits)
4426 if ((bits & PGA_WRITEABLE) == 0)
4430 * The PGA_WRITEABLE flag can only be set if the page is
4431 * managed, is exclusively busied or the object is locked.
4432 * Currently, this flag is only set by pmap_enter().
4434 KASSERT((m->oflags & VPO_UNMANAGED) == 0,
4435 ("PGA_WRITEABLE on unmanaged page"));
4436 if (!vm_page_xbusied(m))
4437 VM_OBJECT_ASSERT_LOCKED(m->object);
4441 #include "opt_ddb.h"
4443 #include <sys/kernel.h>
4445 #include <ddb/ddb.h>
4447 DB_SHOW_COMMAND(page, vm_page_print_page_info)
4450 db_printf("vm_cnt.v_free_count: %d\n", vm_free_count());
4451 db_printf("vm_cnt.v_inactive_count: %d\n", vm_inactive_count());
4452 db_printf("vm_cnt.v_active_count: %d\n", vm_active_count());
4453 db_printf("vm_cnt.v_laundry_count: %d\n", vm_laundry_count());
4454 db_printf("vm_cnt.v_wire_count: %d\n", vm_wire_count());
4455 db_printf("vm_cnt.v_free_reserved: %d\n", vm_cnt.v_free_reserved);
4456 db_printf("vm_cnt.v_free_min: %d\n", vm_cnt.v_free_min);
4457 db_printf("vm_cnt.v_free_target: %d\n", vm_cnt.v_free_target);
4458 db_printf("vm_cnt.v_inactive_target: %d\n", vm_cnt.v_inactive_target);
4461 DB_SHOW_COMMAND(pageq, vm_page_print_pageq_info)
4465 db_printf("pq_free %d\n", vm_free_count());
4466 for (dom = 0; dom < vm_ndomains; dom++) {
4468 "dom %d page_cnt %d free %d pq_act %d pq_inact %d pq_laund %d pq_unsw %d\n",
4470 vm_dom[dom].vmd_page_count,
4471 vm_dom[dom].vmd_free_count,
4472 vm_dom[dom].vmd_pagequeues[PQ_ACTIVE].pq_cnt,
4473 vm_dom[dom].vmd_pagequeues[PQ_INACTIVE].pq_cnt,
4474 vm_dom[dom].vmd_pagequeues[PQ_LAUNDRY].pq_cnt,
4475 vm_dom[dom].vmd_pagequeues[PQ_UNSWAPPABLE].pq_cnt);
4479 DB_SHOW_COMMAND(pginfo, vm_page_print_pginfo)
4485 db_printf("show pginfo addr\n");
4489 phys = strchr(modif, 'p') != NULL;
4491 m = PHYS_TO_VM_PAGE(addr);
4493 m = (vm_page_t)addr;
4495 "page %p obj %p pidx 0x%jx phys 0x%jx q %d hold %d wire %d\n"
4496 " af 0x%x of 0x%x f 0x%x act %d busy %x valid 0x%x dirty 0x%x\n",
4497 m, m->object, (uintmax_t)m->pindex, (uintmax_t)m->phys_addr,
4498 m->queue, m->hold_count, m->wire_count, m->aflags, m->oflags,
4499 m->flags, m->act_count, m->busy_lock, m->valid, m->dirty);