2 * Copyright (c) 1991 Regents of the University of California.
4 * Copyright (c) 1994 John S. Dyson
6 * Copyright (c) 1994 David Greenman
8 * Copyright (c) 2003 Peter Wemm
10 * Copyright (c) 2005-2010 Alan L. Cox <alc@cs.rice.edu>
11 * All rights reserved.
13 * This code is derived from software contributed to Berkeley by
14 * the Systems Programming Group of the University of Utah Computer
15 * Science Department and William Jolitz of UUNET Technologies Inc.
17 * Redistribution and use in source and binary forms, with or without
18 * modification, are permitted provided that the following conditions
20 * 1. Redistributions of source code must retain the above copyright
21 * notice, this list of conditions and the following disclaimer.
22 * 2. Redistributions in binary form must reproduce the above copyright
23 * notice, this list of conditions and the following disclaimer in the
24 * documentation and/or other materials provided with the distribution.
25 * 3. All advertising materials mentioning features or use of this software
26 * must display the following acknowledgement:
27 * This product includes software developed by the University of
28 * California, Berkeley and its contributors.
29 * 4. Neither the name of the University nor the names of its contributors
30 * may be used to endorse or promote products derived from this software
31 * without specific prior written permission.
33 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
34 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
35 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
36 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
37 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
38 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
39 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
40 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
41 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
42 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
45 * from: @(#)pmap.c 7.7 (Berkeley) 5/12/91
48 * Copyright (c) 2003 Networks Associates Technology, Inc.
49 * All rights reserved.
51 * This software was developed for the FreeBSD Project by Jake Burkholder,
52 * Safeport Network Services, and Network Associates Laboratories, the
53 * Security Research Division of Network Associates, Inc. under
54 * DARPA/SPAWAR contract N66001-01-C-8035 ("CBOSS"), as part of the DARPA
55 * CHATS research program.
57 * Redistribution and use in source and binary forms, with or without
58 * modification, are permitted provided that the following conditions
60 * 1. Redistributions of source code must retain the above copyright
61 * notice, this list of conditions and the following disclaimer.
62 * 2. Redistributions in binary form must reproduce the above copyright
63 * notice, this list of conditions and the following disclaimer in the
64 * documentation and/or other materials provided with the distribution.
66 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
67 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
68 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
69 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
70 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
71 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
72 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
73 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
74 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
75 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
79 #define AMD64_NPT_AWARE
81 #include <sys/cdefs.h>
82 __FBSDID("$FreeBSD$");
85 * Manages physical address maps.
87 * Since the information managed by this module is
88 * also stored by the logical address mapping module,
89 * this module may throw away valid virtual-to-physical
90 * mappings at almost any time. However, invalidations
91 * of virtual-to-physical mappings must be done as
94 * In order to cope with hardware architectures which
95 * make virtual-to-physical map invalidates expensive,
96 * this module may delay invalidate or reduced protection
97 * operations until such time as they are actually
98 * necessary. This module is given full information as
99 * to which processors are currently using which maps,
100 * and to when physical maps must be made correct.
103 #include "opt_pmap.h"
106 #include <sys/param.h>
108 #include <sys/systm.h>
109 #include <sys/kernel.h>
111 #include <sys/lock.h>
112 #include <sys/malloc.h>
113 #include <sys/mman.h>
114 #include <sys/mutex.h>
115 #include <sys/proc.h>
116 #include <sys/rwlock.h>
118 #include <sys/turnstile.h>
119 #include <sys/vmem.h>
120 #include <sys/vmmeter.h>
121 #include <sys/sched.h>
122 #include <sys/sysctl.h>
126 #include <vm/vm_param.h>
127 #include <vm/vm_kern.h>
128 #include <vm/vm_page.h>
129 #include <vm/vm_map.h>
130 #include <vm/vm_object.h>
131 #include <vm/vm_extern.h>
132 #include <vm/vm_pageout.h>
133 #include <vm/vm_pager.h>
134 #include <vm/vm_phys.h>
135 #include <vm/vm_radix.h>
136 #include <vm/vm_reserv.h>
139 #include <machine/intr_machdep.h>
140 #include <x86/apicvar.h>
141 #include <machine/cpu.h>
142 #include <machine/cputypes.h>
143 #include <machine/md_var.h>
144 #include <machine/pcb.h>
145 #include <machine/specialreg.h>
147 #include <machine/smp.h>
150 static __inline boolean_t
151 pmap_type_guest(pmap_t pmap)
154 return ((pmap->pm_type == PT_EPT) || (pmap->pm_type == PT_RVI));
157 static __inline boolean_t
158 pmap_emulate_ad_bits(pmap_t pmap)
161 return ((pmap->pm_flags & PMAP_EMULATE_AD_BITS) != 0);
164 static __inline pt_entry_t
165 pmap_valid_bit(pmap_t pmap)
169 switch (pmap->pm_type) {
175 if (pmap_emulate_ad_bits(pmap))
176 mask = EPT_PG_EMUL_V;
181 panic("pmap_valid_bit: invalid pm_type %d", pmap->pm_type);
187 static __inline pt_entry_t
188 pmap_rw_bit(pmap_t pmap)
192 switch (pmap->pm_type) {
198 if (pmap_emulate_ad_bits(pmap))
199 mask = EPT_PG_EMUL_RW;
204 panic("pmap_rw_bit: invalid pm_type %d", pmap->pm_type);
210 static __inline pt_entry_t
211 pmap_global_bit(pmap_t pmap)
215 switch (pmap->pm_type) {
224 panic("pmap_global_bit: invalid pm_type %d", pmap->pm_type);
230 static __inline pt_entry_t
231 pmap_accessed_bit(pmap_t pmap)
235 switch (pmap->pm_type) {
241 if (pmap_emulate_ad_bits(pmap))
247 panic("pmap_accessed_bit: invalid pm_type %d", pmap->pm_type);
253 static __inline pt_entry_t
254 pmap_modified_bit(pmap_t pmap)
258 switch (pmap->pm_type) {
264 if (pmap_emulate_ad_bits(pmap))
270 panic("pmap_modified_bit: invalid pm_type %d", pmap->pm_type);
276 extern struct pcpu __pcpu[];
278 #if !defined(DIAGNOSTIC)
279 #ifdef __GNUC_GNU_INLINE__
280 #define PMAP_INLINE __attribute__((__gnu_inline__)) inline
282 #define PMAP_INLINE extern inline
289 #define PV_STAT(x) do { x ; } while (0)
291 #define PV_STAT(x) do { } while (0)
294 #define pa_index(pa) ((pa) >> PDRSHIFT)
295 #define pa_to_pvh(pa) (&pv_table[pa_index(pa)])
297 #define NPV_LIST_LOCKS MAXCPU
299 #define PHYS_TO_PV_LIST_LOCK(pa) \
300 (&pv_list_locks[pa_index(pa) % NPV_LIST_LOCKS])
302 #define CHANGE_PV_LIST_LOCK_TO_PHYS(lockp, pa) do { \
303 struct rwlock **_lockp = (lockp); \
304 struct rwlock *_new_lock; \
306 _new_lock = PHYS_TO_PV_LIST_LOCK(pa); \
307 if (_new_lock != *_lockp) { \
308 if (*_lockp != NULL) \
309 rw_wunlock(*_lockp); \
310 *_lockp = _new_lock; \
315 #define CHANGE_PV_LIST_LOCK_TO_VM_PAGE(lockp, m) \
316 CHANGE_PV_LIST_LOCK_TO_PHYS(lockp, VM_PAGE_TO_PHYS(m))
318 #define RELEASE_PV_LIST_LOCK(lockp) do { \
319 struct rwlock **_lockp = (lockp); \
321 if (*_lockp != NULL) { \
322 rw_wunlock(*_lockp); \
327 #define VM_PAGE_TO_PV_LIST_LOCK(m) \
328 PHYS_TO_PV_LIST_LOCK(VM_PAGE_TO_PHYS(m))
330 struct pmap kernel_pmap_store;
332 vm_offset_t virtual_avail; /* VA of first avail page (after kernel bss) */
333 vm_offset_t virtual_end; /* VA of last avail page (end of kernel AS) */
336 SYSCTL_INT(_machdep, OID_AUTO, nkpt, CTLFLAG_RD, &nkpt, 0,
337 "Number of kernel page table pages allocated on bootup");
340 vm_paddr_t dmaplimit;
341 vm_offset_t kernel_vm_end = VM_MIN_KERNEL_ADDRESS;
344 static SYSCTL_NODE(_vm, OID_AUTO, pmap, CTLFLAG_RD, 0, "VM/pmap parameters");
346 static int pat_works = 1;
347 SYSCTL_INT(_vm_pmap, OID_AUTO, pat_works, CTLFLAG_RD, &pat_works, 1,
348 "Is page attribute table fully functional?");
350 static int pg_ps_enabled = 1;
351 SYSCTL_INT(_vm_pmap, OID_AUTO, pg_ps_enabled, CTLFLAG_RDTUN | CTLFLAG_NOFETCH,
352 &pg_ps_enabled, 0, "Are large page mappings enabled?");
354 #define PAT_INDEX_SIZE 8
355 static int pat_index[PAT_INDEX_SIZE]; /* cache mode to PAT index conversion */
357 static u_int64_t KPTphys; /* phys addr of kernel level 1 */
358 static u_int64_t KPDphys; /* phys addr of kernel level 2 */
359 u_int64_t KPDPphys; /* phys addr of kernel level 3 */
360 u_int64_t KPML4phys; /* phys addr of kernel level 4 */
362 static u_int64_t DMPDphys; /* phys addr of direct mapped level 2 */
363 static u_int64_t DMPDPphys; /* phys addr of direct mapped level 3 */
364 static int ndmpdpphys; /* number of DMPDPphys pages */
367 * pmap_mapdev support pre initialization (i.e. console)
369 #define PMAP_PREINIT_MAPPING_COUNT 8
370 static struct pmap_preinit_mapping {
375 } pmap_preinit_mapping[PMAP_PREINIT_MAPPING_COUNT];
376 static int pmap_initialized;
379 * Data for the pv entry allocation mechanism.
380 * Updates to pv_invl_gen are protected by the pv_list_locks[]
381 * elements, but reads are not.
383 static TAILQ_HEAD(pch, pv_chunk) pv_chunks = TAILQ_HEAD_INITIALIZER(pv_chunks);
384 static struct mtx pv_chunks_mutex;
385 static struct rwlock pv_list_locks[NPV_LIST_LOCKS];
386 static u_long pv_invl_gen[NPV_LIST_LOCKS];
387 static struct md_page *pv_table;
390 * All those kernel PT submaps that BSD is so fond of
392 pt_entry_t *CMAP1 = 0;
394 static vm_offset_t qframe = 0;
395 static struct mtx qframe_mtx;
397 static int pmap_flags = PMAP_PDE_SUPERPAGE; /* flags for x86 pmaps */
399 int pmap_pcid_enabled = 1;
400 SYSCTL_INT(_vm_pmap, OID_AUTO, pcid_enabled, CTLFLAG_RDTUN | CTLFLAG_NOFETCH,
401 &pmap_pcid_enabled, 0, "Is TLB Context ID enabled ?");
402 int invpcid_works = 0;
403 SYSCTL_INT(_vm_pmap, OID_AUTO, invpcid_works, CTLFLAG_RD, &invpcid_works, 0,
404 "Is the invpcid instruction available ?");
407 pmap_pcid_save_cnt_proc(SYSCTL_HANDLER_ARGS)
414 res += cpuid_to_pcpu[i]->pc_pm_save_cnt;
416 return (sysctl_handle_64(oidp, &res, 0, req));
418 SYSCTL_PROC(_vm_pmap, OID_AUTO, pcid_save_cnt, CTLTYPE_U64 | CTLFLAG_RW |
419 CTLFLAG_MPSAFE, NULL, 0, pmap_pcid_save_cnt_proc, "QU",
420 "Count of saved TLB context on switch");
422 static LIST_HEAD(, pmap_invl_gen) pmap_invl_gen_tracker =
423 LIST_HEAD_INITIALIZER(&pmap_invl_gen_tracker);
424 static struct mtx invl_gen_mtx;
425 static u_long pmap_invl_gen = 0;
426 /* Fake lock object to satisfy turnstiles interface. */
427 static struct lock_object invl_gen_ts = {
431 #define PMAP_ASSERT_NOT_IN_DI() \
432 KASSERT(curthread->td_md.md_invl_gen.gen == 0, ("DI already started"))
435 * Start a new Delayed Invalidation (DI) block of code, executed by
436 * the current thread. Within a DI block, the current thread may
437 * destroy both the page table and PV list entries for a mapping and
438 * then release the corresponding PV list lock before ensuring that
439 * the mapping is flushed from the TLBs of any processors with the
443 pmap_delayed_invl_started(void)
445 struct pmap_invl_gen *invl_gen;
448 invl_gen = &curthread->td_md.md_invl_gen;
449 PMAP_ASSERT_NOT_IN_DI();
450 mtx_lock(&invl_gen_mtx);
451 if (LIST_EMPTY(&pmap_invl_gen_tracker))
452 currgen = pmap_invl_gen;
454 currgen = LIST_FIRST(&pmap_invl_gen_tracker)->gen;
455 invl_gen->gen = currgen + 1;
456 LIST_INSERT_HEAD(&pmap_invl_gen_tracker, invl_gen, link);
457 mtx_unlock(&invl_gen_mtx);
461 * Finish the DI block, previously started by the current thread. All
462 * required TLB flushes for the pages marked by
463 * pmap_delayed_invl_page() must be finished before this function is
466 * This function works by bumping the global DI generation number to
467 * the generation number of the current thread's DI, unless there is a
468 * pending DI that started earlier. In the latter case, bumping the
469 * global DI generation number would incorrectly signal that the
470 * earlier DI had finished. Instead, this function bumps the earlier
471 * DI's generation number to match the generation number of the
472 * current thread's DI.
475 pmap_delayed_invl_finished(void)
477 struct pmap_invl_gen *invl_gen, *next;
478 struct turnstile *ts;
480 invl_gen = &curthread->td_md.md_invl_gen;
481 KASSERT(invl_gen->gen != 0, ("missed invl_started"));
482 mtx_lock(&invl_gen_mtx);
483 next = LIST_NEXT(invl_gen, link);
485 turnstile_chain_lock(&invl_gen_ts);
486 ts = turnstile_lookup(&invl_gen_ts);
487 pmap_invl_gen = invl_gen->gen;
489 turnstile_broadcast(ts, TS_SHARED_QUEUE);
490 turnstile_unpend(ts, TS_SHARED_LOCK);
492 turnstile_chain_unlock(&invl_gen_ts);
494 next->gen = invl_gen->gen;
496 LIST_REMOVE(invl_gen, link);
497 mtx_unlock(&invl_gen_mtx);
502 static long invl_wait;
503 SYSCTL_LONG(_vm_pmap, OID_AUTO, invl_wait, CTLFLAG_RD, &invl_wait, 0,
504 "Number of times DI invalidation blocked pmap_remove_all/write");
508 pmap_delayed_invl_genp(vm_page_t m)
511 return (&pv_invl_gen[pa_index(VM_PAGE_TO_PHYS(m)) % NPV_LIST_LOCKS]);
515 * Ensure that all currently executing DI blocks, that need to flush
516 * TLB for the given page m, actually flushed the TLB at the time the
517 * function returned. If the page m has an empty PV list and we call
518 * pmap_delayed_invl_wait(), upon its return we know that no CPU has a
519 * valid mapping for the page m in either its page table or TLB.
521 * This function works by blocking until the global DI generation
522 * number catches up with the generation number associated with the
523 * given page m and its PV list. Since this function's callers
524 * typically own an object lock and sometimes own a page lock, it
525 * cannot sleep. Instead, it blocks on a turnstile to relinquish the
529 pmap_delayed_invl_wait(vm_page_t m)
532 struct turnstile *ts;
535 bool accounted = false;
539 m_gen = pmap_delayed_invl_genp(m);
540 while (*m_gen > pmap_invl_gen) {
543 atomic_add_long(&invl_wait, 1);
547 ts = turnstile_trywait(&invl_gen_ts);
548 if (*m_gen > pmap_invl_gen)
549 turnstile_wait(ts, NULL, TS_SHARED_QUEUE);
551 turnstile_cancel(ts);
556 * Mark the page m's PV list as participating in the current thread's
557 * DI block. Any threads concurrently using m's PV list to remove or
558 * restrict all mappings to m will wait for the current thread's DI
559 * block to complete before proceeding.
561 * The function works by setting the DI generation number for m's PV
562 * list to at least * the number for the current thread. This forces
563 * a caller to pmap_delayed_invl_wait() to spin until current thread
564 * calls pmap_delayed_invl_finished().
567 pmap_delayed_invl_page(vm_page_t m)
571 rw_assert(VM_PAGE_TO_PV_LIST_LOCK(m), RA_WLOCKED);
572 gen = curthread->td_md.md_invl_gen.gen;
575 m_gen = pmap_delayed_invl_genp(m);
583 static caddr_t crashdumpmap;
585 static void free_pv_chunk(struct pv_chunk *pc);
586 static void free_pv_entry(pmap_t pmap, pv_entry_t pv);
587 static pv_entry_t get_pv_entry(pmap_t pmap, struct rwlock **lockp);
588 static int popcnt_pc_map_elem_pq(uint64_t elem);
589 static vm_page_t reclaim_pv_chunk(pmap_t locked_pmap, struct rwlock **lockp);
590 static void reserve_pv_entries(pmap_t pmap, int needed,
591 struct rwlock **lockp);
592 static void pmap_pv_demote_pde(pmap_t pmap, vm_offset_t va, vm_paddr_t pa,
593 struct rwlock **lockp);
594 static boolean_t pmap_pv_insert_pde(pmap_t pmap, vm_offset_t va, vm_paddr_t pa,
595 struct rwlock **lockp);
596 static void pmap_pv_promote_pde(pmap_t pmap, vm_offset_t va, vm_paddr_t pa,
597 struct rwlock **lockp);
598 static void pmap_pvh_free(struct md_page *pvh, pmap_t pmap, vm_offset_t va);
599 static pv_entry_t pmap_pvh_remove(struct md_page *pvh, pmap_t pmap,
602 static int pmap_change_attr_locked(vm_offset_t va, vm_size_t size, int mode);
603 static boolean_t pmap_demote_pde(pmap_t pmap, pd_entry_t *pde, vm_offset_t va);
604 static boolean_t pmap_demote_pde_locked(pmap_t pmap, pd_entry_t *pde,
605 vm_offset_t va, struct rwlock **lockp);
606 static boolean_t pmap_demote_pdpe(pmap_t pmap, pdp_entry_t *pdpe,
608 static boolean_t pmap_enter_pde(pmap_t pmap, vm_offset_t va, vm_page_t m,
609 vm_prot_t prot, struct rwlock **lockp);
610 static vm_page_t pmap_enter_quick_locked(pmap_t pmap, vm_offset_t va,
611 vm_page_t m, vm_prot_t prot, vm_page_t mpte, struct rwlock **lockp);
612 static void pmap_fill_ptp(pt_entry_t *firstpte, pt_entry_t newpte);
613 static int pmap_insert_pt_page(pmap_t pmap, vm_page_t mpte);
614 static void pmap_kenter_attr(vm_offset_t va, vm_paddr_t pa, int mode);
615 static vm_page_t pmap_lookup_pt_page(pmap_t pmap, vm_offset_t va);
616 static void pmap_pde_attr(pd_entry_t *pde, int cache_bits, int mask);
617 static void pmap_promote_pde(pmap_t pmap, pd_entry_t *pde, vm_offset_t va,
618 struct rwlock **lockp);
619 static boolean_t pmap_protect_pde(pmap_t pmap, pd_entry_t *pde, vm_offset_t sva,
621 static void pmap_pte_attr(pt_entry_t *pte, int cache_bits, int mask);
622 static int pmap_remove_pde(pmap_t pmap, pd_entry_t *pdq, vm_offset_t sva,
623 struct spglist *free, struct rwlock **lockp);
624 static int pmap_remove_pte(pmap_t pmap, pt_entry_t *ptq, vm_offset_t sva,
625 pd_entry_t ptepde, struct spglist *free, struct rwlock **lockp);
626 static void pmap_remove_pt_page(pmap_t pmap, vm_page_t mpte);
627 static void pmap_remove_page(pmap_t pmap, vm_offset_t va, pd_entry_t *pde,
628 struct spglist *free);
629 static boolean_t pmap_try_insert_pv_entry(pmap_t pmap, vm_offset_t va,
630 vm_page_t m, struct rwlock **lockp);
631 static void pmap_update_pde(pmap_t pmap, vm_offset_t va, pd_entry_t *pde,
633 static void pmap_update_pde_invalidate(pmap_t, vm_offset_t va, pd_entry_t pde);
635 static vm_page_t _pmap_allocpte(pmap_t pmap, vm_pindex_t ptepindex,
636 struct rwlock **lockp);
637 static vm_page_t pmap_allocpde(pmap_t pmap, vm_offset_t va,
638 struct rwlock **lockp);
639 static vm_page_t pmap_allocpte(pmap_t pmap, vm_offset_t va,
640 struct rwlock **lockp);
642 static void _pmap_unwire_ptp(pmap_t pmap, vm_offset_t va, vm_page_t m,
643 struct spglist *free);
644 static int pmap_unuse_pt(pmap_t, vm_offset_t, pd_entry_t, struct spglist *);
645 static vm_offset_t pmap_kmem_choose(vm_offset_t addr);
648 * Move the kernel virtual free pointer to the next
649 * 2MB. This is used to help improve performance
650 * by using a large (2MB) page for much of the kernel
651 * (.text, .data, .bss)
654 pmap_kmem_choose(vm_offset_t addr)
656 vm_offset_t newaddr = addr;
658 newaddr = roundup2(addr, NBPDR);
662 /********************/
663 /* Inline functions */
664 /********************/
666 /* Return a non-clipped PD index for a given VA */
667 static __inline vm_pindex_t
668 pmap_pde_pindex(vm_offset_t va)
670 return (va >> PDRSHIFT);
674 /* Return various clipped indexes for a given VA */
675 static __inline vm_pindex_t
676 pmap_pte_index(vm_offset_t va)
679 return ((va >> PAGE_SHIFT) & ((1ul << NPTEPGSHIFT) - 1));
682 static __inline vm_pindex_t
683 pmap_pde_index(vm_offset_t va)
686 return ((va >> PDRSHIFT) & ((1ul << NPDEPGSHIFT) - 1));
689 static __inline vm_pindex_t
690 pmap_pdpe_index(vm_offset_t va)
693 return ((va >> PDPSHIFT) & ((1ul << NPDPEPGSHIFT) - 1));
696 static __inline vm_pindex_t
697 pmap_pml4e_index(vm_offset_t va)
700 return ((va >> PML4SHIFT) & ((1ul << NPML4EPGSHIFT) - 1));
703 /* Return a pointer to the PML4 slot that corresponds to a VA */
704 static __inline pml4_entry_t *
705 pmap_pml4e(pmap_t pmap, vm_offset_t va)
708 return (&pmap->pm_pml4[pmap_pml4e_index(va)]);
711 /* Return a pointer to the PDP slot that corresponds to a VA */
712 static __inline pdp_entry_t *
713 pmap_pml4e_to_pdpe(pml4_entry_t *pml4e, vm_offset_t va)
717 pdpe = (pdp_entry_t *)PHYS_TO_DMAP(*pml4e & PG_FRAME);
718 return (&pdpe[pmap_pdpe_index(va)]);
721 /* Return a pointer to the PDP slot that corresponds to a VA */
722 static __inline pdp_entry_t *
723 pmap_pdpe(pmap_t pmap, vm_offset_t va)
728 PG_V = pmap_valid_bit(pmap);
729 pml4e = pmap_pml4e(pmap, va);
730 if ((*pml4e & PG_V) == 0)
732 return (pmap_pml4e_to_pdpe(pml4e, va));
735 /* Return a pointer to the PD slot that corresponds to a VA */
736 static __inline pd_entry_t *
737 pmap_pdpe_to_pde(pdp_entry_t *pdpe, vm_offset_t va)
741 pde = (pd_entry_t *)PHYS_TO_DMAP(*pdpe & PG_FRAME);
742 return (&pde[pmap_pde_index(va)]);
745 /* Return a pointer to the PD slot that corresponds to a VA */
746 static __inline pd_entry_t *
747 pmap_pde(pmap_t pmap, vm_offset_t va)
752 PG_V = pmap_valid_bit(pmap);
753 pdpe = pmap_pdpe(pmap, va);
754 if (pdpe == NULL || (*pdpe & PG_V) == 0)
756 return (pmap_pdpe_to_pde(pdpe, va));
759 /* Return a pointer to the PT slot that corresponds to a VA */
760 static __inline pt_entry_t *
761 pmap_pde_to_pte(pd_entry_t *pde, vm_offset_t va)
765 pte = (pt_entry_t *)PHYS_TO_DMAP(*pde & PG_FRAME);
766 return (&pte[pmap_pte_index(va)]);
769 /* Return a pointer to the PT slot that corresponds to a VA */
770 static __inline pt_entry_t *
771 pmap_pte(pmap_t pmap, vm_offset_t va)
776 PG_V = pmap_valid_bit(pmap);
777 pde = pmap_pde(pmap, va);
778 if (pde == NULL || (*pde & PG_V) == 0)
780 if ((*pde & PG_PS) != 0) /* compat with i386 pmap_pte() */
781 return ((pt_entry_t *)pde);
782 return (pmap_pde_to_pte(pde, va));
786 pmap_resident_count_inc(pmap_t pmap, int count)
789 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
790 pmap->pm_stats.resident_count += count;
794 pmap_resident_count_dec(pmap_t pmap, int count)
797 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
798 KASSERT(pmap->pm_stats.resident_count >= count,
799 ("pmap %p resident count underflow %ld %d", pmap,
800 pmap->pm_stats.resident_count, count));
801 pmap->pm_stats.resident_count -= count;
804 PMAP_INLINE pt_entry_t *
805 vtopte(vm_offset_t va)
807 u_int64_t mask = ((1ul << (NPTEPGSHIFT + NPDEPGSHIFT + NPDPEPGSHIFT + NPML4EPGSHIFT)) - 1);
809 KASSERT(va >= VM_MAXUSER_ADDRESS, ("vtopte on a uva/gpa 0x%0lx", va));
811 return (PTmap + ((va >> PAGE_SHIFT) & mask));
814 static __inline pd_entry_t *
815 vtopde(vm_offset_t va)
817 u_int64_t mask = ((1ul << (NPDEPGSHIFT + NPDPEPGSHIFT + NPML4EPGSHIFT)) - 1);
819 KASSERT(va >= VM_MAXUSER_ADDRESS, ("vtopde on a uva/gpa 0x%0lx", va));
821 return (PDmap + ((va >> PDRSHIFT) & mask));
825 allocpages(vm_paddr_t *firstaddr, int n)
830 bzero((void *)ret, n * PAGE_SIZE);
831 *firstaddr += n * PAGE_SIZE;
835 CTASSERT(powerof2(NDMPML4E));
837 /* number of kernel PDP slots */
838 #define NKPDPE(ptpgs) howmany(ptpgs, NPDEPG)
841 nkpt_init(vm_paddr_t addr)
848 pt_pages = howmany(addr, 1 << PDRSHIFT);
849 pt_pages += NKPDPE(pt_pages);
852 * Add some slop beyond the bare minimum required for bootstrapping
855 * This is quite important when allocating KVA for kernel modules.
856 * The modules are required to be linked in the negative 2GB of
857 * the address space. If we run out of KVA in this region then
858 * pmap_growkernel() will need to allocate page table pages to map
859 * the entire 512GB of KVA space which is an unnecessary tax on
862 * Secondly, device memory mapped as part of setting up the low-
863 * level console(s) is taken from KVA, starting at virtual_avail.
864 * This is because cninit() is called after pmap_bootstrap() but
865 * before vm_init() and pmap_init(). 20MB for a frame buffer is
868 pt_pages += 32; /* 64MB additional slop. */
874 create_pagetables(vm_paddr_t *firstaddr)
876 int i, j, ndm1g, nkpdpe;
882 /* Allocate page table pages for the direct map */
883 ndmpdp = howmany(ptoa(Maxmem), NBPDP);
884 if (ndmpdp < 4) /* Minimum 4GB of dirmap */
886 ndmpdpphys = howmany(ndmpdp, NPDPEPG);
887 if (ndmpdpphys > NDMPML4E) {
889 * Each NDMPML4E allows 512 GB, so limit to that,
890 * and then readjust ndmpdp and ndmpdpphys.
892 printf("NDMPML4E limits system to %d GB\n", NDMPML4E * 512);
893 Maxmem = atop(NDMPML4E * NBPML4);
894 ndmpdpphys = NDMPML4E;
895 ndmpdp = NDMPML4E * NPDEPG;
897 DMPDPphys = allocpages(firstaddr, ndmpdpphys);
899 if ((amd_feature & AMDID_PAGE1GB) != 0)
900 ndm1g = ptoa(Maxmem) >> PDPSHIFT;
902 DMPDphys = allocpages(firstaddr, ndmpdp - ndm1g);
903 dmaplimit = (vm_paddr_t)ndmpdp << PDPSHIFT;
906 KPML4phys = allocpages(firstaddr, 1);
907 KPDPphys = allocpages(firstaddr, NKPML4E);
910 * Allocate the initial number of kernel page table pages required to
911 * bootstrap. We defer this until after all memory-size dependent
912 * allocations are done (e.g. direct map), so that we don't have to
913 * build in too much slop in our estimate.
915 * Note that when NKPML4E > 1, we have an empty page underneath
916 * all but the KPML4I'th one, so we need NKPML4E-1 extra (zeroed)
917 * pages. (pmap_enter requires a PD page to exist for each KPML4E.)
919 nkpt_init(*firstaddr);
920 nkpdpe = NKPDPE(nkpt);
922 KPTphys = allocpages(firstaddr, nkpt);
923 KPDphys = allocpages(firstaddr, nkpdpe);
925 /* Fill in the underlying page table pages */
926 /* Nominally read-only (but really R/W) from zero to physfree */
927 /* XXX not fully used, underneath 2M pages */
928 pt_p = (pt_entry_t *)KPTphys;
929 for (i = 0; ptoa(i) < *firstaddr; i++)
930 pt_p[i] = ptoa(i) | X86_PG_RW | X86_PG_V | X86_PG_G;
932 /* Now map the page tables at their location within PTmap */
933 pd_p = (pd_entry_t *)KPDphys;
934 for (i = 0; i < nkpt; i++)
935 pd_p[i] = (KPTphys + ptoa(i)) | X86_PG_RW | X86_PG_V;
937 /* Map from zero to end of allocations under 2M pages */
938 /* This replaces some of the KPTphys entries above */
939 for (i = 0; (i << PDRSHIFT) < *firstaddr; i++)
940 pd_p[i] = (i << PDRSHIFT) | X86_PG_RW | X86_PG_V | PG_PS |
943 /* And connect up the PD to the PDP (leaving room for L4 pages) */
944 pdp_p = (pdp_entry_t *)(KPDPphys + ptoa(KPML4I - KPML4BASE));
945 for (i = 0; i < nkpdpe; i++)
946 pdp_p[i + KPDPI] = (KPDphys + ptoa(i)) | X86_PG_RW | X86_PG_V |
950 * Now, set up the direct map region using 2MB and/or 1GB pages. If
951 * the end of physical memory is not aligned to a 1GB page boundary,
952 * then the residual physical memory is mapped with 2MB pages. Later,
953 * if pmap_mapdev{_attr}() uses the direct map for non-write-back
954 * memory, pmap_change_attr() will demote any 2MB or 1GB page mappings
955 * that are partially used.
957 pd_p = (pd_entry_t *)DMPDphys;
958 for (i = NPDEPG * ndm1g, j = 0; i < NPDEPG * ndmpdp; i++, j++) {
959 pd_p[j] = (vm_paddr_t)i << PDRSHIFT;
960 /* Preset PG_M and PG_A because demotion expects it. */
961 pd_p[j] |= X86_PG_RW | X86_PG_V | PG_PS | X86_PG_G |
964 pdp_p = (pdp_entry_t *)DMPDPphys;
965 for (i = 0; i < ndm1g; i++) {
966 pdp_p[i] = (vm_paddr_t)i << PDPSHIFT;
967 /* Preset PG_M and PG_A because demotion expects it. */
968 pdp_p[i] |= X86_PG_RW | X86_PG_V | PG_PS | X86_PG_G |
971 for (j = 0; i < ndmpdp; i++, j++) {
972 pdp_p[i] = DMPDphys + ptoa(j);
973 pdp_p[i] |= X86_PG_RW | X86_PG_V | PG_U;
976 /* And recursively map PML4 to itself in order to get PTmap */
977 p4_p = (pml4_entry_t *)KPML4phys;
978 p4_p[PML4PML4I] = KPML4phys;
979 p4_p[PML4PML4I] |= X86_PG_RW | X86_PG_V | PG_U;
981 /* Connect the Direct Map slot(s) up to the PML4. */
982 for (i = 0; i < ndmpdpphys; i++) {
983 p4_p[DMPML4I + i] = DMPDPphys + ptoa(i);
984 p4_p[DMPML4I + i] |= X86_PG_RW | X86_PG_V | PG_U;
987 /* Connect the KVA slots up to the PML4 */
988 for (i = 0; i < NKPML4E; i++) {
989 p4_p[KPML4BASE + i] = KPDPphys + ptoa(i);
990 p4_p[KPML4BASE + i] |= X86_PG_RW | X86_PG_V | PG_U;
995 * Bootstrap the system enough to run with virtual memory.
997 * On amd64 this is called after mapping has already been enabled
998 * and just syncs the pmap module with what has already been done.
999 * [We can't call it easily with mapping off since the kernel is not
1000 * mapped with PA == VA, hence we would have to relocate every address
1001 * from the linked base (virtual) address "KERNBASE" to the actual
1002 * (physical) address starting relative to 0]
1005 pmap_bootstrap(vm_paddr_t *firstaddr)
1012 * Create an initial set of page tables to run the kernel in.
1014 create_pagetables(firstaddr);
1017 * Add a physical memory segment (vm_phys_seg) corresponding to the
1018 * preallocated kernel page table pages so that vm_page structures
1019 * representing these pages will be created. The vm_page structures
1020 * are required for promotion of the corresponding kernel virtual
1021 * addresses to superpage mappings.
1023 vm_phys_add_seg(KPTphys, KPTphys + ptoa(nkpt));
1025 virtual_avail = (vm_offset_t) KERNBASE + *firstaddr;
1026 virtual_avail = pmap_kmem_choose(virtual_avail);
1028 virtual_end = VM_MAX_KERNEL_ADDRESS;
1031 /* XXX do %cr0 as well */
1032 load_cr4(rcr4() | CR4_PGE);
1033 load_cr3(KPML4phys);
1034 if (cpu_stdext_feature & CPUID_STDEXT_SMEP)
1035 load_cr4(rcr4() | CR4_SMEP);
1038 * Initialize the kernel pmap (which is statically allocated).
1040 PMAP_LOCK_INIT(kernel_pmap);
1041 kernel_pmap->pm_pml4 = (pdp_entry_t *)PHYS_TO_DMAP(KPML4phys);
1042 kernel_pmap->pm_cr3 = KPML4phys;
1043 CPU_FILL(&kernel_pmap->pm_active); /* don't allow deactivation */
1044 TAILQ_INIT(&kernel_pmap->pm_pvchunk);
1045 kernel_pmap->pm_flags = pmap_flags;
1048 * Initialize the TLB invalidations generation number lock.
1050 mtx_init(&invl_gen_mtx, "invlgn", NULL, MTX_DEF);
1053 * Reserve some special page table entries/VA space for temporary
1056 #define SYSMAP(c, p, v, n) \
1057 v = (c)va; va += ((n)*PAGE_SIZE); p = pte; pte += (n);
1063 * Crashdump maps. The first page is reused as CMAP1 for the
1066 SYSMAP(caddr_t, CMAP1, crashdumpmap, MAXDUMPPGS)
1067 CADDR1 = crashdumpmap;
1071 /* Initialize the PAT MSR. */
1074 /* Initialize TLB Context Id. */
1075 TUNABLE_INT_FETCH("vm.pmap.pcid_enabled", &pmap_pcid_enabled);
1076 if ((cpu_feature2 & CPUID2_PCID) != 0 && pmap_pcid_enabled) {
1077 /* Check for INVPCID support */
1078 invpcid_works = (cpu_stdext_feature & CPUID_STDEXT_INVPCID)
1080 for (i = 0; i < MAXCPU; i++) {
1081 kernel_pmap->pm_pcids[i].pm_pcid = PMAP_PCID_KERN;
1082 kernel_pmap->pm_pcids[i].pm_gen = 1;
1084 __pcpu[0].pc_pcid_next = PMAP_PCID_KERN + 1;
1085 __pcpu[0].pc_pcid_gen = 1;
1087 * pcpu area for APs is zeroed during AP startup.
1088 * pc_pcid_next and pc_pcid_gen are initialized by AP
1089 * during pcpu setup.
1091 load_cr4(rcr4() | CR4_PCIDE);
1093 pmap_pcid_enabled = 0;
1098 * Setup the PAT MSR.
1103 int pat_table[PAT_INDEX_SIZE];
1108 /* Bail if this CPU doesn't implement PAT. */
1109 if ((cpu_feature & CPUID_PAT) == 0)
1112 /* Set default PAT index table. */
1113 for (i = 0; i < PAT_INDEX_SIZE; i++)
1115 pat_table[PAT_WRITE_BACK] = 0;
1116 pat_table[PAT_WRITE_THROUGH] = 1;
1117 pat_table[PAT_UNCACHEABLE] = 3;
1118 pat_table[PAT_WRITE_COMBINING] = 3;
1119 pat_table[PAT_WRITE_PROTECTED] = 3;
1120 pat_table[PAT_UNCACHED] = 3;
1122 /* Initialize default PAT entries. */
1123 pat_msr = PAT_VALUE(0, PAT_WRITE_BACK) |
1124 PAT_VALUE(1, PAT_WRITE_THROUGH) |
1125 PAT_VALUE(2, PAT_UNCACHED) |
1126 PAT_VALUE(3, PAT_UNCACHEABLE) |
1127 PAT_VALUE(4, PAT_WRITE_BACK) |
1128 PAT_VALUE(5, PAT_WRITE_THROUGH) |
1129 PAT_VALUE(6, PAT_UNCACHED) |
1130 PAT_VALUE(7, PAT_UNCACHEABLE);
1134 * Leave the indices 0-3 at the default of WB, WT, UC-, and UC.
1135 * Program 5 and 6 as WP and WC.
1136 * Leave 4 and 7 as WB and UC.
1138 pat_msr &= ~(PAT_MASK(5) | PAT_MASK(6));
1139 pat_msr |= PAT_VALUE(5, PAT_WRITE_PROTECTED) |
1140 PAT_VALUE(6, PAT_WRITE_COMBINING);
1141 pat_table[PAT_UNCACHED] = 2;
1142 pat_table[PAT_WRITE_PROTECTED] = 5;
1143 pat_table[PAT_WRITE_COMBINING] = 6;
1146 * Just replace PAT Index 2 with WC instead of UC-.
1148 pat_msr &= ~PAT_MASK(2);
1149 pat_msr |= PAT_VALUE(2, PAT_WRITE_COMBINING);
1150 pat_table[PAT_WRITE_COMBINING] = 2;
1155 load_cr4(cr4 & ~CR4_PGE);
1157 /* Disable caches (CD = 1, NW = 0). */
1159 load_cr0((cr0 & ~CR0_NW) | CR0_CD);
1161 /* Flushes caches and TLBs. */
1165 /* Update PAT and index table. */
1166 wrmsr(MSR_PAT, pat_msr);
1167 for (i = 0; i < PAT_INDEX_SIZE; i++)
1168 pat_index[i] = pat_table[i];
1170 /* Flush caches and TLBs again. */
1174 /* Restore caches and PGE. */
1180 * Initialize a vm_page's machine-dependent fields.
1183 pmap_page_init(vm_page_t m)
1186 TAILQ_INIT(&m->md.pv_list);
1187 m->md.pat_mode = PAT_WRITE_BACK;
1191 * Initialize the pmap module.
1192 * Called by vm_init, to initialize any structures that the pmap
1193 * system needs to map virtual memory.
1198 struct pmap_preinit_mapping *ppim;
1201 int error, i, pv_npg;
1204 * Initialize the vm page array entries for the kernel pmap's
1207 for (i = 0; i < nkpt; i++) {
1208 mpte = PHYS_TO_VM_PAGE(KPTphys + (i << PAGE_SHIFT));
1209 KASSERT(mpte >= vm_page_array &&
1210 mpte < &vm_page_array[vm_page_array_size],
1211 ("pmap_init: page table page is out of range"));
1212 mpte->pindex = pmap_pde_pindex(KERNBASE) + i;
1213 mpte->phys_addr = KPTphys + (i << PAGE_SHIFT);
1217 * If the kernel is running on a virtual machine, then it must assume
1218 * that MCA is enabled by the hypervisor. Moreover, the kernel must
1219 * be prepared for the hypervisor changing the vendor and family that
1220 * are reported by CPUID. Consequently, the workaround for AMD Family
1221 * 10h Erratum 383 is enabled if the processor's feature set does not
1222 * include at least one feature that is only supported by older Intel
1223 * or newer AMD processors.
1225 if (vm_guest == VM_GUEST_VM && (cpu_feature & CPUID_SS) == 0 &&
1226 (cpu_feature2 & (CPUID2_SSSE3 | CPUID2_SSE41 | CPUID2_AESNI |
1227 CPUID2_AVX | CPUID2_XSAVE)) == 0 && (amd_feature2 & (AMDID2_XOP |
1229 workaround_erratum383 = 1;
1232 * Are large page mappings enabled?
1234 TUNABLE_INT_FETCH("vm.pmap.pg_ps_enabled", &pg_ps_enabled);
1235 if (pg_ps_enabled) {
1236 KASSERT(MAXPAGESIZES > 1 && pagesizes[1] == 0,
1237 ("pmap_init: can't assign to pagesizes[1]"));
1238 pagesizes[1] = NBPDR;
1242 * Initialize the pv chunk list mutex.
1244 mtx_init(&pv_chunks_mutex, "pmap pv chunk list", NULL, MTX_DEF);
1247 * Initialize the pool of pv list locks.
1249 for (i = 0; i < NPV_LIST_LOCKS; i++)
1250 rw_init(&pv_list_locks[i], "pmap pv list");
1253 * Calculate the size of the pv head table for superpages.
1255 pv_npg = howmany(vm_phys_segs[vm_phys_nsegs - 1].end, NBPDR);
1258 * Allocate memory for the pv head table for superpages.
1260 s = (vm_size_t)(pv_npg * sizeof(struct md_page));
1262 pv_table = (struct md_page *)kmem_malloc(kernel_arena, s,
1264 for (i = 0; i < pv_npg; i++)
1265 TAILQ_INIT(&pv_table[i].pv_list);
1267 pmap_initialized = 1;
1268 for (i = 0; i < PMAP_PREINIT_MAPPING_COUNT; i++) {
1269 ppim = pmap_preinit_mapping + i;
1272 /* Make the direct map consistent */
1273 if (ppim->pa < dmaplimit && ppim->pa + ppim->sz < dmaplimit) {
1274 (void)pmap_change_attr(PHYS_TO_DMAP(ppim->pa),
1275 ppim->sz, ppim->mode);
1279 printf("PPIM %u: PA=%#lx, VA=%#lx, size=%#lx, mode=%#x\n", i,
1280 ppim->pa, ppim->va, ppim->sz, ppim->mode);
1283 mtx_init(&qframe_mtx, "qfrmlk", NULL, MTX_SPIN);
1284 error = vmem_alloc(kernel_arena, PAGE_SIZE, M_BESTFIT | M_WAITOK,
1285 (vmem_addr_t *)&qframe);
1287 panic("qframe allocation failed");
1290 static SYSCTL_NODE(_vm_pmap, OID_AUTO, pde, CTLFLAG_RD, 0,
1291 "2MB page mapping counters");
1293 static u_long pmap_pde_demotions;
1294 SYSCTL_ULONG(_vm_pmap_pde, OID_AUTO, demotions, CTLFLAG_RD,
1295 &pmap_pde_demotions, 0, "2MB page demotions");
1297 static u_long pmap_pde_mappings;
1298 SYSCTL_ULONG(_vm_pmap_pde, OID_AUTO, mappings, CTLFLAG_RD,
1299 &pmap_pde_mappings, 0, "2MB page mappings");
1301 static u_long pmap_pde_p_failures;
1302 SYSCTL_ULONG(_vm_pmap_pde, OID_AUTO, p_failures, CTLFLAG_RD,
1303 &pmap_pde_p_failures, 0, "2MB page promotion failures");
1305 static u_long pmap_pde_promotions;
1306 SYSCTL_ULONG(_vm_pmap_pde, OID_AUTO, promotions, CTLFLAG_RD,
1307 &pmap_pde_promotions, 0, "2MB page promotions");
1309 static SYSCTL_NODE(_vm_pmap, OID_AUTO, pdpe, CTLFLAG_RD, 0,
1310 "1GB page mapping counters");
1312 static u_long pmap_pdpe_demotions;
1313 SYSCTL_ULONG(_vm_pmap_pdpe, OID_AUTO, demotions, CTLFLAG_RD,
1314 &pmap_pdpe_demotions, 0, "1GB page demotions");
1316 /***************************************************
1317 * Low level helper routines.....
1318 ***************************************************/
1321 pmap_swap_pat(pmap_t pmap, pt_entry_t entry)
1323 int x86_pat_bits = X86_PG_PTE_PAT | X86_PG_PDE_PAT;
1325 switch (pmap->pm_type) {
1328 /* Verify that both PAT bits are not set at the same time */
1329 KASSERT((entry & x86_pat_bits) != x86_pat_bits,
1330 ("Invalid PAT bits in entry %#lx", entry));
1332 /* Swap the PAT bits if one of them is set */
1333 if ((entry & x86_pat_bits) != 0)
1334 entry ^= x86_pat_bits;
1338 * Nothing to do - the memory attributes are represented
1339 * the same way for regular pages and superpages.
1343 panic("pmap_switch_pat_bits: bad pm_type %d", pmap->pm_type);
1350 * Determine the appropriate bits to set in a PTE or PDE for a specified
1354 pmap_cache_bits(pmap_t pmap, int mode, boolean_t is_pde)
1356 int cache_bits, pat_flag, pat_idx;
1358 if (mode < 0 || mode >= PAT_INDEX_SIZE || pat_index[mode] < 0)
1359 panic("Unknown caching mode %d\n", mode);
1361 switch (pmap->pm_type) {
1364 /* The PAT bit is different for PTE's and PDE's. */
1365 pat_flag = is_pde ? X86_PG_PDE_PAT : X86_PG_PTE_PAT;
1367 /* Map the caching mode to a PAT index. */
1368 pat_idx = pat_index[mode];
1370 /* Map the 3-bit index value into the PAT, PCD, and PWT bits. */
1373 cache_bits |= pat_flag;
1375 cache_bits |= PG_NC_PCD;
1377 cache_bits |= PG_NC_PWT;
1381 cache_bits = EPT_PG_IGNORE_PAT | EPT_PG_MEMORY_TYPE(mode);
1385 panic("unsupported pmap type %d", pmap->pm_type);
1388 return (cache_bits);
1392 pmap_cache_mask(pmap_t pmap, boolean_t is_pde)
1396 switch (pmap->pm_type) {
1399 mask = is_pde ? X86_PG_PDE_CACHE : X86_PG_PTE_CACHE;
1402 mask = EPT_PG_IGNORE_PAT | EPT_PG_MEMORY_TYPE(0x7);
1405 panic("pmap_cache_mask: invalid pm_type %d", pmap->pm_type);
1411 static __inline boolean_t
1412 pmap_ps_enabled(pmap_t pmap)
1415 return (pg_ps_enabled && (pmap->pm_flags & PMAP_PDE_SUPERPAGE) != 0);
1419 pmap_update_pde_store(pmap_t pmap, pd_entry_t *pde, pd_entry_t newpde)
1422 switch (pmap->pm_type) {
1429 * This is a little bogus since the generation number is
1430 * supposed to be bumped up when a region of the address
1431 * space is invalidated in the page tables.
1433 * In this case the old PDE entry is valid but yet we want
1434 * to make sure that any mappings using the old entry are
1435 * invalidated in the TLB.
1437 * The reason this works as expected is because we rendezvous
1438 * "all" host cpus and force any vcpu context to exit as a
1441 atomic_add_acq_long(&pmap->pm_eptgen, 1);
1444 panic("pmap_update_pde_store: bad pm_type %d", pmap->pm_type);
1446 pde_store(pde, newpde);
1450 * After changing the page size for the specified virtual address in the page
1451 * table, flush the corresponding entries from the processor's TLB. Only the
1452 * calling processor's TLB is affected.
1454 * The calling thread must be pinned to a processor.
1457 pmap_update_pde_invalidate(pmap_t pmap, vm_offset_t va, pd_entry_t newpde)
1461 if (pmap_type_guest(pmap))
1464 KASSERT(pmap->pm_type == PT_X86,
1465 ("pmap_update_pde_invalidate: invalid type %d", pmap->pm_type));
1467 PG_G = pmap_global_bit(pmap);
1469 if ((newpde & PG_PS) == 0)
1470 /* Demotion: flush a specific 2MB page mapping. */
1472 else if ((newpde & PG_G) == 0)
1474 * Promotion: flush every 4KB page mapping from the TLB
1475 * because there are too many to flush individually.
1480 * Promotion: flush every 4KB page mapping from the TLB,
1481 * including any global (PG_G) mappings.
1489 * For SMP, these functions have to use the IPI mechanism for coherence.
1491 * N.B.: Before calling any of the following TLB invalidation functions,
1492 * the calling processor must ensure that all stores updating a non-
1493 * kernel page table are globally performed. Otherwise, another
1494 * processor could cache an old, pre-update entry without being
1495 * invalidated. This can happen one of two ways: (1) The pmap becomes
1496 * active on another processor after its pm_active field is checked by
1497 * one of the following functions but before a store updating the page
1498 * table is globally performed. (2) The pmap becomes active on another
1499 * processor before its pm_active field is checked but due to
1500 * speculative loads one of the following functions stills reads the
1501 * pmap as inactive on the other processor.
1503 * The kernel page table is exempt because its pm_active field is
1504 * immutable. The kernel page table is always active on every
1509 * Interrupt the cpus that are executing in the guest context.
1510 * This will force the vcpu to exit and the cached EPT mappings
1511 * will be invalidated by the host before the next vmresume.
1513 static __inline void
1514 pmap_invalidate_ept(pmap_t pmap)
1519 KASSERT(!CPU_ISSET(curcpu, &pmap->pm_active),
1520 ("pmap_invalidate_ept: absurd pm_active"));
1523 * The TLB mappings associated with a vcpu context are not
1524 * flushed each time a different vcpu is chosen to execute.
1526 * This is in contrast with a process's vtop mappings that
1527 * are flushed from the TLB on each context switch.
1529 * Therefore we need to do more than just a TLB shootdown on
1530 * the active cpus in 'pmap->pm_active'. To do this we keep
1531 * track of the number of invalidations performed on this pmap.
1533 * Each vcpu keeps a cache of this counter and compares it
1534 * just before a vmresume. If the counter is out-of-date an
1535 * invept will be done to flush stale mappings from the TLB.
1537 atomic_add_acq_long(&pmap->pm_eptgen, 1);
1540 * Force the vcpu to exit and trap back into the hypervisor.
1542 ipinum = pmap->pm_flags & PMAP_NESTED_IPIMASK;
1543 ipi_selected(pmap->pm_active, ipinum);
1548 pmap_invalidate_page(pmap_t pmap, vm_offset_t va)
1553 if (pmap_type_guest(pmap)) {
1554 pmap_invalidate_ept(pmap);
1558 KASSERT(pmap->pm_type == PT_X86,
1559 ("pmap_invalidate_page: invalid type %d", pmap->pm_type));
1562 if (pmap == kernel_pmap) {
1566 cpuid = PCPU_GET(cpuid);
1567 if (pmap == PCPU_GET(curpmap))
1569 else if (pmap_pcid_enabled)
1570 pmap->pm_pcids[cpuid].pm_gen = 0;
1571 if (pmap_pcid_enabled) {
1574 pmap->pm_pcids[i].pm_gen = 0;
1577 mask = &pmap->pm_active;
1579 smp_masked_invlpg(*mask, va);
1583 /* 4k PTEs -- Chosen to exceed the total size of Broadwell L2 TLB */
1584 #define PMAP_INVLPG_THRESHOLD (4 * 1024 * PAGE_SIZE)
1587 pmap_invalidate_range(pmap_t pmap, vm_offset_t sva, vm_offset_t eva)
1593 if (eva - sva >= PMAP_INVLPG_THRESHOLD) {
1594 pmap_invalidate_all(pmap);
1598 if (pmap_type_guest(pmap)) {
1599 pmap_invalidate_ept(pmap);
1603 KASSERT(pmap->pm_type == PT_X86,
1604 ("pmap_invalidate_range: invalid type %d", pmap->pm_type));
1607 cpuid = PCPU_GET(cpuid);
1608 if (pmap == kernel_pmap) {
1609 for (addr = sva; addr < eva; addr += PAGE_SIZE)
1613 if (pmap == PCPU_GET(curpmap)) {
1614 for (addr = sva; addr < eva; addr += PAGE_SIZE)
1616 } else if (pmap_pcid_enabled) {
1617 pmap->pm_pcids[cpuid].pm_gen = 0;
1619 if (pmap_pcid_enabled) {
1622 pmap->pm_pcids[i].pm_gen = 0;
1625 mask = &pmap->pm_active;
1627 smp_masked_invlpg_range(*mask, sva, eva);
1632 pmap_invalidate_all(pmap_t pmap)
1635 struct invpcid_descr d;
1638 if (pmap_type_guest(pmap)) {
1639 pmap_invalidate_ept(pmap);
1643 KASSERT(pmap->pm_type == PT_X86,
1644 ("pmap_invalidate_all: invalid type %d", pmap->pm_type));
1647 if (pmap == kernel_pmap) {
1648 if (pmap_pcid_enabled && invpcid_works) {
1649 bzero(&d, sizeof(d));
1650 invpcid(&d, INVPCID_CTXGLOB);
1656 cpuid = PCPU_GET(cpuid);
1657 if (pmap == PCPU_GET(curpmap)) {
1658 if (pmap_pcid_enabled) {
1659 if (invpcid_works) {
1660 d.pcid = pmap->pm_pcids[cpuid].pm_pcid;
1663 invpcid(&d, INVPCID_CTX);
1665 load_cr3(pmap->pm_cr3 | pmap->pm_pcids
1666 [PCPU_GET(cpuid)].pm_pcid);
1671 } else if (pmap_pcid_enabled) {
1672 pmap->pm_pcids[cpuid].pm_gen = 0;
1674 if (pmap_pcid_enabled) {
1677 pmap->pm_pcids[i].pm_gen = 0;
1680 mask = &pmap->pm_active;
1682 smp_masked_invltlb(*mask, pmap);
1687 pmap_invalidate_cache(void)
1697 cpuset_t invalidate; /* processors that invalidate their TLB */
1702 u_int store; /* processor that updates the PDE */
1706 pmap_update_pde_action(void *arg)
1708 struct pde_action *act = arg;
1710 if (act->store == PCPU_GET(cpuid))
1711 pmap_update_pde_store(act->pmap, act->pde, act->newpde);
1715 pmap_update_pde_teardown(void *arg)
1717 struct pde_action *act = arg;
1719 if (CPU_ISSET(PCPU_GET(cpuid), &act->invalidate))
1720 pmap_update_pde_invalidate(act->pmap, act->va, act->newpde);
1724 * Change the page size for the specified virtual address in a way that
1725 * prevents any possibility of the TLB ever having two entries that map the
1726 * same virtual address using different page sizes. This is the recommended
1727 * workaround for Erratum 383 on AMD Family 10h processors. It prevents a
1728 * machine check exception for a TLB state that is improperly diagnosed as a
1732 pmap_update_pde(pmap_t pmap, vm_offset_t va, pd_entry_t *pde, pd_entry_t newpde)
1734 struct pde_action act;
1735 cpuset_t active, other_cpus;
1739 cpuid = PCPU_GET(cpuid);
1740 other_cpus = all_cpus;
1741 CPU_CLR(cpuid, &other_cpus);
1742 if (pmap == kernel_pmap || pmap_type_guest(pmap))
1745 active = pmap->pm_active;
1747 if (CPU_OVERLAP(&active, &other_cpus)) {
1749 act.invalidate = active;
1753 act.newpde = newpde;
1754 CPU_SET(cpuid, &active);
1755 smp_rendezvous_cpus(active,
1756 smp_no_rendevous_barrier, pmap_update_pde_action,
1757 pmap_update_pde_teardown, &act);
1759 pmap_update_pde_store(pmap, pde, newpde);
1760 if (CPU_ISSET(cpuid, &active))
1761 pmap_update_pde_invalidate(pmap, va, newpde);
1767 * Normal, non-SMP, invalidation functions.
1770 pmap_invalidate_page(pmap_t pmap, vm_offset_t va)
1773 if (pmap->pm_type == PT_RVI || pmap->pm_type == PT_EPT) {
1777 KASSERT(pmap->pm_type == PT_X86,
1778 ("pmap_invalidate_range: unknown type %d", pmap->pm_type));
1780 if (pmap == kernel_pmap || pmap == PCPU_GET(curpmap))
1782 else if (pmap_pcid_enabled)
1783 pmap->pm_pcids[0].pm_gen = 0;
1787 pmap_invalidate_range(pmap_t pmap, vm_offset_t sva, vm_offset_t eva)
1791 if (pmap->pm_type == PT_RVI || pmap->pm_type == PT_EPT) {
1795 KASSERT(pmap->pm_type == PT_X86,
1796 ("pmap_invalidate_range: unknown type %d", pmap->pm_type));
1798 if (pmap == kernel_pmap || pmap == PCPU_GET(curpmap)) {
1799 for (addr = sva; addr < eva; addr += PAGE_SIZE)
1801 } else if (pmap_pcid_enabled) {
1802 pmap->pm_pcids[0].pm_gen = 0;
1807 pmap_invalidate_all(pmap_t pmap)
1809 struct invpcid_descr d;
1811 if (pmap->pm_type == PT_RVI || pmap->pm_type == PT_EPT) {
1815 KASSERT(pmap->pm_type == PT_X86,
1816 ("pmap_invalidate_all: unknown type %d", pmap->pm_type));
1818 if (pmap == kernel_pmap) {
1819 if (pmap_pcid_enabled && invpcid_works) {
1820 bzero(&d, sizeof(d));
1821 invpcid(&d, INVPCID_CTXGLOB);
1825 } else if (pmap == PCPU_GET(curpmap)) {
1826 if (pmap_pcid_enabled) {
1827 if (invpcid_works) {
1828 d.pcid = pmap->pm_pcids[0].pm_pcid;
1831 invpcid(&d, INVPCID_CTX);
1833 load_cr3(pmap->pm_cr3 | pmap->pm_pcids[0].
1839 } else if (pmap_pcid_enabled) {
1840 pmap->pm_pcids[0].pm_gen = 0;
1845 pmap_invalidate_cache(void)
1852 pmap_update_pde(pmap_t pmap, vm_offset_t va, pd_entry_t *pde, pd_entry_t newpde)
1855 pmap_update_pde_store(pmap, pde, newpde);
1856 if (pmap == kernel_pmap || pmap == PCPU_GET(curpmap))
1857 pmap_update_pde_invalidate(pmap, va, newpde);
1859 pmap->pm_pcids[0].pm_gen = 0;
1863 #define PMAP_CLFLUSH_THRESHOLD (2 * 1024 * 1024)
1866 pmap_invalidate_cache_range(vm_offset_t sva, vm_offset_t eva, boolean_t force)
1870 sva &= ~(vm_offset_t)cpu_clflush_line_size;
1872 KASSERT((sva & PAGE_MASK) == 0,
1873 ("pmap_invalidate_cache_range: sva not page-aligned"));
1874 KASSERT((eva & PAGE_MASK) == 0,
1875 ("pmap_invalidate_cache_range: eva not page-aligned"));
1878 if ((cpu_feature & CPUID_SS) != 0 && !force)
1879 ; /* If "Self Snoop" is supported and allowed, do nothing. */
1880 else if ((cpu_stdext_feature & CPUID_STDEXT_CLFLUSHOPT) != 0 &&
1881 eva - sva < PMAP_CLFLUSH_THRESHOLD) {
1883 * XXX: Some CPUs fault, hang, or trash the local APIC
1884 * registers if we use CLFLUSH on the local APIC
1885 * range. The local APIC is always uncached, so we
1886 * don't need to flush for that range anyway.
1888 if (pmap_kextract(sva) == lapic_paddr)
1892 * Otherwise, do per-cache line flush. Use the mfence
1893 * instruction to insure that previous stores are
1894 * included in the write-back. The processor
1895 * propagates flush to other processors in the cache
1899 for (; sva < eva; sva += cpu_clflush_line_size)
1902 } else if ((cpu_feature & CPUID_CLFSH) != 0 &&
1903 eva - sva < PMAP_CLFLUSH_THRESHOLD) {
1904 if (pmap_kextract(sva) == lapic_paddr)
1907 * Writes are ordered by CLFLUSH on Intel CPUs.
1909 if (cpu_vendor_id != CPU_VENDOR_INTEL)
1911 for (; sva < eva; sva += cpu_clflush_line_size)
1913 if (cpu_vendor_id != CPU_VENDOR_INTEL)
1918 * No targeted cache flush methods are supported by CPU,
1919 * or the supplied range is bigger than 2MB.
1920 * Globally invalidate cache.
1922 pmap_invalidate_cache();
1927 * Remove the specified set of pages from the data and instruction caches.
1929 * In contrast to pmap_invalidate_cache_range(), this function does not
1930 * rely on the CPU's self-snoop feature, because it is intended for use
1931 * when moving pages into a different cache domain.
1934 pmap_invalidate_cache_pages(vm_page_t *pages, int count)
1936 vm_offset_t daddr, eva;
1940 useclflushopt = (cpu_stdext_feature & CPUID_STDEXT_CLFLUSHOPT) != 0;
1941 if (count >= PMAP_CLFLUSH_THRESHOLD / PAGE_SIZE ||
1942 ((cpu_feature & CPUID_CLFSH) == 0 && !useclflushopt))
1943 pmap_invalidate_cache();
1945 if (useclflushopt || cpu_vendor_id != CPU_VENDOR_INTEL)
1947 for (i = 0; i < count; i++) {
1948 daddr = PHYS_TO_DMAP(VM_PAGE_TO_PHYS(pages[i]));
1949 eva = daddr + PAGE_SIZE;
1950 for (; daddr < eva; daddr += cpu_clflush_line_size) {
1957 if (useclflushopt || cpu_vendor_id != CPU_VENDOR_INTEL)
1963 * Routine: pmap_extract
1965 * Extract the physical page address associated
1966 * with the given map/virtual_address pair.
1969 pmap_extract(pmap_t pmap, vm_offset_t va)
1973 pt_entry_t *pte, PG_V;
1977 PG_V = pmap_valid_bit(pmap);
1979 pdpe = pmap_pdpe(pmap, va);
1980 if (pdpe != NULL && (*pdpe & PG_V) != 0) {
1981 if ((*pdpe & PG_PS) != 0)
1982 pa = (*pdpe & PG_PS_FRAME) | (va & PDPMASK);
1984 pde = pmap_pdpe_to_pde(pdpe, va);
1985 if ((*pde & PG_V) != 0) {
1986 if ((*pde & PG_PS) != 0) {
1987 pa = (*pde & PG_PS_FRAME) |
1990 pte = pmap_pde_to_pte(pde, va);
1991 pa = (*pte & PG_FRAME) |
2002 * Routine: pmap_extract_and_hold
2004 * Atomically extract and hold the physical page
2005 * with the given pmap and virtual address pair
2006 * if that mapping permits the given protection.
2009 pmap_extract_and_hold(pmap_t pmap, vm_offset_t va, vm_prot_t prot)
2011 pd_entry_t pde, *pdep;
2012 pt_entry_t pte, PG_RW, PG_V;
2018 PG_RW = pmap_rw_bit(pmap);
2019 PG_V = pmap_valid_bit(pmap);
2022 pdep = pmap_pde(pmap, va);
2023 if (pdep != NULL && (pde = *pdep)) {
2025 if ((pde & PG_RW) || (prot & VM_PROT_WRITE) == 0) {
2026 if (vm_page_pa_tryrelock(pmap, (pde &
2027 PG_PS_FRAME) | (va & PDRMASK), &pa))
2029 m = PHYS_TO_VM_PAGE((pde & PG_PS_FRAME) |
2034 pte = *pmap_pde_to_pte(pdep, va);
2036 ((pte & PG_RW) || (prot & VM_PROT_WRITE) == 0)) {
2037 if (vm_page_pa_tryrelock(pmap, pte & PG_FRAME,
2040 m = PHYS_TO_VM_PAGE(pte & PG_FRAME);
2051 pmap_kextract(vm_offset_t va)
2056 if (va >= DMAP_MIN_ADDRESS && va < DMAP_MAX_ADDRESS) {
2057 pa = DMAP_TO_PHYS(va);
2061 pa = (pde & PG_PS_FRAME) | (va & PDRMASK);
2064 * Beware of a concurrent promotion that changes the
2065 * PDE at this point! For example, vtopte() must not
2066 * be used to access the PTE because it would use the
2067 * new PDE. It is, however, safe to use the old PDE
2068 * because the page table page is preserved by the
2071 pa = *pmap_pde_to_pte(&pde, va);
2072 pa = (pa & PG_FRAME) | (va & PAGE_MASK);
2078 /***************************************************
2079 * Low level mapping routines.....
2080 ***************************************************/
2083 * Add a wired page to the kva.
2084 * Note: not SMP coherent.
2087 pmap_kenter(vm_offset_t va, vm_paddr_t pa)
2092 pte_store(pte, pa | X86_PG_RW | X86_PG_V | X86_PG_G);
2095 static __inline void
2096 pmap_kenter_attr(vm_offset_t va, vm_paddr_t pa, int mode)
2102 cache_bits = pmap_cache_bits(kernel_pmap, mode, 0);
2103 pte_store(pte, pa | X86_PG_RW | X86_PG_V | X86_PG_G | cache_bits);
2107 * Remove a page from the kernel pagetables.
2108 * Note: not SMP coherent.
2111 pmap_kremove(vm_offset_t va)
2120 * Used to map a range of physical addresses into kernel
2121 * virtual address space.
2123 * The value passed in '*virt' is a suggested virtual address for
2124 * the mapping. Architectures which can support a direct-mapped
2125 * physical to virtual region can return the appropriate address
2126 * within that region, leaving '*virt' unchanged. Other
2127 * architectures should map the pages starting at '*virt' and
2128 * update '*virt' with the first usable address after the mapped
2132 pmap_map(vm_offset_t *virt, vm_paddr_t start, vm_paddr_t end, int prot)
2134 return PHYS_TO_DMAP(start);
2139 * Add a list of wired pages to the kva
2140 * this routine is only used for temporary
2141 * kernel mappings that do not need to have
2142 * page modification or references recorded.
2143 * Note that old mappings are simply written
2144 * over. The page *must* be wired.
2145 * Note: SMP coherent. Uses a ranged shootdown IPI.
2148 pmap_qenter(vm_offset_t sva, vm_page_t *ma, int count)
2150 pt_entry_t *endpte, oldpte, pa, *pte;
2156 endpte = pte + count;
2157 while (pte < endpte) {
2159 cache_bits = pmap_cache_bits(kernel_pmap, m->md.pat_mode, 0);
2160 pa = VM_PAGE_TO_PHYS(m) | cache_bits;
2161 if ((*pte & (PG_FRAME | X86_PG_PTE_CACHE)) != pa) {
2163 pte_store(pte, pa | X86_PG_G | X86_PG_RW | X86_PG_V);
2167 if (__predict_false((oldpte & X86_PG_V) != 0))
2168 pmap_invalidate_range(kernel_pmap, sva, sva + count *
2173 * This routine tears out page mappings from the
2174 * kernel -- it is meant only for temporary mappings.
2175 * Note: SMP coherent. Uses a ranged shootdown IPI.
2178 pmap_qremove(vm_offset_t sva, int count)
2183 while (count-- > 0) {
2184 KASSERT(va >= VM_MIN_KERNEL_ADDRESS, ("usermode va %lx", va));
2188 pmap_invalidate_range(kernel_pmap, sva, va);
2191 /***************************************************
2192 * Page table page management routines.....
2193 ***************************************************/
2194 static __inline void
2195 pmap_free_zero_pages(struct spglist *free)
2199 while ((m = SLIST_FIRST(free)) != NULL) {
2200 SLIST_REMOVE_HEAD(free, plinks.s.ss);
2201 /* Preserve the page's PG_ZERO setting. */
2202 vm_page_free_toq(m);
2207 * Schedule the specified unused page table page to be freed. Specifically,
2208 * add the page to the specified list of pages that will be released to the
2209 * physical memory manager after the TLB has been updated.
2211 static __inline void
2212 pmap_add_delayed_free_list(vm_page_t m, struct spglist *free,
2213 boolean_t set_PG_ZERO)
2217 m->flags |= PG_ZERO;
2219 m->flags &= ~PG_ZERO;
2220 SLIST_INSERT_HEAD(free, m, plinks.s.ss);
2224 * Inserts the specified page table page into the specified pmap's collection
2225 * of idle page table pages. Each of a pmap's page table pages is responsible
2226 * for mapping a distinct range of virtual addresses. The pmap's collection is
2227 * ordered by this virtual address range.
2230 pmap_insert_pt_page(pmap_t pmap, vm_page_t mpte)
2233 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
2234 return (vm_radix_insert(&pmap->pm_root, mpte));
2238 * Looks for a page table page mapping the specified virtual address in the
2239 * specified pmap's collection of idle page table pages. Returns NULL if there
2240 * is no page table page corresponding to the specified virtual address.
2242 static __inline vm_page_t
2243 pmap_lookup_pt_page(pmap_t pmap, vm_offset_t va)
2246 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
2247 return (vm_radix_lookup(&pmap->pm_root, pmap_pde_pindex(va)));
2251 * Removes the specified page table page from the specified pmap's collection
2252 * of idle page table pages. The specified page table page must be a member of
2253 * the pmap's collection.
2255 static __inline void
2256 pmap_remove_pt_page(pmap_t pmap, vm_page_t mpte)
2259 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
2260 vm_radix_remove(&pmap->pm_root, mpte->pindex);
2264 * Decrements a page table page's wire count, which is used to record the
2265 * number of valid page table entries within the page. If the wire count
2266 * drops to zero, then the page table page is unmapped. Returns TRUE if the
2267 * page table page was unmapped and FALSE otherwise.
2269 static inline boolean_t
2270 pmap_unwire_ptp(pmap_t pmap, vm_offset_t va, vm_page_t m, struct spglist *free)
2274 if (m->wire_count == 0) {
2275 _pmap_unwire_ptp(pmap, va, m, free);
2282 _pmap_unwire_ptp(pmap_t pmap, vm_offset_t va, vm_page_t m, struct spglist *free)
2285 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
2287 * unmap the page table page
2289 if (m->pindex >= (NUPDE + NUPDPE)) {
2292 pml4 = pmap_pml4e(pmap, va);
2294 } else if (m->pindex >= NUPDE) {
2297 pdp = pmap_pdpe(pmap, va);
2302 pd = pmap_pde(pmap, va);
2305 pmap_resident_count_dec(pmap, 1);
2306 if (m->pindex < NUPDE) {
2307 /* We just released a PT, unhold the matching PD */
2310 pdpg = PHYS_TO_VM_PAGE(*pmap_pdpe(pmap, va) & PG_FRAME);
2311 pmap_unwire_ptp(pmap, va, pdpg, free);
2313 if (m->pindex >= NUPDE && m->pindex < (NUPDE + NUPDPE)) {
2314 /* We just released a PD, unhold the matching PDP */
2317 pdppg = PHYS_TO_VM_PAGE(*pmap_pml4e(pmap, va) & PG_FRAME);
2318 pmap_unwire_ptp(pmap, va, pdppg, free);
2322 * This is a release store so that the ordinary store unmapping
2323 * the page table page is globally performed before TLB shoot-
2326 atomic_subtract_rel_int(&vm_cnt.v_wire_count, 1);
2329 * Put page on a list so that it is released after
2330 * *ALL* TLB shootdown is done
2332 pmap_add_delayed_free_list(m, free, TRUE);
2336 * After removing a page table entry, this routine is used to
2337 * conditionally free the page, and manage the hold/wire counts.
2340 pmap_unuse_pt(pmap_t pmap, vm_offset_t va, pd_entry_t ptepde,
2341 struct spglist *free)
2345 if (va >= VM_MAXUSER_ADDRESS)
2347 KASSERT(ptepde != 0, ("pmap_unuse_pt: ptepde != 0"));
2348 mpte = PHYS_TO_VM_PAGE(ptepde & PG_FRAME);
2349 return (pmap_unwire_ptp(pmap, va, mpte, free));
2353 pmap_pinit0(pmap_t pmap)
2357 PMAP_LOCK_INIT(pmap);
2358 pmap->pm_pml4 = (pml4_entry_t *)PHYS_TO_DMAP(KPML4phys);
2359 pmap->pm_cr3 = KPML4phys;
2360 pmap->pm_root.rt_root = 0;
2361 CPU_ZERO(&pmap->pm_active);
2362 TAILQ_INIT(&pmap->pm_pvchunk);
2363 bzero(&pmap->pm_stats, sizeof pmap->pm_stats);
2364 pmap->pm_flags = pmap_flags;
2366 pmap->pm_pcids[i].pm_pcid = PMAP_PCID_NONE;
2367 pmap->pm_pcids[i].pm_gen = 0;
2369 PCPU_SET(curpmap, kernel_pmap);
2370 pmap_activate(curthread);
2371 CPU_FILL(&kernel_pmap->pm_active);
2375 * Initialize a preallocated and zeroed pmap structure,
2376 * such as one in a vmspace structure.
2379 pmap_pinit_type(pmap_t pmap, enum pmap_type pm_type, int flags)
2382 vm_paddr_t pml4phys;
2386 * allocate the page directory page
2388 while ((pml4pg = vm_page_alloc(NULL, 0, VM_ALLOC_NORMAL |
2389 VM_ALLOC_NOOBJ | VM_ALLOC_WIRED | VM_ALLOC_ZERO)) == NULL)
2392 pml4phys = VM_PAGE_TO_PHYS(pml4pg);
2393 pmap->pm_pml4 = (pml4_entry_t *)PHYS_TO_DMAP(pml4phys);
2395 pmap->pm_pcids[i].pm_pcid = PMAP_PCID_NONE;
2396 pmap->pm_pcids[i].pm_gen = 0;
2398 pmap->pm_cr3 = ~0; /* initialize to an invalid value */
2400 if ((pml4pg->flags & PG_ZERO) == 0)
2401 pagezero(pmap->pm_pml4);
2404 * Do not install the host kernel mappings in the nested page
2405 * tables. These mappings are meaningless in the guest physical
2408 if ((pmap->pm_type = pm_type) == PT_X86) {
2409 pmap->pm_cr3 = pml4phys;
2411 /* Wire in kernel global address entries. */
2412 for (i = 0; i < NKPML4E; i++) {
2413 pmap->pm_pml4[KPML4BASE + i] = (KPDPphys + ptoa(i)) |
2414 X86_PG_RW | X86_PG_V | PG_U;
2416 for (i = 0; i < ndmpdpphys; i++) {
2417 pmap->pm_pml4[DMPML4I + i] = (DMPDPphys + ptoa(i)) |
2418 X86_PG_RW | X86_PG_V | PG_U;
2421 /* install self-referential address mapping entry(s) */
2422 pmap->pm_pml4[PML4PML4I] = VM_PAGE_TO_PHYS(pml4pg) |
2423 X86_PG_V | X86_PG_RW | X86_PG_A | X86_PG_M;
2426 pmap->pm_root.rt_root = 0;
2427 CPU_ZERO(&pmap->pm_active);
2428 TAILQ_INIT(&pmap->pm_pvchunk);
2429 bzero(&pmap->pm_stats, sizeof pmap->pm_stats);
2430 pmap->pm_flags = flags;
2431 pmap->pm_eptgen = 0;
2437 pmap_pinit(pmap_t pmap)
2440 return (pmap_pinit_type(pmap, PT_X86, pmap_flags));
2444 * This routine is called if the desired page table page does not exist.
2446 * If page table page allocation fails, this routine may sleep before
2447 * returning NULL. It sleeps only if a lock pointer was given.
2449 * Note: If a page allocation fails at page table level two or three,
2450 * one or two pages may be held during the wait, only to be released
2451 * afterwards. This conservative approach is easily argued to avoid
2455 _pmap_allocpte(pmap_t pmap, vm_pindex_t ptepindex, struct rwlock **lockp)
2457 vm_page_t m, pdppg, pdpg;
2458 pt_entry_t PG_A, PG_M, PG_RW, PG_V;
2460 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
2462 PG_A = pmap_accessed_bit(pmap);
2463 PG_M = pmap_modified_bit(pmap);
2464 PG_V = pmap_valid_bit(pmap);
2465 PG_RW = pmap_rw_bit(pmap);
2468 * Allocate a page table page.
2470 if ((m = vm_page_alloc(NULL, ptepindex, VM_ALLOC_NOOBJ |
2471 VM_ALLOC_WIRED | VM_ALLOC_ZERO)) == NULL) {
2472 if (lockp != NULL) {
2473 RELEASE_PV_LIST_LOCK(lockp);
2475 PMAP_ASSERT_NOT_IN_DI();
2481 * Indicate the need to retry. While waiting, the page table
2482 * page may have been allocated.
2486 if ((m->flags & PG_ZERO) == 0)
2490 * Map the pagetable page into the process address space, if
2491 * it isn't already there.
2494 if (ptepindex >= (NUPDE + NUPDPE)) {
2496 vm_pindex_t pml4index;
2498 /* Wire up a new PDPE page */
2499 pml4index = ptepindex - (NUPDE + NUPDPE);
2500 pml4 = &pmap->pm_pml4[pml4index];
2501 *pml4 = VM_PAGE_TO_PHYS(m) | PG_U | PG_RW | PG_V | PG_A | PG_M;
2503 } else if (ptepindex >= NUPDE) {
2504 vm_pindex_t pml4index;
2505 vm_pindex_t pdpindex;
2509 /* Wire up a new PDE page */
2510 pdpindex = ptepindex - NUPDE;
2511 pml4index = pdpindex >> NPML4EPGSHIFT;
2513 pml4 = &pmap->pm_pml4[pml4index];
2514 if ((*pml4 & PG_V) == 0) {
2515 /* Have to allocate a new pdp, recurse */
2516 if (_pmap_allocpte(pmap, NUPDE + NUPDPE + pml4index,
2519 atomic_subtract_int(&vm_cnt.v_wire_count, 1);
2520 vm_page_free_zero(m);
2524 /* Add reference to pdp page */
2525 pdppg = PHYS_TO_VM_PAGE(*pml4 & PG_FRAME);
2526 pdppg->wire_count++;
2528 pdp = (pdp_entry_t *)PHYS_TO_DMAP(*pml4 & PG_FRAME);
2530 /* Now find the pdp page */
2531 pdp = &pdp[pdpindex & ((1ul << NPDPEPGSHIFT) - 1)];
2532 *pdp = VM_PAGE_TO_PHYS(m) | PG_U | PG_RW | PG_V | PG_A | PG_M;
2535 vm_pindex_t pml4index;
2536 vm_pindex_t pdpindex;
2541 /* Wire up a new PTE page */
2542 pdpindex = ptepindex >> NPDPEPGSHIFT;
2543 pml4index = pdpindex >> NPML4EPGSHIFT;
2545 /* First, find the pdp and check that its valid. */
2546 pml4 = &pmap->pm_pml4[pml4index];
2547 if ((*pml4 & PG_V) == 0) {
2548 /* Have to allocate a new pd, recurse */
2549 if (_pmap_allocpte(pmap, NUPDE + pdpindex,
2552 atomic_subtract_int(&vm_cnt.v_wire_count, 1);
2553 vm_page_free_zero(m);
2556 pdp = (pdp_entry_t *)PHYS_TO_DMAP(*pml4 & PG_FRAME);
2557 pdp = &pdp[pdpindex & ((1ul << NPDPEPGSHIFT) - 1)];
2559 pdp = (pdp_entry_t *)PHYS_TO_DMAP(*pml4 & PG_FRAME);
2560 pdp = &pdp[pdpindex & ((1ul << NPDPEPGSHIFT) - 1)];
2561 if ((*pdp & PG_V) == 0) {
2562 /* Have to allocate a new pd, recurse */
2563 if (_pmap_allocpte(pmap, NUPDE + pdpindex,
2566 atomic_subtract_int(&vm_cnt.v_wire_count,
2568 vm_page_free_zero(m);
2572 /* Add reference to the pd page */
2573 pdpg = PHYS_TO_VM_PAGE(*pdp & PG_FRAME);
2577 pd = (pd_entry_t *)PHYS_TO_DMAP(*pdp & PG_FRAME);
2579 /* Now we know where the page directory page is */
2580 pd = &pd[ptepindex & ((1ul << NPDEPGSHIFT) - 1)];
2581 *pd = VM_PAGE_TO_PHYS(m) | PG_U | PG_RW | PG_V | PG_A | PG_M;
2584 pmap_resident_count_inc(pmap, 1);
2590 pmap_allocpde(pmap_t pmap, vm_offset_t va, struct rwlock **lockp)
2592 vm_pindex_t pdpindex, ptepindex;
2593 pdp_entry_t *pdpe, PG_V;
2596 PG_V = pmap_valid_bit(pmap);
2599 pdpe = pmap_pdpe(pmap, va);
2600 if (pdpe != NULL && (*pdpe & PG_V) != 0) {
2601 /* Add a reference to the pd page. */
2602 pdpg = PHYS_TO_VM_PAGE(*pdpe & PG_FRAME);
2605 /* Allocate a pd page. */
2606 ptepindex = pmap_pde_pindex(va);
2607 pdpindex = ptepindex >> NPDPEPGSHIFT;
2608 pdpg = _pmap_allocpte(pmap, NUPDE + pdpindex, lockp);
2609 if (pdpg == NULL && lockp != NULL)
2616 pmap_allocpte(pmap_t pmap, vm_offset_t va, struct rwlock **lockp)
2618 vm_pindex_t ptepindex;
2619 pd_entry_t *pd, PG_V;
2622 PG_V = pmap_valid_bit(pmap);
2625 * Calculate pagetable page index
2627 ptepindex = pmap_pde_pindex(va);
2630 * Get the page directory entry
2632 pd = pmap_pde(pmap, va);
2635 * This supports switching from a 2MB page to a
2638 if (pd != NULL && (*pd & (PG_PS | PG_V)) == (PG_PS | PG_V)) {
2639 if (!pmap_demote_pde_locked(pmap, pd, va, lockp)) {
2641 * Invalidation of the 2MB page mapping may have caused
2642 * the deallocation of the underlying PD page.
2649 * If the page table page is mapped, we just increment the
2650 * hold count, and activate it.
2652 if (pd != NULL && (*pd & PG_V) != 0) {
2653 m = PHYS_TO_VM_PAGE(*pd & PG_FRAME);
2657 * Here if the pte page isn't mapped, or if it has been
2660 m = _pmap_allocpte(pmap, ptepindex, lockp);
2661 if (m == NULL && lockp != NULL)
2668 /***************************************************
2669 * Pmap allocation/deallocation routines.
2670 ***************************************************/
2673 * Release any resources held by the given physical map.
2674 * Called when a pmap initialized by pmap_pinit is being released.
2675 * Should only be called if the map contains no valid mappings.
2678 pmap_release(pmap_t pmap)
2683 KASSERT(pmap->pm_stats.resident_count == 0,
2684 ("pmap_release: pmap resident count %ld != 0",
2685 pmap->pm_stats.resident_count));
2686 KASSERT(vm_radix_is_empty(&pmap->pm_root),
2687 ("pmap_release: pmap has reserved page table page(s)"));
2688 KASSERT(CPU_EMPTY(&pmap->pm_active),
2689 ("releasing active pmap %p", pmap));
2691 m = PHYS_TO_VM_PAGE(DMAP_TO_PHYS((vm_offset_t)pmap->pm_pml4));
2693 for (i = 0; i < NKPML4E; i++) /* KVA */
2694 pmap->pm_pml4[KPML4BASE + i] = 0;
2695 for (i = 0; i < ndmpdpphys; i++)/* Direct Map */
2696 pmap->pm_pml4[DMPML4I + i] = 0;
2697 pmap->pm_pml4[PML4PML4I] = 0; /* Recursive Mapping */
2700 atomic_subtract_int(&vm_cnt.v_wire_count, 1);
2701 vm_page_free_zero(m);
2705 kvm_size(SYSCTL_HANDLER_ARGS)
2707 unsigned long ksize = VM_MAX_KERNEL_ADDRESS - VM_MIN_KERNEL_ADDRESS;
2709 return sysctl_handle_long(oidp, &ksize, 0, req);
2711 SYSCTL_PROC(_vm, OID_AUTO, kvm_size, CTLTYPE_LONG|CTLFLAG_RD,
2712 0, 0, kvm_size, "LU", "Size of KVM");
2715 kvm_free(SYSCTL_HANDLER_ARGS)
2717 unsigned long kfree = VM_MAX_KERNEL_ADDRESS - kernel_vm_end;
2719 return sysctl_handle_long(oidp, &kfree, 0, req);
2721 SYSCTL_PROC(_vm, OID_AUTO, kvm_free, CTLTYPE_LONG|CTLFLAG_RD,
2722 0, 0, kvm_free, "LU", "Amount of KVM free");
2725 * grow the number of kernel page table entries, if needed
2728 pmap_growkernel(vm_offset_t addr)
2732 pd_entry_t *pde, newpdir;
2735 mtx_assert(&kernel_map->system_mtx, MA_OWNED);
2738 * Return if "addr" is within the range of kernel page table pages
2739 * that were preallocated during pmap bootstrap. Moreover, leave
2740 * "kernel_vm_end" and the kernel page table as they were.
2742 * The correctness of this action is based on the following
2743 * argument: vm_map_insert() allocates contiguous ranges of the
2744 * kernel virtual address space. It calls this function if a range
2745 * ends after "kernel_vm_end". If the kernel is mapped between
2746 * "kernel_vm_end" and "addr", then the range cannot begin at
2747 * "kernel_vm_end". In fact, its beginning address cannot be less
2748 * than the kernel. Thus, there is no immediate need to allocate
2749 * any new kernel page table pages between "kernel_vm_end" and
2752 if (KERNBASE < addr && addr <= KERNBASE + nkpt * NBPDR)
2755 addr = roundup2(addr, NBPDR);
2756 if (addr - 1 >= kernel_map->max_offset)
2757 addr = kernel_map->max_offset;
2758 while (kernel_vm_end < addr) {
2759 pdpe = pmap_pdpe(kernel_pmap, kernel_vm_end);
2760 if ((*pdpe & X86_PG_V) == 0) {
2761 /* We need a new PDP entry */
2762 nkpg = vm_page_alloc(NULL, kernel_vm_end >> PDPSHIFT,
2763 VM_ALLOC_INTERRUPT | VM_ALLOC_NOOBJ |
2764 VM_ALLOC_WIRED | VM_ALLOC_ZERO);
2766 panic("pmap_growkernel: no memory to grow kernel");
2767 if ((nkpg->flags & PG_ZERO) == 0)
2768 pmap_zero_page(nkpg);
2769 paddr = VM_PAGE_TO_PHYS(nkpg);
2770 *pdpe = (pdp_entry_t)(paddr | X86_PG_V | X86_PG_RW |
2771 X86_PG_A | X86_PG_M);
2772 continue; /* try again */
2774 pde = pmap_pdpe_to_pde(pdpe, kernel_vm_end);
2775 if ((*pde & X86_PG_V) != 0) {
2776 kernel_vm_end = (kernel_vm_end + NBPDR) & ~PDRMASK;
2777 if (kernel_vm_end - 1 >= kernel_map->max_offset) {
2778 kernel_vm_end = kernel_map->max_offset;
2784 nkpg = vm_page_alloc(NULL, pmap_pde_pindex(kernel_vm_end),
2785 VM_ALLOC_INTERRUPT | VM_ALLOC_NOOBJ | VM_ALLOC_WIRED |
2788 panic("pmap_growkernel: no memory to grow kernel");
2789 if ((nkpg->flags & PG_ZERO) == 0)
2790 pmap_zero_page(nkpg);
2791 paddr = VM_PAGE_TO_PHYS(nkpg);
2792 newpdir = paddr | X86_PG_V | X86_PG_RW | X86_PG_A | X86_PG_M;
2793 pde_store(pde, newpdir);
2795 kernel_vm_end = (kernel_vm_end + NBPDR) & ~PDRMASK;
2796 if (kernel_vm_end - 1 >= kernel_map->max_offset) {
2797 kernel_vm_end = kernel_map->max_offset;
2804 /***************************************************
2805 * page management routines.
2806 ***************************************************/
2808 CTASSERT(sizeof(struct pv_chunk) == PAGE_SIZE);
2809 CTASSERT(_NPCM == 3);
2810 CTASSERT(_NPCPV == 168);
2812 static __inline struct pv_chunk *
2813 pv_to_chunk(pv_entry_t pv)
2816 return ((struct pv_chunk *)((uintptr_t)pv & ~(uintptr_t)PAGE_MASK));
2819 #define PV_PMAP(pv) (pv_to_chunk(pv)->pc_pmap)
2821 #define PC_FREE0 0xfffffffffffffffful
2822 #define PC_FREE1 0xfffffffffffffffful
2823 #define PC_FREE2 0x000000fffffffffful
2825 static const uint64_t pc_freemask[_NPCM] = { PC_FREE0, PC_FREE1, PC_FREE2 };
2828 static int pc_chunk_count, pc_chunk_allocs, pc_chunk_frees, pc_chunk_tryfail;
2830 SYSCTL_INT(_vm_pmap, OID_AUTO, pc_chunk_count, CTLFLAG_RD, &pc_chunk_count, 0,
2831 "Current number of pv entry chunks");
2832 SYSCTL_INT(_vm_pmap, OID_AUTO, pc_chunk_allocs, CTLFLAG_RD, &pc_chunk_allocs, 0,
2833 "Current number of pv entry chunks allocated");
2834 SYSCTL_INT(_vm_pmap, OID_AUTO, pc_chunk_frees, CTLFLAG_RD, &pc_chunk_frees, 0,
2835 "Current number of pv entry chunks frees");
2836 SYSCTL_INT(_vm_pmap, OID_AUTO, pc_chunk_tryfail, CTLFLAG_RD, &pc_chunk_tryfail, 0,
2837 "Number of times tried to get a chunk page but failed.");
2839 static long pv_entry_frees, pv_entry_allocs, pv_entry_count;
2840 static int pv_entry_spare;
2842 SYSCTL_LONG(_vm_pmap, OID_AUTO, pv_entry_frees, CTLFLAG_RD, &pv_entry_frees, 0,
2843 "Current number of pv entry frees");
2844 SYSCTL_LONG(_vm_pmap, OID_AUTO, pv_entry_allocs, CTLFLAG_RD, &pv_entry_allocs, 0,
2845 "Current number of pv entry allocs");
2846 SYSCTL_LONG(_vm_pmap, OID_AUTO, pv_entry_count, CTLFLAG_RD, &pv_entry_count, 0,
2847 "Current number of pv entries");
2848 SYSCTL_INT(_vm_pmap, OID_AUTO, pv_entry_spare, CTLFLAG_RD, &pv_entry_spare, 0,
2849 "Current number of spare pv entries");
2853 * We are in a serious low memory condition. Resort to
2854 * drastic measures to free some pages so we can allocate
2855 * another pv entry chunk.
2857 * Returns NULL if PV entries were reclaimed from the specified pmap.
2859 * We do not, however, unmap 2mpages because subsequent accesses will
2860 * allocate per-page pv entries until repromotion occurs, thereby
2861 * exacerbating the shortage of free pv entries.
2864 reclaim_pv_chunk(pmap_t locked_pmap, struct rwlock **lockp)
2866 struct pch new_tail;
2867 struct pv_chunk *pc;
2868 struct md_page *pvh;
2871 pt_entry_t *pte, tpte;
2872 pt_entry_t PG_G, PG_A, PG_M, PG_RW;
2876 struct spglist free;
2878 int bit, field, freed;
2880 PMAP_LOCK_ASSERT(locked_pmap, MA_OWNED);
2881 KASSERT(lockp != NULL, ("reclaim_pv_chunk: lockp is NULL"));
2884 PG_G = PG_A = PG_M = PG_RW = 0;
2886 TAILQ_INIT(&new_tail);
2887 pmap_delayed_invl_started();
2888 mtx_lock(&pv_chunks_mutex);
2889 while ((pc = TAILQ_FIRST(&pv_chunks)) != NULL && SLIST_EMPTY(&free)) {
2890 TAILQ_REMOVE(&pv_chunks, pc, pc_lru);
2891 mtx_unlock(&pv_chunks_mutex);
2892 if (pmap != pc->pc_pmap) {
2894 pmap_invalidate_all(pmap);
2895 if (pmap != locked_pmap)
2898 pmap_delayed_invl_finished();
2899 pmap_delayed_invl_started();
2901 /* Avoid deadlock and lock recursion. */
2902 if (pmap > locked_pmap) {
2903 RELEASE_PV_LIST_LOCK(lockp);
2905 } else if (pmap != locked_pmap &&
2906 !PMAP_TRYLOCK(pmap)) {
2908 TAILQ_INSERT_TAIL(&new_tail, pc, pc_lru);
2909 mtx_lock(&pv_chunks_mutex);
2912 PG_G = pmap_global_bit(pmap);
2913 PG_A = pmap_accessed_bit(pmap);
2914 PG_M = pmap_modified_bit(pmap);
2915 PG_RW = pmap_rw_bit(pmap);
2919 * Destroy every non-wired, 4 KB page mapping in the chunk.
2922 for (field = 0; field < _NPCM; field++) {
2923 for (inuse = ~pc->pc_map[field] & pc_freemask[field];
2924 inuse != 0; inuse &= ~(1UL << bit)) {
2926 pv = &pc->pc_pventry[field * 64 + bit];
2928 pde = pmap_pde(pmap, va);
2929 if ((*pde & PG_PS) != 0)
2931 pte = pmap_pde_to_pte(pde, va);
2932 if ((*pte & PG_W) != 0)
2934 tpte = pte_load_clear(pte);
2935 if ((tpte & PG_G) != 0)
2936 pmap_invalidate_page(pmap, va);
2937 m = PHYS_TO_VM_PAGE(tpte & PG_FRAME);
2938 if ((tpte & (PG_M | PG_RW)) == (PG_M | PG_RW))
2940 if ((tpte & PG_A) != 0)
2941 vm_page_aflag_set(m, PGA_REFERENCED);
2942 CHANGE_PV_LIST_LOCK_TO_VM_PAGE(lockp, m);
2943 TAILQ_REMOVE(&m->md.pv_list, pv, pv_next);
2945 if (TAILQ_EMPTY(&m->md.pv_list) &&
2946 (m->flags & PG_FICTITIOUS) == 0) {
2947 pvh = pa_to_pvh(VM_PAGE_TO_PHYS(m));
2948 if (TAILQ_EMPTY(&pvh->pv_list)) {
2949 vm_page_aflag_clear(m,
2953 pmap_delayed_invl_page(m);
2954 pc->pc_map[field] |= 1UL << bit;
2955 pmap_unuse_pt(pmap, va, *pde, &free);
2960 TAILQ_INSERT_TAIL(&new_tail, pc, pc_lru);
2961 mtx_lock(&pv_chunks_mutex);
2964 /* Every freed mapping is for a 4 KB page. */
2965 pmap_resident_count_dec(pmap, freed);
2966 PV_STAT(atomic_add_long(&pv_entry_frees, freed));
2967 PV_STAT(atomic_add_int(&pv_entry_spare, freed));
2968 PV_STAT(atomic_subtract_long(&pv_entry_count, freed));
2969 TAILQ_REMOVE(&pmap->pm_pvchunk, pc, pc_list);
2970 if (pc->pc_map[0] == PC_FREE0 && pc->pc_map[1] == PC_FREE1 &&
2971 pc->pc_map[2] == PC_FREE2) {
2972 PV_STAT(atomic_subtract_int(&pv_entry_spare, _NPCPV));
2973 PV_STAT(atomic_subtract_int(&pc_chunk_count, 1));
2974 PV_STAT(atomic_add_int(&pc_chunk_frees, 1));
2975 /* Entire chunk is free; return it. */
2976 m_pc = PHYS_TO_VM_PAGE(DMAP_TO_PHYS((vm_offset_t)pc));
2977 dump_drop_page(m_pc->phys_addr);
2978 mtx_lock(&pv_chunks_mutex);
2981 TAILQ_INSERT_HEAD(&pmap->pm_pvchunk, pc, pc_list);
2982 TAILQ_INSERT_TAIL(&new_tail, pc, pc_lru);
2983 mtx_lock(&pv_chunks_mutex);
2984 /* One freed pv entry in locked_pmap is sufficient. */
2985 if (pmap == locked_pmap)
2988 TAILQ_CONCAT(&pv_chunks, &new_tail, pc_lru);
2989 mtx_unlock(&pv_chunks_mutex);
2991 pmap_invalidate_all(pmap);
2992 if (pmap != locked_pmap)
2995 pmap_delayed_invl_finished();
2996 if (m_pc == NULL && !SLIST_EMPTY(&free)) {
2997 m_pc = SLIST_FIRST(&free);
2998 SLIST_REMOVE_HEAD(&free, plinks.s.ss);
2999 /* Recycle a freed page table page. */
3000 m_pc->wire_count = 1;
3001 atomic_add_int(&vm_cnt.v_wire_count, 1);
3003 pmap_free_zero_pages(&free);
3008 * free the pv_entry back to the free list
3011 free_pv_entry(pmap_t pmap, pv_entry_t pv)
3013 struct pv_chunk *pc;
3014 int idx, field, bit;
3016 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
3017 PV_STAT(atomic_add_long(&pv_entry_frees, 1));
3018 PV_STAT(atomic_add_int(&pv_entry_spare, 1));
3019 PV_STAT(atomic_subtract_long(&pv_entry_count, 1));
3020 pc = pv_to_chunk(pv);
3021 idx = pv - &pc->pc_pventry[0];
3024 pc->pc_map[field] |= 1ul << bit;
3025 if (pc->pc_map[0] != PC_FREE0 || pc->pc_map[1] != PC_FREE1 ||
3026 pc->pc_map[2] != PC_FREE2) {
3027 /* 98% of the time, pc is already at the head of the list. */
3028 if (__predict_false(pc != TAILQ_FIRST(&pmap->pm_pvchunk))) {
3029 TAILQ_REMOVE(&pmap->pm_pvchunk, pc, pc_list);
3030 TAILQ_INSERT_HEAD(&pmap->pm_pvchunk, pc, pc_list);
3034 TAILQ_REMOVE(&pmap->pm_pvchunk, pc, pc_list);
3039 free_pv_chunk(struct pv_chunk *pc)
3043 mtx_lock(&pv_chunks_mutex);
3044 TAILQ_REMOVE(&pv_chunks, pc, pc_lru);
3045 mtx_unlock(&pv_chunks_mutex);
3046 PV_STAT(atomic_subtract_int(&pv_entry_spare, _NPCPV));
3047 PV_STAT(atomic_subtract_int(&pc_chunk_count, 1));
3048 PV_STAT(atomic_add_int(&pc_chunk_frees, 1));
3049 /* entire chunk is free, return it */
3050 m = PHYS_TO_VM_PAGE(DMAP_TO_PHYS((vm_offset_t)pc));
3051 dump_drop_page(m->phys_addr);
3052 vm_page_unwire(m, PQ_NONE);
3057 * Returns a new PV entry, allocating a new PV chunk from the system when
3058 * needed. If this PV chunk allocation fails and a PV list lock pointer was
3059 * given, a PV chunk is reclaimed from an arbitrary pmap. Otherwise, NULL is
3062 * The given PV list lock may be released.
3065 get_pv_entry(pmap_t pmap, struct rwlock **lockp)
3069 struct pv_chunk *pc;
3072 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
3073 PV_STAT(atomic_add_long(&pv_entry_allocs, 1));
3075 pc = TAILQ_FIRST(&pmap->pm_pvchunk);
3077 for (field = 0; field < _NPCM; field++) {
3078 if (pc->pc_map[field]) {
3079 bit = bsfq(pc->pc_map[field]);
3083 if (field < _NPCM) {
3084 pv = &pc->pc_pventry[field * 64 + bit];
3085 pc->pc_map[field] &= ~(1ul << bit);
3086 /* If this was the last item, move it to tail */
3087 if (pc->pc_map[0] == 0 && pc->pc_map[1] == 0 &&
3088 pc->pc_map[2] == 0) {
3089 TAILQ_REMOVE(&pmap->pm_pvchunk, pc, pc_list);
3090 TAILQ_INSERT_TAIL(&pmap->pm_pvchunk, pc,
3093 PV_STAT(atomic_add_long(&pv_entry_count, 1));
3094 PV_STAT(atomic_subtract_int(&pv_entry_spare, 1));
3098 /* No free items, allocate another chunk */
3099 m = vm_page_alloc(NULL, 0, VM_ALLOC_NORMAL | VM_ALLOC_NOOBJ |
3102 if (lockp == NULL) {
3103 PV_STAT(pc_chunk_tryfail++);
3106 m = reclaim_pv_chunk(pmap, lockp);
3110 PV_STAT(atomic_add_int(&pc_chunk_count, 1));
3111 PV_STAT(atomic_add_int(&pc_chunk_allocs, 1));
3112 dump_add_page(m->phys_addr);
3113 pc = (void *)PHYS_TO_DMAP(m->phys_addr);
3115 pc->pc_map[0] = PC_FREE0 & ~1ul; /* preallocated bit 0 */
3116 pc->pc_map[1] = PC_FREE1;
3117 pc->pc_map[2] = PC_FREE2;
3118 mtx_lock(&pv_chunks_mutex);
3119 TAILQ_INSERT_TAIL(&pv_chunks, pc, pc_lru);
3120 mtx_unlock(&pv_chunks_mutex);
3121 pv = &pc->pc_pventry[0];
3122 TAILQ_INSERT_HEAD(&pmap->pm_pvchunk, pc, pc_list);
3123 PV_STAT(atomic_add_long(&pv_entry_count, 1));
3124 PV_STAT(atomic_add_int(&pv_entry_spare, _NPCPV - 1));
3129 * Returns the number of one bits within the given PV chunk map element.
3131 * The erratas for Intel processors state that "POPCNT Instruction May
3132 * Take Longer to Execute Than Expected". It is believed that the
3133 * issue is the spurious dependency on the destination register.
3134 * Provide a hint to the register rename logic that the destination
3135 * value is overwritten, by clearing it, as suggested in the
3136 * optimization manual. It should be cheap for unaffected processors
3139 * Reference numbers for erratas are
3140 * 4th Gen Core: HSD146
3141 * 5th Gen Core: BDM85
3142 * 6th Gen Core: SKL029
3145 popcnt_pc_map_elem_pq(uint64_t elem)
3149 __asm __volatile("xorl %k0,%k0;popcntq %1,%0"
3150 : "=&r" (result) : "rm" (elem));
3155 * Ensure that the number of spare PV entries in the specified pmap meets or
3156 * exceeds the given count, "needed".
3158 * The given PV list lock may be released.
3161 reserve_pv_entries(pmap_t pmap, int needed, struct rwlock **lockp)
3163 struct pch new_tail;
3164 struct pv_chunk *pc;
3168 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
3169 KASSERT(lockp != NULL, ("reserve_pv_entries: lockp is NULL"));
3172 * Newly allocated PV chunks must be stored in a private list until
3173 * the required number of PV chunks have been allocated. Otherwise,
3174 * reclaim_pv_chunk() could recycle one of these chunks. In
3175 * contrast, these chunks must be added to the pmap upon allocation.
3177 TAILQ_INIT(&new_tail);
3180 TAILQ_FOREACH(pc, &pmap->pm_pvchunk, pc_list) {
3182 if ((cpu_feature2 & CPUID2_POPCNT) == 0) {
3183 free = bitcount64(pc->pc_map[0]);
3184 free += bitcount64(pc->pc_map[1]);
3185 free += bitcount64(pc->pc_map[2]);
3189 free = popcnt_pc_map_elem_pq(pc->pc_map[0]);
3190 free += popcnt_pc_map_elem_pq(pc->pc_map[1]);
3191 free += popcnt_pc_map_elem_pq(pc->pc_map[2]);
3196 if (avail >= needed)
3199 for (; avail < needed; avail += _NPCPV) {
3200 m = vm_page_alloc(NULL, 0, VM_ALLOC_NORMAL | VM_ALLOC_NOOBJ |
3203 m = reclaim_pv_chunk(pmap, lockp);
3207 PV_STAT(atomic_add_int(&pc_chunk_count, 1));
3208 PV_STAT(atomic_add_int(&pc_chunk_allocs, 1));
3209 dump_add_page(m->phys_addr);
3210 pc = (void *)PHYS_TO_DMAP(m->phys_addr);
3212 pc->pc_map[0] = PC_FREE0;
3213 pc->pc_map[1] = PC_FREE1;
3214 pc->pc_map[2] = PC_FREE2;
3215 TAILQ_INSERT_HEAD(&pmap->pm_pvchunk, pc, pc_list);
3216 TAILQ_INSERT_TAIL(&new_tail, pc, pc_lru);
3217 PV_STAT(atomic_add_int(&pv_entry_spare, _NPCPV));
3219 if (!TAILQ_EMPTY(&new_tail)) {
3220 mtx_lock(&pv_chunks_mutex);
3221 TAILQ_CONCAT(&pv_chunks, &new_tail, pc_lru);
3222 mtx_unlock(&pv_chunks_mutex);
3227 * First find and then remove the pv entry for the specified pmap and virtual
3228 * address from the specified pv list. Returns the pv entry if found and NULL
3229 * otherwise. This operation can be performed on pv lists for either 4KB or
3230 * 2MB page mappings.
3232 static __inline pv_entry_t
3233 pmap_pvh_remove(struct md_page *pvh, pmap_t pmap, vm_offset_t va)
3237 TAILQ_FOREACH(pv, &pvh->pv_list, pv_next) {
3238 if (pmap == PV_PMAP(pv) && va == pv->pv_va) {
3239 TAILQ_REMOVE(&pvh->pv_list, pv, pv_next);
3248 * After demotion from a 2MB page mapping to 512 4KB page mappings,
3249 * destroy the pv entry for the 2MB page mapping and reinstantiate the pv
3250 * entries for each of the 4KB page mappings.
3253 pmap_pv_demote_pde(pmap_t pmap, vm_offset_t va, vm_paddr_t pa,
3254 struct rwlock **lockp)
3256 struct md_page *pvh;
3257 struct pv_chunk *pc;
3259 vm_offset_t va_last;
3263 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
3264 KASSERT((pa & PDRMASK) == 0,
3265 ("pmap_pv_demote_pde: pa is not 2mpage aligned"));
3266 CHANGE_PV_LIST_LOCK_TO_PHYS(lockp, pa);
3269 * Transfer the 2mpage's pv entry for this mapping to the first
3270 * page's pv list. Once this transfer begins, the pv list lock
3271 * must not be released until the last pv entry is reinstantiated.
3273 pvh = pa_to_pvh(pa);
3274 va = trunc_2mpage(va);
3275 pv = pmap_pvh_remove(pvh, pmap, va);
3276 KASSERT(pv != NULL, ("pmap_pv_demote_pde: pv not found"));
3277 m = PHYS_TO_VM_PAGE(pa);
3278 TAILQ_INSERT_TAIL(&m->md.pv_list, pv, pv_next);
3280 /* Instantiate the remaining NPTEPG - 1 pv entries. */
3281 PV_STAT(atomic_add_long(&pv_entry_allocs, NPTEPG - 1));
3282 va_last = va + NBPDR - PAGE_SIZE;
3284 pc = TAILQ_FIRST(&pmap->pm_pvchunk);
3285 KASSERT(pc->pc_map[0] != 0 || pc->pc_map[1] != 0 ||
3286 pc->pc_map[2] != 0, ("pmap_pv_demote_pde: missing spare"));
3287 for (field = 0; field < _NPCM; field++) {
3288 while (pc->pc_map[field]) {
3289 bit = bsfq(pc->pc_map[field]);
3290 pc->pc_map[field] &= ~(1ul << bit);
3291 pv = &pc->pc_pventry[field * 64 + bit];
3295 KASSERT((m->oflags & VPO_UNMANAGED) == 0,
3296 ("pmap_pv_demote_pde: page %p is not managed", m));
3297 TAILQ_INSERT_TAIL(&m->md.pv_list, pv, pv_next);
3303 TAILQ_REMOVE(&pmap->pm_pvchunk, pc, pc_list);
3304 TAILQ_INSERT_TAIL(&pmap->pm_pvchunk, pc, pc_list);
3307 if (pc->pc_map[0] == 0 && pc->pc_map[1] == 0 && pc->pc_map[2] == 0) {
3308 TAILQ_REMOVE(&pmap->pm_pvchunk, pc, pc_list);
3309 TAILQ_INSERT_TAIL(&pmap->pm_pvchunk, pc, pc_list);
3311 PV_STAT(atomic_add_long(&pv_entry_count, NPTEPG - 1));
3312 PV_STAT(atomic_subtract_int(&pv_entry_spare, NPTEPG - 1));
3316 * After promotion from 512 4KB page mappings to a single 2MB page mapping,
3317 * replace the many pv entries for the 4KB page mappings by a single pv entry
3318 * for the 2MB page mapping.
3321 pmap_pv_promote_pde(pmap_t pmap, vm_offset_t va, vm_paddr_t pa,
3322 struct rwlock **lockp)
3324 struct md_page *pvh;
3326 vm_offset_t va_last;
3329 KASSERT((pa & PDRMASK) == 0,
3330 ("pmap_pv_promote_pde: pa is not 2mpage aligned"));
3331 CHANGE_PV_LIST_LOCK_TO_PHYS(lockp, pa);
3334 * Transfer the first page's pv entry for this mapping to the 2mpage's
3335 * pv list. Aside from avoiding the cost of a call to get_pv_entry(),
3336 * a transfer avoids the possibility that get_pv_entry() calls
3337 * reclaim_pv_chunk() and that reclaim_pv_chunk() removes one of the
3338 * mappings that is being promoted.
3340 m = PHYS_TO_VM_PAGE(pa);
3341 va = trunc_2mpage(va);
3342 pv = pmap_pvh_remove(&m->md, pmap, va);
3343 KASSERT(pv != NULL, ("pmap_pv_promote_pde: pv not found"));
3344 pvh = pa_to_pvh(pa);
3345 TAILQ_INSERT_TAIL(&pvh->pv_list, pv, pv_next);
3347 /* Free the remaining NPTEPG - 1 pv entries. */
3348 va_last = va + NBPDR - PAGE_SIZE;
3352 pmap_pvh_free(&m->md, pmap, va);
3353 } while (va < va_last);
3357 * First find and then destroy the pv entry for the specified pmap and virtual
3358 * address. This operation can be performed on pv lists for either 4KB or 2MB
3362 pmap_pvh_free(struct md_page *pvh, pmap_t pmap, vm_offset_t va)
3366 pv = pmap_pvh_remove(pvh, pmap, va);
3367 KASSERT(pv != NULL, ("pmap_pvh_free: pv not found"));
3368 free_pv_entry(pmap, pv);
3372 * Conditionally create the PV entry for a 4KB page mapping if the required
3373 * memory can be allocated without resorting to reclamation.
3376 pmap_try_insert_pv_entry(pmap_t pmap, vm_offset_t va, vm_page_t m,
3377 struct rwlock **lockp)
3381 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
3382 /* Pass NULL instead of the lock pointer to disable reclamation. */
3383 if ((pv = get_pv_entry(pmap, NULL)) != NULL) {
3385 CHANGE_PV_LIST_LOCK_TO_VM_PAGE(lockp, m);
3386 TAILQ_INSERT_TAIL(&m->md.pv_list, pv, pv_next);
3394 * Conditionally create the PV entry for a 2MB page mapping if the required
3395 * memory can be allocated without resorting to reclamation.
3398 pmap_pv_insert_pde(pmap_t pmap, vm_offset_t va, vm_paddr_t pa,
3399 struct rwlock **lockp)
3401 struct md_page *pvh;
3404 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
3405 /* Pass NULL instead of the lock pointer to disable reclamation. */
3406 if ((pv = get_pv_entry(pmap, NULL)) != NULL) {
3408 CHANGE_PV_LIST_LOCK_TO_PHYS(lockp, pa);
3409 pvh = pa_to_pvh(pa);
3410 TAILQ_INSERT_TAIL(&pvh->pv_list, pv, pv_next);
3418 * Fills a page table page with mappings to consecutive physical pages.
3421 pmap_fill_ptp(pt_entry_t *firstpte, pt_entry_t newpte)
3425 for (pte = firstpte; pte < firstpte + NPTEPG; pte++) {
3427 newpte += PAGE_SIZE;
3432 * Tries to demote a 2MB page mapping. If demotion fails, the 2MB page
3433 * mapping is invalidated.
3436 pmap_demote_pde(pmap_t pmap, pd_entry_t *pde, vm_offset_t va)
3438 struct rwlock *lock;
3442 rv = pmap_demote_pde_locked(pmap, pde, va, &lock);
3449 pmap_demote_pde_locked(pmap_t pmap, pd_entry_t *pde, vm_offset_t va,
3450 struct rwlock **lockp)
3452 pd_entry_t newpde, oldpde;
3453 pt_entry_t *firstpte, newpte;
3454 pt_entry_t PG_A, PG_G, PG_M, PG_RW, PG_V;
3457 struct spglist free;
3460 PG_G = pmap_global_bit(pmap);
3461 PG_A = pmap_accessed_bit(pmap);
3462 PG_M = pmap_modified_bit(pmap);
3463 PG_RW = pmap_rw_bit(pmap);
3464 PG_V = pmap_valid_bit(pmap);
3465 PG_PTE_CACHE = pmap_cache_mask(pmap, 0);
3467 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
3469 KASSERT((oldpde & (PG_PS | PG_V)) == (PG_PS | PG_V),
3470 ("pmap_demote_pde: oldpde is missing PG_PS and/or PG_V"));
3471 if ((oldpde & PG_A) != 0 && (mpte = pmap_lookup_pt_page(pmap, va)) !=
3473 pmap_remove_pt_page(pmap, mpte);
3475 KASSERT((oldpde & PG_W) == 0,
3476 ("pmap_demote_pde: page table page for a wired mapping"
3480 * Invalidate the 2MB page mapping and return "failure" if the
3481 * mapping was never accessed or the allocation of the new
3482 * page table page fails. If the 2MB page mapping belongs to
3483 * the direct map region of the kernel's address space, then
3484 * the page allocation request specifies the highest possible
3485 * priority (VM_ALLOC_INTERRUPT). Otherwise, the priority is
3486 * normal. Page table pages are preallocated for every other
3487 * part of the kernel address space, so the direct map region
3488 * is the only part of the kernel address space that must be
3491 if ((oldpde & PG_A) == 0 || (mpte = vm_page_alloc(NULL,
3492 pmap_pde_pindex(va), (va >= DMAP_MIN_ADDRESS && va <
3493 DMAP_MAX_ADDRESS ? VM_ALLOC_INTERRUPT : VM_ALLOC_NORMAL) |
3494 VM_ALLOC_NOOBJ | VM_ALLOC_WIRED)) == NULL) {
3496 pmap_remove_pde(pmap, pde, trunc_2mpage(va), &free,
3498 pmap_invalidate_page(pmap, trunc_2mpage(va));
3499 pmap_free_zero_pages(&free);
3500 CTR2(KTR_PMAP, "pmap_demote_pde: failure for va %#lx"
3501 " in pmap %p", va, pmap);
3504 if (va < VM_MAXUSER_ADDRESS)
3505 pmap_resident_count_inc(pmap, 1);
3507 mptepa = VM_PAGE_TO_PHYS(mpte);
3508 firstpte = (pt_entry_t *)PHYS_TO_DMAP(mptepa);
3509 newpde = mptepa | PG_M | PG_A | (oldpde & PG_U) | PG_RW | PG_V;
3510 KASSERT((oldpde & PG_A) != 0,
3511 ("pmap_demote_pde: oldpde is missing PG_A"));
3512 KASSERT((oldpde & (PG_M | PG_RW)) != PG_RW,
3513 ("pmap_demote_pde: oldpde is missing PG_M"));
3514 newpte = oldpde & ~PG_PS;
3515 newpte = pmap_swap_pat(pmap, newpte);
3518 * If the page table page is new, initialize it.
3520 if (mpte->wire_count == 1) {
3521 mpte->wire_count = NPTEPG;
3522 pmap_fill_ptp(firstpte, newpte);
3524 KASSERT((*firstpte & PG_FRAME) == (newpte & PG_FRAME),
3525 ("pmap_demote_pde: firstpte and newpte map different physical"
3529 * If the mapping has changed attributes, update the page table
3532 if ((*firstpte & PG_PTE_PROMOTE) != (newpte & PG_PTE_PROMOTE))
3533 pmap_fill_ptp(firstpte, newpte);
3536 * The spare PV entries must be reserved prior to demoting the
3537 * mapping, that is, prior to changing the PDE. Otherwise, the state
3538 * of the PDE and the PV lists will be inconsistent, which can result
3539 * in reclaim_pv_chunk() attempting to remove a PV entry from the
3540 * wrong PV list and pmap_pv_demote_pde() failing to find the expected
3541 * PV entry for the 2MB page mapping that is being demoted.
3543 if ((oldpde & PG_MANAGED) != 0)
3544 reserve_pv_entries(pmap, NPTEPG - 1, lockp);
3547 * Demote the mapping. This pmap is locked. The old PDE has
3548 * PG_A set. If the old PDE has PG_RW set, it also has PG_M
3549 * set. Thus, there is no danger of a race with another
3550 * processor changing the setting of PG_A and/or PG_M between
3551 * the read above and the store below.
3553 if (workaround_erratum383)
3554 pmap_update_pde(pmap, va, pde, newpde);
3556 pde_store(pde, newpde);
3559 * Invalidate a stale recursive mapping of the page table page.
3561 if (va >= VM_MAXUSER_ADDRESS)
3562 pmap_invalidate_page(pmap, (vm_offset_t)vtopte(va));
3565 * Demote the PV entry.
3567 if ((oldpde & PG_MANAGED) != 0)
3568 pmap_pv_demote_pde(pmap, va, oldpde & PG_PS_FRAME, lockp);
3570 atomic_add_long(&pmap_pde_demotions, 1);
3571 CTR2(KTR_PMAP, "pmap_demote_pde: success for va %#lx"
3572 " in pmap %p", va, pmap);
3577 * pmap_remove_kernel_pde: Remove a kernel superpage mapping.
3580 pmap_remove_kernel_pde(pmap_t pmap, pd_entry_t *pde, vm_offset_t va)
3586 KASSERT(pmap == kernel_pmap, ("pmap %p is not kernel_pmap", pmap));
3587 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
3588 mpte = pmap_lookup_pt_page(pmap, va);
3590 panic("pmap_remove_kernel_pde: Missing pt page.");
3592 pmap_remove_pt_page(pmap, mpte);
3593 mptepa = VM_PAGE_TO_PHYS(mpte);
3594 newpde = mptepa | X86_PG_M | X86_PG_A | X86_PG_RW | X86_PG_V;
3597 * Initialize the page table page.
3599 pagezero((void *)PHYS_TO_DMAP(mptepa));
3602 * Demote the mapping.
3604 if (workaround_erratum383)
3605 pmap_update_pde(pmap, va, pde, newpde);
3607 pde_store(pde, newpde);
3610 * Invalidate a stale recursive mapping of the page table page.
3612 pmap_invalidate_page(pmap, (vm_offset_t)vtopte(va));
3616 * pmap_remove_pde: do the things to unmap a superpage in a process
3619 pmap_remove_pde(pmap_t pmap, pd_entry_t *pdq, vm_offset_t sva,
3620 struct spglist *free, struct rwlock **lockp)
3622 struct md_page *pvh;
3624 vm_offset_t eva, va;
3626 pt_entry_t PG_G, PG_A, PG_M, PG_RW;
3628 PG_G = pmap_global_bit(pmap);
3629 PG_A = pmap_accessed_bit(pmap);
3630 PG_M = pmap_modified_bit(pmap);
3631 PG_RW = pmap_rw_bit(pmap);
3633 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
3634 KASSERT((sva & PDRMASK) == 0,
3635 ("pmap_remove_pde: sva is not 2mpage aligned"));
3636 oldpde = pte_load_clear(pdq);
3638 pmap->pm_stats.wired_count -= NBPDR / PAGE_SIZE;
3641 * Machines that don't support invlpg, also don't support
3645 pmap_invalidate_page(kernel_pmap, sva);
3646 pmap_resident_count_dec(pmap, NBPDR / PAGE_SIZE);
3647 if (oldpde & PG_MANAGED) {
3648 CHANGE_PV_LIST_LOCK_TO_PHYS(lockp, oldpde & PG_PS_FRAME);
3649 pvh = pa_to_pvh(oldpde & PG_PS_FRAME);
3650 pmap_pvh_free(pvh, pmap, sva);
3652 for (va = sva, m = PHYS_TO_VM_PAGE(oldpde & PG_PS_FRAME);
3653 va < eva; va += PAGE_SIZE, m++) {
3654 if ((oldpde & (PG_M | PG_RW)) == (PG_M | PG_RW))
3657 vm_page_aflag_set(m, PGA_REFERENCED);
3658 if (TAILQ_EMPTY(&m->md.pv_list) &&
3659 TAILQ_EMPTY(&pvh->pv_list))
3660 vm_page_aflag_clear(m, PGA_WRITEABLE);
3661 pmap_delayed_invl_page(m);
3664 if (pmap == kernel_pmap) {
3665 pmap_remove_kernel_pde(pmap, pdq, sva);
3667 mpte = pmap_lookup_pt_page(pmap, sva);
3669 pmap_remove_pt_page(pmap, mpte);
3670 pmap_resident_count_dec(pmap, 1);
3671 KASSERT(mpte->wire_count == NPTEPG,
3672 ("pmap_remove_pde: pte page wire count error"));
3673 mpte->wire_count = 0;
3674 pmap_add_delayed_free_list(mpte, free, FALSE);
3675 atomic_subtract_int(&vm_cnt.v_wire_count, 1);
3678 return (pmap_unuse_pt(pmap, sva, *pmap_pdpe(pmap, sva), free));
3682 * pmap_remove_pte: do the things to unmap a page in a process
3685 pmap_remove_pte(pmap_t pmap, pt_entry_t *ptq, vm_offset_t va,
3686 pd_entry_t ptepde, struct spglist *free, struct rwlock **lockp)
3688 struct md_page *pvh;
3689 pt_entry_t oldpte, PG_A, PG_M, PG_RW;
3692 PG_A = pmap_accessed_bit(pmap);
3693 PG_M = pmap_modified_bit(pmap);
3694 PG_RW = pmap_rw_bit(pmap);
3696 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
3697 oldpte = pte_load_clear(ptq);
3699 pmap->pm_stats.wired_count -= 1;
3700 pmap_resident_count_dec(pmap, 1);
3701 if (oldpte & PG_MANAGED) {
3702 m = PHYS_TO_VM_PAGE(oldpte & PG_FRAME);
3703 if ((oldpte & (PG_M | PG_RW)) == (PG_M | PG_RW))
3706 vm_page_aflag_set(m, PGA_REFERENCED);
3707 CHANGE_PV_LIST_LOCK_TO_VM_PAGE(lockp, m);
3708 pmap_pvh_free(&m->md, pmap, va);
3709 if (TAILQ_EMPTY(&m->md.pv_list) &&
3710 (m->flags & PG_FICTITIOUS) == 0) {
3711 pvh = pa_to_pvh(VM_PAGE_TO_PHYS(m));
3712 if (TAILQ_EMPTY(&pvh->pv_list))
3713 vm_page_aflag_clear(m, PGA_WRITEABLE);
3715 pmap_delayed_invl_page(m);
3717 return (pmap_unuse_pt(pmap, va, ptepde, free));
3721 * Remove a single page from a process address space
3724 pmap_remove_page(pmap_t pmap, vm_offset_t va, pd_entry_t *pde,
3725 struct spglist *free)
3727 struct rwlock *lock;
3728 pt_entry_t *pte, PG_V;
3730 PG_V = pmap_valid_bit(pmap);
3731 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
3732 if ((*pde & PG_V) == 0)
3734 pte = pmap_pde_to_pte(pde, va);
3735 if ((*pte & PG_V) == 0)
3738 pmap_remove_pte(pmap, pte, va, *pde, free, &lock);
3741 pmap_invalidate_page(pmap, va);
3745 * Remove the given range of addresses from the specified map.
3747 * It is assumed that the start and end are properly
3748 * rounded to the page size.
3751 pmap_remove(pmap_t pmap, vm_offset_t sva, vm_offset_t eva)
3753 struct rwlock *lock;
3754 vm_offset_t va, va_next;
3755 pml4_entry_t *pml4e;
3757 pd_entry_t ptpaddr, *pde;
3758 pt_entry_t *pte, PG_G, PG_V;
3759 struct spglist free;
3762 PG_G = pmap_global_bit(pmap);
3763 PG_V = pmap_valid_bit(pmap);
3766 * Perform an unsynchronized read. This is, however, safe.
3768 if (pmap->pm_stats.resident_count == 0)
3774 pmap_delayed_invl_started();
3778 * special handling of removing one page. a very
3779 * common operation and easy to short circuit some
3782 if (sva + PAGE_SIZE == eva) {
3783 pde = pmap_pde(pmap, sva);
3784 if (pde && (*pde & PG_PS) == 0) {
3785 pmap_remove_page(pmap, sva, pde, &free);
3791 for (; sva < eva; sva = va_next) {
3793 if (pmap->pm_stats.resident_count == 0)
3796 pml4e = pmap_pml4e(pmap, sva);
3797 if ((*pml4e & PG_V) == 0) {
3798 va_next = (sva + NBPML4) & ~PML4MASK;
3804 pdpe = pmap_pml4e_to_pdpe(pml4e, sva);
3805 if ((*pdpe & PG_V) == 0) {
3806 va_next = (sva + NBPDP) & ~PDPMASK;
3813 * Calculate index for next page table.
3815 va_next = (sva + NBPDR) & ~PDRMASK;
3819 pde = pmap_pdpe_to_pde(pdpe, sva);
3823 * Weed out invalid mappings.
3829 * Check for large page.
3831 if ((ptpaddr & PG_PS) != 0) {
3833 * Are we removing the entire large page? If not,
3834 * demote the mapping and fall through.
3836 if (sva + NBPDR == va_next && eva >= va_next) {
3838 * The TLB entry for a PG_G mapping is
3839 * invalidated by pmap_remove_pde().
3841 if ((ptpaddr & PG_G) == 0)
3843 pmap_remove_pde(pmap, pde, sva, &free, &lock);
3845 } else if (!pmap_demote_pde_locked(pmap, pde, sva,
3847 /* The large page mapping was destroyed. */
3854 * Limit our scan to either the end of the va represented
3855 * by the current page table page, or to the end of the
3856 * range being removed.
3862 for (pte = pmap_pde_to_pte(pde, sva); sva != va_next; pte++,
3865 if (va != va_next) {
3866 pmap_invalidate_range(pmap, va, sva);
3871 if ((*pte & PG_G) == 0)
3873 else if (va == va_next)
3875 if (pmap_remove_pte(pmap, pte, sva, ptpaddr, &free,
3882 pmap_invalidate_range(pmap, va, sva);
3888 pmap_invalidate_all(pmap);
3890 pmap_delayed_invl_finished();
3891 pmap_free_zero_pages(&free);
3895 * Routine: pmap_remove_all
3897 * Removes this physical page from
3898 * all physical maps in which it resides.
3899 * Reflects back modify bits to the pager.
3902 * Original versions of this routine were very
3903 * inefficient because they iteratively called
3904 * pmap_remove (slow...)
3908 pmap_remove_all(vm_page_t m)
3910 struct md_page *pvh;
3913 struct rwlock *lock;
3914 pt_entry_t *pte, tpte, PG_A, PG_M, PG_RW;
3917 struct spglist free;
3918 int pvh_gen, md_gen;
3920 KASSERT((m->oflags & VPO_UNMANAGED) == 0,
3921 ("pmap_remove_all: page %p is not managed", m));
3923 lock = VM_PAGE_TO_PV_LIST_LOCK(m);
3924 pvh = pa_to_pvh(VM_PAGE_TO_PHYS(m));
3927 if ((m->flags & PG_FICTITIOUS) != 0)
3928 goto small_mappings;
3929 while ((pv = TAILQ_FIRST(&pvh->pv_list)) != NULL) {
3931 if (!PMAP_TRYLOCK(pmap)) {
3932 pvh_gen = pvh->pv_gen;
3936 if (pvh_gen != pvh->pv_gen) {
3943 pde = pmap_pde(pmap, va);
3944 (void)pmap_demote_pde_locked(pmap, pde, va, &lock);
3948 while ((pv = TAILQ_FIRST(&m->md.pv_list)) != NULL) {
3950 if (!PMAP_TRYLOCK(pmap)) {
3951 pvh_gen = pvh->pv_gen;
3952 md_gen = m->md.pv_gen;
3956 if (pvh_gen != pvh->pv_gen || md_gen != m->md.pv_gen) {
3962 PG_A = pmap_accessed_bit(pmap);
3963 PG_M = pmap_modified_bit(pmap);
3964 PG_RW = pmap_rw_bit(pmap);
3965 pmap_resident_count_dec(pmap, 1);
3966 pde = pmap_pde(pmap, pv->pv_va);
3967 KASSERT((*pde & PG_PS) == 0, ("pmap_remove_all: found"
3968 " a 2mpage in page %p's pv list", m));
3969 pte = pmap_pde_to_pte(pde, pv->pv_va);
3970 tpte = pte_load_clear(pte);
3972 pmap->pm_stats.wired_count--;
3974 vm_page_aflag_set(m, PGA_REFERENCED);
3977 * Update the vm_page_t clean and reference bits.
3979 if ((tpte & (PG_M | PG_RW)) == (PG_M | PG_RW))
3981 pmap_unuse_pt(pmap, pv->pv_va, *pde, &free);
3982 pmap_invalidate_page(pmap, pv->pv_va);
3983 TAILQ_REMOVE(&m->md.pv_list, pv, pv_next);
3985 free_pv_entry(pmap, pv);
3988 vm_page_aflag_clear(m, PGA_WRITEABLE);
3990 pmap_delayed_invl_wait(m);
3991 pmap_free_zero_pages(&free);
3995 * pmap_protect_pde: do the things to protect a 2mpage in a process
3998 pmap_protect_pde(pmap_t pmap, pd_entry_t *pde, vm_offset_t sva, vm_prot_t prot)
4000 pd_entry_t newpde, oldpde;
4001 vm_offset_t eva, va;
4003 boolean_t anychanged;
4004 pt_entry_t PG_G, PG_M, PG_RW;
4006 PG_G = pmap_global_bit(pmap);
4007 PG_M = pmap_modified_bit(pmap);
4008 PG_RW = pmap_rw_bit(pmap);
4010 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
4011 KASSERT((sva & PDRMASK) == 0,
4012 ("pmap_protect_pde: sva is not 2mpage aligned"));
4015 oldpde = newpde = *pde;
4016 if (oldpde & PG_MANAGED) {
4018 for (va = sva, m = PHYS_TO_VM_PAGE(oldpde & PG_PS_FRAME);
4019 va < eva; va += PAGE_SIZE, m++)
4020 if ((oldpde & (PG_M | PG_RW)) == (PG_M | PG_RW))
4023 if ((prot & VM_PROT_WRITE) == 0)
4024 newpde &= ~(PG_RW | PG_M);
4025 if ((prot & VM_PROT_EXECUTE) == 0)
4027 if (newpde != oldpde) {
4028 if (!atomic_cmpset_long(pde, oldpde, newpde))
4031 pmap_invalidate_page(pmap, sva);
4035 return (anychanged);
4039 * Set the physical protection on the
4040 * specified range of this map as requested.
4043 pmap_protect(pmap_t pmap, vm_offset_t sva, vm_offset_t eva, vm_prot_t prot)
4045 vm_offset_t va_next;
4046 pml4_entry_t *pml4e;
4048 pd_entry_t ptpaddr, *pde;
4049 pt_entry_t *pte, PG_G, PG_M, PG_RW, PG_V;
4050 boolean_t anychanged;
4052 KASSERT((prot & ~VM_PROT_ALL) == 0, ("invalid prot %x", prot));
4053 if (prot == VM_PROT_NONE) {
4054 pmap_remove(pmap, sva, eva);
4058 if ((prot & (VM_PROT_WRITE|VM_PROT_EXECUTE)) ==
4059 (VM_PROT_WRITE|VM_PROT_EXECUTE))
4062 PG_G = pmap_global_bit(pmap);
4063 PG_M = pmap_modified_bit(pmap);
4064 PG_V = pmap_valid_bit(pmap);
4065 PG_RW = pmap_rw_bit(pmap);
4069 for (; sva < eva; sva = va_next) {
4071 pml4e = pmap_pml4e(pmap, sva);
4072 if ((*pml4e & PG_V) == 0) {
4073 va_next = (sva + NBPML4) & ~PML4MASK;
4079 pdpe = pmap_pml4e_to_pdpe(pml4e, sva);
4080 if ((*pdpe & PG_V) == 0) {
4081 va_next = (sva + NBPDP) & ~PDPMASK;
4087 va_next = (sva + NBPDR) & ~PDRMASK;
4091 pde = pmap_pdpe_to_pde(pdpe, sva);
4095 * Weed out invalid mappings.
4101 * Check for large page.
4103 if ((ptpaddr & PG_PS) != 0) {
4105 * Are we protecting the entire large page? If not,
4106 * demote the mapping and fall through.
4108 if (sva + NBPDR == va_next && eva >= va_next) {
4110 * The TLB entry for a PG_G mapping is
4111 * invalidated by pmap_protect_pde().
4113 if (pmap_protect_pde(pmap, pde, sva, prot))
4116 } else if (!pmap_demote_pde(pmap, pde, sva)) {
4118 * The large page mapping was destroyed.
4127 for (pte = pmap_pde_to_pte(pde, sva); sva != va_next; pte++,
4129 pt_entry_t obits, pbits;
4133 obits = pbits = *pte;
4134 if ((pbits & PG_V) == 0)
4137 if ((prot & VM_PROT_WRITE) == 0) {
4138 if ((pbits & (PG_MANAGED | PG_M | PG_RW)) ==
4139 (PG_MANAGED | PG_M | PG_RW)) {
4140 m = PHYS_TO_VM_PAGE(pbits & PG_FRAME);
4143 pbits &= ~(PG_RW | PG_M);
4145 if ((prot & VM_PROT_EXECUTE) == 0)
4148 if (pbits != obits) {
4149 if (!atomic_cmpset_long(pte, obits, pbits))
4152 pmap_invalidate_page(pmap, sva);
4159 pmap_invalidate_all(pmap);
4164 * Tries to promote the 512, contiguous 4KB page mappings that are within a
4165 * single page table page (PTP) to a single 2MB page mapping. For promotion
4166 * to occur, two conditions must be met: (1) the 4KB page mappings must map
4167 * aligned, contiguous physical memory and (2) the 4KB page mappings must have
4168 * identical characteristics.
4171 pmap_promote_pde(pmap_t pmap, pd_entry_t *pde, vm_offset_t va,
4172 struct rwlock **lockp)
4175 pt_entry_t *firstpte, oldpte, pa, *pte;
4176 pt_entry_t PG_G, PG_A, PG_M, PG_RW, PG_V;
4180 PG_A = pmap_accessed_bit(pmap);
4181 PG_G = pmap_global_bit(pmap);
4182 PG_M = pmap_modified_bit(pmap);
4183 PG_V = pmap_valid_bit(pmap);
4184 PG_RW = pmap_rw_bit(pmap);
4185 PG_PTE_CACHE = pmap_cache_mask(pmap, 0);
4187 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
4190 * Examine the first PTE in the specified PTP. Abort if this PTE is
4191 * either invalid, unused, or does not map the first 4KB physical page
4192 * within a 2MB page.
4194 firstpte = (pt_entry_t *)PHYS_TO_DMAP(*pde & PG_FRAME);
4197 if ((newpde & ((PG_FRAME & PDRMASK) | PG_A | PG_V)) != (PG_A | PG_V)) {
4198 atomic_add_long(&pmap_pde_p_failures, 1);
4199 CTR2(KTR_PMAP, "pmap_promote_pde: failure for va %#lx"
4200 " in pmap %p", va, pmap);
4203 if ((newpde & (PG_M | PG_RW)) == PG_RW) {
4205 * When PG_M is already clear, PG_RW can be cleared without
4206 * a TLB invalidation.
4208 if (!atomic_cmpset_long(firstpte, newpde, newpde & ~PG_RW))
4214 * Examine each of the other PTEs in the specified PTP. Abort if this
4215 * PTE maps an unexpected 4KB physical page or does not have identical
4216 * characteristics to the first PTE.
4218 pa = (newpde & (PG_PS_FRAME | PG_A | PG_V)) + NBPDR - PAGE_SIZE;
4219 for (pte = firstpte + NPTEPG - 1; pte > firstpte; pte--) {
4222 if ((oldpte & (PG_FRAME | PG_A | PG_V)) != pa) {
4223 atomic_add_long(&pmap_pde_p_failures, 1);
4224 CTR2(KTR_PMAP, "pmap_promote_pde: failure for va %#lx"
4225 " in pmap %p", va, pmap);
4228 if ((oldpte & (PG_M | PG_RW)) == PG_RW) {
4230 * When PG_M is already clear, PG_RW can be cleared
4231 * without a TLB invalidation.
4233 if (!atomic_cmpset_long(pte, oldpte, oldpte & ~PG_RW))
4236 CTR2(KTR_PMAP, "pmap_promote_pde: protect for va %#lx"
4237 " in pmap %p", (oldpte & PG_FRAME & PDRMASK) |
4238 (va & ~PDRMASK), pmap);
4240 if ((oldpte & PG_PTE_PROMOTE) != (newpde & PG_PTE_PROMOTE)) {
4241 atomic_add_long(&pmap_pde_p_failures, 1);
4242 CTR2(KTR_PMAP, "pmap_promote_pde: failure for va %#lx"
4243 " in pmap %p", va, pmap);
4250 * Save the page table page in its current state until the PDE
4251 * mapping the superpage is demoted by pmap_demote_pde() or
4252 * destroyed by pmap_remove_pde().
4254 mpte = PHYS_TO_VM_PAGE(*pde & PG_FRAME);
4255 KASSERT(mpte >= vm_page_array &&
4256 mpte < &vm_page_array[vm_page_array_size],
4257 ("pmap_promote_pde: page table page is out of range"));
4258 KASSERT(mpte->pindex == pmap_pde_pindex(va),
4259 ("pmap_promote_pde: page table page's pindex is wrong"));
4260 if (pmap_insert_pt_page(pmap, mpte)) {
4261 atomic_add_long(&pmap_pde_p_failures, 1);
4263 "pmap_promote_pde: failure for va %#lx in pmap %p", va,
4269 * Promote the pv entries.
4271 if ((newpde & PG_MANAGED) != 0)
4272 pmap_pv_promote_pde(pmap, va, newpde & PG_PS_FRAME, lockp);
4275 * Propagate the PAT index to its proper position.
4277 newpde = pmap_swap_pat(pmap, newpde);
4280 * Map the superpage.
4282 if (workaround_erratum383)
4283 pmap_update_pde(pmap, va, pde, PG_PS | newpde);
4285 pde_store(pde, PG_PS | newpde);
4287 atomic_add_long(&pmap_pde_promotions, 1);
4288 CTR2(KTR_PMAP, "pmap_promote_pde: success for va %#lx"
4289 " in pmap %p", va, pmap);
4293 * Insert the given physical page (p) at
4294 * the specified virtual address (v) in the
4295 * target physical map with the protection requested.
4297 * If specified, the page will be wired down, meaning
4298 * that the related pte can not be reclaimed.
4300 * NB: This is the only routine which MAY NOT lazy-evaluate
4301 * or lose information. That is, this routine must actually
4302 * insert this page into the given map NOW.
4304 * When destroying both a page table and PV entry, this function
4305 * performs the TLB invalidation before releasing the PV list
4306 * lock, so we do not need pmap_delayed_invl_page() calls here.
4309 pmap_enter(pmap_t pmap, vm_offset_t va, vm_page_t m, vm_prot_t prot,
4310 u_int flags, int8_t psind __unused)
4312 struct rwlock *lock;
4314 pt_entry_t *pte, PG_G, PG_A, PG_M, PG_RW, PG_V;
4315 pt_entry_t newpte, origpte;
4321 PG_A = pmap_accessed_bit(pmap);
4322 PG_G = pmap_global_bit(pmap);
4323 PG_M = pmap_modified_bit(pmap);
4324 PG_V = pmap_valid_bit(pmap);
4325 PG_RW = pmap_rw_bit(pmap);
4327 va = trunc_page(va);
4328 KASSERT(va <= VM_MAX_KERNEL_ADDRESS, ("pmap_enter: toobig"));
4329 KASSERT(va < UPT_MIN_ADDRESS || va >= UPT_MAX_ADDRESS,
4330 ("pmap_enter: invalid to pmap_enter page table pages (va: 0x%lx)",
4332 KASSERT((m->oflags & VPO_UNMANAGED) != 0 || va < kmi.clean_sva ||
4333 va >= kmi.clean_eva,
4334 ("pmap_enter: managed mapping within the clean submap"));
4335 if ((m->oflags & VPO_UNMANAGED) == 0 && !vm_page_xbusied(m))
4336 VM_OBJECT_ASSERT_LOCKED(m->object);
4337 pa = VM_PAGE_TO_PHYS(m);
4338 newpte = (pt_entry_t)(pa | PG_A | PG_V);
4339 if ((flags & VM_PROT_WRITE) != 0)
4341 if ((prot & VM_PROT_WRITE) != 0)
4343 KASSERT((newpte & (PG_M | PG_RW)) != PG_M,
4344 ("pmap_enter: flags includes VM_PROT_WRITE but prot doesn't"));
4345 if ((prot & VM_PROT_EXECUTE) == 0)
4347 if ((flags & PMAP_ENTER_WIRED) != 0)
4349 if (va < VM_MAXUSER_ADDRESS)
4351 if (pmap == kernel_pmap)
4353 newpte |= pmap_cache_bits(pmap, m->md.pat_mode, 0);
4356 * Set modified bit gratuitously for writeable mappings if
4357 * the page is unmanaged. We do not want to take a fault
4358 * to do the dirty bit accounting for these mappings.
4360 if ((m->oflags & VPO_UNMANAGED) != 0) {
4361 if ((newpte & PG_RW) != 0)
4371 * In the case that a page table page is not
4372 * resident, we are creating it here.
4375 pde = pmap_pde(pmap, va);
4376 if (pde != NULL && (*pde & PG_V) != 0 && ((*pde & PG_PS) == 0 ||
4377 pmap_demote_pde_locked(pmap, pde, va, &lock))) {
4378 pte = pmap_pde_to_pte(pde, va);
4379 if (va < VM_MAXUSER_ADDRESS && mpte == NULL) {
4380 mpte = PHYS_TO_VM_PAGE(*pde & PG_FRAME);
4383 } else if (va < VM_MAXUSER_ADDRESS) {
4385 * Here if the pte page isn't mapped, or if it has been
4388 nosleep = (flags & PMAP_ENTER_NOSLEEP) != 0;
4389 mpte = _pmap_allocpte(pmap, pmap_pde_pindex(va),
4390 nosleep ? NULL : &lock);
4391 if (mpte == NULL && nosleep) {
4395 return (KERN_RESOURCE_SHORTAGE);
4399 panic("pmap_enter: invalid page directory va=%#lx", va);
4404 * Is the specified virtual address already mapped?
4406 if ((origpte & PG_V) != 0) {
4408 * Wiring change, just update stats. We don't worry about
4409 * wiring PT pages as they remain resident as long as there
4410 * are valid mappings in them. Hence, if a user page is wired,
4411 * the PT page will be also.
4413 if ((newpte & PG_W) != 0 && (origpte & PG_W) == 0)
4414 pmap->pm_stats.wired_count++;
4415 else if ((newpte & PG_W) == 0 && (origpte & PG_W) != 0)
4416 pmap->pm_stats.wired_count--;
4419 * Remove the extra PT page reference.
4423 KASSERT(mpte->wire_count > 0,
4424 ("pmap_enter: missing reference to page table page,"
4429 * Has the physical page changed?
4431 opa = origpte & PG_FRAME;
4434 * No, might be a protection or wiring change.
4436 if ((origpte & PG_MANAGED) != 0) {
4437 newpte |= PG_MANAGED;
4438 if ((newpte & PG_RW) != 0)
4439 vm_page_aflag_set(m, PGA_WRITEABLE);
4441 if (((origpte ^ newpte) & ~(PG_M | PG_A)) == 0)
4447 * Increment the counters.
4449 if ((newpte & PG_W) != 0)
4450 pmap->pm_stats.wired_count++;
4451 pmap_resident_count_inc(pmap, 1);
4455 * Enter on the PV list if part of our managed memory.
4457 if ((m->oflags & VPO_UNMANAGED) == 0) {
4458 newpte |= PG_MANAGED;
4459 pv = get_pv_entry(pmap, &lock);
4461 CHANGE_PV_LIST_LOCK_TO_PHYS(&lock, pa);
4462 TAILQ_INSERT_TAIL(&m->md.pv_list, pv, pv_next);
4464 if ((newpte & PG_RW) != 0)
4465 vm_page_aflag_set(m, PGA_WRITEABLE);
4471 if ((origpte & PG_V) != 0) {
4473 origpte = pte_load_store(pte, newpte);
4474 opa = origpte & PG_FRAME;
4476 if ((origpte & PG_MANAGED) != 0) {
4477 om = PHYS_TO_VM_PAGE(opa);
4478 if ((origpte & (PG_M | PG_RW)) == (PG_M |
4481 if ((origpte & PG_A) != 0)
4482 vm_page_aflag_set(om, PGA_REFERENCED);
4483 CHANGE_PV_LIST_LOCK_TO_PHYS(&lock, opa);
4484 pmap_pvh_free(&om->md, pmap, va);
4485 if ((om->aflags & PGA_WRITEABLE) != 0 &&
4486 TAILQ_EMPTY(&om->md.pv_list) &&
4487 ((om->flags & PG_FICTITIOUS) != 0 ||
4488 TAILQ_EMPTY(&pa_to_pvh(opa)->pv_list)))
4489 vm_page_aflag_clear(om, PGA_WRITEABLE);
4491 } else if ((newpte & PG_M) == 0 && (origpte & (PG_M |
4492 PG_RW)) == (PG_M | PG_RW)) {
4493 if ((origpte & PG_MANAGED) != 0)
4497 * Although the PTE may still have PG_RW set, TLB
4498 * invalidation may nonetheless be required because
4499 * the PTE no longer has PG_M set.
4501 } else if ((origpte & PG_NX) != 0 || (newpte & PG_NX) == 0) {
4503 * This PTE change does not require TLB invalidation.
4507 if ((origpte & PG_A) != 0)
4508 pmap_invalidate_page(pmap, va);
4510 pte_store(pte, newpte);
4515 * If both the page table page and the reservation are fully
4516 * populated, then attempt promotion.
4518 if ((mpte == NULL || mpte->wire_count == NPTEPG) &&
4519 pmap_ps_enabled(pmap) &&
4520 (m->flags & PG_FICTITIOUS) == 0 &&
4521 vm_reserv_level_iffullpop(m) == 0)
4522 pmap_promote_pde(pmap, pde, va, &lock);
4527 return (KERN_SUCCESS);
4531 * Tries to create a 2MB page mapping. Returns TRUE if successful and FALSE
4532 * otherwise. Fails if (1) a page table page cannot be allocated without
4533 * blocking, (2) a mapping already exists at the specified virtual address, or
4534 * (3) a pv entry cannot be allocated without reclaiming another pv entry.
4537 pmap_enter_pde(pmap_t pmap, vm_offset_t va, vm_page_t m, vm_prot_t prot,
4538 struct rwlock **lockp)
4540 pd_entry_t *pde, newpde;
4543 struct spglist free;
4545 PG_V = pmap_valid_bit(pmap);
4546 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
4548 if ((mpde = pmap_allocpde(pmap, va, NULL)) == NULL) {
4549 CTR2(KTR_PMAP, "pmap_enter_pde: failure for va %#lx"
4550 " in pmap %p", va, pmap);
4553 pde = (pd_entry_t *)PHYS_TO_DMAP(VM_PAGE_TO_PHYS(mpde));
4554 pde = &pde[pmap_pde_index(va)];
4555 if ((*pde & PG_V) != 0) {
4556 KASSERT(mpde->wire_count > 1,
4557 ("pmap_enter_pde: mpde's wire count is too low"));
4559 CTR2(KTR_PMAP, "pmap_enter_pde: failure for va %#lx"
4560 " in pmap %p", va, pmap);
4563 newpde = VM_PAGE_TO_PHYS(m) | pmap_cache_bits(pmap, m->md.pat_mode, 1) |
4565 if ((m->oflags & VPO_UNMANAGED) == 0) {
4566 newpde |= PG_MANAGED;
4569 * Abort this mapping if its PV entry could not be created.
4571 if (!pmap_pv_insert_pde(pmap, va, VM_PAGE_TO_PHYS(m),
4574 if (pmap_unwire_ptp(pmap, va, mpde, &free)) {
4576 * Although "va" is not mapped, paging-
4577 * structure caches could nonetheless have
4578 * entries that refer to the freed page table
4579 * pages. Invalidate those entries.
4581 pmap_invalidate_page(pmap, va);
4582 pmap_free_zero_pages(&free);
4584 CTR2(KTR_PMAP, "pmap_enter_pde: failure for va %#lx"
4585 " in pmap %p", va, pmap);
4589 if ((prot & VM_PROT_EXECUTE) == 0)
4591 if (va < VM_MAXUSER_ADDRESS)
4595 * Increment counters.
4597 pmap_resident_count_inc(pmap, NBPDR / PAGE_SIZE);
4600 * Map the superpage.
4602 pde_store(pde, newpde);
4604 atomic_add_long(&pmap_pde_mappings, 1);
4605 CTR2(KTR_PMAP, "pmap_enter_pde: success for va %#lx"
4606 " in pmap %p", va, pmap);
4611 * Maps a sequence of resident pages belonging to the same object.
4612 * The sequence begins with the given page m_start. This page is
4613 * mapped at the given virtual address start. Each subsequent page is
4614 * mapped at a virtual address that is offset from start by the same
4615 * amount as the page is offset from m_start within the object. The
4616 * last page in the sequence is the page with the largest offset from
4617 * m_start that can be mapped at a virtual address less than the given
4618 * virtual address end. Not every virtual page between start and end
4619 * is mapped; only those for which a resident page exists with the
4620 * corresponding offset from m_start are mapped.
4623 pmap_enter_object(pmap_t pmap, vm_offset_t start, vm_offset_t end,
4624 vm_page_t m_start, vm_prot_t prot)
4626 struct rwlock *lock;
4629 vm_pindex_t diff, psize;
4631 VM_OBJECT_ASSERT_LOCKED(m_start->object);
4633 psize = atop(end - start);
4638 while (m != NULL && (diff = m->pindex - m_start->pindex) < psize) {
4639 va = start + ptoa(diff);
4640 if ((va & PDRMASK) == 0 && va + NBPDR <= end &&
4641 m->psind == 1 && pmap_ps_enabled(pmap) &&
4642 pmap_enter_pde(pmap, va, m, prot, &lock))
4643 m = &m[NBPDR / PAGE_SIZE - 1];
4645 mpte = pmap_enter_quick_locked(pmap, va, m, prot,
4647 m = TAILQ_NEXT(m, listq);
4655 * this code makes some *MAJOR* assumptions:
4656 * 1. Current pmap & pmap exists.
4659 * 4. No page table pages.
4660 * but is *MUCH* faster than pmap_enter...
4664 pmap_enter_quick(pmap_t pmap, vm_offset_t va, vm_page_t m, vm_prot_t prot)
4666 struct rwlock *lock;
4670 (void)pmap_enter_quick_locked(pmap, va, m, prot, NULL, &lock);
4677 pmap_enter_quick_locked(pmap_t pmap, vm_offset_t va, vm_page_t m,
4678 vm_prot_t prot, vm_page_t mpte, struct rwlock **lockp)
4680 struct spglist free;
4681 pt_entry_t *pte, PG_V;
4684 KASSERT(va < kmi.clean_sva || va >= kmi.clean_eva ||
4685 (m->oflags & VPO_UNMANAGED) != 0,
4686 ("pmap_enter_quick_locked: managed mapping within the clean submap"));
4687 PG_V = pmap_valid_bit(pmap);
4688 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
4691 * In the case that a page table page is not
4692 * resident, we are creating it here.
4694 if (va < VM_MAXUSER_ADDRESS) {
4695 vm_pindex_t ptepindex;
4699 * Calculate pagetable page index
4701 ptepindex = pmap_pde_pindex(va);
4702 if (mpte && (mpte->pindex == ptepindex)) {
4706 * Get the page directory entry
4708 ptepa = pmap_pde(pmap, va);
4711 * If the page table page is mapped, we just increment
4712 * the hold count, and activate it. Otherwise, we
4713 * attempt to allocate a page table page. If this
4714 * attempt fails, we don't retry. Instead, we give up.
4716 if (ptepa && (*ptepa & PG_V) != 0) {
4719 mpte = PHYS_TO_VM_PAGE(*ptepa & PG_FRAME);
4723 * Pass NULL instead of the PV list lock
4724 * pointer, because we don't intend to sleep.
4726 mpte = _pmap_allocpte(pmap, ptepindex, NULL);
4731 pte = (pt_entry_t *)PHYS_TO_DMAP(VM_PAGE_TO_PHYS(mpte));
4732 pte = &pte[pmap_pte_index(va)];
4746 * Enter on the PV list if part of our managed memory.
4748 if ((m->oflags & VPO_UNMANAGED) == 0 &&
4749 !pmap_try_insert_pv_entry(pmap, va, m, lockp)) {
4752 if (pmap_unwire_ptp(pmap, va, mpte, &free)) {
4754 * Although "va" is not mapped, paging-
4755 * structure caches could nonetheless have
4756 * entries that refer to the freed page table
4757 * pages. Invalidate those entries.
4759 pmap_invalidate_page(pmap, va);
4760 pmap_free_zero_pages(&free);
4768 * Increment counters
4770 pmap_resident_count_inc(pmap, 1);
4772 pa = VM_PAGE_TO_PHYS(m) | pmap_cache_bits(pmap, m->md.pat_mode, 0);
4773 if ((prot & VM_PROT_EXECUTE) == 0)
4777 * Now validate mapping with RO protection
4779 if ((m->oflags & VPO_UNMANAGED) != 0)
4780 pte_store(pte, pa | PG_V | PG_U);
4782 pte_store(pte, pa | PG_V | PG_U | PG_MANAGED);
4787 * Make a temporary mapping for a physical address. This is only intended
4788 * to be used for panic dumps.
4791 pmap_kenter_temporary(vm_paddr_t pa, int i)
4795 va = (vm_offset_t)crashdumpmap + (i * PAGE_SIZE);
4796 pmap_kenter(va, pa);
4798 return ((void *)crashdumpmap);
4802 * This code maps large physical mmap regions into the
4803 * processor address space. Note that some shortcuts
4804 * are taken, but the code works.
4807 pmap_object_init_pt(pmap_t pmap, vm_offset_t addr, vm_object_t object,
4808 vm_pindex_t pindex, vm_size_t size)
4811 pt_entry_t PG_A, PG_M, PG_RW, PG_V;
4812 vm_paddr_t pa, ptepa;
4816 PG_A = pmap_accessed_bit(pmap);
4817 PG_M = pmap_modified_bit(pmap);
4818 PG_V = pmap_valid_bit(pmap);
4819 PG_RW = pmap_rw_bit(pmap);
4821 VM_OBJECT_ASSERT_WLOCKED(object);
4822 KASSERT(object->type == OBJT_DEVICE || object->type == OBJT_SG,
4823 ("pmap_object_init_pt: non-device object"));
4824 if ((addr & (NBPDR - 1)) == 0 && (size & (NBPDR - 1)) == 0) {
4825 if (!pmap_ps_enabled(pmap))
4827 if (!vm_object_populate(object, pindex, pindex + atop(size)))
4829 p = vm_page_lookup(object, pindex);
4830 KASSERT(p->valid == VM_PAGE_BITS_ALL,
4831 ("pmap_object_init_pt: invalid page %p", p));
4832 pat_mode = p->md.pat_mode;
4835 * Abort the mapping if the first page is not physically
4836 * aligned to a 2MB page boundary.
4838 ptepa = VM_PAGE_TO_PHYS(p);
4839 if (ptepa & (NBPDR - 1))
4843 * Skip the first page. Abort the mapping if the rest of
4844 * the pages are not physically contiguous or have differing
4845 * memory attributes.
4847 p = TAILQ_NEXT(p, listq);
4848 for (pa = ptepa + PAGE_SIZE; pa < ptepa + size;
4850 KASSERT(p->valid == VM_PAGE_BITS_ALL,
4851 ("pmap_object_init_pt: invalid page %p", p));
4852 if (pa != VM_PAGE_TO_PHYS(p) ||
4853 pat_mode != p->md.pat_mode)
4855 p = TAILQ_NEXT(p, listq);
4859 * Map using 2MB pages. Since "ptepa" is 2M aligned and
4860 * "size" is a multiple of 2M, adding the PAT setting to "pa"
4861 * will not affect the termination of this loop.
4864 for (pa = ptepa | pmap_cache_bits(pmap, pat_mode, 1);
4865 pa < ptepa + size; pa += NBPDR) {
4866 pdpg = pmap_allocpde(pmap, addr, NULL);
4869 * The creation of mappings below is only an
4870 * optimization. If a page directory page
4871 * cannot be allocated without blocking,
4872 * continue on to the next mapping rather than
4878 pde = (pd_entry_t *)PHYS_TO_DMAP(VM_PAGE_TO_PHYS(pdpg));
4879 pde = &pde[pmap_pde_index(addr)];
4880 if ((*pde & PG_V) == 0) {
4881 pde_store(pde, pa | PG_PS | PG_M | PG_A |
4882 PG_U | PG_RW | PG_V);
4883 pmap_resident_count_inc(pmap, NBPDR / PAGE_SIZE);
4884 atomic_add_long(&pmap_pde_mappings, 1);
4886 /* Continue on if the PDE is already valid. */
4888 KASSERT(pdpg->wire_count > 0,
4889 ("pmap_object_init_pt: missing reference "
4890 "to page directory page, va: 0x%lx", addr));
4899 * Clear the wired attribute from the mappings for the specified range of
4900 * addresses in the given pmap. Every valid mapping within that range
4901 * must have the wired attribute set. In contrast, invalid mappings
4902 * cannot have the wired attribute set, so they are ignored.
4904 * The wired attribute of the page table entry is not a hardware
4905 * feature, so there is no need to invalidate any TLB entries.
4906 * Since pmap_demote_pde() for the wired entry must never fail,
4907 * pmap_delayed_invl_started()/finished() calls around the
4908 * function are not needed.
4911 pmap_unwire(pmap_t pmap, vm_offset_t sva, vm_offset_t eva)
4913 vm_offset_t va_next;
4914 pml4_entry_t *pml4e;
4917 pt_entry_t *pte, PG_V;
4919 PG_V = pmap_valid_bit(pmap);
4921 for (; sva < eva; sva = va_next) {
4922 pml4e = pmap_pml4e(pmap, sva);
4923 if ((*pml4e & PG_V) == 0) {
4924 va_next = (sva + NBPML4) & ~PML4MASK;
4929 pdpe = pmap_pml4e_to_pdpe(pml4e, sva);
4930 if ((*pdpe & PG_V) == 0) {
4931 va_next = (sva + NBPDP) & ~PDPMASK;
4936 va_next = (sva + NBPDR) & ~PDRMASK;
4939 pde = pmap_pdpe_to_pde(pdpe, sva);
4940 if ((*pde & PG_V) == 0)
4942 if ((*pde & PG_PS) != 0) {
4943 if ((*pde & PG_W) == 0)
4944 panic("pmap_unwire: pde %#jx is missing PG_W",
4948 * Are we unwiring the entire large page? If not,
4949 * demote the mapping and fall through.
4951 if (sva + NBPDR == va_next && eva >= va_next) {
4952 atomic_clear_long(pde, PG_W);
4953 pmap->pm_stats.wired_count -= NBPDR /
4956 } else if (!pmap_demote_pde(pmap, pde, sva))
4957 panic("pmap_unwire: demotion failed");
4961 for (pte = pmap_pde_to_pte(pde, sva); sva != va_next; pte++,
4963 if ((*pte & PG_V) == 0)
4965 if ((*pte & PG_W) == 0)
4966 panic("pmap_unwire: pte %#jx is missing PG_W",
4970 * PG_W must be cleared atomically. Although the pmap
4971 * lock synchronizes access to PG_W, another processor
4972 * could be setting PG_M and/or PG_A concurrently.
4974 atomic_clear_long(pte, PG_W);
4975 pmap->pm_stats.wired_count--;
4982 * Copy the range specified by src_addr/len
4983 * from the source map to the range dst_addr/len
4984 * in the destination map.
4986 * This routine is only advisory and need not do anything.
4990 pmap_copy(pmap_t dst_pmap, pmap_t src_pmap, vm_offset_t dst_addr, vm_size_t len,
4991 vm_offset_t src_addr)
4993 struct rwlock *lock;
4994 struct spglist free;
4996 vm_offset_t end_addr = src_addr + len;
4997 vm_offset_t va_next;
4998 pt_entry_t PG_A, PG_M, PG_V;
5000 if (dst_addr != src_addr)
5003 if (dst_pmap->pm_type != src_pmap->pm_type)
5007 * EPT page table entries that require emulation of A/D bits are
5008 * sensitive to clearing the PG_A bit (aka EPT_PG_READ). Although
5009 * we clear PG_M (aka EPT_PG_WRITE) concomitantly, the PG_U bit
5010 * (aka EPT_PG_EXECUTE) could still be set. Since some EPT
5011 * implementations flag an EPT misconfiguration for exec-only
5012 * mappings we skip this function entirely for emulated pmaps.
5014 if (pmap_emulate_ad_bits(dst_pmap))
5018 if (dst_pmap < src_pmap) {
5019 PMAP_LOCK(dst_pmap);
5020 PMAP_LOCK(src_pmap);
5022 PMAP_LOCK(src_pmap);
5023 PMAP_LOCK(dst_pmap);
5026 PG_A = pmap_accessed_bit(dst_pmap);
5027 PG_M = pmap_modified_bit(dst_pmap);
5028 PG_V = pmap_valid_bit(dst_pmap);
5030 for (addr = src_addr; addr < end_addr; addr = va_next) {
5031 pt_entry_t *src_pte, *dst_pte;
5032 vm_page_t dstmpde, dstmpte, srcmpte;
5033 pml4_entry_t *pml4e;
5035 pd_entry_t srcptepaddr, *pde;
5037 KASSERT(addr < UPT_MIN_ADDRESS,
5038 ("pmap_copy: invalid to pmap_copy page tables"));
5040 pml4e = pmap_pml4e(src_pmap, addr);
5041 if ((*pml4e & PG_V) == 0) {
5042 va_next = (addr + NBPML4) & ~PML4MASK;
5048 pdpe = pmap_pml4e_to_pdpe(pml4e, addr);
5049 if ((*pdpe & PG_V) == 0) {
5050 va_next = (addr + NBPDP) & ~PDPMASK;
5056 va_next = (addr + NBPDR) & ~PDRMASK;
5060 pde = pmap_pdpe_to_pde(pdpe, addr);
5062 if (srcptepaddr == 0)
5065 if (srcptepaddr & PG_PS) {
5066 if ((addr & PDRMASK) != 0 || addr + NBPDR > end_addr)
5068 dstmpde = pmap_allocpde(dst_pmap, addr, NULL);
5069 if (dstmpde == NULL)
5071 pde = (pd_entry_t *)
5072 PHYS_TO_DMAP(VM_PAGE_TO_PHYS(dstmpde));
5073 pde = &pde[pmap_pde_index(addr)];
5074 if (*pde == 0 && ((srcptepaddr & PG_MANAGED) == 0 ||
5075 pmap_pv_insert_pde(dst_pmap, addr, srcptepaddr &
5076 PG_PS_FRAME, &lock))) {
5077 *pde = srcptepaddr & ~PG_W;
5078 pmap_resident_count_inc(dst_pmap, NBPDR / PAGE_SIZE);
5079 atomic_add_long(&pmap_pde_mappings, 1);
5081 dstmpde->wire_count--;
5085 srcptepaddr &= PG_FRAME;
5086 srcmpte = PHYS_TO_VM_PAGE(srcptepaddr);
5087 KASSERT(srcmpte->wire_count > 0,
5088 ("pmap_copy: source page table page is unused"));
5090 if (va_next > end_addr)
5093 src_pte = (pt_entry_t *)PHYS_TO_DMAP(srcptepaddr);
5094 src_pte = &src_pte[pmap_pte_index(addr)];
5096 while (addr < va_next) {
5100 * we only virtual copy managed pages
5102 if ((ptetemp & PG_MANAGED) != 0) {
5103 if (dstmpte != NULL &&
5104 dstmpte->pindex == pmap_pde_pindex(addr))
5105 dstmpte->wire_count++;
5106 else if ((dstmpte = pmap_allocpte(dst_pmap,
5107 addr, NULL)) == NULL)
5109 dst_pte = (pt_entry_t *)
5110 PHYS_TO_DMAP(VM_PAGE_TO_PHYS(dstmpte));
5111 dst_pte = &dst_pte[pmap_pte_index(addr)];
5112 if (*dst_pte == 0 &&
5113 pmap_try_insert_pv_entry(dst_pmap, addr,
5114 PHYS_TO_VM_PAGE(ptetemp & PG_FRAME),
5117 * Clear the wired, modified, and
5118 * accessed (referenced) bits
5121 *dst_pte = ptetemp & ~(PG_W | PG_M |
5123 pmap_resident_count_inc(dst_pmap, 1);
5126 if (pmap_unwire_ptp(dst_pmap, addr,
5129 * Although "addr" is not
5130 * mapped, paging-structure
5131 * caches could nonetheless
5132 * have entries that refer to
5133 * the freed page table pages.
5134 * Invalidate those entries.
5136 pmap_invalidate_page(dst_pmap,
5138 pmap_free_zero_pages(&free);
5142 if (dstmpte->wire_count >= srcmpte->wire_count)
5152 PMAP_UNLOCK(src_pmap);
5153 PMAP_UNLOCK(dst_pmap);
5157 * pmap_zero_page zeros the specified hardware page by mapping
5158 * the page into KVM and using bzero to clear its contents.
5161 pmap_zero_page(vm_page_t m)
5163 vm_offset_t va = PHYS_TO_DMAP(VM_PAGE_TO_PHYS(m));
5165 pagezero((void *)va);
5169 * pmap_zero_page_area zeros the specified hardware page by mapping
5170 * the page into KVM and using bzero to clear its contents.
5172 * off and size may not cover an area beyond a single hardware page.
5175 pmap_zero_page_area(vm_page_t m, int off, int size)
5177 vm_offset_t va = PHYS_TO_DMAP(VM_PAGE_TO_PHYS(m));
5179 if (off == 0 && size == PAGE_SIZE)
5180 pagezero((void *)va);
5182 bzero((char *)va + off, size);
5186 * pmap_zero_page_idle zeros the specified hardware page by mapping
5187 * the page into KVM and using bzero to clear its contents. This
5188 * is intended to be called from the vm_pagezero process only and
5192 pmap_zero_page_idle(vm_page_t m)
5194 vm_offset_t va = PHYS_TO_DMAP(VM_PAGE_TO_PHYS(m));
5196 pagezero((void *)va);
5200 * pmap_copy_page copies the specified (machine independent)
5201 * page by mapping the page into virtual memory and using
5202 * bcopy to copy the page, one machine dependent page at a
5206 pmap_copy_page(vm_page_t msrc, vm_page_t mdst)
5208 vm_offset_t src = PHYS_TO_DMAP(VM_PAGE_TO_PHYS(msrc));
5209 vm_offset_t dst = PHYS_TO_DMAP(VM_PAGE_TO_PHYS(mdst));
5211 pagecopy((void *)src, (void *)dst);
5214 int unmapped_buf_allowed = 1;
5217 pmap_copy_pages(vm_page_t ma[], vm_offset_t a_offset, vm_page_t mb[],
5218 vm_offset_t b_offset, int xfersize)
5222 vm_offset_t vaddr[2], a_pg_offset, b_pg_offset;
5226 while (xfersize > 0) {
5227 a_pg_offset = a_offset & PAGE_MASK;
5228 pages[0] = ma[a_offset >> PAGE_SHIFT];
5229 b_pg_offset = b_offset & PAGE_MASK;
5230 pages[1] = mb[b_offset >> PAGE_SHIFT];
5231 cnt = min(xfersize, PAGE_SIZE - a_pg_offset);
5232 cnt = min(cnt, PAGE_SIZE - b_pg_offset);
5233 mapped = pmap_map_io_transient(pages, vaddr, 2, FALSE);
5234 a_cp = (char *)vaddr[0] + a_pg_offset;
5235 b_cp = (char *)vaddr[1] + b_pg_offset;
5236 bcopy(a_cp, b_cp, cnt);
5237 if (__predict_false(mapped))
5238 pmap_unmap_io_transient(pages, vaddr, 2, FALSE);
5246 * Returns true if the pmap's pv is one of the first
5247 * 16 pvs linked to from this page. This count may
5248 * be changed upwards or downwards in the future; it
5249 * is only necessary that true be returned for a small
5250 * subset of pmaps for proper page aging.
5253 pmap_page_exists_quick(pmap_t pmap, vm_page_t m)
5255 struct md_page *pvh;
5256 struct rwlock *lock;
5261 KASSERT((m->oflags & VPO_UNMANAGED) == 0,
5262 ("pmap_page_exists_quick: page %p is not managed", m));
5264 lock = VM_PAGE_TO_PV_LIST_LOCK(m);
5266 TAILQ_FOREACH(pv, &m->md.pv_list, pv_next) {
5267 if (PV_PMAP(pv) == pmap) {
5275 if (!rv && loops < 16 && (m->flags & PG_FICTITIOUS) == 0) {
5276 pvh = pa_to_pvh(VM_PAGE_TO_PHYS(m));
5277 TAILQ_FOREACH(pv, &pvh->pv_list, pv_next) {
5278 if (PV_PMAP(pv) == pmap) {
5292 * pmap_page_wired_mappings:
5294 * Return the number of managed mappings to the given physical page
5298 pmap_page_wired_mappings(vm_page_t m)
5300 struct rwlock *lock;
5301 struct md_page *pvh;
5305 int count, md_gen, pvh_gen;
5307 if ((m->oflags & VPO_UNMANAGED) != 0)
5309 lock = VM_PAGE_TO_PV_LIST_LOCK(m);
5313 TAILQ_FOREACH(pv, &m->md.pv_list, pv_next) {
5315 if (!PMAP_TRYLOCK(pmap)) {
5316 md_gen = m->md.pv_gen;
5320 if (md_gen != m->md.pv_gen) {
5325 pte = pmap_pte(pmap, pv->pv_va);
5326 if ((*pte & PG_W) != 0)
5330 if ((m->flags & PG_FICTITIOUS) == 0) {
5331 pvh = pa_to_pvh(VM_PAGE_TO_PHYS(m));
5332 TAILQ_FOREACH(pv, &pvh->pv_list, pv_next) {
5334 if (!PMAP_TRYLOCK(pmap)) {
5335 md_gen = m->md.pv_gen;
5336 pvh_gen = pvh->pv_gen;
5340 if (md_gen != m->md.pv_gen ||
5341 pvh_gen != pvh->pv_gen) {
5346 pte = pmap_pde(pmap, pv->pv_va);
5347 if ((*pte & PG_W) != 0)
5357 * Returns TRUE if the given page is mapped individually or as part of
5358 * a 2mpage. Otherwise, returns FALSE.
5361 pmap_page_is_mapped(vm_page_t m)
5363 struct rwlock *lock;
5366 if ((m->oflags & VPO_UNMANAGED) != 0)
5368 lock = VM_PAGE_TO_PV_LIST_LOCK(m);
5370 rv = !TAILQ_EMPTY(&m->md.pv_list) ||
5371 ((m->flags & PG_FICTITIOUS) == 0 &&
5372 !TAILQ_EMPTY(&pa_to_pvh(VM_PAGE_TO_PHYS(m))->pv_list));
5378 * Destroy all managed, non-wired mappings in the given user-space
5379 * pmap. This pmap cannot be active on any processor besides the
5382 * This function cannot be applied to the kernel pmap. Moreover, it
5383 * is not intended for general use. It is only to be used during
5384 * process termination. Consequently, it can be implemented in ways
5385 * that make it faster than pmap_remove(). First, it can more quickly
5386 * destroy mappings by iterating over the pmap's collection of PV
5387 * entries, rather than searching the page table. Second, it doesn't
5388 * have to test and clear the page table entries atomically, because
5389 * no processor is currently accessing the user address space. In
5390 * particular, a page table entry's dirty bit won't change state once
5391 * this function starts.
5394 pmap_remove_pages(pmap_t pmap)
5397 pt_entry_t *pte, tpte;
5398 pt_entry_t PG_M, PG_RW, PG_V;
5399 struct spglist free;
5400 vm_page_t m, mpte, mt;
5402 struct md_page *pvh;
5403 struct pv_chunk *pc, *npc;
5404 struct rwlock *lock;
5406 uint64_t inuse, bitmask;
5407 int allfree, field, freed, idx;
5408 boolean_t superpage;
5412 * Assert that the given pmap is only active on the current
5413 * CPU. Unfortunately, we cannot block another CPU from
5414 * activating the pmap while this function is executing.
5416 KASSERT(pmap == PCPU_GET(curpmap), ("non-current pmap %p", pmap));
5419 cpuset_t other_cpus;
5421 other_cpus = all_cpus;
5423 CPU_CLR(PCPU_GET(cpuid), &other_cpus);
5424 CPU_AND(&other_cpus, &pmap->pm_active);
5426 KASSERT(CPU_EMPTY(&other_cpus), ("pmap active %p", pmap));
5431 PG_M = pmap_modified_bit(pmap);
5432 PG_V = pmap_valid_bit(pmap);
5433 PG_RW = pmap_rw_bit(pmap);
5437 TAILQ_FOREACH_SAFE(pc, &pmap->pm_pvchunk, pc_list, npc) {
5440 for (field = 0; field < _NPCM; field++) {
5441 inuse = ~pc->pc_map[field] & pc_freemask[field];
5442 while (inuse != 0) {
5444 bitmask = 1UL << bit;
5445 idx = field * 64 + bit;
5446 pv = &pc->pc_pventry[idx];
5449 pte = pmap_pdpe(pmap, pv->pv_va);
5451 pte = pmap_pdpe_to_pde(pte, pv->pv_va);
5453 if ((tpte & (PG_PS | PG_V)) == PG_V) {
5456 pte = (pt_entry_t *)PHYS_TO_DMAP(tpte &
5458 pte = &pte[pmap_pte_index(pv->pv_va)];
5462 * Keep track whether 'tpte' is a
5463 * superpage explicitly instead of
5464 * relying on PG_PS being set.
5466 * This is because PG_PS is numerically
5467 * identical to PG_PTE_PAT and thus a
5468 * regular page could be mistaken for
5474 if ((tpte & PG_V) == 0) {
5475 panic("bad pte va %lx pte %lx",
5480 * We cannot remove wired pages from a process' mapping at this time
5488 pa = tpte & PG_PS_FRAME;
5490 pa = tpte & PG_FRAME;
5492 m = PHYS_TO_VM_PAGE(pa);
5493 KASSERT(m->phys_addr == pa,
5494 ("vm_page_t %p phys_addr mismatch %016jx %016jx",
5495 m, (uintmax_t)m->phys_addr,
5498 KASSERT((m->flags & PG_FICTITIOUS) != 0 ||
5499 m < &vm_page_array[vm_page_array_size],
5500 ("pmap_remove_pages: bad tpte %#jx",
5506 * Update the vm_page_t clean/reference bits.
5508 if ((tpte & (PG_M | PG_RW)) == (PG_M | PG_RW)) {
5510 for (mt = m; mt < &m[NBPDR / PAGE_SIZE]; mt++)
5516 CHANGE_PV_LIST_LOCK_TO_VM_PAGE(&lock, m);
5519 pc->pc_map[field] |= bitmask;
5521 pmap_resident_count_dec(pmap, NBPDR / PAGE_SIZE);
5522 pvh = pa_to_pvh(tpte & PG_PS_FRAME);
5523 TAILQ_REMOVE(&pvh->pv_list, pv, pv_next);
5525 if (TAILQ_EMPTY(&pvh->pv_list)) {
5526 for (mt = m; mt < &m[NBPDR / PAGE_SIZE]; mt++)
5527 if ((mt->aflags & PGA_WRITEABLE) != 0 &&
5528 TAILQ_EMPTY(&mt->md.pv_list))
5529 vm_page_aflag_clear(mt, PGA_WRITEABLE);
5531 mpte = pmap_lookup_pt_page(pmap, pv->pv_va);
5533 pmap_remove_pt_page(pmap, mpte);
5534 pmap_resident_count_dec(pmap, 1);
5535 KASSERT(mpte->wire_count == NPTEPG,
5536 ("pmap_remove_pages: pte page wire count error"));
5537 mpte->wire_count = 0;
5538 pmap_add_delayed_free_list(mpte, &free, FALSE);
5539 atomic_subtract_int(&vm_cnt.v_wire_count, 1);
5542 pmap_resident_count_dec(pmap, 1);
5543 TAILQ_REMOVE(&m->md.pv_list, pv, pv_next);
5545 if ((m->aflags & PGA_WRITEABLE) != 0 &&
5546 TAILQ_EMPTY(&m->md.pv_list) &&
5547 (m->flags & PG_FICTITIOUS) == 0) {
5548 pvh = pa_to_pvh(VM_PAGE_TO_PHYS(m));
5549 if (TAILQ_EMPTY(&pvh->pv_list))
5550 vm_page_aflag_clear(m, PGA_WRITEABLE);
5553 pmap_unuse_pt(pmap, pv->pv_va, ptepde, &free);
5557 PV_STAT(atomic_add_long(&pv_entry_frees, freed));
5558 PV_STAT(atomic_add_int(&pv_entry_spare, freed));
5559 PV_STAT(atomic_subtract_long(&pv_entry_count, freed));
5561 TAILQ_REMOVE(&pmap->pm_pvchunk, pc, pc_list);
5567 pmap_invalidate_all(pmap);
5569 pmap_free_zero_pages(&free);
5573 pmap_page_test_mappings(vm_page_t m, boolean_t accessed, boolean_t modified)
5575 struct rwlock *lock;
5577 struct md_page *pvh;
5578 pt_entry_t *pte, mask;
5579 pt_entry_t PG_A, PG_M, PG_RW, PG_V;
5581 int md_gen, pvh_gen;
5585 lock = VM_PAGE_TO_PV_LIST_LOCK(m);
5588 TAILQ_FOREACH(pv, &m->md.pv_list, pv_next) {
5590 if (!PMAP_TRYLOCK(pmap)) {
5591 md_gen = m->md.pv_gen;
5595 if (md_gen != m->md.pv_gen) {
5600 pte = pmap_pte(pmap, pv->pv_va);
5603 PG_M = pmap_modified_bit(pmap);
5604 PG_RW = pmap_rw_bit(pmap);
5605 mask |= PG_RW | PG_M;
5608 PG_A = pmap_accessed_bit(pmap);
5609 PG_V = pmap_valid_bit(pmap);
5610 mask |= PG_V | PG_A;
5612 rv = (*pte & mask) == mask;
5617 if ((m->flags & PG_FICTITIOUS) == 0) {
5618 pvh = pa_to_pvh(VM_PAGE_TO_PHYS(m));
5619 TAILQ_FOREACH(pv, &pvh->pv_list, pv_next) {
5621 if (!PMAP_TRYLOCK(pmap)) {
5622 md_gen = m->md.pv_gen;
5623 pvh_gen = pvh->pv_gen;
5627 if (md_gen != m->md.pv_gen ||
5628 pvh_gen != pvh->pv_gen) {
5633 pte = pmap_pde(pmap, pv->pv_va);
5636 PG_M = pmap_modified_bit(pmap);
5637 PG_RW = pmap_rw_bit(pmap);
5638 mask |= PG_RW | PG_M;
5641 PG_A = pmap_accessed_bit(pmap);
5642 PG_V = pmap_valid_bit(pmap);
5643 mask |= PG_V | PG_A;
5645 rv = (*pte & mask) == mask;
5659 * Return whether or not the specified physical page was modified
5660 * in any physical maps.
5663 pmap_is_modified(vm_page_t m)
5666 KASSERT((m->oflags & VPO_UNMANAGED) == 0,
5667 ("pmap_is_modified: page %p is not managed", m));
5670 * If the page is not exclusive busied, then PGA_WRITEABLE cannot be
5671 * concurrently set while the object is locked. Thus, if PGA_WRITEABLE
5672 * is clear, no PTEs can have PG_M set.
5674 VM_OBJECT_ASSERT_WLOCKED(m->object);
5675 if (!vm_page_xbusied(m) && (m->aflags & PGA_WRITEABLE) == 0)
5677 return (pmap_page_test_mappings(m, FALSE, TRUE));
5681 * pmap_is_prefaultable:
5683 * Return whether or not the specified virtual address is eligible
5687 pmap_is_prefaultable(pmap_t pmap, vm_offset_t addr)
5690 pt_entry_t *pte, PG_V;
5693 PG_V = pmap_valid_bit(pmap);
5696 pde = pmap_pde(pmap, addr);
5697 if (pde != NULL && (*pde & (PG_PS | PG_V)) == PG_V) {
5698 pte = pmap_pde_to_pte(pde, addr);
5699 rv = (*pte & PG_V) == 0;
5706 * pmap_is_referenced:
5708 * Return whether or not the specified physical page was referenced
5709 * in any physical maps.
5712 pmap_is_referenced(vm_page_t m)
5715 KASSERT((m->oflags & VPO_UNMANAGED) == 0,
5716 ("pmap_is_referenced: page %p is not managed", m));
5717 return (pmap_page_test_mappings(m, TRUE, FALSE));
5721 * Clear the write and modified bits in each of the given page's mappings.
5724 pmap_remove_write(vm_page_t m)
5726 struct md_page *pvh;
5728 struct rwlock *lock;
5729 pv_entry_t next_pv, pv;
5731 pt_entry_t oldpte, *pte, PG_M, PG_RW;
5733 int pvh_gen, md_gen;
5735 KASSERT((m->oflags & VPO_UNMANAGED) == 0,
5736 ("pmap_remove_write: page %p is not managed", m));
5739 * If the page is not exclusive busied, then PGA_WRITEABLE cannot be
5740 * set by another thread while the object is locked. Thus,
5741 * if PGA_WRITEABLE is clear, no page table entries need updating.
5743 VM_OBJECT_ASSERT_WLOCKED(m->object);
5744 if (!vm_page_xbusied(m) && (m->aflags & PGA_WRITEABLE) == 0)
5746 lock = VM_PAGE_TO_PV_LIST_LOCK(m);
5747 pvh = pa_to_pvh(VM_PAGE_TO_PHYS(m));
5750 if ((m->flags & PG_FICTITIOUS) != 0)
5751 goto small_mappings;
5752 TAILQ_FOREACH_SAFE(pv, &pvh->pv_list, pv_next, next_pv) {
5754 if (!PMAP_TRYLOCK(pmap)) {
5755 pvh_gen = pvh->pv_gen;
5759 if (pvh_gen != pvh->pv_gen) {
5765 PG_RW = pmap_rw_bit(pmap);
5767 pde = pmap_pde(pmap, va);
5768 if ((*pde & PG_RW) != 0)
5769 (void)pmap_demote_pde_locked(pmap, pde, va, &lock);
5770 KASSERT(lock == VM_PAGE_TO_PV_LIST_LOCK(m),
5771 ("inconsistent pv lock %p %p for page %p",
5772 lock, VM_PAGE_TO_PV_LIST_LOCK(m), m));
5776 TAILQ_FOREACH(pv, &m->md.pv_list, pv_next) {
5778 if (!PMAP_TRYLOCK(pmap)) {
5779 pvh_gen = pvh->pv_gen;
5780 md_gen = m->md.pv_gen;
5784 if (pvh_gen != pvh->pv_gen ||
5785 md_gen != m->md.pv_gen) {
5791 PG_M = pmap_modified_bit(pmap);
5792 PG_RW = pmap_rw_bit(pmap);
5793 pde = pmap_pde(pmap, pv->pv_va);
5794 KASSERT((*pde & PG_PS) == 0,
5795 ("pmap_remove_write: found a 2mpage in page %p's pv list",
5797 pte = pmap_pde_to_pte(pde, pv->pv_va);
5800 if (oldpte & PG_RW) {
5801 if (!atomic_cmpset_long(pte, oldpte, oldpte &
5804 if ((oldpte & PG_M) != 0)
5806 pmap_invalidate_page(pmap, pv->pv_va);
5811 vm_page_aflag_clear(m, PGA_WRITEABLE);
5812 pmap_delayed_invl_wait(m);
5815 static __inline boolean_t
5816 safe_to_clear_referenced(pmap_t pmap, pt_entry_t pte)
5819 if (!pmap_emulate_ad_bits(pmap))
5822 KASSERT(pmap->pm_type == PT_EPT, ("invalid pm_type %d", pmap->pm_type));
5825 * XWR = 010 or 110 will cause an unconditional EPT misconfiguration
5826 * so we don't let the referenced (aka EPT_PG_READ) bit to be cleared
5827 * if the EPT_PG_WRITE bit is set.
5829 if ((pte & EPT_PG_WRITE) != 0)
5833 * XWR = 100 is allowed only if the PMAP_SUPPORTS_EXEC_ONLY is set.
5835 if ((pte & EPT_PG_EXECUTE) == 0 ||
5836 ((pmap->pm_flags & PMAP_SUPPORTS_EXEC_ONLY) != 0))
5842 #define PMAP_TS_REFERENCED_MAX 5
5845 * pmap_ts_referenced:
5847 * Return a count of reference bits for a page, clearing those bits.
5848 * It is not necessary for every reference bit to be cleared, but it
5849 * is necessary that 0 only be returned when there are truly no
5850 * reference bits set.
5852 * XXX: The exact number of bits to check and clear is a matter that
5853 * should be tested and standardized at some point in the future for
5854 * optimal aging of shared pages.
5856 * A DI block is not needed within this function, because
5857 * invalidations are performed before the PV list lock is
5861 pmap_ts_referenced(vm_page_t m)
5863 struct md_page *pvh;
5866 struct rwlock *lock;
5867 pd_entry_t oldpde, *pde;
5868 pt_entry_t *pte, PG_A;
5871 int cleared, md_gen, not_cleared, pvh_gen;
5872 struct spglist free;
5875 KASSERT((m->oflags & VPO_UNMANAGED) == 0,
5876 ("pmap_ts_referenced: page %p is not managed", m));
5879 pa = VM_PAGE_TO_PHYS(m);
5880 lock = PHYS_TO_PV_LIST_LOCK(pa);
5881 pvh = pa_to_pvh(pa);
5885 if ((m->flags & PG_FICTITIOUS) != 0 ||
5886 (pvf = TAILQ_FIRST(&pvh->pv_list)) == NULL)
5887 goto small_mappings;
5893 if (!PMAP_TRYLOCK(pmap)) {
5894 pvh_gen = pvh->pv_gen;
5898 if (pvh_gen != pvh->pv_gen) {
5903 PG_A = pmap_accessed_bit(pmap);
5905 pde = pmap_pde(pmap, pv->pv_va);
5907 if ((*pde & PG_A) != 0) {
5909 * Since this reference bit is shared by 512 4KB
5910 * pages, it should not be cleared every time it is
5911 * tested. Apply a simple "hash" function on the
5912 * physical page number, the virtual superpage number,
5913 * and the pmap address to select one 4KB page out of
5914 * the 512 on which testing the reference bit will
5915 * result in clearing that reference bit. This
5916 * function is designed to avoid the selection of the
5917 * same 4KB page for every 2MB page mapping.
5919 * On demotion, a mapping that hasn't been referenced
5920 * is simply destroyed. To avoid the possibility of a
5921 * subsequent page fault on a demoted wired mapping,
5922 * always leave its reference bit set. Moreover,
5923 * since the superpage is wired, the current state of
5924 * its reference bit won't affect page replacement.
5926 if ((((pa >> PAGE_SHIFT) ^ (pv->pv_va >> PDRSHIFT) ^
5927 (uintptr_t)pmap) & (NPTEPG - 1)) == 0 &&
5928 (*pde & PG_W) == 0) {
5929 if (safe_to_clear_referenced(pmap, oldpde)) {
5930 atomic_clear_long(pde, PG_A);
5931 pmap_invalidate_page(pmap, pv->pv_va);
5933 } else if (pmap_demote_pde_locked(pmap, pde,
5934 pv->pv_va, &lock)) {
5936 * Remove the mapping to a single page
5937 * so that a subsequent access may
5938 * repromote. Since the underlying
5939 * page table page is fully populated,
5940 * this removal never frees a page
5944 va += VM_PAGE_TO_PHYS(m) - (oldpde &
5946 pte = pmap_pde_to_pte(pde, va);
5947 pmap_remove_pte(pmap, pte, va, *pde,
5949 pmap_invalidate_page(pmap, va);
5955 * The superpage mapping was removed
5956 * entirely and therefore 'pv' is no
5964 KASSERT(lock == VM_PAGE_TO_PV_LIST_LOCK(m),
5965 ("inconsistent pv lock %p %p for page %p",
5966 lock, VM_PAGE_TO_PV_LIST_LOCK(m), m));
5971 /* Rotate the PV list if it has more than one entry. */
5972 if (pv != NULL && TAILQ_NEXT(pv, pv_next) != NULL) {
5973 TAILQ_REMOVE(&pvh->pv_list, pv, pv_next);
5974 TAILQ_INSERT_TAIL(&pvh->pv_list, pv, pv_next);
5977 if (cleared + not_cleared >= PMAP_TS_REFERENCED_MAX)
5979 } while ((pv = TAILQ_FIRST(&pvh->pv_list)) != pvf);
5981 if ((pvf = TAILQ_FIRST(&m->md.pv_list)) == NULL)
5988 if (!PMAP_TRYLOCK(pmap)) {
5989 pvh_gen = pvh->pv_gen;
5990 md_gen = m->md.pv_gen;
5994 if (pvh_gen != pvh->pv_gen || md_gen != m->md.pv_gen) {
5999 PG_A = pmap_accessed_bit(pmap);
6000 pde = pmap_pde(pmap, pv->pv_va);
6001 KASSERT((*pde & PG_PS) == 0,
6002 ("pmap_ts_referenced: found a 2mpage in page %p's pv list",
6004 pte = pmap_pde_to_pte(pde, pv->pv_va);
6005 if ((*pte & PG_A) != 0) {
6006 if (safe_to_clear_referenced(pmap, *pte)) {
6007 atomic_clear_long(pte, PG_A);
6008 pmap_invalidate_page(pmap, pv->pv_va);
6010 } else if ((*pte & PG_W) == 0) {
6012 * Wired pages cannot be paged out so
6013 * doing accessed bit emulation for
6014 * them is wasted effort. We do the
6015 * hard work for unwired pages only.
6017 pmap_remove_pte(pmap, pte, pv->pv_va,
6018 *pde, &free, &lock);
6019 pmap_invalidate_page(pmap, pv->pv_va);
6024 KASSERT(lock == VM_PAGE_TO_PV_LIST_LOCK(m),
6025 ("inconsistent pv lock %p %p for page %p",
6026 lock, VM_PAGE_TO_PV_LIST_LOCK(m), m));
6031 /* Rotate the PV list if it has more than one entry. */
6032 if (pv != NULL && TAILQ_NEXT(pv, pv_next) != NULL) {
6033 TAILQ_REMOVE(&m->md.pv_list, pv, pv_next);
6034 TAILQ_INSERT_TAIL(&m->md.pv_list, pv, pv_next);
6037 } while ((pv = TAILQ_FIRST(&m->md.pv_list)) != pvf && cleared +
6038 not_cleared < PMAP_TS_REFERENCED_MAX);
6041 pmap_free_zero_pages(&free);
6042 return (cleared + not_cleared);
6046 * Apply the given advice to the specified range of addresses within the
6047 * given pmap. Depending on the advice, clear the referenced and/or
6048 * modified flags in each mapping and set the mapped page's dirty field.
6051 pmap_advise(pmap_t pmap, vm_offset_t sva, vm_offset_t eva, int advice)
6053 struct rwlock *lock;
6054 pml4_entry_t *pml4e;
6056 pd_entry_t oldpde, *pde;
6057 pt_entry_t *pte, PG_A, PG_G, PG_M, PG_RW, PG_V;
6058 vm_offset_t va_next;
6060 boolean_t anychanged;
6062 if (advice != MADV_DONTNEED && advice != MADV_FREE)
6064 pmap_delayed_invl_started();
6067 * A/D bit emulation requires an alternate code path when clearing
6068 * the modified and accessed bits below. Since this function is
6069 * advisory in nature we skip it entirely for pmaps that require
6070 * A/D bit emulation.
6072 if (pmap_emulate_ad_bits(pmap))
6075 PG_A = pmap_accessed_bit(pmap);
6076 PG_G = pmap_global_bit(pmap);
6077 PG_M = pmap_modified_bit(pmap);
6078 PG_V = pmap_valid_bit(pmap);
6079 PG_RW = pmap_rw_bit(pmap);
6082 for (; sva < eva; sva = va_next) {
6083 pml4e = pmap_pml4e(pmap, sva);
6084 if ((*pml4e & PG_V) == 0) {
6085 va_next = (sva + NBPML4) & ~PML4MASK;
6090 pdpe = pmap_pml4e_to_pdpe(pml4e, sva);
6091 if ((*pdpe & PG_V) == 0) {
6092 va_next = (sva + NBPDP) & ~PDPMASK;
6097 va_next = (sva + NBPDR) & ~PDRMASK;
6100 pde = pmap_pdpe_to_pde(pdpe, sva);
6102 if ((oldpde & PG_V) == 0)
6104 else if ((oldpde & PG_PS) != 0) {
6105 if ((oldpde & PG_MANAGED) == 0)
6108 if (!pmap_demote_pde_locked(pmap, pde, sva, &lock)) {
6113 * The large page mapping was destroyed.
6119 * Unless the page mappings are wired, remove the
6120 * mapping to a single page so that a subsequent
6121 * access may repromote. Since the underlying page
6122 * table page is fully populated, this removal never
6123 * frees a page table page.
6125 if ((oldpde & PG_W) == 0) {
6126 pte = pmap_pde_to_pte(pde, sva);
6127 KASSERT((*pte & PG_V) != 0,
6128 ("pmap_advise: invalid PTE"));
6129 pmap_remove_pte(pmap, pte, sva, *pde, NULL,
6138 for (pte = pmap_pde_to_pte(pde, sva); sva != va_next; pte++,
6140 if ((*pte & (PG_MANAGED | PG_V)) != (PG_MANAGED |
6143 else if ((*pte & (PG_M | PG_RW)) == (PG_M | PG_RW)) {
6144 if (advice == MADV_DONTNEED) {
6146 * Future calls to pmap_is_modified()
6147 * can be avoided by making the page
6150 m = PHYS_TO_VM_PAGE(*pte & PG_FRAME);
6153 atomic_clear_long(pte, PG_M | PG_A);
6154 } else if ((*pte & PG_A) != 0)
6155 atomic_clear_long(pte, PG_A);
6158 if ((*pte & PG_G) != 0)
6159 pmap_invalidate_page(pmap, sva);
6165 pmap_invalidate_all(pmap);
6167 pmap_delayed_invl_finished();
6171 * Clear the modify bits on the specified physical page.
6174 pmap_clear_modify(vm_page_t m)
6176 struct md_page *pvh;
6178 pv_entry_t next_pv, pv;
6179 pd_entry_t oldpde, *pde;
6180 pt_entry_t oldpte, *pte, PG_M, PG_RW, PG_V;
6181 struct rwlock *lock;
6183 int md_gen, pvh_gen;
6185 KASSERT((m->oflags & VPO_UNMANAGED) == 0,
6186 ("pmap_clear_modify: page %p is not managed", m));
6187 VM_OBJECT_ASSERT_WLOCKED(m->object);
6188 KASSERT(!vm_page_xbusied(m),
6189 ("pmap_clear_modify: page %p is exclusive busied", m));
6192 * If the page is not PGA_WRITEABLE, then no PTEs can have PG_M set.
6193 * If the object containing the page is locked and the page is not
6194 * exclusive busied, then PGA_WRITEABLE cannot be concurrently set.
6196 if ((m->aflags & PGA_WRITEABLE) == 0)
6198 pvh = pa_to_pvh(VM_PAGE_TO_PHYS(m));
6199 lock = VM_PAGE_TO_PV_LIST_LOCK(m);
6202 if ((m->flags & PG_FICTITIOUS) != 0)
6203 goto small_mappings;
6204 TAILQ_FOREACH_SAFE(pv, &pvh->pv_list, pv_next, next_pv) {
6206 if (!PMAP_TRYLOCK(pmap)) {
6207 pvh_gen = pvh->pv_gen;
6211 if (pvh_gen != pvh->pv_gen) {
6216 PG_M = pmap_modified_bit(pmap);
6217 PG_V = pmap_valid_bit(pmap);
6218 PG_RW = pmap_rw_bit(pmap);
6220 pde = pmap_pde(pmap, va);
6222 if ((oldpde & PG_RW) != 0) {
6223 if (pmap_demote_pde_locked(pmap, pde, va, &lock)) {
6224 if ((oldpde & PG_W) == 0) {
6226 * Write protect the mapping to a
6227 * single page so that a subsequent
6228 * write access may repromote.
6230 va += VM_PAGE_TO_PHYS(m) - (oldpde &
6232 pte = pmap_pde_to_pte(pde, va);
6234 if ((oldpte & PG_V) != 0) {
6235 while (!atomic_cmpset_long(pte,
6237 oldpte & ~(PG_M | PG_RW)))
6240 pmap_invalidate_page(pmap, va);
6248 TAILQ_FOREACH(pv, &m->md.pv_list, pv_next) {
6250 if (!PMAP_TRYLOCK(pmap)) {
6251 md_gen = m->md.pv_gen;
6252 pvh_gen = pvh->pv_gen;
6256 if (pvh_gen != pvh->pv_gen || md_gen != m->md.pv_gen) {
6261 PG_M = pmap_modified_bit(pmap);
6262 PG_RW = pmap_rw_bit(pmap);
6263 pde = pmap_pde(pmap, pv->pv_va);
6264 KASSERT((*pde & PG_PS) == 0, ("pmap_clear_modify: found"
6265 " a 2mpage in page %p's pv list", m));
6266 pte = pmap_pde_to_pte(pde, pv->pv_va);
6267 if ((*pte & (PG_M | PG_RW)) == (PG_M | PG_RW)) {
6268 atomic_clear_long(pte, PG_M);
6269 pmap_invalidate_page(pmap, pv->pv_va);
6277 * Miscellaneous support routines follow
6280 /* Adjust the cache mode for a 4KB page mapped via a PTE. */
6281 static __inline void
6282 pmap_pte_attr(pt_entry_t *pte, int cache_bits, int mask)
6287 * The cache mode bits are all in the low 32-bits of the
6288 * PTE, so we can just spin on updating the low 32-bits.
6291 opte = *(u_int *)pte;
6292 npte = opte & ~mask;
6294 } while (npte != opte && !atomic_cmpset_int((u_int *)pte, opte, npte));
6297 /* Adjust the cache mode for a 2MB page mapped via a PDE. */
6298 static __inline void
6299 pmap_pde_attr(pd_entry_t *pde, int cache_bits, int mask)
6304 * The cache mode bits are all in the low 32-bits of the
6305 * PDE, so we can just spin on updating the low 32-bits.
6308 opde = *(u_int *)pde;
6309 npde = opde & ~mask;
6311 } while (npde != opde && !atomic_cmpset_int((u_int *)pde, opde, npde));
6315 * Map a set of physical memory pages into the kernel virtual
6316 * address space. Return a pointer to where it is mapped. This
6317 * routine is intended to be used for mapping device memory,
6321 pmap_mapdev_attr(vm_paddr_t pa, vm_size_t size, int mode)
6323 struct pmap_preinit_mapping *ppim;
6324 vm_offset_t va, offset;
6328 offset = pa & PAGE_MASK;
6329 size = round_page(offset + size);
6330 pa = trunc_page(pa);
6332 if (!pmap_initialized) {
6334 for (i = 0; i < PMAP_PREINIT_MAPPING_COUNT; i++) {
6335 ppim = pmap_preinit_mapping + i;
6336 if (ppim->va == 0) {
6340 ppim->va = virtual_avail;
6341 virtual_avail += size;
6347 panic("%s: too many preinit mappings", __func__);
6350 * If we have a preinit mapping, re-use it.
6352 for (i = 0; i < PMAP_PREINIT_MAPPING_COUNT; i++) {
6353 ppim = pmap_preinit_mapping + i;
6354 if (ppim->pa == pa && ppim->sz == size &&
6356 return ((void *)(ppim->va + offset));
6359 * If the specified range of physical addresses fits within
6360 * the direct map window, use the direct map.
6362 if (pa < dmaplimit && pa + size < dmaplimit) {
6363 va = PHYS_TO_DMAP(pa);
6364 if (!pmap_change_attr(va, size, mode))
6365 return ((void *)(va + offset));
6367 va = kva_alloc(size);
6369 panic("%s: Couldn't allocate KVA", __func__);
6371 for (tmpsize = 0; tmpsize < size; tmpsize += PAGE_SIZE)
6372 pmap_kenter_attr(va + tmpsize, pa + tmpsize, mode);
6373 pmap_invalidate_range(kernel_pmap, va, va + tmpsize);
6374 pmap_invalidate_cache_range(va, va + tmpsize, FALSE);
6375 return ((void *)(va + offset));
6379 pmap_mapdev(vm_paddr_t pa, vm_size_t size)
6382 return (pmap_mapdev_attr(pa, size, PAT_UNCACHEABLE));
6386 pmap_mapbios(vm_paddr_t pa, vm_size_t size)
6389 return (pmap_mapdev_attr(pa, size, PAT_WRITE_BACK));
6393 pmap_unmapdev(vm_offset_t va, vm_size_t size)
6395 struct pmap_preinit_mapping *ppim;
6399 /* If we gave a direct map region in pmap_mapdev, do nothing */
6400 if (va >= DMAP_MIN_ADDRESS && va < DMAP_MAX_ADDRESS)
6402 offset = va & PAGE_MASK;
6403 size = round_page(offset + size);
6404 va = trunc_page(va);
6405 for (i = 0; i < PMAP_PREINIT_MAPPING_COUNT; i++) {
6406 ppim = pmap_preinit_mapping + i;
6407 if (ppim->va == va && ppim->sz == size) {
6408 if (pmap_initialized)
6414 if (va + size == virtual_avail)
6419 if (pmap_initialized)
6424 * Tries to demote a 1GB page mapping.
6427 pmap_demote_pdpe(pmap_t pmap, pdp_entry_t *pdpe, vm_offset_t va)
6429 pdp_entry_t newpdpe, oldpdpe;
6430 pd_entry_t *firstpde, newpde, *pde;
6431 pt_entry_t PG_A, PG_M, PG_RW, PG_V;
6435 PG_A = pmap_accessed_bit(pmap);
6436 PG_M = pmap_modified_bit(pmap);
6437 PG_V = pmap_valid_bit(pmap);
6438 PG_RW = pmap_rw_bit(pmap);
6440 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
6442 KASSERT((oldpdpe & (PG_PS | PG_V)) == (PG_PS | PG_V),
6443 ("pmap_demote_pdpe: oldpdpe is missing PG_PS and/or PG_V"));
6444 if ((mpde = vm_page_alloc(NULL, va >> PDPSHIFT, VM_ALLOC_INTERRUPT |
6445 VM_ALLOC_NOOBJ | VM_ALLOC_WIRED)) == NULL) {
6446 CTR2(KTR_PMAP, "pmap_demote_pdpe: failure for va %#lx"
6447 " in pmap %p", va, pmap);
6450 mpdepa = VM_PAGE_TO_PHYS(mpde);
6451 firstpde = (pd_entry_t *)PHYS_TO_DMAP(mpdepa);
6452 newpdpe = mpdepa | PG_M | PG_A | (oldpdpe & PG_U) | PG_RW | PG_V;
6453 KASSERT((oldpdpe & PG_A) != 0,
6454 ("pmap_demote_pdpe: oldpdpe is missing PG_A"));
6455 KASSERT((oldpdpe & (PG_M | PG_RW)) != PG_RW,
6456 ("pmap_demote_pdpe: oldpdpe is missing PG_M"));
6460 * Initialize the page directory page.
6462 for (pde = firstpde; pde < firstpde + NPDEPG; pde++) {
6468 * Demote the mapping.
6473 * Invalidate a stale recursive mapping of the page directory page.
6475 pmap_invalidate_page(pmap, (vm_offset_t)vtopde(va));
6477 pmap_pdpe_demotions++;
6478 CTR2(KTR_PMAP, "pmap_demote_pdpe: success for va %#lx"
6479 " in pmap %p", va, pmap);
6484 * Sets the memory attribute for the specified page.
6487 pmap_page_set_memattr(vm_page_t m, vm_memattr_t ma)
6490 m->md.pat_mode = ma;
6493 * If "m" is a normal page, update its direct mapping. This update
6494 * can be relied upon to perform any cache operations that are
6495 * required for data coherence.
6497 if ((m->flags & PG_FICTITIOUS) == 0 &&
6498 pmap_change_attr(PHYS_TO_DMAP(VM_PAGE_TO_PHYS(m)), PAGE_SIZE,
6500 panic("memory attribute change on the direct map failed");
6504 * Changes the specified virtual address range's memory type to that given by
6505 * the parameter "mode". The specified virtual address range must be
6506 * completely contained within either the direct map or the kernel map. If
6507 * the virtual address range is contained within the kernel map, then the
6508 * memory type for each of the corresponding ranges of the direct map is also
6509 * changed. (The corresponding ranges of the direct map are those ranges that
6510 * map the same physical pages as the specified virtual address range.) These
6511 * changes to the direct map are necessary because Intel describes the
6512 * behavior of their processors as "undefined" if two or more mappings to the
6513 * same physical page have different memory types.
6515 * Returns zero if the change completed successfully, and either EINVAL or
6516 * ENOMEM if the change failed. Specifically, EINVAL is returned if some part
6517 * of the virtual address range was not mapped, and ENOMEM is returned if
6518 * there was insufficient memory available to complete the change. In the
6519 * latter case, the memory type may have been changed on some part of the
6520 * virtual address range or the direct map.
6523 pmap_change_attr(vm_offset_t va, vm_size_t size, int mode)
6527 PMAP_LOCK(kernel_pmap);
6528 error = pmap_change_attr_locked(va, size, mode);
6529 PMAP_UNLOCK(kernel_pmap);
6534 pmap_change_attr_locked(vm_offset_t va, vm_size_t size, int mode)
6536 vm_offset_t base, offset, tmpva;
6537 vm_paddr_t pa_start, pa_end;
6541 int cache_bits_pte, cache_bits_pde, error;
6544 PMAP_LOCK_ASSERT(kernel_pmap, MA_OWNED);
6545 base = trunc_page(va);
6546 offset = va & PAGE_MASK;
6547 size = round_page(offset + size);
6550 * Only supported on kernel virtual addresses, including the direct
6551 * map but excluding the recursive map.
6553 if (base < DMAP_MIN_ADDRESS)
6556 cache_bits_pde = pmap_cache_bits(kernel_pmap, mode, 1);
6557 cache_bits_pte = pmap_cache_bits(kernel_pmap, mode, 0);
6561 * Pages that aren't mapped aren't supported. Also break down 2MB pages
6562 * into 4KB pages if required.
6564 for (tmpva = base; tmpva < base + size; ) {
6565 pdpe = pmap_pdpe(kernel_pmap, tmpva);
6566 if (pdpe == NULL || *pdpe == 0)
6568 if (*pdpe & PG_PS) {
6570 * If the current 1GB page already has the required
6571 * memory type, then we need not demote this page. Just
6572 * increment tmpva to the next 1GB page frame.
6574 if ((*pdpe & X86_PG_PDE_CACHE) == cache_bits_pde) {
6575 tmpva = trunc_1gpage(tmpva) + NBPDP;
6580 * If the current offset aligns with a 1GB page frame
6581 * and there is at least 1GB left within the range, then
6582 * we need not break down this page into 2MB pages.
6584 if ((tmpva & PDPMASK) == 0 &&
6585 tmpva + PDPMASK < base + size) {
6589 if (!pmap_demote_pdpe(kernel_pmap, pdpe, tmpva))
6592 pde = pmap_pdpe_to_pde(pdpe, tmpva);
6597 * If the current 2MB page already has the required
6598 * memory type, then we need not demote this page. Just
6599 * increment tmpva to the next 2MB page frame.
6601 if ((*pde & X86_PG_PDE_CACHE) == cache_bits_pde) {
6602 tmpva = trunc_2mpage(tmpva) + NBPDR;
6607 * If the current offset aligns with a 2MB page frame
6608 * and there is at least 2MB left within the range, then
6609 * we need not break down this page into 4KB pages.
6611 if ((tmpva & PDRMASK) == 0 &&
6612 tmpva + PDRMASK < base + size) {
6616 if (!pmap_demote_pde(kernel_pmap, pde, tmpva))
6619 pte = pmap_pde_to_pte(pde, tmpva);
6627 * Ok, all the pages exist, so run through them updating their
6628 * cache mode if required.
6630 pa_start = pa_end = 0;
6631 for (tmpva = base; tmpva < base + size; ) {
6632 pdpe = pmap_pdpe(kernel_pmap, tmpva);
6633 if (*pdpe & PG_PS) {
6634 if ((*pdpe & X86_PG_PDE_CACHE) != cache_bits_pde) {
6635 pmap_pde_attr(pdpe, cache_bits_pde,
6639 if (tmpva >= VM_MIN_KERNEL_ADDRESS &&
6640 (*pdpe & PG_PS_FRAME) < dmaplimit) {
6641 if (pa_start == pa_end) {
6642 /* Start physical address run. */
6643 pa_start = *pdpe & PG_PS_FRAME;
6644 pa_end = pa_start + NBPDP;
6645 } else if (pa_end == (*pdpe & PG_PS_FRAME))
6648 /* Run ended, update direct map. */
6649 error = pmap_change_attr_locked(
6650 PHYS_TO_DMAP(pa_start),
6651 pa_end - pa_start, mode);
6654 /* Start physical address run. */
6655 pa_start = *pdpe & PG_PS_FRAME;
6656 pa_end = pa_start + NBPDP;
6659 tmpva = trunc_1gpage(tmpva) + NBPDP;
6662 pde = pmap_pdpe_to_pde(pdpe, tmpva);
6664 if ((*pde & X86_PG_PDE_CACHE) != cache_bits_pde) {
6665 pmap_pde_attr(pde, cache_bits_pde,
6669 if (tmpva >= VM_MIN_KERNEL_ADDRESS &&
6670 (*pde & PG_PS_FRAME) < dmaplimit) {
6671 if (pa_start == pa_end) {
6672 /* Start physical address run. */
6673 pa_start = *pde & PG_PS_FRAME;
6674 pa_end = pa_start + NBPDR;
6675 } else if (pa_end == (*pde & PG_PS_FRAME))
6678 /* Run ended, update direct map. */
6679 error = pmap_change_attr_locked(
6680 PHYS_TO_DMAP(pa_start),
6681 pa_end - pa_start, mode);
6684 /* Start physical address run. */
6685 pa_start = *pde & PG_PS_FRAME;
6686 pa_end = pa_start + NBPDR;
6689 tmpva = trunc_2mpage(tmpva) + NBPDR;
6691 pte = pmap_pde_to_pte(pde, tmpva);
6692 if ((*pte & X86_PG_PTE_CACHE) != cache_bits_pte) {
6693 pmap_pte_attr(pte, cache_bits_pte,
6697 if (tmpva >= VM_MIN_KERNEL_ADDRESS &&
6698 (*pte & PG_PS_FRAME) < dmaplimit) {
6699 if (pa_start == pa_end) {
6700 /* Start physical address run. */
6701 pa_start = *pte & PG_FRAME;
6702 pa_end = pa_start + PAGE_SIZE;
6703 } else if (pa_end == (*pte & PG_FRAME))
6704 pa_end += PAGE_SIZE;
6706 /* Run ended, update direct map. */
6707 error = pmap_change_attr_locked(
6708 PHYS_TO_DMAP(pa_start),
6709 pa_end - pa_start, mode);
6712 /* Start physical address run. */
6713 pa_start = *pte & PG_FRAME;
6714 pa_end = pa_start + PAGE_SIZE;
6720 if (error == 0 && pa_start != pa_end)
6721 error = pmap_change_attr_locked(PHYS_TO_DMAP(pa_start),
6722 pa_end - pa_start, mode);
6725 * Flush CPU caches if required to make sure any data isn't cached that
6726 * shouldn't be, etc.
6729 pmap_invalidate_range(kernel_pmap, base, tmpva);
6730 pmap_invalidate_cache_range(base, tmpva, FALSE);
6736 * Demotes any mapping within the direct map region that covers more than the
6737 * specified range of physical addresses. This range's size must be a power
6738 * of two and its starting address must be a multiple of its size. Since the
6739 * demotion does not change any attributes of the mapping, a TLB invalidation
6740 * is not mandatory. The caller may, however, request a TLB invalidation.
6743 pmap_demote_DMAP(vm_paddr_t base, vm_size_t len, boolean_t invalidate)
6752 KASSERT(powerof2(len), ("pmap_demote_DMAP: len is not a power of 2"));
6753 KASSERT((base & (len - 1)) == 0,
6754 ("pmap_demote_DMAP: base is not a multiple of len"));
6755 if (len < NBPDP && base < dmaplimit) {
6756 va = PHYS_TO_DMAP(base);
6758 PMAP_LOCK(kernel_pmap);
6759 pdpe = pmap_pdpe(kernel_pmap, va);
6760 if ((*pdpe & X86_PG_V) == 0)
6761 panic("pmap_demote_DMAP: invalid PDPE");
6762 if ((*pdpe & PG_PS) != 0) {
6763 if (!pmap_demote_pdpe(kernel_pmap, pdpe, va))
6764 panic("pmap_demote_DMAP: PDPE failed");
6768 pde = pmap_pdpe_to_pde(pdpe, va);
6769 if ((*pde & X86_PG_V) == 0)
6770 panic("pmap_demote_DMAP: invalid PDE");
6771 if ((*pde & PG_PS) != 0) {
6772 if (!pmap_demote_pde(kernel_pmap, pde, va))
6773 panic("pmap_demote_DMAP: PDE failed");
6777 if (changed && invalidate)
6778 pmap_invalidate_page(kernel_pmap, va);
6779 PMAP_UNLOCK(kernel_pmap);
6784 * perform the pmap work for mincore
6787 pmap_mincore(pmap_t pmap, vm_offset_t addr, vm_paddr_t *locked_pa)
6790 pt_entry_t pte, PG_A, PG_M, PG_RW, PG_V;
6794 PG_A = pmap_accessed_bit(pmap);
6795 PG_M = pmap_modified_bit(pmap);
6796 PG_V = pmap_valid_bit(pmap);
6797 PG_RW = pmap_rw_bit(pmap);
6801 pdep = pmap_pde(pmap, addr);
6802 if (pdep != NULL && (*pdep & PG_V)) {
6803 if (*pdep & PG_PS) {
6805 /* Compute the physical address of the 4KB page. */
6806 pa = ((*pdep & PG_PS_FRAME) | (addr & PDRMASK)) &
6808 val = MINCORE_SUPER;
6810 pte = *pmap_pde_to_pte(pdep, addr);
6811 pa = pte & PG_FRAME;
6819 if ((pte & PG_V) != 0) {
6820 val |= MINCORE_INCORE;
6821 if ((pte & (PG_M | PG_RW)) == (PG_M | PG_RW))
6822 val |= MINCORE_MODIFIED | MINCORE_MODIFIED_OTHER;
6823 if ((pte & PG_A) != 0)
6824 val |= MINCORE_REFERENCED | MINCORE_REFERENCED_OTHER;
6826 if ((val & (MINCORE_MODIFIED_OTHER | MINCORE_REFERENCED_OTHER)) !=
6827 (MINCORE_MODIFIED_OTHER | MINCORE_REFERENCED_OTHER) &&
6828 (pte & (PG_MANAGED | PG_V)) == (PG_MANAGED | PG_V)) {
6829 /* Ensure that "PHYS_TO_VM_PAGE(pa)->object" doesn't change. */
6830 if (vm_page_pa_tryrelock(pmap, pa, locked_pa))
6833 PA_UNLOCK_COND(*locked_pa);
6839 pmap_pcid_alloc(pmap_t pmap, u_int cpuid)
6841 uint32_t gen, new_gen, pcid_next;
6843 CRITICAL_ASSERT(curthread);
6844 gen = PCPU_GET(pcid_gen);
6845 if (pmap->pm_pcids[cpuid].pm_pcid == PMAP_PCID_KERN ||
6846 pmap->pm_pcids[cpuid].pm_gen == gen)
6847 return (CR3_PCID_SAVE);
6848 pcid_next = PCPU_GET(pcid_next);
6849 KASSERT(pcid_next <= PMAP_PCID_OVERMAX, ("cpu %d pcid_next %#x",
6851 if (pcid_next == PMAP_PCID_OVERMAX) {
6855 PCPU_SET(pcid_gen, new_gen);
6856 pcid_next = PMAP_PCID_KERN + 1;
6860 pmap->pm_pcids[cpuid].pm_pcid = pcid_next;
6861 pmap->pm_pcids[cpuid].pm_gen = new_gen;
6862 PCPU_SET(pcid_next, pcid_next + 1);
6867 pmap_activate_sw(struct thread *td)
6869 pmap_t oldpmap, pmap;
6870 uint64_t cached, cr3;
6873 oldpmap = PCPU_GET(curpmap);
6874 pmap = vmspace_pmap(td->td_proc->p_vmspace);
6875 if (oldpmap == pmap)
6877 cpuid = PCPU_GET(cpuid);
6879 CPU_SET_ATOMIC(cpuid, &pmap->pm_active);
6881 CPU_SET(cpuid, &pmap->pm_active);
6884 if (pmap_pcid_enabled) {
6885 cached = pmap_pcid_alloc(pmap, cpuid);
6886 KASSERT(pmap->pm_pcids[cpuid].pm_pcid >= 0 &&
6887 pmap->pm_pcids[cpuid].pm_pcid < PMAP_PCID_OVERMAX,
6888 ("pmap %p cpu %d pcid %#x", pmap, cpuid,
6889 pmap->pm_pcids[cpuid].pm_pcid));
6890 KASSERT(pmap->pm_pcids[cpuid].pm_pcid != PMAP_PCID_KERN ||
6891 pmap == kernel_pmap,
6892 ("non-kernel pmap thread %p pmap %p cpu %d pcid %#x",
6893 td, pmap, cpuid, pmap->pm_pcids[cpuid].pm_pcid));
6894 if (!cached || (cr3 & ~CR3_PCID_MASK) != pmap->pm_cr3) {
6895 load_cr3(pmap->pm_cr3 | pmap->pm_pcids[cpuid].pm_pcid |
6898 PCPU_INC(pm_save_cnt);
6900 } else if (cr3 != pmap->pm_cr3) {
6901 load_cr3(pmap->pm_cr3);
6903 PCPU_SET(curpmap, pmap);
6905 CPU_CLR_ATOMIC(cpuid, &oldpmap->pm_active);
6907 CPU_CLR(cpuid, &oldpmap->pm_active);
6912 pmap_activate(struct thread *td)
6916 pmap_activate_sw(td);
6921 pmap_sync_icache(pmap_t pm, vm_offset_t va, vm_size_t sz)
6926 * Increase the starting virtual address of the given mapping if a
6927 * different alignment might result in more superpage mappings.
6930 pmap_align_superpage(vm_object_t object, vm_ooffset_t offset,
6931 vm_offset_t *addr, vm_size_t size)
6933 vm_offset_t superpage_offset;
6937 if (object != NULL && (object->flags & OBJ_COLORED) != 0)
6938 offset += ptoa(object->pg_color);
6939 superpage_offset = offset & PDRMASK;
6940 if (size - ((NBPDR - superpage_offset) & PDRMASK) < NBPDR ||
6941 (*addr & PDRMASK) == superpage_offset)
6943 if ((*addr & PDRMASK) < superpage_offset)
6944 *addr = (*addr & ~PDRMASK) + superpage_offset;
6946 *addr = ((*addr + PDRMASK) & ~PDRMASK) + superpage_offset;
6950 static unsigned long num_dirty_emulations;
6951 SYSCTL_ULONG(_vm_pmap, OID_AUTO, num_dirty_emulations, CTLFLAG_RW,
6952 &num_dirty_emulations, 0, NULL);
6954 static unsigned long num_accessed_emulations;
6955 SYSCTL_ULONG(_vm_pmap, OID_AUTO, num_accessed_emulations, CTLFLAG_RW,
6956 &num_accessed_emulations, 0, NULL);
6958 static unsigned long num_superpage_accessed_emulations;
6959 SYSCTL_ULONG(_vm_pmap, OID_AUTO, num_superpage_accessed_emulations, CTLFLAG_RW,
6960 &num_superpage_accessed_emulations, 0, NULL);
6962 static unsigned long ad_emulation_superpage_promotions;
6963 SYSCTL_ULONG(_vm_pmap, OID_AUTO, ad_emulation_superpage_promotions, CTLFLAG_RW,
6964 &ad_emulation_superpage_promotions, 0, NULL);
6965 #endif /* INVARIANTS */
6968 pmap_emulate_accessed_dirty(pmap_t pmap, vm_offset_t va, int ftype)
6971 struct rwlock *lock;
6974 pt_entry_t *pte, PG_A, PG_M, PG_RW, PG_V;
6976 KASSERT(ftype == VM_PROT_READ || ftype == VM_PROT_WRITE,
6977 ("pmap_emulate_accessed_dirty: invalid fault type %d", ftype));
6979 if (!pmap_emulate_ad_bits(pmap))
6982 PG_A = pmap_accessed_bit(pmap);
6983 PG_M = pmap_modified_bit(pmap);
6984 PG_V = pmap_valid_bit(pmap);
6985 PG_RW = pmap_rw_bit(pmap);
6991 pde = pmap_pde(pmap, va);
6992 if (pde == NULL || (*pde & PG_V) == 0)
6995 if ((*pde & PG_PS) != 0) {
6996 if (ftype == VM_PROT_READ) {
6998 atomic_add_long(&num_superpage_accessed_emulations, 1);
7006 pte = pmap_pde_to_pte(pde, va);
7007 if ((*pte & PG_V) == 0)
7010 if (ftype == VM_PROT_WRITE) {
7011 if ((*pte & PG_RW) == 0)
7014 * Set the modified and accessed bits simultaneously.
7016 * Intel EPT PTEs that do software emulation of A/D bits map
7017 * PG_A and PG_M to EPT_PG_READ and EPT_PG_WRITE respectively.
7018 * An EPT misconfiguration is triggered if the PTE is writable
7019 * but not readable (WR=10). This is avoided by setting PG_A
7020 * and PG_M simultaneously.
7022 *pte |= PG_M | PG_A;
7027 /* try to promote the mapping */
7028 if (va < VM_MAXUSER_ADDRESS)
7029 mpte = PHYS_TO_VM_PAGE(*pde & PG_FRAME);
7033 m = PHYS_TO_VM_PAGE(*pte & PG_FRAME);
7035 if ((mpte == NULL || mpte->wire_count == NPTEPG) &&
7036 pmap_ps_enabled(pmap) &&
7037 (m->flags & PG_FICTITIOUS) == 0 &&
7038 vm_reserv_level_iffullpop(m) == 0) {
7039 pmap_promote_pde(pmap, pde, va, &lock);
7041 atomic_add_long(&ad_emulation_superpage_promotions, 1);
7045 if (ftype == VM_PROT_WRITE)
7046 atomic_add_long(&num_dirty_emulations, 1);
7048 atomic_add_long(&num_accessed_emulations, 1);
7050 rv = 0; /* success */
7059 pmap_get_mapping(pmap_t pmap, vm_offset_t va, uint64_t *ptr, int *num)
7064 pt_entry_t *pte, PG_V;
7068 PG_V = pmap_valid_bit(pmap);
7071 pml4 = pmap_pml4e(pmap, va);
7073 if ((*pml4 & PG_V) == 0)
7076 pdp = pmap_pml4e_to_pdpe(pml4, va);
7078 if ((*pdp & PG_V) == 0 || (*pdp & PG_PS) != 0)
7081 pde = pmap_pdpe_to_pde(pdp, va);
7083 if ((*pde & PG_V) == 0 || (*pde & PG_PS) != 0)
7086 pte = pmap_pde_to_pte(pde, va);
7095 * Get the kernel virtual address of a set of physical pages. If there are
7096 * physical addresses not covered by the DMAP perform a transient mapping
7097 * that will be removed when calling pmap_unmap_io_transient.
7099 * \param page The pages the caller wishes to obtain the virtual
7100 * address on the kernel memory map.
7101 * \param vaddr On return contains the kernel virtual memory address
7102 * of the pages passed in the page parameter.
7103 * \param count Number of pages passed in.
7104 * \param can_fault TRUE if the thread using the mapped pages can take
7105 * page faults, FALSE otherwise.
7107 * \returns TRUE if the caller must call pmap_unmap_io_transient when
7108 * finished or FALSE otherwise.
7112 pmap_map_io_transient(vm_page_t page[], vm_offset_t vaddr[], int count,
7113 boolean_t can_fault)
7116 boolean_t needs_mapping;
7118 int cache_bits, error, i;
7121 * Allocate any KVA space that we need, this is done in a separate
7122 * loop to prevent calling vmem_alloc while pinned.
7124 needs_mapping = FALSE;
7125 for (i = 0; i < count; i++) {
7126 paddr = VM_PAGE_TO_PHYS(page[i]);
7127 if (__predict_false(paddr >= dmaplimit)) {
7128 error = vmem_alloc(kernel_arena, PAGE_SIZE,
7129 M_BESTFIT | M_WAITOK, &vaddr[i]);
7130 KASSERT(error == 0, ("vmem_alloc failed: %d", error));
7131 needs_mapping = TRUE;
7133 vaddr[i] = PHYS_TO_DMAP(paddr);
7137 /* Exit early if everything is covered by the DMAP */
7142 * NB: The sequence of updating a page table followed by accesses
7143 * to the corresponding pages used in the !DMAP case is subject to
7144 * the situation described in the "AMD64 Architecture Programmer's
7145 * Manual Volume 2: System Programming" rev. 3.23, "7.3.1 Special
7146 * Coherency Considerations". Therefore, issuing the INVLPG right
7147 * after modifying the PTE bits is crucial.
7151 for (i = 0; i < count; i++) {
7152 paddr = VM_PAGE_TO_PHYS(page[i]);
7153 if (paddr >= dmaplimit) {
7156 * Slow path, since we can get page faults
7157 * while mappings are active don't pin the
7158 * thread to the CPU and instead add a global
7159 * mapping visible to all CPUs.
7161 pmap_qenter(vaddr[i], &page[i], 1);
7163 pte = vtopte(vaddr[i]);
7164 cache_bits = pmap_cache_bits(kernel_pmap,
7165 page[i]->md.pat_mode, 0);
7166 pte_store(pte, paddr | X86_PG_RW | X86_PG_V |
7173 return (needs_mapping);
7177 pmap_unmap_io_transient(vm_page_t page[], vm_offset_t vaddr[], int count,
7178 boolean_t can_fault)
7185 for (i = 0; i < count; i++) {
7186 paddr = VM_PAGE_TO_PHYS(page[i]);
7187 if (paddr >= dmaplimit) {
7189 pmap_qremove(vaddr[i], 1);
7190 vmem_free(kernel_arena, vaddr[i], PAGE_SIZE);
7196 pmap_quick_enter_page(vm_page_t m)
7200 paddr = VM_PAGE_TO_PHYS(m);
7201 if (paddr < dmaplimit)
7202 return (PHYS_TO_DMAP(paddr));
7203 mtx_lock_spin(&qframe_mtx);
7204 KASSERT(*vtopte(qframe) == 0, ("qframe busy"));
7205 pte_store(vtopte(qframe), paddr | X86_PG_RW | X86_PG_V | X86_PG_A |
7206 X86_PG_M | pmap_cache_bits(kernel_pmap, m->md.pat_mode, 0));
7211 pmap_quick_remove_page(vm_offset_t addr)
7216 pte_store(vtopte(qframe), 0);
7218 mtx_unlock_spin(&qframe_mtx);
7221 #include "opt_ddb.h"
7223 #include <ddb/ddb.h>
7225 DB_SHOW_COMMAND(pte, pmap_print_pte)
7231 pt_entry_t *pte, PG_V;
7235 va = (vm_offset_t)addr;
7236 pmap = PCPU_GET(curpmap); /* XXX */
7238 db_printf("show pte addr\n");
7241 PG_V = pmap_valid_bit(pmap);
7242 pml4 = pmap_pml4e(pmap, va);
7243 db_printf("VA %#016lx pml4e %#016lx", va, *pml4);
7244 if ((*pml4 & PG_V) == 0) {
7248 pdp = pmap_pml4e_to_pdpe(pml4, va);
7249 db_printf(" pdpe %#016lx", *pdp);
7250 if ((*pdp & PG_V) == 0 || (*pdp & PG_PS) != 0) {
7254 pde = pmap_pdpe_to_pde(pdp, va);
7255 db_printf(" pde %#016lx", *pde);
7256 if ((*pde & PG_V) == 0 || (*pde & PG_PS) != 0) {
7260 pte = pmap_pde_to_pte(pde, va);
7261 db_printf(" pte %#016lx\n", *pte);
7264 DB_SHOW_COMMAND(phys2dmap, pmap_phys2dmap)
7269 a = (vm_paddr_t)addr;
7270 db_printf("0x%jx\n", (uintmax_t)PHYS_TO_DMAP(a));
7272 db_printf("show phys2dmap addr\n");