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-2019 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 return (pmap_pdpe_to_pde(pdpe, va));
1421 /* Return a pointer to the PT slot that corresponds to a VA */
1422 static __inline pt_entry_t *
1423 pmap_pde_to_pte(pd_entry_t *pde, vm_offset_t va)
1427 KASSERT((*pde & PG_PS) == 0,
1428 ("%s: pde %#lx is a leaf", __func__, *pde));
1429 pte = (pt_entry_t *)PHYS_TO_DMAP(*pde & PG_FRAME);
1430 return (&pte[pmap_pte_index(va)]);
1433 /* Return a pointer to the PT slot that corresponds to a VA */
1434 static __inline pt_entry_t *
1435 pmap_pte(pmap_t pmap, vm_offset_t va)
1440 PG_V = pmap_valid_bit(pmap);
1441 pde = pmap_pde(pmap, va);
1442 if (pde == NULL || (*pde & PG_V) == 0)
1444 if ((*pde & PG_PS) != 0) /* compat with i386 pmap_pte() */
1445 return ((pt_entry_t *)pde);
1446 return (pmap_pde_to_pte(pde, va));
1449 static __inline void
1450 pmap_resident_count_inc(pmap_t pmap, int count)
1453 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
1454 pmap->pm_stats.resident_count += count;
1457 static __inline void
1458 pmap_resident_count_dec(pmap_t pmap, int count)
1461 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
1462 KASSERT(pmap->pm_stats.resident_count >= count,
1463 ("pmap %p resident count underflow %ld %d", pmap,
1464 pmap->pm_stats.resident_count, count));
1465 pmap->pm_stats.resident_count -= count;
1468 PMAP_INLINE pt_entry_t *
1469 vtopte(vm_offset_t va)
1473 KASSERT(va >= VM_MAXUSER_ADDRESS, ("vtopte on a uva/gpa 0x%0lx", va));
1476 mask = ((1ul << (NPTEPGSHIFT + NPDEPGSHIFT + NPDPEPGSHIFT +
1477 NPML4EPGSHIFT + NPML5EPGSHIFT)) - 1);
1478 return (P5Tmap + ((va >> PAGE_SHIFT) & mask));
1480 mask = ((1ul << (NPTEPGSHIFT + NPDEPGSHIFT + NPDPEPGSHIFT +
1481 NPML4EPGSHIFT)) - 1);
1482 return (P4Tmap + ((va >> PAGE_SHIFT) & mask));
1486 static __inline pd_entry_t *
1487 vtopde(vm_offset_t va)
1491 KASSERT(va >= VM_MAXUSER_ADDRESS, ("vtopde on a uva/gpa 0x%0lx", va));
1494 mask = ((1ul << (NPDEPGSHIFT + NPDPEPGSHIFT +
1495 NPML4EPGSHIFT + NPML5EPGSHIFT)) - 1);
1496 return (P5Dmap + ((va >> PDRSHIFT) & mask));
1498 mask = ((1ul << (NPDEPGSHIFT + NPDPEPGSHIFT +
1499 NPML4EPGSHIFT)) - 1);
1500 return (P4Dmap + ((va >> PDRSHIFT) & mask));
1505 allocpages(vm_paddr_t *firstaddr, int n)
1510 bzero((void *)ret, n * PAGE_SIZE);
1511 *firstaddr += n * PAGE_SIZE;
1515 CTASSERT(powerof2(NDMPML4E));
1517 /* number of kernel PDP slots */
1518 #define NKPDPE(ptpgs) howmany(ptpgs, NPDEPG)
1521 nkpt_init(vm_paddr_t addr)
1528 pt_pages = howmany(addr, 1 << PDRSHIFT);
1529 pt_pages += NKPDPE(pt_pages);
1532 * Add some slop beyond the bare minimum required for bootstrapping
1535 * This is quite important when allocating KVA for kernel modules.
1536 * The modules are required to be linked in the negative 2GB of
1537 * the address space. If we run out of KVA in this region then
1538 * pmap_growkernel() will need to allocate page table pages to map
1539 * the entire 512GB of KVA space which is an unnecessary tax on
1542 * Secondly, device memory mapped as part of setting up the low-
1543 * level console(s) is taken from KVA, starting at virtual_avail.
1544 * This is because cninit() is called after pmap_bootstrap() but
1545 * before vm_init() and pmap_init(). 20MB for a frame buffer is
1548 pt_pages += 32; /* 64MB additional slop. */
1554 * Returns the proper write/execute permission for a physical page that is
1555 * part of the initial boot allocations.
1557 * If the page has kernel text, it is marked as read-only. If the page has
1558 * kernel read-only data, it is marked as read-only/not-executable. If the
1559 * page has only read-write data, it is marked as read-write/not-executable.
1560 * If the page is below/above the kernel range, it is marked as read-write.
1562 * This function operates on 2M pages, since we map the kernel space that
1565 static inline pt_entry_t
1566 bootaddr_rwx(vm_paddr_t pa)
1570 * The kernel is loaded at a 2MB-aligned address, and memory below that
1571 * need not be executable. The .bss section is padded to a 2MB
1572 * boundary, so memory following the kernel need not be executable
1573 * either. Preloaded kernel modules have their mapping permissions
1574 * fixed up by the linker.
1576 if (pa < trunc_2mpage(btext - KERNBASE) ||
1577 pa >= trunc_2mpage(_end - KERNBASE))
1578 return (X86_PG_RW | pg_nx);
1581 * The linker should ensure that the read-only and read-write
1582 * portions don't share the same 2M page, so this shouldn't
1583 * impact read-only data. However, in any case, any page with
1584 * read-write data needs to be read-write.
1586 if (pa >= trunc_2mpage(brwsection - KERNBASE))
1587 return (X86_PG_RW | pg_nx);
1590 * Mark any 2M page containing kernel text as read-only. Mark
1591 * other pages with read-only data as read-only and not executable.
1592 * (It is likely a small portion of the read-only data section will
1593 * be marked as read-only, but executable. This should be acceptable
1594 * since the read-only protection will keep the data from changing.)
1595 * Note that fixups to the .text section will still work until we
1598 if (pa < round_2mpage(etext - KERNBASE))
1604 create_pagetables(vm_paddr_t *firstaddr)
1606 int i, j, ndm1g, nkpdpe, nkdmpde;
1610 uint64_t DMPDkernphys;
1612 /* Allocate page table pages for the direct map */
1613 ndmpdp = howmany(ptoa(Maxmem), NBPDP);
1614 if (ndmpdp < 4) /* Minimum 4GB of dirmap */
1616 ndmpdpphys = howmany(ndmpdp, NPDPEPG);
1617 if (ndmpdpphys > NDMPML4E) {
1619 * Each NDMPML4E allows 512 GB, so limit to that,
1620 * and then readjust ndmpdp and ndmpdpphys.
1622 printf("NDMPML4E limits system to %d GB\n", NDMPML4E * 512);
1623 Maxmem = atop(NDMPML4E * NBPML4);
1624 ndmpdpphys = NDMPML4E;
1625 ndmpdp = NDMPML4E * NPDEPG;
1627 DMPDPphys = allocpages(firstaddr, ndmpdpphys);
1629 if ((amd_feature & AMDID_PAGE1GB) != 0) {
1631 * Calculate the number of 1G pages that will fully fit in
1634 ndm1g = ptoa(Maxmem) >> PDPSHIFT;
1637 * Allocate 2M pages for the kernel. These will be used in
1638 * place of the first one or more 1G pages from ndm1g.
1640 nkdmpde = howmany((vm_offset_t)(brwsection - KERNBASE), NBPDP);
1641 DMPDkernphys = allocpages(firstaddr, nkdmpde);
1644 DMPDphys = allocpages(firstaddr, ndmpdp - ndm1g);
1645 dmaplimit = (vm_paddr_t)ndmpdp << PDPSHIFT;
1647 /* Allocate pages */
1648 KPML4phys = allocpages(firstaddr, 1);
1649 KPDPphys = allocpages(firstaddr, NKPML4E);
1652 * Allocate the initial number of kernel page table pages required to
1653 * bootstrap. We defer this until after all memory-size dependent
1654 * allocations are done (e.g. direct map), so that we don't have to
1655 * build in too much slop in our estimate.
1657 * Note that when NKPML4E > 1, we have an empty page underneath
1658 * all but the KPML4I'th one, so we need NKPML4E-1 extra (zeroed)
1659 * pages. (pmap_enter requires a PD page to exist for each KPML4E.)
1661 nkpt_init(*firstaddr);
1662 nkpdpe = NKPDPE(nkpt);
1664 KPTphys = allocpages(firstaddr, nkpt);
1665 KPDphys = allocpages(firstaddr, nkpdpe);
1668 * Connect the zero-filled PT pages to their PD entries. This
1669 * implicitly maps the PT pages at their correct locations within
1672 pd_p = (pd_entry_t *)KPDphys;
1673 for (i = 0; i < nkpt; i++)
1674 pd_p[i] = (KPTphys + ptoa(i)) | X86_PG_RW | X86_PG_V;
1677 * Map from physical address zero to the end of loader preallocated
1678 * memory using 2MB pages. This replaces some of the PD entries
1681 for (i = 0; (i << PDRSHIFT) < KERNend; i++)
1682 /* Preset PG_M and PG_A because demotion expects it. */
1683 pd_p[i] = (i << PDRSHIFT) | X86_PG_V | PG_PS | pg_g |
1684 X86_PG_M | X86_PG_A | bootaddr_rwx(i << PDRSHIFT);
1687 * Because we map the physical blocks in 2M pages, adjust firstaddr
1688 * to record the physical blocks we've actually mapped into kernel
1689 * virtual address space.
1691 if (*firstaddr < round_2mpage(KERNend))
1692 *firstaddr = round_2mpage(KERNend);
1694 /* And connect up the PD to the PDP (leaving room for L4 pages) */
1695 pdp_p = (pdp_entry_t *)(KPDPphys + ptoa(KPML4I - KPML4BASE));
1696 for (i = 0; i < nkpdpe; i++)
1697 pdp_p[i + KPDPI] = (KPDphys + ptoa(i)) | X86_PG_RW | X86_PG_V;
1700 * Now, set up the direct map region using 2MB and/or 1GB pages. If
1701 * the end of physical memory is not aligned to a 1GB page boundary,
1702 * then the residual physical memory is mapped with 2MB pages. Later,
1703 * if pmap_mapdev{_attr}() uses the direct map for non-write-back
1704 * memory, pmap_change_attr() will demote any 2MB or 1GB page mappings
1705 * that are partially used.
1707 pd_p = (pd_entry_t *)DMPDphys;
1708 for (i = NPDEPG * ndm1g, j = 0; i < NPDEPG * ndmpdp; i++, j++) {
1709 pd_p[j] = (vm_paddr_t)i << PDRSHIFT;
1710 /* Preset PG_M and PG_A because demotion expects it. */
1711 pd_p[j] |= X86_PG_RW | X86_PG_V | PG_PS | pg_g |
1712 X86_PG_M | X86_PG_A | pg_nx;
1714 pdp_p = (pdp_entry_t *)DMPDPphys;
1715 for (i = 0; i < ndm1g; i++) {
1716 pdp_p[i] = (vm_paddr_t)i << PDPSHIFT;
1717 /* Preset PG_M and PG_A because demotion expects it. */
1718 pdp_p[i] |= X86_PG_RW | X86_PG_V | PG_PS | pg_g |
1719 X86_PG_M | X86_PG_A | pg_nx;
1721 for (j = 0; i < ndmpdp; i++, j++) {
1722 pdp_p[i] = DMPDphys + ptoa(j);
1723 pdp_p[i] |= X86_PG_RW | X86_PG_V | pg_nx;
1727 * Instead of using a 1G page for the memory containing the kernel,
1728 * use 2M pages with read-only and no-execute permissions. (If using 1G
1729 * pages, this will partially overwrite the PDPEs above.)
1732 pd_p = (pd_entry_t *)DMPDkernphys;
1733 for (i = 0; i < (NPDEPG * nkdmpde); i++)
1734 pd_p[i] = (i << PDRSHIFT) | X86_PG_V | PG_PS | pg_g |
1735 X86_PG_M | X86_PG_A | pg_nx |
1736 bootaddr_rwx(i << PDRSHIFT);
1737 for (i = 0; i < nkdmpde; i++)
1738 pdp_p[i] = (DMPDkernphys + ptoa(i)) | X86_PG_RW |
1742 /* And recursively map PML4 to itself in order to get PTmap */
1743 p4_p = (pml4_entry_t *)KPML4phys;
1744 p4_p[PML4PML4I] = KPML4phys;
1745 p4_p[PML4PML4I] |= X86_PG_RW | X86_PG_V | pg_nx;
1747 /* Connect the Direct Map slot(s) up to the PML4. */
1748 for (i = 0; i < ndmpdpphys; i++) {
1749 p4_p[DMPML4I + i] = DMPDPphys + ptoa(i);
1750 p4_p[DMPML4I + i] |= X86_PG_RW | X86_PG_V | pg_nx;
1753 /* Connect the KVA slots up to the PML4 */
1754 for (i = 0; i < NKPML4E; i++) {
1755 p4_p[KPML4BASE + i] = KPDPphys + ptoa(i);
1756 p4_p[KPML4BASE + i] |= X86_PG_RW | X86_PG_V;
1759 kernel_pml4 = (pml4_entry_t *)PHYS_TO_DMAP(KPML4phys);
1763 * Bootstrap the system enough to run with virtual memory.
1765 * On amd64 this is called after mapping has already been enabled
1766 * and just syncs the pmap module with what has already been done.
1767 * [We can't call it easily with mapping off since the kernel is not
1768 * mapped with PA == VA, hence we would have to relocate every address
1769 * from the linked base (virtual) address "KERNBASE" to the actual
1770 * (physical) address starting relative to 0]
1773 pmap_bootstrap(vm_paddr_t *firstaddr)
1776 pt_entry_t *pte, *pcpu_pte;
1777 struct region_descriptor r_gdt;
1778 uint64_t cr4, pcpu_phys;
1782 KERNend = *firstaddr;
1783 res = atop(KERNend - (vm_paddr_t)kernphys);
1789 * Create an initial set of page tables to run the kernel in.
1791 create_pagetables(firstaddr);
1793 pcpu_phys = allocpages(firstaddr, MAXCPU);
1796 * Add a physical memory segment (vm_phys_seg) corresponding to the
1797 * preallocated kernel page table pages so that vm_page structures
1798 * representing these pages will be created. The vm_page structures
1799 * are required for promotion of the corresponding kernel virtual
1800 * addresses to superpage mappings.
1802 vm_phys_early_add_seg(KPTphys, KPTphys + ptoa(nkpt));
1805 * Account for the virtual addresses mapped by create_pagetables().
1807 virtual_avail = (vm_offset_t)KERNBASE + round_2mpage(KERNend);
1808 virtual_end = VM_MAX_KERNEL_ADDRESS;
1811 * Enable PG_G global pages, then switch to the kernel page
1812 * table from the bootstrap page table. After the switch, it
1813 * is possible to enable SMEP and SMAP since PG_U bits are
1819 load_cr3(KPML4phys);
1820 if (cpu_stdext_feature & CPUID_STDEXT_SMEP)
1822 if (cpu_stdext_feature & CPUID_STDEXT_SMAP)
1827 * Initialize the kernel pmap (which is statically allocated).
1828 * Count bootstrap data as being resident in case any of this data is
1829 * later unmapped (using pmap_remove()) and freed.
1831 PMAP_LOCK_INIT(kernel_pmap);
1832 kernel_pmap->pm_pmltop = kernel_pml4;
1833 kernel_pmap->pm_cr3 = KPML4phys;
1834 kernel_pmap->pm_ucr3 = PMAP_NO_CR3;
1835 CPU_FILL(&kernel_pmap->pm_active); /* don't allow deactivation */
1836 TAILQ_INIT(&kernel_pmap->pm_pvchunk);
1837 kernel_pmap->pm_stats.resident_count = res;
1838 kernel_pmap->pm_flags = pmap_flags;
1841 * Initialize the TLB invalidations generation number lock.
1843 mtx_init(&invl_gen_mtx, "invlgn", NULL, MTX_DEF);
1846 * Reserve some special page table entries/VA space for temporary
1849 #define SYSMAP(c, p, v, n) \
1850 v = (c)va; va += ((n)*PAGE_SIZE); p = pte; pte += (n);
1856 * Crashdump maps. The first page is reused as CMAP1 for the
1859 SYSMAP(caddr_t, CMAP1, crashdumpmap, MAXDUMPPGS)
1860 CADDR1 = crashdumpmap;
1862 SYSMAP(struct pcpu *, pcpu_pte, __pcpu, MAXCPU);
1865 for (i = 0; i < MAXCPU; i++) {
1866 pcpu_pte[i] = (pcpu_phys + ptoa(i)) | X86_PG_V | X86_PG_RW |
1867 pg_g | pg_nx | X86_PG_M | X86_PG_A;
1871 * Re-initialize PCPU area for BSP after switching.
1872 * Make hardware use gdt and common_tss from the new PCPU.
1874 STAILQ_INIT(&cpuhead);
1875 wrmsr(MSR_GSBASE, (uint64_t)&__pcpu[0]);
1876 pcpu_init(&__pcpu[0], 0, sizeof(struct pcpu));
1877 amd64_bsp_pcpu_init1(&__pcpu[0]);
1878 amd64_bsp_ist_init(&__pcpu[0]);
1879 __pcpu[0].pc_common_tss.tss_iobase = sizeof(struct amd64tss) +
1881 memcpy(__pcpu[0].pc_gdt, temp_bsp_pcpu.pc_gdt, NGDT *
1882 sizeof(struct user_segment_descriptor));
1883 gdt_segs[GPROC0_SEL].ssd_base = (uintptr_t)&__pcpu[0].pc_common_tss;
1884 ssdtosyssd(&gdt_segs[GPROC0_SEL],
1885 (struct system_segment_descriptor *)&__pcpu[0].pc_gdt[GPROC0_SEL]);
1886 r_gdt.rd_limit = NGDT * sizeof(struct user_segment_descriptor) - 1;
1887 r_gdt.rd_base = (long)__pcpu[0].pc_gdt;
1889 wrmsr(MSR_GSBASE, (uint64_t)&__pcpu[0]);
1890 ltr(GSEL(GPROC0_SEL, SEL_KPL));
1891 __pcpu[0].pc_dynamic = temp_bsp_pcpu.pc_dynamic;
1892 __pcpu[0].pc_acpi_id = temp_bsp_pcpu.pc_acpi_id;
1895 * Initialize the PAT MSR.
1896 * pmap_init_pat() clears and sets CR4_PGE, which, as a
1897 * side-effect, invalidates stale PG_G TLB entries that might
1898 * have been created in our pre-boot environment.
1902 /* Initialize TLB Context Id. */
1903 if (pmap_pcid_enabled) {
1904 for (i = 0; i < MAXCPU; i++) {
1905 kernel_pmap->pm_pcids[i].pm_pcid = PMAP_PCID_KERN;
1906 kernel_pmap->pm_pcids[i].pm_gen = 1;
1910 * PMAP_PCID_KERN + 1 is used for initialization of
1911 * proc0 pmap. The pmap' pcid state might be used by
1912 * EFIRT entry before first context switch, so it
1913 * needs to be valid.
1915 PCPU_SET(pcid_next, PMAP_PCID_KERN + 2);
1916 PCPU_SET(pcid_gen, 1);
1919 * pcpu area for APs is zeroed during AP startup.
1920 * pc_pcid_next and pc_pcid_gen are initialized by AP
1921 * during pcpu setup.
1923 load_cr4(rcr4() | CR4_PCIDE);
1928 * Setup the PAT MSR.
1937 /* Bail if this CPU doesn't implement PAT. */
1938 if ((cpu_feature & CPUID_PAT) == 0)
1941 /* Set default PAT index table. */
1942 for (i = 0; i < PAT_INDEX_SIZE; i++)
1944 pat_index[PAT_WRITE_BACK] = 0;
1945 pat_index[PAT_WRITE_THROUGH] = 1;
1946 pat_index[PAT_UNCACHEABLE] = 3;
1947 pat_index[PAT_WRITE_COMBINING] = 6;
1948 pat_index[PAT_WRITE_PROTECTED] = 5;
1949 pat_index[PAT_UNCACHED] = 2;
1952 * Initialize default PAT entries.
1953 * Leave the indices 0-3 at the default of WB, WT, UC-, and UC.
1954 * Program 5 and 6 as WP and WC.
1956 * Leave 4 and 7 as WB and UC. Note that a recursive page table
1957 * mapping for a 2M page uses a PAT value with the bit 3 set due
1958 * to its overload with PG_PS.
1960 pat_msr = PAT_VALUE(0, PAT_WRITE_BACK) |
1961 PAT_VALUE(1, PAT_WRITE_THROUGH) |
1962 PAT_VALUE(2, PAT_UNCACHED) |
1963 PAT_VALUE(3, PAT_UNCACHEABLE) |
1964 PAT_VALUE(4, PAT_WRITE_BACK) |
1965 PAT_VALUE(5, PAT_WRITE_PROTECTED) |
1966 PAT_VALUE(6, PAT_WRITE_COMBINING) |
1967 PAT_VALUE(7, PAT_UNCACHEABLE);
1971 load_cr4(cr4 & ~CR4_PGE);
1973 /* Disable caches (CD = 1, NW = 0). */
1975 load_cr0((cr0 & ~CR0_NW) | CR0_CD);
1977 /* Flushes caches and TLBs. */
1981 /* Update PAT and index table. */
1982 wrmsr(MSR_PAT, pat_msr);
1984 /* Flush caches and TLBs again. */
1988 /* Restore caches and PGE. */
1993 extern const char la57_trampoline[], la57_trampoline_gdt_desc[],
1994 la57_trampoline_gdt[], la57_trampoline_end[];
1997 pmap_bootstrap_la57(void *arg __unused)
2000 pml5_entry_t *v_pml5;
2001 pml4_entry_t *v_pml4;
2005 vm_page_t m_code, m_pml4, m_pdp, m_pd, m_pt, m_pml5;
2006 void (*la57_tramp)(uint64_t pml5);
2007 struct region_descriptor r_gdt;
2009 if ((cpu_stdext_feature2 & CPUID_STDEXT2_LA57) == 0)
2011 if (!TUNABLE_INT_FETCH("vm.pmap.la57", &la57))
2016 r_gdt.rd_limit = NGDT * sizeof(struct user_segment_descriptor) - 1;
2017 r_gdt.rd_base = (long)__pcpu[0].pc_gdt;
2019 m_code = vm_page_alloc_contig(NULL, 0,
2020 VM_ALLOC_NORMAL | VM_ALLOC_NOBUSY | VM_ALLOC_ZERO | VM_ALLOC_NOOBJ,
2021 1, 0, (1ULL << 32), PAGE_SIZE, 0, VM_MEMATTR_DEFAULT);
2022 if ((m_code->flags & PG_ZERO) == 0)
2023 pmap_zero_page(m_code);
2024 v_code = (char *)PHYS_TO_DMAP(VM_PAGE_TO_PHYS(m_code));
2025 m_pml5 = vm_page_alloc_contig(NULL, 0,
2026 VM_ALLOC_NORMAL | VM_ALLOC_NOBUSY | VM_ALLOC_ZERO | VM_ALLOC_NOOBJ,
2027 1, 0, (1ULL << 32), PAGE_SIZE, 0, VM_MEMATTR_DEFAULT);
2028 if ((m_pml5->flags & PG_ZERO) == 0)
2029 pmap_zero_page(m_pml5);
2030 KPML5phys = VM_PAGE_TO_PHYS(m_pml5);
2031 v_pml5 = (pml5_entry_t *)PHYS_TO_DMAP(KPML5phys);
2032 m_pml4 = vm_page_alloc_contig(NULL, 0,
2033 VM_ALLOC_NORMAL | VM_ALLOC_NOBUSY | VM_ALLOC_ZERO | VM_ALLOC_NOOBJ,
2034 1, 0, (1ULL << 32), PAGE_SIZE, 0, VM_MEMATTR_DEFAULT);
2035 if ((m_pml4->flags & PG_ZERO) == 0)
2036 pmap_zero_page(m_pml4);
2037 v_pml4 = (pdp_entry_t *)PHYS_TO_DMAP(VM_PAGE_TO_PHYS(m_pml4));
2038 m_pdp = vm_page_alloc_contig(NULL, 0,
2039 VM_ALLOC_NORMAL | VM_ALLOC_NOBUSY | VM_ALLOC_ZERO | VM_ALLOC_NOOBJ,
2040 1, 0, (1ULL << 32), PAGE_SIZE, 0, VM_MEMATTR_DEFAULT);
2041 if ((m_pdp->flags & PG_ZERO) == 0)
2042 pmap_zero_page(m_pdp);
2043 v_pdp = (pdp_entry_t *)PHYS_TO_DMAP(VM_PAGE_TO_PHYS(m_pdp));
2044 m_pd = vm_page_alloc_contig(NULL, 0,
2045 VM_ALLOC_NORMAL | VM_ALLOC_NOBUSY | VM_ALLOC_ZERO | VM_ALLOC_NOOBJ,
2046 1, 0, (1ULL << 32), PAGE_SIZE, 0, VM_MEMATTR_DEFAULT);
2047 if ((m_pd->flags & PG_ZERO) == 0)
2048 pmap_zero_page(m_pd);
2049 v_pd = (pdp_entry_t *)PHYS_TO_DMAP(VM_PAGE_TO_PHYS(m_pd));
2050 m_pt = vm_page_alloc_contig(NULL, 0,
2051 VM_ALLOC_NORMAL | VM_ALLOC_NOBUSY | VM_ALLOC_ZERO | VM_ALLOC_NOOBJ,
2052 1, 0, (1ULL << 32), PAGE_SIZE, 0, VM_MEMATTR_DEFAULT);
2053 if ((m_pt->flags & PG_ZERO) == 0)
2054 pmap_zero_page(m_pt);
2055 v_pt = (pt_entry_t *)PHYS_TO_DMAP(VM_PAGE_TO_PHYS(m_pt));
2058 * Map m_code 1:1, it appears below 4G in KVA due to physical
2059 * address being below 4G. Since kernel KVA is in upper half,
2060 * the pml4e should be zero and free for temporary use.
2062 kernel_pmap->pm_pmltop[pmap_pml4e_index(VM_PAGE_TO_PHYS(m_code))] =
2063 VM_PAGE_TO_PHYS(m_pdp) | X86_PG_V | X86_PG_RW | X86_PG_A |
2065 v_pdp[pmap_pdpe_index(VM_PAGE_TO_PHYS(m_code))] =
2066 VM_PAGE_TO_PHYS(m_pd) | X86_PG_V | X86_PG_RW | X86_PG_A |
2068 v_pd[pmap_pde_index(VM_PAGE_TO_PHYS(m_code))] =
2069 VM_PAGE_TO_PHYS(m_pt) | X86_PG_V | X86_PG_RW | X86_PG_A |
2071 v_pt[pmap_pte_index(VM_PAGE_TO_PHYS(m_code))] =
2072 VM_PAGE_TO_PHYS(m_code) | X86_PG_V | X86_PG_RW | X86_PG_A |
2076 * Add pml5 entry at top of KVA pointing to existing pml4 table,
2077 * entering all existing kernel mappings into level 5 table.
2079 v_pml5[pmap_pml5e_index(UPT_MAX_ADDRESS)] = KPML4phys | X86_PG_V |
2080 X86_PG_RW | X86_PG_A | X86_PG_M | pg_g;
2083 * Add pml5 entry for 1:1 trampoline mapping after LA57 is turned on.
2085 v_pml5[pmap_pml5e_index(VM_PAGE_TO_PHYS(m_code))] =
2086 VM_PAGE_TO_PHYS(m_pml4) | X86_PG_V | X86_PG_RW | X86_PG_A |
2088 v_pml4[pmap_pml4e_index(VM_PAGE_TO_PHYS(m_code))] =
2089 VM_PAGE_TO_PHYS(m_pdp) | X86_PG_V | X86_PG_RW | X86_PG_A |
2093 * Copy and call the 48->57 trampoline, hope we return there, alive.
2095 bcopy(la57_trampoline, v_code, la57_trampoline_end - la57_trampoline);
2096 *(u_long *)(v_code + 2 + (la57_trampoline_gdt_desc - la57_trampoline)) =
2097 la57_trampoline_gdt - la57_trampoline + VM_PAGE_TO_PHYS(m_code);
2098 la57_tramp = (void (*)(uint64_t))VM_PAGE_TO_PHYS(m_code);
2099 la57_tramp(KPML5phys);
2102 * gdt was necessary reset, switch back to our gdt.
2105 wrmsr(MSR_GSBASE, (uint64_t)&__pcpu[0]);
2109 ssdtosyssd(&gdt_segs[GPROC0_SEL],
2110 (struct system_segment_descriptor *)&__pcpu[0].pc_gdt[GPROC0_SEL]);
2111 ltr(GSEL(GPROC0_SEL, SEL_KPL));
2114 * Now unmap the trampoline, and free the pages.
2115 * Clear pml5 entry used for 1:1 trampoline mapping.
2117 pte_clear(&v_pml5[pmap_pml5e_index(VM_PAGE_TO_PHYS(m_code))]);
2118 invlpg((vm_offset_t)v_code);
2119 vm_page_free(m_code);
2120 vm_page_free(m_pdp);
2125 * Recursively map PML5 to itself in order to get PTmap and
2128 v_pml5[PML5PML5I] = KPML5phys | X86_PG_RW | X86_PG_V | pg_nx;
2130 kernel_pmap->pm_cr3 = KPML5phys;
2131 kernel_pmap->pm_pmltop = v_pml5;
2133 SYSINIT(la57, SI_SUB_KMEM, SI_ORDER_ANY, pmap_bootstrap_la57, NULL);
2136 * Initialize a vm_page's machine-dependent fields.
2139 pmap_page_init(vm_page_t m)
2142 TAILQ_INIT(&m->md.pv_list);
2143 m->md.pat_mode = PAT_WRITE_BACK;
2146 static int pmap_allow_2m_x_ept;
2147 SYSCTL_INT(_vm_pmap, OID_AUTO, allow_2m_x_ept, CTLFLAG_RWTUN | CTLFLAG_NOFETCH,
2148 &pmap_allow_2m_x_ept, 0,
2149 "Allow executable superpage mappings in EPT");
2152 pmap_allow_2m_x_ept_recalculate(void)
2155 * SKL002, SKL012S. Since the EPT format is only used by
2156 * Intel CPUs, the vendor check is merely a formality.
2158 if (!(cpu_vendor_id != CPU_VENDOR_INTEL ||
2159 (cpu_ia32_arch_caps & IA32_ARCH_CAP_IF_PSCHANGE_MC_NO) != 0 ||
2160 (CPUID_TO_FAMILY(cpu_id) == 0x6 &&
2161 (CPUID_TO_MODEL(cpu_id) == 0x26 || /* Atoms */
2162 CPUID_TO_MODEL(cpu_id) == 0x27 ||
2163 CPUID_TO_MODEL(cpu_id) == 0x35 ||
2164 CPUID_TO_MODEL(cpu_id) == 0x36 ||
2165 CPUID_TO_MODEL(cpu_id) == 0x37 ||
2166 CPUID_TO_MODEL(cpu_id) == 0x86 ||
2167 CPUID_TO_MODEL(cpu_id) == 0x1c ||
2168 CPUID_TO_MODEL(cpu_id) == 0x4a ||
2169 CPUID_TO_MODEL(cpu_id) == 0x4c ||
2170 CPUID_TO_MODEL(cpu_id) == 0x4d ||
2171 CPUID_TO_MODEL(cpu_id) == 0x5a ||
2172 CPUID_TO_MODEL(cpu_id) == 0x5c ||
2173 CPUID_TO_MODEL(cpu_id) == 0x5d ||
2174 CPUID_TO_MODEL(cpu_id) == 0x5f ||
2175 CPUID_TO_MODEL(cpu_id) == 0x6e ||
2176 CPUID_TO_MODEL(cpu_id) == 0x7a ||
2177 CPUID_TO_MODEL(cpu_id) == 0x57 || /* Knights */
2178 CPUID_TO_MODEL(cpu_id) == 0x85))))
2179 pmap_allow_2m_x_ept = 1;
2180 TUNABLE_INT_FETCH("hw.allow_2m_x_ept", &pmap_allow_2m_x_ept);
2184 pmap_allow_2m_x_page(pmap_t pmap, bool executable)
2187 return (pmap->pm_type != PT_EPT || !executable ||
2188 !pmap_allow_2m_x_ept);
2193 pmap_init_pv_table(void)
2195 struct pmap_large_md_page *pvd;
2197 long start, end, highest, pv_npg;
2198 int domain, i, j, pages;
2201 * We strongly depend on the size being a power of two, so the assert
2202 * is overzealous. However, should the struct be resized to a
2203 * different power of two, the code below needs to be revisited.
2205 CTASSERT((sizeof(*pvd) == 64));
2208 * Calculate the size of the array.
2210 pmap_last_pa = vm_phys_segs[vm_phys_nsegs - 1].end;
2211 pv_npg = howmany(pmap_last_pa, NBPDR);
2212 s = (vm_size_t)pv_npg * sizeof(struct pmap_large_md_page);
2214 pv_table = (struct pmap_large_md_page *)kva_alloc(s);
2215 if (pv_table == NULL)
2216 panic("%s: kva_alloc failed\n", __func__);
2219 * Iterate physical segments to allocate space for respective pages.
2223 for (i = 0; i < vm_phys_nsegs; i++) {
2224 end = vm_phys_segs[i].end / NBPDR;
2225 domain = vm_phys_segs[i].domain;
2230 start = highest + 1;
2231 pvd = &pv_table[start];
2233 pages = end - start + 1;
2234 s = round_page(pages * sizeof(*pvd));
2235 highest = start + (s / sizeof(*pvd)) - 1;
2237 for (j = 0; j < s; j += PAGE_SIZE) {
2238 vm_page_t m = vm_page_alloc_domain(NULL, 0,
2239 domain, VM_ALLOC_NORMAL | VM_ALLOC_NOOBJ);
2241 panic("vm_page_alloc_domain failed for %lx\n", (vm_offset_t)pvd + j);
2242 pmap_qenter((vm_offset_t)pvd + j, &m, 1);
2245 for (j = 0; j < s / sizeof(*pvd); j++) {
2246 rw_init_flags(&pvd->pv_lock, "pmap pv list", RW_NEW);
2247 TAILQ_INIT(&pvd->pv_page.pv_list);
2248 pvd->pv_page.pv_gen = 0;
2249 pvd->pv_page.pat_mode = 0;
2250 pvd->pv_invl_gen = 0;
2254 pvd = &pv_dummy_large;
2255 rw_init_flags(&pvd->pv_lock, "pmap pv list dummy", RW_NEW);
2256 TAILQ_INIT(&pvd->pv_page.pv_list);
2257 pvd->pv_page.pv_gen = 0;
2258 pvd->pv_page.pat_mode = 0;
2259 pvd->pv_invl_gen = 0;
2263 pmap_init_pv_table(void)
2269 * Initialize the pool of pv list locks.
2271 for (i = 0; i < NPV_LIST_LOCKS; i++)
2272 rw_init(&pv_list_locks[i], "pmap pv list");
2275 * Calculate the size of the pv head table for superpages.
2277 pv_npg = howmany(vm_phys_segs[vm_phys_nsegs - 1].end, NBPDR);
2280 * Allocate memory for the pv head table for superpages.
2282 s = (vm_size_t)pv_npg * sizeof(struct md_page);
2284 pv_table = (struct md_page *)kmem_malloc(s, M_WAITOK | M_ZERO);
2285 for (i = 0; i < pv_npg; i++)
2286 TAILQ_INIT(&pv_table[i].pv_list);
2287 TAILQ_INIT(&pv_dummy.pv_list);
2292 * Initialize the pmap module.
2293 * Called by vm_init, to initialize any structures that the pmap
2294 * system needs to map virtual memory.
2299 struct pmap_preinit_mapping *ppim;
2301 int error, i, ret, skz63;
2303 /* L1TF, reserve page @0 unconditionally */
2304 vm_page_blacklist_add(0, bootverbose);
2306 /* Detect bare-metal Skylake Server and Skylake-X. */
2307 if (vm_guest == VM_GUEST_NO && cpu_vendor_id == CPU_VENDOR_INTEL &&
2308 CPUID_TO_FAMILY(cpu_id) == 0x6 && CPUID_TO_MODEL(cpu_id) == 0x55) {
2310 * Skylake-X errata SKZ63. Processor May Hang When
2311 * Executing Code In an HLE Transaction Region between
2312 * 40000000H and 403FFFFFH.
2314 * Mark the pages in the range as preallocated. It
2315 * seems to be impossible to distinguish between
2316 * Skylake Server and Skylake X.
2319 TUNABLE_INT_FETCH("hw.skz63_enable", &skz63);
2322 printf("SKZ63: skipping 4M RAM starting "
2323 "at physical 1G\n");
2324 for (i = 0; i < atop(0x400000); i++) {
2325 ret = vm_page_blacklist_add(0x40000000 +
2327 if (!ret && bootverbose)
2328 printf("page at %#lx already used\n",
2329 0x40000000 + ptoa(i));
2335 pmap_allow_2m_x_ept_recalculate();
2338 * Initialize the vm page array entries for the kernel pmap's
2341 PMAP_LOCK(kernel_pmap);
2342 for (i = 0; i < nkpt; i++) {
2343 mpte = PHYS_TO_VM_PAGE(KPTphys + (i << PAGE_SHIFT));
2344 KASSERT(mpte >= vm_page_array &&
2345 mpte < &vm_page_array[vm_page_array_size],
2346 ("pmap_init: page table page is out of range"));
2347 mpte->pindex = pmap_pde_pindex(KERNBASE) + i;
2348 mpte->phys_addr = KPTphys + (i << PAGE_SHIFT);
2349 mpte->ref_count = 1;
2352 * Collect the page table pages that were replaced by a 2MB
2353 * page in create_pagetables(). They are zero filled.
2355 if ((vm_paddr_t)i << PDRSHIFT < KERNend &&
2356 pmap_insert_pt_page(kernel_pmap, mpte, false))
2357 panic("pmap_init: pmap_insert_pt_page failed");
2359 PMAP_UNLOCK(kernel_pmap);
2363 * If the kernel is running on a virtual machine, then it must assume
2364 * that MCA is enabled by the hypervisor. Moreover, the kernel must
2365 * be prepared for the hypervisor changing the vendor and family that
2366 * are reported by CPUID. Consequently, the workaround for AMD Family
2367 * 10h Erratum 383 is enabled if the processor's feature set does not
2368 * include at least one feature that is only supported by older Intel
2369 * or newer AMD processors.
2371 if (vm_guest != VM_GUEST_NO && (cpu_feature & CPUID_SS) == 0 &&
2372 (cpu_feature2 & (CPUID2_SSSE3 | CPUID2_SSE41 | CPUID2_AESNI |
2373 CPUID2_AVX | CPUID2_XSAVE)) == 0 && (amd_feature2 & (AMDID2_XOP |
2375 workaround_erratum383 = 1;
2378 * Are large page mappings enabled?
2380 TUNABLE_INT_FETCH("vm.pmap.pg_ps_enabled", &pg_ps_enabled);
2381 if (pg_ps_enabled) {
2382 KASSERT(MAXPAGESIZES > 1 && pagesizes[1] == 0,
2383 ("pmap_init: can't assign to pagesizes[1]"));
2384 pagesizes[1] = NBPDR;
2388 * Initialize pv chunk lists.
2390 for (i = 0; i < PMAP_MEMDOM; i++) {
2391 mtx_init(&pv_chunks[i].pvc_lock, "pmap pv chunk list", NULL, MTX_DEF);
2392 TAILQ_INIT(&pv_chunks[i].pvc_list);
2394 pmap_init_pv_table();
2396 pmap_initialized = 1;
2397 for (i = 0; i < PMAP_PREINIT_MAPPING_COUNT; i++) {
2398 ppim = pmap_preinit_mapping + i;
2401 /* Make the direct map consistent */
2402 if (ppim->pa < dmaplimit && ppim->pa + ppim->sz <= dmaplimit) {
2403 (void)pmap_change_attr(PHYS_TO_DMAP(ppim->pa),
2404 ppim->sz, ppim->mode);
2408 printf("PPIM %u: PA=%#lx, VA=%#lx, size=%#lx, mode=%#x\n", i,
2409 ppim->pa, ppim->va, ppim->sz, ppim->mode);
2412 mtx_init(&qframe_mtx, "qfrmlk", NULL, MTX_SPIN);
2413 error = vmem_alloc(kernel_arena, PAGE_SIZE, M_BESTFIT | M_WAITOK,
2414 (vmem_addr_t *)&qframe);
2416 panic("qframe allocation failed");
2419 TUNABLE_INT_FETCH("vm.pmap.large_map_pml4_entries", &lm_ents);
2420 if (lm_ents > LMEPML4I - LMSPML4I + 1)
2421 lm_ents = LMEPML4I - LMSPML4I + 1;
2423 printf("pmap: large map %u PML4 slots (%lu GB)\n",
2424 lm_ents, (u_long)lm_ents * (NBPML4 / 1024 / 1024 / 1024));
2426 large_vmem = vmem_create("large", LARGEMAP_MIN_ADDRESS,
2427 (vmem_size_t)lm_ents * NBPML4, PAGE_SIZE, 0, M_WAITOK);
2428 if (large_vmem == NULL) {
2429 printf("pmap: cannot create large map\n");
2432 for (i = 0; i < lm_ents; i++) {
2433 m = pmap_large_map_getptp_unlocked();
2435 kernel_pml4[LMSPML4I + i] = X86_PG_V |
2436 X86_PG_RW | X86_PG_A | X86_PG_M | pg_nx |
2442 SYSCTL_UINT(_vm_pmap, OID_AUTO, large_map_pml4_entries,
2443 CTLFLAG_RDTUN | CTLFLAG_NOFETCH, &lm_ents, 0,
2444 "Maximum number of PML4 entries for use by large map (tunable). "
2445 "Each entry corresponds to 512GB of address space.");
2447 static SYSCTL_NODE(_vm_pmap, OID_AUTO, pde, CTLFLAG_RD | CTLFLAG_MPSAFE, 0,
2448 "2MB page mapping counters");
2450 static u_long pmap_pde_demotions;
2451 SYSCTL_ULONG(_vm_pmap_pde, OID_AUTO, demotions, CTLFLAG_RD,
2452 &pmap_pde_demotions, 0, "2MB page demotions");
2454 static u_long pmap_pde_mappings;
2455 SYSCTL_ULONG(_vm_pmap_pde, OID_AUTO, mappings, CTLFLAG_RD,
2456 &pmap_pde_mappings, 0, "2MB page mappings");
2458 static u_long pmap_pde_p_failures;
2459 SYSCTL_ULONG(_vm_pmap_pde, OID_AUTO, p_failures, CTLFLAG_RD,
2460 &pmap_pde_p_failures, 0, "2MB page promotion failures");
2462 static u_long pmap_pde_promotions;
2463 SYSCTL_ULONG(_vm_pmap_pde, OID_AUTO, promotions, CTLFLAG_RD,
2464 &pmap_pde_promotions, 0, "2MB page promotions");
2466 static SYSCTL_NODE(_vm_pmap, OID_AUTO, pdpe, CTLFLAG_RD | CTLFLAG_MPSAFE, 0,
2467 "1GB page mapping counters");
2469 static u_long pmap_pdpe_demotions;
2470 SYSCTL_ULONG(_vm_pmap_pdpe, OID_AUTO, demotions, CTLFLAG_RD,
2471 &pmap_pdpe_demotions, 0, "1GB page demotions");
2473 /***************************************************
2474 * Low level helper routines.....
2475 ***************************************************/
2478 pmap_swap_pat(pmap_t pmap, pt_entry_t entry)
2480 int x86_pat_bits = X86_PG_PTE_PAT | X86_PG_PDE_PAT;
2482 switch (pmap->pm_type) {
2485 /* Verify that both PAT bits are not set at the same time */
2486 KASSERT((entry & x86_pat_bits) != x86_pat_bits,
2487 ("Invalid PAT bits in entry %#lx", entry));
2489 /* Swap the PAT bits if one of them is set */
2490 if ((entry & x86_pat_bits) != 0)
2491 entry ^= x86_pat_bits;
2495 * Nothing to do - the memory attributes are represented
2496 * the same way for regular pages and superpages.
2500 panic("pmap_switch_pat_bits: bad pm_type %d", pmap->pm_type);
2507 pmap_is_valid_memattr(pmap_t pmap __unused, vm_memattr_t mode)
2510 return (mode >= 0 && mode < PAT_INDEX_SIZE &&
2511 pat_index[(int)mode] >= 0);
2515 * Determine the appropriate bits to set in a PTE or PDE for a specified
2519 pmap_cache_bits(pmap_t pmap, int mode, boolean_t is_pde)
2521 int cache_bits, pat_flag, pat_idx;
2523 if (!pmap_is_valid_memattr(pmap, mode))
2524 panic("Unknown caching mode %d\n", mode);
2526 switch (pmap->pm_type) {
2529 /* The PAT bit is different for PTE's and PDE's. */
2530 pat_flag = is_pde ? X86_PG_PDE_PAT : X86_PG_PTE_PAT;
2532 /* Map the caching mode to a PAT index. */
2533 pat_idx = pat_index[mode];
2535 /* Map the 3-bit index value into the PAT, PCD, and PWT bits. */
2538 cache_bits |= pat_flag;
2540 cache_bits |= PG_NC_PCD;
2542 cache_bits |= PG_NC_PWT;
2546 cache_bits = EPT_PG_IGNORE_PAT | EPT_PG_MEMORY_TYPE(mode);
2550 panic("unsupported pmap type %d", pmap->pm_type);
2553 return (cache_bits);
2557 pmap_cache_mask(pmap_t pmap, boolean_t is_pde)
2561 switch (pmap->pm_type) {
2564 mask = is_pde ? X86_PG_PDE_CACHE : X86_PG_PTE_CACHE;
2567 mask = EPT_PG_IGNORE_PAT | EPT_PG_MEMORY_TYPE(0x7);
2570 panic("pmap_cache_mask: invalid pm_type %d", pmap->pm_type);
2577 pmap_pat_index(pmap_t pmap, pt_entry_t pte, bool is_pde)
2579 int pat_flag, pat_idx;
2582 switch (pmap->pm_type) {
2585 /* The PAT bit is different for PTE's and PDE's. */
2586 pat_flag = is_pde ? X86_PG_PDE_PAT : X86_PG_PTE_PAT;
2588 if ((pte & pat_flag) != 0)
2590 if ((pte & PG_NC_PCD) != 0)
2592 if ((pte & PG_NC_PWT) != 0)
2596 if ((pte & EPT_PG_IGNORE_PAT) != 0)
2597 panic("EPT PTE %#lx has no PAT memory type", pte);
2598 pat_idx = (pte & EPT_PG_MEMORY_TYPE(0x7)) >> 3;
2602 /* See pmap_init_pat(). */
2612 pmap_ps_enabled(pmap_t pmap)
2615 return (pg_ps_enabled && (pmap->pm_flags & PMAP_PDE_SUPERPAGE) != 0);
2619 pmap_update_pde_store(pmap_t pmap, pd_entry_t *pde, pd_entry_t newpde)
2622 switch (pmap->pm_type) {
2629 * This is a little bogus since the generation number is
2630 * supposed to be bumped up when a region of the address
2631 * space is invalidated in the page tables.
2633 * In this case the old PDE entry is valid but yet we want
2634 * to make sure that any mappings using the old entry are
2635 * invalidated in the TLB.
2637 * The reason this works as expected is because we rendezvous
2638 * "all" host cpus and force any vcpu context to exit as a
2641 atomic_add_acq_long(&pmap->pm_eptgen, 1);
2644 panic("pmap_update_pde_store: bad pm_type %d", pmap->pm_type);
2646 pde_store(pde, newpde);
2650 * After changing the page size for the specified virtual address in the page
2651 * table, flush the corresponding entries from the processor's TLB. Only the
2652 * calling processor's TLB is affected.
2654 * The calling thread must be pinned to a processor.
2657 pmap_update_pde_invalidate(pmap_t pmap, vm_offset_t va, pd_entry_t newpde)
2661 if (pmap_type_guest(pmap))
2664 KASSERT(pmap->pm_type == PT_X86,
2665 ("pmap_update_pde_invalidate: invalid type %d", pmap->pm_type));
2667 PG_G = pmap_global_bit(pmap);
2669 if ((newpde & PG_PS) == 0)
2670 /* Demotion: flush a specific 2MB page mapping. */
2672 else if ((newpde & PG_G) == 0)
2674 * Promotion: flush every 4KB page mapping from the TLB
2675 * because there are too many to flush individually.
2680 * Promotion: flush every 4KB page mapping from the TLB,
2681 * including any global (PG_G) mappings.
2689 * For SMP, these functions have to use the IPI mechanism for coherence.
2691 * N.B.: Before calling any of the following TLB invalidation functions,
2692 * the calling processor must ensure that all stores updating a non-
2693 * kernel page table are globally performed. Otherwise, another
2694 * processor could cache an old, pre-update entry without being
2695 * invalidated. This can happen one of two ways: (1) The pmap becomes
2696 * active on another processor after its pm_active field is checked by
2697 * one of the following functions but before a store updating the page
2698 * table is globally performed. (2) The pmap becomes active on another
2699 * processor before its pm_active field is checked but due to
2700 * speculative loads one of the following functions stills reads the
2701 * pmap as inactive on the other processor.
2703 * The kernel page table is exempt because its pm_active field is
2704 * immutable. The kernel page table is always active on every
2709 * Interrupt the cpus that are executing in the guest context.
2710 * This will force the vcpu to exit and the cached EPT mappings
2711 * will be invalidated by the host before the next vmresume.
2713 static __inline void
2714 pmap_invalidate_ept(pmap_t pmap)
2719 KASSERT(!CPU_ISSET(curcpu, &pmap->pm_active),
2720 ("pmap_invalidate_ept: absurd pm_active"));
2723 * The TLB mappings associated with a vcpu context are not
2724 * flushed each time a different vcpu is chosen to execute.
2726 * This is in contrast with a process's vtop mappings that
2727 * are flushed from the TLB on each context switch.
2729 * Therefore we need to do more than just a TLB shootdown on
2730 * the active cpus in 'pmap->pm_active'. To do this we keep
2731 * track of the number of invalidations performed on this pmap.
2733 * Each vcpu keeps a cache of this counter and compares it
2734 * just before a vmresume. If the counter is out-of-date an
2735 * invept will be done to flush stale mappings from the TLB.
2737 atomic_add_acq_long(&pmap->pm_eptgen, 1);
2740 * Force the vcpu to exit and trap back into the hypervisor.
2742 ipinum = pmap->pm_flags & PMAP_NESTED_IPIMASK;
2743 ipi_selected(pmap->pm_active, ipinum);
2748 pmap_invalidate_cpu_mask(pmap_t pmap)
2751 return (pmap == kernel_pmap ? all_cpus : pmap->pm_active);
2755 pmap_invalidate_page_pcid(pmap_t pmap, vm_offset_t va,
2756 const bool invpcid_works1)
2758 struct invpcid_descr d;
2759 uint64_t kcr3, ucr3;
2763 cpuid = PCPU_GET(cpuid);
2764 if (pmap == PCPU_GET(curpmap)) {
2765 if (pmap->pm_ucr3 != PMAP_NO_CR3 &&
2767 * If we context-switched right after
2768 * PCPU_GET(ucr3_load_mask), we could read the
2769 * ~CR3_PCID_SAVE mask, which causes us to skip
2770 * the code below to invalidate user pages. This
2771 * is handled in pmap_activate_sw_pcid_pti() by
2772 * clearing pm_gen if ucr3_load_mask is ~CR3_PCID_SAVE.
2774 PCPU_GET(ucr3_load_mask) == PMAP_UCR3_NOMASK) {
2776 * Because pm_pcid is recalculated on a
2777 * context switch, we must disable switching.
2778 * Otherwise, we might use a stale value
2782 pcid = pmap->pm_pcids[cpuid].pm_pcid;
2783 if (invpcid_works1) {
2784 d.pcid = pcid | PMAP_PCID_USER_PT;
2787 invpcid(&d, INVPCID_ADDR);
2789 kcr3 = pmap->pm_cr3 | pcid | CR3_PCID_SAVE;
2790 ucr3 = pmap->pm_ucr3 | pcid |
2791 PMAP_PCID_USER_PT | CR3_PCID_SAVE;
2792 pmap_pti_pcid_invlpg(ucr3, kcr3, va);
2797 pmap->pm_pcids[cpuid].pm_gen = 0;
2801 pmap->pm_pcids[i].pm_gen = 0;
2805 * The fence is between stores to pm_gen and the read of the
2806 * pm_active mask. We need to ensure that it is impossible
2807 * for us to miss the bit update in pm_active and
2808 * simultaneously observe a non-zero pm_gen in
2809 * pmap_activate_sw(), otherwise TLB update is missed.
2810 * Without the fence, IA32 allows such an outcome. Note that
2811 * pm_active is updated by a locked operation, which provides
2812 * the reciprocal fence.
2814 atomic_thread_fence_seq_cst();
2818 pmap_invalidate_page_pcid_invpcid(pmap_t pmap, vm_offset_t va)
2821 pmap_invalidate_page_pcid(pmap, va, true);
2825 pmap_invalidate_page_pcid_noinvpcid(pmap_t pmap, vm_offset_t va)
2828 pmap_invalidate_page_pcid(pmap, va, false);
2832 pmap_invalidate_page_nopcid(pmap_t pmap, vm_offset_t va)
2836 DEFINE_IFUNC(static, void, pmap_invalidate_page_mode, (pmap_t, vm_offset_t))
2839 if (pmap_pcid_enabled)
2840 return (invpcid_works ? pmap_invalidate_page_pcid_invpcid :
2841 pmap_invalidate_page_pcid_noinvpcid);
2842 return (pmap_invalidate_page_nopcid);
2846 pmap_invalidate_page_curcpu_cb(pmap_t pmap, vm_offset_t va,
2847 vm_offset_t addr2 __unused)
2850 if (pmap == kernel_pmap) {
2853 if (pmap == PCPU_GET(curpmap))
2855 pmap_invalidate_page_mode(pmap, va);
2860 pmap_invalidate_page(pmap_t pmap, vm_offset_t va)
2863 if (pmap_type_guest(pmap)) {
2864 pmap_invalidate_ept(pmap);
2868 KASSERT(pmap->pm_type == PT_X86,
2869 ("pmap_invalidate_page: invalid type %d", pmap->pm_type));
2871 smp_masked_invlpg(pmap_invalidate_cpu_mask(pmap), va, pmap,
2872 pmap_invalidate_page_curcpu_cb);
2875 /* 4k PTEs -- Chosen to exceed the total size of Broadwell L2 TLB */
2876 #define PMAP_INVLPG_THRESHOLD (4 * 1024 * PAGE_SIZE)
2879 pmap_invalidate_range_pcid(pmap_t pmap, vm_offset_t sva, vm_offset_t eva,
2880 const bool invpcid_works1)
2882 struct invpcid_descr d;
2883 uint64_t kcr3, ucr3;
2887 cpuid = PCPU_GET(cpuid);
2888 if (pmap == PCPU_GET(curpmap)) {
2889 if (pmap->pm_ucr3 != PMAP_NO_CR3 &&
2890 PCPU_GET(ucr3_load_mask) == PMAP_UCR3_NOMASK) {
2892 pcid = pmap->pm_pcids[cpuid].pm_pcid;
2893 if (invpcid_works1) {
2894 d.pcid = pcid | PMAP_PCID_USER_PT;
2897 for (; d.addr < eva; d.addr += PAGE_SIZE)
2898 invpcid(&d, INVPCID_ADDR);
2900 kcr3 = pmap->pm_cr3 | pcid | CR3_PCID_SAVE;
2901 ucr3 = pmap->pm_ucr3 | pcid |
2902 PMAP_PCID_USER_PT | CR3_PCID_SAVE;
2903 pmap_pti_pcid_invlrng(ucr3, kcr3, sva, eva);
2908 pmap->pm_pcids[cpuid].pm_gen = 0;
2912 pmap->pm_pcids[i].pm_gen = 0;
2914 /* See the comment in pmap_invalidate_page_pcid(). */
2915 atomic_thread_fence_seq_cst();
2919 pmap_invalidate_range_pcid_invpcid(pmap_t pmap, vm_offset_t sva,
2923 pmap_invalidate_range_pcid(pmap, sva, eva, true);
2927 pmap_invalidate_range_pcid_noinvpcid(pmap_t pmap, vm_offset_t sva,
2931 pmap_invalidate_range_pcid(pmap, sva, eva, false);
2935 pmap_invalidate_range_nopcid(pmap_t pmap, vm_offset_t sva, vm_offset_t eva)
2939 DEFINE_IFUNC(static, void, pmap_invalidate_range_mode, (pmap_t, vm_offset_t,
2943 if (pmap_pcid_enabled)
2944 return (invpcid_works ? pmap_invalidate_range_pcid_invpcid :
2945 pmap_invalidate_range_pcid_noinvpcid);
2946 return (pmap_invalidate_range_nopcid);
2950 pmap_invalidate_range_curcpu_cb(pmap_t pmap, vm_offset_t sva, vm_offset_t eva)
2954 if (pmap == kernel_pmap) {
2955 for (addr = sva; addr < eva; addr += PAGE_SIZE)
2958 if (pmap == PCPU_GET(curpmap)) {
2959 for (addr = sva; addr < eva; addr += PAGE_SIZE)
2962 pmap_invalidate_range_mode(pmap, sva, eva);
2967 pmap_invalidate_range(pmap_t pmap, vm_offset_t sva, vm_offset_t eva)
2970 if (eva - sva >= PMAP_INVLPG_THRESHOLD) {
2971 pmap_invalidate_all(pmap);
2975 if (pmap_type_guest(pmap)) {
2976 pmap_invalidate_ept(pmap);
2980 KASSERT(pmap->pm_type == PT_X86,
2981 ("pmap_invalidate_range: invalid type %d", pmap->pm_type));
2983 smp_masked_invlpg_range(pmap_invalidate_cpu_mask(pmap), sva, eva, pmap,
2984 pmap_invalidate_range_curcpu_cb);
2988 pmap_invalidate_all_pcid(pmap_t pmap, bool invpcid_works1)
2990 struct invpcid_descr d;
2995 if (pmap == kernel_pmap) {
2996 if (invpcid_works1) {
2997 bzero(&d, sizeof(d));
2998 invpcid(&d, INVPCID_CTXGLOB);
3003 cpuid = PCPU_GET(cpuid);
3004 if (pmap == PCPU_GET(curpmap)) {
3006 pcid = pmap->pm_pcids[cpuid].pm_pcid;
3007 if (invpcid_works1) {
3011 invpcid(&d, INVPCID_CTX);
3013 kcr3 = pmap->pm_cr3 | pcid;
3016 if (pmap->pm_ucr3 != PMAP_NO_CR3)
3017 PCPU_SET(ucr3_load_mask, ~CR3_PCID_SAVE);
3020 pmap->pm_pcids[cpuid].pm_gen = 0;
3023 pmap->pm_pcids[i].pm_gen = 0;
3026 /* See the comment in pmap_invalidate_page_pcid(). */
3027 atomic_thread_fence_seq_cst();
3031 pmap_invalidate_all_pcid_invpcid(pmap_t pmap)
3034 pmap_invalidate_all_pcid(pmap, true);
3038 pmap_invalidate_all_pcid_noinvpcid(pmap_t pmap)
3041 pmap_invalidate_all_pcid(pmap, false);
3045 pmap_invalidate_all_nopcid(pmap_t pmap)
3048 if (pmap == kernel_pmap)
3050 else if (pmap == PCPU_GET(curpmap))
3054 DEFINE_IFUNC(static, void, pmap_invalidate_all_mode, (pmap_t))
3057 if (pmap_pcid_enabled)
3058 return (invpcid_works ? pmap_invalidate_all_pcid_invpcid :
3059 pmap_invalidate_all_pcid_noinvpcid);
3060 return (pmap_invalidate_all_nopcid);
3064 pmap_invalidate_all_curcpu_cb(pmap_t pmap, vm_offset_t addr1 __unused,
3065 vm_offset_t addr2 __unused)
3068 pmap_invalidate_all_mode(pmap);
3072 pmap_invalidate_all(pmap_t pmap)
3075 if (pmap_type_guest(pmap)) {
3076 pmap_invalidate_ept(pmap);
3080 KASSERT(pmap->pm_type == PT_X86,
3081 ("pmap_invalidate_all: invalid type %d", pmap->pm_type));
3083 smp_masked_invltlb(pmap_invalidate_cpu_mask(pmap), pmap,
3084 pmap_invalidate_all_curcpu_cb);
3088 pmap_invalidate_cache_curcpu_cb(pmap_t pmap __unused, vm_offset_t va __unused,
3089 vm_offset_t addr2 __unused)
3096 pmap_invalidate_cache(void)
3099 smp_cache_flush(pmap_invalidate_cache_curcpu_cb);
3103 cpuset_t invalidate; /* processors that invalidate their TLB */
3108 u_int store; /* processor that updates the PDE */
3112 pmap_update_pde_action(void *arg)
3114 struct pde_action *act = arg;
3116 if (act->store == PCPU_GET(cpuid))
3117 pmap_update_pde_store(act->pmap, act->pde, act->newpde);
3121 pmap_update_pde_teardown(void *arg)
3123 struct pde_action *act = arg;
3125 if (CPU_ISSET(PCPU_GET(cpuid), &act->invalidate))
3126 pmap_update_pde_invalidate(act->pmap, act->va, act->newpde);
3130 * Change the page size for the specified virtual address in a way that
3131 * prevents any possibility of the TLB ever having two entries that map the
3132 * same virtual address using different page sizes. This is the recommended
3133 * workaround for Erratum 383 on AMD Family 10h processors. It prevents a
3134 * machine check exception for a TLB state that is improperly diagnosed as a
3138 pmap_update_pde(pmap_t pmap, vm_offset_t va, pd_entry_t *pde, pd_entry_t newpde)
3140 struct pde_action act;
3141 cpuset_t active, other_cpus;
3145 cpuid = PCPU_GET(cpuid);
3146 other_cpus = all_cpus;
3147 CPU_CLR(cpuid, &other_cpus);
3148 if (pmap == kernel_pmap || pmap_type_guest(pmap))
3151 active = pmap->pm_active;
3153 if (CPU_OVERLAP(&active, &other_cpus)) {
3155 act.invalidate = active;
3159 act.newpde = newpde;
3160 CPU_SET(cpuid, &active);
3161 smp_rendezvous_cpus(active,
3162 smp_no_rendezvous_barrier, pmap_update_pde_action,
3163 pmap_update_pde_teardown, &act);
3165 pmap_update_pde_store(pmap, pde, newpde);
3166 if (CPU_ISSET(cpuid, &active))
3167 pmap_update_pde_invalidate(pmap, va, newpde);
3173 * Normal, non-SMP, invalidation functions.
3176 pmap_invalidate_page(pmap_t pmap, vm_offset_t va)
3178 struct invpcid_descr d;
3179 uint64_t kcr3, ucr3;
3182 if (pmap->pm_type == PT_RVI || pmap->pm_type == PT_EPT) {
3186 KASSERT(pmap->pm_type == PT_X86,
3187 ("pmap_invalidate_range: unknown type %d", pmap->pm_type));
3189 if (pmap == kernel_pmap || pmap == PCPU_GET(curpmap)) {
3191 if (pmap == PCPU_GET(curpmap) && pmap_pcid_enabled &&
3192 pmap->pm_ucr3 != PMAP_NO_CR3) {
3194 pcid = pmap->pm_pcids[0].pm_pcid;
3195 if (invpcid_works) {
3196 d.pcid = pcid | PMAP_PCID_USER_PT;
3199 invpcid(&d, INVPCID_ADDR);
3201 kcr3 = pmap->pm_cr3 | pcid | CR3_PCID_SAVE;
3202 ucr3 = pmap->pm_ucr3 | pcid |
3203 PMAP_PCID_USER_PT | CR3_PCID_SAVE;
3204 pmap_pti_pcid_invlpg(ucr3, kcr3, va);
3208 } else if (pmap_pcid_enabled)
3209 pmap->pm_pcids[0].pm_gen = 0;
3213 pmap_invalidate_range(pmap_t pmap, vm_offset_t sva, vm_offset_t eva)
3215 struct invpcid_descr d;
3217 uint64_t kcr3, ucr3;
3219 if (pmap->pm_type == PT_RVI || pmap->pm_type == PT_EPT) {
3223 KASSERT(pmap->pm_type == PT_X86,
3224 ("pmap_invalidate_range: unknown type %d", pmap->pm_type));
3226 if (pmap == kernel_pmap || pmap == PCPU_GET(curpmap)) {
3227 for (addr = sva; addr < eva; addr += PAGE_SIZE)
3229 if (pmap == PCPU_GET(curpmap) && pmap_pcid_enabled &&
3230 pmap->pm_ucr3 != PMAP_NO_CR3) {
3232 if (invpcid_works) {
3233 d.pcid = pmap->pm_pcids[0].pm_pcid |
3237 for (; d.addr < eva; d.addr += PAGE_SIZE)
3238 invpcid(&d, INVPCID_ADDR);
3240 kcr3 = pmap->pm_cr3 | pmap->pm_pcids[0].
3241 pm_pcid | CR3_PCID_SAVE;
3242 ucr3 = pmap->pm_ucr3 | pmap->pm_pcids[0].
3243 pm_pcid | PMAP_PCID_USER_PT | CR3_PCID_SAVE;
3244 pmap_pti_pcid_invlrng(ucr3, kcr3, sva, eva);
3248 } else if (pmap_pcid_enabled) {
3249 pmap->pm_pcids[0].pm_gen = 0;
3254 pmap_invalidate_all(pmap_t pmap)
3256 struct invpcid_descr d;
3257 uint64_t kcr3, ucr3;
3259 if (pmap->pm_type == PT_RVI || pmap->pm_type == PT_EPT) {
3263 KASSERT(pmap->pm_type == PT_X86,
3264 ("pmap_invalidate_all: unknown type %d", pmap->pm_type));
3266 if (pmap == kernel_pmap) {
3267 if (pmap_pcid_enabled && invpcid_works) {
3268 bzero(&d, sizeof(d));
3269 invpcid(&d, INVPCID_CTXGLOB);
3273 } else if (pmap == PCPU_GET(curpmap)) {
3274 if (pmap_pcid_enabled) {
3276 if (invpcid_works) {
3277 d.pcid = pmap->pm_pcids[0].pm_pcid;
3280 invpcid(&d, INVPCID_CTX);
3281 if (pmap->pm_ucr3 != PMAP_NO_CR3) {
3282 d.pcid |= PMAP_PCID_USER_PT;
3283 invpcid(&d, INVPCID_CTX);
3286 kcr3 = pmap->pm_cr3 | pmap->pm_pcids[0].pm_pcid;
3287 if (pmap->pm_ucr3 != PMAP_NO_CR3) {
3288 ucr3 = pmap->pm_ucr3 | pmap->pm_pcids[
3289 0].pm_pcid | PMAP_PCID_USER_PT;
3290 pmap_pti_pcid_invalidate(ucr3, kcr3);
3298 } else if (pmap_pcid_enabled) {
3299 pmap->pm_pcids[0].pm_gen = 0;
3304 pmap_invalidate_cache(void)
3311 pmap_update_pde(pmap_t pmap, vm_offset_t va, pd_entry_t *pde, pd_entry_t newpde)
3314 pmap_update_pde_store(pmap, pde, newpde);
3315 if (pmap == kernel_pmap || pmap == PCPU_GET(curpmap))
3316 pmap_update_pde_invalidate(pmap, va, newpde);
3318 pmap->pm_pcids[0].pm_gen = 0;
3323 pmap_invalidate_pde_page(pmap_t pmap, vm_offset_t va, pd_entry_t pde)
3327 * When the PDE has PG_PROMOTED set, the 2MB page mapping was created
3328 * by a promotion that did not invalidate the 512 4KB page mappings
3329 * that might exist in the TLB. Consequently, at this point, the TLB
3330 * may hold both 4KB and 2MB page mappings for the address range [va,
3331 * va + NBPDR). Therefore, the entire range must be invalidated here.
3332 * In contrast, when PG_PROMOTED is clear, the TLB will not hold any
3333 * 4KB page mappings for the address range [va, va + NBPDR), and so a
3334 * single INVLPG suffices to invalidate the 2MB page mapping from the
3337 if ((pde & PG_PROMOTED) != 0)
3338 pmap_invalidate_range(pmap, va, va + NBPDR - 1);
3340 pmap_invalidate_page(pmap, va);
3343 DEFINE_IFUNC(, void, pmap_invalidate_cache_range,
3344 (vm_offset_t sva, vm_offset_t eva))
3347 if ((cpu_feature & CPUID_SS) != 0)
3348 return (pmap_invalidate_cache_range_selfsnoop);
3349 if ((cpu_feature & CPUID_CLFSH) != 0)
3350 return (pmap_force_invalidate_cache_range);
3351 return (pmap_invalidate_cache_range_all);
3354 #define PMAP_CLFLUSH_THRESHOLD (2 * 1024 * 1024)
3357 pmap_invalidate_cache_range_check_align(vm_offset_t sva, vm_offset_t eva)
3360 KASSERT((sva & PAGE_MASK) == 0,
3361 ("pmap_invalidate_cache_range: sva not page-aligned"));
3362 KASSERT((eva & PAGE_MASK) == 0,
3363 ("pmap_invalidate_cache_range: eva not page-aligned"));
3367 pmap_invalidate_cache_range_selfsnoop(vm_offset_t sva, vm_offset_t eva)
3370 pmap_invalidate_cache_range_check_align(sva, eva);
3374 pmap_force_invalidate_cache_range(vm_offset_t sva, vm_offset_t eva)
3377 sva &= ~(vm_offset_t)(cpu_clflush_line_size - 1);
3380 * XXX: Some CPUs fault, hang, or trash the local APIC
3381 * registers if we use CLFLUSH on the local APIC range. The
3382 * local APIC is always uncached, so we don't need to flush
3383 * for that range anyway.
3385 if (pmap_kextract(sva) == lapic_paddr)
3388 if ((cpu_stdext_feature & CPUID_STDEXT_CLFLUSHOPT) != 0) {
3390 * Do per-cache line flush. Use a locked
3391 * instruction to insure that previous stores are
3392 * included in the write-back. The processor
3393 * propagates flush to other processors in the cache
3396 atomic_thread_fence_seq_cst();
3397 for (; sva < eva; sva += cpu_clflush_line_size)
3399 atomic_thread_fence_seq_cst();
3402 * Writes are ordered by CLFLUSH on Intel CPUs.
3404 if (cpu_vendor_id != CPU_VENDOR_INTEL)
3406 for (; sva < eva; sva += cpu_clflush_line_size)
3408 if (cpu_vendor_id != CPU_VENDOR_INTEL)
3414 pmap_invalidate_cache_range_all(vm_offset_t sva, vm_offset_t eva)
3417 pmap_invalidate_cache_range_check_align(sva, eva);
3418 pmap_invalidate_cache();
3422 * Remove the specified set of pages from the data and instruction caches.
3424 * In contrast to pmap_invalidate_cache_range(), this function does not
3425 * rely on the CPU's self-snoop feature, because it is intended for use
3426 * when moving pages into a different cache domain.
3429 pmap_invalidate_cache_pages(vm_page_t *pages, int count)
3431 vm_offset_t daddr, eva;
3435 useclflushopt = (cpu_stdext_feature & CPUID_STDEXT_CLFLUSHOPT) != 0;
3436 if (count >= PMAP_CLFLUSH_THRESHOLD / PAGE_SIZE ||
3437 ((cpu_feature & CPUID_CLFSH) == 0 && !useclflushopt))
3438 pmap_invalidate_cache();
3441 atomic_thread_fence_seq_cst();
3442 else if (cpu_vendor_id != CPU_VENDOR_INTEL)
3444 for (i = 0; i < count; i++) {
3445 daddr = PHYS_TO_DMAP(VM_PAGE_TO_PHYS(pages[i]));
3446 eva = daddr + PAGE_SIZE;
3447 for (; daddr < eva; daddr += cpu_clflush_line_size) {
3455 atomic_thread_fence_seq_cst();
3456 else if (cpu_vendor_id != CPU_VENDOR_INTEL)
3462 pmap_flush_cache_range(vm_offset_t sva, vm_offset_t eva)
3465 pmap_invalidate_cache_range_check_align(sva, eva);
3467 if ((cpu_stdext_feature & CPUID_STDEXT_CLWB) == 0) {
3468 pmap_force_invalidate_cache_range(sva, eva);
3472 /* See comment in pmap_force_invalidate_cache_range(). */
3473 if (pmap_kextract(sva) == lapic_paddr)
3476 atomic_thread_fence_seq_cst();
3477 for (; sva < eva; sva += cpu_clflush_line_size)
3479 atomic_thread_fence_seq_cst();
3483 pmap_flush_cache_phys_range(vm_paddr_t spa, vm_paddr_t epa, vm_memattr_t mattr)
3487 int error, pte_bits;
3489 KASSERT((spa & PAGE_MASK) == 0,
3490 ("pmap_flush_cache_phys_range: spa not page-aligned"));
3491 KASSERT((epa & PAGE_MASK) == 0,
3492 ("pmap_flush_cache_phys_range: epa not page-aligned"));
3494 if (spa < dmaplimit) {
3495 pmap_flush_cache_range(PHYS_TO_DMAP(spa), PHYS_TO_DMAP(MIN(
3497 if (dmaplimit >= epa)
3502 pte_bits = pmap_cache_bits(kernel_pmap, mattr, 0) | X86_PG_RW |
3504 error = vmem_alloc(kernel_arena, PAGE_SIZE, M_BESTFIT | M_WAITOK,
3506 KASSERT(error == 0, ("vmem_alloc failed: %d", error));
3507 pte = vtopte(vaddr);
3508 for (; spa < epa; spa += PAGE_SIZE) {
3510 pte_store(pte, spa | pte_bits);
3512 /* XXXKIB atomic inside flush_cache_range are excessive */
3513 pmap_flush_cache_range(vaddr, vaddr + PAGE_SIZE);
3516 vmem_free(kernel_arena, vaddr, PAGE_SIZE);
3520 * Routine: pmap_extract
3522 * Extract the physical page address associated
3523 * with the given map/virtual_address pair.
3526 pmap_extract(pmap_t pmap, vm_offset_t va)
3530 pt_entry_t *pte, PG_V;
3534 PG_V = pmap_valid_bit(pmap);
3536 pdpe = pmap_pdpe(pmap, va);
3537 if (pdpe != NULL && (*pdpe & PG_V) != 0) {
3538 if ((*pdpe & PG_PS) != 0)
3539 pa = (*pdpe & PG_PS_FRAME) | (va & PDPMASK);
3541 pde = pmap_pdpe_to_pde(pdpe, va);
3542 if ((*pde & PG_V) != 0) {
3543 if ((*pde & PG_PS) != 0) {
3544 pa = (*pde & PG_PS_FRAME) |
3547 pte = pmap_pde_to_pte(pde, va);
3548 pa = (*pte & PG_FRAME) |
3559 * Routine: pmap_extract_and_hold
3561 * Atomically extract and hold the physical page
3562 * with the given pmap and virtual address pair
3563 * if that mapping permits the given protection.
3566 pmap_extract_and_hold(pmap_t pmap, vm_offset_t va, vm_prot_t prot)
3568 pd_entry_t pde, *pdep;
3569 pt_entry_t pte, PG_RW, PG_V;
3573 PG_RW = pmap_rw_bit(pmap);
3574 PG_V = pmap_valid_bit(pmap);
3577 pdep = pmap_pde(pmap, va);
3578 if (pdep != NULL && (pde = *pdep)) {
3580 if ((pde & PG_RW) != 0 || (prot & VM_PROT_WRITE) == 0)
3581 m = PHYS_TO_VM_PAGE((pde & PG_PS_FRAME) |
3584 pte = *pmap_pde_to_pte(pdep, va);
3585 if ((pte & PG_V) != 0 &&
3586 ((pte & PG_RW) != 0 || (prot & VM_PROT_WRITE) == 0))
3587 m = PHYS_TO_VM_PAGE(pte & PG_FRAME);
3589 if (m != NULL && !vm_page_wire_mapped(m))
3597 pmap_kextract(vm_offset_t va)
3602 if (va >= DMAP_MIN_ADDRESS && va < DMAP_MAX_ADDRESS) {
3603 pa = DMAP_TO_PHYS(va);
3604 } else if (PMAP_ADDRESS_IN_LARGEMAP(va)) {
3605 pa = pmap_large_map_kextract(va);
3609 pa = (pde & PG_PS_FRAME) | (va & PDRMASK);
3612 * Beware of a concurrent promotion that changes the
3613 * PDE at this point! For example, vtopte() must not
3614 * be used to access the PTE because it would use the
3615 * new PDE. It is, however, safe to use the old PDE
3616 * because the page table page is preserved by the
3619 pa = *pmap_pde_to_pte(&pde, va);
3620 pa = (pa & PG_FRAME) | (va & PAGE_MASK);
3626 /***************************************************
3627 * Low level mapping routines.....
3628 ***************************************************/
3631 * Add a wired page to the kva.
3632 * Note: not SMP coherent.
3635 pmap_kenter(vm_offset_t va, vm_paddr_t pa)
3640 pte_store(pte, pa | X86_PG_RW | X86_PG_V | pg_g | pg_nx);
3643 static __inline void
3644 pmap_kenter_attr(vm_offset_t va, vm_paddr_t pa, int mode)
3650 cache_bits = pmap_cache_bits(kernel_pmap, mode, 0);
3651 pte_store(pte, pa | X86_PG_RW | X86_PG_V | pg_g | pg_nx | cache_bits);
3655 * Remove a page from the kernel pagetables.
3656 * Note: not SMP coherent.
3659 pmap_kremove(vm_offset_t va)
3668 * Used to map a range of physical addresses into kernel
3669 * virtual address space.
3671 * The value passed in '*virt' is a suggested virtual address for
3672 * the mapping. Architectures which can support a direct-mapped
3673 * physical to virtual region can return the appropriate address
3674 * within that region, leaving '*virt' unchanged. Other
3675 * architectures should map the pages starting at '*virt' and
3676 * update '*virt' with the first usable address after the mapped
3680 pmap_map(vm_offset_t *virt, vm_paddr_t start, vm_paddr_t end, int prot)
3682 return PHYS_TO_DMAP(start);
3686 * Add a list of wired pages to the kva
3687 * this routine is only used for temporary
3688 * kernel mappings that do not need to have
3689 * page modification or references recorded.
3690 * Note that old mappings are simply written
3691 * over. The page *must* be wired.
3692 * Note: SMP coherent. Uses a ranged shootdown IPI.
3695 pmap_qenter(vm_offset_t sva, vm_page_t *ma, int count)
3697 pt_entry_t *endpte, oldpte, pa, *pte;
3703 endpte = pte + count;
3704 while (pte < endpte) {
3706 cache_bits = pmap_cache_bits(kernel_pmap, m->md.pat_mode, 0);
3707 pa = VM_PAGE_TO_PHYS(m) | cache_bits;
3708 if ((*pte & (PG_FRAME | X86_PG_PTE_CACHE)) != pa) {
3710 pte_store(pte, pa | pg_g | pg_nx | X86_PG_RW | X86_PG_V);
3714 if (__predict_false((oldpte & X86_PG_V) != 0))
3715 pmap_invalidate_range(kernel_pmap, sva, sva + count *
3720 * This routine tears out page mappings from the
3721 * kernel -- it is meant only for temporary mappings.
3722 * Note: SMP coherent. Uses a ranged shootdown IPI.
3725 pmap_qremove(vm_offset_t sva, int count)
3730 while (count-- > 0) {
3731 KASSERT(va >= VM_MIN_KERNEL_ADDRESS, ("usermode va %lx", va));
3735 pmap_invalidate_range(kernel_pmap, sva, va);
3738 /***************************************************
3739 * Page table page management routines.....
3740 ***************************************************/
3742 * Schedule the specified unused page table page to be freed. Specifically,
3743 * add the page to the specified list of pages that will be released to the
3744 * physical memory manager after the TLB has been updated.
3746 static __inline void
3747 pmap_add_delayed_free_list(vm_page_t m, struct spglist *free,
3748 boolean_t set_PG_ZERO)
3752 m->flags |= PG_ZERO;
3754 m->flags &= ~PG_ZERO;
3755 SLIST_INSERT_HEAD(free, m, plinks.s.ss);
3759 * Inserts the specified page table page into the specified pmap's collection
3760 * of idle page table pages. Each of a pmap's page table pages is responsible
3761 * for mapping a distinct range of virtual addresses. The pmap's collection is
3762 * ordered by this virtual address range.
3764 * If "promoted" is false, then the page table page "mpte" must be zero filled.
3767 pmap_insert_pt_page(pmap_t pmap, vm_page_t mpte, bool promoted)
3770 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
3771 mpte->valid = promoted ? VM_PAGE_BITS_ALL : 0;
3772 return (vm_radix_insert(&pmap->pm_root, mpte));
3776 * Removes the page table page mapping the specified virtual address from the
3777 * specified pmap's collection of idle page table pages, and returns it.
3778 * Otherwise, returns NULL if there is no page table page corresponding to the
3779 * specified virtual address.
3781 static __inline vm_page_t
3782 pmap_remove_pt_page(pmap_t pmap, vm_offset_t va)
3785 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
3786 return (vm_radix_remove(&pmap->pm_root, pmap_pde_pindex(va)));
3790 * Decrements a page table page's reference count, which is used to record the
3791 * number of valid page table entries within the page. If the reference count
3792 * drops to zero, then the page table page is unmapped. Returns TRUE if the
3793 * page table page was unmapped and FALSE otherwise.
3795 static inline boolean_t
3796 pmap_unwire_ptp(pmap_t pmap, vm_offset_t va, vm_page_t m, struct spglist *free)
3800 if (m->ref_count == 0) {
3801 _pmap_unwire_ptp(pmap, va, m, free);
3808 _pmap_unwire_ptp(pmap_t pmap, vm_offset_t va, vm_page_t m, struct spglist *free)
3814 vm_page_t pdpg, pdppg, pml4pg;
3816 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
3819 * unmap the page table page
3821 if (m->pindex >= NUPDE + NUPDPE + NUPML4E) {
3823 MPASS(pmap_is_la57(pmap));
3824 pml5 = pmap_pml5e(pmap, va);
3826 if (pmap->pm_pmltopu != NULL && va <= VM_MAXUSER_ADDRESS) {
3827 pml5 = pmap_pml5e_u(pmap, va);
3830 } else if (m->pindex >= NUPDE + NUPDPE) {
3832 pml4 = pmap_pml4e(pmap, va);
3834 if (!pmap_is_la57(pmap) && pmap->pm_pmltopu != NULL &&
3835 va <= VM_MAXUSER_ADDRESS) {
3836 pml4 = pmap_pml4e_u(pmap, va);
3839 } else if (m->pindex >= NUPDE) {
3841 pdp = pmap_pdpe(pmap, va);
3845 pd = pmap_pde(pmap, va);
3848 pmap_resident_count_dec(pmap, 1);
3849 if (m->pindex < NUPDE) {
3850 /* We just released a PT, unhold the matching PD */
3851 pdpg = PHYS_TO_VM_PAGE(*pmap_pdpe(pmap, va) & PG_FRAME);
3852 pmap_unwire_ptp(pmap, va, pdpg, free);
3853 } else if (m->pindex < NUPDE + NUPDPE) {
3854 /* We just released a PD, unhold the matching PDP */
3855 pdppg = PHYS_TO_VM_PAGE(*pmap_pml4e(pmap, va) & PG_FRAME);
3856 pmap_unwire_ptp(pmap, va, pdppg, free);
3857 } else if (m->pindex < NUPDE + NUPDPE + NUPML4E && pmap_is_la57(pmap)) {
3858 /* We just released a PDP, unhold the matching PML4 */
3859 pml4pg = PHYS_TO_VM_PAGE(*pmap_pml5e(pmap, va) & PG_FRAME);
3860 pmap_unwire_ptp(pmap, va, pml4pg, free);
3864 * Put page on a list so that it is released after
3865 * *ALL* TLB shootdown is done
3867 pmap_add_delayed_free_list(m, free, TRUE);
3871 * After removing a page table entry, this routine is used to
3872 * conditionally free the page, and manage the reference count.
3875 pmap_unuse_pt(pmap_t pmap, vm_offset_t va, pd_entry_t ptepde,
3876 struct spglist *free)
3880 if (va >= VM_MAXUSER_ADDRESS)
3882 KASSERT(ptepde != 0, ("pmap_unuse_pt: ptepde != 0"));
3883 mpte = PHYS_TO_VM_PAGE(ptepde & PG_FRAME);
3884 return (pmap_unwire_ptp(pmap, va, mpte, free));
3888 * Release a page table page reference after a failed attempt to create a
3892 pmap_abort_ptp(pmap_t pmap, vm_offset_t va, vm_page_t mpte)
3894 struct spglist free;
3897 if (pmap_unwire_ptp(pmap, va, mpte, &free)) {
3899 * Although "va" was never mapped, paging-structure caches
3900 * could nonetheless have entries that refer to the freed
3901 * page table pages. Invalidate those entries.
3903 pmap_invalidate_page(pmap, va);
3904 vm_page_free_pages_toq(&free, true);
3909 pmap_pinit0(pmap_t pmap)
3915 PMAP_LOCK_INIT(pmap);
3916 pmap->pm_pmltop = kernel_pmap->pm_pmltop;
3917 pmap->pm_pmltopu = NULL;
3918 pmap->pm_cr3 = kernel_pmap->pm_cr3;
3919 /* hack to keep pmap_pti_pcid_invalidate() alive */
3920 pmap->pm_ucr3 = PMAP_NO_CR3;
3921 pmap->pm_root.rt_root = 0;
3922 CPU_ZERO(&pmap->pm_active);
3923 TAILQ_INIT(&pmap->pm_pvchunk);
3924 bzero(&pmap->pm_stats, sizeof pmap->pm_stats);
3925 pmap->pm_flags = pmap_flags;
3927 pmap->pm_pcids[i].pm_pcid = PMAP_PCID_KERN + 1;
3928 pmap->pm_pcids[i].pm_gen = 1;
3930 pmap_activate_boot(pmap);
3935 p->p_md.md_flags |= P_MD_KPTI;
3938 pmap_thread_init_invl_gen(td);
3940 if ((cpu_stdext_feature2 & CPUID_STDEXT2_PKU) != 0) {
3941 pmap_pkru_ranges_zone = uma_zcreate("pkru ranges",
3942 sizeof(struct pmap_pkru_range), NULL, NULL, NULL, NULL,
3948 pmap_pinit_pml4(vm_page_t pml4pg)
3950 pml4_entry_t *pm_pml4;
3953 pm_pml4 = (pml4_entry_t *)PHYS_TO_DMAP(VM_PAGE_TO_PHYS(pml4pg));
3955 /* Wire in kernel global address entries. */
3956 for (i = 0; i < NKPML4E; i++) {
3957 pm_pml4[KPML4BASE + i] = (KPDPphys + ptoa(i)) | X86_PG_RW |
3960 for (i = 0; i < ndmpdpphys; i++) {
3961 pm_pml4[DMPML4I + i] = (DMPDPphys + ptoa(i)) | X86_PG_RW |
3965 /* install self-referential address mapping entry(s) */
3966 pm_pml4[PML4PML4I] = VM_PAGE_TO_PHYS(pml4pg) | X86_PG_V | X86_PG_RW |
3967 X86_PG_A | X86_PG_M;
3969 /* install large map entries if configured */
3970 for (i = 0; i < lm_ents; i++)
3971 pm_pml4[LMSPML4I + i] = kernel_pmap->pm_pmltop[LMSPML4I + i];
3975 pmap_pinit_pml5(vm_page_t pml5pg)
3977 pml5_entry_t *pm_pml5;
3979 pm_pml5 = (pml5_entry_t *)PHYS_TO_DMAP(VM_PAGE_TO_PHYS(pml5pg));
3982 * Add pml5 entry at top of KVA pointing to existing pml4 table,
3983 * entering all existing kernel mappings into level 5 table.
3985 pm_pml5[pmap_pml5e_index(UPT_MAX_ADDRESS)] = KPML4phys | X86_PG_V |
3986 X86_PG_RW | X86_PG_A | X86_PG_M | pg_g |
3987 pmap_cache_bits(kernel_pmap, VM_MEMATTR_DEFAULT, FALSE);
3990 * Install self-referential address mapping entry.
3992 pm_pml5[PML5PML5I] = VM_PAGE_TO_PHYS(pml5pg) |
3993 X86_PG_RW | X86_PG_V | X86_PG_M | X86_PG_A |
3994 pmap_cache_bits(kernel_pmap, VM_MEMATTR_DEFAULT, FALSE);
3998 pmap_pinit_pml4_pti(vm_page_t pml4pgu)
4000 pml4_entry_t *pm_pml4u;
4003 pm_pml4u = (pml4_entry_t *)PHYS_TO_DMAP(VM_PAGE_TO_PHYS(pml4pgu));
4004 for (i = 0; i < NPML4EPG; i++)
4005 pm_pml4u[i] = pti_pml4[i];
4009 pmap_pinit_pml5_pti(vm_page_t pml5pgu)
4011 pml5_entry_t *pm_pml5u;
4013 pm_pml5u = (pml5_entry_t *)PHYS_TO_DMAP(VM_PAGE_TO_PHYS(pml5pgu));
4016 * Add pml5 entry at top of KVA pointing to existing pml4 pti
4017 * table, entering all kernel mappings needed for usermode
4018 * into level 5 table.
4020 pm_pml5u[pmap_pml5e_index(UPT_MAX_ADDRESS)] =
4021 pmap_kextract((vm_offset_t)pti_pml4) |
4022 X86_PG_V | X86_PG_RW | X86_PG_A | X86_PG_M | pg_g |
4023 pmap_cache_bits(kernel_pmap, VM_MEMATTR_DEFAULT, FALSE);
4027 * Initialize a preallocated and zeroed pmap structure,
4028 * such as one in a vmspace structure.
4031 pmap_pinit_type(pmap_t pmap, enum pmap_type pm_type, int flags)
4033 vm_page_t pmltop_pg, pmltop_pgu;
4034 vm_paddr_t pmltop_phys;
4038 * allocate the page directory page
4040 pmltop_pg = vm_page_alloc(NULL, 0, VM_ALLOC_NORMAL | VM_ALLOC_NOOBJ |
4041 VM_ALLOC_WIRED | VM_ALLOC_ZERO | VM_ALLOC_WAITOK);
4043 pmltop_phys = VM_PAGE_TO_PHYS(pmltop_pg);
4044 pmap->pm_pmltop = (pml5_entry_t *)PHYS_TO_DMAP(pmltop_phys);
4047 pmap->pm_pcids[i].pm_pcid = PMAP_PCID_NONE;
4048 pmap->pm_pcids[i].pm_gen = 0;
4050 pmap->pm_cr3 = PMAP_NO_CR3; /* initialize to an invalid value */
4051 pmap->pm_ucr3 = PMAP_NO_CR3;
4052 pmap->pm_pmltopu = NULL;
4054 pmap->pm_type = pm_type;
4055 if ((pmltop_pg->flags & PG_ZERO) == 0)
4056 pagezero(pmap->pm_pmltop);
4059 * Do not install the host kernel mappings in the nested page
4060 * tables. These mappings are meaningless in the guest physical
4062 * Install minimal kernel mappings in PTI case.
4064 if (pm_type == PT_X86) {
4065 pmap->pm_cr3 = pmltop_phys;
4066 if (pmap_is_la57(pmap))
4067 pmap_pinit_pml5(pmltop_pg);
4069 pmap_pinit_pml4(pmltop_pg);
4070 if ((curproc->p_md.md_flags & P_MD_KPTI) != 0) {
4071 pmltop_pgu = vm_page_alloc(NULL, 0, VM_ALLOC_NORMAL |
4072 VM_ALLOC_NOOBJ | VM_ALLOC_WIRED | VM_ALLOC_WAITOK);
4073 pmap->pm_pmltopu = (pml4_entry_t *)PHYS_TO_DMAP(
4074 VM_PAGE_TO_PHYS(pmltop_pgu));
4075 if (pmap_is_la57(pmap))
4076 pmap_pinit_pml5_pti(pmltop_pgu);
4078 pmap_pinit_pml4_pti(pmltop_pgu);
4079 pmap->pm_ucr3 = VM_PAGE_TO_PHYS(pmltop_pgu);
4081 if ((cpu_stdext_feature2 & CPUID_STDEXT2_PKU) != 0) {
4082 rangeset_init(&pmap->pm_pkru, pkru_dup_range,
4083 pkru_free_range, pmap, M_NOWAIT);
4087 pmap->pm_root.rt_root = 0;
4088 CPU_ZERO(&pmap->pm_active);
4089 TAILQ_INIT(&pmap->pm_pvchunk);
4090 bzero(&pmap->pm_stats, sizeof pmap->pm_stats);
4091 pmap->pm_flags = flags;
4092 pmap->pm_eptgen = 0;
4098 pmap_pinit(pmap_t pmap)
4101 return (pmap_pinit_type(pmap, PT_X86, pmap_flags));
4104 static pml4_entry_t *
4105 pmap_allocpte_getpml4(pmap_t pmap, struct rwlock **lockp, vm_offset_t va,
4108 vm_pindex_t pml5index;
4115 if (!pmap_is_la57(pmap))
4116 return (&pmap->pm_pmltop[pmap_pml4e_index(va)]);
4118 PG_V = pmap_valid_bit(pmap);
4119 pml5index = pmap_pml5e_index(va);
4120 pml5 = &pmap->pm_pmltop[pml5index];
4121 if ((*pml5 & PG_V) == 0) {
4122 if (_pmap_allocpte(pmap, pmap_pml5e_pindex(va), lockp, va) ==
4129 pml4 = (pml4_entry_t *)PHYS_TO_DMAP(*pml5 & PG_FRAME);
4130 pml4 = &pml4[pmap_pml4e_index(va)];
4131 if ((*pml4 & PG_V) == 0) {
4132 pml4pg = PHYS_TO_VM_PAGE(*pml5 & PG_FRAME);
4133 if (allocated && !addref)
4134 pml4pg->ref_count--;
4135 else if (!allocated && addref)
4136 pml4pg->ref_count++;
4141 static pdp_entry_t *
4142 pmap_allocpte_getpdp(pmap_t pmap, struct rwlock **lockp, vm_offset_t va,
4151 PG_V = pmap_valid_bit(pmap);
4153 pml4 = pmap_allocpte_getpml4(pmap, lockp, va, false);
4157 if ((*pml4 & PG_V) == 0) {
4158 /* Have to allocate a new pdp, recurse */
4159 if (_pmap_allocpte(pmap, pmap_pml4e_pindex(va), lockp, va) ==
4166 pdp = (pdp_entry_t *)PHYS_TO_DMAP(*pml4 & PG_FRAME);
4167 pdp = &pdp[pmap_pdpe_index(va)];
4168 if ((*pdp & PG_V) == 0) {
4169 pdppg = PHYS_TO_VM_PAGE(*pml4 & PG_FRAME);
4170 if (allocated && !addref)
4172 else if (!allocated && addref)
4179 * This routine is called if the desired page table page does not exist.
4181 * If page table page allocation fails, this routine may sleep before
4182 * returning NULL. It sleeps only if a lock pointer was given.
4184 * Note: If a page allocation fails at page table level two, three, or four,
4185 * up to three pages may be held during the wait, only to be released
4186 * afterwards. This conservative approach is easily argued to avoid
4189 * The ptepindexes, i.e. page indices, of the page table pages encountered
4190 * while translating virtual address va are defined as follows:
4191 * - for the page table page (last level),
4192 * ptepindex = pmap_pde_pindex(va) = va >> PDRSHIFT,
4193 * in other words, it is just the index of the PDE that maps the page
4195 * - for the page directory page,
4196 * ptepindex = NUPDE (number of userland PD entries) +
4197 * (pmap_pde_index(va) >> NPDEPGSHIFT)
4198 * i.e. index of PDPE is put after the last index of PDE,
4199 * - for the page directory pointer page,
4200 * ptepindex = NUPDE + NUPDPE + (pmap_pde_index(va) >> (NPDEPGSHIFT +
4202 * i.e. index of pml4e is put after the last index of PDPE,
4203 * - for the PML4 page (if LA57 mode is enabled),
4204 * ptepindex = NUPDE + NUPDPE + NUPML4E + (pmap_pde_index(va) >>
4205 * (NPDEPGSHIFT + NPML4EPGSHIFT + NPML5EPGSHIFT),
4206 * i.e. index of pml5e is put after the last index of PML4E.
4208 * Define an order on the paging entries, where all entries of the
4209 * same height are put together, then heights are put from deepest to
4210 * root. Then ptexpindex is the sequential number of the
4211 * corresponding paging entry in this order.
4213 * The values of NUPDE, NUPDPE, and NUPML4E are determined by the size of
4214 * LA57 paging structures even in LA48 paging mode. Moreover, the
4215 * ptepindexes are calculated as if the paging structures were 5-level
4216 * regardless of the actual mode of operation.
4218 * The root page at PML4/PML5 does not participate in this indexing scheme,
4219 * since it is statically allocated by pmap_pinit() and not by _pmap_allocpte().
4222 _pmap_allocpte(pmap_t pmap, vm_pindex_t ptepindex, struct rwlock **lockp,
4223 vm_offset_t va __unused)
4225 vm_pindex_t pml5index, pml4index;
4226 pml5_entry_t *pml5, *pml5u;
4227 pml4_entry_t *pml4, *pml4u;
4231 pt_entry_t PG_A, PG_M, PG_RW, PG_V;
4233 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
4235 PG_A = pmap_accessed_bit(pmap);
4236 PG_M = pmap_modified_bit(pmap);
4237 PG_V = pmap_valid_bit(pmap);
4238 PG_RW = pmap_rw_bit(pmap);
4241 * Allocate a page table page.
4243 if ((m = vm_page_alloc(NULL, ptepindex, VM_ALLOC_NOOBJ |
4244 VM_ALLOC_WIRED | VM_ALLOC_ZERO)) == NULL) {
4245 if (lockp != NULL) {
4246 RELEASE_PV_LIST_LOCK(lockp);
4248 PMAP_ASSERT_NOT_IN_DI();
4254 * Indicate the need to retry. While waiting, the page table
4255 * page may have been allocated.
4259 if ((m->flags & PG_ZERO) == 0)
4263 * Map the pagetable page into the process address space, if
4264 * it isn't already there.
4266 if (ptepindex >= NUPDE + NUPDPE + NUPML4E) {
4267 MPASS(pmap_is_la57(pmap));
4269 pml5index = pmap_pml5e_index(va);
4270 pml5 = &pmap->pm_pmltop[pml5index];
4271 KASSERT((*pml5 & PG_V) == 0,
4272 ("pmap %p va %#lx pml5 %#lx", pmap, va, *pml5));
4273 *pml5 = VM_PAGE_TO_PHYS(m) | PG_U | PG_RW | PG_V | PG_A | PG_M;
4275 if (pmap->pm_pmltopu != NULL && pml5index < NUPML5E) {
4276 if (pmap->pm_ucr3 != PMAP_NO_CR3)
4279 pml5u = &pmap->pm_pmltopu[pml5index];
4280 *pml5u = VM_PAGE_TO_PHYS(m) | PG_U | PG_RW | PG_V |
4283 } else if (ptepindex >= NUPDE + NUPDPE) {
4284 pml4index = pmap_pml4e_index(va);
4285 /* Wire up a new PDPE page */
4286 pml4 = pmap_allocpte_getpml4(pmap, lockp, va, true);
4288 vm_page_unwire_noq(m);
4289 vm_page_free_zero(m);
4292 KASSERT((*pml4 & PG_V) == 0,
4293 ("pmap %p va %#lx pml4 %#lx", pmap, va, *pml4));
4294 *pml4 = VM_PAGE_TO_PHYS(m) | PG_U | PG_RW | PG_V | PG_A | PG_M;
4296 if (!pmap_is_la57(pmap) && pmap->pm_pmltopu != NULL &&
4297 pml4index < NUPML4E) {
4299 * PTI: Make all user-space mappings in the
4300 * kernel-mode page table no-execute so that
4301 * we detect any programming errors that leave
4302 * the kernel-mode page table active on return
4305 if (pmap->pm_ucr3 != PMAP_NO_CR3)
4308 pml4u = &pmap->pm_pmltopu[pml4index];
4309 *pml4u = VM_PAGE_TO_PHYS(m) | PG_U | PG_RW | PG_V |
4312 } else if (ptepindex >= NUPDE) {
4313 /* Wire up a new PDE page */
4314 pdp = pmap_allocpte_getpdp(pmap, lockp, va, true);
4316 vm_page_unwire_noq(m);
4317 vm_page_free_zero(m);
4320 KASSERT((*pdp & PG_V) == 0,
4321 ("pmap %p va %#lx pdp %#lx", pmap, va, *pdp));
4322 *pdp = VM_PAGE_TO_PHYS(m) | PG_U | PG_RW | PG_V | PG_A | PG_M;
4324 /* Wire up a new PTE page */
4325 pdp = pmap_allocpte_getpdp(pmap, lockp, va, false);
4327 vm_page_unwire_noq(m);
4328 vm_page_free_zero(m);
4331 if ((*pdp & PG_V) == 0) {
4332 /* Have to allocate a new pd, recurse */
4333 if (_pmap_allocpte(pmap, pmap_pdpe_pindex(va),
4334 lockp, va) == NULL) {
4335 vm_page_unwire_noq(m);
4336 vm_page_free_zero(m);
4340 /* Add reference to the pd page */
4341 pdpg = PHYS_TO_VM_PAGE(*pdp & PG_FRAME);
4344 pd = (pd_entry_t *)PHYS_TO_DMAP(*pdp & PG_FRAME);
4346 /* Now we know where the page directory page is */
4347 pd = &pd[pmap_pde_index(va)];
4348 KASSERT((*pd & PG_V) == 0,
4349 ("pmap %p va %#lx pd %#lx", pmap, va, *pd));
4350 *pd = VM_PAGE_TO_PHYS(m) | PG_U | PG_RW | PG_V | PG_A | PG_M;
4353 pmap_resident_count_inc(pmap, 1);
4359 pmap_alloc_pde(pmap_t pmap, vm_offset_t va, vm_page_t *pdpgp,
4360 struct rwlock **lockp)
4362 pdp_entry_t *pdpe, PG_V;
4365 vm_pindex_t pdpindex;
4367 PG_V = pmap_valid_bit(pmap);
4370 pdpe = pmap_pdpe(pmap, va);
4371 if (pdpe != NULL && (*pdpe & PG_V) != 0) {
4372 pde = pmap_pdpe_to_pde(pdpe, va);
4373 if (va < VM_MAXUSER_ADDRESS) {
4374 /* Add a reference to the pd page. */
4375 pdpg = PHYS_TO_VM_PAGE(*pdpe & PG_FRAME);
4379 } else if (va < VM_MAXUSER_ADDRESS) {
4380 /* Allocate a pd page. */
4381 pdpindex = pmap_pde_pindex(va) >> NPDPEPGSHIFT;
4382 pdpg = _pmap_allocpte(pmap, NUPDE + pdpindex, lockp, va);
4389 pde = (pd_entry_t *)PHYS_TO_DMAP(VM_PAGE_TO_PHYS(pdpg));
4390 pde = &pde[pmap_pde_index(va)];
4392 panic("pmap_alloc_pde: missing page table page for va %#lx",
4399 pmap_allocpte(pmap_t pmap, vm_offset_t va, struct rwlock **lockp)
4401 vm_pindex_t ptepindex;
4402 pd_entry_t *pd, PG_V;
4405 PG_V = pmap_valid_bit(pmap);
4408 * Calculate pagetable page index
4410 ptepindex = pmap_pde_pindex(va);
4413 * Get the page directory entry
4415 pd = pmap_pde(pmap, va);
4418 * This supports switching from a 2MB page to a
4421 if (pd != NULL && (*pd & (PG_PS | PG_V)) == (PG_PS | PG_V)) {
4422 if (!pmap_demote_pde_locked(pmap, pd, va, lockp)) {
4424 * Invalidation of the 2MB page mapping may have caused
4425 * the deallocation of the underlying PD page.
4432 * If the page table page is mapped, we just increment the
4433 * hold count, and activate it.
4435 if (pd != NULL && (*pd & PG_V) != 0) {
4436 m = PHYS_TO_VM_PAGE(*pd & PG_FRAME);
4440 * Here if the pte page isn't mapped, or if it has been
4443 m = _pmap_allocpte(pmap, ptepindex, lockp, va);
4444 if (m == NULL && lockp != NULL)
4450 /***************************************************
4451 * Pmap allocation/deallocation routines.
4452 ***************************************************/
4455 * Release any resources held by the given physical map.
4456 * Called when a pmap initialized by pmap_pinit is being released.
4457 * Should only be called if the map contains no valid mappings.
4460 pmap_release(pmap_t pmap)
4465 KASSERT(pmap->pm_stats.resident_count == 0,
4466 ("pmap_release: pmap %p resident count %ld != 0",
4467 pmap, pmap->pm_stats.resident_count));
4468 KASSERT(vm_radix_is_empty(&pmap->pm_root),
4469 ("pmap_release: pmap %p has reserved page table page(s)",
4471 KASSERT(CPU_EMPTY(&pmap->pm_active),
4472 ("releasing active pmap %p", pmap));
4474 m = PHYS_TO_VM_PAGE(DMAP_TO_PHYS((vm_offset_t)pmap->pm_pmltop));
4476 if (pmap_is_la57(pmap)) {
4477 pmap->pm_pmltop[pmap_pml5e_index(UPT_MAX_ADDRESS)] = 0;
4478 pmap->pm_pmltop[PML5PML5I] = 0;
4480 for (i = 0; i < NKPML4E; i++) /* KVA */
4481 pmap->pm_pmltop[KPML4BASE + i] = 0;
4482 for (i = 0; i < ndmpdpphys; i++)/* Direct Map */
4483 pmap->pm_pmltop[DMPML4I + i] = 0;
4484 pmap->pm_pmltop[PML4PML4I] = 0; /* Recursive Mapping */
4485 for (i = 0; i < lm_ents; i++) /* Large Map */
4486 pmap->pm_pmltop[LMSPML4I + i] = 0;
4489 vm_page_unwire_noq(m);
4490 vm_page_free_zero(m);
4492 if (pmap->pm_pmltopu != NULL) {
4493 m = PHYS_TO_VM_PAGE(DMAP_TO_PHYS((vm_offset_t)pmap->
4495 vm_page_unwire_noq(m);
4498 if (pmap->pm_type == PT_X86 &&
4499 (cpu_stdext_feature2 & CPUID_STDEXT2_PKU) != 0)
4500 rangeset_fini(&pmap->pm_pkru);
4504 kvm_size(SYSCTL_HANDLER_ARGS)
4506 unsigned long ksize = VM_MAX_KERNEL_ADDRESS - VM_MIN_KERNEL_ADDRESS;
4508 return sysctl_handle_long(oidp, &ksize, 0, req);
4510 SYSCTL_PROC(_vm, OID_AUTO, kvm_size, CTLTYPE_LONG | CTLFLAG_RD | CTLFLAG_MPSAFE,
4511 0, 0, kvm_size, "LU",
4515 kvm_free(SYSCTL_HANDLER_ARGS)
4517 unsigned long kfree = VM_MAX_KERNEL_ADDRESS - kernel_vm_end;
4519 return sysctl_handle_long(oidp, &kfree, 0, req);
4521 SYSCTL_PROC(_vm, OID_AUTO, kvm_free, CTLTYPE_LONG | CTLFLAG_RD | CTLFLAG_MPSAFE,
4522 0, 0, kvm_free, "LU",
4523 "Amount of KVM free");
4526 * Allocate physical memory for the vm_page array and map it into KVA,
4527 * attempting to back the vm_pages with domain-local memory.
4530 pmap_page_array_startup(long pages)
4533 pd_entry_t *pde, newpdir;
4534 vm_offset_t va, start, end;
4539 vm_page_array_size = pages;
4541 start = VM_MIN_KERNEL_ADDRESS;
4542 end = start + pages * sizeof(struct vm_page);
4543 for (va = start; va < end; va += NBPDR) {
4544 pfn = first_page + (va - start) / sizeof(struct vm_page);
4545 domain = _vm_phys_domain(ptoa(pfn));
4546 pdpe = pmap_pdpe(kernel_pmap, va);
4547 if ((*pdpe & X86_PG_V) == 0) {
4548 pa = vm_phys_early_alloc(domain, PAGE_SIZE);
4550 pagezero((void *)PHYS_TO_DMAP(pa));
4551 *pdpe = (pdp_entry_t)(pa | X86_PG_V | X86_PG_RW |
4552 X86_PG_A | X86_PG_M);
4554 pde = pmap_pdpe_to_pde(pdpe, va);
4555 if ((*pde & X86_PG_V) != 0)
4556 panic("Unexpected pde");
4557 pa = vm_phys_early_alloc(domain, NBPDR);
4558 for (i = 0; i < NPDEPG; i++)
4559 dump_add_page(pa + i * PAGE_SIZE);
4560 newpdir = (pd_entry_t)(pa | X86_PG_V | X86_PG_RW | X86_PG_A |
4561 X86_PG_M | PG_PS | pg_g | pg_nx);
4562 pde_store(pde, newpdir);
4564 vm_page_array = (vm_page_t)start;
4568 * grow the number of kernel page table entries, if needed
4571 pmap_growkernel(vm_offset_t addr)
4575 pd_entry_t *pde, newpdir;
4578 mtx_assert(&kernel_map->system_mtx, MA_OWNED);
4581 * Return if "addr" is within the range of kernel page table pages
4582 * that were preallocated during pmap bootstrap. Moreover, leave
4583 * "kernel_vm_end" and the kernel page table as they were.
4585 * The correctness of this action is based on the following
4586 * argument: vm_map_insert() allocates contiguous ranges of the
4587 * kernel virtual address space. It calls this function if a range
4588 * ends after "kernel_vm_end". If the kernel is mapped between
4589 * "kernel_vm_end" and "addr", then the range cannot begin at
4590 * "kernel_vm_end". In fact, its beginning address cannot be less
4591 * than the kernel. Thus, there is no immediate need to allocate
4592 * any new kernel page table pages between "kernel_vm_end" and
4595 if (KERNBASE < addr && addr <= KERNBASE + nkpt * NBPDR)
4598 addr = roundup2(addr, NBPDR);
4599 if (addr - 1 >= vm_map_max(kernel_map))
4600 addr = vm_map_max(kernel_map);
4601 while (kernel_vm_end < addr) {
4602 pdpe = pmap_pdpe(kernel_pmap, kernel_vm_end);
4603 if ((*pdpe & X86_PG_V) == 0) {
4604 /* We need a new PDP entry */
4605 nkpg = vm_page_alloc(NULL, kernel_vm_end >> PDPSHIFT,
4606 VM_ALLOC_INTERRUPT | VM_ALLOC_NOOBJ |
4607 VM_ALLOC_WIRED | VM_ALLOC_ZERO);
4609 panic("pmap_growkernel: no memory to grow kernel");
4610 if ((nkpg->flags & PG_ZERO) == 0)
4611 pmap_zero_page(nkpg);
4612 paddr = VM_PAGE_TO_PHYS(nkpg);
4613 *pdpe = (pdp_entry_t)(paddr | X86_PG_V | X86_PG_RW |
4614 X86_PG_A | X86_PG_M);
4615 continue; /* try again */
4617 pde = pmap_pdpe_to_pde(pdpe, kernel_vm_end);
4618 if ((*pde & X86_PG_V) != 0) {
4619 kernel_vm_end = (kernel_vm_end + NBPDR) & ~PDRMASK;
4620 if (kernel_vm_end - 1 >= vm_map_max(kernel_map)) {
4621 kernel_vm_end = vm_map_max(kernel_map);
4627 nkpg = vm_page_alloc(NULL, pmap_pde_pindex(kernel_vm_end),
4628 VM_ALLOC_INTERRUPT | VM_ALLOC_NOOBJ | VM_ALLOC_WIRED |
4631 panic("pmap_growkernel: no memory to grow kernel");
4632 if ((nkpg->flags & PG_ZERO) == 0)
4633 pmap_zero_page(nkpg);
4634 paddr = VM_PAGE_TO_PHYS(nkpg);
4635 newpdir = paddr | X86_PG_V | X86_PG_RW | X86_PG_A | X86_PG_M;
4636 pde_store(pde, newpdir);
4638 kernel_vm_end = (kernel_vm_end + NBPDR) & ~PDRMASK;
4639 if (kernel_vm_end - 1 >= vm_map_max(kernel_map)) {
4640 kernel_vm_end = vm_map_max(kernel_map);
4646 /***************************************************
4647 * page management routines.
4648 ***************************************************/
4650 CTASSERT(sizeof(struct pv_chunk) == PAGE_SIZE);
4651 CTASSERT(_NPCM == 3);
4652 CTASSERT(_NPCPV == 168);
4654 static __inline struct pv_chunk *
4655 pv_to_chunk(pv_entry_t pv)
4658 return ((struct pv_chunk *)((uintptr_t)pv & ~(uintptr_t)PAGE_MASK));
4661 #define PV_PMAP(pv) (pv_to_chunk(pv)->pc_pmap)
4663 #define PC_FREE0 0xfffffffffffffffful
4664 #define PC_FREE1 0xfffffffffffffffful
4665 #define PC_FREE2 0x000000fffffffffful
4667 static const uint64_t pc_freemask[_NPCM] = { PC_FREE0, PC_FREE1, PC_FREE2 };
4670 static int pc_chunk_count, pc_chunk_allocs, pc_chunk_frees, pc_chunk_tryfail;
4672 SYSCTL_INT(_vm_pmap, OID_AUTO, pc_chunk_count, CTLFLAG_RD, &pc_chunk_count, 0,
4673 "Current number of pv entry chunks");
4674 SYSCTL_INT(_vm_pmap, OID_AUTO, pc_chunk_allocs, CTLFLAG_RD, &pc_chunk_allocs, 0,
4675 "Current number of pv entry chunks allocated");
4676 SYSCTL_INT(_vm_pmap, OID_AUTO, pc_chunk_frees, CTLFLAG_RD, &pc_chunk_frees, 0,
4677 "Current number of pv entry chunks frees");
4678 SYSCTL_INT(_vm_pmap, OID_AUTO, pc_chunk_tryfail, CTLFLAG_RD, &pc_chunk_tryfail, 0,
4679 "Number of times tried to get a chunk page but failed.");
4681 static long pv_entry_frees, pv_entry_allocs, pv_entry_count;
4682 static int pv_entry_spare;
4684 SYSCTL_LONG(_vm_pmap, OID_AUTO, pv_entry_frees, CTLFLAG_RD, &pv_entry_frees, 0,
4685 "Current number of pv entry frees");
4686 SYSCTL_LONG(_vm_pmap, OID_AUTO, pv_entry_allocs, CTLFLAG_RD, &pv_entry_allocs, 0,
4687 "Current number of pv entry allocs");
4688 SYSCTL_LONG(_vm_pmap, OID_AUTO, pv_entry_count, CTLFLAG_RD, &pv_entry_count, 0,
4689 "Current number of pv entries");
4690 SYSCTL_INT(_vm_pmap, OID_AUTO, pv_entry_spare, CTLFLAG_RD, &pv_entry_spare, 0,
4691 "Current number of spare pv entries");
4695 reclaim_pv_chunk_leave_pmap(pmap_t pmap, pmap_t locked_pmap, bool start_di)
4700 pmap_invalidate_all(pmap);
4701 if (pmap != locked_pmap)
4704 pmap_delayed_invl_finish();
4708 * We are in a serious low memory condition. Resort to
4709 * drastic measures to free some pages so we can allocate
4710 * another pv entry chunk.
4712 * Returns NULL if PV entries were reclaimed from the specified pmap.
4714 * We do not, however, unmap 2mpages because subsequent accesses will
4715 * allocate per-page pv entries until repromotion occurs, thereby
4716 * exacerbating the shortage of free pv entries.
4719 reclaim_pv_chunk_domain(pmap_t locked_pmap, struct rwlock **lockp, int domain)
4721 struct pv_chunks_list *pvc;
4722 struct pv_chunk *pc, *pc_marker, *pc_marker_end;
4723 struct pv_chunk_header pc_marker_b, pc_marker_end_b;
4724 struct md_page *pvh;
4726 pmap_t next_pmap, pmap;
4727 pt_entry_t *pte, tpte;
4728 pt_entry_t PG_G, PG_A, PG_M, PG_RW;
4732 struct spglist free;
4734 int bit, field, freed;
4735 bool start_di, restart;
4737 PMAP_LOCK_ASSERT(locked_pmap, MA_OWNED);
4738 KASSERT(lockp != NULL, ("reclaim_pv_chunk: lockp is NULL"));
4741 PG_G = PG_A = PG_M = PG_RW = 0;
4743 bzero(&pc_marker_b, sizeof(pc_marker_b));
4744 bzero(&pc_marker_end_b, sizeof(pc_marker_end_b));
4745 pc_marker = (struct pv_chunk *)&pc_marker_b;
4746 pc_marker_end = (struct pv_chunk *)&pc_marker_end_b;
4749 * A delayed invalidation block should already be active if
4750 * pmap_advise() or pmap_remove() called this function by way
4751 * of pmap_demote_pde_locked().
4753 start_di = pmap_not_in_di();
4755 pvc = &pv_chunks[domain];
4756 mtx_lock(&pvc->pvc_lock);
4757 pvc->active_reclaims++;
4758 TAILQ_INSERT_HEAD(&pvc->pvc_list, pc_marker, pc_lru);
4759 TAILQ_INSERT_TAIL(&pvc->pvc_list, pc_marker_end, pc_lru);
4760 while ((pc = TAILQ_NEXT(pc_marker, pc_lru)) != pc_marker_end &&
4761 SLIST_EMPTY(&free)) {
4762 next_pmap = pc->pc_pmap;
4763 if (next_pmap == NULL) {
4765 * The next chunk is a marker. However, it is
4766 * not our marker, so active_reclaims must be
4767 * > 1. Consequently, the next_chunk code
4768 * will not rotate the pv_chunks list.
4772 mtx_unlock(&pvc->pvc_lock);
4775 * A pv_chunk can only be removed from the pc_lru list
4776 * when both pc_chunks_mutex is owned and the
4777 * corresponding pmap is locked.
4779 if (pmap != next_pmap) {
4781 reclaim_pv_chunk_leave_pmap(pmap, locked_pmap,
4784 /* Avoid deadlock and lock recursion. */
4785 if (pmap > locked_pmap) {
4786 RELEASE_PV_LIST_LOCK(lockp);
4789 pmap_delayed_invl_start();
4790 mtx_lock(&pvc->pvc_lock);
4792 } else if (pmap != locked_pmap) {
4793 if (PMAP_TRYLOCK(pmap)) {
4795 pmap_delayed_invl_start();
4796 mtx_lock(&pvc->pvc_lock);
4799 pmap = NULL; /* pmap is not locked */
4800 mtx_lock(&pvc->pvc_lock);
4801 pc = TAILQ_NEXT(pc_marker, pc_lru);
4803 pc->pc_pmap != next_pmap)
4807 } else if (start_di)
4808 pmap_delayed_invl_start();
4809 PG_G = pmap_global_bit(pmap);
4810 PG_A = pmap_accessed_bit(pmap);
4811 PG_M = pmap_modified_bit(pmap);
4812 PG_RW = pmap_rw_bit(pmap);
4818 * Destroy every non-wired, 4 KB page mapping in the chunk.
4821 for (field = 0; field < _NPCM; field++) {
4822 for (inuse = ~pc->pc_map[field] & pc_freemask[field];
4823 inuse != 0; inuse &= ~(1UL << bit)) {
4825 pv = &pc->pc_pventry[field * 64 + bit];
4827 pde = pmap_pde(pmap, va);
4828 if ((*pde & PG_PS) != 0)
4830 pte = pmap_pde_to_pte(pde, va);
4831 if ((*pte & PG_W) != 0)
4833 tpte = pte_load_clear(pte);
4834 if ((tpte & PG_G) != 0)
4835 pmap_invalidate_page(pmap, va);
4836 m = PHYS_TO_VM_PAGE(tpte & PG_FRAME);
4837 if ((tpte & (PG_M | PG_RW)) == (PG_M | PG_RW))
4839 if ((tpte & PG_A) != 0)
4840 vm_page_aflag_set(m, PGA_REFERENCED);
4841 CHANGE_PV_LIST_LOCK_TO_VM_PAGE(lockp, m);
4842 TAILQ_REMOVE(&m->md.pv_list, pv, pv_next);
4844 if (TAILQ_EMPTY(&m->md.pv_list) &&
4845 (m->flags & PG_FICTITIOUS) == 0) {
4846 pvh = pa_to_pvh(VM_PAGE_TO_PHYS(m));
4847 if (TAILQ_EMPTY(&pvh->pv_list)) {
4848 vm_page_aflag_clear(m,
4852 pmap_delayed_invl_page(m);
4853 pc->pc_map[field] |= 1UL << bit;
4854 pmap_unuse_pt(pmap, va, *pde, &free);
4859 mtx_lock(&pvc->pvc_lock);
4862 /* Every freed mapping is for a 4 KB page. */
4863 pmap_resident_count_dec(pmap, freed);
4864 PV_STAT(atomic_add_long(&pv_entry_frees, freed));
4865 PV_STAT(atomic_add_int(&pv_entry_spare, freed));
4866 PV_STAT(atomic_subtract_long(&pv_entry_count, freed));
4867 TAILQ_REMOVE(&pmap->pm_pvchunk, pc, pc_list);
4868 if (pc->pc_map[0] == PC_FREE0 && pc->pc_map[1] == PC_FREE1 &&
4869 pc->pc_map[2] == PC_FREE2) {
4870 PV_STAT(atomic_subtract_int(&pv_entry_spare, _NPCPV));
4871 PV_STAT(atomic_subtract_int(&pc_chunk_count, 1));
4872 PV_STAT(atomic_add_int(&pc_chunk_frees, 1));
4873 /* Entire chunk is free; return it. */
4874 m_pc = PHYS_TO_VM_PAGE(DMAP_TO_PHYS((vm_offset_t)pc));
4875 dump_drop_page(m_pc->phys_addr);
4876 mtx_lock(&pvc->pvc_lock);
4877 TAILQ_REMOVE(&pvc->pvc_list, pc, pc_lru);
4880 TAILQ_INSERT_HEAD(&pmap->pm_pvchunk, pc, pc_list);
4881 mtx_lock(&pvc->pvc_lock);
4882 /* One freed pv entry in locked_pmap is sufficient. */
4883 if (pmap == locked_pmap)
4886 TAILQ_REMOVE(&pvc->pvc_list, pc_marker, pc_lru);
4887 TAILQ_INSERT_AFTER(&pvc->pvc_list, pc, pc_marker, pc_lru);
4888 if (pvc->active_reclaims == 1 && pmap != NULL) {
4890 * Rotate the pv chunks list so that we do not
4891 * scan the same pv chunks that could not be
4892 * freed (because they contained a wired
4893 * and/or superpage mapping) on every
4894 * invocation of reclaim_pv_chunk().
4896 while ((pc = TAILQ_FIRST(&pvc->pvc_list)) != pc_marker) {
4897 MPASS(pc->pc_pmap != NULL);
4898 TAILQ_REMOVE(&pvc->pvc_list, pc, pc_lru);
4899 TAILQ_INSERT_TAIL(&pvc->pvc_list, pc, pc_lru);
4903 TAILQ_REMOVE(&pvc->pvc_list, pc_marker, pc_lru);
4904 TAILQ_REMOVE(&pvc->pvc_list, pc_marker_end, pc_lru);
4905 pvc->active_reclaims--;
4906 mtx_unlock(&pvc->pvc_lock);
4907 reclaim_pv_chunk_leave_pmap(pmap, locked_pmap, start_di);
4908 if (m_pc == NULL && !SLIST_EMPTY(&free)) {
4909 m_pc = SLIST_FIRST(&free);
4910 SLIST_REMOVE_HEAD(&free, plinks.s.ss);
4911 /* Recycle a freed page table page. */
4912 m_pc->ref_count = 1;
4914 vm_page_free_pages_toq(&free, true);
4919 reclaim_pv_chunk(pmap_t locked_pmap, struct rwlock **lockp)
4924 domain = PCPU_GET(domain);
4925 for (i = 0; i < vm_ndomains; i++) {
4926 m = reclaim_pv_chunk_domain(locked_pmap, lockp, domain);
4929 domain = (domain + 1) % vm_ndomains;
4936 * free the pv_entry back to the free list
4939 free_pv_entry(pmap_t pmap, pv_entry_t pv)
4941 struct pv_chunk *pc;
4942 int idx, field, bit;
4944 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
4945 PV_STAT(atomic_add_long(&pv_entry_frees, 1));
4946 PV_STAT(atomic_add_int(&pv_entry_spare, 1));
4947 PV_STAT(atomic_subtract_long(&pv_entry_count, 1));
4948 pc = pv_to_chunk(pv);
4949 idx = pv - &pc->pc_pventry[0];
4952 pc->pc_map[field] |= 1ul << bit;
4953 if (pc->pc_map[0] != PC_FREE0 || pc->pc_map[1] != PC_FREE1 ||
4954 pc->pc_map[2] != PC_FREE2) {
4955 /* 98% of the time, pc is already at the head of the list. */
4956 if (__predict_false(pc != TAILQ_FIRST(&pmap->pm_pvchunk))) {
4957 TAILQ_REMOVE(&pmap->pm_pvchunk, pc, pc_list);
4958 TAILQ_INSERT_HEAD(&pmap->pm_pvchunk, pc, pc_list);
4962 TAILQ_REMOVE(&pmap->pm_pvchunk, pc, pc_list);
4967 free_pv_chunk_dequeued(struct pv_chunk *pc)
4971 PV_STAT(atomic_subtract_int(&pv_entry_spare, _NPCPV));
4972 PV_STAT(atomic_subtract_int(&pc_chunk_count, 1));
4973 PV_STAT(atomic_add_int(&pc_chunk_frees, 1));
4974 /* entire chunk is free, return it */
4975 m = PHYS_TO_VM_PAGE(DMAP_TO_PHYS((vm_offset_t)pc));
4976 dump_drop_page(m->phys_addr);
4977 vm_page_unwire_noq(m);
4982 free_pv_chunk(struct pv_chunk *pc)
4984 struct pv_chunks_list *pvc;
4986 pvc = &pv_chunks[pc_to_domain(pc)];
4987 mtx_lock(&pvc->pvc_lock);
4988 TAILQ_REMOVE(&pvc->pvc_list, pc, pc_lru);
4989 mtx_unlock(&pvc->pvc_lock);
4990 free_pv_chunk_dequeued(pc);
4994 free_pv_chunk_batch(struct pv_chunklist *batch)
4996 struct pv_chunks_list *pvc;
4997 struct pv_chunk *pc, *npc;
5000 for (i = 0; i < vm_ndomains; i++) {
5001 if (TAILQ_EMPTY(&batch[i]))
5003 pvc = &pv_chunks[i];
5004 mtx_lock(&pvc->pvc_lock);
5005 TAILQ_FOREACH(pc, &batch[i], pc_list) {
5006 TAILQ_REMOVE(&pvc->pvc_list, pc, pc_lru);
5008 mtx_unlock(&pvc->pvc_lock);
5011 for (i = 0; i < vm_ndomains; i++) {
5012 TAILQ_FOREACH_SAFE(pc, &batch[i], pc_list, npc) {
5013 free_pv_chunk_dequeued(pc);
5019 * Returns a new PV entry, allocating a new PV chunk from the system when
5020 * needed. If this PV chunk allocation fails and a PV list lock pointer was
5021 * given, a PV chunk is reclaimed from an arbitrary pmap. Otherwise, NULL is
5024 * The given PV list lock may be released.
5027 get_pv_entry(pmap_t pmap, struct rwlock **lockp)
5029 struct pv_chunks_list *pvc;
5032 struct pv_chunk *pc;
5035 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
5036 PV_STAT(atomic_add_long(&pv_entry_allocs, 1));
5038 pc = TAILQ_FIRST(&pmap->pm_pvchunk);
5040 for (field = 0; field < _NPCM; field++) {
5041 if (pc->pc_map[field]) {
5042 bit = bsfq(pc->pc_map[field]);
5046 if (field < _NPCM) {
5047 pv = &pc->pc_pventry[field * 64 + bit];
5048 pc->pc_map[field] &= ~(1ul << bit);
5049 /* If this was the last item, move it to tail */
5050 if (pc->pc_map[0] == 0 && pc->pc_map[1] == 0 &&
5051 pc->pc_map[2] == 0) {
5052 TAILQ_REMOVE(&pmap->pm_pvchunk, pc, pc_list);
5053 TAILQ_INSERT_TAIL(&pmap->pm_pvchunk, pc,
5056 PV_STAT(atomic_add_long(&pv_entry_count, 1));
5057 PV_STAT(atomic_subtract_int(&pv_entry_spare, 1));
5061 /* No free items, allocate another chunk */
5062 m = vm_page_alloc(NULL, 0, VM_ALLOC_NORMAL | VM_ALLOC_NOOBJ |
5065 if (lockp == NULL) {
5066 PV_STAT(pc_chunk_tryfail++);
5069 m = reclaim_pv_chunk(pmap, lockp);
5073 PV_STAT(atomic_add_int(&pc_chunk_count, 1));
5074 PV_STAT(atomic_add_int(&pc_chunk_allocs, 1));
5075 dump_add_page(m->phys_addr);
5076 pc = (void *)PHYS_TO_DMAP(m->phys_addr);
5078 pc->pc_map[0] = PC_FREE0 & ~1ul; /* preallocated bit 0 */
5079 pc->pc_map[1] = PC_FREE1;
5080 pc->pc_map[2] = PC_FREE2;
5081 pvc = &pv_chunks[_vm_phys_domain(m->phys_addr)];
5082 mtx_lock(&pvc->pvc_lock);
5083 TAILQ_INSERT_TAIL(&pvc->pvc_list, pc, pc_lru);
5084 mtx_unlock(&pvc->pvc_lock);
5085 pv = &pc->pc_pventry[0];
5086 TAILQ_INSERT_HEAD(&pmap->pm_pvchunk, pc, pc_list);
5087 PV_STAT(atomic_add_long(&pv_entry_count, 1));
5088 PV_STAT(atomic_add_int(&pv_entry_spare, _NPCPV - 1));
5093 * Returns the number of one bits within the given PV chunk map.
5095 * The erratas for Intel processors state that "POPCNT Instruction May
5096 * Take Longer to Execute Than Expected". It is believed that the
5097 * issue is the spurious dependency on the destination register.
5098 * Provide a hint to the register rename logic that the destination
5099 * value is overwritten, by clearing it, as suggested in the
5100 * optimization manual. It should be cheap for unaffected processors
5103 * Reference numbers for erratas are
5104 * 4th Gen Core: HSD146
5105 * 5th Gen Core: BDM85
5106 * 6th Gen Core: SKL029
5109 popcnt_pc_map_pq(uint64_t *map)
5113 __asm __volatile("xorl %k0,%k0;popcntq %2,%0;"
5114 "xorl %k1,%k1;popcntq %3,%1;addl %k1,%k0;"
5115 "xorl %k1,%k1;popcntq %4,%1;addl %k1,%k0"
5116 : "=&r" (result), "=&r" (tmp)
5117 : "m" (map[0]), "m" (map[1]), "m" (map[2]));
5122 * Ensure that the number of spare PV entries in the specified pmap meets or
5123 * exceeds the given count, "needed".
5125 * The given PV list lock may be released.
5128 reserve_pv_entries(pmap_t pmap, int needed, struct rwlock **lockp)
5130 struct pv_chunks_list *pvc;
5131 struct pch new_tail[PMAP_MEMDOM];
5132 struct pv_chunk *pc;
5137 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
5138 KASSERT(lockp != NULL, ("reserve_pv_entries: lockp is NULL"));
5141 * Newly allocated PV chunks must be stored in a private list until
5142 * the required number of PV chunks have been allocated. Otherwise,
5143 * reclaim_pv_chunk() could recycle one of these chunks. In
5144 * contrast, these chunks must be added to the pmap upon allocation.
5146 for (i = 0; i < PMAP_MEMDOM; i++)
5147 TAILQ_INIT(&new_tail[i]);
5150 TAILQ_FOREACH(pc, &pmap->pm_pvchunk, pc_list) {
5152 if ((cpu_feature2 & CPUID2_POPCNT) == 0)
5153 bit_count((bitstr_t *)pc->pc_map, 0,
5154 sizeof(pc->pc_map) * NBBY, &free);
5157 free = popcnt_pc_map_pq(pc->pc_map);
5161 if (avail >= needed)
5164 for (reclaimed = false; avail < needed; avail += _NPCPV) {
5165 m = vm_page_alloc(NULL, 0, VM_ALLOC_NORMAL | VM_ALLOC_NOOBJ |
5168 m = reclaim_pv_chunk(pmap, lockp);
5173 PV_STAT(atomic_add_int(&pc_chunk_count, 1));
5174 PV_STAT(atomic_add_int(&pc_chunk_allocs, 1));
5175 dump_add_page(m->phys_addr);
5176 pc = (void *)PHYS_TO_DMAP(m->phys_addr);
5178 pc->pc_map[0] = PC_FREE0;
5179 pc->pc_map[1] = PC_FREE1;
5180 pc->pc_map[2] = PC_FREE2;
5181 TAILQ_INSERT_HEAD(&pmap->pm_pvchunk, pc, pc_list);
5182 TAILQ_INSERT_TAIL(&new_tail[pc_to_domain(pc)], pc, pc_lru);
5183 PV_STAT(atomic_add_int(&pv_entry_spare, _NPCPV));
5186 * The reclaim might have freed a chunk from the current pmap.
5187 * If that chunk contained available entries, we need to
5188 * re-count the number of available entries.
5193 for (i = 0; i < vm_ndomains; i++) {
5194 if (TAILQ_EMPTY(&new_tail[i]))
5196 pvc = &pv_chunks[i];
5197 mtx_lock(&pvc->pvc_lock);
5198 TAILQ_CONCAT(&pvc->pvc_list, &new_tail[i], pc_lru);
5199 mtx_unlock(&pvc->pvc_lock);
5204 * First find and then remove the pv entry for the specified pmap and virtual
5205 * address from the specified pv list. Returns the pv entry if found and NULL
5206 * otherwise. This operation can be performed on pv lists for either 4KB or
5207 * 2MB page mappings.
5209 static __inline pv_entry_t
5210 pmap_pvh_remove(struct md_page *pvh, pmap_t pmap, vm_offset_t va)
5214 TAILQ_FOREACH(pv, &pvh->pv_list, pv_next) {
5215 if (pmap == PV_PMAP(pv) && va == pv->pv_va) {
5216 TAILQ_REMOVE(&pvh->pv_list, pv, pv_next);
5225 * After demotion from a 2MB page mapping to 512 4KB page mappings,
5226 * destroy the pv entry for the 2MB page mapping and reinstantiate the pv
5227 * entries for each of the 4KB page mappings.
5230 pmap_pv_demote_pde(pmap_t pmap, vm_offset_t va, vm_paddr_t pa,
5231 struct rwlock **lockp)
5233 struct md_page *pvh;
5234 struct pv_chunk *pc;
5236 vm_offset_t va_last;
5240 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
5241 KASSERT((pa & PDRMASK) == 0,
5242 ("pmap_pv_demote_pde: pa is not 2mpage aligned"));
5243 CHANGE_PV_LIST_LOCK_TO_PHYS(lockp, pa);
5246 * Transfer the 2mpage's pv entry for this mapping to the first
5247 * page's pv list. Once this transfer begins, the pv list lock
5248 * must not be released until the last pv entry is reinstantiated.
5250 pvh = pa_to_pvh(pa);
5251 va = trunc_2mpage(va);
5252 pv = pmap_pvh_remove(pvh, pmap, va);
5253 KASSERT(pv != NULL, ("pmap_pv_demote_pde: pv not found"));
5254 m = PHYS_TO_VM_PAGE(pa);
5255 TAILQ_INSERT_TAIL(&m->md.pv_list, pv, pv_next);
5257 /* Instantiate the remaining NPTEPG - 1 pv entries. */
5258 PV_STAT(atomic_add_long(&pv_entry_allocs, NPTEPG - 1));
5259 va_last = va + NBPDR - PAGE_SIZE;
5261 pc = TAILQ_FIRST(&pmap->pm_pvchunk);
5262 KASSERT(pc->pc_map[0] != 0 || pc->pc_map[1] != 0 ||
5263 pc->pc_map[2] != 0, ("pmap_pv_demote_pde: missing spare"));
5264 for (field = 0; field < _NPCM; field++) {
5265 while (pc->pc_map[field]) {
5266 bit = bsfq(pc->pc_map[field]);
5267 pc->pc_map[field] &= ~(1ul << bit);
5268 pv = &pc->pc_pventry[field * 64 + bit];
5272 KASSERT((m->oflags & VPO_UNMANAGED) == 0,
5273 ("pmap_pv_demote_pde: page %p is not managed", m));
5274 TAILQ_INSERT_TAIL(&m->md.pv_list, pv, pv_next);
5280 TAILQ_REMOVE(&pmap->pm_pvchunk, pc, pc_list);
5281 TAILQ_INSERT_TAIL(&pmap->pm_pvchunk, pc, pc_list);
5284 if (pc->pc_map[0] == 0 && pc->pc_map[1] == 0 && pc->pc_map[2] == 0) {
5285 TAILQ_REMOVE(&pmap->pm_pvchunk, pc, pc_list);
5286 TAILQ_INSERT_TAIL(&pmap->pm_pvchunk, pc, pc_list);
5288 PV_STAT(atomic_add_long(&pv_entry_count, NPTEPG - 1));
5289 PV_STAT(atomic_subtract_int(&pv_entry_spare, NPTEPG - 1));
5292 #if VM_NRESERVLEVEL > 0
5294 * After promotion from 512 4KB page mappings to a single 2MB page mapping,
5295 * replace the many pv entries for the 4KB page mappings by a single pv entry
5296 * for the 2MB page mapping.
5299 pmap_pv_promote_pde(pmap_t pmap, vm_offset_t va, vm_paddr_t pa,
5300 struct rwlock **lockp)
5302 struct md_page *pvh;
5304 vm_offset_t va_last;
5307 KASSERT((pa & PDRMASK) == 0,
5308 ("pmap_pv_promote_pde: pa is not 2mpage aligned"));
5309 CHANGE_PV_LIST_LOCK_TO_PHYS(lockp, pa);
5312 * Transfer the first page's pv entry for this mapping to the 2mpage's
5313 * pv list. Aside from avoiding the cost of a call to get_pv_entry(),
5314 * a transfer avoids the possibility that get_pv_entry() calls
5315 * reclaim_pv_chunk() and that reclaim_pv_chunk() removes one of the
5316 * mappings that is being promoted.
5318 m = PHYS_TO_VM_PAGE(pa);
5319 va = trunc_2mpage(va);
5320 pv = pmap_pvh_remove(&m->md, pmap, va);
5321 KASSERT(pv != NULL, ("pmap_pv_promote_pde: pv not found"));
5322 pvh = pa_to_pvh(pa);
5323 TAILQ_INSERT_TAIL(&pvh->pv_list, pv, pv_next);
5325 /* Free the remaining NPTEPG - 1 pv entries. */
5326 va_last = va + NBPDR - PAGE_SIZE;
5330 pmap_pvh_free(&m->md, pmap, va);
5331 } while (va < va_last);
5333 #endif /* VM_NRESERVLEVEL > 0 */
5336 * First find and then destroy the pv entry for the specified pmap and virtual
5337 * address. This operation can be performed on pv lists for either 4KB or 2MB
5341 pmap_pvh_free(struct md_page *pvh, pmap_t pmap, vm_offset_t va)
5345 pv = pmap_pvh_remove(pvh, pmap, va);
5346 KASSERT(pv != NULL, ("pmap_pvh_free: pv not found"));
5347 free_pv_entry(pmap, pv);
5351 * Conditionally create the PV entry for a 4KB page mapping if the required
5352 * memory can be allocated without resorting to reclamation.
5355 pmap_try_insert_pv_entry(pmap_t pmap, vm_offset_t va, vm_page_t m,
5356 struct rwlock **lockp)
5360 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
5361 /* Pass NULL instead of the lock pointer to disable reclamation. */
5362 if ((pv = get_pv_entry(pmap, NULL)) != NULL) {
5364 CHANGE_PV_LIST_LOCK_TO_VM_PAGE(lockp, m);
5365 TAILQ_INSERT_TAIL(&m->md.pv_list, pv, pv_next);
5373 * Create the PV entry for a 2MB page mapping. Always returns true unless the
5374 * flag PMAP_ENTER_NORECLAIM is specified. If that flag is specified, returns
5375 * false if the PV entry cannot be allocated without resorting to reclamation.
5378 pmap_pv_insert_pde(pmap_t pmap, vm_offset_t va, pd_entry_t pde, u_int flags,
5379 struct rwlock **lockp)
5381 struct md_page *pvh;
5385 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
5386 /* Pass NULL instead of the lock pointer to disable reclamation. */
5387 if ((pv = get_pv_entry(pmap, (flags & PMAP_ENTER_NORECLAIM) != 0 ?
5388 NULL : lockp)) == NULL)
5391 pa = pde & PG_PS_FRAME;
5392 CHANGE_PV_LIST_LOCK_TO_PHYS(lockp, pa);
5393 pvh = pa_to_pvh(pa);
5394 TAILQ_INSERT_TAIL(&pvh->pv_list, pv, pv_next);
5400 * Fills a page table page with mappings to consecutive physical pages.
5403 pmap_fill_ptp(pt_entry_t *firstpte, pt_entry_t newpte)
5407 for (pte = firstpte; pte < firstpte + NPTEPG; pte++) {
5409 newpte += PAGE_SIZE;
5414 * Tries to demote a 2MB page mapping. If demotion fails, the 2MB page
5415 * mapping is invalidated.
5418 pmap_demote_pde(pmap_t pmap, pd_entry_t *pde, vm_offset_t va)
5420 struct rwlock *lock;
5424 rv = pmap_demote_pde_locked(pmap, pde, va, &lock);
5431 pmap_demote_pde_check(pt_entry_t *firstpte __unused, pt_entry_t newpte __unused)
5435 pt_entry_t *xpte, *ypte;
5437 for (xpte = firstpte; xpte < firstpte + NPTEPG;
5438 xpte++, newpte += PAGE_SIZE) {
5439 if ((*xpte & PG_FRAME) != (newpte & PG_FRAME)) {
5440 printf("pmap_demote_pde: xpte %zd and newpte map "
5441 "different pages: found %#lx, expected %#lx\n",
5442 xpte - firstpte, *xpte, newpte);
5443 printf("page table dump\n");
5444 for (ypte = firstpte; ypte < firstpte + NPTEPG; ypte++)
5445 printf("%zd %#lx\n", ypte - firstpte, *ypte);
5450 KASSERT((*firstpte & PG_FRAME) == (newpte & PG_FRAME),
5451 ("pmap_demote_pde: firstpte and newpte map different physical"
5458 pmap_demote_pde_abort(pmap_t pmap, vm_offset_t va, pd_entry_t *pde,
5459 pd_entry_t oldpde, struct rwlock **lockp)
5461 struct spglist free;
5465 sva = trunc_2mpage(va);
5466 pmap_remove_pde(pmap, pde, sva, &free, lockp);
5467 if ((oldpde & pmap_global_bit(pmap)) == 0)
5468 pmap_invalidate_pde_page(pmap, sva, oldpde);
5469 vm_page_free_pages_toq(&free, true);
5470 CTR2(KTR_PMAP, "pmap_demote_pde: failure for va %#lx in pmap %p",
5475 pmap_demote_pde_locked(pmap_t pmap, pd_entry_t *pde, vm_offset_t va,
5476 struct rwlock **lockp)
5478 pd_entry_t newpde, oldpde;
5479 pt_entry_t *firstpte, newpte;
5480 pt_entry_t PG_A, PG_G, PG_M, PG_PKU_MASK, PG_RW, PG_V;
5486 PG_A = pmap_accessed_bit(pmap);
5487 PG_G = pmap_global_bit(pmap);
5488 PG_M = pmap_modified_bit(pmap);
5489 PG_RW = pmap_rw_bit(pmap);
5490 PG_V = pmap_valid_bit(pmap);
5491 PG_PTE_CACHE = pmap_cache_mask(pmap, 0);
5492 PG_PKU_MASK = pmap_pku_mask_bit(pmap);
5494 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
5495 in_kernel = va >= VM_MAXUSER_ADDRESS;
5497 KASSERT((oldpde & (PG_PS | PG_V)) == (PG_PS | PG_V),
5498 ("pmap_demote_pde: oldpde is missing PG_PS and/or PG_V"));
5501 * Invalidate the 2MB page mapping and return "failure" if the
5502 * mapping was never accessed.
5504 if ((oldpde & PG_A) == 0) {
5505 KASSERT((oldpde & PG_W) == 0,
5506 ("pmap_demote_pde: a wired mapping is missing PG_A"));
5507 pmap_demote_pde_abort(pmap, va, pde, oldpde, lockp);
5511 mpte = pmap_remove_pt_page(pmap, va);
5513 KASSERT((oldpde & PG_W) == 0,
5514 ("pmap_demote_pde: page table page for a wired mapping"
5518 * If the page table page is missing and the mapping
5519 * is for a kernel address, the mapping must belong to
5520 * the direct map. Page table pages are preallocated
5521 * for every other part of the kernel address space,
5522 * so the direct map region is the only part of the
5523 * kernel address space that must be handled here.
5525 KASSERT(!in_kernel || (va >= DMAP_MIN_ADDRESS &&
5526 va < DMAP_MAX_ADDRESS),
5527 ("pmap_demote_pde: No saved mpte for va %#lx", va));
5530 * If the 2MB page mapping belongs to the direct map
5531 * region of the kernel's address space, then the page
5532 * allocation request specifies the highest possible
5533 * priority (VM_ALLOC_INTERRUPT). Otherwise, the
5534 * priority is normal.
5536 mpte = vm_page_alloc(NULL, pmap_pde_pindex(va),
5537 (in_kernel ? VM_ALLOC_INTERRUPT : VM_ALLOC_NORMAL) |
5538 VM_ALLOC_NOOBJ | VM_ALLOC_WIRED);
5541 * If the allocation of the new page table page fails,
5542 * invalidate the 2MB page mapping and return "failure".
5545 pmap_demote_pde_abort(pmap, va, pde, oldpde, lockp);
5550 mpte->ref_count = NPTEPG;
5551 pmap_resident_count_inc(pmap, 1);
5554 mptepa = VM_PAGE_TO_PHYS(mpte);
5555 firstpte = (pt_entry_t *)PHYS_TO_DMAP(mptepa);
5556 newpde = mptepa | PG_M | PG_A | (oldpde & PG_U) | PG_RW | PG_V;
5557 KASSERT((oldpde & (PG_M | PG_RW)) != PG_RW,
5558 ("pmap_demote_pde: oldpde is missing PG_M"));
5559 newpte = oldpde & ~PG_PS;
5560 newpte = pmap_swap_pat(pmap, newpte);
5563 * If the page table page is not leftover from an earlier promotion,
5566 if (mpte->valid == 0)
5567 pmap_fill_ptp(firstpte, newpte);
5569 pmap_demote_pde_check(firstpte, newpte);
5572 * If the mapping has changed attributes, update the page table
5575 if ((*firstpte & PG_PTE_PROMOTE) != (newpte & PG_PTE_PROMOTE))
5576 pmap_fill_ptp(firstpte, newpte);
5579 * The spare PV entries must be reserved prior to demoting the
5580 * mapping, that is, prior to changing the PDE. Otherwise, the state
5581 * of the PDE and the PV lists will be inconsistent, which can result
5582 * in reclaim_pv_chunk() attempting to remove a PV entry from the
5583 * wrong PV list and pmap_pv_demote_pde() failing to find the expected
5584 * PV entry for the 2MB page mapping that is being demoted.
5586 if ((oldpde & PG_MANAGED) != 0)
5587 reserve_pv_entries(pmap, NPTEPG - 1, lockp);
5590 * Demote the mapping. This pmap is locked. The old PDE has
5591 * PG_A set. If the old PDE has PG_RW set, it also has PG_M
5592 * set. Thus, there is no danger of a race with another
5593 * processor changing the setting of PG_A and/or PG_M between
5594 * the read above and the store below.
5596 if (workaround_erratum383)
5597 pmap_update_pde(pmap, va, pde, newpde);
5599 pde_store(pde, newpde);
5602 * Invalidate a stale recursive mapping of the page table page.
5605 pmap_invalidate_page(pmap, (vm_offset_t)vtopte(va));
5608 * Demote the PV entry.
5610 if ((oldpde & PG_MANAGED) != 0)
5611 pmap_pv_demote_pde(pmap, va, oldpde & PG_PS_FRAME, lockp);
5613 atomic_add_long(&pmap_pde_demotions, 1);
5614 CTR2(KTR_PMAP, "pmap_demote_pde: success for va %#lx in pmap %p",
5620 * pmap_remove_kernel_pde: Remove a kernel superpage mapping.
5623 pmap_remove_kernel_pde(pmap_t pmap, pd_entry_t *pde, vm_offset_t va)
5629 KASSERT(pmap == kernel_pmap, ("pmap %p is not kernel_pmap", pmap));
5630 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
5631 mpte = pmap_remove_pt_page(pmap, va);
5633 panic("pmap_remove_kernel_pde: Missing pt page.");
5635 mptepa = VM_PAGE_TO_PHYS(mpte);
5636 newpde = mptepa | X86_PG_M | X86_PG_A | X86_PG_RW | X86_PG_V;
5639 * If this page table page was unmapped by a promotion, then it
5640 * contains valid mappings. Zero it to invalidate those mappings.
5642 if (mpte->valid != 0)
5643 pagezero((void *)PHYS_TO_DMAP(mptepa));
5646 * Demote the mapping.
5648 if (workaround_erratum383)
5649 pmap_update_pde(pmap, va, pde, newpde);
5651 pde_store(pde, newpde);
5654 * Invalidate a stale recursive mapping of the page table page.
5656 pmap_invalidate_page(pmap, (vm_offset_t)vtopte(va));
5660 * pmap_remove_pde: do the things to unmap a superpage in a process
5663 pmap_remove_pde(pmap_t pmap, pd_entry_t *pdq, vm_offset_t sva,
5664 struct spglist *free, struct rwlock **lockp)
5666 struct md_page *pvh;
5668 vm_offset_t eva, va;
5670 pt_entry_t PG_G, PG_A, PG_M, PG_RW;
5672 PG_G = pmap_global_bit(pmap);
5673 PG_A = pmap_accessed_bit(pmap);
5674 PG_M = pmap_modified_bit(pmap);
5675 PG_RW = pmap_rw_bit(pmap);
5677 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
5678 KASSERT((sva & PDRMASK) == 0,
5679 ("pmap_remove_pde: sva is not 2mpage aligned"));
5680 oldpde = pte_load_clear(pdq);
5682 pmap->pm_stats.wired_count -= NBPDR / PAGE_SIZE;
5683 if ((oldpde & PG_G) != 0)
5684 pmap_invalidate_pde_page(kernel_pmap, sva, oldpde);
5685 pmap_resident_count_dec(pmap, NBPDR / PAGE_SIZE);
5686 if (oldpde & PG_MANAGED) {
5687 CHANGE_PV_LIST_LOCK_TO_PHYS(lockp, oldpde & PG_PS_FRAME);
5688 pvh = pa_to_pvh(oldpde & PG_PS_FRAME);
5689 pmap_pvh_free(pvh, pmap, sva);
5691 for (va = sva, m = PHYS_TO_VM_PAGE(oldpde & PG_PS_FRAME);
5692 va < eva; va += PAGE_SIZE, m++) {
5693 if ((oldpde & (PG_M | PG_RW)) == (PG_M | PG_RW))
5696 vm_page_aflag_set(m, PGA_REFERENCED);
5697 if (TAILQ_EMPTY(&m->md.pv_list) &&
5698 TAILQ_EMPTY(&pvh->pv_list))
5699 vm_page_aflag_clear(m, PGA_WRITEABLE);
5700 pmap_delayed_invl_page(m);
5703 if (pmap == kernel_pmap) {
5704 pmap_remove_kernel_pde(pmap, pdq, sva);
5706 mpte = pmap_remove_pt_page(pmap, sva);
5708 KASSERT(mpte->valid == VM_PAGE_BITS_ALL,
5709 ("pmap_remove_pde: pte page not promoted"));
5710 pmap_resident_count_dec(pmap, 1);
5711 KASSERT(mpte->ref_count == NPTEPG,
5712 ("pmap_remove_pde: pte page ref count error"));
5713 mpte->ref_count = 0;
5714 pmap_add_delayed_free_list(mpte, free, FALSE);
5717 return (pmap_unuse_pt(pmap, sva, *pmap_pdpe(pmap, sva), free));
5721 * pmap_remove_pte: do the things to unmap a page in a process
5724 pmap_remove_pte(pmap_t pmap, pt_entry_t *ptq, vm_offset_t va,
5725 pd_entry_t ptepde, struct spglist *free, struct rwlock **lockp)
5727 struct md_page *pvh;
5728 pt_entry_t oldpte, PG_A, PG_M, PG_RW;
5731 PG_A = pmap_accessed_bit(pmap);
5732 PG_M = pmap_modified_bit(pmap);
5733 PG_RW = pmap_rw_bit(pmap);
5735 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
5736 oldpte = pte_load_clear(ptq);
5738 pmap->pm_stats.wired_count -= 1;
5739 pmap_resident_count_dec(pmap, 1);
5740 if (oldpte & PG_MANAGED) {
5741 m = PHYS_TO_VM_PAGE(oldpte & PG_FRAME);
5742 if ((oldpte & (PG_M | PG_RW)) == (PG_M | PG_RW))
5745 vm_page_aflag_set(m, PGA_REFERENCED);
5746 CHANGE_PV_LIST_LOCK_TO_VM_PAGE(lockp, m);
5747 pmap_pvh_free(&m->md, pmap, va);
5748 if (TAILQ_EMPTY(&m->md.pv_list) &&
5749 (m->flags & PG_FICTITIOUS) == 0) {
5750 pvh = pa_to_pvh(VM_PAGE_TO_PHYS(m));
5751 if (TAILQ_EMPTY(&pvh->pv_list))
5752 vm_page_aflag_clear(m, PGA_WRITEABLE);
5754 pmap_delayed_invl_page(m);
5756 return (pmap_unuse_pt(pmap, va, ptepde, free));
5760 * Remove a single page from a process address space
5763 pmap_remove_page(pmap_t pmap, vm_offset_t va, pd_entry_t *pde,
5764 struct spglist *free)
5766 struct rwlock *lock;
5767 pt_entry_t *pte, PG_V;
5769 PG_V = pmap_valid_bit(pmap);
5770 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
5771 if ((*pde & PG_V) == 0)
5773 pte = pmap_pde_to_pte(pde, va);
5774 if ((*pte & PG_V) == 0)
5777 pmap_remove_pte(pmap, pte, va, *pde, free, &lock);
5780 pmap_invalidate_page(pmap, va);
5784 * Removes the specified range of addresses from the page table page.
5787 pmap_remove_ptes(pmap_t pmap, vm_offset_t sva, vm_offset_t eva,
5788 pd_entry_t *pde, struct spglist *free, struct rwlock **lockp)
5790 pt_entry_t PG_G, *pte;
5794 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
5795 PG_G = pmap_global_bit(pmap);
5798 for (pte = pmap_pde_to_pte(pde, sva); sva != eva; pte++,
5802 pmap_invalidate_range(pmap, va, sva);
5807 if ((*pte & PG_G) == 0)
5811 if (pmap_remove_pte(pmap, pte, sva, *pde, free, lockp)) {
5817 pmap_invalidate_range(pmap, va, sva);
5822 * Remove the given range of addresses from the specified map.
5824 * It is assumed that the start and end are properly
5825 * rounded to the page size.
5828 pmap_remove(pmap_t pmap, vm_offset_t sva, vm_offset_t eva)
5830 struct rwlock *lock;
5831 vm_offset_t va_next;
5832 pml5_entry_t *pml5e;
5833 pml4_entry_t *pml4e;
5835 pd_entry_t ptpaddr, *pde;
5836 pt_entry_t PG_G, PG_V;
5837 struct spglist free;
5840 PG_G = pmap_global_bit(pmap);
5841 PG_V = pmap_valid_bit(pmap);
5844 * Perform an unsynchronized read. This is, however, safe.
5846 if (pmap->pm_stats.resident_count == 0)
5852 pmap_delayed_invl_start();
5854 pmap_pkru_on_remove(pmap, sva, eva);
5857 * special handling of removing one page. a very
5858 * common operation and easy to short circuit some
5861 if (sva + PAGE_SIZE == eva) {
5862 pde = pmap_pde(pmap, sva);
5863 if (pde && (*pde & PG_PS) == 0) {
5864 pmap_remove_page(pmap, sva, pde, &free);
5870 for (; sva < eva; sva = va_next) {
5871 if (pmap->pm_stats.resident_count == 0)
5874 if (pmap_is_la57(pmap)) {
5875 pml5e = pmap_pml5e(pmap, sva);
5876 if ((*pml5e & PG_V) == 0) {
5877 va_next = (sva + NBPML5) & ~PML5MASK;
5882 pml4e = pmap_pml5e_to_pml4e(pml5e, sva);
5884 pml4e = pmap_pml4e(pmap, sva);
5886 if ((*pml4e & PG_V) == 0) {
5887 va_next = (sva + NBPML4) & ~PML4MASK;
5893 pdpe = pmap_pml4e_to_pdpe(pml4e, sva);
5894 if ((*pdpe & PG_V) == 0) {
5895 va_next = (sva + NBPDP) & ~PDPMASK;
5902 * Calculate index for next page table.
5904 va_next = (sva + NBPDR) & ~PDRMASK;
5908 pde = pmap_pdpe_to_pde(pdpe, sva);
5912 * Weed out invalid mappings.
5918 * Check for large page.
5920 if ((ptpaddr & PG_PS) != 0) {
5922 * Are we removing the entire large page? If not,
5923 * demote the mapping and fall through.
5925 if (sva + NBPDR == va_next && eva >= va_next) {
5927 * The TLB entry for a PG_G mapping is
5928 * invalidated by pmap_remove_pde().
5930 if ((ptpaddr & PG_G) == 0)
5932 pmap_remove_pde(pmap, pde, sva, &free, &lock);
5934 } else if (!pmap_demote_pde_locked(pmap, pde, sva,
5936 /* The large page mapping was destroyed. */
5943 * Limit our scan to either the end of the va represented
5944 * by the current page table page, or to the end of the
5945 * range being removed.
5950 if (pmap_remove_ptes(pmap, sva, va_next, pde, &free, &lock))
5957 pmap_invalidate_all(pmap);
5959 pmap_delayed_invl_finish();
5960 vm_page_free_pages_toq(&free, true);
5964 * Routine: pmap_remove_all
5966 * Removes this physical page from
5967 * all physical maps in which it resides.
5968 * Reflects back modify bits to the pager.
5971 * Original versions of this routine were very
5972 * inefficient because they iteratively called
5973 * pmap_remove (slow...)
5977 pmap_remove_all(vm_page_t m)
5979 struct md_page *pvh;
5982 struct rwlock *lock;
5983 pt_entry_t *pte, tpte, PG_A, PG_M, PG_RW;
5986 struct spglist free;
5987 int pvh_gen, md_gen;
5989 KASSERT((m->oflags & VPO_UNMANAGED) == 0,
5990 ("pmap_remove_all: page %p is not managed", m));
5992 lock = VM_PAGE_TO_PV_LIST_LOCK(m);
5993 pvh = (m->flags & PG_FICTITIOUS) != 0 ? &pv_dummy :
5994 pa_to_pvh(VM_PAGE_TO_PHYS(m));
5997 while ((pv = TAILQ_FIRST(&pvh->pv_list)) != NULL) {
5999 if (!PMAP_TRYLOCK(pmap)) {
6000 pvh_gen = pvh->pv_gen;
6004 if (pvh_gen != pvh->pv_gen) {
6011 pde = pmap_pde(pmap, va);
6012 (void)pmap_demote_pde_locked(pmap, pde, va, &lock);
6015 while ((pv = TAILQ_FIRST(&m->md.pv_list)) != NULL) {
6017 if (!PMAP_TRYLOCK(pmap)) {
6018 pvh_gen = pvh->pv_gen;
6019 md_gen = m->md.pv_gen;
6023 if (pvh_gen != pvh->pv_gen || md_gen != m->md.pv_gen) {
6029 PG_A = pmap_accessed_bit(pmap);
6030 PG_M = pmap_modified_bit(pmap);
6031 PG_RW = pmap_rw_bit(pmap);
6032 pmap_resident_count_dec(pmap, 1);
6033 pde = pmap_pde(pmap, pv->pv_va);
6034 KASSERT((*pde & PG_PS) == 0, ("pmap_remove_all: found"
6035 " a 2mpage in page %p's pv list", m));
6036 pte = pmap_pde_to_pte(pde, pv->pv_va);
6037 tpte = pte_load_clear(pte);
6039 pmap->pm_stats.wired_count--;
6041 vm_page_aflag_set(m, PGA_REFERENCED);
6044 * Update the vm_page_t clean and reference bits.
6046 if ((tpte & (PG_M | PG_RW)) == (PG_M | PG_RW))
6048 pmap_unuse_pt(pmap, pv->pv_va, *pde, &free);
6049 pmap_invalidate_page(pmap, pv->pv_va);
6050 TAILQ_REMOVE(&m->md.pv_list, pv, pv_next);
6052 free_pv_entry(pmap, pv);
6055 vm_page_aflag_clear(m, PGA_WRITEABLE);
6057 pmap_delayed_invl_wait(m);
6058 vm_page_free_pages_toq(&free, true);
6062 * pmap_protect_pde: do the things to protect a 2mpage in a process
6065 pmap_protect_pde(pmap_t pmap, pd_entry_t *pde, vm_offset_t sva, vm_prot_t prot)
6067 pd_entry_t newpde, oldpde;
6069 boolean_t anychanged;
6070 pt_entry_t PG_G, PG_M, PG_RW;
6072 PG_G = pmap_global_bit(pmap);
6073 PG_M = pmap_modified_bit(pmap);
6074 PG_RW = pmap_rw_bit(pmap);
6076 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
6077 KASSERT((sva & PDRMASK) == 0,
6078 ("pmap_protect_pde: sva is not 2mpage aligned"));
6081 oldpde = newpde = *pde;
6082 if ((prot & VM_PROT_WRITE) == 0) {
6083 if ((oldpde & (PG_MANAGED | PG_M | PG_RW)) ==
6084 (PG_MANAGED | PG_M | PG_RW)) {
6085 m = PHYS_TO_VM_PAGE(oldpde & PG_PS_FRAME);
6086 for (mt = m; mt < &m[NBPDR / PAGE_SIZE]; mt++)
6089 newpde &= ~(PG_RW | PG_M);
6091 if ((prot & VM_PROT_EXECUTE) == 0)
6093 if (newpde != oldpde) {
6095 * As an optimization to future operations on this PDE, clear
6096 * PG_PROMOTED. The impending invalidation will remove any
6097 * lingering 4KB page mappings from the TLB.
6099 if (!atomic_cmpset_long(pde, oldpde, newpde & ~PG_PROMOTED))
6101 if ((oldpde & PG_G) != 0)
6102 pmap_invalidate_pde_page(kernel_pmap, sva, oldpde);
6106 return (anychanged);
6110 * Set the physical protection on the
6111 * specified range of this map as requested.
6114 pmap_protect(pmap_t pmap, vm_offset_t sva, vm_offset_t eva, vm_prot_t prot)
6116 vm_offset_t va_next;
6117 pml4_entry_t *pml4e;
6119 pd_entry_t ptpaddr, *pde;
6120 pt_entry_t *pte, PG_G, PG_M, PG_RW, PG_V;
6121 boolean_t anychanged;
6123 KASSERT((prot & ~VM_PROT_ALL) == 0, ("invalid prot %x", prot));
6124 if (prot == VM_PROT_NONE) {
6125 pmap_remove(pmap, sva, eva);
6129 if ((prot & (VM_PROT_WRITE|VM_PROT_EXECUTE)) ==
6130 (VM_PROT_WRITE|VM_PROT_EXECUTE))
6133 PG_G = pmap_global_bit(pmap);
6134 PG_M = pmap_modified_bit(pmap);
6135 PG_V = pmap_valid_bit(pmap);
6136 PG_RW = pmap_rw_bit(pmap);
6140 * Although this function delays and batches the invalidation
6141 * of stale TLB entries, it does not need to call
6142 * pmap_delayed_invl_start() and
6143 * pmap_delayed_invl_finish(), because it does not
6144 * ordinarily destroy mappings. Stale TLB entries from
6145 * protection-only changes need only be invalidated before the
6146 * pmap lock is released, because protection-only changes do
6147 * not destroy PV entries. Even operations that iterate over
6148 * a physical page's PV list of mappings, like
6149 * pmap_remove_write(), acquire the pmap lock for each
6150 * mapping. Consequently, for protection-only changes, the
6151 * pmap lock suffices to synchronize both page table and TLB
6154 * This function only destroys a mapping if pmap_demote_pde()
6155 * fails. In that case, stale TLB entries are immediately
6160 for (; sva < eva; sva = va_next) {
6161 pml4e = pmap_pml4e(pmap, sva);
6162 if ((*pml4e & PG_V) == 0) {
6163 va_next = (sva + NBPML4) & ~PML4MASK;
6169 pdpe = pmap_pml4e_to_pdpe(pml4e, sva);
6170 if ((*pdpe & PG_V) == 0) {
6171 va_next = (sva + NBPDP) & ~PDPMASK;
6177 va_next = (sva + NBPDR) & ~PDRMASK;
6181 pde = pmap_pdpe_to_pde(pdpe, sva);
6185 * Weed out invalid mappings.
6191 * Check for large page.
6193 if ((ptpaddr & PG_PS) != 0) {
6195 * Are we protecting the entire large page? If not,
6196 * demote the mapping and fall through.
6198 if (sva + NBPDR == va_next && eva >= va_next) {
6200 * The TLB entry for a PG_G mapping is
6201 * invalidated by pmap_protect_pde().
6203 if (pmap_protect_pde(pmap, pde, sva, prot))
6206 } else if (!pmap_demote_pde(pmap, pde, sva)) {
6208 * The large page mapping was destroyed.
6217 for (pte = pmap_pde_to_pte(pde, sva); sva != va_next; pte++,
6219 pt_entry_t obits, pbits;
6223 obits = pbits = *pte;
6224 if ((pbits & PG_V) == 0)
6227 if ((prot & VM_PROT_WRITE) == 0) {
6228 if ((pbits & (PG_MANAGED | PG_M | PG_RW)) ==
6229 (PG_MANAGED | PG_M | PG_RW)) {
6230 m = PHYS_TO_VM_PAGE(pbits & PG_FRAME);
6233 pbits &= ~(PG_RW | PG_M);
6235 if ((prot & VM_PROT_EXECUTE) == 0)
6238 if (pbits != obits) {
6239 if (!atomic_cmpset_long(pte, obits, pbits))
6242 pmap_invalidate_page(pmap, sva);
6249 pmap_invalidate_all(pmap);
6253 #if VM_NRESERVLEVEL > 0
6255 pmap_pde_ept_executable(pmap_t pmap, pd_entry_t pde)
6258 if (pmap->pm_type != PT_EPT)
6260 return ((pde & EPT_PG_EXECUTE) != 0);
6264 * Tries to promote the 512, contiguous 4KB page mappings that are within a
6265 * single page table page (PTP) to a single 2MB page mapping. For promotion
6266 * to occur, two conditions must be met: (1) the 4KB page mappings must map
6267 * aligned, contiguous physical memory and (2) the 4KB page mappings must have
6268 * identical characteristics.
6271 pmap_promote_pde(pmap_t pmap, pd_entry_t *pde, vm_offset_t va,
6272 struct rwlock **lockp)
6275 pt_entry_t *firstpte, oldpte, pa, *pte;
6276 pt_entry_t PG_G, PG_A, PG_M, PG_RW, PG_V, PG_PKU_MASK;
6280 PG_A = pmap_accessed_bit(pmap);
6281 PG_G = pmap_global_bit(pmap);
6282 PG_M = pmap_modified_bit(pmap);
6283 PG_V = pmap_valid_bit(pmap);
6284 PG_RW = pmap_rw_bit(pmap);
6285 PG_PKU_MASK = pmap_pku_mask_bit(pmap);
6286 PG_PTE_CACHE = pmap_cache_mask(pmap, 0);
6288 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
6291 * Examine the first PTE in the specified PTP. Abort if this PTE is
6292 * either invalid, unused, or does not map the first 4KB physical page
6293 * within a 2MB page.
6295 firstpte = (pt_entry_t *)PHYS_TO_DMAP(*pde & PG_FRAME);
6298 if ((newpde & ((PG_FRAME & PDRMASK) | PG_A | PG_V)) != (PG_A | PG_V) ||
6299 !pmap_allow_2m_x_page(pmap, pmap_pde_ept_executable(pmap,
6301 atomic_add_long(&pmap_pde_p_failures, 1);
6302 CTR2(KTR_PMAP, "pmap_promote_pde: failure for va %#lx"
6303 " in pmap %p", va, pmap);
6306 if ((newpde & (PG_M | PG_RW)) == PG_RW) {
6308 * When PG_M is already clear, PG_RW can be cleared without
6309 * a TLB invalidation.
6311 if (!atomic_cmpset_long(firstpte, newpde, newpde & ~PG_RW))
6317 * Examine each of the other PTEs in the specified PTP. Abort if this
6318 * PTE maps an unexpected 4KB physical page or does not have identical
6319 * characteristics to the first PTE.
6321 pa = (newpde & (PG_PS_FRAME | PG_A | PG_V)) + NBPDR - PAGE_SIZE;
6322 for (pte = firstpte + NPTEPG - 1; pte > firstpte; pte--) {
6325 if ((oldpte & (PG_FRAME | PG_A | PG_V)) != pa) {
6326 atomic_add_long(&pmap_pde_p_failures, 1);
6327 CTR2(KTR_PMAP, "pmap_promote_pde: failure for va %#lx"
6328 " in pmap %p", va, pmap);
6331 if ((oldpte & (PG_M | PG_RW)) == PG_RW) {
6333 * When PG_M is already clear, PG_RW can be cleared
6334 * without a TLB invalidation.
6336 if (!atomic_cmpset_long(pte, oldpte, oldpte & ~PG_RW))
6339 CTR2(KTR_PMAP, "pmap_promote_pde: protect for va %#lx"
6340 " in pmap %p", (oldpte & PG_FRAME & PDRMASK) |
6341 (va & ~PDRMASK), pmap);
6343 if ((oldpte & PG_PTE_PROMOTE) != (newpde & PG_PTE_PROMOTE)) {
6344 atomic_add_long(&pmap_pde_p_failures, 1);
6345 CTR2(KTR_PMAP, "pmap_promote_pde: failure for va %#lx"
6346 " in pmap %p", va, pmap);
6353 * Save the page table page in its current state until the PDE
6354 * mapping the superpage is demoted by pmap_demote_pde() or
6355 * destroyed by pmap_remove_pde().
6357 mpte = PHYS_TO_VM_PAGE(*pde & PG_FRAME);
6358 KASSERT(mpte >= vm_page_array &&
6359 mpte < &vm_page_array[vm_page_array_size],
6360 ("pmap_promote_pde: page table page is out of range"));
6361 KASSERT(mpte->pindex == pmap_pde_pindex(va),
6362 ("pmap_promote_pde: page table page's pindex is wrong"));
6363 if (pmap_insert_pt_page(pmap, mpte, true)) {
6364 atomic_add_long(&pmap_pde_p_failures, 1);
6366 "pmap_promote_pde: failure for va %#lx in pmap %p", va,
6372 * Promote the pv entries.
6374 if ((newpde & PG_MANAGED) != 0)
6375 pmap_pv_promote_pde(pmap, va, newpde & PG_PS_FRAME, lockp);
6378 * Propagate the PAT index to its proper position.
6380 newpde = pmap_swap_pat(pmap, newpde);
6383 * Map the superpage.
6385 if (workaround_erratum383)
6386 pmap_update_pde(pmap, va, pde, PG_PS | newpde);
6388 pde_store(pde, PG_PROMOTED | PG_PS | newpde);
6390 atomic_add_long(&pmap_pde_promotions, 1);
6391 CTR2(KTR_PMAP, "pmap_promote_pde: success for va %#lx"
6392 " in pmap %p", va, pmap);
6394 #endif /* VM_NRESERVLEVEL > 0 */
6397 * Insert the given physical page (p) at
6398 * the specified virtual address (v) in the
6399 * target physical map with the protection requested.
6401 * If specified, the page will be wired down, meaning
6402 * that the related pte can not be reclaimed.
6404 * NB: This is the only routine which MAY NOT lazy-evaluate
6405 * or lose information. That is, this routine must actually
6406 * insert this page into the given map NOW.
6408 * When destroying both a page table and PV entry, this function
6409 * performs the TLB invalidation before releasing the PV list
6410 * lock, so we do not need pmap_delayed_invl_page() calls here.
6413 pmap_enter(pmap_t pmap, vm_offset_t va, vm_page_t m, vm_prot_t prot,
6414 u_int flags, int8_t psind)
6416 struct rwlock *lock;
6418 pt_entry_t *pte, PG_G, PG_A, PG_M, PG_RW, PG_V;
6419 pt_entry_t newpte, origpte;
6426 PG_A = pmap_accessed_bit(pmap);
6427 PG_G = pmap_global_bit(pmap);
6428 PG_M = pmap_modified_bit(pmap);
6429 PG_V = pmap_valid_bit(pmap);
6430 PG_RW = pmap_rw_bit(pmap);
6432 va = trunc_page(va);
6433 KASSERT(va <= VM_MAX_KERNEL_ADDRESS, ("pmap_enter: toobig"));
6434 KASSERT(va < UPT_MIN_ADDRESS || va >= UPT_MAX_ADDRESS,
6435 ("pmap_enter: invalid to pmap_enter page table pages (va: 0x%lx)",
6437 KASSERT((m->oflags & VPO_UNMANAGED) != 0 || va < kmi.clean_sva ||
6438 va >= kmi.clean_eva,
6439 ("pmap_enter: managed mapping within the clean submap"));
6440 if ((m->oflags & VPO_UNMANAGED) == 0)
6441 VM_PAGE_OBJECT_BUSY_ASSERT(m);
6442 KASSERT((flags & PMAP_ENTER_RESERVED) == 0,
6443 ("pmap_enter: flags %u has reserved bits set", flags));
6444 pa = VM_PAGE_TO_PHYS(m);
6445 newpte = (pt_entry_t)(pa | PG_A | PG_V);
6446 if ((flags & VM_PROT_WRITE) != 0)
6448 if ((prot & VM_PROT_WRITE) != 0)
6450 KASSERT((newpte & (PG_M | PG_RW)) != PG_M,
6451 ("pmap_enter: flags includes VM_PROT_WRITE but prot doesn't"));
6452 if ((prot & VM_PROT_EXECUTE) == 0)
6454 if ((flags & PMAP_ENTER_WIRED) != 0)
6456 if (va < VM_MAXUSER_ADDRESS)
6458 if (pmap == kernel_pmap)
6460 newpte |= pmap_cache_bits(pmap, m->md.pat_mode, psind > 0);
6463 * Set modified bit gratuitously for writeable mappings if
6464 * the page is unmanaged. We do not want to take a fault
6465 * to do the dirty bit accounting for these mappings.
6467 if ((m->oflags & VPO_UNMANAGED) != 0) {
6468 if ((newpte & PG_RW) != 0)
6471 newpte |= PG_MANAGED;
6476 /* Assert the required virtual and physical alignment. */
6477 KASSERT((va & PDRMASK) == 0, ("pmap_enter: va unaligned"));
6478 KASSERT(m->psind > 0, ("pmap_enter: m->psind < psind"));
6479 rv = pmap_enter_pde(pmap, va, newpte | PG_PS, flags, m, &lock);
6485 * In the case that a page table page is not
6486 * resident, we are creating it here.
6489 pde = pmap_pde(pmap, va);
6490 if (pde != NULL && (*pde & PG_V) != 0 && ((*pde & PG_PS) == 0 ||
6491 pmap_demote_pde_locked(pmap, pde, va, &lock))) {
6492 pte = pmap_pde_to_pte(pde, va);
6493 if (va < VM_MAXUSER_ADDRESS && mpte == NULL) {
6494 mpte = PHYS_TO_VM_PAGE(*pde & PG_FRAME);
6497 } else if (va < VM_MAXUSER_ADDRESS) {
6499 * Here if the pte page isn't mapped, or if it has been
6502 nosleep = (flags & PMAP_ENTER_NOSLEEP) != 0;
6503 mpte = _pmap_allocpte(pmap, pmap_pde_pindex(va),
6504 nosleep ? NULL : &lock, va);
6505 if (mpte == NULL && nosleep) {
6506 rv = KERN_RESOURCE_SHORTAGE;
6511 panic("pmap_enter: invalid page directory va=%#lx", va);
6515 if (va < VM_MAXUSER_ADDRESS && pmap->pm_type == PT_X86)
6516 newpte |= pmap_pkru_get(pmap, va);
6519 * Is the specified virtual address already mapped?
6521 if ((origpte & PG_V) != 0) {
6523 * Wiring change, just update stats. We don't worry about
6524 * wiring PT pages as they remain resident as long as there
6525 * are valid mappings in them. Hence, if a user page is wired,
6526 * the PT page will be also.
6528 if ((newpte & PG_W) != 0 && (origpte & PG_W) == 0)
6529 pmap->pm_stats.wired_count++;
6530 else if ((newpte & PG_W) == 0 && (origpte & PG_W) != 0)
6531 pmap->pm_stats.wired_count--;
6534 * Remove the extra PT page reference.
6538 KASSERT(mpte->ref_count > 0,
6539 ("pmap_enter: missing reference to page table page,"
6544 * Has the physical page changed?
6546 opa = origpte & PG_FRAME;
6549 * No, might be a protection or wiring change.
6551 if ((origpte & PG_MANAGED) != 0 &&
6552 (newpte & PG_RW) != 0)
6553 vm_page_aflag_set(m, PGA_WRITEABLE);
6554 if (((origpte ^ newpte) & ~(PG_M | PG_A)) == 0)
6560 * The physical page has changed. Temporarily invalidate
6561 * the mapping. This ensures that all threads sharing the
6562 * pmap keep a consistent view of the mapping, which is
6563 * necessary for the correct handling of COW faults. It
6564 * also permits reuse of the old mapping's PV entry,
6565 * avoiding an allocation.
6567 * For consistency, handle unmanaged mappings the same way.
6569 origpte = pte_load_clear(pte);
6570 KASSERT((origpte & PG_FRAME) == opa,
6571 ("pmap_enter: unexpected pa update for %#lx", va));
6572 if ((origpte & PG_MANAGED) != 0) {
6573 om = PHYS_TO_VM_PAGE(opa);
6576 * The pmap lock is sufficient to synchronize with
6577 * concurrent calls to pmap_page_test_mappings() and
6578 * pmap_ts_referenced().
6580 if ((origpte & (PG_M | PG_RW)) == (PG_M | PG_RW))
6582 if ((origpte & PG_A) != 0) {
6583 pmap_invalidate_page(pmap, va);
6584 vm_page_aflag_set(om, PGA_REFERENCED);
6586 CHANGE_PV_LIST_LOCK_TO_PHYS(&lock, opa);
6587 pv = pmap_pvh_remove(&om->md, pmap, va);
6589 ("pmap_enter: no PV entry for %#lx", va));
6590 if ((newpte & PG_MANAGED) == 0)
6591 free_pv_entry(pmap, pv);
6592 if ((om->a.flags & PGA_WRITEABLE) != 0 &&
6593 TAILQ_EMPTY(&om->md.pv_list) &&
6594 ((om->flags & PG_FICTITIOUS) != 0 ||
6595 TAILQ_EMPTY(&pa_to_pvh(opa)->pv_list)))
6596 vm_page_aflag_clear(om, PGA_WRITEABLE);
6599 * Since this mapping is unmanaged, assume that PG_A
6602 pmap_invalidate_page(pmap, va);
6607 * Increment the counters.
6609 if ((newpte & PG_W) != 0)
6610 pmap->pm_stats.wired_count++;
6611 pmap_resident_count_inc(pmap, 1);
6615 * Enter on the PV list if part of our managed memory.
6617 if ((newpte & PG_MANAGED) != 0) {
6619 pv = get_pv_entry(pmap, &lock);
6622 CHANGE_PV_LIST_LOCK_TO_PHYS(&lock, pa);
6623 TAILQ_INSERT_TAIL(&m->md.pv_list, pv, pv_next);
6625 if ((newpte & PG_RW) != 0)
6626 vm_page_aflag_set(m, PGA_WRITEABLE);
6632 if ((origpte & PG_V) != 0) {
6634 origpte = pte_load_store(pte, newpte);
6635 KASSERT((origpte & PG_FRAME) == pa,
6636 ("pmap_enter: unexpected pa update for %#lx", va));
6637 if ((newpte & PG_M) == 0 && (origpte & (PG_M | PG_RW)) ==
6639 if ((origpte & PG_MANAGED) != 0)
6643 * Although the PTE may still have PG_RW set, TLB
6644 * invalidation may nonetheless be required because
6645 * the PTE no longer has PG_M set.
6647 } else if ((origpte & PG_NX) != 0 || (newpte & PG_NX) == 0) {
6649 * This PTE change does not require TLB invalidation.
6653 if ((origpte & PG_A) != 0)
6654 pmap_invalidate_page(pmap, va);
6656 pte_store(pte, newpte);
6660 #if VM_NRESERVLEVEL > 0
6662 * If both the page table page and the reservation are fully
6663 * populated, then attempt promotion.
6665 if ((mpte == NULL || mpte->ref_count == NPTEPG) &&
6666 pmap_ps_enabled(pmap) &&
6667 (m->flags & PG_FICTITIOUS) == 0 &&
6668 vm_reserv_level_iffullpop(m) == 0)
6669 pmap_promote_pde(pmap, pde, va, &lock);
6681 * Tries to create a read- and/or execute-only 2MB page mapping. Returns true
6682 * if successful. Returns false if (1) a page table page cannot be allocated
6683 * without sleeping, (2) a mapping already exists at the specified virtual
6684 * address, or (3) a PV entry cannot be allocated without reclaiming another
6688 pmap_enter_2mpage(pmap_t pmap, vm_offset_t va, vm_page_t m, vm_prot_t prot,
6689 struct rwlock **lockp)
6694 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
6695 PG_V = pmap_valid_bit(pmap);
6696 newpde = VM_PAGE_TO_PHYS(m) | pmap_cache_bits(pmap, m->md.pat_mode, 1) |
6698 if ((m->oflags & VPO_UNMANAGED) == 0)
6699 newpde |= PG_MANAGED;
6700 if ((prot & VM_PROT_EXECUTE) == 0)
6702 if (va < VM_MAXUSER_ADDRESS)
6704 return (pmap_enter_pde(pmap, va, newpde, PMAP_ENTER_NOSLEEP |
6705 PMAP_ENTER_NOREPLACE | PMAP_ENTER_NORECLAIM, NULL, lockp) ==
6710 * Returns true if every page table entry in the specified page table page is
6714 pmap_every_pte_zero(vm_paddr_t pa)
6716 pt_entry_t *pt_end, *pte;
6718 KASSERT((pa & PAGE_MASK) == 0, ("pa is misaligned"));
6719 pte = (pt_entry_t *)PHYS_TO_DMAP(pa);
6720 for (pt_end = pte + NPTEPG; pte < pt_end; pte++) {
6728 * Tries to create the specified 2MB page mapping. Returns KERN_SUCCESS if
6729 * the mapping was created, and either KERN_FAILURE or KERN_RESOURCE_SHORTAGE
6730 * otherwise. Returns KERN_FAILURE if PMAP_ENTER_NOREPLACE was specified and
6731 * a mapping already exists at the specified virtual address. Returns
6732 * KERN_RESOURCE_SHORTAGE if PMAP_ENTER_NOSLEEP was specified and a page table
6733 * page allocation failed. Returns KERN_RESOURCE_SHORTAGE if
6734 * PMAP_ENTER_NORECLAIM was specified and a PV entry allocation failed.
6736 * The parameter "m" is only used when creating a managed, writeable mapping.
6739 pmap_enter_pde(pmap_t pmap, vm_offset_t va, pd_entry_t newpde, u_int flags,
6740 vm_page_t m, struct rwlock **lockp)
6742 struct spglist free;
6743 pd_entry_t oldpde, *pde;
6744 pt_entry_t PG_G, PG_RW, PG_V;
6747 KASSERT(pmap == kernel_pmap || (newpde & PG_W) == 0,
6748 ("pmap_enter_pde: cannot create wired user mapping"));
6749 PG_G = pmap_global_bit(pmap);
6750 PG_RW = pmap_rw_bit(pmap);
6751 KASSERT((newpde & (pmap_modified_bit(pmap) | PG_RW)) != PG_RW,
6752 ("pmap_enter_pde: newpde is missing PG_M"));
6753 PG_V = pmap_valid_bit(pmap);
6754 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
6756 if (!pmap_allow_2m_x_page(pmap, pmap_pde_ept_executable(pmap,
6758 CTR2(KTR_PMAP, "pmap_enter_pde: 2m x blocked for va %#lx"
6759 " in pmap %p", va, pmap);
6760 return (KERN_FAILURE);
6762 if ((pde = pmap_alloc_pde(pmap, va, &pdpg, (flags &
6763 PMAP_ENTER_NOSLEEP) != 0 ? NULL : lockp)) == NULL) {
6764 CTR2(KTR_PMAP, "pmap_enter_pde: failure for va %#lx"
6765 " in pmap %p", va, pmap);
6766 return (KERN_RESOURCE_SHORTAGE);
6770 * If pkru is not same for the whole pde range, return failure
6771 * and let vm_fault() cope. Check after pde allocation, since
6774 if (!pmap_pkru_same(pmap, va, va + NBPDR)) {
6775 pmap_abort_ptp(pmap, va, pdpg);
6776 return (KERN_FAILURE);
6778 if (va < VM_MAXUSER_ADDRESS && pmap->pm_type == PT_X86) {
6779 newpde &= ~X86_PG_PKU_MASK;
6780 newpde |= pmap_pkru_get(pmap, va);
6784 * If there are existing mappings, either abort or remove them.
6787 if ((oldpde & PG_V) != 0) {
6788 KASSERT(pdpg == NULL || pdpg->ref_count > 1,
6789 ("pmap_enter_pde: pdpg's reference count is too low"));
6790 if ((flags & PMAP_ENTER_NOREPLACE) != 0 && (va <
6791 VM_MAXUSER_ADDRESS || (oldpde & PG_PS) != 0 ||
6792 !pmap_every_pte_zero(oldpde & PG_FRAME))) {
6795 CTR2(KTR_PMAP, "pmap_enter_pde: failure for va %#lx"
6796 " in pmap %p", va, pmap);
6797 return (KERN_FAILURE);
6799 /* Break the existing mapping(s). */
6801 if ((oldpde & PG_PS) != 0) {
6803 * The reference to the PD page that was acquired by
6804 * pmap_alloc_pde() ensures that it won't be freed.
6805 * However, if the PDE resulted from a promotion, then
6806 * a reserved PT page could be freed.
6808 (void)pmap_remove_pde(pmap, pde, va, &free, lockp);
6809 if ((oldpde & PG_G) == 0)
6810 pmap_invalidate_pde_page(pmap, va, oldpde);
6812 pmap_delayed_invl_start();
6813 if (pmap_remove_ptes(pmap, va, va + NBPDR, pde, &free,
6815 pmap_invalidate_all(pmap);
6816 pmap_delayed_invl_finish();
6818 if (va < VM_MAXUSER_ADDRESS) {
6819 vm_page_free_pages_toq(&free, true);
6820 KASSERT(*pde == 0, ("pmap_enter_pde: non-zero pde %p",
6823 KASSERT(SLIST_EMPTY(&free),
6824 ("pmap_enter_pde: freed kernel page table page"));
6827 * Both pmap_remove_pde() and pmap_remove_ptes() will
6828 * leave the kernel page table page zero filled.
6830 mt = PHYS_TO_VM_PAGE(*pde & PG_FRAME);
6831 if (pmap_insert_pt_page(pmap, mt, false))
6832 panic("pmap_enter_pde: trie insert failed");
6836 if ((newpde & PG_MANAGED) != 0) {
6838 * Abort this mapping if its PV entry could not be created.
6840 if (!pmap_pv_insert_pde(pmap, va, newpde, flags, lockp)) {
6842 pmap_abort_ptp(pmap, va, pdpg);
6843 CTR2(KTR_PMAP, "pmap_enter_pde: failure for va %#lx"
6844 " in pmap %p", va, pmap);
6845 return (KERN_RESOURCE_SHORTAGE);
6847 if ((newpde & PG_RW) != 0) {
6848 for (mt = m; mt < &m[NBPDR / PAGE_SIZE]; mt++)
6849 vm_page_aflag_set(mt, PGA_WRITEABLE);
6854 * Increment counters.
6856 if ((newpde & PG_W) != 0)
6857 pmap->pm_stats.wired_count += NBPDR / PAGE_SIZE;
6858 pmap_resident_count_inc(pmap, NBPDR / PAGE_SIZE);
6861 * Map the superpage. (This is not a promoted mapping; there will not
6862 * be any lingering 4KB page mappings in the TLB.)
6864 pde_store(pde, newpde);
6866 atomic_add_long(&pmap_pde_mappings, 1);
6867 CTR2(KTR_PMAP, "pmap_enter_pde: success for va %#lx in pmap %p",
6869 return (KERN_SUCCESS);
6873 * Maps a sequence of resident pages belonging to the same object.
6874 * The sequence begins with the given page m_start. This page is
6875 * mapped at the given virtual address start. Each subsequent page is
6876 * mapped at a virtual address that is offset from start by the same
6877 * amount as the page is offset from m_start within the object. The
6878 * last page in the sequence is the page with the largest offset from
6879 * m_start that can be mapped at a virtual address less than the given
6880 * virtual address end. Not every virtual page between start and end
6881 * is mapped; only those for which a resident page exists with the
6882 * corresponding offset from m_start are mapped.
6885 pmap_enter_object(pmap_t pmap, vm_offset_t start, vm_offset_t end,
6886 vm_page_t m_start, vm_prot_t prot)
6888 struct rwlock *lock;
6891 vm_pindex_t diff, psize;
6893 VM_OBJECT_ASSERT_LOCKED(m_start->object);
6895 psize = atop(end - start);
6900 while (m != NULL && (diff = m->pindex - m_start->pindex) < psize) {
6901 va = start + ptoa(diff);
6902 if ((va & PDRMASK) == 0 && va + NBPDR <= end &&
6903 m->psind == 1 && pmap_ps_enabled(pmap) &&
6904 pmap_allow_2m_x_page(pmap, (prot & VM_PROT_EXECUTE) != 0) &&
6905 pmap_enter_2mpage(pmap, va, m, prot, &lock))
6906 m = &m[NBPDR / PAGE_SIZE - 1];
6908 mpte = pmap_enter_quick_locked(pmap, va, m, prot,
6910 m = TAILQ_NEXT(m, listq);
6918 * this code makes some *MAJOR* assumptions:
6919 * 1. Current pmap & pmap exists.
6922 * 4. No page table pages.
6923 * but is *MUCH* faster than pmap_enter...
6927 pmap_enter_quick(pmap_t pmap, vm_offset_t va, vm_page_t m, vm_prot_t prot)
6929 struct rwlock *lock;
6933 (void)pmap_enter_quick_locked(pmap, va, m, prot, NULL, &lock);
6940 pmap_enter_quick_locked(pmap_t pmap, vm_offset_t va, vm_page_t m,
6941 vm_prot_t prot, vm_page_t mpte, struct rwlock **lockp)
6943 pt_entry_t newpte, *pte, PG_V;
6945 KASSERT(va < kmi.clean_sva || va >= kmi.clean_eva ||
6946 (m->oflags & VPO_UNMANAGED) != 0,
6947 ("pmap_enter_quick_locked: managed mapping within the clean submap"));
6948 PG_V = pmap_valid_bit(pmap);
6949 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
6952 * In the case that a page table page is not
6953 * resident, we are creating it here.
6955 if (va < VM_MAXUSER_ADDRESS) {
6956 vm_pindex_t ptepindex;
6960 * Calculate pagetable page index
6962 ptepindex = pmap_pde_pindex(va);
6963 if (mpte && (mpte->pindex == ptepindex)) {
6967 * Get the page directory entry
6969 ptepa = pmap_pde(pmap, va);
6972 * If the page table page is mapped, we just increment
6973 * the hold count, and activate it. Otherwise, we
6974 * attempt to allocate a page table page. If this
6975 * attempt fails, we don't retry. Instead, we give up.
6977 if (ptepa && (*ptepa & PG_V) != 0) {
6980 mpte = PHYS_TO_VM_PAGE(*ptepa & PG_FRAME);
6984 * Pass NULL instead of the PV list lock
6985 * pointer, because we don't intend to sleep.
6987 mpte = _pmap_allocpte(pmap, ptepindex, NULL,
6993 pte = (pt_entry_t *)PHYS_TO_DMAP(VM_PAGE_TO_PHYS(mpte));
6994 pte = &pte[pmap_pte_index(va)];
7006 * Enter on the PV list if part of our managed memory.
7008 if ((m->oflags & VPO_UNMANAGED) == 0 &&
7009 !pmap_try_insert_pv_entry(pmap, va, m, lockp)) {
7011 pmap_abort_ptp(pmap, va, mpte);
7016 * Increment counters
7018 pmap_resident_count_inc(pmap, 1);
7020 newpte = VM_PAGE_TO_PHYS(m) | PG_V |
7021 pmap_cache_bits(pmap, m->md.pat_mode, 0);
7022 if ((m->oflags & VPO_UNMANAGED) == 0)
7023 newpte |= PG_MANAGED;
7024 if ((prot & VM_PROT_EXECUTE) == 0)
7026 if (va < VM_MAXUSER_ADDRESS)
7027 newpte |= PG_U | pmap_pkru_get(pmap, va);
7028 pte_store(pte, newpte);
7033 * Make a temporary mapping for a physical address. This is only intended
7034 * to be used for panic dumps.
7037 pmap_kenter_temporary(vm_paddr_t pa, int i)
7041 va = (vm_offset_t)crashdumpmap + (i * PAGE_SIZE);
7042 pmap_kenter(va, pa);
7044 return ((void *)crashdumpmap);
7048 * This code maps large physical mmap regions into the
7049 * processor address space. Note that some shortcuts
7050 * are taken, but the code works.
7053 pmap_object_init_pt(pmap_t pmap, vm_offset_t addr, vm_object_t object,
7054 vm_pindex_t pindex, vm_size_t size)
7057 pt_entry_t PG_A, PG_M, PG_RW, PG_V;
7058 vm_paddr_t pa, ptepa;
7062 PG_A = pmap_accessed_bit(pmap);
7063 PG_M = pmap_modified_bit(pmap);
7064 PG_V = pmap_valid_bit(pmap);
7065 PG_RW = pmap_rw_bit(pmap);
7067 VM_OBJECT_ASSERT_WLOCKED(object);
7068 KASSERT(object->type == OBJT_DEVICE || object->type == OBJT_SG,
7069 ("pmap_object_init_pt: non-device object"));
7070 if ((addr & (NBPDR - 1)) == 0 && (size & (NBPDR - 1)) == 0) {
7071 if (!pmap_ps_enabled(pmap))
7073 if (!vm_object_populate(object, pindex, pindex + atop(size)))
7075 p = vm_page_lookup(object, pindex);
7076 KASSERT(p->valid == VM_PAGE_BITS_ALL,
7077 ("pmap_object_init_pt: invalid page %p", p));
7078 pat_mode = p->md.pat_mode;
7081 * Abort the mapping if the first page is not physically
7082 * aligned to a 2MB page boundary.
7084 ptepa = VM_PAGE_TO_PHYS(p);
7085 if (ptepa & (NBPDR - 1))
7089 * Skip the first page. Abort the mapping if the rest of
7090 * the pages are not physically contiguous or have differing
7091 * memory attributes.
7093 p = TAILQ_NEXT(p, listq);
7094 for (pa = ptepa + PAGE_SIZE; pa < ptepa + size;
7096 KASSERT(p->valid == VM_PAGE_BITS_ALL,
7097 ("pmap_object_init_pt: invalid page %p", p));
7098 if (pa != VM_PAGE_TO_PHYS(p) ||
7099 pat_mode != p->md.pat_mode)
7101 p = TAILQ_NEXT(p, listq);
7105 * Map using 2MB pages. Since "ptepa" is 2M aligned and
7106 * "size" is a multiple of 2M, adding the PAT setting to "pa"
7107 * will not affect the termination of this loop.
7110 for (pa = ptepa | pmap_cache_bits(pmap, pat_mode, 1);
7111 pa < ptepa + size; pa += NBPDR) {
7112 pde = pmap_alloc_pde(pmap, addr, &pdpg, NULL);
7115 * The creation of mappings below is only an
7116 * optimization. If a page directory page
7117 * cannot be allocated without blocking,
7118 * continue on to the next mapping rather than
7124 if ((*pde & PG_V) == 0) {
7125 pde_store(pde, pa | PG_PS | PG_M | PG_A |
7126 PG_U | PG_RW | PG_V);
7127 pmap_resident_count_inc(pmap, NBPDR / PAGE_SIZE);
7128 atomic_add_long(&pmap_pde_mappings, 1);
7130 /* Continue on if the PDE is already valid. */
7132 KASSERT(pdpg->ref_count > 0,
7133 ("pmap_object_init_pt: missing reference "
7134 "to page directory page, va: 0x%lx", addr));
7143 * Clear the wired attribute from the mappings for the specified range of
7144 * addresses in the given pmap. Every valid mapping within that range
7145 * must have the wired attribute set. In contrast, invalid mappings
7146 * cannot have the wired attribute set, so they are ignored.
7148 * The wired attribute of the page table entry is not a hardware
7149 * feature, so there is no need to invalidate any TLB entries.
7150 * Since pmap_demote_pde() for the wired entry must never fail,
7151 * pmap_delayed_invl_start()/finish() calls around the
7152 * function are not needed.
7155 pmap_unwire(pmap_t pmap, vm_offset_t sva, vm_offset_t eva)
7157 vm_offset_t va_next;
7158 pml4_entry_t *pml4e;
7161 pt_entry_t *pte, PG_V;
7163 PG_V = pmap_valid_bit(pmap);
7165 for (; sva < eva; sva = va_next) {
7166 pml4e = pmap_pml4e(pmap, sva);
7167 if ((*pml4e & PG_V) == 0) {
7168 va_next = (sva + NBPML4) & ~PML4MASK;
7173 pdpe = pmap_pml4e_to_pdpe(pml4e, sva);
7174 if ((*pdpe & PG_V) == 0) {
7175 va_next = (sva + NBPDP) & ~PDPMASK;
7180 va_next = (sva + NBPDR) & ~PDRMASK;
7183 pde = pmap_pdpe_to_pde(pdpe, sva);
7184 if ((*pde & PG_V) == 0)
7186 if ((*pde & PG_PS) != 0) {
7187 if ((*pde & PG_W) == 0)
7188 panic("pmap_unwire: pde %#jx is missing PG_W",
7192 * Are we unwiring the entire large page? If not,
7193 * demote the mapping and fall through.
7195 if (sva + NBPDR == va_next && eva >= va_next) {
7196 atomic_clear_long(pde, PG_W);
7197 pmap->pm_stats.wired_count -= NBPDR /
7200 } else if (!pmap_demote_pde(pmap, pde, sva))
7201 panic("pmap_unwire: demotion failed");
7205 for (pte = pmap_pde_to_pte(pde, sva); sva != va_next; pte++,
7207 if ((*pte & PG_V) == 0)
7209 if ((*pte & PG_W) == 0)
7210 panic("pmap_unwire: pte %#jx is missing PG_W",
7214 * PG_W must be cleared atomically. Although the pmap
7215 * lock synchronizes access to PG_W, another processor
7216 * could be setting PG_M and/or PG_A concurrently.
7218 atomic_clear_long(pte, PG_W);
7219 pmap->pm_stats.wired_count--;
7226 * Copy the range specified by src_addr/len
7227 * from the source map to the range dst_addr/len
7228 * in the destination map.
7230 * This routine is only advisory and need not do anything.
7233 pmap_copy(pmap_t dst_pmap, pmap_t src_pmap, vm_offset_t dst_addr, vm_size_t len,
7234 vm_offset_t src_addr)
7236 struct rwlock *lock;
7237 pml4_entry_t *pml4e;
7239 pd_entry_t *pde, srcptepaddr;
7240 pt_entry_t *dst_pte, PG_A, PG_M, PG_V, ptetemp, *src_pte;
7241 vm_offset_t addr, end_addr, va_next;
7242 vm_page_t dst_pdpg, dstmpte, srcmpte;
7244 if (dst_addr != src_addr)
7247 if (dst_pmap->pm_type != src_pmap->pm_type)
7251 * EPT page table entries that require emulation of A/D bits are
7252 * sensitive to clearing the PG_A bit (aka EPT_PG_READ). Although
7253 * we clear PG_M (aka EPT_PG_WRITE) concomitantly, the PG_U bit
7254 * (aka EPT_PG_EXECUTE) could still be set. Since some EPT
7255 * implementations flag an EPT misconfiguration for exec-only
7256 * mappings we skip this function entirely for emulated pmaps.
7258 if (pmap_emulate_ad_bits(dst_pmap))
7261 end_addr = src_addr + len;
7263 if (dst_pmap < src_pmap) {
7264 PMAP_LOCK(dst_pmap);
7265 PMAP_LOCK(src_pmap);
7267 PMAP_LOCK(src_pmap);
7268 PMAP_LOCK(dst_pmap);
7271 PG_A = pmap_accessed_bit(dst_pmap);
7272 PG_M = pmap_modified_bit(dst_pmap);
7273 PG_V = pmap_valid_bit(dst_pmap);
7275 for (addr = src_addr; addr < end_addr; addr = va_next) {
7276 KASSERT(addr < UPT_MIN_ADDRESS,
7277 ("pmap_copy: invalid to pmap_copy page tables"));
7279 pml4e = pmap_pml4e(src_pmap, addr);
7280 if ((*pml4e & PG_V) == 0) {
7281 va_next = (addr + NBPML4) & ~PML4MASK;
7287 pdpe = pmap_pml4e_to_pdpe(pml4e, addr);
7288 if ((*pdpe & PG_V) == 0) {
7289 va_next = (addr + NBPDP) & ~PDPMASK;
7295 va_next = (addr + NBPDR) & ~PDRMASK;
7299 pde = pmap_pdpe_to_pde(pdpe, addr);
7301 if (srcptepaddr == 0)
7304 if (srcptepaddr & PG_PS) {
7305 if ((addr & PDRMASK) != 0 || addr + NBPDR > end_addr)
7307 pde = pmap_alloc_pde(dst_pmap, addr, &dst_pdpg, NULL);
7310 if (*pde == 0 && ((srcptepaddr & PG_MANAGED) == 0 ||
7311 pmap_pv_insert_pde(dst_pmap, addr, srcptepaddr,
7312 PMAP_ENTER_NORECLAIM, &lock))) {
7313 *pde = srcptepaddr & ~PG_W;
7314 pmap_resident_count_inc(dst_pmap, NBPDR /
7316 atomic_add_long(&pmap_pde_mappings, 1);
7318 pmap_abort_ptp(dst_pmap, addr, dst_pdpg);
7322 srcptepaddr &= PG_FRAME;
7323 srcmpte = PHYS_TO_VM_PAGE(srcptepaddr);
7324 KASSERT(srcmpte->ref_count > 0,
7325 ("pmap_copy: source page table page is unused"));
7327 if (va_next > end_addr)
7330 src_pte = (pt_entry_t *)PHYS_TO_DMAP(srcptepaddr);
7331 src_pte = &src_pte[pmap_pte_index(addr)];
7333 for (; addr < va_next; addr += PAGE_SIZE, src_pte++) {
7337 * We only virtual copy managed pages.
7339 if ((ptetemp & PG_MANAGED) == 0)
7342 if (dstmpte != NULL) {
7343 KASSERT(dstmpte->pindex ==
7344 pmap_pde_pindex(addr),
7345 ("dstmpte pindex/addr mismatch"));
7346 dstmpte->ref_count++;
7347 } else if ((dstmpte = pmap_allocpte(dst_pmap, addr,
7350 dst_pte = (pt_entry_t *)
7351 PHYS_TO_DMAP(VM_PAGE_TO_PHYS(dstmpte));
7352 dst_pte = &dst_pte[pmap_pte_index(addr)];
7353 if (*dst_pte == 0 &&
7354 pmap_try_insert_pv_entry(dst_pmap, addr,
7355 PHYS_TO_VM_PAGE(ptetemp & PG_FRAME), &lock)) {
7357 * Clear the wired, modified, and accessed
7358 * (referenced) bits during the copy.
7360 *dst_pte = ptetemp & ~(PG_W | PG_M | PG_A);
7361 pmap_resident_count_inc(dst_pmap, 1);
7363 pmap_abort_ptp(dst_pmap, addr, dstmpte);
7366 /* Have we copied all of the valid mappings? */
7367 if (dstmpte->ref_count >= srcmpte->ref_count)
7374 PMAP_UNLOCK(src_pmap);
7375 PMAP_UNLOCK(dst_pmap);
7379 pmap_vmspace_copy(pmap_t dst_pmap, pmap_t src_pmap)
7383 if (dst_pmap->pm_type != src_pmap->pm_type ||
7384 dst_pmap->pm_type != PT_X86 ||
7385 (cpu_stdext_feature2 & CPUID_STDEXT2_PKU) == 0)
7388 if (dst_pmap < src_pmap) {
7389 PMAP_LOCK(dst_pmap);
7390 PMAP_LOCK(src_pmap);
7392 PMAP_LOCK(src_pmap);
7393 PMAP_LOCK(dst_pmap);
7395 error = pmap_pkru_copy(dst_pmap, src_pmap);
7396 /* Clean up partial copy on failure due to no memory. */
7397 if (error == ENOMEM)
7398 pmap_pkru_deassign_all(dst_pmap);
7399 PMAP_UNLOCK(src_pmap);
7400 PMAP_UNLOCK(dst_pmap);
7401 if (error != ENOMEM)
7409 * Zero the specified hardware page.
7412 pmap_zero_page(vm_page_t m)
7414 vm_offset_t va = PHYS_TO_DMAP(VM_PAGE_TO_PHYS(m));
7416 pagezero((void *)va);
7420 * Zero an an area within a single hardware page. off and size must not
7421 * cover an area beyond a single hardware page.
7424 pmap_zero_page_area(vm_page_t m, int off, int size)
7426 vm_offset_t va = PHYS_TO_DMAP(VM_PAGE_TO_PHYS(m));
7428 if (off == 0 && size == PAGE_SIZE)
7429 pagezero((void *)va);
7431 bzero((char *)va + off, size);
7435 * Copy 1 specified hardware page to another.
7438 pmap_copy_page(vm_page_t msrc, vm_page_t mdst)
7440 vm_offset_t src = PHYS_TO_DMAP(VM_PAGE_TO_PHYS(msrc));
7441 vm_offset_t dst = PHYS_TO_DMAP(VM_PAGE_TO_PHYS(mdst));
7443 pagecopy((void *)src, (void *)dst);
7446 int unmapped_buf_allowed = 1;
7449 pmap_copy_pages(vm_page_t ma[], vm_offset_t a_offset, vm_page_t mb[],
7450 vm_offset_t b_offset, int xfersize)
7454 vm_offset_t vaddr[2], a_pg_offset, b_pg_offset;
7458 while (xfersize > 0) {
7459 a_pg_offset = a_offset & PAGE_MASK;
7460 pages[0] = ma[a_offset >> PAGE_SHIFT];
7461 b_pg_offset = b_offset & PAGE_MASK;
7462 pages[1] = mb[b_offset >> PAGE_SHIFT];
7463 cnt = min(xfersize, PAGE_SIZE - a_pg_offset);
7464 cnt = min(cnt, PAGE_SIZE - b_pg_offset);
7465 mapped = pmap_map_io_transient(pages, vaddr, 2, FALSE);
7466 a_cp = (char *)vaddr[0] + a_pg_offset;
7467 b_cp = (char *)vaddr[1] + b_pg_offset;
7468 bcopy(a_cp, b_cp, cnt);
7469 if (__predict_false(mapped))
7470 pmap_unmap_io_transient(pages, vaddr, 2, FALSE);
7478 * Returns true if the pmap's pv is one of the first
7479 * 16 pvs linked to from this page. This count may
7480 * be changed upwards or downwards in the future; it
7481 * is only necessary that true be returned for a small
7482 * subset of pmaps for proper page aging.
7485 pmap_page_exists_quick(pmap_t pmap, vm_page_t m)
7487 struct md_page *pvh;
7488 struct rwlock *lock;
7493 KASSERT((m->oflags & VPO_UNMANAGED) == 0,
7494 ("pmap_page_exists_quick: page %p is not managed", m));
7496 lock = VM_PAGE_TO_PV_LIST_LOCK(m);
7498 TAILQ_FOREACH(pv, &m->md.pv_list, pv_next) {
7499 if (PV_PMAP(pv) == pmap) {
7507 if (!rv && loops < 16 && (m->flags & PG_FICTITIOUS) == 0) {
7508 pvh = pa_to_pvh(VM_PAGE_TO_PHYS(m));
7509 TAILQ_FOREACH(pv, &pvh->pv_list, pv_next) {
7510 if (PV_PMAP(pv) == pmap) {
7524 * pmap_page_wired_mappings:
7526 * Return the number of managed mappings to the given physical page
7530 pmap_page_wired_mappings(vm_page_t m)
7532 struct rwlock *lock;
7533 struct md_page *pvh;
7537 int count, md_gen, pvh_gen;
7539 if ((m->oflags & VPO_UNMANAGED) != 0)
7541 lock = VM_PAGE_TO_PV_LIST_LOCK(m);
7545 TAILQ_FOREACH(pv, &m->md.pv_list, pv_next) {
7547 if (!PMAP_TRYLOCK(pmap)) {
7548 md_gen = m->md.pv_gen;
7552 if (md_gen != m->md.pv_gen) {
7557 pte = pmap_pte(pmap, pv->pv_va);
7558 if ((*pte & PG_W) != 0)
7562 if ((m->flags & PG_FICTITIOUS) == 0) {
7563 pvh = pa_to_pvh(VM_PAGE_TO_PHYS(m));
7564 TAILQ_FOREACH(pv, &pvh->pv_list, pv_next) {
7566 if (!PMAP_TRYLOCK(pmap)) {
7567 md_gen = m->md.pv_gen;
7568 pvh_gen = pvh->pv_gen;
7572 if (md_gen != m->md.pv_gen ||
7573 pvh_gen != pvh->pv_gen) {
7578 pte = pmap_pde(pmap, pv->pv_va);
7579 if ((*pte & PG_W) != 0)
7589 * Returns TRUE if the given page is mapped individually or as part of
7590 * a 2mpage. Otherwise, returns FALSE.
7593 pmap_page_is_mapped(vm_page_t m)
7595 struct rwlock *lock;
7598 if ((m->oflags & VPO_UNMANAGED) != 0)
7600 lock = VM_PAGE_TO_PV_LIST_LOCK(m);
7602 rv = !TAILQ_EMPTY(&m->md.pv_list) ||
7603 ((m->flags & PG_FICTITIOUS) == 0 &&
7604 !TAILQ_EMPTY(&pa_to_pvh(VM_PAGE_TO_PHYS(m))->pv_list));
7610 * Destroy all managed, non-wired mappings in the given user-space
7611 * pmap. This pmap cannot be active on any processor besides the
7614 * This function cannot be applied to the kernel pmap. Moreover, it
7615 * is not intended for general use. It is only to be used during
7616 * process termination. Consequently, it can be implemented in ways
7617 * that make it faster than pmap_remove(). First, it can more quickly
7618 * destroy mappings by iterating over the pmap's collection of PV
7619 * entries, rather than searching the page table. Second, it doesn't
7620 * have to test and clear the page table entries atomically, because
7621 * no processor is currently accessing the user address space. In
7622 * particular, a page table entry's dirty bit won't change state once
7623 * this function starts.
7625 * Although this function destroys all of the pmap's managed,
7626 * non-wired mappings, it can delay and batch the invalidation of TLB
7627 * entries without calling pmap_delayed_invl_start() and
7628 * pmap_delayed_invl_finish(). Because the pmap is not active on
7629 * any other processor, none of these TLB entries will ever be used
7630 * before their eventual invalidation. Consequently, there is no need
7631 * for either pmap_remove_all() or pmap_remove_write() to wait for
7632 * that eventual TLB invalidation.
7635 pmap_remove_pages(pmap_t pmap)
7638 pt_entry_t *pte, tpte;
7639 pt_entry_t PG_M, PG_RW, PG_V;
7640 struct spglist free;
7641 struct pv_chunklist free_chunks[PMAP_MEMDOM];
7642 vm_page_t m, mpte, mt;
7644 struct md_page *pvh;
7645 struct pv_chunk *pc, *npc;
7646 struct rwlock *lock;
7648 uint64_t inuse, bitmask;
7649 int allfree, field, freed, i, idx;
7650 boolean_t superpage;
7654 * Assert that the given pmap is only active on the current
7655 * CPU. Unfortunately, we cannot block another CPU from
7656 * activating the pmap while this function is executing.
7658 KASSERT(pmap == PCPU_GET(curpmap), ("non-current pmap %p", pmap));
7661 cpuset_t other_cpus;
7663 other_cpus = all_cpus;
7665 CPU_CLR(PCPU_GET(cpuid), &other_cpus);
7666 CPU_AND(&other_cpus, &pmap->pm_active);
7668 KASSERT(CPU_EMPTY(&other_cpus), ("pmap active %p", pmap));
7673 PG_M = pmap_modified_bit(pmap);
7674 PG_V = pmap_valid_bit(pmap);
7675 PG_RW = pmap_rw_bit(pmap);
7677 for (i = 0; i < PMAP_MEMDOM; i++)
7678 TAILQ_INIT(&free_chunks[i]);
7681 TAILQ_FOREACH_SAFE(pc, &pmap->pm_pvchunk, pc_list, npc) {
7684 for (field = 0; field < _NPCM; field++) {
7685 inuse = ~pc->pc_map[field] & pc_freemask[field];
7686 while (inuse != 0) {
7688 bitmask = 1UL << bit;
7689 idx = field * 64 + bit;
7690 pv = &pc->pc_pventry[idx];
7693 pte = pmap_pdpe(pmap, pv->pv_va);
7695 pte = pmap_pdpe_to_pde(pte, pv->pv_va);
7697 if ((tpte & (PG_PS | PG_V)) == PG_V) {
7700 pte = (pt_entry_t *)PHYS_TO_DMAP(tpte &
7702 pte = &pte[pmap_pte_index(pv->pv_va)];
7706 * Keep track whether 'tpte' is a
7707 * superpage explicitly instead of
7708 * relying on PG_PS being set.
7710 * This is because PG_PS is numerically
7711 * identical to PG_PTE_PAT and thus a
7712 * regular page could be mistaken for
7718 if ((tpte & PG_V) == 0) {
7719 panic("bad pte va %lx pte %lx",
7724 * We cannot remove wired pages from a process' mapping at this time
7732 pa = tpte & PG_PS_FRAME;
7734 pa = tpte & PG_FRAME;
7736 m = PHYS_TO_VM_PAGE(pa);
7737 KASSERT(m->phys_addr == pa,
7738 ("vm_page_t %p phys_addr mismatch %016jx %016jx",
7739 m, (uintmax_t)m->phys_addr,
7742 KASSERT((m->flags & PG_FICTITIOUS) != 0 ||
7743 m < &vm_page_array[vm_page_array_size],
7744 ("pmap_remove_pages: bad tpte %#jx",
7750 * Update the vm_page_t clean/reference bits.
7752 if ((tpte & (PG_M | PG_RW)) == (PG_M | PG_RW)) {
7754 for (mt = m; mt < &m[NBPDR / PAGE_SIZE]; mt++)
7760 CHANGE_PV_LIST_LOCK_TO_VM_PAGE(&lock, m);
7763 pc->pc_map[field] |= bitmask;
7765 pmap_resident_count_dec(pmap, NBPDR / PAGE_SIZE);
7766 pvh = pa_to_pvh(tpte & PG_PS_FRAME);
7767 TAILQ_REMOVE(&pvh->pv_list, pv, pv_next);
7769 if (TAILQ_EMPTY(&pvh->pv_list)) {
7770 for (mt = m; mt < &m[NBPDR / PAGE_SIZE]; mt++)
7771 if ((mt->a.flags & PGA_WRITEABLE) != 0 &&
7772 TAILQ_EMPTY(&mt->md.pv_list))
7773 vm_page_aflag_clear(mt, PGA_WRITEABLE);
7775 mpte = pmap_remove_pt_page(pmap, pv->pv_va);
7777 KASSERT(mpte->valid == VM_PAGE_BITS_ALL,
7778 ("pmap_remove_pages: pte page not promoted"));
7779 pmap_resident_count_dec(pmap, 1);
7780 KASSERT(mpte->ref_count == NPTEPG,
7781 ("pmap_remove_pages: pte page reference count error"));
7782 mpte->ref_count = 0;
7783 pmap_add_delayed_free_list(mpte, &free, FALSE);
7786 pmap_resident_count_dec(pmap, 1);
7787 TAILQ_REMOVE(&m->md.pv_list, pv, pv_next);
7789 if ((m->a.flags & PGA_WRITEABLE) != 0 &&
7790 TAILQ_EMPTY(&m->md.pv_list) &&
7791 (m->flags & PG_FICTITIOUS) == 0) {
7792 pvh = pa_to_pvh(VM_PAGE_TO_PHYS(m));
7793 if (TAILQ_EMPTY(&pvh->pv_list))
7794 vm_page_aflag_clear(m, PGA_WRITEABLE);
7797 pmap_unuse_pt(pmap, pv->pv_va, ptepde, &free);
7801 PV_STAT(atomic_add_long(&pv_entry_frees, freed));
7802 PV_STAT(atomic_add_int(&pv_entry_spare, freed));
7803 PV_STAT(atomic_subtract_long(&pv_entry_count, freed));
7805 TAILQ_REMOVE(&pmap->pm_pvchunk, pc, pc_list);
7806 TAILQ_INSERT_TAIL(&free_chunks[pc_to_domain(pc)], pc, pc_list);
7811 pmap_invalidate_all(pmap);
7812 pmap_pkru_deassign_all(pmap);
7813 free_pv_chunk_batch((struct pv_chunklist *)&free_chunks);
7815 vm_page_free_pages_toq(&free, true);
7819 pmap_page_test_mappings(vm_page_t m, boolean_t accessed, boolean_t modified)
7821 struct rwlock *lock;
7823 struct md_page *pvh;
7824 pt_entry_t *pte, mask;
7825 pt_entry_t PG_A, PG_M, PG_RW, PG_V;
7827 int md_gen, pvh_gen;
7831 lock = VM_PAGE_TO_PV_LIST_LOCK(m);
7834 TAILQ_FOREACH(pv, &m->md.pv_list, pv_next) {
7836 if (!PMAP_TRYLOCK(pmap)) {
7837 md_gen = m->md.pv_gen;
7841 if (md_gen != m->md.pv_gen) {
7846 pte = pmap_pte(pmap, pv->pv_va);
7849 PG_M = pmap_modified_bit(pmap);
7850 PG_RW = pmap_rw_bit(pmap);
7851 mask |= PG_RW | PG_M;
7854 PG_A = pmap_accessed_bit(pmap);
7855 PG_V = pmap_valid_bit(pmap);
7856 mask |= PG_V | PG_A;
7858 rv = (*pte & mask) == mask;
7863 if ((m->flags & PG_FICTITIOUS) == 0) {
7864 pvh = pa_to_pvh(VM_PAGE_TO_PHYS(m));
7865 TAILQ_FOREACH(pv, &pvh->pv_list, pv_next) {
7867 if (!PMAP_TRYLOCK(pmap)) {
7868 md_gen = m->md.pv_gen;
7869 pvh_gen = pvh->pv_gen;
7873 if (md_gen != m->md.pv_gen ||
7874 pvh_gen != pvh->pv_gen) {
7879 pte = pmap_pde(pmap, pv->pv_va);
7882 PG_M = pmap_modified_bit(pmap);
7883 PG_RW = pmap_rw_bit(pmap);
7884 mask |= PG_RW | PG_M;
7887 PG_A = pmap_accessed_bit(pmap);
7888 PG_V = pmap_valid_bit(pmap);
7889 mask |= PG_V | PG_A;
7891 rv = (*pte & mask) == mask;
7905 * Return whether or not the specified physical page was modified
7906 * in any physical maps.
7909 pmap_is_modified(vm_page_t m)
7912 KASSERT((m->oflags & VPO_UNMANAGED) == 0,
7913 ("pmap_is_modified: page %p is not managed", m));
7916 * If the page is not busied then this check is racy.
7918 if (!pmap_page_is_write_mapped(m))
7920 return (pmap_page_test_mappings(m, FALSE, TRUE));
7924 * pmap_is_prefaultable:
7926 * Return whether or not the specified virtual address is eligible
7930 pmap_is_prefaultable(pmap_t pmap, vm_offset_t addr)
7933 pt_entry_t *pte, PG_V;
7936 PG_V = pmap_valid_bit(pmap);
7939 pde = pmap_pde(pmap, addr);
7940 if (pde != NULL && (*pde & (PG_PS | PG_V)) == PG_V) {
7941 pte = pmap_pde_to_pte(pde, addr);
7942 rv = (*pte & PG_V) == 0;
7949 * pmap_is_referenced:
7951 * Return whether or not the specified physical page was referenced
7952 * in any physical maps.
7955 pmap_is_referenced(vm_page_t m)
7958 KASSERT((m->oflags & VPO_UNMANAGED) == 0,
7959 ("pmap_is_referenced: page %p is not managed", m));
7960 return (pmap_page_test_mappings(m, TRUE, FALSE));
7964 * Clear the write and modified bits in each of the given page's mappings.
7967 pmap_remove_write(vm_page_t m)
7969 struct md_page *pvh;
7971 struct rwlock *lock;
7972 pv_entry_t next_pv, pv;
7974 pt_entry_t oldpte, *pte, PG_M, PG_RW;
7976 int pvh_gen, md_gen;
7978 KASSERT((m->oflags & VPO_UNMANAGED) == 0,
7979 ("pmap_remove_write: page %p is not managed", m));
7981 vm_page_assert_busied(m);
7982 if (!pmap_page_is_write_mapped(m))
7985 lock = VM_PAGE_TO_PV_LIST_LOCK(m);
7986 pvh = (m->flags & PG_FICTITIOUS) != 0 ? &pv_dummy :
7987 pa_to_pvh(VM_PAGE_TO_PHYS(m));
7990 TAILQ_FOREACH_SAFE(pv, &pvh->pv_list, pv_next, next_pv) {
7992 if (!PMAP_TRYLOCK(pmap)) {
7993 pvh_gen = pvh->pv_gen;
7997 if (pvh_gen != pvh->pv_gen) {
8003 PG_RW = pmap_rw_bit(pmap);
8005 pde = pmap_pde(pmap, va);
8006 if ((*pde & PG_RW) != 0)
8007 (void)pmap_demote_pde_locked(pmap, pde, va, &lock);
8008 KASSERT(lock == VM_PAGE_TO_PV_LIST_LOCK(m),
8009 ("inconsistent pv lock %p %p for page %p",
8010 lock, VM_PAGE_TO_PV_LIST_LOCK(m), m));
8013 TAILQ_FOREACH(pv, &m->md.pv_list, pv_next) {
8015 if (!PMAP_TRYLOCK(pmap)) {
8016 pvh_gen = pvh->pv_gen;
8017 md_gen = m->md.pv_gen;
8021 if (pvh_gen != pvh->pv_gen ||
8022 md_gen != m->md.pv_gen) {
8028 PG_M = pmap_modified_bit(pmap);
8029 PG_RW = pmap_rw_bit(pmap);
8030 pde = pmap_pde(pmap, pv->pv_va);
8031 KASSERT((*pde & PG_PS) == 0,
8032 ("pmap_remove_write: found a 2mpage in page %p's pv list",
8034 pte = pmap_pde_to_pte(pde, pv->pv_va);
8037 if (oldpte & PG_RW) {
8038 if (!atomic_cmpset_long(pte, oldpte, oldpte &
8041 if ((oldpte & PG_M) != 0)
8043 pmap_invalidate_page(pmap, pv->pv_va);
8048 vm_page_aflag_clear(m, PGA_WRITEABLE);
8049 pmap_delayed_invl_wait(m);
8052 static __inline boolean_t
8053 safe_to_clear_referenced(pmap_t pmap, pt_entry_t pte)
8056 if (!pmap_emulate_ad_bits(pmap))
8059 KASSERT(pmap->pm_type == PT_EPT, ("invalid pm_type %d", pmap->pm_type));
8062 * XWR = 010 or 110 will cause an unconditional EPT misconfiguration
8063 * so we don't let the referenced (aka EPT_PG_READ) bit to be cleared
8064 * if the EPT_PG_WRITE bit is set.
8066 if ((pte & EPT_PG_WRITE) != 0)
8070 * XWR = 100 is allowed only if the PMAP_SUPPORTS_EXEC_ONLY is set.
8072 if ((pte & EPT_PG_EXECUTE) == 0 ||
8073 ((pmap->pm_flags & PMAP_SUPPORTS_EXEC_ONLY) != 0))
8080 * pmap_ts_referenced:
8082 * Return a count of reference bits for a page, clearing those bits.
8083 * It is not necessary for every reference bit to be cleared, but it
8084 * is necessary that 0 only be returned when there are truly no
8085 * reference bits set.
8087 * As an optimization, update the page's dirty field if a modified bit is
8088 * found while counting reference bits. This opportunistic update can be
8089 * performed at low cost and can eliminate the need for some future calls
8090 * to pmap_is_modified(). However, since this function stops after
8091 * finding PMAP_TS_REFERENCED_MAX reference bits, it may not detect some
8092 * dirty pages. Those dirty pages will only be detected by a future call
8093 * to pmap_is_modified().
8095 * A DI block is not needed within this function, because
8096 * invalidations are performed before the PV list lock is
8100 pmap_ts_referenced(vm_page_t m)
8102 struct md_page *pvh;
8105 struct rwlock *lock;
8106 pd_entry_t oldpde, *pde;
8107 pt_entry_t *pte, PG_A, PG_M, PG_RW;
8110 int cleared, md_gen, not_cleared, pvh_gen;
8111 struct spglist free;
8114 KASSERT((m->oflags & VPO_UNMANAGED) == 0,
8115 ("pmap_ts_referenced: page %p is not managed", m));
8118 pa = VM_PAGE_TO_PHYS(m);
8119 lock = PHYS_TO_PV_LIST_LOCK(pa);
8120 pvh = (m->flags & PG_FICTITIOUS) != 0 ? &pv_dummy : pa_to_pvh(pa);
8124 if ((pvf = TAILQ_FIRST(&pvh->pv_list)) == NULL)
8125 goto small_mappings;
8131 if (!PMAP_TRYLOCK(pmap)) {
8132 pvh_gen = pvh->pv_gen;
8136 if (pvh_gen != pvh->pv_gen) {
8141 PG_A = pmap_accessed_bit(pmap);
8142 PG_M = pmap_modified_bit(pmap);
8143 PG_RW = pmap_rw_bit(pmap);
8145 pde = pmap_pde(pmap, pv->pv_va);
8147 if ((oldpde & (PG_M | PG_RW)) == (PG_M | PG_RW)) {
8149 * Although "oldpde" is mapping a 2MB page, because
8150 * this function is called at a 4KB page granularity,
8151 * we only update the 4KB page under test.
8155 if ((oldpde & PG_A) != 0) {
8157 * Since this reference bit is shared by 512 4KB
8158 * pages, it should not be cleared every time it is
8159 * tested. Apply a simple "hash" function on the
8160 * physical page number, the virtual superpage number,
8161 * and the pmap address to select one 4KB page out of
8162 * the 512 on which testing the reference bit will
8163 * result in clearing that reference bit. This
8164 * function is designed to avoid the selection of the
8165 * same 4KB page for every 2MB page mapping.
8167 * On demotion, a mapping that hasn't been referenced
8168 * is simply destroyed. To avoid the possibility of a
8169 * subsequent page fault on a demoted wired mapping,
8170 * always leave its reference bit set. Moreover,
8171 * since the superpage is wired, the current state of
8172 * its reference bit won't affect page replacement.
8174 if ((((pa >> PAGE_SHIFT) ^ (pv->pv_va >> PDRSHIFT) ^
8175 (uintptr_t)pmap) & (NPTEPG - 1)) == 0 &&
8176 (oldpde & PG_W) == 0) {
8177 if (safe_to_clear_referenced(pmap, oldpde)) {
8178 atomic_clear_long(pde, PG_A);
8179 pmap_invalidate_page(pmap, pv->pv_va);
8181 } else if (pmap_demote_pde_locked(pmap, pde,
8182 pv->pv_va, &lock)) {
8184 * Remove the mapping to a single page
8185 * so that a subsequent access may
8186 * repromote. Since the underlying
8187 * page table page is fully populated,
8188 * this removal never frees a page
8192 va += VM_PAGE_TO_PHYS(m) - (oldpde &
8194 pte = pmap_pde_to_pte(pde, va);
8195 pmap_remove_pte(pmap, pte, va, *pde,
8197 pmap_invalidate_page(pmap, va);
8203 * The superpage mapping was removed
8204 * entirely and therefore 'pv' is no
8212 KASSERT(lock == VM_PAGE_TO_PV_LIST_LOCK(m),
8213 ("inconsistent pv lock %p %p for page %p",
8214 lock, VM_PAGE_TO_PV_LIST_LOCK(m), m));
8219 /* Rotate the PV list if it has more than one entry. */
8220 if (pv != NULL && TAILQ_NEXT(pv, pv_next) != NULL) {
8221 TAILQ_REMOVE(&pvh->pv_list, pv, pv_next);
8222 TAILQ_INSERT_TAIL(&pvh->pv_list, pv, pv_next);
8225 if (cleared + not_cleared >= PMAP_TS_REFERENCED_MAX)
8227 } while ((pv = TAILQ_FIRST(&pvh->pv_list)) != pvf);
8229 if ((pvf = TAILQ_FIRST(&m->md.pv_list)) == NULL)
8236 if (!PMAP_TRYLOCK(pmap)) {
8237 pvh_gen = pvh->pv_gen;
8238 md_gen = m->md.pv_gen;
8242 if (pvh_gen != pvh->pv_gen || md_gen != m->md.pv_gen) {
8247 PG_A = pmap_accessed_bit(pmap);
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_ts_referenced: found a 2mpage in page %p's pv list",
8254 pte = pmap_pde_to_pte(pde, pv->pv_va);
8255 if ((*pte & (PG_M | PG_RW)) == (PG_M | PG_RW))
8257 if ((*pte & PG_A) != 0) {
8258 if (safe_to_clear_referenced(pmap, *pte)) {
8259 atomic_clear_long(pte, PG_A);
8260 pmap_invalidate_page(pmap, pv->pv_va);
8262 } else if ((*pte & PG_W) == 0) {
8264 * Wired pages cannot be paged out so
8265 * doing accessed bit emulation for
8266 * them is wasted effort. We do the
8267 * hard work for unwired pages only.
8269 pmap_remove_pte(pmap, pte, pv->pv_va,
8270 *pde, &free, &lock);
8271 pmap_invalidate_page(pmap, pv->pv_va);
8276 KASSERT(lock == VM_PAGE_TO_PV_LIST_LOCK(m),
8277 ("inconsistent pv lock %p %p for page %p",
8278 lock, VM_PAGE_TO_PV_LIST_LOCK(m), m));
8283 /* Rotate the PV list if it has more than one entry. */
8284 if (pv != NULL && TAILQ_NEXT(pv, pv_next) != NULL) {
8285 TAILQ_REMOVE(&m->md.pv_list, pv, pv_next);
8286 TAILQ_INSERT_TAIL(&m->md.pv_list, pv, pv_next);
8289 } while ((pv = TAILQ_FIRST(&m->md.pv_list)) != pvf && cleared +
8290 not_cleared < PMAP_TS_REFERENCED_MAX);
8293 vm_page_free_pages_toq(&free, true);
8294 return (cleared + not_cleared);
8298 * Apply the given advice to the specified range of addresses within the
8299 * given pmap. Depending on the advice, clear the referenced and/or
8300 * modified flags in each mapping and set the mapped page's dirty field.
8303 pmap_advise(pmap_t pmap, vm_offset_t sva, vm_offset_t eva, int advice)
8305 struct rwlock *lock;
8306 pml4_entry_t *pml4e;
8308 pd_entry_t oldpde, *pde;
8309 pt_entry_t *pte, PG_A, PG_G, PG_M, PG_RW, PG_V;
8310 vm_offset_t va, va_next;
8314 if (advice != MADV_DONTNEED && advice != MADV_FREE)
8318 * A/D bit emulation requires an alternate code path when clearing
8319 * the modified and accessed bits below. Since this function is
8320 * advisory in nature we skip it entirely for pmaps that require
8321 * A/D bit emulation.
8323 if (pmap_emulate_ad_bits(pmap))
8326 PG_A = pmap_accessed_bit(pmap);
8327 PG_G = pmap_global_bit(pmap);
8328 PG_M = pmap_modified_bit(pmap);
8329 PG_V = pmap_valid_bit(pmap);
8330 PG_RW = pmap_rw_bit(pmap);
8332 pmap_delayed_invl_start();
8334 for (; sva < eva; sva = va_next) {
8335 pml4e = pmap_pml4e(pmap, sva);
8336 if ((*pml4e & PG_V) == 0) {
8337 va_next = (sva + NBPML4) & ~PML4MASK;
8342 pdpe = pmap_pml4e_to_pdpe(pml4e, sva);
8343 if ((*pdpe & PG_V) == 0) {
8344 va_next = (sva + NBPDP) & ~PDPMASK;
8349 va_next = (sva + NBPDR) & ~PDRMASK;
8352 pde = pmap_pdpe_to_pde(pdpe, sva);
8354 if ((oldpde & PG_V) == 0)
8356 else if ((oldpde & PG_PS) != 0) {
8357 if ((oldpde & PG_MANAGED) == 0)
8360 if (!pmap_demote_pde_locked(pmap, pde, sva, &lock)) {
8365 * The large page mapping was destroyed.
8371 * Unless the page mappings are wired, remove the
8372 * mapping to a single page so that a subsequent
8373 * access may repromote. Choosing the last page
8374 * within the address range [sva, min(va_next, eva))
8375 * generally results in more repromotions. Since the
8376 * underlying page table page is fully populated, this
8377 * removal never frees a page table page.
8379 if ((oldpde & PG_W) == 0) {
8385 ("pmap_advise: no address gap"));
8386 pte = pmap_pde_to_pte(pde, va);
8387 KASSERT((*pte & PG_V) != 0,
8388 ("pmap_advise: invalid PTE"));
8389 pmap_remove_pte(pmap, pte, va, *pde, NULL,
8399 for (pte = pmap_pde_to_pte(pde, sva); sva != va_next; pte++,
8401 if ((*pte & (PG_MANAGED | PG_V)) != (PG_MANAGED | PG_V))
8403 else if ((*pte & (PG_M | PG_RW)) == (PG_M | PG_RW)) {
8404 if (advice == MADV_DONTNEED) {
8406 * Future calls to pmap_is_modified()
8407 * can be avoided by making the page
8410 m = PHYS_TO_VM_PAGE(*pte & PG_FRAME);
8413 atomic_clear_long(pte, PG_M | PG_A);
8414 } else if ((*pte & PG_A) != 0)
8415 atomic_clear_long(pte, PG_A);
8419 if ((*pte & PG_G) != 0) {
8426 if (va != va_next) {
8427 pmap_invalidate_range(pmap, va, sva);
8432 pmap_invalidate_range(pmap, va, sva);
8435 pmap_invalidate_all(pmap);
8437 pmap_delayed_invl_finish();
8441 * Clear the modify bits on the specified physical page.
8444 pmap_clear_modify(vm_page_t m)
8446 struct md_page *pvh;
8448 pv_entry_t next_pv, pv;
8449 pd_entry_t oldpde, *pde;
8450 pt_entry_t *pte, PG_M, PG_RW;
8451 struct rwlock *lock;
8453 int md_gen, pvh_gen;
8455 KASSERT((m->oflags & VPO_UNMANAGED) == 0,
8456 ("pmap_clear_modify: page %p is not managed", m));
8457 vm_page_assert_busied(m);
8459 if (!pmap_page_is_write_mapped(m))
8461 pvh = (m->flags & PG_FICTITIOUS) != 0 ? &pv_dummy :
8462 pa_to_pvh(VM_PAGE_TO_PHYS(m));
8463 lock = VM_PAGE_TO_PV_LIST_LOCK(m);
8466 TAILQ_FOREACH_SAFE(pv, &pvh->pv_list, pv_next, next_pv) {
8468 if (!PMAP_TRYLOCK(pmap)) {
8469 pvh_gen = pvh->pv_gen;
8473 if (pvh_gen != pvh->pv_gen) {
8478 PG_M = pmap_modified_bit(pmap);
8479 PG_RW = pmap_rw_bit(pmap);
8481 pde = pmap_pde(pmap, va);
8483 /* If oldpde has PG_RW set, then it also has PG_M set. */
8484 if ((oldpde & PG_RW) != 0 &&
8485 pmap_demote_pde_locked(pmap, pde, va, &lock) &&
8486 (oldpde & PG_W) == 0) {
8488 * Write protect the mapping to a single page so that
8489 * a subsequent write access may repromote.
8491 va += VM_PAGE_TO_PHYS(m) - (oldpde & PG_PS_FRAME);
8492 pte = pmap_pde_to_pte(pde, va);
8493 atomic_clear_long(pte, PG_M | PG_RW);
8495 pmap_invalidate_page(pmap, va);
8499 TAILQ_FOREACH(pv, &m->md.pv_list, pv_next) {
8501 if (!PMAP_TRYLOCK(pmap)) {
8502 md_gen = m->md.pv_gen;
8503 pvh_gen = pvh->pv_gen;
8507 if (pvh_gen != pvh->pv_gen || md_gen != m->md.pv_gen) {
8512 PG_M = pmap_modified_bit(pmap);
8513 PG_RW = pmap_rw_bit(pmap);
8514 pde = pmap_pde(pmap, pv->pv_va);
8515 KASSERT((*pde & PG_PS) == 0, ("pmap_clear_modify: found"
8516 " a 2mpage in page %p's pv list", m));
8517 pte = pmap_pde_to_pte(pde, pv->pv_va);
8518 if ((*pte & (PG_M | PG_RW)) == (PG_M | PG_RW)) {
8519 atomic_clear_long(pte, PG_M);
8520 pmap_invalidate_page(pmap, pv->pv_va);
8528 * Miscellaneous support routines follow
8531 /* Adjust the properties for a leaf page table entry. */
8532 static __inline void
8533 pmap_pte_props(pt_entry_t *pte, u_long bits, u_long mask)
8537 opte = *(u_long *)pte;
8539 npte = opte & ~mask;
8541 } while (npte != opte && !atomic_fcmpset_long((u_long *)pte, &opte,
8546 * Map a set of physical memory pages into the kernel virtual
8547 * address space. Return a pointer to where it is mapped. This
8548 * routine is intended to be used for mapping device memory,
8552 pmap_mapdev_internal(vm_paddr_t pa, vm_size_t size, int mode, int flags)
8554 struct pmap_preinit_mapping *ppim;
8555 vm_offset_t va, offset;
8559 offset = pa & PAGE_MASK;
8560 size = round_page(offset + size);
8561 pa = trunc_page(pa);
8563 if (!pmap_initialized) {
8565 for (i = 0; i < PMAP_PREINIT_MAPPING_COUNT; i++) {
8566 ppim = pmap_preinit_mapping + i;
8567 if (ppim->va == 0) {
8571 ppim->va = virtual_avail;
8572 virtual_avail += size;
8578 panic("%s: too many preinit mappings", __func__);
8581 * If we have a preinit mapping, re-use it.
8583 for (i = 0; i < PMAP_PREINIT_MAPPING_COUNT; i++) {
8584 ppim = pmap_preinit_mapping + i;
8585 if (ppim->pa == pa && ppim->sz == size &&
8586 (ppim->mode == mode ||
8587 (flags & MAPDEV_SETATTR) == 0))
8588 return ((void *)(ppim->va + offset));
8591 * If the specified range of physical addresses fits within
8592 * the direct map window, use the direct map.
8594 if (pa < dmaplimit && pa + size <= dmaplimit) {
8595 va = PHYS_TO_DMAP(pa);
8596 if ((flags & MAPDEV_SETATTR) != 0) {
8597 PMAP_LOCK(kernel_pmap);
8598 i = pmap_change_props_locked(va, size,
8599 PROT_NONE, mode, flags);
8600 PMAP_UNLOCK(kernel_pmap);
8604 return ((void *)(va + offset));
8606 va = kva_alloc(size);
8608 panic("%s: Couldn't allocate KVA", __func__);
8610 for (tmpsize = 0; tmpsize < size; tmpsize += PAGE_SIZE)
8611 pmap_kenter_attr(va + tmpsize, pa + tmpsize, mode);
8612 pmap_invalidate_range(kernel_pmap, va, va + tmpsize);
8613 if ((flags & MAPDEV_FLUSHCACHE) != 0)
8614 pmap_invalidate_cache_range(va, va + tmpsize);
8615 return ((void *)(va + offset));
8619 pmap_mapdev_attr(vm_paddr_t pa, vm_size_t size, int mode)
8622 return (pmap_mapdev_internal(pa, size, mode, MAPDEV_FLUSHCACHE |
8627 pmap_mapdev(vm_paddr_t pa, vm_size_t size)
8630 return (pmap_mapdev_attr(pa, size, PAT_UNCACHEABLE));
8634 pmap_mapdev_pciecfg(vm_paddr_t pa, vm_size_t size)
8637 return (pmap_mapdev_internal(pa, size, PAT_UNCACHEABLE,
8642 pmap_mapbios(vm_paddr_t pa, vm_size_t size)
8645 return (pmap_mapdev_internal(pa, size, PAT_WRITE_BACK,
8646 MAPDEV_FLUSHCACHE));
8650 pmap_unmapdev(vm_offset_t va, vm_size_t size)
8652 struct pmap_preinit_mapping *ppim;
8656 /* If we gave a direct map region in pmap_mapdev, do nothing */
8657 if (va >= DMAP_MIN_ADDRESS && va < DMAP_MAX_ADDRESS)
8659 offset = va & PAGE_MASK;
8660 size = round_page(offset + size);
8661 va = trunc_page(va);
8662 for (i = 0; i < PMAP_PREINIT_MAPPING_COUNT; i++) {
8663 ppim = pmap_preinit_mapping + i;
8664 if (ppim->va == va && ppim->sz == size) {
8665 if (pmap_initialized)
8671 if (va + size == virtual_avail)
8676 if (pmap_initialized) {
8677 pmap_qremove(va, atop(size));
8683 * Tries to demote a 1GB page mapping.
8686 pmap_demote_pdpe(pmap_t pmap, pdp_entry_t *pdpe, vm_offset_t va)
8688 pdp_entry_t newpdpe, oldpdpe;
8689 pd_entry_t *firstpde, newpde, *pde;
8690 pt_entry_t PG_A, PG_M, PG_RW, PG_V;
8694 PG_A = pmap_accessed_bit(pmap);
8695 PG_M = pmap_modified_bit(pmap);
8696 PG_V = pmap_valid_bit(pmap);
8697 PG_RW = pmap_rw_bit(pmap);
8699 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
8701 KASSERT((oldpdpe & (PG_PS | PG_V)) == (PG_PS | PG_V),
8702 ("pmap_demote_pdpe: oldpdpe is missing PG_PS and/or PG_V"));
8703 if ((pdpg = vm_page_alloc(NULL, va >> PDPSHIFT, VM_ALLOC_INTERRUPT |
8704 VM_ALLOC_NOOBJ | VM_ALLOC_WIRED)) == NULL) {
8705 CTR2(KTR_PMAP, "pmap_demote_pdpe: failure for va %#lx"
8706 " in pmap %p", va, pmap);
8709 pdpgpa = VM_PAGE_TO_PHYS(pdpg);
8710 firstpde = (pd_entry_t *)PHYS_TO_DMAP(pdpgpa);
8711 newpdpe = pdpgpa | PG_M | PG_A | (oldpdpe & PG_U) | PG_RW | PG_V;
8712 KASSERT((oldpdpe & PG_A) != 0,
8713 ("pmap_demote_pdpe: oldpdpe is missing PG_A"));
8714 KASSERT((oldpdpe & (PG_M | PG_RW)) != PG_RW,
8715 ("pmap_demote_pdpe: oldpdpe is missing PG_M"));
8719 * Initialize the page directory page.
8721 for (pde = firstpde; pde < firstpde + NPDEPG; pde++) {
8727 * Demote the mapping.
8732 * Invalidate a stale recursive mapping of the page directory page.
8734 pmap_invalidate_page(pmap, (vm_offset_t)vtopde(va));
8736 pmap_pdpe_demotions++;
8737 CTR2(KTR_PMAP, "pmap_demote_pdpe: success for va %#lx"
8738 " in pmap %p", va, pmap);
8743 * Sets the memory attribute for the specified page.
8746 pmap_page_set_memattr(vm_page_t m, vm_memattr_t ma)
8749 m->md.pat_mode = ma;
8752 * If "m" is a normal page, update its direct mapping. This update
8753 * can be relied upon to perform any cache operations that are
8754 * required for data coherence.
8756 if ((m->flags & PG_FICTITIOUS) == 0 &&
8757 pmap_change_attr(PHYS_TO_DMAP(VM_PAGE_TO_PHYS(m)), PAGE_SIZE,
8759 panic("memory attribute change on the direct map failed");
8763 * Changes the specified virtual address range's memory type to that given by
8764 * the parameter "mode". The specified virtual address range must be
8765 * completely contained within either the direct map or the kernel map. If
8766 * the virtual address range is contained within the kernel map, then the
8767 * memory type for each of the corresponding ranges of the direct map is also
8768 * changed. (The corresponding ranges of the direct map are those ranges that
8769 * map the same physical pages as the specified virtual address range.) These
8770 * changes to the direct map are necessary because Intel describes the
8771 * behavior of their processors as "undefined" if two or more mappings to the
8772 * same physical page have different memory types.
8774 * Returns zero if the change completed successfully, and either EINVAL or
8775 * ENOMEM if the change failed. Specifically, EINVAL is returned if some part
8776 * of the virtual address range was not mapped, and ENOMEM is returned if
8777 * there was insufficient memory available to complete the change. In the
8778 * latter case, the memory type may have been changed on some part of the
8779 * virtual address range or the direct map.
8782 pmap_change_attr(vm_offset_t va, vm_size_t size, int mode)
8786 PMAP_LOCK(kernel_pmap);
8787 error = pmap_change_props_locked(va, size, PROT_NONE, mode,
8789 PMAP_UNLOCK(kernel_pmap);
8794 * Changes the specified virtual address range's protections to those
8795 * specified by "prot". Like pmap_change_attr(), protections for aliases
8796 * in the direct map are updated as well. Protections on aliasing mappings may
8797 * be a subset of the requested protections; for example, mappings in the direct
8798 * map are never executable.
8801 pmap_change_prot(vm_offset_t va, vm_size_t size, vm_prot_t prot)
8805 /* Only supported within the kernel map. */
8806 if (va < VM_MIN_KERNEL_ADDRESS)
8809 PMAP_LOCK(kernel_pmap);
8810 error = pmap_change_props_locked(va, size, prot, -1,
8811 MAPDEV_ASSERTVALID);
8812 PMAP_UNLOCK(kernel_pmap);
8817 pmap_change_props_locked(vm_offset_t va, vm_size_t size, vm_prot_t prot,
8818 int mode, int flags)
8820 vm_offset_t base, offset, tmpva;
8821 vm_paddr_t pa_start, pa_end, pa_end1;
8823 pd_entry_t *pde, pde_bits, pde_mask;
8824 pt_entry_t *pte, pte_bits, pte_mask;
8828 PMAP_LOCK_ASSERT(kernel_pmap, MA_OWNED);
8829 base = trunc_page(va);
8830 offset = va & PAGE_MASK;
8831 size = round_page(offset + size);
8834 * Only supported on kernel virtual addresses, including the direct
8835 * map but excluding the recursive map.
8837 if (base < DMAP_MIN_ADDRESS)
8841 * Construct our flag sets and masks. "bits" is the subset of
8842 * "mask" that will be set in each modified PTE.
8844 * Mappings in the direct map are never allowed to be executable.
8846 pde_bits = pte_bits = 0;
8847 pde_mask = pte_mask = 0;
8849 pde_bits |= pmap_cache_bits(kernel_pmap, mode, true);
8850 pde_mask |= X86_PG_PDE_CACHE;
8851 pte_bits |= pmap_cache_bits(kernel_pmap, mode, false);
8852 pte_mask |= X86_PG_PTE_CACHE;
8854 if (prot != VM_PROT_NONE) {
8855 if ((prot & VM_PROT_WRITE) != 0) {
8856 pde_bits |= X86_PG_RW;
8857 pte_bits |= X86_PG_RW;
8859 if ((prot & VM_PROT_EXECUTE) == 0 ||
8860 va < VM_MIN_KERNEL_ADDRESS) {
8864 pde_mask |= X86_PG_RW | pg_nx;
8865 pte_mask |= X86_PG_RW | pg_nx;
8869 * Pages that aren't mapped aren't supported. Also break down 2MB pages
8870 * into 4KB pages if required.
8872 for (tmpva = base; tmpva < base + size; ) {
8873 pdpe = pmap_pdpe(kernel_pmap, tmpva);
8874 if (pdpe == NULL || *pdpe == 0) {
8875 KASSERT((flags & MAPDEV_ASSERTVALID) == 0,
8876 ("%s: addr %#lx is not mapped", __func__, tmpva));
8879 if (*pdpe & PG_PS) {
8881 * If the current 1GB page already has the required
8882 * properties, then we need not demote this page. Just
8883 * increment tmpva to the next 1GB page frame.
8885 if ((*pdpe & pde_mask) == pde_bits) {
8886 tmpva = trunc_1gpage(tmpva) + NBPDP;
8891 * If the current offset aligns with a 1GB page frame
8892 * and there is at least 1GB left within the range, then
8893 * we need not break down this page into 2MB pages.
8895 if ((tmpva & PDPMASK) == 0 &&
8896 tmpva + PDPMASK < base + size) {
8900 if (!pmap_demote_pdpe(kernel_pmap, pdpe, tmpva))
8903 pde = pmap_pdpe_to_pde(pdpe, tmpva);
8905 KASSERT((flags & MAPDEV_ASSERTVALID) == 0,
8906 ("%s: addr %#lx is not mapped", __func__, tmpva));
8911 * If the current 2MB page already has the required
8912 * properties, then we need not demote this page. Just
8913 * increment tmpva to the next 2MB page frame.
8915 if ((*pde & pde_mask) == pde_bits) {
8916 tmpva = trunc_2mpage(tmpva) + NBPDR;
8921 * If the current offset aligns with a 2MB page frame
8922 * and there is at least 2MB left within the range, then
8923 * we need not break down this page into 4KB pages.
8925 if ((tmpva & PDRMASK) == 0 &&
8926 tmpva + PDRMASK < base + size) {
8930 if (!pmap_demote_pde(kernel_pmap, pde, tmpva))
8933 pte = pmap_pde_to_pte(pde, tmpva);
8935 KASSERT((flags & MAPDEV_ASSERTVALID) == 0,
8936 ("%s: addr %#lx is not mapped", __func__, tmpva));
8944 * Ok, all the pages exist, so run through them updating their
8945 * properties if required.
8948 pa_start = pa_end = 0;
8949 for (tmpva = base; tmpva < base + size; ) {
8950 pdpe = pmap_pdpe(kernel_pmap, tmpva);
8951 if (*pdpe & PG_PS) {
8952 if ((*pdpe & pde_mask) != pde_bits) {
8953 pmap_pte_props(pdpe, pde_bits, pde_mask);
8956 if (tmpva >= VM_MIN_KERNEL_ADDRESS &&
8957 (*pdpe & PG_PS_FRAME) < dmaplimit) {
8958 if (pa_start == pa_end) {
8959 /* Start physical address run. */
8960 pa_start = *pdpe & PG_PS_FRAME;
8961 pa_end = pa_start + NBPDP;
8962 } else if (pa_end == (*pdpe & PG_PS_FRAME))
8965 /* Run ended, update direct map. */
8966 error = pmap_change_props_locked(
8967 PHYS_TO_DMAP(pa_start),
8968 pa_end - pa_start, prot, mode,
8972 /* Start physical address run. */
8973 pa_start = *pdpe & PG_PS_FRAME;
8974 pa_end = pa_start + NBPDP;
8977 tmpva = trunc_1gpage(tmpva) + NBPDP;
8980 pde = pmap_pdpe_to_pde(pdpe, tmpva);
8982 if ((*pde & pde_mask) != pde_bits) {
8983 pmap_pte_props(pde, pde_bits, pde_mask);
8986 if (tmpva >= VM_MIN_KERNEL_ADDRESS &&
8987 (*pde & PG_PS_FRAME) < dmaplimit) {
8988 if (pa_start == pa_end) {
8989 /* Start physical address run. */
8990 pa_start = *pde & PG_PS_FRAME;
8991 pa_end = pa_start + NBPDR;
8992 } else if (pa_end == (*pde & PG_PS_FRAME))
8995 /* Run ended, update direct map. */
8996 error = pmap_change_props_locked(
8997 PHYS_TO_DMAP(pa_start),
8998 pa_end - pa_start, prot, mode,
9002 /* Start physical address run. */
9003 pa_start = *pde & PG_PS_FRAME;
9004 pa_end = pa_start + NBPDR;
9007 tmpva = trunc_2mpage(tmpva) + NBPDR;
9009 pte = pmap_pde_to_pte(pde, tmpva);
9010 if ((*pte & pte_mask) != pte_bits) {
9011 pmap_pte_props(pte, pte_bits, pte_mask);
9014 if (tmpva >= VM_MIN_KERNEL_ADDRESS &&
9015 (*pte & PG_FRAME) < dmaplimit) {
9016 if (pa_start == pa_end) {
9017 /* Start physical address run. */
9018 pa_start = *pte & PG_FRAME;
9019 pa_end = pa_start + PAGE_SIZE;
9020 } else if (pa_end == (*pte & PG_FRAME))
9021 pa_end += PAGE_SIZE;
9023 /* Run ended, update direct map. */
9024 error = pmap_change_props_locked(
9025 PHYS_TO_DMAP(pa_start),
9026 pa_end - pa_start, prot, mode,
9030 /* Start physical address run. */
9031 pa_start = *pte & PG_FRAME;
9032 pa_end = pa_start + PAGE_SIZE;
9038 if (error == 0 && pa_start != pa_end && pa_start < dmaplimit) {
9039 pa_end1 = MIN(pa_end, dmaplimit);
9040 if (pa_start != pa_end1)
9041 error = pmap_change_props_locked(PHYS_TO_DMAP(pa_start),
9042 pa_end1 - pa_start, prot, mode, flags);
9046 * Flush CPU caches if required to make sure any data isn't cached that
9047 * shouldn't be, etc.
9050 pmap_invalidate_range(kernel_pmap, base, tmpva);
9051 if ((flags & MAPDEV_FLUSHCACHE) != 0)
9052 pmap_invalidate_cache_range(base, tmpva);
9058 * Demotes any mapping within the direct map region that covers more than the
9059 * specified range of physical addresses. This range's size must be a power
9060 * of two and its starting address must be a multiple of its size. Since the
9061 * demotion does not change any attributes of the mapping, a TLB invalidation
9062 * is not mandatory. The caller may, however, request a TLB invalidation.
9065 pmap_demote_DMAP(vm_paddr_t base, vm_size_t len, boolean_t invalidate)
9074 KASSERT(powerof2(len), ("pmap_demote_DMAP: len is not a power of 2"));
9075 KASSERT((base & (len - 1)) == 0,
9076 ("pmap_demote_DMAP: base is not a multiple of len"));
9077 if (len < NBPDP && base < dmaplimit) {
9078 va = PHYS_TO_DMAP(base);
9080 PMAP_LOCK(kernel_pmap);
9081 pdpe = pmap_pdpe(kernel_pmap, va);
9082 if ((*pdpe & X86_PG_V) == 0)
9083 panic("pmap_demote_DMAP: invalid PDPE");
9084 if ((*pdpe & PG_PS) != 0) {
9085 if (!pmap_demote_pdpe(kernel_pmap, pdpe, va))
9086 panic("pmap_demote_DMAP: PDPE failed");
9090 pde = pmap_pdpe_to_pde(pdpe, va);
9091 if ((*pde & X86_PG_V) == 0)
9092 panic("pmap_demote_DMAP: invalid PDE");
9093 if ((*pde & PG_PS) != 0) {
9094 if (!pmap_demote_pde(kernel_pmap, pde, va))
9095 panic("pmap_demote_DMAP: PDE failed");
9099 if (changed && invalidate)
9100 pmap_invalidate_page(kernel_pmap, va);
9101 PMAP_UNLOCK(kernel_pmap);
9106 * Perform the pmap work for mincore(2). If the page is not both referenced and
9107 * modified by this pmap, returns its physical address so that the caller can
9108 * find other mappings.
9111 pmap_mincore(pmap_t pmap, vm_offset_t addr, vm_paddr_t *pap)
9114 pt_entry_t pte, PG_A, PG_M, PG_RW, PG_V;
9118 PG_A = pmap_accessed_bit(pmap);
9119 PG_M = pmap_modified_bit(pmap);
9120 PG_V = pmap_valid_bit(pmap);
9121 PG_RW = pmap_rw_bit(pmap);
9124 pdep = pmap_pde(pmap, addr);
9125 if (pdep != NULL && (*pdep & PG_V)) {
9126 if (*pdep & PG_PS) {
9128 /* Compute the physical address of the 4KB page. */
9129 pa = ((*pdep & PG_PS_FRAME) | (addr & PDRMASK)) &
9131 val = MINCORE_SUPER;
9133 pte = *pmap_pde_to_pte(pdep, addr);
9134 pa = pte & PG_FRAME;
9142 if ((pte & PG_V) != 0) {
9143 val |= MINCORE_INCORE;
9144 if ((pte & (PG_M | PG_RW)) == (PG_M | PG_RW))
9145 val |= MINCORE_MODIFIED | MINCORE_MODIFIED_OTHER;
9146 if ((pte & PG_A) != 0)
9147 val |= MINCORE_REFERENCED | MINCORE_REFERENCED_OTHER;
9149 if ((val & (MINCORE_MODIFIED_OTHER | MINCORE_REFERENCED_OTHER)) !=
9150 (MINCORE_MODIFIED_OTHER | MINCORE_REFERENCED_OTHER) &&
9151 (pte & (PG_MANAGED | PG_V)) == (PG_MANAGED | PG_V)) {
9159 pmap_pcid_alloc(pmap_t pmap, u_int cpuid)
9161 uint32_t gen, new_gen, pcid_next;
9163 CRITICAL_ASSERT(curthread);
9164 gen = PCPU_GET(pcid_gen);
9165 if (pmap->pm_pcids[cpuid].pm_pcid == PMAP_PCID_KERN)
9166 return (pti ? 0 : CR3_PCID_SAVE);
9167 if (pmap->pm_pcids[cpuid].pm_gen == gen)
9168 return (CR3_PCID_SAVE);
9169 pcid_next = PCPU_GET(pcid_next);
9170 KASSERT((!pti && pcid_next <= PMAP_PCID_OVERMAX) ||
9171 (pti && pcid_next <= PMAP_PCID_OVERMAX_KERN),
9172 ("cpu %d pcid_next %#x", cpuid, pcid_next));
9173 if ((!pti && pcid_next == PMAP_PCID_OVERMAX) ||
9174 (pti && pcid_next == PMAP_PCID_OVERMAX_KERN)) {
9178 PCPU_SET(pcid_gen, new_gen);
9179 pcid_next = PMAP_PCID_KERN + 1;
9183 pmap->pm_pcids[cpuid].pm_pcid = pcid_next;
9184 pmap->pm_pcids[cpuid].pm_gen = new_gen;
9185 PCPU_SET(pcid_next, pcid_next + 1);
9190 pmap_pcid_alloc_checked(pmap_t pmap, u_int cpuid)
9194 cached = pmap_pcid_alloc(pmap, cpuid);
9195 KASSERT(pmap->pm_pcids[cpuid].pm_pcid < PMAP_PCID_OVERMAX,
9196 ("pmap %p cpu %d pcid %#x", pmap, cpuid,
9197 pmap->pm_pcids[cpuid].pm_pcid));
9198 KASSERT(pmap->pm_pcids[cpuid].pm_pcid != PMAP_PCID_KERN ||
9199 pmap == kernel_pmap,
9200 ("non-kernel pmap pmap %p cpu %d pcid %#x",
9201 pmap, cpuid, pmap->pm_pcids[cpuid].pm_pcid));
9206 pmap_activate_sw_pti_post(struct thread *td, pmap_t pmap)
9209 PCPU_GET(tssp)->tss_rsp0 = pmap->pm_ucr3 != PMAP_NO_CR3 ?
9210 PCPU_GET(pti_rsp0) : (uintptr_t)td->td_md.md_stack_base;
9214 pmap_activate_sw_pcid_pti(struct thread *td, pmap_t pmap, u_int cpuid)
9217 uint64_t cached, cr3, kcr3, ucr3;
9219 KASSERT((read_rflags() & PSL_I) == 0,
9220 ("PCID needs interrupts disabled in pmap_activate_sw()"));
9222 /* See the comment in pmap_invalidate_page_pcid(). */
9223 if (PCPU_GET(ucr3_load_mask) != PMAP_UCR3_NOMASK) {
9224 PCPU_SET(ucr3_load_mask, PMAP_UCR3_NOMASK);
9225 old_pmap = PCPU_GET(curpmap);
9226 MPASS(old_pmap->pm_ucr3 != PMAP_NO_CR3);
9227 old_pmap->pm_pcids[cpuid].pm_gen = 0;
9230 cached = pmap_pcid_alloc_checked(pmap, cpuid);
9232 if ((cr3 & ~CR3_PCID_MASK) != pmap->pm_cr3)
9233 load_cr3(pmap->pm_cr3 | pmap->pm_pcids[cpuid].pm_pcid);
9234 PCPU_SET(curpmap, pmap);
9235 kcr3 = pmap->pm_cr3 | pmap->pm_pcids[cpuid].pm_pcid;
9236 ucr3 = pmap->pm_ucr3 | pmap->pm_pcids[cpuid].pm_pcid |
9239 if (!cached && pmap->pm_ucr3 != PMAP_NO_CR3)
9240 PCPU_SET(ucr3_load_mask, ~CR3_PCID_SAVE);
9242 PCPU_SET(kcr3, kcr3 | CR3_PCID_SAVE);
9243 PCPU_SET(ucr3, ucr3 | CR3_PCID_SAVE);
9245 PCPU_INC(pm_save_cnt);
9247 pmap_activate_sw_pti_post(td, pmap);
9251 pmap_activate_sw_pcid_nopti(struct thread *td __unused, pmap_t pmap,
9254 uint64_t cached, cr3;
9256 KASSERT((read_rflags() & PSL_I) == 0,
9257 ("PCID needs interrupts disabled in pmap_activate_sw()"));
9259 cached = pmap_pcid_alloc_checked(pmap, cpuid);
9261 if (!cached || (cr3 & ~CR3_PCID_MASK) != pmap->pm_cr3)
9262 load_cr3(pmap->pm_cr3 | pmap->pm_pcids[cpuid].pm_pcid |
9264 PCPU_SET(curpmap, pmap);
9266 PCPU_INC(pm_save_cnt);
9270 pmap_activate_sw_nopcid_nopti(struct thread *td __unused, pmap_t pmap,
9271 u_int cpuid __unused)
9274 load_cr3(pmap->pm_cr3);
9275 PCPU_SET(curpmap, pmap);
9279 pmap_activate_sw_nopcid_pti(struct thread *td, pmap_t pmap,
9280 u_int cpuid __unused)
9283 pmap_activate_sw_nopcid_nopti(td, pmap, cpuid);
9284 PCPU_SET(kcr3, pmap->pm_cr3);
9285 PCPU_SET(ucr3, pmap->pm_ucr3);
9286 pmap_activate_sw_pti_post(td, pmap);
9289 DEFINE_IFUNC(static, void, pmap_activate_sw_mode, (struct thread *, pmap_t,
9293 if (pmap_pcid_enabled && pti)
9294 return (pmap_activate_sw_pcid_pti);
9295 else if (pmap_pcid_enabled && !pti)
9296 return (pmap_activate_sw_pcid_nopti);
9297 else if (!pmap_pcid_enabled && pti)
9298 return (pmap_activate_sw_nopcid_pti);
9299 else /* if (!pmap_pcid_enabled && !pti) */
9300 return (pmap_activate_sw_nopcid_nopti);
9304 pmap_activate_sw(struct thread *td)
9306 pmap_t oldpmap, pmap;
9309 oldpmap = PCPU_GET(curpmap);
9310 pmap = vmspace_pmap(td->td_proc->p_vmspace);
9311 if (oldpmap == pmap) {
9312 if (cpu_vendor_id != CPU_VENDOR_INTEL)
9316 cpuid = PCPU_GET(cpuid);
9318 CPU_SET_ATOMIC(cpuid, &pmap->pm_active);
9320 CPU_SET(cpuid, &pmap->pm_active);
9322 pmap_activate_sw_mode(td, pmap, cpuid);
9324 CPU_CLR_ATOMIC(cpuid, &oldpmap->pm_active);
9326 CPU_CLR(cpuid, &oldpmap->pm_active);
9331 pmap_activate(struct thread *td)
9334 * invltlb_{invpcid,}_pcid_handler() is used to handle an
9335 * invalidate_all IPI, which checks for curpmap ==
9336 * smp_tlb_pmap. The below sequence of operations has a
9337 * window where %CR3 is loaded with the new pmap's PML4
9338 * address, but the curpmap value has not yet been updated.
9339 * This causes the invltlb IPI handler, which is called
9340 * between the updates, to execute as a NOP, which leaves
9341 * stale TLB entries.
9343 * Note that the most common use of pmap_activate_sw(), from
9344 * a context switch, is immune to this race, because
9345 * interrupts are disabled (while the thread lock is owned),
9346 * so the IPI is delayed until after curpmap is updated. Protect
9347 * other callers in a similar way, by disabling interrupts
9348 * around the %cr3 register reload and curpmap assignment.
9351 pmap_activate_sw(td);
9356 pmap_activate_boot(pmap_t pmap)
9362 * kernel_pmap must be never deactivated, and we ensure that
9363 * by never activating it at all.
9365 MPASS(pmap != kernel_pmap);
9367 cpuid = PCPU_GET(cpuid);
9369 CPU_SET_ATOMIC(cpuid, &pmap->pm_active);
9371 CPU_SET(cpuid, &pmap->pm_active);
9373 PCPU_SET(curpmap, pmap);
9375 kcr3 = pmap->pm_cr3;
9376 if (pmap_pcid_enabled)
9377 kcr3 |= pmap->pm_pcids[cpuid].pm_pcid | CR3_PCID_SAVE;
9381 PCPU_SET(kcr3, kcr3);
9382 PCPU_SET(ucr3, PMAP_NO_CR3);
9386 pmap_sync_icache(pmap_t pm, vm_offset_t va, vm_size_t sz)
9391 * Increase the starting virtual address of the given mapping if a
9392 * different alignment might result in more superpage mappings.
9395 pmap_align_superpage(vm_object_t object, vm_ooffset_t offset,
9396 vm_offset_t *addr, vm_size_t size)
9398 vm_offset_t superpage_offset;
9402 if (object != NULL && (object->flags & OBJ_COLORED) != 0)
9403 offset += ptoa(object->pg_color);
9404 superpage_offset = offset & PDRMASK;
9405 if (size - ((NBPDR - superpage_offset) & PDRMASK) < NBPDR ||
9406 (*addr & PDRMASK) == superpage_offset)
9408 if ((*addr & PDRMASK) < superpage_offset)
9409 *addr = (*addr & ~PDRMASK) + superpage_offset;
9411 *addr = ((*addr + PDRMASK) & ~PDRMASK) + superpage_offset;
9415 static unsigned long num_dirty_emulations;
9416 SYSCTL_ULONG(_vm_pmap, OID_AUTO, num_dirty_emulations, CTLFLAG_RW,
9417 &num_dirty_emulations, 0, NULL);
9419 static unsigned long num_accessed_emulations;
9420 SYSCTL_ULONG(_vm_pmap, OID_AUTO, num_accessed_emulations, CTLFLAG_RW,
9421 &num_accessed_emulations, 0, NULL);
9423 static unsigned long num_superpage_accessed_emulations;
9424 SYSCTL_ULONG(_vm_pmap, OID_AUTO, num_superpage_accessed_emulations, CTLFLAG_RW,
9425 &num_superpage_accessed_emulations, 0, NULL);
9427 static unsigned long ad_emulation_superpage_promotions;
9428 SYSCTL_ULONG(_vm_pmap, OID_AUTO, ad_emulation_superpage_promotions, CTLFLAG_RW,
9429 &ad_emulation_superpage_promotions, 0, NULL);
9430 #endif /* INVARIANTS */
9433 pmap_emulate_accessed_dirty(pmap_t pmap, vm_offset_t va, int ftype)
9436 struct rwlock *lock;
9437 #if VM_NRESERVLEVEL > 0
9441 pt_entry_t *pte, PG_A, PG_M, PG_RW, PG_V;
9443 KASSERT(ftype == VM_PROT_READ || ftype == VM_PROT_WRITE,
9444 ("pmap_emulate_accessed_dirty: invalid fault type %d", ftype));
9446 if (!pmap_emulate_ad_bits(pmap))
9449 PG_A = pmap_accessed_bit(pmap);
9450 PG_M = pmap_modified_bit(pmap);
9451 PG_V = pmap_valid_bit(pmap);
9452 PG_RW = pmap_rw_bit(pmap);
9458 pde = pmap_pde(pmap, va);
9459 if (pde == NULL || (*pde & PG_V) == 0)
9462 if ((*pde & PG_PS) != 0) {
9463 if (ftype == VM_PROT_READ) {
9465 atomic_add_long(&num_superpage_accessed_emulations, 1);
9473 pte = pmap_pde_to_pte(pde, va);
9474 if ((*pte & PG_V) == 0)
9477 if (ftype == VM_PROT_WRITE) {
9478 if ((*pte & PG_RW) == 0)
9481 * Set the modified and accessed bits simultaneously.
9483 * Intel EPT PTEs that do software emulation of A/D bits map
9484 * PG_A and PG_M to EPT_PG_READ and EPT_PG_WRITE respectively.
9485 * An EPT misconfiguration is triggered if the PTE is writable
9486 * but not readable (WR=10). This is avoided by setting PG_A
9487 * and PG_M simultaneously.
9489 *pte |= PG_M | PG_A;
9494 #if VM_NRESERVLEVEL > 0
9495 /* try to promote the mapping */
9496 if (va < VM_MAXUSER_ADDRESS)
9497 mpte = PHYS_TO_VM_PAGE(*pde & PG_FRAME);
9501 m = PHYS_TO_VM_PAGE(*pte & PG_FRAME);
9503 if ((mpte == NULL || mpte->ref_count == NPTEPG) &&
9504 pmap_ps_enabled(pmap) &&
9505 (m->flags & PG_FICTITIOUS) == 0 &&
9506 vm_reserv_level_iffullpop(m) == 0) {
9507 pmap_promote_pde(pmap, pde, va, &lock);
9509 atomic_add_long(&ad_emulation_superpage_promotions, 1);
9515 if (ftype == VM_PROT_WRITE)
9516 atomic_add_long(&num_dirty_emulations, 1);
9518 atomic_add_long(&num_accessed_emulations, 1);
9520 rv = 0; /* success */
9529 pmap_get_mapping(pmap_t pmap, vm_offset_t va, uint64_t *ptr, int *num)
9534 pt_entry_t *pte, PG_V;
9538 PG_V = pmap_valid_bit(pmap);
9541 pml4 = pmap_pml4e(pmap, va);
9543 if ((*pml4 & PG_V) == 0)
9546 pdp = pmap_pml4e_to_pdpe(pml4, va);
9548 if ((*pdp & PG_V) == 0 || (*pdp & PG_PS) != 0)
9551 pde = pmap_pdpe_to_pde(pdp, va);
9553 if ((*pde & PG_V) == 0 || (*pde & PG_PS) != 0)
9556 pte = pmap_pde_to_pte(pde, va);
9565 * Get the kernel virtual address of a set of physical pages. If there are
9566 * physical addresses not covered by the DMAP perform a transient mapping
9567 * that will be removed when calling pmap_unmap_io_transient.
9569 * \param page The pages the caller wishes to obtain the virtual
9570 * address on the kernel memory map.
9571 * \param vaddr On return contains the kernel virtual memory address
9572 * of the pages passed in the page parameter.
9573 * \param count Number of pages passed in.
9574 * \param can_fault TRUE if the thread using the mapped pages can take
9575 * page faults, FALSE otherwise.
9577 * \returns TRUE if the caller must call pmap_unmap_io_transient when
9578 * finished or FALSE otherwise.
9582 pmap_map_io_transient(vm_page_t page[], vm_offset_t vaddr[], int count,
9583 boolean_t can_fault)
9586 boolean_t needs_mapping;
9588 int cache_bits, error __unused, i;
9591 * Allocate any KVA space that we need, this is done in a separate
9592 * loop to prevent calling vmem_alloc while pinned.
9594 needs_mapping = FALSE;
9595 for (i = 0; i < count; i++) {
9596 paddr = VM_PAGE_TO_PHYS(page[i]);
9597 if (__predict_false(paddr >= dmaplimit)) {
9598 error = vmem_alloc(kernel_arena, PAGE_SIZE,
9599 M_BESTFIT | M_WAITOK, &vaddr[i]);
9600 KASSERT(error == 0, ("vmem_alloc failed: %d", error));
9601 needs_mapping = TRUE;
9603 vaddr[i] = PHYS_TO_DMAP(paddr);
9607 /* Exit early if everything is covered by the DMAP */
9612 * NB: The sequence of updating a page table followed by accesses
9613 * to the corresponding pages used in the !DMAP case is subject to
9614 * the situation described in the "AMD64 Architecture Programmer's
9615 * Manual Volume 2: System Programming" rev. 3.23, "7.3.1 Special
9616 * Coherency Considerations". Therefore, issuing the INVLPG right
9617 * after modifying the PTE bits is crucial.
9621 for (i = 0; i < count; i++) {
9622 paddr = VM_PAGE_TO_PHYS(page[i]);
9623 if (paddr >= dmaplimit) {
9626 * Slow path, since we can get page faults
9627 * while mappings are active don't pin the
9628 * thread to the CPU and instead add a global
9629 * mapping visible to all CPUs.
9631 pmap_qenter(vaddr[i], &page[i], 1);
9633 pte = vtopte(vaddr[i]);
9634 cache_bits = pmap_cache_bits(kernel_pmap,
9635 page[i]->md.pat_mode, 0);
9636 pte_store(pte, paddr | X86_PG_RW | X86_PG_V |
9643 return (needs_mapping);
9647 pmap_unmap_io_transient(vm_page_t page[], vm_offset_t vaddr[], int count,
9648 boolean_t can_fault)
9655 for (i = 0; i < count; i++) {
9656 paddr = VM_PAGE_TO_PHYS(page[i]);
9657 if (paddr >= dmaplimit) {
9659 pmap_qremove(vaddr[i], 1);
9660 vmem_free(kernel_arena, vaddr[i], PAGE_SIZE);
9666 pmap_quick_enter_page(vm_page_t m)
9670 paddr = VM_PAGE_TO_PHYS(m);
9671 if (paddr < dmaplimit)
9672 return (PHYS_TO_DMAP(paddr));
9673 mtx_lock_spin(&qframe_mtx);
9674 KASSERT(*vtopte(qframe) == 0, ("qframe busy"));
9675 pte_store(vtopte(qframe), paddr | X86_PG_RW | X86_PG_V | X86_PG_A |
9676 X86_PG_M | pmap_cache_bits(kernel_pmap, m->md.pat_mode, 0));
9681 pmap_quick_remove_page(vm_offset_t addr)
9686 pte_store(vtopte(qframe), 0);
9688 mtx_unlock_spin(&qframe_mtx);
9692 * Pdp pages from the large map are managed differently from either
9693 * kernel or user page table pages. They are permanently allocated at
9694 * initialization time, and their reference count is permanently set to
9695 * zero. The pml4 entries pointing to those pages are copied into
9696 * each allocated pmap.
9698 * In contrast, pd and pt pages are managed like user page table
9699 * pages. They are dynamically allocated, and their reference count
9700 * represents the number of valid entries within the page.
9703 pmap_large_map_getptp_unlocked(void)
9707 m = vm_page_alloc(NULL, 0, VM_ALLOC_NORMAL | VM_ALLOC_NOOBJ |
9709 if (m != NULL && (m->flags & PG_ZERO) == 0)
9715 pmap_large_map_getptp(void)
9719 PMAP_LOCK_ASSERT(kernel_pmap, MA_OWNED);
9720 m = pmap_large_map_getptp_unlocked();
9722 PMAP_UNLOCK(kernel_pmap);
9724 PMAP_LOCK(kernel_pmap);
9725 /* Callers retry. */
9730 static pdp_entry_t *
9731 pmap_large_map_pdpe(vm_offset_t va)
9733 vm_pindex_t pml4_idx;
9736 pml4_idx = pmap_pml4e_index(va);
9737 KASSERT(LMSPML4I <= pml4_idx && pml4_idx < LMSPML4I + lm_ents,
9738 ("pmap_large_map_pdpe: va %#jx out of range idx %#jx LMSPML4I "
9740 (uintmax_t)va, (uintmax_t)pml4_idx, LMSPML4I, lm_ents));
9741 KASSERT((kernel_pml4[pml4_idx] & X86_PG_V) != 0,
9742 ("pmap_large_map_pdpe: invalid pml4 for va %#jx idx %#jx "
9743 "LMSPML4I %#jx lm_ents %d",
9744 (uintmax_t)va, (uintmax_t)pml4_idx, LMSPML4I, lm_ents));
9745 mphys = kernel_pml4[pml4_idx] & PG_FRAME;
9746 return ((pdp_entry_t *)PHYS_TO_DMAP(mphys) + pmap_pdpe_index(va));
9750 pmap_large_map_pde(vm_offset_t va)
9757 pdpe = pmap_large_map_pdpe(va);
9759 m = pmap_large_map_getptp();
9762 mphys = VM_PAGE_TO_PHYS(m);
9763 *pdpe = mphys | X86_PG_A | X86_PG_RW | X86_PG_V | pg_nx;
9765 MPASS((*pdpe & X86_PG_PS) == 0);
9766 mphys = *pdpe & PG_FRAME;
9768 return ((pd_entry_t *)PHYS_TO_DMAP(mphys) + pmap_pde_index(va));
9772 pmap_large_map_pte(vm_offset_t va)
9779 pde = pmap_large_map_pde(va);
9781 m = pmap_large_map_getptp();
9784 mphys = VM_PAGE_TO_PHYS(m);
9785 *pde = mphys | X86_PG_A | X86_PG_RW | X86_PG_V | pg_nx;
9786 PHYS_TO_VM_PAGE(DMAP_TO_PHYS((uintptr_t)pde))->ref_count++;
9788 MPASS((*pde & X86_PG_PS) == 0);
9789 mphys = *pde & PG_FRAME;
9791 return ((pt_entry_t *)PHYS_TO_DMAP(mphys) + pmap_pte_index(va));
9795 pmap_large_map_kextract(vm_offset_t va)
9797 pdp_entry_t *pdpe, pdp;
9798 pd_entry_t *pde, pd;
9799 pt_entry_t *pte, pt;
9801 KASSERT(PMAP_ADDRESS_IN_LARGEMAP(va),
9802 ("not largemap range %#lx", (u_long)va));
9803 pdpe = pmap_large_map_pdpe(va);
9805 KASSERT((pdp & X86_PG_V) != 0,
9806 ("invalid pdp va %#lx pdpe %#lx pdp %#lx", va,
9807 (u_long)pdpe, pdp));
9808 if ((pdp & X86_PG_PS) != 0) {
9809 KASSERT((amd_feature & AMDID_PAGE1GB) != 0,
9810 ("no 1G pages, va %#lx pdpe %#lx pdp %#lx", va,
9811 (u_long)pdpe, pdp));
9812 return ((pdp & PG_PS_PDP_FRAME) | (va & PDPMASK));
9814 pde = pmap_pdpe_to_pde(pdpe, va);
9816 KASSERT((pd & X86_PG_V) != 0,
9817 ("invalid pd va %#lx pde %#lx pd %#lx", va, (u_long)pde, pd));
9818 if ((pd & X86_PG_PS) != 0)
9819 return ((pd & PG_PS_FRAME) | (va & PDRMASK));
9820 pte = pmap_pde_to_pte(pde, va);
9822 KASSERT((pt & X86_PG_V) != 0,
9823 ("invalid pte va %#lx pte %#lx pt %#lx", va, (u_long)pte, pt));
9824 return ((pt & PG_FRAME) | (va & PAGE_MASK));
9828 pmap_large_map_getva(vm_size_t len, vm_offset_t align, vm_offset_t phase,
9829 vmem_addr_t *vmem_res)
9833 * Large mappings are all but static. Consequently, there
9834 * is no point in waiting for an earlier allocation to be
9837 return (vmem_xalloc(large_vmem, len, align, phase, 0, VMEM_ADDR_MIN,
9838 VMEM_ADDR_MAX, M_NOWAIT | M_BESTFIT, vmem_res));
9842 pmap_large_map(vm_paddr_t spa, vm_size_t len, void **addr,
9848 vm_offset_t va, inc;
9849 vmem_addr_t vmem_res;
9853 if (len == 0 || spa + len < spa)
9856 /* See if DMAP can serve. */
9857 if (spa + len <= dmaplimit) {
9858 va = PHYS_TO_DMAP(spa);
9860 return (pmap_change_attr(va, len, mattr));
9864 * No, allocate KVA. Fit the address with best possible
9865 * alignment for superpages. Fall back to worse align if
9869 if ((amd_feature & AMDID_PAGE1GB) != 0 && rounddown2(spa + len,
9870 NBPDP) >= roundup2(spa, NBPDP) + NBPDP)
9871 error = pmap_large_map_getva(len, NBPDP, spa & PDPMASK,
9873 if (error != 0 && rounddown2(spa + len, NBPDR) >= roundup2(spa,
9875 error = pmap_large_map_getva(len, NBPDR, spa & PDRMASK,
9878 error = pmap_large_map_getva(len, PAGE_SIZE, 0, &vmem_res);
9883 * Fill pagetable. PG_M is not pre-set, we scan modified bits
9884 * in the pagetable to minimize flushing. No need to
9885 * invalidate TLB, since we only update invalid entries.
9887 PMAP_LOCK(kernel_pmap);
9888 for (pa = spa, va = vmem_res; len > 0; pa += inc, va += inc,
9890 if ((amd_feature & AMDID_PAGE1GB) != 0 && len >= NBPDP &&
9891 (pa & PDPMASK) == 0 && (va & PDPMASK) == 0) {
9892 pdpe = pmap_large_map_pdpe(va);
9894 *pdpe = pa | pg_g | X86_PG_PS | X86_PG_RW |
9895 X86_PG_V | X86_PG_A | pg_nx |
9896 pmap_cache_bits(kernel_pmap, mattr, TRUE);
9898 } else if (len >= NBPDR && (pa & PDRMASK) == 0 &&
9899 (va & PDRMASK) == 0) {
9900 pde = pmap_large_map_pde(va);
9902 *pde = pa | pg_g | X86_PG_PS | X86_PG_RW |
9903 X86_PG_V | X86_PG_A | pg_nx |
9904 pmap_cache_bits(kernel_pmap, mattr, TRUE);
9905 PHYS_TO_VM_PAGE(DMAP_TO_PHYS((uintptr_t)pde))->
9909 pte = pmap_large_map_pte(va);
9911 *pte = pa | pg_g | X86_PG_RW | X86_PG_V |
9912 X86_PG_A | pg_nx | pmap_cache_bits(kernel_pmap,
9914 PHYS_TO_VM_PAGE(DMAP_TO_PHYS((uintptr_t)pte))->
9919 PMAP_UNLOCK(kernel_pmap);
9922 *addr = (void *)vmem_res;
9927 pmap_large_unmap(void *svaa, vm_size_t len)
9929 vm_offset_t sva, va;
9931 pdp_entry_t *pdpe, pdp;
9932 pd_entry_t *pde, pd;
9935 struct spglist spgf;
9937 sva = (vm_offset_t)svaa;
9938 if (len == 0 || sva + len < sva || (sva >= DMAP_MIN_ADDRESS &&
9939 sva + len <= DMAP_MIN_ADDRESS + dmaplimit))
9943 KASSERT(PMAP_ADDRESS_IN_LARGEMAP(sva) &&
9944 PMAP_ADDRESS_IN_LARGEMAP(sva + len - 1),
9945 ("not largemap range %#lx %#lx", (u_long)svaa, (u_long)svaa + len));
9946 PMAP_LOCK(kernel_pmap);
9947 for (va = sva; va < sva + len; va += inc) {
9948 pdpe = pmap_large_map_pdpe(va);
9950 KASSERT((pdp & X86_PG_V) != 0,
9951 ("invalid pdp va %#lx pdpe %#lx pdp %#lx", va,
9952 (u_long)pdpe, pdp));
9953 if ((pdp & X86_PG_PS) != 0) {
9954 KASSERT((amd_feature & AMDID_PAGE1GB) != 0,
9955 ("no 1G pages, va %#lx pdpe %#lx pdp %#lx", va,
9956 (u_long)pdpe, pdp));
9957 KASSERT((va & PDPMASK) == 0,
9958 ("PDPMASK bit set, va %#lx pdpe %#lx pdp %#lx", va,
9959 (u_long)pdpe, pdp));
9960 KASSERT(va + NBPDP <= sva + len,
9961 ("unmap covers partial 1GB page, sva %#lx va %#lx "
9962 "pdpe %#lx pdp %#lx len %#lx", sva, va,
9963 (u_long)pdpe, pdp, len));
9968 pde = pmap_pdpe_to_pde(pdpe, va);
9970 KASSERT((pd & X86_PG_V) != 0,
9971 ("invalid pd va %#lx pde %#lx pd %#lx", va,
9973 if ((pd & X86_PG_PS) != 0) {
9974 KASSERT((va & PDRMASK) == 0,
9975 ("PDRMASK bit set, va %#lx pde %#lx pd %#lx", va,
9977 KASSERT(va + NBPDR <= sva + len,
9978 ("unmap covers partial 2MB page, sva %#lx va %#lx "
9979 "pde %#lx pd %#lx len %#lx", sva, va, (u_long)pde,
9983 m = PHYS_TO_VM_PAGE(DMAP_TO_PHYS((vm_offset_t)pde));
9985 if (m->ref_count == 0) {
9987 SLIST_INSERT_HEAD(&spgf, m, plinks.s.ss);
9991 pte = pmap_pde_to_pte(pde, va);
9992 KASSERT((*pte & X86_PG_V) != 0,
9993 ("invalid pte va %#lx pte %#lx pt %#lx", va,
9994 (u_long)pte, *pte));
9997 m = PHYS_TO_VM_PAGE(DMAP_TO_PHYS((vm_offset_t)pte));
9999 if (m->ref_count == 0) {
10001 SLIST_INSERT_HEAD(&spgf, m, plinks.s.ss);
10002 m = PHYS_TO_VM_PAGE(DMAP_TO_PHYS((vm_offset_t)pde));
10004 if (m->ref_count == 0) {
10006 SLIST_INSERT_HEAD(&spgf, m, plinks.s.ss);
10010 pmap_invalidate_range(kernel_pmap, sva, sva + len);
10011 PMAP_UNLOCK(kernel_pmap);
10012 vm_page_free_pages_toq(&spgf, false);
10013 vmem_free(large_vmem, sva, len);
10017 pmap_large_map_wb_fence_mfence(void)
10024 pmap_large_map_wb_fence_atomic(void)
10027 atomic_thread_fence_seq_cst();
10031 pmap_large_map_wb_fence_nop(void)
10035 DEFINE_IFUNC(static, void, pmap_large_map_wb_fence, (void))
10038 if (cpu_vendor_id != CPU_VENDOR_INTEL)
10039 return (pmap_large_map_wb_fence_mfence);
10040 else if ((cpu_stdext_feature & (CPUID_STDEXT_CLWB |
10041 CPUID_STDEXT_CLFLUSHOPT)) == 0)
10042 return (pmap_large_map_wb_fence_atomic);
10044 /* clflush is strongly enough ordered */
10045 return (pmap_large_map_wb_fence_nop);
10049 pmap_large_map_flush_range_clwb(vm_offset_t va, vm_size_t len)
10052 for (; len > 0; len -= cpu_clflush_line_size,
10053 va += cpu_clflush_line_size)
10058 pmap_large_map_flush_range_clflushopt(vm_offset_t va, vm_size_t len)
10061 for (; len > 0; len -= cpu_clflush_line_size,
10062 va += cpu_clflush_line_size)
10067 pmap_large_map_flush_range_clflush(vm_offset_t va, vm_size_t len)
10070 for (; len > 0; len -= cpu_clflush_line_size,
10071 va += cpu_clflush_line_size)
10076 pmap_large_map_flush_range_nop(vm_offset_t sva __unused, vm_size_t len __unused)
10080 DEFINE_IFUNC(static, void, pmap_large_map_flush_range, (vm_offset_t, vm_size_t))
10083 if ((cpu_stdext_feature & CPUID_STDEXT_CLWB) != 0)
10084 return (pmap_large_map_flush_range_clwb);
10085 else if ((cpu_stdext_feature & CPUID_STDEXT_CLFLUSHOPT) != 0)
10086 return (pmap_large_map_flush_range_clflushopt);
10087 else if ((cpu_feature & CPUID_CLFSH) != 0)
10088 return (pmap_large_map_flush_range_clflush);
10090 return (pmap_large_map_flush_range_nop);
10094 pmap_large_map_wb_large(vm_offset_t sva, vm_offset_t eva)
10096 volatile u_long *pe;
10102 for (va = sva; va < eva; va += inc) {
10104 if ((amd_feature & AMDID_PAGE1GB) != 0) {
10105 pe = (volatile u_long *)pmap_large_map_pdpe(va);
10107 if ((p & X86_PG_PS) != 0)
10111 pe = (volatile u_long *)pmap_large_map_pde(va);
10113 if ((p & X86_PG_PS) != 0)
10117 pe = (volatile u_long *)pmap_large_map_pte(va);
10121 seen_other = false;
10123 if ((p & X86_PG_AVAIL1) != 0) {
10125 * Spin-wait for the end of a parallel
10132 * If we saw other write-back
10133 * occuring, we cannot rely on PG_M to
10134 * indicate state of the cache. The
10135 * PG_M bit is cleared before the
10136 * flush to avoid ignoring new writes,
10137 * and writes which are relevant for
10138 * us might happen after.
10144 if ((p & X86_PG_M) != 0 || seen_other) {
10145 if (!atomic_fcmpset_long(pe, &p,
10146 (p & ~X86_PG_M) | X86_PG_AVAIL1))
10148 * If we saw PG_M without
10149 * PG_AVAIL1, and then on the
10150 * next attempt we do not
10151 * observe either PG_M or
10152 * PG_AVAIL1, the other
10153 * write-back started after us
10154 * and finished before us. We
10155 * can rely on it doing our
10159 pmap_large_map_flush_range(va, inc);
10160 atomic_clear_long(pe, X86_PG_AVAIL1);
10169 * Write-back cache lines for the given address range.
10171 * Must be called only on the range or sub-range returned from
10172 * pmap_large_map(). Must not be called on the coalesced ranges.
10174 * Does nothing on CPUs without CLWB, CLFLUSHOPT, or CLFLUSH
10175 * instructions support.
10178 pmap_large_map_wb(void *svap, vm_size_t len)
10180 vm_offset_t eva, sva;
10182 sva = (vm_offset_t)svap;
10184 pmap_large_map_wb_fence();
10185 if (sva >= DMAP_MIN_ADDRESS && eva <= DMAP_MIN_ADDRESS + dmaplimit) {
10186 pmap_large_map_flush_range(sva, len);
10188 KASSERT(sva >= LARGEMAP_MIN_ADDRESS &&
10189 eva <= LARGEMAP_MIN_ADDRESS + lm_ents * NBPML4,
10190 ("pmap_large_map_wb: not largemap %#lx %#lx", sva, len));
10191 pmap_large_map_wb_large(sva, eva);
10193 pmap_large_map_wb_fence();
10197 pmap_pti_alloc_page(void)
10201 VM_OBJECT_ASSERT_WLOCKED(pti_obj);
10202 m = vm_page_grab(pti_obj, pti_pg_idx++, VM_ALLOC_NOBUSY |
10203 VM_ALLOC_WIRED | VM_ALLOC_ZERO);
10208 pmap_pti_free_page(vm_page_t m)
10211 KASSERT(m->ref_count > 0, ("page %p not referenced", m));
10212 if (!vm_page_unwire_noq(m))
10214 vm_page_free_zero(m);
10219 pmap_pti_init(void)
10228 pti_obj = vm_pager_allocate(OBJT_PHYS, NULL, 0, VM_PROT_ALL, 0, NULL);
10229 VM_OBJECT_WLOCK(pti_obj);
10230 pml4_pg = pmap_pti_alloc_page();
10231 pti_pml4 = (pml4_entry_t *)PHYS_TO_DMAP(VM_PAGE_TO_PHYS(pml4_pg));
10232 for (va = VM_MIN_KERNEL_ADDRESS; va <= VM_MAX_KERNEL_ADDRESS &&
10233 va >= VM_MIN_KERNEL_ADDRESS && va > NBPML4; va += NBPML4) {
10234 pdpe = pmap_pti_pdpe(va);
10235 pmap_pti_wire_pte(pdpe);
10237 pmap_pti_add_kva_locked((vm_offset_t)&__pcpu[0],
10238 (vm_offset_t)&__pcpu[0] + sizeof(__pcpu[0]) * MAXCPU, false);
10239 pmap_pti_add_kva_locked((vm_offset_t)idt, (vm_offset_t)idt +
10240 sizeof(struct gate_descriptor) * NIDT, false);
10242 /* Doublefault stack IST 1 */
10243 va = __pcpu[i].pc_common_tss.tss_ist1;
10244 pmap_pti_add_kva_locked(va - PAGE_SIZE, va, false);
10245 /* NMI stack IST 2 */
10246 va = __pcpu[i].pc_common_tss.tss_ist2 + sizeof(struct nmi_pcpu);
10247 pmap_pti_add_kva_locked(va - PAGE_SIZE, va, false);
10248 /* MC# stack IST 3 */
10249 va = __pcpu[i].pc_common_tss.tss_ist3 +
10250 sizeof(struct nmi_pcpu);
10251 pmap_pti_add_kva_locked(va - PAGE_SIZE, va, false);
10252 /* DB# stack IST 4 */
10253 va = __pcpu[i].pc_common_tss.tss_ist4 + sizeof(struct nmi_pcpu);
10254 pmap_pti_add_kva_locked(va - PAGE_SIZE, va, false);
10256 pmap_pti_add_kva_locked((vm_offset_t)kernphys + KERNBASE,
10257 (vm_offset_t)etext, true);
10258 pti_finalized = true;
10259 VM_OBJECT_WUNLOCK(pti_obj);
10261 SYSINIT(pmap_pti, SI_SUB_CPU + 1, SI_ORDER_ANY, pmap_pti_init, NULL);
10263 static pdp_entry_t *
10264 pmap_pti_pdpe(vm_offset_t va)
10266 pml4_entry_t *pml4e;
10269 vm_pindex_t pml4_idx;
10272 VM_OBJECT_ASSERT_WLOCKED(pti_obj);
10274 pml4_idx = pmap_pml4e_index(va);
10275 pml4e = &pti_pml4[pml4_idx];
10279 panic("pml4 alloc after finalization\n");
10280 m = pmap_pti_alloc_page();
10282 pmap_pti_free_page(m);
10283 mphys = *pml4e & ~PAGE_MASK;
10285 mphys = VM_PAGE_TO_PHYS(m);
10286 *pml4e = mphys | X86_PG_RW | X86_PG_V;
10289 mphys = *pml4e & ~PAGE_MASK;
10291 pdpe = (pdp_entry_t *)PHYS_TO_DMAP(mphys) + pmap_pdpe_index(va);
10296 pmap_pti_wire_pte(void *pte)
10300 VM_OBJECT_ASSERT_WLOCKED(pti_obj);
10301 m = PHYS_TO_VM_PAGE(DMAP_TO_PHYS((uintptr_t)pte));
10306 pmap_pti_unwire_pde(void *pde, bool only_ref)
10310 VM_OBJECT_ASSERT_WLOCKED(pti_obj);
10311 m = PHYS_TO_VM_PAGE(DMAP_TO_PHYS((uintptr_t)pde));
10312 MPASS(m->ref_count > 0);
10313 MPASS(only_ref || m->ref_count > 1);
10314 pmap_pti_free_page(m);
10318 pmap_pti_unwire_pte(void *pte, vm_offset_t va)
10323 VM_OBJECT_ASSERT_WLOCKED(pti_obj);
10324 m = PHYS_TO_VM_PAGE(DMAP_TO_PHYS((uintptr_t)pte));
10325 MPASS(m->ref_count > 0);
10326 if (pmap_pti_free_page(m)) {
10327 pde = pmap_pti_pde(va);
10328 MPASS((*pde & (X86_PG_PS | X86_PG_V)) == X86_PG_V);
10330 pmap_pti_unwire_pde(pde, false);
10334 static pd_entry_t *
10335 pmap_pti_pde(vm_offset_t va)
10340 vm_pindex_t pd_idx;
10343 VM_OBJECT_ASSERT_WLOCKED(pti_obj);
10345 pdpe = pmap_pti_pdpe(va);
10347 m = pmap_pti_alloc_page();
10349 pmap_pti_free_page(m);
10350 MPASS((*pdpe & X86_PG_PS) == 0);
10351 mphys = *pdpe & ~PAGE_MASK;
10353 mphys = VM_PAGE_TO_PHYS(m);
10354 *pdpe = mphys | X86_PG_RW | X86_PG_V;
10357 MPASS((*pdpe & X86_PG_PS) == 0);
10358 mphys = *pdpe & ~PAGE_MASK;
10361 pde = (pd_entry_t *)PHYS_TO_DMAP(mphys);
10362 pd_idx = pmap_pde_index(va);
10367 static pt_entry_t *
10368 pmap_pti_pte(vm_offset_t va, bool *unwire_pde)
10375 VM_OBJECT_ASSERT_WLOCKED(pti_obj);
10377 pde = pmap_pti_pde(va);
10378 if (unwire_pde != NULL) {
10379 *unwire_pde = true;
10380 pmap_pti_wire_pte(pde);
10383 m = pmap_pti_alloc_page();
10385 pmap_pti_free_page(m);
10386 MPASS((*pde & X86_PG_PS) == 0);
10387 mphys = *pde & ~(PAGE_MASK | pg_nx);
10389 mphys = VM_PAGE_TO_PHYS(m);
10390 *pde = mphys | X86_PG_RW | X86_PG_V;
10391 if (unwire_pde != NULL)
10392 *unwire_pde = false;
10395 MPASS((*pde & X86_PG_PS) == 0);
10396 mphys = *pde & ~(PAGE_MASK | pg_nx);
10399 pte = (pt_entry_t *)PHYS_TO_DMAP(mphys);
10400 pte += pmap_pte_index(va);
10406 pmap_pti_add_kva_locked(vm_offset_t sva, vm_offset_t eva, bool exec)
10410 pt_entry_t *pte, ptev;
10413 VM_OBJECT_ASSERT_WLOCKED(pti_obj);
10415 sva = trunc_page(sva);
10416 MPASS(sva > VM_MAXUSER_ADDRESS);
10417 eva = round_page(eva);
10419 for (; sva < eva; sva += PAGE_SIZE) {
10420 pte = pmap_pti_pte(sva, &unwire_pde);
10421 pa = pmap_kextract(sva);
10422 ptev = pa | X86_PG_RW | X86_PG_V | X86_PG_A | X86_PG_G |
10423 (exec ? 0 : pg_nx) | pmap_cache_bits(kernel_pmap,
10424 VM_MEMATTR_DEFAULT, FALSE);
10426 pte_store(pte, ptev);
10427 pmap_pti_wire_pte(pte);
10429 KASSERT(!pti_finalized,
10430 ("pti overlap after fin %#lx %#lx %#lx",
10432 KASSERT(*pte == ptev,
10433 ("pti non-identical pte after fin %#lx %#lx %#lx",
10437 pde = pmap_pti_pde(sva);
10438 pmap_pti_unwire_pde(pde, true);
10444 pmap_pti_add_kva(vm_offset_t sva, vm_offset_t eva, bool exec)
10449 VM_OBJECT_WLOCK(pti_obj);
10450 pmap_pti_add_kva_locked(sva, eva, exec);
10451 VM_OBJECT_WUNLOCK(pti_obj);
10455 pmap_pti_remove_kva(vm_offset_t sva, vm_offset_t eva)
10462 sva = rounddown2(sva, PAGE_SIZE);
10463 MPASS(sva > VM_MAXUSER_ADDRESS);
10464 eva = roundup2(eva, PAGE_SIZE);
10466 VM_OBJECT_WLOCK(pti_obj);
10467 for (va = sva; va < eva; va += PAGE_SIZE) {
10468 pte = pmap_pti_pte(va, NULL);
10469 KASSERT((*pte & X86_PG_V) != 0,
10470 ("invalid pte va %#lx pte %#lx pt %#lx", va,
10471 (u_long)pte, *pte));
10473 pmap_pti_unwire_pte(pte, va);
10475 pmap_invalidate_range(kernel_pmap, sva, eva);
10476 VM_OBJECT_WUNLOCK(pti_obj);
10480 pkru_dup_range(void *ctx __unused, void *data)
10482 struct pmap_pkru_range *node, *new_node;
10484 new_node = uma_zalloc(pmap_pkru_ranges_zone, M_NOWAIT);
10485 if (new_node == NULL)
10488 memcpy(new_node, node, sizeof(*node));
10493 pkru_free_range(void *ctx __unused, void *node)
10496 uma_zfree(pmap_pkru_ranges_zone, node);
10500 pmap_pkru_assign(pmap_t pmap, vm_offset_t sva, vm_offset_t eva, u_int keyidx,
10503 struct pmap_pkru_range *ppr;
10506 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
10507 MPASS(pmap->pm_type == PT_X86);
10508 MPASS((cpu_stdext_feature2 & CPUID_STDEXT2_PKU) != 0);
10509 if ((flags & AMD64_PKRU_EXCL) != 0 &&
10510 !rangeset_check_empty(&pmap->pm_pkru, sva, eva))
10512 ppr = uma_zalloc(pmap_pkru_ranges_zone, M_NOWAIT);
10515 ppr->pkru_keyidx = keyidx;
10516 ppr->pkru_flags = flags & AMD64_PKRU_PERSIST;
10517 error = rangeset_insert(&pmap->pm_pkru, sva, eva, ppr);
10519 uma_zfree(pmap_pkru_ranges_zone, ppr);
10524 pmap_pkru_deassign(pmap_t pmap, vm_offset_t sva, vm_offset_t eva)
10527 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
10528 MPASS(pmap->pm_type == PT_X86);
10529 MPASS((cpu_stdext_feature2 & CPUID_STDEXT2_PKU) != 0);
10530 return (rangeset_remove(&pmap->pm_pkru, sva, eva));
10534 pmap_pkru_deassign_all(pmap_t pmap)
10537 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
10538 if (pmap->pm_type == PT_X86 &&
10539 (cpu_stdext_feature2 & CPUID_STDEXT2_PKU) != 0)
10540 rangeset_remove_all(&pmap->pm_pkru);
10544 pmap_pkru_same(pmap_t pmap, vm_offset_t sva, vm_offset_t eva)
10546 struct pmap_pkru_range *ppr, *prev_ppr;
10549 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
10550 if (pmap->pm_type != PT_X86 ||
10551 (cpu_stdext_feature2 & CPUID_STDEXT2_PKU) == 0 ||
10552 sva >= VM_MAXUSER_ADDRESS)
10554 MPASS(eva <= VM_MAXUSER_ADDRESS);
10555 for (va = sva, prev_ppr = NULL; va < eva;) {
10556 ppr = rangeset_lookup(&pmap->pm_pkru, va);
10557 if ((ppr == NULL) ^ (prev_ppr == NULL))
10563 if (prev_ppr->pkru_keyidx != ppr->pkru_keyidx)
10565 va = ppr->pkru_rs_el.re_end;
10571 pmap_pkru_get(pmap_t pmap, vm_offset_t va)
10573 struct pmap_pkru_range *ppr;
10575 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
10576 if (pmap->pm_type != PT_X86 ||
10577 (cpu_stdext_feature2 & CPUID_STDEXT2_PKU) == 0 ||
10578 va >= VM_MAXUSER_ADDRESS)
10580 ppr = rangeset_lookup(&pmap->pm_pkru, va);
10582 return (X86_PG_PKU(ppr->pkru_keyidx));
10587 pred_pkru_on_remove(void *ctx __unused, void *r)
10589 struct pmap_pkru_range *ppr;
10592 return ((ppr->pkru_flags & AMD64_PKRU_PERSIST) == 0);
10596 pmap_pkru_on_remove(pmap_t pmap, vm_offset_t sva, vm_offset_t eva)
10599 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
10600 if (pmap->pm_type == PT_X86 &&
10601 (cpu_stdext_feature2 & CPUID_STDEXT2_PKU) != 0) {
10602 rangeset_remove_pred(&pmap->pm_pkru, sva, eva,
10603 pred_pkru_on_remove);
10608 pmap_pkru_copy(pmap_t dst_pmap, pmap_t src_pmap)
10611 PMAP_LOCK_ASSERT(dst_pmap, MA_OWNED);
10612 PMAP_LOCK_ASSERT(src_pmap, MA_OWNED);
10613 MPASS(dst_pmap->pm_type == PT_X86);
10614 MPASS(src_pmap->pm_type == PT_X86);
10615 MPASS((cpu_stdext_feature2 & CPUID_STDEXT2_PKU) != 0);
10616 if (src_pmap->pm_pkru.rs_data_ctx == NULL)
10618 return (rangeset_copy(&dst_pmap->pm_pkru, &src_pmap->pm_pkru));
10622 pmap_pkru_update_range(pmap_t pmap, vm_offset_t sva, vm_offset_t eva,
10625 pml4_entry_t *pml4e;
10627 pd_entry_t newpde, ptpaddr, *pde;
10628 pt_entry_t newpte, *ptep, pte;
10629 vm_offset_t va, va_next;
10632 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
10633 MPASS(pmap->pm_type == PT_X86);
10634 MPASS(keyidx <= PMAP_MAX_PKRU_IDX);
10636 for (changed = false, va = sva; va < eva; va = va_next) {
10637 pml4e = pmap_pml4e(pmap, va);
10638 if ((*pml4e & X86_PG_V) == 0) {
10639 va_next = (va + NBPML4) & ~PML4MASK;
10645 pdpe = pmap_pml4e_to_pdpe(pml4e, va);
10646 if ((*pdpe & X86_PG_V) == 0) {
10647 va_next = (va + NBPDP) & ~PDPMASK;
10653 va_next = (va + NBPDR) & ~PDRMASK;
10657 pde = pmap_pdpe_to_pde(pdpe, va);
10662 MPASS((ptpaddr & X86_PG_V) != 0);
10663 if ((ptpaddr & PG_PS) != 0) {
10664 if (va + NBPDR == va_next && eva >= va_next) {
10665 newpde = (ptpaddr & ~X86_PG_PKU_MASK) |
10666 X86_PG_PKU(keyidx);
10667 if (newpde != ptpaddr) {
10672 } else if (!pmap_demote_pde(pmap, pde, va)) {
10680 for (ptep = pmap_pde_to_pte(pde, va); va != va_next;
10681 ptep++, va += PAGE_SIZE) {
10683 if ((pte & X86_PG_V) == 0)
10685 newpte = (pte & ~X86_PG_PKU_MASK) | X86_PG_PKU(keyidx);
10686 if (newpte != pte) {
10693 pmap_invalidate_range(pmap, sva, eva);
10697 pmap_pkru_check_uargs(pmap_t pmap, vm_offset_t sva, vm_offset_t eva,
10698 u_int keyidx, int flags)
10701 if (pmap->pm_type != PT_X86 || keyidx > PMAP_MAX_PKRU_IDX ||
10702 (flags & ~(AMD64_PKRU_PERSIST | AMD64_PKRU_EXCL)) != 0)
10704 if (eva <= sva || eva > VM_MAXUSER_ADDRESS)
10706 if ((cpu_stdext_feature2 & CPUID_STDEXT2_PKU) == 0)
10712 pmap_pkru_set(pmap_t pmap, vm_offset_t sva, vm_offset_t eva, u_int keyidx,
10717 sva = trunc_page(sva);
10718 eva = round_page(eva);
10719 error = pmap_pkru_check_uargs(pmap, sva, eva, keyidx, flags);
10724 error = pmap_pkru_assign(pmap, sva, eva, keyidx, flags);
10726 pmap_pkru_update_range(pmap, sva, eva, keyidx);
10728 if (error != ENOMEM)
10736 pmap_pkru_clear(pmap_t pmap, vm_offset_t sva, vm_offset_t eva)
10740 sva = trunc_page(sva);
10741 eva = round_page(eva);
10742 error = pmap_pkru_check_uargs(pmap, sva, eva, 0, 0);
10747 error = pmap_pkru_deassign(pmap, sva, eva);
10749 pmap_pkru_update_range(pmap, sva, eva, 0);
10751 if (error != ENOMEM)
10759 * Track a range of the kernel's virtual address space that is contiguous
10760 * in various mapping attributes.
10762 struct pmap_kernel_map_range {
10771 sysctl_kmaps_dump(struct sbuf *sb, struct pmap_kernel_map_range *range,
10777 if (eva <= range->sva)
10780 pat_idx = pmap_pat_index(kernel_pmap, range->attrs, true);
10781 for (i = 0; i < PAT_INDEX_SIZE; i++)
10782 if (pat_index[i] == pat_idx)
10786 case PAT_WRITE_BACK:
10789 case PAT_WRITE_THROUGH:
10792 case PAT_UNCACHEABLE:
10798 case PAT_WRITE_PROTECTED:
10801 case PAT_WRITE_COMBINING:
10805 printf("%s: unknown PAT mode %#x for range 0x%016lx-0x%016lx\n",
10806 __func__, pat_idx, range->sva, eva);
10811 sbuf_printf(sb, "0x%016lx-0x%016lx r%c%c%c%c %s %d %d %d\n",
10813 (range->attrs & X86_PG_RW) != 0 ? 'w' : '-',
10814 (range->attrs & pg_nx) != 0 ? '-' : 'x',
10815 (range->attrs & X86_PG_U) != 0 ? 'u' : 's',
10816 (range->attrs & X86_PG_G) != 0 ? 'g' : '-',
10817 mode, range->pdpes, range->pdes, range->ptes);
10819 /* Reset to sentinel value. */
10820 range->sva = la57 ? KV5ADDR(NPML5EPG - 1, NPML4EPG - 1, NPDPEPG - 1,
10821 NPDEPG - 1, NPTEPG - 1) : KV4ADDR(NPML4EPG - 1, NPDPEPG - 1,
10822 NPDEPG - 1, NPTEPG - 1);
10826 * Determine whether the attributes specified by a page table entry match those
10827 * being tracked by the current range. This is not quite as simple as a direct
10828 * flag comparison since some PAT modes have multiple representations.
10831 sysctl_kmaps_match(struct pmap_kernel_map_range *range, pt_entry_t attrs)
10833 pt_entry_t diff, mask;
10835 mask = X86_PG_G | X86_PG_RW | X86_PG_U | X86_PG_PDE_CACHE | pg_nx;
10836 diff = (range->attrs ^ attrs) & mask;
10839 if ((diff & ~X86_PG_PDE_PAT) == 0 &&
10840 pmap_pat_index(kernel_pmap, range->attrs, true) ==
10841 pmap_pat_index(kernel_pmap, attrs, true))
10847 sysctl_kmaps_reinit(struct pmap_kernel_map_range *range, vm_offset_t va,
10851 memset(range, 0, sizeof(*range));
10853 range->attrs = attrs;
10857 * Given a leaf PTE, derive the mapping's attributes. If they do not match
10858 * those of the current run, dump the address range and its attributes, and
10862 sysctl_kmaps_check(struct sbuf *sb, struct pmap_kernel_map_range *range,
10863 vm_offset_t va, pml4_entry_t pml4e, pdp_entry_t pdpe, pd_entry_t pde,
10868 attrs = pml4e & (X86_PG_RW | X86_PG_U | pg_nx);
10870 attrs |= pdpe & pg_nx;
10871 attrs &= pg_nx | (pdpe & (X86_PG_RW | X86_PG_U));
10872 if ((pdpe & PG_PS) != 0) {
10873 attrs |= pdpe & (X86_PG_G | X86_PG_PDE_CACHE);
10874 } else if (pde != 0) {
10875 attrs |= pde & pg_nx;
10876 attrs &= pg_nx | (pde & (X86_PG_RW | X86_PG_U));
10878 if ((pde & PG_PS) != 0) {
10879 attrs |= pde & (X86_PG_G | X86_PG_PDE_CACHE);
10880 } else if (pte != 0) {
10881 attrs |= pte & pg_nx;
10882 attrs &= pg_nx | (pte & (X86_PG_RW | X86_PG_U));
10883 attrs |= pte & (X86_PG_G | X86_PG_PTE_CACHE);
10885 /* Canonicalize by always using the PDE PAT bit. */
10886 if ((attrs & X86_PG_PTE_PAT) != 0)
10887 attrs ^= X86_PG_PDE_PAT | X86_PG_PTE_PAT;
10890 if (range->sva > va || !sysctl_kmaps_match(range, attrs)) {
10891 sysctl_kmaps_dump(sb, range, va);
10892 sysctl_kmaps_reinit(range, va, attrs);
10897 sysctl_kmaps(SYSCTL_HANDLER_ARGS)
10899 struct pmap_kernel_map_range range;
10900 struct sbuf sbuf, *sb;
10901 pml4_entry_t pml4e;
10902 pdp_entry_t *pdp, pdpe;
10903 pd_entry_t *pd, pde;
10904 pt_entry_t *pt, pte;
10907 int error, i, j, k, l;
10909 error = sysctl_wire_old_buffer(req, 0);
10913 sbuf_new_for_sysctl(sb, NULL, PAGE_SIZE, req);
10915 /* Sentinel value. */
10916 range.sva = la57 ? KV5ADDR(NPML5EPG - 1, NPML4EPG - 1, NPDPEPG - 1,
10917 NPDEPG - 1, NPTEPG - 1) : KV4ADDR(NPML4EPG - 1, NPDPEPG - 1,
10918 NPDEPG - 1, NPTEPG - 1);
10921 * Iterate over the kernel page tables without holding the kernel pmap
10922 * lock. Outside of the large map, kernel page table pages are never
10923 * freed, so at worst we will observe inconsistencies in the output.
10924 * Within the large map, ensure that PDP and PD page addresses are
10925 * valid before descending.
10927 for (sva = 0, i = pmap_pml4e_index(sva); i < NPML4EPG; i++) {
10930 sbuf_printf(sb, "\nRecursive map:\n");
10933 sbuf_printf(sb, "\nDirect map:\n");
10936 sbuf_printf(sb, "\nKernel map:\n");
10939 sbuf_printf(sb, "\nLarge map:\n");
10943 /* Convert to canonical form. */
10944 if (sva == 1ul << 47)
10948 pml4e = kernel_pml4[i];
10949 if ((pml4e & X86_PG_V) == 0) {
10950 sva = rounddown2(sva, NBPML4);
10951 sysctl_kmaps_dump(sb, &range, sva);
10955 pa = pml4e & PG_FRAME;
10956 pdp = (pdp_entry_t *)PHYS_TO_DMAP(pa);
10958 for (j = pmap_pdpe_index(sva); j < NPDPEPG; j++) {
10960 if ((pdpe & X86_PG_V) == 0) {
10961 sva = rounddown2(sva, NBPDP);
10962 sysctl_kmaps_dump(sb, &range, sva);
10966 pa = pdpe & PG_FRAME;
10967 if (PMAP_ADDRESS_IN_LARGEMAP(sva) &&
10968 vm_phys_paddr_to_vm_page(pa) == NULL)
10970 if ((pdpe & PG_PS) != 0) {
10971 sva = rounddown2(sva, NBPDP);
10972 sysctl_kmaps_check(sb, &range, sva, pml4e, pdpe,
10978 pd = (pd_entry_t *)PHYS_TO_DMAP(pa);
10980 for (k = pmap_pde_index(sva); k < NPDEPG; k++) {
10982 if ((pde & X86_PG_V) == 0) {
10983 sva = rounddown2(sva, NBPDR);
10984 sysctl_kmaps_dump(sb, &range, sva);
10988 pa = pde & PG_FRAME;
10989 if (PMAP_ADDRESS_IN_LARGEMAP(sva) &&
10990 vm_phys_paddr_to_vm_page(pa) == NULL)
10992 if ((pde & PG_PS) != 0) {
10993 sva = rounddown2(sva, NBPDR);
10994 sysctl_kmaps_check(sb, &range, sva,
10995 pml4e, pdpe, pde, 0);
11000 pt = (pt_entry_t *)PHYS_TO_DMAP(pa);
11002 for (l = pmap_pte_index(sva); l < NPTEPG; l++,
11003 sva += PAGE_SIZE) {
11005 if ((pte & X86_PG_V) == 0) {
11006 sysctl_kmaps_dump(sb, &range,
11010 sysctl_kmaps_check(sb, &range, sva,
11011 pml4e, pdpe, pde, pte);
11018 error = sbuf_finish(sb);
11022 SYSCTL_OID(_vm_pmap, OID_AUTO, kernel_maps,
11023 CTLTYPE_STRING | CTLFLAG_RD | CTLFLAG_MPSAFE,
11024 NULL, 0, sysctl_kmaps, "A",
11025 "Dump kernel address layout");
11028 DB_SHOW_COMMAND(pte, pmap_print_pte)
11031 pml5_entry_t *pml5;
11032 pml4_entry_t *pml4;
11035 pt_entry_t *pte, PG_V;
11039 db_printf("show pte addr\n");
11042 va = (vm_offset_t)addr;
11044 if (kdb_thread != NULL)
11045 pmap = vmspace_pmap(kdb_thread->td_proc->p_vmspace);
11047 pmap = PCPU_GET(curpmap);
11049 PG_V = pmap_valid_bit(pmap);
11050 db_printf("VA 0x%016lx", va);
11052 if (pmap_is_la57(pmap)) {
11053 pml5 = pmap_pml5e(pmap, va);
11054 db_printf(" pml5e 0x%016lx", *pml5);
11055 if ((*pml5 & PG_V) == 0) {
11059 pml4 = pmap_pml5e_to_pml4e(pml5, va);
11061 pml4 = pmap_pml4e(pmap, va);
11063 db_printf(" pml4e 0x%016lx", *pml4);
11064 if ((*pml4 & PG_V) == 0) {
11068 pdp = pmap_pml4e_to_pdpe(pml4, va);
11069 db_printf(" pdpe 0x%016lx", *pdp);
11070 if ((*pdp & PG_V) == 0 || (*pdp & PG_PS) != 0) {
11074 pde = pmap_pdpe_to_pde(pdp, va);
11075 db_printf(" pde 0x%016lx", *pde);
11076 if ((*pde & PG_V) == 0 || (*pde & PG_PS) != 0) {
11080 pte = pmap_pde_to_pte(pde, va);
11081 db_printf(" pte 0x%016lx\n", *pte);
11084 DB_SHOW_COMMAND(phys2dmap, pmap_phys2dmap)
11089 a = (vm_paddr_t)addr;
11090 db_printf("0x%jx\n", (uintmax_t)PHYS_TO_DMAP(a));
11092 db_printf("show phys2dmap addr\n");
11097 ptpages_show_page(int level, int idx, vm_page_t pg)
11099 db_printf("l %d i %d pg %p phys %#lx ref %x\n",
11100 level, idx, pg, VM_PAGE_TO_PHYS(pg), pg->ref_count);
11104 ptpages_show_complain(int level, int idx, uint64_t pte)
11106 db_printf("l %d i %d pte %#lx\n", level, idx, pte);
11110 ptpages_show_pml4(vm_page_t pg4, int num_entries, uint64_t PG_V)
11112 vm_page_t pg3, pg2, pg1;
11113 pml4_entry_t *pml4;
11118 pml4 = (pml4_entry_t *)PHYS_TO_DMAP(VM_PAGE_TO_PHYS(pg4));
11119 for (i4 = 0; i4 < num_entries; i4++) {
11120 if ((pml4[i4] & PG_V) == 0)
11122 pg3 = PHYS_TO_VM_PAGE(pml4[i4] & PG_FRAME);
11124 ptpages_show_complain(3, i4, pml4[i4]);
11127 ptpages_show_page(3, i4, pg3);
11128 pdp = (pdp_entry_t *)PHYS_TO_DMAP(VM_PAGE_TO_PHYS(pg3));
11129 for (i3 = 0; i3 < NPDPEPG; i3++) {
11130 if ((pdp[i3] & PG_V) == 0)
11132 pg2 = PHYS_TO_VM_PAGE(pdp[i3] & PG_FRAME);
11134 ptpages_show_complain(2, i3, pdp[i3]);
11137 ptpages_show_page(2, i3, pg2);
11138 pd = (pd_entry_t *)PHYS_TO_DMAP(VM_PAGE_TO_PHYS(pg2));
11139 for (i2 = 0; i2 < NPDEPG; i2++) {
11140 if ((pd[i2] & PG_V) == 0)
11142 pg1 = PHYS_TO_VM_PAGE(pd[i2] & PG_FRAME);
11144 ptpages_show_complain(1, i2, pd[i2]);
11147 ptpages_show_page(1, i2, pg1);
11153 DB_SHOW_COMMAND(ptpages, pmap_ptpages)
11157 pml5_entry_t *pml5;
11162 pmap = (pmap_t)addr;
11164 pmap = PCPU_GET(curpmap);
11166 PG_V = pmap_valid_bit(pmap);
11168 if (pmap_is_la57(pmap)) {
11169 pml5 = pmap->pm_pmltop;
11170 for (i5 = 0; i5 < NUPML5E; i5++) {
11171 if ((pml5[i5] & PG_V) == 0)
11173 pg = PHYS_TO_VM_PAGE(pml5[i5] & PG_FRAME);
11175 ptpages_show_complain(4, i5, pml5[i5]);
11178 ptpages_show_page(4, i5, pg);
11179 ptpages_show_pml4(pg, NPML4EPG, PG_V);
11182 ptpages_show_pml4(PHYS_TO_VM_PAGE(DMAP_TO_PHYS(
11183 (vm_offset_t)pmap->pm_pmltop)), NUP4ML4E, PG_V);