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>
112 #include <vm/uma_int.h>
114 #include <machine/md_var.h>
116 struct vm_domain vm_dom[MAXMEMDOM];
118 DPCPU_DEFINE_STATIC(struct vm_batchqueue, pqbatch[MAXMEMDOM][PQ_COUNT]);
120 struct mtx_padalign __exclusive_cache_line pa_lock[PA_LOCK_COUNT];
122 struct mtx_padalign __exclusive_cache_line vm_domainset_lock;
123 /* The following fields are protected by the domainset lock. */
124 domainset_t __exclusive_cache_line vm_min_domains;
125 domainset_t __exclusive_cache_line vm_severe_domains;
126 static int vm_min_waiters;
127 static int vm_severe_waiters;
128 static int vm_pageproc_waiters;
130 static SYSCTL_NODE(_vm_stats, OID_AUTO, page, CTLFLAG_RD | CTLFLAG_MPSAFE, 0,
131 "VM page statistics");
133 static COUNTER_U64_DEFINE_EARLY(pqstate_commit_retries);
134 SYSCTL_COUNTER_U64(_vm_stats_page, OID_AUTO, pqstate_commit_retries,
135 CTLFLAG_RD, &pqstate_commit_retries,
136 "Number of failed per-page atomic queue state updates");
138 static COUNTER_U64_DEFINE_EARLY(queue_ops);
139 SYSCTL_COUNTER_U64(_vm_stats_page, OID_AUTO, queue_ops,
140 CTLFLAG_RD, &queue_ops,
141 "Number of batched queue operations");
143 static COUNTER_U64_DEFINE_EARLY(queue_nops);
144 SYSCTL_COUNTER_U64(_vm_stats_page, OID_AUTO, queue_nops,
145 CTLFLAG_RD, &queue_nops,
146 "Number of batched queue operations with no effects");
149 * bogus page -- for I/O to/from partially complete buffers,
150 * or for paging into sparsely invalid regions.
152 vm_page_t bogus_page;
154 vm_page_t vm_page_array;
155 long vm_page_array_size;
158 static TAILQ_HEAD(, vm_page) blacklist_head;
159 static int sysctl_vm_page_blacklist(SYSCTL_HANDLER_ARGS);
160 SYSCTL_PROC(_vm, OID_AUTO, page_blacklist, CTLTYPE_STRING | CTLFLAG_RD |
161 CTLFLAG_MPSAFE, NULL, 0, sysctl_vm_page_blacklist, "A", "Blacklist pages");
163 static uma_zone_t fakepg_zone;
165 static void vm_page_alloc_check(vm_page_t m);
166 static bool _vm_page_busy_sleep(vm_object_t obj, vm_page_t m,
167 vm_pindex_t pindex, const char *wmesg, int allocflags, bool locked);
168 static void vm_page_clear_dirty_mask(vm_page_t m, vm_page_bits_t pagebits);
169 static void vm_page_enqueue(vm_page_t m, uint8_t queue);
170 static bool vm_page_free_prep(vm_page_t m);
171 static void vm_page_free_toq(vm_page_t m);
172 static void vm_page_init(void *dummy);
173 static int vm_page_insert_after(vm_page_t m, vm_object_t object,
174 vm_pindex_t pindex, vm_page_t mpred);
175 static void vm_page_insert_radixdone(vm_page_t m, vm_object_t object,
177 static void vm_page_mvqueue(vm_page_t m, const uint8_t queue,
178 const uint16_t nflag);
179 static int vm_page_reclaim_run(int req_class, int domain, u_long npages,
180 vm_page_t m_run, vm_paddr_t high);
181 static void vm_page_release_toq(vm_page_t m, uint8_t nqueue, bool noreuse);
182 static int vm_domain_alloc_fail(struct vm_domain *vmd, vm_object_t object,
184 static int vm_page_zone_import(void *arg, void **store, int cnt, int domain,
186 static void vm_page_zone_release(void *arg, void **store, int cnt);
188 SYSINIT(vm_page, SI_SUB_VM, SI_ORDER_SECOND, vm_page_init, NULL);
191 vm_page_init(void *dummy)
194 fakepg_zone = uma_zcreate("fakepg", sizeof(struct vm_page), NULL, NULL,
195 NULL, NULL, UMA_ALIGN_PTR, UMA_ZONE_NOFREE);
196 bogus_page = vm_page_alloc(NULL, 0, VM_ALLOC_NOOBJ |
197 VM_ALLOC_NORMAL | VM_ALLOC_WIRED);
201 * The cache page zone is initialized later since we need to be able to allocate
202 * pages before UMA is fully initialized.
205 vm_page_init_cache_zones(void *dummy __unused)
207 struct vm_domain *vmd;
208 struct vm_pgcache *pgcache;
209 int cache, domain, maxcache, pool;
212 TUNABLE_INT_FETCH("vm.pgcache_zone_max_pcpu", &maxcache);
213 maxcache *= mp_ncpus;
214 for (domain = 0; domain < vm_ndomains; domain++) {
215 vmd = VM_DOMAIN(domain);
216 for (pool = 0; pool < VM_NFREEPOOL; pool++) {
217 pgcache = &vmd->vmd_pgcache[pool];
218 pgcache->domain = domain;
219 pgcache->pool = pool;
220 pgcache->zone = uma_zcache_create("vm pgcache",
221 PAGE_SIZE, NULL, NULL, NULL, NULL,
222 vm_page_zone_import, vm_page_zone_release, pgcache,
226 * Limit each pool's zone to 0.1% of the pages in the
229 cache = maxcache != 0 ? maxcache :
230 vmd->vmd_page_count / 1000;
231 uma_zone_set_maxcache(pgcache->zone, cache);
235 SYSINIT(vm_page2, SI_SUB_VM_CONF, SI_ORDER_ANY, vm_page_init_cache_zones, NULL);
237 /* Make sure that u_long is at least 64 bits when PAGE_SIZE is 32K. */
238 #if PAGE_SIZE == 32768
240 CTASSERT(sizeof(u_long) >= 8);
247 * Sets the page size, perhaps based upon the memory
248 * size. Must be called before any use of page-size
249 * dependent functions.
252 vm_set_page_size(void)
254 if (vm_cnt.v_page_size == 0)
255 vm_cnt.v_page_size = PAGE_SIZE;
256 if (((vm_cnt.v_page_size - 1) & vm_cnt.v_page_size) != 0)
257 panic("vm_set_page_size: page size not a power of two");
261 * vm_page_blacklist_next:
263 * Find the next entry in the provided string of blacklist
264 * addresses. Entries are separated by space, comma, or newline.
265 * If an invalid integer is encountered then the rest of the
266 * string is skipped. Updates the list pointer to the next
267 * character, or NULL if the string is exhausted or invalid.
270 vm_page_blacklist_next(char **list, char *end)
275 if (list == NULL || *list == NULL)
283 * If there's no end pointer then the buffer is coming from
284 * the kenv and we know it's null-terminated.
287 end = *list + strlen(*list);
289 /* Ensure that strtoq() won't walk off the end */
291 if (*end == '\n' || *end == ' ' || *end == ',')
294 printf("Blacklist not terminated, skipping\n");
300 for (pos = *list; *pos != '\0'; pos = cp) {
301 bad = strtoq(pos, &cp, 0);
302 if (*cp == '\0' || *cp == ' ' || *cp == ',' || *cp == '\n') {
311 if (*cp == '\0' || ++cp >= end)
315 return (trunc_page(bad));
317 printf("Garbage in RAM blacklist, skipping\n");
323 vm_page_blacklist_add(vm_paddr_t pa, bool verbose)
325 struct vm_domain *vmd;
329 m = vm_phys_paddr_to_vm_page(pa);
331 return (true); /* page does not exist, no failure */
333 vmd = vm_pagequeue_domain(m);
334 vm_domain_free_lock(vmd);
335 ret = vm_phys_unfree_page(m);
336 vm_domain_free_unlock(vmd);
338 vm_domain_freecnt_inc(vmd, -1);
339 TAILQ_INSERT_TAIL(&blacklist_head, m, listq);
341 printf("Skipping page with pa 0x%jx\n", (uintmax_t)pa);
347 * vm_page_blacklist_check:
349 * Iterate through the provided string of blacklist addresses, pulling
350 * each entry out of the physical allocator free list and putting it
351 * onto a list for reporting via the vm.page_blacklist sysctl.
354 vm_page_blacklist_check(char *list, char *end)
360 while (next != NULL) {
361 if ((pa = vm_page_blacklist_next(&next, end)) == 0)
363 vm_page_blacklist_add(pa, bootverbose);
368 * vm_page_blacklist_load:
370 * Search for a special module named "ram_blacklist". It'll be a
371 * plain text file provided by the user via the loader directive
375 vm_page_blacklist_load(char **list, char **end)
384 mod = preload_search_by_type("ram_blacklist");
386 ptr = preload_fetch_addr(mod);
387 len = preload_fetch_size(mod);
398 sysctl_vm_page_blacklist(SYSCTL_HANDLER_ARGS)
405 error = sysctl_wire_old_buffer(req, 0);
408 sbuf_new_for_sysctl(&sbuf, NULL, 128, req);
409 TAILQ_FOREACH(m, &blacklist_head, listq) {
410 sbuf_printf(&sbuf, "%s%#jx", first ? "" : ",",
411 (uintmax_t)m->phys_addr);
414 error = sbuf_finish(&sbuf);
420 * Initialize a dummy page for use in scans of the specified paging queue.
421 * In principle, this function only needs to set the flag PG_MARKER.
422 * Nonetheless, it write busies the page as a safety precaution.
425 vm_page_init_marker(vm_page_t marker, int queue, uint16_t aflags)
428 bzero(marker, sizeof(*marker));
429 marker->flags = PG_MARKER;
430 marker->a.flags = aflags;
431 marker->busy_lock = VPB_CURTHREAD_EXCLUSIVE;
432 marker->a.queue = queue;
436 vm_page_domain_init(int domain)
438 struct vm_domain *vmd;
439 struct vm_pagequeue *pq;
442 vmd = VM_DOMAIN(domain);
443 bzero(vmd, sizeof(*vmd));
444 *__DECONST(const char **, &vmd->vmd_pagequeues[PQ_INACTIVE].pq_name) =
445 "vm inactive pagequeue";
446 *__DECONST(const char **, &vmd->vmd_pagequeues[PQ_ACTIVE].pq_name) =
447 "vm active pagequeue";
448 *__DECONST(const char **, &vmd->vmd_pagequeues[PQ_LAUNDRY].pq_name) =
449 "vm laundry pagequeue";
450 *__DECONST(const char **,
451 &vmd->vmd_pagequeues[PQ_UNSWAPPABLE].pq_name) =
452 "vm unswappable pagequeue";
453 vmd->vmd_domain = domain;
454 vmd->vmd_page_count = 0;
455 vmd->vmd_free_count = 0;
457 vmd->vmd_oom = FALSE;
458 for (i = 0; i < PQ_COUNT; i++) {
459 pq = &vmd->vmd_pagequeues[i];
460 TAILQ_INIT(&pq->pq_pl);
461 mtx_init(&pq->pq_mutex, pq->pq_name, "vm pagequeue",
462 MTX_DEF | MTX_DUPOK);
464 vm_page_init_marker(&vmd->vmd_markers[i], i, 0);
466 mtx_init(&vmd->vmd_free_mtx, "vm page free queue", NULL, MTX_DEF);
467 mtx_init(&vmd->vmd_pageout_mtx, "vm pageout lock", NULL, MTX_DEF);
468 snprintf(vmd->vmd_name, sizeof(vmd->vmd_name), "%d", domain);
471 * inacthead is used to provide FIFO ordering for LRU-bypassing
474 vm_page_init_marker(&vmd->vmd_inacthead, PQ_INACTIVE, PGA_ENQUEUED);
475 TAILQ_INSERT_HEAD(&vmd->vmd_pagequeues[PQ_INACTIVE].pq_pl,
476 &vmd->vmd_inacthead, plinks.q);
479 * The clock pages are used to implement active queue scanning without
480 * requeues. Scans start at clock[0], which is advanced after the scan
481 * ends. When the two clock hands meet, they are reset and scanning
482 * resumes from the head of the queue.
484 vm_page_init_marker(&vmd->vmd_clock[0], PQ_ACTIVE, PGA_ENQUEUED);
485 vm_page_init_marker(&vmd->vmd_clock[1], PQ_ACTIVE, PGA_ENQUEUED);
486 TAILQ_INSERT_HEAD(&vmd->vmd_pagequeues[PQ_ACTIVE].pq_pl,
487 &vmd->vmd_clock[0], plinks.q);
488 TAILQ_INSERT_TAIL(&vmd->vmd_pagequeues[PQ_ACTIVE].pq_pl,
489 &vmd->vmd_clock[1], plinks.q);
493 * Initialize a physical page in preparation for adding it to the free
497 vm_page_init_page(vm_page_t m, vm_paddr_t pa, int segind)
502 m->busy_lock = VPB_FREED;
503 m->flags = m->a.flags = 0;
505 m->a.queue = PQ_NONE;
508 m->order = VM_NFREEORDER;
509 m->pool = VM_FREEPOOL_DEFAULT;
510 m->valid = m->dirty = 0;
514 #ifndef PMAP_HAS_PAGE_ARRAY
516 vm_page_array_alloc(vm_offset_t *vaddr, vm_paddr_t end, vm_paddr_t page_range)
521 * Reserve an unmapped guard page to trap access to vm_page_array[-1].
522 * However, because this page is allocated from KVM, out-of-bounds
523 * accesses using the direct map will not be trapped.
528 * Allocate physical memory for the page structures, and map it.
530 new_end = trunc_page(end - page_range * sizeof(struct vm_page));
531 vm_page_array = (vm_page_t)pmap_map(vaddr, new_end, end,
532 VM_PROT_READ | VM_PROT_WRITE);
533 vm_page_array_size = page_range;
542 * Initializes the resident memory module. Allocates physical memory for
543 * bootstrapping UMA and some data structures that are used to manage
544 * physical pages. Initializes these structures, and populates the free
548 vm_page_startup(vm_offset_t vaddr)
550 struct vm_phys_seg *seg;
552 char *list, *listend;
553 vm_paddr_t end, high_avail, low_avail, new_end, size;
554 vm_paddr_t page_range __unused;
555 vm_paddr_t last_pa, pa;
557 int biggestone, i, segind;
562 #if defined(__i386__) && defined(VM_PHYSSEG_DENSE)
566 vaddr = round_page(vaddr);
568 vm_phys_early_startup();
569 biggestone = vm_phys_avail_largest();
570 end = phys_avail[biggestone+1];
573 * Initialize the page and queue locks.
575 mtx_init(&vm_domainset_lock, "vm domainset lock", NULL, MTX_DEF);
576 for (i = 0; i < PA_LOCK_COUNT; i++)
577 mtx_init(&pa_lock[i], "vm page", NULL, MTX_DEF);
578 for (i = 0; i < vm_ndomains; i++)
579 vm_page_domain_init(i);
583 witness_size = round_page(witness_startup_count());
584 new_end -= witness_size;
585 mapped = pmap_map(&vaddr, new_end, new_end + witness_size,
586 VM_PROT_READ | VM_PROT_WRITE);
587 bzero((void *)mapped, witness_size);
588 witness_startup((void *)mapped);
591 #if defined(__aarch64__) || defined(__amd64__) || defined(__arm__) || \
592 defined(__i386__) || defined(__mips__) || defined(__riscv) || \
593 defined(__powerpc64__)
595 * Allocate a bitmap to indicate that a random physical page
596 * needs to be included in a minidump.
598 * The amd64 port needs this to indicate which direct map pages
599 * need to be dumped, via calls to dump_add_page()/dump_drop_page().
601 * However, i386 still needs this workspace internally within the
602 * minidump code. In theory, they are not needed on i386, but are
603 * included should the sf_buf code decide to use them.
606 for (i = 0; dump_avail[i + 1] != 0; i += 2)
607 if (dump_avail[i + 1] > last_pa)
608 last_pa = dump_avail[i + 1];
609 page_range = last_pa / PAGE_SIZE;
610 vm_page_dump_size = round_page(roundup2(page_range, NBBY) / NBBY);
611 new_end -= vm_page_dump_size;
612 vm_page_dump = (void *)(uintptr_t)pmap_map(&vaddr, new_end,
613 new_end + vm_page_dump_size, VM_PROT_READ | VM_PROT_WRITE);
614 bzero((void *)vm_page_dump, vm_page_dump_size);
618 #if defined(__aarch64__) || defined(__amd64__) || defined(__mips__) || \
619 defined(__riscv) || defined(__powerpc64__)
621 * Include the UMA bootstrap pages, witness pages and vm_page_dump
622 * in a crash dump. When pmap_map() uses the direct map, they are
623 * not automatically included.
625 for (pa = new_end; pa < end; pa += PAGE_SIZE)
628 phys_avail[biggestone + 1] = new_end;
631 * Request that the physical pages underlying the message buffer be
632 * included in a crash dump. Since the message buffer is accessed
633 * through the direct map, they are not automatically included.
635 pa = DMAP_TO_PHYS((vm_offset_t)msgbufp->msg_ptr);
636 last_pa = pa + round_page(msgbufsize);
637 while (pa < last_pa) {
643 * Compute the number of pages of memory that will be available for
644 * use, taking into account the overhead of a page structure per page.
645 * In other words, solve
646 * "available physical memory" - round_page(page_range *
647 * sizeof(struct vm_page)) = page_range * PAGE_SIZE
650 low_avail = phys_avail[0];
651 high_avail = phys_avail[1];
652 for (i = 0; i < vm_phys_nsegs; i++) {
653 if (vm_phys_segs[i].start < low_avail)
654 low_avail = vm_phys_segs[i].start;
655 if (vm_phys_segs[i].end > high_avail)
656 high_avail = vm_phys_segs[i].end;
658 /* Skip the first chunk. It is already accounted for. */
659 for (i = 2; phys_avail[i + 1] != 0; i += 2) {
660 if (phys_avail[i] < low_avail)
661 low_avail = phys_avail[i];
662 if (phys_avail[i + 1] > high_avail)
663 high_avail = phys_avail[i + 1];
665 first_page = low_avail / PAGE_SIZE;
666 #ifdef VM_PHYSSEG_SPARSE
668 for (i = 0; i < vm_phys_nsegs; i++)
669 size += vm_phys_segs[i].end - vm_phys_segs[i].start;
670 for (i = 0; phys_avail[i + 1] != 0; i += 2)
671 size += phys_avail[i + 1] - phys_avail[i];
672 #elif defined(VM_PHYSSEG_DENSE)
673 size = high_avail - low_avail;
675 #error "Either VM_PHYSSEG_DENSE or VM_PHYSSEG_SPARSE must be defined."
678 #ifdef PMAP_HAS_PAGE_ARRAY
679 pmap_page_array_startup(size / PAGE_SIZE);
680 biggestone = vm_phys_avail_largest();
681 end = new_end = phys_avail[biggestone + 1];
683 #ifdef VM_PHYSSEG_DENSE
685 * In the VM_PHYSSEG_DENSE case, the number of pages can account for
686 * the overhead of a page structure per page only if vm_page_array is
687 * allocated from the last physical memory chunk. Otherwise, we must
688 * allocate page structures representing the physical memory
689 * underlying vm_page_array, even though they will not be used.
691 if (new_end != high_avail)
692 page_range = size / PAGE_SIZE;
696 page_range = size / (PAGE_SIZE + sizeof(struct vm_page));
699 * If the partial bytes remaining are large enough for
700 * a page (PAGE_SIZE) without a corresponding
701 * 'struct vm_page', then new_end will contain an
702 * extra page after subtracting the length of the VM
703 * page array. Compensate by subtracting an extra
706 if (size % (PAGE_SIZE + sizeof(struct vm_page)) >= PAGE_SIZE) {
707 if (new_end == high_avail)
708 high_avail -= PAGE_SIZE;
709 new_end -= PAGE_SIZE;
713 new_end = vm_page_array_alloc(&vaddr, end, page_range);
716 #if VM_NRESERVLEVEL > 0
718 * Allocate physical memory for the reservation management system's
719 * data structures, and map it.
721 new_end = vm_reserv_startup(&vaddr, new_end);
723 #if defined(__aarch64__) || defined(__amd64__) || defined(__mips__) || \
724 defined(__riscv) || defined(__powerpc64__)
726 * Include vm_page_array and vm_reserv_array in a crash dump.
728 for (pa = new_end; pa < end; pa += PAGE_SIZE)
731 phys_avail[biggestone + 1] = new_end;
734 * Add physical memory segments corresponding to the available
737 for (i = 0; phys_avail[i + 1] != 0; i += 2)
738 if (vm_phys_avail_size(i) != 0)
739 vm_phys_add_seg(phys_avail[i], phys_avail[i + 1]);
742 * Initialize the physical memory allocator.
747 * Initialize the page structures and add every available page to the
748 * physical memory allocator's free lists.
750 #if defined(__i386__) && defined(VM_PHYSSEG_DENSE)
751 for (ii = 0; ii < vm_page_array_size; ii++) {
752 m = &vm_page_array[ii];
753 vm_page_init_page(m, (first_page + ii) << PAGE_SHIFT, 0);
754 m->flags = PG_FICTITIOUS;
757 vm_cnt.v_page_count = 0;
758 for (segind = 0; segind < vm_phys_nsegs; segind++) {
759 seg = &vm_phys_segs[segind];
760 for (m = seg->first_page, pa = seg->start; pa < seg->end;
761 m++, pa += PAGE_SIZE)
762 vm_page_init_page(m, pa, segind);
765 * Add the segment to the free lists only if it is covered by
766 * one of the ranges in phys_avail. Because we've added the
767 * ranges to the vm_phys_segs array, we can assume that each
768 * segment is either entirely contained in one of the ranges,
769 * or doesn't overlap any of them.
771 for (i = 0; phys_avail[i + 1] != 0; i += 2) {
772 struct vm_domain *vmd;
774 if (seg->start < phys_avail[i] ||
775 seg->end > phys_avail[i + 1])
779 pagecount = (u_long)atop(seg->end - seg->start);
781 vmd = VM_DOMAIN(seg->domain);
782 vm_domain_free_lock(vmd);
783 vm_phys_enqueue_contig(m, pagecount);
784 vm_domain_free_unlock(vmd);
785 vm_domain_freecnt_inc(vmd, pagecount);
786 vm_cnt.v_page_count += (u_int)pagecount;
788 vmd = VM_DOMAIN(seg->domain);
789 vmd->vmd_page_count += (u_int)pagecount;
790 vmd->vmd_segs |= 1UL << m->segind;
796 * Remove blacklisted pages from the physical memory allocator.
798 TAILQ_INIT(&blacklist_head);
799 vm_page_blacklist_load(&list, &listend);
800 vm_page_blacklist_check(list, listend);
802 list = kern_getenv("vm.blacklist");
803 vm_page_blacklist_check(list, NULL);
806 #if VM_NRESERVLEVEL > 0
808 * Initialize the reservation management system.
817 vm_page_reference(vm_page_t m)
820 vm_page_aflag_set(m, PGA_REFERENCED);
826 * Helper routine for grab functions to trylock busy.
828 * Returns true on success and false on failure.
831 vm_page_trybusy(vm_page_t m, int allocflags)
834 if ((allocflags & (VM_ALLOC_SBUSY | VM_ALLOC_IGN_SBUSY)) != 0)
835 return (vm_page_trysbusy(m));
837 return (vm_page_tryxbusy(m));
843 * Helper routine for grab functions to trylock busy and wire.
845 * Returns true on success and false on failure.
848 vm_page_tryacquire(vm_page_t m, int allocflags)
852 locked = vm_page_trybusy(m, allocflags);
853 if (locked && (allocflags & VM_ALLOC_WIRED) != 0)
859 * vm_page_busy_acquire:
861 * Acquire the busy lock as described by VM_ALLOC_* flags. Will loop
862 * and drop the object lock if necessary.
865 vm_page_busy_acquire(vm_page_t m, int allocflags)
871 * The page-specific object must be cached because page
872 * identity can change during the sleep, causing the
873 * re-lock of a different object.
874 * It is assumed that a reference to the object is already
875 * held by the callers.
879 if (vm_page_tryacquire(m, allocflags))
881 if ((allocflags & VM_ALLOC_NOWAIT) != 0)
884 locked = VM_OBJECT_WOWNED(obj);
887 MPASS(locked || vm_page_wired(m));
888 if (_vm_page_busy_sleep(obj, m, m->pindex, "vmpba", allocflags,
890 VM_OBJECT_WLOCK(obj);
891 if ((allocflags & VM_ALLOC_WAITFAIL) != 0)
893 KASSERT(m->object == obj || m->object == NULL,
894 ("vm_page_busy_acquire: page %p does not belong to %p",
900 * vm_page_busy_downgrade:
902 * Downgrade an exclusive busy page into a single shared busy page.
905 vm_page_busy_downgrade(vm_page_t m)
909 vm_page_assert_xbusied(m);
913 if (atomic_fcmpset_rel_int(&m->busy_lock,
914 &x, VPB_SHARERS_WORD(1)))
917 if ((x & VPB_BIT_WAITERS) != 0)
923 * vm_page_busy_tryupgrade:
925 * Attempt to upgrade a single shared busy into an exclusive busy.
928 vm_page_busy_tryupgrade(vm_page_t m)
932 vm_page_assert_sbusied(m);
935 ce = VPB_CURTHREAD_EXCLUSIVE;
937 if (VPB_SHARERS(x) > 1)
939 KASSERT((x & ~VPB_BIT_WAITERS) == VPB_SHARERS_WORD(1),
940 ("vm_page_busy_tryupgrade: invalid lock state"));
941 if (!atomic_fcmpset_acq_int(&m->busy_lock, &x,
942 ce | (x & VPB_BIT_WAITERS)))
951 * Return a positive value if the page is shared busied, 0 otherwise.
954 vm_page_sbusied(vm_page_t m)
959 return ((x & VPB_BIT_SHARED) != 0 && x != VPB_UNBUSIED);
965 * Shared unbusy a page.
968 vm_page_sunbusy(vm_page_t m)
972 vm_page_assert_sbusied(m);
976 KASSERT(x != VPB_FREED,
977 ("vm_page_sunbusy: Unlocking freed page."));
978 if (VPB_SHARERS(x) > 1) {
979 if (atomic_fcmpset_int(&m->busy_lock, &x,
984 KASSERT((x & ~VPB_BIT_WAITERS) == VPB_SHARERS_WORD(1),
985 ("vm_page_sunbusy: invalid lock state"));
986 if (!atomic_fcmpset_rel_int(&m->busy_lock, &x, VPB_UNBUSIED))
988 if ((x & VPB_BIT_WAITERS) == 0)
996 * vm_page_busy_sleep:
998 * Sleep if the page is busy, using the page pointer as wchan.
999 * This is used to implement the hard-path of busying mechanism.
1001 * If nonshared is true, sleep only if the page is xbusy.
1003 * The object lock must be held on entry and will be released on exit.
1006 vm_page_busy_sleep(vm_page_t m, const char *wmesg, bool nonshared)
1011 VM_OBJECT_ASSERT_LOCKED(obj);
1012 vm_page_lock_assert(m, MA_NOTOWNED);
1014 if (!_vm_page_busy_sleep(obj, m, m->pindex, wmesg,
1015 nonshared ? VM_ALLOC_SBUSY : 0 , true))
1016 VM_OBJECT_DROP(obj);
1020 * vm_page_busy_sleep_unlocked:
1022 * Sleep if the page is busy, using the page pointer as wchan.
1023 * This is used to implement the hard-path of busying mechanism.
1025 * If nonshared is true, sleep only if the page is xbusy.
1027 * The object lock must not be held on entry. The operation will
1028 * return if the page changes identity.
1031 vm_page_busy_sleep_unlocked(vm_object_t obj, vm_page_t m, vm_pindex_t pindex,
1032 const char *wmesg, bool nonshared)
1035 VM_OBJECT_ASSERT_UNLOCKED(obj);
1036 vm_page_lock_assert(m, MA_NOTOWNED);
1038 _vm_page_busy_sleep(obj, m, pindex, wmesg,
1039 nonshared ? VM_ALLOC_SBUSY : 0, false);
1043 * _vm_page_busy_sleep:
1045 * Internal busy sleep function. Verifies the page identity and
1046 * lockstate against parameters. Returns true if it sleeps and
1049 * If locked is true the lock will be dropped for any true returns
1050 * and held for any false returns.
1053 _vm_page_busy_sleep(vm_object_t obj, vm_page_t m, vm_pindex_t pindex,
1054 const char *wmesg, int allocflags, bool locked)
1060 * If the object is busy we must wait for that to drain to zero
1061 * before trying the page again.
1063 if (obj != NULL && vm_object_busied(obj)) {
1065 VM_OBJECT_DROP(obj);
1066 vm_object_busy_wait(obj, wmesg);
1070 if (!vm_page_busied(m))
1073 xsleep = (allocflags & (VM_ALLOC_SBUSY | VM_ALLOC_IGN_SBUSY)) != 0;
1075 x = atomic_load_int(&m->busy_lock);
1078 * If the page changes objects or becomes unlocked we can
1081 if (x == VPB_UNBUSIED ||
1082 (xsleep && (x & VPB_BIT_SHARED) != 0) ||
1083 m->object != obj || m->pindex != pindex) {
1087 if ((x & VPB_BIT_WAITERS) != 0)
1089 } while (!atomic_fcmpset_int(&m->busy_lock, &x, x | VPB_BIT_WAITERS));
1091 VM_OBJECT_DROP(obj);
1093 sleepq_add(m, NULL, wmesg, 0, 0);
1094 sleepq_wait(m, PVM);
1102 * Try to shared busy a page.
1103 * If the operation succeeds 1 is returned otherwise 0.
1104 * The operation never sleeps.
1107 vm_page_trysbusy(vm_page_t m)
1115 if ((x & VPB_BIT_SHARED) == 0)
1118 * Reduce the window for transient busies that will trigger
1119 * false negatives in vm_page_ps_test().
1121 if (obj != NULL && vm_object_busied(obj))
1123 if (atomic_fcmpset_acq_int(&m->busy_lock, &x,
1124 x + VPB_ONE_SHARER))
1128 /* Refetch the object now that we're guaranteed that it is stable. */
1130 if (obj != NULL && vm_object_busied(obj)) {
1140 * Try to exclusive busy a page.
1141 * If the operation succeeds 1 is returned otherwise 0.
1142 * The operation never sleeps.
1145 vm_page_tryxbusy(vm_page_t m)
1149 if (atomic_cmpset_acq_int(&(m)->busy_lock, VPB_UNBUSIED,
1150 VPB_CURTHREAD_EXCLUSIVE) == 0)
1154 if (obj != NULL && vm_object_busied(obj)) {
1162 vm_page_xunbusy_hard_tail(vm_page_t m)
1164 atomic_store_rel_int(&m->busy_lock, VPB_UNBUSIED);
1165 /* Wake the waiter. */
1170 * vm_page_xunbusy_hard:
1172 * Called when unbusy has failed because there is a waiter.
1175 vm_page_xunbusy_hard(vm_page_t m)
1177 vm_page_assert_xbusied(m);
1178 vm_page_xunbusy_hard_tail(m);
1182 vm_page_xunbusy_hard_unchecked(vm_page_t m)
1184 vm_page_assert_xbusied_unchecked(m);
1185 vm_page_xunbusy_hard_tail(m);
1189 vm_page_busy_free(vm_page_t m)
1193 atomic_thread_fence_rel();
1194 x = atomic_swap_int(&m->busy_lock, VPB_FREED);
1195 if ((x & VPB_BIT_WAITERS) != 0)
1200 * vm_page_unhold_pages:
1202 * Unhold each of the pages that is referenced by the given array.
1205 vm_page_unhold_pages(vm_page_t *ma, int count)
1208 for (; count != 0; count--) {
1209 vm_page_unwire(*ma, PQ_ACTIVE);
1215 PHYS_TO_VM_PAGE(vm_paddr_t pa)
1219 #ifdef VM_PHYSSEG_SPARSE
1220 m = vm_phys_paddr_to_vm_page(pa);
1222 m = vm_phys_fictitious_to_vm_page(pa);
1224 #elif defined(VM_PHYSSEG_DENSE)
1228 if (pi >= first_page && (pi - first_page) < vm_page_array_size) {
1229 m = &vm_page_array[pi - first_page];
1232 return (vm_phys_fictitious_to_vm_page(pa));
1234 #error "Either VM_PHYSSEG_DENSE or VM_PHYSSEG_SPARSE must be defined."
1241 * Create a fictitious page with the specified physical address and
1242 * memory attribute. The memory attribute is the only the machine-
1243 * dependent aspect of a fictitious page that must be initialized.
1246 vm_page_getfake(vm_paddr_t paddr, vm_memattr_t memattr)
1250 m = uma_zalloc(fakepg_zone, M_WAITOK | M_ZERO);
1251 vm_page_initfake(m, paddr, memattr);
1256 vm_page_initfake(vm_page_t m, vm_paddr_t paddr, vm_memattr_t memattr)
1259 if ((m->flags & PG_FICTITIOUS) != 0) {
1261 * The page's memattr might have changed since the
1262 * previous initialization. Update the pmap to the
1267 m->phys_addr = paddr;
1268 m->a.queue = PQ_NONE;
1269 /* Fictitious pages don't use "segind". */
1270 m->flags = PG_FICTITIOUS;
1271 /* Fictitious pages don't use "order" or "pool". */
1272 m->oflags = VPO_UNMANAGED;
1273 m->busy_lock = VPB_CURTHREAD_EXCLUSIVE;
1274 /* Fictitious pages are unevictable. */
1278 pmap_page_set_memattr(m, memattr);
1284 * Release a fictitious page.
1287 vm_page_putfake(vm_page_t m)
1290 KASSERT((m->oflags & VPO_UNMANAGED) != 0, ("managed %p", m));
1291 KASSERT((m->flags & PG_FICTITIOUS) != 0,
1292 ("vm_page_putfake: bad page %p", m));
1293 vm_page_assert_xbusied(m);
1294 vm_page_busy_free(m);
1295 uma_zfree(fakepg_zone, m);
1299 * vm_page_updatefake:
1301 * Update the given fictitious page to the specified physical address and
1305 vm_page_updatefake(vm_page_t m, vm_paddr_t paddr, vm_memattr_t memattr)
1308 KASSERT((m->flags & PG_FICTITIOUS) != 0,
1309 ("vm_page_updatefake: bad page %p", m));
1310 m->phys_addr = paddr;
1311 pmap_page_set_memattr(m, memattr);
1320 vm_page_free(vm_page_t m)
1323 m->flags &= ~PG_ZERO;
1324 vm_page_free_toq(m);
1328 * vm_page_free_zero:
1330 * Free a page to the zerod-pages queue
1333 vm_page_free_zero(vm_page_t m)
1336 m->flags |= PG_ZERO;
1337 vm_page_free_toq(m);
1341 * Unbusy and handle the page queueing for a page from a getpages request that
1342 * was optionally read ahead or behind.
1345 vm_page_readahead_finish(vm_page_t m)
1348 /* We shouldn't put invalid pages on queues. */
1349 KASSERT(!vm_page_none_valid(m), ("%s: %p is invalid", __func__, m));
1352 * Since the page is not the actually needed one, whether it should
1353 * be activated or deactivated is not obvious. Empirical results
1354 * have shown that deactivating the page is usually the best choice,
1355 * unless the page is wanted by another thread.
1357 if ((m->busy_lock & VPB_BIT_WAITERS) != 0)
1358 vm_page_activate(m);
1360 vm_page_deactivate(m);
1361 vm_page_xunbusy_unchecked(m);
1365 * Destroy the identity of an invalid page and free it if possible.
1366 * This is intended to be used when reading a page from backing store fails.
1369 vm_page_free_invalid(vm_page_t m)
1372 KASSERT(vm_page_none_valid(m), ("page %p is valid", m));
1373 KASSERT(!pmap_page_is_mapped(m), ("page %p is mapped", m));
1374 vm_page_assert_xbusied(m);
1375 KASSERT(m->object != NULL, ("page %p has no object", m));
1376 VM_OBJECT_ASSERT_WLOCKED(m->object);
1379 * If someone has wired this page while the object lock
1380 * was not held, then the thread that unwires is responsible
1381 * for freeing the page. Otherwise just free the page now.
1382 * The wire count of this unmapped page cannot change while
1383 * we have the page xbusy and the page's object wlocked.
1385 if (vm_page_remove(m))
1390 * vm_page_sleep_if_busy:
1392 * Sleep and release the object lock if the page is busied.
1393 * Returns TRUE if the thread slept.
1395 * The given page must be unlocked and object containing it must
1399 vm_page_sleep_if_busy(vm_page_t m, const char *wmesg)
1403 vm_page_lock_assert(m, MA_NOTOWNED);
1404 VM_OBJECT_ASSERT_WLOCKED(m->object);
1407 * The page-specific object must be cached because page
1408 * identity can change during the sleep, causing the
1409 * re-lock of a different object.
1410 * It is assumed that a reference to the object is already
1411 * held by the callers.
1414 if (_vm_page_busy_sleep(obj, m, m->pindex, wmesg, 0, true)) {
1415 VM_OBJECT_WLOCK(obj);
1422 * vm_page_sleep_if_xbusy:
1424 * Sleep and release the object lock if the page is xbusied.
1425 * Returns TRUE if the thread slept.
1427 * The given page must be unlocked and object containing it must
1431 vm_page_sleep_if_xbusy(vm_page_t m, const char *wmesg)
1435 vm_page_lock_assert(m, MA_NOTOWNED);
1436 VM_OBJECT_ASSERT_WLOCKED(m->object);
1439 * The page-specific object must be cached because page
1440 * identity can change during the sleep, causing the
1441 * re-lock of a different object.
1442 * It is assumed that a reference to the object is already
1443 * held by the callers.
1446 if (_vm_page_busy_sleep(obj, m, m->pindex, wmesg, VM_ALLOC_SBUSY,
1448 VM_OBJECT_WLOCK(obj);
1455 * vm_page_dirty_KBI: [ internal use only ]
1457 * Set all bits in the page's dirty field.
1459 * The object containing the specified page must be locked if the
1460 * call is made from the machine-independent layer.
1462 * See vm_page_clear_dirty_mask().
1464 * This function should only be called by vm_page_dirty().
1467 vm_page_dirty_KBI(vm_page_t m)
1470 /* Refer to this operation by its public name. */
1471 KASSERT(vm_page_all_valid(m), ("vm_page_dirty: page is invalid!"));
1472 m->dirty = VM_PAGE_BITS_ALL;
1476 * vm_page_insert: [ internal use only ]
1478 * Inserts the given mem entry into the object and object list.
1480 * The object must be locked.
1483 vm_page_insert(vm_page_t m, vm_object_t object, vm_pindex_t pindex)
1487 VM_OBJECT_ASSERT_WLOCKED(object);
1488 mpred = vm_radix_lookup_le(&object->rtree, pindex);
1489 return (vm_page_insert_after(m, object, pindex, mpred));
1493 * vm_page_insert_after:
1495 * Inserts the page "m" into the specified object at offset "pindex".
1497 * The page "mpred" must immediately precede the offset "pindex" within
1498 * the specified object.
1500 * The object must be locked.
1503 vm_page_insert_after(vm_page_t m, vm_object_t object, vm_pindex_t pindex,
1508 VM_OBJECT_ASSERT_WLOCKED(object);
1509 KASSERT(m->object == NULL,
1510 ("vm_page_insert_after: page already inserted"));
1511 if (mpred != NULL) {
1512 KASSERT(mpred->object == object,
1513 ("vm_page_insert_after: object doesn't contain mpred"));
1514 KASSERT(mpred->pindex < pindex,
1515 ("vm_page_insert_after: mpred doesn't precede pindex"));
1516 msucc = TAILQ_NEXT(mpred, listq);
1518 msucc = TAILQ_FIRST(&object->memq);
1520 KASSERT(msucc->pindex > pindex,
1521 ("vm_page_insert_after: msucc doesn't succeed pindex"));
1524 * Record the object/offset pair in this page.
1528 m->ref_count |= VPRC_OBJREF;
1531 * Now link into the object's ordered list of backed pages.
1533 if (vm_radix_insert(&object->rtree, m)) {
1536 m->ref_count &= ~VPRC_OBJREF;
1539 vm_page_insert_radixdone(m, object, mpred);
1544 * vm_page_insert_radixdone:
1546 * Complete page "m" insertion into the specified object after the
1547 * radix trie hooking.
1549 * The page "mpred" must precede the offset "m->pindex" within the
1552 * The object must be locked.
1555 vm_page_insert_radixdone(vm_page_t m, vm_object_t object, vm_page_t mpred)
1558 VM_OBJECT_ASSERT_WLOCKED(object);
1559 KASSERT(object != NULL && m->object == object,
1560 ("vm_page_insert_radixdone: page %p has inconsistent object", m));
1561 KASSERT((m->ref_count & VPRC_OBJREF) != 0,
1562 ("vm_page_insert_radixdone: page %p is missing object ref", m));
1563 if (mpred != NULL) {
1564 KASSERT(mpred->object == object,
1565 ("vm_page_insert_radixdone: object doesn't contain mpred"));
1566 KASSERT(mpred->pindex < m->pindex,
1567 ("vm_page_insert_radixdone: mpred doesn't precede pindex"));
1571 TAILQ_INSERT_AFTER(&object->memq, mpred, m, listq);
1573 TAILQ_INSERT_HEAD(&object->memq, m, listq);
1576 * Show that the object has one more resident page.
1578 object->resident_page_count++;
1581 * Hold the vnode until the last page is released.
1583 if (object->resident_page_count == 1 && object->type == OBJT_VNODE)
1584 vhold(object->handle);
1587 * Since we are inserting a new and possibly dirty page,
1588 * update the object's generation count.
1590 if (pmap_page_is_write_mapped(m))
1591 vm_object_set_writeable_dirty(object);
1595 * Do the work to remove a page from its object. The caller is responsible for
1596 * updating the page's fields to reflect this removal.
1599 vm_page_object_remove(vm_page_t m)
1604 vm_page_assert_xbusied(m);
1606 VM_OBJECT_ASSERT_WLOCKED(object);
1607 KASSERT((m->ref_count & VPRC_OBJREF) != 0,
1608 ("page %p is missing its object ref", m));
1610 /* Deferred free of swap space. */
1611 if ((m->a.flags & PGA_SWAP_FREE) != 0)
1612 vm_pager_page_unswapped(m);
1615 mrem = vm_radix_remove(&object->rtree, m->pindex);
1616 KASSERT(mrem == m, ("removed page %p, expected page %p", mrem, m));
1619 * Now remove from the object's list of backed pages.
1621 TAILQ_REMOVE(&object->memq, m, listq);
1624 * And show that the object has one fewer resident page.
1626 object->resident_page_count--;
1629 * The vnode may now be recycled.
1631 if (object->resident_page_count == 0 && object->type == OBJT_VNODE)
1632 vdrop(object->handle);
1638 * Removes the specified page from its containing object, but does not
1639 * invalidate any backing storage. Returns true if the object's reference
1640 * was the last reference to the page, and false otherwise.
1642 * The object must be locked and the page must be exclusively busied.
1643 * The exclusive busy will be released on return. If this is not the
1644 * final ref and the caller does not hold a wire reference it may not
1645 * continue to access the page.
1648 vm_page_remove(vm_page_t m)
1652 dropped = vm_page_remove_xbusy(m);
1659 * vm_page_remove_xbusy
1661 * Removes the page but leaves the xbusy held. Returns true if this
1662 * removed the final ref and false otherwise.
1665 vm_page_remove_xbusy(vm_page_t m)
1668 vm_page_object_remove(m);
1669 return (vm_page_drop(m, VPRC_OBJREF) == VPRC_OBJREF);
1675 * Returns the page associated with the object/offset
1676 * pair specified; if none is found, NULL is returned.
1678 * The object must be locked.
1681 vm_page_lookup(vm_object_t object, vm_pindex_t pindex)
1684 VM_OBJECT_ASSERT_LOCKED(object);
1685 return (vm_radix_lookup(&object->rtree, pindex));
1691 * Returns a page that must already have been busied by
1692 * the caller. Used for bogus page replacement.
1695 vm_page_relookup(vm_object_t object, vm_pindex_t pindex)
1699 m = vm_radix_lookup_unlocked(&object->rtree, pindex);
1700 KASSERT(m != NULL && (vm_page_busied(m) || vm_page_wired(m)) &&
1701 m->object == object && m->pindex == pindex,
1702 ("vm_page_relookup: Invalid page %p", m));
1707 * This should only be used by lockless functions for releasing transient
1708 * incorrect acquires. The page may have been freed after we acquired a
1709 * busy lock. In this case busy_lock == VPB_FREED and we have nothing
1713 vm_page_busy_release(vm_page_t m)
1717 x = atomic_load_int(&m->busy_lock);
1721 if ((x & VPB_BIT_SHARED) != 0 && VPB_SHARERS(x) > 1) {
1722 if (atomic_fcmpset_int(&m->busy_lock, &x,
1723 x - VPB_ONE_SHARER))
1727 KASSERT((x & VPB_BIT_SHARED) != 0 ||
1728 (x & ~VPB_BIT_WAITERS) == VPB_CURTHREAD_EXCLUSIVE,
1729 ("vm_page_busy_release: %p xbusy not owned.", m));
1730 if (!atomic_fcmpset_rel_int(&m->busy_lock, &x, VPB_UNBUSIED))
1732 if ((x & VPB_BIT_WAITERS) != 0)
1739 * vm_page_find_least:
1741 * Returns the page associated with the object with least pindex
1742 * greater than or equal to the parameter pindex, or NULL.
1744 * The object must be locked.
1747 vm_page_find_least(vm_object_t object, vm_pindex_t pindex)
1751 VM_OBJECT_ASSERT_LOCKED(object);
1752 if ((m = TAILQ_FIRST(&object->memq)) != NULL && m->pindex < pindex)
1753 m = vm_radix_lookup_ge(&object->rtree, pindex);
1758 * Returns the given page's successor (by pindex) within the object if it is
1759 * resident; if none is found, NULL is returned.
1761 * The object must be locked.
1764 vm_page_next(vm_page_t m)
1768 VM_OBJECT_ASSERT_LOCKED(m->object);
1769 if ((next = TAILQ_NEXT(m, listq)) != NULL) {
1770 MPASS(next->object == m->object);
1771 if (next->pindex != m->pindex + 1)
1778 * Returns the given page's predecessor (by pindex) within the object if it is
1779 * resident; if none is found, NULL is returned.
1781 * The object must be locked.
1784 vm_page_prev(vm_page_t m)
1788 VM_OBJECT_ASSERT_LOCKED(m->object);
1789 if ((prev = TAILQ_PREV(m, pglist, listq)) != NULL) {
1790 MPASS(prev->object == m->object);
1791 if (prev->pindex != m->pindex - 1)
1798 * Uses the page mnew as a replacement for an existing page at index
1799 * pindex which must be already present in the object.
1801 * Both pages must be exclusively busied on enter. The old page is
1804 * A return value of true means mold is now free. If this is not the
1805 * final ref and the caller does not hold a wire reference it may not
1806 * continue to access the page.
1809 vm_page_replace_hold(vm_page_t mnew, vm_object_t object, vm_pindex_t pindex,
1815 VM_OBJECT_ASSERT_WLOCKED(object);
1816 vm_page_assert_xbusied(mold);
1817 KASSERT(mnew->object == NULL && (mnew->ref_count & VPRC_OBJREF) == 0,
1818 ("vm_page_replace: page %p already in object", mnew));
1821 * This function mostly follows vm_page_insert() and
1822 * vm_page_remove() without the radix, object count and vnode
1823 * dance. Double check such functions for more comments.
1826 mnew->object = object;
1827 mnew->pindex = pindex;
1828 atomic_set_int(&mnew->ref_count, VPRC_OBJREF);
1829 mret = vm_radix_replace(&object->rtree, mnew);
1830 KASSERT(mret == mold,
1831 ("invalid page replacement, mold=%p, mret=%p", mold, mret));
1832 KASSERT((mold->oflags & VPO_UNMANAGED) ==
1833 (mnew->oflags & VPO_UNMANAGED),
1834 ("vm_page_replace: mismatched VPO_UNMANAGED"));
1836 /* Keep the resident page list in sorted order. */
1837 TAILQ_INSERT_AFTER(&object->memq, mold, mnew, listq);
1838 TAILQ_REMOVE(&object->memq, mold, listq);
1839 mold->object = NULL;
1842 * The object's resident_page_count does not change because we have
1843 * swapped one page for another, but the generation count should
1844 * change if the page is dirty.
1846 if (pmap_page_is_write_mapped(mnew))
1847 vm_object_set_writeable_dirty(object);
1848 dropped = vm_page_drop(mold, VPRC_OBJREF) == VPRC_OBJREF;
1849 vm_page_xunbusy(mold);
1855 vm_page_replace(vm_page_t mnew, vm_object_t object, vm_pindex_t pindex,
1859 vm_page_assert_xbusied(mnew);
1861 if (vm_page_replace_hold(mnew, object, pindex, mold))
1868 * Move the given memory entry from its
1869 * current object to the specified target object/offset.
1871 * Note: swap associated with the page must be invalidated by the move. We
1872 * have to do this for several reasons: (1) we aren't freeing the
1873 * page, (2) we are dirtying the page, (3) the VM system is probably
1874 * moving the page from object A to B, and will then later move
1875 * the backing store from A to B and we can't have a conflict.
1877 * Note: we *always* dirty the page. It is necessary both for the
1878 * fact that we moved it, and because we may be invalidating
1881 * The objects must be locked.
1884 vm_page_rename(vm_page_t m, vm_object_t new_object, vm_pindex_t new_pindex)
1889 VM_OBJECT_ASSERT_WLOCKED(new_object);
1891 KASSERT(m->ref_count != 0, ("vm_page_rename: page %p has no refs", m));
1892 mpred = vm_radix_lookup_le(&new_object->rtree, new_pindex);
1893 KASSERT(mpred == NULL || mpred->pindex != new_pindex,
1894 ("vm_page_rename: pindex already renamed"));
1897 * Create a custom version of vm_page_insert() which does not depend
1898 * by m_prev and can cheat on the implementation aspects of the
1902 m->pindex = new_pindex;
1903 if (vm_radix_insert(&new_object->rtree, m)) {
1909 * The operation cannot fail anymore. The removal must happen before
1910 * the listq iterator is tainted.
1913 vm_page_object_remove(m);
1915 /* Return back to the new pindex to complete vm_page_insert(). */
1916 m->pindex = new_pindex;
1917 m->object = new_object;
1919 vm_page_insert_radixdone(m, new_object, mpred);
1927 * Allocate and return a page that is associated with the specified
1928 * object and offset pair. By default, this page is exclusive busied.
1930 * The caller must always specify an allocation class.
1932 * allocation classes:
1933 * VM_ALLOC_NORMAL normal process request
1934 * VM_ALLOC_SYSTEM system *really* needs a page
1935 * VM_ALLOC_INTERRUPT interrupt time request
1937 * optional allocation flags:
1938 * VM_ALLOC_COUNT(number) the number of additional pages that the caller
1939 * intends to allocate
1940 * VM_ALLOC_NOBUSY do not exclusive busy the page
1941 * VM_ALLOC_NODUMP do not include the page in a kernel core dump
1942 * VM_ALLOC_NOOBJ page is not associated with an object and
1943 * should not be exclusive busy
1944 * VM_ALLOC_SBUSY shared busy the allocated page
1945 * VM_ALLOC_WIRED wire the allocated page
1946 * VM_ALLOC_ZERO prefer a zeroed page
1949 vm_page_alloc(vm_object_t object, vm_pindex_t pindex, int req)
1952 return (vm_page_alloc_after(object, pindex, req, object != NULL ?
1953 vm_radix_lookup_le(&object->rtree, pindex) : NULL));
1957 vm_page_alloc_domain(vm_object_t object, vm_pindex_t pindex, int domain,
1961 return (vm_page_alloc_domain_after(object, pindex, domain, req,
1962 object != NULL ? vm_radix_lookup_le(&object->rtree, pindex) :
1967 * Allocate a page in the specified object with the given page index. To
1968 * optimize insertion of the page into the object, the caller must also specifiy
1969 * the resident page in the object with largest index smaller than the given
1970 * page index, or NULL if no such page exists.
1973 vm_page_alloc_after(vm_object_t object, vm_pindex_t pindex,
1974 int req, vm_page_t mpred)
1976 struct vm_domainset_iter di;
1980 vm_domainset_iter_page_init(&di, object, pindex, &domain, &req);
1982 m = vm_page_alloc_domain_after(object, pindex, domain, req,
1986 } while (vm_domainset_iter_page(&di, object, &domain) == 0);
1992 * Returns true if the number of free pages exceeds the minimum
1993 * for the request class and false otherwise.
1996 _vm_domain_allocate(struct vm_domain *vmd, int req_class, int npages)
1998 u_int limit, old, new;
2000 if (req_class == VM_ALLOC_INTERRUPT)
2002 else if (req_class == VM_ALLOC_SYSTEM)
2003 limit = vmd->vmd_interrupt_free_min;
2005 limit = vmd->vmd_free_reserved;
2008 * Attempt to reserve the pages. Fail if we're below the limit.
2011 old = vmd->vmd_free_count;
2016 } while (atomic_fcmpset_int(&vmd->vmd_free_count, &old, new) == 0);
2018 /* Wake the page daemon if we've crossed the threshold. */
2019 if (vm_paging_needed(vmd, new) && !vm_paging_needed(vmd, old))
2020 pagedaemon_wakeup(vmd->vmd_domain);
2022 /* Only update bitsets on transitions. */
2023 if ((old >= vmd->vmd_free_min && new < vmd->vmd_free_min) ||
2024 (old >= vmd->vmd_free_severe && new < vmd->vmd_free_severe))
2031 vm_domain_allocate(struct vm_domain *vmd, int req, int npages)
2036 * The page daemon is allowed to dig deeper into the free page list.
2038 req_class = req & VM_ALLOC_CLASS_MASK;
2039 if (curproc == pageproc && req_class != VM_ALLOC_INTERRUPT)
2040 req_class = VM_ALLOC_SYSTEM;
2041 return (_vm_domain_allocate(vmd, req_class, npages));
2045 vm_page_alloc_domain_after(vm_object_t object, vm_pindex_t pindex, int domain,
2046 int req, vm_page_t mpred)
2048 struct vm_domain *vmd;
2052 KASSERT((object != NULL) == ((req & VM_ALLOC_NOOBJ) == 0) &&
2053 (object != NULL || (req & VM_ALLOC_SBUSY) == 0) &&
2054 ((req & (VM_ALLOC_NOBUSY | VM_ALLOC_SBUSY)) !=
2055 (VM_ALLOC_NOBUSY | VM_ALLOC_SBUSY)),
2056 ("inconsistent object(%p)/req(%x)", object, req));
2057 KASSERT(object == NULL || (req & VM_ALLOC_WAITOK) == 0,
2058 ("Can't sleep and retry object insertion."));
2059 KASSERT(mpred == NULL || mpred->pindex < pindex,
2060 ("mpred %p doesn't precede pindex 0x%jx", mpred,
2061 (uintmax_t)pindex));
2063 VM_OBJECT_ASSERT_WLOCKED(object);
2067 pool = object != NULL ? VM_FREEPOOL_DEFAULT : VM_FREEPOOL_DIRECT;
2069 #if VM_NRESERVLEVEL > 0
2071 * Can we allocate the page from a reservation?
2073 if (vm_object_reserv(object) &&
2074 (m = vm_reserv_alloc_page(object, pindex, domain, req, mpred)) !=
2079 vmd = VM_DOMAIN(domain);
2080 if (vmd->vmd_pgcache[pool].zone != NULL) {
2081 m = uma_zalloc(vmd->vmd_pgcache[pool].zone, M_NOWAIT | M_NOVM);
2083 flags |= PG_PCPU_CACHE;
2087 if (vm_domain_allocate(vmd, req, 1)) {
2089 * If not, allocate it from the free page queues.
2091 vm_domain_free_lock(vmd);
2092 m = vm_phys_alloc_pages(domain, pool, 0);
2093 vm_domain_free_unlock(vmd);
2095 vm_domain_freecnt_inc(vmd, 1);
2096 #if VM_NRESERVLEVEL > 0
2097 if (vm_reserv_reclaim_inactive(domain))
2104 * Not allocatable, give up.
2106 if (vm_domain_alloc_fail(vmd, object, req))
2112 * At this point we had better have found a good page.
2116 vm_page_alloc_check(m);
2119 * Initialize the page. Only the PG_ZERO flag is inherited.
2121 if ((req & VM_ALLOC_ZERO) != 0)
2122 flags |= (m->flags & PG_ZERO);
2123 if ((req & VM_ALLOC_NODUMP) != 0)
2127 m->oflags = object == NULL || (object->flags & OBJ_UNMANAGED) != 0 ?
2129 if ((req & (VM_ALLOC_NOBUSY | VM_ALLOC_NOOBJ | VM_ALLOC_SBUSY)) == 0)
2130 m->busy_lock = VPB_CURTHREAD_EXCLUSIVE;
2131 else if ((req & VM_ALLOC_SBUSY) != 0)
2132 m->busy_lock = VPB_SHARERS_WORD(1);
2134 m->busy_lock = VPB_UNBUSIED;
2135 if (req & VM_ALLOC_WIRED) {
2141 if (object != NULL) {
2142 if (vm_page_insert_after(m, object, pindex, mpred)) {
2143 if (req & VM_ALLOC_WIRED) {
2147 KASSERT(m->object == NULL, ("page %p has object", m));
2148 m->oflags = VPO_UNMANAGED;
2149 m->busy_lock = VPB_UNBUSIED;
2150 /* Don't change PG_ZERO. */
2151 vm_page_free_toq(m);
2152 if (req & VM_ALLOC_WAITFAIL) {
2153 VM_OBJECT_WUNLOCK(object);
2155 VM_OBJECT_WLOCK(object);
2160 /* Ignore device objects; the pager sets "memattr" for them. */
2161 if (object->memattr != VM_MEMATTR_DEFAULT &&
2162 (object->flags & OBJ_FICTITIOUS) == 0)
2163 pmap_page_set_memattr(m, object->memattr);
2171 * vm_page_alloc_contig:
2173 * Allocate a contiguous set of physical pages of the given size "npages"
2174 * from the free lists. All of the physical pages must be at or above
2175 * the given physical address "low" and below the given physical address
2176 * "high". The given value "alignment" determines the alignment of the
2177 * first physical page in the set. If the given value "boundary" is
2178 * non-zero, then the set of physical pages cannot cross any physical
2179 * address boundary that is a multiple of that value. Both "alignment"
2180 * and "boundary" must be a power of two.
2182 * If the specified memory attribute, "memattr", is VM_MEMATTR_DEFAULT,
2183 * then the memory attribute setting for the physical pages is configured
2184 * to the object's memory attribute setting. Otherwise, the memory
2185 * attribute setting for the physical pages is configured to "memattr",
2186 * overriding the object's memory attribute setting. However, if the
2187 * object's memory attribute setting is not VM_MEMATTR_DEFAULT, then the
2188 * memory attribute setting for the physical pages cannot be configured
2189 * to VM_MEMATTR_DEFAULT.
2191 * The specified object may not contain fictitious pages.
2193 * The caller must always specify an allocation class.
2195 * allocation classes:
2196 * VM_ALLOC_NORMAL normal process request
2197 * VM_ALLOC_SYSTEM system *really* needs a page
2198 * VM_ALLOC_INTERRUPT interrupt time request
2200 * optional allocation flags:
2201 * VM_ALLOC_NOBUSY do not exclusive busy the page
2202 * VM_ALLOC_NODUMP do not include the page in a kernel core dump
2203 * VM_ALLOC_NOOBJ page is not associated with an object and
2204 * should not be exclusive busy
2205 * VM_ALLOC_SBUSY shared busy the allocated page
2206 * VM_ALLOC_WIRED wire the allocated page
2207 * VM_ALLOC_ZERO prefer a zeroed page
2210 vm_page_alloc_contig(vm_object_t object, vm_pindex_t pindex, int req,
2211 u_long npages, vm_paddr_t low, vm_paddr_t high, u_long alignment,
2212 vm_paddr_t boundary, vm_memattr_t memattr)
2214 struct vm_domainset_iter di;
2218 vm_domainset_iter_page_init(&di, object, pindex, &domain, &req);
2220 m = vm_page_alloc_contig_domain(object, pindex, domain, req,
2221 npages, low, high, alignment, boundary, memattr);
2224 } while (vm_domainset_iter_page(&di, object, &domain) == 0);
2230 vm_page_alloc_contig_domain(vm_object_t object, vm_pindex_t pindex, int domain,
2231 int req, u_long npages, vm_paddr_t low, vm_paddr_t high, u_long alignment,
2232 vm_paddr_t boundary, vm_memattr_t memattr)
2234 struct vm_domain *vmd;
2235 vm_page_t m, m_ret, mpred;
2236 u_int busy_lock, flags, oflags;
2238 mpred = NULL; /* XXX: pacify gcc */
2239 KASSERT((object != NULL) == ((req & VM_ALLOC_NOOBJ) == 0) &&
2240 (object != NULL || (req & VM_ALLOC_SBUSY) == 0) &&
2241 ((req & (VM_ALLOC_NOBUSY | VM_ALLOC_SBUSY)) !=
2242 (VM_ALLOC_NOBUSY | VM_ALLOC_SBUSY)),
2243 ("vm_page_alloc_contig: inconsistent object(%p)/req(%x)", object,
2245 KASSERT(object == NULL || (req & VM_ALLOC_WAITOK) == 0,
2246 ("Can't sleep and retry object insertion."));
2247 if (object != NULL) {
2248 VM_OBJECT_ASSERT_WLOCKED(object);
2249 KASSERT((object->flags & OBJ_FICTITIOUS) == 0,
2250 ("vm_page_alloc_contig: object %p has fictitious pages",
2253 KASSERT(npages > 0, ("vm_page_alloc_contig: npages is zero"));
2255 if (object != NULL) {
2256 mpred = vm_radix_lookup_le(&object->rtree, pindex);
2257 KASSERT(mpred == NULL || mpred->pindex != pindex,
2258 ("vm_page_alloc_contig: pindex already allocated"));
2262 * Can we allocate the pages without the number of free pages falling
2263 * below the lower bound for the allocation class?
2267 #if VM_NRESERVLEVEL > 0
2269 * Can we allocate the pages from a reservation?
2271 if (vm_object_reserv(object) &&
2272 (m_ret = vm_reserv_alloc_contig(object, pindex, domain, req,
2273 mpred, npages, low, high, alignment, boundary)) != NULL) {
2277 vmd = VM_DOMAIN(domain);
2278 if (vm_domain_allocate(vmd, req, npages)) {
2280 * allocate them from the free page queues.
2282 vm_domain_free_lock(vmd);
2283 m_ret = vm_phys_alloc_contig(domain, npages, low, high,
2284 alignment, boundary);
2285 vm_domain_free_unlock(vmd);
2286 if (m_ret == NULL) {
2287 vm_domain_freecnt_inc(vmd, npages);
2288 #if VM_NRESERVLEVEL > 0
2289 if (vm_reserv_reclaim_contig(domain, npages, low,
2290 high, alignment, boundary))
2295 if (m_ret == NULL) {
2296 if (vm_domain_alloc_fail(vmd, object, req))
2300 #if VM_NRESERVLEVEL > 0
2303 for (m = m_ret; m < &m_ret[npages]; m++) {
2305 vm_page_alloc_check(m);
2309 * Initialize the pages. Only the PG_ZERO flag is inherited.
2312 if ((req & VM_ALLOC_ZERO) != 0)
2314 if ((req & VM_ALLOC_NODUMP) != 0)
2316 oflags = object == NULL || (object->flags & OBJ_UNMANAGED) != 0 ?
2318 if ((req & (VM_ALLOC_NOBUSY | VM_ALLOC_NOOBJ | VM_ALLOC_SBUSY)) == 0)
2319 busy_lock = VPB_CURTHREAD_EXCLUSIVE;
2320 else if ((req & VM_ALLOC_SBUSY) != 0)
2321 busy_lock = VPB_SHARERS_WORD(1);
2323 busy_lock = VPB_UNBUSIED;
2324 if ((req & VM_ALLOC_WIRED) != 0)
2325 vm_wire_add(npages);
2326 if (object != NULL) {
2327 if (object->memattr != VM_MEMATTR_DEFAULT &&
2328 memattr == VM_MEMATTR_DEFAULT)
2329 memattr = object->memattr;
2331 for (m = m_ret; m < &m_ret[npages]; m++) {
2333 m->flags = (m->flags | PG_NODUMP) & flags;
2334 m->busy_lock = busy_lock;
2335 if ((req & VM_ALLOC_WIRED) != 0)
2339 if (object != NULL) {
2340 if (vm_page_insert_after(m, object, pindex, mpred)) {
2341 if ((req & VM_ALLOC_WIRED) != 0)
2342 vm_wire_sub(npages);
2343 KASSERT(m->object == NULL,
2344 ("page %p has object", m));
2346 for (m = m_ret; m < &m_ret[npages]; m++) {
2348 (req & VM_ALLOC_WIRED) != 0)
2350 m->oflags = VPO_UNMANAGED;
2351 m->busy_lock = VPB_UNBUSIED;
2352 /* Don't change PG_ZERO. */
2353 vm_page_free_toq(m);
2355 if (req & VM_ALLOC_WAITFAIL) {
2356 VM_OBJECT_WUNLOCK(object);
2358 VM_OBJECT_WLOCK(object);
2365 if (memattr != VM_MEMATTR_DEFAULT)
2366 pmap_page_set_memattr(m, memattr);
2373 * Check a page that has been freshly dequeued from a freelist.
2376 vm_page_alloc_check(vm_page_t m)
2379 KASSERT(m->object == NULL, ("page %p has object", m));
2380 KASSERT(m->a.queue == PQ_NONE &&
2381 (m->a.flags & PGA_QUEUE_STATE_MASK) == 0,
2382 ("page %p has unexpected queue %d, flags %#x",
2383 m, m->a.queue, (m->a.flags & PGA_QUEUE_STATE_MASK)));
2384 KASSERT(m->ref_count == 0, ("page %p has references", m));
2385 KASSERT(vm_page_busy_freed(m), ("page %p is not freed", m));
2386 KASSERT(m->dirty == 0, ("page %p is dirty", m));
2387 KASSERT(pmap_page_get_memattr(m) == VM_MEMATTR_DEFAULT,
2388 ("page %p has unexpected memattr %d",
2389 m, pmap_page_get_memattr(m)));
2390 KASSERT(m->valid == 0, ("free page %p is valid", m));
2394 * vm_page_alloc_freelist:
2396 * Allocate a physical page from the specified free page list.
2398 * The caller must always specify an allocation class.
2400 * allocation classes:
2401 * VM_ALLOC_NORMAL normal process request
2402 * VM_ALLOC_SYSTEM system *really* needs a page
2403 * VM_ALLOC_INTERRUPT interrupt time request
2405 * optional allocation flags:
2406 * VM_ALLOC_COUNT(number) the number of additional pages that the caller
2407 * intends to allocate
2408 * VM_ALLOC_WIRED wire the allocated page
2409 * VM_ALLOC_ZERO prefer a zeroed page
2412 vm_page_alloc_freelist(int freelist, int req)
2414 struct vm_domainset_iter di;
2418 vm_domainset_iter_page_init(&di, NULL, 0, &domain, &req);
2420 m = vm_page_alloc_freelist_domain(domain, freelist, req);
2423 } while (vm_domainset_iter_page(&di, NULL, &domain) == 0);
2429 vm_page_alloc_freelist_domain(int domain, int freelist, int req)
2431 struct vm_domain *vmd;
2436 vmd = VM_DOMAIN(domain);
2438 if (vm_domain_allocate(vmd, req, 1)) {
2439 vm_domain_free_lock(vmd);
2440 m = vm_phys_alloc_freelist_pages(domain, freelist,
2441 VM_FREEPOOL_DIRECT, 0);
2442 vm_domain_free_unlock(vmd);
2444 vm_domain_freecnt_inc(vmd, 1);
2447 if (vm_domain_alloc_fail(vmd, NULL, req))
2452 vm_page_alloc_check(m);
2455 * Initialize the page. Only the PG_ZERO flag is inherited.
2459 if ((req & VM_ALLOC_ZERO) != 0)
2462 if ((req & VM_ALLOC_WIRED) != 0) {
2466 /* Unmanaged pages don't use "act_count". */
2467 m->oflags = VPO_UNMANAGED;
2472 vm_page_zone_import(void *arg, void **store, int cnt, int domain, int flags)
2474 struct vm_domain *vmd;
2475 struct vm_pgcache *pgcache;
2479 vmd = VM_DOMAIN(pgcache->domain);
2482 * The page daemon should avoid creating extra memory pressure since its
2483 * main purpose is to replenish the store of free pages.
2485 if (vmd->vmd_severeset || curproc == pageproc ||
2486 !_vm_domain_allocate(vmd, VM_ALLOC_NORMAL, cnt))
2488 domain = vmd->vmd_domain;
2489 vm_domain_free_lock(vmd);
2490 i = vm_phys_alloc_npages(domain, pgcache->pool, cnt,
2491 (vm_page_t *)store);
2492 vm_domain_free_unlock(vmd);
2494 vm_domain_freecnt_inc(vmd, cnt - i);
2500 vm_page_zone_release(void *arg, void **store, int cnt)
2502 struct vm_domain *vmd;
2503 struct vm_pgcache *pgcache;
2508 vmd = VM_DOMAIN(pgcache->domain);
2509 vm_domain_free_lock(vmd);
2510 for (i = 0; i < cnt; i++) {
2511 m = (vm_page_t)store[i];
2512 vm_phys_free_pages(m, 0);
2514 vm_domain_free_unlock(vmd);
2515 vm_domain_freecnt_inc(vmd, cnt);
2518 #define VPSC_ANY 0 /* No restrictions. */
2519 #define VPSC_NORESERV 1 /* Skip reservations; implies VPSC_NOSUPER. */
2520 #define VPSC_NOSUPER 2 /* Skip superpages. */
2523 * vm_page_scan_contig:
2525 * Scan vm_page_array[] between the specified entries "m_start" and
2526 * "m_end" for a run of contiguous physical pages that satisfy the
2527 * specified conditions, and return the lowest page in the run. The
2528 * specified "alignment" determines the alignment of the lowest physical
2529 * page in the run. If the specified "boundary" is non-zero, then the
2530 * run of physical pages cannot span a physical address that is a
2531 * multiple of "boundary".
2533 * "m_end" is never dereferenced, so it need not point to a vm_page
2534 * structure within vm_page_array[].
2536 * "npages" must be greater than zero. "m_start" and "m_end" must not
2537 * span a hole (or discontiguity) in the physical address space. Both
2538 * "alignment" and "boundary" must be a power of two.
2541 vm_page_scan_contig(u_long npages, vm_page_t m_start, vm_page_t m_end,
2542 u_long alignment, vm_paddr_t boundary, int options)
2547 #if VM_NRESERVLEVEL > 0
2550 int m_inc, order, run_ext, run_len;
2552 KASSERT(npages > 0, ("npages is 0"));
2553 KASSERT(powerof2(alignment), ("alignment is not a power of 2"));
2554 KASSERT(powerof2(boundary), ("boundary is not a power of 2"));
2557 for (m = m_start; m < m_end && run_len < npages; m += m_inc) {
2558 KASSERT((m->flags & PG_MARKER) == 0,
2559 ("page %p is PG_MARKER", m));
2560 KASSERT((m->flags & PG_FICTITIOUS) == 0 || m->ref_count >= 1,
2561 ("fictitious page %p has invalid ref count", m));
2564 * If the current page would be the start of a run, check its
2565 * physical address against the end, alignment, and boundary
2566 * conditions. If it doesn't satisfy these conditions, either
2567 * terminate the scan or advance to the next page that
2568 * satisfies the failed condition.
2571 KASSERT(m_run == NULL, ("m_run != NULL"));
2572 if (m + npages > m_end)
2574 pa = VM_PAGE_TO_PHYS(m);
2575 if ((pa & (alignment - 1)) != 0) {
2576 m_inc = atop(roundup2(pa, alignment) - pa);
2579 if (rounddown2(pa ^ (pa + ptoa(npages) - 1),
2581 m_inc = atop(roundup2(pa, boundary) - pa);
2585 KASSERT(m_run != NULL, ("m_run == NULL"));
2589 if (vm_page_wired(m))
2591 #if VM_NRESERVLEVEL > 0
2592 else if ((level = vm_reserv_level(m)) >= 0 &&
2593 (options & VPSC_NORESERV) != 0) {
2595 /* Advance to the end of the reservation. */
2596 pa = VM_PAGE_TO_PHYS(m);
2597 m_inc = atop(roundup2(pa + 1, vm_reserv_size(level)) -
2601 else if ((object = atomic_load_ptr(&m->object)) != NULL) {
2603 * The page is considered eligible for relocation if
2604 * and only if it could be laundered or reclaimed by
2607 VM_OBJECT_RLOCK(object);
2608 if (object != m->object) {
2609 VM_OBJECT_RUNLOCK(object);
2612 /* Don't care: PG_NODUMP, PG_ZERO. */
2613 if (object->type != OBJT_DEFAULT &&
2614 object->type != OBJT_SWAP &&
2615 object->type != OBJT_VNODE) {
2617 #if VM_NRESERVLEVEL > 0
2618 } else if ((options & VPSC_NOSUPER) != 0 &&
2619 (level = vm_reserv_level_iffullpop(m)) >= 0) {
2621 /* Advance to the end of the superpage. */
2622 pa = VM_PAGE_TO_PHYS(m);
2623 m_inc = atop(roundup2(pa + 1,
2624 vm_reserv_size(level)) - pa);
2626 } else if (object->memattr == VM_MEMATTR_DEFAULT &&
2627 vm_page_queue(m) != PQ_NONE && !vm_page_busied(m)) {
2629 * The page is allocated but eligible for
2630 * relocation. Extend the current run by one
2633 KASSERT(pmap_page_get_memattr(m) ==
2635 ("page %p has an unexpected memattr", m));
2636 KASSERT((m->oflags & (VPO_SWAPINPROG |
2637 VPO_SWAPSLEEP | VPO_UNMANAGED)) == 0,
2638 ("page %p has unexpected oflags", m));
2639 /* Don't care: PGA_NOSYNC. */
2643 VM_OBJECT_RUNLOCK(object);
2644 #if VM_NRESERVLEVEL > 0
2645 } else if (level >= 0) {
2647 * The page is reserved but not yet allocated. In
2648 * other words, it is still free. Extend the current
2653 } else if ((order = m->order) < VM_NFREEORDER) {
2655 * The page is enqueued in the physical memory
2656 * allocator's free page queues. Moreover, it is the
2657 * first page in a power-of-two-sized run of
2658 * contiguous free pages. Add these pages to the end
2659 * of the current run, and jump ahead.
2661 run_ext = 1 << order;
2665 * Skip the page for one of the following reasons: (1)
2666 * It is enqueued in the physical memory allocator's
2667 * free page queues. However, it is not the first
2668 * page in a run of contiguous free pages. (This case
2669 * rarely occurs because the scan is performed in
2670 * ascending order.) (2) It is not reserved, and it is
2671 * transitioning from free to allocated. (Conversely,
2672 * the transition from allocated to free for managed
2673 * pages is blocked by the page lock.) (3) It is
2674 * allocated but not contained by an object and not
2675 * wired, e.g., allocated by Xen's balloon driver.
2681 * Extend or reset the current run of pages.
2694 if (run_len >= npages)
2700 * vm_page_reclaim_run:
2702 * Try to relocate each of the allocated virtual pages within the
2703 * specified run of physical pages to a new physical address. Free the
2704 * physical pages underlying the relocated virtual pages. A virtual page
2705 * is relocatable if and only if it could be laundered or reclaimed by
2706 * the page daemon. Whenever possible, a virtual page is relocated to a
2707 * physical address above "high".
2709 * Returns 0 if every physical page within the run was already free or
2710 * just freed by a successful relocation. Otherwise, returns a non-zero
2711 * value indicating why the last attempt to relocate a virtual page was
2714 * "req_class" must be an allocation class.
2717 vm_page_reclaim_run(int req_class, int domain, u_long npages, vm_page_t m_run,
2720 struct vm_domain *vmd;
2721 struct spglist free;
2724 vm_page_t m, m_end, m_new;
2725 int error, order, req;
2727 KASSERT((req_class & VM_ALLOC_CLASS_MASK) == req_class,
2728 ("req_class is not an allocation class"));
2732 m_end = m_run + npages;
2733 for (; error == 0 && m < m_end; m++) {
2734 KASSERT((m->flags & (PG_FICTITIOUS | PG_MARKER)) == 0,
2735 ("page %p is PG_FICTITIOUS or PG_MARKER", m));
2738 * Racily check for wirings. Races are handled once the object
2739 * lock is held and the page is unmapped.
2741 if (vm_page_wired(m))
2743 else if ((object = atomic_load_ptr(&m->object)) != NULL) {
2745 * The page is relocated if and only if it could be
2746 * laundered or reclaimed by the page daemon.
2748 VM_OBJECT_WLOCK(object);
2749 /* Don't care: PG_NODUMP, PG_ZERO. */
2750 if (m->object != object ||
2751 (object->type != OBJT_DEFAULT &&
2752 object->type != OBJT_SWAP &&
2753 object->type != OBJT_VNODE))
2755 else if (object->memattr != VM_MEMATTR_DEFAULT)
2757 else if (vm_page_queue(m) != PQ_NONE &&
2758 vm_page_tryxbusy(m) != 0) {
2759 if (vm_page_wired(m)) {
2764 KASSERT(pmap_page_get_memattr(m) ==
2766 ("page %p has an unexpected memattr", m));
2767 KASSERT(m->oflags == 0,
2768 ("page %p has unexpected oflags", m));
2769 /* Don't care: PGA_NOSYNC. */
2770 if (!vm_page_none_valid(m)) {
2772 * First, try to allocate a new page
2773 * that is above "high". Failing
2774 * that, try to allocate a new page
2775 * that is below "m_run". Allocate
2776 * the new page between the end of
2777 * "m_run" and "high" only as a last
2780 req = req_class | VM_ALLOC_NOOBJ;
2781 if ((m->flags & PG_NODUMP) != 0)
2782 req |= VM_ALLOC_NODUMP;
2783 if (trunc_page(high) !=
2784 ~(vm_paddr_t)PAGE_MASK) {
2785 m_new = vm_page_alloc_contig(
2790 VM_MEMATTR_DEFAULT);
2793 if (m_new == NULL) {
2794 pa = VM_PAGE_TO_PHYS(m_run);
2795 m_new = vm_page_alloc_contig(
2797 0, pa - 1, PAGE_SIZE, 0,
2798 VM_MEMATTR_DEFAULT);
2800 if (m_new == NULL) {
2802 m_new = vm_page_alloc_contig(
2804 pa, high, PAGE_SIZE, 0,
2805 VM_MEMATTR_DEFAULT);
2807 if (m_new == NULL) {
2814 * Unmap the page and check for new
2815 * wirings that may have been acquired
2816 * through a pmap lookup.
2818 if (object->ref_count != 0 &&
2819 !vm_page_try_remove_all(m)) {
2821 vm_page_free(m_new);
2827 * Replace "m" with the new page. For
2828 * vm_page_replace(), "m" must be busy
2829 * and dequeued. Finally, change "m"
2830 * as if vm_page_free() was called.
2832 m_new->a.flags = m->a.flags &
2833 ~PGA_QUEUE_STATE_MASK;
2834 KASSERT(m_new->oflags == VPO_UNMANAGED,
2835 ("page %p is managed", m_new));
2837 pmap_copy_page(m, m_new);
2838 m_new->valid = m->valid;
2839 m_new->dirty = m->dirty;
2840 m->flags &= ~PG_ZERO;
2842 if (vm_page_replace_hold(m_new, object,
2844 vm_page_free_prep(m))
2845 SLIST_INSERT_HEAD(&free, m,
2849 * The new page must be deactivated
2850 * before the object is unlocked.
2852 vm_page_deactivate(m_new);
2854 m->flags &= ~PG_ZERO;
2856 if (vm_page_free_prep(m))
2857 SLIST_INSERT_HEAD(&free, m,
2859 KASSERT(m->dirty == 0,
2860 ("page %p is dirty", m));
2865 VM_OBJECT_WUNLOCK(object);
2867 MPASS(vm_phys_domain(m) == domain);
2868 vmd = VM_DOMAIN(domain);
2869 vm_domain_free_lock(vmd);
2871 if (order < VM_NFREEORDER) {
2873 * The page is enqueued in the physical memory
2874 * allocator's free page queues. Moreover, it
2875 * is the first page in a power-of-two-sized
2876 * run of contiguous free pages. Jump ahead
2877 * to the last page within that run, and
2878 * continue from there.
2880 m += (1 << order) - 1;
2882 #if VM_NRESERVLEVEL > 0
2883 else if (vm_reserv_is_page_free(m))
2886 vm_domain_free_unlock(vmd);
2887 if (order == VM_NFREEORDER)
2891 if ((m = SLIST_FIRST(&free)) != NULL) {
2894 vmd = VM_DOMAIN(domain);
2896 vm_domain_free_lock(vmd);
2898 MPASS(vm_phys_domain(m) == domain);
2899 SLIST_REMOVE_HEAD(&free, plinks.s.ss);
2900 vm_phys_free_pages(m, 0);
2902 } while ((m = SLIST_FIRST(&free)) != NULL);
2903 vm_domain_free_unlock(vmd);
2904 vm_domain_freecnt_inc(vmd, cnt);
2911 CTASSERT(powerof2(NRUNS));
2913 #define RUN_INDEX(count) ((count) & (NRUNS - 1))
2915 #define MIN_RECLAIM 8
2918 * vm_page_reclaim_contig:
2920 * Reclaim allocated, contiguous physical memory satisfying the specified
2921 * conditions by relocating the virtual pages using that physical memory.
2922 * Returns true if reclamation is successful and false otherwise. Since
2923 * relocation requires the allocation of physical pages, reclamation may
2924 * fail due to a shortage of free pages. When reclamation fails, callers
2925 * are expected to perform vm_wait() before retrying a failed allocation
2926 * operation, e.g., vm_page_alloc_contig().
2928 * The caller must always specify an allocation class through "req".
2930 * allocation classes:
2931 * VM_ALLOC_NORMAL normal process request
2932 * VM_ALLOC_SYSTEM system *really* needs a page
2933 * VM_ALLOC_INTERRUPT interrupt time request
2935 * The optional allocation flags are ignored.
2937 * "npages" must be greater than zero. Both "alignment" and "boundary"
2938 * must be a power of two.
2941 vm_page_reclaim_contig_domain(int domain, int req, u_long npages,
2942 vm_paddr_t low, vm_paddr_t high, u_long alignment, vm_paddr_t boundary)
2944 struct vm_domain *vmd;
2945 vm_paddr_t curr_low;
2946 vm_page_t m_run, m_runs[NRUNS];
2947 u_long count, reclaimed;
2948 int error, i, options, req_class;
2950 KASSERT(npages > 0, ("npages is 0"));
2951 KASSERT(powerof2(alignment), ("alignment is not a power of 2"));
2952 KASSERT(powerof2(boundary), ("boundary is not a power of 2"));
2953 req_class = req & VM_ALLOC_CLASS_MASK;
2956 * The page daemon is allowed to dig deeper into the free page list.
2958 if (curproc == pageproc && req_class != VM_ALLOC_INTERRUPT)
2959 req_class = VM_ALLOC_SYSTEM;
2962 * Return if the number of free pages cannot satisfy the requested
2965 vmd = VM_DOMAIN(domain);
2966 count = vmd->vmd_free_count;
2967 if (count < npages + vmd->vmd_free_reserved || (count < npages +
2968 vmd->vmd_interrupt_free_min && req_class == VM_ALLOC_SYSTEM) ||
2969 (count < npages && req_class == VM_ALLOC_INTERRUPT))
2973 * Scan up to three times, relaxing the restrictions ("options") on
2974 * the reclamation of reservations and superpages each time.
2976 for (options = VPSC_NORESERV;;) {
2978 * Find the highest runs that satisfy the given constraints
2979 * and restrictions, and record them in "m_runs".
2984 m_run = vm_phys_scan_contig(domain, npages, curr_low,
2985 high, alignment, boundary, options);
2988 curr_low = VM_PAGE_TO_PHYS(m_run) + ptoa(npages);
2989 m_runs[RUN_INDEX(count)] = m_run;
2994 * Reclaim the highest runs in LIFO (descending) order until
2995 * the number of reclaimed pages, "reclaimed", is at least
2996 * MIN_RECLAIM. Reset "reclaimed" each time because each
2997 * reclamation is idempotent, and runs will (likely) recur
2998 * from one scan to the next as restrictions are relaxed.
3001 for (i = 0; count > 0 && i < NRUNS; i++) {
3003 m_run = m_runs[RUN_INDEX(count)];
3004 error = vm_page_reclaim_run(req_class, domain, npages,
3007 reclaimed += npages;
3008 if (reclaimed >= MIN_RECLAIM)
3014 * Either relax the restrictions on the next scan or return if
3015 * the last scan had no restrictions.
3017 if (options == VPSC_NORESERV)
3018 options = VPSC_NOSUPER;
3019 else if (options == VPSC_NOSUPER)
3021 else if (options == VPSC_ANY)
3022 return (reclaimed != 0);
3027 vm_page_reclaim_contig(int req, u_long npages, vm_paddr_t low, vm_paddr_t high,
3028 u_long alignment, vm_paddr_t boundary)
3030 struct vm_domainset_iter di;
3034 vm_domainset_iter_page_init(&di, NULL, 0, &domain, &req);
3036 ret = vm_page_reclaim_contig_domain(domain, req, npages, low,
3037 high, alignment, boundary);
3040 } while (vm_domainset_iter_page(&di, NULL, &domain) == 0);
3046 * Set the domain in the appropriate page level domainset.
3049 vm_domain_set(struct vm_domain *vmd)
3052 mtx_lock(&vm_domainset_lock);
3053 if (!vmd->vmd_minset && vm_paging_min(vmd)) {
3054 vmd->vmd_minset = 1;
3055 DOMAINSET_SET(vmd->vmd_domain, &vm_min_domains);
3057 if (!vmd->vmd_severeset && vm_paging_severe(vmd)) {
3058 vmd->vmd_severeset = 1;
3059 DOMAINSET_SET(vmd->vmd_domain, &vm_severe_domains);
3061 mtx_unlock(&vm_domainset_lock);
3065 * Clear the domain from the appropriate page level domainset.
3068 vm_domain_clear(struct vm_domain *vmd)
3071 mtx_lock(&vm_domainset_lock);
3072 if (vmd->vmd_minset && !vm_paging_min(vmd)) {
3073 vmd->vmd_minset = 0;
3074 DOMAINSET_CLR(vmd->vmd_domain, &vm_min_domains);
3075 if (vm_min_waiters != 0) {
3077 wakeup(&vm_min_domains);
3080 if (vmd->vmd_severeset && !vm_paging_severe(vmd)) {
3081 vmd->vmd_severeset = 0;
3082 DOMAINSET_CLR(vmd->vmd_domain, &vm_severe_domains);
3083 if (vm_severe_waiters != 0) {
3084 vm_severe_waiters = 0;
3085 wakeup(&vm_severe_domains);
3090 * If pageout daemon needs pages, then tell it that there are
3093 if (vmd->vmd_pageout_pages_needed &&
3094 vmd->vmd_free_count >= vmd->vmd_pageout_free_min) {
3095 wakeup(&vmd->vmd_pageout_pages_needed);
3096 vmd->vmd_pageout_pages_needed = 0;
3099 /* See comments in vm_wait_doms(). */
3100 if (vm_pageproc_waiters) {
3101 vm_pageproc_waiters = 0;
3102 wakeup(&vm_pageproc_waiters);
3104 mtx_unlock(&vm_domainset_lock);
3108 * Wait for free pages to exceed the min threshold globally.
3114 mtx_lock(&vm_domainset_lock);
3115 while (vm_page_count_min()) {
3117 msleep(&vm_min_domains, &vm_domainset_lock, PVM, "vmwait", 0);
3119 mtx_unlock(&vm_domainset_lock);
3123 * Wait for free pages to exceed the severe threshold globally.
3126 vm_wait_severe(void)
3129 mtx_lock(&vm_domainset_lock);
3130 while (vm_page_count_severe()) {
3131 vm_severe_waiters++;
3132 msleep(&vm_severe_domains, &vm_domainset_lock, PVM,
3135 mtx_unlock(&vm_domainset_lock);
3142 return (vm_severe_waiters + vm_min_waiters + vm_pageproc_waiters);
3146 vm_wait_doms(const domainset_t *wdoms)
3150 * We use racey wakeup synchronization to avoid expensive global
3151 * locking for the pageproc when sleeping with a non-specific vm_wait.
3152 * To handle this, we only sleep for one tick in this instance. It
3153 * is expected that most allocations for the pageproc will come from
3154 * kmem or vm_page_grab* which will use the more specific and
3155 * race-free vm_wait_domain().
3157 if (curproc == pageproc) {
3158 mtx_lock(&vm_domainset_lock);
3159 vm_pageproc_waiters++;
3160 msleep(&vm_pageproc_waiters, &vm_domainset_lock, PVM | PDROP,
3164 * XXX Ideally we would wait only until the allocation could
3165 * be satisfied. This condition can cause new allocators to
3166 * consume all freed pages while old allocators wait.
3168 mtx_lock(&vm_domainset_lock);
3169 if (vm_page_count_min_set(wdoms)) {
3171 msleep(&vm_min_domains, &vm_domainset_lock,
3172 PVM | PDROP, "vmwait", 0);
3174 mtx_unlock(&vm_domainset_lock);
3181 * Sleep until free pages are available for allocation.
3182 * - Called in various places after failed memory allocations.
3185 vm_wait_domain(int domain)
3187 struct vm_domain *vmd;
3190 vmd = VM_DOMAIN(domain);
3191 vm_domain_free_assert_unlocked(vmd);
3193 if (curproc == pageproc) {
3194 mtx_lock(&vm_domainset_lock);
3195 if (vmd->vmd_free_count < vmd->vmd_pageout_free_min) {
3196 vmd->vmd_pageout_pages_needed = 1;
3197 msleep(&vmd->vmd_pageout_pages_needed,
3198 &vm_domainset_lock, PDROP | PSWP, "VMWait", 0);
3200 mtx_unlock(&vm_domainset_lock);
3202 if (pageproc == NULL)
3203 panic("vm_wait in early boot");
3204 DOMAINSET_ZERO(&wdom);
3205 DOMAINSET_SET(vmd->vmd_domain, &wdom);
3206 vm_wait_doms(&wdom);
3213 * Sleep until free pages are available for allocation in the
3214 * affinity domains of the obj. If obj is NULL, the domain set
3215 * for the calling thread is used.
3216 * Called in various places after failed memory allocations.
3219 vm_wait(vm_object_t obj)
3221 struct domainset *d;
3226 * Carefully fetch pointers only once: the struct domainset
3227 * itself is ummutable but the pointer might change.
3230 d = obj->domain.dr_policy;
3232 d = curthread->td_domain.dr_policy;
3234 vm_wait_doms(&d->ds_mask);
3238 * vm_domain_alloc_fail:
3240 * Called when a page allocation function fails. Informs the
3241 * pagedaemon and performs the requested wait. Requires the
3242 * domain_free and object lock on entry. Returns with the
3243 * object lock held and free lock released. Returns an error when
3244 * retry is necessary.
3248 vm_domain_alloc_fail(struct vm_domain *vmd, vm_object_t object, int req)
3251 vm_domain_free_assert_unlocked(vmd);
3253 atomic_add_int(&vmd->vmd_pageout_deficit,
3254 max((u_int)req >> VM_ALLOC_COUNT_SHIFT, 1));
3255 if (req & (VM_ALLOC_WAITOK | VM_ALLOC_WAITFAIL)) {
3257 VM_OBJECT_WUNLOCK(object);
3258 vm_wait_domain(vmd->vmd_domain);
3260 VM_OBJECT_WLOCK(object);
3261 if (req & VM_ALLOC_WAITOK)
3271 * Sleep until free pages are available for allocation.
3272 * - Called only in vm_fault so that processes page faulting
3273 * can be easily tracked.
3274 * - Sleeps at a lower priority than vm_wait() so that vm_wait()ing
3275 * processes will be able to grab memory first. Do not change
3276 * this balance without careful testing first.
3279 vm_waitpfault(struct domainset *dset, int timo)
3283 * XXX Ideally we would wait only until the allocation could
3284 * be satisfied. This condition can cause new allocators to
3285 * consume all freed pages while old allocators wait.
3287 mtx_lock(&vm_domainset_lock);
3288 if (vm_page_count_min_set(&dset->ds_mask)) {
3290 msleep(&vm_min_domains, &vm_domainset_lock, PUSER | PDROP,
3293 mtx_unlock(&vm_domainset_lock);
3296 static struct vm_pagequeue *
3297 _vm_page_pagequeue(vm_page_t m, uint8_t queue)
3300 return (&vm_pagequeue_domain(m)->vmd_pagequeues[queue]);
3304 static struct vm_pagequeue *
3305 vm_page_pagequeue(vm_page_t m)
3308 return (_vm_page_pagequeue(m, vm_page_astate_load(m).queue));
3312 static __always_inline bool
3313 vm_page_pqstate_fcmpset(vm_page_t m, vm_page_astate_t *old, vm_page_astate_t new)
3315 vm_page_astate_t tmp;
3319 if (__predict_true(vm_page_astate_fcmpset(m, old, new)))
3321 counter_u64_add(pqstate_commit_retries, 1);
3322 } while (old->_bits == tmp._bits);
3328 * Do the work of committing a queue state update that moves the page out of
3329 * its current queue.
3332 _vm_page_pqstate_commit_dequeue(struct vm_pagequeue *pq, vm_page_t m,
3333 vm_page_astate_t *old, vm_page_astate_t new)
3337 vm_pagequeue_assert_locked(pq);
3338 KASSERT(vm_page_pagequeue(m) == pq,
3339 ("%s: queue %p does not match page %p", __func__, pq, m));
3340 KASSERT(old->queue != PQ_NONE && new.queue != old->queue,
3341 ("%s: invalid queue indices %d %d",
3342 __func__, old->queue, new.queue));
3345 * Once the queue index of the page changes there is nothing
3346 * synchronizing with further updates to the page's physical
3347 * queue state. Therefore we must speculatively remove the page
3348 * from the queue now and be prepared to roll back if the queue
3349 * state update fails. If the page is not physically enqueued then
3350 * we just update its queue index.
3352 if ((old->flags & PGA_ENQUEUED) != 0) {
3353 new.flags &= ~PGA_ENQUEUED;
3354 next = TAILQ_NEXT(m, plinks.q);
3355 TAILQ_REMOVE(&pq->pq_pl, m, plinks.q);
3356 vm_pagequeue_cnt_dec(pq);
3357 if (!vm_page_pqstate_fcmpset(m, old, new)) {
3359 TAILQ_INSERT_TAIL(&pq->pq_pl, m, plinks.q);
3361 TAILQ_INSERT_BEFORE(next, m, plinks.q);
3362 vm_pagequeue_cnt_inc(pq);
3368 return (vm_page_pqstate_fcmpset(m, old, new));
3373 vm_page_pqstate_commit_dequeue(vm_page_t m, vm_page_astate_t *old,
3374 vm_page_astate_t new)
3376 struct vm_pagequeue *pq;
3377 vm_page_astate_t as;
3380 pq = _vm_page_pagequeue(m, old->queue);
3383 * The queue field and PGA_ENQUEUED flag are stable only so long as the
3384 * corresponding page queue lock is held.
3386 vm_pagequeue_lock(pq);
3387 as = vm_page_astate_load(m);
3388 if (__predict_false(as._bits != old->_bits)) {
3392 ret = _vm_page_pqstate_commit_dequeue(pq, m, old, new);
3394 vm_pagequeue_unlock(pq);
3399 * Commit a queue state update that enqueues or requeues a page.
3402 _vm_page_pqstate_commit_requeue(struct vm_pagequeue *pq, vm_page_t m,
3403 vm_page_astate_t *old, vm_page_astate_t new)
3405 struct vm_domain *vmd;
3407 vm_pagequeue_assert_locked(pq);
3408 KASSERT(old->queue != PQ_NONE && new.queue == old->queue,
3409 ("%s: invalid queue indices %d %d",
3410 __func__, old->queue, new.queue));
3412 new.flags |= PGA_ENQUEUED;
3413 if (!vm_page_pqstate_fcmpset(m, old, new))
3416 if ((old->flags & PGA_ENQUEUED) != 0)
3417 TAILQ_REMOVE(&pq->pq_pl, m, plinks.q);
3419 vm_pagequeue_cnt_inc(pq);
3422 * Give PGA_REQUEUE_HEAD precedence over PGA_REQUEUE. In particular, if
3423 * both flags are set in close succession, only PGA_REQUEUE_HEAD will be
3424 * applied, even if it was set first.
3426 if ((old->flags & PGA_REQUEUE_HEAD) != 0) {
3427 vmd = vm_pagequeue_domain(m);
3428 KASSERT(pq == &vmd->vmd_pagequeues[PQ_INACTIVE],
3429 ("%s: invalid page queue for page %p", __func__, m));
3430 TAILQ_INSERT_BEFORE(&vmd->vmd_inacthead, m, plinks.q);
3432 TAILQ_INSERT_TAIL(&pq->pq_pl, m, plinks.q);
3438 * Commit a queue state update that encodes a request for a deferred queue
3442 vm_page_pqstate_commit_request(vm_page_t m, vm_page_astate_t *old,
3443 vm_page_astate_t new)
3446 KASSERT(old->queue == new.queue || new.queue != PQ_NONE,
3447 ("%s: invalid state, queue %d flags %x",
3448 __func__, new.queue, new.flags));
3450 if (old->_bits != new._bits &&
3451 !vm_page_pqstate_fcmpset(m, old, new))
3453 vm_page_pqbatch_submit(m, new.queue);
3458 * A generic queue state update function. This handles more cases than the
3459 * specialized functions above.
3462 vm_page_pqstate_commit(vm_page_t m, vm_page_astate_t *old, vm_page_astate_t new)
3465 if (old->_bits == new._bits)
3468 if (old->queue != PQ_NONE && new.queue != old->queue) {
3469 if (!vm_page_pqstate_commit_dequeue(m, old, new))
3471 if (new.queue != PQ_NONE)
3472 vm_page_pqbatch_submit(m, new.queue);
3474 if (!vm_page_pqstate_fcmpset(m, old, new))
3476 if (new.queue != PQ_NONE &&
3477 ((new.flags & ~old->flags) & PGA_QUEUE_OP_MASK) != 0)
3478 vm_page_pqbatch_submit(m, new.queue);
3484 * Apply deferred queue state updates to a page.
3487 vm_pqbatch_process_page(struct vm_pagequeue *pq, vm_page_t m, uint8_t queue)
3489 vm_page_astate_t new, old;
3491 CRITICAL_ASSERT(curthread);
3492 vm_pagequeue_assert_locked(pq);
3493 KASSERT(queue < PQ_COUNT,
3494 ("%s: invalid queue index %d", __func__, queue));
3495 KASSERT(pq == _vm_page_pagequeue(m, queue),
3496 ("%s: page %p does not belong to queue %p", __func__, m, pq));
3498 for (old = vm_page_astate_load(m);;) {
3499 if (__predict_false(old.queue != queue ||
3500 (old.flags & PGA_QUEUE_OP_MASK) == 0)) {
3501 counter_u64_add(queue_nops, 1);
3504 KASSERT(old.queue != PQ_NONE || (old.flags & PGA_QUEUE_STATE_MASK) == 0,
3505 ("%s: page %p has unexpected queue state", __func__, m));
3508 if ((old.flags & PGA_DEQUEUE) != 0) {
3509 new.flags &= ~PGA_QUEUE_OP_MASK;
3510 new.queue = PQ_NONE;
3511 if (__predict_true(_vm_page_pqstate_commit_dequeue(pq,
3513 counter_u64_add(queue_ops, 1);
3517 new.flags &= ~(PGA_REQUEUE | PGA_REQUEUE_HEAD);
3518 if (__predict_true(_vm_page_pqstate_commit_requeue(pq,
3520 counter_u64_add(queue_ops, 1);
3528 vm_pqbatch_process(struct vm_pagequeue *pq, struct vm_batchqueue *bq,
3533 for (i = 0; i < bq->bq_cnt; i++)
3534 vm_pqbatch_process_page(pq, bq->bq_pa[i], queue);
3535 vm_batchqueue_init(bq);
3539 * vm_page_pqbatch_submit: [ internal use only ]
3541 * Enqueue a page in the specified page queue's batched work queue.
3542 * The caller must have encoded the requested operation in the page
3543 * structure's a.flags field.
3546 vm_page_pqbatch_submit(vm_page_t m, uint8_t queue)
3548 struct vm_batchqueue *bq;
3549 struct vm_pagequeue *pq;
3552 KASSERT((m->oflags & VPO_UNMANAGED) == 0,
3553 ("page %p is unmanaged", m));
3554 KASSERT(queue < PQ_COUNT, ("invalid queue %d", queue));
3556 domain = vm_phys_domain(m);
3557 pq = &vm_pagequeue_domain(m)->vmd_pagequeues[queue];
3560 bq = DPCPU_PTR(pqbatch[domain][queue]);
3561 if (vm_batchqueue_insert(bq, m)) {
3566 vm_pagequeue_lock(pq);
3568 bq = DPCPU_PTR(pqbatch[domain][queue]);
3569 vm_pqbatch_process(pq, bq, queue);
3570 vm_pqbatch_process_page(pq, m, queue);
3571 vm_pagequeue_unlock(pq);
3576 * vm_page_pqbatch_drain: [ internal use only ]
3578 * Force all per-CPU page queue batch queues to be drained. This is
3579 * intended for use in severe memory shortages, to ensure that pages
3580 * do not remain stuck in the batch queues.
3583 vm_page_pqbatch_drain(void)
3586 struct vm_domain *vmd;
3587 struct vm_pagequeue *pq;
3588 int cpu, domain, queue;
3593 sched_bind(td, cpu);
3596 for (domain = 0; domain < vm_ndomains; domain++) {
3597 vmd = VM_DOMAIN(domain);
3598 for (queue = 0; queue < PQ_COUNT; queue++) {
3599 pq = &vmd->vmd_pagequeues[queue];
3600 vm_pagequeue_lock(pq);
3602 vm_pqbatch_process(pq,
3603 DPCPU_PTR(pqbatch[domain][queue]), queue);
3605 vm_pagequeue_unlock(pq);
3615 * vm_page_dequeue_deferred: [ internal use only ]
3617 * Request removal of the given page from its current page
3618 * queue. Physical removal from the queue may be deferred
3621 * The page must be locked.
3624 vm_page_dequeue_deferred(vm_page_t m)
3626 vm_page_astate_t new, old;
3628 old = vm_page_astate_load(m);
3630 if (old.queue == PQ_NONE) {
3631 KASSERT((old.flags & PGA_QUEUE_STATE_MASK) == 0,
3632 ("%s: page %p has unexpected queue state",
3637 new.flags |= PGA_DEQUEUE;
3638 } while (!vm_page_pqstate_commit_request(m, &old, new));
3644 * Remove the page from whichever page queue it's in, if any, before
3648 vm_page_dequeue(vm_page_t m)
3650 vm_page_astate_t new, old;
3652 old = vm_page_astate_load(m);
3654 if (old.queue == PQ_NONE) {
3655 KASSERT((old.flags & PGA_QUEUE_STATE_MASK) == 0,
3656 ("%s: page %p has unexpected queue state",
3661 new.flags &= ~PGA_QUEUE_OP_MASK;
3662 new.queue = PQ_NONE;
3663 } while (!vm_page_pqstate_commit_dequeue(m, &old, new));
3668 * Schedule the given page for insertion into the specified page queue.
3669 * Physical insertion of the page may be deferred indefinitely.
3672 vm_page_enqueue(vm_page_t m, uint8_t queue)
3675 KASSERT(m->a.queue == PQ_NONE &&
3676 (m->a.flags & PGA_QUEUE_STATE_MASK) == 0,
3677 ("%s: page %p is already enqueued", __func__, m));
3678 KASSERT(m->ref_count > 0,
3679 ("%s: page %p does not carry any references", __func__, m));
3682 if ((m->a.flags & PGA_REQUEUE) == 0)
3683 vm_page_aflag_set(m, PGA_REQUEUE);
3684 vm_page_pqbatch_submit(m, queue);
3688 * vm_page_free_prep:
3690 * Prepares the given page to be put on the free list,
3691 * disassociating it from any VM object. The caller may return
3692 * the page to the free list only if this function returns true.
3694 * The object, if it exists, must be locked, and then the page must
3695 * be xbusy. Otherwise the page must be not busied. A managed
3696 * page must be unmapped.
3699 vm_page_free_prep(vm_page_t m)
3703 * Synchronize with threads that have dropped a reference to this
3706 atomic_thread_fence_acq();
3708 #if defined(DIAGNOSTIC) && defined(PHYS_TO_DMAP)
3709 if (PMAP_HAS_DMAP && (m->flags & PG_ZERO) != 0) {
3712 p = (uint64_t *)PHYS_TO_DMAP(VM_PAGE_TO_PHYS(m));
3713 for (i = 0; i < PAGE_SIZE / sizeof(uint64_t); i++, p++)
3714 KASSERT(*p == 0, ("vm_page_free_prep %p PG_ZERO %d %jx",
3715 m, i, (uintmax_t)*p));
3718 if ((m->oflags & VPO_UNMANAGED) == 0) {
3719 KASSERT(!pmap_page_is_mapped(m),
3720 ("vm_page_free_prep: freeing mapped page %p", m));
3721 KASSERT((m->a.flags & (PGA_EXECUTABLE | PGA_WRITEABLE)) == 0,
3722 ("vm_page_free_prep: mapping flags set in page %p", m));
3724 KASSERT(m->a.queue == PQ_NONE,
3725 ("vm_page_free_prep: unmanaged page %p is queued", m));
3727 VM_CNT_INC(v_tfree);
3729 if (m->object != NULL) {
3730 KASSERT(((m->oflags & VPO_UNMANAGED) != 0) ==
3731 ((m->object->flags & OBJ_UNMANAGED) != 0),
3732 ("vm_page_free_prep: managed flag mismatch for page %p",
3734 vm_page_assert_xbusied(m);
3737 * The object reference can be released without an atomic
3740 KASSERT((m->flags & PG_FICTITIOUS) != 0 ||
3741 m->ref_count == VPRC_OBJREF,
3742 ("vm_page_free_prep: page %p has unexpected ref_count %u",
3744 vm_page_object_remove(m);
3745 m->ref_count -= VPRC_OBJREF;
3747 vm_page_assert_unbusied(m);
3749 vm_page_busy_free(m);
3752 * If fictitious remove object association and
3755 if ((m->flags & PG_FICTITIOUS) != 0) {
3756 KASSERT(m->ref_count == 1,
3757 ("fictitious page %p is referenced", m));
3758 KASSERT(m->a.queue == PQ_NONE,
3759 ("fictitious page %p is queued", m));
3764 * Pages need not be dequeued before they are returned to the physical
3765 * memory allocator, but they must at least be marked for a deferred
3768 if ((m->oflags & VPO_UNMANAGED) == 0)
3769 vm_page_dequeue_deferred(m);
3774 if (m->ref_count != 0)
3775 panic("vm_page_free_prep: page %p has references", m);
3778 * Restore the default memory attribute to the page.
3780 if (pmap_page_get_memattr(m) != VM_MEMATTR_DEFAULT)
3781 pmap_page_set_memattr(m, VM_MEMATTR_DEFAULT);
3783 #if VM_NRESERVLEVEL > 0
3785 * Determine whether the page belongs to a reservation. If the page was
3786 * allocated from a per-CPU cache, it cannot belong to a reservation, so
3787 * as an optimization, we avoid the check in that case.
3789 if ((m->flags & PG_PCPU_CACHE) == 0 && vm_reserv_free_page(m))
3799 * Returns the given page to the free list, disassociating it
3800 * from any VM object.
3802 * The object must be locked. The page must be locked if it is
3806 vm_page_free_toq(vm_page_t m)
3808 struct vm_domain *vmd;
3811 if (!vm_page_free_prep(m))
3814 vmd = vm_pagequeue_domain(m);
3815 zone = vmd->vmd_pgcache[m->pool].zone;
3816 if ((m->flags & PG_PCPU_CACHE) != 0 && zone != NULL) {
3820 vm_domain_free_lock(vmd);
3821 vm_phys_free_pages(m, 0);
3822 vm_domain_free_unlock(vmd);
3823 vm_domain_freecnt_inc(vmd, 1);
3827 * vm_page_free_pages_toq:
3829 * Returns a list of pages to the free list, disassociating it
3830 * from any VM object. In other words, this is equivalent to
3831 * calling vm_page_free_toq() for each page of a list of VM objects.
3833 * The objects must be locked. The pages must be locked if it is
3837 vm_page_free_pages_toq(struct spglist *free, bool update_wire_count)
3842 if (SLIST_EMPTY(free))
3846 while ((m = SLIST_FIRST(free)) != NULL) {
3848 SLIST_REMOVE_HEAD(free, plinks.s.ss);
3849 vm_page_free_toq(m);
3852 if (update_wire_count)
3857 * Mark this page as wired down, preventing reclamation by the page daemon
3858 * or when the containing object is destroyed.
3861 vm_page_wire(vm_page_t m)
3865 KASSERT(m->object != NULL,
3866 ("vm_page_wire: page %p does not belong to an object", m));
3867 if (!vm_page_busied(m) && !vm_object_busied(m->object))
3868 VM_OBJECT_ASSERT_LOCKED(m->object);
3869 KASSERT((m->flags & PG_FICTITIOUS) == 0 ||
3870 VPRC_WIRE_COUNT(m->ref_count) >= 1,
3871 ("vm_page_wire: fictitious page %p has zero wirings", m));
3873 old = atomic_fetchadd_int(&m->ref_count, 1);
3874 KASSERT(VPRC_WIRE_COUNT(old) != VPRC_WIRE_COUNT_MAX,
3875 ("vm_page_wire: counter overflow for page %p", m));
3876 if (VPRC_WIRE_COUNT(old) == 0) {
3877 if ((m->oflags & VPO_UNMANAGED) == 0)
3878 vm_page_aflag_set(m, PGA_DEQUEUE);
3884 * Attempt to wire a mapped page following a pmap lookup of that page.
3885 * This may fail if a thread is concurrently tearing down mappings of the page.
3886 * The transient failure is acceptable because it translates to the
3887 * failure of the caller pmap_extract_and_hold(), which should be then
3888 * followed by the vm_fault() fallback, see e.g. vm_fault_quick_hold_pages().
3891 vm_page_wire_mapped(vm_page_t m)
3898 ("vm_page_wire_mapped: wiring unreferenced page %p", m));
3899 if ((old & VPRC_BLOCKED) != 0)
3901 } while (!atomic_fcmpset_int(&m->ref_count, &old, old + 1));
3903 if (VPRC_WIRE_COUNT(old) == 0) {
3904 if ((m->oflags & VPO_UNMANAGED) == 0)
3905 vm_page_aflag_set(m, PGA_DEQUEUE);
3912 * Release a wiring reference to a managed page. If the page still belongs to
3913 * an object, update its position in the page queues to reflect the reference.
3914 * If the wiring was the last reference to the page, free the page.
3917 vm_page_unwire_managed(vm_page_t m, uint8_t nqueue, bool noreuse)
3921 KASSERT((m->oflags & VPO_UNMANAGED) == 0,
3922 ("%s: page %p is unmanaged", __func__, m));
3925 * Update LRU state before releasing the wiring reference.
3926 * Use a release store when updating the reference count to
3927 * synchronize with vm_page_free_prep().
3931 KASSERT(VPRC_WIRE_COUNT(old) > 0,
3932 ("vm_page_unwire: wire count underflow for page %p", m));
3934 if (old > VPRC_OBJREF + 1) {
3936 * The page has at least one other wiring reference. An
3937 * earlier iteration of this loop may have called
3938 * vm_page_release_toq() and cleared PGA_DEQUEUE, so
3939 * re-set it if necessary.
3941 if ((vm_page_astate_load(m).flags & PGA_DEQUEUE) == 0)
3942 vm_page_aflag_set(m, PGA_DEQUEUE);
3943 } else if (old == VPRC_OBJREF + 1) {
3945 * This is the last wiring. Clear PGA_DEQUEUE and
3946 * update the page's queue state to reflect the
3947 * reference. If the page does not belong to an object
3948 * (i.e., the VPRC_OBJREF bit is clear), we only need to
3949 * clear leftover queue state.
3951 vm_page_release_toq(m, nqueue, false);
3952 } else if (old == 1) {
3953 vm_page_aflag_clear(m, PGA_DEQUEUE);
3955 } while (!atomic_fcmpset_rel_int(&m->ref_count, &old, old - 1));
3957 if (VPRC_WIRE_COUNT(old) == 1) {
3965 * Release one wiring of the specified page, potentially allowing it to be
3968 * Only managed pages belonging to an object can be paged out. If the number
3969 * of wirings transitions to zero and the page is eligible for page out, then
3970 * the page is added to the specified paging queue. If the released wiring
3971 * represented the last reference to the page, the page is freed.
3973 * A managed page must be locked.
3976 vm_page_unwire(vm_page_t m, uint8_t nqueue)
3979 KASSERT(nqueue < PQ_COUNT,
3980 ("vm_page_unwire: invalid queue %u request for page %p",
3983 if ((m->oflags & VPO_UNMANAGED) != 0) {
3984 if (vm_page_unwire_noq(m) && m->ref_count == 0)
3988 vm_page_unwire_managed(m, nqueue, false);
3992 * Unwire a page without (re-)inserting it into a page queue. It is up
3993 * to the caller to enqueue, requeue, or free the page as appropriate.
3994 * In most cases involving managed pages, vm_page_unwire() should be used
3998 vm_page_unwire_noq(vm_page_t m)
4002 old = vm_page_drop(m, 1);
4003 KASSERT(VPRC_WIRE_COUNT(old) != 0,
4004 ("vm_page_unref: counter underflow for page %p", m));
4005 KASSERT((m->flags & PG_FICTITIOUS) == 0 || VPRC_WIRE_COUNT(old) > 1,
4006 ("vm_page_unref: missing ref on fictitious page %p", m));
4008 if (VPRC_WIRE_COUNT(old) > 1)
4010 if ((m->oflags & VPO_UNMANAGED) == 0)
4011 vm_page_aflag_clear(m, PGA_DEQUEUE);
4017 * Ensure that the page ends up in the specified page queue. If the page is
4018 * active or being moved to the active queue, ensure that its act_count is
4019 * at least ACT_INIT but do not otherwise mess with it.
4021 * A managed page must be locked.
4023 static __always_inline void
4024 vm_page_mvqueue(vm_page_t m, const uint8_t nqueue, const uint16_t nflag)
4026 vm_page_astate_t old, new;
4028 KASSERT(m->ref_count > 0,
4029 ("%s: page %p does not carry any references", __func__, m));
4030 KASSERT(nflag == PGA_REQUEUE || nflag == PGA_REQUEUE_HEAD,
4031 ("%s: invalid flags %x", __func__, nflag));
4033 if ((m->oflags & VPO_UNMANAGED) != 0 || vm_page_wired(m))
4036 old = vm_page_astate_load(m);
4038 if ((old.flags & PGA_DEQUEUE) != 0)
4041 new.flags &= ~PGA_QUEUE_OP_MASK;
4042 if (nqueue == PQ_ACTIVE)
4043 new.act_count = max(old.act_count, ACT_INIT);
4044 if (old.queue == nqueue) {
4045 if (nqueue != PQ_ACTIVE)
4051 } while (!vm_page_pqstate_commit(m, &old, new));
4055 * Put the specified page on the active list (if appropriate).
4058 vm_page_activate(vm_page_t m)
4061 vm_page_mvqueue(m, PQ_ACTIVE, PGA_REQUEUE);
4065 * Move the specified page to the tail of the inactive queue, or requeue
4066 * the page if it is already in the inactive queue.
4069 vm_page_deactivate(vm_page_t m)
4072 vm_page_mvqueue(m, PQ_INACTIVE, PGA_REQUEUE);
4076 vm_page_deactivate_noreuse(vm_page_t m)
4079 vm_page_mvqueue(m, PQ_INACTIVE, PGA_REQUEUE_HEAD);
4083 * Put a page in the laundry, or requeue it if it is already there.
4086 vm_page_launder(vm_page_t m)
4089 vm_page_mvqueue(m, PQ_LAUNDRY, PGA_REQUEUE);
4093 * Put a page in the PQ_UNSWAPPABLE holding queue.
4096 vm_page_unswappable(vm_page_t m)
4099 KASSERT(!vm_page_wired(m) && (m->oflags & VPO_UNMANAGED) == 0,
4100 ("page %p already unswappable", m));
4103 vm_page_enqueue(m, PQ_UNSWAPPABLE);
4107 * Release a page back to the page queues in preparation for unwiring.
4110 vm_page_release_toq(vm_page_t m, uint8_t nqueue, const bool noreuse)
4112 vm_page_astate_t old, new;
4116 * Use a check of the valid bits to determine whether we should
4117 * accelerate reclamation of the page. The object lock might not be
4118 * held here, in which case the check is racy. At worst we will either
4119 * accelerate reclamation of a valid page and violate LRU, or
4120 * unnecessarily defer reclamation of an invalid page.
4122 * If we were asked to not cache the page, place it near the head of the
4123 * inactive queue so that is reclaimed sooner.
4125 if (noreuse || m->valid == 0) {
4126 nqueue = PQ_INACTIVE;
4127 nflag = PGA_REQUEUE_HEAD;
4129 nflag = PGA_REQUEUE;
4132 old = vm_page_astate_load(m);
4137 * If the page is already in the active queue and we are not
4138 * trying to accelerate reclamation, simply mark it as
4139 * referenced and avoid any queue operations.
4141 new.flags &= ~PGA_QUEUE_OP_MASK;
4142 if (nflag != PGA_REQUEUE_HEAD && old.queue == PQ_ACTIVE)
4143 new.flags |= PGA_REFERENCED;
4148 } while (!vm_page_pqstate_commit(m, &old, new));
4152 * Unwire a page and either attempt to free it or re-add it to the page queues.
4155 vm_page_release(vm_page_t m, int flags)
4159 KASSERT((m->oflags & VPO_UNMANAGED) == 0,
4160 ("vm_page_release: page %p is unmanaged", m));
4162 if ((flags & VPR_TRYFREE) != 0) {
4164 object = atomic_load_ptr(&m->object);
4167 /* Depends on type-stability. */
4168 if (vm_page_busied(m) || !VM_OBJECT_TRYWLOCK(object))
4170 if (object == m->object) {
4171 vm_page_release_locked(m, flags);
4172 VM_OBJECT_WUNLOCK(object);
4175 VM_OBJECT_WUNLOCK(object);
4178 vm_page_unwire_managed(m, PQ_INACTIVE, flags != 0);
4181 /* See vm_page_release(). */
4183 vm_page_release_locked(vm_page_t m, int flags)
4186 VM_OBJECT_ASSERT_WLOCKED(m->object);
4187 KASSERT((m->oflags & VPO_UNMANAGED) == 0,
4188 ("vm_page_release_locked: page %p is unmanaged", m));
4190 if (vm_page_unwire_noq(m)) {
4191 if ((flags & VPR_TRYFREE) != 0 &&
4192 (m->object->ref_count == 0 || !pmap_page_is_mapped(m)) &&
4193 m->dirty == 0 && vm_page_tryxbusy(m)) {
4195 * An unlocked lookup may have wired the page before the
4196 * busy lock was acquired, in which case the page must
4199 if (__predict_true(!vm_page_wired(m))) {
4205 vm_page_release_toq(m, PQ_INACTIVE, flags != 0);
4211 vm_page_try_blocked_op(vm_page_t m, void (*op)(vm_page_t))
4215 KASSERT(m->object != NULL && (m->oflags & VPO_UNMANAGED) == 0,
4216 ("vm_page_try_blocked_op: page %p has no object", m));
4217 KASSERT(vm_page_busied(m),
4218 ("vm_page_try_blocked_op: page %p is not busy", m));
4219 VM_OBJECT_ASSERT_LOCKED(m->object);
4224 ("vm_page_try_blocked_op: page %p has no references", m));
4225 if (VPRC_WIRE_COUNT(old) != 0)
4227 } while (!atomic_fcmpset_int(&m->ref_count, &old, old | VPRC_BLOCKED));
4232 * If the object is read-locked, new wirings may be created via an
4235 old = vm_page_drop(m, VPRC_BLOCKED);
4236 KASSERT(!VM_OBJECT_WOWNED(m->object) ||
4237 old == (VPRC_BLOCKED | VPRC_OBJREF),
4238 ("vm_page_try_blocked_op: unexpected refcount value %u for %p",
4244 * Atomically check for wirings and remove all mappings of the page.
4247 vm_page_try_remove_all(vm_page_t m)
4250 return (vm_page_try_blocked_op(m, pmap_remove_all));
4254 * Atomically check for wirings and remove all writeable mappings of the page.
4257 vm_page_try_remove_write(vm_page_t m)
4260 return (vm_page_try_blocked_op(m, pmap_remove_write));
4266 * Apply the specified advice to the given page.
4268 * The object and page must be locked.
4271 vm_page_advise(vm_page_t m, int advice)
4274 VM_OBJECT_ASSERT_WLOCKED(m->object);
4275 if (advice == MADV_FREE)
4277 * Mark the page clean. This will allow the page to be freed
4278 * without first paging it out. MADV_FREE pages are often
4279 * quickly reused by malloc(3), so we do not do anything that
4280 * would result in a page fault on a later access.
4283 else if (advice != MADV_DONTNEED) {
4284 if (advice == MADV_WILLNEED)
4285 vm_page_activate(m);
4289 if (advice != MADV_FREE && m->dirty == 0 && pmap_is_modified(m))
4293 * Clear any references to the page. Otherwise, the page daemon will
4294 * immediately reactivate the page.
4296 vm_page_aflag_clear(m, PGA_REFERENCED);
4299 * Place clean pages near the head of the inactive queue rather than
4300 * the tail, thus defeating the queue's LRU operation and ensuring that
4301 * the page will be reused quickly. Dirty pages not already in the
4302 * laundry are moved there.
4305 vm_page_deactivate_noreuse(m);
4306 else if (!vm_page_in_laundry(m))
4311 * vm_page_grab_release
4313 * Helper routine for grab functions to release busy on return.
4316 vm_page_grab_release(vm_page_t m, int allocflags)
4319 if ((allocflags & VM_ALLOC_NOBUSY) != 0) {
4320 if ((allocflags & VM_ALLOC_IGN_SBUSY) != 0)
4328 * vm_page_grab_sleep
4330 * Sleep for busy according to VM_ALLOC_ parameters. Returns true
4331 * if the caller should retry and false otherwise.
4333 * If the object is locked on entry the object will be unlocked with
4334 * false returns and still locked but possibly having been dropped
4335 * with true returns.
4338 vm_page_grab_sleep(vm_object_t object, vm_page_t m, vm_pindex_t pindex,
4339 const char *wmesg, int allocflags, bool locked)
4342 if ((allocflags & VM_ALLOC_NOWAIT) != 0)
4346 * Reference the page before unlocking and sleeping so that
4347 * the page daemon is less likely to reclaim it.
4349 if (locked && (allocflags & VM_ALLOC_NOCREAT) == 0)
4350 vm_page_reference(m);
4352 if (_vm_page_busy_sleep(object, m, m->pindex, wmesg, allocflags,
4354 VM_OBJECT_WLOCK(object);
4355 if ((allocflags & VM_ALLOC_WAITFAIL) != 0)
4362 * Assert that the grab flags are valid.
4365 vm_page_grab_check(int allocflags)
4368 KASSERT((allocflags & VM_ALLOC_NOBUSY) == 0 ||
4369 (allocflags & VM_ALLOC_WIRED) != 0,
4370 ("vm_page_grab*: the pages must be busied or wired"));
4372 KASSERT((allocflags & VM_ALLOC_SBUSY) == 0 ||
4373 (allocflags & VM_ALLOC_IGN_SBUSY) != 0,
4374 ("vm_page_grab*: VM_ALLOC_SBUSY/VM_ALLOC_IGN_SBUSY mismatch"));
4378 * Calculate the page allocation flags for grab.
4381 vm_page_grab_pflags(int allocflags)
4385 pflags = allocflags &
4386 ~(VM_ALLOC_NOWAIT | VM_ALLOC_WAITOK | VM_ALLOC_WAITFAIL |
4388 if ((allocflags & VM_ALLOC_NOWAIT) == 0)
4389 pflags |= VM_ALLOC_WAITFAIL;
4390 if ((allocflags & VM_ALLOC_IGN_SBUSY) != 0)
4391 pflags |= VM_ALLOC_SBUSY;
4397 * Grab a page, waiting until we are waken up due to the page
4398 * changing state. We keep on waiting, if the page continues
4399 * to be in the object. If the page doesn't exist, first allocate it
4400 * and then conditionally zero it.
4402 * This routine may sleep.
4404 * The object must be locked on entry. The lock will, however, be released
4405 * and reacquired if the routine sleeps.
4408 vm_page_grab(vm_object_t object, vm_pindex_t pindex, int allocflags)
4412 VM_OBJECT_ASSERT_WLOCKED(object);
4413 vm_page_grab_check(allocflags);
4416 if ((m = vm_page_lookup(object, pindex)) != NULL) {
4417 if (!vm_page_tryacquire(m, allocflags)) {
4418 if (vm_page_grab_sleep(object, m, pindex, "pgrbwt",
4425 if ((allocflags & VM_ALLOC_NOCREAT) != 0)
4427 m = vm_page_alloc(object, pindex, vm_page_grab_pflags(allocflags));
4429 if ((allocflags & (VM_ALLOC_NOWAIT | VM_ALLOC_WAITFAIL)) != 0)
4433 if (allocflags & VM_ALLOC_ZERO && (m->flags & PG_ZERO) == 0)
4437 vm_page_grab_release(m, allocflags);
4443 * Locklessly attempt to acquire a page given a (object, pindex) tuple
4444 * and an optional previous page to avoid the radix lookup. The resulting
4445 * page will be validated against the identity tuple and busied or wired
4446 * as requested. A NULL *mp return guarantees that the page was not in
4447 * radix at the time of the call but callers must perform higher level
4448 * synchronization or retry the operation under a lock if they require
4449 * an atomic answer. This is the only lock free validation routine,
4450 * other routines can depend on the resulting page state.
4452 * The return value indicates whether the operation failed due to caller
4453 * flags. The return is tri-state with mp:
4455 * (true, *mp != NULL) - The operation was successful.
4456 * (true, *mp == NULL) - The page was not found in tree.
4457 * (false, *mp == NULL) - WAITFAIL or NOWAIT prevented acquisition.
4460 vm_page_acquire_unlocked(vm_object_t object, vm_pindex_t pindex,
4461 vm_page_t prev, vm_page_t *mp, int allocflags)
4465 vm_page_grab_check(allocflags);
4466 MPASS(prev == NULL || vm_page_busied(prev) || vm_page_wired(prev));
4471 * We may see a false NULL here because the previous page
4472 * has been removed or just inserted and the list is loaded
4473 * without barriers. Switch to radix to verify.
4475 if (prev == NULL || (m = TAILQ_NEXT(prev, listq)) == NULL ||
4476 QMD_IS_TRASHED(m) || m->pindex != pindex ||
4477 atomic_load_ptr(&m->object) != object) {
4480 * This guarantees the result is instantaneously
4483 m = vm_radix_lookup_unlocked(&object->rtree, pindex);
4487 if (vm_page_trybusy(m, allocflags)) {
4488 if (m->object == object && m->pindex == pindex)
4491 vm_page_busy_release(m);
4495 if (!vm_page_grab_sleep(object, m, pindex, "pgnslp",
4499 if ((allocflags & VM_ALLOC_WIRED) != 0)
4501 vm_page_grab_release(m, allocflags);
4507 * Try to locklessly grab a page and fall back to the object lock if NOCREAT
4511 vm_page_grab_unlocked(vm_object_t object, vm_pindex_t pindex, int allocflags)
4515 vm_page_grab_check(allocflags);
4517 if (!vm_page_acquire_unlocked(object, pindex, NULL, &m, allocflags))
4523 * The radix lockless lookup should never return a false negative
4524 * errors. If the user specifies NOCREAT they are guaranteed there
4525 * was no page present at the instant of the call. A NOCREAT caller
4526 * must handle create races gracefully.
4528 if ((allocflags & VM_ALLOC_NOCREAT) != 0)
4531 VM_OBJECT_WLOCK(object);
4532 m = vm_page_grab(object, pindex, allocflags);
4533 VM_OBJECT_WUNLOCK(object);
4539 * Grab a page and make it valid, paging in if necessary. Pages missing from
4540 * their pager are zero filled and validated. If a VM_ALLOC_COUNT is supplied
4541 * and the page is not valid as many as VM_INITIAL_PAGEIN pages can be brought
4542 * in simultaneously. Additional pages will be left on a paging queue but
4543 * will neither be wired nor busy regardless of allocflags.
4546 vm_page_grab_valid(vm_page_t *mp, vm_object_t object, vm_pindex_t pindex, int allocflags)
4549 vm_page_t ma[VM_INITIAL_PAGEIN];
4550 int after, i, pflags, rv;
4552 KASSERT((allocflags & VM_ALLOC_SBUSY) == 0 ||
4553 (allocflags & VM_ALLOC_IGN_SBUSY) != 0,
4554 ("vm_page_grab_valid: VM_ALLOC_SBUSY/VM_ALLOC_IGN_SBUSY mismatch"));
4555 KASSERT((allocflags &
4556 (VM_ALLOC_NOWAIT | VM_ALLOC_WAITFAIL | VM_ALLOC_ZERO)) == 0,
4557 ("vm_page_grab_valid: Invalid flags 0x%X", allocflags));
4558 VM_OBJECT_ASSERT_WLOCKED(object);
4559 pflags = allocflags & ~(VM_ALLOC_NOBUSY | VM_ALLOC_SBUSY |
4561 pflags |= VM_ALLOC_WAITFAIL;
4564 if ((m = vm_page_lookup(object, pindex)) != NULL) {
4566 * If the page is fully valid it can only become invalid
4567 * with the object lock held. If it is not valid it can
4568 * become valid with the busy lock held. Therefore, we
4569 * may unnecessarily lock the exclusive busy here if we
4570 * race with I/O completion not using the object lock.
4571 * However, we will not end up with an invalid page and a
4574 if (!vm_page_trybusy(m,
4575 vm_page_all_valid(m) ? allocflags : 0)) {
4576 (void)vm_page_grab_sleep(object, m, pindex, "pgrbwt",
4580 if (vm_page_all_valid(m))
4582 if ((allocflags & VM_ALLOC_NOCREAT) != 0) {
4583 vm_page_busy_release(m);
4585 return (VM_PAGER_FAIL);
4587 } else if ((allocflags & VM_ALLOC_NOCREAT) != 0) {
4589 return (VM_PAGER_FAIL);
4590 } else if ((m = vm_page_alloc(object, pindex, pflags)) == NULL) {
4594 vm_page_assert_xbusied(m);
4595 if (vm_pager_has_page(object, pindex, NULL, &after)) {
4596 after = MIN(after, VM_INITIAL_PAGEIN);
4597 after = MIN(after, allocflags >> VM_ALLOC_COUNT_SHIFT);
4598 after = MAX(after, 1);
4600 for (i = 1; i < after; i++) {
4601 if ((ma[i] = vm_page_next(ma[i - 1])) != NULL) {
4602 if (ma[i]->valid || !vm_page_tryxbusy(ma[i]))
4605 ma[i] = vm_page_alloc(object, m->pindex + i,
4612 vm_object_pip_add(object, after);
4613 VM_OBJECT_WUNLOCK(object);
4614 rv = vm_pager_get_pages(object, ma, after, NULL, NULL);
4615 VM_OBJECT_WLOCK(object);
4616 vm_object_pip_wakeupn(object, after);
4617 /* Pager may have replaced a page. */
4619 if (rv != VM_PAGER_OK) {
4620 for (i = 0; i < after; i++) {
4621 if (!vm_page_wired(ma[i]))
4622 vm_page_free(ma[i]);
4624 vm_page_xunbusy(ma[i]);
4629 for (i = 1; i < after; i++)
4630 vm_page_readahead_finish(ma[i]);
4631 MPASS(vm_page_all_valid(m));
4633 vm_page_zero_invalid(m, TRUE);
4636 if ((allocflags & VM_ALLOC_WIRED) != 0)
4638 if ((allocflags & VM_ALLOC_SBUSY) != 0 && vm_page_xbusied(m))
4639 vm_page_busy_downgrade(m);
4640 else if ((allocflags & VM_ALLOC_NOBUSY) != 0)
4641 vm_page_busy_release(m);
4643 return (VM_PAGER_OK);
4647 * Locklessly grab a valid page. If the page is not valid or not yet
4648 * allocated this will fall back to the object lock method.
4651 vm_page_grab_valid_unlocked(vm_page_t *mp, vm_object_t object,
4652 vm_pindex_t pindex, int allocflags)
4658 KASSERT((allocflags & VM_ALLOC_SBUSY) == 0 ||
4659 (allocflags & VM_ALLOC_IGN_SBUSY) != 0,
4660 ("vm_page_grab_valid_unlocked: VM_ALLOC_SBUSY/VM_ALLOC_IGN_SBUSY "
4662 KASSERT((allocflags &
4663 (VM_ALLOC_NOWAIT | VM_ALLOC_WAITFAIL | VM_ALLOC_ZERO)) == 0,
4664 ("vm_page_grab_valid_unlocked: Invalid flags 0x%X", allocflags));
4667 * Attempt a lockless lookup and busy. We need at least an sbusy
4668 * before we can inspect the valid field and return a wired page.
4670 flags = allocflags & ~(VM_ALLOC_NOBUSY | VM_ALLOC_WIRED);
4671 if (!vm_page_acquire_unlocked(object, pindex, NULL, mp, flags))
4672 return (VM_PAGER_FAIL);
4673 if ((m = *mp) != NULL) {
4674 if (vm_page_all_valid(m)) {
4675 if ((allocflags & VM_ALLOC_WIRED) != 0)
4677 vm_page_grab_release(m, allocflags);
4678 return (VM_PAGER_OK);
4680 vm_page_busy_release(m);
4682 if ((allocflags & VM_ALLOC_NOCREAT) != 0) {
4684 return (VM_PAGER_FAIL);
4686 VM_OBJECT_WLOCK(object);
4687 error = vm_page_grab_valid(mp, object, pindex, allocflags);
4688 VM_OBJECT_WUNLOCK(object);
4694 * Return the specified range of pages from the given object. For each
4695 * page offset within the range, if a page already exists within the object
4696 * at that offset and it is busy, then wait for it to change state. If,
4697 * instead, the page doesn't exist, then allocate it.
4699 * The caller must always specify an allocation class.
4701 * allocation classes:
4702 * VM_ALLOC_NORMAL normal process request
4703 * VM_ALLOC_SYSTEM system *really* needs the pages
4705 * The caller must always specify that the pages are to be busied and/or
4708 * optional allocation flags:
4709 * VM_ALLOC_IGN_SBUSY do not sleep on soft busy pages
4710 * VM_ALLOC_NOBUSY do not exclusive busy the page
4711 * VM_ALLOC_NOWAIT do not sleep
4712 * VM_ALLOC_SBUSY set page to sbusy state
4713 * VM_ALLOC_WIRED wire the pages
4714 * VM_ALLOC_ZERO zero and validate any invalid pages
4716 * If VM_ALLOC_NOWAIT is not specified, this routine may sleep. Otherwise, it
4717 * may return a partial prefix of the requested range.
4720 vm_page_grab_pages(vm_object_t object, vm_pindex_t pindex, int allocflags,
4721 vm_page_t *ma, int count)
4727 VM_OBJECT_ASSERT_WLOCKED(object);
4728 KASSERT(((u_int)allocflags >> VM_ALLOC_COUNT_SHIFT) == 0,
4729 ("vm_page_grap_pages: VM_ALLOC_COUNT() is not allowed"));
4730 vm_page_grab_check(allocflags);
4732 pflags = vm_page_grab_pflags(allocflags);
4738 m = vm_radix_lookup_le(&object->rtree, pindex + i);
4739 if (m == NULL || m->pindex != pindex + i) {
4743 mpred = TAILQ_PREV(m, pglist, listq);
4744 for (; i < count; i++) {
4746 if (!vm_page_tryacquire(m, allocflags)) {
4747 if (vm_page_grab_sleep(object, m, pindex,
4748 "grbmaw", allocflags, true))
4753 if ((allocflags & VM_ALLOC_NOCREAT) != 0)
4755 m = vm_page_alloc_after(object, pindex + i,
4756 pflags | VM_ALLOC_COUNT(count - i), mpred);
4758 if ((allocflags & (VM_ALLOC_NOWAIT |
4759 VM_ALLOC_WAITFAIL)) != 0)
4764 if (vm_page_none_valid(m) &&
4765 (allocflags & VM_ALLOC_ZERO) != 0) {
4766 if ((m->flags & PG_ZERO) == 0)
4770 vm_page_grab_release(m, allocflags);
4772 m = vm_page_next(m);
4778 * Unlocked variant of vm_page_grab_pages(). This accepts the same flags
4779 * and will fall back to the locked variant to handle allocation.
4782 vm_page_grab_pages_unlocked(vm_object_t object, vm_pindex_t pindex,
4783 int allocflags, vm_page_t *ma, int count)
4789 vm_page_grab_check(allocflags);
4792 * Modify flags for lockless acquire to hold the page until we
4793 * set it valid if necessary.
4795 flags = allocflags & ~VM_ALLOC_NOBUSY;
4797 for (i = 0; i < count; i++, pindex++) {
4798 if (!vm_page_acquire_unlocked(object, pindex, pred, &m, flags))
4802 if ((flags & VM_ALLOC_ZERO) != 0 && vm_page_none_valid(m)) {
4803 if ((m->flags & PG_ZERO) == 0)
4807 /* m will still be wired or busy according to flags. */
4808 vm_page_grab_release(m, allocflags);
4811 if ((allocflags & VM_ALLOC_NOCREAT) != 0)
4814 VM_OBJECT_WLOCK(object);
4815 i += vm_page_grab_pages(object, pindex, allocflags, &ma[i], count);
4816 VM_OBJECT_WUNLOCK(object);
4822 * Mapping function for valid or dirty bits in a page.
4824 * Inputs are required to range within a page.
4827 vm_page_bits(int base, int size)
4833 base + size <= PAGE_SIZE,
4834 ("vm_page_bits: illegal base/size %d/%d", base, size)
4837 if (size == 0) /* handle degenerate case */
4840 first_bit = base >> DEV_BSHIFT;
4841 last_bit = (base + size - 1) >> DEV_BSHIFT;
4843 return (((vm_page_bits_t)2 << last_bit) -
4844 ((vm_page_bits_t)1 << first_bit));
4848 vm_page_bits_set(vm_page_t m, vm_page_bits_t *bits, vm_page_bits_t set)
4851 #if PAGE_SIZE == 32768
4852 atomic_set_64((uint64_t *)bits, set);
4853 #elif PAGE_SIZE == 16384
4854 atomic_set_32((uint32_t *)bits, set);
4855 #elif (PAGE_SIZE == 8192) && defined(atomic_set_16)
4856 atomic_set_16((uint16_t *)bits, set);
4857 #elif (PAGE_SIZE == 4096) && defined(atomic_set_8)
4858 atomic_set_8((uint8_t *)bits, set);
4859 #else /* PAGE_SIZE <= 8192 */
4863 addr = (uintptr_t)bits;
4865 * Use a trick to perform a 32-bit atomic on the
4866 * containing aligned word, to not depend on the existence
4867 * of atomic_{set, clear}_{8, 16}.
4869 shift = addr & (sizeof(uint32_t) - 1);
4870 #if BYTE_ORDER == BIG_ENDIAN
4871 shift = (sizeof(uint32_t) - sizeof(vm_page_bits_t) - shift) * NBBY;
4875 addr &= ~(sizeof(uint32_t) - 1);
4876 atomic_set_32((uint32_t *)addr, set << shift);
4877 #endif /* PAGE_SIZE */
4881 vm_page_bits_clear(vm_page_t m, vm_page_bits_t *bits, vm_page_bits_t clear)
4884 #if PAGE_SIZE == 32768
4885 atomic_clear_64((uint64_t *)bits, clear);
4886 #elif PAGE_SIZE == 16384
4887 atomic_clear_32((uint32_t *)bits, clear);
4888 #elif (PAGE_SIZE == 8192) && defined(atomic_clear_16)
4889 atomic_clear_16((uint16_t *)bits, clear);
4890 #elif (PAGE_SIZE == 4096) && defined(atomic_clear_8)
4891 atomic_clear_8((uint8_t *)bits, clear);
4892 #else /* PAGE_SIZE <= 8192 */
4896 addr = (uintptr_t)bits;
4898 * Use a trick to perform a 32-bit atomic on the
4899 * containing aligned word, to not depend on the existence
4900 * of atomic_{set, clear}_{8, 16}.
4902 shift = addr & (sizeof(uint32_t) - 1);
4903 #if BYTE_ORDER == BIG_ENDIAN
4904 shift = (sizeof(uint32_t) - sizeof(vm_page_bits_t) - shift) * NBBY;
4908 addr &= ~(sizeof(uint32_t) - 1);
4909 atomic_clear_32((uint32_t *)addr, clear << shift);
4910 #endif /* PAGE_SIZE */
4913 static inline vm_page_bits_t
4914 vm_page_bits_swap(vm_page_t m, vm_page_bits_t *bits, vm_page_bits_t newbits)
4916 #if PAGE_SIZE == 32768
4920 while (atomic_fcmpset_64(bits, &old, newbits) == 0);
4922 #elif PAGE_SIZE == 16384
4926 while (atomic_fcmpset_32(bits, &old, newbits) == 0);
4928 #elif (PAGE_SIZE == 8192) && defined(atomic_fcmpset_16)
4932 while (atomic_fcmpset_16(bits, &old, newbits) == 0);
4934 #elif (PAGE_SIZE == 4096) && defined(atomic_fcmpset_8)
4938 while (atomic_fcmpset_8(bits, &old, newbits) == 0);
4940 #else /* PAGE_SIZE <= 4096*/
4942 uint32_t old, new, mask;
4945 addr = (uintptr_t)bits;
4947 * Use a trick to perform a 32-bit atomic on the
4948 * containing aligned word, to not depend on the existence
4949 * of atomic_{set, swap, clear}_{8, 16}.
4951 shift = addr & (sizeof(uint32_t) - 1);
4952 #if BYTE_ORDER == BIG_ENDIAN
4953 shift = (sizeof(uint32_t) - sizeof(vm_page_bits_t) - shift) * NBBY;
4957 addr &= ~(sizeof(uint32_t) - 1);
4958 mask = VM_PAGE_BITS_ALL << shift;
4963 new |= newbits << shift;
4964 } while (atomic_fcmpset_32((uint32_t *)addr, &old, new) == 0);
4965 return (old >> shift);
4966 #endif /* PAGE_SIZE */
4970 * vm_page_set_valid_range:
4972 * Sets portions of a page valid. The arguments are expected
4973 * to be DEV_BSIZE aligned but if they aren't the bitmap is inclusive
4974 * of any partial chunks touched by the range. The invalid portion of
4975 * such chunks will be zeroed.
4977 * (base + size) must be less then or equal to PAGE_SIZE.
4980 vm_page_set_valid_range(vm_page_t m, int base, int size)
4983 vm_page_bits_t pagebits;
4985 vm_page_assert_busied(m);
4986 if (size == 0) /* handle degenerate case */
4990 * If the base is not DEV_BSIZE aligned and the valid
4991 * bit is clear, we have to zero out a portion of the
4994 if ((frag = rounddown2(base, DEV_BSIZE)) != base &&
4995 (m->valid & (1 << (base >> DEV_BSHIFT))) == 0)
4996 pmap_zero_page_area(m, frag, base - frag);
4999 * If the ending offset is not DEV_BSIZE aligned and the
5000 * valid bit is clear, we have to zero out a portion of
5003 endoff = base + size;
5004 if ((frag = rounddown2(endoff, DEV_BSIZE)) != endoff &&
5005 (m->valid & (1 << (endoff >> DEV_BSHIFT))) == 0)
5006 pmap_zero_page_area(m, endoff,
5007 DEV_BSIZE - (endoff & (DEV_BSIZE - 1)));
5010 * Assert that no previously invalid block that is now being validated
5013 KASSERT((~m->valid & vm_page_bits(base, size) & m->dirty) == 0,
5014 ("vm_page_set_valid_range: page %p is dirty", m));
5017 * Set valid bits inclusive of any overlap.
5019 pagebits = vm_page_bits(base, size);
5020 if (vm_page_xbusied(m))
5021 m->valid |= pagebits;
5023 vm_page_bits_set(m, &m->valid, pagebits);
5027 * Set the page dirty bits and free the invalid swap space if
5028 * present. Returns the previous dirty bits.
5031 vm_page_set_dirty(vm_page_t m)
5035 VM_PAGE_OBJECT_BUSY_ASSERT(m);
5037 if (vm_page_xbusied(m) && !pmap_page_is_write_mapped(m)) {
5039 m->dirty = VM_PAGE_BITS_ALL;
5041 old = vm_page_bits_swap(m, &m->dirty, VM_PAGE_BITS_ALL);
5042 if (old == 0 && (m->a.flags & PGA_SWAP_SPACE) != 0)
5043 vm_pager_page_unswapped(m);
5049 * Clear the given bits from the specified page's dirty field.
5051 static __inline void
5052 vm_page_clear_dirty_mask(vm_page_t m, vm_page_bits_t pagebits)
5055 vm_page_assert_busied(m);
5058 * If the page is xbusied and not write mapped we are the
5059 * only thread that can modify dirty bits. Otherwise, The pmap
5060 * layer can call vm_page_dirty() without holding a distinguished
5061 * lock. The combination of page busy and atomic operations
5062 * suffice to guarantee consistency of the page dirty field.
5064 if (vm_page_xbusied(m) && !pmap_page_is_write_mapped(m))
5065 m->dirty &= ~pagebits;
5067 vm_page_bits_clear(m, &m->dirty, pagebits);
5071 * vm_page_set_validclean:
5073 * Sets portions of a page valid and clean. The arguments are expected
5074 * to be DEV_BSIZE aligned but if they aren't the bitmap is inclusive
5075 * of any partial chunks touched by the range. The invalid portion of
5076 * such chunks will be zero'd.
5078 * (base + size) must be less then or equal to PAGE_SIZE.
5081 vm_page_set_validclean(vm_page_t m, int base, int size)
5083 vm_page_bits_t oldvalid, pagebits;
5086 vm_page_assert_busied(m);
5087 if (size == 0) /* handle degenerate case */
5091 * If the base is not DEV_BSIZE aligned and the valid
5092 * bit is clear, we have to zero out a portion of the
5095 if ((frag = rounddown2(base, DEV_BSIZE)) != base &&
5096 (m->valid & ((vm_page_bits_t)1 << (base >> DEV_BSHIFT))) == 0)
5097 pmap_zero_page_area(m, frag, base - frag);
5100 * If the ending offset is not DEV_BSIZE aligned and the
5101 * valid bit is clear, we have to zero out a portion of
5104 endoff = base + size;
5105 if ((frag = rounddown2(endoff, DEV_BSIZE)) != endoff &&
5106 (m->valid & ((vm_page_bits_t)1 << (endoff >> DEV_BSHIFT))) == 0)
5107 pmap_zero_page_area(m, endoff,
5108 DEV_BSIZE - (endoff & (DEV_BSIZE - 1)));
5111 * Set valid, clear dirty bits. If validating the entire
5112 * page we can safely clear the pmap modify bit. We also
5113 * use this opportunity to clear the PGA_NOSYNC flag. If a process
5114 * takes a write fault on a MAP_NOSYNC memory area the flag will
5117 * We set valid bits inclusive of any overlap, but we can only
5118 * clear dirty bits for DEV_BSIZE chunks that are fully within
5121 oldvalid = m->valid;
5122 pagebits = vm_page_bits(base, size);
5123 if (vm_page_xbusied(m))
5124 m->valid |= pagebits;
5126 vm_page_bits_set(m, &m->valid, pagebits);
5128 if ((frag = base & (DEV_BSIZE - 1)) != 0) {
5129 frag = DEV_BSIZE - frag;
5135 pagebits = vm_page_bits(base, size & (DEV_BSIZE - 1));
5137 if (base == 0 && size == PAGE_SIZE) {
5139 * The page can only be modified within the pmap if it is
5140 * mapped, and it can only be mapped if it was previously
5143 if (oldvalid == VM_PAGE_BITS_ALL)
5145 * Perform the pmap_clear_modify() first. Otherwise,
5146 * a concurrent pmap operation, such as
5147 * pmap_protect(), could clear a modification in the
5148 * pmap and set the dirty field on the page before
5149 * pmap_clear_modify() had begun and after the dirty
5150 * field was cleared here.
5152 pmap_clear_modify(m);
5154 vm_page_aflag_clear(m, PGA_NOSYNC);
5155 } else if (oldvalid != VM_PAGE_BITS_ALL && vm_page_xbusied(m))
5156 m->dirty &= ~pagebits;
5158 vm_page_clear_dirty_mask(m, pagebits);
5162 vm_page_clear_dirty(vm_page_t m, int base, int size)
5165 vm_page_clear_dirty_mask(m, vm_page_bits(base, size));
5169 * vm_page_set_invalid:
5171 * Invalidates DEV_BSIZE'd chunks within a page. Both the
5172 * valid and dirty bits for the effected areas are cleared.
5175 vm_page_set_invalid(vm_page_t m, int base, int size)
5177 vm_page_bits_t bits;
5181 * The object lock is required so that pages can't be mapped
5182 * read-only while we're in the process of invalidating them.
5185 VM_OBJECT_ASSERT_WLOCKED(object);
5186 vm_page_assert_busied(m);
5188 if (object->type == OBJT_VNODE && base == 0 && IDX_TO_OFF(m->pindex) +
5189 size >= object->un_pager.vnp.vnp_size)
5190 bits = VM_PAGE_BITS_ALL;
5192 bits = vm_page_bits(base, size);
5193 if (object->ref_count != 0 && vm_page_all_valid(m) && bits != 0)
5195 KASSERT((bits == 0 && vm_page_all_valid(m)) ||
5196 !pmap_page_is_mapped(m),
5197 ("vm_page_set_invalid: page %p is mapped", m));
5198 if (vm_page_xbusied(m)) {
5202 vm_page_bits_clear(m, &m->valid, bits);
5203 vm_page_bits_clear(m, &m->dirty, bits);
5210 * Invalidates the entire page. The page must be busy, unmapped, and
5211 * the enclosing object must be locked. The object locks protects
5212 * against concurrent read-only pmap enter which is done without
5216 vm_page_invalid(vm_page_t m)
5219 vm_page_assert_busied(m);
5220 VM_OBJECT_ASSERT_LOCKED(m->object);
5221 MPASS(!pmap_page_is_mapped(m));
5223 if (vm_page_xbusied(m))
5226 vm_page_bits_clear(m, &m->valid, VM_PAGE_BITS_ALL);
5230 * vm_page_zero_invalid()
5232 * The kernel assumes that the invalid portions of a page contain
5233 * garbage, but such pages can be mapped into memory by user code.
5234 * When this occurs, we must zero out the non-valid portions of the
5235 * page so user code sees what it expects.
5237 * Pages are most often semi-valid when the end of a file is mapped
5238 * into memory and the file's size is not page aligned.
5241 vm_page_zero_invalid(vm_page_t m, boolean_t setvalid)
5247 * Scan the valid bits looking for invalid sections that
5248 * must be zeroed. Invalid sub-DEV_BSIZE'd areas ( where the
5249 * valid bit may be set ) have already been zeroed by
5250 * vm_page_set_validclean().
5252 for (b = i = 0; i <= PAGE_SIZE / DEV_BSIZE; ++i) {
5253 if (i == (PAGE_SIZE / DEV_BSIZE) ||
5254 (m->valid & ((vm_page_bits_t)1 << i))) {
5256 pmap_zero_page_area(m,
5257 b << DEV_BSHIFT, (i - b) << DEV_BSHIFT);
5264 * setvalid is TRUE when we can safely set the zero'd areas
5265 * as being valid. We can do this if there are no cache consistancy
5266 * issues. e.g. it is ok to do with UFS, but not ok to do with NFS.
5275 * Is (partial) page valid? Note that the case where size == 0
5276 * will return FALSE in the degenerate case where the page is
5277 * entirely invalid, and TRUE otherwise.
5279 * Some callers envoke this routine without the busy lock held and
5280 * handle races via higher level locks. Typical callers should
5281 * hold a busy lock to prevent invalidation.
5284 vm_page_is_valid(vm_page_t m, int base, int size)
5286 vm_page_bits_t bits;
5288 bits = vm_page_bits(base, size);
5289 return (m->valid != 0 && (m->valid & bits) == bits);
5293 * Returns true if all of the specified predicates are true for the entire
5294 * (super)page and false otherwise.
5297 vm_page_ps_test(vm_page_t m, int flags, vm_page_t skip_m)
5303 if (skip_m != NULL && skip_m->object != object)
5305 VM_OBJECT_ASSERT_LOCKED(object);
5306 npages = atop(pagesizes[m->psind]);
5309 * The physically contiguous pages that make up a superpage, i.e., a
5310 * page with a page size index ("psind") greater than zero, will
5311 * occupy adjacent entries in vm_page_array[].
5313 for (i = 0; i < npages; i++) {
5314 /* Always test object consistency, including "skip_m". */
5315 if (m[i].object != object)
5317 if (&m[i] == skip_m)
5319 if ((flags & PS_NONE_BUSY) != 0 && vm_page_busied(&m[i]))
5321 if ((flags & PS_ALL_DIRTY) != 0) {
5323 * Calling vm_page_test_dirty() or pmap_is_modified()
5324 * might stop this case from spuriously returning
5325 * "false". However, that would require a write lock
5326 * on the object containing "m[i]".
5328 if (m[i].dirty != VM_PAGE_BITS_ALL)
5331 if ((flags & PS_ALL_VALID) != 0 &&
5332 m[i].valid != VM_PAGE_BITS_ALL)
5339 * Set the page's dirty bits if the page is modified.
5342 vm_page_test_dirty(vm_page_t m)
5345 vm_page_assert_busied(m);
5346 if (m->dirty != VM_PAGE_BITS_ALL && pmap_is_modified(m))
5351 vm_page_valid(vm_page_t m)
5354 vm_page_assert_busied(m);
5355 if (vm_page_xbusied(m))
5356 m->valid = VM_PAGE_BITS_ALL;
5358 vm_page_bits_set(m, &m->valid, VM_PAGE_BITS_ALL);
5362 vm_page_lock_KBI(vm_page_t m, const char *file, int line)
5365 mtx_lock_flags_(vm_page_lockptr(m), 0, file, line);
5369 vm_page_unlock_KBI(vm_page_t m, const char *file, int line)
5372 mtx_unlock_flags_(vm_page_lockptr(m), 0, file, line);
5376 vm_page_trylock_KBI(vm_page_t m, const char *file, int line)
5379 return (mtx_trylock_flags_(vm_page_lockptr(m), 0, file, line));
5382 #if defined(INVARIANTS) || defined(INVARIANT_SUPPORT)
5384 vm_page_assert_locked_KBI(vm_page_t m, const char *file, int line)
5387 vm_page_lock_assert_KBI(m, MA_OWNED, file, line);
5391 vm_page_lock_assert_KBI(vm_page_t m, int a, const char *file, int line)
5394 mtx_assert_(vm_page_lockptr(m), a, file, line);
5400 vm_page_object_busy_assert(vm_page_t m)
5404 * Certain of the page's fields may only be modified by the
5405 * holder of a page or object busy.
5407 if (m->object != NULL && !vm_page_busied(m))
5408 VM_OBJECT_ASSERT_BUSY(m->object);
5412 vm_page_assert_pga_writeable(vm_page_t m, uint16_t bits)
5415 if ((bits & PGA_WRITEABLE) == 0)
5419 * The PGA_WRITEABLE flag can only be set if the page is
5420 * managed, is exclusively busied or the object is locked.
5421 * Currently, this flag is only set by pmap_enter().
5423 KASSERT((m->oflags & VPO_UNMANAGED) == 0,
5424 ("PGA_WRITEABLE on unmanaged page"));
5425 if (!vm_page_xbusied(m))
5426 VM_OBJECT_ASSERT_BUSY(m->object);
5430 #include "opt_ddb.h"
5432 #include <sys/kernel.h>
5434 #include <ddb/ddb.h>
5436 DB_SHOW_COMMAND(page, vm_page_print_page_info)
5439 db_printf("vm_cnt.v_free_count: %d\n", vm_free_count());
5440 db_printf("vm_cnt.v_inactive_count: %d\n", vm_inactive_count());
5441 db_printf("vm_cnt.v_active_count: %d\n", vm_active_count());
5442 db_printf("vm_cnt.v_laundry_count: %d\n", vm_laundry_count());
5443 db_printf("vm_cnt.v_wire_count: %d\n", vm_wire_count());
5444 db_printf("vm_cnt.v_free_reserved: %d\n", vm_cnt.v_free_reserved);
5445 db_printf("vm_cnt.v_free_min: %d\n", vm_cnt.v_free_min);
5446 db_printf("vm_cnt.v_free_target: %d\n", vm_cnt.v_free_target);
5447 db_printf("vm_cnt.v_inactive_target: %d\n", vm_cnt.v_inactive_target);
5450 DB_SHOW_COMMAND(pageq, vm_page_print_pageq_info)
5454 db_printf("pq_free %d\n", vm_free_count());
5455 for (dom = 0; dom < vm_ndomains; dom++) {
5457 "dom %d page_cnt %d free %d pq_act %d pq_inact %d pq_laund %d pq_unsw %d\n",
5459 vm_dom[dom].vmd_page_count,
5460 vm_dom[dom].vmd_free_count,
5461 vm_dom[dom].vmd_pagequeues[PQ_ACTIVE].pq_cnt,
5462 vm_dom[dom].vmd_pagequeues[PQ_INACTIVE].pq_cnt,
5463 vm_dom[dom].vmd_pagequeues[PQ_LAUNDRY].pq_cnt,
5464 vm_dom[dom].vmd_pagequeues[PQ_UNSWAPPABLE].pq_cnt);
5468 DB_SHOW_COMMAND(pginfo, vm_page_print_pginfo)
5471 boolean_t phys, virt;
5474 db_printf("show pginfo addr\n");
5478 phys = strchr(modif, 'p') != NULL;
5479 virt = strchr(modif, 'v') != NULL;
5481 m = PHYS_TO_VM_PAGE(pmap_kextract(addr));
5483 m = PHYS_TO_VM_PAGE(addr);
5485 m = (vm_page_t)addr;
5487 "page %p obj %p pidx 0x%jx phys 0x%jx q %d ref 0x%x\n"
5488 " af 0x%x of 0x%x f 0x%x act %d busy %x valid 0x%x dirty 0x%x\n",
5489 m, m->object, (uintmax_t)m->pindex, (uintmax_t)m->phys_addr,
5490 m->a.queue, m->ref_count, m->a.flags, m->oflags,
5491 m->flags, m->a.act_count, m->busy_lock, m->valid, m->dirty);