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 * Resident memory management module.
69 #include <sys/cdefs.h>
70 __FBSDID("$FreeBSD$");
74 #include <sys/param.h>
75 #include <sys/systm.h>
76 #include <sys/counter.h>
77 #include <sys/domainset.h>
78 #include <sys/kernel.h>
79 #include <sys/limits.h>
80 #include <sys/linker.h>
82 #include <sys/malloc.h>
84 #include <sys/msgbuf.h>
85 #include <sys/mutex.h>
87 #include <sys/rwlock.h>
88 #include <sys/sleepqueue.h>
90 #include <sys/sched.h>
92 #include <sys/sysctl.h>
93 #include <sys/vmmeter.h>
94 #include <sys/vnode.h>
98 #include <vm/vm_param.h>
99 #include <vm/vm_domainset.h>
100 #include <vm/vm_kern.h>
101 #include <vm/vm_map.h>
102 #include <vm/vm_object.h>
103 #include <vm/vm_page.h>
104 #include <vm/vm_pageout.h>
105 #include <vm/vm_phys.h>
106 #include <vm/vm_pagequeue.h>
107 #include <vm/vm_pager.h>
108 #include <vm/vm_radix.h>
109 #include <vm/vm_reserv.h>
110 #include <vm/vm_extern.h>
111 #include <vm/vm_dumpset.h>
113 #include <vm/uma_int.h>
115 #include <machine/md_var.h>
117 struct vm_domain vm_dom[MAXMEMDOM];
119 DPCPU_DEFINE_STATIC(struct vm_batchqueue, pqbatch[MAXMEMDOM][PQ_COUNT]);
121 struct mtx_padalign __exclusive_cache_line pa_lock[PA_LOCK_COUNT];
123 struct mtx_padalign __exclusive_cache_line vm_domainset_lock;
124 /* The following fields are protected by the domainset lock. */
125 domainset_t __exclusive_cache_line vm_min_domains;
126 domainset_t __exclusive_cache_line vm_severe_domains;
127 static int vm_min_waiters;
128 static int vm_severe_waiters;
129 static int vm_pageproc_waiters;
131 static SYSCTL_NODE(_vm_stats, OID_AUTO, page, CTLFLAG_RD | CTLFLAG_MPSAFE, 0,
132 "VM page statistics");
134 static COUNTER_U64_DEFINE_EARLY(pqstate_commit_retries);
135 SYSCTL_COUNTER_U64(_vm_stats_page, OID_AUTO, pqstate_commit_retries,
136 CTLFLAG_RD, &pqstate_commit_retries,
137 "Number of failed per-page atomic queue state updates");
139 static COUNTER_U64_DEFINE_EARLY(queue_ops);
140 SYSCTL_COUNTER_U64(_vm_stats_page, OID_AUTO, queue_ops,
141 CTLFLAG_RD, &queue_ops,
142 "Number of batched queue operations");
144 static COUNTER_U64_DEFINE_EARLY(queue_nops);
145 SYSCTL_COUNTER_U64(_vm_stats_page, OID_AUTO, queue_nops,
146 CTLFLAG_RD, &queue_nops,
147 "Number of batched queue operations with no effects");
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 struct bitset *vm_page_dump;
160 long vm_page_dump_pages;
162 static TAILQ_HEAD(, vm_page) blacklist_head;
163 static int sysctl_vm_page_blacklist(SYSCTL_HANDLER_ARGS);
164 SYSCTL_PROC(_vm, OID_AUTO, page_blacklist, CTLTYPE_STRING | CTLFLAG_RD |
165 CTLFLAG_MPSAFE, NULL, 0, sysctl_vm_page_blacklist, "A", "Blacklist pages");
167 static uma_zone_t fakepg_zone;
169 static void vm_page_alloc_check(vm_page_t m);
170 static bool _vm_page_busy_sleep(vm_object_t obj, vm_page_t m,
171 vm_pindex_t pindex, const char *wmesg, int allocflags, bool locked);
172 static void vm_page_clear_dirty_mask(vm_page_t m, vm_page_bits_t pagebits);
173 static void vm_page_enqueue(vm_page_t m, uint8_t queue);
174 static bool vm_page_free_prep(vm_page_t m);
175 static void vm_page_free_toq(vm_page_t m);
176 static void vm_page_init(void *dummy);
177 static int vm_page_insert_after(vm_page_t m, vm_object_t object,
178 vm_pindex_t pindex, vm_page_t mpred);
179 static void vm_page_insert_radixdone(vm_page_t m, vm_object_t object,
181 static void vm_page_mvqueue(vm_page_t m, const uint8_t queue,
182 const uint16_t nflag);
183 static int vm_page_reclaim_run(int req_class, int domain, u_long npages,
184 vm_page_t m_run, vm_paddr_t high);
185 static void vm_page_release_toq(vm_page_t m, uint8_t nqueue, bool noreuse);
186 static int vm_domain_alloc_fail(struct vm_domain *vmd, vm_object_t object,
188 static int vm_page_zone_import(void *arg, void **store, int cnt, int domain,
190 static void vm_page_zone_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);
200 bogus_page = vm_page_alloc_noobj(VM_ALLOC_WIRED);
204 * The cache page zone is initialized later since we need to be able to allocate
205 * pages before UMA is fully initialized.
208 vm_page_init_cache_zones(void *dummy __unused)
210 struct vm_domain *vmd;
211 struct vm_pgcache *pgcache;
212 int cache, domain, maxcache, pool;
215 TUNABLE_INT_FETCH("vm.pgcache_zone_max_pcpu", &maxcache);
216 maxcache *= mp_ncpus;
217 for (domain = 0; domain < vm_ndomains; domain++) {
218 vmd = VM_DOMAIN(domain);
219 for (pool = 0; pool < VM_NFREEPOOL; pool++) {
220 pgcache = &vmd->vmd_pgcache[pool];
221 pgcache->domain = domain;
222 pgcache->pool = pool;
223 pgcache->zone = uma_zcache_create("vm pgcache",
224 PAGE_SIZE, NULL, NULL, NULL, NULL,
225 vm_page_zone_import, vm_page_zone_release, pgcache,
229 * Limit each pool's zone to 0.1% of the pages in the
232 cache = maxcache != 0 ? maxcache :
233 vmd->vmd_page_count / 1000;
234 uma_zone_set_maxcache(pgcache->zone, cache);
238 SYSINIT(vm_page2, SI_SUB_VM_CONF, SI_ORDER_ANY, vm_page_init_cache_zones, NULL);
240 /* Make sure that u_long is at least 64 bits when PAGE_SIZE is 32K. */
241 #if PAGE_SIZE == 32768
243 CTASSERT(sizeof(u_long) >= 8);
250 * Sets the page size, perhaps based upon the memory
251 * size. Must be called before any use of page-size
252 * dependent functions.
255 vm_set_page_size(void)
257 if (vm_cnt.v_page_size == 0)
258 vm_cnt.v_page_size = PAGE_SIZE;
259 if (((vm_cnt.v_page_size - 1) & vm_cnt.v_page_size) != 0)
260 panic("vm_set_page_size: page size not a power of two");
264 * vm_page_blacklist_next:
266 * Find the next entry in the provided string of blacklist
267 * addresses. Entries are separated by space, comma, or newline.
268 * If an invalid integer is encountered then the rest of the
269 * string is skipped. Updates the list pointer to the next
270 * character, or NULL if the string is exhausted or invalid.
273 vm_page_blacklist_next(char **list, char *end)
278 if (list == NULL || *list == NULL)
286 * If there's no end pointer then the buffer is coming from
287 * the kenv and we know it's null-terminated.
290 end = *list + strlen(*list);
292 /* Ensure that strtoq() won't walk off the end */
294 if (*end == '\n' || *end == ' ' || *end == ',')
297 printf("Blacklist not terminated, skipping\n");
303 for (pos = *list; *pos != '\0'; pos = cp) {
304 bad = strtoq(pos, &cp, 0);
305 if (*cp == '\0' || *cp == ' ' || *cp == ',' || *cp == '\n') {
314 if (*cp == '\0' || ++cp >= end)
318 return (trunc_page(bad));
320 printf("Garbage in RAM blacklist, skipping\n");
326 vm_page_blacklist_add(vm_paddr_t pa, bool verbose)
328 struct vm_domain *vmd;
332 m = vm_phys_paddr_to_vm_page(pa);
334 return (true); /* page does not exist, no failure */
336 vmd = vm_pagequeue_domain(m);
337 vm_domain_free_lock(vmd);
338 ret = vm_phys_unfree_page(m);
339 vm_domain_free_unlock(vmd);
341 vm_domain_freecnt_inc(vmd, -1);
342 TAILQ_INSERT_TAIL(&blacklist_head, m, listq);
344 printf("Skipping page with pa 0x%jx\n", (uintmax_t)pa);
350 * vm_page_blacklist_check:
352 * Iterate through the provided string of blacklist addresses, pulling
353 * each entry out of the physical allocator free list and putting it
354 * onto a list for reporting via the vm.page_blacklist sysctl.
357 vm_page_blacklist_check(char *list, char *end)
363 while (next != NULL) {
364 if ((pa = vm_page_blacklist_next(&next, end)) == 0)
366 vm_page_blacklist_add(pa, bootverbose);
371 * vm_page_blacklist_load:
373 * Search for a special module named "ram_blacklist". It'll be a
374 * plain text file provided by the user via the loader directive
378 vm_page_blacklist_load(char **list, char **end)
387 mod = preload_search_by_type("ram_blacklist");
389 ptr = preload_fetch_addr(mod);
390 len = preload_fetch_size(mod);
401 sysctl_vm_page_blacklist(SYSCTL_HANDLER_ARGS)
408 error = sysctl_wire_old_buffer(req, 0);
411 sbuf_new_for_sysctl(&sbuf, NULL, 128, req);
412 TAILQ_FOREACH(m, &blacklist_head, listq) {
413 sbuf_printf(&sbuf, "%s%#jx", first ? "" : ",",
414 (uintmax_t)m->phys_addr);
417 error = sbuf_finish(&sbuf);
423 * Initialize a dummy page for use in scans of the specified paging queue.
424 * In principle, this function only needs to set the flag PG_MARKER.
425 * Nonetheless, it write busies the page as a safety precaution.
428 vm_page_init_marker(vm_page_t marker, int queue, uint16_t aflags)
431 bzero(marker, sizeof(*marker));
432 marker->flags = PG_MARKER;
433 marker->a.flags = aflags;
434 marker->busy_lock = VPB_CURTHREAD_EXCLUSIVE;
435 marker->a.queue = queue;
439 vm_page_domain_init(int domain)
441 struct vm_domain *vmd;
442 struct vm_pagequeue *pq;
445 vmd = VM_DOMAIN(domain);
446 bzero(vmd, sizeof(*vmd));
447 *__DECONST(const char **, &vmd->vmd_pagequeues[PQ_INACTIVE].pq_name) =
448 "vm inactive pagequeue";
449 *__DECONST(const char **, &vmd->vmd_pagequeues[PQ_ACTIVE].pq_name) =
450 "vm active pagequeue";
451 *__DECONST(const char **, &vmd->vmd_pagequeues[PQ_LAUNDRY].pq_name) =
452 "vm laundry pagequeue";
453 *__DECONST(const char **,
454 &vmd->vmd_pagequeues[PQ_UNSWAPPABLE].pq_name) =
455 "vm unswappable pagequeue";
456 vmd->vmd_domain = domain;
457 vmd->vmd_page_count = 0;
458 vmd->vmd_free_count = 0;
460 vmd->vmd_oom = FALSE;
461 for (i = 0; i < PQ_COUNT; i++) {
462 pq = &vmd->vmd_pagequeues[i];
463 TAILQ_INIT(&pq->pq_pl);
464 mtx_init(&pq->pq_mutex, pq->pq_name, "vm pagequeue",
465 MTX_DEF | MTX_DUPOK);
467 vm_page_init_marker(&vmd->vmd_markers[i], i, 0);
469 mtx_init(&vmd->vmd_free_mtx, "vm page free queue", NULL, MTX_DEF);
470 mtx_init(&vmd->vmd_pageout_mtx, "vm pageout lock", NULL, MTX_DEF);
471 snprintf(vmd->vmd_name, sizeof(vmd->vmd_name), "%d", domain);
474 * inacthead is used to provide FIFO ordering for LRU-bypassing
477 vm_page_init_marker(&vmd->vmd_inacthead, PQ_INACTIVE, PGA_ENQUEUED);
478 TAILQ_INSERT_HEAD(&vmd->vmd_pagequeues[PQ_INACTIVE].pq_pl,
479 &vmd->vmd_inacthead, plinks.q);
482 * The clock pages are used to implement active queue scanning without
483 * requeues. Scans start at clock[0], which is advanced after the scan
484 * ends. When the two clock hands meet, they are reset and scanning
485 * resumes from the head of the queue.
487 vm_page_init_marker(&vmd->vmd_clock[0], PQ_ACTIVE, PGA_ENQUEUED);
488 vm_page_init_marker(&vmd->vmd_clock[1], PQ_ACTIVE, PGA_ENQUEUED);
489 TAILQ_INSERT_HEAD(&vmd->vmd_pagequeues[PQ_ACTIVE].pq_pl,
490 &vmd->vmd_clock[0], plinks.q);
491 TAILQ_INSERT_TAIL(&vmd->vmd_pagequeues[PQ_ACTIVE].pq_pl,
492 &vmd->vmd_clock[1], plinks.q);
496 * Initialize a physical page in preparation for adding it to the free
500 vm_page_init_page(vm_page_t m, vm_paddr_t pa, int segind)
505 m->busy_lock = VPB_FREED;
506 m->flags = m->a.flags = 0;
508 m->a.queue = PQ_NONE;
511 m->order = VM_NFREEORDER;
512 m->pool = VM_FREEPOOL_DEFAULT;
513 m->valid = m->dirty = 0;
517 #ifndef PMAP_HAS_PAGE_ARRAY
519 vm_page_array_alloc(vm_offset_t *vaddr, vm_paddr_t end, vm_paddr_t page_range)
524 * Reserve an unmapped guard page to trap access to vm_page_array[-1].
525 * However, because this page is allocated from KVM, out-of-bounds
526 * accesses using the direct map will not be trapped.
531 * Allocate physical memory for the page structures, and map it.
533 new_end = trunc_page(end - page_range * sizeof(struct vm_page));
534 vm_page_array = (vm_page_t)pmap_map(vaddr, new_end, end,
535 VM_PROT_READ | VM_PROT_WRITE);
536 vm_page_array_size = page_range;
545 * Initializes the resident memory module. Allocates physical memory for
546 * bootstrapping UMA and some data structures that are used to manage
547 * physical pages. Initializes these structures, and populates the free
551 vm_page_startup(vm_offset_t vaddr)
553 struct vm_phys_seg *seg;
554 struct vm_domain *vmd;
556 char *list, *listend;
557 vm_paddr_t end, high_avail, low_avail, new_end, size;
558 vm_paddr_t page_range __unused;
559 vm_paddr_t last_pa, pa, startp, endp;
561 #if MINIDUMP_PAGE_TRACKING
562 u_long vm_page_dump_size;
564 int biggestone, i, segind;
569 #if defined(__i386__) && defined(VM_PHYSSEG_DENSE)
573 vaddr = round_page(vaddr);
575 vm_phys_early_startup();
576 biggestone = vm_phys_avail_largest();
577 end = phys_avail[biggestone+1];
580 * Initialize the page and queue locks.
582 mtx_init(&vm_domainset_lock, "vm domainset lock", NULL, MTX_DEF);
583 for (i = 0; i < PA_LOCK_COUNT; i++)
584 mtx_init(&pa_lock[i], "vm page", NULL, MTX_DEF);
585 for (i = 0; i < vm_ndomains; i++)
586 vm_page_domain_init(i);
590 witness_size = round_page(witness_startup_count());
591 new_end -= witness_size;
592 mapped = pmap_map(&vaddr, new_end, new_end + witness_size,
593 VM_PROT_READ | VM_PROT_WRITE);
594 bzero((void *)mapped, witness_size);
595 witness_startup((void *)mapped);
598 #if MINIDUMP_PAGE_TRACKING
600 * Allocate a bitmap to indicate that a random physical page
601 * needs to be included in a minidump.
603 * The amd64 port needs this to indicate which direct map pages
604 * need to be dumped, via calls to dump_add_page()/dump_drop_page().
606 * However, i386 still needs this workspace internally within the
607 * minidump code. In theory, they are not needed on i386, but are
608 * included should the sf_buf code decide to use them.
611 vm_page_dump_pages = 0;
612 for (i = 0; dump_avail[i + 1] != 0; i += 2) {
613 vm_page_dump_pages += howmany(dump_avail[i + 1], PAGE_SIZE) -
614 dump_avail[i] / PAGE_SIZE;
615 if (dump_avail[i + 1] > last_pa)
616 last_pa = dump_avail[i + 1];
618 vm_page_dump_size = round_page(BITSET_SIZE(vm_page_dump_pages));
619 new_end -= vm_page_dump_size;
620 vm_page_dump = (void *)(uintptr_t)pmap_map(&vaddr, new_end,
621 new_end + vm_page_dump_size, VM_PROT_READ | VM_PROT_WRITE);
622 bzero((void *)vm_page_dump, vm_page_dump_size);
626 #if defined(__aarch64__) || defined(__amd64__) || defined(__mips__) || \
627 defined(__riscv) || defined(__powerpc64__)
629 * Include the UMA bootstrap pages, witness pages and vm_page_dump
630 * in a crash dump. When pmap_map() uses the direct map, they are
631 * not automatically included.
633 for (pa = new_end; pa < end; pa += PAGE_SIZE)
636 phys_avail[biggestone + 1] = new_end;
639 * Request that the physical pages underlying the message buffer be
640 * included in a crash dump. Since the message buffer is accessed
641 * through the direct map, they are not automatically included.
643 pa = DMAP_TO_PHYS((vm_offset_t)msgbufp->msg_ptr);
644 last_pa = pa + round_page(msgbufsize);
645 while (pa < last_pa) {
651 * Compute the number of pages of memory that will be available for
652 * use, taking into account the overhead of a page structure per page.
653 * In other words, solve
654 * "available physical memory" - round_page(page_range *
655 * sizeof(struct vm_page)) = page_range * PAGE_SIZE
658 low_avail = phys_avail[0];
659 high_avail = phys_avail[1];
660 for (i = 0; i < vm_phys_nsegs; i++) {
661 if (vm_phys_segs[i].start < low_avail)
662 low_avail = vm_phys_segs[i].start;
663 if (vm_phys_segs[i].end > high_avail)
664 high_avail = vm_phys_segs[i].end;
666 /* Skip the first chunk. It is already accounted for. */
667 for (i = 2; phys_avail[i + 1] != 0; i += 2) {
668 if (phys_avail[i] < low_avail)
669 low_avail = phys_avail[i];
670 if (phys_avail[i + 1] > high_avail)
671 high_avail = phys_avail[i + 1];
673 first_page = low_avail / PAGE_SIZE;
674 #ifdef VM_PHYSSEG_SPARSE
676 for (i = 0; i < vm_phys_nsegs; i++)
677 size += vm_phys_segs[i].end - vm_phys_segs[i].start;
678 for (i = 0; phys_avail[i + 1] != 0; i += 2)
679 size += phys_avail[i + 1] - phys_avail[i];
680 #elif defined(VM_PHYSSEG_DENSE)
681 size = high_avail - low_avail;
683 #error "Either VM_PHYSSEG_DENSE or VM_PHYSSEG_SPARSE must be defined."
686 #ifdef PMAP_HAS_PAGE_ARRAY
687 pmap_page_array_startup(size / PAGE_SIZE);
688 biggestone = vm_phys_avail_largest();
689 end = new_end = phys_avail[biggestone + 1];
691 #ifdef VM_PHYSSEG_DENSE
693 * In the VM_PHYSSEG_DENSE case, the number of pages can account for
694 * the overhead of a page structure per page only if vm_page_array is
695 * allocated from the last physical memory chunk. Otherwise, we must
696 * allocate page structures representing the physical memory
697 * underlying vm_page_array, even though they will not be used.
699 if (new_end != high_avail)
700 page_range = size / PAGE_SIZE;
704 page_range = size / (PAGE_SIZE + sizeof(struct vm_page));
707 * If the partial bytes remaining are large enough for
708 * a page (PAGE_SIZE) without a corresponding
709 * 'struct vm_page', then new_end will contain an
710 * extra page after subtracting the length of the VM
711 * page array. Compensate by subtracting an extra
714 if (size % (PAGE_SIZE + sizeof(struct vm_page)) >= PAGE_SIZE) {
715 if (new_end == high_avail)
716 high_avail -= PAGE_SIZE;
717 new_end -= PAGE_SIZE;
721 new_end = vm_page_array_alloc(&vaddr, end, page_range);
724 #if VM_NRESERVLEVEL > 0
726 * Allocate physical memory for the reservation management system's
727 * data structures, and map it.
729 new_end = vm_reserv_startup(&vaddr, new_end);
731 #if defined(__aarch64__) || defined(__amd64__) || defined(__mips__) || \
732 defined(__riscv) || defined(__powerpc64__)
734 * Include vm_page_array and vm_reserv_array in a crash dump.
736 for (pa = new_end; pa < end; pa += PAGE_SIZE)
739 phys_avail[biggestone + 1] = new_end;
742 * Add physical memory segments corresponding to the available
745 for (i = 0; phys_avail[i + 1] != 0; i += 2)
746 if (vm_phys_avail_size(i) != 0)
747 vm_phys_add_seg(phys_avail[i], phys_avail[i + 1]);
750 * Initialize the physical memory allocator.
755 * Initialize the page structures and add every available page to the
756 * physical memory allocator's free lists.
758 #if defined(__i386__) && defined(VM_PHYSSEG_DENSE)
759 for (ii = 0; ii < vm_page_array_size; ii++) {
760 m = &vm_page_array[ii];
761 vm_page_init_page(m, (first_page + ii) << PAGE_SHIFT, 0);
762 m->flags = PG_FICTITIOUS;
765 vm_cnt.v_page_count = 0;
766 for (segind = 0; segind < vm_phys_nsegs; segind++) {
767 seg = &vm_phys_segs[segind];
768 for (m = seg->first_page, pa = seg->start; pa < seg->end;
769 m++, pa += PAGE_SIZE)
770 vm_page_init_page(m, pa, segind);
773 * Add the segment's pages that are covered by one of
774 * phys_avail's ranges to the free lists.
776 for (i = 0; phys_avail[i + 1] != 0; i += 2) {
777 if (seg->end <= phys_avail[i] ||
778 seg->start >= phys_avail[i + 1])
781 startp = MAX(seg->start, phys_avail[i]);
782 endp = MIN(seg->end, phys_avail[i + 1]);
783 pagecount = (u_long)atop(endp - startp);
787 m = seg->first_page + atop(startp - seg->start);
788 vmd = VM_DOMAIN(seg->domain);
789 vm_domain_free_lock(vmd);
790 vm_phys_enqueue_contig(m, pagecount);
791 vm_domain_free_unlock(vmd);
792 vm_domain_freecnt_inc(vmd, pagecount);
793 vm_cnt.v_page_count += (u_int)pagecount;
794 vmd->vmd_page_count += (u_int)pagecount;
795 vmd->vmd_segs |= 1UL << segind;
800 * Remove blacklisted pages from the physical memory allocator.
802 TAILQ_INIT(&blacklist_head);
803 vm_page_blacklist_load(&list, &listend);
804 vm_page_blacklist_check(list, listend);
806 list = kern_getenv("vm.blacklist");
807 vm_page_blacklist_check(list, NULL);
810 #if VM_NRESERVLEVEL > 0
812 * Initialize the reservation management system.
821 vm_page_reference(vm_page_t m)
824 vm_page_aflag_set(m, PGA_REFERENCED);
830 * Helper routine for grab functions to trylock busy.
832 * Returns true on success and false on failure.
835 vm_page_trybusy(vm_page_t m, int allocflags)
838 if ((allocflags & (VM_ALLOC_SBUSY | VM_ALLOC_IGN_SBUSY)) != 0)
839 return (vm_page_trysbusy(m));
841 return (vm_page_tryxbusy(m));
847 * Helper routine for grab functions to trylock busy and wire.
849 * Returns true on success and false on failure.
852 vm_page_tryacquire(vm_page_t m, int allocflags)
856 locked = vm_page_trybusy(m, allocflags);
857 if (locked && (allocflags & VM_ALLOC_WIRED) != 0)
863 * vm_page_busy_acquire:
865 * Acquire the busy lock as described by VM_ALLOC_* flags. Will loop
866 * and drop the object lock if necessary.
869 vm_page_busy_acquire(vm_page_t m, int allocflags)
875 * The page-specific object must be cached because page
876 * identity can change during the sleep, causing the
877 * re-lock of a different object.
878 * It is assumed that a reference to the object is already
879 * held by the callers.
881 obj = atomic_load_ptr(&m->object);
883 if (vm_page_tryacquire(m, allocflags))
885 if ((allocflags & VM_ALLOC_NOWAIT) != 0)
888 locked = VM_OBJECT_WOWNED(obj);
891 MPASS(locked || vm_page_wired(m));
892 if (_vm_page_busy_sleep(obj, m, m->pindex, "vmpba", allocflags,
894 VM_OBJECT_WLOCK(obj);
895 if ((allocflags & VM_ALLOC_WAITFAIL) != 0)
897 KASSERT(m->object == obj || m->object == NULL,
898 ("vm_page_busy_acquire: page %p does not belong to %p",
904 * vm_page_busy_downgrade:
906 * Downgrade an exclusive busy page into a single shared busy page.
909 vm_page_busy_downgrade(vm_page_t m)
913 vm_page_assert_xbusied(m);
915 x = vm_page_busy_fetch(m);
917 if (atomic_fcmpset_rel_int(&m->busy_lock,
918 &x, VPB_SHARERS_WORD(1)))
921 if ((x & VPB_BIT_WAITERS) != 0)
927 * vm_page_busy_tryupgrade:
929 * Attempt to upgrade a single shared busy into an exclusive busy.
932 vm_page_busy_tryupgrade(vm_page_t m)
936 vm_page_assert_sbusied(m);
938 x = vm_page_busy_fetch(m);
939 ce = VPB_CURTHREAD_EXCLUSIVE;
941 if (VPB_SHARERS(x) > 1)
943 KASSERT((x & ~VPB_BIT_WAITERS) == VPB_SHARERS_WORD(1),
944 ("vm_page_busy_tryupgrade: invalid lock state"));
945 if (!atomic_fcmpset_acq_int(&m->busy_lock, &x,
946 ce | (x & VPB_BIT_WAITERS)))
955 * Return a positive value if the page is shared busied, 0 otherwise.
958 vm_page_sbusied(vm_page_t m)
962 x = vm_page_busy_fetch(m);
963 return ((x & VPB_BIT_SHARED) != 0 && x != VPB_UNBUSIED);
969 * Shared unbusy a page.
972 vm_page_sunbusy(vm_page_t m)
976 vm_page_assert_sbusied(m);
978 x = vm_page_busy_fetch(m);
980 KASSERT(x != VPB_FREED,
981 ("vm_page_sunbusy: Unlocking freed page."));
982 if (VPB_SHARERS(x) > 1) {
983 if (atomic_fcmpset_int(&m->busy_lock, &x,
988 KASSERT((x & ~VPB_BIT_WAITERS) == VPB_SHARERS_WORD(1),
989 ("vm_page_sunbusy: invalid lock state"));
990 if (!atomic_fcmpset_rel_int(&m->busy_lock, &x, VPB_UNBUSIED))
992 if ((x & VPB_BIT_WAITERS) == 0)
1000 * vm_page_busy_sleep:
1002 * Sleep if the page is busy, using the page pointer as wchan.
1003 * This is used to implement the hard-path of the busying mechanism.
1005 * If VM_ALLOC_IGN_SBUSY is specified in allocflags, the function
1006 * will not sleep if the page is shared-busy.
1008 * The object lock must be held on entry.
1010 * Returns true if it slept and dropped the object lock, or false
1011 * if there was no sleep and the lock is still held.
1014 vm_page_busy_sleep(vm_page_t m, const char *wmesg, int allocflags)
1019 VM_OBJECT_ASSERT_LOCKED(obj);
1021 return (_vm_page_busy_sleep(obj, m, m->pindex, wmesg, allocflags,
1026 * vm_page_busy_sleep_unlocked:
1028 * Sleep if the page is busy, using the page pointer as wchan.
1029 * This is used to implement the hard-path of busying mechanism.
1031 * If VM_ALLOC_IGN_SBUSY is specified in allocflags, the function
1032 * will not sleep if the page is shared-busy.
1034 * The object lock must not be held on entry. The operation will
1035 * return if the page changes identity.
1038 vm_page_busy_sleep_unlocked(vm_object_t obj, vm_page_t m, vm_pindex_t pindex,
1039 const char *wmesg, int allocflags)
1041 VM_OBJECT_ASSERT_UNLOCKED(obj);
1043 (void)_vm_page_busy_sleep(obj, m, pindex, wmesg, allocflags, false);
1047 * _vm_page_busy_sleep:
1049 * Internal busy sleep function. Verifies the page identity and
1050 * lockstate against parameters. Returns true if it sleeps and
1053 * allocflags uses VM_ALLOC_* flags to specify the lock required.
1055 * If locked is true the lock will be dropped for any true returns
1056 * and held for any false returns.
1059 _vm_page_busy_sleep(vm_object_t obj, vm_page_t m, vm_pindex_t pindex,
1060 const char *wmesg, int allocflags, bool locked)
1066 * If the object is busy we must wait for that to drain to zero
1067 * before trying the page again.
1069 if (obj != NULL && vm_object_busied(obj)) {
1071 VM_OBJECT_DROP(obj);
1072 vm_object_busy_wait(obj, wmesg);
1076 if (!vm_page_busied(m))
1079 xsleep = (allocflags & (VM_ALLOC_SBUSY | VM_ALLOC_IGN_SBUSY)) != 0;
1081 x = vm_page_busy_fetch(m);
1084 * If the page changes objects or becomes unlocked we can
1087 if (x == VPB_UNBUSIED ||
1088 (xsleep && (x & VPB_BIT_SHARED) != 0) ||
1089 m->object != obj || m->pindex != pindex) {
1093 if ((x & VPB_BIT_WAITERS) != 0)
1095 } while (!atomic_fcmpset_int(&m->busy_lock, &x, x | VPB_BIT_WAITERS));
1097 VM_OBJECT_DROP(obj);
1099 sleepq_add(m, NULL, wmesg, 0, 0);
1100 sleepq_wait(m, PVM);
1108 * Try to shared busy a page.
1109 * If the operation succeeds 1 is returned otherwise 0.
1110 * The operation never sleeps.
1113 vm_page_trysbusy(vm_page_t m)
1119 x = vm_page_busy_fetch(m);
1121 if ((x & VPB_BIT_SHARED) == 0)
1124 * Reduce the window for transient busies that will trigger
1125 * false negatives in vm_page_ps_test().
1127 if (obj != NULL && vm_object_busied(obj))
1129 if (atomic_fcmpset_acq_int(&m->busy_lock, &x,
1130 x + VPB_ONE_SHARER))
1134 /* Refetch the object now that we're guaranteed that it is stable. */
1136 if (obj != NULL && vm_object_busied(obj)) {
1146 * Try to exclusive busy a page.
1147 * If the operation succeeds 1 is returned otherwise 0.
1148 * The operation never sleeps.
1151 vm_page_tryxbusy(vm_page_t m)
1155 if (atomic_cmpset_acq_int(&m->busy_lock, VPB_UNBUSIED,
1156 VPB_CURTHREAD_EXCLUSIVE) == 0)
1160 if (obj != NULL && vm_object_busied(obj)) {
1168 vm_page_xunbusy_hard_tail(vm_page_t m)
1170 atomic_store_rel_int(&m->busy_lock, VPB_UNBUSIED);
1171 /* Wake the waiter. */
1176 * vm_page_xunbusy_hard:
1178 * Called when unbusy has failed because there is a waiter.
1181 vm_page_xunbusy_hard(vm_page_t m)
1183 vm_page_assert_xbusied(m);
1184 vm_page_xunbusy_hard_tail(m);
1188 vm_page_xunbusy_hard_unchecked(vm_page_t m)
1190 vm_page_assert_xbusied_unchecked(m);
1191 vm_page_xunbusy_hard_tail(m);
1195 vm_page_busy_free(vm_page_t m)
1199 atomic_thread_fence_rel();
1200 x = atomic_swap_int(&m->busy_lock, VPB_FREED);
1201 if ((x & VPB_BIT_WAITERS) != 0)
1206 * vm_page_unhold_pages:
1208 * Unhold each of the pages that is referenced by the given array.
1211 vm_page_unhold_pages(vm_page_t *ma, int count)
1214 for (; count != 0; count--) {
1215 vm_page_unwire(*ma, PQ_ACTIVE);
1221 PHYS_TO_VM_PAGE(vm_paddr_t pa)
1225 #ifdef VM_PHYSSEG_SPARSE
1226 m = vm_phys_paddr_to_vm_page(pa);
1228 m = vm_phys_fictitious_to_vm_page(pa);
1230 #elif defined(VM_PHYSSEG_DENSE)
1234 if (pi >= first_page && (pi - first_page) < vm_page_array_size) {
1235 m = &vm_page_array[pi - first_page];
1238 return (vm_phys_fictitious_to_vm_page(pa));
1240 #error "Either VM_PHYSSEG_DENSE or VM_PHYSSEG_SPARSE must be defined."
1247 * Create a fictitious page with the specified physical address and
1248 * memory attribute. The memory attribute is the only the machine-
1249 * dependent aspect of a fictitious page that must be initialized.
1252 vm_page_getfake(vm_paddr_t paddr, vm_memattr_t memattr)
1256 m = uma_zalloc(fakepg_zone, M_WAITOK | M_ZERO);
1257 vm_page_initfake(m, paddr, memattr);
1262 vm_page_initfake(vm_page_t m, vm_paddr_t paddr, vm_memattr_t memattr)
1265 if ((m->flags & PG_FICTITIOUS) != 0) {
1267 * The page's memattr might have changed since the
1268 * previous initialization. Update the pmap to the
1273 m->phys_addr = paddr;
1274 m->a.queue = PQ_NONE;
1275 /* Fictitious pages don't use "segind". */
1276 m->flags = PG_FICTITIOUS;
1277 /* Fictitious pages don't use "order" or "pool". */
1278 m->oflags = VPO_UNMANAGED;
1279 m->busy_lock = VPB_CURTHREAD_EXCLUSIVE;
1280 /* Fictitious pages are unevictable. */
1284 pmap_page_set_memattr(m, memattr);
1290 * Release a fictitious page.
1293 vm_page_putfake(vm_page_t m)
1296 KASSERT((m->oflags & VPO_UNMANAGED) != 0, ("managed %p", m));
1297 KASSERT((m->flags & PG_FICTITIOUS) != 0,
1298 ("vm_page_putfake: bad page %p", m));
1299 vm_page_assert_xbusied(m);
1300 vm_page_busy_free(m);
1301 uma_zfree(fakepg_zone, m);
1305 * vm_page_updatefake:
1307 * Update the given fictitious page to the specified physical address and
1311 vm_page_updatefake(vm_page_t m, vm_paddr_t paddr, vm_memattr_t memattr)
1314 KASSERT((m->flags & PG_FICTITIOUS) != 0,
1315 ("vm_page_updatefake: bad page %p", m));
1316 m->phys_addr = paddr;
1317 pmap_page_set_memattr(m, memattr);
1326 vm_page_free(vm_page_t m)
1329 m->flags &= ~PG_ZERO;
1330 vm_page_free_toq(m);
1334 * vm_page_free_zero:
1336 * Free a page to the zerod-pages queue
1339 vm_page_free_zero(vm_page_t m)
1342 m->flags |= PG_ZERO;
1343 vm_page_free_toq(m);
1347 * Unbusy and handle the page queueing for a page from a getpages request that
1348 * was optionally read ahead or behind.
1351 vm_page_readahead_finish(vm_page_t m)
1354 /* We shouldn't put invalid pages on queues. */
1355 KASSERT(!vm_page_none_valid(m), ("%s: %p is invalid", __func__, m));
1358 * Since the page is not the actually needed one, whether it should
1359 * be activated or deactivated is not obvious. Empirical results
1360 * have shown that deactivating the page is usually the best choice,
1361 * unless the page is wanted by another thread.
1363 if ((vm_page_busy_fetch(m) & VPB_BIT_WAITERS) != 0)
1364 vm_page_activate(m);
1366 vm_page_deactivate(m);
1367 vm_page_xunbusy_unchecked(m);
1371 * Destroy the identity of an invalid page and free it if possible.
1372 * This is intended to be used when reading a page from backing store fails.
1375 vm_page_free_invalid(vm_page_t m)
1378 KASSERT(vm_page_none_valid(m), ("page %p is valid", m));
1379 KASSERT(!pmap_page_is_mapped(m), ("page %p is mapped", m));
1380 KASSERT(m->object != NULL, ("page %p has no object", m));
1381 VM_OBJECT_ASSERT_WLOCKED(m->object);
1384 * We may be attempting to free the page as part of the handling for an
1385 * I/O error, in which case the page was xbusied by a different thread.
1387 vm_page_xbusy_claim(m);
1390 * If someone has wired this page while the object lock
1391 * was not held, then the thread that unwires is responsible
1392 * for freeing the page. Otherwise just free the page now.
1393 * The wire count of this unmapped page cannot change while
1394 * we have the page xbusy and the page's object wlocked.
1396 if (vm_page_remove(m))
1401 * vm_page_dirty_KBI: [ internal use only ]
1403 * Set all bits in the page's dirty field.
1405 * The object containing the specified page must be locked if the
1406 * call is made from the machine-independent layer.
1408 * See vm_page_clear_dirty_mask().
1410 * This function should only be called by vm_page_dirty().
1413 vm_page_dirty_KBI(vm_page_t m)
1416 /* Refer to this operation by its public name. */
1417 KASSERT(vm_page_all_valid(m), ("vm_page_dirty: page is invalid!"));
1418 m->dirty = VM_PAGE_BITS_ALL;
1422 * vm_page_insert: [ internal use only ]
1424 * Inserts the given mem entry into the object and object list.
1426 * The object must be locked.
1429 vm_page_insert(vm_page_t m, vm_object_t object, vm_pindex_t pindex)
1433 VM_OBJECT_ASSERT_WLOCKED(object);
1434 mpred = vm_radix_lookup_le(&object->rtree, pindex);
1435 return (vm_page_insert_after(m, object, pindex, mpred));
1439 * vm_page_insert_after:
1441 * Inserts the page "m" into the specified object at offset "pindex".
1443 * The page "mpred" must immediately precede the offset "pindex" within
1444 * the specified object.
1446 * The object must be locked.
1449 vm_page_insert_after(vm_page_t m, vm_object_t object, vm_pindex_t pindex,
1454 VM_OBJECT_ASSERT_WLOCKED(object);
1455 KASSERT(m->object == NULL,
1456 ("vm_page_insert_after: page already inserted"));
1457 if (mpred != NULL) {
1458 KASSERT(mpred->object == object,
1459 ("vm_page_insert_after: object doesn't contain mpred"));
1460 KASSERT(mpred->pindex < pindex,
1461 ("vm_page_insert_after: mpred doesn't precede pindex"));
1462 msucc = TAILQ_NEXT(mpred, listq);
1464 msucc = TAILQ_FIRST(&object->memq);
1466 KASSERT(msucc->pindex > pindex,
1467 ("vm_page_insert_after: msucc doesn't succeed pindex"));
1470 * Record the object/offset pair in this page.
1474 m->ref_count |= VPRC_OBJREF;
1477 * Now link into the object's ordered list of backed pages.
1479 if (vm_radix_insert(&object->rtree, m)) {
1482 m->ref_count &= ~VPRC_OBJREF;
1485 vm_page_insert_radixdone(m, object, mpred);
1486 vm_pager_page_inserted(object, m);
1491 * vm_page_insert_radixdone:
1493 * Complete page "m" insertion into the specified object after the
1494 * radix trie hooking.
1496 * The page "mpred" must precede the offset "m->pindex" within the
1499 * The object must be locked.
1502 vm_page_insert_radixdone(vm_page_t m, vm_object_t object, vm_page_t mpred)
1505 VM_OBJECT_ASSERT_WLOCKED(object);
1506 KASSERT(object != NULL && m->object == object,
1507 ("vm_page_insert_radixdone: page %p has inconsistent object", m));
1508 KASSERT((m->ref_count & VPRC_OBJREF) != 0,
1509 ("vm_page_insert_radixdone: page %p is missing object ref", m));
1510 if (mpred != NULL) {
1511 KASSERT(mpred->object == object,
1512 ("vm_page_insert_radixdone: object doesn't contain mpred"));
1513 KASSERT(mpred->pindex < m->pindex,
1514 ("vm_page_insert_radixdone: mpred doesn't precede pindex"));
1518 TAILQ_INSERT_AFTER(&object->memq, mpred, m, listq);
1520 TAILQ_INSERT_HEAD(&object->memq, m, listq);
1523 * Show that the object has one more resident page.
1525 object->resident_page_count++;
1528 * Hold the vnode until the last page is released.
1530 if (object->resident_page_count == 1 && object->type == OBJT_VNODE)
1531 vhold(object->handle);
1534 * Since we are inserting a new and possibly dirty page,
1535 * update the object's generation count.
1537 if (pmap_page_is_write_mapped(m))
1538 vm_object_set_writeable_dirty(object);
1542 * Do the work to remove a page from its object. The caller is responsible for
1543 * updating the page's fields to reflect this removal.
1546 vm_page_object_remove(vm_page_t m)
1551 vm_page_assert_xbusied(m);
1553 VM_OBJECT_ASSERT_WLOCKED(object);
1554 KASSERT((m->ref_count & VPRC_OBJREF) != 0,
1555 ("page %p is missing its object ref", m));
1557 /* Deferred free of swap space. */
1558 if ((m->a.flags & PGA_SWAP_FREE) != 0)
1559 vm_pager_page_unswapped(m);
1561 vm_pager_page_removed(object, m);
1564 mrem = vm_radix_remove(&object->rtree, m->pindex);
1565 KASSERT(mrem == m, ("removed page %p, expected page %p", mrem, m));
1568 * Now remove from the object's list of backed pages.
1570 TAILQ_REMOVE(&object->memq, m, listq);
1573 * And show that the object has one fewer resident page.
1575 object->resident_page_count--;
1578 * The vnode may now be recycled.
1580 if (object->resident_page_count == 0 && object->type == OBJT_VNODE)
1581 vdrop(object->handle);
1587 * Removes the specified page from its containing object, but does not
1588 * invalidate any backing storage. Returns true if the object's reference
1589 * was the last reference to the page, and false otherwise.
1591 * The object must be locked and the page must be exclusively busied.
1592 * The exclusive busy will be released on return. If this is not the
1593 * final ref and the caller does not hold a wire reference it may not
1594 * continue to access the page.
1597 vm_page_remove(vm_page_t m)
1601 dropped = vm_page_remove_xbusy(m);
1608 * vm_page_remove_xbusy
1610 * Removes the page but leaves the xbusy held. Returns true if this
1611 * removed the final ref and false otherwise.
1614 vm_page_remove_xbusy(vm_page_t m)
1617 vm_page_object_remove(m);
1618 return (vm_page_drop(m, VPRC_OBJREF) == VPRC_OBJREF);
1624 * Returns the page associated with the object/offset
1625 * pair specified; if none is found, NULL is returned.
1627 * The object must be locked.
1630 vm_page_lookup(vm_object_t object, vm_pindex_t pindex)
1633 VM_OBJECT_ASSERT_LOCKED(object);
1634 return (vm_radix_lookup(&object->rtree, pindex));
1638 * vm_page_lookup_unlocked:
1640 * Returns the page associated with the object/offset pair specified;
1641 * if none is found, NULL is returned. The page may be no longer be
1642 * present in the object at the time that this function returns. Only
1643 * useful for opportunistic checks such as inmem().
1646 vm_page_lookup_unlocked(vm_object_t object, vm_pindex_t pindex)
1649 return (vm_radix_lookup_unlocked(&object->rtree, pindex));
1655 * Returns a page that must already have been busied by
1656 * the caller. Used for bogus page replacement.
1659 vm_page_relookup(vm_object_t object, vm_pindex_t pindex)
1663 m = vm_radix_lookup_unlocked(&object->rtree, pindex);
1664 KASSERT(m != NULL && (vm_page_busied(m) || vm_page_wired(m)) &&
1665 m->object == object && m->pindex == pindex,
1666 ("vm_page_relookup: Invalid page %p", m));
1671 * This should only be used by lockless functions for releasing transient
1672 * incorrect acquires. The page may have been freed after we acquired a
1673 * busy lock. In this case busy_lock == VPB_FREED and we have nothing
1677 vm_page_busy_release(vm_page_t m)
1681 x = vm_page_busy_fetch(m);
1685 if ((x & VPB_BIT_SHARED) != 0 && VPB_SHARERS(x) > 1) {
1686 if (atomic_fcmpset_int(&m->busy_lock, &x,
1687 x - VPB_ONE_SHARER))
1691 KASSERT((x & VPB_BIT_SHARED) != 0 ||
1692 (x & ~VPB_BIT_WAITERS) == VPB_CURTHREAD_EXCLUSIVE,
1693 ("vm_page_busy_release: %p xbusy not owned.", m));
1694 if (!atomic_fcmpset_rel_int(&m->busy_lock, &x, VPB_UNBUSIED))
1696 if ((x & VPB_BIT_WAITERS) != 0)
1703 * vm_page_find_least:
1705 * Returns the page associated with the object with least pindex
1706 * greater than or equal to the parameter pindex, or NULL.
1708 * The object must be locked.
1711 vm_page_find_least(vm_object_t object, vm_pindex_t pindex)
1715 VM_OBJECT_ASSERT_LOCKED(object);
1716 if ((m = TAILQ_FIRST(&object->memq)) != NULL && m->pindex < pindex)
1717 m = vm_radix_lookup_ge(&object->rtree, pindex);
1722 * Returns the given page's successor (by pindex) within the object if it is
1723 * resident; if none is found, NULL is returned.
1725 * The object must be locked.
1728 vm_page_next(vm_page_t m)
1732 VM_OBJECT_ASSERT_LOCKED(m->object);
1733 if ((next = TAILQ_NEXT(m, listq)) != NULL) {
1734 MPASS(next->object == m->object);
1735 if (next->pindex != m->pindex + 1)
1742 * Returns the given page's predecessor (by pindex) within the object if it is
1743 * resident; if none is found, NULL is returned.
1745 * The object must be locked.
1748 vm_page_prev(vm_page_t m)
1752 VM_OBJECT_ASSERT_LOCKED(m->object);
1753 if ((prev = TAILQ_PREV(m, pglist, listq)) != NULL) {
1754 MPASS(prev->object == m->object);
1755 if (prev->pindex != m->pindex - 1)
1762 * Uses the page mnew as a replacement for an existing page at index
1763 * pindex which must be already present in the object.
1765 * Both pages must be exclusively busied on enter. The old page is
1768 * A return value of true means mold is now free. If this is not the
1769 * final ref and the caller does not hold a wire reference it may not
1770 * continue to access the page.
1773 vm_page_replace_hold(vm_page_t mnew, vm_object_t object, vm_pindex_t pindex,
1779 VM_OBJECT_ASSERT_WLOCKED(object);
1780 vm_page_assert_xbusied(mold);
1781 KASSERT(mnew->object == NULL && (mnew->ref_count & VPRC_OBJREF) == 0,
1782 ("vm_page_replace: page %p already in object", mnew));
1785 * This function mostly follows vm_page_insert() and
1786 * vm_page_remove() without the radix, object count and vnode
1787 * dance. Double check such functions for more comments.
1790 mnew->object = object;
1791 mnew->pindex = pindex;
1792 atomic_set_int(&mnew->ref_count, VPRC_OBJREF);
1793 mret = vm_radix_replace(&object->rtree, mnew);
1794 KASSERT(mret == mold,
1795 ("invalid page replacement, mold=%p, mret=%p", mold, mret));
1796 KASSERT((mold->oflags & VPO_UNMANAGED) ==
1797 (mnew->oflags & VPO_UNMANAGED),
1798 ("vm_page_replace: mismatched VPO_UNMANAGED"));
1800 /* Keep the resident page list in sorted order. */
1801 TAILQ_INSERT_AFTER(&object->memq, mold, mnew, listq);
1802 TAILQ_REMOVE(&object->memq, mold, listq);
1803 mold->object = NULL;
1806 * The object's resident_page_count does not change because we have
1807 * swapped one page for another, but the generation count should
1808 * change if the page is dirty.
1810 if (pmap_page_is_write_mapped(mnew))
1811 vm_object_set_writeable_dirty(object);
1812 dropped = vm_page_drop(mold, VPRC_OBJREF) == VPRC_OBJREF;
1813 vm_page_xunbusy(mold);
1819 vm_page_replace(vm_page_t mnew, vm_object_t object, vm_pindex_t pindex,
1823 vm_page_assert_xbusied(mnew);
1825 if (vm_page_replace_hold(mnew, object, pindex, mold))
1832 * Move the given memory entry from its
1833 * current object to the specified target object/offset.
1835 * Note: swap associated with the page must be invalidated by the move. We
1836 * have to do this for several reasons: (1) we aren't freeing the
1837 * page, (2) we are dirtying the page, (3) the VM system is probably
1838 * moving the page from object A to B, and will then later move
1839 * the backing store from A to B and we can't have a conflict.
1841 * Note: we *always* dirty the page. It is necessary both for the
1842 * fact that we moved it, and because we may be invalidating
1845 * The objects must be locked.
1848 vm_page_rename(vm_page_t m, vm_object_t new_object, vm_pindex_t new_pindex)
1853 VM_OBJECT_ASSERT_WLOCKED(new_object);
1855 KASSERT(m->ref_count != 0, ("vm_page_rename: page %p has no refs", m));
1856 mpred = vm_radix_lookup_le(&new_object->rtree, new_pindex);
1857 KASSERT(mpred == NULL || mpred->pindex != new_pindex,
1858 ("vm_page_rename: pindex already renamed"));
1861 * Create a custom version of vm_page_insert() which does not depend
1862 * by m_prev and can cheat on the implementation aspects of the
1866 m->pindex = new_pindex;
1867 if (vm_radix_insert(&new_object->rtree, m)) {
1873 * The operation cannot fail anymore. The removal must happen before
1874 * the listq iterator is tainted.
1877 vm_page_object_remove(m);
1879 /* Return back to the new pindex to complete vm_page_insert(). */
1880 m->pindex = new_pindex;
1881 m->object = new_object;
1883 vm_page_insert_radixdone(m, new_object, mpred);
1885 vm_pager_page_inserted(new_object, m);
1892 * Allocate and return a page that is associated with the specified
1893 * object and offset pair. By default, this page is exclusive busied.
1895 * The caller must always specify an allocation class.
1897 * allocation classes:
1898 * VM_ALLOC_NORMAL normal process request
1899 * VM_ALLOC_SYSTEM system *really* needs a page
1900 * VM_ALLOC_INTERRUPT interrupt time request
1902 * optional allocation flags:
1903 * VM_ALLOC_COUNT(number) the number of additional pages that the caller
1904 * intends to allocate
1905 * VM_ALLOC_NOBUSY do not exclusive busy the page
1906 * VM_ALLOC_NODUMP do not include the page in a kernel core dump
1907 * VM_ALLOC_NOOBJ page is not associated with an object and
1908 * should not be exclusive busy
1909 * VM_ALLOC_SBUSY shared busy the allocated page
1910 * VM_ALLOC_WIRED wire the allocated page
1911 * VM_ALLOC_ZERO prefer a zeroed page
1914 vm_page_alloc(vm_object_t object, vm_pindex_t pindex, int req)
1917 return (vm_page_alloc_after(object, pindex, req, object != NULL ?
1918 vm_radix_lookup_le(&object->rtree, pindex) : NULL));
1922 vm_page_alloc_domain(vm_object_t object, vm_pindex_t pindex, int domain,
1926 return (vm_page_alloc_domain_after(object, pindex, domain, req,
1927 object != NULL ? vm_radix_lookup_le(&object->rtree, pindex) :
1932 * Allocate a page in the specified object with the given page index. To
1933 * optimize insertion of the page into the object, the caller must also specifiy
1934 * the resident page in the object with largest index smaller than the given
1935 * page index, or NULL if no such page exists.
1938 vm_page_alloc_after(vm_object_t object, vm_pindex_t pindex,
1939 int req, vm_page_t mpred)
1941 struct vm_domainset_iter di;
1945 vm_domainset_iter_page_init(&di, object, pindex, &domain, &req);
1947 m = vm_page_alloc_domain_after(object, pindex, domain, req,
1951 } while (vm_domainset_iter_page(&di, object, &domain) == 0);
1957 * Returns true if the number of free pages exceeds the minimum
1958 * for the request class and false otherwise.
1961 _vm_domain_allocate(struct vm_domain *vmd, int req_class, int npages)
1963 u_int limit, old, new;
1965 if (req_class == VM_ALLOC_INTERRUPT)
1967 else if (req_class == VM_ALLOC_SYSTEM)
1968 limit = vmd->vmd_interrupt_free_min;
1970 limit = vmd->vmd_free_reserved;
1973 * Attempt to reserve the pages. Fail if we're below the limit.
1976 old = vmd->vmd_free_count;
1981 } while (atomic_fcmpset_int(&vmd->vmd_free_count, &old, new) == 0);
1983 /* Wake the page daemon if we've crossed the threshold. */
1984 if (vm_paging_needed(vmd, new) && !vm_paging_needed(vmd, old))
1985 pagedaemon_wakeup(vmd->vmd_domain);
1987 /* Only update bitsets on transitions. */
1988 if ((old >= vmd->vmd_free_min && new < vmd->vmd_free_min) ||
1989 (old >= vmd->vmd_free_severe && new < vmd->vmd_free_severe))
1996 vm_domain_allocate(struct vm_domain *vmd, int req, int npages)
2001 * The page daemon is allowed to dig deeper into the free page list.
2003 req_class = req & VM_ALLOC_CLASS_MASK;
2004 if (curproc == pageproc && req_class != VM_ALLOC_INTERRUPT)
2005 req_class = VM_ALLOC_SYSTEM;
2006 return (_vm_domain_allocate(vmd, req_class, npages));
2010 vm_page_alloc_domain_after(vm_object_t object, vm_pindex_t pindex, int domain,
2011 int req, vm_page_t mpred)
2013 struct vm_domain *vmd;
2017 KASSERT((object != NULL) == ((req & VM_ALLOC_NOOBJ) == 0) &&
2018 (object != NULL || (req & VM_ALLOC_SBUSY) == 0) &&
2019 ((req & (VM_ALLOC_NOBUSY | VM_ALLOC_SBUSY)) !=
2020 (VM_ALLOC_NOBUSY | VM_ALLOC_SBUSY)),
2021 ("inconsistent object(%p)/req(%x)", object, req));
2022 KASSERT(object == NULL || (req & VM_ALLOC_WAITOK) == 0,
2023 ("Can't sleep and retry object insertion."));
2024 KASSERT(mpred == NULL || mpred->pindex < pindex,
2025 ("mpred %p doesn't precede pindex 0x%jx", mpred,
2026 (uintmax_t)pindex));
2028 VM_OBJECT_ASSERT_WLOCKED(object);
2032 if (!vm_pager_can_alloc_page(object, pindex))
2034 pool = object != NULL ? VM_FREEPOOL_DEFAULT : VM_FREEPOOL_DIRECT;
2036 #if VM_NRESERVLEVEL > 0
2038 * Can we allocate the page from a reservation?
2040 if (vm_object_reserv(object) &&
2041 (m = vm_reserv_alloc_page(object, pindex, domain, req, mpred)) !=
2046 vmd = VM_DOMAIN(domain);
2047 if (vmd->vmd_pgcache[pool].zone != NULL) {
2048 m = uma_zalloc(vmd->vmd_pgcache[pool].zone, M_NOWAIT | M_NOVM);
2050 flags |= PG_PCPU_CACHE;
2054 if (vm_domain_allocate(vmd, req, 1)) {
2056 * If not, allocate it from the free page queues.
2058 vm_domain_free_lock(vmd);
2059 m = vm_phys_alloc_pages(domain, pool, 0);
2060 vm_domain_free_unlock(vmd);
2062 vm_domain_freecnt_inc(vmd, 1);
2063 #if VM_NRESERVLEVEL > 0
2064 if (vm_reserv_reclaim_inactive(domain))
2071 * Not allocatable, give up.
2073 if (vm_domain_alloc_fail(vmd, object, req))
2079 * At this point we had better have found a good page.
2083 vm_page_alloc_check(m);
2086 * Initialize the page. Only the PG_ZERO flag is inherited.
2088 if ((req & VM_ALLOC_ZERO) != 0)
2089 flags |= (m->flags & PG_ZERO);
2090 if ((req & VM_ALLOC_NODUMP) != 0)
2094 m->oflags = object == NULL || (object->flags & OBJ_UNMANAGED) != 0 ?
2096 if ((req & (VM_ALLOC_NOBUSY | VM_ALLOC_NOOBJ | VM_ALLOC_SBUSY)) == 0)
2097 m->busy_lock = VPB_CURTHREAD_EXCLUSIVE;
2098 else if ((req & VM_ALLOC_SBUSY) != 0)
2099 m->busy_lock = VPB_SHARERS_WORD(1);
2101 m->busy_lock = VPB_UNBUSIED;
2102 if (req & VM_ALLOC_WIRED) {
2108 if (object != NULL) {
2109 if (vm_page_insert_after(m, object, pindex, mpred)) {
2110 if (req & VM_ALLOC_WIRED) {
2114 KASSERT(m->object == NULL, ("page %p has object", m));
2115 m->oflags = VPO_UNMANAGED;
2116 m->busy_lock = VPB_UNBUSIED;
2117 /* Don't change PG_ZERO. */
2118 vm_page_free_toq(m);
2119 if (req & VM_ALLOC_WAITFAIL) {
2120 VM_OBJECT_WUNLOCK(object);
2122 VM_OBJECT_WLOCK(object);
2127 /* Ignore device objects; the pager sets "memattr" for them. */
2128 if (object->memattr != VM_MEMATTR_DEFAULT &&
2129 (object->flags & OBJ_FICTITIOUS) == 0)
2130 pmap_page_set_memattr(m, object->memattr);
2138 * vm_page_alloc_contig:
2140 * Allocate a contiguous set of physical pages of the given size "npages"
2141 * from the free lists. All of the physical pages must be at or above
2142 * the given physical address "low" and below the given physical address
2143 * "high". The given value "alignment" determines the alignment of the
2144 * first physical page in the set. If the given value "boundary" is
2145 * non-zero, then the set of physical pages cannot cross any physical
2146 * address boundary that is a multiple of that value. Both "alignment"
2147 * and "boundary" must be a power of two.
2149 * If the specified memory attribute, "memattr", is VM_MEMATTR_DEFAULT,
2150 * then the memory attribute setting for the physical pages is configured
2151 * to the object's memory attribute setting. Otherwise, the memory
2152 * attribute setting for the physical pages is configured to "memattr",
2153 * overriding the object's memory attribute setting. However, if the
2154 * object's memory attribute setting is not VM_MEMATTR_DEFAULT, then the
2155 * memory attribute setting for the physical pages cannot be configured
2156 * to VM_MEMATTR_DEFAULT.
2158 * The specified object may not contain fictitious pages.
2160 * The caller must always specify an allocation class.
2162 * allocation classes:
2163 * VM_ALLOC_NORMAL normal process request
2164 * VM_ALLOC_SYSTEM system *really* needs a page
2165 * VM_ALLOC_INTERRUPT interrupt time request
2167 * optional allocation flags:
2168 * VM_ALLOC_NOBUSY do not exclusive busy the page
2169 * VM_ALLOC_NODUMP do not include the page in a kernel core dump
2170 * VM_ALLOC_NOOBJ page is not associated with an object and
2171 * should not be exclusive busy
2172 * VM_ALLOC_SBUSY shared busy the allocated page
2173 * VM_ALLOC_WIRED wire the allocated page
2174 * VM_ALLOC_ZERO prefer a zeroed page
2177 vm_page_alloc_contig(vm_object_t object, vm_pindex_t pindex, int req,
2178 u_long npages, vm_paddr_t low, vm_paddr_t high, u_long alignment,
2179 vm_paddr_t boundary, vm_memattr_t memattr)
2181 struct vm_domainset_iter di;
2185 vm_domainset_iter_page_init(&di, object, pindex, &domain, &req);
2187 m = vm_page_alloc_contig_domain(object, pindex, domain, req,
2188 npages, low, high, alignment, boundary, memattr);
2191 } while (vm_domainset_iter_page(&di, object, &domain) == 0);
2197 vm_page_find_contig_domain(int domain, int req, u_long npages, vm_paddr_t low,
2198 vm_paddr_t high, u_long alignment, vm_paddr_t boundary)
2200 struct vm_domain *vmd;
2203 vmd = VM_DOMAIN(domain);
2204 if (!vm_domain_allocate(vmd, req, npages))
2207 * Try to allocate the pages from the free page queues.
2209 vm_domain_free_lock(vmd);
2210 m_ret = vm_phys_alloc_contig(domain, npages, low, high,
2211 alignment, boundary);
2212 vm_domain_free_unlock(vmd);
2215 #if VM_NRESERVLEVEL > 0
2217 * Try to break a reservation to allocate the pages.
2219 if ((m_ret = vm_reserv_reclaim_contig(domain, npages, low,
2220 high, alignment, boundary)) != NULL)
2223 vm_domain_freecnt_inc(vmd, npages);
2228 vm_page_alloc_contig_domain(vm_object_t object, vm_pindex_t pindex, int domain,
2229 int req, u_long npages, vm_paddr_t low, vm_paddr_t high, u_long alignment,
2230 vm_paddr_t boundary, vm_memattr_t memattr)
2232 vm_page_t m, m_ret, mpred;
2233 u_int busy_lock, flags, oflags;
2235 mpred = NULL; /* XXX: pacify gcc */
2236 KASSERT((object != NULL) == ((req & VM_ALLOC_NOOBJ) == 0) &&
2237 (object != NULL || (req & VM_ALLOC_SBUSY) == 0) &&
2238 ((req & (VM_ALLOC_NOBUSY | VM_ALLOC_SBUSY)) !=
2239 (VM_ALLOC_NOBUSY | VM_ALLOC_SBUSY)),
2240 ("vm_page_alloc_contig: inconsistent object(%p)/req(%x)", object,
2242 KASSERT(object == NULL || (req & VM_ALLOC_WAITOK) == 0,
2243 ("Can't sleep and retry object insertion."));
2244 if (object != NULL) {
2245 VM_OBJECT_ASSERT_WLOCKED(object);
2246 KASSERT((object->flags & OBJ_FICTITIOUS) == 0,
2247 ("vm_page_alloc_contig: object %p has fictitious pages",
2250 KASSERT(npages > 0, ("vm_page_alloc_contig: npages is zero"));
2252 if (object != NULL) {
2253 mpred = vm_radix_lookup_le(&object->rtree, pindex);
2254 KASSERT(mpred == NULL || mpred->pindex != pindex,
2255 ("vm_page_alloc_contig: pindex already allocated"));
2259 * Can we allocate the pages without the number of free pages falling
2260 * below the lower bound for the allocation class?
2263 #if VM_NRESERVLEVEL > 0
2265 * Can we allocate the pages from a reservation?
2267 if (vm_object_reserv(object) &&
2268 (m_ret = vm_reserv_alloc_contig(object, pindex, domain, req,
2269 mpred, npages, low, high, alignment, boundary)) != NULL) {
2273 if ((m_ret = vm_page_find_contig_domain(domain, req, npages,
2274 low, high, alignment, boundary)) != NULL)
2276 if (!vm_domain_alloc_fail(VM_DOMAIN(domain), object, req))
2279 for (m = m_ret; m < &m_ret[npages]; m++) {
2281 vm_page_alloc_check(m);
2285 * Initialize the pages. Only the PG_ZERO flag is inherited.
2288 if ((req & VM_ALLOC_ZERO) != 0)
2290 if ((req & VM_ALLOC_NODUMP) != 0)
2292 oflags = object == NULL || (object->flags & OBJ_UNMANAGED) != 0 ?
2294 if ((req & (VM_ALLOC_NOBUSY | VM_ALLOC_NOOBJ | VM_ALLOC_SBUSY)) == 0)
2295 busy_lock = VPB_CURTHREAD_EXCLUSIVE;
2296 else if ((req & VM_ALLOC_SBUSY) != 0)
2297 busy_lock = VPB_SHARERS_WORD(1);
2299 busy_lock = VPB_UNBUSIED;
2300 if ((req & VM_ALLOC_WIRED) != 0)
2301 vm_wire_add(npages);
2302 if (object != NULL) {
2303 if (object->memattr != VM_MEMATTR_DEFAULT &&
2304 memattr == VM_MEMATTR_DEFAULT)
2305 memattr = object->memattr;
2307 for (m = m_ret; m < &m_ret[npages]; m++) {
2309 m->flags = (m->flags | PG_NODUMP) & flags;
2310 m->busy_lock = busy_lock;
2311 if ((req & VM_ALLOC_WIRED) != 0)
2315 if (object != NULL) {
2316 if (vm_page_insert_after(m, object, pindex, mpred)) {
2317 if ((req & VM_ALLOC_WIRED) != 0)
2318 vm_wire_sub(npages);
2319 KASSERT(m->object == NULL,
2320 ("page %p has object", m));
2322 for (m = m_ret; m < &m_ret[npages]; m++) {
2324 (req & VM_ALLOC_WIRED) != 0)
2326 m->oflags = VPO_UNMANAGED;
2327 m->busy_lock = VPB_UNBUSIED;
2328 /* Don't change PG_ZERO. */
2329 vm_page_free_toq(m);
2331 if (req & VM_ALLOC_WAITFAIL) {
2332 VM_OBJECT_WUNLOCK(object);
2334 VM_OBJECT_WLOCK(object);
2341 if (memattr != VM_MEMATTR_DEFAULT)
2342 pmap_page_set_memattr(m, memattr);
2349 * Allocate a physical page that is not intended to be inserted into a VM
2350 * object. If the "freelist" parameter is not equal to VM_NFREELIST, then only
2351 * pages from the specified vm_phys freelist will be returned.
2353 static __always_inline vm_page_t
2354 _vm_page_alloc_noobj_domain(int domain, const int freelist, int req)
2356 struct vm_domain *vmd;
2360 KASSERT((req & (VM_ALLOC_SBUSY | VM_ALLOC_IGN_SBUSY |
2361 VM_ALLOC_NOOBJ)) == 0,
2362 ("%s: invalid req %#x", __func__, req));
2364 flags = (req & VM_ALLOC_NODUMP) != 0 ? PG_NODUMP : 0;
2365 vmd = VM_DOMAIN(domain);
2367 if (freelist == VM_NFREELIST &&
2368 vmd->vmd_pgcache[VM_FREEPOOL_DIRECT].zone != NULL) {
2369 m = uma_zalloc(vmd->vmd_pgcache[VM_FREEPOOL_DIRECT].zone,
2372 flags |= PG_PCPU_CACHE;
2377 if (vm_domain_allocate(vmd, req, 1)) {
2378 vm_domain_free_lock(vmd);
2379 if (freelist == VM_NFREELIST)
2380 m = vm_phys_alloc_pages(domain, VM_FREEPOOL_DIRECT, 0);
2382 m = vm_phys_alloc_freelist_pages(domain, freelist,
2383 VM_FREEPOOL_DIRECT, 0);
2384 vm_domain_free_unlock(vmd);
2386 vm_domain_freecnt_inc(vmd, 1);
2387 #if VM_NRESERVLEVEL > 0
2388 if (freelist == VM_NFREELIST &&
2389 vm_reserv_reclaim_inactive(domain))
2395 if (vm_domain_alloc_fail(vmd, NULL, req))
2402 vm_page_alloc_check(m);
2404 /* Consumers should not rely on a useful default pindex value. */
2405 m->pindex = 0xdeadc0dedeadc0de;
2406 m->flags = (m->flags & PG_ZERO) | flags;
2408 m->oflags = VPO_UNMANAGED;
2409 m->busy_lock = VPB_UNBUSIED;
2410 if ((req & VM_ALLOC_WIRED) != 0) {
2415 if ((req & VM_ALLOC_ZERO) != 0 && (m->flags & PG_ZERO) == 0)
2422 vm_page_alloc_freelist(int freelist, int req)
2424 struct vm_domainset_iter di;
2428 vm_domainset_iter_page_init(&di, NULL, 0, &domain, &req);
2430 m = vm_page_alloc_freelist_domain(domain, freelist, req);
2433 } while (vm_domainset_iter_page(&di, NULL, &domain) == 0);
2439 vm_page_alloc_freelist_domain(int domain, int freelist, int req)
2441 KASSERT(freelist >= 0 && freelist < VM_NFREELIST,
2442 ("%s: invalid freelist %d", __func__, freelist));
2444 return (_vm_page_alloc_noobj_domain(domain, freelist, req));
2448 vm_page_alloc_noobj(int req)
2450 struct vm_domainset_iter di;
2454 vm_domainset_iter_page_init(&di, NULL, 0, &domain, &req);
2456 m = vm_page_alloc_noobj_domain(domain, req);
2459 } while (vm_domainset_iter_page(&di, NULL, &domain) == 0);
2465 vm_page_alloc_noobj_domain(int domain, int req)
2467 return (_vm_page_alloc_noobj_domain(domain, VM_NFREELIST, req));
2471 vm_page_alloc_noobj_contig(int req, u_long npages, vm_paddr_t low,
2472 vm_paddr_t high, u_long alignment, vm_paddr_t boundary,
2473 vm_memattr_t memattr)
2475 struct vm_domainset_iter di;
2479 vm_domainset_iter_page_init(&di, NULL, 0, &domain, &req);
2481 m = vm_page_alloc_noobj_contig_domain(domain, req, npages, low,
2482 high, alignment, boundary, memattr);
2485 } while (vm_domainset_iter_page(&di, NULL, &domain) == 0);
2491 vm_page_alloc_noobj_contig_domain(int domain, int req, u_long npages,
2492 vm_paddr_t low, vm_paddr_t high, u_long alignment, vm_paddr_t boundary,
2493 vm_memattr_t memattr)
2498 KASSERT((req & (VM_ALLOC_SBUSY | VM_ALLOC_IGN_SBUSY |
2499 VM_ALLOC_NOOBJ)) == 0,
2500 ("%s: invalid req %#x", __func__, req));
2502 m = vm_page_alloc_contig_domain(NULL, 0, domain, req | VM_ALLOC_NOOBJ,
2503 npages, low, high, alignment, boundary, memattr);
2504 if (m != NULL && (req & VM_ALLOC_ZERO) != 0) {
2505 for (i = 0; i < npages; i++) {
2506 if ((m[i].flags & PG_ZERO) == 0)
2507 pmap_zero_page(&m[i]);
2514 * Check a page that has been freshly dequeued from a freelist.
2517 vm_page_alloc_check(vm_page_t m)
2520 KASSERT(m->object == NULL, ("page %p has object", m));
2521 KASSERT(m->a.queue == PQ_NONE &&
2522 (m->a.flags & PGA_QUEUE_STATE_MASK) == 0,
2523 ("page %p has unexpected queue %d, flags %#x",
2524 m, m->a.queue, (m->a.flags & PGA_QUEUE_STATE_MASK)));
2525 KASSERT(m->ref_count == 0, ("page %p has references", m));
2526 KASSERT(vm_page_busy_freed(m), ("page %p is not freed", m));
2527 KASSERT(m->dirty == 0, ("page %p is dirty", m));
2528 KASSERT(pmap_page_get_memattr(m) == VM_MEMATTR_DEFAULT,
2529 ("page %p has unexpected memattr %d",
2530 m, pmap_page_get_memattr(m)));
2531 KASSERT(vm_page_none_valid(m), ("free page %p is valid", m));
2532 pmap_vm_page_alloc_check(m);
2536 vm_page_zone_import(void *arg, void **store, int cnt, int domain, int flags)
2538 struct vm_domain *vmd;
2539 struct vm_pgcache *pgcache;
2543 vmd = VM_DOMAIN(pgcache->domain);
2546 * The page daemon should avoid creating extra memory pressure since its
2547 * main purpose is to replenish the store of free pages.
2549 if (vmd->vmd_severeset || curproc == pageproc ||
2550 !_vm_domain_allocate(vmd, VM_ALLOC_NORMAL, cnt))
2552 domain = vmd->vmd_domain;
2553 vm_domain_free_lock(vmd);
2554 i = vm_phys_alloc_npages(domain, pgcache->pool, cnt,
2555 (vm_page_t *)store);
2556 vm_domain_free_unlock(vmd);
2558 vm_domain_freecnt_inc(vmd, cnt - i);
2564 vm_page_zone_release(void *arg, void **store, int cnt)
2566 struct vm_domain *vmd;
2567 struct vm_pgcache *pgcache;
2572 vmd = VM_DOMAIN(pgcache->domain);
2573 vm_domain_free_lock(vmd);
2574 for (i = 0; i < cnt; i++) {
2575 m = (vm_page_t)store[i];
2576 vm_phys_free_pages(m, 0);
2578 vm_domain_free_unlock(vmd);
2579 vm_domain_freecnt_inc(vmd, cnt);
2582 #define VPSC_ANY 0 /* No restrictions. */
2583 #define VPSC_NORESERV 1 /* Skip reservations; implies VPSC_NOSUPER. */
2584 #define VPSC_NOSUPER 2 /* Skip superpages. */
2587 * vm_page_scan_contig:
2589 * Scan vm_page_array[] between the specified entries "m_start" and
2590 * "m_end" for a run of contiguous physical pages that satisfy the
2591 * specified conditions, and return the lowest page in the run. The
2592 * specified "alignment" determines the alignment of the lowest physical
2593 * page in the run. If the specified "boundary" is non-zero, then the
2594 * run of physical pages cannot span a physical address that is a
2595 * multiple of "boundary".
2597 * "m_end" is never dereferenced, so it need not point to a vm_page
2598 * structure within vm_page_array[].
2600 * "npages" must be greater than zero. "m_start" and "m_end" must not
2601 * span a hole (or discontiguity) in the physical address space. Both
2602 * "alignment" and "boundary" must be a power of two.
2605 vm_page_scan_contig(u_long npages, vm_page_t m_start, vm_page_t m_end,
2606 u_long alignment, vm_paddr_t boundary, int options)
2611 #if VM_NRESERVLEVEL > 0
2614 int m_inc, order, run_ext, run_len;
2616 KASSERT(npages > 0, ("npages is 0"));
2617 KASSERT(powerof2(alignment), ("alignment is not a power of 2"));
2618 KASSERT(powerof2(boundary), ("boundary is not a power of 2"));
2621 for (m = m_start; m < m_end && run_len < npages; m += m_inc) {
2622 KASSERT((m->flags & PG_MARKER) == 0,
2623 ("page %p is PG_MARKER", m));
2624 KASSERT((m->flags & PG_FICTITIOUS) == 0 || m->ref_count >= 1,
2625 ("fictitious page %p has invalid ref count", m));
2628 * If the current page would be the start of a run, check its
2629 * physical address against the end, alignment, and boundary
2630 * conditions. If it doesn't satisfy these conditions, either
2631 * terminate the scan or advance to the next page that
2632 * satisfies the failed condition.
2635 KASSERT(m_run == NULL, ("m_run != NULL"));
2636 if (m + npages > m_end)
2638 pa = VM_PAGE_TO_PHYS(m);
2639 if (!vm_addr_align_ok(pa, alignment)) {
2640 m_inc = atop(roundup2(pa, alignment) - pa);
2643 if (!vm_addr_bound_ok(pa, ptoa(npages), boundary)) {
2644 m_inc = atop(roundup2(pa, boundary) - pa);
2648 KASSERT(m_run != NULL, ("m_run == NULL"));
2652 if (vm_page_wired(m))
2654 #if VM_NRESERVLEVEL > 0
2655 else if ((level = vm_reserv_level(m)) >= 0 &&
2656 (options & VPSC_NORESERV) != 0) {
2658 /* Advance to the end of the reservation. */
2659 pa = VM_PAGE_TO_PHYS(m);
2660 m_inc = atop(roundup2(pa + 1, vm_reserv_size(level)) -
2664 else if ((object = atomic_load_ptr(&m->object)) != NULL) {
2666 * The page is considered eligible for relocation if
2667 * and only if it could be laundered or reclaimed by
2670 VM_OBJECT_RLOCK(object);
2671 if (object != m->object) {
2672 VM_OBJECT_RUNLOCK(object);
2675 /* Don't care: PG_NODUMP, PG_ZERO. */
2676 if (object->type != OBJT_DEFAULT &&
2677 (object->flags & OBJ_SWAP) == 0 &&
2678 object->type != OBJT_VNODE) {
2680 #if VM_NRESERVLEVEL > 0
2681 } else if ((options & VPSC_NOSUPER) != 0 &&
2682 (level = vm_reserv_level_iffullpop(m)) >= 0) {
2684 /* Advance to the end of the superpage. */
2685 pa = VM_PAGE_TO_PHYS(m);
2686 m_inc = atop(roundup2(pa + 1,
2687 vm_reserv_size(level)) - pa);
2689 } else if (object->memattr == VM_MEMATTR_DEFAULT &&
2690 vm_page_queue(m) != PQ_NONE && !vm_page_busied(m)) {
2692 * The page is allocated but eligible for
2693 * relocation. Extend the current run by one
2696 KASSERT(pmap_page_get_memattr(m) ==
2698 ("page %p has an unexpected memattr", m));
2699 KASSERT((m->oflags & (VPO_SWAPINPROG |
2700 VPO_SWAPSLEEP | VPO_UNMANAGED)) == 0,
2701 ("page %p has unexpected oflags", m));
2702 /* Don't care: PGA_NOSYNC. */
2706 VM_OBJECT_RUNLOCK(object);
2707 #if VM_NRESERVLEVEL > 0
2708 } else if (level >= 0) {
2710 * The page is reserved but not yet allocated. In
2711 * other words, it is still free. Extend the current
2716 } else if ((order = m->order) < VM_NFREEORDER) {
2718 * The page is enqueued in the physical memory
2719 * allocator's free page queues. Moreover, it is the
2720 * first page in a power-of-two-sized run of
2721 * contiguous free pages. Add these pages to the end
2722 * of the current run, and jump ahead.
2724 run_ext = 1 << order;
2728 * Skip the page for one of the following reasons: (1)
2729 * It is enqueued in the physical memory allocator's
2730 * free page queues. However, it is not the first
2731 * page in a run of contiguous free pages. (This case
2732 * rarely occurs because the scan is performed in
2733 * ascending order.) (2) It is not reserved, and it is
2734 * transitioning from free to allocated. (Conversely,
2735 * the transition from allocated to free for managed
2736 * pages is blocked by the page busy lock.) (3) It is
2737 * allocated but not contained by an object and not
2738 * wired, e.g., allocated by Xen's balloon driver.
2744 * Extend or reset the current run of pages.
2757 if (run_len >= npages)
2763 * vm_page_reclaim_run:
2765 * Try to relocate each of the allocated virtual pages within the
2766 * specified run of physical pages to a new physical address. Free the
2767 * physical pages underlying the relocated virtual pages. A virtual page
2768 * is relocatable if and only if it could be laundered or reclaimed by
2769 * the page daemon. Whenever possible, a virtual page is relocated to a
2770 * physical address above "high".
2772 * Returns 0 if every physical page within the run was already free or
2773 * just freed by a successful relocation. Otherwise, returns a non-zero
2774 * value indicating why the last attempt to relocate a virtual page was
2777 * "req_class" must be an allocation class.
2780 vm_page_reclaim_run(int req_class, int domain, u_long npages, vm_page_t m_run,
2783 struct vm_domain *vmd;
2784 struct spglist free;
2787 vm_page_t m, m_end, m_new;
2788 int error, order, req;
2790 KASSERT((req_class & VM_ALLOC_CLASS_MASK) == req_class,
2791 ("req_class is not an allocation class"));
2795 m_end = m_run + npages;
2796 for (; error == 0 && m < m_end; m++) {
2797 KASSERT((m->flags & (PG_FICTITIOUS | PG_MARKER)) == 0,
2798 ("page %p is PG_FICTITIOUS or PG_MARKER", m));
2801 * Racily check for wirings. Races are handled once the object
2802 * lock is held and the page is unmapped.
2804 if (vm_page_wired(m))
2806 else if ((object = atomic_load_ptr(&m->object)) != NULL) {
2808 * The page is relocated if and only if it could be
2809 * laundered or reclaimed by the page daemon.
2811 VM_OBJECT_WLOCK(object);
2812 /* Don't care: PG_NODUMP, PG_ZERO. */
2813 if (m->object != object ||
2814 (object->type != OBJT_DEFAULT &&
2815 (object->flags & OBJ_SWAP) == 0 &&
2816 object->type != OBJT_VNODE))
2818 else if (object->memattr != VM_MEMATTR_DEFAULT)
2820 else if (vm_page_queue(m) != PQ_NONE &&
2821 vm_page_tryxbusy(m) != 0) {
2822 if (vm_page_wired(m)) {
2827 KASSERT(pmap_page_get_memattr(m) ==
2829 ("page %p has an unexpected memattr", m));
2830 KASSERT(m->oflags == 0,
2831 ("page %p has unexpected oflags", m));
2832 /* Don't care: PGA_NOSYNC. */
2833 if (!vm_page_none_valid(m)) {
2835 * First, try to allocate a new page
2836 * that is above "high". Failing
2837 * that, try to allocate a new page
2838 * that is below "m_run". Allocate
2839 * the new page between the end of
2840 * "m_run" and "high" only as a last
2844 if ((m->flags & PG_NODUMP) != 0)
2845 req |= VM_ALLOC_NODUMP;
2846 if (trunc_page(high) !=
2847 ~(vm_paddr_t)PAGE_MASK) {
2849 vm_page_alloc_noobj_contig(
2850 req, 1, round_page(high),
2851 ~(vm_paddr_t)0, PAGE_SIZE,
2852 0, VM_MEMATTR_DEFAULT);
2855 if (m_new == NULL) {
2856 pa = VM_PAGE_TO_PHYS(m_run);
2858 vm_page_alloc_noobj_contig(
2861 VM_MEMATTR_DEFAULT);
2863 if (m_new == NULL) {
2866 vm_page_alloc_noobj_contig(
2867 req, 1, pa, high, PAGE_SIZE,
2868 0, VM_MEMATTR_DEFAULT);
2870 if (m_new == NULL) {
2877 * Unmap the page and check for new
2878 * wirings that may have been acquired
2879 * through a pmap lookup.
2881 if (object->ref_count != 0 &&
2882 !vm_page_try_remove_all(m)) {
2884 vm_page_free(m_new);
2890 * Replace "m" with the new page. For
2891 * vm_page_replace(), "m" must be busy
2892 * and dequeued. Finally, change "m"
2893 * as if vm_page_free() was called.
2895 m_new->a.flags = m->a.flags &
2896 ~PGA_QUEUE_STATE_MASK;
2897 KASSERT(m_new->oflags == VPO_UNMANAGED,
2898 ("page %p is managed", m_new));
2900 pmap_copy_page(m, m_new);
2901 m_new->valid = m->valid;
2902 m_new->dirty = m->dirty;
2903 m->flags &= ~PG_ZERO;
2905 if (vm_page_replace_hold(m_new, object,
2907 vm_page_free_prep(m))
2908 SLIST_INSERT_HEAD(&free, m,
2912 * The new page must be deactivated
2913 * before the object is unlocked.
2915 vm_page_deactivate(m_new);
2917 m->flags &= ~PG_ZERO;
2919 if (vm_page_free_prep(m))
2920 SLIST_INSERT_HEAD(&free, m,
2922 KASSERT(m->dirty == 0,
2923 ("page %p is dirty", m));
2928 VM_OBJECT_WUNLOCK(object);
2930 MPASS(vm_page_domain(m) == domain);
2931 vmd = VM_DOMAIN(domain);
2932 vm_domain_free_lock(vmd);
2934 if (order < VM_NFREEORDER) {
2936 * The page is enqueued in the physical memory
2937 * allocator's free page queues. Moreover, it
2938 * is the first page in a power-of-two-sized
2939 * run of contiguous free pages. Jump ahead
2940 * to the last page within that run, and
2941 * continue from there.
2943 m += (1 << order) - 1;
2945 #if VM_NRESERVLEVEL > 0
2946 else if (vm_reserv_is_page_free(m))
2949 vm_domain_free_unlock(vmd);
2950 if (order == VM_NFREEORDER)
2954 if ((m = SLIST_FIRST(&free)) != NULL) {
2957 vmd = VM_DOMAIN(domain);
2959 vm_domain_free_lock(vmd);
2961 MPASS(vm_page_domain(m) == domain);
2962 SLIST_REMOVE_HEAD(&free, plinks.s.ss);
2963 vm_phys_free_pages(m, 0);
2965 } while ((m = SLIST_FIRST(&free)) != NULL);
2966 vm_domain_free_unlock(vmd);
2967 vm_domain_freecnt_inc(vmd, cnt);
2974 CTASSERT(powerof2(NRUNS));
2976 #define RUN_INDEX(count) ((count) & (NRUNS - 1))
2978 #define MIN_RECLAIM 8
2981 * vm_page_reclaim_contig:
2983 * Reclaim allocated, contiguous physical memory satisfying the specified
2984 * conditions by relocating the virtual pages using that physical memory.
2985 * Returns true if reclamation is successful and false otherwise. Since
2986 * relocation requires the allocation of physical pages, reclamation may
2987 * fail due to a shortage of free pages. When reclamation fails, callers
2988 * are expected to perform vm_wait() before retrying a failed allocation
2989 * operation, e.g., vm_page_alloc_contig().
2991 * The caller must always specify an allocation class through "req".
2993 * allocation classes:
2994 * VM_ALLOC_NORMAL normal process request
2995 * VM_ALLOC_SYSTEM system *really* needs a page
2996 * VM_ALLOC_INTERRUPT interrupt time request
2998 * The optional allocation flags are ignored.
3000 * "npages" must be greater than zero. Both "alignment" and "boundary"
3001 * must be a power of two.
3004 vm_page_reclaim_contig_domain(int domain, int req, u_long npages,
3005 vm_paddr_t low, vm_paddr_t high, u_long alignment, vm_paddr_t boundary)
3007 struct vm_domain *vmd;
3008 vm_paddr_t curr_low;
3009 vm_page_t m_run, m_runs[NRUNS];
3010 u_long count, minalign, reclaimed;
3011 int error, i, options, req_class;
3013 KASSERT(npages > 0, ("npages is 0"));
3014 KASSERT(powerof2(alignment), ("alignment is not a power of 2"));
3015 KASSERT(powerof2(boundary), ("boundary is not a power of 2"));
3018 * The caller will attempt an allocation after some runs have been
3019 * reclaimed and added to the vm_phys buddy lists. Due to limitations
3020 * of vm_phys_alloc_contig(), round up the requested length to the next
3021 * power of two or maximum chunk size, and ensure that each run is
3024 minalign = 1ul << imin(flsl(npages - 1), VM_NFREEORDER - 1);
3025 npages = roundup2(npages, minalign);
3026 if (alignment < ptoa(minalign))
3027 alignment = ptoa(minalign);
3030 * The page daemon is allowed to dig deeper into the free page list.
3032 req_class = req & VM_ALLOC_CLASS_MASK;
3033 if (curproc == pageproc && req_class != VM_ALLOC_INTERRUPT)
3034 req_class = VM_ALLOC_SYSTEM;
3037 * Return if the number of free pages cannot satisfy the requested
3040 vmd = VM_DOMAIN(domain);
3041 count = vmd->vmd_free_count;
3042 if (count < npages + vmd->vmd_free_reserved || (count < npages +
3043 vmd->vmd_interrupt_free_min && req_class == VM_ALLOC_SYSTEM) ||
3044 (count < npages && req_class == VM_ALLOC_INTERRUPT))
3048 * Scan up to three times, relaxing the restrictions ("options") on
3049 * the reclamation of reservations and superpages each time.
3051 for (options = VPSC_NORESERV;;) {
3053 * Find the highest runs that satisfy the given constraints
3054 * and restrictions, and record them in "m_runs".
3059 m_run = vm_phys_scan_contig(domain, npages, curr_low,
3060 high, alignment, boundary, options);
3063 curr_low = VM_PAGE_TO_PHYS(m_run) + ptoa(npages);
3064 m_runs[RUN_INDEX(count)] = m_run;
3069 * Reclaim the highest runs in LIFO (descending) order until
3070 * the number of reclaimed pages, "reclaimed", is at least
3071 * MIN_RECLAIM. Reset "reclaimed" each time because each
3072 * reclamation is idempotent, and runs will (likely) recur
3073 * from one scan to the next as restrictions are relaxed.
3076 for (i = 0; count > 0 && i < NRUNS; i++) {
3078 m_run = m_runs[RUN_INDEX(count)];
3079 error = vm_page_reclaim_run(req_class, domain, npages,
3082 reclaimed += npages;
3083 if (reclaimed >= MIN_RECLAIM)
3089 * Either relax the restrictions on the next scan or return if
3090 * the last scan had no restrictions.
3092 if (options == VPSC_NORESERV)
3093 options = VPSC_NOSUPER;
3094 else if (options == VPSC_NOSUPER)
3096 else if (options == VPSC_ANY)
3097 return (reclaimed != 0);
3102 vm_page_reclaim_contig(int req, u_long npages, vm_paddr_t low, vm_paddr_t high,
3103 u_long alignment, vm_paddr_t boundary)
3105 struct vm_domainset_iter di;
3109 vm_domainset_iter_page_init(&di, NULL, 0, &domain, &req);
3111 ret = vm_page_reclaim_contig_domain(domain, req, npages, low,
3112 high, alignment, boundary);
3115 } while (vm_domainset_iter_page(&di, NULL, &domain) == 0);
3121 * Set the domain in the appropriate page level domainset.
3124 vm_domain_set(struct vm_domain *vmd)
3127 mtx_lock(&vm_domainset_lock);
3128 if (!vmd->vmd_minset && vm_paging_min(vmd)) {
3129 vmd->vmd_minset = 1;
3130 DOMAINSET_SET(vmd->vmd_domain, &vm_min_domains);
3132 if (!vmd->vmd_severeset && vm_paging_severe(vmd)) {
3133 vmd->vmd_severeset = 1;
3134 DOMAINSET_SET(vmd->vmd_domain, &vm_severe_domains);
3136 mtx_unlock(&vm_domainset_lock);
3140 * Clear the domain from the appropriate page level domainset.
3143 vm_domain_clear(struct vm_domain *vmd)
3146 mtx_lock(&vm_domainset_lock);
3147 if (vmd->vmd_minset && !vm_paging_min(vmd)) {
3148 vmd->vmd_minset = 0;
3149 DOMAINSET_CLR(vmd->vmd_domain, &vm_min_domains);
3150 if (vm_min_waiters != 0) {
3152 wakeup(&vm_min_domains);
3155 if (vmd->vmd_severeset && !vm_paging_severe(vmd)) {
3156 vmd->vmd_severeset = 0;
3157 DOMAINSET_CLR(vmd->vmd_domain, &vm_severe_domains);
3158 if (vm_severe_waiters != 0) {
3159 vm_severe_waiters = 0;
3160 wakeup(&vm_severe_domains);
3165 * If pageout daemon needs pages, then tell it that there are
3168 if (vmd->vmd_pageout_pages_needed &&
3169 vmd->vmd_free_count >= vmd->vmd_pageout_free_min) {
3170 wakeup(&vmd->vmd_pageout_pages_needed);
3171 vmd->vmd_pageout_pages_needed = 0;
3174 /* See comments in vm_wait_doms(). */
3175 if (vm_pageproc_waiters) {
3176 vm_pageproc_waiters = 0;
3177 wakeup(&vm_pageproc_waiters);
3179 mtx_unlock(&vm_domainset_lock);
3183 * Wait for free pages to exceed the min threshold globally.
3189 mtx_lock(&vm_domainset_lock);
3190 while (vm_page_count_min()) {
3192 msleep(&vm_min_domains, &vm_domainset_lock, PVM, "vmwait", 0);
3194 mtx_unlock(&vm_domainset_lock);
3198 * Wait for free pages to exceed the severe threshold globally.
3201 vm_wait_severe(void)
3204 mtx_lock(&vm_domainset_lock);
3205 while (vm_page_count_severe()) {
3206 vm_severe_waiters++;
3207 msleep(&vm_severe_domains, &vm_domainset_lock, PVM,
3210 mtx_unlock(&vm_domainset_lock);
3217 return (vm_severe_waiters + vm_min_waiters + vm_pageproc_waiters);
3221 vm_wait_doms(const domainset_t *wdoms, int mflags)
3228 * We use racey wakeup synchronization to avoid expensive global
3229 * locking for the pageproc when sleeping with a non-specific vm_wait.
3230 * To handle this, we only sleep for one tick in this instance. It
3231 * is expected that most allocations for the pageproc will come from
3232 * kmem or vm_page_grab* which will use the more specific and
3233 * race-free vm_wait_domain().
3235 if (curproc == pageproc) {
3236 mtx_lock(&vm_domainset_lock);
3237 vm_pageproc_waiters++;
3238 error = msleep(&vm_pageproc_waiters, &vm_domainset_lock,
3239 PVM | PDROP | mflags, "pageprocwait", 1);
3242 * XXX Ideally we would wait only until the allocation could
3243 * be satisfied. This condition can cause new allocators to
3244 * consume all freed pages while old allocators wait.
3246 mtx_lock(&vm_domainset_lock);
3247 if (vm_page_count_min_set(wdoms)) {
3248 if (pageproc == NULL)
3249 panic("vm_wait in early boot");
3251 error = msleep(&vm_min_domains, &vm_domainset_lock,
3252 PVM | PDROP | mflags, "vmwait", 0);
3254 mtx_unlock(&vm_domainset_lock);
3262 * Sleep until free pages are available for allocation.
3263 * - Called in various places after failed memory allocations.
3266 vm_wait_domain(int domain)
3268 struct vm_domain *vmd;
3271 vmd = VM_DOMAIN(domain);
3272 vm_domain_free_assert_unlocked(vmd);
3274 if (curproc == pageproc) {
3275 mtx_lock(&vm_domainset_lock);
3276 if (vmd->vmd_free_count < vmd->vmd_pageout_free_min) {
3277 vmd->vmd_pageout_pages_needed = 1;
3278 msleep(&vmd->vmd_pageout_pages_needed,
3279 &vm_domainset_lock, PDROP | PSWP, "VMWait", 0);
3281 mtx_unlock(&vm_domainset_lock);
3283 DOMAINSET_ZERO(&wdom);
3284 DOMAINSET_SET(vmd->vmd_domain, &wdom);
3285 vm_wait_doms(&wdom, 0);
3290 vm_wait_flags(vm_object_t obj, int mflags)
3292 struct domainset *d;
3297 * Carefully fetch pointers only once: the struct domainset
3298 * itself is ummutable but the pointer might change.
3301 d = obj->domain.dr_policy;
3303 d = curthread->td_domain.dr_policy;
3305 return (vm_wait_doms(&d->ds_mask, mflags));
3311 * Sleep until free pages are available for allocation in the
3312 * affinity domains of the obj. If obj is NULL, the domain set
3313 * for the calling thread is used.
3314 * Called in various places after failed memory allocations.
3317 vm_wait(vm_object_t obj)
3319 (void)vm_wait_flags(obj, 0);
3323 vm_wait_intr(vm_object_t obj)
3325 return (vm_wait_flags(obj, PCATCH));
3329 * vm_domain_alloc_fail:
3331 * Called when a page allocation function fails. Informs the
3332 * pagedaemon and performs the requested wait. Requires the
3333 * domain_free and object lock on entry. Returns with the
3334 * object lock held and free lock released. Returns an error when
3335 * retry is necessary.
3339 vm_domain_alloc_fail(struct vm_domain *vmd, vm_object_t object, int req)
3342 vm_domain_free_assert_unlocked(vmd);
3344 atomic_add_int(&vmd->vmd_pageout_deficit,
3345 max((u_int)req >> VM_ALLOC_COUNT_SHIFT, 1));
3346 if (req & (VM_ALLOC_WAITOK | VM_ALLOC_WAITFAIL)) {
3348 VM_OBJECT_WUNLOCK(object);
3349 vm_wait_domain(vmd->vmd_domain);
3351 VM_OBJECT_WLOCK(object);
3352 if (req & VM_ALLOC_WAITOK)
3362 * Sleep until free pages are available for allocation.
3363 * - Called only in vm_fault so that processes page faulting
3364 * can be easily tracked.
3365 * - Sleeps at a lower priority than vm_wait() so that vm_wait()ing
3366 * processes will be able to grab memory first. Do not change
3367 * this balance without careful testing first.
3370 vm_waitpfault(struct domainset *dset, int timo)
3374 * XXX Ideally we would wait only until the allocation could
3375 * be satisfied. This condition can cause new allocators to
3376 * consume all freed pages while old allocators wait.
3378 mtx_lock(&vm_domainset_lock);
3379 if (vm_page_count_min_set(&dset->ds_mask)) {
3381 msleep(&vm_min_domains, &vm_domainset_lock, PUSER | PDROP,
3384 mtx_unlock(&vm_domainset_lock);
3387 static struct vm_pagequeue *
3388 _vm_page_pagequeue(vm_page_t m, uint8_t queue)
3391 return (&vm_pagequeue_domain(m)->vmd_pagequeues[queue]);
3395 static struct vm_pagequeue *
3396 vm_page_pagequeue(vm_page_t m)
3399 return (_vm_page_pagequeue(m, vm_page_astate_load(m).queue));
3403 static __always_inline bool
3404 vm_page_pqstate_fcmpset(vm_page_t m, vm_page_astate_t *old, vm_page_astate_t new)
3406 vm_page_astate_t tmp;
3410 if (__predict_true(vm_page_astate_fcmpset(m, old, new)))
3412 counter_u64_add(pqstate_commit_retries, 1);
3413 } while (old->_bits == tmp._bits);
3419 * Do the work of committing a queue state update that moves the page out of
3420 * its current queue.
3423 _vm_page_pqstate_commit_dequeue(struct vm_pagequeue *pq, vm_page_t m,
3424 vm_page_astate_t *old, vm_page_astate_t new)
3428 vm_pagequeue_assert_locked(pq);
3429 KASSERT(vm_page_pagequeue(m) == pq,
3430 ("%s: queue %p does not match page %p", __func__, pq, m));
3431 KASSERT(old->queue != PQ_NONE && new.queue != old->queue,
3432 ("%s: invalid queue indices %d %d",
3433 __func__, old->queue, new.queue));
3436 * Once the queue index of the page changes there is nothing
3437 * synchronizing with further updates to the page's physical
3438 * queue state. Therefore we must speculatively remove the page
3439 * from the queue now and be prepared to roll back if the queue
3440 * state update fails. If the page is not physically enqueued then
3441 * we just update its queue index.
3443 if ((old->flags & PGA_ENQUEUED) != 0) {
3444 new.flags &= ~PGA_ENQUEUED;
3445 next = TAILQ_NEXT(m, plinks.q);
3446 TAILQ_REMOVE(&pq->pq_pl, m, plinks.q);
3447 vm_pagequeue_cnt_dec(pq);
3448 if (!vm_page_pqstate_fcmpset(m, old, new)) {
3450 TAILQ_INSERT_TAIL(&pq->pq_pl, m, plinks.q);
3452 TAILQ_INSERT_BEFORE(next, m, plinks.q);
3453 vm_pagequeue_cnt_inc(pq);
3459 return (vm_page_pqstate_fcmpset(m, old, new));
3464 vm_page_pqstate_commit_dequeue(vm_page_t m, vm_page_astate_t *old,
3465 vm_page_astate_t new)
3467 struct vm_pagequeue *pq;
3468 vm_page_astate_t as;
3471 pq = _vm_page_pagequeue(m, old->queue);
3474 * The queue field and PGA_ENQUEUED flag are stable only so long as the
3475 * corresponding page queue lock is held.
3477 vm_pagequeue_lock(pq);
3478 as = vm_page_astate_load(m);
3479 if (__predict_false(as._bits != old->_bits)) {
3483 ret = _vm_page_pqstate_commit_dequeue(pq, m, old, new);
3485 vm_pagequeue_unlock(pq);
3490 * Commit a queue state update that enqueues or requeues a page.
3493 _vm_page_pqstate_commit_requeue(struct vm_pagequeue *pq, vm_page_t m,
3494 vm_page_astate_t *old, vm_page_astate_t new)
3496 struct vm_domain *vmd;
3498 vm_pagequeue_assert_locked(pq);
3499 KASSERT(old->queue != PQ_NONE && new.queue == old->queue,
3500 ("%s: invalid queue indices %d %d",
3501 __func__, old->queue, new.queue));
3503 new.flags |= PGA_ENQUEUED;
3504 if (!vm_page_pqstate_fcmpset(m, old, new))
3507 if ((old->flags & PGA_ENQUEUED) != 0)
3508 TAILQ_REMOVE(&pq->pq_pl, m, plinks.q);
3510 vm_pagequeue_cnt_inc(pq);
3513 * Give PGA_REQUEUE_HEAD precedence over PGA_REQUEUE. In particular, if
3514 * both flags are set in close succession, only PGA_REQUEUE_HEAD will be
3515 * applied, even if it was set first.
3517 if ((old->flags & PGA_REQUEUE_HEAD) != 0) {
3518 vmd = vm_pagequeue_domain(m);
3519 KASSERT(pq == &vmd->vmd_pagequeues[PQ_INACTIVE],
3520 ("%s: invalid page queue for page %p", __func__, m));
3521 TAILQ_INSERT_BEFORE(&vmd->vmd_inacthead, m, plinks.q);
3523 TAILQ_INSERT_TAIL(&pq->pq_pl, m, plinks.q);
3529 * Commit a queue state update that encodes a request for a deferred queue
3533 vm_page_pqstate_commit_request(vm_page_t m, vm_page_astate_t *old,
3534 vm_page_astate_t new)
3537 KASSERT(old->queue == new.queue || new.queue != PQ_NONE,
3538 ("%s: invalid state, queue %d flags %x",
3539 __func__, new.queue, new.flags));
3541 if (old->_bits != new._bits &&
3542 !vm_page_pqstate_fcmpset(m, old, new))
3544 vm_page_pqbatch_submit(m, new.queue);
3549 * A generic queue state update function. This handles more cases than the
3550 * specialized functions above.
3553 vm_page_pqstate_commit(vm_page_t m, vm_page_astate_t *old, vm_page_astate_t new)
3556 if (old->_bits == new._bits)
3559 if (old->queue != PQ_NONE && new.queue != old->queue) {
3560 if (!vm_page_pqstate_commit_dequeue(m, old, new))
3562 if (new.queue != PQ_NONE)
3563 vm_page_pqbatch_submit(m, new.queue);
3565 if (!vm_page_pqstate_fcmpset(m, old, new))
3567 if (new.queue != PQ_NONE &&
3568 ((new.flags & ~old->flags) & PGA_QUEUE_OP_MASK) != 0)
3569 vm_page_pqbatch_submit(m, new.queue);
3575 * Apply deferred queue state updates to a page.
3578 vm_pqbatch_process_page(struct vm_pagequeue *pq, vm_page_t m, uint8_t queue)
3580 vm_page_astate_t new, old;
3582 CRITICAL_ASSERT(curthread);
3583 vm_pagequeue_assert_locked(pq);
3584 KASSERT(queue < PQ_COUNT,
3585 ("%s: invalid queue index %d", __func__, queue));
3586 KASSERT(pq == _vm_page_pagequeue(m, queue),
3587 ("%s: page %p does not belong to queue %p", __func__, m, pq));
3589 for (old = vm_page_astate_load(m);;) {
3590 if (__predict_false(old.queue != queue ||
3591 (old.flags & PGA_QUEUE_OP_MASK) == 0)) {
3592 counter_u64_add(queue_nops, 1);
3595 KASSERT(old.queue != PQ_NONE ||
3596 (old.flags & PGA_QUEUE_STATE_MASK) == 0,
3597 ("%s: page %p has unexpected queue state", __func__, m));
3600 if ((old.flags & PGA_DEQUEUE) != 0) {
3601 new.flags &= ~PGA_QUEUE_OP_MASK;
3602 new.queue = PQ_NONE;
3603 if (__predict_true(_vm_page_pqstate_commit_dequeue(pq,
3605 counter_u64_add(queue_ops, 1);
3609 new.flags &= ~(PGA_REQUEUE | PGA_REQUEUE_HEAD);
3610 if (__predict_true(_vm_page_pqstate_commit_requeue(pq,
3612 counter_u64_add(queue_ops, 1);
3620 vm_pqbatch_process(struct vm_pagequeue *pq, struct vm_batchqueue *bq,
3625 for (i = 0; i < bq->bq_cnt; i++)
3626 vm_pqbatch_process_page(pq, bq->bq_pa[i], queue);
3627 vm_batchqueue_init(bq);
3631 * vm_page_pqbatch_submit: [ internal use only ]
3633 * Enqueue a page in the specified page queue's batched work queue.
3634 * The caller must have encoded the requested operation in the page
3635 * structure's a.flags field.
3638 vm_page_pqbatch_submit(vm_page_t m, uint8_t queue)
3640 struct vm_batchqueue *bq;
3641 struct vm_pagequeue *pq;
3644 KASSERT((m->oflags & VPO_UNMANAGED) == 0,
3645 ("page %p is unmanaged", m));
3646 KASSERT(queue < PQ_COUNT, ("invalid queue %d", queue));
3648 domain = vm_page_domain(m);
3650 bq = DPCPU_PTR(pqbatch[domain][queue]);
3651 if (vm_batchqueue_insert(bq, m)) {
3657 pq = &VM_DOMAIN(domain)->vmd_pagequeues[queue];
3658 vm_pagequeue_lock(pq);
3660 bq = DPCPU_PTR(pqbatch[domain][queue]);
3661 vm_pqbatch_process(pq, bq, queue);
3662 vm_pqbatch_process_page(pq, m, queue);
3663 vm_pagequeue_unlock(pq);
3668 * vm_page_pqbatch_drain: [ internal use only ]
3670 * Force all per-CPU page queue batch queues to be drained. This is
3671 * intended for use in severe memory shortages, to ensure that pages
3672 * do not remain stuck in the batch queues.
3675 vm_page_pqbatch_drain(void)
3678 struct vm_domain *vmd;
3679 struct vm_pagequeue *pq;
3680 int cpu, domain, queue;
3685 sched_bind(td, cpu);
3688 for (domain = 0; domain < vm_ndomains; domain++) {
3689 vmd = VM_DOMAIN(domain);
3690 for (queue = 0; queue < PQ_COUNT; queue++) {
3691 pq = &vmd->vmd_pagequeues[queue];
3692 vm_pagequeue_lock(pq);
3694 vm_pqbatch_process(pq,
3695 DPCPU_PTR(pqbatch[domain][queue]), queue);
3697 vm_pagequeue_unlock(pq);
3707 * vm_page_dequeue_deferred: [ internal use only ]
3709 * Request removal of the given page from its current page
3710 * queue. Physical removal from the queue may be deferred
3714 vm_page_dequeue_deferred(vm_page_t m)
3716 vm_page_astate_t new, old;
3718 old = vm_page_astate_load(m);
3720 if (old.queue == PQ_NONE) {
3721 KASSERT((old.flags & PGA_QUEUE_STATE_MASK) == 0,
3722 ("%s: page %p has unexpected queue state",
3727 new.flags |= PGA_DEQUEUE;
3728 } while (!vm_page_pqstate_commit_request(m, &old, new));
3734 * Remove the page from whichever page queue it's in, if any, before
3738 vm_page_dequeue(vm_page_t m)
3740 vm_page_astate_t new, old;
3742 old = vm_page_astate_load(m);
3744 if (old.queue == PQ_NONE) {
3745 KASSERT((old.flags & PGA_QUEUE_STATE_MASK) == 0,
3746 ("%s: page %p has unexpected queue state",
3751 new.flags &= ~PGA_QUEUE_OP_MASK;
3752 new.queue = PQ_NONE;
3753 } while (!vm_page_pqstate_commit_dequeue(m, &old, new));
3758 * Schedule the given page for insertion into the specified page queue.
3759 * Physical insertion of the page may be deferred indefinitely.
3762 vm_page_enqueue(vm_page_t m, uint8_t queue)
3765 KASSERT(m->a.queue == PQ_NONE &&
3766 (m->a.flags & PGA_QUEUE_STATE_MASK) == 0,
3767 ("%s: page %p is already enqueued", __func__, m));
3768 KASSERT(m->ref_count > 0,
3769 ("%s: page %p does not carry any references", __func__, m));
3772 if ((m->a.flags & PGA_REQUEUE) == 0)
3773 vm_page_aflag_set(m, PGA_REQUEUE);
3774 vm_page_pqbatch_submit(m, queue);
3778 * vm_page_free_prep:
3780 * Prepares the given page to be put on the free list,
3781 * disassociating it from any VM object. The caller may return
3782 * the page to the free list only if this function returns true.
3784 * The object, if it exists, must be locked, and then the page must
3785 * be xbusy. Otherwise the page must be not busied. A managed
3786 * page must be unmapped.
3789 vm_page_free_prep(vm_page_t m)
3793 * Synchronize with threads that have dropped a reference to this
3796 atomic_thread_fence_acq();
3798 #if defined(DIAGNOSTIC) && defined(PHYS_TO_DMAP)
3799 if (PMAP_HAS_DMAP && (m->flags & PG_ZERO) != 0) {
3802 p = (uint64_t *)PHYS_TO_DMAP(VM_PAGE_TO_PHYS(m));
3803 for (i = 0; i < PAGE_SIZE / sizeof(uint64_t); i++, p++)
3804 KASSERT(*p == 0, ("vm_page_free_prep %p PG_ZERO %d %jx",
3805 m, i, (uintmax_t)*p));
3808 if ((m->oflags & VPO_UNMANAGED) == 0) {
3809 KASSERT(!pmap_page_is_mapped(m),
3810 ("vm_page_free_prep: freeing mapped page %p", m));
3811 KASSERT((m->a.flags & (PGA_EXECUTABLE | PGA_WRITEABLE)) == 0,
3812 ("vm_page_free_prep: mapping flags set in page %p", m));
3814 KASSERT(m->a.queue == PQ_NONE,
3815 ("vm_page_free_prep: unmanaged page %p is queued", m));
3817 VM_CNT_INC(v_tfree);
3819 if (m->object != NULL) {
3820 KASSERT(((m->oflags & VPO_UNMANAGED) != 0) ==
3821 ((m->object->flags & OBJ_UNMANAGED) != 0),
3822 ("vm_page_free_prep: managed flag mismatch for page %p",
3824 vm_page_assert_xbusied(m);
3827 * The object reference can be released without an atomic
3830 KASSERT((m->flags & PG_FICTITIOUS) != 0 ||
3831 m->ref_count == VPRC_OBJREF,
3832 ("vm_page_free_prep: page %p has unexpected ref_count %u",
3834 vm_page_object_remove(m);
3835 m->ref_count -= VPRC_OBJREF;
3837 vm_page_assert_unbusied(m);
3839 vm_page_busy_free(m);
3842 * If fictitious remove object association and
3845 if ((m->flags & PG_FICTITIOUS) != 0) {
3846 KASSERT(m->ref_count == 1,
3847 ("fictitious page %p is referenced", m));
3848 KASSERT(m->a.queue == PQ_NONE,
3849 ("fictitious page %p is queued", m));
3854 * Pages need not be dequeued before they are returned to the physical
3855 * memory allocator, but they must at least be marked for a deferred
3858 if ((m->oflags & VPO_UNMANAGED) == 0)
3859 vm_page_dequeue_deferred(m);
3864 if (m->ref_count != 0)
3865 panic("vm_page_free_prep: page %p has references", m);
3868 * Restore the default memory attribute to the page.
3870 if (pmap_page_get_memattr(m) != VM_MEMATTR_DEFAULT)
3871 pmap_page_set_memattr(m, VM_MEMATTR_DEFAULT);
3873 #if VM_NRESERVLEVEL > 0
3875 * Determine whether the page belongs to a reservation. If the page was
3876 * allocated from a per-CPU cache, it cannot belong to a reservation, so
3877 * as an optimization, we avoid the check in that case.
3879 if ((m->flags & PG_PCPU_CACHE) == 0 && vm_reserv_free_page(m))
3889 * Returns the given page to the free list, disassociating it
3890 * from any VM object.
3892 * The object must be locked. The page must be exclusively busied if it
3893 * belongs to an object.
3896 vm_page_free_toq(vm_page_t m)
3898 struct vm_domain *vmd;
3901 if (!vm_page_free_prep(m))
3904 vmd = vm_pagequeue_domain(m);
3905 zone = vmd->vmd_pgcache[m->pool].zone;
3906 if ((m->flags & PG_PCPU_CACHE) != 0 && zone != NULL) {
3910 vm_domain_free_lock(vmd);
3911 vm_phys_free_pages(m, 0);
3912 vm_domain_free_unlock(vmd);
3913 vm_domain_freecnt_inc(vmd, 1);
3917 * vm_page_free_pages_toq:
3919 * Returns a list of pages to the free list, disassociating it
3920 * from any VM object. In other words, this is equivalent to
3921 * calling vm_page_free_toq() for each page of a list of VM objects.
3924 vm_page_free_pages_toq(struct spglist *free, bool update_wire_count)
3929 if (SLIST_EMPTY(free))
3933 while ((m = SLIST_FIRST(free)) != NULL) {
3935 SLIST_REMOVE_HEAD(free, plinks.s.ss);
3936 vm_page_free_toq(m);
3939 if (update_wire_count)
3944 * Mark this page as wired down. For managed pages, this prevents reclamation
3945 * by the page daemon, or when the containing object, if any, is destroyed.
3948 vm_page_wire(vm_page_t m)
3953 if (m->object != NULL && !vm_page_busied(m) &&
3954 !vm_object_busied(m->object))
3955 VM_OBJECT_ASSERT_LOCKED(m->object);
3957 KASSERT((m->flags & PG_FICTITIOUS) == 0 ||
3958 VPRC_WIRE_COUNT(m->ref_count) >= 1,
3959 ("vm_page_wire: fictitious page %p has zero wirings", m));
3961 old = atomic_fetchadd_int(&m->ref_count, 1);
3962 KASSERT(VPRC_WIRE_COUNT(old) != VPRC_WIRE_COUNT_MAX,
3963 ("vm_page_wire: counter overflow for page %p", m));
3964 if (VPRC_WIRE_COUNT(old) == 0) {
3965 if ((m->oflags & VPO_UNMANAGED) == 0)
3966 vm_page_aflag_set(m, PGA_DEQUEUE);
3972 * Attempt to wire a mapped page following a pmap lookup of that page.
3973 * This may fail if a thread is concurrently tearing down mappings of the page.
3974 * The transient failure is acceptable because it translates to the
3975 * failure of the caller pmap_extract_and_hold(), which should be then
3976 * followed by the vm_fault() fallback, see e.g. vm_fault_quick_hold_pages().
3979 vm_page_wire_mapped(vm_page_t m)
3986 ("vm_page_wire_mapped: wiring unreferenced page %p", m));
3987 if ((old & VPRC_BLOCKED) != 0)
3989 } while (!atomic_fcmpset_int(&m->ref_count, &old, old + 1));
3991 if (VPRC_WIRE_COUNT(old) == 0) {
3992 if ((m->oflags & VPO_UNMANAGED) == 0)
3993 vm_page_aflag_set(m, PGA_DEQUEUE);
4000 * Release a wiring reference to a managed page. If the page still belongs to
4001 * an object, update its position in the page queues to reflect the reference.
4002 * If the wiring was the last reference to the page, free the page.
4005 vm_page_unwire_managed(vm_page_t m, uint8_t nqueue, bool noreuse)
4009 KASSERT((m->oflags & VPO_UNMANAGED) == 0,
4010 ("%s: page %p is unmanaged", __func__, m));
4013 * Update LRU state before releasing the wiring reference.
4014 * Use a release store when updating the reference count to
4015 * synchronize with vm_page_free_prep().
4019 KASSERT(VPRC_WIRE_COUNT(old) > 0,
4020 ("vm_page_unwire: wire count underflow for page %p", m));
4022 if (old > VPRC_OBJREF + 1) {
4024 * The page has at least one other wiring reference. An
4025 * earlier iteration of this loop may have called
4026 * vm_page_release_toq() and cleared PGA_DEQUEUE, so
4027 * re-set it if necessary.
4029 if ((vm_page_astate_load(m).flags & PGA_DEQUEUE) == 0)
4030 vm_page_aflag_set(m, PGA_DEQUEUE);
4031 } else if (old == VPRC_OBJREF + 1) {
4033 * This is the last wiring. Clear PGA_DEQUEUE and
4034 * update the page's queue state to reflect the
4035 * reference. If the page does not belong to an object
4036 * (i.e., the VPRC_OBJREF bit is clear), we only need to
4037 * clear leftover queue state.
4039 vm_page_release_toq(m, nqueue, noreuse);
4040 } else if (old == 1) {
4041 vm_page_aflag_clear(m, PGA_DEQUEUE);
4043 } while (!atomic_fcmpset_rel_int(&m->ref_count, &old, old - 1));
4045 if (VPRC_WIRE_COUNT(old) == 1) {
4053 * Release one wiring of the specified page, potentially allowing it to be
4056 * Only managed pages belonging to an object can be paged out. If the number
4057 * of wirings transitions to zero and the page is eligible for page out, then
4058 * the page is added to the specified paging queue. If the released wiring
4059 * represented the last reference to the page, the page is freed.
4062 vm_page_unwire(vm_page_t m, uint8_t nqueue)
4065 KASSERT(nqueue < PQ_COUNT,
4066 ("vm_page_unwire: invalid queue %u request for page %p",
4069 if ((m->oflags & VPO_UNMANAGED) != 0) {
4070 if (vm_page_unwire_noq(m) && m->ref_count == 0)
4074 vm_page_unwire_managed(m, nqueue, false);
4078 * Unwire a page without (re-)inserting it into a page queue. It is up
4079 * to the caller to enqueue, requeue, or free the page as appropriate.
4080 * In most cases involving managed pages, vm_page_unwire() should be used
4084 vm_page_unwire_noq(vm_page_t m)
4088 old = vm_page_drop(m, 1);
4089 KASSERT(VPRC_WIRE_COUNT(old) != 0,
4090 ("vm_page_unref: counter underflow for page %p", m));
4091 KASSERT((m->flags & PG_FICTITIOUS) == 0 || VPRC_WIRE_COUNT(old) > 1,
4092 ("vm_page_unref: missing ref on fictitious page %p", m));
4094 if (VPRC_WIRE_COUNT(old) > 1)
4096 if ((m->oflags & VPO_UNMANAGED) == 0)
4097 vm_page_aflag_clear(m, PGA_DEQUEUE);
4103 * Ensure that the page ends up in the specified page queue. If the page is
4104 * active or being moved to the active queue, ensure that its act_count is
4105 * at least ACT_INIT but do not otherwise mess with it.
4107 static __always_inline void
4108 vm_page_mvqueue(vm_page_t m, const uint8_t nqueue, const uint16_t nflag)
4110 vm_page_astate_t old, new;
4112 KASSERT(m->ref_count > 0,
4113 ("%s: page %p does not carry any references", __func__, m));
4114 KASSERT(nflag == PGA_REQUEUE || nflag == PGA_REQUEUE_HEAD,
4115 ("%s: invalid flags %x", __func__, nflag));
4117 if ((m->oflags & VPO_UNMANAGED) != 0 || vm_page_wired(m))
4120 old = vm_page_astate_load(m);
4122 if ((old.flags & PGA_DEQUEUE) != 0)
4125 new.flags &= ~PGA_QUEUE_OP_MASK;
4126 if (nqueue == PQ_ACTIVE)
4127 new.act_count = max(old.act_count, ACT_INIT);
4128 if (old.queue == nqueue) {
4130 * There is no need to requeue pages already in the
4133 if (nqueue != PQ_ACTIVE ||
4134 (old.flags & PGA_ENQUEUED) == 0)
4140 } while (!vm_page_pqstate_commit(m, &old, new));
4144 * Put the specified page on the active list (if appropriate).
4147 vm_page_activate(vm_page_t m)
4150 vm_page_mvqueue(m, PQ_ACTIVE, PGA_REQUEUE);
4154 * Move the specified page to the tail of the inactive queue, or requeue
4155 * the page if it is already in the inactive queue.
4158 vm_page_deactivate(vm_page_t m)
4161 vm_page_mvqueue(m, PQ_INACTIVE, PGA_REQUEUE);
4165 vm_page_deactivate_noreuse(vm_page_t m)
4168 vm_page_mvqueue(m, PQ_INACTIVE, PGA_REQUEUE_HEAD);
4172 * Put a page in the laundry, or requeue it if it is already there.
4175 vm_page_launder(vm_page_t m)
4178 vm_page_mvqueue(m, PQ_LAUNDRY, PGA_REQUEUE);
4182 * Put a page in the PQ_UNSWAPPABLE holding queue.
4185 vm_page_unswappable(vm_page_t m)
4188 KASSERT(!vm_page_wired(m) && (m->oflags & VPO_UNMANAGED) == 0,
4189 ("page %p already unswappable", m));
4192 vm_page_enqueue(m, PQ_UNSWAPPABLE);
4196 * Release a page back to the page queues in preparation for unwiring.
4199 vm_page_release_toq(vm_page_t m, uint8_t nqueue, const bool noreuse)
4201 vm_page_astate_t old, new;
4205 * Use a check of the valid bits to determine whether we should
4206 * accelerate reclamation of the page. The object lock might not be
4207 * held here, in which case the check is racy. At worst we will either
4208 * accelerate reclamation of a valid page and violate LRU, or
4209 * unnecessarily defer reclamation of an invalid page.
4211 * If we were asked to not cache the page, place it near the head of the
4212 * inactive queue so that is reclaimed sooner.
4214 if (noreuse || vm_page_none_valid(m)) {
4215 nqueue = PQ_INACTIVE;
4216 nflag = PGA_REQUEUE_HEAD;
4218 nflag = PGA_REQUEUE;
4221 old = vm_page_astate_load(m);
4226 * If the page is already in the active queue and we are not
4227 * trying to accelerate reclamation, simply mark it as
4228 * referenced and avoid any queue operations.
4230 new.flags &= ~PGA_QUEUE_OP_MASK;
4231 if (nflag != PGA_REQUEUE_HEAD && old.queue == PQ_ACTIVE &&
4232 (old.flags & PGA_ENQUEUED) != 0)
4233 new.flags |= PGA_REFERENCED;
4238 } while (!vm_page_pqstate_commit(m, &old, new));
4242 * Unwire a page and either attempt to free it or re-add it to the page queues.
4245 vm_page_release(vm_page_t m, int flags)
4249 KASSERT((m->oflags & VPO_UNMANAGED) == 0,
4250 ("vm_page_release: page %p is unmanaged", m));
4252 if ((flags & VPR_TRYFREE) != 0) {
4254 object = atomic_load_ptr(&m->object);
4257 /* Depends on type-stability. */
4258 if (vm_page_busied(m) || !VM_OBJECT_TRYWLOCK(object))
4260 if (object == m->object) {
4261 vm_page_release_locked(m, flags);
4262 VM_OBJECT_WUNLOCK(object);
4265 VM_OBJECT_WUNLOCK(object);
4268 vm_page_unwire_managed(m, PQ_INACTIVE, flags != 0);
4271 /* See vm_page_release(). */
4273 vm_page_release_locked(vm_page_t m, int flags)
4276 VM_OBJECT_ASSERT_WLOCKED(m->object);
4277 KASSERT((m->oflags & VPO_UNMANAGED) == 0,
4278 ("vm_page_release_locked: page %p is unmanaged", m));
4280 if (vm_page_unwire_noq(m)) {
4281 if ((flags & VPR_TRYFREE) != 0 &&
4282 (m->object->ref_count == 0 || !pmap_page_is_mapped(m)) &&
4283 m->dirty == 0 && vm_page_tryxbusy(m)) {
4285 * An unlocked lookup may have wired the page before the
4286 * busy lock was acquired, in which case the page must
4289 if (__predict_true(!vm_page_wired(m))) {
4295 vm_page_release_toq(m, PQ_INACTIVE, flags != 0);
4301 vm_page_try_blocked_op(vm_page_t m, void (*op)(vm_page_t))
4305 KASSERT(m->object != NULL && (m->oflags & VPO_UNMANAGED) == 0,
4306 ("vm_page_try_blocked_op: page %p has no object", m));
4307 KASSERT(vm_page_busied(m),
4308 ("vm_page_try_blocked_op: page %p is not busy", m));
4309 VM_OBJECT_ASSERT_LOCKED(m->object);
4314 ("vm_page_try_blocked_op: page %p has no references", m));
4315 if (VPRC_WIRE_COUNT(old) != 0)
4317 } while (!atomic_fcmpset_int(&m->ref_count, &old, old | VPRC_BLOCKED));
4322 * If the object is read-locked, new wirings may be created via an
4325 old = vm_page_drop(m, VPRC_BLOCKED);
4326 KASSERT(!VM_OBJECT_WOWNED(m->object) ||
4327 old == (VPRC_BLOCKED | VPRC_OBJREF),
4328 ("vm_page_try_blocked_op: unexpected refcount value %u for %p",
4334 * Atomically check for wirings and remove all mappings of the page.
4337 vm_page_try_remove_all(vm_page_t m)
4340 return (vm_page_try_blocked_op(m, pmap_remove_all));
4344 * Atomically check for wirings and remove all writeable mappings of the page.
4347 vm_page_try_remove_write(vm_page_t m)
4350 return (vm_page_try_blocked_op(m, pmap_remove_write));
4356 * Apply the specified advice to the given page.
4359 vm_page_advise(vm_page_t m, int advice)
4362 VM_OBJECT_ASSERT_WLOCKED(m->object);
4363 vm_page_assert_xbusied(m);
4365 if (advice == MADV_FREE)
4367 * Mark the page clean. This will allow the page to be freed
4368 * without first paging it out. MADV_FREE pages are often
4369 * quickly reused by malloc(3), so we do not do anything that
4370 * would result in a page fault on a later access.
4373 else if (advice != MADV_DONTNEED) {
4374 if (advice == MADV_WILLNEED)
4375 vm_page_activate(m);
4379 if (advice != MADV_FREE && m->dirty == 0 && pmap_is_modified(m))
4383 * Clear any references to the page. Otherwise, the page daemon will
4384 * immediately reactivate the page.
4386 vm_page_aflag_clear(m, PGA_REFERENCED);
4389 * Place clean pages near the head of the inactive queue rather than
4390 * the tail, thus defeating the queue's LRU operation and ensuring that
4391 * the page will be reused quickly. Dirty pages not already in the
4392 * laundry are moved there.
4395 vm_page_deactivate_noreuse(m);
4396 else if (!vm_page_in_laundry(m))
4401 * vm_page_grab_release
4403 * Helper routine for grab functions to release busy on return.
4406 vm_page_grab_release(vm_page_t m, int allocflags)
4409 if ((allocflags & VM_ALLOC_NOBUSY) != 0) {
4410 if ((allocflags & VM_ALLOC_IGN_SBUSY) != 0)
4418 * vm_page_grab_sleep
4420 * Sleep for busy according to VM_ALLOC_ parameters. Returns true
4421 * if the caller should retry and false otherwise.
4423 * If the object is locked on entry the object will be unlocked with
4424 * false returns and still locked but possibly having been dropped
4425 * with true returns.
4428 vm_page_grab_sleep(vm_object_t object, vm_page_t m, vm_pindex_t pindex,
4429 const char *wmesg, int allocflags, bool locked)
4432 if ((allocflags & VM_ALLOC_NOWAIT) != 0)
4436 * Reference the page before unlocking and sleeping so that
4437 * the page daemon is less likely to reclaim it.
4439 if (locked && (allocflags & VM_ALLOC_NOCREAT) == 0)
4440 vm_page_reference(m);
4442 if (_vm_page_busy_sleep(object, m, pindex, wmesg, allocflags, locked) &&
4444 VM_OBJECT_WLOCK(object);
4445 if ((allocflags & VM_ALLOC_WAITFAIL) != 0)
4452 * Assert that the grab flags are valid.
4455 vm_page_grab_check(int allocflags)
4458 KASSERT((allocflags & VM_ALLOC_NOBUSY) == 0 ||
4459 (allocflags & VM_ALLOC_WIRED) != 0,
4460 ("vm_page_grab*: the pages must be busied or wired"));
4462 KASSERT((allocflags & VM_ALLOC_SBUSY) == 0 ||
4463 (allocflags & VM_ALLOC_IGN_SBUSY) != 0,
4464 ("vm_page_grab*: VM_ALLOC_SBUSY/VM_ALLOC_IGN_SBUSY mismatch"));
4468 * Calculate the page allocation flags for grab.
4471 vm_page_grab_pflags(int allocflags)
4475 pflags = allocflags &
4476 ~(VM_ALLOC_NOWAIT | VM_ALLOC_WAITOK | VM_ALLOC_WAITFAIL |
4478 if ((allocflags & VM_ALLOC_NOWAIT) == 0)
4479 pflags |= VM_ALLOC_WAITFAIL;
4480 if ((allocflags & VM_ALLOC_IGN_SBUSY) != 0)
4481 pflags |= VM_ALLOC_SBUSY;
4487 * Grab a page, waiting until we are waken up due to the page
4488 * changing state. We keep on waiting, if the page continues
4489 * to be in the object. If the page doesn't exist, first allocate it
4490 * and then conditionally zero it.
4492 * This routine may sleep.
4494 * The object must be locked on entry. The lock will, however, be released
4495 * and reacquired if the routine sleeps.
4498 vm_page_grab(vm_object_t object, vm_pindex_t pindex, int allocflags)
4502 VM_OBJECT_ASSERT_WLOCKED(object);
4503 vm_page_grab_check(allocflags);
4506 if ((m = vm_page_lookup(object, pindex)) != NULL) {
4507 if (!vm_page_tryacquire(m, allocflags)) {
4508 if (vm_page_grab_sleep(object, m, pindex, "pgrbwt",
4515 if ((allocflags & VM_ALLOC_NOCREAT) != 0)
4517 m = vm_page_alloc(object, pindex, vm_page_grab_pflags(allocflags));
4519 if ((allocflags & (VM_ALLOC_NOWAIT | VM_ALLOC_WAITFAIL)) != 0)
4523 if (allocflags & VM_ALLOC_ZERO && (m->flags & PG_ZERO) == 0)
4527 vm_page_grab_release(m, allocflags);
4533 * Locklessly attempt to acquire a page given a (object, pindex) tuple
4534 * and an optional previous page to avoid the radix lookup. The resulting
4535 * page will be validated against the identity tuple and busied or wired
4536 * as requested. A NULL *mp return guarantees that the page was not in
4537 * radix at the time of the call but callers must perform higher level
4538 * synchronization or retry the operation under a lock if they require
4539 * an atomic answer. This is the only lock free validation routine,
4540 * other routines can depend on the resulting page state.
4542 * The return value indicates whether the operation failed due to caller
4543 * flags. The return is tri-state with mp:
4545 * (true, *mp != NULL) - The operation was successful.
4546 * (true, *mp == NULL) - The page was not found in tree.
4547 * (false, *mp == NULL) - WAITFAIL or NOWAIT prevented acquisition.
4550 vm_page_acquire_unlocked(vm_object_t object, vm_pindex_t pindex,
4551 vm_page_t prev, vm_page_t *mp, int allocflags)
4555 vm_page_grab_check(allocflags);
4556 MPASS(prev == NULL || vm_page_busied(prev) || vm_page_wired(prev));
4561 * We may see a false NULL here because the previous page
4562 * has been removed or just inserted and the list is loaded
4563 * without barriers. Switch to radix to verify.
4565 if (prev == NULL || (m = TAILQ_NEXT(prev, listq)) == NULL ||
4566 QMD_IS_TRASHED(m) || m->pindex != pindex ||
4567 atomic_load_ptr(&m->object) != object) {
4570 * This guarantees the result is instantaneously
4573 m = vm_radix_lookup_unlocked(&object->rtree, pindex);
4577 if (vm_page_trybusy(m, allocflags)) {
4578 if (m->object == object && m->pindex == pindex)
4581 vm_page_busy_release(m);
4585 if (!vm_page_grab_sleep(object, m, pindex, "pgnslp",
4589 if ((allocflags & VM_ALLOC_WIRED) != 0)
4591 vm_page_grab_release(m, allocflags);
4597 * Try to locklessly grab a page and fall back to the object lock if NOCREAT
4601 vm_page_grab_unlocked(vm_object_t object, vm_pindex_t pindex, int allocflags)
4605 vm_page_grab_check(allocflags);
4607 if (!vm_page_acquire_unlocked(object, pindex, NULL, &m, allocflags))
4613 * The radix lockless lookup should never return a false negative
4614 * errors. If the user specifies NOCREAT they are guaranteed there
4615 * was no page present at the instant of the call. A NOCREAT caller
4616 * must handle create races gracefully.
4618 if ((allocflags & VM_ALLOC_NOCREAT) != 0)
4621 VM_OBJECT_WLOCK(object);
4622 m = vm_page_grab(object, pindex, allocflags);
4623 VM_OBJECT_WUNLOCK(object);
4629 * Grab a page and make it valid, paging in if necessary. Pages missing from
4630 * their pager are zero filled and validated. If a VM_ALLOC_COUNT is supplied
4631 * and the page is not valid as many as VM_INITIAL_PAGEIN pages can be brought
4632 * in simultaneously. Additional pages will be left on a paging queue but
4633 * will neither be wired nor busy regardless of allocflags.
4636 vm_page_grab_valid(vm_page_t *mp, vm_object_t object, vm_pindex_t pindex, int allocflags)
4639 vm_page_t ma[VM_INITIAL_PAGEIN];
4640 int after, i, pflags, rv;
4642 KASSERT((allocflags & VM_ALLOC_SBUSY) == 0 ||
4643 (allocflags & VM_ALLOC_IGN_SBUSY) != 0,
4644 ("vm_page_grab_valid: VM_ALLOC_SBUSY/VM_ALLOC_IGN_SBUSY mismatch"));
4645 KASSERT((allocflags &
4646 (VM_ALLOC_NOWAIT | VM_ALLOC_WAITFAIL | VM_ALLOC_ZERO)) == 0,
4647 ("vm_page_grab_valid: Invalid flags 0x%X", allocflags));
4648 VM_OBJECT_ASSERT_WLOCKED(object);
4649 pflags = allocflags & ~(VM_ALLOC_NOBUSY | VM_ALLOC_SBUSY |
4651 pflags |= VM_ALLOC_WAITFAIL;
4654 if ((m = vm_page_lookup(object, pindex)) != NULL) {
4656 * If the page is fully valid it can only become invalid
4657 * with the object lock held. If it is not valid it can
4658 * become valid with the busy lock held. Therefore, we
4659 * may unnecessarily lock the exclusive busy here if we
4660 * race with I/O completion not using the object lock.
4661 * However, we will not end up with an invalid page and a
4664 if (!vm_page_trybusy(m,
4665 vm_page_all_valid(m) ? allocflags : 0)) {
4666 (void)vm_page_grab_sleep(object, m, pindex, "pgrbwt",
4670 if (vm_page_all_valid(m))
4672 if ((allocflags & VM_ALLOC_NOCREAT) != 0) {
4673 vm_page_busy_release(m);
4675 return (VM_PAGER_FAIL);
4677 } else if ((allocflags & VM_ALLOC_NOCREAT) != 0) {
4679 return (VM_PAGER_FAIL);
4680 } else if ((m = vm_page_alloc(object, pindex, pflags)) == NULL) {
4681 if (!vm_pager_can_alloc_page(object, pindex)) {
4683 return (VM_PAGER_AGAIN);
4688 vm_page_assert_xbusied(m);
4689 if (vm_pager_has_page(object, pindex, NULL, &after)) {
4690 after = MIN(after, VM_INITIAL_PAGEIN);
4691 after = MIN(after, allocflags >> VM_ALLOC_COUNT_SHIFT);
4692 after = MAX(after, 1);
4694 for (i = 1; i < after; i++) {
4695 if ((ma[i] = vm_page_next(ma[i - 1])) != NULL) {
4696 if (vm_page_any_valid(ma[i]) ||
4697 !vm_page_tryxbusy(ma[i]))
4700 ma[i] = vm_page_alloc(object, m->pindex + i,
4707 vm_object_pip_add(object, after);
4708 VM_OBJECT_WUNLOCK(object);
4709 rv = vm_pager_get_pages(object, ma, after, NULL, NULL);
4710 VM_OBJECT_WLOCK(object);
4711 vm_object_pip_wakeupn(object, after);
4712 /* Pager may have replaced a page. */
4714 if (rv != VM_PAGER_OK) {
4715 for (i = 0; i < after; i++) {
4716 if (!vm_page_wired(ma[i]))
4717 vm_page_free(ma[i]);
4719 vm_page_xunbusy(ma[i]);
4724 for (i = 1; i < after; i++)
4725 vm_page_readahead_finish(ma[i]);
4726 MPASS(vm_page_all_valid(m));
4728 vm_page_zero_invalid(m, TRUE);
4731 if ((allocflags & VM_ALLOC_WIRED) != 0)
4733 if ((allocflags & VM_ALLOC_SBUSY) != 0 && vm_page_xbusied(m))
4734 vm_page_busy_downgrade(m);
4735 else if ((allocflags & VM_ALLOC_NOBUSY) != 0)
4736 vm_page_busy_release(m);
4738 return (VM_PAGER_OK);
4742 * Locklessly grab a valid page. If the page is not valid or not yet
4743 * allocated this will fall back to the object lock method.
4746 vm_page_grab_valid_unlocked(vm_page_t *mp, vm_object_t object,
4747 vm_pindex_t pindex, int allocflags)
4753 KASSERT((allocflags & VM_ALLOC_SBUSY) == 0 ||
4754 (allocflags & VM_ALLOC_IGN_SBUSY) != 0,
4755 ("vm_page_grab_valid_unlocked: VM_ALLOC_SBUSY/VM_ALLOC_IGN_SBUSY "
4757 KASSERT((allocflags &
4758 (VM_ALLOC_NOWAIT | VM_ALLOC_WAITFAIL | VM_ALLOC_ZERO)) == 0,
4759 ("vm_page_grab_valid_unlocked: Invalid flags 0x%X", allocflags));
4762 * Attempt a lockless lookup and busy. We need at least an sbusy
4763 * before we can inspect the valid field and return a wired page.
4765 flags = allocflags & ~(VM_ALLOC_NOBUSY | VM_ALLOC_WIRED);
4766 if (!vm_page_acquire_unlocked(object, pindex, NULL, mp, flags))
4767 return (VM_PAGER_FAIL);
4768 if ((m = *mp) != NULL) {
4769 if (vm_page_all_valid(m)) {
4770 if ((allocflags & VM_ALLOC_WIRED) != 0)
4772 vm_page_grab_release(m, allocflags);
4773 return (VM_PAGER_OK);
4775 vm_page_busy_release(m);
4777 if ((allocflags & VM_ALLOC_NOCREAT) != 0) {
4779 return (VM_PAGER_FAIL);
4781 VM_OBJECT_WLOCK(object);
4782 error = vm_page_grab_valid(mp, object, pindex, allocflags);
4783 VM_OBJECT_WUNLOCK(object);
4789 * Return the specified range of pages from the given object. For each
4790 * page offset within the range, if a page already exists within the object
4791 * at that offset and it is busy, then wait for it to change state. If,
4792 * instead, the page doesn't exist, then allocate it.
4794 * The caller must always specify an allocation class.
4796 * allocation classes:
4797 * VM_ALLOC_NORMAL normal process request
4798 * VM_ALLOC_SYSTEM system *really* needs the pages
4800 * The caller must always specify that the pages are to be busied and/or
4803 * optional allocation flags:
4804 * VM_ALLOC_IGN_SBUSY do not sleep on soft busy pages
4805 * VM_ALLOC_NOBUSY do not exclusive busy the page
4806 * VM_ALLOC_NOWAIT do not sleep
4807 * VM_ALLOC_SBUSY set page to sbusy state
4808 * VM_ALLOC_WIRED wire the pages
4809 * VM_ALLOC_ZERO zero and validate any invalid pages
4811 * If VM_ALLOC_NOWAIT is not specified, this routine may sleep. Otherwise, it
4812 * may return a partial prefix of the requested range.
4815 vm_page_grab_pages(vm_object_t object, vm_pindex_t pindex, int allocflags,
4816 vm_page_t *ma, int count)
4822 VM_OBJECT_ASSERT_WLOCKED(object);
4823 KASSERT(((u_int)allocflags >> VM_ALLOC_COUNT_SHIFT) == 0,
4824 ("vm_page_grap_pages: VM_ALLOC_COUNT() is not allowed"));
4826 ("vm_page_grab_pages: invalid page count %d", count));
4827 vm_page_grab_check(allocflags);
4829 pflags = vm_page_grab_pflags(allocflags);
4832 m = vm_radix_lookup_le(&object->rtree, pindex + i);
4833 if (m == NULL || m->pindex != pindex + i) {
4837 mpred = TAILQ_PREV(m, pglist, listq);
4838 for (; i < count; i++) {
4840 if (!vm_page_tryacquire(m, allocflags)) {
4841 if (vm_page_grab_sleep(object, m, pindex + i,
4842 "grbmaw", allocflags, true))
4847 if ((allocflags & VM_ALLOC_NOCREAT) != 0)
4849 m = vm_page_alloc_after(object, pindex + i,
4850 pflags | VM_ALLOC_COUNT(count - i), mpred);
4852 if ((allocflags & (VM_ALLOC_NOWAIT |
4853 VM_ALLOC_WAITFAIL)) != 0)
4858 if (vm_page_none_valid(m) &&
4859 (allocflags & VM_ALLOC_ZERO) != 0) {
4860 if ((m->flags & PG_ZERO) == 0)
4864 vm_page_grab_release(m, allocflags);
4866 m = vm_page_next(m);
4872 * Unlocked variant of vm_page_grab_pages(). This accepts the same flags
4873 * and will fall back to the locked variant to handle allocation.
4876 vm_page_grab_pages_unlocked(vm_object_t object, vm_pindex_t pindex,
4877 int allocflags, vm_page_t *ma, int count)
4884 ("vm_page_grab_pages_unlocked: invalid page count %d", count));
4885 vm_page_grab_check(allocflags);
4888 * Modify flags for lockless acquire to hold the page until we
4889 * set it valid if necessary.
4891 flags = allocflags & ~VM_ALLOC_NOBUSY;
4893 for (i = 0; i < count; i++, pindex++) {
4894 if (!vm_page_acquire_unlocked(object, pindex, pred, &m, flags))
4898 if ((flags & VM_ALLOC_ZERO) != 0 && vm_page_none_valid(m)) {
4899 if ((m->flags & PG_ZERO) == 0)
4903 /* m will still be wired or busy according to flags. */
4904 vm_page_grab_release(m, allocflags);
4907 if (i == count || (allocflags & VM_ALLOC_NOCREAT) != 0)
4910 VM_OBJECT_WLOCK(object);
4911 i += vm_page_grab_pages(object, pindex, allocflags, &ma[i], count);
4912 VM_OBJECT_WUNLOCK(object);
4918 * Mapping function for valid or dirty bits in a page.
4920 * Inputs are required to range within a page.
4923 vm_page_bits(int base, int size)
4929 base + size <= PAGE_SIZE,
4930 ("vm_page_bits: illegal base/size %d/%d", base, size)
4933 if (size == 0) /* handle degenerate case */
4936 first_bit = base >> DEV_BSHIFT;
4937 last_bit = (base + size - 1) >> DEV_BSHIFT;
4939 return (((vm_page_bits_t)2 << last_bit) -
4940 ((vm_page_bits_t)1 << first_bit));
4944 vm_page_bits_set(vm_page_t m, vm_page_bits_t *bits, vm_page_bits_t set)
4947 #if PAGE_SIZE == 32768
4948 atomic_set_64((uint64_t *)bits, set);
4949 #elif PAGE_SIZE == 16384
4950 atomic_set_32((uint32_t *)bits, set);
4951 #elif (PAGE_SIZE == 8192) && defined(atomic_set_16)
4952 atomic_set_16((uint16_t *)bits, set);
4953 #elif (PAGE_SIZE == 4096) && defined(atomic_set_8)
4954 atomic_set_8((uint8_t *)bits, set);
4955 #else /* PAGE_SIZE <= 8192 */
4959 addr = (uintptr_t)bits;
4961 * Use a trick to perform a 32-bit atomic on the
4962 * containing aligned word, to not depend on the existence
4963 * of atomic_{set, clear}_{8, 16}.
4965 shift = addr & (sizeof(uint32_t) - 1);
4966 #if BYTE_ORDER == BIG_ENDIAN
4967 shift = (sizeof(uint32_t) - sizeof(vm_page_bits_t) - shift) * NBBY;
4971 addr &= ~(sizeof(uint32_t) - 1);
4972 atomic_set_32((uint32_t *)addr, set << shift);
4973 #endif /* PAGE_SIZE */
4977 vm_page_bits_clear(vm_page_t m, vm_page_bits_t *bits, vm_page_bits_t clear)
4980 #if PAGE_SIZE == 32768
4981 atomic_clear_64((uint64_t *)bits, clear);
4982 #elif PAGE_SIZE == 16384
4983 atomic_clear_32((uint32_t *)bits, clear);
4984 #elif (PAGE_SIZE == 8192) && defined(atomic_clear_16)
4985 atomic_clear_16((uint16_t *)bits, clear);
4986 #elif (PAGE_SIZE == 4096) && defined(atomic_clear_8)
4987 atomic_clear_8((uint8_t *)bits, clear);
4988 #else /* PAGE_SIZE <= 8192 */
4992 addr = (uintptr_t)bits;
4994 * Use a trick to perform a 32-bit atomic on the
4995 * containing aligned word, to not depend on the existence
4996 * of atomic_{set, clear}_{8, 16}.
4998 shift = addr & (sizeof(uint32_t) - 1);
4999 #if BYTE_ORDER == BIG_ENDIAN
5000 shift = (sizeof(uint32_t) - sizeof(vm_page_bits_t) - shift) * NBBY;
5004 addr &= ~(sizeof(uint32_t) - 1);
5005 atomic_clear_32((uint32_t *)addr, clear << shift);
5006 #endif /* PAGE_SIZE */
5009 static inline vm_page_bits_t
5010 vm_page_bits_swap(vm_page_t m, vm_page_bits_t *bits, vm_page_bits_t newbits)
5012 #if PAGE_SIZE == 32768
5016 while (atomic_fcmpset_64(bits, &old, newbits) == 0);
5018 #elif PAGE_SIZE == 16384
5022 while (atomic_fcmpset_32(bits, &old, newbits) == 0);
5024 #elif (PAGE_SIZE == 8192) && defined(atomic_fcmpset_16)
5028 while (atomic_fcmpset_16(bits, &old, newbits) == 0);
5030 #elif (PAGE_SIZE == 4096) && defined(atomic_fcmpset_8)
5034 while (atomic_fcmpset_8(bits, &old, newbits) == 0);
5036 #else /* PAGE_SIZE <= 4096*/
5038 uint32_t old, new, mask;
5041 addr = (uintptr_t)bits;
5043 * Use a trick to perform a 32-bit atomic on the
5044 * containing aligned word, to not depend on the existence
5045 * of atomic_{set, swap, clear}_{8, 16}.
5047 shift = addr & (sizeof(uint32_t) - 1);
5048 #if BYTE_ORDER == BIG_ENDIAN
5049 shift = (sizeof(uint32_t) - sizeof(vm_page_bits_t) - shift) * NBBY;
5053 addr &= ~(sizeof(uint32_t) - 1);
5054 mask = VM_PAGE_BITS_ALL << shift;
5059 new |= newbits << shift;
5060 } while (atomic_fcmpset_32((uint32_t *)addr, &old, new) == 0);
5061 return (old >> shift);
5062 #endif /* PAGE_SIZE */
5066 * vm_page_set_valid_range:
5068 * Sets portions of a page valid. The arguments are expected
5069 * to be DEV_BSIZE aligned but if they aren't the bitmap is inclusive
5070 * of any partial chunks touched by the range. The invalid portion of
5071 * such chunks will be zeroed.
5073 * (base + size) must be less then or equal to PAGE_SIZE.
5076 vm_page_set_valid_range(vm_page_t m, int base, int size)
5079 vm_page_bits_t pagebits;
5081 vm_page_assert_busied(m);
5082 if (size == 0) /* handle degenerate case */
5086 * If the base is not DEV_BSIZE aligned and the valid
5087 * bit is clear, we have to zero out a portion of the
5090 if ((frag = rounddown2(base, DEV_BSIZE)) != base &&
5091 (m->valid & (1 << (base >> DEV_BSHIFT))) == 0)
5092 pmap_zero_page_area(m, frag, base - frag);
5095 * If the ending offset is not DEV_BSIZE aligned and the
5096 * valid bit is clear, we have to zero out a portion of
5099 endoff = base + size;
5100 if ((frag = rounddown2(endoff, DEV_BSIZE)) != endoff &&
5101 (m->valid & (1 << (endoff >> DEV_BSHIFT))) == 0)
5102 pmap_zero_page_area(m, endoff,
5103 DEV_BSIZE - (endoff & (DEV_BSIZE - 1)));
5106 * Assert that no previously invalid block that is now being validated
5109 KASSERT((~m->valid & vm_page_bits(base, size) & m->dirty) == 0,
5110 ("vm_page_set_valid_range: page %p is dirty", m));
5113 * Set valid bits inclusive of any overlap.
5115 pagebits = vm_page_bits(base, size);
5116 if (vm_page_xbusied(m))
5117 m->valid |= pagebits;
5119 vm_page_bits_set(m, &m->valid, pagebits);
5123 * Set the page dirty bits and free the invalid swap space if
5124 * present. Returns the previous dirty bits.
5127 vm_page_set_dirty(vm_page_t m)
5131 VM_PAGE_OBJECT_BUSY_ASSERT(m);
5133 if (vm_page_xbusied(m) && !pmap_page_is_write_mapped(m)) {
5135 m->dirty = VM_PAGE_BITS_ALL;
5137 old = vm_page_bits_swap(m, &m->dirty, VM_PAGE_BITS_ALL);
5138 if (old == 0 && (m->a.flags & PGA_SWAP_SPACE) != 0)
5139 vm_pager_page_unswapped(m);
5145 * Clear the given bits from the specified page's dirty field.
5147 static __inline void
5148 vm_page_clear_dirty_mask(vm_page_t m, vm_page_bits_t pagebits)
5151 vm_page_assert_busied(m);
5154 * If the page is xbusied and not write mapped we are the
5155 * only thread that can modify dirty bits. Otherwise, The pmap
5156 * layer can call vm_page_dirty() without holding a distinguished
5157 * lock. The combination of page busy and atomic operations
5158 * suffice to guarantee consistency of the page dirty field.
5160 if (vm_page_xbusied(m) && !pmap_page_is_write_mapped(m))
5161 m->dirty &= ~pagebits;
5163 vm_page_bits_clear(m, &m->dirty, pagebits);
5167 * vm_page_set_validclean:
5169 * Sets portions of a page valid and clean. The arguments are expected
5170 * to be DEV_BSIZE aligned but if they aren't the bitmap is inclusive
5171 * of any partial chunks touched by the range. The invalid portion of
5172 * such chunks will be zero'd.
5174 * (base + size) must be less then or equal to PAGE_SIZE.
5177 vm_page_set_validclean(vm_page_t m, int base, int size)
5179 vm_page_bits_t oldvalid, pagebits;
5182 vm_page_assert_busied(m);
5183 if (size == 0) /* handle degenerate case */
5187 * If the base is not DEV_BSIZE aligned and the valid
5188 * bit is clear, we have to zero out a portion of the
5191 if ((frag = rounddown2(base, DEV_BSIZE)) != base &&
5192 (m->valid & ((vm_page_bits_t)1 << (base >> DEV_BSHIFT))) == 0)
5193 pmap_zero_page_area(m, frag, base - frag);
5196 * If the ending offset is not DEV_BSIZE aligned and the
5197 * valid bit is clear, we have to zero out a portion of
5200 endoff = base + size;
5201 if ((frag = rounddown2(endoff, DEV_BSIZE)) != endoff &&
5202 (m->valid & ((vm_page_bits_t)1 << (endoff >> DEV_BSHIFT))) == 0)
5203 pmap_zero_page_area(m, endoff,
5204 DEV_BSIZE - (endoff & (DEV_BSIZE - 1)));
5207 * Set valid, clear dirty bits. If validating the entire
5208 * page we can safely clear the pmap modify bit. We also
5209 * use this opportunity to clear the PGA_NOSYNC flag. If a process
5210 * takes a write fault on a MAP_NOSYNC memory area the flag will
5213 * We set valid bits inclusive of any overlap, but we can only
5214 * clear dirty bits for DEV_BSIZE chunks that are fully within
5217 oldvalid = m->valid;
5218 pagebits = vm_page_bits(base, size);
5219 if (vm_page_xbusied(m))
5220 m->valid |= pagebits;
5222 vm_page_bits_set(m, &m->valid, pagebits);
5224 if ((frag = base & (DEV_BSIZE - 1)) != 0) {
5225 frag = DEV_BSIZE - frag;
5231 pagebits = vm_page_bits(base, size & (DEV_BSIZE - 1));
5233 if (base == 0 && size == PAGE_SIZE) {
5235 * The page can only be modified within the pmap if it is
5236 * mapped, and it can only be mapped if it was previously
5239 if (oldvalid == VM_PAGE_BITS_ALL)
5241 * Perform the pmap_clear_modify() first. Otherwise,
5242 * a concurrent pmap operation, such as
5243 * pmap_protect(), could clear a modification in the
5244 * pmap and set the dirty field on the page before
5245 * pmap_clear_modify() had begun and after the dirty
5246 * field was cleared here.
5248 pmap_clear_modify(m);
5250 vm_page_aflag_clear(m, PGA_NOSYNC);
5251 } else if (oldvalid != VM_PAGE_BITS_ALL && vm_page_xbusied(m))
5252 m->dirty &= ~pagebits;
5254 vm_page_clear_dirty_mask(m, pagebits);
5258 vm_page_clear_dirty(vm_page_t m, int base, int size)
5261 vm_page_clear_dirty_mask(m, vm_page_bits(base, size));
5265 * vm_page_set_invalid:
5267 * Invalidates DEV_BSIZE'd chunks within a page. Both the
5268 * valid and dirty bits for the effected areas are cleared.
5271 vm_page_set_invalid(vm_page_t m, int base, int size)
5273 vm_page_bits_t bits;
5277 * The object lock is required so that pages can't be mapped
5278 * read-only while we're in the process of invalidating them.
5281 VM_OBJECT_ASSERT_WLOCKED(object);
5282 vm_page_assert_busied(m);
5284 if (object->type == OBJT_VNODE && base == 0 && IDX_TO_OFF(m->pindex) +
5285 size >= object->un_pager.vnp.vnp_size)
5286 bits = VM_PAGE_BITS_ALL;
5288 bits = vm_page_bits(base, size);
5289 if (object->ref_count != 0 && vm_page_all_valid(m) && bits != 0)
5291 KASSERT((bits == 0 && vm_page_all_valid(m)) ||
5292 !pmap_page_is_mapped(m),
5293 ("vm_page_set_invalid: page %p is mapped", m));
5294 if (vm_page_xbusied(m)) {
5298 vm_page_bits_clear(m, &m->valid, bits);
5299 vm_page_bits_clear(m, &m->dirty, bits);
5306 * Invalidates the entire page. The page must be busy, unmapped, and
5307 * the enclosing object must be locked. The object locks protects
5308 * against concurrent read-only pmap enter which is done without
5312 vm_page_invalid(vm_page_t m)
5315 vm_page_assert_busied(m);
5316 VM_OBJECT_ASSERT_WLOCKED(m->object);
5317 MPASS(!pmap_page_is_mapped(m));
5319 if (vm_page_xbusied(m))
5322 vm_page_bits_clear(m, &m->valid, VM_PAGE_BITS_ALL);
5326 * vm_page_zero_invalid()
5328 * The kernel assumes that the invalid portions of a page contain
5329 * garbage, but such pages can be mapped into memory by user code.
5330 * When this occurs, we must zero out the non-valid portions of the
5331 * page so user code sees what it expects.
5333 * Pages are most often semi-valid when the end of a file is mapped
5334 * into memory and the file's size is not page aligned.
5337 vm_page_zero_invalid(vm_page_t m, boolean_t setvalid)
5343 * Scan the valid bits looking for invalid sections that
5344 * must be zeroed. Invalid sub-DEV_BSIZE'd areas ( where the
5345 * valid bit may be set ) have already been zeroed by
5346 * vm_page_set_validclean().
5348 for (b = i = 0; i <= PAGE_SIZE / DEV_BSIZE; ++i) {
5349 if (i == (PAGE_SIZE / DEV_BSIZE) ||
5350 (m->valid & ((vm_page_bits_t)1 << i))) {
5352 pmap_zero_page_area(m,
5353 b << DEV_BSHIFT, (i - b) << DEV_BSHIFT);
5360 * setvalid is TRUE when we can safely set the zero'd areas
5361 * as being valid. We can do this if there are no cache consistency
5362 * issues. e.g. it is ok to do with UFS, but not ok to do with NFS.
5371 * Is (partial) page valid? Note that the case where size == 0
5372 * will return FALSE in the degenerate case where the page is
5373 * entirely invalid, and TRUE otherwise.
5375 * Some callers envoke this routine without the busy lock held and
5376 * handle races via higher level locks. Typical callers should
5377 * hold a busy lock to prevent invalidation.
5380 vm_page_is_valid(vm_page_t m, int base, int size)
5382 vm_page_bits_t bits;
5384 bits = vm_page_bits(base, size);
5385 return (vm_page_any_valid(m) && (m->valid & bits) == bits);
5389 * Returns true if all of the specified predicates are true for the entire
5390 * (super)page and false otherwise.
5393 vm_page_ps_test(vm_page_t m, int flags, vm_page_t skip_m)
5399 if (skip_m != NULL && skip_m->object != object)
5401 VM_OBJECT_ASSERT_LOCKED(object);
5402 npages = atop(pagesizes[m->psind]);
5405 * The physically contiguous pages that make up a superpage, i.e., a
5406 * page with a page size index ("psind") greater than zero, will
5407 * occupy adjacent entries in vm_page_array[].
5409 for (i = 0; i < npages; i++) {
5410 /* Always test object consistency, including "skip_m". */
5411 if (m[i].object != object)
5413 if (&m[i] == skip_m)
5415 if ((flags & PS_NONE_BUSY) != 0 && vm_page_busied(&m[i]))
5417 if ((flags & PS_ALL_DIRTY) != 0) {
5419 * Calling vm_page_test_dirty() or pmap_is_modified()
5420 * might stop this case from spuriously returning
5421 * "false". However, that would require a write lock
5422 * on the object containing "m[i]".
5424 if (m[i].dirty != VM_PAGE_BITS_ALL)
5427 if ((flags & PS_ALL_VALID) != 0 &&
5428 m[i].valid != VM_PAGE_BITS_ALL)
5435 * Set the page's dirty bits if the page is modified.
5438 vm_page_test_dirty(vm_page_t m)
5441 vm_page_assert_busied(m);
5442 if (m->dirty != VM_PAGE_BITS_ALL && pmap_is_modified(m))
5447 vm_page_valid(vm_page_t m)
5450 vm_page_assert_busied(m);
5451 if (vm_page_xbusied(m))
5452 m->valid = VM_PAGE_BITS_ALL;
5454 vm_page_bits_set(m, &m->valid, VM_PAGE_BITS_ALL);
5458 vm_page_lock_KBI(vm_page_t m, const char *file, int line)
5461 mtx_lock_flags_(vm_page_lockptr(m), 0, file, line);
5465 vm_page_unlock_KBI(vm_page_t m, const char *file, int line)
5468 mtx_unlock_flags_(vm_page_lockptr(m), 0, file, line);
5472 vm_page_trylock_KBI(vm_page_t m, const char *file, int line)
5475 return (mtx_trylock_flags_(vm_page_lockptr(m), 0, file, line));
5478 #if defined(INVARIANTS) || defined(INVARIANT_SUPPORT)
5480 vm_page_assert_locked_KBI(vm_page_t m, const char *file, int line)
5483 vm_page_lock_assert_KBI(m, MA_OWNED, file, line);
5487 vm_page_lock_assert_KBI(vm_page_t m, int a, const char *file, int line)
5490 mtx_assert_(vm_page_lockptr(m), a, file, line);
5496 vm_page_object_busy_assert(vm_page_t m)
5500 * Certain of the page's fields may only be modified by the
5501 * holder of a page or object busy.
5503 if (m->object != NULL && !vm_page_busied(m))
5504 VM_OBJECT_ASSERT_BUSY(m->object);
5508 vm_page_assert_pga_writeable(vm_page_t m, uint16_t bits)
5511 if ((bits & PGA_WRITEABLE) == 0)
5515 * The PGA_WRITEABLE flag can only be set if the page is
5516 * managed, is exclusively busied or the object is locked.
5517 * Currently, this flag is only set by pmap_enter().
5519 KASSERT((m->oflags & VPO_UNMANAGED) == 0,
5520 ("PGA_WRITEABLE on unmanaged page"));
5521 if (!vm_page_xbusied(m))
5522 VM_OBJECT_ASSERT_BUSY(m->object);
5526 #include "opt_ddb.h"
5528 #include <sys/kernel.h>
5530 #include <ddb/ddb.h>
5532 DB_SHOW_COMMAND(page, vm_page_print_page_info)
5535 db_printf("vm_cnt.v_free_count: %d\n", vm_free_count());
5536 db_printf("vm_cnt.v_inactive_count: %d\n", vm_inactive_count());
5537 db_printf("vm_cnt.v_active_count: %d\n", vm_active_count());
5538 db_printf("vm_cnt.v_laundry_count: %d\n", vm_laundry_count());
5539 db_printf("vm_cnt.v_wire_count: %d\n", vm_wire_count());
5540 db_printf("vm_cnt.v_free_reserved: %d\n", vm_cnt.v_free_reserved);
5541 db_printf("vm_cnt.v_free_min: %d\n", vm_cnt.v_free_min);
5542 db_printf("vm_cnt.v_free_target: %d\n", vm_cnt.v_free_target);
5543 db_printf("vm_cnt.v_inactive_target: %d\n", vm_cnt.v_inactive_target);
5546 DB_SHOW_COMMAND(pageq, vm_page_print_pageq_info)
5550 db_printf("pq_free %d\n", vm_free_count());
5551 for (dom = 0; dom < vm_ndomains; dom++) {
5553 "dom %d page_cnt %d free %d pq_act %d pq_inact %d pq_laund %d pq_unsw %d\n",
5555 vm_dom[dom].vmd_page_count,
5556 vm_dom[dom].vmd_free_count,
5557 vm_dom[dom].vmd_pagequeues[PQ_ACTIVE].pq_cnt,
5558 vm_dom[dom].vmd_pagequeues[PQ_INACTIVE].pq_cnt,
5559 vm_dom[dom].vmd_pagequeues[PQ_LAUNDRY].pq_cnt,
5560 vm_dom[dom].vmd_pagequeues[PQ_UNSWAPPABLE].pq_cnt);
5564 DB_SHOW_COMMAND(pginfo, vm_page_print_pginfo)
5567 boolean_t phys, virt;
5570 db_printf("show pginfo addr\n");
5574 phys = strchr(modif, 'p') != NULL;
5575 virt = strchr(modif, 'v') != NULL;
5577 m = PHYS_TO_VM_PAGE(pmap_kextract(addr));
5579 m = PHYS_TO_VM_PAGE(addr);
5581 m = (vm_page_t)addr;
5583 "page %p obj %p pidx 0x%jx phys 0x%jx q %d ref 0x%x\n"
5584 " af 0x%x of 0x%x f 0x%x act %d busy %x valid 0x%x dirty 0x%x\n",
5585 m, m->object, (uintmax_t)m->pindex, (uintmax_t)m->phys_addr,
5586 m->a.queue, m->ref_count, m->a.flags, m->oflags,
5587 m->flags, m->a.act_count, m->busy_lock, m->valid, m->dirty);