2 * SPDX-License-Identifier: BSD-4-Clause
4 * Copyright (c) 1991 Regents of the University of California.
6 * Copyright (c) 1994 John S. Dyson
8 * Copyright (c) 1994 David Greenman
10 * Copyright (c) 2003 Peter Wemm
11 * All rights reserved.
12 * Copyright (c) 2005-2010 Alan L. Cox <alc@cs.rice.edu>
13 * All rights reserved.
15 * This code is derived from software contributed to Berkeley by
16 * the Systems Programming Group of the University of Utah Computer
17 * Science Department and William Jolitz of UUNET Technologies Inc.
19 * Redistribution and use in source and binary forms, with or without
20 * modification, are permitted provided that the following conditions
22 * 1. Redistributions of source code must retain the above copyright
23 * notice, this list of conditions and the following disclaimer.
24 * 2. Redistributions in binary form must reproduce the above copyright
25 * notice, this list of conditions and the following disclaimer in the
26 * documentation and/or other materials provided with the distribution.
27 * 3. All advertising materials mentioning features or use of this software
28 * must display the following acknowledgement:
29 * This product includes software developed by the University of
30 * California, Berkeley and its contributors.
31 * 4. Neither the name of the University nor the names of its contributors
32 * may be used to endorse or promote products derived from this software
33 * without specific prior written permission.
35 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
36 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
37 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
38 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
39 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
40 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
41 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
42 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
43 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
44 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
47 * from: @(#)pmap.c 7.7 (Berkeley) 5/12/91
50 * Copyright (c) 2003 Networks Associates Technology, Inc.
51 * Copyright (c) 2014-2020 The FreeBSD Foundation
52 * All rights reserved.
54 * This software was developed for the FreeBSD Project by Jake Burkholder,
55 * Safeport Network Services, and Network Associates Laboratories, the
56 * Security Research Division of Network Associates, Inc. under
57 * DARPA/SPAWAR contract N66001-01-C-8035 ("CBOSS"), as part of the DARPA
58 * CHATS research program.
60 * Portions of this software were developed by
61 * Konstantin Belousov <kib@FreeBSD.org> under sponsorship from
62 * the FreeBSD Foundation.
64 * Redistribution and use in source and binary forms, with or without
65 * modification, are permitted provided that the following conditions
67 * 1. Redistributions of source code must retain the above copyright
68 * notice, this list of conditions and the following disclaimer.
69 * 2. Redistributions in binary form must reproduce the above copyright
70 * notice, this list of conditions and the following disclaimer in the
71 * documentation and/or other materials provided with the distribution.
73 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
74 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
75 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
76 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
77 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
78 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
79 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
80 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
81 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
82 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
86 #define AMD64_NPT_AWARE
88 #include <sys/cdefs.h>
89 __FBSDID("$FreeBSD$");
92 * Manages physical address maps.
94 * Since the information managed by this module is
95 * also stored by the logical address mapping module,
96 * this module may throw away valid virtual-to-physical
97 * mappings at almost any time. However, invalidations
98 * of virtual-to-physical mappings must be done as
101 * In order to cope with hardware architectures which
102 * make virtual-to-physical map invalidates expensive,
103 * this module may delay invalidate or reduced protection
104 * operations until such time as they are actually
105 * necessary. This module is given full information as
106 * to which processors are currently using which maps,
107 * and to when physical maps must be made correct.
111 #include "opt_pmap.h"
114 #include <sys/param.h>
115 #include <sys/bitstring.h>
117 #include <sys/systm.h>
118 #include <sys/kernel.h>
120 #include <sys/lock.h>
121 #include <sys/malloc.h>
122 #include <sys/mman.h>
123 #include <sys/mutex.h>
124 #include <sys/proc.h>
125 #include <sys/rangeset.h>
126 #include <sys/rwlock.h>
127 #include <sys/sbuf.h>
129 #include <sys/turnstile.h>
130 #include <sys/vmem.h>
131 #include <sys/vmmeter.h>
132 #include <sys/sched.h>
133 #include <sys/sysctl.h>
141 #include <vm/vm_param.h>
142 #include <vm/vm_kern.h>
143 #include <vm/vm_page.h>
144 #include <vm/vm_map.h>
145 #include <vm/vm_object.h>
146 #include <vm/vm_extern.h>
147 #include <vm/vm_pageout.h>
148 #include <vm/vm_pager.h>
149 #include <vm/vm_phys.h>
150 #include <vm/vm_radix.h>
151 #include <vm/vm_reserv.h>
154 #include <machine/intr_machdep.h>
155 #include <x86/apicvar.h>
156 #include <x86/ifunc.h>
157 #include <machine/cpu.h>
158 #include <machine/cputypes.h>
159 #include <machine/md_var.h>
160 #include <machine/pcb.h>
161 #include <machine/specialreg.h>
163 #include <machine/smp.h>
165 #include <machine/sysarch.h>
166 #include <machine/tss.h>
169 #define PMAP_MEMDOM MAXMEMDOM
171 #define PMAP_MEMDOM 1
174 static __inline boolean_t
175 pmap_type_guest(pmap_t pmap)
178 return ((pmap->pm_type == PT_EPT) || (pmap->pm_type == PT_RVI));
181 static __inline boolean_t
182 pmap_emulate_ad_bits(pmap_t pmap)
185 return ((pmap->pm_flags & PMAP_EMULATE_AD_BITS) != 0);
188 static __inline pt_entry_t
189 pmap_valid_bit(pmap_t pmap)
193 switch (pmap->pm_type) {
199 if (pmap_emulate_ad_bits(pmap))
200 mask = EPT_PG_EMUL_V;
205 panic("pmap_valid_bit: invalid pm_type %d", pmap->pm_type);
211 static __inline pt_entry_t
212 pmap_rw_bit(pmap_t pmap)
216 switch (pmap->pm_type) {
222 if (pmap_emulate_ad_bits(pmap))
223 mask = EPT_PG_EMUL_RW;
228 panic("pmap_rw_bit: invalid pm_type %d", pmap->pm_type);
234 static pt_entry_t pg_g;
236 static __inline pt_entry_t
237 pmap_global_bit(pmap_t pmap)
241 switch (pmap->pm_type) {
250 panic("pmap_global_bit: invalid pm_type %d", pmap->pm_type);
256 static __inline pt_entry_t
257 pmap_accessed_bit(pmap_t pmap)
261 switch (pmap->pm_type) {
267 if (pmap_emulate_ad_bits(pmap))
273 panic("pmap_accessed_bit: invalid pm_type %d", pmap->pm_type);
279 static __inline pt_entry_t
280 pmap_modified_bit(pmap_t pmap)
284 switch (pmap->pm_type) {
290 if (pmap_emulate_ad_bits(pmap))
296 panic("pmap_modified_bit: invalid pm_type %d", pmap->pm_type);
302 static __inline pt_entry_t
303 pmap_pku_mask_bit(pmap_t pmap)
306 return (pmap->pm_type == PT_X86 ? X86_PG_PKU_MASK : 0);
309 #if !defined(DIAGNOSTIC)
310 #ifdef __GNUC_GNU_INLINE__
311 #define PMAP_INLINE __attribute__((__gnu_inline__)) inline
313 #define PMAP_INLINE extern inline
320 #define PV_STAT(x) do { x ; } while (0)
322 #define PV_STAT(x) do { } while (0)
327 #define pa_index(pa) ({ \
328 KASSERT((pa) <= vm_phys_segs[vm_phys_nsegs - 1].end, \
329 ("address %lx beyond the last segment", (pa))); \
332 #define pa_to_pmdp(pa) (&pv_table[pa_index(pa)])
333 #define pa_to_pvh(pa) (&(pa_to_pmdp(pa)->pv_page))
334 #define PHYS_TO_PV_LIST_LOCK(pa) ({ \
335 struct rwlock *_lock; \
336 if (__predict_false((pa) > pmap_last_pa)) \
337 _lock = &pv_dummy_large.pv_lock; \
339 _lock = &(pa_to_pmdp(pa)->pv_lock); \
343 #define pa_index(pa) ((pa) >> PDRSHIFT)
344 #define pa_to_pvh(pa) (&pv_table[pa_index(pa)])
346 #define NPV_LIST_LOCKS MAXCPU
348 #define PHYS_TO_PV_LIST_LOCK(pa) \
349 (&pv_list_locks[pa_index(pa) % NPV_LIST_LOCKS])
352 #define CHANGE_PV_LIST_LOCK_TO_PHYS(lockp, pa) do { \
353 struct rwlock **_lockp = (lockp); \
354 struct rwlock *_new_lock; \
356 _new_lock = PHYS_TO_PV_LIST_LOCK(pa); \
357 if (_new_lock != *_lockp) { \
358 if (*_lockp != NULL) \
359 rw_wunlock(*_lockp); \
360 *_lockp = _new_lock; \
365 #define CHANGE_PV_LIST_LOCK_TO_VM_PAGE(lockp, m) \
366 CHANGE_PV_LIST_LOCK_TO_PHYS(lockp, VM_PAGE_TO_PHYS(m))
368 #define RELEASE_PV_LIST_LOCK(lockp) do { \
369 struct rwlock **_lockp = (lockp); \
371 if (*_lockp != NULL) { \
372 rw_wunlock(*_lockp); \
377 #define VM_PAGE_TO_PV_LIST_LOCK(m) \
378 PHYS_TO_PV_LIST_LOCK(VM_PAGE_TO_PHYS(m))
380 struct pmap kernel_pmap_store;
382 vm_offset_t virtual_avail; /* VA of first avail page (after kernel bss) */
383 vm_offset_t virtual_end; /* VA of last avail page (end of kernel AS) */
386 SYSCTL_INT(_machdep, OID_AUTO, nkpt, CTLFLAG_RD, &nkpt, 0,
387 "Number of kernel page table pages allocated on bootup");
390 vm_paddr_t dmaplimit;
391 vm_offset_t kernel_vm_end = VM_MIN_KERNEL_ADDRESS;
394 static SYSCTL_NODE(_vm, OID_AUTO, pmap, CTLFLAG_RD | CTLFLAG_MPSAFE, 0,
395 "VM/pmap parameters");
397 static int pg_ps_enabled = 1;
398 SYSCTL_INT(_vm_pmap, OID_AUTO, pg_ps_enabled, CTLFLAG_RDTUN | CTLFLAG_NOFETCH,
399 &pg_ps_enabled, 0, "Are large page mappings enabled?");
401 int __read_frequently la57 = 0;
402 SYSCTL_INT(_vm_pmap, OID_AUTO, la57, CTLFLAG_RDTUN | CTLFLAG_NOFETCH,
404 "5-level paging for host is enabled");
407 pmap_is_la57(pmap_t pmap)
409 if (pmap->pm_type == PT_X86)
411 return (false); /* XXXKIB handle EPT */
414 #define PAT_INDEX_SIZE 8
415 static int pat_index[PAT_INDEX_SIZE]; /* cache mode to PAT index conversion */
417 static u_int64_t KPTphys; /* phys addr of kernel level 1 */
418 static u_int64_t KPDphys; /* phys addr of kernel level 2 */
419 u_int64_t KPDPphys; /* phys addr of kernel level 3 */
420 u_int64_t KPML4phys; /* phys addr of kernel level 4 */
421 u_int64_t KPML5phys; /* phys addr of kernel level 5,
424 static pml4_entry_t *kernel_pml4;
425 static u_int64_t DMPDphys; /* phys addr of direct mapped level 2 */
426 static u_int64_t DMPDPphys; /* phys addr of direct mapped level 3 */
427 static int ndmpdpphys; /* number of DMPDPphys pages */
429 static vm_paddr_t KERNend; /* phys addr of end of bootstrap data */
432 * pmap_mapdev support pre initialization (i.e. console)
434 #define PMAP_PREINIT_MAPPING_COUNT 8
435 static struct pmap_preinit_mapping {
440 } pmap_preinit_mapping[PMAP_PREINIT_MAPPING_COUNT];
441 static int pmap_initialized;
444 * Data for the pv entry allocation mechanism.
445 * Updates to pv_invl_gen are protected by the pv list lock but reads are not.
449 pc_to_domain(struct pv_chunk *pc)
452 return (_vm_phys_domain(DMAP_TO_PHYS((vm_offset_t)pc)));
456 pc_to_domain(struct pv_chunk *pc __unused)
463 struct pv_chunks_list {
465 TAILQ_HEAD(pch, pv_chunk) pvc_list;
467 } __aligned(CACHE_LINE_SIZE);
469 struct pv_chunks_list __exclusive_cache_line pv_chunks[PMAP_MEMDOM];
472 struct pmap_large_md_page {
473 struct rwlock pv_lock;
474 struct md_page pv_page;
477 __exclusive_cache_line static struct pmap_large_md_page pv_dummy_large;
478 #define pv_dummy pv_dummy_large.pv_page
479 __read_mostly static struct pmap_large_md_page *pv_table;
480 __read_mostly vm_paddr_t pmap_last_pa;
482 static struct rwlock __exclusive_cache_line pv_list_locks[NPV_LIST_LOCKS];
483 static u_long pv_invl_gen[NPV_LIST_LOCKS];
484 static struct md_page *pv_table;
485 static struct md_page pv_dummy;
489 * All those kernel PT submaps that BSD is so fond of
491 pt_entry_t *CMAP1 = NULL;
493 static vm_offset_t qframe = 0;
494 static struct mtx qframe_mtx;
496 static int pmap_flags = PMAP_PDE_SUPERPAGE; /* flags for x86 pmaps */
498 static vmem_t *large_vmem;
499 static u_int lm_ents;
500 #define PMAP_ADDRESS_IN_LARGEMAP(va) ((va) >= LARGEMAP_MIN_ADDRESS && \
501 (va) < LARGEMAP_MIN_ADDRESS + NBPML4 * (u_long)lm_ents)
503 int pmap_pcid_enabled = 1;
504 SYSCTL_INT(_vm_pmap, OID_AUTO, pcid_enabled, CTLFLAG_RDTUN | CTLFLAG_NOFETCH,
505 &pmap_pcid_enabled, 0, "Is TLB Context ID enabled ?");
506 int invpcid_works = 0;
507 SYSCTL_INT(_vm_pmap, OID_AUTO, invpcid_works, CTLFLAG_RD, &invpcid_works, 0,
508 "Is the invpcid instruction available ?");
510 int __read_frequently pti = 0;
511 SYSCTL_INT(_vm_pmap, OID_AUTO, pti, CTLFLAG_RDTUN | CTLFLAG_NOFETCH,
513 "Page Table Isolation enabled");
514 static vm_object_t pti_obj;
515 static pml4_entry_t *pti_pml4;
516 static vm_pindex_t pti_pg_idx;
517 static bool pti_finalized;
519 struct pmap_pkru_range {
520 struct rs_el pkru_rs_el;
525 static uma_zone_t pmap_pkru_ranges_zone;
526 static bool pmap_pkru_same(pmap_t pmap, vm_offset_t sva, vm_offset_t eva);
527 static pt_entry_t pmap_pkru_get(pmap_t pmap, vm_offset_t va);
528 static void pmap_pkru_on_remove(pmap_t pmap, vm_offset_t sva, vm_offset_t eva);
529 static void *pkru_dup_range(void *ctx, void *data);
530 static void pkru_free_range(void *ctx, void *node);
531 static int pmap_pkru_copy(pmap_t dst_pmap, pmap_t src_pmap);
532 static int pmap_pkru_deassign(pmap_t pmap, vm_offset_t sva, vm_offset_t eva);
533 static void pmap_pkru_deassign_all(pmap_t pmap);
536 pmap_pcid_save_cnt_proc(SYSCTL_HANDLER_ARGS)
543 res += cpuid_to_pcpu[i]->pc_pm_save_cnt;
545 return (sysctl_handle_64(oidp, &res, 0, req));
547 SYSCTL_PROC(_vm_pmap, OID_AUTO, pcid_save_cnt, CTLTYPE_U64 | CTLFLAG_RD |
548 CTLFLAG_MPSAFE, NULL, 0, pmap_pcid_save_cnt_proc, "QU",
549 "Count of saved TLB context on switch");
551 static LIST_HEAD(, pmap_invl_gen) pmap_invl_gen_tracker =
552 LIST_HEAD_INITIALIZER(&pmap_invl_gen_tracker);
553 static struct mtx invl_gen_mtx;
554 /* Fake lock object to satisfy turnstiles interface. */
555 static struct lock_object invl_gen_ts = {
558 static struct pmap_invl_gen pmap_invl_gen_head = {
562 static u_long pmap_invl_gen = 1;
563 static int pmap_invl_waiters;
564 static struct callout pmap_invl_callout;
565 static bool pmap_invl_callout_inited;
567 #define PMAP_ASSERT_NOT_IN_DI() \
568 KASSERT(pmap_not_in_di(), ("DI already started"))
575 if ((cpu_feature2 & CPUID2_CX16) == 0)
578 TUNABLE_INT_FETCH("vm.pmap.di_locked", &tun);
583 sysctl_pmap_di_locked(SYSCTL_HANDLER_ARGS)
587 locked = pmap_di_locked();
588 return (sysctl_handle_int(oidp, &locked, 0, req));
590 SYSCTL_PROC(_vm_pmap, OID_AUTO, di_locked, CTLTYPE_INT | CTLFLAG_RDTUN |
591 CTLFLAG_MPSAFE, 0, 0, sysctl_pmap_di_locked, "",
592 "Locked delayed invalidation");
594 static bool pmap_not_in_di_l(void);
595 static bool pmap_not_in_di_u(void);
596 DEFINE_IFUNC(, bool, pmap_not_in_di, (void))
599 return (pmap_di_locked() ? pmap_not_in_di_l : pmap_not_in_di_u);
603 pmap_not_in_di_l(void)
605 struct pmap_invl_gen *invl_gen;
607 invl_gen = &curthread->td_md.md_invl_gen;
608 return (invl_gen->gen == 0);
612 pmap_thread_init_invl_gen_l(struct thread *td)
614 struct pmap_invl_gen *invl_gen;
616 invl_gen = &td->td_md.md_invl_gen;
621 pmap_delayed_invl_wait_block(u_long *m_gen, u_long *invl_gen)
623 struct turnstile *ts;
625 ts = turnstile_trywait(&invl_gen_ts);
626 if (*m_gen > atomic_load_long(invl_gen))
627 turnstile_wait(ts, NULL, TS_SHARED_QUEUE);
629 turnstile_cancel(ts);
633 pmap_delayed_invl_finish_unblock(u_long new_gen)
635 struct turnstile *ts;
637 turnstile_chain_lock(&invl_gen_ts);
638 ts = turnstile_lookup(&invl_gen_ts);
640 pmap_invl_gen = new_gen;
642 turnstile_broadcast(ts, TS_SHARED_QUEUE);
643 turnstile_unpend(ts);
645 turnstile_chain_unlock(&invl_gen_ts);
649 * Start a new Delayed Invalidation (DI) block of code, executed by
650 * the current thread. Within a DI block, the current thread may
651 * destroy both the page table and PV list entries for a mapping and
652 * then release the corresponding PV list lock before ensuring that
653 * the mapping is flushed from the TLBs of any processors with the
657 pmap_delayed_invl_start_l(void)
659 struct pmap_invl_gen *invl_gen;
662 invl_gen = &curthread->td_md.md_invl_gen;
663 PMAP_ASSERT_NOT_IN_DI();
664 mtx_lock(&invl_gen_mtx);
665 if (LIST_EMPTY(&pmap_invl_gen_tracker))
666 currgen = pmap_invl_gen;
668 currgen = LIST_FIRST(&pmap_invl_gen_tracker)->gen;
669 invl_gen->gen = currgen + 1;
670 LIST_INSERT_HEAD(&pmap_invl_gen_tracker, invl_gen, link);
671 mtx_unlock(&invl_gen_mtx);
675 * Finish the DI block, previously started by the current thread. All
676 * required TLB flushes for the pages marked by
677 * pmap_delayed_invl_page() must be finished before this function is
680 * This function works by bumping the global DI generation number to
681 * the generation number of the current thread's DI, unless there is a
682 * pending DI that started earlier. In the latter case, bumping the
683 * global DI generation number would incorrectly signal that the
684 * earlier DI had finished. Instead, this function bumps the earlier
685 * DI's generation number to match the generation number of the
686 * current thread's DI.
689 pmap_delayed_invl_finish_l(void)
691 struct pmap_invl_gen *invl_gen, *next;
693 invl_gen = &curthread->td_md.md_invl_gen;
694 KASSERT(invl_gen->gen != 0, ("missed invl_start"));
695 mtx_lock(&invl_gen_mtx);
696 next = LIST_NEXT(invl_gen, link);
698 pmap_delayed_invl_finish_unblock(invl_gen->gen);
700 next->gen = invl_gen->gen;
701 LIST_REMOVE(invl_gen, link);
702 mtx_unlock(&invl_gen_mtx);
707 pmap_not_in_di_u(void)
709 struct pmap_invl_gen *invl_gen;
711 invl_gen = &curthread->td_md.md_invl_gen;
712 return (((uintptr_t)invl_gen->next & PMAP_INVL_GEN_NEXT_INVALID) != 0);
716 pmap_thread_init_invl_gen_u(struct thread *td)
718 struct pmap_invl_gen *invl_gen;
720 invl_gen = &td->td_md.md_invl_gen;
722 invl_gen->next = (void *)PMAP_INVL_GEN_NEXT_INVALID;
726 pmap_di_load_invl(struct pmap_invl_gen *ptr, struct pmap_invl_gen *out)
728 uint64_t new_high, new_low, old_high, old_low;
731 old_low = new_low = 0;
732 old_high = new_high = (uintptr_t)0;
734 __asm volatile("lock;cmpxchg16b\t%1"
735 : "=@cce" (res), "+m" (*ptr), "+a" (old_low), "+d" (old_high)
736 : "b"(new_low), "c" (new_high)
739 if ((old_high & PMAP_INVL_GEN_NEXT_INVALID) != 0)
742 out->next = (void *)old_high;
745 out->next = (void *)new_high;
751 pmap_di_store_invl(struct pmap_invl_gen *ptr, struct pmap_invl_gen *old_val,
752 struct pmap_invl_gen *new_val)
754 uint64_t new_high, new_low, old_high, old_low;
757 new_low = new_val->gen;
758 new_high = (uintptr_t)new_val->next;
759 old_low = old_val->gen;
760 old_high = (uintptr_t)old_val->next;
762 __asm volatile("lock;cmpxchg16b\t%1"
763 : "=@cce" (res), "+m" (*ptr), "+a" (old_low), "+d" (old_high)
764 : "b"(new_low), "c" (new_high)
770 static long invl_start_restart;
771 SYSCTL_LONG(_vm_pmap, OID_AUTO, invl_start_restart, CTLFLAG_RD,
772 &invl_start_restart, 0,
774 static long invl_finish_restart;
775 SYSCTL_LONG(_vm_pmap, OID_AUTO, invl_finish_restart, CTLFLAG_RD,
776 &invl_finish_restart, 0,
778 static int invl_max_qlen;
779 SYSCTL_INT(_vm_pmap, OID_AUTO, invl_max_qlen, CTLFLAG_RD,
784 #define di_delay locks_delay
787 pmap_delayed_invl_start_u(void)
789 struct pmap_invl_gen *invl_gen, *p, prev, new_prev;
791 struct lock_delay_arg lda;
799 invl_gen = &td->td_md.md_invl_gen;
800 PMAP_ASSERT_NOT_IN_DI();
801 lock_delay_arg_init(&lda, &di_delay);
802 invl_gen->saved_pri = 0;
803 pri = td->td_base_pri;
806 pri = td->td_base_pri;
808 invl_gen->saved_pri = pri;
815 for (p = &pmap_invl_gen_head;; p = prev.next) {
817 prevl = (uintptr_t)atomic_load_ptr(&p->next);
818 if ((prevl & PMAP_INVL_GEN_NEXT_INVALID) != 0) {
819 PV_STAT(atomic_add_long(&invl_start_restart, 1));
825 prev.next = (void *)prevl;
828 if ((ii = invl_max_qlen) < i)
829 atomic_cmpset_int(&invl_max_qlen, ii, i);
832 if (!pmap_di_load_invl(p, &prev) || prev.next != NULL) {
833 PV_STAT(atomic_add_long(&invl_start_restart, 1));
838 new_prev.gen = prev.gen;
839 new_prev.next = invl_gen;
840 invl_gen->gen = prev.gen + 1;
842 /* Formal fence between store to invl->gen and updating *p. */
843 atomic_thread_fence_rel();
846 * After inserting an invl_gen element with invalid bit set,
847 * this thread blocks any other thread trying to enter the
848 * delayed invalidation block. Do not allow to remove us from
849 * the CPU, because it causes starvation for other threads.
854 * ABA for *p is not possible there, since p->gen can only
855 * increase. So if the *p thread finished its di, then
856 * started a new one and got inserted into the list at the
857 * same place, its gen will appear greater than the previously
860 if (!pmap_di_store_invl(p, &prev, &new_prev)) {
862 PV_STAT(atomic_add_long(&invl_start_restart, 1));
868 * There we clear PMAP_INVL_GEN_NEXT_INVALID in
869 * invl_gen->next, allowing other threads to iterate past us.
870 * pmap_di_store_invl() provides fence between the generation
871 * write and the update of next.
873 invl_gen->next = NULL;
878 pmap_delayed_invl_finish_u_crit(struct pmap_invl_gen *invl_gen,
879 struct pmap_invl_gen *p)
881 struct pmap_invl_gen prev, new_prev;
885 * Load invl_gen->gen after setting invl_gen->next
886 * PMAP_INVL_GEN_NEXT_INVALID. This prevents larger
887 * generations to propagate to our invl_gen->gen. Lock prefix
888 * in atomic_set_ptr() worked as seq_cst fence.
890 mygen = atomic_load_long(&invl_gen->gen);
892 if (!pmap_di_load_invl(p, &prev) || prev.next != invl_gen)
895 KASSERT(prev.gen < mygen,
896 ("invalid di gen sequence %lu %lu", prev.gen, mygen));
897 new_prev.gen = mygen;
898 new_prev.next = (void *)((uintptr_t)invl_gen->next &
899 ~PMAP_INVL_GEN_NEXT_INVALID);
901 /* Formal fence between load of prev and storing update to it. */
902 atomic_thread_fence_rel();
904 return (pmap_di_store_invl(p, &prev, &new_prev));
908 pmap_delayed_invl_finish_u(void)
910 struct pmap_invl_gen *invl_gen, *p;
912 struct lock_delay_arg lda;
916 invl_gen = &td->td_md.md_invl_gen;
917 KASSERT(invl_gen->gen != 0, ("missed invl_start: gen 0"));
918 KASSERT(((uintptr_t)invl_gen->next & PMAP_INVL_GEN_NEXT_INVALID) == 0,
919 ("missed invl_start: INVALID"));
920 lock_delay_arg_init(&lda, &di_delay);
923 for (p = &pmap_invl_gen_head; p != NULL; p = (void *)prevl) {
924 prevl = (uintptr_t)atomic_load_ptr(&p->next);
925 if ((prevl & PMAP_INVL_GEN_NEXT_INVALID) != 0) {
926 PV_STAT(atomic_add_long(&invl_finish_restart, 1));
930 if ((void *)prevl == invl_gen)
935 * It is legitimate to not find ourself on the list if a
936 * thread before us finished its DI and started it again.
938 if (__predict_false(p == NULL)) {
939 PV_STAT(atomic_add_long(&invl_finish_restart, 1));
945 atomic_set_ptr((uintptr_t *)&invl_gen->next,
946 PMAP_INVL_GEN_NEXT_INVALID);
947 if (!pmap_delayed_invl_finish_u_crit(invl_gen, p)) {
948 atomic_clear_ptr((uintptr_t *)&invl_gen->next,
949 PMAP_INVL_GEN_NEXT_INVALID);
951 PV_STAT(atomic_add_long(&invl_finish_restart, 1));
956 if (atomic_load_int(&pmap_invl_waiters) > 0)
957 pmap_delayed_invl_finish_unblock(0);
958 if (invl_gen->saved_pri != 0) {
960 sched_prio(td, invl_gen->saved_pri);
966 DB_SHOW_COMMAND(di_queue, pmap_di_queue)
968 struct pmap_invl_gen *p, *pn;
973 for (p = &pmap_invl_gen_head, first = true; p != NULL; p = pn,
975 nextl = (uintptr_t)atomic_load_ptr(&p->next);
976 pn = (void *)(nextl & ~PMAP_INVL_GEN_NEXT_INVALID);
977 td = first ? NULL : __containerof(p, struct thread,
979 db_printf("gen %lu inv %d td %p tid %d\n", p->gen,
980 (nextl & PMAP_INVL_GEN_NEXT_INVALID) != 0, td,
981 td != NULL ? td->td_tid : -1);
987 static long invl_wait;
988 SYSCTL_LONG(_vm_pmap, OID_AUTO, invl_wait, CTLFLAG_RD, &invl_wait, 0,
989 "Number of times DI invalidation blocked pmap_remove_all/write");
990 static long invl_wait_slow;
991 SYSCTL_LONG(_vm_pmap, OID_AUTO, invl_wait_slow, CTLFLAG_RD, &invl_wait_slow, 0,
992 "Number of slow invalidation waits for lockless DI");
997 pmap_delayed_invl_genp(vm_page_t m)
1002 pa = VM_PAGE_TO_PHYS(m);
1003 if (__predict_false((pa) > pmap_last_pa))
1004 gen = &pv_dummy_large.pv_invl_gen;
1006 gen = &(pa_to_pmdp(pa)->pv_invl_gen);
1012 pmap_delayed_invl_genp(vm_page_t m)
1015 return (&pv_invl_gen[pa_index(VM_PAGE_TO_PHYS(m)) % NPV_LIST_LOCKS]);
1020 pmap_delayed_invl_callout_func(void *arg __unused)
1023 if (atomic_load_int(&pmap_invl_waiters) == 0)
1025 pmap_delayed_invl_finish_unblock(0);
1029 pmap_delayed_invl_callout_init(void *arg __unused)
1032 if (pmap_di_locked())
1034 callout_init(&pmap_invl_callout, 1);
1035 pmap_invl_callout_inited = true;
1037 SYSINIT(pmap_di_callout, SI_SUB_CPU + 1, SI_ORDER_ANY,
1038 pmap_delayed_invl_callout_init, NULL);
1041 * Ensure that all currently executing DI blocks, that need to flush
1042 * TLB for the given page m, actually flushed the TLB at the time the
1043 * function returned. If the page m has an empty PV list and we call
1044 * pmap_delayed_invl_wait(), upon its return we know that no CPU has a
1045 * valid mapping for the page m in either its page table or TLB.
1047 * This function works by blocking until the global DI generation
1048 * number catches up with the generation number associated with the
1049 * given page m and its PV list. Since this function's callers
1050 * typically own an object lock and sometimes own a page lock, it
1051 * cannot sleep. Instead, it blocks on a turnstile to relinquish the
1055 pmap_delayed_invl_wait_l(vm_page_t m)
1059 bool accounted = false;
1062 m_gen = pmap_delayed_invl_genp(m);
1063 while (*m_gen > pmap_invl_gen) {
1066 atomic_add_long(&invl_wait, 1);
1070 pmap_delayed_invl_wait_block(m_gen, &pmap_invl_gen);
1075 pmap_delayed_invl_wait_u(vm_page_t m)
1078 struct lock_delay_arg lda;
1082 m_gen = pmap_delayed_invl_genp(m);
1083 lock_delay_arg_init(&lda, &di_delay);
1084 while (*m_gen > atomic_load_long(&pmap_invl_gen_head.gen)) {
1085 if (fast || !pmap_invl_callout_inited) {
1086 PV_STAT(atomic_add_long(&invl_wait, 1));
1091 * The page's invalidation generation number
1092 * is still below the current thread's number.
1093 * Prepare to block so that we do not waste
1094 * CPU cycles or worse, suffer livelock.
1096 * Since it is impossible to block without
1097 * racing with pmap_delayed_invl_finish_u(),
1098 * prepare for the race by incrementing
1099 * pmap_invl_waiters and arming a 1-tick
1100 * callout which will unblock us if we lose
1103 atomic_add_int(&pmap_invl_waiters, 1);
1106 * Re-check the current thread's invalidation
1107 * generation after incrementing
1108 * pmap_invl_waiters, so that there is no race
1109 * with pmap_delayed_invl_finish_u() setting
1110 * the page generation and checking
1111 * pmap_invl_waiters. The only race allowed
1112 * is for a missed unblock, which is handled
1116 atomic_load_long(&pmap_invl_gen_head.gen)) {
1117 callout_reset(&pmap_invl_callout, 1,
1118 pmap_delayed_invl_callout_func, NULL);
1119 PV_STAT(atomic_add_long(&invl_wait_slow, 1));
1120 pmap_delayed_invl_wait_block(m_gen,
1121 &pmap_invl_gen_head.gen);
1123 atomic_add_int(&pmap_invl_waiters, -1);
1128 DEFINE_IFUNC(, void, pmap_thread_init_invl_gen, (struct thread *))
1131 return (pmap_di_locked() ? pmap_thread_init_invl_gen_l :
1132 pmap_thread_init_invl_gen_u);
1135 DEFINE_IFUNC(static, void, pmap_delayed_invl_start, (void))
1138 return (pmap_di_locked() ? pmap_delayed_invl_start_l :
1139 pmap_delayed_invl_start_u);
1142 DEFINE_IFUNC(static, void, pmap_delayed_invl_finish, (void))
1145 return (pmap_di_locked() ? pmap_delayed_invl_finish_l :
1146 pmap_delayed_invl_finish_u);
1149 DEFINE_IFUNC(static, void, pmap_delayed_invl_wait, (vm_page_t))
1152 return (pmap_di_locked() ? pmap_delayed_invl_wait_l :
1153 pmap_delayed_invl_wait_u);
1157 * Mark the page m's PV list as participating in the current thread's
1158 * DI block. Any threads concurrently using m's PV list to remove or
1159 * restrict all mappings to m will wait for the current thread's DI
1160 * block to complete before proceeding.
1162 * The function works by setting the DI generation number for m's PV
1163 * list to at least the DI generation number of the current thread.
1164 * This forces a caller of pmap_delayed_invl_wait() to block until
1165 * current thread calls pmap_delayed_invl_finish().
1168 pmap_delayed_invl_page(vm_page_t m)
1172 rw_assert(VM_PAGE_TO_PV_LIST_LOCK(m), RA_WLOCKED);
1173 gen = curthread->td_md.md_invl_gen.gen;
1176 m_gen = pmap_delayed_invl_genp(m);
1184 static caddr_t crashdumpmap;
1187 * Internal flags for pmap_enter()'s helper functions.
1189 #define PMAP_ENTER_NORECLAIM 0x1000000 /* Don't reclaim PV entries. */
1190 #define PMAP_ENTER_NOREPLACE 0x2000000 /* Don't replace mappings. */
1193 * Internal flags for pmap_mapdev_internal() and
1194 * pmap_change_props_locked().
1196 #define MAPDEV_FLUSHCACHE 0x00000001 /* Flush cache after mapping. */
1197 #define MAPDEV_SETATTR 0x00000002 /* Modify existing attrs. */
1198 #define MAPDEV_ASSERTVALID 0x00000004 /* Assert mapping validity. */
1200 TAILQ_HEAD(pv_chunklist, pv_chunk);
1202 static void free_pv_chunk(struct pv_chunk *pc);
1203 static void free_pv_chunk_batch(struct pv_chunklist *batch);
1204 static void free_pv_entry(pmap_t pmap, pv_entry_t pv);
1205 static pv_entry_t get_pv_entry(pmap_t pmap, struct rwlock **lockp);
1206 static int popcnt_pc_map_pq(uint64_t *map);
1207 static vm_page_t reclaim_pv_chunk(pmap_t locked_pmap, struct rwlock **lockp);
1208 static void reserve_pv_entries(pmap_t pmap, int needed,
1209 struct rwlock **lockp);
1210 static void pmap_pv_demote_pde(pmap_t pmap, vm_offset_t va, vm_paddr_t pa,
1211 struct rwlock **lockp);
1212 static bool pmap_pv_insert_pde(pmap_t pmap, vm_offset_t va, pd_entry_t pde,
1213 u_int flags, struct rwlock **lockp);
1214 #if VM_NRESERVLEVEL > 0
1215 static void pmap_pv_promote_pde(pmap_t pmap, vm_offset_t va, vm_paddr_t pa,
1216 struct rwlock **lockp);
1218 static void pmap_pvh_free(struct md_page *pvh, pmap_t pmap, vm_offset_t va);
1219 static pv_entry_t pmap_pvh_remove(struct md_page *pvh, pmap_t pmap,
1222 static void pmap_abort_ptp(pmap_t pmap, vm_offset_t va, vm_page_t mpte);
1223 static int pmap_change_props_locked(vm_offset_t va, vm_size_t size,
1224 vm_prot_t prot, int mode, int flags);
1225 static boolean_t pmap_demote_pde(pmap_t pmap, pd_entry_t *pde, vm_offset_t va);
1226 static boolean_t pmap_demote_pde_locked(pmap_t pmap, pd_entry_t *pde,
1227 vm_offset_t va, struct rwlock **lockp);
1228 static boolean_t pmap_demote_pdpe(pmap_t pmap, pdp_entry_t *pdpe,
1230 static bool pmap_enter_2mpage(pmap_t pmap, vm_offset_t va, vm_page_t m,
1231 vm_prot_t prot, struct rwlock **lockp);
1232 static int pmap_enter_pde(pmap_t pmap, vm_offset_t va, pd_entry_t newpde,
1233 u_int flags, vm_page_t m, struct rwlock **lockp);
1234 static vm_page_t pmap_enter_quick_locked(pmap_t pmap, vm_offset_t va,
1235 vm_page_t m, vm_prot_t prot, vm_page_t mpte, struct rwlock **lockp);
1236 static void pmap_fill_ptp(pt_entry_t *firstpte, pt_entry_t newpte);
1237 static int pmap_insert_pt_page(pmap_t pmap, vm_page_t mpte, bool promoted);
1238 static void pmap_invalidate_cache_range_selfsnoop(vm_offset_t sva,
1240 static void pmap_invalidate_cache_range_all(vm_offset_t sva,
1242 static void pmap_invalidate_pde_page(pmap_t pmap, vm_offset_t va,
1244 static void pmap_kenter_attr(vm_offset_t va, vm_paddr_t pa, int mode);
1245 static vm_page_t pmap_large_map_getptp_unlocked(void);
1246 static vm_paddr_t pmap_large_map_kextract(vm_offset_t va);
1247 #if VM_NRESERVLEVEL > 0
1248 static void pmap_promote_pde(pmap_t pmap, pd_entry_t *pde, vm_offset_t va,
1249 struct rwlock **lockp);
1251 static boolean_t pmap_protect_pde(pmap_t pmap, pd_entry_t *pde, vm_offset_t sva,
1253 static void pmap_pte_props(pt_entry_t *pte, u_long bits, u_long mask);
1254 static void pmap_pti_add_kva_locked(vm_offset_t sva, vm_offset_t eva,
1256 static pdp_entry_t *pmap_pti_pdpe(vm_offset_t va);
1257 static pd_entry_t *pmap_pti_pde(vm_offset_t va);
1258 static void pmap_pti_wire_pte(void *pte);
1259 static int pmap_remove_pde(pmap_t pmap, pd_entry_t *pdq, vm_offset_t sva,
1260 struct spglist *free, struct rwlock **lockp);
1261 static int pmap_remove_pte(pmap_t pmap, pt_entry_t *ptq, vm_offset_t sva,
1262 pd_entry_t ptepde, struct spglist *free, struct rwlock **lockp);
1263 static vm_page_t pmap_remove_pt_page(pmap_t pmap, vm_offset_t va);
1264 static void pmap_remove_page(pmap_t pmap, vm_offset_t va, pd_entry_t *pde,
1265 struct spglist *free);
1266 static bool pmap_remove_ptes(pmap_t pmap, vm_offset_t sva, vm_offset_t eva,
1267 pd_entry_t *pde, struct spglist *free,
1268 struct rwlock **lockp);
1269 static boolean_t pmap_try_insert_pv_entry(pmap_t pmap, vm_offset_t va,
1270 vm_page_t m, struct rwlock **lockp);
1271 static void pmap_update_pde(pmap_t pmap, vm_offset_t va, pd_entry_t *pde,
1273 static void pmap_update_pde_invalidate(pmap_t, vm_offset_t va, pd_entry_t pde);
1275 static vm_page_t _pmap_allocpte(pmap_t pmap, vm_pindex_t ptepindex,
1276 struct rwlock **lockp, vm_offset_t va);
1277 static pd_entry_t *pmap_alloc_pde(pmap_t pmap, vm_offset_t va, vm_page_t *pdpgp,
1278 struct rwlock **lockp);
1279 static vm_page_t pmap_allocpte(pmap_t pmap, vm_offset_t va,
1280 struct rwlock **lockp);
1282 static void _pmap_unwire_ptp(pmap_t pmap, vm_offset_t va, vm_page_t m,
1283 struct spglist *free);
1284 static int pmap_unuse_pt(pmap_t, vm_offset_t, pd_entry_t, struct spglist *);
1286 /********************/
1287 /* Inline functions */
1288 /********************/
1291 * Return a non-clipped indexes for a given VA, which are page table
1292 * pages indexes at the corresponding level.
1294 static __inline vm_pindex_t
1295 pmap_pde_pindex(vm_offset_t va)
1297 return (va >> PDRSHIFT);
1300 static __inline vm_pindex_t
1301 pmap_pdpe_pindex(vm_offset_t va)
1303 return (NUPDE + (va >> PDPSHIFT));
1306 static __inline vm_pindex_t
1307 pmap_pml4e_pindex(vm_offset_t va)
1309 return (NUPDE + NUPDPE + (va >> PML4SHIFT));
1312 static __inline vm_pindex_t
1313 pmap_pml5e_pindex(vm_offset_t va)
1315 return (NUPDE + NUPDPE + NUPML4E + (va >> PML5SHIFT));
1318 static __inline pml4_entry_t *
1319 pmap_pml5e(pmap_t pmap, vm_offset_t va)
1322 MPASS(pmap_is_la57(pmap));
1323 return (&pmap->pm_pmltop[pmap_pml5e_index(va)]);
1326 static __inline pml4_entry_t *
1327 pmap_pml5e_u(pmap_t pmap, vm_offset_t va)
1330 MPASS(pmap_is_la57(pmap));
1331 return (&pmap->pm_pmltopu[pmap_pml5e_index(va)]);
1334 static __inline pml4_entry_t *
1335 pmap_pml5e_to_pml4e(pml5_entry_t *pml5e, vm_offset_t va)
1337 pml4_entry_t *pml4e;
1339 /* XXX MPASS(pmap_is_la57(pmap); */
1340 pml4e = (pml4_entry_t *)PHYS_TO_DMAP(*pml5e & PG_FRAME);
1341 return (&pml4e[pmap_pml4e_index(va)]);
1344 /* Return a pointer to the PML4 slot that corresponds to a VA */
1345 static __inline pml4_entry_t *
1346 pmap_pml4e(pmap_t pmap, vm_offset_t va)
1348 pml5_entry_t *pml5e;
1349 pml4_entry_t *pml4e;
1352 if (pmap_is_la57(pmap)) {
1353 pml5e = pmap_pml5e(pmap, va);
1354 PG_V = pmap_valid_bit(pmap);
1355 if ((*pml5e & PG_V) == 0)
1357 pml4e = (pml4_entry_t *)PHYS_TO_DMAP(*pml5e & PG_FRAME);
1359 pml4e = pmap->pm_pmltop;
1361 return (&pml4e[pmap_pml4e_index(va)]);
1364 static __inline pml4_entry_t *
1365 pmap_pml4e_u(pmap_t pmap, vm_offset_t va)
1367 MPASS(!pmap_is_la57(pmap));
1368 return (&pmap->pm_pmltopu[pmap_pml4e_index(va)]);
1371 /* Return a pointer to the PDP slot that corresponds to a VA */
1372 static __inline pdp_entry_t *
1373 pmap_pml4e_to_pdpe(pml4_entry_t *pml4e, vm_offset_t va)
1377 pdpe = (pdp_entry_t *)PHYS_TO_DMAP(*pml4e & PG_FRAME);
1378 return (&pdpe[pmap_pdpe_index(va)]);
1381 /* Return a pointer to the PDP slot that corresponds to a VA */
1382 static __inline pdp_entry_t *
1383 pmap_pdpe(pmap_t pmap, vm_offset_t va)
1385 pml4_entry_t *pml4e;
1388 PG_V = pmap_valid_bit(pmap);
1389 pml4e = pmap_pml4e(pmap, va);
1390 if (pml4e == NULL || (*pml4e & PG_V) == 0)
1392 return (pmap_pml4e_to_pdpe(pml4e, va));
1395 /* Return a pointer to the PD slot that corresponds to a VA */
1396 static __inline pd_entry_t *
1397 pmap_pdpe_to_pde(pdp_entry_t *pdpe, vm_offset_t va)
1401 KASSERT((*pdpe & PG_PS) == 0,
1402 ("%s: pdpe %#lx is a leaf", __func__, *pdpe));
1403 pde = (pd_entry_t *)PHYS_TO_DMAP(*pdpe & PG_FRAME);
1404 return (&pde[pmap_pde_index(va)]);
1407 /* Return a pointer to the PD slot that corresponds to a VA */
1408 static __inline pd_entry_t *
1409 pmap_pde(pmap_t pmap, vm_offset_t va)
1414 PG_V = pmap_valid_bit(pmap);
1415 pdpe = pmap_pdpe(pmap, va);
1416 if (pdpe == NULL || (*pdpe & PG_V) == 0)
1418 KASSERT((*pdpe & PG_PS) == 0,
1419 ("pmap_pde for 1G page, pmap %p va %#lx", pmap, va));
1420 return (pmap_pdpe_to_pde(pdpe, va));
1423 /* Return a pointer to the PT slot that corresponds to a VA */
1424 static __inline pt_entry_t *
1425 pmap_pde_to_pte(pd_entry_t *pde, vm_offset_t va)
1429 KASSERT((*pde & PG_PS) == 0,
1430 ("%s: pde %#lx is a leaf", __func__, *pde));
1431 pte = (pt_entry_t *)PHYS_TO_DMAP(*pde & PG_FRAME);
1432 return (&pte[pmap_pte_index(va)]);
1435 /* Return a pointer to the PT slot that corresponds to a VA */
1436 static __inline pt_entry_t *
1437 pmap_pte(pmap_t pmap, vm_offset_t va)
1442 PG_V = pmap_valid_bit(pmap);
1443 pde = pmap_pde(pmap, va);
1444 if (pde == NULL || (*pde & PG_V) == 0)
1446 if ((*pde & PG_PS) != 0) /* compat with i386 pmap_pte() */
1447 return ((pt_entry_t *)pde);
1448 return (pmap_pde_to_pte(pde, va));
1451 static __inline void
1452 pmap_resident_count_inc(pmap_t pmap, int count)
1455 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
1456 pmap->pm_stats.resident_count += count;
1459 static __inline void
1460 pmap_resident_count_dec(pmap_t pmap, int count)
1463 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
1464 KASSERT(pmap->pm_stats.resident_count >= count,
1465 ("pmap %p resident count underflow %ld %d", pmap,
1466 pmap->pm_stats.resident_count, count));
1467 pmap->pm_stats.resident_count -= count;
1470 PMAP_INLINE pt_entry_t *
1471 vtopte(vm_offset_t va)
1475 KASSERT(va >= VM_MAXUSER_ADDRESS, ("vtopte on a uva/gpa 0x%0lx", va));
1478 mask = ((1ul << (NPTEPGSHIFT + NPDEPGSHIFT + NPDPEPGSHIFT +
1479 NPML4EPGSHIFT + NPML5EPGSHIFT)) - 1);
1480 return (P5Tmap + ((va >> PAGE_SHIFT) & mask));
1482 mask = ((1ul << (NPTEPGSHIFT + NPDEPGSHIFT + NPDPEPGSHIFT +
1483 NPML4EPGSHIFT)) - 1);
1484 return (P4Tmap + ((va >> PAGE_SHIFT) & mask));
1488 static __inline pd_entry_t *
1489 vtopde(vm_offset_t va)
1493 KASSERT(va >= VM_MAXUSER_ADDRESS, ("vtopde on a uva/gpa 0x%0lx", va));
1496 mask = ((1ul << (NPDEPGSHIFT + NPDPEPGSHIFT +
1497 NPML4EPGSHIFT + NPML5EPGSHIFT)) - 1);
1498 return (P5Dmap + ((va >> PDRSHIFT) & mask));
1500 mask = ((1ul << (NPDEPGSHIFT + NPDPEPGSHIFT +
1501 NPML4EPGSHIFT)) - 1);
1502 return (P4Dmap + ((va >> PDRSHIFT) & mask));
1507 allocpages(vm_paddr_t *firstaddr, int n)
1512 bzero((void *)ret, n * PAGE_SIZE);
1513 *firstaddr += n * PAGE_SIZE;
1517 CTASSERT(powerof2(NDMPML4E));
1519 /* number of kernel PDP slots */
1520 #define NKPDPE(ptpgs) howmany(ptpgs, NPDEPG)
1523 nkpt_init(vm_paddr_t addr)
1530 pt_pages = howmany(addr, 1 << PDRSHIFT);
1531 pt_pages += NKPDPE(pt_pages);
1534 * Add some slop beyond the bare minimum required for bootstrapping
1537 * This is quite important when allocating KVA for kernel modules.
1538 * The modules are required to be linked in the negative 2GB of
1539 * the address space. If we run out of KVA in this region then
1540 * pmap_growkernel() will need to allocate page table pages to map
1541 * the entire 512GB of KVA space which is an unnecessary tax on
1544 * Secondly, device memory mapped as part of setting up the low-
1545 * level console(s) is taken from KVA, starting at virtual_avail.
1546 * This is because cninit() is called after pmap_bootstrap() but
1547 * before vm_init() and pmap_init(). 20MB for a frame buffer is
1550 pt_pages += 32; /* 64MB additional slop. */
1556 * Returns the proper write/execute permission for a physical page that is
1557 * part of the initial boot allocations.
1559 * If the page has kernel text, it is marked as read-only. If the page has
1560 * kernel read-only data, it is marked as read-only/not-executable. If the
1561 * page has only read-write data, it is marked as read-write/not-executable.
1562 * If the page is below/above the kernel range, it is marked as read-write.
1564 * This function operates on 2M pages, since we map the kernel space that
1567 static inline pt_entry_t
1568 bootaddr_rwx(vm_paddr_t pa)
1572 * The kernel is loaded at a 2MB-aligned address, and memory below that
1573 * need not be executable. The .bss section is padded to a 2MB
1574 * boundary, so memory following the kernel need not be executable
1575 * either. Preloaded kernel modules have their mapping permissions
1576 * fixed up by the linker.
1578 if (pa < trunc_2mpage(btext - KERNBASE) ||
1579 pa >= trunc_2mpage(_end - KERNBASE))
1580 return (X86_PG_RW | pg_nx);
1583 * The linker should ensure that the read-only and read-write
1584 * portions don't share the same 2M page, so this shouldn't
1585 * impact read-only data. However, in any case, any page with
1586 * read-write data needs to be read-write.
1588 if (pa >= trunc_2mpage(brwsection - KERNBASE))
1589 return (X86_PG_RW | pg_nx);
1592 * Mark any 2M page containing kernel text as read-only. Mark
1593 * other pages with read-only data as read-only and not executable.
1594 * (It is likely a small portion of the read-only data section will
1595 * be marked as read-only, but executable. This should be acceptable
1596 * since the read-only protection will keep the data from changing.)
1597 * Note that fixups to the .text section will still work until we
1600 if (pa < round_2mpage(etext - KERNBASE))
1606 create_pagetables(vm_paddr_t *firstaddr)
1608 int i, j, ndm1g, nkpdpe, nkdmpde;
1612 uint64_t DMPDkernphys;
1614 /* Allocate page table pages for the direct map */
1615 ndmpdp = howmany(ptoa(Maxmem), NBPDP);
1616 if (ndmpdp < 4) /* Minimum 4GB of dirmap */
1618 ndmpdpphys = howmany(ndmpdp, NPDPEPG);
1619 if (ndmpdpphys > NDMPML4E) {
1621 * Each NDMPML4E allows 512 GB, so limit to that,
1622 * and then readjust ndmpdp and ndmpdpphys.
1624 printf("NDMPML4E limits system to %d GB\n", NDMPML4E * 512);
1625 Maxmem = atop(NDMPML4E * NBPML4);
1626 ndmpdpphys = NDMPML4E;
1627 ndmpdp = NDMPML4E * NPDEPG;
1629 DMPDPphys = allocpages(firstaddr, ndmpdpphys);
1631 if ((amd_feature & AMDID_PAGE1GB) != 0) {
1633 * Calculate the number of 1G pages that will fully fit in
1636 ndm1g = ptoa(Maxmem) >> PDPSHIFT;
1639 * Allocate 2M pages for the kernel. These will be used in
1640 * place of the first one or more 1G pages from ndm1g.
1642 nkdmpde = howmany((vm_offset_t)(brwsection - KERNBASE), NBPDP);
1643 DMPDkernphys = allocpages(firstaddr, nkdmpde);
1646 DMPDphys = allocpages(firstaddr, ndmpdp - ndm1g);
1647 dmaplimit = (vm_paddr_t)ndmpdp << PDPSHIFT;
1649 /* Allocate pages */
1650 KPML4phys = allocpages(firstaddr, 1);
1651 KPDPphys = allocpages(firstaddr, NKPML4E);
1654 * Allocate the initial number of kernel page table pages required to
1655 * bootstrap. We defer this until after all memory-size dependent
1656 * allocations are done (e.g. direct map), so that we don't have to
1657 * build in too much slop in our estimate.
1659 * Note that when NKPML4E > 1, we have an empty page underneath
1660 * all but the KPML4I'th one, so we need NKPML4E-1 extra (zeroed)
1661 * pages. (pmap_enter requires a PD page to exist for each KPML4E.)
1663 nkpt_init(*firstaddr);
1664 nkpdpe = NKPDPE(nkpt);
1666 KPTphys = allocpages(firstaddr, nkpt);
1667 KPDphys = allocpages(firstaddr, nkpdpe);
1670 * Connect the zero-filled PT pages to their PD entries. This
1671 * implicitly maps the PT pages at their correct locations within
1674 pd_p = (pd_entry_t *)KPDphys;
1675 for (i = 0; i < nkpt; i++)
1676 pd_p[i] = (KPTphys + ptoa(i)) | X86_PG_RW | X86_PG_V;
1679 * Map from physical address zero to the end of loader preallocated
1680 * memory using 2MB pages. This replaces some of the PD entries
1683 for (i = 0; (i << PDRSHIFT) < KERNend; i++)
1684 /* Preset PG_M and PG_A because demotion expects it. */
1685 pd_p[i] = (i << PDRSHIFT) | X86_PG_V | PG_PS | pg_g |
1686 X86_PG_M | X86_PG_A | bootaddr_rwx(i << PDRSHIFT);
1689 * Because we map the physical blocks in 2M pages, adjust firstaddr
1690 * to record the physical blocks we've actually mapped into kernel
1691 * virtual address space.
1693 if (*firstaddr < round_2mpage(KERNend))
1694 *firstaddr = round_2mpage(KERNend);
1696 /* And connect up the PD to the PDP (leaving room for L4 pages) */
1697 pdp_p = (pdp_entry_t *)(KPDPphys + ptoa(KPML4I - KPML4BASE));
1698 for (i = 0; i < nkpdpe; i++)
1699 pdp_p[i + KPDPI] = (KPDphys + ptoa(i)) | X86_PG_RW | X86_PG_V;
1702 * Now, set up the direct map region using 2MB and/or 1GB pages. If
1703 * the end of physical memory is not aligned to a 1GB page boundary,
1704 * then the residual physical memory is mapped with 2MB pages. Later,
1705 * if pmap_mapdev{_attr}() uses the direct map for non-write-back
1706 * memory, pmap_change_attr() will demote any 2MB or 1GB page mappings
1707 * that are partially used.
1709 pd_p = (pd_entry_t *)DMPDphys;
1710 for (i = NPDEPG * ndm1g, j = 0; i < NPDEPG * ndmpdp; i++, j++) {
1711 pd_p[j] = (vm_paddr_t)i << PDRSHIFT;
1712 /* Preset PG_M and PG_A because demotion expects it. */
1713 pd_p[j] |= X86_PG_RW | X86_PG_V | PG_PS | pg_g |
1714 X86_PG_M | X86_PG_A | pg_nx;
1716 pdp_p = (pdp_entry_t *)DMPDPphys;
1717 for (i = 0; i < ndm1g; i++) {
1718 pdp_p[i] = (vm_paddr_t)i << PDPSHIFT;
1719 /* Preset PG_M and PG_A because demotion expects it. */
1720 pdp_p[i] |= X86_PG_RW | X86_PG_V | PG_PS | pg_g |
1721 X86_PG_M | X86_PG_A | pg_nx;
1723 for (j = 0; i < ndmpdp; i++, j++) {
1724 pdp_p[i] = DMPDphys + ptoa(j);
1725 pdp_p[i] |= X86_PG_RW | X86_PG_V | pg_nx;
1729 * Instead of using a 1G page for the memory containing the kernel,
1730 * use 2M pages with read-only and no-execute permissions. (If using 1G
1731 * pages, this will partially overwrite the PDPEs above.)
1734 pd_p = (pd_entry_t *)DMPDkernphys;
1735 for (i = 0; i < (NPDEPG * nkdmpde); i++)
1736 pd_p[i] = (i << PDRSHIFT) | X86_PG_V | PG_PS | pg_g |
1737 X86_PG_M | X86_PG_A | pg_nx |
1738 bootaddr_rwx(i << PDRSHIFT);
1739 for (i = 0; i < nkdmpde; i++)
1740 pdp_p[i] = (DMPDkernphys + ptoa(i)) | X86_PG_RW |
1744 /* And recursively map PML4 to itself in order to get PTmap */
1745 p4_p = (pml4_entry_t *)KPML4phys;
1746 p4_p[PML4PML4I] = KPML4phys;
1747 p4_p[PML4PML4I] |= X86_PG_RW | X86_PG_V | pg_nx;
1749 /* Connect the Direct Map slot(s) up to the PML4. */
1750 for (i = 0; i < ndmpdpphys; i++) {
1751 p4_p[DMPML4I + i] = DMPDPphys + ptoa(i);
1752 p4_p[DMPML4I + i] |= X86_PG_RW | X86_PG_V | pg_nx;
1755 /* Connect the KVA slots up to the PML4 */
1756 for (i = 0; i < NKPML4E; i++) {
1757 p4_p[KPML4BASE + i] = KPDPphys + ptoa(i);
1758 p4_p[KPML4BASE + i] |= X86_PG_RW | X86_PG_V;
1761 kernel_pml4 = (pml4_entry_t *)PHYS_TO_DMAP(KPML4phys);
1765 * Bootstrap the system enough to run with virtual memory.
1767 * On amd64 this is called after mapping has already been enabled
1768 * and just syncs the pmap module with what has already been done.
1769 * [We can't call it easily with mapping off since the kernel is not
1770 * mapped with PA == VA, hence we would have to relocate every address
1771 * from the linked base (virtual) address "KERNBASE" to the actual
1772 * (physical) address starting relative to 0]
1775 pmap_bootstrap(vm_paddr_t *firstaddr)
1778 pt_entry_t *pte, *pcpu_pte;
1779 struct region_descriptor r_gdt;
1780 uint64_t cr4, pcpu_phys;
1784 KERNend = *firstaddr;
1785 res = atop(KERNend - (vm_paddr_t)kernphys);
1791 * Create an initial set of page tables to run the kernel in.
1793 create_pagetables(firstaddr);
1795 pcpu_phys = allocpages(firstaddr, MAXCPU);
1798 * Add a physical memory segment (vm_phys_seg) corresponding to the
1799 * preallocated kernel page table pages so that vm_page structures
1800 * representing these pages will be created. The vm_page structures
1801 * are required for promotion of the corresponding kernel virtual
1802 * addresses to superpage mappings.
1804 vm_phys_early_add_seg(KPTphys, KPTphys + ptoa(nkpt));
1807 * Account for the virtual addresses mapped by create_pagetables().
1809 virtual_avail = (vm_offset_t)KERNBASE + round_2mpage(KERNend);
1810 virtual_end = VM_MAX_KERNEL_ADDRESS;
1813 * Enable PG_G global pages, then switch to the kernel page
1814 * table from the bootstrap page table. After the switch, it
1815 * is possible to enable SMEP and SMAP since PG_U bits are
1821 load_cr3(KPML4phys);
1822 if (cpu_stdext_feature & CPUID_STDEXT_SMEP)
1824 if (cpu_stdext_feature & CPUID_STDEXT_SMAP)
1829 * Initialize the kernel pmap (which is statically allocated).
1830 * Count bootstrap data as being resident in case any of this data is
1831 * later unmapped (using pmap_remove()) and freed.
1833 PMAP_LOCK_INIT(kernel_pmap);
1834 kernel_pmap->pm_pmltop = kernel_pml4;
1835 kernel_pmap->pm_cr3 = KPML4phys;
1836 kernel_pmap->pm_ucr3 = PMAP_NO_CR3;
1837 CPU_FILL(&kernel_pmap->pm_active); /* don't allow deactivation */
1838 TAILQ_INIT(&kernel_pmap->pm_pvchunk);
1839 kernel_pmap->pm_stats.resident_count = res;
1840 kernel_pmap->pm_flags = pmap_flags;
1843 * Initialize the TLB invalidations generation number lock.
1845 mtx_init(&invl_gen_mtx, "invlgn", NULL, MTX_DEF);
1848 * Reserve some special page table entries/VA space for temporary
1851 #define SYSMAP(c, p, v, n) \
1852 v = (c)va; va += ((n)*PAGE_SIZE); p = pte; pte += (n);
1858 * Crashdump maps. The first page is reused as CMAP1 for the
1861 SYSMAP(caddr_t, CMAP1, crashdumpmap, MAXDUMPPGS)
1862 CADDR1 = crashdumpmap;
1864 SYSMAP(struct pcpu *, pcpu_pte, __pcpu, MAXCPU);
1867 for (i = 0; i < MAXCPU; i++) {
1868 pcpu_pte[i] = (pcpu_phys + ptoa(i)) | X86_PG_V | X86_PG_RW |
1869 pg_g | pg_nx | X86_PG_M | X86_PG_A;
1873 * Re-initialize PCPU area for BSP after switching.
1874 * Make hardware use gdt and common_tss from the new PCPU.
1876 STAILQ_INIT(&cpuhead);
1877 wrmsr(MSR_GSBASE, (uint64_t)&__pcpu[0]);
1878 pcpu_init(&__pcpu[0], 0, sizeof(struct pcpu));
1879 amd64_bsp_pcpu_init1(&__pcpu[0]);
1880 amd64_bsp_ist_init(&__pcpu[0]);
1881 __pcpu[0].pc_common_tss.tss_iobase = sizeof(struct amd64tss) +
1883 memcpy(__pcpu[0].pc_gdt, temp_bsp_pcpu.pc_gdt, NGDT *
1884 sizeof(struct user_segment_descriptor));
1885 gdt_segs[GPROC0_SEL].ssd_base = (uintptr_t)&__pcpu[0].pc_common_tss;
1886 ssdtosyssd(&gdt_segs[GPROC0_SEL],
1887 (struct system_segment_descriptor *)&__pcpu[0].pc_gdt[GPROC0_SEL]);
1888 r_gdt.rd_limit = NGDT * sizeof(struct user_segment_descriptor) - 1;
1889 r_gdt.rd_base = (long)__pcpu[0].pc_gdt;
1891 wrmsr(MSR_GSBASE, (uint64_t)&__pcpu[0]);
1892 ltr(GSEL(GPROC0_SEL, SEL_KPL));
1893 __pcpu[0].pc_dynamic = temp_bsp_pcpu.pc_dynamic;
1894 __pcpu[0].pc_acpi_id = temp_bsp_pcpu.pc_acpi_id;
1897 * Initialize the PAT MSR.
1898 * pmap_init_pat() clears and sets CR4_PGE, which, as a
1899 * side-effect, invalidates stale PG_G TLB entries that might
1900 * have been created in our pre-boot environment.
1904 /* Initialize TLB Context Id. */
1905 if (pmap_pcid_enabled) {
1906 for (i = 0; i < MAXCPU; i++) {
1907 kernel_pmap->pm_pcids[i].pm_pcid = PMAP_PCID_KERN;
1908 kernel_pmap->pm_pcids[i].pm_gen = 1;
1912 * PMAP_PCID_KERN + 1 is used for initialization of
1913 * proc0 pmap. The pmap' pcid state might be used by
1914 * EFIRT entry before first context switch, so it
1915 * needs to be valid.
1917 PCPU_SET(pcid_next, PMAP_PCID_KERN + 2);
1918 PCPU_SET(pcid_gen, 1);
1921 * pcpu area for APs is zeroed during AP startup.
1922 * pc_pcid_next and pc_pcid_gen are initialized by AP
1923 * during pcpu setup.
1925 load_cr4(rcr4() | CR4_PCIDE);
1930 * Setup the PAT MSR.
1939 /* Bail if this CPU doesn't implement PAT. */
1940 if ((cpu_feature & CPUID_PAT) == 0)
1943 /* Set default PAT index table. */
1944 for (i = 0; i < PAT_INDEX_SIZE; i++)
1946 pat_index[PAT_WRITE_BACK] = 0;
1947 pat_index[PAT_WRITE_THROUGH] = 1;
1948 pat_index[PAT_UNCACHEABLE] = 3;
1949 pat_index[PAT_WRITE_COMBINING] = 6;
1950 pat_index[PAT_WRITE_PROTECTED] = 5;
1951 pat_index[PAT_UNCACHED] = 2;
1954 * Initialize default PAT entries.
1955 * Leave the indices 0-3 at the default of WB, WT, UC-, and UC.
1956 * Program 5 and 6 as WP and WC.
1958 * Leave 4 and 7 as WB and UC. Note that a recursive page table
1959 * mapping for a 2M page uses a PAT value with the bit 3 set due
1960 * to its overload with PG_PS.
1962 pat_msr = PAT_VALUE(0, PAT_WRITE_BACK) |
1963 PAT_VALUE(1, PAT_WRITE_THROUGH) |
1964 PAT_VALUE(2, PAT_UNCACHED) |
1965 PAT_VALUE(3, PAT_UNCACHEABLE) |
1966 PAT_VALUE(4, PAT_WRITE_BACK) |
1967 PAT_VALUE(5, PAT_WRITE_PROTECTED) |
1968 PAT_VALUE(6, PAT_WRITE_COMBINING) |
1969 PAT_VALUE(7, PAT_UNCACHEABLE);
1973 load_cr4(cr4 & ~CR4_PGE);
1975 /* Disable caches (CD = 1, NW = 0). */
1977 load_cr0((cr0 & ~CR0_NW) | CR0_CD);
1979 /* Flushes caches and TLBs. */
1983 /* Update PAT and index table. */
1984 wrmsr(MSR_PAT, pat_msr);
1986 /* Flush caches and TLBs again. */
1990 /* Restore caches and PGE. */
1995 extern const char la57_trampoline[], la57_trampoline_gdt_desc[],
1996 la57_trampoline_gdt[], la57_trampoline_end[];
1999 pmap_bootstrap_la57(void *arg __unused)
2002 pml5_entry_t *v_pml5;
2003 pml4_entry_t *v_pml4;
2007 vm_page_t m_code, m_pml4, m_pdp, m_pd, m_pt, m_pml5;
2008 void (*la57_tramp)(uint64_t pml5);
2009 struct region_descriptor r_gdt;
2011 if ((cpu_stdext_feature2 & CPUID_STDEXT2_LA57) == 0)
2013 if (!TUNABLE_INT_FETCH("vm.pmap.la57", &la57))
2018 r_gdt.rd_limit = NGDT * sizeof(struct user_segment_descriptor) - 1;
2019 r_gdt.rd_base = (long)__pcpu[0].pc_gdt;
2021 m_code = vm_page_alloc_contig(NULL, 0,
2022 VM_ALLOC_NORMAL | VM_ALLOC_NOBUSY | VM_ALLOC_ZERO | VM_ALLOC_NOOBJ,
2023 1, 0, (1ULL << 32), PAGE_SIZE, 0, VM_MEMATTR_DEFAULT);
2024 if ((m_code->flags & PG_ZERO) == 0)
2025 pmap_zero_page(m_code);
2026 v_code = (char *)PHYS_TO_DMAP(VM_PAGE_TO_PHYS(m_code));
2027 m_pml5 = vm_page_alloc_contig(NULL, 0,
2028 VM_ALLOC_NORMAL | VM_ALLOC_NOBUSY | VM_ALLOC_ZERO | VM_ALLOC_NOOBJ,
2029 1, 0, (1ULL << 32), PAGE_SIZE, 0, VM_MEMATTR_DEFAULT);
2030 if ((m_pml5->flags & PG_ZERO) == 0)
2031 pmap_zero_page(m_pml5);
2032 KPML5phys = VM_PAGE_TO_PHYS(m_pml5);
2033 v_pml5 = (pml5_entry_t *)PHYS_TO_DMAP(KPML5phys);
2034 m_pml4 = vm_page_alloc_contig(NULL, 0,
2035 VM_ALLOC_NORMAL | VM_ALLOC_NOBUSY | VM_ALLOC_ZERO | VM_ALLOC_NOOBJ,
2036 1, 0, (1ULL << 32), PAGE_SIZE, 0, VM_MEMATTR_DEFAULT);
2037 if ((m_pml4->flags & PG_ZERO) == 0)
2038 pmap_zero_page(m_pml4);
2039 v_pml4 = (pdp_entry_t *)PHYS_TO_DMAP(VM_PAGE_TO_PHYS(m_pml4));
2040 m_pdp = vm_page_alloc_contig(NULL, 0,
2041 VM_ALLOC_NORMAL | VM_ALLOC_NOBUSY | VM_ALLOC_ZERO | VM_ALLOC_NOOBJ,
2042 1, 0, (1ULL << 32), PAGE_SIZE, 0, VM_MEMATTR_DEFAULT);
2043 if ((m_pdp->flags & PG_ZERO) == 0)
2044 pmap_zero_page(m_pdp);
2045 v_pdp = (pdp_entry_t *)PHYS_TO_DMAP(VM_PAGE_TO_PHYS(m_pdp));
2046 m_pd = vm_page_alloc_contig(NULL, 0,
2047 VM_ALLOC_NORMAL | VM_ALLOC_NOBUSY | VM_ALLOC_ZERO | VM_ALLOC_NOOBJ,
2048 1, 0, (1ULL << 32), PAGE_SIZE, 0, VM_MEMATTR_DEFAULT);
2049 if ((m_pd->flags & PG_ZERO) == 0)
2050 pmap_zero_page(m_pd);
2051 v_pd = (pdp_entry_t *)PHYS_TO_DMAP(VM_PAGE_TO_PHYS(m_pd));
2052 m_pt = vm_page_alloc_contig(NULL, 0,
2053 VM_ALLOC_NORMAL | VM_ALLOC_NOBUSY | VM_ALLOC_ZERO | VM_ALLOC_NOOBJ,
2054 1, 0, (1ULL << 32), PAGE_SIZE, 0, VM_MEMATTR_DEFAULT);
2055 if ((m_pt->flags & PG_ZERO) == 0)
2056 pmap_zero_page(m_pt);
2057 v_pt = (pt_entry_t *)PHYS_TO_DMAP(VM_PAGE_TO_PHYS(m_pt));
2060 * Map m_code 1:1, it appears below 4G in KVA due to physical
2061 * address being below 4G. Since kernel KVA is in upper half,
2062 * the pml4e should be zero and free for temporary use.
2064 kernel_pmap->pm_pmltop[pmap_pml4e_index(VM_PAGE_TO_PHYS(m_code))] =
2065 VM_PAGE_TO_PHYS(m_pdp) | X86_PG_V | X86_PG_RW | X86_PG_A |
2067 v_pdp[pmap_pdpe_index(VM_PAGE_TO_PHYS(m_code))] =
2068 VM_PAGE_TO_PHYS(m_pd) | X86_PG_V | X86_PG_RW | X86_PG_A |
2070 v_pd[pmap_pde_index(VM_PAGE_TO_PHYS(m_code))] =
2071 VM_PAGE_TO_PHYS(m_pt) | X86_PG_V | X86_PG_RW | X86_PG_A |
2073 v_pt[pmap_pte_index(VM_PAGE_TO_PHYS(m_code))] =
2074 VM_PAGE_TO_PHYS(m_code) | X86_PG_V | X86_PG_RW | X86_PG_A |
2078 * Add pml5 entry at top of KVA pointing to existing pml4 table,
2079 * entering all existing kernel mappings into level 5 table.
2081 v_pml5[pmap_pml5e_index(UPT_MAX_ADDRESS)] = KPML4phys | X86_PG_V |
2082 X86_PG_RW | X86_PG_A | X86_PG_M | pg_g;
2085 * Add pml5 entry for 1:1 trampoline mapping after LA57 is turned on.
2087 v_pml5[pmap_pml5e_index(VM_PAGE_TO_PHYS(m_code))] =
2088 VM_PAGE_TO_PHYS(m_pml4) | X86_PG_V | X86_PG_RW | X86_PG_A |
2090 v_pml4[pmap_pml4e_index(VM_PAGE_TO_PHYS(m_code))] =
2091 VM_PAGE_TO_PHYS(m_pdp) | X86_PG_V | X86_PG_RW | X86_PG_A |
2095 * Copy and call the 48->57 trampoline, hope we return there, alive.
2097 bcopy(la57_trampoline, v_code, la57_trampoline_end - la57_trampoline);
2098 *(u_long *)(v_code + 2 + (la57_trampoline_gdt_desc - la57_trampoline)) =
2099 la57_trampoline_gdt - la57_trampoline + VM_PAGE_TO_PHYS(m_code);
2100 la57_tramp = (void (*)(uint64_t))VM_PAGE_TO_PHYS(m_code);
2101 la57_tramp(KPML5phys);
2104 * gdt was necessary reset, switch back to our gdt.
2107 wrmsr(MSR_GSBASE, (uint64_t)&__pcpu[0]);
2111 ssdtosyssd(&gdt_segs[GPROC0_SEL],
2112 (struct system_segment_descriptor *)&__pcpu[0].pc_gdt[GPROC0_SEL]);
2113 ltr(GSEL(GPROC0_SEL, SEL_KPL));
2116 * Now unmap the trampoline, and free the pages.
2117 * Clear pml5 entry used for 1:1 trampoline mapping.
2119 pte_clear(&v_pml5[pmap_pml5e_index(VM_PAGE_TO_PHYS(m_code))]);
2120 invlpg((vm_offset_t)v_code);
2121 vm_page_free(m_code);
2122 vm_page_free(m_pdp);
2127 * Recursively map PML5 to itself in order to get PTmap and
2130 v_pml5[PML5PML5I] = KPML5phys | X86_PG_RW | X86_PG_V | pg_nx;
2132 kernel_pmap->pm_cr3 = KPML5phys;
2133 kernel_pmap->pm_pmltop = v_pml5;
2135 SYSINIT(la57, SI_SUB_KMEM, SI_ORDER_ANY, pmap_bootstrap_la57, NULL);
2138 * Initialize a vm_page's machine-dependent fields.
2141 pmap_page_init(vm_page_t m)
2144 TAILQ_INIT(&m->md.pv_list);
2145 m->md.pat_mode = PAT_WRITE_BACK;
2148 static int pmap_allow_2m_x_ept;
2149 SYSCTL_INT(_vm_pmap, OID_AUTO, allow_2m_x_ept, CTLFLAG_RWTUN | CTLFLAG_NOFETCH,
2150 &pmap_allow_2m_x_ept, 0,
2151 "Allow executable superpage mappings in EPT");
2154 pmap_allow_2m_x_ept_recalculate(void)
2157 * SKL002, SKL012S. Since the EPT format is only used by
2158 * Intel CPUs, the vendor check is merely a formality.
2160 if (!(cpu_vendor_id != CPU_VENDOR_INTEL ||
2161 (cpu_ia32_arch_caps & IA32_ARCH_CAP_IF_PSCHANGE_MC_NO) != 0 ||
2162 (CPUID_TO_FAMILY(cpu_id) == 0x6 &&
2163 (CPUID_TO_MODEL(cpu_id) == 0x26 || /* Atoms */
2164 CPUID_TO_MODEL(cpu_id) == 0x27 ||
2165 CPUID_TO_MODEL(cpu_id) == 0x35 ||
2166 CPUID_TO_MODEL(cpu_id) == 0x36 ||
2167 CPUID_TO_MODEL(cpu_id) == 0x37 ||
2168 CPUID_TO_MODEL(cpu_id) == 0x86 ||
2169 CPUID_TO_MODEL(cpu_id) == 0x1c ||
2170 CPUID_TO_MODEL(cpu_id) == 0x4a ||
2171 CPUID_TO_MODEL(cpu_id) == 0x4c ||
2172 CPUID_TO_MODEL(cpu_id) == 0x4d ||
2173 CPUID_TO_MODEL(cpu_id) == 0x5a ||
2174 CPUID_TO_MODEL(cpu_id) == 0x5c ||
2175 CPUID_TO_MODEL(cpu_id) == 0x5d ||
2176 CPUID_TO_MODEL(cpu_id) == 0x5f ||
2177 CPUID_TO_MODEL(cpu_id) == 0x6e ||
2178 CPUID_TO_MODEL(cpu_id) == 0x7a ||
2179 CPUID_TO_MODEL(cpu_id) == 0x57 || /* Knights */
2180 CPUID_TO_MODEL(cpu_id) == 0x85))))
2181 pmap_allow_2m_x_ept = 1;
2182 TUNABLE_INT_FETCH("hw.allow_2m_x_ept", &pmap_allow_2m_x_ept);
2186 pmap_allow_2m_x_page(pmap_t pmap, bool executable)
2189 return (pmap->pm_type != PT_EPT || !executable ||
2190 !pmap_allow_2m_x_ept);
2195 pmap_init_pv_table(void)
2197 struct pmap_large_md_page *pvd;
2199 long start, end, highest, pv_npg;
2200 int domain, i, j, pages;
2203 * We strongly depend on the size being a power of two, so the assert
2204 * is overzealous. However, should the struct be resized to a
2205 * different power of two, the code below needs to be revisited.
2207 CTASSERT((sizeof(*pvd) == 64));
2210 * Calculate the size of the array.
2212 pmap_last_pa = vm_phys_segs[vm_phys_nsegs - 1].end;
2213 pv_npg = howmany(pmap_last_pa, NBPDR);
2214 s = (vm_size_t)pv_npg * sizeof(struct pmap_large_md_page);
2216 pv_table = (struct pmap_large_md_page *)kva_alloc(s);
2217 if (pv_table == NULL)
2218 panic("%s: kva_alloc failed\n", __func__);
2221 * Iterate physical segments to allocate space for respective pages.
2225 for (i = 0; i < vm_phys_nsegs; i++) {
2226 end = vm_phys_segs[i].end / NBPDR;
2227 domain = vm_phys_segs[i].domain;
2232 start = highest + 1;
2233 pvd = &pv_table[start];
2235 pages = end - start + 1;
2236 s = round_page(pages * sizeof(*pvd));
2237 highest = start + (s / sizeof(*pvd)) - 1;
2239 for (j = 0; j < s; j += PAGE_SIZE) {
2240 vm_page_t m = vm_page_alloc_domain(NULL, 0,
2241 domain, VM_ALLOC_NORMAL | VM_ALLOC_NOOBJ);
2243 panic("vm_page_alloc_domain failed for %lx\n", (vm_offset_t)pvd + j);
2244 pmap_qenter((vm_offset_t)pvd + j, &m, 1);
2247 for (j = 0; j < s / sizeof(*pvd); j++) {
2248 rw_init_flags(&pvd->pv_lock, "pmap pv list", RW_NEW);
2249 TAILQ_INIT(&pvd->pv_page.pv_list);
2250 pvd->pv_page.pv_gen = 0;
2251 pvd->pv_page.pat_mode = 0;
2252 pvd->pv_invl_gen = 0;
2256 pvd = &pv_dummy_large;
2257 rw_init_flags(&pvd->pv_lock, "pmap pv list dummy", RW_NEW);
2258 TAILQ_INIT(&pvd->pv_page.pv_list);
2259 pvd->pv_page.pv_gen = 0;
2260 pvd->pv_page.pat_mode = 0;
2261 pvd->pv_invl_gen = 0;
2265 pmap_init_pv_table(void)
2271 * Initialize the pool of pv list locks.
2273 for (i = 0; i < NPV_LIST_LOCKS; i++)
2274 rw_init(&pv_list_locks[i], "pmap pv list");
2277 * Calculate the size of the pv head table for superpages.
2279 pv_npg = howmany(vm_phys_segs[vm_phys_nsegs - 1].end, NBPDR);
2282 * Allocate memory for the pv head table for superpages.
2284 s = (vm_size_t)pv_npg * sizeof(struct md_page);
2286 pv_table = (struct md_page *)kmem_malloc(s, M_WAITOK | M_ZERO);
2287 for (i = 0; i < pv_npg; i++)
2288 TAILQ_INIT(&pv_table[i].pv_list);
2289 TAILQ_INIT(&pv_dummy.pv_list);
2294 * Initialize the pmap module.
2295 * Called by vm_init, to initialize any structures that the pmap
2296 * system needs to map virtual memory.
2301 struct pmap_preinit_mapping *ppim;
2303 int error, i, ret, skz63;
2305 /* L1TF, reserve page @0 unconditionally */
2306 vm_page_blacklist_add(0, bootverbose);
2308 /* Detect bare-metal Skylake Server and Skylake-X. */
2309 if (vm_guest == VM_GUEST_NO && cpu_vendor_id == CPU_VENDOR_INTEL &&
2310 CPUID_TO_FAMILY(cpu_id) == 0x6 && CPUID_TO_MODEL(cpu_id) == 0x55) {
2312 * Skylake-X errata SKZ63. Processor May Hang When
2313 * Executing Code In an HLE Transaction Region between
2314 * 40000000H and 403FFFFFH.
2316 * Mark the pages in the range as preallocated. It
2317 * seems to be impossible to distinguish between
2318 * Skylake Server and Skylake X.
2321 TUNABLE_INT_FETCH("hw.skz63_enable", &skz63);
2324 printf("SKZ63: skipping 4M RAM starting "
2325 "at physical 1G\n");
2326 for (i = 0; i < atop(0x400000); i++) {
2327 ret = vm_page_blacklist_add(0x40000000 +
2329 if (!ret && bootverbose)
2330 printf("page at %#lx already used\n",
2331 0x40000000 + ptoa(i));
2337 pmap_allow_2m_x_ept_recalculate();
2340 * Initialize the vm page array entries for the kernel pmap's
2343 PMAP_LOCK(kernel_pmap);
2344 for (i = 0; i < nkpt; i++) {
2345 mpte = PHYS_TO_VM_PAGE(KPTphys + (i << PAGE_SHIFT));
2346 KASSERT(mpte >= vm_page_array &&
2347 mpte < &vm_page_array[vm_page_array_size],
2348 ("pmap_init: page table page is out of range"));
2349 mpte->pindex = pmap_pde_pindex(KERNBASE) + i;
2350 mpte->phys_addr = KPTphys + (i << PAGE_SHIFT);
2351 mpte->ref_count = 1;
2354 * Collect the page table pages that were replaced by a 2MB
2355 * page in create_pagetables(). They are zero filled.
2357 if ((vm_paddr_t)i << PDRSHIFT < KERNend &&
2358 pmap_insert_pt_page(kernel_pmap, mpte, false))
2359 panic("pmap_init: pmap_insert_pt_page failed");
2361 PMAP_UNLOCK(kernel_pmap);
2365 * If the kernel is running on a virtual machine, then it must assume
2366 * that MCA is enabled by the hypervisor. Moreover, the kernel must
2367 * be prepared for the hypervisor changing the vendor and family that
2368 * are reported by CPUID. Consequently, the workaround for AMD Family
2369 * 10h Erratum 383 is enabled if the processor's feature set does not
2370 * include at least one feature that is only supported by older Intel
2371 * or newer AMD processors.
2373 if (vm_guest != VM_GUEST_NO && (cpu_feature & CPUID_SS) == 0 &&
2374 (cpu_feature2 & (CPUID2_SSSE3 | CPUID2_SSE41 | CPUID2_AESNI |
2375 CPUID2_AVX | CPUID2_XSAVE)) == 0 && (amd_feature2 & (AMDID2_XOP |
2377 workaround_erratum383 = 1;
2380 * Are large page mappings enabled?
2382 TUNABLE_INT_FETCH("vm.pmap.pg_ps_enabled", &pg_ps_enabled);
2383 if (pg_ps_enabled) {
2384 KASSERT(MAXPAGESIZES > 1 && pagesizes[1] == 0,
2385 ("pmap_init: can't assign to pagesizes[1]"));
2386 pagesizes[1] = NBPDR;
2387 if ((amd_feature & AMDID_PAGE1GB) != 0) {
2388 KASSERT(MAXPAGESIZES > 2 && pagesizes[2] == 0,
2389 ("pmap_init: can't assign to pagesizes[2]"));
2390 pagesizes[2] = NBPDP;
2395 * Initialize pv chunk lists.
2397 for (i = 0; i < PMAP_MEMDOM; i++) {
2398 mtx_init(&pv_chunks[i].pvc_lock, "pmap pv chunk list", NULL, MTX_DEF);
2399 TAILQ_INIT(&pv_chunks[i].pvc_list);
2401 pmap_init_pv_table();
2403 pmap_initialized = 1;
2404 for (i = 0; i < PMAP_PREINIT_MAPPING_COUNT; i++) {
2405 ppim = pmap_preinit_mapping + i;
2408 /* Make the direct map consistent */
2409 if (ppim->pa < dmaplimit && ppim->pa + ppim->sz <= dmaplimit) {
2410 (void)pmap_change_attr(PHYS_TO_DMAP(ppim->pa),
2411 ppim->sz, ppim->mode);
2415 printf("PPIM %u: PA=%#lx, VA=%#lx, size=%#lx, mode=%#x\n", i,
2416 ppim->pa, ppim->va, ppim->sz, ppim->mode);
2419 mtx_init(&qframe_mtx, "qfrmlk", NULL, MTX_SPIN);
2420 error = vmem_alloc(kernel_arena, PAGE_SIZE, M_BESTFIT | M_WAITOK,
2421 (vmem_addr_t *)&qframe);
2423 panic("qframe allocation failed");
2426 TUNABLE_INT_FETCH("vm.pmap.large_map_pml4_entries", &lm_ents);
2427 if (lm_ents > LMEPML4I - LMSPML4I + 1)
2428 lm_ents = LMEPML4I - LMSPML4I + 1;
2430 printf("pmap: large map %u PML4 slots (%lu GB)\n",
2431 lm_ents, (u_long)lm_ents * (NBPML4 / 1024 / 1024 / 1024));
2433 large_vmem = vmem_create("large", LARGEMAP_MIN_ADDRESS,
2434 (vmem_size_t)lm_ents * NBPML4, PAGE_SIZE, 0, M_WAITOK);
2435 if (large_vmem == NULL) {
2436 printf("pmap: cannot create large map\n");
2439 for (i = 0; i < lm_ents; i++) {
2440 m = pmap_large_map_getptp_unlocked();
2442 kernel_pml4[LMSPML4I + i] = X86_PG_V |
2443 X86_PG_RW | X86_PG_A | X86_PG_M | pg_nx |
2449 SYSCTL_UINT(_vm_pmap, OID_AUTO, large_map_pml4_entries,
2450 CTLFLAG_RDTUN | CTLFLAG_NOFETCH, &lm_ents, 0,
2451 "Maximum number of PML4 entries for use by large map (tunable). "
2452 "Each entry corresponds to 512GB of address space.");
2454 static SYSCTL_NODE(_vm_pmap, OID_AUTO, pde, CTLFLAG_RD | CTLFLAG_MPSAFE, 0,
2455 "2MB page mapping counters");
2457 static u_long pmap_pde_demotions;
2458 SYSCTL_ULONG(_vm_pmap_pde, OID_AUTO, demotions, CTLFLAG_RD,
2459 &pmap_pde_demotions, 0, "2MB page demotions");
2461 static u_long pmap_pde_mappings;
2462 SYSCTL_ULONG(_vm_pmap_pde, OID_AUTO, mappings, CTLFLAG_RD,
2463 &pmap_pde_mappings, 0, "2MB page mappings");
2465 static u_long pmap_pde_p_failures;
2466 SYSCTL_ULONG(_vm_pmap_pde, OID_AUTO, p_failures, CTLFLAG_RD,
2467 &pmap_pde_p_failures, 0, "2MB page promotion failures");
2469 static u_long pmap_pde_promotions;
2470 SYSCTL_ULONG(_vm_pmap_pde, OID_AUTO, promotions, CTLFLAG_RD,
2471 &pmap_pde_promotions, 0, "2MB page promotions");
2473 static SYSCTL_NODE(_vm_pmap, OID_AUTO, pdpe, CTLFLAG_RD | CTLFLAG_MPSAFE, 0,
2474 "1GB page mapping counters");
2476 static u_long pmap_pdpe_demotions;
2477 SYSCTL_ULONG(_vm_pmap_pdpe, OID_AUTO, demotions, CTLFLAG_RD,
2478 &pmap_pdpe_demotions, 0, "1GB page demotions");
2480 /***************************************************
2481 * Low level helper routines.....
2482 ***************************************************/
2485 pmap_swap_pat(pmap_t pmap, pt_entry_t entry)
2487 int x86_pat_bits = X86_PG_PTE_PAT | X86_PG_PDE_PAT;
2489 switch (pmap->pm_type) {
2492 /* Verify that both PAT bits are not set at the same time */
2493 KASSERT((entry & x86_pat_bits) != x86_pat_bits,
2494 ("Invalid PAT bits in entry %#lx", entry));
2496 /* Swap the PAT bits if one of them is set */
2497 if ((entry & x86_pat_bits) != 0)
2498 entry ^= x86_pat_bits;
2502 * Nothing to do - the memory attributes are represented
2503 * the same way for regular pages and superpages.
2507 panic("pmap_switch_pat_bits: bad pm_type %d", pmap->pm_type);
2514 pmap_is_valid_memattr(pmap_t pmap __unused, vm_memattr_t mode)
2517 return (mode >= 0 && mode < PAT_INDEX_SIZE &&
2518 pat_index[(int)mode] >= 0);
2522 * Determine the appropriate bits to set in a PTE or PDE for a specified
2526 pmap_cache_bits(pmap_t pmap, int mode, boolean_t is_pde)
2528 int cache_bits, pat_flag, pat_idx;
2530 if (!pmap_is_valid_memattr(pmap, mode))
2531 panic("Unknown caching mode %d\n", mode);
2533 switch (pmap->pm_type) {
2536 /* The PAT bit is different for PTE's and PDE's. */
2537 pat_flag = is_pde ? X86_PG_PDE_PAT : X86_PG_PTE_PAT;
2539 /* Map the caching mode to a PAT index. */
2540 pat_idx = pat_index[mode];
2542 /* Map the 3-bit index value into the PAT, PCD, and PWT bits. */
2545 cache_bits |= pat_flag;
2547 cache_bits |= PG_NC_PCD;
2549 cache_bits |= PG_NC_PWT;
2553 cache_bits = EPT_PG_IGNORE_PAT | EPT_PG_MEMORY_TYPE(mode);
2557 panic("unsupported pmap type %d", pmap->pm_type);
2560 return (cache_bits);
2564 pmap_cache_mask(pmap_t pmap, boolean_t is_pde)
2568 switch (pmap->pm_type) {
2571 mask = is_pde ? X86_PG_PDE_CACHE : X86_PG_PTE_CACHE;
2574 mask = EPT_PG_IGNORE_PAT | EPT_PG_MEMORY_TYPE(0x7);
2577 panic("pmap_cache_mask: invalid pm_type %d", pmap->pm_type);
2584 pmap_pat_index(pmap_t pmap, pt_entry_t pte, bool is_pde)
2586 int pat_flag, pat_idx;
2589 switch (pmap->pm_type) {
2592 /* The PAT bit is different for PTE's and PDE's. */
2593 pat_flag = is_pde ? X86_PG_PDE_PAT : X86_PG_PTE_PAT;
2595 if ((pte & pat_flag) != 0)
2597 if ((pte & PG_NC_PCD) != 0)
2599 if ((pte & PG_NC_PWT) != 0)
2603 if ((pte & EPT_PG_IGNORE_PAT) != 0)
2604 panic("EPT PTE %#lx has no PAT memory type", pte);
2605 pat_idx = (pte & EPT_PG_MEMORY_TYPE(0x7)) >> 3;
2609 /* See pmap_init_pat(). */
2619 pmap_ps_enabled(pmap_t pmap)
2622 return (pg_ps_enabled && (pmap->pm_flags & PMAP_PDE_SUPERPAGE) != 0);
2626 pmap_update_pde_store(pmap_t pmap, pd_entry_t *pde, pd_entry_t newpde)
2629 switch (pmap->pm_type) {
2636 * This is a little bogus since the generation number is
2637 * supposed to be bumped up when a region of the address
2638 * space is invalidated in the page tables.
2640 * In this case the old PDE entry is valid but yet we want
2641 * to make sure that any mappings using the old entry are
2642 * invalidated in the TLB.
2644 * The reason this works as expected is because we rendezvous
2645 * "all" host cpus and force any vcpu context to exit as a
2648 atomic_add_acq_long(&pmap->pm_eptgen, 1);
2651 panic("pmap_update_pde_store: bad pm_type %d", pmap->pm_type);
2653 pde_store(pde, newpde);
2657 * After changing the page size for the specified virtual address in the page
2658 * table, flush the corresponding entries from the processor's TLB. Only the
2659 * calling processor's TLB is affected.
2661 * The calling thread must be pinned to a processor.
2664 pmap_update_pde_invalidate(pmap_t pmap, vm_offset_t va, pd_entry_t newpde)
2668 if (pmap_type_guest(pmap))
2671 KASSERT(pmap->pm_type == PT_X86,
2672 ("pmap_update_pde_invalidate: invalid type %d", pmap->pm_type));
2674 PG_G = pmap_global_bit(pmap);
2676 if ((newpde & PG_PS) == 0)
2677 /* Demotion: flush a specific 2MB page mapping. */
2679 else if ((newpde & PG_G) == 0)
2681 * Promotion: flush every 4KB page mapping from the TLB
2682 * because there are too many to flush individually.
2687 * Promotion: flush every 4KB page mapping from the TLB,
2688 * including any global (PG_G) mappings.
2696 * For SMP, these functions have to use the IPI mechanism for coherence.
2698 * N.B.: Before calling any of the following TLB invalidation functions,
2699 * the calling processor must ensure that all stores updating a non-
2700 * kernel page table are globally performed. Otherwise, another
2701 * processor could cache an old, pre-update entry without being
2702 * invalidated. This can happen one of two ways: (1) The pmap becomes
2703 * active on another processor after its pm_active field is checked by
2704 * one of the following functions but before a store updating the page
2705 * table is globally performed. (2) The pmap becomes active on another
2706 * processor before its pm_active field is checked but due to
2707 * speculative loads one of the following functions stills reads the
2708 * pmap as inactive on the other processor.
2710 * The kernel page table is exempt because its pm_active field is
2711 * immutable. The kernel page table is always active on every
2716 * Interrupt the cpus that are executing in the guest context.
2717 * This will force the vcpu to exit and the cached EPT mappings
2718 * will be invalidated by the host before the next vmresume.
2720 static __inline void
2721 pmap_invalidate_ept(pmap_t pmap)
2726 KASSERT(!CPU_ISSET(curcpu, &pmap->pm_active),
2727 ("pmap_invalidate_ept: absurd pm_active"));
2730 * The TLB mappings associated with a vcpu context are not
2731 * flushed each time a different vcpu is chosen to execute.
2733 * This is in contrast with a process's vtop mappings that
2734 * are flushed from the TLB on each context switch.
2736 * Therefore we need to do more than just a TLB shootdown on
2737 * the active cpus in 'pmap->pm_active'. To do this we keep
2738 * track of the number of invalidations performed on this pmap.
2740 * Each vcpu keeps a cache of this counter and compares it
2741 * just before a vmresume. If the counter is out-of-date an
2742 * invept will be done to flush stale mappings from the TLB.
2744 atomic_add_acq_long(&pmap->pm_eptgen, 1);
2747 * Force the vcpu to exit and trap back into the hypervisor.
2749 ipinum = pmap->pm_flags & PMAP_NESTED_IPIMASK;
2750 ipi_selected(pmap->pm_active, ipinum);
2755 pmap_invalidate_cpu_mask(pmap_t pmap)
2758 return (pmap == kernel_pmap ? all_cpus : pmap->pm_active);
2762 pmap_invalidate_page_pcid(pmap_t pmap, vm_offset_t va,
2763 const bool invpcid_works1)
2765 struct invpcid_descr d;
2766 uint64_t kcr3, ucr3;
2770 cpuid = PCPU_GET(cpuid);
2771 if (pmap == PCPU_GET(curpmap)) {
2772 if (pmap->pm_ucr3 != PMAP_NO_CR3 &&
2774 * If we context-switched right after
2775 * PCPU_GET(ucr3_load_mask), we could read the
2776 * ~CR3_PCID_SAVE mask, which causes us to skip
2777 * the code below to invalidate user pages. This
2778 * is handled in pmap_activate_sw_pcid_pti() by
2779 * clearing pm_gen if ucr3_load_mask is ~CR3_PCID_SAVE.
2781 PCPU_GET(ucr3_load_mask) == PMAP_UCR3_NOMASK) {
2783 * Because pm_pcid is recalculated on a
2784 * context switch, we must disable switching.
2785 * Otherwise, we might use a stale value
2789 pcid = pmap->pm_pcids[cpuid].pm_pcid;
2790 if (invpcid_works1) {
2791 d.pcid = pcid | PMAP_PCID_USER_PT;
2794 invpcid(&d, INVPCID_ADDR);
2796 kcr3 = pmap->pm_cr3 | pcid | CR3_PCID_SAVE;
2797 ucr3 = pmap->pm_ucr3 | pcid |
2798 PMAP_PCID_USER_PT | CR3_PCID_SAVE;
2799 pmap_pti_pcid_invlpg(ucr3, kcr3, va);
2804 pmap->pm_pcids[cpuid].pm_gen = 0;
2808 pmap->pm_pcids[i].pm_gen = 0;
2812 * The fence is between stores to pm_gen and the read of the
2813 * pm_active mask. We need to ensure that it is impossible
2814 * for us to miss the bit update in pm_active and
2815 * simultaneously observe a non-zero pm_gen in
2816 * pmap_activate_sw(), otherwise TLB update is missed.
2817 * Without the fence, IA32 allows such an outcome. Note that
2818 * pm_active is updated by a locked operation, which provides
2819 * the reciprocal fence.
2821 atomic_thread_fence_seq_cst();
2825 pmap_invalidate_page_pcid_invpcid(pmap_t pmap, vm_offset_t va)
2828 pmap_invalidate_page_pcid(pmap, va, true);
2832 pmap_invalidate_page_pcid_noinvpcid(pmap_t pmap, vm_offset_t va)
2835 pmap_invalidate_page_pcid(pmap, va, false);
2839 pmap_invalidate_page_nopcid(pmap_t pmap, vm_offset_t va)
2843 DEFINE_IFUNC(static, void, pmap_invalidate_page_mode, (pmap_t, vm_offset_t))
2846 if (pmap_pcid_enabled)
2847 return (invpcid_works ? pmap_invalidate_page_pcid_invpcid :
2848 pmap_invalidate_page_pcid_noinvpcid);
2849 return (pmap_invalidate_page_nopcid);
2853 pmap_invalidate_page_curcpu_cb(pmap_t pmap, vm_offset_t va,
2854 vm_offset_t addr2 __unused)
2857 if (pmap == kernel_pmap) {
2860 if (pmap == PCPU_GET(curpmap))
2862 pmap_invalidate_page_mode(pmap, va);
2867 pmap_invalidate_page(pmap_t pmap, vm_offset_t va)
2870 if (pmap_type_guest(pmap)) {
2871 pmap_invalidate_ept(pmap);
2875 KASSERT(pmap->pm_type == PT_X86,
2876 ("pmap_invalidate_page: invalid type %d", pmap->pm_type));
2878 smp_masked_invlpg(pmap_invalidate_cpu_mask(pmap), va, pmap,
2879 pmap_invalidate_page_curcpu_cb);
2882 /* 4k PTEs -- Chosen to exceed the total size of Broadwell L2 TLB */
2883 #define PMAP_INVLPG_THRESHOLD (4 * 1024 * PAGE_SIZE)
2886 pmap_invalidate_range_pcid(pmap_t pmap, vm_offset_t sva, vm_offset_t eva,
2887 const bool invpcid_works1)
2889 struct invpcid_descr d;
2890 uint64_t kcr3, ucr3;
2894 cpuid = PCPU_GET(cpuid);
2895 if (pmap == PCPU_GET(curpmap)) {
2896 if (pmap->pm_ucr3 != PMAP_NO_CR3 &&
2897 PCPU_GET(ucr3_load_mask) == PMAP_UCR3_NOMASK) {
2899 pcid = pmap->pm_pcids[cpuid].pm_pcid;
2900 if (invpcid_works1) {
2901 d.pcid = pcid | PMAP_PCID_USER_PT;
2904 for (; d.addr < eva; d.addr += PAGE_SIZE)
2905 invpcid(&d, INVPCID_ADDR);
2907 kcr3 = pmap->pm_cr3 | pcid | CR3_PCID_SAVE;
2908 ucr3 = pmap->pm_ucr3 | pcid |
2909 PMAP_PCID_USER_PT | CR3_PCID_SAVE;
2910 pmap_pti_pcid_invlrng(ucr3, kcr3, sva, eva);
2915 pmap->pm_pcids[cpuid].pm_gen = 0;
2919 pmap->pm_pcids[i].pm_gen = 0;
2921 /* See the comment in pmap_invalidate_page_pcid(). */
2922 atomic_thread_fence_seq_cst();
2926 pmap_invalidate_range_pcid_invpcid(pmap_t pmap, vm_offset_t sva,
2930 pmap_invalidate_range_pcid(pmap, sva, eva, true);
2934 pmap_invalidate_range_pcid_noinvpcid(pmap_t pmap, vm_offset_t sva,
2938 pmap_invalidate_range_pcid(pmap, sva, eva, false);
2942 pmap_invalidate_range_nopcid(pmap_t pmap, vm_offset_t sva, vm_offset_t eva)
2946 DEFINE_IFUNC(static, void, pmap_invalidate_range_mode, (pmap_t, vm_offset_t,
2950 if (pmap_pcid_enabled)
2951 return (invpcid_works ? pmap_invalidate_range_pcid_invpcid :
2952 pmap_invalidate_range_pcid_noinvpcid);
2953 return (pmap_invalidate_range_nopcid);
2957 pmap_invalidate_range_curcpu_cb(pmap_t pmap, vm_offset_t sva, vm_offset_t eva)
2961 if (pmap == kernel_pmap) {
2962 for (addr = sva; addr < eva; addr += PAGE_SIZE)
2965 if (pmap == PCPU_GET(curpmap)) {
2966 for (addr = sva; addr < eva; addr += PAGE_SIZE)
2969 pmap_invalidate_range_mode(pmap, sva, eva);
2974 pmap_invalidate_range(pmap_t pmap, vm_offset_t sva, vm_offset_t eva)
2977 if (eva - sva >= PMAP_INVLPG_THRESHOLD) {
2978 pmap_invalidate_all(pmap);
2982 if (pmap_type_guest(pmap)) {
2983 pmap_invalidate_ept(pmap);
2987 KASSERT(pmap->pm_type == PT_X86,
2988 ("pmap_invalidate_range: invalid type %d", pmap->pm_type));
2990 smp_masked_invlpg_range(pmap_invalidate_cpu_mask(pmap), sva, eva, pmap,
2991 pmap_invalidate_range_curcpu_cb);
2995 pmap_invalidate_all_pcid(pmap_t pmap, bool invpcid_works1)
2997 struct invpcid_descr d;
3002 if (pmap == kernel_pmap) {
3003 if (invpcid_works1) {
3004 bzero(&d, sizeof(d));
3005 invpcid(&d, INVPCID_CTXGLOB);
3010 cpuid = PCPU_GET(cpuid);
3011 if (pmap == PCPU_GET(curpmap)) {
3013 pcid = pmap->pm_pcids[cpuid].pm_pcid;
3014 if (invpcid_works1) {
3018 invpcid(&d, INVPCID_CTX);
3020 kcr3 = pmap->pm_cr3 | pcid;
3023 if (pmap->pm_ucr3 != PMAP_NO_CR3)
3024 PCPU_SET(ucr3_load_mask, ~CR3_PCID_SAVE);
3027 pmap->pm_pcids[cpuid].pm_gen = 0;
3030 pmap->pm_pcids[i].pm_gen = 0;
3033 /* See the comment in pmap_invalidate_page_pcid(). */
3034 atomic_thread_fence_seq_cst();
3038 pmap_invalidate_all_pcid_invpcid(pmap_t pmap)
3041 pmap_invalidate_all_pcid(pmap, true);
3045 pmap_invalidate_all_pcid_noinvpcid(pmap_t pmap)
3048 pmap_invalidate_all_pcid(pmap, false);
3052 pmap_invalidate_all_nopcid(pmap_t pmap)
3055 if (pmap == kernel_pmap)
3057 else if (pmap == PCPU_GET(curpmap))
3061 DEFINE_IFUNC(static, void, pmap_invalidate_all_mode, (pmap_t))
3064 if (pmap_pcid_enabled)
3065 return (invpcid_works ? pmap_invalidate_all_pcid_invpcid :
3066 pmap_invalidate_all_pcid_noinvpcid);
3067 return (pmap_invalidate_all_nopcid);
3071 pmap_invalidate_all_curcpu_cb(pmap_t pmap, vm_offset_t addr1 __unused,
3072 vm_offset_t addr2 __unused)
3075 pmap_invalidate_all_mode(pmap);
3079 pmap_invalidate_all(pmap_t pmap)
3082 if (pmap_type_guest(pmap)) {
3083 pmap_invalidate_ept(pmap);
3087 KASSERT(pmap->pm_type == PT_X86,
3088 ("pmap_invalidate_all: invalid type %d", pmap->pm_type));
3090 smp_masked_invltlb(pmap_invalidate_cpu_mask(pmap), pmap,
3091 pmap_invalidate_all_curcpu_cb);
3095 pmap_invalidate_cache_curcpu_cb(pmap_t pmap __unused, vm_offset_t va __unused,
3096 vm_offset_t addr2 __unused)
3103 pmap_invalidate_cache(void)
3106 smp_cache_flush(pmap_invalidate_cache_curcpu_cb);
3110 cpuset_t invalidate; /* processors that invalidate their TLB */
3115 u_int store; /* processor that updates the PDE */
3119 pmap_update_pde_action(void *arg)
3121 struct pde_action *act = arg;
3123 if (act->store == PCPU_GET(cpuid))
3124 pmap_update_pde_store(act->pmap, act->pde, act->newpde);
3128 pmap_update_pde_teardown(void *arg)
3130 struct pde_action *act = arg;
3132 if (CPU_ISSET(PCPU_GET(cpuid), &act->invalidate))
3133 pmap_update_pde_invalidate(act->pmap, act->va, act->newpde);
3137 * Change the page size for the specified virtual address in a way that
3138 * prevents any possibility of the TLB ever having two entries that map the
3139 * same virtual address using different page sizes. This is the recommended
3140 * workaround for Erratum 383 on AMD Family 10h processors. It prevents a
3141 * machine check exception for a TLB state that is improperly diagnosed as a
3145 pmap_update_pde(pmap_t pmap, vm_offset_t va, pd_entry_t *pde, pd_entry_t newpde)
3147 struct pde_action act;
3148 cpuset_t active, other_cpus;
3152 cpuid = PCPU_GET(cpuid);
3153 other_cpus = all_cpus;
3154 CPU_CLR(cpuid, &other_cpus);
3155 if (pmap == kernel_pmap || pmap_type_guest(pmap))
3158 active = pmap->pm_active;
3160 if (CPU_OVERLAP(&active, &other_cpus)) {
3162 act.invalidate = active;
3166 act.newpde = newpde;
3167 CPU_SET(cpuid, &active);
3168 smp_rendezvous_cpus(active,
3169 smp_no_rendezvous_barrier, pmap_update_pde_action,
3170 pmap_update_pde_teardown, &act);
3172 pmap_update_pde_store(pmap, pde, newpde);
3173 if (CPU_ISSET(cpuid, &active))
3174 pmap_update_pde_invalidate(pmap, va, newpde);
3180 * Normal, non-SMP, invalidation functions.
3183 pmap_invalidate_page(pmap_t pmap, vm_offset_t va)
3185 struct invpcid_descr d;
3186 uint64_t kcr3, ucr3;
3189 if (pmap->pm_type == PT_RVI || pmap->pm_type == PT_EPT) {
3193 KASSERT(pmap->pm_type == PT_X86,
3194 ("pmap_invalidate_range: unknown type %d", pmap->pm_type));
3196 if (pmap == kernel_pmap || pmap == PCPU_GET(curpmap)) {
3198 if (pmap == PCPU_GET(curpmap) && pmap_pcid_enabled &&
3199 pmap->pm_ucr3 != PMAP_NO_CR3) {
3201 pcid = pmap->pm_pcids[0].pm_pcid;
3202 if (invpcid_works) {
3203 d.pcid = pcid | PMAP_PCID_USER_PT;
3206 invpcid(&d, INVPCID_ADDR);
3208 kcr3 = pmap->pm_cr3 | pcid | CR3_PCID_SAVE;
3209 ucr3 = pmap->pm_ucr3 | pcid |
3210 PMAP_PCID_USER_PT | CR3_PCID_SAVE;
3211 pmap_pti_pcid_invlpg(ucr3, kcr3, va);
3215 } else if (pmap_pcid_enabled)
3216 pmap->pm_pcids[0].pm_gen = 0;
3220 pmap_invalidate_range(pmap_t pmap, vm_offset_t sva, vm_offset_t eva)
3222 struct invpcid_descr d;
3224 uint64_t kcr3, ucr3;
3226 if (pmap->pm_type == PT_RVI || pmap->pm_type == PT_EPT) {
3230 KASSERT(pmap->pm_type == PT_X86,
3231 ("pmap_invalidate_range: unknown type %d", pmap->pm_type));
3233 if (pmap == kernel_pmap || pmap == PCPU_GET(curpmap)) {
3234 for (addr = sva; addr < eva; addr += PAGE_SIZE)
3236 if (pmap == PCPU_GET(curpmap) && pmap_pcid_enabled &&
3237 pmap->pm_ucr3 != PMAP_NO_CR3) {
3239 if (invpcid_works) {
3240 d.pcid = pmap->pm_pcids[0].pm_pcid |
3244 for (; d.addr < eva; d.addr += PAGE_SIZE)
3245 invpcid(&d, INVPCID_ADDR);
3247 kcr3 = pmap->pm_cr3 | pmap->pm_pcids[0].
3248 pm_pcid | CR3_PCID_SAVE;
3249 ucr3 = pmap->pm_ucr3 | pmap->pm_pcids[0].
3250 pm_pcid | PMAP_PCID_USER_PT | CR3_PCID_SAVE;
3251 pmap_pti_pcid_invlrng(ucr3, kcr3, sva, eva);
3255 } else if (pmap_pcid_enabled) {
3256 pmap->pm_pcids[0].pm_gen = 0;
3261 pmap_invalidate_all(pmap_t pmap)
3263 struct invpcid_descr d;
3264 uint64_t kcr3, ucr3;
3266 if (pmap->pm_type == PT_RVI || pmap->pm_type == PT_EPT) {
3270 KASSERT(pmap->pm_type == PT_X86,
3271 ("pmap_invalidate_all: unknown type %d", pmap->pm_type));
3273 if (pmap == kernel_pmap) {
3274 if (pmap_pcid_enabled && invpcid_works) {
3275 bzero(&d, sizeof(d));
3276 invpcid(&d, INVPCID_CTXGLOB);
3280 } else if (pmap == PCPU_GET(curpmap)) {
3281 if (pmap_pcid_enabled) {
3283 if (invpcid_works) {
3284 d.pcid = pmap->pm_pcids[0].pm_pcid;
3287 invpcid(&d, INVPCID_CTX);
3288 if (pmap->pm_ucr3 != PMAP_NO_CR3) {
3289 d.pcid |= PMAP_PCID_USER_PT;
3290 invpcid(&d, INVPCID_CTX);
3293 kcr3 = pmap->pm_cr3 | pmap->pm_pcids[0].pm_pcid;
3294 if (pmap->pm_ucr3 != PMAP_NO_CR3) {
3295 ucr3 = pmap->pm_ucr3 | pmap->pm_pcids[
3296 0].pm_pcid | PMAP_PCID_USER_PT;
3297 pmap_pti_pcid_invalidate(ucr3, kcr3);
3305 } else if (pmap_pcid_enabled) {
3306 pmap->pm_pcids[0].pm_gen = 0;
3311 pmap_invalidate_cache(void)
3318 pmap_update_pde(pmap_t pmap, vm_offset_t va, pd_entry_t *pde, pd_entry_t newpde)
3321 pmap_update_pde_store(pmap, pde, newpde);
3322 if (pmap == kernel_pmap || pmap == PCPU_GET(curpmap))
3323 pmap_update_pde_invalidate(pmap, va, newpde);
3325 pmap->pm_pcids[0].pm_gen = 0;
3330 pmap_invalidate_pde_page(pmap_t pmap, vm_offset_t va, pd_entry_t pde)
3334 * When the PDE has PG_PROMOTED set, the 2MB page mapping was created
3335 * by a promotion that did not invalidate the 512 4KB page mappings
3336 * that might exist in the TLB. Consequently, at this point, the TLB
3337 * may hold both 4KB and 2MB page mappings for the address range [va,
3338 * va + NBPDR). Therefore, the entire range must be invalidated here.
3339 * In contrast, when PG_PROMOTED is clear, the TLB will not hold any
3340 * 4KB page mappings for the address range [va, va + NBPDR), and so a
3341 * single INVLPG suffices to invalidate the 2MB page mapping from the
3344 if ((pde & PG_PROMOTED) != 0)
3345 pmap_invalidate_range(pmap, va, va + NBPDR - 1);
3347 pmap_invalidate_page(pmap, va);
3350 DEFINE_IFUNC(, void, pmap_invalidate_cache_range,
3351 (vm_offset_t sva, vm_offset_t eva))
3354 if ((cpu_feature & CPUID_SS) != 0)
3355 return (pmap_invalidate_cache_range_selfsnoop);
3356 if ((cpu_feature & CPUID_CLFSH) != 0)
3357 return (pmap_force_invalidate_cache_range);
3358 return (pmap_invalidate_cache_range_all);
3361 #define PMAP_CLFLUSH_THRESHOLD (2 * 1024 * 1024)
3364 pmap_invalidate_cache_range_check_align(vm_offset_t sva, vm_offset_t eva)
3367 KASSERT((sva & PAGE_MASK) == 0,
3368 ("pmap_invalidate_cache_range: sva not page-aligned"));
3369 KASSERT((eva & PAGE_MASK) == 0,
3370 ("pmap_invalidate_cache_range: eva not page-aligned"));
3374 pmap_invalidate_cache_range_selfsnoop(vm_offset_t sva, vm_offset_t eva)
3377 pmap_invalidate_cache_range_check_align(sva, eva);
3381 pmap_force_invalidate_cache_range(vm_offset_t sva, vm_offset_t eva)
3384 sva &= ~(vm_offset_t)(cpu_clflush_line_size - 1);
3387 * XXX: Some CPUs fault, hang, or trash the local APIC
3388 * registers if we use CLFLUSH on the local APIC range. The
3389 * local APIC is always uncached, so we don't need to flush
3390 * for that range anyway.
3392 if (pmap_kextract(sva) == lapic_paddr)
3395 if ((cpu_stdext_feature & CPUID_STDEXT_CLFLUSHOPT) != 0) {
3397 * Do per-cache line flush. Use a locked
3398 * instruction to insure that previous stores are
3399 * included in the write-back. The processor
3400 * propagates flush to other processors in the cache
3403 atomic_thread_fence_seq_cst();
3404 for (; sva < eva; sva += cpu_clflush_line_size)
3406 atomic_thread_fence_seq_cst();
3409 * Writes are ordered by CLFLUSH on Intel CPUs.
3411 if (cpu_vendor_id != CPU_VENDOR_INTEL)
3413 for (; sva < eva; sva += cpu_clflush_line_size)
3415 if (cpu_vendor_id != CPU_VENDOR_INTEL)
3421 pmap_invalidate_cache_range_all(vm_offset_t sva, vm_offset_t eva)
3424 pmap_invalidate_cache_range_check_align(sva, eva);
3425 pmap_invalidate_cache();
3429 * Remove the specified set of pages from the data and instruction caches.
3431 * In contrast to pmap_invalidate_cache_range(), this function does not
3432 * rely on the CPU's self-snoop feature, because it is intended for use
3433 * when moving pages into a different cache domain.
3436 pmap_invalidate_cache_pages(vm_page_t *pages, int count)
3438 vm_offset_t daddr, eva;
3442 useclflushopt = (cpu_stdext_feature & CPUID_STDEXT_CLFLUSHOPT) != 0;
3443 if (count >= PMAP_CLFLUSH_THRESHOLD / PAGE_SIZE ||
3444 ((cpu_feature & CPUID_CLFSH) == 0 && !useclflushopt))
3445 pmap_invalidate_cache();
3448 atomic_thread_fence_seq_cst();
3449 else if (cpu_vendor_id != CPU_VENDOR_INTEL)
3451 for (i = 0; i < count; i++) {
3452 daddr = PHYS_TO_DMAP(VM_PAGE_TO_PHYS(pages[i]));
3453 eva = daddr + PAGE_SIZE;
3454 for (; daddr < eva; daddr += cpu_clflush_line_size) {
3462 atomic_thread_fence_seq_cst();
3463 else if (cpu_vendor_id != CPU_VENDOR_INTEL)
3469 pmap_flush_cache_range(vm_offset_t sva, vm_offset_t eva)
3472 pmap_invalidate_cache_range_check_align(sva, eva);
3474 if ((cpu_stdext_feature & CPUID_STDEXT_CLWB) == 0) {
3475 pmap_force_invalidate_cache_range(sva, eva);
3479 /* See comment in pmap_force_invalidate_cache_range(). */
3480 if (pmap_kextract(sva) == lapic_paddr)
3483 atomic_thread_fence_seq_cst();
3484 for (; sva < eva; sva += cpu_clflush_line_size)
3486 atomic_thread_fence_seq_cst();
3490 pmap_flush_cache_phys_range(vm_paddr_t spa, vm_paddr_t epa, vm_memattr_t mattr)
3494 int error, pte_bits;
3496 KASSERT((spa & PAGE_MASK) == 0,
3497 ("pmap_flush_cache_phys_range: spa not page-aligned"));
3498 KASSERT((epa & PAGE_MASK) == 0,
3499 ("pmap_flush_cache_phys_range: epa not page-aligned"));
3501 if (spa < dmaplimit) {
3502 pmap_flush_cache_range(PHYS_TO_DMAP(spa), PHYS_TO_DMAP(MIN(
3504 if (dmaplimit >= epa)
3509 pte_bits = pmap_cache_bits(kernel_pmap, mattr, 0) | X86_PG_RW |
3511 error = vmem_alloc(kernel_arena, PAGE_SIZE, M_BESTFIT | M_WAITOK,
3513 KASSERT(error == 0, ("vmem_alloc failed: %d", error));
3514 pte = vtopte(vaddr);
3515 for (; spa < epa; spa += PAGE_SIZE) {
3517 pte_store(pte, spa | pte_bits);
3519 /* XXXKIB atomic inside flush_cache_range are excessive */
3520 pmap_flush_cache_range(vaddr, vaddr + PAGE_SIZE);
3523 vmem_free(kernel_arena, vaddr, PAGE_SIZE);
3527 * Routine: pmap_extract
3529 * Extract the physical page address associated
3530 * with the given map/virtual_address pair.
3533 pmap_extract(pmap_t pmap, vm_offset_t va)
3537 pt_entry_t *pte, PG_V;
3541 PG_V = pmap_valid_bit(pmap);
3543 pdpe = pmap_pdpe(pmap, va);
3544 if (pdpe != NULL && (*pdpe & PG_V) != 0) {
3545 if ((*pdpe & PG_PS) != 0)
3546 pa = (*pdpe & PG_PS_FRAME) | (va & PDPMASK);
3548 pde = pmap_pdpe_to_pde(pdpe, va);
3549 if ((*pde & PG_V) != 0) {
3550 if ((*pde & PG_PS) != 0) {
3551 pa = (*pde & PG_PS_FRAME) |
3554 pte = pmap_pde_to_pte(pde, va);
3555 pa = (*pte & PG_FRAME) |
3566 * Routine: pmap_extract_and_hold
3568 * Atomically extract and hold the physical page
3569 * with the given pmap and virtual address pair
3570 * if that mapping permits the given protection.
3573 pmap_extract_and_hold(pmap_t pmap, vm_offset_t va, vm_prot_t prot)
3575 pdp_entry_t pdpe, *pdpep;
3576 pd_entry_t pde, *pdep;
3577 pt_entry_t pte, PG_RW, PG_V;
3581 PG_RW = pmap_rw_bit(pmap);
3582 PG_V = pmap_valid_bit(pmap);
3585 pdpep = pmap_pdpe(pmap, va);
3586 if (pdpep == NULL || ((pdpe = *pdpep) & PG_V) == 0)
3588 if ((pdpe & PG_PS) != 0) {
3589 if ((pdpe & PG_RW) == 0 && (prot & VM_PROT_WRITE) != 0)
3591 m = PHYS_TO_VM_PAGE((pdpe & PG_PS_FRAME) | (va & PDPMASK));
3595 pdep = pmap_pdpe_to_pde(pdpep, va);
3596 if (pdep == NULL || ((pde = *pdep) & PG_V) == 0)
3598 if ((pde & PG_PS) != 0) {
3599 if ((pde & PG_RW) == 0 && (prot & VM_PROT_WRITE) != 0)
3601 m = PHYS_TO_VM_PAGE((pde & PG_PS_FRAME) | (va & PDRMASK));
3605 pte = *pmap_pde_to_pte(pdep, va);
3606 if ((pte & PG_V) == 0 ||
3607 ((pte & PG_RW) == 0 && (prot & VM_PROT_WRITE) != 0))
3609 m = PHYS_TO_VM_PAGE(pte & PG_FRAME);
3612 if (m != NULL && !vm_page_wire_mapped(m))
3620 pmap_kextract(vm_offset_t va)
3625 if (va >= DMAP_MIN_ADDRESS && va < DMAP_MAX_ADDRESS) {
3626 pa = DMAP_TO_PHYS(va);
3627 } else if (PMAP_ADDRESS_IN_LARGEMAP(va)) {
3628 pa = pmap_large_map_kextract(va);
3632 pa = (pde & PG_PS_FRAME) | (va & PDRMASK);
3635 * Beware of a concurrent promotion that changes the
3636 * PDE at this point! For example, vtopte() must not
3637 * be used to access the PTE because it would use the
3638 * new PDE. It is, however, safe to use the old PDE
3639 * because the page table page is preserved by the
3642 pa = *pmap_pde_to_pte(&pde, va);
3643 pa = (pa & PG_FRAME) | (va & PAGE_MASK);
3649 /***************************************************
3650 * Low level mapping routines.....
3651 ***************************************************/
3654 * Add a wired page to the kva.
3655 * Note: not SMP coherent.
3658 pmap_kenter(vm_offset_t va, vm_paddr_t pa)
3663 pte_store(pte, pa | X86_PG_RW | X86_PG_V | pg_g | pg_nx);
3666 static __inline void
3667 pmap_kenter_attr(vm_offset_t va, vm_paddr_t pa, int mode)
3673 cache_bits = pmap_cache_bits(kernel_pmap, mode, 0);
3674 pte_store(pte, pa | X86_PG_RW | X86_PG_V | pg_g | pg_nx | cache_bits);
3678 * Remove a page from the kernel pagetables.
3679 * Note: not SMP coherent.
3682 pmap_kremove(vm_offset_t va)
3691 * Used to map a range of physical addresses into kernel
3692 * virtual address space.
3694 * The value passed in '*virt' is a suggested virtual address for
3695 * the mapping. Architectures which can support a direct-mapped
3696 * physical to virtual region can return the appropriate address
3697 * within that region, leaving '*virt' unchanged. Other
3698 * architectures should map the pages starting at '*virt' and
3699 * update '*virt' with the first usable address after the mapped
3703 pmap_map(vm_offset_t *virt, vm_paddr_t start, vm_paddr_t end, int prot)
3705 return PHYS_TO_DMAP(start);
3709 * Add a list of wired pages to the kva
3710 * this routine is only used for temporary
3711 * kernel mappings that do not need to have
3712 * page modification or references recorded.
3713 * Note that old mappings are simply written
3714 * over. The page *must* be wired.
3715 * Note: SMP coherent. Uses a ranged shootdown IPI.
3718 pmap_qenter(vm_offset_t sva, vm_page_t *ma, int count)
3720 pt_entry_t *endpte, oldpte, pa, *pte;
3726 endpte = pte + count;
3727 while (pte < endpte) {
3729 cache_bits = pmap_cache_bits(kernel_pmap, m->md.pat_mode, 0);
3730 pa = VM_PAGE_TO_PHYS(m) | cache_bits;
3731 if ((*pte & (PG_FRAME | X86_PG_PTE_CACHE)) != pa) {
3733 pte_store(pte, pa | pg_g | pg_nx | X86_PG_RW | X86_PG_V);
3737 if (__predict_false((oldpte & X86_PG_V) != 0))
3738 pmap_invalidate_range(kernel_pmap, sva, sva + count *
3743 * This routine tears out page mappings from the
3744 * kernel -- it is meant only for temporary mappings.
3745 * Note: SMP coherent. Uses a ranged shootdown IPI.
3748 pmap_qremove(vm_offset_t sva, int count)
3753 while (count-- > 0) {
3754 KASSERT(va >= VM_MIN_KERNEL_ADDRESS, ("usermode va %lx", va));
3758 pmap_invalidate_range(kernel_pmap, sva, va);
3761 /***************************************************
3762 * Page table page management routines.....
3763 ***************************************************/
3765 * Schedule the specified unused page table page to be freed. Specifically,
3766 * add the page to the specified list of pages that will be released to the
3767 * physical memory manager after the TLB has been updated.
3769 static __inline void
3770 pmap_add_delayed_free_list(vm_page_t m, struct spglist *free,
3771 boolean_t set_PG_ZERO)
3775 m->flags |= PG_ZERO;
3777 m->flags &= ~PG_ZERO;
3778 SLIST_INSERT_HEAD(free, m, plinks.s.ss);
3782 * Inserts the specified page table page into the specified pmap's collection
3783 * of idle page table pages. Each of a pmap's page table pages is responsible
3784 * for mapping a distinct range of virtual addresses. The pmap's collection is
3785 * ordered by this virtual address range.
3787 * If "promoted" is false, then the page table page "mpte" must be zero filled.
3790 pmap_insert_pt_page(pmap_t pmap, vm_page_t mpte, bool promoted)
3793 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
3794 mpte->valid = promoted ? VM_PAGE_BITS_ALL : 0;
3795 return (vm_radix_insert(&pmap->pm_root, mpte));
3799 * Removes the page table page mapping the specified virtual address from the
3800 * specified pmap's collection of idle page table pages, and returns it.
3801 * Otherwise, returns NULL if there is no page table page corresponding to the
3802 * specified virtual address.
3804 static __inline vm_page_t
3805 pmap_remove_pt_page(pmap_t pmap, vm_offset_t va)
3808 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
3809 return (vm_radix_remove(&pmap->pm_root, pmap_pde_pindex(va)));
3813 * Decrements a page table page's reference count, which is used to record the
3814 * number of valid page table entries within the page. If the reference count
3815 * drops to zero, then the page table page is unmapped. Returns TRUE if the
3816 * page table page was unmapped and FALSE otherwise.
3818 static inline boolean_t
3819 pmap_unwire_ptp(pmap_t pmap, vm_offset_t va, vm_page_t m, struct spglist *free)
3823 if (m->ref_count == 0) {
3824 _pmap_unwire_ptp(pmap, va, m, free);
3831 _pmap_unwire_ptp(pmap_t pmap, vm_offset_t va, vm_page_t m, struct spglist *free)
3837 vm_page_t pdpg, pdppg, pml4pg;
3839 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
3842 * unmap the page table page
3844 if (m->pindex >= NUPDE + NUPDPE + NUPML4E) {
3846 MPASS(pmap_is_la57(pmap));
3847 pml5 = pmap_pml5e(pmap, va);
3849 if (pmap->pm_pmltopu != NULL && va <= VM_MAXUSER_ADDRESS) {
3850 pml5 = pmap_pml5e_u(pmap, va);
3853 } else if (m->pindex >= NUPDE + NUPDPE) {
3855 pml4 = pmap_pml4e(pmap, va);
3857 if (!pmap_is_la57(pmap) && pmap->pm_pmltopu != NULL &&
3858 va <= VM_MAXUSER_ADDRESS) {
3859 pml4 = pmap_pml4e_u(pmap, va);
3862 } else if (m->pindex >= NUPDE) {
3864 pdp = pmap_pdpe(pmap, va);
3868 pd = pmap_pde(pmap, va);
3871 pmap_resident_count_dec(pmap, 1);
3872 if (m->pindex < NUPDE) {
3873 /* We just released a PT, unhold the matching PD */
3874 pdpg = PHYS_TO_VM_PAGE(*pmap_pdpe(pmap, va) & PG_FRAME);
3875 pmap_unwire_ptp(pmap, va, pdpg, free);
3876 } else if (m->pindex < NUPDE + NUPDPE) {
3877 /* We just released a PD, unhold the matching PDP */
3878 pdppg = PHYS_TO_VM_PAGE(*pmap_pml4e(pmap, va) & PG_FRAME);
3879 pmap_unwire_ptp(pmap, va, pdppg, free);
3880 } else if (m->pindex < NUPDE + NUPDPE + NUPML4E && pmap_is_la57(pmap)) {
3881 /* We just released a PDP, unhold the matching PML4 */
3882 pml4pg = PHYS_TO_VM_PAGE(*pmap_pml5e(pmap, va) & PG_FRAME);
3883 pmap_unwire_ptp(pmap, va, pml4pg, free);
3887 * Put page on a list so that it is released after
3888 * *ALL* TLB shootdown is done
3890 pmap_add_delayed_free_list(m, free, TRUE);
3894 * After removing a page table entry, this routine is used to
3895 * conditionally free the page, and manage the reference count.
3898 pmap_unuse_pt(pmap_t pmap, vm_offset_t va, pd_entry_t ptepde,
3899 struct spglist *free)
3903 if (va >= VM_MAXUSER_ADDRESS)
3905 KASSERT(ptepde != 0, ("pmap_unuse_pt: ptepde != 0"));
3906 mpte = PHYS_TO_VM_PAGE(ptepde & PG_FRAME);
3907 return (pmap_unwire_ptp(pmap, va, mpte, free));
3911 * Release a page table page reference after a failed attempt to create a
3915 pmap_abort_ptp(pmap_t pmap, vm_offset_t va, vm_page_t mpte)
3917 struct spglist free;
3920 if (pmap_unwire_ptp(pmap, va, mpte, &free)) {
3922 * Although "va" was never mapped, paging-structure caches
3923 * could nonetheless have entries that refer to the freed
3924 * page table pages. Invalidate those entries.
3926 pmap_invalidate_page(pmap, va);
3927 vm_page_free_pages_toq(&free, true);
3932 pmap_pinit0(pmap_t pmap)
3938 PMAP_LOCK_INIT(pmap);
3939 pmap->pm_pmltop = kernel_pmap->pm_pmltop;
3940 pmap->pm_pmltopu = NULL;
3941 pmap->pm_cr3 = kernel_pmap->pm_cr3;
3942 /* hack to keep pmap_pti_pcid_invalidate() alive */
3943 pmap->pm_ucr3 = PMAP_NO_CR3;
3944 pmap->pm_root.rt_root = 0;
3945 CPU_ZERO(&pmap->pm_active);
3946 TAILQ_INIT(&pmap->pm_pvchunk);
3947 bzero(&pmap->pm_stats, sizeof pmap->pm_stats);
3948 pmap->pm_flags = pmap_flags;
3950 pmap->pm_pcids[i].pm_pcid = PMAP_PCID_KERN + 1;
3951 pmap->pm_pcids[i].pm_gen = 1;
3953 pmap_activate_boot(pmap);
3958 p->p_md.md_flags |= P_MD_KPTI;
3961 pmap_thread_init_invl_gen(td);
3963 if ((cpu_stdext_feature2 & CPUID_STDEXT2_PKU) != 0) {
3964 pmap_pkru_ranges_zone = uma_zcreate("pkru ranges",
3965 sizeof(struct pmap_pkru_range), NULL, NULL, NULL, NULL,
3971 pmap_pinit_pml4(vm_page_t pml4pg)
3973 pml4_entry_t *pm_pml4;
3976 pm_pml4 = (pml4_entry_t *)PHYS_TO_DMAP(VM_PAGE_TO_PHYS(pml4pg));
3978 /* Wire in kernel global address entries. */
3979 for (i = 0; i < NKPML4E; i++) {
3980 pm_pml4[KPML4BASE + i] = (KPDPphys + ptoa(i)) | X86_PG_RW |
3983 for (i = 0; i < ndmpdpphys; i++) {
3984 pm_pml4[DMPML4I + i] = (DMPDPphys + ptoa(i)) | X86_PG_RW |
3988 /* install self-referential address mapping entry(s) */
3989 pm_pml4[PML4PML4I] = VM_PAGE_TO_PHYS(pml4pg) | X86_PG_V | X86_PG_RW |
3990 X86_PG_A | X86_PG_M;
3992 /* install large map entries if configured */
3993 for (i = 0; i < lm_ents; i++)
3994 pm_pml4[LMSPML4I + i] = kernel_pmap->pm_pmltop[LMSPML4I + i];
3998 pmap_pinit_pml5(vm_page_t pml5pg)
4000 pml5_entry_t *pm_pml5;
4002 pm_pml5 = (pml5_entry_t *)PHYS_TO_DMAP(VM_PAGE_TO_PHYS(pml5pg));
4005 * Add pml5 entry at top of KVA pointing to existing pml4 table,
4006 * entering all existing kernel mappings into level 5 table.
4008 pm_pml5[pmap_pml5e_index(UPT_MAX_ADDRESS)] = KPML4phys | X86_PG_V |
4009 X86_PG_RW | X86_PG_A | X86_PG_M | pg_g |
4010 pmap_cache_bits(kernel_pmap, VM_MEMATTR_DEFAULT, FALSE);
4013 * Install self-referential address mapping entry.
4015 pm_pml5[PML5PML5I] = VM_PAGE_TO_PHYS(pml5pg) |
4016 X86_PG_RW | X86_PG_V | X86_PG_M | X86_PG_A |
4017 pmap_cache_bits(kernel_pmap, VM_MEMATTR_DEFAULT, FALSE);
4021 pmap_pinit_pml4_pti(vm_page_t pml4pgu)
4023 pml4_entry_t *pm_pml4u;
4026 pm_pml4u = (pml4_entry_t *)PHYS_TO_DMAP(VM_PAGE_TO_PHYS(pml4pgu));
4027 for (i = 0; i < NPML4EPG; i++)
4028 pm_pml4u[i] = pti_pml4[i];
4032 pmap_pinit_pml5_pti(vm_page_t pml5pgu)
4034 pml5_entry_t *pm_pml5u;
4036 pm_pml5u = (pml5_entry_t *)PHYS_TO_DMAP(VM_PAGE_TO_PHYS(pml5pgu));
4039 * Add pml5 entry at top of KVA pointing to existing pml4 pti
4040 * table, entering all kernel mappings needed for usermode
4041 * into level 5 table.
4043 pm_pml5u[pmap_pml5e_index(UPT_MAX_ADDRESS)] =
4044 pmap_kextract((vm_offset_t)pti_pml4) |
4045 X86_PG_V | X86_PG_RW | X86_PG_A | X86_PG_M | pg_g |
4046 pmap_cache_bits(kernel_pmap, VM_MEMATTR_DEFAULT, FALSE);
4050 * Initialize a preallocated and zeroed pmap structure,
4051 * such as one in a vmspace structure.
4054 pmap_pinit_type(pmap_t pmap, enum pmap_type pm_type, int flags)
4056 vm_page_t pmltop_pg, pmltop_pgu;
4057 vm_paddr_t pmltop_phys;
4061 * allocate the page directory page
4063 pmltop_pg = vm_page_alloc(NULL, 0, VM_ALLOC_NORMAL | VM_ALLOC_NOOBJ |
4064 VM_ALLOC_WIRED | VM_ALLOC_ZERO | VM_ALLOC_WAITOK);
4066 pmltop_phys = VM_PAGE_TO_PHYS(pmltop_pg);
4067 pmap->pm_pmltop = (pml5_entry_t *)PHYS_TO_DMAP(pmltop_phys);
4070 pmap->pm_pcids[i].pm_pcid = PMAP_PCID_NONE;
4071 pmap->pm_pcids[i].pm_gen = 0;
4073 pmap->pm_cr3 = PMAP_NO_CR3; /* initialize to an invalid value */
4074 pmap->pm_ucr3 = PMAP_NO_CR3;
4075 pmap->pm_pmltopu = NULL;
4077 pmap->pm_type = pm_type;
4078 if ((pmltop_pg->flags & PG_ZERO) == 0)
4079 pagezero(pmap->pm_pmltop);
4082 * Do not install the host kernel mappings in the nested page
4083 * tables. These mappings are meaningless in the guest physical
4085 * Install minimal kernel mappings in PTI case.
4087 if (pm_type == PT_X86) {
4088 pmap->pm_cr3 = pmltop_phys;
4089 if (pmap_is_la57(pmap))
4090 pmap_pinit_pml5(pmltop_pg);
4092 pmap_pinit_pml4(pmltop_pg);
4093 if ((curproc->p_md.md_flags & P_MD_KPTI) != 0) {
4094 pmltop_pgu = vm_page_alloc(NULL, 0, VM_ALLOC_NORMAL |
4095 VM_ALLOC_NOOBJ | VM_ALLOC_WIRED | VM_ALLOC_WAITOK);
4096 pmap->pm_pmltopu = (pml4_entry_t *)PHYS_TO_DMAP(
4097 VM_PAGE_TO_PHYS(pmltop_pgu));
4098 if (pmap_is_la57(pmap))
4099 pmap_pinit_pml5_pti(pmltop_pgu);
4101 pmap_pinit_pml4_pti(pmltop_pgu);
4102 pmap->pm_ucr3 = VM_PAGE_TO_PHYS(pmltop_pgu);
4104 if ((cpu_stdext_feature2 & CPUID_STDEXT2_PKU) != 0) {
4105 rangeset_init(&pmap->pm_pkru, pkru_dup_range,
4106 pkru_free_range, pmap, M_NOWAIT);
4110 pmap->pm_root.rt_root = 0;
4111 CPU_ZERO(&pmap->pm_active);
4112 TAILQ_INIT(&pmap->pm_pvchunk);
4113 bzero(&pmap->pm_stats, sizeof pmap->pm_stats);
4114 pmap->pm_flags = flags;
4115 pmap->pm_eptgen = 0;
4121 pmap_pinit(pmap_t pmap)
4124 return (pmap_pinit_type(pmap, PT_X86, pmap_flags));
4128 pmap_allocpte_free_unref(pmap_t pmap, vm_offset_t va, pt_entry_t *pte)
4131 struct spglist free;
4133 mpg = PHYS_TO_VM_PAGE(*pte & PG_FRAME);
4134 if (mpg->ref_count != 0)
4137 _pmap_unwire_ptp(pmap, va, mpg, &free);
4138 pmap_invalidate_page(pmap, va);
4139 vm_page_free_pages_toq(&free, true);
4142 static pml4_entry_t *
4143 pmap_allocpte_getpml4(pmap_t pmap, struct rwlock **lockp, vm_offset_t va,
4146 vm_pindex_t pml5index;
4153 if (!pmap_is_la57(pmap))
4154 return (&pmap->pm_pmltop[pmap_pml4e_index(va)]);
4156 PG_V = pmap_valid_bit(pmap);
4157 pml5index = pmap_pml5e_index(va);
4158 pml5 = &pmap->pm_pmltop[pml5index];
4159 if ((*pml5 & PG_V) == 0) {
4160 if (_pmap_allocpte(pmap, pmap_pml5e_pindex(va), lockp, va) ==
4167 pml4 = (pml4_entry_t *)PHYS_TO_DMAP(*pml5 & PG_FRAME);
4168 pml4 = &pml4[pmap_pml4e_index(va)];
4169 if ((*pml4 & PG_V) == 0) {
4170 pml4pg = PHYS_TO_VM_PAGE(*pml5 & PG_FRAME);
4171 if (allocated && !addref)
4172 pml4pg->ref_count--;
4173 else if (!allocated && addref)
4174 pml4pg->ref_count++;
4179 static pdp_entry_t *
4180 pmap_allocpte_getpdp(pmap_t pmap, struct rwlock **lockp, vm_offset_t va,
4189 PG_V = pmap_valid_bit(pmap);
4191 pml4 = pmap_allocpte_getpml4(pmap, lockp, va, false);
4195 if ((*pml4 & PG_V) == 0) {
4196 /* Have to allocate a new pdp, recurse */
4197 if (_pmap_allocpte(pmap, pmap_pml4e_pindex(va), lockp, va) ==
4199 if (pmap_is_la57(pmap))
4200 pmap_allocpte_free_unref(pmap, va,
4201 pmap_pml5e(pmap, va));
4208 pdp = (pdp_entry_t *)PHYS_TO_DMAP(*pml4 & PG_FRAME);
4209 pdp = &pdp[pmap_pdpe_index(va)];
4210 if ((*pdp & PG_V) == 0) {
4211 pdppg = PHYS_TO_VM_PAGE(*pml4 & PG_FRAME);
4212 if (allocated && !addref)
4214 else if (!allocated && addref)
4221 * This routine is called if the desired page table page does not exist.
4223 * If page table page allocation fails, this routine may sleep before
4224 * returning NULL. It sleeps only if a lock pointer was given.
4226 * Note: If a page allocation fails at page table level two, three, or four,
4227 * up to three pages may be held during the wait, only to be released
4228 * afterwards. This conservative approach is easily argued to avoid
4231 * The ptepindexes, i.e. page indices, of the page table pages encountered
4232 * while translating virtual address va are defined as follows:
4233 * - for the page table page (last level),
4234 * ptepindex = pmap_pde_pindex(va) = va >> PDRSHIFT,
4235 * in other words, it is just the index of the PDE that maps the page
4237 * - for the page directory page,
4238 * ptepindex = NUPDE (number of userland PD entries) +
4239 * (pmap_pde_index(va) >> NPDEPGSHIFT)
4240 * i.e. index of PDPE is put after the last index of PDE,
4241 * - for the page directory pointer page,
4242 * ptepindex = NUPDE + NUPDPE + (pmap_pde_index(va) >> (NPDEPGSHIFT +
4244 * i.e. index of pml4e is put after the last index of PDPE,
4245 * - for the PML4 page (if LA57 mode is enabled),
4246 * ptepindex = NUPDE + NUPDPE + NUPML4E + (pmap_pde_index(va) >>
4247 * (NPDEPGSHIFT + NPML4EPGSHIFT + NPML5EPGSHIFT),
4248 * i.e. index of pml5e is put after the last index of PML4E.
4250 * Define an order on the paging entries, where all entries of the
4251 * same height are put together, then heights are put from deepest to
4252 * root. Then ptexpindex is the sequential number of the
4253 * corresponding paging entry in this order.
4255 * The values of NUPDE, NUPDPE, and NUPML4E are determined by the size of
4256 * LA57 paging structures even in LA48 paging mode. Moreover, the
4257 * ptepindexes are calculated as if the paging structures were 5-level
4258 * regardless of the actual mode of operation.
4260 * The root page at PML4/PML5 does not participate in this indexing scheme,
4261 * since it is statically allocated by pmap_pinit() and not by _pmap_allocpte().
4264 _pmap_allocpte(pmap_t pmap, vm_pindex_t ptepindex, struct rwlock **lockp,
4265 vm_offset_t va __unused)
4267 vm_pindex_t pml5index, pml4index;
4268 pml5_entry_t *pml5, *pml5u;
4269 pml4_entry_t *pml4, *pml4u;
4273 pt_entry_t PG_A, PG_M, PG_RW, PG_V;
4275 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
4277 PG_A = pmap_accessed_bit(pmap);
4278 PG_M = pmap_modified_bit(pmap);
4279 PG_V = pmap_valid_bit(pmap);
4280 PG_RW = pmap_rw_bit(pmap);
4283 * Allocate a page table page.
4285 if ((m = vm_page_alloc(NULL, ptepindex, VM_ALLOC_NOOBJ |
4286 VM_ALLOC_WIRED | VM_ALLOC_ZERO)) == NULL) {
4287 if (lockp != NULL) {
4288 RELEASE_PV_LIST_LOCK(lockp);
4290 PMAP_ASSERT_NOT_IN_DI();
4296 * Indicate the need to retry. While waiting, the page table
4297 * page may have been allocated.
4301 if ((m->flags & PG_ZERO) == 0)
4305 * Map the pagetable page into the process address space, if
4306 * it isn't already there.
4308 if (ptepindex >= NUPDE + NUPDPE + NUPML4E) {
4309 MPASS(pmap_is_la57(pmap));
4311 pml5index = pmap_pml5e_index(va);
4312 pml5 = &pmap->pm_pmltop[pml5index];
4313 KASSERT((*pml5 & PG_V) == 0,
4314 ("pmap %p va %#lx pml5 %#lx", pmap, va, *pml5));
4315 *pml5 = VM_PAGE_TO_PHYS(m) | PG_U | PG_RW | PG_V | PG_A | PG_M;
4317 if (pmap->pm_pmltopu != NULL && pml5index < NUPML5E) {
4318 if (pmap->pm_ucr3 != PMAP_NO_CR3)
4321 pml5u = &pmap->pm_pmltopu[pml5index];
4322 *pml5u = VM_PAGE_TO_PHYS(m) | PG_U | PG_RW | PG_V |
4325 } else if (ptepindex >= NUPDE + NUPDPE) {
4326 pml4index = pmap_pml4e_index(va);
4327 /* Wire up a new PDPE page */
4328 pml4 = pmap_allocpte_getpml4(pmap, lockp, va, true);
4330 vm_page_unwire_noq(m);
4331 vm_page_free_zero(m);
4334 KASSERT((*pml4 & PG_V) == 0,
4335 ("pmap %p va %#lx pml4 %#lx", pmap, va, *pml4));
4336 *pml4 = VM_PAGE_TO_PHYS(m) | PG_U | PG_RW | PG_V | PG_A | PG_M;
4338 if (!pmap_is_la57(pmap) && pmap->pm_pmltopu != NULL &&
4339 pml4index < NUPML4E) {
4341 * PTI: Make all user-space mappings in the
4342 * kernel-mode page table no-execute so that
4343 * we detect any programming errors that leave
4344 * the kernel-mode page table active on return
4347 if (pmap->pm_ucr3 != PMAP_NO_CR3)
4350 pml4u = &pmap->pm_pmltopu[pml4index];
4351 *pml4u = VM_PAGE_TO_PHYS(m) | PG_U | PG_RW | PG_V |
4354 } else if (ptepindex >= NUPDE) {
4355 /* Wire up a new PDE page */
4356 pdp = pmap_allocpte_getpdp(pmap, lockp, va, true);
4358 vm_page_unwire_noq(m);
4359 vm_page_free_zero(m);
4362 KASSERT((*pdp & PG_V) == 0,
4363 ("pmap %p va %#lx pdp %#lx", pmap, va, *pdp));
4364 *pdp = VM_PAGE_TO_PHYS(m) | PG_U | PG_RW | PG_V | PG_A | PG_M;
4366 /* Wire up a new PTE page */
4367 pdp = pmap_allocpte_getpdp(pmap, lockp, va, false);
4369 vm_page_unwire_noq(m);
4370 vm_page_free_zero(m);
4373 if ((*pdp & PG_V) == 0) {
4374 /* Have to allocate a new pd, recurse */
4375 if (_pmap_allocpte(pmap, pmap_pdpe_pindex(va),
4376 lockp, va) == NULL) {
4377 pmap_allocpte_free_unref(pmap, va,
4378 pmap_pml4e(pmap, va));
4379 vm_page_unwire_noq(m);
4380 vm_page_free_zero(m);
4384 /* Add reference to the pd page */
4385 pdpg = PHYS_TO_VM_PAGE(*pdp & PG_FRAME);
4388 pd = (pd_entry_t *)PHYS_TO_DMAP(*pdp & PG_FRAME);
4390 /* Now we know where the page directory page is */
4391 pd = &pd[pmap_pde_index(va)];
4392 KASSERT((*pd & PG_V) == 0,
4393 ("pmap %p va %#lx pd %#lx", pmap, va, *pd));
4394 *pd = VM_PAGE_TO_PHYS(m) | PG_U | PG_RW | PG_V | PG_A | PG_M;
4397 pmap_resident_count_inc(pmap, 1);
4403 pmap_alloc_pde(pmap_t pmap, vm_offset_t va, vm_page_t *pdpgp,
4404 struct rwlock **lockp)
4406 pdp_entry_t *pdpe, PG_V;
4409 vm_pindex_t pdpindex;
4411 PG_V = pmap_valid_bit(pmap);
4414 pdpe = pmap_pdpe(pmap, va);
4415 if (pdpe != NULL && (*pdpe & PG_V) != 0) {
4416 pde = pmap_pdpe_to_pde(pdpe, va);
4417 if (va < VM_MAXUSER_ADDRESS) {
4418 /* Add a reference to the pd page. */
4419 pdpg = PHYS_TO_VM_PAGE(*pdpe & PG_FRAME);
4423 } else if (va < VM_MAXUSER_ADDRESS) {
4424 /* Allocate a pd page. */
4425 pdpindex = pmap_pde_pindex(va) >> NPDPEPGSHIFT;
4426 pdpg = _pmap_allocpte(pmap, NUPDE + pdpindex, lockp, va);
4433 pde = (pd_entry_t *)PHYS_TO_DMAP(VM_PAGE_TO_PHYS(pdpg));
4434 pde = &pde[pmap_pde_index(va)];
4436 panic("pmap_alloc_pde: missing page table page for va %#lx",
4443 pmap_allocpte(pmap_t pmap, vm_offset_t va, struct rwlock **lockp)
4445 vm_pindex_t ptepindex;
4446 pd_entry_t *pd, PG_V;
4449 PG_V = pmap_valid_bit(pmap);
4452 * Calculate pagetable page index
4454 ptepindex = pmap_pde_pindex(va);
4457 * Get the page directory entry
4459 pd = pmap_pde(pmap, va);
4462 * This supports switching from a 2MB page to a
4465 if (pd != NULL && (*pd & (PG_PS | PG_V)) == (PG_PS | PG_V)) {
4466 if (!pmap_demote_pde_locked(pmap, pd, va, lockp)) {
4468 * Invalidation of the 2MB page mapping may have caused
4469 * the deallocation of the underlying PD page.
4476 * If the page table page is mapped, we just increment the
4477 * hold count, and activate it.
4479 if (pd != NULL && (*pd & PG_V) != 0) {
4480 m = PHYS_TO_VM_PAGE(*pd & PG_FRAME);
4484 * Here if the pte page isn't mapped, or if it has been
4487 m = _pmap_allocpte(pmap, ptepindex, lockp, va);
4488 if (m == NULL && lockp != NULL)
4494 /***************************************************
4495 * Pmap allocation/deallocation routines.
4496 ***************************************************/
4499 * Release any resources held by the given physical map.
4500 * Called when a pmap initialized by pmap_pinit is being released.
4501 * Should only be called if the map contains no valid mappings.
4504 pmap_release(pmap_t pmap)
4509 KASSERT(pmap->pm_stats.resident_count == 0,
4510 ("pmap_release: pmap %p resident count %ld != 0",
4511 pmap, pmap->pm_stats.resident_count));
4512 KASSERT(vm_radix_is_empty(&pmap->pm_root),
4513 ("pmap_release: pmap %p has reserved page table page(s)",
4515 KASSERT(CPU_EMPTY(&pmap->pm_active),
4516 ("releasing active pmap %p", pmap));
4518 m = PHYS_TO_VM_PAGE(DMAP_TO_PHYS((vm_offset_t)pmap->pm_pmltop));
4520 if (pmap_is_la57(pmap)) {
4521 pmap->pm_pmltop[pmap_pml5e_index(UPT_MAX_ADDRESS)] = 0;
4522 pmap->pm_pmltop[PML5PML5I] = 0;
4524 for (i = 0; i < NKPML4E; i++) /* KVA */
4525 pmap->pm_pmltop[KPML4BASE + i] = 0;
4526 for (i = 0; i < ndmpdpphys; i++)/* Direct Map */
4527 pmap->pm_pmltop[DMPML4I + i] = 0;
4528 pmap->pm_pmltop[PML4PML4I] = 0; /* Recursive Mapping */
4529 for (i = 0; i < lm_ents; i++) /* Large Map */
4530 pmap->pm_pmltop[LMSPML4I + i] = 0;
4533 vm_page_unwire_noq(m);
4534 vm_page_free_zero(m);
4536 if (pmap->pm_pmltopu != NULL) {
4537 m = PHYS_TO_VM_PAGE(DMAP_TO_PHYS((vm_offset_t)pmap->
4539 vm_page_unwire_noq(m);
4542 if (pmap->pm_type == PT_X86 &&
4543 (cpu_stdext_feature2 & CPUID_STDEXT2_PKU) != 0)
4544 rangeset_fini(&pmap->pm_pkru);
4548 kvm_size(SYSCTL_HANDLER_ARGS)
4550 unsigned long ksize = VM_MAX_KERNEL_ADDRESS - VM_MIN_KERNEL_ADDRESS;
4552 return sysctl_handle_long(oidp, &ksize, 0, req);
4554 SYSCTL_PROC(_vm, OID_AUTO, kvm_size, CTLTYPE_LONG | CTLFLAG_RD | CTLFLAG_MPSAFE,
4555 0, 0, kvm_size, "LU",
4559 kvm_free(SYSCTL_HANDLER_ARGS)
4561 unsigned long kfree = VM_MAX_KERNEL_ADDRESS - kernel_vm_end;
4563 return sysctl_handle_long(oidp, &kfree, 0, req);
4565 SYSCTL_PROC(_vm, OID_AUTO, kvm_free, CTLTYPE_LONG | CTLFLAG_RD | CTLFLAG_MPSAFE,
4566 0, 0, kvm_free, "LU",
4567 "Amount of KVM free");
4570 * Allocate physical memory for the vm_page array and map it into KVA,
4571 * attempting to back the vm_pages with domain-local memory.
4574 pmap_page_array_startup(long pages)
4577 pd_entry_t *pde, newpdir;
4578 vm_offset_t va, start, end;
4583 vm_page_array_size = pages;
4585 start = VM_MIN_KERNEL_ADDRESS;
4586 end = start + pages * sizeof(struct vm_page);
4587 for (va = start; va < end; va += NBPDR) {
4588 pfn = first_page + (va - start) / sizeof(struct vm_page);
4589 domain = _vm_phys_domain(ptoa(pfn));
4590 pdpe = pmap_pdpe(kernel_pmap, va);
4591 if ((*pdpe & X86_PG_V) == 0) {
4592 pa = vm_phys_early_alloc(domain, PAGE_SIZE);
4594 pagezero((void *)PHYS_TO_DMAP(pa));
4595 *pdpe = (pdp_entry_t)(pa | X86_PG_V | X86_PG_RW |
4596 X86_PG_A | X86_PG_M);
4598 pde = pmap_pdpe_to_pde(pdpe, va);
4599 if ((*pde & X86_PG_V) != 0)
4600 panic("Unexpected pde");
4601 pa = vm_phys_early_alloc(domain, NBPDR);
4602 for (i = 0; i < NPDEPG; i++)
4603 dump_add_page(pa + i * PAGE_SIZE);
4604 newpdir = (pd_entry_t)(pa | X86_PG_V | X86_PG_RW | X86_PG_A |
4605 X86_PG_M | PG_PS | pg_g | pg_nx);
4606 pde_store(pde, newpdir);
4608 vm_page_array = (vm_page_t)start;
4612 * grow the number of kernel page table entries, if needed
4615 pmap_growkernel(vm_offset_t addr)
4619 pd_entry_t *pde, newpdir;
4622 mtx_assert(&kernel_map->system_mtx, MA_OWNED);
4625 * Return if "addr" is within the range of kernel page table pages
4626 * that were preallocated during pmap bootstrap. Moreover, leave
4627 * "kernel_vm_end" and the kernel page table as they were.
4629 * The correctness of this action is based on the following
4630 * argument: vm_map_insert() allocates contiguous ranges of the
4631 * kernel virtual address space. It calls this function if a range
4632 * ends after "kernel_vm_end". If the kernel is mapped between
4633 * "kernel_vm_end" and "addr", then the range cannot begin at
4634 * "kernel_vm_end". In fact, its beginning address cannot be less
4635 * than the kernel. Thus, there is no immediate need to allocate
4636 * any new kernel page table pages between "kernel_vm_end" and
4639 if (KERNBASE < addr && addr <= KERNBASE + nkpt * NBPDR)
4642 addr = roundup2(addr, NBPDR);
4643 if (addr - 1 >= vm_map_max(kernel_map))
4644 addr = vm_map_max(kernel_map);
4645 while (kernel_vm_end < addr) {
4646 pdpe = pmap_pdpe(kernel_pmap, kernel_vm_end);
4647 if ((*pdpe & X86_PG_V) == 0) {
4648 /* We need a new PDP entry */
4649 nkpg = vm_page_alloc(NULL, kernel_vm_end >> PDPSHIFT,
4650 VM_ALLOC_INTERRUPT | VM_ALLOC_NOOBJ |
4651 VM_ALLOC_WIRED | VM_ALLOC_ZERO);
4653 panic("pmap_growkernel: no memory to grow kernel");
4654 if ((nkpg->flags & PG_ZERO) == 0)
4655 pmap_zero_page(nkpg);
4656 paddr = VM_PAGE_TO_PHYS(nkpg);
4657 *pdpe = (pdp_entry_t)(paddr | X86_PG_V | X86_PG_RW |
4658 X86_PG_A | X86_PG_M);
4659 continue; /* try again */
4661 pde = pmap_pdpe_to_pde(pdpe, kernel_vm_end);
4662 if ((*pde & X86_PG_V) != 0) {
4663 kernel_vm_end = (kernel_vm_end + NBPDR) & ~PDRMASK;
4664 if (kernel_vm_end - 1 >= vm_map_max(kernel_map)) {
4665 kernel_vm_end = vm_map_max(kernel_map);
4671 nkpg = vm_page_alloc(NULL, pmap_pde_pindex(kernel_vm_end),
4672 VM_ALLOC_INTERRUPT | VM_ALLOC_NOOBJ | VM_ALLOC_WIRED |
4675 panic("pmap_growkernel: no memory to grow kernel");
4676 if ((nkpg->flags & PG_ZERO) == 0)
4677 pmap_zero_page(nkpg);
4678 paddr = VM_PAGE_TO_PHYS(nkpg);
4679 newpdir = paddr | X86_PG_V | X86_PG_RW | X86_PG_A | X86_PG_M;
4680 pde_store(pde, newpdir);
4682 kernel_vm_end = (kernel_vm_end + NBPDR) & ~PDRMASK;
4683 if (kernel_vm_end - 1 >= vm_map_max(kernel_map)) {
4684 kernel_vm_end = vm_map_max(kernel_map);
4690 /***************************************************
4691 * page management routines.
4692 ***************************************************/
4694 CTASSERT(sizeof(struct pv_chunk) == PAGE_SIZE);
4695 CTASSERT(_NPCM == 3);
4696 CTASSERT(_NPCPV == 168);
4698 static __inline struct pv_chunk *
4699 pv_to_chunk(pv_entry_t pv)
4702 return ((struct pv_chunk *)((uintptr_t)pv & ~(uintptr_t)PAGE_MASK));
4705 #define PV_PMAP(pv) (pv_to_chunk(pv)->pc_pmap)
4707 #define PC_FREE0 0xfffffffffffffffful
4708 #define PC_FREE1 0xfffffffffffffffful
4709 #define PC_FREE2 0x000000fffffffffful
4711 static const uint64_t pc_freemask[_NPCM] = { PC_FREE0, PC_FREE1, PC_FREE2 };
4714 static int pc_chunk_count, pc_chunk_allocs, pc_chunk_frees, pc_chunk_tryfail;
4716 SYSCTL_INT(_vm_pmap, OID_AUTO, pc_chunk_count, CTLFLAG_RD, &pc_chunk_count, 0,
4717 "Current number of pv entry chunks");
4718 SYSCTL_INT(_vm_pmap, OID_AUTO, pc_chunk_allocs, CTLFLAG_RD, &pc_chunk_allocs, 0,
4719 "Current number of pv entry chunks allocated");
4720 SYSCTL_INT(_vm_pmap, OID_AUTO, pc_chunk_frees, CTLFLAG_RD, &pc_chunk_frees, 0,
4721 "Current number of pv entry chunks frees");
4722 SYSCTL_INT(_vm_pmap, OID_AUTO, pc_chunk_tryfail, CTLFLAG_RD, &pc_chunk_tryfail, 0,
4723 "Number of times tried to get a chunk page but failed.");
4725 static long pv_entry_frees, pv_entry_allocs, pv_entry_count;
4726 static int pv_entry_spare;
4728 SYSCTL_LONG(_vm_pmap, OID_AUTO, pv_entry_frees, CTLFLAG_RD, &pv_entry_frees, 0,
4729 "Current number of pv entry frees");
4730 SYSCTL_LONG(_vm_pmap, OID_AUTO, pv_entry_allocs, CTLFLAG_RD, &pv_entry_allocs, 0,
4731 "Current number of pv entry allocs");
4732 SYSCTL_LONG(_vm_pmap, OID_AUTO, pv_entry_count, CTLFLAG_RD, &pv_entry_count, 0,
4733 "Current number of pv entries");
4734 SYSCTL_INT(_vm_pmap, OID_AUTO, pv_entry_spare, CTLFLAG_RD, &pv_entry_spare, 0,
4735 "Current number of spare pv entries");
4739 reclaim_pv_chunk_leave_pmap(pmap_t pmap, pmap_t locked_pmap, bool start_di)
4744 pmap_invalidate_all(pmap);
4745 if (pmap != locked_pmap)
4748 pmap_delayed_invl_finish();
4752 * We are in a serious low memory condition. Resort to
4753 * drastic measures to free some pages so we can allocate
4754 * another pv entry chunk.
4756 * Returns NULL if PV entries were reclaimed from the specified pmap.
4758 * We do not, however, unmap 2mpages because subsequent accesses will
4759 * allocate per-page pv entries until repromotion occurs, thereby
4760 * exacerbating the shortage of free pv entries.
4763 reclaim_pv_chunk_domain(pmap_t locked_pmap, struct rwlock **lockp, int domain)
4765 struct pv_chunks_list *pvc;
4766 struct pv_chunk *pc, *pc_marker, *pc_marker_end;
4767 struct pv_chunk_header pc_marker_b, pc_marker_end_b;
4768 struct md_page *pvh;
4770 pmap_t next_pmap, pmap;
4771 pt_entry_t *pte, tpte;
4772 pt_entry_t PG_G, PG_A, PG_M, PG_RW;
4776 struct spglist free;
4778 int bit, field, freed;
4779 bool start_di, restart;
4781 PMAP_LOCK_ASSERT(locked_pmap, MA_OWNED);
4782 KASSERT(lockp != NULL, ("reclaim_pv_chunk: lockp is NULL"));
4785 PG_G = PG_A = PG_M = PG_RW = 0;
4787 bzero(&pc_marker_b, sizeof(pc_marker_b));
4788 bzero(&pc_marker_end_b, sizeof(pc_marker_end_b));
4789 pc_marker = (struct pv_chunk *)&pc_marker_b;
4790 pc_marker_end = (struct pv_chunk *)&pc_marker_end_b;
4793 * A delayed invalidation block should already be active if
4794 * pmap_advise() or pmap_remove() called this function by way
4795 * of pmap_demote_pde_locked().
4797 start_di = pmap_not_in_di();
4799 pvc = &pv_chunks[domain];
4800 mtx_lock(&pvc->pvc_lock);
4801 pvc->active_reclaims++;
4802 TAILQ_INSERT_HEAD(&pvc->pvc_list, pc_marker, pc_lru);
4803 TAILQ_INSERT_TAIL(&pvc->pvc_list, pc_marker_end, pc_lru);
4804 while ((pc = TAILQ_NEXT(pc_marker, pc_lru)) != pc_marker_end &&
4805 SLIST_EMPTY(&free)) {
4806 next_pmap = pc->pc_pmap;
4807 if (next_pmap == NULL) {
4809 * The next chunk is a marker. However, it is
4810 * not our marker, so active_reclaims must be
4811 * > 1. Consequently, the next_chunk code
4812 * will not rotate the pv_chunks list.
4816 mtx_unlock(&pvc->pvc_lock);
4819 * A pv_chunk can only be removed from the pc_lru list
4820 * when both pc_chunks_mutex is owned and the
4821 * corresponding pmap is locked.
4823 if (pmap != next_pmap) {
4825 reclaim_pv_chunk_leave_pmap(pmap, locked_pmap,
4828 /* Avoid deadlock and lock recursion. */
4829 if (pmap > locked_pmap) {
4830 RELEASE_PV_LIST_LOCK(lockp);
4833 pmap_delayed_invl_start();
4834 mtx_lock(&pvc->pvc_lock);
4836 } else if (pmap != locked_pmap) {
4837 if (PMAP_TRYLOCK(pmap)) {
4839 pmap_delayed_invl_start();
4840 mtx_lock(&pvc->pvc_lock);
4843 pmap = NULL; /* pmap is not locked */
4844 mtx_lock(&pvc->pvc_lock);
4845 pc = TAILQ_NEXT(pc_marker, pc_lru);
4847 pc->pc_pmap != next_pmap)
4851 } else if (start_di)
4852 pmap_delayed_invl_start();
4853 PG_G = pmap_global_bit(pmap);
4854 PG_A = pmap_accessed_bit(pmap);
4855 PG_M = pmap_modified_bit(pmap);
4856 PG_RW = pmap_rw_bit(pmap);
4862 * Destroy every non-wired, 4 KB page mapping in the chunk.
4865 for (field = 0; field < _NPCM; field++) {
4866 for (inuse = ~pc->pc_map[field] & pc_freemask[field];
4867 inuse != 0; inuse &= ~(1UL << bit)) {
4869 pv = &pc->pc_pventry[field * 64 + bit];
4871 pde = pmap_pde(pmap, va);
4872 if ((*pde & PG_PS) != 0)
4874 pte = pmap_pde_to_pte(pde, va);
4875 if ((*pte & PG_W) != 0)
4877 tpte = pte_load_clear(pte);
4878 if ((tpte & PG_G) != 0)
4879 pmap_invalidate_page(pmap, va);
4880 m = PHYS_TO_VM_PAGE(tpte & PG_FRAME);
4881 if ((tpte & (PG_M | PG_RW)) == (PG_M | PG_RW))
4883 if ((tpte & PG_A) != 0)
4884 vm_page_aflag_set(m, PGA_REFERENCED);
4885 CHANGE_PV_LIST_LOCK_TO_VM_PAGE(lockp, m);
4886 TAILQ_REMOVE(&m->md.pv_list, pv, pv_next);
4888 if (TAILQ_EMPTY(&m->md.pv_list) &&
4889 (m->flags & PG_FICTITIOUS) == 0) {
4890 pvh = pa_to_pvh(VM_PAGE_TO_PHYS(m));
4891 if (TAILQ_EMPTY(&pvh->pv_list)) {
4892 vm_page_aflag_clear(m,
4896 pmap_delayed_invl_page(m);
4897 pc->pc_map[field] |= 1UL << bit;
4898 pmap_unuse_pt(pmap, va, *pde, &free);
4903 mtx_lock(&pvc->pvc_lock);
4906 /* Every freed mapping is for a 4 KB page. */
4907 pmap_resident_count_dec(pmap, freed);
4908 PV_STAT(atomic_add_long(&pv_entry_frees, freed));
4909 PV_STAT(atomic_add_int(&pv_entry_spare, freed));
4910 PV_STAT(atomic_subtract_long(&pv_entry_count, freed));
4911 TAILQ_REMOVE(&pmap->pm_pvchunk, pc, pc_list);
4912 if (pc->pc_map[0] == PC_FREE0 && pc->pc_map[1] == PC_FREE1 &&
4913 pc->pc_map[2] == PC_FREE2) {
4914 PV_STAT(atomic_subtract_int(&pv_entry_spare, _NPCPV));
4915 PV_STAT(atomic_subtract_int(&pc_chunk_count, 1));
4916 PV_STAT(atomic_add_int(&pc_chunk_frees, 1));
4917 /* Entire chunk is free; return it. */
4918 m_pc = PHYS_TO_VM_PAGE(DMAP_TO_PHYS((vm_offset_t)pc));
4919 dump_drop_page(m_pc->phys_addr);
4920 mtx_lock(&pvc->pvc_lock);
4921 TAILQ_REMOVE(&pvc->pvc_list, pc, pc_lru);
4924 TAILQ_INSERT_HEAD(&pmap->pm_pvchunk, pc, pc_list);
4925 mtx_lock(&pvc->pvc_lock);
4926 /* One freed pv entry in locked_pmap is sufficient. */
4927 if (pmap == locked_pmap)
4930 TAILQ_REMOVE(&pvc->pvc_list, pc_marker, pc_lru);
4931 TAILQ_INSERT_AFTER(&pvc->pvc_list, pc, pc_marker, pc_lru);
4932 if (pvc->active_reclaims == 1 && pmap != NULL) {
4934 * Rotate the pv chunks list so that we do not
4935 * scan the same pv chunks that could not be
4936 * freed (because they contained a wired
4937 * and/or superpage mapping) on every
4938 * invocation of reclaim_pv_chunk().
4940 while ((pc = TAILQ_FIRST(&pvc->pvc_list)) != pc_marker) {
4941 MPASS(pc->pc_pmap != NULL);
4942 TAILQ_REMOVE(&pvc->pvc_list, pc, pc_lru);
4943 TAILQ_INSERT_TAIL(&pvc->pvc_list, pc, pc_lru);
4947 TAILQ_REMOVE(&pvc->pvc_list, pc_marker, pc_lru);
4948 TAILQ_REMOVE(&pvc->pvc_list, pc_marker_end, pc_lru);
4949 pvc->active_reclaims--;
4950 mtx_unlock(&pvc->pvc_lock);
4951 reclaim_pv_chunk_leave_pmap(pmap, locked_pmap, start_di);
4952 if (m_pc == NULL && !SLIST_EMPTY(&free)) {
4953 m_pc = SLIST_FIRST(&free);
4954 SLIST_REMOVE_HEAD(&free, plinks.s.ss);
4955 /* Recycle a freed page table page. */
4956 m_pc->ref_count = 1;
4958 vm_page_free_pages_toq(&free, true);
4963 reclaim_pv_chunk(pmap_t locked_pmap, struct rwlock **lockp)
4968 domain = PCPU_GET(domain);
4969 for (i = 0; i < vm_ndomains; i++) {
4970 m = reclaim_pv_chunk_domain(locked_pmap, lockp, domain);
4973 domain = (domain + 1) % vm_ndomains;
4980 * free the pv_entry back to the free list
4983 free_pv_entry(pmap_t pmap, pv_entry_t pv)
4985 struct pv_chunk *pc;
4986 int idx, field, bit;
4988 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
4989 PV_STAT(atomic_add_long(&pv_entry_frees, 1));
4990 PV_STAT(atomic_add_int(&pv_entry_spare, 1));
4991 PV_STAT(atomic_subtract_long(&pv_entry_count, 1));
4992 pc = pv_to_chunk(pv);
4993 idx = pv - &pc->pc_pventry[0];
4996 pc->pc_map[field] |= 1ul << bit;
4997 if (pc->pc_map[0] != PC_FREE0 || pc->pc_map[1] != PC_FREE1 ||
4998 pc->pc_map[2] != PC_FREE2) {
4999 /* 98% of the time, pc is already at the head of the list. */
5000 if (__predict_false(pc != TAILQ_FIRST(&pmap->pm_pvchunk))) {
5001 TAILQ_REMOVE(&pmap->pm_pvchunk, pc, pc_list);
5002 TAILQ_INSERT_HEAD(&pmap->pm_pvchunk, pc, pc_list);
5006 TAILQ_REMOVE(&pmap->pm_pvchunk, pc, pc_list);
5011 free_pv_chunk_dequeued(struct pv_chunk *pc)
5015 PV_STAT(atomic_subtract_int(&pv_entry_spare, _NPCPV));
5016 PV_STAT(atomic_subtract_int(&pc_chunk_count, 1));
5017 PV_STAT(atomic_add_int(&pc_chunk_frees, 1));
5018 /* entire chunk is free, return it */
5019 m = PHYS_TO_VM_PAGE(DMAP_TO_PHYS((vm_offset_t)pc));
5020 dump_drop_page(m->phys_addr);
5021 vm_page_unwire_noq(m);
5026 free_pv_chunk(struct pv_chunk *pc)
5028 struct pv_chunks_list *pvc;
5030 pvc = &pv_chunks[pc_to_domain(pc)];
5031 mtx_lock(&pvc->pvc_lock);
5032 TAILQ_REMOVE(&pvc->pvc_list, pc, pc_lru);
5033 mtx_unlock(&pvc->pvc_lock);
5034 free_pv_chunk_dequeued(pc);
5038 free_pv_chunk_batch(struct pv_chunklist *batch)
5040 struct pv_chunks_list *pvc;
5041 struct pv_chunk *pc, *npc;
5044 for (i = 0; i < vm_ndomains; i++) {
5045 if (TAILQ_EMPTY(&batch[i]))
5047 pvc = &pv_chunks[i];
5048 mtx_lock(&pvc->pvc_lock);
5049 TAILQ_FOREACH(pc, &batch[i], pc_list) {
5050 TAILQ_REMOVE(&pvc->pvc_list, pc, pc_lru);
5052 mtx_unlock(&pvc->pvc_lock);
5055 for (i = 0; i < vm_ndomains; i++) {
5056 TAILQ_FOREACH_SAFE(pc, &batch[i], pc_list, npc) {
5057 free_pv_chunk_dequeued(pc);
5063 * Returns a new PV entry, allocating a new PV chunk from the system when
5064 * needed. If this PV chunk allocation fails and a PV list lock pointer was
5065 * given, a PV chunk is reclaimed from an arbitrary pmap. Otherwise, NULL is
5068 * The given PV list lock may be released.
5071 get_pv_entry(pmap_t pmap, struct rwlock **lockp)
5073 struct pv_chunks_list *pvc;
5076 struct pv_chunk *pc;
5079 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
5080 PV_STAT(atomic_add_long(&pv_entry_allocs, 1));
5082 pc = TAILQ_FIRST(&pmap->pm_pvchunk);
5084 for (field = 0; field < _NPCM; field++) {
5085 if (pc->pc_map[field]) {
5086 bit = bsfq(pc->pc_map[field]);
5090 if (field < _NPCM) {
5091 pv = &pc->pc_pventry[field * 64 + bit];
5092 pc->pc_map[field] &= ~(1ul << bit);
5093 /* If this was the last item, move it to tail */
5094 if (pc->pc_map[0] == 0 && pc->pc_map[1] == 0 &&
5095 pc->pc_map[2] == 0) {
5096 TAILQ_REMOVE(&pmap->pm_pvchunk, pc, pc_list);
5097 TAILQ_INSERT_TAIL(&pmap->pm_pvchunk, pc,
5100 PV_STAT(atomic_add_long(&pv_entry_count, 1));
5101 PV_STAT(atomic_subtract_int(&pv_entry_spare, 1));
5105 /* No free items, allocate another chunk */
5106 m = vm_page_alloc(NULL, 0, VM_ALLOC_NORMAL | VM_ALLOC_NOOBJ |
5109 if (lockp == NULL) {
5110 PV_STAT(pc_chunk_tryfail++);
5113 m = reclaim_pv_chunk(pmap, lockp);
5117 PV_STAT(atomic_add_int(&pc_chunk_count, 1));
5118 PV_STAT(atomic_add_int(&pc_chunk_allocs, 1));
5119 dump_add_page(m->phys_addr);
5120 pc = (void *)PHYS_TO_DMAP(m->phys_addr);
5122 pc->pc_map[0] = PC_FREE0 & ~1ul; /* preallocated bit 0 */
5123 pc->pc_map[1] = PC_FREE1;
5124 pc->pc_map[2] = PC_FREE2;
5125 pvc = &pv_chunks[_vm_phys_domain(m->phys_addr)];
5126 mtx_lock(&pvc->pvc_lock);
5127 TAILQ_INSERT_TAIL(&pvc->pvc_list, pc, pc_lru);
5128 mtx_unlock(&pvc->pvc_lock);
5129 pv = &pc->pc_pventry[0];
5130 TAILQ_INSERT_HEAD(&pmap->pm_pvchunk, pc, pc_list);
5131 PV_STAT(atomic_add_long(&pv_entry_count, 1));
5132 PV_STAT(atomic_add_int(&pv_entry_spare, _NPCPV - 1));
5137 * Returns the number of one bits within the given PV chunk map.
5139 * The erratas for Intel processors state that "POPCNT Instruction May
5140 * Take Longer to Execute Than Expected". It is believed that the
5141 * issue is the spurious dependency on the destination register.
5142 * Provide a hint to the register rename logic that the destination
5143 * value is overwritten, by clearing it, as suggested in the
5144 * optimization manual. It should be cheap for unaffected processors
5147 * Reference numbers for erratas are
5148 * 4th Gen Core: HSD146
5149 * 5th Gen Core: BDM85
5150 * 6th Gen Core: SKL029
5153 popcnt_pc_map_pq(uint64_t *map)
5157 __asm __volatile("xorl %k0,%k0;popcntq %2,%0;"
5158 "xorl %k1,%k1;popcntq %3,%1;addl %k1,%k0;"
5159 "xorl %k1,%k1;popcntq %4,%1;addl %k1,%k0"
5160 : "=&r" (result), "=&r" (tmp)
5161 : "m" (map[0]), "m" (map[1]), "m" (map[2]));
5166 * Ensure that the number of spare PV entries in the specified pmap meets or
5167 * exceeds the given count, "needed".
5169 * The given PV list lock may be released.
5172 reserve_pv_entries(pmap_t pmap, int needed, struct rwlock **lockp)
5174 struct pv_chunks_list *pvc;
5175 struct pch new_tail[PMAP_MEMDOM];
5176 struct pv_chunk *pc;
5181 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
5182 KASSERT(lockp != NULL, ("reserve_pv_entries: lockp is NULL"));
5185 * Newly allocated PV chunks must be stored in a private list until
5186 * the required number of PV chunks have been allocated. Otherwise,
5187 * reclaim_pv_chunk() could recycle one of these chunks. In
5188 * contrast, these chunks must be added to the pmap upon allocation.
5190 for (i = 0; i < PMAP_MEMDOM; i++)
5191 TAILQ_INIT(&new_tail[i]);
5194 TAILQ_FOREACH(pc, &pmap->pm_pvchunk, pc_list) {
5196 if ((cpu_feature2 & CPUID2_POPCNT) == 0)
5197 bit_count((bitstr_t *)pc->pc_map, 0,
5198 sizeof(pc->pc_map) * NBBY, &free);
5201 free = popcnt_pc_map_pq(pc->pc_map);
5205 if (avail >= needed)
5208 for (reclaimed = false; avail < needed; avail += _NPCPV) {
5209 m = vm_page_alloc(NULL, 0, VM_ALLOC_NORMAL | VM_ALLOC_NOOBJ |
5212 m = reclaim_pv_chunk(pmap, lockp);
5217 PV_STAT(atomic_add_int(&pc_chunk_count, 1));
5218 PV_STAT(atomic_add_int(&pc_chunk_allocs, 1));
5219 dump_add_page(m->phys_addr);
5220 pc = (void *)PHYS_TO_DMAP(m->phys_addr);
5222 pc->pc_map[0] = PC_FREE0;
5223 pc->pc_map[1] = PC_FREE1;
5224 pc->pc_map[2] = PC_FREE2;
5225 TAILQ_INSERT_HEAD(&pmap->pm_pvchunk, pc, pc_list);
5226 TAILQ_INSERT_TAIL(&new_tail[pc_to_domain(pc)], pc, pc_lru);
5227 PV_STAT(atomic_add_int(&pv_entry_spare, _NPCPV));
5230 * The reclaim might have freed a chunk from the current pmap.
5231 * If that chunk contained available entries, we need to
5232 * re-count the number of available entries.
5237 for (i = 0; i < vm_ndomains; i++) {
5238 if (TAILQ_EMPTY(&new_tail[i]))
5240 pvc = &pv_chunks[i];
5241 mtx_lock(&pvc->pvc_lock);
5242 TAILQ_CONCAT(&pvc->pvc_list, &new_tail[i], pc_lru);
5243 mtx_unlock(&pvc->pvc_lock);
5248 * First find and then remove the pv entry for the specified pmap and virtual
5249 * address from the specified pv list. Returns the pv entry if found and NULL
5250 * otherwise. This operation can be performed on pv lists for either 4KB or
5251 * 2MB page mappings.
5253 static __inline pv_entry_t
5254 pmap_pvh_remove(struct md_page *pvh, pmap_t pmap, vm_offset_t va)
5258 TAILQ_FOREACH(pv, &pvh->pv_list, pv_next) {
5259 if (pmap == PV_PMAP(pv) && va == pv->pv_va) {
5260 TAILQ_REMOVE(&pvh->pv_list, pv, pv_next);
5269 * After demotion from a 2MB page mapping to 512 4KB page mappings,
5270 * destroy the pv entry for the 2MB page mapping and reinstantiate the pv
5271 * entries for each of the 4KB page mappings.
5274 pmap_pv_demote_pde(pmap_t pmap, vm_offset_t va, vm_paddr_t pa,
5275 struct rwlock **lockp)
5277 struct md_page *pvh;
5278 struct pv_chunk *pc;
5280 vm_offset_t va_last;
5284 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
5285 KASSERT((pa & PDRMASK) == 0,
5286 ("pmap_pv_demote_pde: pa is not 2mpage aligned"));
5287 CHANGE_PV_LIST_LOCK_TO_PHYS(lockp, pa);
5290 * Transfer the 2mpage's pv entry for this mapping to the first
5291 * page's pv list. Once this transfer begins, the pv list lock
5292 * must not be released until the last pv entry is reinstantiated.
5294 pvh = pa_to_pvh(pa);
5295 va = trunc_2mpage(va);
5296 pv = pmap_pvh_remove(pvh, pmap, va);
5297 KASSERT(pv != NULL, ("pmap_pv_demote_pde: pv not found"));
5298 m = PHYS_TO_VM_PAGE(pa);
5299 TAILQ_INSERT_TAIL(&m->md.pv_list, pv, pv_next);
5301 /* Instantiate the remaining NPTEPG - 1 pv entries. */
5302 PV_STAT(atomic_add_long(&pv_entry_allocs, NPTEPG - 1));
5303 va_last = va + NBPDR - PAGE_SIZE;
5305 pc = TAILQ_FIRST(&pmap->pm_pvchunk);
5306 KASSERT(pc->pc_map[0] != 0 || pc->pc_map[1] != 0 ||
5307 pc->pc_map[2] != 0, ("pmap_pv_demote_pde: missing spare"));
5308 for (field = 0; field < _NPCM; field++) {
5309 while (pc->pc_map[field]) {
5310 bit = bsfq(pc->pc_map[field]);
5311 pc->pc_map[field] &= ~(1ul << bit);
5312 pv = &pc->pc_pventry[field * 64 + bit];
5316 KASSERT((m->oflags & VPO_UNMANAGED) == 0,
5317 ("pmap_pv_demote_pde: page %p is not managed", m));
5318 TAILQ_INSERT_TAIL(&m->md.pv_list, pv, pv_next);
5324 TAILQ_REMOVE(&pmap->pm_pvchunk, pc, pc_list);
5325 TAILQ_INSERT_TAIL(&pmap->pm_pvchunk, pc, pc_list);
5328 if (pc->pc_map[0] == 0 && pc->pc_map[1] == 0 && pc->pc_map[2] == 0) {
5329 TAILQ_REMOVE(&pmap->pm_pvchunk, pc, pc_list);
5330 TAILQ_INSERT_TAIL(&pmap->pm_pvchunk, pc, pc_list);
5332 PV_STAT(atomic_add_long(&pv_entry_count, NPTEPG - 1));
5333 PV_STAT(atomic_subtract_int(&pv_entry_spare, NPTEPG - 1));
5336 #if VM_NRESERVLEVEL > 0
5338 * After promotion from 512 4KB page mappings to a single 2MB page mapping,
5339 * replace the many pv entries for the 4KB page mappings by a single pv entry
5340 * for the 2MB page mapping.
5343 pmap_pv_promote_pde(pmap_t pmap, vm_offset_t va, vm_paddr_t pa,
5344 struct rwlock **lockp)
5346 struct md_page *pvh;
5348 vm_offset_t va_last;
5351 KASSERT((pa & PDRMASK) == 0,
5352 ("pmap_pv_promote_pde: pa is not 2mpage aligned"));
5353 CHANGE_PV_LIST_LOCK_TO_PHYS(lockp, pa);
5356 * Transfer the first page's pv entry for this mapping to the 2mpage's
5357 * pv list. Aside from avoiding the cost of a call to get_pv_entry(),
5358 * a transfer avoids the possibility that get_pv_entry() calls
5359 * reclaim_pv_chunk() and that reclaim_pv_chunk() removes one of the
5360 * mappings that is being promoted.
5362 m = PHYS_TO_VM_PAGE(pa);
5363 va = trunc_2mpage(va);
5364 pv = pmap_pvh_remove(&m->md, pmap, va);
5365 KASSERT(pv != NULL, ("pmap_pv_promote_pde: pv not found"));
5366 pvh = pa_to_pvh(pa);
5367 TAILQ_INSERT_TAIL(&pvh->pv_list, pv, pv_next);
5369 /* Free the remaining NPTEPG - 1 pv entries. */
5370 va_last = va + NBPDR - PAGE_SIZE;
5374 pmap_pvh_free(&m->md, pmap, va);
5375 } while (va < va_last);
5377 #endif /* VM_NRESERVLEVEL > 0 */
5380 * First find and then destroy the pv entry for the specified pmap and virtual
5381 * address. This operation can be performed on pv lists for either 4KB or 2MB
5385 pmap_pvh_free(struct md_page *pvh, pmap_t pmap, vm_offset_t va)
5389 pv = pmap_pvh_remove(pvh, pmap, va);
5390 KASSERT(pv != NULL, ("pmap_pvh_free: pv not found"));
5391 free_pv_entry(pmap, pv);
5395 * Conditionally create the PV entry for a 4KB page mapping if the required
5396 * memory can be allocated without resorting to reclamation.
5399 pmap_try_insert_pv_entry(pmap_t pmap, vm_offset_t va, vm_page_t m,
5400 struct rwlock **lockp)
5404 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
5405 /* Pass NULL instead of the lock pointer to disable reclamation. */
5406 if ((pv = get_pv_entry(pmap, NULL)) != NULL) {
5408 CHANGE_PV_LIST_LOCK_TO_VM_PAGE(lockp, m);
5409 TAILQ_INSERT_TAIL(&m->md.pv_list, pv, pv_next);
5417 * Create the PV entry for a 2MB page mapping. Always returns true unless the
5418 * flag PMAP_ENTER_NORECLAIM is specified. If that flag is specified, returns
5419 * false if the PV entry cannot be allocated without resorting to reclamation.
5422 pmap_pv_insert_pde(pmap_t pmap, vm_offset_t va, pd_entry_t pde, u_int flags,
5423 struct rwlock **lockp)
5425 struct md_page *pvh;
5429 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
5430 /* Pass NULL instead of the lock pointer to disable reclamation. */
5431 if ((pv = get_pv_entry(pmap, (flags & PMAP_ENTER_NORECLAIM) != 0 ?
5432 NULL : lockp)) == NULL)
5435 pa = pde & PG_PS_FRAME;
5436 CHANGE_PV_LIST_LOCK_TO_PHYS(lockp, pa);
5437 pvh = pa_to_pvh(pa);
5438 TAILQ_INSERT_TAIL(&pvh->pv_list, pv, pv_next);
5444 * Fills a page table page with mappings to consecutive physical pages.
5447 pmap_fill_ptp(pt_entry_t *firstpte, pt_entry_t newpte)
5451 for (pte = firstpte; pte < firstpte + NPTEPG; pte++) {
5453 newpte += PAGE_SIZE;
5458 * Tries to demote a 2MB page mapping. If demotion fails, the 2MB page
5459 * mapping is invalidated.
5462 pmap_demote_pde(pmap_t pmap, pd_entry_t *pde, vm_offset_t va)
5464 struct rwlock *lock;
5468 rv = pmap_demote_pde_locked(pmap, pde, va, &lock);
5475 pmap_demote_pde_check(pt_entry_t *firstpte __unused, pt_entry_t newpte __unused)
5479 pt_entry_t *xpte, *ypte;
5481 for (xpte = firstpte; xpte < firstpte + NPTEPG;
5482 xpte++, newpte += PAGE_SIZE) {
5483 if ((*xpte & PG_FRAME) != (newpte & PG_FRAME)) {
5484 printf("pmap_demote_pde: xpte %zd and newpte map "
5485 "different pages: found %#lx, expected %#lx\n",
5486 xpte - firstpte, *xpte, newpte);
5487 printf("page table dump\n");
5488 for (ypte = firstpte; ypte < firstpte + NPTEPG; ypte++)
5489 printf("%zd %#lx\n", ypte - firstpte, *ypte);
5494 KASSERT((*firstpte & PG_FRAME) == (newpte & PG_FRAME),
5495 ("pmap_demote_pde: firstpte and newpte map different physical"
5502 pmap_demote_pde_abort(pmap_t pmap, vm_offset_t va, pd_entry_t *pde,
5503 pd_entry_t oldpde, struct rwlock **lockp)
5505 struct spglist free;
5509 sva = trunc_2mpage(va);
5510 pmap_remove_pde(pmap, pde, sva, &free, lockp);
5511 if ((oldpde & pmap_global_bit(pmap)) == 0)
5512 pmap_invalidate_pde_page(pmap, sva, oldpde);
5513 vm_page_free_pages_toq(&free, true);
5514 CTR2(KTR_PMAP, "pmap_demote_pde: failure for va %#lx in pmap %p",
5519 pmap_demote_pde_locked(pmap_t pmap, pd_entry_t *pde, vm_offset_t va,
5520 struct rwlock **lockp)
5522 pd_entry_t newpde, oldpde;
5523 pt_entry_t *firstpte, newpte;
5524 pt_entry_t PG_A, PG_G, PG_M, PG_PKU_MASK, PG_RW, PG_V;
5530 PG_A = pmap_accessed_bit(pmap);
5531 PG_G = pmap_global_bit(pmap);
5532 PG_M = pmap_modified_bit(pmap);
5533 PG_RW = pmap_rw_bit(pmap);
5534 PG_V = pmap_valid_bit(pmap);
5535 PG_PTE_CACHE = pmap_cache_mask(pmap, 0);
5536 PG_PKU_MASK = pmap_pku_mask_bit(pmap);
5538 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
5539 in_kernel = va >= VM_MAXUSER_ADDRESS;
5541 KASSERT((oldpde & (PG_PS | PG_V)) == (PG_PS | PG_V),
5542 ("pmap_demote_pde: oldpde is missing PG_PS and/or PG_V"));
5545 * Invalidate the 2MB page mapping and return "failure" if the
5546 * mapping was never accessed.
5548 if ((oldpde & PG_A) == 0) {
5549 KASSERT((oldpde & PG_W) == 0,
5550 ("pmap_demote_pde: a wired mapping is missing PG_A"));
5551 pmap_demote_pde_abort(pmap, va, pde, oldpde, lockp);
5555 mpte = pmap_remove_pt_page(pmap, va);
5557 KASSERT((oldpde & PG_W) == 0,
5558 ("pmap_demote_pde: page table page for a wired mapping"
5562 * If the page table page is missing and the mapping
5563 * is for a kernel address, the mapping must belong to
5564 * the direct map. Page table pages are preallocated
5565 * for every other part of the kernel address space,
5566 * so the direct map region is the only part of the
5567 * kernel address space that must be handled here.
5569 KASSERT(!in_kernel || (va >= DMAP_MIN_ADDRESS &&
5570 va < DMAP_MAX_ADDRESS),
5571 ("pmap_demote_pde: No saved mpte for va %#lx", va));
5574 * If the 2MB page mapping belongs to the direct map
5575 * region of the kernel's address space, then the page
5576 * allocation request specifies the highest possible
5577 * priority (VM_ALLOC_INTERRUPT). Otherwise, the
5578 * priority is normal.
5580 mpte = vm_page_alloc(NULL, pmap_pde_pindex(va),
5581 (in_kernel ? VM_ALLOC_INTERRUPT : VM_ALLOC_NORMAL) |
5582 VM_ALLOC_NOOBJ | VM_ALLOC_WIRED);
5585 * If the allocation of the new page table page fails,
5586 * invalidate the 2MB page mapping and return "failure".
5589 pmap_demote_pde_abort(pmap, va, pde, oldpde, lockp);
5594 mpte->ref_count = NPTEPG;
5595 pmap_resident_count_inc(pmap, 1);
5598 mptepa = VM_PAGE_TO_PHYS(mpte);
5599 firstpte = (pt_entry_t *)PHYS_TO_DMAP(mptepa);
5600 newpde = mptepa | PG_M | PG_A | (oldpde & PG_U) | PG_RW | PG_V;
5601 KASSERT((oldpde & (PG_M | PG_RW)) != PG_RW,
5602 ("pmap_demote_pde: oldpde is missing PG_M"));
5603 newpte = oldpde & ~PG_PS;
5604 newpte = pmap_swap_pat(pmap, newpte);
5607 * If the page table page is not leftover from an earlier promotion,
5610 if (mpte->valid == 0)
5611 pmap_fill_ptp(firstpte, newpte);
5613 pmap_demote_pde_check(firstpte, newpte);
5616 * If the mapping has changed attributes, update the page table
5619 if ((*firstpte & PG_PTE_PROMOTE) != (newpte & PG_PTE_PROMOTE))
5620 pmap_fill_ptp(firstpte, newpte);
5623 * The spare PV entries must be reserved prior to demoting the
5624 * mapping, that is, prior to changing the PDE. Otherwise, the state
5625 * of the PDE and the PV lists will be inconsistent, which can result
5626 * in reclaim_pv_chunk() attempting to remove a PV entry from the
5627 * wrong PV list and pmap_pv_demote_pde() failing to find the expected
5628 * PV entry for the 2MB page mapping that is being demoted.
5630 if ((oldpde & PG_MANAGED) != 0)
5631 reserve_pv_entries(pmap, NPTEPG - 1, lockp);
5634 * Demote the mapping. This pmap is locked. The old PDE has
5635 * PG_A set. If the old PDE has PG_RW set, it also has PG_M
5636 * set. Thus, there is no danger of a race with another
5637 * processor changing the setting of PG_A and/or PG_M between
5638 * the read above and the store below.
5640 if (workaround_erratum383)
5641 pmap_update_pde(pmap, va, pde, newpde);
5643 pde_store(pde, newpde);
5646 * Invalidate a stale recursive mapping of the page table page.
5649 pmap_invalidate_page(pmap, (vm_offset_t)vtopte(va));
5652 * Demote the PV entry.
5654 if ((oldpde & PG_MANAGED) != 0)
5655 pmap_pv_demote_pde(pmap, va, oldpde & PG_PS_FRAME, lockp);
5657 atomic_add_long(&pmap_pde_demotions, 1);
5658 CTR2(KTR_PMAP, "pmap_demote_pde: success for va %#lx in pmap %p",
5664 * pmap_remove_kernel_pde: Remove a kernel superpage mapping.
5667 pmap_remove_kernel_pde(pmap_t pmap, pd_entry_t *pde, vm_offset_t va)
5673 KASSERT(pmap == kernel_pmap, ("pmap %p is not kernel_pmap", pmap));
5674 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
5675 mpte = pmap_remove_pt_page(pmap, va);
5677 panic("pmap_remove_kernel_pde: Missing pt page.");
5679 mptepa = VM_PAGE_TO_PHYS(mpte);
5680 newpde = mptepa | X86_PG_M | X86_PG_A | X86_PG_RW | X86_PG_V;
5683 * If this page table page was unmapped by a promotion, then it
5684 * contains valid mappings. Zero it to invalidate those mappings.
5686 if (mpte->valid != 0)
5687 pagezero((void *)PHYS_TO_DMAP(mptepa));
5690 * Demote the mapping.
5692 if (workaround_erratum383)
5693 pmap_update_pde(pmap, va, pde, newpde);
5695 pde_store(pde, newpde);
5698 * Invalidate a stale recursive mapping of the page table page.
5700 pmap_invalidate_page(pmap, (vm_offset_t)vtopte(va));
5704 * pmap_remove_pde: do the things to unmap a superpage in a process
5707 pmap_remove_pde(pmap_t pmap, pd_entry_t *pdq, vm_offset_t sva,
5708 struct spglist *free, struct rwlock **lockp)
5710 struct md_page *pvh;
5712 vm_offset_t eva, va;
5714 pt_entry_t PG_G, PG_A, PG_M, PG_RW;
5716 PG_G = pmap_global_bit(pmap);
5717 PG_A = pmap_accessed_bit(pmap);
5718 PG_M = pmap_modified_bit(pmap);
5719 PG_RW = pmap_rw_bit(pmap);
5721 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
5722 KASSERT((sva & PDRMASK) == 0,
5723 ("pmap_remove_pde: sva is not 2mpage aligned"));
5724 oldpde = pte_load_clear(pdq);
5726 pmap->pm_stats.wired_count -= NBPDR / PAGE_SIZE;
5727 if ((oldpde & PG_G) != 0)
5728 pmap_invalidate_pde_page(kernel_pmap, sva, oldpde);
5729 pmap_resident_count_dec(pmap, NBPDR / PAGE_SIZE);
5730 if (oldpde & PG_MANAGED) {
5731 CHANGE_PV_LIST_LOCK_TO_PHYS(lockp, oldpde & PG_PS_FRAME);
5732 pvh = pa_to_pvh(oldpde & PG_PS_FRAME);
5733 pmap_pvh_free(pvh, pmap, sva);
5735 for (va = sva, m = PHYS_TO_VM_PAGE(oldpde & PG_PS_FRAME);
5736 va < eva; va += PAGE_SIZE, m++) {
5737 if ((oldpde & (PG_M | PG_RW)) == (PG_M | PG_RW))
5740 vm_page_aflag_set(m, PGA_REFERENCED);
5741 if (TAILQ_EMPTY(&m->md.pv_list) &&
5742 TAILQ_EMPTY(&pvh->pv_list))
5743 vm_page_aflag_clear(m, PGA_WRITEABLE);
5744 pmap_delayed_invl_page(m);
5747 if (pmap == kernel_pmap) {
5748 pmap_remove_kernel_pde(pmap, pdq, sva);
5750 mpte = pmap_remove_pt_page(pmap, sva);
5752 KASSERT(mpte->valid == VM_PAGE_BITS_ALL,
5753 ("pmap_remove_pde: pte page not promoted"));
5754 pmap_resident_count_dec(pmap, 1);
5755 KASSERT(mpte->ref_count == NPTEPG,
5756 ("pmap_remove_pde: pte page ref count error"));
5757 mpte->ref_count = 0;
5758 pmap_add_delayed_free_list(mpte, free, FALSE);
5761 return (pmap_unuse_pt(pmap, sva, *pmap_pdpe(pmap, sva), free));
5765 * pmap_remove_pte: do the things to unmap a page in a process
5768 pmap_remove_pte(pmap_t pmap, pt_entry_t *ptq, vm_offset_t va,
5769 pd_entry_t ptepde, struct spglist *free, struct rwlock **lockp)
5771 struct md_page *pvh;
5772 pt_entry_t oldpte, PG_A, PG_M, PG_RW;
5775 PG_A = pmap_accessed_bit(pmap);
5776 PG_M = pmap_modified_bit(pmap);
5777 PG_RW = pmap_rw_bit(pmap);
5779 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
5780 oldpte = pte_load_clear(ptq);
5782 pmap->pm_stats.wired_count -= 1;
5783 pmap_resident_count_dec(pmap, 1);
5784 if (oldpte & PG_MANAGED) {
5785 m = PHYS_TO_VM_PAGE(oldpte & PG_FRAME);
5786 if ((oldpte & (PG_M | PG_RW)) == (PG_M | PG_RW))
5789 vm_page_aflag_set(m, PGA_REFERENCED);
5790 CHANGE_PV_LIST_LOCK_TO_VM_PAGE(lockp, m);
5791 pmap_pvh_free(&m->md, pmap, va);
5792 if (TAILQ_EMPTY(&m->md.pv_list) &&
5793 (m->flags & PG_FICTITIOUS) == 0) {
5794 pvh = pa_to_pvh(VM_PAGE_TO_PHYS(m));
5795 if (TAILQ_EMPTY(&pvh->pv_list))
5796 vm_page_aflag_clear(m, PGA_WRITEABLE);
5798 pmap_delayed_invl_page(m);
5800 return (pmap_unuse_pt(pmap, va, ptepde, free));
5804 * Remove a single page from a process address space
5807 pmap_remove_page(pmap_t pmap, vm_offset_t va, pd_entry_t *pde,
5808 struct spglist *free)
5810 struct rwlock *lock;
5811 pt_entry_t *pte, PG_V;
5813 PG_V = pmap_valid_bit(pmap);
5814 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
5815 if ((*pde & PG_V) == 0)
5817 pte = pmap_pde_to_pte(pde, va);
5818 if ((*pte & PG_V) == 0)
5821 pmap_remove_pte(pmap, pte, va, *pde, free, &lock);
5824 pmap_invalidate_page(pmap, va);
5828 * Removes the specified range of addresses from the page table page.
5831 pmap_remove_ptes(pmap_t pmap, vm_offset_t sva, vm_offset_t eva,
5832 pd_entry_t *pde, struct spglist *free, struct rwlock **lockp)
5834 pt_entry_t PG_G, *pte;
5838 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
5839 PG_G = pmap_global_bit(pmap);
5842 for (pte = pmap_pde_to_pte(pde, sva); sva != eva; pte++,
5846 pmap_invalidate_range(pmap, va, sva);
5851 if ((*pte & PG_G) == 0)
5855 if (pmap_remove_pte(pmap, pte, sva, *pde, free, lockp)) {
5861 pmap_invalidate_range(pmap, va, sva);
5866 * Remove the given range of addresses from the specified map.
5868 * It is assumed that the start and end are properly
5869 * rounded to the page size.
5872 pmap_remove(pmap_t pmap, vm_offset_t sva, vm_offset_t eva)
5874 struct rwlock *lock;
5876 vm_offset_t va_next;
5877 pml5_entry_t *pml5e;
5878 pml4_entry_t *pml4e;
5880 pd_entry_t ptpaddr, *pde;
5881 pt_entry_t PG_G, PG_V;
5882 struct spglist free;
5885 PG_G = pmap_global_bit(pmap);
5886 PG_V = pmap_valid_bit(pmap);
5889 * Perform an unsynchronized read. This is, however, safe.
5891 if (pmap->pm_stats.resident_count == 0)
5897 pmap_delayed_invl_start();
5899 pmap_pkru_on_remove(pmap, sva, eva);
5902 * special handling of removing one page. a very
5903 * common operation and easy to short circuit some
5906 if (sva + PAGE_SIZE == eva) {
5907 pde = pmap_pde(pmap, sva);
5908 if (pde && (*pde & PG_PS) == 0) {
5909 pmap_remove_page(pmap, sva, pde, &free);
5915 for (; sva < eva; sva = va_next) {
5916 if (pmap->pm_stats.resident_count == 0)
5919 if (pmap_is_la57(pmap)) {
5920 pml5e = pmap_pml5e(pmap, sva);
5921 if ((*pml5e & PG_V) == 0) {
5922 va_next = (sva + NBPML5) & ~PML5MASK;
5927 pml4e = pmap_pml5e_to_pml4e(pml5e, sva);
5929 pml4e = pmap_pml4e(pmap, sva);
5931 if ((*pml4e & PG_V) == 0) {
5932 va_next = (sva + NBPML4) & ~PML4MASK;
5938 pdpe = pmap_pml4e_to_pdpe(pml4e, sva);
5939 va_next = (sva + NBPDP) & ~PDPMASK;
5940 if ((*pdpe & PG_V) == 0) {
5946 KASSERT((*pdpe & PG_PS) == 0 || va_next <= eva,
5947 ("pmap_remove of non-transient 1G page "
5948 "pdpe %#lx sva %#lx eva %#lx va_next %#lx",
5949 *pdpe, sva, eva, va_next));
5950 if ((*pdpe & PG_PS) != 0) {
5951 MPASS(pmap != kernel_pmap); /* XXXKIB */
5952 MPASS((*pdpe & (PG_MANAGED | PG_G)) == 0);
5955 pmap_resident_count_dec(pmap, NBPDP / PAGE_SIZE);
5956 mt = PHYS_TO_VM_PAGE(*pmap_pml4e(pmap, sva) & PG_FRAME);
5957 pmap_unwire_ptp(pmap, sva, mt, &free);
5962 * Calculate index for next page table.
5964 va_next = (sva + NBPDR) & ~PDRMASK;
5968 pde = pmap_pdpe_to_pde(pdpe, sva);
5972 * Weed out invalid mappings.
5978 * Check for large page.
5980 if ((ptpaddr & PG_PS) != 0) {
5982 * Are we removing the entire large page? If not,
5983 * demote the mapping and fall through.
5985 if (sva + NBPDR == va_next && eva >= va_next) {
5987 * The TLB entry for a PG_G mapping is
5988 * invalidated by pmap_remove_pde().
5990 if ((ptpaddr & PG_G) == 0)
5992 pmap_remove_pde(pmap, pde, sva, &free, &lock);
5994 } else if (!pmap_demote_pde_locked(pmap, pde, sva,
5996 /* The large page mapping was destroyed. */
6003 * Limit our scan to either the end of the va represented
6004 * by the current page table page, or to the end of the
6005 * range being removed.
6010 if (pmap_remove_ptes(pmap, sva, va_next, pde, &free, &lock))
6017 pmap_invalidate_all(pmap);
6019 pmap_delayed_invl_finish();
6020 vm_page_free_pages_toq(&free, true);
6024 * Routine: pmap_remove_all
6026 * Removes this physical page from
6027 * all physical maps in which it resides.
6028 * Reflects back modify bits to the pager.
6031 * Original versions of this routine were very
6032 * inefficient because they iteratively called
6033 * pmap_remove (slow...)
6037 pmap_remove_all(vm_page_t m)
6039 struct md_page *pvh;
6042 struct rwlock *lock;
6043 pt_entry_t *pte, tpte, PG_A, PG_M, PG_RW;
6046 struct spglist free;
6047 int pvh_gen, md_gen;
6049 KASSERT((m->oflags & VPO_UNMANAGED) == 0,
6050 ("pmap_remove_all: page %p is not managed", m));
6052 lock = VM_PAGE_TO_PV_LIST_LOCK(m);
6053 pvh = (m->flags & PG_FICTITIOUS) != 0 ? &pv_dummy :
6054 pa_to_pvh(VM_PAGE_TO_PHYS(m));
6057 while ((pv = TAILQ_FIRST(&pvh->pv_list)) != NULL) {
6059 if (!PMAP_TRYLOCK(pmap)) {
6060 pvh_gen = pvh->pv_gen;
6064 if (pvh_gen != pvh->pv_gen) {
6071 pde = pmap_pde(pmap, va);
6072 (void)pmap_demote_pde_locked(pmap, pde, va, &lock);
6075 while ((pv = TAILQ_FIRST(&m->md.pv_list)) != NULL) {
6077 if (!PMAP_TRYLOCK(pmap)) {
6078 pvh_gen = pvh->pv_gen;
6079 md_gen = m->md.pv_gen;
6083 if (pvh_gen != pvh->pv_gen || md_gen != m->md.pv_gen) {
6089 PG_A = pmap_accessed_bit(pmap);
6090 PG_M = pmap_modified_bit(pmap);
6091 PG_RW = pmap_rw_bit(pmap);
6092 pmap_resident_count_dec(pmap, 1);
6093 pde = pmap_pde(pmap, pv->pv_va);
6094 KASSERT((*pde & PG_PS) == 0, ("pmap_remove_all: found"
6095 " a 2mpage in page %p's pv list", m));
6096 pte = pmap_pde_to_pte(pde, pv->pv_va);
6097 tpte = pte_load_clear(pte);
6099 pmap->pm_stats.wired_count--;
6101 vm_page_aflag_set(m, PGA_REFERENCED);
6104 * Update the vm_page_t clean and reference bits.
6106 if ((tpte & (PG_M | PG_RW)) == (PG_M | PG_RW))
6108 pmap_unuse_pt(pmap, pv->pv_va, *pde, &free);
6109 pmap_invalidate_page(pmap, pv->pv_va);
6110 TAILQ_REMOVE(&m->md.pv_list, pv, pv_next);
6112 free_pv_entry(pmap, pv);
6115 vm_page_aflag_clear(m, PGA_WRITEABLE);
6117 pmap_delayed_invl_wait(m);
6118 vm_page_free_pages_toq(&free, true);
6122 * pmap_protect_pde: do the things to protect a 2mpage in a process
6125 pmap_protect_pde(pmap_t pmap, pd_entry_t *pde, vm_offset_t sva, vm_prot_t prot)
6127 pd_entry_t newpde, oldpde;
6129 boolean_t anychanged;
6130 pt_entry_t PG_G, PG_M, PG_RW;
6132 PG_G = pmap_global_bit(pmap);
6133 PG_M = pmap_modified_bit(pmap);
6134 PG_RW = pmap_rw_bit(pmap);
6136 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
6137 KASSERT((sva & PDRMASK) == 0,
6138 ("pmap_protect_pde: sva is not 2mpage aligned"));
6141 oldpde = newpde = *pde;
6142 if ((prot & VM_PROT_WRITE) == 0) {
6143 if ((oldpde & (PG_MANAGED | PG_M | PG_RW)) ==
6144 (PG_MANAGED | PG_M | PG_RW)) {
6145 m = PHYS_TO_VM_PAGE(oldpde & PG_PS_FRAME);
6146 for (mt = m; mt < &m[NBPDR / PAGE_SIZE]; mt++)
6149 newpde &= ~(PG_RW | PG_M);
6151 if ((prot & VM_PROT_EXECUTE) == 0)
6153 if (newpde != oldpde) {
6155 * As an optimization to future operations on this PDE, clear
6156 * PG_PROMOTED. The impending invalidation will remove any
6157 * lingering 4KB page mappings from the TLB.
6159 if (!atomic_cmpset_long(pde, oldpde, newpde & ~PG_PROMOTED))
6161 if ((oldpde & PG_G) != 0)
6162 pmap_invalidate_pde_page(kernel_pmap, sva, oldpde);
6166 return (anychanged);
6170 * Set the physical protection on the
6171 * specified range of this map as requested.
6174 pmap_protect(pmap_t pmap, vm_offset_t sva, vm_offset_t eva, vm_prot_t prot)
6177 vm_offset_t va_next;
6178 pml4_entry_t *pml4e;
6180 pd_entry_t ptpaddr, *pde;
6181 pt_entry_t *pte, PG_G, PG_M, PG_RW, PG_V;
6182 pt_entry_t obits, pbits;
6183 boolean_t anychanged;
6185 KASSERT((prot & ~VM_PROT_ALL) == 0, ("invalid prot %x", prot));
6186 if (prot == VM_PROT_NONE) {
6187 pmap_remove(pmap, sva, eva);
6191 if ((prot & (VM_PROT_WRITE|VM_PROT_EXECUTE)) ==
6192 (VM_PROT_WRITE|VM_PROT_EXECUTE))
6195 PG_G = pmap_global_bit(pmap);
6196 PG_M = pmap_modified_bit(pmap);
6197 PG_V = pmap_valid_bit(pmap);
6198 PG_RW = pmap_rw_bit(pmap);
6202 * Although this function delays and batches the invalidation
6203 * of stale TLB entries, it does not need to call
6204 * pmap_delayed_invl_start() and
6205 * pmap_delayed_invl_finish(), because it does not
6206 * ordinarily destroy mappings. Stale TLB entries from
6207 * protection-only changes need only be invalidated before the
6208 * pmap lock is released, because protection-only changes do
6209 * not destroy PV entries. Even operations that iterate over
6210 * a physical page's PV list of mappings, like
6211 * pmap_remove_write(), acquire the pmap lock for each
6212 * mapping. Consequently, for protection-only changes, the
6213 * pmap lock suffices to synchronize both page table and TLB
6216 * This function only destroys a mapping if pmap_demote_pde()
6217 * fails. In that case, stale TLB entries are immediately
6222 for (; sva < eva; sva = va_next) {
6223 pml4e = pmap_pml4e(pmap, sva);
6224 if ((*pml4e & PG_V) == 0) {
6225 va_next = (sva + NBPML4) & ~PML4MASK;
6231 pdpe = pmap_pml4e_to_pdpe(pml4e, sva);
6232 va_next = (sva + NBPDP) & ~PDPMASK;
6233 if ((*pdpe & PG_V) == 0) {
6239 KASSERT((*pdpe & PG_PS) == 0 || va_next <= eva,
6240 ("pmap_remove of non-transient 1G page "
6241 "pdpe %#lx sva %#lx eva %#lx va_next %#lx",
6242 *pdpe, sva, eva, va_next));
6243 if ((*pdpe & PG_PS) != 0) {
6245 obits = pbits = *pdpe;
6246 MPASS((pbits & (PG_MANAGED | PG_G)) == 0);
6247 MPASS(pmap != kernel_pmap); /* XXXKIB */
6248 if ((prot & VM_PROT_WRITE) == 0)
6249 pbits &= ~(PG_RW | PG_M);
6250 if ((prot & VM_PROT_EXECUTE) == 0)
6253 if (pbits != obits) {
6254 if (!atomic_cmpset_long(pdpe, obits, pbits))
6255 /* PG_PS cannot be cleared under us, */
6262 va_next = (sva + NBPDR) & ~PDRMASK;
6266 pde = pmap_pdpe_to_pde(pdpe, sva);
6270 * Weed out invalid mappings.
6276 * Check for large page.
6278 if ((ptpaddr & PG_PS) != 0) {
6280 * Are we protecting the entire large page? If not,
6281 * demote the mapping and fall through.
6283 if (sva + NBPDR == va_next && eva >= va_next) {
6285 * The TLB entry for a PG_G mapping is
6286 * invalidated by pmap_protect_pde().
6288 if (pmap_protect_pde(pmap, pde, sva, prot))
6291 } else if (!pmap_demote_pde(pmap, pde, sva)) {
6293 * The large page mapping was destroyed.
6302 for (pte = pmap_pde_to_pte(pde, sva); sva != va_next; pte++,
6305 obits = pbits = *pte;
6306 if ((pbits & PG_V) == 0)
6309 if ((prot & VM_PROT_WRITE) == 0) {
6310 if ((pbits & (PG_MANAGED | PG_M | PG_RW)) ==
6311 (PG_MANAGED | PG_M | PG_RW)) {
6312 m = PHYS_TO_VM_PAGE(pbits & PG_FRAME);
6315 pbits &= ~(PG_RW | PG_M);
6317 if ((prot & VM_PROT_EXECUTE) == 0)
6320 if (pbits != obits) {
6321 if (!atomic_cmpset_long(pte, obits, pbits))
6324 pmap_invalidate_page(pmap, sva);
6331 pmap_invalidate_all(pmap);
6335 #if VM_NRESERVLEVEL > 0
6337 pmap_pde_ept_executable(pmap_t pmap, pd_entry_t pde)
6340 if (pmap->pm_type != PT_EPT)
6342 return ((pde & EPT_PG_EXECUTE) != 0);
6346 * Tries to promote the 512, contiguous 4KB page mappings that are within a
6347 * single page table page (PTP) to a single 2MB page mapping. For promotion
6348 * to occur, two conditions must be met: (1) the 4KB page mappings must map
6349 * aligned, contiguous physical memory and (2) the 4KB page mappings must have
6350 * identical characteristics.
6353 pmap_promote_pde(pmap_t pmap, pd_entry_t *pde, vm_offset_t va,
6354 struct rwlock **lockp)
6357 pt_entry_t *firstpte, oldpte, pa, *pte;
6358 pt_entry_t PG_G, PG_A, PG_M, PG_RW, PG_V, PG_PKU_MASK;
6362 PG_A = pmap_accessed_bit(pmap);
6363 PG_G = pmap_global_bit(pmap);
6364 PG_M = pmap_modified_bit(pmap);
6365 PG_V = pmap_valid_bit(pmap);
6366 PG_RW = pmap_rw_bit(pmap);
6367 PG_PKU_MASK = pmap_pku_mask_bit(pmap);
6368 PG_PTE_CACHE = pmap_cache_mask(pmap, 0);
6370 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
6373 * Examine the first PTE in the specified PTP. Abort if this PTE is
6374 * either invalid, unused, or does not map the first 4KB physical page
6375 * within a 2MB page.
6377 firstpte = (pt_entry_t *)PHYS_TO_DMAP(*pde & PG_FRAME);
6380 if ((newpde & ((PG_FRAME & PDRMASK) | PG_A | PG_V)) != (PG_A | PG_V) ||
6381 !pmap_allow_2m_x_page(pmap, pmap_pde_ept_executable(pmap,
6383 atomic_add_long(&pmap_pde_p_failures, 1);
6384 CTR2(KTR_PMAP, "pmap_promote_pde: failure for va %#lx"
6385 " in pmap %p", va, pmap);
6388 if ((newpde & (PG_M | PG_RW)) == PG_RW) {
6390 * When PG_M is already clear, PG_RW can be cleared without
6391 * a TLB invalidation.
6393 if (!atomic_cmpset_long(firstpte, newpde, newpde & ~PG_RW))
6399 * Examine each of the other PTEs in the specified PTP. Abort if this
6400 * PTE maps an unexpected 4KB physical page or does not have identical
6401 * characteristics to the first PTE.
6403 pa = (newpde & (PG_PS_FRAME | PG_A | PG_V)) + NBPDR - PAGE_SIZE;
6404 for (pte = firstpte + NPTEPG - 1; pte > firstpte; pte--) {
6407 if ((oldpte & (PG_FRAME | PG_A | PG_V)) != pa) {
6408 atomic_add_long(&pmap_pde_p_failures, 1);
6409 CTR2(KTR_PMAP, "pmap_promote_pde: failure for va %#lx"
6410 " in pmap %p", va, pmap);
6413 if ((oldpte & (PG_M | PG_RW)) == PG_RW) {
6415 * When PG_M is already clear, PG_RW can be cleared
6416 * without a TLB invalidation.
6418 if (!atomic_cmpset_long(pte, oldpte, oldpte & ~PG_RW))
6421 CTR2(KTR_PMAP, "pmap_promote_pde: protect for va %#lx"
6422 " in pmap %p", (oldpte & PG_FRAME & PDRMASK) |
6423 (va & ~PDRMASK), pmap);
6425 if ((oldpte & PG_PTE_PROMOTE) != (newpde & PG_PTE_PROMOTE)) {
6426 atomic_add_long(&pmap_pde_p_failures, 1);
6427 CTR2(KTR_PMAP, "pmap_promote_pde: failure for va %#lx"
6428 " in pmap %p", va, pmap);
6435 * Save the page table page in its current state until the PDE
6436 * mapping the superpage is demoted by pmap_demote_pde() or
6437 * destroyed by pmap_remove_pde().
6439 mpte = PHYS_TO_VM_PAGE(*pde & PG_FRAME);
6440 KASSERT(mpte >= vm_page_array &&
6441 mpte < &vm_page_array[vm_page_array_size],
6442 ("pmap_promote_pde: page table page is out of range"));
6443 KASSERT(mpte->pindex == pmap_pde_pindex(va),
6444 ("pmap_promote_pde: page table page's pindex is wrong"));
6445 if (pmap_insert_pt_page(pmap, mpte, true)) {
6446 atomic_add_long(&pmap_pde_p_failures, 1);
6448 "pmap_promote_pde: failure for va %#lx in pmap %p", va,
6454 * Promote the pv entries.
6456 if ((newpde & PG_MANAGED) != 0)
6457 pmap_pv_promote_pde(pmap, va, newpde & PG_PS_FRAME, lockp);
6460 * Propagate the PAT index to its proper position.
6462 newpde = pmap_swap_pat(pmap, newpde);
6465 * Map the superpage.
6467 if (workaround_erratum383)
6468 pmap_update_pde(pmap, va, pde, PG_PS | newpde);
6470 pde_store(pde, PG_PROMOTED | PG_PS | newpde);
6472 atomic_add_long(&pmap_pde_promotions, 1);
6473 CTR2(KTR_PMAP, "pmap_promote_pde: success for va %#lx"
6474 " in pmap %p", va, pmap);
6476 #endif /* VM_NRESERVLEVEL > 0 */
6479 pmap_enter_largepage(pmap_t pmap, vm_offset_t va, pt_entry_t newpte, int flags,
6483 pt_entry_t origpte, *pml4e, *pdpe, *pde, pten, PG_V;
6485 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
6486 KASSERT(psind > 0 && psind < MAXPAGESIZES,
6487 ("psind %d unexpected", psind));
6488 KASSERT(((newpte & PG_FRAME) & (pagesizes[psind] - 1)) == 0,
6489 ("unaligned phys address %#lx newpte %#lx psind %d",
6490 newpte & PG_FRAME, newpte, psind));
6491 KASSERT((va & (pagesizes[psind] - 1)) == 0,
6492 ("unaligned va %#lx psind %d", va, psind));
6493 KASSERT(va < VM_MAXUSER_ADDRESS,
6494 ("kernel mode non-transparent superpage")); /* XXXKIB */
6495 KASSERT(va + pagesizes[psind] < VM_MAXUSER_ADDRESS,
6496 ("overflowing user map va %#lx psind %d", va, psind)); /* XXXKIB */
6498 PG_V = pmap_valid_bit(pmap);
6502 if (va < VM_MAXUSER_ADDRESS && pmap->pm_type == PT_X86)
6503 pten |= pmap_pkru_get(pmap, va);
6505 if (psind == 2) { /* 1G */
6506 if (!pmap_pkru_same(pmap, va, va + NBPDP))
6507 return (KERN_PROTECTION_FAILURE);
6508 pml4e = pmap_pml4e(pmap, va);
6509 if ((*pml4e & PG_V) == 0) {
6510 mp = _pmap_allocpte(pmap, pmap_pml4e_pindex(va),
6513 if ((flags & PMAP_ENTER_NOSLEEP) != 0)
6514 return (KERN_RESOURCE_SHORTAGE);
6520 * Restart at least to recalcuate the pkru
6521 * key. Our caller must keep the map locked
6522 * so no paging structure can be validated
6527 pdpe = pmap_pdpe(pmap, va);
6528 KASSERT(pdpe != NULL, ("va %#lx lost pdpe", va));
6530 MPASS(origpte == 0);
6532 mp = PHYS_TO_VM_PAGE(*pml4e & PG_FRAME);
6533 pdpe = pmap_pdpe(pmap, va);
6534 KASSERT(pdpe != NULL, ("va %#lx lost pdpe", va));
6536 if ((origpte & PG_V) == 0)
6539 KASSERT((origpte & PG_V) == 0 || ((origpte & PG_PS) != 0 &&
6540 (origpte & PG_FRAME) == (pten & PG_FRAME)),
6541 ("va %#lx changing 1G phys page pdpe %#lx pten %#lx",
6542 va, origpte, pten));
6543 if ((pten & PG_W) != 0 && (origpte & PG_W) == 0)
6544 pmap->pm_stats.wired_count += NBPDP / PAGE_SIZE;
6545 else if ((pten & PG_W) == 0 && (origpte & PG_W) != 0)
6546 pmap->pm_stats.wired_count -= NBPDP / PAGE_SIZE;
6548 } else /* (psind == 1) */ { /* 2M */
6549 if (!pmap_pkru_same(pmap, va, va + NBPDR))
6550 return (KERN_PROTECTION_FAILURE);
6551 pde = pmap_pde(pmap, va);
6553 mp = _pmap_allocpte(pmap, pmap_pdpe_pindex(va),
6556 if ((flags & PMAP_ENTER_NOSLEEP) != 0)
6557 return (KERN_RESOURCE_SHORTAGE);
6563 pde = (pd_entry_t *)PHYS_TO_DMAP(VM_PAGE_TO_PHYS(mp));
6564 pde = &pde[pmap_pde_index(va)];
6566 MPASS(origpte == 0);
6568 pdpe = pmap_pdpe(pmap, va);
6569 MPASS(pdpe != NULL && (*pdpe & PG_V) != 0);
6570 mp = PHYS_TO_VM_PAGE(*pdpe & PG_FRAME);
6572 if ((origpte & PG_V) == 0)
6575 KASSERT((origpte & PG_V) == 0 || ((origpte & PG_PS) != 0 &&
6576 (origpte & PG_FRAME) == (pten & PG_FRAME)),
6577 ("va %#lx changing 2M phys page pde %#lx pten %#lx",
6578 va, origpte, pten));
6579 if ((pten & PG_W) != 0 && (origpte & PG_W) == 0)
6580 pmap->pm_stats.wired_count += NBPDR / PAGE_SIZE;
6581 else if ((pten & PG_W) == 0 && (origpte & PG_W) != 0)
6582 pmap->pm_stats.wired_count -= NBPDR / PAGE_SIZE;
6585 if ((origpte & PG_V) == 0)
6586 pmap_resident_count_inc(pmap, pagesizes[psind] / PAGE_SIZE);
6588 return (KERN_SUCCESS);
6592 * Insert the given physical page (p) at
6593 * the specified virtual address (v) in the
6594 * target physical map with the protection requested.
6596 * If specified, the page will be wired down, meaning
6597 * that the related pte can not be reclaimed.
6599 * NB: This is the only routine which MAY NOT lazy-evaluate
6600 * or lose information. That is, this routine must actually
6601 * insert this page into the given map NOW.
6603 * When destroying both a page table and PV entry, this function
6604 * performs the TLB invalidation before releasing the PV list
6605 * lock, so we do not need pmap_delayed_invl_page() calls here.
6608 pmap_enter(pmap_t pmap, vm_offset_t va, vm_page_t m, vm_prot_t prot,
6609 u_int flags, int8_t psind)
6611 struct rwlock *lock;
6613 pt_entry_t *pte, PG_G, PG_A, PG_M, PG_RW, PG_V;
6614 pt_entry_t newpte, origpte;
6621 PG_A = pmap_accessed_bit(pmap);
6622 PG_G = pmap_global_bit(pmap);
6623 PG_M = pmap_modified_bit(pmap);
6624 PG_V = pmap_valid_bit(pmap);
6625 PG_RW = pmap_rw_bit(pmap);
6627 va = trunc_page(va);
6628 KASSERT(va <= VM_MAX_KERNEL_ADDRESS, ("pmap_enter: toobig"));
6629 KASSERT(va < UPT_MIN_ADDRESS || va >= UPT_MAX_ADDRESS,
6630 ("pmap_enter: invalid to pmap_enter page table pages (va: 0x%lx)",
6632 KASSERT((m->oflags & VPO_UNMANAGED) != 0 || va < kmi.clean_sva ||
6633 va >= kmi.clean_eva,
6634 ("pmap_enter: managed mapping within the clean submap"));
6635 if ((m->oflags & VPO_UNMANAGED) == 0)
6636 VM_PAGE_OBJECT_BUSY_ASSERT(m);
6637 KASSERT((flags & PMAP_ENTER_RESERVED) == 0,
6638 ("pmap_enter: flags %u has reserved bits set", flags));
6639 pa = VM_PAGE_TO_PHYS(m);
6640 newpte = (pt_entry_t)(pa | PG_A | PG_V);
6641 if ((flags & VM_PROT_WRITE) != 0)
6643 if ((prot & VM_PROT_WRITE) != 0)
6645 KASSERT((newpte & (PG_M | PG_RW)) != PG_M,
6646 ("pmap_enter: flags includes VM_PROT_WRITE but prot doesn't"));
6647 if ((prot & VM_PROT_EXECUTE) == 0)
6649 if ((flags & PMAP_ENTER_WIRED) != 0)
6651 if (va < VM_MAXUSER_ADDRESS)
6653 if (pmap == kernel_pmap)
6655 newpte |= pmap_cache_bits(pmap, m->md.pat_mode, psind > 0);
6658 * Set modified bit gratuitously for writeable mappings if
6659 * the page is unmanaged. We do not want to take a fault
6660 * to do the dirty bit accounting for these mappings.
6662 if ((m->oflags & VPO_UNMANAGED) != 0) {
6663 if ((newpte & PG_RW) != 0)
6666 newpte |= PG_MANAGED;
6670 if ((flags & PMAP_ENTER_LARGEPAGE) != 0) {
6671 KASSERT((m->oflags & VPO_UNMANAGED) != 0,
6672 ("managed largepage va %#lx flags %#x", va, flags));
6673 rv = pmap_enter_largepage(pmap, va, newpte | PG_PS, flags,
6678 /* Assert the required virtual and physical alignment. */
6679 KASSERT((va & PDRMASK) == 0, ("pmap_enter: va unaligned"));
6680 KASSERT(m->psind > 0, ("pmap_enter: m->psind < psind"));
6681 rv = pmap_enter_pde(pmap, va, newpte | PG_PS, flags, m, &lock);
6687 * In the case that a page table page is not
6688 * resident, we are creating it here.
6691 pde = pmap_pde(pmap, va);
6692 if (pde != NULL && (*pde & PG_V) != 0 && ((*pde & PG_PS) == 0 ||
6693 pmap_demote_pde_locked(pmap, pde, va, &lock))) {
6694 pte = pmap_pde_to_pte(pde, va);
6695 if (va < VM_MAXUSER_ADDRESS && mpte == NULL) {
6696 mpte = PHYS_TO_VM_PAGE(*pde & PG_FRAME);
6699 } else if (va < VM_MAXUSER_ADDRESS) {
6701 * Here if the pte page isn't mapped, or if it has been
6704 nosleep = (flags & PMAP_ENTER_NOSLEEP) != 0;
6705 mpte = _pmap_allocpte(pmap, pmap_pde_pindex(va),
6706 nosleep ? NULL : &lock, va);
6707 if (mpte == NULL && nosleep) {
6708 rv = KERN_RESOURCE_SHORTAGE;
6713 panic("pmap_enter: invalid page directory va=%#lx", va);
6717 if (va < VM_MAXUSER_ADDRESS && pmap->pm_type == PT_X86)
6718 newpte |= pmap_pkru_get(pmap, va);
6721 * Is the specified virtual address already mapped?
6723 if ((origpte & PG_V) != 0) {
6725 * Wiring change, just update stats. We don't worry about
6726 * wiring PT pages as they remain resident as long as there
6727 * are valid mappings in them. Hence, if a user page is wired,
6728 * the PT page will be also.
6730 if ((newpte & PG_W) != 0 && (origpte & PG_W) == 0)
6731 pmap->pm_stats.wired_count++;
6732 else if ((newpte & PG_W) == 0 && (origpte & PG_W) != 0)
6733 pmap->pm_stats.wired_count--;
6736 * Remove the extra PT page reference.
6740 KASSERT(mpte->ref_count > 0,
6741 ("pmap_enter: missing reference to page table page,"
6746 * Has the physical page changed?
6748 opa = origpte & PG_FRAME;
6751 * No, might be a protection or wiring change.
6753 if ((origpte & PG_MANAGED) != 0 &&
6754 (newpte & PG_RW) != 0)
6755 vm_page_aflag_set(m, PGA_WRITEABLE);
6756 if (((origpte ^ newpte) & ~(PG_M | PG_A)) == 0)
6762 * The physical page has changed. Temporarily invalidate
6763 * the mapping. This ensures that all threads sharing the
6764 * pmap keep a consistent view of the mapping, which is
6765 * necessary for the correct handling of COW faults. It
6766 * also permits reuse of the old mapping's PV entry,
6767 * avoiding an allocation.
6769 * For consistency, handle unmanaged mappings the same way.
6771 origpte = pte_load_clear(pte);
6772 KASSERT((origpte & PG_FRAME) == opa,
6773 ("pmap_enter: unexpected pa update for %#lx", va));
6774 if ((origpte & PG_MANAGED) != 0) {
6775 om = PHYS_TO_VM_PAGE(opa);
6778 * The pmap lock is sufficient to synchronize with
6779 * concurrent calls to pmap_page_test_mappings() and
6780 * pmap_ts_referenced().
6782 if ((origpte & (PG_M | PG_RW)) == (PG_M | PG_RW))
6784 if ((origpte & PG_A) != 0) {
6785 pmap_invalidate_page(pmap, va);
6786 vm_page_aflag_set(om, PGA_REFERENCED);
6788 CHANGE_PV_LIST_LOCK_TO_PHYS(&lock, opa);
6789 pv = pmap_pvh_remove(&om->md, pmap, va);
6791 ("pmap_enter: no PV entry for %#lx", va));
6792 if ((newpte & PG_MANAGED) == 0)
6793 free_pv_entry(pmap, pv);
6794 if ((om->a.flags & PGA_WRITEABLE) != 0 &&
6795 TAILQ_EMPTY(&om->md.pv_list) &&
6796 ((om->flags & PG_FICTITIOUS) != 0 ||
6797 TAILQ_EMPTY(&pa_to_pvh(opa)->pv_list)))
6798 vm_page_aflag_clear(om, PGA_WRITEABLE);
6801 * Since this mapping is unmanaged, assume that PG_A
6804 pmap_invalidate_page(pmap, va);
6809 * Increment the counters.
6811 if ((newpte & PG_W) != 0)
6812 pmap->pm_stats.wired_count++;
6813 pmap_resident_count_inc(pmap, 1);
6817 * Enter on the PV list if part of our managed memory.
6819 if ((newpte & PG_MANAGED) != 0) {
6821 pv = get_pv_entry(pmap, &lock);
6824 CHANGE_PV_LIST_LOCK_TO_PHYS(&lock, pa);
6825 TAILQ_INSERT_TAIL(&m->md.pv_list, pv, pv_next);
6827 if ((newpte & PG_RW) != 0)
6828 vm_page_aflag_set(m, PGA_WRITEABLE);
6834 if ((origpte & PG_V) != 0) {
6836 origpte = pte_load_store(pte, newpte);
6837 KASSERT((origpte & PG_FRAME) == pa,
6838 ("pmap_enter: unexpected pa update for %#lx", va));
6839 if ((newpte & PG_M) == 0 && (origpte & (PG_M | PG_RW)) ==
6841 if ((origpte & PG_MANAGED) != 0)
6845 * Although the PTE may still have PG_RW set, TLB
6846 * invalidation may nonetheless be required because
6847 * the PTE no longer has PG_M set.
6849 } else if ((origpte & PG_NX) != 0 || (newpte & PG_NX) == 0) {
6851 * This PTE change does not require TLB invalidation.
6855 if ((origpte & PG_A) != 0)
6856 pmap_invalidate_page(pmap, va);
6858 pte_store(pte, newpte);
6862 #if VM_NRESERVLEVEL > 0
6864 * If both the page table page and the reservation are fully
6865 * populated, then attempt promotion.
6867 if ((mpte == NULL || mpte->ref_count == NPTEPG) &&
6868 pmap_ps_enabled(pmap) &&
6869 (m->flags & PG_FICTITIOUS) == 0 &&
6870 vm_reserv_level_iffullpop(m) == 0)
6871 pmap_promote_pde(pmap, pde, va, &lock);
6883 * Tries to create a read- and/or execute-only 2MB page mapping. Returns true
6884 * if successful. Returns false if (1) a page table page cannot be allocated
6885 * without sleeping, (2) a mapping already exists at the specified virtual
6886 * address, or (3) a PV entry cannot be allocated without reclaiming another
6890 pmap_enter_2mpage(pmap_t pmap, vm_offset_t va, vm_page_t m, vm_prot_t prot,
6891 struct rwlock **lockp)
6896 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
6897 PG_V = pmap_valid_bit(pmap);
6898 newpde = VM_PAGE_TO_PHYS(m) | pmap_cache_bits(pmap, m->md.pat_mode, 1) |
6900 if ((m->oflags & VPO_UNMANAGED) == 0)
6901 newpde |= PG_MANAGED;
6902 if ((prot & VM_PROT_EXECUTE) == 0)
6904 if (va < VM_MAXUSER_ADDRESS)
6906 return (pmap_enter_pde(pmap, va, newpde, PMAP_ENTER_NOSLEEP |
6907 PMAP_ENTER_NOREPLACE | PMAP_ENTER_NORECLAIM, NULL, lockp) ==
6912 * Returns true if every page table entry in the specified page table page is
6916 pmap_every_pte_zero(vm_paddr_t pa)
6918 pt_entry_t *pt_end, *pte;
6920 KASSERT((pa & PAGE_MASK) == 0, ("pa is misaligned"));
6921 pte = (pt_entry_t *)PHYS_TO_DMAP(pa);
6922 for (pt_end = pte + NPTEPG; pte < pt_end; pte++) {
6930 * Tries to create the specified 2MB page mapping. Returns KERN_SUCCESS if
6931 * the mapping was created, and either KERN_FAILURE or KERN_RESOURCE_SHORTAGE
6932 * otherwise. Returns KERN_FAILURE if PMAP_ENTER_NOREPLACE was specified and
6933 * a mapping already exists at the specified virtual address. Returns
6934 * KERN_RESOURCE_SHORTAGE if PMAP_ENTER_NOSLEEP was specified and a page table
6935 * page allocation failed. Returns KERN_RESOURCE_SHORTAGE if
6936 * PMAP_ENTER_NORECLAIM was specified and a PV entry allocation failed.
6938 * The parameter "m" is only used when creating a managed, writeable mapping.
6941 pmap_enter_pde(pmap_t pmap, vm_offset_t va, pd_entry_t newpde, u_int flags,
6942 vm_page_t m, struct rwlock **lockp)
6944 struct spglist free;
6945 pd_entry_t oldpde, *pde;
6946 pt_entry_t PG_G, PG_RW, PG_V;
6949 KASSERT(pmap == kernel_pmap || (newpde & PG_W) == 0,
6950 ("pmap_enter_pde: cannot create wired user mapping"));
6951 PG_G = pmap_global_bit(pmap);
6952 PG_RW = pmap_rw_bit(pmap);
6953 KASSERT((newpde & (pmap_modified_bit(pmap) | PG_RW)) != PG_RW,
6954 ("pmap_enter_pde: newpde is missing PG_M"));
6955 PG_V = pmap_valid_bit(pmap);
6956 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
6958 if (!pmap_allow_2m_x_page(pmap, pmap_pde_ept_executable(pmap,
6960 CTR2(KTR_PMAP, "pmap_enter_pde: 2m x blocked for va %#lx"
6961 " in pmap %p", va, pmap);
6962 return (KERN_FAILURE);
6964 if ((pde = pmap_alloc_pde(pmap, va, &pdpg, (flags &
6965 PMAP_ENTER_NOSLEEP) != 0 ? NULL : lockp)) == NULL) {
6966 CTR2(KTR_PMAP, "pmap_enter_pde: failure for va %#lx"
6967 " in pmap %p", va, pmap);
6968 return (KERN_RESOURCE_SHORTAGE);
6972 * If pkru is not same for the whole pde range, return failure
6973 * and let vm_fault() cope. Check after pde allocation, since
6976 if (!pmap_pkru_same(pmap, va, va + NBPDR)) {
6977 pmap_abort_ptp(pmap, va, pdpg);
6978 return (KERN_FAILURE);
6980 if (va < VM_MAXUSER_ADDRESS && pmap->pm_type == PT_X86) {
6981 newpde &= ~X86_PG_PKU_MASK;
6982 newpde |= pmap_pkru_get(pmap, va);
6986 * If there are existing mappings, either abort or remove them.
6989 if ((oldpde & PG_V) != 0) {
6990 KASSERT(pdpg == NULL || pdpg->ref_count > 1,
6991 ("pmap_enter_pde: pdpg's reference count is too low"));
6992 if ((flags & PMAP_ENTER_NOREPLACE) != 0 && (va <
6993 VM_MAXUSER_ADDRESS || (oldpde & PG_PS) != 0 ||
6994 !pmap_every_pte_zero(oldpde & PG_FRAME))) {
6997 CTR2(KTR_PMAP, "pmap_enter_pde: failure for va %#lx"
6998 " in pmap %p", va, pmap);
6999 return (KERN_FAILURE);
7001 /* Break the existing mapping(s). */
7003 if ((oldpde & PG_PS) != 0) {
7005 * The reference to the PD page that was acquired by
7006 * pmap_alloc_pde() ensures that it won't be freed.
7007 * However, if the PDE resulted from a promotion, then
7008 * a reserved PT page could be freed.
7010 (void)pmap_remove_pde(pmap, pde, va, &free, lockp);
7011 if ((oldpde & PG_G) == 0)
7012 pmap_invalidate_pde_page(pmap, va, oldpde);
7014 pmap_delayed_invl_start();
7015 if (pmap_remove_ptes(pmap, va, va + NBPDR, pde, &free,
7017 pmap_invalidate_all(pmap);
7018 pmap_delayed_invl_finish();
7020 if (va < VM_MAXUSER_ADDRESS) {
7021 vm_page_free_pages_toq(&free, true);
7022 KASSERT(*pde == 0, ("pmap_enter_pde: non-zero pde %p",
7025 KASSERT(SLIST_EMPTY(&free),
7026 ("pmap_enter_pde: freed kernel page table page"));
7029 * Both pmap_remove_pde() and pmap_remove_ptes() will
7030 * leave the kernel page table page zero filled.
7032 mt = PHYS_TO_VM_PAGE(*pde & PG_FRAME);
7033 if (pmap_insert_pt_page(pmap, mt, false))
7034 panic("pmap_enter_pde: trie insert failed");
7038 if ((newpde & PG_MANAGED) != 0) {
7040 * Abort this mapping if its PV entry could not be created.
7042 if (!pmap_pv_insert_pde(pmap, va, newpde, flags, lockp)) {
7044 pmap_abort_ptp(pmap, va, pdpg);
7045 CTR2(KTR_PMAP, "pmap_enter_pde: failure for va %#lx"
7046 " in pmap %p", va, pmap);
7047 return (KERN_RESOURCE_SHORTAGE);
7049 if ((newpde & PG_RW) != 0) {
7050 for (mt = m; mt < &m[NBPDR / PAGE_SIZE]; mt++)
7051 vm_page_aflag_set(mt, PGA_WRITEABLE);
7056 * Increment counters.
7058 if ((newpde & PG_W) != 0)
7059 pmap->pm_stats.wired_count += NBPDR / PAGE_SIZE;
7060 pmap_resident_count_inc(pmap, NBPDR / PAGE_SIZE);
7063 * Map the superpage. (This is not a promoted mapping; there will not
7064 * be any lingering 4KB page mappings in the TLB.)
7066 pde_store(pde, newpde);
7068 atomic_add_long(&pmap_pde_mappings, 1);
7069 CTR2(KTR_PMAP, "pmap_enter_pde: success for va %#lx in pmap %p",
7071 return (KERN_SUCCESS);
7075 * Maps a sequence of resident pages belonging to the same object.
7076 * The sequence begins with the given page m_start. This page is
7077 * mapped at the given virtual address start. Each subsequent page is
7078 * mapped at a virtual address that is offset from start by the same
7079 * amount as the page is offset from m_start within the object. The
7080 * last page in the sequence is the page with the largest offset from
7081 * m_start that can be mapped at a virtual address less than the given
7082 * virtual address end. Not every virtual page between start and end
7083 * is mapped; only those for which a resident page exists with the
7084 * corresponding offset from m_start are mapped.
7087 pmap_enter_object(pmap_t pmap, vm_offset_t start, vm_offset_t end,
7088 vm_page_t m_start, vm_prot_t prot)
7090 struct rwlock *lock;
7093 vm_pindex_t diff, psize;
7095 VM_OBJECT_ASSERT_LOCKED(m_start->object);
7097 psize = atop(end - start);
7102 while (m != NULL && (diff = m->pindex - m_start->pindex) < psize) {
7103 va = start + ptoa(diff);
7104 if ((va & PDRMASK) == 0 && va + NBPDR <= end &&
7105 m->psind == 1 && pmap_ps_enabled(pmap) &&
7106 pmap_allow_2m_x_page(pmap, (prot & VM_PROT_EXECUTE) != 0) &&
7107 pmap_enter_2mpage(pmap, va, m, prot, &lock))
7108 m = &m[NBPDR / PAGE_SIZE - 1];
7110 mpte = pmap_enter_quick_locked(pmap, va, m, prot,
7112 m = TAILQ_NEXT(m, listq);
7120 * this code makes some *MAJOR* assumptions:
7121 * 1. Current pmap & pmap exists.
7124 * 4. No page table pages.
7125 * but is *MUCH* faster than pmap_enter...
7129 pmap_enter_quick(pmap_t pmap, vm_offset_t va, vm_page_t m, vm_prot_t prot)
7131 struct rwlock *lock;
7135 (void)pmap_enter_quick_locked(pmap, va, m, prot, NULL, &lock);
7142 pmap_enter_quick_locked(pmap_t pmap, vm_offset_t va, vm_page_t m,
7143 vm_prot_t prot, vm_page_t mpte, struct rwlock **lockp)
7145 pt_entry_t newpte, *pte, PG_V;
7147 KASSERT(va < kmi.clean_sva || va >= kmi.clean_eva ||
7148 (m->oflags & VPO_UNMANAGED) != 0,
7149 ("pmap_enter_quick_locked: managed mapping within the clean submap"));
7150 PG_V = pmap_valid_bit(pmap);
7151 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
7154 * In the case that a page table page is not
7155 * resident, we are creating it here.
7157 if (va < VM_MAXUSER_ADDRESS) {
7158 vm_pindex_t ptepindex;
7162 * Calculate pagetable page index
7164 ptepindex = pmap_pde_pindex(va);
7165 if (mpte && (mpte->pindex == ptepindex)) {
7169 * Get the page directory entry
7171 ptepa = pmap_pde(pmap, va);
7174 * If the page table page is mapped, we just increment
7175 * the hold count, and activate it. Otherwise, we
7176 * attempt to allocate a page table page. If this
7177 * attempt fails, we don't retry. Instead, we give up.
7179 if (ptepa && (*ptepa & PG_V) != 0) {
7182 mpte = PHYS_TO_VM_PAGE(*ptepa & PG_FRAME);
7186 * Pass NULL instead of the PV list lock
7187 * pointer, because we don't intend to sleep.
7189 mpte = _pmap_allocpte(pmap, ptepindex, NULL,
7195 pte = (pt_entry_t *)PHYS_TO_DMAP(VM_PAGE_TO_PHYS(mpte));
7196 pte = &pte[pmap_pte_index(va)];
7208 * Enter on the PV list if part of our managed memory.
7210 if ((m->oflags & VPO_UNMANAGED) == 0 &&
7211 !pmap_try_insert_pv_entry(pmap, va, m, lockp)) {
7213 pmap_abort_ptp(pmap, va, mpte);
7218 * Increment counters
7220 pmap_resident_count_inc(pmap, 1);
7222 newpte = VM_PAGE_TO_PHYS(m) | PG_V |
7223 pmap_cache_bits(pmap, m->md.pat_mode, 0);
7224 if ((m->oflags & VPO_UNMANAGED) == 0)
7225 newpte |= PG_MANAGED;
7226 if ((prot & VM_PROT_EXECUTE) == 0)
7228 if (va < VM_MAXUSER_ADDRESS)
7229 newpte |= PG_U | pmap_pkru_get(pmap, va);
7230 pte_store(pte, newpte);
7235 * Make a temporary mapping for a physical address. This is only intended
7236 * to be used for panic dumps.
7239 pmap_kenter_temporary(vm_paddr_t pa, int i)
7243 va = (vm_offset_t)crashdumpmap + (i * PAGE_SIZE);
7244 pmap_kenter(va, pa);
7246 return ((void *)crashdumpmap);
7250 * This code maps large physical mmap regions into the
7251 * processor address space. Note that some shortcuts
7252 * are taken, but the code works.
7255 pmap_object_init_pt(pmap_t pmap, vm_offset_t addr, vm_object_t object,
7256 vm_pindex_t pindex, vm_size_t size)
7259 pt_entry_t PG_A, PG_M, PG_RW, PG_V;
7260 vm_paddr_t pa, ptepa;
7264 PG_A = pmap_accessed_bit(pmap);
7265 PG_M = pmap_modified_bit(pmap);
7266 PG_V = pmap_valid_bit(pmap);
7267 PG_RW = pmap_rw_bit(pmap);
7269 VM_OBJECT_ASSERT_WLOCKED(object);
7270 KASSERT(object->type == OBJT_DEVICE || object->type == OBJT_SG,
7271 ("pmap_object_init_pt: non-device object"));
7272 if ((addr & (NBPDR - 1)) == 0 && (size & (NBPDR - 1)) == 0) {
7273 if (!pmap_ps_enabled(pmap))
7275 if (!vm_object_populate(object, pindex, pindex + atop(size)))
7277 p = vm_page_lookup(object, pindex);
7278 KASSERT(p->valid == VM_PAGE_BITS_ALL,
7279 ("pmap_object_init_pt: invalid page %p", p));
7280 pat_mode = p->md.pat_mode;
7283 * Abort the mapping if the first page is not physically
7284 * aligned to a 2MB page boundary.
7286 ptepa = VM_PAGE_TO_PHYS(p);
7287 if (ptepa & (NBPDR - 1))
7291 * Skip the first page. Abort the mapping if the rest of
7292 * the pages are not physically contiguous or have differing
7293 * memory attributes.
7295 p = TAILQ_NEXT(p, listq);
7296 for (pa = ptepa + PAGE_SIZE; pa < ptepa + size;
7298 KASSERT(p->valid == VM_PAGE_BITS_ALL,
7299 ("pmap_object_init_pt: invalid page %p", p));
7300 if (pa != VM_PAGE_TO_PHYS(p) ||
7301 pat_mode != p->md.pat_mode)
7303 p = TAILQ_NEXT(p, listq);
7307 * Map using 2MB pages. Since "ptepa" is 2M aligned and
7308 * "size" is a multiple of 2M, adding the PAT setting to "pa"
7309 * will not affect the termination of this loop.
7312 for (pa = ptepa | pmap_cache_bits(pmap, pat_mode, 1);
7313 pa < ptepa + size; pa += NBPDR) {
7314 pde = pmap_alloc_pde(pmap, addr, &pdpg, NULL);
7317 * The creation of mappings below is only an
7318 * optimization. If a page directory page
7319 * cannot be allocated without blocking,
7320 * continue on to the next mapping rather than
7326 if ((*pde & PG_V) == 0) {
7327 pde_store(pde, pa | PG_PS | PG_M | PG_A |
7328 PG_U | PG_RW | PG_V);
7329 pmap_resident_count_inc(pmap, NBPDR / PAGE_SIZE);
7330 atomic_add_long(&pmap_pde_mappings, 1);
7332 /* Continue on if the PDE is already valid. */
7334 KASSERT(pdpg->ref_count > 0,
7335 ("pmap_object_init_pt: missing reference "
7336 "to page directory page, va: 0x%lx", addr));
7345 * Clear the wired attribute from the mappings for the specified range of
7346 * addresses in the given pmap. Every valid mapping within that range
7347 * must have the wired attribute set. In contrast, invalid mappings
7348 * cannot have the wired attribute set, so they are ignored.
7350 * The wired attribute of the page table entry is not a hardware
7351 * feature, so there is no need to invalidate any TLB entries.
7352 * Since pmap_demote_pde() for the wired entry must never fail,
7353 * pmap_delayed_invl_start()/finish() calls around the
7354 * function are not needed.
7357 pmap_unwire(pmap_t pmap, vm_offset_t sva, vm_offset_t eva)
7359 vm_offset_t va_next;
7360 pml4_entry_t *pml4e;
7363 pt_entry_t *pte, PG_V, PG_G;
7365 PG_V = pmap_valid_bit(pmap);
7366 PG_G = pmap_global_bit(pmap);
7368 for (; sva < eva; sva = va_next) {
7369 pml4e = pmap_pml4e(pmap, sva);
7370 if ((*pml4e & PG_V) == 0) {
7371 va_next = (sva + NBPML4) & ~PML4MASK;
7376 pdpe = pmap_pml4e_to_pdpe(pml4e, sva);
7377 va_next = (sva + NBPDP) & ~PDPMASK;
7380 if ((*pdpe & PG_V) == 0)
7382 KASSERT((*pdpe & PG_PS) == 0 || va_next <= eva,
7383 ("pmap_unwire of non-transient 1G page "
7384 "pdpe %#lx sva %#lx eva %#lx va_next %#lx",
7385 *pdpe, sva, eva, va_next));
7386 if ((*pdpe & PG_PS) != 0) {
7387 MPASS(pmap != kernel_pmap); /* XXXKIB */
7388 MPASS((*pdpe & (PG_MANAGED | PG_G)) == 0);
7389 atomic_clear_long(pdpe, PG_W);
7390 pmap->pm_stats.wired_count -= NBPDP / PAGE_SIZE;
7394 va_next = (sva + NBPDR) & ~PDRMASK;
7397 pde = pmap_pdpe_to_pde(pdpe, sva);
7398 if ((*pde & PG_V) == 0)
7400 if ((*pde & PG_PS) != 0) {
7401 if ((*pde & PG_W) == 0)
7402 panic("pmap_unwire: pde %#jx is missing PG_W",
7406 * Are we unwiring the entire large page? If not,
7407 * demote the mapping and fall through.
7409 if (sva + NBPDR == va_next && eva >= va_next) {
7410 atomic_clear_long(pde, PG_W);
7411 pmap->pm_stats.wired_count -= NBPDR /
7414 } else if (!pmap_demote_pde(pmap, pde, sva))
7415 panic("pmap_unwire: demotion failed");
7419 for (pte = pmap_pde_to_pte(pde, sva); sva != va_next; pte++,
7421 if ((*pte & PG_V) == 0)
7423 if ((*pte & PG_W) == 0)
7424 panic("pmap_unwire: pte %#jx is missing PG_W",
7428 * PG_W must be cleared atomically. Although the pmap
7429 * lock synchronizes access to PG_W, another processor
7430 * could be setting PG_M and/or PG_A concurrently.
7432 atomic_clear_long(pte, PG_W);
7433 pmap->pm_stats.wired_count--;
7440 * Copy the range specified by src_addr/len
7441 * from the source map to the range dst_addr/len
7442 * in the destination map.
7444 * This routine is only advisory and need not do anything.
7447 pmap_copy(pmap_t dst_pmap, pmap_t src_pmap, vm_offset_t dst_addr, vm_size_t len,
7448 vm_offset_t src_addr)
7450 struct rwlock *lock;
7451 pml4_entry_t *pml4e;
7453 pd_entry_t *pde, srcptepaddr;
7454 pt_entry_t *dst_pte, PG_A, PG_M, PG_V, ptetemp, *src_pte;
7455 vm_offset_t addr, end_addr, va_next;
7456 vm_page_t dst_pdpg, dstmpte, srcmpte;
7458 if (dst_addr != src_addr)
7461 if (dst_pmap->pm_type != src_pmap->pm_type)
7465 * EPT page table entries that require emulation of A/D bits are
7466 * sensitive to clearing the PG_A bit (aka EPT_PG_READ). Although
7467 * we clear PG_M (aka EPT_PG_WRITE) concomitantly, the PG_U bit
7468 * (aka EPT_PG_EXECUTE) could still be set. Since some EPT
7469 * implementations flag an EPT misconfiguration for exec-only
7470 * mappings we skip this function entirely for emulated pmaps.
7472 if (pmap_emulate_ad_bits(dst_pmap))
7475 end_addr = src_addr + len;
7477 if (dst_pmap < src_pmap) {
7478 PMAP_LOCK(dst_pmap);
7479 PMAP_LOCK(src_pmap);
7481 PMAP_LOCK(src_pmap);
7482 PMAP_LOCK(dst_pmap);
7485 PG_A = pmap_accessed_bit(dst_pmap);
7486 PG_M = pmap_modified_bit(dst_pmap);
7487 PG_V = pmap_valid_bit(dst_pmap);
7489 for (addr = src_addr; addr < end_addr; addr = va_next) {
7490 KASSERT(addr < UPT_MIN_ADDRESS,
7491 ("pmap_copy: invalid to pmap_copy page tables"));
7493 pml4e = pmap_pml4e(src_pmap, addr);
7494 if ((*pml4e & PG_V) == 0) {
7495 va_next = (addr + NBPML4) & ~PML4MASK;
7501 pdpe = pmap_pml4e_to_pdpe(pml4e, addr);
7502 if ((*pdpe & PG_V) == 0) {
7503 va_next = (addr + NBPDP) & ~PDPMASK;
7509 va_next = (addr + NBPDR) & ~PDRMASK;
7510 KASSERT((*pdpe & PG_PS) == 0 || va_next <= end_addr,
7511 ("pmap_copy of partial non-transient 1G page "
7512 "pdpe %#lx sva %#lx eva %#lx va_next %#lx",
7513 *pdpe, addr, end_addr, va_next));
7514 if ((*pdpe & PG_PS) != 0)
7519 pde = pmap_pdpe_to_pde(pdpe, addr);
7521 if (srcptepaddr == 0)
7524 if (srcptepaddr & PG_PS) {
7525 if ((addr & PDRMASK) != 0 || addr + NBPDR > end_addr)
7527 pde = pmap_alloc_pde(dst_pmap, addr, &dst_pdpg, NULL);
7530 if (*pde == 0 && ((srcptepaddr & PG_MANAGED) == 0 ||
7531 pmap_pv_insert_pde(dst_pmap, addr, srcptepaddr,
7532 PMAP_ENTER_NORECLAIM, &lock))) {
7533 *pde = srcptepaddr & ~PG_W;
7534 pmap_resident_count_inc(dst_pmap, NBPDR /
7536 atomic_add_long(&pmap_pde_mappings, 1);
7538 pmap_abort_ptp(dst_pmap, addr, dst_pdpg);
7542 srcptepaddr &= PG_FRAME;
7543 srcmpte = PHYS_TO_VM_PAGE(srcptepaddr);
7544 KASSERT(srcmpte->ref_count > 0,
7545 ("pmap_copy: source page table page is unused"));
7547 if (va_next > end_addr)
7550 src_pte = (pt_entry_t *)PHYS_TO_DMAP(srcptepaddr);
7551 src_pte = &src_pte[pmap_pte_index(addr)];
7553 for (; addr < va_next; addr += PAGE_SIZE, src_pte++) {
7557 * We only virtual copy managed pages.
7559 if ((ptetemp & PG_MANAGED) == 0)
7562 if (dstmpte != NULL) {
7563 KASSERT(dstmpte->pindex ==
7564 pmap_pde_pindex(addr),
7565 ("dstmpte pindex/addr mismatch"));
7566 dstmpte->ref_count++;
7567 } else if ((dstmpte = pmap_allocpte(dst_pmap, addr,
7570 dst_pte = (pt_entry_t *)
7571 PHYS_TO_DMAP(VM_PAGE_TO_PHYS(dstmpte));
7572 dst_pte = &dst_pte[pmap_pte_index(addr)];
7573 if (*dst_pte == 0 &&
7574 pmap_try_insert_pv_entry(dst_pmap, addr,
7575 PHYS_TO_VM_PAGE(ptetemp & PG_FRAME), &lock)) {
7577 * Clear the wired, modified, and accessed
7578 * (referenced) bits during the copy.
7580 *dst_pte = ptetemp & ~(PG_W | PG_M | PG_A);
7581 pmap_resident_count_inc(dst_pmap, 1);
7583 pmap_abort_ptp(dst_pmap, addr, dstmpte);
7586 /* Have we copied all of the valid mappings? */
7587 if (dstmpte->ref_count >= srcmpte->ref_count)
7594 PMAP_UNLOCK(src_pmap);
7595 PMAP_UNLOCK(dst_pmap);
7599 pmap_vmspace_copy(pmap_t dst_pmap, pmap_t src_pmap)
7603 if (dst_pmap->pm_type != src_pmap->pm_type ||
7604 dst_pmap->pm_type != PT_X86 ||
7605 (cpu_stdext_feature2 & CPUID_STDEXT2_PKU) == 0)
7608 if (dst_pmap < src_pmap) {
7609 PMAP_LOCK(dst_pmap);
7610 PMAP_LOCK(src_pmap);
7612 PMAP_LOCK(src_pmap);
7613 PMAP_LOCK(dst_pmap);
7615 error = pmap_pkru_copy(dst_pmap, src_pmap);
7616 /* Clean up partial copy on failure due to no memory. */
7617 if (error == ENOMEM)
7618 pmap_pkru_deassign_all(dst_pmap);
7619 PMAP_UNLOCK(src_pmap);
7620 PMAP_UNLOCK(dst_pmap);
7621 if (error != ENOMEM)
7629 * Zero the specified hardware page.
7632 pmap_zero_page(vm_page_t m)
7634 vm_offset_t va = PHYS_TO_DMAP(VM_PAGE_TO_PHYS(m));
7636 pagezero((void *)va);
7640 * Zero an an area within a single hardware page. off and size must not
7641 * cover an area beyond a single hardware page.
7644 pmap_zero_page_area(vm_page_t m, int off, int size)
7646 vm_offset_t va = PHYS_TO_DMAP(VM_PAGE_TO_PHYS(m));
7648 if (off == 0 && size == PAGE_SIZE)
7649 pagezero((void *)va);
7651 bzero((char *)va + off, size);
7655 * Copy 1 specified hardware page to another.
7658 pmap_copy_page(vm_page_t msrc, vm_page_t mdst)
7660 vm_offset_t src = PHYS_TO_DMAP(VM_PAGE_TO_PHYS(msrc));
7661 vm_offset_t dst = PHYS_TO_DMAP(VM_PAGE_TO_PHYS(mdst));
7663 pagecopy((void *)src, (void *)dst);
7666 int unmapped_buf_allowed = 1;
7669 pmap_copy_pages(vm_page_t ma[], vm_offset_t a_offset, vm_page_t mb[],
7670 vm_offset_t b_offset, int xfersize)
7674 vm_offset_t vaddr[2], a_pg_offset, b_pg_offset;
7678 while (xfersize > 0) {
7679 a_pg_offset = a_offset & PAGE_MASK;
7680 pages[0] = ma[a_offset >> PAGE_SHIFT];
7681 b_pg_offset = b_offset & PAGE_MASK;
7682 pages[1] = mb[b_offset >> PAGE_SHIFT];
7683 cnt = min(xfersize, PAGE_SIZE - a_pg_offset);
7684 cnt = min(cnt, PAGE_SIZE - b_pg_offset);
7685 mapped = pmap_map_io_transient(pages, vaddr, 2, FALSE);
7686 a_cp = (char *)vaddr[0] + a_pg_offset;
7687 b_cp = (char *)vaddr[1] + b_pg_offset;
7688 bcopy(a_cp, b_cp, cnt);
7689 if (__predict_false(mapped))
7690 pmap_unmap_io_transient(pages, vaddr, 2, FALSE);
7698 * Returns true if the pmap's pv is one of the first
7699 * 16 pvs linked to from this page. This count may
7700 * be changed upwards or downwards in the future; it
7701 * is only necessary that true be returned for a small
7702 * subset of pmaps for proper page aging.
7705 pmap_page_exists_quick(pmap_t pmap, vm_page_t m)
7707 struct md_page *pvh;
7708 struct rwlock *lock;
7713 KASSERT((m->oflags & VPO_UNMANAGED) == 0,
7714 ("pmap_page_exists_quick: page %p is not managed", m));
7716 lock = VM_PAGE_TO_PV_LIST_LOCK(m);
7718 TAILQ_FOREACH(pv, &m->md.pv_list, pv_next) {
7719 if (PV_PMAP(pv) == pmap) {
7727 if (!rv && loops < 16 && (m->flags & PG_FICTITIOUS) == 0) {
7728 pvh = pa_to_pvh(VM_PAGE_TO_PHYS(m));
7729 TAILQ_FOREACH(pv, &pvh->pv_list, pv_next) {
7730 if (PV_PMAP(pv) == pmap) {
7744 * pmap_page_wired_mappings:
7746 * Return the number of managed mappings to the given physical page
7750 pmap_page_wired_mappings(vm_page_t m)
7752 struct rwlock *lock;
7753 struct md_page *pvh;
7757 int count, md_gen, pvh_gen;
7759 if ((m->oflags & VPO_UNMANAGED) != 0)
7761 lock = VM_PAGE_TO_PV_LIST_LOCK(m);
7765 TAILQ_FOREACH(pv, &m->md.pv_list, pv_next) {
7767 if (!PMAP_TRYLOCK(pmap)) {
7768 md_gen = m->md.pv_gen;
7772 if (md_gen != m->md.pv_gen) {
7777 pte = pmap_pte(pmap, pv->pv_va);
7778 if ((*pte & PG_W) != 0)
7782 if ((m->flags & PG_FICTITIOUS) == 0) {
7783 pvh = pa_to_pvh(VM_PAGE_TO_PHYS(m));
7784 TAILQ_FOREACH(pv, &pvh->pv_list, pv_next) {
7786 if (!PMAP_TRYLOCK(pmap)) {
7787 md_gen = m->md.pv_gen;
7788 pvh_gen = pvh->pv_gen;
7792 if (md_gen != m->md.pv_gen ||
7793 pvh_gen != pvh->pv_gen) {
7798 pte = pmap_pde(pmap, pv->pv_va);
7799 if ((*pte & PG_W) != 0)
7809 * Returns TRUE if the given page is mapped individually or as part of
7810 * a 2mpage. Otherwise, returns FALSE.
7813 pmap_page_is_mapped(vm_page_t m)
7815 struct rwlock *lock;
7818 if ((m->oflags & VPO_UNMANAGED) != 0)
7820 lock = VM_PAGE_TO_PV_LIST_LOCK(m);
7822 rv = !TAILQ_EMPTY(&m->md.pv_list) ||
7823 ((m->flags & PG_FICTITIOUS) == 0 &&
7824 !TAILQ_EMPTY(&pa_to_pvh(VM_PAGE_TO_PHYS(m))->pv_list));
7830 * Destroy all managed, non-wired mappings in the given user-space
7831 * pmap. This pmap cannot be active on any processor besides the
7834 * This function cannot be applied to the kernel pmap. Moreover, it
7835 * is not intended for general use. It is only to be used during
7836 * process termination. Consequently, it can be implemented in ways
7837 * that make it faster than pmap_remove(). First, it can more quickly
7838 * destroy mappings by iterating over the pmap's collection of PV
7839 * entries, rather than searching the page table. Second, it doesn't
7840 * have to test and clear the page table entries atomically, because
7841 * no processor is currently accessing the user address space. In
7842 * particular, a page table entry's dirty bit won't change state once
7843 * this function starts.
7845 * Although this function destroys all of the pmap's managed,
7846 * non-wired mappings, it can delay and batch the invalidation of TLB
7847 * entries without calling pmap_delayed_invl_start() and
7848 * pmap_delayed_invl_finish(). Because the pmap is not active on
7849 * any other processor, none of these TLB entries will ever be used
7850 * before their eventual invalidation. Consequently, there is no need
7851 * for either pmap_remove_all() or pmap_remove_write() to wait for
7852 * that eventual TLB invalidation.
7855 pmap_remove_pages(pmap_t pmap)
7858 pt_entry_t *pte, tpte;
7859 pt_entry_t PG_M, PG_RW, PG_V;
7860 struct spglist free;
7861 struct pv_chunklist free_chunks[PMAP_MEMDOM];
7862 vm_page_t m, mpte, mt;
7864 struct md_page *pvh;
7865 struct pv_chunk *pc, *npc;
7866 struct rwlock *lock;
7868 uint64_t inuse, bitmask;
7869 int allfree, field, freed, i, idx;
7870 boolean_t superpage;
7874 * Assert that the given pmap is only active on the current
7875 * CPU. Unfortunately, we cannot block another CPU from
7876 * activating the pmap while this function is executing.
7878 KASSERT(pmap == PCPU_GET(curpmap), ("non-current pmap %p", pmap));
7881 cpuset_t other_cpus;
7883 other_cpus = all_cpus;
7885 CPU_CLR(PCPU_GET(cpuid), &other_cpus);
7886 CPU_AND(&other_cpus, &pmap->pm_active);
7888 KASSERT(CPU_EMPTY(&other_cpus), ("pmap active %p", pmap));
7893 PG_M = pmap_modified_bit(pmap);
7894 PG_V = pmap_valid_bit(pmap);
7895 PG_RW = pmap_rw_bit(pmap);
7897 for (i = 0; i < PMAP_MEMDOM; i++)
7898 TAILQ_INIT(&free_chunks[i]);
7901 TAILQ_FOREACH_SAFE(pc, &pmap->pm_pvchunk, pc_list, npc) {
7904 for (field = 0; field < _NPCM; field++) {
7905 inuse = ~pc->pc_map[field] & pc_freemask[field];
7906 while (inuse != 0) {
7908 bitmask = 1UL << bit;
7909 idx = field * 64 + bit;
7910 pv = &pc->pc_pventry[idx];
7913 pte = pmap_pdpe(pmap, pv->pv_va);
7915 pte = pmap_pdpe_to_pde(pte, pv->pv_va);
7917 if ((tpte & (PG_PS | PG_V)) == PG_V) {
7920 pte = (pt_entry_t *)PHYS_TO_DMAP(tpte &
7922 pte = &pte[pmap_pte_index(pv->pv_va)];
7926 * Keep track whether 'tpte' is a
7927 * superpage explicitly instead of
7928 * relying on PG_PS being set.
7930 * This is because PG_PS is numerically
7931 * identical to PG_PTE_PAT and thus a
7932 * regular page could be mistaken for
7938 if ((tpte & PG_V) == 0) {
7939 panic("bad pte va %lx pte %lx",
7944 * We cannot remove wired pages from a process' mapping at this time
7952 pa = tpte & PG_PS_FRAME;
7954 pa = tpte & PG_FRAME;
7956 m = PHYS_TO_VM_PAGE(pa);
7957 KASSERT(m->phys_addr == pa,
7958 ("vm_page_t %p phys_addr mismatch %016jx %016jx",
7959 m, (uintmax_t)m->phys_addr,
7962 KASSERT((m->flags & PG_FICTITIOUS) != 0 ||
7963 m < &vm_page_array[vm_page_array_size],
7964 ("pmap_remove_pages: bad tpte %#jx",
7970 * Update the vm_page_t clean/reference bits.
7972 if ((tpte & (PG_M | PG_RW)) == (PG_M | PG_RW)) {
7974 for (mt = m; mt < &m[NBPDR / PAGE_SIZE]; mt++)
7980 CHANGE_PV_LIST_LOCK_TO_VM_PAGE(&lock, m);
7983 pc->pc_map[field] |= bitmask;
7985 pmap_resident_count_dec(pmap, NBPDR / PAGE_SIZE);
7986 pvh = pa_to_pvh(tpte & PG_PS_FRAME);
7987 TAILQ_REMOVE(&pvh->pv_list, pv, pv_next);
7989 if (TAILQ_EMPTY(&pvh->pv_list)) {
7990 for (mt = m; mt < &m[NBPDR / PAGE_SIZE]; mt++)
7991 if ((mt->a.flags & PGA_WRITEABLE) != 0 &&
7992 TAILQ_EMPTY(&mt->md.pv_list))
7993 vm_page_aflag_clear(mt, PGA_WRITEABLE);
7995 mpte = pmap_remove_pt_page(pmap, pv->pv_va);
7997 KASSERT(mpte->valid == VM_PAGE_BITS_ALL,
7998 ("pmap_remove_pages: pte page not promoted"));
7999 pmap_resident_count_dec(pmap, 1);
8000 KASSERT(mpte->ref_count == NPTEPG,
8001 ("pmap_remove_pages: pte page reference count error"));
8002 mpte->ref_count = 0;
8003 pmap_add_delayed_free_list(mpte, &free, FALSE);
8006 pmap_resident_count_dec(pmap, 1);
8007 TAILQ_REMOVE(&m->md.pv_list, pv, pv_next);
8009 if ((m->a.flags & PGA_WRITEABLE) != 0 &&
8010 TAILQ_EMPTY(&m->md.pv_list) &&
8011 (m->flags & PG_FICTITIOUS) == 0) {
8012 pvh = pa_to_pvh(VM_PAGE_TO_PHYS(m));
8013 if (TAILQ_EMPTY(&pvh->pv_list))
8014 vm_page_aflag_clear(m, PGA_WRITEABLE);
8017 pmap_unuse_pt(pmap, pv->pv_va, ptepde, &free);
8021 PV_STAT(atomic_add_long(&pv_entry_frees, freed));
8022 PV_STAT(atomic_add_int(&pv_entry_spare, freed));
8023 PV_STAT(atomic_subtract_long(&pv_entry_count, freed));
8025 TAILQ_REMOVE(&pmap->pm_pvchunk, pc, pc_list);
8026 TAILQ_INSERT_TAIL(&free_chunks[pc_to_domain(pc)], pc, pc_list);
8031 pmap_invalidate_all(pmap);
8032 pmap_pkru_deassign_all(pmap);
8033 free_pv_chunk_batch((struct pv_chunklist *)&free_chunks);
8035 vm_page_free_pages_toq(&free, true);
8039 pmap_page_test_mappings(vm_page_t m, boolean_t accessed, boolean_t modified)
8041 struct rwlock *lock;
8043 struct md_page *pvh;
8044 pt_entry_t *pte, mask;
8045 pt_entry_t PG_A, PG_M, PG_RW, PG_V;
8047 int md_gen, pvh_gen;
8051 lock = VM_PAGE_TO_PV_LIST_LOCK(m);
8054 TAILQ_FOREACH(pv, &m->md.pv_list, pv_next) {
8056 if (!PMAP_TRYLOCK(pmap)) {
8057 md_gen = m->md.pv_gen;
8061 if (md_gen != m->md.pv_gen) {
8066 pte = pmap_pte(pmap, pv->pv_va);
8069 PG_M = pmap_modified_bit(pmap);
8070 PG_RW = pmap_rw_bit(pmap);
8071 mask |= PG_RW | PG_M;
8074 PG_A = pmap_accessed_bit(pmap);
8075 PG_V = pmap_valid_bit(pmap);
8076 mask |= PG_V | PG_A;
8078 rv = (*pte & mask) == mask;
8083 if ((m->flags & PG_FICTITIOUS) == 0) {
8084 pvh = pa_to_pvh(VM_PAGE_TO_PHYS(m));
8085 TAILQ_FOREACH(pv, &pvh->pv_list, pv_next) {
8087 if (!PMAP_TRYLOCK(pmap)) {
8088 md_gen = m->md.pv_gen;
8089 pvh_gen = pvh->pv_gen;
8093 if (md_gen != m->md.pv_gen ||
8094 pvh_gen != pvh->pv_gen) {
8099 pte = pmap_pde(pmap, pv->pv_va);
8102 PG_M = pmap_modified_bit(pmap);
8103 PG_RW = pmap_rw_bit(pmap);
8104 mask |= PG_RW | PG_M;
8107 PG_A = pmap_accessed_bit(pmap);
8108 PG_V = pmap_valid_bit(pmap);
8109 mask |= PG_V | PG_A;
8111 rv = (*pte & mask) == mask;
8125 * Return whether or not the specified physical page was modified
8126 * in any physical maps.
8129 pmap_is_modified(vm_page_t m)
8132 KASSERT((m->oflags & VPO_UNMANAGED) == 0,
8133 ("pmap_is_modified: page %p is not managed", m));
8136 * If the page is not busied then this check is racy.
8138 if (!pmap_page_is_write_mapped(m))
8140 return (pmap_page_test_mappings(m, FALSE, TRUE));
8144 * pmap_is_prefaultable:
8146 * Return whether or not the specified virtual address is eligible
8150 pmap_is_prefaultable(pmap_t pmap, vm_offset_t addr)
8153 pt_entry_t *pte, PG_V;
8156 PG_V = pmap_valid_bit(pmap);
8159 pde = pmap_pde(pmap, addr);
8160 if (pde != NULL && (*pde & (PG_PS | PG_V)) == PG_V) {
8161 pte = pmap_pde_to_pte(pde, addr);
8162 rv = (*pte & PG_V) == 0;
8169 * pmap_is_referenced:
8171 * Return whether or not the specified physical page was referenced
8172 * in any physical maps.
8175 pmap_is_referenced(vm_page_t m)
8178 KASSERT((m->oflags & VPO_UNMANAGED) == 0,
8179 ("pmap_is_referenced: page %p is not managed", m));
8180 return (pmap_page_test_mappings(m, TRUE, FALSE));
8184 * Clear the write and modified bits in each of the given page's mappings.
8187 pmap_remove_write(vm_page_t m)
8189 struct md_page *pvh;
8191 struct rwlock *lock;
8192 pv_entry_t next_pv, pv;
8194 pt_entry_t oldpte, *pte, PG_M, PG_RW;
8196 int pvh_gen, md_gen;
8198 KASSERT((m->oflags & VPO_UNMANAGED) == 0,
8199 ("pmap_remove_write: page %p is not managed", m));
8201 vm_page_assert_busied(m);
8202 if (!pmap_page_is_write_mapped(m))
8205 lock = VM_PAGE_TO_PV_LIST_LOCK(m);
8206 pvh = (m->flags & PG_FICTITIOUS) != 0 ? &pv_dummy :
8207 pa_to_pvh(VM_PAGE_TO_PHYS(m));
8210 TAILQ_FOREACH_SAFE(pv, &pvh->pv_list, pv_next, next_pv) {
8212 if (!PMAP_TRYLOCK(pmap)) {
8213 pvh_gen = pvh->pv_gen;
8217 if (pvh_gen != pvh->pv_gen) {
8223 PG_RW = pmap_rw_bit(pmap);
8225 pde = pmap_pde(pmap, va);
8226 if ((*pde & PG_RW) != 0)
8227 (void)pmap_demote_pde_locked(pmap, pde, va, &lock);
8228 KASSERT(lock == VM_PAGE_TO_PV_LIST_LOCK(m),
8229 ("inconsistent pv lock %p %p for page %p",
8230 lock, VM_PAGE_TO_PV_LIST_LOCK(m), m));
8233 TAILQ_FOREACH(pv, &m->md.pv_list, pv_next) {
8235 if (!PMAP_TRYLOCK(pmap)) {
8236 pvh_gen = pvh->pv_gen;
8237 md_gen = m->md.pv_gen;
8241 if (pvh_gen != pvh->pv_gen ||
8242 md_gen != m->md.pv_gen) {
8248 PG_M = pmap_modified_bit(pmap);
8249 PG_RW = pmap_rw_bit(pmap);
8250 pde = pmap_pde(pmap, pv->pv_va);
8251 KASSERT((*pde & PG_PS) == 0,
8252 ("pmap_remove_write: found a 2mpage in page %p's pv list",
8254 pte = pmap_pde_to_pte(pde, pv->pv_va);
8257 if (oldpte & PG_RW) {
8258 if (!atomic_cmpset_long(pte, oldpte, oldpte &
8261 if ((oldpte & PG_M) != 0)
8263 pmap_invalidate_page(pmap, pv->pv_va);
8268 vm_page_aflag_clear(m, PGA_WRITEABLE);
8269 pmap_delayed_invl_wait(m);
8272 static __inline boolean_t
8273 safe_to_clear_referenced(pmap_t pmap, pt_entry_t pte)
8276 if (!pmap_emulate_ad_bits(pmap))
8279 KASSERT(pmap->pm_type == PT_EPT, ("invalid pm_type %d", pmap->pm_type));
8282 * XWR = 010 or 110 will cause an unconditional EPT misconfiguration
8283 * so we don't let the referenced (aka EPT_PG_READ) bit to be cleared
8284 * if the EPT_PG_WRITE bit is set.
8286 if ((pte & EPT_PG_WRITE) != 0)
8290 * XWR = 100 is allowed only if the PMAP_SUPPORTS_EXEC_ONLY is set.
8292 if ((pte & EPT_PG_EXECUTE) == 0 ||
8293 ((pmap->pm_flags & PMAP_SUPPORTS_EXEC_ONLY) != 0))
8300 * pmap_ts_referenced:
8302 * Return a count of reference bits for a page, clearing those bits.
8303 * It is not necessary for every reference bit to be cleared, but it
8304 * is necessary that 0 only be returned when there are truly no
8305 * reference bits set.
8307 * As an optimization, update the page's dirty field if a modified bit is
8308 * found while counting reference bits. This opportunistic update can be
8309 * performed at low cost and can eliminate the need for some future calls
8310 * to pmap_is_modified(). However, since this function stops after
8311 * finding PMAP_TS_REFERENCED_MAX reference bits, it may not detect some
8312 * dirty pages. Those dirty pages will only be detected by a future call
8313 * to pmap_is_modified().
8315 * A DI block is not needed within this function, because
8316 * invalidations are performed before the PV list lock is
8320 pmap_ts_referenced(vm_page_t m)
8322 struct md_page *pvh;
8325 struct rwlock *lock;
8326 pd_entry_t oldpde, *pde;
8327 pt_entry_t *pte, PG_A, PG_M, PG_RW;
8330 int cleared, md_gen, not_cleared, pvh_gen;
8331 struct spglist free;
8334 KASSERT((m->oflags & VPO_UNMANAGED) == 0,
8335 ("pmap_ts_referenced: page %p is not managed", m));
8338 pa = VM_PAGE_TO_PHYS(m);
8339 lock = PHYS_TO_PV_LIST_LOCK(pa);
8340 pvh = (m->flags & PG_FICTITIOUS) != 0 ? &pv_dummy : pa_to_pvh(pa);
8344 if ((pvf = TAILQ_FIRST(&pvh->pv_list)) == NULL)
8345 goto small_mappings;
8351 if (!PMAP_TRYLOCK(pmap)) {
8352 pvh_gen = pvh->pv_gen;
8356 if (pvh_gen != pvh->pv_gen) {
8361 PG_A = pmap_accessed_bit(pmap);
8362 PG_M = pmap_modified_bit(pmap);
8363 PG_RW = pmap_rw_bit(pmap);
8365 pde = pmap_pde(pmap, pv->pv_va);
8367 if ((oldpde & (PG_M | PG_RW)) == (PG_M | PG_RW)) {
8369 * Although "oldpde" is mapping a 2MB page, because
8370 * this function is called at a 4KB page granularity,
8371 * we only update the 4KB page under test.
8375 if ((oldpde & PG_A) != 0) {
8377 * Since this reference bit is shared by 512 4KB
8378 * pages, it should not be cleared every time it is
8379 * tested. Apply a simple "hash" function on the
8380 * physical page number, the virtual superpage number,
8381 * and the pmap address to select one 4KB page out of
8382 * the 512 on which testing the reference bit will
8383 * result in clearing that reference bit. This
8384 * function is designed to avoid the selection of the
8385 * same 4KB page for every 2MB page mapping.
8387 * On demotion, a mapping that hasn't been referenced
8388 * is simply destroyed. To avoid the possibility of a
8389 * subsequent page fault on a demoted wired mapping,
8390 * always leave its reference bit set. Moreover,
8391 * since the superpage is wired, the current state of
8392 * its reference bit won't affect page replacement.
8394 if ((((pa >> PAGE_SHIFT) ^ (pv->pv_va >> PDRSHIFT) ^
8395 (uintptr_t)pmap) & (NPTEPG - 1)) == 0 &&
8396 (oldpde & PG_W) == 0) {
8397 if (safe_to_clear_referenced(pmap, oldpde)) {
8398 atomic_clear_long(pde, PG_A);
8399 pmap_invalidate_page(pmap, pv->pv_va);
8401 } else if (pmap_demote_pde_locked(pmap, pde,
8402 pv->pv_va, &lock)) {
8404 * Remove the mapping to a single page
8405 * so that a subsequent access may
8406 * repromote. Since the underlying
8407 * page table page is fully populated,
8408 * this removal never frees a page
8412 va += VM_PAGE_TO_PHYS(m) - (oldpde &
8414 pte = pmap_pde_to_pte(pde, va);
8415 pmap_remove_pte(pmap, pte, va, *pde,
8417 pmap_invalidate_page(pmap, va);
8423 * The superpage mapping was removed
8424 * entirely and therefore 'pv' is no
8432 KASSERT(lock == VM_PAGE_TO_PV_LIST_LOCK(m),
8433 ("inconsistent pv lock %p %p for page %p",
8434 lock, VM_PAGE_TO_PV_LIST_LOCK(m), m));
8439 /* Rotate the PV list if it has more than one entry. */
8440 if (pv != NULL && TAILQ_NEXT(pv, pv_next) != NULL) {
8441 TAILQ_REMOVE(&pvh->pv_list, pv, pv_next);
8442 TAILQ_INSERT_TAIL(&pvh->pv_list, pv, pv_next);
8445 if (cleared + not_cleared >= PMAP_TS_REFERENCED_MAX)
8447 } while ((pv = TAILQ_FIRST(&pvh->pv_list)) != pvf);
8449 if ((pvf = TAILQ_FIRST(&m->md.pv_list)) == NULL)
8456 if (!PMAP_TRYLOCK(pmap)) {
8457 pvh_gen = pvh->pv_gen;
8458 md_gen = m->md.pv_gen;
8462 if (pvh_gen != pvh->pv_gen || md_gen != m->md.pv_gen) {
8467 PG_A = pmap_accessed_bit(pmap);
8468 PG_M = pmap_modified_bit(pmap);
8469 PG_RW = pmap_rw_bit(pmap);
8470 pde = pmap_pde(pmap, pv->pv_va);
8471 KASSERT((*pde & PG_PS) == 0,
8472 ("pmap_ts_referenced: found a 2mpage in page %p's pv list",
8474 pte = pmap_pde_to_pte(pde, pv->pv_va);
8475 if ((*pte & (PG_M | PG_RW)) == (PG_M | PG_RW))
8477 if ((*pte & PG_A) != 0) {
8478 if (safe_to_clear_referenced(pmap, *pte)) {
8479 atomic_clear_long(pte, PG_A);
8480 pmap_invalidate_page(pmap, pv->pv_va);
8482 } else if ((*pte & PG_W) == 0) {
8484 * Wired pages cannot be paged out so
8485 * doing accessed bit emulation for
8486 * them is wasted effort. We do the
8487 * hard work for unwired pages only.
8489 pmap_remove_pte(pmap, pte, pv->pv_va,
8490 *pde, &free, &lock);
8491 pmap_invalidate_page(pmap, pv->pv_va);
8496 KASSERT(lock == VM_PAGE_TO_PV_LIST_LOCK(m),
8497 ("inconsistent pv lock %p %p for page %p",
8498 lock, VM_PAGE_TO_PV_LIST_LOCK(m), m));
8503 /* Rotate the PV list if it has more than one entry. */
8504 if (pv != NULL && TAILQ_NEXT(pv, pv_next) != NULL) {
8505 TAILQ_REMOVE(&m->md.pv_list, pv, pv_next);
8506 TAILQ_INSERT_TAIL(&m->md.pv_list, pv, pv_next);
8509 } while ((pv = TAILQ_FIRST(&m->md.pv_list)) != pvf && cleared +
8510 not_cleared < PMAP_TS_REFERENCED_MAX);
8513 vm_page_free_pages_toq(&free, true);
8514 return (cleared + not_cleared);
8518 * Apply the given advice to the specified range of addresses within the
8519 * given pmap. Depending on the advice, clear the referenced and/or
8520 * modified flags in each mapping and set the mapped page's dirty field.
8523 pmap_advise(pmap_t pmap, vm_offset_t sva, vm_offset_t eva, int advice)
8525 struct rwlock *lock;
8526 pml4_entry_t *pml4e;
8528 pd_entry_t oldpde, *pde;
8529 pt_entry_t *pte, PG_A, PG_G, PG_M, PG_RW, PG_V;
8530 vm_offset_t va, va_next;
8534 if (advice != MADV_DONTNEED && advice != MADV_FREE)
8538 * A/D bit emulation requires an alternate code path when clearing
8539 * the modified and accessed bits below. Since this function is
8540 * advisory in nature we skip it entirely for pmaps that require
8541 * A/D bit emulation.
8543 if (pmap_emulate_ad_bits(pmap))
8546 PG_A = pmap_accessed_bit(pmap);
8547 PG_G = pmap_global_bit(pmap);
8548 PG_M = pmap_modified_bit(pmap);
8549 PG_V = pmap_valid_bit(pmap);
8550 PG_RW = pmap_rw_bit(pmap);
8552 pmap_delayed_invl_start();
8554 for (; sva < eva; sva = va_next) {
8555 pml4e = pmap_pml4e(pmap, sva);
8556 if ((*pml4e & PG_V) == 0) {
8557 va_next = (sva + NBPML4) & ~PML4MASK;
8562 pdpe = pmap_pml4e_to_pdpe(pml4e, sva);
8563 if ((*pdpe & PG_V) == 0) {
8564 va_next = (sva + NBPDP) & ~PDPMASK;
8569 va_next = (sva + NBPDR) & ~PDRMASK;
8572 KASSERT((*pdpe & PG_PS) == 0 || va_next <= eva,
8573 ("pmap_advise of non-transient 1G page "
8574 "pdpe %#lx sva %#lx eva %#lx va_next %#lx",
8575 *pdpe, sva, eva, va_next));
8576 if ((*pdpe & PG_PS) != 0)
8578 pde = pmap_pdpe_to_pde(pdpe, sva);
8580 if ((oldpde & PG_V) == 0)
8582 else if ((oldpde & PG_PS) != 0) {
8583 if ((oldpde & PG_MANAGED) == 0)
8586 if (!pmap_demote_pde_locked(pmap, pde, sva, &lock)) {
8591 * The large page mapping was destroyed.
8597 * Unless the page mappings are wired, remove the
8598 * mapping to a single page so that a subsequent
8599 * access may repromote. Choosing the last page
8600 * within the address range [sva, min(va_next, eva))
8601 * generally results in more repromotions. Since the
8602 * underlying page table page is fully populated, this
8603 * removal never frees a page table page.
8605 if ((oldpde & PG_W) == 0) {
8611 ("pmap_advise: no address gap"));
8612 pte = pmap_pde_to_pte(pde, va);
8613 KASSERT((*pte & PG_V) != 0,
8614 ("pmap_advise: invalid PTE"));
8615 pmap_remove_pte(pmap, pte, va, *pde, NULL,
8625 for (pte = pmap_pde_to_pte(pde, sva); sva != va_next; pte++,
8627 if ((*pte & (PG_MANAGED | PG_V)) != (PG_MANAGED | PG_V))
8629 else if ((*pte & (PG_M | PG_RW)) == (PG_M | PG_RW)) {
8630 if (advice == MADV_DONTNEED) {
8632 * Future calls to pmap_is_modified()
8633 * can be avoided by making the page
8636 m = PHYS_TO_VM_PAGE(*pte & PG_FRAME);
8639 atomic_clear_long(pte, PG_M | PG_A);
8640 } else if ((*pte & PG_A) != 0)
8641 atomic_clear_long(pte, PG_A);
8645 if ((*pte & PG_G) != 0) {
8652 if (va != va_next) {
8653 pmap_invalidate_range(pmap, va, sva);
8658 pmap_invalidate_range(pmap, va, sva);
8661 pmap_invalidate_all(pmap);
8663 pmap_delayed_invl_finish();
8667 * Clear the modify bits on the specified physical page.
8670 pmap_clear_modify(vm_page_t m)
8672 struct md_page *pvh;
8674 pv_entry_t next_pv, pv;
8675 pd_entry_t oldpde, *pde;
8676 pt_entry_t *pte, PG_M, PG_RW;
8677 struct rwlock *lock;
8679 int md_gen, pvh_gen;
8681 KASSERT((m->oflags & VPO_UNMANAGED) == 0,
8682 ("pmap_clear_modify: page %p is not managed", m));
8683 vm_page_assert_busied(m);
8685 if (!pmap_page_is_write_mapped(m))
8687 pvh = (m->flags & PG_FICTITIOUS) != 0 ? &pv_dummy :
8688 pa_to_pvh(VM_PAGE_TO_PHYS(m));
8689 lock = VM_PAGE_TO_PV_LIST_LOCK(m);
8692 TAILQ_FOREACH_SAFE(pv, &pvh->pv_list, pv_next, next_pv) {
8694 if (!PMAP_TRYLOCK(pmap)) {
8695 pvh_gen = pvh->pv_gen;
8699 if (pvh_gen != pvh->pv_gen) {
8704 PG_M = pmap_modified_bit(pmap);
8705 PG_RW = pmap_rw_bit(pmap);
8707 pde = pmap_pde(pmap, va);
8709 /* If oldpde has PG_RW set, then it also has PG_M set. */
8710 if ((oldpde & PG_RW) != 0 &&
8711 pmap_demote_pde_locked(pmap, pde, va, &lock) &&
8712 (oldpde & PG_W) == 0) {
8714 * Write protect the mapping to a single page so that
8715 * a subsequent write access may repromote.
8717 va += VM_PAGE_TO_PHYS(m) - (oldpde & PG_PS_FRAME);
8718 pte = pmap_pde_to_pte(pde, va);
8719 atomic_clear_long(pte, PG_M | PG_RW);
8721 pmap_invalidate_page(pmap, va);
8725 TAILQ_FOREACH(pv, &m->md.pv_list, pv_next) {
8727 if (!PMAP_TRYLOCK(pmap)) {
8728 md_gen = m->md.pv_gen;
8729 pvh_gen = pvh->pv_gen;
8733 if (pvh_gen != pvh->pv_gen || md_gen != m->md.pv_gen) {
8738 PG_M = pmap_modified_bit(pmap);
8739 PG_RW = pmap_rw_bit(pmap);
8740 pde = pmap_pde(pmap, pv->pv_va);
8741 KASSERT((*pde & PG_PS) == 0, ("pmap_clear_modify: found"
8742 " a 2mpage in page %p's pv list", m));
8743 pte = pmap_pde_to_pte(pde, pv->pv_va);
8744 if ((*pte & (PG_M | PG_RW)) == (PG_M | PG_RW)) {
8745 atomic_clear_long(pte, PG_M);
8746 pmap_invalidate_page(pmap, pv->pv_va);
8754 * Miscellaneous support routines follow
8757 /* Adjust the properties for a leaf page table entry. */
8758 static __inline void
8759 pmap_pte_props(pt_entry_t *pte, u_long bits, u_long mask)
8763 opte = *(u_long *)pte;
8765 npte = opte & ~mask;
8767 } while (npte != opte && !atomic_fcmpset_long((u_long *)pte, &opte,
8772 * Map a set of physical memory pages into the kernel virtual
8773 * address space. Return a pointer to where it is mapped. This
8774 * routine is intended to be used for mapping device memory,
8778 pmap_mapdev_internal(vm_paddr_t pa, vm_size_t size, int mode, int flags)
8780 struct pmap_preinit_mapping *ppim;
8781 vm_offset_t va, offset;
8785 offset = pa & PAGE_MASK;
8786 size = round_page(offset + size);
8787 pa = trunc_page(pa);
8789 if (!pmap_initialized) {
8791 for (i = 0; i < PMAP_PREINIT_MAPPING_COUNT; i++) {
8792 ppim = pmap_preinit_mapping + i;
8793 if (ppim->va == 0) {
8797 ppim->va = virtual_avail;
8798 virtual_avail += size;
8804 panic("%s: too many preinit mappings", __func__);
8807 * If we have a preinit mapping, re-use it.
8809 for (i = 0; i < PMAP_PREINIT_MAPPING_COUNT; i++) {
8810 ppim = pmap_preinit_mapping + i;
8811 if (ppim->pa == pa && ppim->sz == size &&
8812 (ppim->mode == mode ||
8813 (flags & MAPDEV_SETATTR) == 0))
8814 return ((void *)(ppim->va + offset));
8817 * If the specified range of physical addresses fits within
8818 * the direct map window, use the direct map.
8820 if (pa < dmaplimit && pa + size <= dmaplimit) {
8821 va = PHYS_TO_DMAP(pa);
8822 if ((flags & MAPDEV_SETATTR) != 0) {
8823 PMAP_LOCK(kernel_pmap);
8824 i = pmap_change_props_locked(va, size,
8825 PROT_NONE, mode, flags);
8826 PMAP_UNLOCK(kernel_pmap);
8830 return ((void *)(va + offset));
8832 va = kva_alloc(size);
8834 panic("%s: Couldn't allocate KVA", __func__);
8836 for (tmpsize = 0; tmpsize < size; tmpsize += PAGE_SIZE)
8837 pmap_kenter_attr(va + tmpsize, pa + tmpsize, mode);
8838 pmap_invalidate_range(kernel_pmap, va, va + tmpsize);
8839 if ((flags & MAPDEV_FLUSHCACHE) != 0)
8840 pmap_invalidate_cache_range(va, va + tmpsize);
8841 return ((void *)(va + offset));
8845 pmap_mapdev_attr(vm_paddr_t pa, vm_size_t size, int mode)
8848 return (pmap_mapdev_internal(pa, size, mode, MAPDEV_FLUSHCACHE |
8853 pmap_mapdev(vm_paddr_t pa, vm_size_t size)
8856 return (pmap_mapdev_attr(pa, size, PAT_UNCACHEABLE));
8860 pmap_mapdev_pciecfg(vm_paddr_t pa, vm_size_t size)
8863 return (pmap_mapdev_internal(pa, size, PAT_UNCACHEABLE,
8868 pmap_mapbios(vm_paddr_t pa, vm_size_t size)
8871 return (pmap_mapdev_internal(pa, size, PAT_WRITE_BACK,
8872 MAPDEV_FLUSHCACHE));
8876 pmap_unmapdev(vm_offset_t va, vm_size_t size)
8878 struct pmap_preinit_mapping *ppim;
8882 /* If we gave a direct map region in pmap_mapdev, do nothing */
8883 if (va >= DMAP_MIN_ADDRESS && va < DMAP_MAX_ADDRESS)
8885 offset = va & PAGE_MASK;
8886 size = round_page(offset + size);
8887 va = trunc_page(va);
8888 for (i = 0; i < PMAP_PREINIT_MAPPING_COUNT; i++) {
8889 ppim = pmap_preinit_mapping + i;
8890 if (ppim->va == va && ppim->sz == size) {
8891 if (pmap_initialized)
8897 if (va + size == virtual_avail)
8902 if (pmap_initialized) {
8903 pmap_qremove(va, atop(size));
8909 * Tries to demote a 1GB page mapping.
8912 pmap_demote_pdpe(pmap_t pmap, pdp_entry_t *pdpe, vm_offset_t va)
8914 pdp_entry_t newpdpe, oldpdpe;
8915 pd_entry_t *firstpde, newpde, *pde;
8916 pt_entry_t PG_A, PG_M, PG_RW, PG_V;
8920 PG_A = pmap_accessed_bit(pmap);
8921 PG_M = pmap_modified_bit(pmap);
8922 PG_V = pmap_valid_bit(pmap);
8923 PG_RW = pmap_rw_bit(pmap);
8925 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
8927 KASSERT((oldpdpe & (PG_PS | PG_V)) == (PG_PS | PG_V),
8928 ("pmap_demote_pdpe: oldpdpe is missing PG_PS and/or PG_V"));
8929 if ((pdpg = vm_page_alloc(NULL, va >> PDPSHIFT, VM_ALLOC_INTERRUPT |
8930 VM_ALLOC_NOOBJ | VM_ALLOC_WIRED)) == NULL) {
8931 CTR2(KTR_PMAP, "pmap_demote_pdpe: failure for va %#lx"
8932 " in pmap %p", va, pmap);
8935 pdpgpa = VM_PAGE_TO_PHYS(pdpg);
8936 firstpde = (pd_entry_t *)PHYS_TO_DMAP(pdpgpa);
8937 newpdpe = pdpgpa | PG_M | PG_A | (oldpdpe & PG_U) | PG_RW | PG_V;
8938 KASSERT((oldpdpe & PG_A) != 0,
8939 ("pmap_demote_pdpe: oldpdpe is missing PG_A"));
8940 KASSERT((oldpdpe & (PG_M | PG_RW)) != PG_RW,
8941 ("pmap_demote_pdpe: oldpdpe is missing PG_M"));
8945 * Initialize the page directory page.
8947 for (pde = firstpde; pde < firstpde + NPDEPG; pde++) {
8953 * Demote the mapping.
8958 * Invalidate a stale recursive mapping of the page directory page.
8960 pmap_invalidate_page(pmap, (vm_offset_t)vtopde(va));
8962 pmap_pdpe_demotions++;
8963 CTR2(KTR_PMAP, "pmap_demote_pdpe: success for va %#lx"
8964 " in pmap %p", va, pmap);
8969 * Sets the memory attribute for the specified page.
8972 pmap_page_set_memattr(vm_page_t m, vm_memattr_t ma)
8975 m->md.pat_mode = ma;
8978 * If "m" is a normal page, update its direct mapping. This update
8979 * can be relied upon to perform any cache operations that are
8980 * required for data coherence.
8982 if ((m->flags & PG_FICTITIOUS) == 0 &&
8983 pmap_change_attr(PHYS_TO_DMAP(VM_PAGE_TO_PHYS(m)), PAGE_SIZE,
8985 panic("memory attribute change on the direct map failed");
8989 * Changes the specified virtual address range's memory type to that given by
8990 * the parameter "mode". The specified virtual address range must be
8991 * completely contained within either the direct map or the kernel map. If
8992 * the virtual address range is contained within the kernel map, then the
8993 * memory type for each of the corresponding ranges of the direct map is also
8994 * changed. (The corresponding ranges of the direct map are those ranges that
8995 * map the same physical pages as the specified virtual address range.) These
8996 * changes to the direct map are necessary because Intel describes the
8997 * behavior of their processors as "undefined" if two or more mappings to the
8998 * same physical page have different memory types.
9000 * Returns zero if the change completed successfully, and either EINVAL or
9001 * ENOMEM if the change failed. Specifically, EINVAL is returned if some part
9002 * of the virtual address range was not mapped, and ENOMEM is returned if
9003 * there was insufficient memory available to complete the change. In the
9004 * latter case, the memory type may have been changed on some part of the
9005 * virtual address range or the direct map.
9008 pmap_change_attr(vm_offset_t va, vm_size_t size, int mode)
9012 PMAP_LOCK(kernel_pmap);
9013 error = pmap_change_props_locked(va, size, PROT_NONE, mode,
9015 PMAP_UNLOCK(kernel_pmap);
9020 * Changes the specified virtual address range's protections to those
9021 * specified by "prot". Like pmap_change_attr(), protections for aliases
9022 * in the direct map are updated as well. Protections on aliasing mappings may
9023 * be a subset of the requested protections; for example, mappings in the direct
9024 * map are never executable.
9027 pmap_change_prot(vm_offset_t va, vm_size_t size, vm_prot_t prot)
9031 /* Only supported within the kernel map. */
9032 if (va < VM_MIN_KERNEL_ADDRESS)
9035 PMAP_LOCK(kernel_pmap);
9036 error = pmap_change_props_locked(va, size, prot, -1,
9037 MAPDEV_ASSERTVALID);
9038 PMAP_UNLOCK(kernel_pmap);
9043 pmap_change_props_locked(vm_offset_t va, vm_size_t size, vm_prot_t prot,
9044 int mode, int flags)
9046 vm_offset_t base, offset, tmpva;
9047 vm_paddr_t pa_start, pa_end, pa_end1;
9049 pd_entry_t *pde, pde_bits, pde_mask;
9050 pt_entry_t *pte, pte_bits, pte_mask;
9054 PMAP_LOCK_ASSERT(kernel_pmap, MA_OWNED);
9055 base = trunc_page(va);
9056 offset = va & PAGE_MASK;
9057 size = round_page(offset + size);
9060 * Only supported on kernel virtual addresses, including the direct
9061 * map but excluding the recursive map.
9063 if (base < DMAP_MIN_ADDRESS)
9067 * Construct our flag sets and masks. "bits" is the subset of
9068 * "mask" that will be set in each modified PTE.
9070 * Mappings in the direct map are never allowed to be executable.
9072 pde_bits = pte_bits = 0;
9073 pde_mask = pte_mask = 0;
9075 pde_bits |= pmap_cache_bits(kernel_pmap, mode, true);
9076 pde_mask |= X86_PG_PDE_CACHE;
9077 pte_bits |= pmap_cache_bits(kernel_pmap, mode, false);
9078 pte_mask |= X86_PG_PTE_CACHE;
9080 if (prot != VM_PROT_NONE) {
9081 if ((prot & VM_PROT_WRITE) != 0) {
9082 pde_bits |= X86_PG_RW;
9083 pte_bits |= X86_PG_RW;
9085 if ((prot & VM_PROT_EXECUTE) == 0 ||
9086 va < VM_MIN_KERNEL_ADDRESS) {
9090 pde_mask |= X86_PG_RW | pg_nx;
9091 pte_mask |= X86_PG_RW | pg_nx;
9095 * Pages that aren't mapped aren't supported. Also break down 2MB pages
9096 * into 4KB pages if required.
9098 for (tmpva = base; tmpva < base + size; ) {
9099 pdpe = pmap_pdpe(kernel_pmap, tmpva);
9100 if (pdpe == NULL || *pdpe == 0) {
9101 KASSERT((flags & MAPDEV_ASSERTVALID) == 0,
9102 ("%s: addr %#lx is not mapped", __func__, tmpva));
9105 if (*pdpe & PG_PS) {
9107 * If the current 1GB page already has the required
9108 * properties, then we need not demote this page. Just
9109 * increment tmpva to the next 1GB page frame.
9111 if ((*pdpe & pde_mask) == pde_bits) {
9112 tmpva = trunc_1gpage(tmpva) + NBPDP;
9117 * If the current offset aligns with a 1GB page frame
9118 * and there is at least 1GB left within the range, then
9119 * we need not break down this page into 2MB pages.
9121 if ((tmpva & PDPMASK) == 0 &&
9122 tmpva + PDPMASK < base + size) {
9126 if (!pmap_demote_pdpe(kernel_pmap, pdpe, tmpva))
9129 pde = pmap_pdpe_to_pde(pdpe, tmpva);
9131 KASSERT((flags & MAPDEV_ASSERTVALID) == 0,
9132 ("%s: addr %#lx is not mapped", __func__, tmpva));
9137 * If the current 2MB page already has the required
9138 * properties, then we need not demote this page. Just
9139 * increment tmpva to the next 2MB page frame.
9141 if ((*pde & pde_mask) == pde_bits) {
9142 tmpva = trunc_2mpage(tmpva) + NBPDR;
9147 * If the current offset aligns with a 2MB page frame
9148 * and there is at least 2MB left within the range, then
9149 * we need not break down this page into 4KB pages.
9151 if ((tmpva & PDRMASK) == 0 &&
9152 tmpva + PDRMASK < base + size) {
9156 if (!pmap_demote_pde(kernel_pmap, pde, tmpva))
9159 pte = pmap_pde_to_pte(pde, tmpva);
9161 KASSERT((flags & MAPDEV_ASSERTVALID) == 0,
9162 ("%s: addr %#lx is not mapped", __func__, tmpva));
9170 * Ok, all the pages exist, so run through them updating their
9171 * properties if required.
9174 pa_start = pa_end = 0;
9175 for (tmpva = base; tmpva < base + size; ) {
9176 pdpe = pmap_pdpe(kernel_pmap, tmpva);
9177 if (*pdpe & PG_PS) {
9178 if ((*pdpe & pde_mask) != pde_bits) {
9179 pmap_pte_props(pdpe, pde_bits, pde_mask);
9182 if (tmpva >= VM_MIN_KERNEL_ADDRESS &&
9183 (*pdpe & PG_PS_FRAME) < dmaplimit) {
9184 if (pa_start == pa_end) {
9185 /* Start physical address run. */
9186 pa_start = *pdpe & PG_PS_FRAME;
9187 pa_end = pa_start + NBPDP;
9188 } else if (pa_end == (*pdpe & PG_PS_FRAME))
9191 /* Run ended, update direct map. */
9192 error = pmap_change_props_locked(
9193 PHYS_TO_DMAP(pa_start),
9194 pa_end - pa_start, prot, mode,
9198 /* Start physical address run. */
9199 pa_start = *pdpe & PG_PS_FRAME;
9200 pa_end = pa_start + NBPDP;
9203 tmpva = trunc_1gpage(tmpva) + NBPDP;
9206 pde = pmap_pdpe_to_pde(pdpe, tmpva);
9208 if ((*pde & pde_mask) != pde_bits) {
9209 pmap_pte_props(pde, pde_bits, pde_mask);
9212 if (tmpva >= VM_MIN_KERNEL_ADDRESS &&
9213 (*pde & PG_PS_FRAME) < dmaplimit) {
9214 if (pa_start == pa_end) {
9215 /* Start physical address run. */
9216 pa_start = *pde & PG_PS_FRAME;
9217 pa_end = pa_start + NBPDR;
9218 } else if (pa_end == (*pde & PG_PS_FRAME))
9221 /* Run ended, update direct map. */
9222 error = pmap_change_props_locked(
9223 PHYS_TO_DMAP(pa_start),
9224 pa_end - pa_start, prot, mode,
9228 /* Start physical address run. */
9229 pa_start = *pde & PG_PS_FRAME;
9230 pa_end = pa_start + NBPDR;
9233 tmpva = trunc_2mpage(tmpva) + NBPDR;
9235 pte = pmap_pde_to_pte(pde, tmpva);
9236 if ((*pte & pte_mask) != pte_bits) {
9237 pmap_pte_props(pte, pte_bits, pte_mask);
9240 if (tmpva >= VM_MIN_KERNEL_ADDRESS &&
9241 (*pte & PG_FRAME) < dmaplimit) {
9242 if (pa_start == pa_end) {
9243 /* Start physical address run. */
9244 pa_start = *pte & PG_FRAME;
9245 pa_end = pa_start + PAGE_SIZE;
9246 } else if (pa_end == (*pte & PG_FRAME))
9247 pa_end += PAGE_SIZE;
9249 /* Run ended, update direct map. */
9250 error = pmap_change_props_locked(
9251 PHYS_TO_DMAP(pa_start),
9252 pa_end - pa_start, prot, mode,
9256 /* Start physical address run. */
9257 pa_start = *pte & PG_FRAME;
9258 pa_end = pa_start + PAGE_SIZE;
9264 if (error == 0 && pa_start != pa_end && pa_start < dmaplimit) {
9265 pa_end1 = MIN(pa_end, dmaplimit);
9266 if (pa_start != pa_end1)
9267 error = pmap_change_props_locked(PHYS_TO_DMAP(pa_start),
9268 pa_end1 - pa_start, prot, mode, flags);
9272 * Flush CPU caches if required to make sure any data isn't cached that
9273 * shouldn't be, etc.
9276 pmap_invalidate_range(kernel_pmap, base, tmpva);
9277 if ((flags & MAPDEV_FLUSHCACHE) != 0)
9278 pmap_invalidate_cache_range(base, tmpva);
9284 * Demotes any mapping within the direct map region that covers more than the
9285 * specified range of physical addresses. This range's size must be a power
9286 * of two and its starting address must be a multiple of its size. Since the
9287 * demotion does not change any attributes of the mapping, a TLB invalidation
9288 * is not mandatory. The caller may, however, request a TLB invalidation.
9291 pmap_demote_DMAP(vm_paddr_t base, vm_size_t len, boolean_t invalidate)
9300 KASSERT(powerof2(len), ("pmap_demote_DMAP: len is not a power of 2"));
9301 KASSERT((base & (len - 1)) == 0,
9302 ("pmap_demote_DMAP: base is not a multiple of len"));
9303 if (len < NBPDP && base < dmaplimit) {
9304 va = PHYS_TO_DMAP(base);
9306 PMAP_LOCK(kernel_pmap);
9307 pdpe = pmap_pdpe(kernel_pmap, va);
9308 if ((*pdpe & X86_PG_V) == 0)
9309 panic("pmap_demote_DMAP: invalid PDPE");
9310 if ((*pdpe & PG_PS) != 0) {
9311 if (!pmap_demote_pdpe(kernel_pmap, pdpe, va))
9312 panic("pmap_demote_DMAP: PDPE failed");
9316 pde = pmap_pdpe_to_pde(pdpe, va);
9317 if ((*pde & X86_PG_V) == 0)
9318 panic("pmap_demote_DMAP: invalid PDE");
9319 if ((*pde & PG_PS) != 0) {
9320 if (!pmap_demote_pde(kernel_pmap, pde, va))
9321 panic("pmap_demote_DMAP: PDE failed");
9325 if (changed && invalidate)
9326 pmap_invalidate_page(kernel_pmap, va);
9327 PMAP_UNLOCK(kernel_pmap);
9332 * Perform the pmap work for mincore(2). If the page is not both referenced and
9333 * modified by this pmap, returns its physical address so that the caller can
9334 * find other mappings.
9337 pmap_mincore(pmap_t pmap, vm_offset_t addr, vm_paddr_t *pap)
9341 pt_entry_t pte, PG_A, PG_M, PG_RW, PG_V;
9345 PG_A = pmap_accessed_bit(pmap);
9346 PG_M = pmap_modified_bit(pmap);
9347 PG_V = pmap_valid_bit(pmap);
9348 PG_RW = pmap_rw_bit(pmap);
9354 pdpe = pmap_pdpe(pmap, addr);
9355 if ((*pdpe & PG_V) != 0) {
9356 if ((*pdpe & PG_PS) != 0) {
9358 pa = ((pte & PG_PS_PDP_FRAME) | (addr & PDPMASK)) &
9360 val = MINCORE_PSIND(2);
9362 pdep = pmap_pde(pmap, addr);
9363 if (pdep != NULL && (*pdep & PG_V) != 0) {
9364 if ((*pdep & PG_PS) != 0) {
9366 /* Compute the physical address of the 4KB page. */
9367 pa = ((pte & PG_PS_FRAME) | (addr &
9368 PDRMASK)) & PG_FRAME;
9369 val = MINCORE_PSIND(1);
9371 pte = *pmap_pde_to_pte(pdep, addr);
9372 pa = pte & PG_FRAME;
9378 if ((pte & PG_V) != 0) {
9379 val |= MINCORE_INCORE;
9380 if ((pte & (PG_M | PG_RW)) == (PG_M | PG_RW))
9381 val |= MINCORE_MODIFIED | MINCORE_MODIFIED_OTHER;
9382 if ((pte & PG_A) != 0)
9383 val |= MINCORE_REFERENCED | MINCORE_REFERENCED_OTHER;
9385 if ((val & (MINCORE_MODIFIED_OTHER | MINCORE_REFERENCED_OTHER)) !=
9386 (MINCORE_MODIFIED_OTHER | MINCORE_REFERENCED_OTHER) &&
9387 (pte & (PG_MANAGED | PG_V)) == (PG_MANAGED | PG_V)) {
9395 pmap_pcid_alloc(pmap_t pmap, u_int cpuid)
9397 uint32_t gen, new_gen, pcid_next;
9399 CRITICAL_ASSERT(curthread);
9400 gen = PCPU_GET(pcid_gen);
9401 if (pmap->pm_pcids[cpuid].pm_pcid == PMAP_PCID_KERN)
9402 return (pti ? 0 : CR3_PCID_SAVE);
9403 if (pmap->pm_pcids[cpuid].pm_gen == gen)
9404 return (CR3_PCID_SAVE);
9405 pcid_next = PCPU_GET(pcid_next);
9406 KASSERT((!pti && pcid_next <= PMAP_PCID_OVERMAX) ||
9407 (pti && pcid_next <= PMAP_PCID_OVERMAX_KERN),
9408 ("cpu %d pcid_next %#x", cpuid, pcid_next));
9409 if ((!pti && pcid_next == PMAP_PCID_OVERMAX) ||
9410 (pti && pcid_next == PMAP_PCID_OVERMAX_KERN)) {
9414 PCPU_SET(pcid_gen, new_gen);
9415 pcid_next = PMAP_PCID_KERN + 1;
9419 pmap->pm_pcids[cpuid].pm_pcid = pcid_next;
9420 pmap->pm_pcids[cpuid].pm_gen = new_gen;
9421 PCPU_SET(pcid_next, pcid_next + 1);
9426 pmap_pcid_alloc_checked(pmap_t pmap, u_int cpuid)
9430 cached = pmap_pcid_alloc(pmap, cpuid);
9431 KASSERT(pmap->pm_pcids[cpuid].pm_pcid < PMAP_PCID_OVERMAX,
9432 ("pmap %p cpu %d pcid %#x", pmap, cpuid,
9433 pmap->pm_pcids[cpuid].pm_pcid));
9434 KASSERT(pmap->pm_pcids[cpuid].pm_pcid != PMAP_PCID_KERN ||
9435 pmap == kernel_pmap,
9436 ("non-kernel pmap pmap %p cpu %d pcid %#x",
9437 pmap, cpuid, pmap->pm_pcids[cpuid].pm_pcid));
9442 pmap_activate_sw_pti_post(struct thread *td, pmap_t pmap)
9445 PCPU_GET(tssp)->tss_rsp0 = pmap->pm_ucr3 != PMAP_NO_CR3 ?
9446 PCPU_GET(pti_rsp0) : (uintptr_t)td->td_md.md_stack_base;
9450 pmap_activate_sw_pcid_pti(struct thread *td, pmap_t pmap, u_int cpuid)
9453 uint64_t cached, cr3, kcr3, ucr3;
9455 KASSERT((read_rflags() & PSL_I) == 0,
9456 ("PCID needs interrupts disabled in pmap_activate_sw()"));
9458 /* See the comment in pmap_invalidate_page_pcid(). */
9459 if (PCPU_GET(ucr3_load_mask) != PMAP_UCR3_NOMASK) {
9460 PCPU_SET(ucr3_load_mask, PMAP_UCR3_NOMASK);
9461 old_pmap = PCPU_GET(curpmap);
9462 MPASS(old_pmap->pm_ucr3 != PMAP_NO_CR3);
9463 old_pmap->pm_pcids[cpuid].pm_gen = 0;
9466 cached = pmap_pcid_alloc_checked(pmap, cpuid);
9468 if ((cr3 & ~CR3_PCID_MASK) != pmap->pm_cr3)
9469 load_cr3(pmap->pm_cr3 | pmap->pm_pcids[cpuid].pm_pcid);
9470 PCPU_SET(curpmap, pmap);
9471 kcr3 = pmap->pm_cr3 | pmap->pm_pcids[cpuid].pm_pcid;
9472 ucr3 = pmap->pm_ucr3 | pmap->pm_pcids[cpuid].pm_pcid |
9475 if (!cached && pmap->pm_ucr3 != PMAP_NO_CR3)
9476 PCPU_SET(ucr3_load_mask, ~CR3_PCID_SAVE);
9478 PCPU_SET(kcr3, kcr3 | CR3_PCID_SAVE);
9479 PCPU_SET(ucr3, ucr3 | CR3_PCID_SAVE);
9481 PCPU_INC(pm_save_cnt);
9483 pmap_activate_sw_pti_post(td, pmap);
9487 pmap_activate_sw_pcid_nopti(struct thread *td __unused, pmap_t pmap,
9490 uint64_t cached, cr3;
9492 KASSERT((read_rflags() & PSL_I) == 0,
9493 ("PCID needs interrupts disabled in pmap_activate_sw()"));
9495 cached = pmap_pcid_alloc_checked(pmap, cpuid);
9497 if (!cached || (cr3 & ~CR3_PCID_MASK) != pmap->pm_cr3)
9498 load_cr3(pmap->pm_cr3 | pmap->pm_pcids[cpuid].pm_pcid |
9500 PCPU_SET(curpmap, pmap);
9502 PCPU_INC(pm_save_cnt);
9506 pmap_activate_sw_nopcid_nopti(struct thread *td __unused, pmap_t pmap,
9507 u_int cpuid __unused)
9510 load_cr3(pmap->pm_cr3);
9511 PCPU_SET(curpmap, pmap);
9515 pmap_activate_sw_nopcid_pti(struct thread *td, pmap_t pmap,
9516 u_int cpuid __unused)
9519 pmap_activate_sw_nopcid_nopti(td, pmap, cpuid);
9520 PCPU_SET(kcr3, pmap->pm_cr3);
9521 PCPU_SET(ucr3, pmap->pm_ucr3);
9522 pmap_activate_sw_pti_post(td, pmap);
9525 DEFINE_IFUNC(static, void, pmap_activate_sw_mode, (struct thread *, pmap_t,
9529 if (pmap_pcid_enabled && pti)
9530 return (pmap_activate_sw_pcid_pti);
9531 else if (pmap_pcid_enabled && !pti)
9532 return (pmap_activate_sw_pcid_nopti);
9533 else if (!pmap_pcid_enabled && pti)
9534 return (pmap_activate_sw_nopcid_pti);
9535 else /* if (!pmap_pcid_enabled && !pti) */
9536 return (pmap_activate_sw_nopcid_nopti);
9540 pmap_activate_sw(struct thread *td)
9542 pmap_t oldpmap, pmap;
9545 oldpmap = PCPU_GET(curpmap);
9546 pmap = vmspace_pmap(td->td_proc->p_vmspace);
9547 if (oldpmap == pmap) {
9548 if (cpu_vendor_id != CPU_VENDOR_INTEL)
9552 cpuid = PCPU_GET(cpuid);
9554 CPU_SET_ATOMIC(cpuid, &pmap->pm_active);
9556 CPU_SET(cpuid, &pmap->pm_active);
9558 pmap_activate_sw_mode(td, pmap, cpuid);
9560 CPU_CLR_ATOMIC(cpuid, &oldpmap->pm_active);
9562 CPU_CLR(cpuid, &oldpmap->pm_active);
9567 pmap_activate(struct thread *td)
9570 * invltlb_{invpcid,}_pcid_handler() is used to handle an
9571 * invalidate_all IPI, which checks for curpmap ==
9572 * smp_tlb_pmap. The below sequence of operations has a
9573 * window where %CR3 is loaded with the new pmap's PML4
9574 * address, but the curpmap value has not yet been updated.
9575 * This causes the invltlb IPI handler, which is called
9576 * between the updates, to execute as a NOP, which leaves
9577 * stale TLB entries.
9579 * Note that the most common use of pmap_activate_sw(), from
9580 * a context switch, is immune to this race, because
9581 * interrupts are disabled (while the thread lock is owned),
9582 * so the IPI is delayed until after curpmap is updated. Protect
9583 * other callers in a similar way, by disabling interrupts
9584 * around the %cr3 register reload and curpmap assignment.
9587 pmap_activate_sw(td);
9592 pmap_activate_boot(pmap_t pmap)
9598 * kernel_pmap must be never deactivated, and we ensure that
9599 * by never activating it at all.
9601 MPASS(pmap != kernel_pmap);
9603 cpuid = PCPU_GET(cpuid);
9605 CPU_SET_ATOMIC(cpuid, &pmap->pm_active);
9607 CPU_SET(cpuid, &pmap->pm_active);
9609 PCPU_SET(curpmap, pmap);
9611 kcr3 = pmap->pm_cr3;
9612 if (pmap_pcid_enabled)
9613 kcr3 |= pmap->pm_pcids[cpuid].pm_pcid | CR3_PCID_SAVE;
9617 PCPU_SET(kcr3, kcr3);
9618 PCPU_SET(ucr3, PMAP_NO_CR3);
9622 pmap_sync_icache(pmap_t pm, vm_offset_t va, vm_size_t sz)
9627 * Increase the starting virtual address of the given mapping if a
9628 * different alignment might result in more superpage mappings.
9631 pmap_align_superpage(vm_object_t object, vm_ooffset_t offset,
9632 vm_offset_t *addr, vm_size_t size)
9634 vm_offset_t superpage_offset;
9638 if (object != NULL && (object->flags & OBJ_COLORED) != 0)
9639 offset += ptoa(object->pg_color);
9640 superpage_offset = offset & PDRMASK;
9641 if (size - ((NBPDR - superpage_offset) & PDRMASK) < NBPDR ||
9642 (*addr & PDRMASK) == superpage_offset)
9644 if ((*addr & PDRMASK) < superpage_offset)
9645 *addr = (*addr & ~PDRMASK) + superpage_offset;
9647 *addr = ((*addr + PDRMASK) & ~PDRMASK) + superpage_offset;
9651 static unsigned long num_dirty_emulations;
9652 SYSCTL_ULONG(_vm_pmap, OID_AUTO, num_dirty_emulations, CTLFLAG_RW,
9653 &num_dirty_emulations, 0, NULL);
9655 static unsigned long num_accessed_emulations;
9656 SYSCTL_ULONG(_vm_pmap, OID_AUTO, num_accessed_emulations, CTLFLAG_RW,
9657 &num_accessed_emulations, 0, NULL);
9659 static unsigned long num_superpage_accessed_emulations;
9660 SYSCTL_ULONG(_vm_pmap, OID_AUTO, num_superpage_accessed_emulations, CTLFLAG_RW,
9661 &num_superpage_accessed_emulations, 0, NULL);
9663 static unsigned long ad_emulation_superpage_promotions;
9664 SYSCTL_ULONG(_vm_pmap, OID_AUTO, ad_emulation_superpage_promotions, CTLFLAG_RW,
9665 &ad_emulation_superpage_promotions, 0, NULL);
9666 #endif /* INVARIANTS */
9669 pmap_emulate_accessed_dirty(pmap_t pmap, vm_offset_t va, int ftype)
9672 struct rwlock *lock;
9673 #if VM_NRESERVLEVEL > 0
9677 pt_entry_t *pte, PG_A, PG_M, PG_RW, PG_V;
9679 KASSERT(ftype == VM_PROT_READ || ftype == VM_PROT_WRITE,
9680 ("pmap_emulate_accessed_dirty: invalid fault type %d", ftype));
9682 if (!pmap_emulate_ad_bits(pmap))
9685 PG_A = pmap_accessed_bit(pmap);
9686 PG_M = pmap_modified_bit(pmap);
9687 PG_V = pmap_valid_bit(pmap);
9688 PG_RW = pmap_rw_bit(pmap);
9694 pde = pmap_pde(pmap, va);
9695 if (pde == NULL || (*pde & PG_V) == 0)
9698 if ((*pde & PG_PS) != 0) {
9699 if (ftype == VM_PROT_READ) {
9701 atomic_add_long(&num_superpage_accessed_emulations, 1);
9709 pte = pmap_pde_to_pte(pde, va);
9710 if ((*pte & PG_V) == 0)
9713 if (ftype == VM_PROT_WRITE) {
9714 if ((*pte & PG_RW) == 0)
9717 * Set the modified and accessed bits simultaneously.
9719 * Intel EPT PTEs that do software emulation of A/D bits map
9720 * PG_A and PG_M to EPT_PG_READ and EPT_PG_WRITE respectively.
9721 * An EPT misconfiguration is triggered if the PTE is writable
9722 * but not readable (WR=10). This is avoided by setting PG_A
9723 * and PG_M simultaneously.
9725 *pte |= PG_M | PG_A;
9730 #if VM_NRESERVLEVEL > 0
9731 /* try to promote the mapping */
9732 if (va < VM_MAXUSER_ADDRESS)
9733 mpte = PHYS_TO_VM_PAGE(*pde & PG_FRAME);
9737 m = PHYS_TO_VM_PAGE(*pte & PG_FRAME);
9739 if ((mpte == NULL || mpte->ref_count == NPTEPG) &&
9740 pmap_ps_enabled(pmap) &&
9741 (m->flags & PG_FICTITIOUS) == 0 &&
9742 vm_reserv_level_iffullpop(m) == 0) {
9743 pmap_promote_pde(pmap, pde, va, &lock);
9745 atomic_add_long(&ad_emulation_superpage_promotions, 1);
9751 if (ftype == VM_PROT_WRITE)
9752 atomic_add_long(&num_dirty_emulations, 1);
9754 atomic_add_long(&num_accessed_emulations, 1);
9756 rv = 0; /* success */
9765 pmap_get_mapping(pmap_t pmap, vm_offset_t va, uint64_t *ptr, int *num)
9770 pt_entry_t *pte, PG_V;
9774 PG_V = pmap_valid_bit(pmap);
9777 pml4 = pmap_pml4e(pmap, va);
9779 if ((*pml4 & PG_V) == 0)
9782 pdp = pmap_pml4e_to_pdpe(pml4, va);
9784 if ((*pdp & PG_V) == 0 || (*pdp & PG_PS) != 0)
9787 pde = pmap_pdpe_to_pde(pdp, va);
9789 if ((*pde & PG_V) == 0 || (*pde & PG_PS) != 0)
9792 pte = pmap_pde_to_pte(pde, va);
9801 * Get the kernel virtual address of a set of physical pages. If there are
9802 * physical addresses not covered by the DMAP perform a transient mapping
9803 * that will be removed when calling pmap_unmap_io_transient.
9805 * \param page The pages the caller wishes to obtain the virtual
9806 * address on the kernel memory map.
9807 * \param vaddr On return contains the kernel virtual memory address
9808 * of the pages passed in the page parameter.
9809 * \param count Number of pages passed in.
9810 * \param can_fault TRUE if the thread using the mapped pages can take
9811 * page faults, FALSE otherwise.
9813 * \returns TRUE if the caller must call pmap_unmap_io_transient when
9814 * finished or FALSE otherwise.
9818 pmap_map_io_transient(vm_page_t page[], vm_offset_t vaddr[], int count,
9819 boolean_t can_fault)
9822 boolean_t needs_mapping;
9824 int cache_bits, error __unused, i;
9827 * Allocate any KVA space that we need, this is done in a separate
9828 * loop to prevent calling vmem_alloc while pinned.
9830 needs_mapping = FALSE;
9831 for (i = 0; i < count; i++) {
9832 paddr = VM_PAGE_TO_PHYS(page[i]);
9833 if (__predict_false(paddr >= dmaplimit)) {
9834 error = vmem_alloc(kernel_arena, PAGE_SIZE,
9835 M_BESTFIT | M_WAITOK, &vaddr[i]);
9836 KASSERT(error == 0, ("vmem_alloc failed: %d", error));
9837 needs_mapping = TRUE;
9839 vaddr[i] = PHYS_TO_DMAP(paddr);
9843 /* Exit early if everything is covered by the DMAP */
9848 * NB: The sequence of updating a page table followed by accesses
9849 * to the corresponding pages used in the !DMAP case is subject to
9850 * the situation described in the "AMD64 Architecture Programmer's
9851 * Manual Volume 2: System Programming" rev. 3.23, "7.3.1 Special
9852 * Coherency Considerations". Therefore, issuing the INVLPG right
9853 * after modifying the PTE bits is crucial.
9857 for (i = 0; i < count; i++) {
9858 paddr = VM_PAGE_TO_PHYS(page[i]);
9859 if (paddr >= dmaplimit) {
9862 * Slow path, since we can get page faults
9863 * while mappings are active don't pin the
9864 * thread to the CPU and instead add a global
9865 * mapping visible to all CPUs.
9867 pmap_qenter(vaddr[i], &page[i], 1);
9869 pte = vtopte(vaddr[i]);
9870 cache_bits = pmap_cache_bits(kernel_pmap,
9871 page[i]->md.pat_mode, 0);
9872 pte_store(pte, paddr | X86_PG_RW | X86_PG_V |
9879 return (needs_mapping);
9883 pmap_unmap_io_transient(vm_page_t page[], vm_offset_t vaddr[], int count,
9884 boolean_t can_fault)
9891 for (i = 0; i < count; i++) {
9892 paddr = VM_PAGE_TO_PHYS(page[i]);
9893 if (paddr >= dmaplimit) {
9895 pmap_qremove(vaddr[i], 1);
9896 vmem_free(kernel_arena, vaddr[i], PAGE_SIZE);
9902 pmap_quick_enter_page(vm_page_t m)
9906 paddr = VM_PAGE_TO_PHYS(m);
9907 if (paddr < dmaplimit)
9908 return (PHYS_TO_DMAP(paddr));
9909 mtx_lock_spin(&qframe_mtx);
9910 KASSERT(*vtopte(qframe) == 0, ("qframe busy"));
9911 pte_store(vtopte(qframe), paddr | X86_PG_RW | X86_PG_V | X86_PG_A |
9912 X86_PG_M | pmap_cache_bits(kernel_pmap, m->md.pat_mode, 0));
9917 pmap_quick_remove_page(vm_offset_t addr)
9922 pte_store(vtopte(qframe), 0);
9924 mtx_unlock_spin(&qframe_mtx);
9928 * Pdp pages from the large map are managed differently from either
9929 * kernel or user page table pages. They are permanently allocated at
9930 * initialization time, and their reference count is permanently set to
9931 * zero. The pml4 entries pointing to those pages are copied into
9932 * each allocated pmap.
9934 * In contrast, pd and pt pages are managed like user page table
9935 * pages. They are dynamically allocated, and their reference count
9936 * represents the number of valid entries within the page.
9939 pmap_large_map_getptp_unlocked(void)
9943 m = vm_page_alloc(NULL, 0, VM_ALLOC_NORMAL | VM_ALLOC_NOOBJ |
9945 if (m != NULL && (m->flags & PG_ZERO) == 0)
9951 pmap_large_map_getptp(void)
9955 PMAP_LOCK_ASSERT(kernel_pmap, MA_OWNED);
9956 m = pmap_large_map_getptp_unlocked();
9958 PMAP_UNLOCK(kernel_pmap);
9960 PMAP_LOCK(kernel_pmap);
9961 /* Callers retry. */
9966 static pdp_entry_t *
9967 pmap_large_map_pdpe(vm_offset_t va)
9969 vm_pindex_t pml4_idx;
9972 pml4_idx = pmap_pml4e_index(va);
9973 KASSERT(LMSPML4I <= pml4_idx && pml4_idx < LMSPML4I + lm_ents,
9974 ("pmap_large_map_pdpe: va %#jx out of range idx %#jx LMSPML4I "
9976 (uintmax_t)va, (uintmax_t)pml4_idx, LMSPML4I, lm_ents));
9977 KASSERT((kernel_pml4[pml4_idx] & X86_PG_V) != 0,
9978 ("pmap_large_map_pdpe: invalid pml4 for va %#jx idx %#jx "
9979 "LMSPML4I %#jx lm_ents %d",
9980 (uintmax_t)va, (uintmax_t)pml4_idx, LMSPML4I, lm_ents));
9981 mphys = kernel_pml4[pml4_idx] & PG_FRAME;
9982 return ((pdp_entry_t *)PHYS_TO_DMAP(mphys) + pmap_pdpe_index(va));
9986 pmap_large_map_pde(vm_offset_t va)
9993 pdpe = pmap_large_map_pdpe(va);
9995 m = pmap_large_map_getptp();
9998 mphys = VM_PAGE_TO_PHYS(m);
9999 *pdpe = mphys | X86_PG_A | X86_PG_RW | X86_PG_V | pg_nx;
10001 MPASS((*pdpe & X86_PG_PS) == 0);
10002 mphys = *pdpe & PG_FRAME;
10004 return ((pd_entry_t *)PHYS_TO_DMAP(mphys) + pmap_pde_index(va));
10007 static pt_entry_t *
10008 pmap_large_map_pte(vm_offset_t va)
10015 pde = pmap_large_map_pde(va);
10017 m = pmap_large_map_getptp();
10020 mphys = VM_PAGE_TO_PHYS(m);
10021 *pde = mphys | X86_PG_A | X86_PG_RW | X86_PG_V | pg_nx;
10022 PHYS_TO_VM_PAGE(DMAP_TO_PHYS((uintptr_t)pde))->ref_count++;
10024 MPASS((*pde & X86_PG_PS) == 0);
10025 mphys = *pde & PG_FRAME;
10027 return ((pt_entry_t *)PHYS_TO_DMAP(mphys) + pmap_pte_index(va));
10031 pmap_large_map_kextract(vm_offset_t va)
10033 pdp_entry_t *pdpe, pdp;
10034 pd_entry_t *pde, pd;
10035 pt_entry_t *pte, pt;
10037 KASSERT(PMAP_ADDRESS_IN_LARGEMAP(va),
10038 ("not largemap range %#lx", (u_long)va));
10039 pdpe = pmap_large_map_pdpe(va);
10041 KASSERT((pdp & X86_PG_V) != 0,
10042 ("invalid pdp va %#lx pdpe %#lx pdp %#lx", va,
10043 (u_long)pdpe, pdp));
10044 if ((pdp & X86_PG_PS) != 0) {
10045 KASSERT((amd_feature & AMDID_PAGE1GB) != 0,
10046 ("no 1G pages, va %#lx pdpe %#lx pdp %#lx", va,
10047 (u_long)pdpe, pdp));
10048 return ((pdp & PG_PS_PDP_FRAME) | (va & PDPMASK));
10050 pde = pmap_pdpe_to_pde(pdpe, va);
10052 KASSERT((pd & X86_PG_V) != 0,
10053 ("invalid pd va %#lx pde %#lx pd %#lx", va, (u_long)pde, pd));
10054 if ((pd & X86_PG_PS) != 0)
10055 return ((pd & PG_PS_FRAME) | (va & PDRMASK));
10056 pte = pmap_pde_to_pte(pde, va);
10058 KASSERT((pt & X86_PG_V) != 0,
10059 ("invalid pte va %#lx pte %#lx pt %#lx", va, (u_long)pte, pt));
10060 return ((pt & PG_FRAME) | (va & PAGE_MASK));
10064 pmap_large_map_getva(vm_size_t len, vm_offset_t align, vm_offset_t phase,
10065 vmem_addr_t *vmem_res)
10069 * Large mappings are all but static. Consequently, there
10070 * is no point in waiting for an earlier allocation to be
10073 return (vmem_xalloc(large_vmem, len, align, phase, 0, VMEM_ADDR_MIN,
10074 VMEM_ADDR_MAX, M_NOWAIT | M_BESTFIT, vmem_res));
10078 pmap_large_map(vm_paddr_t spa, vm_size_t len, void **addr,
10079 vm_memattr_t mattr)
10084 vm_offset_t va, inc;
10085 vmem_addr_t vmem_res;
10089 if (len == 0 || spa + len < spa)
10092 /* See if DMAP can serve. */
10093 if (spa + len <= dmaplimit) {
10094 va = PHYS_TO_DMAP(spa);
10095 *addr = (void *)va;
10096 return (pmap_change_attr(va, len, mattr));
10100 * No, allocate KVA. Fit the address with best possible
10101 * alignment for superpages. Fall back to worse align if
10105 if ((amd_feature & AMDID_PAGE1GB) != 0 && rounddown2(spa + len,
10106 NBPDP) >= roundup2(spa, NBPDP) + NBPDP)
10107 error = pmap_large_map_getva(len, NBPDP, spa & PDPMASK,
10109 if (error != 0 && rounddown2(spa + len, NBPDR) >= roundup2(spa,
10111 error = pmap_large_map_getva(len, NBPDR, spa & PDRMASK,
10114 error = pmap_large_map_getva(len, PAGE_SIZE, 0, &vmem_res);
10119 * Fill pagetable. PG_M is not pre-set, we scan modified bits
10120 * in the pagetable to minimize flushing. No need to
10121 * invalidate TLB, since we only update invalid entries.
10123 PMAP_LOCK(kernel_pmap);
10124 for (pa = spa, va = vmem_res; len > 0; pa += inc, va += inc,
10126 if ((amd_feature & AMDID_PAGE1GB) != 0 && len >= NBPDP &&
10127 (pa & PDPMASK) == 0 && (va & PDPMASK) == 0) {
10128 pdpe = pmap_large_map_pdpe(va);
10130 *pdpe = pa | pg_g | X86_PG_PS | X86_PG_RW |
10131 X86_PG_V | X86_PG_A | pg_nx |
10132 pmap_cache_bits(kernel_pmap, mattr, TRUE);
10134 } else if (len >= NBPDR && (pa & PDRMASK) == 0 &&
10135 (va & PDRMASK) == 0) {
10136 pde = pmap_large_map_pde(va);
10138 *pde = pa | pg_g | X86_PG_PS | X86_PG_RW |
10139 X86_PG_V | X86_PG_A | pg_nx |
10140 pmap_cache_bits(kernel_pmap, mattr, TRUE);
10141 PHYS_TO_VM_PAGE(DMAP_TO_PHYS((uintptr_t)pde))->
10145 pte = pmap_large_map_pte(va);
10147 *pte = pa | pg_g | X86_PG_RW | X86_PG_V |
10148 X86_PG_A | pg_nx | pmap_cache_bits(kernel_pmap,
10150 PHYS_TO_VM_PAGE(DMAP_TO_PHYS((uintptr_t)pte))->
10155 PMAP_UNLOCK(kernel_pmap);
10158 *addr = (void *)vmem_res;
10163 pmap_large_unmap(void *svaa, vm_size_t len)
10165 vm_offset_t sva, va;
10167 pdp_entry_t *pdpe, pdp;
10168 pd_entry_t *pde, pd;
10171 struct spglist spgf;
10173 sva = (vm_offset_t)svaa;
10174 if (len == 0 || sva + len < sva || (sva >= DMAP_MIN_ADDRESS &&
10175 sva + len <= DMAP_MIN_ADDRESS + dmaplimit))
10179 KASSERT(PMAP_ADDRESS_IN_LARGEMAP(sva) &&
10180 PMAP_ADDRESS_IN_LARGEMAP(sva + len - 1),
10181 ("not largemap range %#lx %#lx", (u_long)svaa, (u_long)svaa + len));
10182 PMAP_LOCK(kernel_pmap);
10183 for (va = sva; va < sva + len; va += inc) {
10184 pdpe = pmap_large_map_pdpe(va);
10186 KASSERT((pdp & X86_PG_V) != 0,
10187 ("invalid pdp va %#lx pdpe %#lx pdp %#lx", va,
10188 (u_long)pdpe, pdp));
10189 if ((pdp & X86_PG_PS) != 0) {
10190 KASSERT((amd_feature & AMDID_PAGE1GB) != 0,
10191 ("no 1G pages, va %#lx pdpe %#lx pdp %#lx", va,
10192 (u_long)pdpe, pdp));
10193 KASSERT((va & PDPMASK) == 0,
10194 ("PDPMASK bit set, va %#lx pdpe %#lx pdp %#lx", va,
10195 (u_long)pdpe, pdp));
10196 KASSERT(va + NBPDP <= sva + len,
10197 ("unmap covers partial 1GB page, sva %#lx va %#lx "
10198 "pdpe %#lx pdp %#lx len %#lx", sva, va,
10199 (u_long)pdpe, pdp, len));
10204 pde = pmap_pdpe_to_pde(pdpe, va);
10206 KASSERT((pd & X86_PG_V) != 0,
10207 ("invalid pd va %#lx pde %#lx pd %#lx", va,
10209 if ((pd & X86_PG_PS) != 0) {
10210 KASSERT((va & PDRMASK) == 0,
10211 ("PDRMASK bit set, va %#lx pde %#lx pd %#lx", va,
10213 KASSERT(va + NBPDR <= sva + len,
10214 ("unmap covers partial 2MB page, sva %#lx va %#lx "
10215 "pde %#lx pd %#lx len %#lx", sva, va, (u_long)pde,
10219 m = PHYS_TO_VM_PAGE(DMAP_TO_PHYS((vm_offset_t)pde));
10221 if (m->ref_count == 0) {
10223 SLIST_INSERT_HEAD(&spgf, m, plinks.s.ss);
10227 pte = pmap_pde_to_pte(pde, va);
10228 KASSERT((*pte & X86_PG_V) != 0,
10229 ("invalid pte va %#lx pte %#lx pt %#lx", va,
10230 (u_long)pte, *pte));
10233 m = PHYS_TO_VM_PAGE(DMAP_TO_PHYS((vm_offset_t)pte));
10235 if (m->ref_count == 0) {
10237 SLIST_INSERT_HEAD(&spgf, m, plinks.s.ss);
10238 m = PHYS_TO_VM_PAGE(DMAP_TO_PHYS((vm_offset_t)pde));
10240 if (m->ref_count == 0) {
10242 SLIST_INSERT_HEAD(&spgf, m, plinks.s.ss);
10246 pmap_invalidate_range(kernel_pmap, sva, sva + len);
10247 PMAP_UNLOCK(kernel_pmap);
10248 vm_page_free_pages_toq(&spgf, false);
10249 vmem_free(large_vmem, sva, len);
10253 pmap_large_map_wb_fence_mfence(void)
10260 pmap_large_map_wb_fence_atomic(void)
10263 atomic_thread_fence_seq_cst();
10267 pmap_large_map_wb_fence_nop(void)
10271 DEFINE_IFUNC(static, void, pmap_large_map_wb_fence, (void))
10274 if (cpu_vendor_id != CPU_VENDOR_INTEL)
10275 return (pmap_large_map_wb_fence_mfence);
10276 else if ((cpu_stdext_feature & (CPUID_STDEXT_CLWB |
10277 CPUID_STDEXT_CLFLUSHOPT)) == 0)
10278 return (pmap_large_map_wb_fence_atomic);
10280 /* clflush is strongly enough ordered */
10281 return (pmap_large_map_wb_fence_nop);
10285 pmap_large_map_flush_range_clwb(vm_offset_t va, vm_size_t len)
10288 for (; len > 0; len -= cpu_clflush_line_size,
10289 va += cpu_clflush_line_size)
10294 pmap_large_map_flush_range_clflushopt(vm_offset_t va, vm_size_t len)
10297 for (; len > 0; len -= cpu_clflush_line_size,
10298 va += cpu_clflush_line_size)
10303 pmap_large_map_flush_range_clflush(vm_offset_t va, vm_size_t len)
10306 for (; len > 0; len -= cpu_clflush_line_size,
10307 va += cpu_clflush_line_size)
10312 pmap_large_map_flush_range_nop(vm_offset_t sva __unused, vm_size_t len __unused)
10316 DEFINE_IFUNC(static, void, pmap_large_map_flush_range, (vm_offset_t, vm_size_t))
10319 if ((cpu_stdext_feature & CPUID_STDEXT_CLWB) != 0)
10320 return (pmap_large_map_flush_range_clwb);
10321 else if ((cpu_stdext_feature & CPUID_STDEXT_CLFLUSHOPT) != 0)
10322 return (pmap_large_map_flush_range_clflushopt);
10323 else if ((cpu_feature & CPUID_CLFSH) != 0)
10324 return (pmap_large_map_flush_range_clflush);
10326 return (pmap_large_map_flush_range_nop);
10330 pmap_large_map_wb_large(vm_offset_t sva, vm_offset_t eva)
10332 volatile u_long *pe;
10338 for (va = sva; va < eva; va += inc) {
10340 if ((amd_feature & AMDID_PAGE1GB) != 0) {
10341 pe = (volatile u_long *)pmap_large_map_pdpe(va);
10343 if ((p & X86_PG_PS) != 0)
10347 pe = (volatile u_long *)pmap_large_map_pde(va);
10349 if ((p & X86_PG_PS) != 0)
10353 pe = (volatile u_long *)pmap_large_map_pte(va);
10357 seen_other = false;
10359 if ((p & X86_PG_AVAIL1) != 0) {
10361 * Spin-wait for the end of a parallel
10368 * If we saw other write-back
10369 * occuring, we cannot rely on PG_M to
10370 * indicate state of the cache. The
10371 * PG_M bit is cleared before the
10372 * flush to avoid ignoring new writes,
10373 * and writes which are relevant for
10374 * us might happen after.
10380 if ((p & X86_PG_M) != 0 || seen_other) {
10381 if (!atomic_fcmpset_long(pe, &p,
10382 (p & ~X86_PG_M) | X86_PG_AVAIL1))
10384 * If we saw PG_M without
10385 * PG_AVAIL1, and then on the
10386 * next attempt we do not
10387 * observe either PG_M or
10388 * PG_AVAIL1, the other
10389 * write-back started after us
10390 * and finished before us. We
10391 * can rely on it doing our
10395 pmap_large_map_flush_range(va, inc);
10396 atomic_clear_long(pe, X86_PG_AVAIL1);
10405 * Write-back cache lines for the given address range.
10407 * Must be called only on the range or sub-range returned from
10408 * pmap_large_map(). Must not be called on the coalesced ranges.
10410 * Does nothing on CPUs without CLWB, CLFLUSHOPT, or CLFLUSH
10411 * instructions support.
10414 pmap_large_map_wb(void *svap, vm_size_t len)
10416 vm_offset_t eva, sva;
10418 sva = (vm_offset_t)svap;
10420 pmap_large_map_wb_fence();
10421 if (sva >= DMAP_MIN_ADDRESS && eva <= DMAP_MIN_ADDRESS + dmaplimit) {
10422 pmap_large_map_flush_range(sva, len);
10424 KASSERT(sva >= LARGEMAP_MIN_ADDRESS &&
10425 eva <= LARGEMAP_MIN_ADDRESS + lm_ents * NBPML4,
10426 ("pmap_large_map_wb: not largemap %#lx %#lx", sva, len));
10427 pmap_large_map_wb_large(sva, eva);
10429 pmap_large_map_wb_fence();
10433 pmap_pti_alloc_page(void)
10437 VM_OBJECT_ASSERT_WLOCKED(pti_obj);
10438 m = vm_page_grab(pti_obj, pti_pg_idx++, VM_ALLOC_NOBUSY |
10439 VM_ALLOC_WIRED | VM_ALLOC_ZERO);
10444 pmap_pti_free_page(vm_page_t m)
10447 KASSERT(m->ref_count > 0, ("page %p not referenced", m));
10448 if (!vm_page_unwire_noq(m))
10450 vm_page_free_zero(m);
10455 pmap_pti_init(void)
10464 pti_obj = vm_pager_allocate(OBJT_PHYS, NULL, 0, VM_PROT_ALL, 0, NULL);
10465 VM_OBJECT_WLOCK(pti_obj);
10466 pml4_pg = pmap_pti_alloc_page();
10467 pti_pml4 = (pml4_entry_t *)PHYS_TO_DMAP(VM_PAGE_TO_PHYS(pml4_pg));
10468 for (va = VM_MIN_KERNEL_ADDRESS; va <= VM_MAX_KERNEL_ADDRESS &&
10469 va >= VM_MIN_KERNEL_ADDRESS && va > NBPML4; va += NBPML4) {
10470 pdpe = pmap_pti_pdpe(va);
10471 pmap_pti_wire_pte(pdpe);
10473 pmap_pti_add_kva_locked((vm_offset_t)&__pcpu[0],
10474 (vm_offset_t)&__pcpu[0] + sizeof(__pcpu[0]) * MAXCPU, false);
10475 pmap_pti_add_kva_locked((vm_offset_t)idt, (vm_offset_t)idt +
10476 sizeof(struct gate_descriptor) * NIDT, false);
10478 /* Doublefault stack IST 1 */
10479 va = __pcpu[i].pc_common_tss.tss_ist1;
10480 pmap_pti_add_kva_locked(va - PAGE_SIZE, va, false);
10481 /* NMI stack IST 2 */
10482 va = __pcpu[i].pc_common_tss.tss_ist2 + sizeof(struct nmi_pcpu);
10483 pmap_pti_add_kva_locked(va - PAGE_SIZE, va, false);
10484 /* MC# stack IST 3 */
10485 va = __pcpu[i].pc_common_tss.tss_ist3 +
10486 sizeof(struct nmi_pcpu);
10487 pmap_pti_add_kva_locked(va - PAGE_SIZE, va, false);
10488 /* DB# stack IST 4 */
10489 va = __pcpu[i].pc_common_tss.tss_ist4 + sizeof(struct nmi_pcpu);
10490 pmap_pti_add_kva_locked(va - PAGE_SIZE, va, false);
10492 pmap_pti_add_kva_locked((vm_offset_t)kernphys + KERNBASE,
10493 (vm_offset_t)etext, true);
10494 pti_finalized = true;
10495 VM_OBJECT_WUNLOCK(pti_obj);
10497 SYSINIT(pmap_pti, SI_SUB_CPU + 1, SI_ORDER_ANY, pmap_pti_init, NULL);
10499 static pdp_entry_t *
10500 pmap_pti_pdpe(vm_offset_t va)
10502 pml4_entry_t *pml4e;
10505 vm_pindex_t pml4_idx;
10508 VM_OBJECT_ASSERT_WLOCKED(pti_obj);
10510 pml4_idx = pmap_pml4e_index(va);
10511 pml4e = &pti_pml4[pml4_idx];
10515 panic("pml4 alloc after finalization\n");
10516 m = pmap_pti_alloc_page();
10518 pmap_pti_free_page(m);
10519 mphys = *pml4e & ~PAGE_MASK;
10521 mphys = VM_PAGE_TO_PHYS(m);
10522 *pml4e = mphys | X86_PG_RW | X86_PG_V;
10525 mphys = *pml4e & ~PAGE_MASK;
10527 pdpe = (pdp_entry_t *)PHYS_TO_DMAP(mphys) + pmap_pdpe_index(va);
10532 pmap_pti_wire_pte(void *pte)
10536 VM_OBJECT_ASSERT_WLOCKED(pti_obj);
10537 m = PHYS_TO_VM_PAGE(DMAP_TO_PHYS((uintptr_t)pte));
10542 pmap_pti_unwire_pde(void *pde, bool only_ref)
10546 VM_OBJECT_ASSERT_WLOCKED(pti_obj);
10547 m = PHYS_TO_VM_PAGE(DMAP_TO_PHYS((uintptr_t)pde));
10548 MPASS(m->ref_count > 0);
10549 MPASS(only_ref || m->ref_count > 1);
10550 pmap_pti_free_page(m);
10554 pmap_pti_unwire_pte(void *pte, vm_offset_t va)
10559 VM_OBJECT_ASSERT_WLOCKED(pti_obj);
10560 m = PHYS_TO_VM_PAGE(DMAP_TO_PHYS((uintptr_t)pte));
10561 MPASS(m->ref_count > 0);
10562 if (pmap_pti_free_page(m)) {
10563 pde = pmap_pti_pde(va);
10564 MPASS((*pde & (X86_PG_PS | X86_PG_V)) == X86_PG_V);
10566 pmap_pti_unwire_pde(pde, false);
10570 static pd_entry_t *
10571 pmap_pti_pde(vm_offset_t va)
10576 vm_pindex_t pd_idx;
10579 VM_OBJECT_ASSERT_WLOCKED(pti_obj);
10581 pdpe = pmap_pti_pdpe(va);
10583 m = pmap_pti_alloc_page();
10585 pmap_pti_free_page(m);
10586 MPASS((*pdpe & X86_PG_PS) == 0);
10587 mphys = *pdpe & ~PAGE_MASK;
10589 mphys = VM_PAGE_TO_PHYS(m);
10590 *pdpe = mphys | X86_PG_RW | X86_PG_V;
10593 MPASS((*pdpe & X86_PG_PS) == 0);
10594 mphys = *pdpe & ~PAGE_MASK;
10597 pde = (pd_entry_t *)PHYS_TO_DMAP(mphys);
10598 pd_idx = pmap_pde_index(va);
10603 static pt_entry_t *
10604 pmap_pti_pte(vm_offset_t va, bool *unwire_pde)
10611 VM_OBJECT_ASSERT_WLOCKED(pti_obj);
10613 pde = pmap_pti_pde(va);
10614 if (unwire_pde != NULL) {
10615 *unwire_pde = true;
10616 pmap_pti_wire_pte(pde);
10619 m = pmap_pti_alloc_page();
10621 pmap_pti_free_page(m);
10622 MPASS((*pde & X86_PG_PS) == 0);
10623 mphys = *pde & ~(PAGE_MASK | pg_nx);
10625 mphys = VM_PAGE_TO_PHYS(m);
10626 *pde = mphys | X86_PG_RW | X86_PG_V;
10627 if (unwire_pde != NULL)
10628 *unwire_pde = false;
10631 MPASS((*pde & X86_PG_PS) == 0);
10632 mphys = *pde & ~(PAGE_MASK | pg_nx);
10635 pte = (pt_entry_t *)PHYS_TO_DMAP(mphys);
10636 pte += pmap_pte_index(va);
10642 pmap_pti_add_kva_locked(vm_offset_t sva, vm_offset_t eva, bool exec)
10646 pt_entry_t *pte, ptev;
10649 VM_OBJECT_ASSERT_WLOCKED(pti_obj);
10651 sva = trunc_page(sva);
10652 MPASS(sva > VM_MAXUSER_ADDRESS);
10653 eva = round_page(eva);
10655 for (; sva < eva; sva += PAGE_SIZE) {
10656 pte = pmap_pti_pte(sva, &unwire_pde);
10657 pa = pmap_kextract(sva);
10658 ptev = pa | X86_PG_RW | X86_PG_V | X86_PG_A | X86_PG_G |
10659 (exec ? 0 : pg_nx) | pmap_cache_bits(kernel_pmap,
10660 VM_MEMATTR_DEFAULT, FALSE);
10662 pte_store(pte, ptev);
10663 pmap_pti_wire_pte(pte);
10665 KASSERT(!pti_finalized,
10666 ("pti overlap after fin %#lx %#lx %#lx",
10668 KASSERT(*pte == ptev,
10669 ("pti non-identical pte after fin %#lx %#lx %#lx",
10673 pde = pmap_pti_pde(sva);
10674 pmap_pti_unwire_pde(pde, true);
10680 pmap_pti_add_kva(vm_offset_t sva, vm_offset_t eva, bool exec)
10685 VM_OBJECT_WLOCK(pti_obj);
10686 pmap_pti_add_kva_locked(sva, eva, exec);
10687 VM_OBJECT_WUNLOCK(pti_obj);
10691 pmap_pti_remove_kva(vm_offset_t sva, vm_offset_t eva)
10698 sva = rounddown2(sva, PAGE_SIZE);
10699 MPASS(sva > VM_MAXUSER_ADDRESS);
10700 eva = roundup2(eva, PAGE_SIZE);
10702 VM_OBJECT_WLOCK(pti_obj);
10703 for (va = sva; va < eva; va += PAGE_SIZE) {
10704 pte = pmap_pti_pte(va, NULL);
10705 KASSERT((*pte & X86_PG_V) != 0,
10706 ("invalid pte va %#lx pte %#lx pt %#lx", va,
10707 (u_long)pte, *pte));
10709 pmap_pti_unwire_pte(pte, va);
10711 pmap_invalidate_range(kernel_pmap, sva, eva);
10712 VM_OBJECT_WUNLOCK(pti_obj);
10716 pkru_dup_range(void *ctx __unused, void *data)
10718 struct pmap_pkru_range *node, *new_node;
10720 new_node = uma_zalloc(pmap_pkru_ranges_zone, M_NOWAIT);
10721 if (new_node == NULL)
10724 memcpy(new_node, node, sizeof(*node));
10729 pkru_free_range(void *ctx __unused, void *node)
10732 uma_zfree(pmap_pkru_ranges_zone, node);
10736 pmap_pkru_assign(pmap_t pmap, vm_offset_t sva, vm_offset_t eva, u_int keyidx,
10739 struct pmap_pkru_range *ppr;
10742 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
10743 MPASS(pmap->pm_type == PT_X86);
10744 MPASS((cpu_stdext_feature2 & CPUID_STDEXT2_PKU) != 0);
10745 if ((flags & AMD64_PKRU_EXCL) != 0 &&
10746 !rangeset_check_empty(&pmap->pm_pkru, sva, eva))
10748 ppr = uma_zalloc(pmap_pkru_ranges_zone, M_NOWAIT);
10751 ppr->pkru_keyidx = keyidx;
10752 ppr->pkru_flags = flags & AMD64_PKRU_PERSIST;
10753 error = rangeset_insert(&pmap->pm_pkru, sva, eva, ppr);
10755 uma_zfree(pmap_pkru_ranges_zone, ppr);
10760 pmap_pkru_deassign(pmap_t pmap, vm_offset_t sva, vm_offset_t eva)
10763 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
10764 MPASS(pmap->pm_type == PT_X86);
10765 MPASS((cpu_stdext_feature2 & CPUID_STDEXT2_PKU) != 0);
10766 return (rangeset_remove(&pmap->pm_pkru, sva, eva));
10770 pmap_pkru_deassign_all(pmap_t pmap)
10773 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
10774 if (pmap->pm_type == PT_X86 &&
10775 (cpu_stdext_feature2 & CPUID_STDEXT2_PKU) != 0)
10776 rangeset_remove_all(&pmap->pm_pkru);
10780 pmap_pkru_same(pmap_t pmap, vm_offset_t sva, vm_offset_t eva)
10782 struct pmap_pkru_range *ppr, *prev_ppr;
10785 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
10786 if (pmap->pm_type != PT_X86 ||
10787 (cpu_stdext_feature2 & CPUID_STDEXT2_PKU) == 0 ||
10788 sva >= VM_MAXUSER_ADDRESS)
10790 MPASS(eva <= VM_MAXUSER_ADDRESS);
10791 for (va = sva; va < eva; prev_ppr = ppr) {
10792 ppr = rangeset_lookup(&pmap->pm_pkru, va);
10795 else if ((ppr == NULL) ^ (prev_ppr == NULL))
10801 if (prev_ppr->pkru_keyidx != ppr->pkru_keyidx)
10803 va = ppr->pkru_rs_el.re_end;
10809 pmap_pkru_get(pmap_t pmap, vm_offset_t va)
10811 struct pmap_pkru_range *ppr;
10813 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
10814 if (pmap->pm_type != PT_X86 ||
10815 (cpu_stdext_feature2 & CPUID_STDEXT2_PKU) == 0 ||
10816 va >= VM_MAXUSER_ADDRESS)
10818 ppr = rangeset_lookup(&pmap->pm_pkru, va);
10820 return (X86_PG_PKU(ppr->pkru_keyidx));
10825 pred_pkru_on_remove(void *ctx __unused, void *r)
10827 struct pmap_pkru_range *ppr;
10830 return ((ppr->pkru_flags & AMD64_PKRU_PERSIST) == 0);
10834 pmap_pkru_on_remove(pmap_t pmap, vm_offset_t sva, vm_offset_t eva)
10837 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
10838 if (pmap->pm_type == PT_X86 &&
10839 (cpu_stdext_feature2 & CPUID_STDEXT2_PKU) != 0) {
10840 rangeset_remove_pred(&pmap->pm_pkru, sva, eva,
10841 pred_pkru_on_remove);
10846 pmap_pkru_copy(pmap_t dst_pmap, pmap_t src_pmap)
10849 PMAP_LOCK_ASSERT(dst_pmap, MA_OWNED);
10850 PMAP_LOCK_ASSERT(src_pmap, MA_OWNED);
10851 MPASS(dst_pmap->pm_type == PT_X86);
10852 MPASS(src_pmap->pm_type == PT_X86);
10853 MPASS((cpu_stdext_feature2 & CPUID_STDEXT2_PKU) != 0);
10854 if (src_pmap->pm_pkru.rs_data_ctx == NULL)
10856 return (rangeset_copy(&dst_pmap->pm_pkru, &src_pmap->pm_pkru));
10860 pmap_pkru_update_range(pmap_t pmap, vm_offset_t sva, vm_offset_t eva,
10863 pml4_entry_t *pml4e;
10865 pd_entry_t newpde, ptpaddr, *pde;
10866 pt_entry_t newpte, *ptep, pte;
10867 vm_offset_t va, va_next;
10870 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
10871 MPASS(pmap->pm_type == PT_X86);
10872 MPASS(keyidx <= PMAP_MAX_PKRU_IDX);
10874 for (changed = false, va = sva; va < eva; va = va_next) {
10875 pml4e = pmap_pml4e(pmap, va);
10876 if ((*pml4e & X86_PG_V) == 0) {
10877 va_next = (va + NBPML4) & ~PML4MASK;
10883 pdpe = pmap_pml4e_to_pdpe(pml4e, va);
10884 if ((*pdpe & X86_PG_V) == 0) {
10885 va_next = (va + NBPDP) & ~PDPMASK;
10891 va_next = (va + NBPDR) & ~PDRMASK;
10895 pde = pmap_pdpe_to_pde(pdpe, va);
10900 MPASS((ptpaddr & X86_PG_V) != 0);
10901 if ((ptpaddr & PG_PS) != 0) {
10902 if (va + NBPDR == va_next && eva >= va_next) {
10903 newpde = (ptpaddr & ~X86_PG_PKU_MASK) |
10904 X86_PG_PKU(keyidx);
10905 if (newpde != ptpaddr) {
10910 } else if (!pmap_demote_pde(pmap, pde, va)) {
10918 for (ptep = pmap_pde_to_pte(pde, va); va != va_next;
10919 ptep++, va += PAGE_SIZE) {
10921 if ((pte & X86_PG_V) == 0)
10923 newpte = (pte & ~X86_PG_PKU_MASK) | X86_PG_PKU(keyidx);
10924 if (newpte != pte) {
10931 pmap_invalidate_range(pmap, sva, eva);
10935 pmap_pkru_check_uargs(pmap_t pmap, vm_offset_t sva, vm_offset_t eva,
10936 u_int keyidx, int flags)
10939 if (pmap->pm_type != PT_X86 || keyidx > PMAP_MAX_PKRU_IDX ||
10940 (flags & ~(AMD64_PKRU_PERSIST | AMD64_PKRU_EXCL)) != 0)
10942 if (eva <= sva || eva > VM_MAXUSER_ADDRESS)
10944 if ((cpu_stdext_feature2 & CPUID_STDEXT2_PKU) == 0)
10950 pmap_pkru_set(pmap_t pmap, vm_offset_t sva, vm_offset_t eva, u_int keyidx,
10955 sva = trunc_page(sva);
10956 eva = round_page(eva);
10957 error = pmap_pkru_check_uargs(pmap, sva, eva, keyidx, flags);
10962 error = pmap_pkru_assign(pmap, sva, eva, keyidx, flags);
10964 pmap_pkru_update_range(pmap, sva, eva, keyidx);
10966 if (error != ENOMEM)
10974 pmap_pkru_clear(pmap_t pmap, vm_offset_t sva, vm_offset_t eva)
10978 sva = trunc_page(sva);
10979 eva = round_page(eva);
10980 error = pmap_pkru_check_uargs(pmap, sva, eva, 0, 0);
10985 error = pmap_pkru_deassign(pmap, sva, eva);
10987 pmap_pkru_update_range(pmap, sva, eva, 0);
10989 if (error != ENOMEM)
10997 * Track a range of the kernel's virtual address space that is contiguous
10998 * in various mapping attributes.
11000 struct pmap_kernel_map_range {
11009 sysctl_kmaps_dump(struct sbuf *sb, struct pmap_kernel_map_range *range,
11015 if (eva <= range->sva)
11018 pat_idx = pmap_pat_index(kernel_pmap, range->attrs, true);
11019 for (i = 0; i < PAT_INDEX_SIZE; i++)
11020 if (pat_index[i] == pat_idx)
11024 case PAT_WRITE_BACK:
11027 case PAT_WRITE_THROUGH:
11030 case PAT_UNCACHEABLE:
11036 case PAT_WRITE_PROTECTED:
11039 case PAT_WRITE_COMBINING:
11043 printf("%s: unknown PAT mode %#x for range 0x%016lx-0x%016lx\n",
11044 __func__, pat_idx, range->sva, eva);
11049 sbuf_printf(sb, "0x%016lx-0x%016lx r%c%c%c%c %s %d %d %d\n",
11051 (range->attrs & X86_PG_RW) != 0 ? 'w' : '-',
11052 (range->attrs & pg_nx) != 0 ? '-' : 'x',
11053 (range->attrs & X86_PG_U) != 0 ? 'u' : 's',
11054 (range->attrs & X86_PG_G) != 0 ? 'g' : '-',
11055 mode, range->pdpes, range->pdes, range->ptes);
11057 /* Reset to sentinel value. */
11058 range->sva = la57 ? KV5ADDR(NPML5EPG - 1, NPML4EPG - 1, NPDPEPG - 1,
11059 NPDEPG - 1, NPTEPG - 1) : KV4ADDR(NPML4EPG - 1, NPDPEPG - 1,
11060 NPDEPG - 1, NPTEPG - 1);
11064 * Determine whether the attributes specified by a page table entry match those
11065 * being tracked by the current range. This is not quite as simple as a direct
11066 * flag comparison since some PAT modes have multiple representations.
11069 sysctl_kmaps_match(struct pmap_kernel_map_range *range, pt_entry_t attrs)
11071 pt_entry_t diff, mask;
11073 mask = X86_PG_G | X86_PG_RW | X86_PG_U | X86_PG_PDE_CACHE | pg_nx;
11074 diff = (range->attrs ^ attrs) & mask;
11077 if ((diff & ~X86_PG_PDE_PAT) == 0 &&
11078 pmap_pat_index(kernel_pmap, range->attrs, true) ==
11079 pmap_pat_index(kernel_pmap, attrs, true))
11085 sysctl_kmaps_reinit(struct pmap_kernel_map_range *range, vm_offset_t va,
11089 memset(range, 0, sizeof(*range));
11091 range->attrs = attrs;
11095 * Given a leaf PTE, derive the mapping's attributes. If they do not match
11096 * those of the current run, dump the address range and its attributes, and
11100 sysctl_kmaps_check(struct sbuf *sb, struct pmap_kernel_map_range *range,
11101 vm_offset_t va, pml4_entry_t pml4e, pdp_entry_t pdpe, pd_entry_t pde,
11106 attrs = pml4e & (X86_PG_RW | X86_PG_U | pg_nx);
11108 attrs |= pdpe & pg_nx;
11109 attrs &= pg_nx | (pdpe & (X86_PG_RW | X86_PG_U));
11110 if ((pdpe & PG_PS) != 0) {
11111 attrs |= pdpe & (X86_PG_G | X86_PG_PDE_CACHE);
11112 } else if (pde != 0) {
11113 attrs |= pde & pg_nx;
11114 attrs &= pg_nx | (pde & (X86_PG_RW | X86_PG_U));
11116 if ((pde & PG_PS) != 0) {
11117 attrs |= pde & (X86_PG_G | X86_PG_PDE_CACHE);
11118 } else if (pte != 0) {
11119 attrs |= pte & pg_nx;
11120 attrs &= pg_nx | (pte & (X86_PG_RW | X86_PG_U));
11121 attrs |= pte & (X86_PG_G | X86_PG_PTE_CACHE);
11123 /* Canonicalize by always using the PDE PAT bit. */
11124 if ((attrs & X86_PG_PTE_PAT) != 0)
11125 attrs ^= X86_PG_PDE_PAT | X86_PG_PTE_PAT;
11128 if (range->sva > va || !sysctl_kmaps_match(range, attrs)) {
11129 sysctl_kmaps_dump(sb, range, va);
11130 sysctl_kmaps_reinit(range, va, attrs);
11135 sysctl_kmaps(SYSCTL_HANDLER_ARGS)
11137 struct pmap_kernel_map_range range;
11138 struct sbuf sbuf, *sb;
11139 pml4_entry_t pml4e;
11140 pdp_entry_t *pdp, pdpe;
11141 pd_entry_t *pd, pde;
11142 pt_entry_t *pt, pte;
11145 int error, i, j, k, l;
11147 error = sysctl_wire_old_buffer(req, 0);
11151 sbuf_new_for_sysctl(sb, NULL, PAGE_SIZE, req);
11153 /* Sentinel value. */
11154 range.sva = la57 ? KV5ADDR(NPML5EPG - 1, NPML4EPG - 1, NPDPEPG - 1,
11155 NPDEPG - 1, NPTEPG - 1) : KV4ADDR(NPML4EPG - 1, NPDPEPG - 1,
11156 NPDEPG - 1, NPTEPG - 1);
11159 * Iterate over the kernel page tables without holding the kernel pmap
11160 * lock. Outside of the large map, kernel page table pages are never
11161 * freed, so at worst we will observe inconsistencies in the output.
11162 * Within the large map, ensure that PDP and PD page addresses are
11163 * valid before descending.
11165 for (sva = 0, i = pmap_pml4e_index(sva); i < NPML4EPG; i++) {
11168 sbuf_printf(sb, "\nRecursive map:\n");
11171 sbuf_printf(sb, "\nDirect map:\n");
11174 sbuf_printf(sb, "\nKernel map:\n");
11177 sbuf_printf(sb, "\nLarge map:\n");
11181 /* Convert to canonical form. */
11182 if (sva == 1ul << 47)
11186 pml4e = kernel_pml4[i];
11187 if ((pml4e & X86_PG_V) == 0) {
11188 sva = rounddown2(sva, NBPML4);
11189 sysctl_kmaps_dump(sb, &range, sva);
11193 pa = pml4e & PG_FRAME;
11194 pdp = (pdp_entry_t *)PHYS_TO_DMAP(pa);
11196 for (j = pmap_pdpe_index(sva); j < NPDPEPG; j++) {
11198 if ((pdpe & X86_PG_V) == 0) {
11199 sva = rounddown2(sva, NBPDP);
11200 sysctl_kmaps_dump(sb, &range, sva);
11204 pa = pdpe & PG_FRAME;
11205 if (PMAP_ADDRESS_IN_LARGEMAP(sva) &&
11206 vm_phys_paddr_to_vm_page(pa) == NULL)
11208 if ((pdpe & PG_PS) != 0) {
11209 sva = rounddown2(sva, NBPDP);
11210 sysctl_kmaps_check(sb, &range, sva, pml4e, pdpe,
11216 pd = (pd_entry_t *)PHYS_TO_DMAP(pa);
11218 for (k = pmap_pde_index(sva); k < NPDEPG; k++) {
11220 if ((pde & X86_PG_V) == 0) {
11221 sva = rounddown2(sva, NBPDR);
11222 sysctl_kmaps_dump(sb, &range, sva);
11226 pa = pde & PG_FRAME;
11227 if (PMAP_ADDRESS_IN_LARGEMAP(sva) &&
11228 vm_phys_paddr_to_vm_page(pa) == NULL)
11230 if ((pde & PG_PS) != 0) {
11231 sva = rounddown2(sva, NBPDR);
11232 sysctl_kmaps_check(sb, &range, sva,
11233 pml4e, pdpe, pde, 0);
11238 pt = (pt_entry_t *)PHYS_TO_DMAP(pa);
11240 for (l = pmap_pte_index(sva); l < NPTEPG; l++,
11241 sva += PAGE_SIZE) {
11243 if ((pte & X86_PG_V) == 0) {
11244 sysctl_kmaps_dump(sb, &range,
11248 sysctl_kmaps_check(sb, &range, sva,
11249 pml4e, pdpe, pde, pte);
11256 error = sbuf_finish(sb);
11260 SYSCTL_OID(_vm_pmap, OID_AUTO, kernel_maps,
11261 CTLTYPE_STRING | CTLFLAG_RD | CTLFLAG_MPSAFE,
11262 NULL, 0, sysctl_kmaps, "A",
11263 "Dump kernel address layout");
11266 DB_SHOW_COMMAND(pte, pmap_print_pte)
11269 pml5_entry_t *pml5;
11270 pml4_entry_t *pml4;
11273 pt_entry_t *pte, PG_V;
11277 db_printf("show pte addr\n");
11280 va = (vm_offset_t)addr;
11282 if (kdb_thread != NULL)
11283 pmap = vmspace_pmap(kdb_thread->td_proc->p_vmspace);
11285 pmap = PCPU_GET(curpmap);
11287 PG_V = pmap_valid_bit(pmap);
11288 db_printf("VA 0x%016lx", va);
11290 if (pmap_is_la57(pmap)) {
11291 pml5 = pmap_pml5e(pmap, va);
11292 db_printf(" pml5e 0x%016lx", *pml5);
11293 if ((*pml5 & PG_V) == 0) {
11297 pml4 = pmap_pml5e_to_pml4e(pml5, va);
11299 pml4 = pmap_pml4e(pmap, va);
11301 db_printf(" pml4e 0x%016lx", *pml4);
11302 if ((*pml4 & PG_V) == 0) {
11306 pdp = pmap_pml4e_to_pdpe(pml4, va);
11307 db_printf(" pdpe 0x%016lx", *pdp);
11308 if ((*pdp & PG_V) == 0 || (*pdp & PG_PS) != 0) {
11312 pde = pmap_pdpe_to_pde(pdp, va);
11313 db_printf(" pde 0x%016lx", *pde);
11314 if ((*pde & PG_V) == 0 || (*pde & PG_PS) != 0) {
11318 pte = pmap_pde_to_pte(pde, va);
11319 db_printf(" pte 0x%016lx\n", *pte);
11322 DB_SHOW_COMMAND(phys2dmap, pmap_phys2dmap)
11327 a = (vm_paddr_t)addr;
11328 db_printf("0x%jx\n", (uintmax_t)PHYS_TO_DMAP(a));
11330 db_printf("show phys2dmap addr\n");
11335 ptpages_show_page(int level, int idx, vm_page_t pg)
11337 db_printf("l %d i %d pg %p phys %#lx ref %x\n",
11338 level, idx, pg, VM_PAGE_TO_PHYS(pg), pg->ref_count);
11342 ptpages_show_complain(int level, int idx, uint64_t pte)
11344 db_printf("l %d i %d pte %#lx\n", level, idx, pte);
11348 ptpages_show_pml4(vm_page_t pg4, int num_entries, uint64_t PG_V)
11350 vm_page_t pg3, pg2, pg1;
11351 pml4_entry_t *pml4;
11356 pml4 = (pml4_entry_t *)PHYS_TO_DMAP(VM_PAGE_TO_PHYS(pg4));
11357 for (i4 = 0; i4 < num_entries; i4++) {
11358 if ((pml4[i4] & PG_V) == 0)
11360 pg3 = PHYS_TO_VM_PAGE(pml4[i4] & PG_FRAME);
11362 ptpages_show_complain(3, i4, pml4[i4]);
11365 ptpages_show_page(3, i4, pg3);
11366 pdp = (pdp_entry_t *)PHYS_TO_DMAP(VM_PAGE_TO_PHYS(pg3));
11367 for (i3 = 0; i3 < NPDPEPG; i3++) {
11368 if ((pdp[i3] & PG_V) == 0)
11370 pg2 = PHYS_TO_VM_PAGE(pdp[i3] & PG_FRAME);
11372 ptpages_show_complain(2, i3, pdp[i3]);
11375 ptpages_show_page(2, i3, pg2);
11376 pd = (pd_entry_t *)PHYS_TO_DMAP(VM_PAGE_TO_PHYS(pg2));
11377 for (i2 = 0; i2 < NPDEPG; i2++) {
11378 if ((pd[i2] & PG_V) == 0)
11380 pg1 = PHYS_TO_VM_PAGE(pd[i2] & PG_FRAME);
11382 ptpages_show_complain(1, i2, pd[i2]);
11385 ptpages_show_page(1, i2, pg1);
11391 DB_SHOW_COMMAND(ptpages, pmap_ptpages)
11395 pml5_entry_t *pml5;
11400 pmap = (pmap_t)addr;
11402 pmap = PCPU_GET(curpmap);
11404 PG_V = pmap_valid_bit(pmap);
11406 if (pmap_is_la57(pmap)) {
11407 pml5 = pmap->pm_pmltop;
11408 for (i5 = 0; i5 < NUPML5E; i5++) {
11409 if ((pml5[i5] & PG_V) == 0)
11411 pg = PHYS_TO_VM_PAGE(pml5[i5] & PG_FRAME);
11413 ptpages_show_complain(4, i5, pml5[i5]);
11416 ptpages_show_page(4, i5, pg);
11417 ptpages_show_pml4(pg, NPML4EPG, PG_V);
11420 ptpages_show_pml4(PHYS_TO_VM_PAGE(DMAP_TO_PHYS(
11421 (vm_offset_t)pmap->pm_pmltop)), NUP4ML4E, PG_V);