2 * Copyright (c) 1991 Regents of the University of California.
3 * Copyright (c) 1994 John S. Dyson
4 * Copyright (c) 1994 David Greenman
5 * Copyright (c) 2003 Peter Wemm
6 * Copyright (c) 2005-2008 Alan L. Cox <alc@cs.rice.edu>
7 * Copyright (c) 2008, 2009 The DragonFly Project.
8 * Copyright (c) 2008, 2009 Jordan Gordeev.
9 * Copyright (c) 2011-2012 Matthew Dillon
10 * All rights reserved.
12 * This code is derived from software contributed to Berkeley by
13 * the Systems Programming Group of the University of Utah Computer
14 * Science Department and William Jolitz of UUNET Technologies Inc.
16 * Redistribution and use in source and binary forms, with or without
17 * modification, are permitted provided that the following conditions
19 * 1. Redistributions of source code must retain the above copyright
20 * notice, this list of conditions and the following disclaimer.
21 * 2. Redistributions in binary form must reproduce the above copyright
22 * notice, this list of conditions and the following disclaimer in the
23 * documentation and/or other materials provided with the distribution.
24 * 3. All advertising materials mentioning features or use of this software
25 * must display the following acknowledgement:
26 * This product includes software developed by the University of
27 * California, Berkeley and its contributors.
28 * 4. Neither the name of the University nor the names of its contributors
29 * may be used to endorse or promote products derived from this software
30 * without specific prior written permission.
32 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
33 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
34 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
35 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
36 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
37 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
38 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
39 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
40 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
41 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
45 * Manage physical address maps for x86-64 systems.
49 #include "opt_disable_pse.h"
52 #include "opt_msgbuf.h"
54 #include <sys/param.h>
55 #include <sys/kernel.h>
57 #include <sys/msgbuf.h>
58 #include <sys/vmmeter.h>
60 #include <sys/systm.h>
63 #include <vm/vm_param.h>
64 #include <sys/sysctl.h>
66 #include <vm/vm_kern.h>
67 #include <vm/vm_page.h>
68 #include <vm/vm_map.h>
69 #include <vm/vm_object.h>
70 #include <vm/vm_extern.h>
71 #include <vm/vm_pageout.h>
72 #include <vm/vm_pager.h>
73 #include <vm/vm_zone.h>
76 #include <sys/thread2.h>
77 #include <sys/sysref2.h>
78 #include <sys/spinlock2.h>
79 #include <vm/vm_page2.h>
81 #include <machine/cputypes.h>
82 #include <machine/md_var.h>
83 #include <machine/specialreg.h>
84 #include <machine/smp.h>
85 #include <machine_base/apic/apicreg.h>
86 #include <machine/globaldata.h>
87 #include <machine/pmap.h>
88 #include <machine/pmap_inval.h>
89 #include <machine/inttypes.h>
93 #define PMAP_KEEP_PDIRS
94 #ifndef PMAP_SHPGPERPROC
95 #define PMAP_SHPGPERPROC 2000
98 #if defined(DIAGNOSTIC)
99 #define PMAP_DIAGNOSTIC
105 * pmap debugging will report who owns a pv lock when blocking.
109 #define PMAP_DEBUG_DECL ,const char *func, int lineno
110 #define PMAP_DEBUG_ARGS , __func__, __LINE__
111 #define PMAP_DEBUG_COPY , func, lineno
113 #define pv_get(pmap, pindex, pmarkp) _pv_get(pmap, pindex, pmarkp \
115 #define pv_lock(pv) _pv_lock(pv \
117 #define pv_hold_try(pv) _pv_hold_try(pv \
119 #define pv_alloc(pmap, pindex, isnewp) _pv_alloc(pmap, pindex, isnewp \
122 #define pv_free(pv, pvp) _pv_free(pv, pvp PMAP_DEBUG_ARGS)
126 #define PMAP_DEBUG_DECL
127 #define PMAP_DEBUG_ARGS
128 #define PMAP_DEBUG_COPY
130 #define pv_get(pmap, pindex, pmarkp) _pv_get(pmap, pindex, pmarkp)
131 #define pv_lock(pv) _pv_lock(pv)
132 #define pv_hold_try(pv) _pv_hold_try(pv)
133 #define pv_alloc(pmap, pindex, isnewp) _pv_alloc(pmap, pindex, isnewp)
134 #define pv_free(pv, pvp) _pv_free(pv, pvp)
139 * Get PDEs and PTEs for user/kernel address space
141 #define pdir_pde(m, v) (m[(vm_offset_t)(v) >> PDRSHIFT])
143 #define pmap_pde_v(pmap, pte) ((*(pd_entry_t *)pte & pmap->pmap_bits[PG_V_IDX]) != 0)
144 #define pmap_pte_w(pmap, pte) ((*(pt_entry_t *)pte & pmap->pmap_bits[PG_W_IDX]) != 0)
145 #define pmap_pte_m(pmap, pte) ((*(pt_entry_t *)pte & pmap->pmap_bits[PG_M_IDX]) != 0)
146 #define pmap_pte_u(pmap, pte) ((*(pt_entry_t *)pte & pmap->pmap_bits[PG_U_IDX]) != 0)
147 #define pmap_pte_v(pmap, pte) ((*(pt_entry_t *)pte & pmap->pmap_bits[PG_V_IDX]) != 0)
150 * Given a map and a machine independent protection code,
151 * convert to a vax protection code.
153 #define pte_prot(m, p) \
154 (m->protection_codes[p & (VM_PROT_READ|VM_PROT_WRITE|VM_PROT_EXECUTE)])
155 static int protection_codes[PROTECTION_CODES_SIZE];
157 struct pmap kernel_pmap;
159 MALLOC_DEFINE(M_OBJPMAP, "objpmap", "pmaps associated with VM objects");
161 vm_paddr_t avail_start; /* PA of first available physical page */
162 vm_paddr_t avail_end; /* PA of last available physical page */
163 vm_offset_t virtual2_start; /* cutout free area prior to kernel start */
164 vm_offset_t virtual2_end;
165 vm_offset_t virtual_start; /* VA of first avail page (after kernel bss) */
166 vm_offset_t virtual_end; /* VA of last avail page (end of kernel AS) */
167 vm_offset_t KvaStart; /* VA start of KVA space */
168 vm_offset_t KvaEnd; /* VA end of KVA space (non-inclusive) */
169 vm_offset_t KvaSize; /* max size of kernel virtual address space */
170 static boolean_t pmap_initialized = FALSE; /* Has pmap_init completed? */
171 //static int pgeflag; /* PG_G or-in */
172 //static int pseflag; /* PG_PS or-in */
176 static vm_paddr_t dmaplimit;
178 vm_offset_t kernel_vm_end = VM_MIN_KERNEL_ADDRESS;
180 static pt_entry_t pat_pte_index[PAT_INDEX_SIZE]; /* PAT -> PG_ bits */
181 /*static pt_entry_t pat_pde_index[PAT_INDEX_SIZE];*/ /* PAT -> PG_ bits */
183 static uint64_t KPTbase;
184 static uint64_t KPTphys;
185 static uint64_t KPDphys; /* phys addr of kernel level 2 */
186 static uint64_t KPDbase; /* phys addr of kernel level 2 @ KERNBASE */
187 uint64_t KPDPphys; /* phys addr of kernel level 3 */
188 uint64_t KPML4phys; /* phys addr of kernel level 4 */
190 static uint64_t DMPDphys; /* phys addr of direct mapped level 2 */
191 static uint64_t DMPDPphys; /* phys addr of direct mapped level 3 */
194 * Data for the pv entry allocation mechanism
196 static vm_zone_t pvzone;
197 static struct vm_zone pvzone_store;
198 static struct vm_object pvzone_obj;
199 static int pv_entry_max=0, pv_entry_high_water=0;
200 static int pmap_pagedaemon_waken = 0;
201 static struct pv_entry *pvinit;
204 * All those kernel PT submaps that BSD is so fond of
206 pt_entry_t *CMAP1 = NULL, *ptmmap;
207 caddr_t CADDR1 = NULL, ptvmmap = NULL;
208 static pt_entry_t *msgbufmap;
209 struct msgbuf *msgbufp=NULL;
212 * PMAP default PG_* bits. Needed to be able to add
213 * EPT/NPT pagetable pmap_bits for the VMM module
215 uint64_t pmap_bits_default[] = {
216 REGULAR_PMAP, /* TYPE_IDX 0 */
217 X86_PG_V, /* PG_V_IDX 1 */
218 X86_PG_RW, /* PG_RW_IDX 2 */
219 X86_PG_U, /* PG_U_IDX 3 */
220 X86_PG_A, /* PG_A_IDX 4 */
221 X86_PG_M, /* PG_M_IDX 5 */
222 X86_PG_PS, /* PG_PS_IDX3 6 */
223 X86_PG_G, /* PG_G_IDX 7 */
224 X86_PG_AVAIL1, /* PG_AVAIL1_IDX 8 */
225 X86_PG_AVAIL2, /* PG_AVAIL2_IDX 9 */
226 X86_PG_AVAIL3, /* PG_AVAIL3_IDX 10 */
227 X86_PG_NC_PWT | X86_PG_NC_PCD, /* PG_N_IDX 11 */
232 static pt_entry_t *pt_crashdumpmap;
233 static caddr_t crashdumpmap;
235 static int pmap_debug = 0;
236 SYSCTL_INT(_machdep, OID_AUTO, pmap_debug, CTLFLAG_RW,
237 &pmap_debug, 0, "Debug pmap's");
239 static int pmap_enter_debug = 0;
240 SYSCTL_INT(_machdep, OID_AUTO, pmap_enter_debug, CTLFLAG_RW,
241 &pmap_enter_debug, 0, "Debug pmap_enter's");
243 static int pmap_yield_count = 64;
244 SYSCTL_INT(_machdep, OID_AUTO, pmap_yield_count, CTLFLAG_RW,
245 &pmap_yield_count, 0, "Yield during init_pt/release");
246 static int pmap_mmu_optimize = 0;
247 SYSCTL_INT(_machdep, OID_AUTO, pmap_mmu_optimize, CTLFLAG_RW,
248 &pmap_mmu_optimize, 0, "Share page table pages when possible");
249 int pmap_fast_kernel_cpusync = 0;
250 SYSCTL_INT(_machdep, OID_AUTO, pmap_fast_kernel_cpusync, CTLFLAG_RW,
251 &pmap_fast_kernel_cpusync, 0, "Share page table pages when possible");
252 int pmap_dynamic_delete = 0;
253 SYSCTL_INT(_machdep, OID_AUTO, pmap_dynamic_delete, CTLFLAG_RW,
254 &pmap_dynamic_delete, 0, "Dynamically delete PT/PD/PDPs");
258 /* Standard user access funtions */
259 extern int std_copyinstr (const void *udaddr, void *kaddr, size_t len,
261 extern int std_copyin (const void *udaddr, void *kaddr, size_t len);
262 extern int std_copyout (const void *kaddr, void *udaddr, size_t len);
263 extern int std_fubyte (const uint8_t *base);
264 extern int std_subyte (uint8_t *base, uint8_t byte);
265 extern int32_t std_fuword32 (const uint32_t *base);
266 extern int64_t std_fuword64 (const uint64_t *base);
267 extern int std_suword64 (uint64_t *base, uint64_t word);
268 extern int std_suword32 (uint32_t *base, int word);
269 extern uint32_t std_swapu32 (volatile uint32_t *base, uint32_t v);
270 extern uint64_t std_swapu64 (volatile uint64_t *base, uint64_t v);
272 static void pv_hold(pv_entry_t pv);
273 static int _pv_hold_try(pv_entry_t pv
275 static void pv_drop(pv_entry_t pv);
276 static void _pv_lock(pv_entry_t pv
278 static void pv_unlock(pv_entry_t pv);
279 static pv_entry_t _pv_alloc(pmap_t pmap, vm_pindex_t pindex, int *isnew
281 static pv_entry_t _pv_get(pmap_t pmap, vm_pindex_t pindex, vm_pindex_t **pmarkp
283 static void _pv_free(pv_entry_t pv, pv_entry_t pvp PMAP_DEBUG_DECL);
284 static pv_entry_t pv_get_try(pmap_t pmap, vm_pindex_t pindex,
285 vm_pindex_t **pmarkp, int *errorp);
286 static void pv_put(pv_entry_t pv);
287 static void *pv_pte_lookup(pv_entry_t pv, vm_pindex_t pindex);
288 static pv_entry_t pmap_allocpte(pmap_t pmap, vm_pindex_t ptepindex,
290 static pv_entry_t pmap_allocpte_seg(pmap_t pmap, vm_pindex_t ptepindex,
291 pv_entry_t *pvpp, vm_map_entry_t entry, vm_offset_t va);
292 static void pmap_remove_pv_pte(pv_entry_t pv, pv_entry_t pvp,
293 pmap_inval_bulk_t *bulk, int destroy);
294 static vm_page_t pmap_remove_pv_page(pv_entry_t pv);
295 static int pmap_release_pv(pv_entry_t pv, pv_entry_t pvp,
296 pmap_inval_bulk_t *bulk);
298 struct pmap_scan_info;
299 static void pmap_remove_callback(pmap_t pmap, struct pmap_scan_info *info,
300 pv_entry_t pte_pv, vm_pindex_t *pte_placemark,
301 pv_entry_t pt_pv, int sharept,
302 vm_offset_t va, pt_entry_t *ptep, void *arg __unused);
303 static void pmap_protect_callback(pmap_t pmap, struct pmap_scan_info *info,
304 pv_entry_t pte_pv, vm_pindex_t *pte_placemark,
305 pv_entry_t pt_pv, int sharept,
306 vm_offset_t va, pt_entry_t *ptep, void *arg __unused);
308 static void i386_protection_init (void);
309 static void create_pagetables(vm_paddr_t *firstaddr);
310 static void pmap_remove_all (vm_page_t m);
311 static boolean_t pmap_testbit (vm_page_t m, int bit);
313 static pt_entry_t * pmap_pte_quick (pmap_t pmap, vm_offset_t va);
314 static vm_offset_t pmap_kmem_choose(vm_offset_t addr);
316 static void pmap_pinit_defaults(struct pmap *pmap);
317 static void pv_placemarker_wait(pmap_t pmap, vm_pindex_t *pmark);
318 static void pv_placemarker_wakeup(pmap_t pmap, vm_pindex_t *pmark);
320 static unsigned pdir4mb;
323 pv_entry_compare(pv_entry_t pv1, pv_entry_t pv2)
325 if (pv1->pv_pindex < pv2->pv_pindex)
327 if (pv1->pv_pindex > pv2->pv_pindex)
332 RB_GENERATE2(pv_entry_rb_tree, pv_entry, pv_entry,
333 pv_entry_compare, vm_pindex_t, pv_pindex);
337 pmap_page_stats_adding(vm_page_t m)
339 globaldata_t gd = mycpu;
341 if (TAILQ_EMPTY(&m->md.pv_list)) {
342 ++gd->gd_vmtotal.t_arm;
343 } else if (TAILQ_FIRST(&m->md.pv_list) ==
344 TAILQ_LAST(&m->md.pv_list, md_page_pv_list)) {
345 ++gd->gd_vmtotal.t_armshr;
346 ++gd->gd_vmtotal.t_avmshr;
348 ++gd->gd_vmtotal.t_avmshr;
354 pmap_page_stats_deleting(vm_page_t m)
356 globaldata_t gd = mycpu;
358 if (TAILQ_EMPTY(&m->md.pv_list)) {
359 --gd->gd_vmtotal.t_arm;
360 } else if (TAILQ_FIRST(&m->md.pv_list) ==
361 TAILQ_LAST(&m->md.pv_list, md_page_pv_list)) {
362 --gd->gd_vmtotal.t_armshr;
363 --gd->gd_vmtotal.t_avmshr;
365 --gd->gd_vmtotal.t_avmshr;
370 * Move the kernel virtual free pointer to the next
371 * 2MB. This is used to help improve performance
372 * by using a large (2MB) page for much of the kernel
373 * (.text, .data, .bss)
377 pmap_kmem_choose(vm_offset_t addr)
379 vm_offset_t newaddr = addr;
381 newaddr = roundup2(addr, NBPDR);
388 * Super fast pmap_pte routine best used when scanning the pv lists.
389 * This eliminates many course-grained invltlb calls. Note that many of
390 * the pv list scans are across different pmaps and it is very wasteful
391 * to do an entire invltlb when checking a single mapping.
393 static __inline pt_entry_t *pmap_pte(pmap_t pmap, vm_offset_t va);
397 pmap_pte_quick(pmap_t pmap, vm_offset_t va)
399 return pmap_pte(pmap, va);
403 * Returns the pindex of a page table entry (representing a terminal page).
404 * There are NUPTE_TOTAL page table entries possible (a huge number)
406 * x86-64 has a 48-bit address space, where bit 47 is sign-extended out.
407 * We want to properly translate negative KVAs.
411 pmap_pte_pindex(vm_offset_t va)
413 return ((va >> PAGE_SHIFT) & (NUPTE_TOTAL - 1));
417 * Returns the pindex of a page table.
421 pmap_pt_pindex(vm_offset_t va)
423 return (NUPTE_TOTAL + ((va >> PDRSHIFT) & (NUPT_TOTAL - 1)));
427 * Returns the pindex of a page directory.
431 pmap_pd_pindex(vm_offset_t va)
433 return (NUPTE_TOTAL + NUPT_TOTAL +
434 ((va >> PDPSHIFT) & (NUPD_TOTAL - 1)));
439 pmap_pdp_pindex(vm_offset_t va)
441 return (NUPTE_TOTAL + NUPT_TOTAL + NUPD_TOTAL +
442 ((va >> PML4SHIFT) & (NUPDP_TOTAL - 1)));
447 pmap_pml4_pindex(void)
449 return (NUPTE_TOTAL + NUPT_TOTAL + NUPD_TOTAL + NUPDP_TOTAL);
453 * Return various clipped indexes for a given VA
455 * Returns the index of a pt in a page directory, representing a page
460 pmap_pt_index(vm_offset_t va)
462 return ((va >> PDRSHIFT) & ((1ul << NPDEPGSHIFT) - 1));
466 * Returns the index of a pd in a page directory page, representing a page
471 pmap_pd_index(vm_offset_t va)
473 return ((va >> PDPSHIFT) & ((1ul << NPDPEPGSHIFT) - 1));
477 * Returns the index of a pdp in the pml4 table, representing a page
482 pmap_pdp_index(vm_offset_t va)
484 return ((va >> PML4SHIFT) & ((1ul << NPML4EPGSHIFT) - 1));
488 * The placemarker hash must be broken up into four zones so lock
489 * ordering semantics continue to work (e.g. pte, pt, pd, then pdp).
491 * Placemarkers are used to 'lock' page table indices that do not have
492 * a pv_entry. This allows the pmap to support managed and unmanaged
493 * pages and shared page tables.
495 #define PM_PLACE_BASE (PM_PLACEMARKS >> 2)
499 pmap_placemarker_hash(pmap_t pmap, vm_pindex_t pindex)
503 if (pindex < pmap_pt_pindex(0)) /* zone 0 - PTE */
505 else if (pindex < pmap_pd_pindex(0)) /* zone 1 - PT */
507 else if (pindex < pmap_pdp_pindex(0)) /* zone 2 - PD */
508 hi = PM_PLACE_BASE << 1;
509 else /* zone 3 - PDP (and PML4E) */
510 hi = PM_PLACE_BASE | (PM_PLACE_BASE << 1);
511 hi += pindex & (PM_PLACE_BASE - 1);
513 return (&pmap->pm_placemarks[hi]);
518 * Generic procedure to index a pte from a pt, pd, or pdp.
520 * NOTE: Normally passed pindex as pmap_xx_index(). pmap_xx_pindex() is NOT
521 * a page table page index but is instead of PV lookup index.
525 pv_pte_lookup(pv_entry_t pv, vm_pindex_t pindex)
529 pte = (pt_entry_t *)PHYS_TO_DMAP(VM_PAGE_TO_PHYS(pv->pv_m));
530 return(&pte[pindex]);
534 * Return pointer to PDP slot in the PML4
538 pmap_pdp(pmap_t pmap, vm_offset_t va)
540 return (&pmap->pm_pml4[pmap_pdp_index(va)]);
544 * Return pointer to PD slot in the PDP given a pointer to the PDP
548 pmap_pdp_to_pd(pml4_entry_t pdp_pte, vm_offset_t va)
552 pd = (pdp_entry_t *)PHYS_TO_DMAP(pdp_pte & PG_FRAME);
553 return (&pd[pmap_pd_index(va)]);
557 * Return pointer to PD slot in the PDP.
561 pmap_pd(pmap_t pmap, vm_offset_t va)
565 pdp = pmap_pdp(pmap, va);
566 if ((*pdp & pmap->pmap_bits[PG_V_IDX]) == 0)
568 return (pmap_pdp_to_pd(*pdp, va));
572 * Return pointer to PT slot in the PD given a pointer to the PD
576 pmap_pd_to_pt(pdp_entry_t pd_pte, vm_offset_t va)
580 pt = (pd_entry_t *)PHYS_TO_DMAP(pd_pte & PG_FRAME);
581 return (&pt[pmap_pt_index(va)]);
585 * Return pointer to PT slot in the PD
587 * SIMPLE PMAP NOTE: Simple pmaps (embedded in objects) do not have PDPs,
588 * so we cannot lookup the PD via the PDP. Instead we
589 * must look it up via the pmap.
593 pmap_pt(pmap_t pmap, vm_offset_t va)
597 vm_pindex_t pd_pindex;
599 if (pmap->pm_flags & PMAP_FLAG_SIMPLE) {
600 pd_pindex = pmap_pd_pindex(va);
601 spin_lock(&pmap->pm_spin);
602 pv = pv_entry_rb_tree_RB_LOOKUP(&pmap->pm_pvroot, pd_pindex);
603 spin_unlock(&pmap->pm_spin);
604 if (pv == NULL || pv->pv_m == NULL)
606 return (pmap_pd_to_pt(VM_PAGE_TO_PHYS(pv->pv_m), va));
608 pd = pmap_pd(pmap, va);
609 if (pd == NULL || (*pd & pmap->pmap_bits[PG_V_IDX]) == 0)
611 return (pmap_pd_to_pt(*pd, va));
616 * Return pointer to PTE slot in the PT given a pointer to the PT
620 pmap_pt_to_pte(pd_entry_t pt_pte, vm_offset_t va)
624 pte = (pt_entry_t *)PHYS_TO_DMAP(pt_pte & PG_FRAME);
625 return (&pte[pmap_pte_index(va)]);
629 * Return pointer to PTE slot in the PT
633 pmap_pte(pmap_t pmap, vm_offset_t va)
637 pt = pmap_pt(pmap, va);
638 if (pt == NULL || (*pt & pmap->pmap_bits[PG_V_IDX]) == 0)
640 if ((*pt & pmap->pmap_bits[PG_PS_IDX]) != 0)
641 return ((pt_entry_t *)pt);
642 return (pmap_pt_to_pte(*pt, va));
646 * Of all the layers (PTE, PT, PD, PDP, PML4) the best one to cache is
647 * the PT layer. This will speed up core pmap operations considerably.
649 * NOTE: The pmap spinlock does not need to be held but the passed-in pv
650 * must be in a known associated state (typically by being locked when
651 * the pmap spinlock isn't held). We allow the race for that case.
653 * NOTE: pm_pvhint is only accessed (read) with the spin-lock held, using
654 * cpu_ccfence() to prevent compiler optimizations from reloading the
659 pv_cache(pv_entry_t pv, vm_pindex_t pindex)
661 if (pindex >= pmap_pt_pindex(0) && pindex < pmap_pd_pindex(0)) {
663 pv->pv_pmap->pm_pvhint = pv;
669 * Return address of PT slot in PD (KVM only)
671 * Cannot be used for user page tables because it might interfere with
672 * the shared page-table-page optimization (pmap_mmu_optimize).
676 vtopt(vm_offset_t va)
678 uint64_t mask = ((1ul << (NPDEPGSHIFT + NPDPEPGSHIFT +
679 NPML4EPGSHIFT)) - 1);
681 return (PDmap + ((va >> PDRSHIFT) & mask));
685 * KVM - return address of PTE slot in PT
689 vtopte(vm_offset_t va)
691 uint64_t mask = ((1ul << (NPTEPGSHIFT + NPDEPGSHIFT +
692 NPDPEPGSHIFT + NPML4EPGSHIFT)) - 1);
694 return (PTmap + ((va >> PAGE_SHIFT) & mask));
698 allocpages(vm_paddr_t *firstaddr, long n)
703 bzero((void *)ret, n * PAGE_SIZE);
704 *firstaddr += n * PAGE_SIZE;
710 create_pagetables(vm_paddr_t *firstaddr)
712 long i; /* must be 64 bits */
718 * We are running (mostly) V=P at this point
720 * Calculate NKPT - number of kernel page tables. We have to
721 * accomodoate prealloction of the vm_page_array, dump bitmap,
722 * MSGBUF_SIZE, and other stuff. Be generous.
724 * Maxmem is in pages.
726 * ndmpdp is the number of 1GB pages we wish to map.
728 ndmpdp = (ptoa(Maxmem) + NBPDP - 1) >> PDPSHIFT;
729 if (ndmpdp < 4) /* Minimum 4GB of dirmap */
731 KKASSERT(ndmpdp <= NKPDPE * NPDEPG);
734 * Starting at the beginning of kvm (not KERNBASE).
736 nkpt_phys = (Maxmem * sizeof(struct vm_page) + NBPDR - 1) / NBPDR;
737 nkpt_phys += (Maxmem * sizeof(struct pv_entry) + NBPDR - 1) / NBPDR;
738 nkpt_phys += ((nkpt + nkpt + 1 + NKPML4E + NKPDPE + NDMPML4E +
739 ndmpdp) + 511) / 512;
743 * Starting at KERNBASE - map 2G worth of page table pages.
744 * KERNBASE is offset -2G from the end of kvm.
746 nkpt_base = (NPDPEPG - KPDPI) * NPTEPG; /* typically 2 x 512 */
751 KPTbase = allocpages(firstaddr, nkpt_base);
752 KPTphys = allocpages(firstaddr, nkpt_phys);
753 KPML4phys = allocpages(firstaddr, 1);
754 KPDPphys = allocpages(firstaddr, NKPML4E);
755 KPDphys = allocpages(firstaddr, NKPDPE);
758 * Calculate the page directory base for KERNBASE,
759 * that is where we start populating the page table pages.
760 * Basically this is the end - 2.
762 KPDbase = KPDphys + ((NKPDPE - (NPDPEPG - KPDPI)) << PAGE_SHIFT);
764 DMPDPphys = allocpages(firstaddr, NDMPML4E);
765 if ((amd_feature & AMDID_PAGE1GB) == 0)
766 DMPDphys = allocpages(firstaddr, ndmpdp);
767 dmaplimit = (vm_paddr_t)ndmpdp << PDPSHIFT;
770 * Fill in the underlying page table pages for the area around
771 * KERNBASE. This remaps low physical memory to KERNBASE.
773 * Read-only from zero to physfree
774 * XXX not fully used, underneath 2M pages
776 for (i = 0; (i << PAGE_SHIFT) < *firstaddr; i++) {
777 ((pt_entry_t *)KPTbase)[i] = i << PAGE_SHIFT;
778 ((pt_entry_t *)KPTbase)[i] |=
779 pmap_bits_default[PG_RW_IDX] |
780 pmap_bits_default[PG_V_IDX] |
781 pmap_bits_default[PG_G_IDX];
785 * Now map the initial kernel page tables. One block of page
786 * tables is placed at the beginning of kernel virtual memory,
787 * and another block is placed at KERNBASE to map the kernel binary,
788 * data, bss, and initial pre-allocations.
790 for (i = 0; i < nkpt_base; i++) {
791 ((pd_entry_t *)KPDbase)[i] = KPTbase + (i << PAGE_SHIFT);
792 ((pd_entry_t *)KPDbase)[i] |=
793 pmap_bits_default[PG_RW_IDX] |
794 pmap_bits_default[PG_V_IDX];
796 for (i = 0; i < nkpt_phys; i++) {
797 ((pd_entry_t *)KPDphys)[i] = KPTphys + (i << PAGE_SHIFT);
798 ((pd_entry_t *)KPDphys)[i] |=
799 pmap_bits_default[PG_RW_IDX] |
800 pmap_bits_default[PG_V_IDX];
804 * Map from zero to end of allocations using 2M pages as an
805 * optimization. This will bypass some of the KPTBase pages
806 * above in the KERNBASE area.
808 for (i = 0; (i << PDRSHIFT) < *firstaddr; i++) {
809 ((pd_entry_t *)KPDbase)[i] = i << PDRSHIFT;
810 ((pd_entry_t *)KPDbase)[i] |=
811 pmap_bits_default[PG_RW_IDX] |
812 pmap_bits_default[PG_V_IDX] |
813 pmap_bits_default[PG_PS_IDX] |
814 pmap_bits_default[PG_G_IDX];
818 * And connect up the PD to the PDP. The kernel pmap is expected
819 * to pre-populate all of its PDs. See NKPDPE in vmparam.h.
821 for (i = 0; i < NKPDPE; i++) {
822 ((pdp_entry_t *)KPDPphys)[NPDPEPG - NKPDPE + i] =
823 KPDphys + (i << PAGE_SHIFT);
824 ((pdp_entry_t *)KPDPphys)[NPDPEPG - NKPDPE + i] |=
825 pmap_bits_default[PG_RW_IDX] |
826 pmap_bits_default[PG_V_IDX] |
827 pmap_bits_default[PG_U_IDX];
831 * Now set up the direct map space using either 2MB or 1GB pages
832 * Preset PG_M and PG_A because demotion expects it.
834 * When filling in entries in the PD pages make sure any excess
835 * entries are set to zero as we allocated enough PD pages
837 if ((amd_feature & AMDID_PAGE1GB) == 0) {
838 for (i = 0; i < NPDEPG * ndmpdp; i++) {
839 ((pd_entry_t *)DMPDphys)[i] = i << PDRSHIFT;
840 ((pd_entry_t *)DMPDphys)[i] |=
841 pmap_bits_default[PG_RW_IDX] |
842 pmap_bits_default[PG_V_IDX] |
843 pmap_bits_default[PG_PS_IDX] |
844 pmap_bits_default[PG_G_IDX] |
845 pmap_bits_default[PG_M_IDX] |
846 pmap_bits_default[PG_A_IDX];
850 * And the direct map space's PDP
852 for (i = 0; i < ndmpdp; i++) {
853 ((pdp_entry_t *)DMPDPphys)[i] = DMPDphys +
855 ((pdp_entry_t *)DMPDPphys)[i] |=
856 pmap_bits_default[PG_RW_IDX] |
857 pmap_bits_default[PG_V_IDX] |
858 pmap_bits_default[PG_U_IDX];
861 for (i = 0; i < ndmpdp; i++) {
862 ((pdp_entry_t *)DMPDPphys)[i] =
863 (vm_paddr_t)i << PDPSHIFT;
864 ((pdp_entry_t *)DMPDPphys)[i] |=
865 pmap_bits_default[PG_RW_IDX] |
866 pmap_bits_default[PG_V_IDX] |
867 pmap_bits_default[PG_PS_IDX] |
868 pmap_bits_default[PG_G_IDX] |
869 pmap_bits_default[PG_M_IDX] |
870 pmap_bits_default[PG_A_IDX];
874 /* And recursively map PML4 to itself in order to get PTmap */
875 ((pdp_entry_t *)KPML4phys)[PML4PML4I] = KPML4phys;
876 ((pdp_entry_t *)KPML4phys)[PML4PML4I] |=
877 pmap_bits_default[PG_RW_IDX] |
878 pmap_bits_default[PG_V_IDX] |
879 pmap_bits_default[PG_U_IDX];
882 * Connect the Direct Map slots up to the PML4
884 for (j = 0; j < NDMPML4E; ++j) {
885 ((pdp_entry_t *)KPML4phys)[DMPML4I + j] =
886 (DMPDPphys + ((vm_paddr_t)j << PML4SHIFT)) |
887 pmap_bits_default[PG_RW_IDX] |
888 pmap_bits_default[PG_V_IDX] |
889 pmap_bits_default[PG_U_IDX];
893 * Connect the KVA slot up to the PML4
895 ((pdp_entry_t *)KPML4phys)[KPML4I] = KPDPphys;
896 ((pdp_entry_t *)KPML4phys)[KPML4I] |=
897 pmap_bits_default[PG_RW_IDX] |
898 pmap_bits_default[PG_V_IDX] |
899 pmap_bits_default[PG_U_IDX];
903 * Bootstrap the system enough to run with virtual memory.
905 * On the i386 this is called after mapping has already been enabled
906 * and just syncs the pmap module with what has already been done.
907 * [We can't call it easily with mapping off since the kernel is not
908 * mapped with PA == VA, hence we would have to relocate every address
909 * from the linked base (virtual) address "KERNBASE" to the actual
910 * (physical) address starting relative to 0]
913 pmap_bootstrap(vm_paddr_t *firstaddr)
919 KvaStart = VM_MIN_KERNEL_ADDRESS;
920 KvaEnd = VM_MAX_KERNEL_ADDRESS;
921 KvaSize = KvaEnd - KvaStart;
923 avail_start = *firstaddr;
926 * Create an initial set of page tables to run the kernel in.
928 create_pagetables(firstaddr);
930 virtual2_start = KvaStart;
931 virtual2_end = PTOV_OFFSET;
933 virtual_start = (vm_offset_t) PTOV_OFFSET + *firstaddr;
934 virtual_start = pmap_kmem_choose(virtual_start);
936 virtual_end = VM_MAX_KERNEL_ADDRESS;
938 /* XXX do %cr0 as well */
939 load_cr4(rcr4() | CR4_PGE | CR4_PSE);
943 * Initialize protection array.
945 i386_protection_init();
948 * The kernel's pmap is statically allocated so we don't have to use
949 * pmap_create, which is unlikely to work correctly at this part of
950 * the boot sequence (XXX and which no longer exists).
952 kernel_pmap.pm_pml4 = (pdp_entry_t *) (PTOV_OFFSET + KPML4phys);
953 kernel_pmap.pm_count = 1;
954 CPUMASK_ASSALLONES(kernel_pmap.pm_active);
955 RB_INIT(&kernel_pmap.pm_pvroot);
956 spin_init(&kernel_pmap.pm_spin, "pmapbootstrap");
957 for (i = 0; i < PM_PLACEMARKS; ++i)
958 kernel_pmap.pm_placemarks[i] = PM_NOPLACEMARK;
961 * Reserve some special page table entries/VA space for temporary
964 #define SYSMAP(c, p, v, n) \
965 v = (c)va; va += ((n)*PAGE_SIZE); p = pte; pte += (n);
971 * CMAP1/CMAP2 are used for zeroing and copying pages.
973 SYSMAP(caddr_t, CMAP1, CADDR1, 1)
978 SYSMAP(caddr_t, pt_crashdumpmap, crashdumpmap, MAXDUMPPGS);
981 * ptvmmap is used for reading arbitrary physical pages via
984 SYSMAP(caddr_t, ptmmap, ptvmmap, 1)
987 * msgbufp is used to map the system message buffer.
988 * XXX msgbufmap is not used.
990 SYSMAP(struct msgbuf *, msgbufmap, msgbufp,
991 atop(round_page(MSGBUF_SIZE)))
994 virtual_start = pmap_kmem_choose(virtual_start);
999 * PG_G is terribly broken on SMP because we IPI invltlb's in some
1000 * cases rather then invl1pg. Actually, I don't even know why it
1001 * works under UP because self-referential page table mappings
1006 * Initialize the 4MB page size flag
1010 * The 4MB page version of the initial
1011 * kernel page mapping.
1015 #if !defined(DISABLE_PSE)
1016 if (cpu_feature & CPUID_PSE) {
1019 * Note that we have enabled PSE mode
1021 // pseflag = kernel_pmap.pmap_bits[PG_PS_IDX];
1022 ptditmp = *(PTmap + x86_64_btop(KERNBASE));
1023 ptditmp &= ~(NBPDR - 1);
1024 ptditmp |= pmap_bits_default[PG_V_IDX] |
1025 pmap_bits_default[PG_RW_IDX] |
1026 pmap_bits_default[PG_PS_IDX] |
1027 pmap_bits_default[PG_U_IDX];
1034 /* Initialize the PAT MSR */
1036 pmap_pinit_defaults(&kernel_pmap);
1038 TUNABLE_INT_FETCH("machdep.pmap_fast_kernel_cpusync",
1039 &pmap_fast_kernel_cpusync);
1044 * Setup the PAT MSR.
1053 * Default values mapping PATi,PCD,PWT bits at system reset.
1054 * The default values effectively ignore the PATi bit by
1055 * repeating the encodings for 0-3 in 4-7, and map the PCD
1056 * and PWT bit combinations to the expected PAT types.
1058 pat_msr = PAT_VALUE(0, PAT_WRITE_BACK) | /* 000 */
1059 PAT_VALUE(1, PAT_WRITE_THROUGH) | /* 001 */
1060 PAT_VALUE(2, PAT_UNCACHED) | /* 010 */
1061 PAT_VALUE(3, PAT_UNCACHEABLE) | /* 011 */
1062 PAT_VALUE(4, PAT_WRITE_BACK) | /* 100 */
1063 PAT_VALUE(5, PAT_WRITE_THROUGH) | /* 101 */
1064 PAT_VALUE(6, PAT_UNCACHED) | /* 110 */
1065 PAT_VALUE(7, PAT_UNCACHEABLE); /* 111 */
1066 pat_pte_index[PAT_WRITE_BACK] = 0;
1067 pat_pte_index[PAT_WRITE_THROUGH]= 0 | X86_PG_NC_PWT;
1068 pat_pte_index[PAT_UNCACHED] = X86_PG_NC_PCD;
1069 pat_pte_index[PAT_UNCACHEABLE] = X86_PG_NC_PCD | X86_PG_NC_PWT;
1070 pat_pte_index[PAT_WRITE_PROTECTED] = pat_pte_index[PAT_UNCACHEABLE];
1071 pat_pte_index[PAT_WRITE_COMBINING] = pat_pte_index[PAT_UNCACHEABLE];
1073 if (cpu_feature & CPUID_PAT) {
1075 * If we support the PAT then set-up entries for
1076 * WRITE_PROTECTED and WRITE_COMBINING using bit patterns
1079 pat_msr = (pat_msr & ~PAT_MASK(4)) |
1080 PAT_VALUE(4, PAT_WRITE_PROTECTED);
1081 pat_msr = (pat_msr & ~PAT_MASK(5)) |
1082 PAT_VALUE(5, PAT_WRITE_COMBINING);
1083 pat_pte_index[PAT_WRITE_PROTECTED] = X86_PG_PTE_PAT | 0;
1084 pat_pte_index[PAT_WRITE_COMBINING] = X86_PG_PTE_PAT | X86_PG_NC_PWT;
1087 * Then enable the PAT
1092 load_cr4(cr4 & ~CR4_PGE);
1094 /* Disable caches (CD = 1, NW = 0). */
1096 load_cr0((cr0 & ~CR0_NW) | CR0_CD);
1098 /* Flushes caches and TLBs. */
1102 /* Update PAT and index table. */
1103 wrmsr(MSR_PAT, pat_msr);
1105 /* Flush caches and TLBs again. */
1109 /* Restore caches and PGE. */
1117 * Set 4mb pdir for mp startup
1122 if (cpu_feature & CPUID_PSE) {
1123 load_cr4(rcr4() | CR4_PSE);
1124 if (pdir4mb && mycpu->gd_cpuid == 0) { /* only on BSP */
1131 * Initialize the pmap module.
1132 * Called by vm_init, to initialize any structures that the pmap
1133 * system needs to map virtual memory.
1134 * pmap_init has been enhanced to support in a fairly consistant
1135 * way, discontiguous physical memory.
1144 * Allocate memory for random pmap data structures. Includes the
1148 for (i = 0; i < vm_page_array_size; i++) {
1151 m = &vm_page_array[i];
1152 TAILQ_INIT(&m->md.pv_list);
1156 * init the pv free list
1158 initial_pvs = vm_page_array_size;
1159 if (initial_pvs < MINPV)
1160 initial_pvs = MINPV;
1161 pvzone = &pvzone_store;
1162 pvinit = (void *)kmem_alloc(&kernel_map,
1163 initial_pvs * sizeof (struct pv_entry),
1165 zbootinit(pvzone, "PV ENTRY", sizeof (struct pv_entry),
1166 pvinit, initial_pvs);
1169 * Now it is safe to enable pv_table recording.
1171 pmap_initialized = TRUE;
1175 * Initialize the address space (zone) for the pv_entries. Set a
1176 * high water mark so that the system can recover from excessive
1177 * numbers of pv entries.
1182 int shpgperproc = PMAP_SHPGPERPROC;
1185 TUNABLE_INT_FETCH("vm.pmap.shpgperproc", &shpgperproc);
1186 pv_entry_max = shpgperproc * maxproc + vm_page_array_size;
1187 TUNABLE_INT_FETCH("vm.pmap.pv_entries", &pv_entry_max);
1188 pv_entry_high_water = 9 * (pv_entry_max / 10);
1191 * Subtract out pages already installed in the zone (hack)
1193 entry_max = pv_entry_max - vm_page_array_size;
1197 zinitna(pvzone, &pvzone_obj, NULL, 0, entry_max, ZONE_INTERRUPT);
1200 * Enable dynamic deletion of empty higher-level page table pages
1201 * by default only if system memory is < 8GB (use 7GB for slop).
1202 * This can save a little memory, but imposes significant
1203 * performance overhead for things like bulk builds, and for programs
1204 * which do a lot of memory mapping and memory unmapping.
1206 if (pmap_dynamic_delete < 0) {
1207 if (vmstats.v_page_count < 7LL * 1024 * 1024 * 1024 / PAGE_SIZE)
1208 pmap_dynamic_delete = 1;
1210 pmap_dynamic_delete = 0;
1215 * Typically used to initialize a fictitious page by vm/device_pager.c
1218 pmap_page_init(struct vm_page *m)
1221 TAILQ_INIT(&m->md.pv_list);
1224 /***************************************************
1225 * Low level helper routines.....
1226 ***************************************************/
1229 * this routine defines the region(s) of memory that should
1230 * not be tested for the modified bit.
1234 pmap_track_modified(vm_pindex_t pindex)
1236 vm_offset_t va = (vm_offset_t)pindex << PAGE_SHIFT;
1237 if ((va < clean_sva) || (va >= clean_eva))
1244 * Extract the physical page address associated with the map/VA pair.
1245 * The page must be wired for this to work reliably.
1248 pmap_extract(pmap_t pmap, vm_offset_t va, void **handlep)
1255 if (va >= VM_MAX_USER_ADDRESS) {
1257 * Kernel page directories might be direct-mapped and
1258 * there is typically no PV tracking of pte's
1262 pt = pmap_pt(pmap, va);
1263 if (pt && (*pt & pmap->pmap_bits[PG_V_IDX])) {
1264 if (*pt & pmap->pmap_bits[PG_PS_IDX]) {
1265 rtval = *pt & PG_PS_FRAME;
1266 rtval |= va & PDRMASK;
1268 ptep = pmap_pt_to_pte(*pt, va);
1269 if (*pt & pmap->pmap_bits[PG_V_IDX]) {
1270 rtval = *ptep & PG_FRAME;
1271 rtval |= va & PAGE_MASK;
1279 * User pages currently do not direct-map the page directory
1280 * and some pages might not used managed PVs. But all PT's
1283 pt_pv = pv_get(pmap, pmap_pt_pindex(va), NULL);
1285 ptep = pv_pte_lookup(pt_pv, pmap_pte_index(va));
1286 if (*ptep & pmap->pmap_bits[PG_V_IDX]) {
1287 rtval = *ptep & PG_FRAME;
1288 rtval |= va & PAGE_MASK;
1291 *handlep = pt_pv; /* locked until done */
1294 } else if (handlep) {
1302 pmap_extract_done(void *handle)
1305 pv_put((pv_entry_t)handle);
1309 * Similar to extract but checks protections, SMP-friendly short-cut for
1310 * vm_fault_page[_quick](). Can return NULL to cause the caller to
1311 * fall-through to the real fault code. Does not work with HVM page
1314 * The returned page, if not NULL, is held (and not busied).
1316 * WARNING! THE RETURNED PAGE IS ONLY HELD AND NOT SUITABLE FOR READING
1320 pmap_fault_page_quick(pmap_t pmap, vm_offset_t va, vm_prot_t prot, int *busyp)
1323 va < VM_MAX_USER_ADDRESS &&
1324 (pmap->pm_flags & PMAP_HVM) == 0) {
1332 req = pmap->pmap_bits[PG_V_IDX] |
1333 pmap->pmap_bits[PG_U_IDX];
1334 if (prot & VM_PROT_WRITE)
1335 req |= pmap->pmap_bits[PG_RW_IDX];
1337 pt_pv = pv_get(pmap, pmap_pt_pindex(va), NULL);
1340 ptep = pv_pte_lookup(pt_pv, pmap_pte_index(va));
1341 if ((*ptep & req) != req) {
1345 pte_pv = pv_get_try(pmap, pmap_pte_pindex(va), NULL, &error);
1346 if (pte_pv && error == 0) {
1348 if (prot & VM_PROT_WRITE) {
1349 /* interlocked by presence of pv_entry */
1353 if (prot & VM_PROT_WRITE) {
1354 if (vm_page_busy_try(m, TRUE))
1365 } else if (pte_pv) {
1369 /* error, since we didn't request a placemarker */
1380 * Extract the physical page address associated kernel virtual address.
1383 pmap_kextract(vm_offset_t va)
1385 pd_entry_t pt; /* pt entry in pd */
1388 if (va >= DMAP_MIN_ADDRESS && va < DMAP_MAX_ADDRESS) {
1389 pa = DMAP_TO_PHYS(va);
1392 if (pt & kernel_pmap.pmap_bits[PG_PS_IDX]) {
1393 pa = (pt & PG_PS_FRAME) | (va & PDRMASK);
1396 * Beware of a concurrent promotion that changes the
1397 * PDE at this point! For example, vtopte() must not
1398 * be used to access the PTE because it would use the
1399 * new PDE. It is, however, safe to use the old PDE
1400 * because the page table page is preserved by the
1403 pa = *pmap_pt_to_pte(pt, va);
1404 pa = (pa & PG_FRAME) | (va & PAGE_MASK);
1410 /***************************************************
1411 * Low level mapping routines.....
1412 ***************************************************/
1415 * Routine: pmap_kenter
1417 * Add a wired page to the KVA
1418 * NOTE! note that in order for the mapping to take effect -- you
1419 * should do an invltlb after doing the pmap_kenter().
1422 pmap_kenter(vm_offset_t va, vm_paddr_t pa)
1428 kernel_pmap.pmap_bits[PG_RW_IDX] |
1429 kernel_pmap.pmap_bits[PG_V_IDX];
1433 pmap_inval_smp(&kernel_pmap, va, 1, ptep, npte);
1437 pmap_inval_smp(&kernel_pmap, va, ptep, npte);
1444 * Similar to pmap_kenter(), except we only invalidate the mapping on the
1445 * current CPU. Returns 0 if the previous pte was 0, 1 if it wasn't
1446 * (caller can conditionalize calling smp_invltlb()).
1449 pmap_kenter_quick(vm_offset_t va, vm_paddr_t pa)
1455 npte = pa | kernel_pmap.pmap_bits[PG_RW_IDX] |
1456 kernel_pmap.pmap_bits[PG_V_IDX];
1465 atomic_swap_long(ptep, npte);
1466 cpu_invlpg((void *)va);
1472 * Enter addresses into the kernel pmap but don't bother
1473 * doing any tlb invalidations. Caller will do a rollup
1474 * invalidation via pmap_rollup_inval().
1477 pmap_kenter_noinval(vm_offset_t va, vm_paddr_t pa)
1484 kernel_pmap.pmap_bits[PG_RW_IDX] |
1485 kernel_pmap.pmap_bits[PG_V_IDX];
1494 atomic_swap_long(ptep, npte);
1495 cpu_invlpg((void *)va);
1501 * remove a page from the kernel pagetables
1504 pmap_kremove(vm_offset_t va)
1509 pmap_inval_smp(&kernel_pmap, va, 1, ptep, 0);
1513 pmap_kremove_quick(vm_offset_t va)
1518 (void)pte_load_clear(ptep);
1519 cpu_invlpg((void *)va);
1523 * Remove addresses from the kernel pmap but don't bother
1524 * doing any tlb invalidations. Caller will do a rollup
1525 * invalidation via pmap_rollup_inval().
1528 pmap_kremove_noinval(vm_offset_t va)
1533 (void)pte_load_clear(ptep);
1537 * XXX these need to be recoded. They are not used in any critical path.
1540 pmap_kmodify_rw(vm_offset_t va)
1542 atomic_set_long(vtopte(va), kernel_pmap.pmap_bits[PG_RW_IDX]);
1543 cpu_invlpg((void *)va);
1548 pmap_kmodify_nc(vm_offset_t va)
1550 atomic_set_long(vtopte(va), PG_N);
1551 cpu_invlpg((void *)va);
1556 * Used to map a range of physical addresses into kernel virtual
1557 * address space during the low level boot, typically to map the
1558 * dump bitmap, message buffer, and vm_page_array.
1560 * These mappings are typically made at some pointer after the end of the
1563 * We could return PHYS_TO_DMAP(start) here and not allocate any
1564 * via (*virtp), but then kmem from userland and kernel dumps won't
1565 * have access to the related pointers.
1568 pmap_map(vm_offset_t *virtp, vm_paddr_t start, vm_paddr_t end, int prot)
1571 vm_offset_t va_start;
1573 /*return PHYS_TO_DMAP(start);*/
1578 while (start < end) {
1579 pmap_kenter_quick(va, start);
1587 #define PMAP_CLFLUSH_THRESHOLD (2 * 1024 * 1024)
1590 * Remove the specified set of pages from the data and instruction caches.
1592 * In contrast to pmap_invalidate_cache_range(), this function does not
1593 * rely on the CPU's self-snoop feature, because it is intended for use
1594 * when moving pages into a different cache domain.
1597 pmap_invalidate_cache_pages(vm_page_t *pages, int count)
1599 vm_offset_t daddr, eva;
1602 if (count >= PMAP_CLFLUSH_THRESHOLD / PAGE_SIZE ||
1603 (cpu_feature & CPUID_CLFSH) == 0)
1607 for (i = 0; i < count; i++) {
1608 daddr = PHYS_TO_DMAP(VM_PAGE_TO_PHYS(pages[i]));
1609 eva = daddr + PAGE_SIZE;
1610 for (; daddr < eva; daddr += cpu_clflush_line_size)
1618 pmap_invalidate_cache_range(vm_offset_t sva, vm_offset_t eva)
1620 KASSERT((sva & PAGE_MASK) == 0,
1621 ("pmap_invalidate_cache_range: sva not page-aligned"));
1622 KASSERT((eva & PAGE_MASK) == 0,
1623 ("pmap_invalidate_cache_range: eva not page-aligned"));
1625 if (cpu_feature & CPUID_SS) {
1626 ; /* If "Self Snoop" is supported, do nothing. */
1628 /* Globally invalidate caches */
1629 cpu_wbinvd_on_all_cpus();
1634 * Invalidate the specified range of virtual memory on all cpus associated
1638 pmap_invalidate_range(pmap_t pmap, vm_offset_t sva, vm_offset_t eva)
1640 pmap_inval_smp(pmap, sva, (eva - sva) >> PAGE_SHIFT, NULL, 0);
1644 * Add a list of wired pages to the kva. This routine is used for temporary
1645 * kernel mappings such as those found in buffer cache buffer. Page
1646 * modifications and accesses are not tracked or recorded.
1648 * NOTE! Old mappings are simply overwritten, and we cannot assume relaxed
1649 * semantics as previous mappings may have been zerod without any
1652 * The page *must* be wired.
1655 pmap_qenter(vm_offset_t beg_va, vm_page_t *m, int count)
1660 end_va = beg_va + count * PAGE_SIZE;
1662 for (va = beg_va; va < end_va; va += PAGE_SIZE) {
1667 pte = VM_PAGE_TO_PHYS(*m) |
1668 kernel_pmap.pmap_bits[PG_RW_IDX] |
1669 kernel_pmap.pmap_bits[PG_V_IDX] |
1670 kernel_pmap.pmap_cache_bits[(*m)->pat_mode];
1672 atomic_swap_long(ptep, pte);
1675 pmap_invalidate_range(&kernel_pmap, beg_va, end_va);
1679 * This routine jerks page mappings from the kernel -- it is meant only
1680 * for temporary mappings such as those found in buffer cache buffers.
1681 * No recording modified or access status occurs.
1683 * MPSAFE, INTERRUPT SAFE (cluster callback)
1686 pmap_qremove(vm_offset_t beg_va, int count)
1691 end_va = beg_va + count * PAGE_SIZE;
1693 for (va = beg_va; va < end_va; va += PAGE_SIZE) {
1697 (void)pte_load_clear(pte);
1698 cpu_invlpg((void *)va);
1700 pmap_invalidate_range(&kernel_pmap, beg_va, end_va);
1704 * This routine removes temporary kernel mappings, only invalidating them
1705 * on the current cpu. It should only be used under carefully controlled
1709 pmap_qremove_quick(vm_offset_t beg_va, int count)
1714 end_va = beg_va + count * PAGE_SIZE;
1716 for (va = beg_va; va < end_va; va += PAGE_SIZE) {
1720 (void)pte_load_clear(pte);
1721 cpu_invlpg((void *)va);
1726 * This routine removes temporary kernel mappings *without* invalidating
1727 * the TLB. It can only be used on permanent kva reservations such as those
1728 * found in buffer cache buffers, under carefully controlled circumstances.
1730 * NOTE: Repopulating these KVAs requires unconditional invalidation.
1731 * (pmap_qenter() does unconditional invalidation).
1734 pmap_qremove_noinval(vm_offset_t beg_va, int count)
1739 end_va = beg_va + count * PAGE_SIZE;
1741 for (va = beg_va; va < end_va; va += PAGE_SIZE) {
1745 (void)pte_load_clear(pte);
1750 * Create a new thread and optionally associate it with a (new) process.
1751 * NOTE! the new thread's cpu may not equal the current cpu.
1754 pmap_init_thread(thread_t td)
1756 /* enforce pcb placement & alignment */
1757 td->td_pcb = (struct pcb *)(td->td_kstack + td->td_kstack_size) - 1;
1758 td->td_pcb = (struct pcb *)((intptr_t)td->td_pcb & ~(intptr_t)0xF);
1759 td->td_savefpu = &td->td_pcb->pcb_save;
1760 td->td_sp = (char *)td->td_pcb; /* no -16 */
1764 * This routine directly affects the fork perf for a process.
1767 pmap_init_proc(struct proc *p)
1772 pmap_pinit_defaults(struct pmap *pmap)
1774 bcopy(pmap_bits_default, pmap->pmap_bits,
1775 sizeof(pmap_bits_default));
1776 bcopy(protection_codes, pmap->protection_codes,
1777 sizeof(protection_codes));
1778 bcopy(pat_pte_index, pmap->pmap_cache_bits,
1779 sizeof(pat_pte_index));
1780 pmap->pmap_cache_mask = X86_PG_NC_PWT | X86_PG_NC_PCD | X86_PG_PTE_PAT;
1781 pmap->copyinstr = std_copyinstr;
1782 pmap->copyin = std_copyin;
1783 pmap->copyout = std_copyout;
1784 pmap->fubyte = std_fubyte;
1785 pmap->subyte = std_subyte;
1786 pmap->fuword32 = std_fuword32;
1787 pmap->fuword64 = std_fuword64;
1788 pmap->suword32 = std_suword32;
1789 pmap->suword64 = std_suword64;
1790 pmap->swapu32 = std_swapu32;
1791 pmap->swapu64 = std_swapu64;
1794 * Initialize pmap0/vmspace0.
1796 * On architectures where the kernel pmap is not integrated into the user
1797 * process pmap, this pmap represents the process pmap, not the kernel pmap.
1798 * kernel_pmap should be used to directly access the kernel_pmap.
1801 pmap_pinit0(struct pmap *pmap)
1805 pmap->pm_pml4 = (pml4_entry_t *)(PTOV_OFFSET + KPML4phys);
1807 CPUMASK_ASSZERO(pmap->pm_active);
1808 pmap->pm_pvhint = NULL;
1809 RB_INIT(&pmap->pm_pvroot);
1810 spin_init(&pmap->pm_spin, "pmapinit0");
1811 for (i = 0; i < PM_PLACEMARKS; ++i)
1812 pmap->pm_placemarks[i] = PM_NOPLACEMARK;
1813 bzero(&pmap->pm_stats, sizeof pmap->pm_stats);
1814 pmap_pinit_defaults(pmap);
1818 * Initialize a preallocated and zeroed pmap structure,
1819 * such as one in a vmspace structure.
1822 pmap_pinit_simple(struct pmap *pmap)
1827 * Misc initialization
1830 CPUMASK_ASSZERO(pmap->pm_active);
1831 pmap->pm_pvhint = NULL;
1832 pmap->pm_flags = PMAP_FLAG_SIMPLE;
1834 pmap_pinit_defaults(pmap);
1837 * Don't blow up locks/tokens on re-use (XXX fix/use drop code
1840 if (pmap->pm_pmlpv == NULL) {
1841 RB_INIT(&pmap->pm_pvroot);
1842 bzero(&pmap->pm_stats, sizeof pmap->pm_stats);
1843 spin_init(&pmap->pm_spin, "pmapinitsimple");
1844 for (i = 0; i < PM_PLACEMARKS; ++i)
1845 pmap->pm_placemarks[i] = PM_NOPLACEMARK;
1850 pmap_pinit(struct pmap *pmap)
1855 if (pmap->pm_pmlpv) {
1856 if (pmap->pmap_bits[TYPE_IDX] != REGULAR_PMAP) {
1861 pmap_pinit_simple(pmap);
1862 pmap->pm_flags &= ~PMAP_FLAG_SIMPLE;
1865 * No need to allocate page table space yet but we do need a valid
1866 * page directory table.
1868 if (pmap->pm_pml4 == NULL) {
1870 (pml4_entry_t *)kmem_alloc_pageable(&kernel_map,
1876 * Allocate the page directory page, which wires it even though
1877 * it isn't being entered into some higher level page table (it
1878 * being the highest level). If one is already cached we don't
1879 * have to do anything.
1881 if ((pv = pmap->pm_pmlpv) == NULL) {
1882 pv = pmap_allocpte(pmap, pmap_pml4_pindex(), NULL);
1883 pmap->pm_pmlpv = pv;
1884 pmap_kenter((vm_offset_t)pmap->pm_pml4,
1885 VM_PAGE_TO_PHYS(pv->pv_m));
1889 * Install DMAP and KMAP.
1891 for (j = 0; j < NDMPML4E; ++j) {
1892 pmap->pm_pml4[DMPML4I + j] =
1893 (DMPDPphys + ((vm_paddr_t)j << PML4SHIFT)) |
1894 pmap->pmap_bits[PG_RW_IDX] |
1895 pmap->pmap_bits[PG_V_IDX] |
1896 pmap->pmap_bits[PG_U_IDX];
1898 pmap->pm_pml4[KPML4I] = KPDPphys |
1899 pmap->pmap_bits[PG_RW_IDX] |
1900 pmap->pmap_bits[PG_V_IDX] |
1901 pmap->pmap_bits[PG_U_IDX];
1904 * install self-referential address mapping entry
1906 pmap->pm_pml4[PML4PML4I] = VM_PAGE_TO_PHYS(pv->pv_m) |
1907 pmap->pmap_bits[PG_V_IDX] |
1908 pmap->pmap_bits[PG_RW_IDX] |
1909 pmap->pmap_bits[PG_A_IDX] |
1910 pmap->pmap_bits[PG_M_IDX];
1912 KKASSERT(pv->pv_m->flags & PG_MAPPED);
1913 KKASSERT(pv->pv_m->flags & PG_WRITEABLE);
1915 KKASSERT(pmap->pm_pml4[255] == 0);
1916 KKASSERT(RB_ROOT(&pmap->pm_pvroot) == pv);
1917 KKASSERT(pv->pv_entry.rbe_left == NULL);
1918 KKASSERT(pv->pv_entry.rbe_right == NULL);
1922 * Clean up a pmap structure so it can be physically freed. This routine
1923 * is called by the vmspace dtor function. A great deal of pmap data is
1924 * left passively mapped to improve vmspace management so we have a bit
1925 * of cleanup work to do here.
1928 pmap_puninit(pmap_t pmap)
1933 KKASSERT(CPUMASK_TESTZERO(pmap->pm_active));
1934 if ((pv = pmap->pm_pmlpv) != NULL) {
1935 if (pv_hold_try(pv) == 0)
1937 KKASSERT(pv == pmap->pm_pmlpv);
1938 p = pmap_remove_pv_page(pv);
1940 pv = NULL; /* safety */
1941 pmap_kremove((vm_offset_t)pmap->pm_pml4);
1942 vm_page_busy_wait(p, FALSE, "pgpun");
1943 KKASSERT(p->flags & (PG_FICTITIOUS|PG_UNMANAGED));
1944 vm_page_unwire(p, 0);
1945 vm_page_flag_clear(p, PG_MAPPED | PG_WRITEABLE);
1948 * XXX eventually clean out PML4 static entries and
1949 * use vm_page_free_zero()
1952 pmap->pm_pmlpv = NULL;
1954 if (pmap->pm_pml4) {
1955 KKASSERT(pmap->pm_pml4 != (void *)(PTOV_OFFSET + KPML4phys));
1956 kmem_free(&kernel_map, (vm_offset_t)pmap->pm_pml4, PAGE_SIZE);
1957 pmap->pm_pml4 = NULL;
1959 KKASSERT(pmap->pm_stats.resident_count == 0);
1960 KKASSERT(pmap->pm_stats.wired_count == 0);
1964 * This function is now unused (used to add the pmap to the pmap_list)
1967 pmap_pinit2(struct pmap *pmap)
1972 * This routine is called when various levels in the page table need to
1973 * be populated. This routine cannot fail.
1975 * This function returns two locked pv_entry's, one representing the
1976 * requested pv and one representing the requested pv's parent pv. If
1977 * an intermediate page table does not exist it will be created, mapped,
1978 * wired, and the parent page table will be given an additional hold
1979 * count representing the presence of the child pv_entry.
1983 pmap_allocpte(pmap_t pmap, vm_pindex_t ptepindex, pv_entry_t *pvpp)
1989 vm_pindex_t pt_pindex;
1995 * If the pv already exists and we aren't being asked for the
1996 * parent page table page we can just return it. A locked+held pv
1997 * is returned. The pv will also have a second hold related to the
1998 * pmap association that we don't have to worry about.
2001 pv = pv_alloc(pmap, ptepindex, &isnew);
2002 if (isnew == 0 && pvpp == NULL)
2006 * Special case terminal PVs. These are not page table pages so
2007 * no vm_page is allocated (the caller supplied the vm_page). If
2008 * pvpp is non-NULL we are being asked to also removed the pt_pv
2011 * Note that pt_pv's are only returned for user VAs. We assert that
2012 * a pt_pv is not being requested for kernel VAs. The kernel
2013 * pre-wires all higher-level page tables so don't overload managed
2014 * higher-level page tables on top of it!
2016 if (ptepindex < pmap_pt_pindex(0)) {
2017 if (ptepindex >= NUPTE_USER) {
2018 /* kernel manages this manually for KVM */
2019 KKASSERT(pvpp == NULL);
2021 KKASSERT(pvpp != NULL);
2022 pt_pindex = NUPTE_TOTAL + (ptepindex >> NPTEPGSHIFT);
2023 pvp = pmap_allocpte(pmap, pt_pindex, NULL);
2025 vm_page_wire_quick(pvp->pv_m);
2032 * The kernel never uses managed PT/PD/PDP pages.
2034 KKASSERT(pmap != &kernel_pmap);
2037 * Non-terminal PVs allocate a VM page to represent the page table,
2038 * so we have to resolve pvp and calculate ptepindex for the pvp
2039 * and then for the page table entry index in the pvp for
2042 if (ptepindex < pmap_pd_pindex(0)) {
2044 * pv is PT, pvp is PD
2046 ptepindex = (ptepindex - pmap_pt_pindex(0)) >> NPDEPGSHIFT;
2047 ptepindex += NUPTE_TOTAL + NUPT_TOTAL;
2048 pvp = pmap_allocpte(pmap, ptepindex, NULL);
2053 ptepindex = pv->pv_pindex - pmap_pt_pindex(0);
2054 ptepindex &= ((1ul << NPDEPGSHIFT) - 1);
2056 } else if (ptepindex < pmap_pdp_pindex(0)) {
2058 * pv is PD, pvp is PDP
2060 * SIMPLE PMAP NOTE: Simple pmaps do not allocate above
2063 ptepindex = (ptepindex - pmap_pd_pindex(0)) >> NPDPEPGSHIFT;
2064 ptepindex += NUPTE_TOTAL + NUPT_TOTAL + NUPD_TOTAL;
2066 if (pmap->pm_flags & PMAP_FLAG_SIMPLE) {
2067 KKASSERT(pvpp == NULL);
2070 pvp = pmap_allocpte(pmap, ptepindex, NULL);
2076 ptepindex = pv->pv_pindex - pmap_pd_pindex(0);
2077 ptepindex &= ((1ul << NPDPEPGSHIFT) - 1);
2078 } else if (ptepindex < pmap_pml4_pindex()) {
2080 * pv is PDP, pvp is the root pml4 table
2082 pvp = pmap_allocpte(pmap, pmap_pml4_pindex(), NULL);
2087 ptepindex = pv->pv_pindex - pmap_pdp_pindex(0);
2088 ptepindex &= ((1ul << NPML4EPGSHIFT) - 1);
2091 * pv represents the top-level PML4, there is no parent.
2100 * (isnew) is TRUE, pv is not terminal.
2102 * (1) Add a wire count to the parent page table (pvp).
2103 * (2) Allocate a VM page for the page table.
2104 * (3) Enter the VM page into the parent page table.
2106 * page table pages are marked PG_WRITEABLE and PG_MAPPED.
2109 vm_page_wire_quick(pvp->pv_m);
2112 m = vm_page_alloc(NULL, pv->pv_pindex,
2113 VM_ALLOC_NORMAL | VM_ALLOC_SYSTEM |
2114 VM_ALLOC_INTERRUPT);
2119 vm_page_wire(m); /* wire for mapping in parent */
2120 vm_page_unmanage(m); /* m must be spinunlocked */
2121 pmap_zero_page(VM_PAGE_TO_PHYS(m));
2122 m->valid = VM_PAGE_BITS_ALL;
2124 vm_page_spin_lock(m);
2125 pmap_page_stats_adding(m);
2126 TAILQ_INSERT_TAIL(&m->md.pv_list, pv, pv_list);
2128 vm_page_flag_set(m, PG_MAPPED | PG_WRITEABLE);
2129 vm_page_spin_unlock(m);
2132 * (isnew) is TRUE, pv is not terminal.
2134 * Wire the page into pvp. Bump the resident_count for the pmap.
2135 * There is no pvp for the top level, address the pm_pml4[] array
2138 * If the caller wants the parent we return it, otherwise
2139 * we just put it away.
2141 * No interlock is needed for pte 0 -> non-zero.
2143 * In the situation where *ptep is valid we might have an unmanaged
2144 * page table page shared from another page table which we need to
2145 * unshare before installing our private page table page.
2148 v = VM_PAGE_TO_PHYS(m) |
2149 (pmap->pmap_bits[PG_U_IDX] |
2150 pmap->pmap_bits[PG_RW_IDX] |
2151 pmap->pmap_bits[PG_V_IDX] |
2152 pmap->pmap_bits[PG_A_IDX] |
2153 pmap->pmap_bits[PG_M_IDX]);
2154 ptep = pv_pte_lookup(pvp, ptepindex);
2155 if (*ptep & pmap->pmap_bits[PG_V_IDX]) {
2159 panic("pmap_allocpte: unexpected pte %p/%d",
2160 pvp, (int)ptepindex);
2162 pte = pmap_inval_smp(pmap, (vm_offset_t)-1, 1, ptep, v);
2163 if (vm_page_unwire_quick(
2164 PHYS_TO_VM_PAGE(pte & PG_FRAME))) {
2165 panic("pmap_allocpte: shared pgtable "
2166 "pg bad wirecount");
2171 pte = atomic_swap_long(ptep, v);
2173 kprintf("install pgtbl mixup 0x%016jx "
2174 "old/new 0x%016jx/0x%016jx\n",
2175 (intmax_t)ptepindex, pte, v);
2182 * (isnew) may be TRUE or FALSE, pv may or may not be terminal.
2186 KKASSERT(pvp->pv_m != NULL);
2187 ptep = pv_pte_lookup(pvp, ptepindex);
2188 v = VM_PAGE_TO_PHYS(pv->pv_m) |
2189 (pmap->pmap_bits[PG_U_IDX] |
2190 pmap->pmap_bits[PG_RW_IDX] |
2191 pmap->pmap_bits[PG_V_IDX] |
2192 pmap->pmap_bits[PG_A_IDX] |
2193 pmap->pmap_bits[PG_M_IDX]);
2195 kprintf("mismatched upper level pt %016jx/%016jx\n",
2207 * This version of pmap_allocpte() checks for possible segment optimizations
2208 * that would allow page-table sharing. It can be called for terminal
2209 * page or page table page ptepindex's.
2211 * The function is called with page table page ptepindex's for fictitious
2212 * and unmanaged terminal pages. That is, we don't want to allocate a
2213 * terminal pv, we just want the pt_pv. pvpp is usually passed as NULL
2216 * This function can return a pv and *pvpp associated with the passed in pmap
2217 * OR a pv and *pvpp associated with the shared pmap. In the latter case
2218 * an unmanaged page table page will be entered into the pass in pmap.
2222 pmap_allocpte_seg(pmap_t pmap, vm_pindex_t ptepindex, pv_entry_t *pvpp,
2223 vm_map_entry_t entry, vm_offset_t va)
2229 pv_entry_t pte_pv; /* in original or shared pmap */
2230 pv_entry_t pt_pv; /* in original or shared pmap */
2231 pv_entry_t proc_pd_pv; /* in original pmap */
2232 pv_entry_t proc_pt_pv; /* in original pmap */
2233 pv_entry_t xpv; /* PT in shared pmap */
2234 pd_entry_t *pt; /* PT entry in PD of original pmap */
2235 pd_entry_t opte; /* contents of *pt */
2236 pd_entry_t npte; /* contents of *pt */
2241 * Basic tests, require a non-NULL vm_map_entry, require proper
2242 * alignment and type for the vm_map_entry, require that the
2243 * underlying object already be allocated.
2245 * We allow almost any type of object to use this optimization.
2246 * The object itself does NOT have to be sized to a multiple of the
2247 * segment size, but the memory mapping does.
2249 * XXX don't handle devices currently, because VM_PAGE_TO_PHYS()
2250 * won't work as expected.
2252 if (entry == NULL ||
2253 pmap_mmu_optimize == 0 || /* not enabled */
2254 (pmap->pm_flags & PMAP_HVM) || /* special pmap */
2255 ptepindex >= pmap_pd_pindex(0) || /* not terminal or pt */
2256 entry->inheritance != VM_INHERIT_SHARE || /* not shared */
2257 entry->maptype != VM_MAPTYPE_NORMAL || /* weird map type */
2258 entry->object.vm_object == NULL || /* needs VM object */
2259 entry->object.vm_object->type == OBJT_DEVICE || /* ick */
2260 entry->object.vm_object->type == OBJT_MGTDEVICE || /* ick */
2261 (entry->offset & SEG_MASK) || /* must be aligned */
2262 (entry->start & SEG_MASK)) {
2263 return(pmap_allocpte(pmap, ptepindex, pvpp));
2267 * Make sure the full segment can be represented.
2269 b = va & ~(vm_offset_t)SEG_MASK;
2270 if (b < entry->start || b + SEG_SIZE > entry->end)
2271 return(pmap_allocpte(pmap, ptepindex, pvpp));
2274 * If the full segment can be represented dive the VM object's
2275 * shared pmap, allocating as required.
2277 object = entry->object.vm_object;
2279 if (entry->protection & VM_PROT_WRITE)
2280 obpmapp = &object->md.pmap_rw;
2282 obpmapp = &object->md.pmap_ro;
2285 if (pmap_enter_debug > 0) {
2287 kprintf("pmap_allocpte_seg: va=%jx prot %08x o=%p "
2289 va, entry->protection, object,
2291 kprintf("pmap_allocpte_seg: entry %p %jx-%jx\n",
2292 entry, entry->start, entry->end);
2297 * We allocate what appears to be a normal pmap but because portions
2298 * of this pmap are shared with other unrelated pmaps we have to
2299 * set pm_active to point to all cpus.
2301 * XXX Currently using pmap_spin to interlock the update, can't use
2302 * vm_object_hold/drop because the token might already be held
2303 * shared OR exclusive and we don't know.
2305 while ((obpmap = *obpmapp) == NULL) {
2306 obpmap = kmalloc(sizeof(*obpmap), M_OBJPMAP, M_WAITOK|M_ZERO);
2307 pmap_pinit_simple(obpmap);
2308 pmap_pinit2(obpmap);
2309 spin_lock(&pmap_spin);
2310 if (*obpmapp != NULL) {
2314 spin_unlock(&pmap_spin);
2315 pmap_release(obpmap);
2316 pmap_puninit(obpmap);
2317 kfree(obpmap, M_OBJPMAP);
2318 obpmap = *obpmapp; /* safety */
2320 obpmap->pm_active = smp_active_mask;
2321 obpmap->pm_flags |= PMAP_SEGSHARED;
2323 spin_unlock(&pmap_spin);
2328 * Layering is: PTE, PT, PD, PDP, PML4. We have to return the
2329 * pte/pt using the shared pmap from the object but also adjust
2330 * the process pmap's page table page as a side effect.
2334 * Resolve the terminal PTE and PT in the shared pmap. This is what
2335 * we will return. This is true if ptepindex represents a terminal
2336 * page, otherwise pte_pv is actually the PT and pt_pv is actually
2340 pte_pv = pmap_allocpte(obpmap, ptepindex, &pt_pv);
2341 if (ptepindex >= pmap_pt_pindex(0))
2347 * Resolve the PD in the process pmap so we can properly share the
2348 * page table page. Lock order is bottom-up (leaf first)!
2350 * NOTE: proc_pt_pv can be NULL.
2352 proc_pt_pv = pv_get(pmap, pmap_pt_pindex(b), NULL);
2353 proc_pd_pv = pmap_allocpte(pmap, pmap_pd_pindex(b), NULL);
2355 if (pmap_enter_debug > 0) {
2357 kprintf("proc_pt_pv %p (wc %d) pd_pv %p va=%jx\n",
2359 (proc_pt_pv ? proc_pt_pv->pv_m->wire_count : -1),
2366 * xpv is the page table page pv from the shared object
2367 * (for convenience), from above.
2369 * Calculate the pte value for the PT to load into the process PD.
2370 * If we have to change it we must properly dispose of the previous
2373 pt = pv_pte_lookup(proc_pd_pv, pmap_pt_index(b));
2374 npte = VM_PAGE_TO_PHYS(xpv->pv_m) |
2375 (pmap->pmap_bits[PG_U_IDX] |
2376 pmap->pmap_bits[PG_RW_IDX] |
2377 pmap->pmap_bits[PG_V_IDX] |
2378 pmap->pmap_bits[PG_A_IDX] |
2379 pmap->pmap_bits[PG_M_IDX]);
2382 * Dispose of previous page table page if it was local to the
2383 * process pmap. If the old pt is not empty we cannot dispose of it
2384 * until we clean it out. This case should not arise very often so
2385 * it is not optimized.
2388 pmap_inval_bulk_t bulk;
2390 if (proc_pt_pv->pv_m->wire_count != 1) {
2396 va & ~(vm_offset_t)SEG_MASK,
2397 (va + SEG_SIZE) & ~(vm_offset_t)SEG_MASK);
2402 * The release call will indirectly clean out *pt
2404 pmap_inval_bulk_init(&bulk, proc_pt_pv->pv_pmap);
2405 pmap_release_pv(proc_pt_pv, proc_pd_pv, &bulk);
2406 pmap_inval_bulk_flush(&bulk);
2409 pt = pv_pte_lookup(proc_pd_pv, pmap_pt_index(b));
2413 * Handle remaining cases.
2416 atomic_swap_long(pt, npte);
2417 vm_page_wire_quick(xpv->pv_m); /* shared pt -> proc */
2418 vm_page_wire_quick(proc_pd_pv->pv_m); /* proc pd for sh pt */
2419 atomic_add_long(&pmap->pm_stats.resident_count, 1);
2420 } else if (*pt != npte) {
2421 opte = pmap_inval_smp(pmap, (vm_offset_t)-1, 1, pt, npte);
2424 opte = pte_load_clear(pt);
2425 KKASSERT(opte && opte != npte);
2429 vm_page_wire_quick(xpv->pv_m); /* shared pt -> proc */
2432 * Clean up opte, bump the wire_count for the process
2433 * PD page representing the new entry if it was
2436 * If the entry was not previously empty and we have
2437 * a PT in the proc pmap then opte must match that
2438 * pt. The proc pt must be retired (this is done
2439 * later on in this procedure).
2441 * NOTE: replacing valid pte, wire_count on proc_pd_pv
2444 KKASSERT(opte & pmap->pmap_bits[PG_V_IDX]);
2445 m = PHYS_TO_VM_PAGE(opte & PG_FRAME);
2446 if (vm_page_unwire_quick(m)) {
2447 panic("pmap_allocpte_seg: "
2448 "bad wire count %p",
2454 * The existing process page table was replaced and must be destroyed
2468 * Release any resources held by the given physical map.
2470 * Called when a pmap initialized by pmap_pinit is being released. Should
2471 * only be called if the map contains no valid mappings.
2473 struct pmap_release_info {
2479 static int pmap_release_callback(pv_entry_t pv, void *data);
2482 pmap_release(struct pmap *pmap)
2484 struct pmap_release_info info;
2486 KASSERT(CPUMASK_TESTZERO(pmap->pm_active),
2487 ("pmap still active! %016jx",
2488 (uintmax_t)CPUMASK_LOWMASK(pmap->pm_active)));
2491 * There is no longer a pmap_list, if there were we would remove the
2492 * pmap from it here.
2496 * Pull pv's off the RB tree in order from low to high and release
2504 spin_lock(&pmap->pm_spin);
2505 RB_SCAN(pv_entry_rb_tree, &pmap->pm_pvroot, NULL,
2506 pmap_release_callback, &info);
2507 spin_unlock(&pmap->pm_spin);
2511 } while (info.retry);
2515 * One resident page (the pml4 page) should remain.
2516 * No wired pages should remain.
2519 if (pmap->pm_stats.resident_count !=
2520 ((pmap->pm_flags & PMAP_FLAG_SIMPLE) ? 0 : 1) ||
2521 pmap->pm_stats.wired_count != 0) {
2522 kprintf("fatal pmap problem - pmap %p flags %08x "
2523 "rescnt=%jd wirecnt=%jd\n",
2526 pmap->pm_stats.resident_count,
2527 pmap->pm_stats.wired_count);
2528 tsleep(pmap, 0, "DEAD", 0);
2531 KKASSERT(pmap->pm_stats.resident_count ==
2532 ((pmap->pm_flags & PMAP_FLAG_SIMPLE) ? 0 : 1));
2533 KKASSERT(pmap->pm_stats.wired_count == 0);
2538 * Called from low to high. We must cache the proper parent pv so we
2539 * can adjust its wired count.
2542 pmap_release_callback(pv_entry_t pv, void *data)
2544 struct pmap_release_info *info = data;
2545 pmap_t pmap = info->pmap;
2550 * Acquire a held and locked pv, check for release race
2552 pindex = pv->pv_pindex;
2553 if (info->pvp == pv) {
2554 spin_unlock(&pmap->pm_spin);
2556 } else if (pv_hold_try(pv)) {
2557 spin_unlock(&pmap->pm_spin);
2559 spin_unlock(&pmap->pm_spin);
2565 KKASSERT(pv->pv_pmap == pmap && pindex == pv->pv_pindex);
2567 if (pv->pv_pindex < pmap_pt_pindex(0)) {
2569 * I am PTE, parent is PT
2571 pindex = pv->pv_pindex >> NPTEPGSHIFT;
2572 pindex += NUPTE_TOTAL;
2573 } else if (pv->pv_pindex < pmap_pd_pindex(0)) {
2575 * I am PT, parent is PD
2577 pindex = (pv->pv_pindex - NUPTE_TOTAL) >> NPDEPGSHIFT;
2578 pindex += NUPTE_TOTAL + NUPT_TOTAL;
2579 } else if (pv->pv_pindex < pmap_pdp_pindex(0)) {
2581 * I am PD, parent is PDP
2583 pindex = (pv->pv_pindex - NUPTE_TOTAL - NUPT_TOTAL) >>
2585 pindex += NUPTE_TOTAL + NUPT_TOTAL + NUPD_TOTAL;
2586 } else if (pv->pv_pindex < pmap_pml4_pindex()) {
2588 * I am PDP, parent is PML4 (there's only one)
2591 pindex = (pv->pv_pindex - NUPTE_TOTAL - NUPT_TOTAL -
2592 NUPD_TOTAL) >> NPML4EPGSHIFT;
2593 pindex += NUPTE_TOTAL + NUPT_TOTAL + NUPD_TOTAL + NUPDP_TOTAL;
2595 pindex = pmap_pml4_pindex();
2607 if (info->pvp && info->pvp->pv_pindex != pindex) {
2611 if (info->pvp == NULL)
2612 info->pvp = pv_get(pmap, pindex, NULL);
2619 r = pmap_release_pv(pv, info->pvp, NULL);
2620 spin_lock(&pmap->pm_spin);
2626 * Called with held (i.e. also locked) pv. This function will dispose of
2627 * the lock along with the pv.
2629 * If the caller already holds the locked parent page table for pv it
2630 * must pass it as pvp, allowing us to avoid a deadlock, else it can
2631 * pass NULL for pvp.
2634 pmap_release_pv(pv_entry_t pv, pv_entry_t pvp, pmap_inval_bulk_t *bulk)
2639 * The pmap is currently not spinlocked, pv is held+locked.
2640 * Remove the pv's page from its parent's page table. The
2641 * parent's page table page's wire_count will be decremented.
2643 * This will clean out the pte at any level of the page table.
2644 * If smp != 0 all cpus are affected.
2646 * Do not tear-down recursively, its faster to just let the
2647 * release run its course.
2649 pmap_remove_pv_pte(pv, pvp, bulk, 0);
2652 * Terminal pvs are unhooked from their vm_pages. Because
2653 * terminal pages aren't page table pages they aren't wired
2654 * by us, so we have to be sure not to unwire them either.
2656 if (pv->pv_pindex < pmap_pt_pindex(0)) {
2657 pmap_remove_pv_page(pv);
2662 * We leave the top-level page table page cached, wired, and
2663 * mapped in the pmap until the dtor function (pmap_puninit())
2666 * Since we are leaving the top-level pv intact we need
2667 * to break out of what would otherwise be an infinite loop.
2669 if (pv->pv_pindex == pmap_pml4_pindex()) {
2675 * For page table pages (other than the top-level page),
2676 * remove and free the vm_page. The representitive mapping
2677 * removed above by pmap_remove_pv_pte() did not undo the
2678 * last wire_count so we have to do that as well.
2680 p = pmap_remove_pv_page(pv);
2681 vm_page_busy_wait(p, FALSE, "pmaprl");
2682 if (p->wire_count != 1) {
2683 kprintf("p->wire_count was %016lx %d\n",
2684 pv->pv_pindex, p->wire_count);
2686 KKASSERT(p->wire_count == 1);
2687 KKASSERT(p->flags & PG_UNMANAGED);
2689 vm_page_unwire(p, 0);
2690 KKASSERT(p->wire_count == 0);
2700 * This function will remove the pte associated with a pv from its parent.
2701 * Terminal pv's are supported. All cpus specified by (bulk) are properly
2704 * The wire count will be dropped on the parent page table. The wire
2705 * count on the page being removed (pv->pv_m) from the parent page table
2706 * is NOT touched. Note that terminal pages will not have any additional
2707 * wire counts while page table pages will have at least one representing
2708 * the mapping, plus others representing sub-mappings.
2710 * NOTE: Cannot be called on kernel page table pages, only KVM terminal
2711 * pages and user page table and terminal pages.
2713 * NOTE: The pte being removed might be unmanaged, and the pv supplied might
2714 * be freshly allocated and not imply that the pte is managed. In this
2715 * case pv->pv_m should be NULL.
2717 * The pv must be locked. The pvp, if supplied, must be locked. All
2718 * supplied pv's will remain locked on return.
2720 * XXX must lock parent pv's if they exist to remove pte XXX
2724 pmap_remove_pv_pte(pv_entry_t pv, pv_entry_t pvp, pmap_inval_bulk_t *bulk,
2727 vm_pindex_t ptepindex = pv->pv_pindex;
2728 pmap_t pmap = pv->pv_pmap;
2734 if (ptepindex == pmap_pml4_pindex()) {
2736 * We are the top level PML4E table, there is no parent.
2738 p = pmap->pm_pmlpv->pv_m;
2739 KKASSERT(pv->pv_m == p); /* debugging */
2740 } else if (ptepindex >= pmap_pdp_pindex(0)) {
2742 * Remove a PDP page from the PML4E. This can only occur
2743 * with user page tables. We do not have to lock the
2744 * pml4 PV so just ignore pvp.
2746 vm_pindex_t pml4_pindex;
2747 vm_pindex_t pdp_index;
2750 pdp_index = ptepindex - pmap_pdp_pindex(0);
2752 pml4_pindex = pmap_pml4_pindex();
2753 pvp = pv_get(pv->pv_pmap, pml4_pindex, NULL);
2758 pdp = &pmap->pm_pml4[pdp_index & ((1ul << NPML4EPGSHIFT) - 1)];
2759 KKASSERT((*pdp & pmap->pmap_bits[PG_V_IDX]) != 0);
2760 p = PHYS_TO_VM_PAGE(*pdp & PG_FRAME);
2761 pmap_inval_bulk(bulk, (vm_offset_t)-1, pdp, 0);
2762 KKASSERT(pv->pv_m == p); /* debugging */
2763 } else if (ptepindex >= pmap_pd_pindex(0)) {
2765 * Remove a PD page from the PDP
2767 * SIMPLE PMAP NOTE: Non-existant pvp's are ok in the case
2768 * of a simple pmap because it stops at
2771 vm_pindex_t pdp_pindex;
2772 vm_pindex_t pd_index;
2775 pd_index = ptepindex - pmap_pd_pindex(0);
2778 pdp_pindex = NUPTE_TOTAL + NUPT_TOTAL + NUPD_TOTAL +
2779 (pd_index >> NPML4EPGSHIFT);
2780 pvp = pv_get(pv->pv_pmap, pdp_pindex, NULL);
2785 pd = pv_pte_lookup(pvp, pd_index &
2786 ((1ul << NPDPEPGSHIFT) - 1));
2787 KKASSERT((*pd & pmap->pmap_bits[PG_V_IDX]) != 0);
2788 p = PHYS_TO_VM_PAGE(*pd & PG_FRAME);
2789 pmap_inval_bulk(bulk, (vm_offset_t)-1, pd, 0);
2791 KKASSERT(pmap->pm_flags & PMAP_FLAG_SIMPLE);
2792 p = pv->pv_m; /* degenerate test later */
2794 KKASSERT(pv->pv_m == p); /* debugging */
2795 } else if (ptepindex >= pmap_pt_pindex(0)) {
2797 * Remove a PT page from the PD
2799 vm_pindex_t pd_pindex;
2800 vm_pindex_t pt_index;
2803 pt_index = ptepindex - pmap_pt_pindex(0);
2806 pd_pindex = NUPTE_TOTAL + NUPT_TOTAL +
2807 (pt_index >> NPDPEPGSHIFT);
2808 pvp = pv_get(pv->pv_pmap, pd_pindex, NULL);
2813 pt = pv_pte_lookup(pvp, pt_index & ((1ul << NPDPEPGSHIFT) - 1));
2815 KASSERT((*pt & pmap->pmap_bits[PG_V_IDX]) != 0,
2816 ("*pt unexpectedly invalid %016jx "
2817 "gotpvp=%d ptepindex=%ld ptindex=%ld pv=%p pvp=%p",
2818 *pt, gotpvp, ptepindex, pt_index, pv, pvp));
2819 p = PHYS_TO_VM_PAGE(*pt & PG_FRAME);
2821 if ((*pt & pmap->pmap_bits[PG_V_IDX]) == 0) {
2822 kprintf("*pt unexpectedly invalid %016jx "
2823 "gotpvp=%d ptepindex=%ld ptindex=%ld "
2825 *pt, gotpvp, ptepindex, pt_index, pv, pvp);
2826 tsleep(pt, 0, "DEAD", 0);
2829 p = PHYS_TO_VM_PAGE(*pt & PG_FRAME);
2832 pmap_inval_bulk(bulk, (vm_offset_t)-1, pt, 0);
2833 KKASSERT(pv->pv_m == p); /* debugging */
2836 * Remove a PTE from the PT page. The PV might exist even if
2837 * the PTE is not managed, in whichcase pv->pv_m should be
2840 * NOTE: Userland pmaps manage the parent PT/PD/PDP page
2841 * table pages but the kernel_pmap does not.
2843 * NOTE: pv's must be locked bottom-up to avoid deadlocking.
2844 * pv is a pte_pv so we can safely lock pt_pv.
2846 * NOTE: FICTITIOUS pages may have multiple physical mappings
2847 * so PHYS_TO_VM_PAGE() will not necessarily work for
2850 vm_pindex_t pt_pindex;
2855 pt_pindex = ptepindex >> NPTEPGSHIFT;
2856 va = (vm_offset_t)ptepindex << PAGE_SHIFT;
2858 if (ptepindex >= NUPTE_USER) {
2859 ptep = vtopte(ptepindex << PAGE_SHIFT);
2860 KKASSERT(pvp == NULL);
2861 /* pvp remains NULL */
2864 pt_pindex = NUPTE_TOTAL +
2865 (ptepindex >> NPDPEPGSHIFT);
2866 pvp = pv_get(pv->pv_pmap, pt_pindex, NULL);
2870 ptep = pv_pte_lookup(pvp, ptepindex &
2871 ((1ul << NPDPEPGSHIFT) - 1));
2873 pte = pmap_inval_bulk(bulk, va, ptep, 0);
2874 if (bulk == NULL) /* XXX */
2875 cpu_invlpg((void *)va); /* XXX */
2878 * Now update the vm_page_t
2880 if ((pte & pmap->pmap_bits[PG_MANAGED_IDX]) &&
2881 (pte & pmap->pmap_bits[PG_V_IDX])) {
2883 * Valid managed page, adjust (p).
2885 if (pte & pmap->pmap_bits[PG_DEVICE_IDX]) {
2888 p = PHYS_TO_VM_PAGE(pte & PG_FRAME);
2889 KKASSERT(pv->pv_m == p);
2891 if (pte & pmap->pmap_bits[PG_M_IDX]) {
2892 if (pmap_track_modified(ptepindex))
2895 if (pte & pmap->pmap_bits[PG_A_IDX]) {
2896 vm_page_flag_set(p, PG_REFERENCED);
2900 * Unmanaged page, do not try to adjust the vm_page_t.
2901 * pv could be freshly allocated for a pmap_enter(),
2902 * replacing an unmanaged page with a managed one.
2904 * pv->pv_m might reflect the new page and not the
2907 * We could extract p from the physical address and
2908 * adjust it but we explicitly do not for unmanaged
2913 if (pte & pmap->pmap_bits[PG_W_IDX])
2914 atomic_add_long(&pmap->pm_stats.wired_count, -1);
2915 if (pte & pmap->pmap_bits[PG_G_IDX])
2916 cpu_invlpg((void *)va);
2920 * If requested, scrap the underlying pv->pv_m and the underlying
2921 * pv. If this is a page-table-page we must also free the page.
2923 * pvp must be returned locked.
2927 * page table page (PT, PD, PDP, PML4), caller was responsible
2928 * for testing wired_count.
2930 KKASSERT(pv->pv_m->wire_count == 1);
2931 p = pmap_remove_pv_page(pv);
2935 vm_page_busy_wait(p, FALSE, "pgpun");
2936 vm_page_unwire(p, 0);
2937 vm_page_flag_clear(p, PG_MAPPED | PG_WRITEABLE);
2939 } else if (destroy == 2) {
2941 * Normal page, remove from pmap and leave the underlying
2944 pmap_remove_pv_page(pv);
2946 pv = NULL; /* safety */
2950 * If we acquired pvp ourselves then we are responsible for
2951 * recursively deleting it.
2953 if (pvp && gotpvp) {
2955 * Recursively destroy higher-level page tables.
2957 * This is optional. If we do not, they will still
2958 * be destroyed when the process exits.
2960 * NOTE: Do not destroy pv_entry's with extra hold refs,
2961 * a caller may have unlocked it and intends to
2962 * continue to use it.
2964 if (pmap_dynamic_delete &&
2966 pvp->pv_m->wire_count == 1 &&
2967 (pvp->pv_hold & PV_HOLD_MASK) == 2 &&
2968 pvp->pv_pindex != pmap_pml4_pindex()) {
2969 if (pmap_dynamic_delete == 2)
2970 kprintf("A %jd %08x\n", pvp->pv_pindex, pvp->pv_hold);
2971 if (pmap != &kernel_pmap) {
2972 pmap_remove_pv_pte(pvp, NULL, bulk, 1);
2973 pvp = NULL; /* safety */
2975 kprintf("Attempt to remove kernel_pmap pindex "
2976 "%jd\n", pvp->pv_pindex);
2986 * Remove the vm_page association to a pv. The pv must be locked.
2990 pmap_remove_pv_page(pv_entry_t pv)
2995 vm_page_spin_lock(m);
2996 KKASSERT(m && m == pv->pv_m);
2998 TAILQ_REMOVE(&m->md.pv_list, pv, pv_list);
2999 pmap_page_stats_deleting(m);
3000 if (TAILQ_EMPTY(&m->md.pv_list))
3001 vm_page_flag_clear(m, PG_MAPPED | PG_WRITEABLE);
3002 vm_page_spin_unlock(m);
3008 * Grow the number of kernel page table entries, if needed.
3010 * This routine is always called to validate any address space
3011 * beyond KERNBASE (for kldloads). kernel_vm_end only governs the address
3012 * space below KERNBASE.
3014 * kernel_map must be locked exclusively by the caller.
3017 pmap_growkernel(vm_offset_t kstart, vm_offset_t kend)
3020 vm_offset_t ptppaddr;
3022 pd_entry_t *pt, newpt;
3024 int update_kernel_vm_end;
3027 * bootstrap kernel_vm_end on first real VM use
3029 if (kernel_vm_end == 0) {
3030 kernel_vm_end = VM_MIN_KERNEL_ADDRESS;
3032 while ((*pmap_pt(&kernel_pmap, kernel_vm_end) & kernel_pmap.pmap_bits[PG_V_IDX]) != 0) {
3033 kernel_vm_end = (kernel_vm_end + PAGE_SIZE * NPTEPG) &
3034 ~(PAGE_SIZE * NPTEPG - 1);
3036 if (kernel_vm_end - 1 >= kernel_map.max_offset) {
3037 kernel_vm_end = kernel_map.max_offset;
3044 * Fill in the gaps. kernel_vm_end is only adjusted for ranges
3045 * below KERNBASE. Ranges above KERNBASE are kldloaded and we
3046 * do not want to force-fill 128G worth of page tables.
3048 if (kstart < KERNBASE) {
3049 if (kstart > kernel_vm_end)
3050 kstart = kernel_vm_end;
3051 KKASSERT(kend <= KERNBASE);
3052 update_kernel_vm_end = 1;
3054 update_kernel_vm_end = 0;
3057 kstart = rounddown2(kstart, PAGE_SIZE * NPTEPG);
3058 kend = roundup2(kend, PAGE_SIZE * NPTEPG);
3060 if (kend - 1 >= kernel_map.max_offset)
3061 kend = kernel_map.max_offset;
3063 while (kstart < kend) {
3064 pt = pmap_pt(&kernel_pmap, kstart);
3066 /* We need a new PD entry */
3067 nkpg = vm_page_alloc(NULL, mycpu->gd_rand_incr++,
3070 VM_ALLOC_INTERRUPT);
3072 panic("pmap_growkernel: no memory to grow "
3075 paddr = VM_PAGE_TO_PHYS(nkpg);
3076 pmap_zero_page(paddr);
3077 newpd = (pdp_entry_t)
3079 kernel_pmap.pmap_bits[PG_V_IDX] |
3080 kernel_pmap.pmap_bits[PG_RW_IDX] |
3081 kernel_pmap.pmap_bits[PG_A_IDX] |
3082 kernel_pmap.pmap_bits[PG_M_IDX]);
3083 *pmap_pd(&kernel_pmap, kstart) = newpd;
3084 continue; /* try again */
3086 if ((*pt & kernel_pmap.pmap_bits[PG_V_IDX]) != 0) {
3087 kstart = (kstart + PAGE_SIZE * NPTEPG) &
3088 ~(PAGE_SIZE * NPTEPG - 1);
3089 if (kstart - 1 >= kernel_map.max_offset) {
3090 kstart = kernel_map.max_offset;
3099 * This index is bogus, but out of the way
3101 nkpg = vm_page_alloc(NULL, mycpu->gd_rand_incr++,
3104 VM_ALLOC_INTERRUPT);
3106 panic("pmap_growkernel: no memory to grow kernel");
3109 ptppaddr = VM_PAGE_TO_PHYS(nkpg);
3110 pmap_zero_page(ptppaddr);
3111 newpt = (pd_entry_t)(ptppaddr |
3112 kernel_pmap.pmap_bits[PG_V_IDX] |
3113 kernel_pmap.pmap_bits[PG_RW_IDX] |
3114 kernel_pmap.pmap_bits[PG_A_IDX] |
3115 kernel_pmap.pmap_bits[PG_M_IDX]);
3116 atomic_swap_long(pmap_pt(&kernel_pmap, kstart), newpt);
3118 kstart = (kstart + PAGE_SIZE * NPTEPG) &
3119 ~(PAGE_SIZE * NPTEPG - 1);
3121 if (kstart - 1 >= kernel_map.max_offset) {
3122 kstart = kernel_map.max_offset;
3128 * Only update kernel_vm_end for areas below KERNBASE.
3130 if (update_kernel_vm_end && kernel_vm_end < kstart)
3131 kernel_vm_end = kstart;
3135 * Add a reference to the specified pmap.
3138 pmap_reference(pmap_t pmap)
3141 atomic_add_int(&pmap->pm_count, 1);
3144 /***************************************************
3145 * page management routines.
3146 ***************************************************/
3149 * Hold a pv without locking it
3152 pv_hold(pv_entry_t pv)
3154 atomic_add_int(&pv->pv_hold, 1);
3158 * Hold a pv_entry, preventing its destruction. TRUE is returned if the pv
3159 * was successfully locked, FALSE if it wasn't. The caller must dispose of
3162 * Either the pmap->pm_spin or the related vm_page_spin (if traversing a
3163 * pv list via its page) must be held by the caller in order to stabilize
3167 _pv_hold_try(pv_entry_t pv PMAP_DEBUG_DECL)
3172 * Critical path shortcut expects pv to already have one ref
3173 * (for the pv->pv_pmap).
3175 if (atomic_cmpset_int(&pv->pv_hold, 1, PV_HOLD_LOCKED | 2)) {
3178 pv->pv_line = lineno;
3184 count = pv->pv_hold;
3186 if ((count & PV_HOLD_LOCKED) == 0) {
3187 if (atomic_cmpset_int(&pv->pv_hold, count,
3188 (count + 1) | PV_HOLD_LOCKED)) {
3191 pv->pv_line = lineno;
3196 if (atomic_cmpset_int(&pv->pv_hold, count, count + 1))
3204 * Drop a previously held pv_entry which could not be locked, allowing its
3207 * Must not be called with a spinlock held as we might zfree() the pv if it
3208 * is no longer associated with a pmap and this was the last hold count.
3211 pv_drop(pv_entry_t pv)
3216 count = pv->pv_hold;
3218 KKASSERT((count & PV_HOLD_MASK) > 0);
3219 KKASSERT((count & (PV_HOLD_LOCKED | PV_HOLD_MASK)) !=
3220 (PV_HOLD_LOCKED | 1));
3221 if (atomic_cmpset_int(&pv->pv_hold, count, count - 1)) {
3222 if ((count & PV_HOLD_MASK) == 1) {
3224 if (pmap_enter_debug > 0) {
3226 kprintf("pv_drop: free pv %p\n", pv);
3229 KKASSERT(count == 1);
3230 KKASSERT(pv->pv_pmap == NULL);
3240 * Find or allocate the requested PV entry, returning a locked, held pv.
3242 * If (*isnew) is non-zero, the returned pv will have two hold counts, one
3243 * for the caller and one representing the pmap and vm_page association.
3245 * If (*isnew) is zero, the returned pv will have only one hold count.
3247 * Since both associations can only be adjusted while the pv is locked,
3248 * together they represent just one additional hold.
3252 _pv_alloc(pmap_t pmap, vm_pindex_t pindex, int *isnew PMAP_DEBUG_DECL)
3255 pv_entry_t pnew = NULL;
3257 spin_lock(&pmap->pm_spin);
3262 pv = pmap->pm_pvhint;
3265 pv->pv_pmap != pmap ||
3266 pv->pv_pindex != pindex) {
3267 pv = pv_entry_rb_tree_RB_LOOKUP(&pmap->pm_pvroot,
3274 * We need to stage a new pv entry
3277 spin_unlock(&pmap->pm_spin);
3278 pnew = zalloc(pvzone);
3279 spin_lock(&pmap->pm_spin);
3284 * We need to block if someone is holding a
3285 * placemarker. The exclusive spinlock is a
3286 * sufficient interlock, as long as we determine
3287 * the placemarker has not been aquired we do not
3290 pmark = pmap_placemarker_hash(pmap, pindex);
3292 if (((*pmark ^ pindex) & ~PM_PLACEMARK_WAKEUP) == 0) {
3293 atomic_set_long(pmark, PM_PLACEMARK_WAKEUP);
3294 ssleep(pmark, &pmap->pm_spin, 0, "pvplc", 0);
3299 * Setup the new entry
3301 pnew->pv_pmap = pmap;
3302 pnew->pv_pindex = pindex;
3303 pnew->pv_hold = PV_HOLD_LOCKED | 2;
3305 pnew->pv_func = func;
3306 pnew->pv_line = lineno;
3307 if (pnew->pv_line_lastfree > 0) {
3308 pnew->pv_line_lastfree =
3309 -pnew->pv_line_lastfree;
3312 pv = pv_entry_rb_tree_RB_INSERT(&pmap->pm_pvroot, pnew);
3313 atomic_add_long(&pmap->pm_stats.resident_count, 1);
3314 spin_unlock(&pmap->pm_spin);
3317 KKASSERT(pv == NULL);
3322 * We have an entry, clean up any staged pv we had allocated,
3323 * then block until we can lock the entry.
3326 spin_unlock(&pmap->pm_spin);
3327 zfree(pvzone, pnew);
3329 spin_lock(&pmap->pm_spin);
3332 if (_pv_hold_try(pv PMAP_DEBUG_COPY)) {
3333 spin_unlock(&pmap->pm_spin);
3334 KKASSERT(pv->pv_pmap == pmap &&
3335 pv->pv_pindex == pindex);
3339 spin_unlock(&pmap->pm_spin);
3340 _pv_lock(pv PMAP_DEBUG_COPY);
3342 spin_lock(&pmap->pm_spin);
3347 * Find the requested PV entry, returning a locked+held pv or NULL
3351 _pv_get(pmap_t pmap, vm_pindex_t pindex, vm_pindex_t **pmarkp PMAP_DEBUG_DECL)
3355 spin_lock(&pmap->pm_spin);
3360 pv = pmap->pm_pvhint;
3363 pv->pv_pmap != pmap ||
3364 pv->pv_pindex != pindex) {
3365 pv = pv_entry_rb_tree_RB_LOOKUP(&pmap->pm_pvroot,
3370 * Block if there is a placemarker. If we are to
3371 * return it, we must also aquire the spot.
3375 pmark = pmap_placemarker_hash(pmap, pindex);
3377 if ((pmarkp && *pmark != PM_NOPLACEMARK) ||
3378 ((*pmark ^ pindex) & ~PM_PLACEMARK_WAKEUP) == 0) {
3379 atomic_set_long(pmark, PM_PLACEMARK_WAKEUP);
3380 ssleep(pmark, &pmap->pm_spin, 0, "pvpld", 0);
3384 if (atomic_swap_long(pmark, pindex) !=
3386 panic("_pv_get: pmark race");
3390 spin_unlock(&pmap->pm_spin);
3393 if (_pv_hold_try(pv PMAP_DEBUG_COPY)) {
3394 pv_cache(pv, pindex);
3395 spin_unlock(&pmap->pm_spin);
3396 KKASSERT(pv->pv_pmap == pmap &&
3397 pv->pv_pindex == pindex);
3400 spin_unlock(&pmap->pm_spin);
3401 _pv_lock(pv PMAP_DEBUG_COPY);
3403 spin_lock(&pmap->pm_spin);
3408 * Lookup, hold, and attempt to lock (pmap,pindex).
3410 * If the entry does not exist NULL is returned and *errorp is set to 0
3412 * If the entry exists and could be successfully locked it is returned and
3413 * errorp is set to 0.
3415 * If the entry exists but could NOT be successfully locked it is returned
3416 * held and *errorp is set to 1.
3418 * If the entry is placemarked by someone else NULL is returned and *errorp
3423 pv_get_try(pmap_t pmap, vm_pindex_t pindex, vm_pindex_t **pmarkp, int *errorp)
3427 spin_lock_shared(&pmap->pm_spin);
3429 pv = pmap->pm_pvhint;
3432 pv->pv_pmap != pmap ||
3433 pv->pv_pindex != pindex) {
3434 pv = pv_entry_rb_tree_RB_LOOKUP(&pmap->pm_pvroot, pindex);
3440 pmark = pmap_placemarker_hash(pmap, pindex);
3442 if (((*pmark ^ pindex) & ~PM_PLACEMARK_WAKEUP) == 0) {
3444 } else if (pmarkp &&
3445 atomic_cmpset_long(pmark, PM_NOPLACEMARK, pindex)) {
3449 * Can't set a placemark with a NULL pmarkp, or if
3450 * pmarkp is non-NULL but we failed to set our
3457 spin_unlock_shared(&pmap->pm_spin);
3463 * XXX This has problems if the lock is shared, why?
3465 if (pv_hold_try(pv)) {
3466 pv_cache(pv, pindex); /* overwrite ok (shared lock) */
3467 spin_unlock_shared(&pmap->pm_spin);
3469 KKASSERT(pv->pv_pmap == pmap && pv->pv_pindex == pindex);
3470 return(pv); /* lock succeeded */
3472 spin_unlock_shared(&pmap->pm_spin);
3475 return (pv); /* lock failed */
3479 * Lock a held pv, keeping the hold count
3483 _pv_lock(pv_entry_t pv PMAP_DEBUG_DECL)
3488 count = pv->pv_hold;
3490 if ((count & PV_HOLD_LOCKED) == 0) {
3491 if (atomic_cmpset_int(&pv->pv_hold, count,
3492 count | PV_HOLD_LOCKED)) {
3495 pv->pv_line = lineno;
3501 tsleep_interlock(pv, 0);
3502 if (atomic_cmpset_int(&pv->pv_hold, count,
3503 count | PV_HOLD_WAITING)) {
3505 if (pmap_enter_debug > 0) {
3507 kprintf("pv waiting on %s:%d\n",
3508 pv->pv_func, pv->pv_line);
3511 tsleep(pv, PINTERLOCKED, "pvwait", hz);
3518 * Unlock a held and locked pv, keeping the hold count.
3522 pv_unlock(pv_entry_t pv)
3527 count = pv->pv_hold;
3529 KKASSERT((count & (PV_HOLD_LOCKED | PV_HOLD_MASK)) >=
3530 (PV_HOLD_LOCKED | 1));
3531 if (atomic_cmpset_int(&pv->pv_hold, count,
3533 ~(PV_HOLD_LOCKED | PV_HOLD_WAITING))) {
3534 if (count & PV_HOLD_WAITING)
3542 * Unlock and drop a pv. If the pv is no longer associated with a pmap
3543 * and the hold count drops to zero we will free it.
3545 * Caller should not hold any spin locks. We are protected from hold races
3546 * by virtue of holds only occuring only with a pmap_spin or vm_page_spin
3547 * lock held. A pv cannot be located otherwise.
3551 pv_put(pv_entry_t pv)
3554 if (pmap_enter_debug > 0) {
3556 kprintf("pv_put pv=%p hold=%08x\n", pv, pv->pv_hold);
3561 * Normal put-aways must have a pv_m associated with the pv,
3562 * but allow the case where the pv has been destructed due
3563 * to pmap_dynamic_delete.
3565 KKASSERT(pv->pv_pmap == NULL || pv->pv_m != NULL);
3568 * Fast - shortcut most common condition
3570 if (atomic_cmpset_int(&pv->pv_hold, PV_HOLD_LOCKED | 2, 1))
3581 * Remove the pmap association from a pv, require that pv_m already be removed,
3582 * then unlock and drop the pv. Any pte operations must have already been
3583 * completed. This call may result in a last-drop which will physically free
3586 * Removing the pmap association entails an additional drop.
3588 * pv must be exclusively locked on call and will be disposed of on return.
3592 _pv_free(pv_entry_t pv, pv_entry_t pvp PMAP_DEBUG_DECL)
3597 pv->pv_func_lastfree = func;
3598 pv->pv_line_lastfree = lineno;
3600 KKASSERT(pv->pv_m == NULL);
3601 KKASSERT((pv->pv_hold & (PV_HOLD_LOCKED|PV_HOLD_MASK)) >=
3602 (PV_HOLD_LOCKED|1));
3603 if ((pmap = pv->pv_pmap) != NULL) {
3604 spin_lock(&pmap->pm_spin);
3605 KKASSERT(pv->pv_pmap == pmap);
3606 if (pmap->pm_pvhint == pv)
3607 pmap->pm_pvhint = NULL;
3608 pv_entry_rb_tree_RB_REMOVE(&pmap->pm_pvroot, pv);
3609 atomic_add_long(&pmap->pm_stats.resident_count, -1);
3612 spin_unlock(&pmap->pm_spin);
3615 * Try to shortcut three atomic ops, otherwise fall through
3616 * and do it normally. Drop two refs and the lock all in
3620 vm_page_unwire_quick(pvp->pv_m);
3621 if (atomic_cmpset_int(&pv->pv_hold, PV_HOLD_LOCKED | 2, 0)) {
3623 if (pmap_enter_debug > 0) {
3625 kprintf("pv_free: free pv %p\n", pv);
3631 pv_drop(pv); /* ref for pv_pmap */
3638 * This routine is very drastic, but can save the system
3646 static int warningdone=0;
3648 if (pmap_pagedaemon_waken == 0)
3650 pmap_pagedaemon_waken = 0;
3651 if (warningdone < 5) {
3652 kprintf("pmap_collect: collecting pv entries -- "
3653 "suggest increasing PMAP_SHPGPERPROC\n");
3657 for (i = 0; i < vm_page_array_size; i++) {
3658 m = &vm_page_array[i];
3659 if (m->wire_count || m->hold_count)
3661 if (vm_page_busy_try(m, TRUE) == 0) {
3662 if (m->wire_count == 0 && m->hold_count == 0) {
3671 * Scan the pmap for active page table entries and issue a callback.
3672 * The callback must dispose of pte_pv, whos PTE entry is at *ptep in
3673 * its parent page table.
3675 * pte_pv will be NULL if the page or page table is unmanaged.
3676 * pt_pv will point to the page table page containing the pte for the page.
3678 * NOTE! If we come across an unmanaged page TABLE (verses an unmanaged page),
3679 * we pass a NULL pte_pv and we pass a pt_pv pointing to the passed
3680 * process pmap's PD and page to the callback function. This can be
3681 * confusing because the pt_pv is really a pd_pv, and the target page
3682 * table page is simply aliased by the pmap and not owned by it.
3684 * It is assumed that the start and end are properly rounded to the page size.
3686 * It is assumed that PD pages and above are managed and thus in the RB tree,
3687 * allowing us to use RB_SCAN from the PD pages down for ranged scans.
3689 struct pmap_scan_info {
3693 vm_pindex_t sva_pd_pindex;
3694 vm_pindex_t eva_pd_pindex;
3695 void (*func)(pmap_t, struct pmap_scan_info *,
3696 pv_entry_t, vm_pindex_t *, pv_entry_t,
3698 pt_entry_t *, void *);
3700 pmap_inval_bulk_t bulk_core;
3701 pmap_inval_bulk_t *bulk;
3706 static int pmap_scan_cmp(pv_entry_t pv, void *data);
3707 static int pmap_scan_callback(pv_entry_t pv, void *data);
3710 pmap_scan(struct pmap_scan_info *info, int smp_inval)
3712 struct pmap *pmap = info->pmap;
3713 pv_entry_t pd_pv; /* A page directory PV */
3714 pv_entry_t pt_pv; /* A page table PV */
3715 pv_entry_t pte_pv; /* A page table entry PV */
3716 vm_pindex_t *pte_placemark;
3717 vm_pindex_t *pt_placemark;
3720 struct pv_entry dummy_pv;
3725 if (info->sva == info->eva)
3728 info->bulk = &info->bulk_core;
3729 pmap_inval_bulk_init(&info->bulk_core, pmap);
3735 * Hold the token for stability; if the pmap is empty we have nothing
3739 if (pmap->pm_stats.resident_count == 0) {
3747 * Special handling for scanning one page, which is a very common
3748 * operation (it is?).
3750 * NOTE: Locks must be ordered bottom-up. pte,pt,pd,pdp,pml4
3752 if (info->sva + PAGE_SIZE == info->eva) {
3753 if (info->sva >= VM_MAX_USER_ADDRESS) {
3755 * Kernel mappings do not track wire counts on
3756 * page table pages and only maintain pd_pv and
3757 * pte_pv levels so pmap_scan() works.
3760 pte_pv = pv_get(pmap, pmap_pte_pindex(info->sva),
3762 ptep = vtopte(info->sva);
3765 * User pages which are unmanaged will not have a
3766 * pte_pv. User page table pages which are unmanaged
3767 * (shared from elsewhere) will also not have a pt_pv.
3768 * The func() callback will pass both pte_pv and pt_pv
3769 * as NULL in that case.
3771 * We hold pte_placemark across the operation for
3774 * WARNING! We must hold pt_placemark across the
3775 * *ptep test to prevent misintepreting
3776 * a non-zero *ptep as a shared page
3777 * table page. Hold it across the function
3778 * callback as well for SMP safety.
3780 pte_pv = pv_get(pmap, pmap_pte_pindex(info->sva),
3782 pt_pv = pv_get(pmap, pmap_pt_pindex(info->sva),
3784 if (pt_pv == NULL) {
3785 KKASSERT(pte_pv == NULL);
3786 pd_pv = pv_get(pmap,
3787 pmap_pd_pindex(info->sva),
3790 ptep = pv_pte_lookup(pd_pv,
3791 pmap_pt_index(info->sva));
3793 info->func(pmap, info,
3799 pv_placemarker_wakeup(pmap,
3804 pv_placemarker_wakeup(pmap,
3807 pv_placemarker_wakeup(pmap, pte_placemark);
3810 ptep = pv_pte_lookup(pt_pv, pmap_pte_index(info->sva));
3814 * NOTE: *ptep can't be ripped out from under us if we hold
3815 * pte_pv (or pte_placemark) locked, but bits can
3821 KKASSERT(pte_pv == NULL);
3822 pv_placemarker_wakeup(pmap, pte_placemark);
3823 } else if (pte_pv) {
3824 KASSERT((oldpte & (pmap->pmap_bits[PG_MANAGED_IDX] |
3825 pmap->pmap_bits[PG_V_IDX])) ==
3826 (pmap->pmap_bits[PG_MANAGED_IDX] |
3827 pmap->pmap_bits[PG_V_IDX]),
3828 ("badA *ptep %016lx/%016lx sva %016lx pte_pv %p",
3829 *ptep, oldpte, info->sva, pte_pv));
3830 info->func(pmap, info, pte_pv, NULL, pt_pv, 0,
3831 info->sva, ptep, info->arg);
3833 KASSERT((oldpte & (pmap->pmap_bits[PG_MANAGED_IDX] |
3834 pmap->pmap_bits[PG_V_IDX])) ==
3835 pmap->pmap_bits[PG_V_IDX],
3836 ("badB *ptep %016lx/%016lx sva %016lx pte_pv NULL",
3837 *ptep, oldpte, info->sva));
3838 info->func(pmap, info, NULL, pte_placemark, pt_pv, 0,
3839 info->sva, ptep, info->arg);
3844 pmap_inval_bulk_flush(info->bulk);
3849 * Nominal scan case, RB_SCAN() for PD pages and iterate from
3852 * WARNING! eva can overflow our standard ((N + mask) >> bits)
3853 * bounds, resulting in a pd_pindex of 0. To solve the
3854 * problem we use an inclusive range.
3856 info->sva_pd_pindex = pmap_pd_pindex(info->sva);
3857 info->eva_pd_pindex = pmap_pd_pindex(info->eva - PAGE_SIZE);
3859 if (info->sva >= VM_MAX_USER_ADDRESS) {
3861 * The kernel does not currently maintain any pv_entry's for
3862 * higher-level page tables.
3864 bzero(&dummy_pv, sizeof(dummy_pv));
3865 dummy_pv.pv_pindex = info->sva_pd_pindex;
3866 spin_lock(&pmap->pm_spin);
3867 while (dummy_pv.pv_pindex <= info->eva_pd_pindex) {
3868 pmap_scan_callback(&dummy_pv, info);
3869 ++dummy_pv.pv_pindex;
3870 if (dummy_pv.pv_pindex < info->sva_pd_pindex) /*wrap*/
3873 spin_unlock(&pmap->pm_spin);
3876 * User page tables maintain local PML4, PDP, and PD
3877 * pv_entry's at the very least. PT pv's might be
3878 * unmanaged and thus not exist. PTE pv's might be
3879 * unmanaged and thus not exist.
3881 spin_lock(&pmap->pm_spin);
3882 pv_entry_rb_tree_RB_SCAN(&pmap->pm_pvroot, pmap_scan_cmp,
3883 pmap_scan_callback, info);
3884 spin_unlock(&pmap->pm_spin);
3886 pmap_inval_bulk_flush(info->bulk);
3890 * WARNING! pmap->pm_spin held
3892 * WARNING! eva can overflow our standard ((N + mask) >> bits)
3893 * bounds, resulting in a pd_pindex of 0. To solve the
3894 * problem we use an inclusive range.
3897 pmap_scan_cmp(pv_entry_t pv, void *data)
3899 struct pmap_scan_info *info = data;
3900 if (pv->pv_pindex < info->sva_pd_pindex)
3902 if (pv->pv_pindex > info->eva_pd_pindex)
3908 * pmap_scan() by PDs
3910 * WARNING! pmap->pm_spin held
3913 pmap_scan_callback(pv_entry_t pv, void *data)
3915 struct pmap_scan_info *info = data;
3916 struct pmap *pmap = info->pmap;
3917 pv_entry_t pd_pv; /* A page directory PV */
3918 pv_entry_t pt_pv; /* A page table PV */
3919 vm_pindex_t *pt_placemark;
3924 vm_offset_t va_next;
3925 vm_pindex_t pd_pindex;
3935 * Pull the PD pindex from the pv before releasing the spinlock.
3937 * WARNING: pv is faked for kernel pmap scans.
3939 pd_pindex = pv->pv_pindex;
3940 spin_unlock(&pmap->pm_spin);
3941 pv = NULL; /* invalid after spinlock unlocked */
3944 * Calculate the page range within the PD. SIMPLE pmaps are
3945 * direct-mapped for the entire 2^64 address space. Normal pmaps
3946 * reflect the user and kernel address space which requires
3947 * cannonicalization w/regards to converting pd_pindex's back
3950 sva = (pd_pindex - pmap_pd_pindex(0)) << PDPSHIFT;
3951 if ((pmap->pm_flags & PMAP_FLAG_SIMPLE) == 0 &&
3952 (sva & PML4_SIGNMASK)) {
3953 sva |= PML4_SIGNMASK;
3955 eva = sva + NBPDP; /* can overflow */
3956 if (sva < info->sva)
3958 if (eva < info->sva || eva > info->eva)
3962 * NOTE: kernel mappings do not track page table pages, only
3965 * NOTE: Locks must be ordered bottom-up. pte,pt,pd,pdp,pml4.
3966 * However, for the scan to be efficient we try to
3967 * cache items top-down.
3972 for (; sva < eva; sva = va_next) {
3975 if (sva >= VM_MAX_USER_ADDRESS) {
3984 * PD cache, scan shortcut if it doesn't exist.
3986 if (pd_pv == NULL) {
3987 pd_pv = pv_get(pmap, pmap_pd_pindex(sva), NULL);
3988 } else if (pd_pv->pv_pmap != pmap ||
3989 pd_pv->pv_pindex != pmap_pd_pindex(sva)) {
3991 pd_pv = pv_get(pmap, pmap_pd_pindex(sva), NULL);
3993 if (pd_pv == NULL) {
3994 va_next = (sva + NBPDP) & ~PDPMASK;
4003 * NOTE: The cached pt_pv can be removed from the pmap when
4004 * pmap_dynamic_delete is enabled.
4006 if (pt_pv && (pt_pv->pv_pmap != pmap ||
4007 pt_pv->pv_pindex != pmap_pt_pindex(sva))) {
4011 if (pt_pv == NULL) {
4012 pt_pv = pv_get_try(pmap, pmap_pt_pindex(sva),
4013 &pt_placemark, &error);
4015 pv_put(pd_pv); /* lock order */
4022 pv_placemarker_wait(pmap, pt_placemark);
4027 /* may have to re-check later if pt_pv is NULL here */
4031 * If pt_pv is NULL we either have an shared page table
4032 * page and must issue a callback specific to that case,
4033 * or there is no page table page.
4035 * Either way we can skip the page table page.
4037 * WARNING! pt_pv can also be NULL due to a pv creation
4038 * race where we find it to be NULL and then
4039 * later see a pte_pv. But its possible the pt_pv
4040 * got created inbetween the two operations, so
4043 if (pt_pv == NULL) {
4045 * Possible unmanaged (shared from another pmap)
4048 * WARNING! We must hold pt_placemark across the
4049 * *ptep test to prevent misintepreting
4050 * a non-zero *ptep as a shared page
4051 * table page. Hold it across the function
4052 * callback as well for SMP safety.
4054 ptep = pv_pte_lookup(pd_pv, pmap_pt_index(sva));
4055 if (*ptep & pmap->pmap_bits[PG_V_IDX]) {
4056 info->func(pmap, info, NULL, pt_placemark,
4058 sva, ptep, info->arg);
4060 pv_placemarker_wakeup(pmap, pt_placemark);
4064 * Done, move to next page table page.
4066 va_next = (sva + NBPDR) & ~PDRMASK;
4073 * From this point in the loop testing pt_pv for non-NULL
4074 * means we are in UVM, else if it is NULL we are in KVM.
4076 * Limit our scan to either the end of the va represented
4077 * by the current page table page, or to the end of the
4078 * range being removed.
4081 va_next = (sva + NBPDR) & ~PDRMASK;
4088 * Scan the page table for pages. Some pages may not be
4089 * managed (might not have a pv_entry).
4091 * There is no page table management for kernel pages so
4092 * pt_pv will be NULL in that case, but otherwise pt_pv
4093 * is non-NULL, locked, and referenced.
4097 * At this point a non-NULL pt_pv means a UVA, and a NULL
4098 * pt_pv means a KVA.
4101 ptep = pv_pte_lookup(pt_pv, pmap_pte_index(sva));
4105 while (sva < va_next) {
4107 vm_pindex_t *pte_placemark;
4110 * Yield every 64 pages, stop if requested.
4112 if ((++info->count & 63) == 0)
4118 * We can shortcut our scan if *ptep == 0. This is
4119 * an unlocked check.
4129 * Acquire the related pte_pv, if any. If *ptep == 0
4130 * the related pte_pv should not exist, but if *ptep
4131 * is not zero the pte_pv may or may not exist (e.g.
4132 * will not exist for an unmanaged page).
4134 * However a multitude of races are possible here
4135 * so if we cannot lock definite state we clean out
4136 * our cache and break the inner while() loop to
4137 * force a loop up to the top of the for().
4139 * XXX unlock/relock pd_pv, pt_pv, and re-test their
4140 * validity instead of looping up?
4142 pte_pv = pv_get_try(pmap, pmap_pte_pindex(sva),
4143 &pte_placemark, &error);
4145 pv_put(pd_pv); /* lock order */
4148 pv_put(pt_pv); /* lock order */
4151 if (pte_pv) { /* block */
4156 pv_placemarker_wait(pmap,
4159 va_next = sva; /* retry */
4164 * Reload *ptep after successfully locking the
4165 * pindex. If *ptep == 0 we had better NOT have a
4172 kprintf("Unexpected non-NULL pte_pv "
4174 "*ptep = %016lx/%016lx\n",
4175 pte_pv, pt_pv, *ptep, oldpte);
4176 panic("Unexpected non-NULL pte_pv");
4178 pv_placemarker_wakeup(pmap, pte_placemark);
4186 * We can't hold pd_pv across the callback (because
4187 * we don't pass it to the callback and the callback
4191 vm_page_wire_quick(pd_pv->pv_m);
4196 * Ready for the callback. The locked pte_pv (if any)
4197 * is consumed by the callback. pte_pv will exist if
4198 * the page is managed, and will not exist if it
4201 if (oldpte & pmap->pmap_bits[PG_MANAGED_IDX]) {
4206 (oldpte & pmap->pmap_bits[PG_V_IDX]),
4207 ("badC *ptep %016lx/%016lx sva %016lx "
4209 *ptep, oldpte, sva, pte_pv));
4211 * We must unlock pd_pv across the callback
4212 * to avoid deadlocks on any recursive
4213 * disposal. Re-check that it still exists
4216 * Call target disposes of pte_pv and may
4217 * destroy but will not dispose of pt_pv.
4219 info->func(pmap, info, pte_pv, NULL,
4221 sva, ptep, info->arg);
4226 * We must unlock pd_pv across the callback
4227 * to avoid deadlocks on any recursive
4228 * disposal. Re-check that it still exists
4231 * Call target disposes of pte_pv or
4232 * pte_placemark and may destroy but will
4233 * not dispose of pt_pv.
4235 KASSERT(pte_pv == NULL &&
4236 (oldpte & pmap->pmap_bits[PG_V_IDX]),
4237 ("badD *ptep %016lx/%016lx sva %016lx "
4238 "pte_pv %p pte_pv->pv_m %p ",
4240 pte_pv, (pte_pv ? pte_pv->pv_m : NULL)));
4244 info->func(pmap, info,
4247 sva, ptep, info->arg);
4249 info->func(pmap, info,
4250 NULL, pte_placemark,
4252 sva, ptep, info->arg);
4257 vm_page_unwire_quick(pd_pv->pv_m);
4258 if (pd_pv->pv_pmap == NULL) {
4259 va_next = sva; /* retry */
4265 * NOTE: The cached pt_pv can be removed from the
4266 * pmap when pmap_dynamic_delete is enabled,
4267 * which will cause ptep to become stale.
4269 * This also means that no pages remain under
4270 * the PT, so we can just break out of the inner
4271 * loop and let the outer loop clean everything
4274 if (pt_pv && pt_pv->pv_pmap != pmap)
4289 if ((++info->count & 7) == 0)
4293 * Relock before returning.
4295 spin_lock(&pmap->pm_spin);
4300 pmap_remove(struct pmap *pmap, vm_offset_t sva, vm_offset_t eva)
4302 struct pmap_scan_info info;
4307 info.func = pmap_remove_callback;
4309 pmap_scan(&info, 1);
4312 if (eva - sva < 1024*1024) {
4314 cpu_invlpg((void *)sva);
4322 pmap_remove_noinval(struct pmap *pmap, vm_offset_t sva, vm_offset_t eva)
4324 struct pmap_scan_info info;
4329 info.func = pmap_remove_callback;
4331 pmap_scan(&info, 0);
4335 pmap_remove_callback(pmap_t pmap, struct pmap_scan_info *info,
4336 pv_entry_t pte_pv, vm_pindex_t *pte_placemark,
4337 pv_entry_t pt_pv, int sharept,
4338 vm_offset_t va, pt_entry_t *ptep, void *arg __unused)
4346 * This will also drop pt_pv's wire_count. Note that
4347 * terminal pages are not wired based on mmu presence.
4349 * NOTE: If this is the kernel_pmap, pt_pv can be NULL.
4351 KKASSERT(pte_pv->pv_m != NULL);
4352 pmap_remove_pv_pte(pte_pv, pt_pv, info->bulk, 2);
4353 pte_pv = NULL; /* safety */
4356 * Recursively destroy higher-level page tables.
4358 * This is optional. If we do not, they will still
4359 * be destroyed when the process exits.
4361 * NOTE: Do not destroy pv_entry's with extra hold refs,
4362 * a caller may have unlocked it and intends to
4363 * continue to use it.
4365 if (pmap_dynamic_delete &&
4368 pt_pv->pv_m->wire_count == 1 &&
4369 (pt_pv->pv_hold & PV_HOLD_MASK) == 2 &&
4370 pt_pv->pv_pindex != pmap_pml4_pindex()) {
4371 if (pmap_dynamic_delete == 2)
4372 kprintf("B %jd %08x\n", pt_pv->pv_pindex, pt_pv->pv_hold);
4373 pv_hold(pt_pv); /* extra hold */
4374 pmap_remove_pv_pte(pt_pv, NULL, info->bulk, 1);
4375 pv_lock(pt_pv); /* prior extra hold + relock */
4377 } else if (sharept == 0) {
4379 * Unmanaged pte (pte_placemark is non-NULL)
4381 * pt_pv's wire_count is still bumped by unmanaged pages
4382 * so we must decrement it manually.
4384 * We have to unwire the target page table page.
4386 pte = pmap_inval_bulk(info->bulk, va, ptep, 0);
4387 if (pte & pmap->pmap_bits[PG_W_IDX])
4388 atomic_add_long(&pmap->pm_stats.wired_count, -1);
4389 atomic_add_long(&pmap->pm_stats.resident_count, -1);
4390 if (vm_page_unwire_quick(pt_pv->pv_m))
4391 panic("pmap_remove: insufficient wirecount");
4392 pv_placemarker_wakeup(pmap, pte_placemark);
4395 * Unmanaged page table (pt, pd, or pdp. Not pte) for
4396 * a shared page table.
4398 * pt_pv is actually the pd_pv for our pmap (not the shared
4401 * We have to unwire the target page table page and we
4402 * have to unwire our page directory page.
4404 * It is unclear how we can invalidate a segment so we
4405 * invalidate -1 which invlidates the tlb.
4407 pte = pmap_inval_bulk(info->bulk, (vm_offset_t)-1, ptep, 0);
4408 atomic_add_long(&pmap->pm_stats.resident_count, -1);
4409 KKASSERT((pte & pmap->pmap_bits[PG_DEVICE_IDX]) == 0);
4410 if (vm_page_unwire_quick(PHYS_TO_VM_PAGE(pte & PG_FRAME)))
4411 panic("pmap_remove: shared pgtable1 bad wirecount");
4412 if (vm_page_unwire_quick(pt_pv->pv_m))
4413 panic("pmap_remove: shared pgtable2 bad wirecount");
4414 pv_placemarker_wakeup(pmap, pte_placemark);
4419 * Removes this physical page from all physical maps in which it resides.
4420 * Reflects back modify bits to the pager.
4422 * This routine may not be called from an interrupt.
4426 pmap_remove_all(vm_page_t m)
4429 pmap_inval_bulk_t bulk;
4431 if (!pmap_initialized /* || (m->flags & PG_FICTITIOUS)*/)
4434 vm_page_spin_lock(m);
4435 while ((pv = TAILQ_FIRST(&m->md.pv_list)) != NULL) {
4436 KKASSERT(pv->pv_m == m);
4437 if (pv_hold_try(pv)) {
4438 vm_page_spin_unlock(m);
4440 vm_page_spin_unlock(m);
4443 vm_page_spin_lock(m);
4446 KKASSERT(pv->pv_pmap && pv->pv_m == m);
4449 * Holding no spinlocks, pv is locked. Once we scrap
4450 * pv we can no longer use it as a list iterator (but
4451 * we are doing a TAILQ_FIRST() so we are ok).
4453 pmap_inval_bulk_init(&bulk, pv->pv_pmap);
4454 pmap_remove_pv_pte(pv, NULL, &bulk, 2);
4455 pv = NULL; /* safety */
4456 pmap_inval_bulk_flush(&bulk);
4457 vm_page_spin_lock(m);
4459 KKASSERT((m->flags & (PG_MAPPED|PG_WRITEABLE)) == 0);
4460 vm_page_spin_unlock(m);
4464 * Removes the page from a particular pmap
4467 pmap_remove_specific(pmap_t pmap, vm_page_t m)
4470 pmap_inval_bulk_t bulk;
4472 if (!pmap_initialized)
4476 vm_page_spin_lock(m);
4477 TAILQ_FOREACH(pv, &m->md.pv_list, pv_list) {
4478 if (pv->pv_pmap != pmap)
4480 KKASSERT(pv->pv_m == m);
4481 if (pv_hold_try(pv)) {
4482 vm_page_spin_unlock(m);
4484 vm_page_spin_unlock(m);
4489 KKASSERT(pv->pv_pmap == pmap && pv->pv_m == m);
4492 * Holding no spinlocks, pv is locked. Once gone it can't
4493 * be used as an iterator. In fact, because we couldn't
4494 * necessarily lock it atomically it may have moved within
4495 * the list and ALSO cannot be used as an iterator.
4497 pmap_inval_bulk_init(&bulk, pv->pv_pmap);
4498 pmap_remove_pv_pte(pv, NULL, &bulk, 2);
4499 pv = NULL; /* safety */
4500 pmap_inval_bulk_flush(&bulk);
4503 vm_page_spin_unlock(m);
4507 * Set the physical protection on the specified range of this map
4508 * as requested. This function is typically only used for debug watchpoints
4511 * This function may not be called from an interrupt if the map is
4512 * not the kernel_pmap.
4514 * NOTE! For shared page table pages we just unmap the page.
4517 pmap_protect(pmap_t pmap, vm_offset_t sva, vm_offset_t eva, vm_prot_t prot)
4519 struct pmap_scan_info info;
4520 /* JG review for NX */
4524 if ((prot & VM_PROT_READ) == VM_PROT_NONE) {
4525 pmap_remove(pmap, sva, eva);
4528 if (prot & VM_PROT_WRITE)
4533 info.func = pmap_protect_callback;
4535 pmap_scan(&info, 1);
4540 pmap_protect_callback(pmap_t pmap, struct pmap_scan_info *info,
4541 pv_entry_t pte_pv, vm_pindex_t *pte_placemark,
4542 pv_entry_t pt_pv, int sharept,
4543 vm_offset_t va, pt_entry_t *ptep, void *arg __unused)
4554 KKASSERT(pte_pv->pv_m != NULL);
4556 if (pbits & pmap->pmap_bits[PG_A_IDX]) {
4557 if ((pbits & pmap->pmap_bits[PG_DEVICE_IDX]) == 0) {
4558 m = PHYS_TO_VM_PAGE(pbits & PG_FRAME);
4559 KKASSERT(m == pte_pv->pv_m);
4560 vm_page_flag_set(m, PG_REFERENCED);
4562 cbits &= ~pmap->pmap_bits[PG_A_IDX];
4564 if (pbits & pmap->pmap_bits[PG_M_IDX]) {
4565 if (pmap_track_modified(pte_pv->pv_pindex)) {
4566 if ((pbits & pmap->pmap_bits[PG_DEVICE_IDX]) == 0) {
4568 m = PHYS_TO_VM_PAGE(pbits &
4573 cbits &= ~pmap->pmap_bits[PG_M_IDX];
4576 } else if (sharept) {
4578 * Unmanaged page table, pt_pv is actually the pd_pv
4579 * for our pmap (not the object's shared pmap).
4581 * When asked to protect something in a shared page table
4582 * page we just unmap the page table page. We have to
4583 * invalidate the tlb in this situation.
4585 * XXX Warning, shared page tables will not be used for
4586 * OBJT_DEVICE or OBJT_MGTDEVICE (PG_FICTITIOUS) mappings
4587 * so PHYS_TO_VM_PAGE() should be safe here.
4589 pte = pmap_inval_smp(pmap, (vm_offset_t)-1, 1, ptep, 0);
4590 if (vm_page_unwire_quick(PHYS_TO_VM_PAGE(pte & PG_FRAME)))
4591 panic("pmap_protect: pgtable1 pg bad wirecount");
4592 if (vm_page_unwire_quick(pt_pv->pv_m))
4593 panic("pmap_protect: pgtable2 pg bad wirecount");
4596 /* else unmanaged page, adjust bits, no wire changes */
4599 cbits &= ~pmap->pmap_bits[PG_RW_IDX];
4601 if (pmap_enter_debug > 0) {
4603 kprintf("pmap_protect va=%lx ptep=%p pte_pv=%p "
4604 "pt_pv=%p cbits=%08lx\n",
4610 if (pbits != cbits) {
4613 xva = (sharept) ? (vm_offset_t)-1 : va;
4614 if (!pmap_inval_smp_cmpset(pmap, xva,
4615 ptep, pbits, cbits)) {
4623 pv_placemarker_wakeup(pmap, pte_placemark);
4627 * Insert the vm_page (m) at the virtual address (va), replacing any prior
4628 * mapping at that address. Set protection and wiring as requested.
4630 * If entry is non-NULL we check to see if the SEG_SIZE optimization is
4631 * possible. If it is we enter the page into the appropriate shared pmap
4632 * hanging off the related VM object instead of the passed pmap, then we
4633 * share the page table page from the VM object's pmap into the current pmap.
4635 * NOTE: This routine MUST insert the page into the pmap now, it cannot
4638 * NOTE: If (m) is PG_UNMANAGED it may also be a temporary fake vm_page_t.
4642 pmap_enter(pmap_t pmap, vm_offset_t va, vm_page_t m, vm_prot_t prot,
4643 boolean_t wired, vm_map_entry_t entry)
4645 pv_entry_t pt_pv; /* page table */
4646 pv_entry_t pte_pv; /* page table entry */
4647 vm_pindex_t *pte_placemark;
4650 pt_entry_t origpte, newpte;
4655 va = trunc_page(va);
4656 #ifdef PMAP_DIAGNOSTIC
4658 panic("pmap_enter: toobig");
4659 if ((va >= UPT_MIN_ADDRESS) && (va < UPT_MAX_ADDRESS))
4660 panic("pmap_enter: invalid to pmap_enter page table "
4661 "pages (va: 0x%lx)", va);
4663 if (va < UPT_MAX_ADDRESS && pmap == &kernel_pmap) {
4664 kprintf("Warning: pmap_enter called on UVA with "
4667 db_print_backtrace();
4670 if (va >= UPT_MAX_ADDRESS && pmap != &kernel_pmap) {
4671 kprintf("Warning: pmap_enter called on KVA without"
4674 db_print_backtrace();
4679 * Get locked PV entries for our new page table entry (pte_pv or
4680 * pte_placemark) and for its parent page table (pt_pv). We need
4681 * the parent so we can resolve the location of the ptep.
4683 * Only hardware MMU actions can modify the ptep out from
4686 * if (m) is fictitious or unmanaged we do not create a managing
4687 * pte_pv for it. Any pre-existing page's management state must
4688 * match (avoiding code complexity).
4690 * If the pmap is still being initialized we assume existing
4693 * Kernel mapppings do not track page table pages (i.e. pt_pv).
4695 * WARNING! If replacing a managed mapping with an unmanaged mapping
4696 * pte_pv will wind up being non-NULL and must be handled
4699 if (pmap_initialized == FALSE) {
4702 pte_placemark = NULL;
4705 } else if (m->flags & (/*PG_FICTITIOUS |*/ PG_UNMANAGED)) { /* XXX */
4706 pte_pv = pv_get(pmap, pmap_pte_pindex(va), &pte_placemark);
4707 KKASSERT(pte_pv == NULL);
4708 if (va >= VM_MAX_USER_ADDRESS) {
4712 pt_pv = pmap_allocpte_seg(pmap, pmap_pt_pindex(va),
4714 ptep = pv_pte_lookup(pt_pv, pmap_pte_index(va));
4718 KASSERT(origpte == 0 ||
4719 (origpte & pmap->pmap_bits[PG_MANAGED_IDX]) == 0,
4720 ("Invalid PTE 0x%016jx @ 0x%016jx\n", origpte, va));
4722 if (va >= VM_MAX_USER_ADDRESS) {
4724 * Kernel map, pv_entry-tracked.
4727 pte_pv = pmap_allocpte(pmap, pmap_pte_pindex(va), NULL);
4733 pte_pv = pmap_allocpte_seg(pmap, pmap_pte_pindex(va),
4735 ptep = pv_pte_lookup(pt_pv, pmap_pte_index(va));
4737 pte_placemark = NULL; /* safety */
4740 KASSERT(origpte == 0 ||
4741 (origpte & pmap->pmap_bits[PG_MANAGED_IDX]),
4742 ("Invalid PTE 0x%016jx @ 0x%016jx\n", origpte, va));
4745 pa = VM_PAGE_TO_PHYS(m);
4746 opa = origpte & PG_FRAME;
4749 * Calculate the new PTE. Note that pte_pv alone does not mean
4750 * the new pte_pv is managed, it could exist because the old pte
4751 * was managed even if the new one is not.
4753 newpte = (pt_entry_t)(pa | pte_prot(pmap, prot) |
4754 pmap->pmap_bits[PG_V_IDX] | pmap->pmap_bits[PG_A_IDX]);
4756 newpte |= pmap->pmap_bits[PG_W_IDX];
4757 if (va < VM_MAX_USER_ADDRESS)
4758 newpte |= pmap->pmap_bits[PG_U_IDX];
4759 if (pte_pv && (m->flags & (/*PG_FICTITIOUS |*/ PG_UNMANAGED)) == 0)
4760 newpte |= pmap->pmap_bits[PG_MANAGED_IDX];
4761 // if (pmap == &kernel_pmap)
4762 // newpte |= pgeflag;
4763 newpte |= pmap->pmap_cache_bits[m->pat_mode];
4764 if (m->flags & PG_FICTITIOUS)
4765 newpte |= pmap->pmap_bits[PG_DEVICE_IDX];
4768 * It is possible for multiple faults to occur in threaded
4769 * environments, the existing pte might be correct.
4771 if (((origpte ^ newpte) &
4772 ~(pt_entry_t)(pmap->pmap_bits[PG_M_IDX] |
4773 pmap->pmap_bits[PG_A_IDX])) == 0) {
4778 * Ok, either the address changed or the protection or wiring
4781 * Clear the current entry, interlocking the removal. For managed
4782 * pte's this will also flush the modified state to the vm_page.
4783 * Atomic ops are mandatory in order to ensure that PG_M events are
4784 * not lost during any transition.
4786 * WARNING: The caller has busied the new page but not the original
4787 * vm_page which we are trying to replace. Because we hold
4788 * the pte_pv lock, but have not busied the page, PG bits
4789 * can be cleared out from under us.
4792 if (origpte & pmap->pmap_bits[PG_MANAGED_IDX]) {
4794 * Old page was managed. Expect pte_pv to exist.
4795 * (it might also exist if the old page was unmanaged).
4797 * NOTE: pt_pv won't exist for a kernel page
4798 * (managed or otherwise).
4800 * NOTE: We may be reusing the pte_pv so we do not
4801 * destroy it in pmap_remove_pv_pte().
4803 KKASSERT(pte_pv && pte_pv->pv_m);
4804 if (prot & VM_PROT_NOSYNC) {
4805 pmap_remove_pv_pte(pte_pv, pt_pv, NULL, 0);
4807 pmap_inval_bulk_t bulk;
4809 pmap_inval_bulk_init(&bulk, pmap);
4810 pmap_remove_pv_pte(pte_pv, pt_pv, &bulk, 0);
4811 pmap_inval_bulk_flush(&bulk);
4813 pmap_remove_pv_page(pte_pv);
4814 /* will either set pte_pv->pv_m or pv_free() later */
4817 * Old page was not managed. If we have a pte_pv
4818 * it better not have a pv_m assigned to it. If the
4819 * new page is managed the pte_pv will be destroyed
4820 * near the end (we need its interlock).
4822 * NOTE: We leave the wire count on the PT page
4823 * intact for the followup enter, but adjust
4824 * the wired-pages count on the pmap.
4826 KKASSERT(pte_pv == NULL);
4827 if (prot & VM_PROT_NOSYNC) {
4829 * NOSYNC (no mmu sync) requested.
4831 (void)pte_load_clear(ptep);
4832 cpu_invlpg((void *)va);
4837 pmap_inval_smp(pmap, va, 1, ptep, 0);
4841 * We must adjust pm_stats manually for unmanaged
4845 atomic_add_long(&pmap->pm_stats.
4846 resident_count, -1);
4848 if (origpte & pmap->pmap_bits[PG_W_IDX]) {
4849 atomic_add_long(&pmap->pm_stats.
4853 KKASSERT(*ptep == 0);
4857 if (pmap_enter_debug > 0) {
4859 kprintf("pmap_enter: va=%lx m=%p origpte=%lx newpte=%lx ptep=%p"
4860 " pte_pv=%p pt_pv=%p opa=%lx prot=%02x\n",
4862 origpte, newpte, ptep,
4863 pte_pv, pt_pv, opa, prot);
4867 if ((newpte & pmap->pmap_bits[PG_MANAGED_IDX]) == 0) {
4869 * Entering an unmanaged page. We must wire the pt_pv unless
4870 * we retained the wiring from an unmanaged page we had
4871 * removed (if we retained it via pte_pv that will go away
4874 if (pt_pv && (opa == 0 ||
4875 (origpte & pmap->pmap_bits[PG_MANAGED_IDX]))) {
4876 vm_page_wire_quick(pt_pv->pv_m);
4879 atomic_add_long(&pmap->pm_stats.wired_count, 1);
4882 * Unmanaged pages need manual resident_count tracking.
4885 atomic_add_long(&pt_pv->pv_pmap->pm_stats.
4888 if (newpte & pmap->pmap_bits[PG_RW_IDX])
4889 vm_page_flag_set(m, PG_WRITEABLE);
4892 * Entering a managed page. Our pte_pv takes care of the
4893 * PT wiring, so if we had removed an unmanaged page before
4896 * We have to take care of the pmap wired count ourselves.
4898 * Enter on the PV list if part of our managed memory.
4900 KKASSERT(pte_pv && (pte_pv->pv_m == NULL || pte_pv->pv_m == m));
4901 vm_page_spin_lock(m);
4903 pmap_page_stats_adding(m);
4904 TAILQ_INSERT_TAIL(&m->md.pv_list, pte_pv, pv_list);
4905 vm_page_flag_set(m, PG_MAPPED);
4906 if (newpte & pmap->pmap_bits[PG_RW_IDX])
4907 vm_page_flag_set(m, PG_WRITEABLE);
4908 vm_page_spin_unlock(m);
4911 (origpte & pmap->pmap_bits[PG_MANAGED_IDX]) == 0) {
4912 vm_page_unwire_quick(pt_pv->pv_m);
4916 * Adjust pmap wired pages count for new entry.
4919 atomic_add_long(&pte_pv->pv_pmap->pm_stats.
4925 * Kernel VMAs (pt_pv == NULL) require pmap invalidation interlocks.
4927 * User VMAs do not because those will be zero->non-zero, so no
4928 * stale entries to worry about at this point.
4930 * For KVM there appear to still be issues. Theoretically we
4931 * should be able to scrap the interlocks entirely but we
4934 if ((prot & VM_PROT_NOSYNC) == 0 && pt_pv == NULL) {
4935 pmap_inval_smp(pmap, va, 1, ptep, newpte);
4937 origpte = atomic_swap_long(ptep, newpte);
4938 if (origpte & pmap->pmap_bits[PG_M_IDX]) {
4939 kprintf("pmap [M] race @ %016jx\n", va);
4940 atomic_set_long(ptep, pmap->pmap_bits[PG_M_IDX]);
4943 cpu_invlpg((void *)va);
4950 KKASSERT((newpte & pmap->pmap_bits[PG_MANAGED_IDX]) == 0 ||
4951 (m->flags & PG_MAPPED));
4954 * Cleanup the pv entry, allowing other accessors. If the new page
4955 * is not managed but we have a pte_pv (which was locking our
4956 * operation), we can free it now. pte_pv->pv_m should be NULL.
4958 if (pte_pv && (newpte & pmap->pmap_bits[PG_MANAGED_IDX]) == 0) {
4959 pv_free(pte_pv, pt_pv);
4960 } else if (pte_pv) {
4962 } else if (pte_placemark) {
4963 pv_placemarker_wakeup(pmap, pte_placemark);
4970 * This code works like pmap_enter() but assumes VM_PROT_READ and not-wired.
4971 * This code also assumes that the pmap has no pre-existing entry for this
4974 * This code currently may only be used on user pmaps, not kernel_pmap.
4977 pmap_enter_quick(pmap_t pmap, vm_offset_t va, vm_page_t m)
4979 pmap_enter(pmap, va, m, VM_PROT_READ, FALSE, NULL);
4983 * Make a temporary mapping for a physical address. This is only intended
4984 * to be used for panic dumps.
4986 * The caller is responsible for calling smp_invltlb().
4989 pmap_kenter_temporary(vm_paddr_t pa, long i)
4991 pmap_kenter_quick((vm_offset_t)crashdumpmap + (i * PAGE_SIZE), pa);
4992 return ((void *)crashdumpmap);
4995 #define MAX_INIT_PT (96)
4998 * This routine preloads the ptes for a given object into the specified pmap.
4999 * This eliminates the blast of soft faults on process startup and
5000 * immediately after an mmap.
5002 static int pmap_object_init_pt_callback(vm_page_t p, void *data);
5005 pmap_object_init_pt(pmap_t pmap, vm_offset_t addr, vm_prot_t prot,
5006 vm_object_t object, vm_pindex_t pindex,
5007 vm_size_t size, int limit)
5009 struct rb_vm_page_scan_info info;
5014 * We can't preinit if read access isn't set or there is no pmap
5017 if ((prot & VM_PROT_READ) == 0 || pmap == NULL || object == NULL)
5021 * We can't preinit if the pmap is not the current pmap
5023 lp = curthread->td_lwp;
5024 if (lp == NULL || pmap != vmspace_pmap(lp->lwp_vmspace))
5028 * Misc additional checks
5030 psize = x86_64_btop(size);
5032 if ((object->type != OBJT_VNODE) ||
5033 ((limit & MAP_PREFAULT_PARTIAL) && (psize > MAX_INIT_PT) &&
5034 (object->resident_page_count > MAX_INIT_PT))) {
5038 if (pindex + psize > object->size) {
5039 if (object->size < pindex)
5041 psize = object->size - pindex;
5048 * If everything is segment-aligned do not pre-init here. Instead
5049 * allow the normal vm_fault path to pass a segment hint to
5050 * pmap_enter() which will then use an object-referenced shared
5053 if ((addr & SEG_MASK) == 0 &&
5054 (ctob(psize) & SEG_MASK) == 0 &&
5055 (ctob(pindex) & SEG_MASK) == 0) {
5060 * Use a red-black scan to traverse the requested range and load
5061 * any valid pages found into the pmap.
5063 * We cannot safely scan the object's memq without holding the
5066 info.start_pindex = pindex;
5067 info.end_pindex = pindex + psize - 1;
5073 vm_object_hold_shared(object);
5074 vm_page_rb_tree_RB_SCAN(&object->rb_memq, rb_vm_page_scancmp,
5075 pmap_object_init_pt_callback, &info);
5076 vm_object_drop(object);
5081 pmap_object_init_pt_callback(vm_page_t p, void *data)
5083 struct rb_vm_page_scan_info *info = data;
5084 vm_pindex_t rel_index;
5087 * don't allow an madvise to blow away our really
5088 * free pages allocating pv entries.
5090 if ((info->limit & MAP_PREFAULT_MADVISE) &&
5091 vmstats.v_free_count < vmstats.v_free_reserved) {
5096 * Ignore list markers and ignore pages we cannot instantly
5097 * busy (while holding the object token).
5099 if (p->flags & PG_MARKER)
5101 if (vm_page_busy_try(p, TRUE))
5103 if (((p->valid & VM_PAGE_BITS_ALL) == VM_PAGE_BITS_ALL) &&
5104 (p->flags & PG_FICTITIOUS) == 0) {
5105 if ((p->queue - p->pc) == PQ_CACHE)
5106 vm_page_deactivate(p);
5107 rel_index = p->pindex - info->start_pindex;
5108 pmap_enter_quick(info->pmap,
5109 info->addr + x86_64_ptob(rel_index), p);
5117 * Return TRUE if the pmap is in shape to trivially pre-fault the specified
5120 * Returns FALSE if it would be non-trivial or if a pte is already loaded
5123 * XXX This is safe only because page table pages are not freed.
5126 pmap_prefault_ok(pmap_t pmap, vm_offset_t addr)
5130 /*spin_lock(&pmap->pm_spin);*/
5131 if ((pte = pmap_pte(pmap, addr)) != NULL) {
5132 if (*pte & pmap->pmap_bits[PG_V_IDX]) {
5133 /*spin_unlock(&pmap->pm_spin);*/
5137 /*spin_unlock(&pmap->pm_spin);*/
5142 * Change the wiring attribute for a pmap/va pair. The mapping must already
5143 * exist in the pmap. The mapping may or may not be managed. The wiring in
5144 * the page is not changed, the page is returned so the caller can adjust
5145 * its wiring (the page is not locked in any way).
5147 * Wiring is not a hardware characteristic so there is no need to invalidate
5148 * TLB. However, in an SMP environment we must use a locked bus cycle to
5149 * update the pte (if we are not using the pmap_inval_*() API that is)...
5150 * it's ok to do this for simple wiring changes.
5153 pmap_unwire(pmap_t pmap, vm_offset_t va)
5164 * Assume elements in the kernel pmap are stable
5166 if (pmap == &kernel_pmap) {
5167 if (pmap_pt(pmap, va) == 0)
5169 ptep = pmap_pte_quick(pmap, va);
5171 if (pmap_pte_w(pmap, ptep))
5172 atomic_add_long(&pmap->pm_stats.wired_count,-1);
5173 atomic_clear_long(ptep, pmap->pmap_bits[PG_W_IDX]);
5174 pa = *ptep & PG_FRAME;
5175 m = PHYS_TO_VM_PAGE(pa);
5178 * We can only [un]wire pmap-local pages (we cannot wire
5181 pt_pv = pv_get(pmap, pmap_pt_pindex(va), NULL);
5185 ptep = pv_pte_lookup(pt_pv, pmap_pte_index(va));
5186 if ((*ptep & pmap->pmap_bits[PG_V_IDX]) == 0) {
5191 if (pmap_pte_w(pmap, ptep)) {
5192 atomic_add_long(&pt_pv->pv_pmap->pm_stats.wired_count,
5195 /* XXX else return NULL so caller doesn't unwire m ? */
5197 atomic_clear_long(ptep, pmap->pmap_bits[PG_W_IDX]);
5199 pa = *ptep & PG_FRAME;
5200 m = PHYS_TO_VM_PAGE(pa); /* held by wired count */
5207 * Copy the range specified by src_addr/len from the source map to
5208 * the range dst_addr/len in the destination map.
5210 * This routine is only advisory and need not do anything.
5213 pmap_copy(pmap_t dst_pmap, pmap_t src_pmap, vm_offset_t dst_addr,
5214 vm_size_t len, vm_offset_t src_addr)
5221 * Zero the specified physical page.
5223 * This function may be called from an interrupt and no locking is
5227 pmap_zero_page(vm_paddr_t phys)
5229 vm_offset_t va = PHYS_TO_DMAP(phys);
5231 pagezero((void *)va);
5237 * Zero part of a physical page by mapping it into memory and clearing
5238 * its contents with bzero.
5240 * off and size may not cover an area beyond a single hardware page.
5243 pmap_zero_page_area(vm_paddr_t phys, int off, int size)
5245 vm_offset_t virt = PHYS_TO_DMAP(phys);
5247 bzero((char *)virt + off, size);
5253 * Copy the physical page from the source PA to the target PA.
5254 * This function may be called from an interrupt. No locking
5258 pmap_copy_page(vm_paddr_t src, vm_paddr_t dst)
5260 vm_offset_t src_virt, dst_virt;
5262 src_virt = PHYS_TO_DMAP(src);
5263 dst_virt = PHYS_TO_DMAP(dst);
5264 bcopy((void *)src_virt, (void *)dst_virt, PAGE_SIZE);
5268 * pmap_copy_page_frag:
5270 * Copy the physical page from the source PA to the target PA.
5271 * This function may be called from an interrupt. No locking
5275 pmap_copy_page_frag(vm_paddr_t src, vm_paddr_t dst, size_t bytes)
5277 vm_offset_t src_virt, dst_virt;
5279 src_virt = PHYS_TO_DMAP(src);
5280 dst_virt = PHYS_TO_DMAP(dst);
5282 bcopy((char *)src_virt + (src & PAGE_MASK),
5283 (char *)dst_virt + (dst & PAGE_MASK),
5288 * Returns true if the pmap's pv is one of the first 16 pvs linked to from
5289 * this page. This count may be changed upwards or downwards in the future;
5290 * it is only necessary that true be returned for a small subset of pmaps
5291 * for proper page aging.
5294 pmap_page_exists_quick(pmap_t pmap, vm_page_t m)
5299 if (!pmap_initialized || (m->flags & PG_FICTITIOUS))
5302 vm_page_spin_lock(m);
5303 TAILQ_FOREACH(pv, &m->md.pv_list, pv_list) {
5304 if (pv->pv_pmap == pmap) {
5305 vm_page_spin_unlock(m);
5312 vm_page_spin_unlock(m);
5317 * Remove all pages from specified address space this aids process exit
5318 * speeds. Also, this code may be special cased for the current process
5322 pmap_remove_pages(pmap_t pmap, vm_offset_t sva, vm_offset_t eva)
5324 pmap_remove_noinval(pmap, sva, eva);
5329 * pmap_testbit tests bits in pte's note that the testbit/clearbit
5330 * routines are inline, and a lot of things compile-time evaluate.
5334 pmap_testbit(vm_page_t m, int bit)
5340 if (!pmap_initialized || (m->flags & PG_FICTITIOUS))
5343 if (TAILQ_FIRST(&m->md.pv_list) == NULL)
5345 vm_page_spin_lock(m);
5346 if (TAILQ_FIRST(&m->md.pv_list) == NULL) {
5347 vm_page_spin_unlock(m);
5351 TAILQ_FOREACH(pv, &m->md.pv_list, pv_list) {
5353 #if defined(PMAP_DIAGNOSTIC)
5354 if (pv->pv_pmap == NULL) {
5355 kprintf("Null pmap (tb) at pindex: %"PRIu64"\n",
5363 * If the bit being tested is the modified bit, then
5364 * mark clean_map and ptes as never
5367 * WARNING! Because we do not lock the pv, *pte can be in a
5368 * state of flux. Despite this the value of *pte
5369 * will still be related to the vm_page in some way
5370 * because the pv cannot be destroyed as long as we
5371 * hold the vm_page spin lock.
5373 if (bit == PG_A_IDX || bit == PG_M_IDX) {
5374 //& (pmap->pmap_bits[PG_A_IDX] | pmap->pmap_bits[PG_M_IDX])) {
5375 if (!pmap_track_modified(pv->pv_pindex))
5379 pte = pmap_pte_quick(pv->pv_pmap, pv->pv_pindex << PAGE_SHIFT);
5380 if (*pte & pmap->pmap_bits[bit]) {
5381 vm_page_spin_unlock(m);
5385 vm_page_spin_unlock(m);
5390 * This routine is used to modify bits in ptes. Only one bit should be
5391 * specified. PG_RW requires special handling.
5393 * Caller must NOT hold any spin locks
5397 pmap_clearbit(vm_page_t m, int bit_index)
5404 if (!pmap_initialized || (m->flags & PG_FICTITIOUS)) {
5405 if (bit_index == PG_RW_IDX)
5406 vm_page_flag_clear(m, PG_WRITEABLE);
5413 * Loop over all current mappings setting/clearing as appropos If
5414 * setting RO do we need to clear the VAC?
5416 * NOTE: When clearing PG_M we could also (not implemented) drop
5417 * through to the PG_RW code and clear PG_RW too, forcing
5418 * a fault on write to redetect PG_M for virtual kernels, but
5419 * it isn't necessary since virtual kernels invalidate the
5420 * pte when they clear the VPTE_M bit in their virtual page
5423 * NOTE: Does not re-dirty the page when clearing only PG_M.
5425 * NOTE: Because we do not lock the pv, *pte can be in a state of
5426 * flux. Despite this the value of *pte is still somewhat
5427 * related while we hold the vm_page spin lock.
5429 * *pte can be zero due to this race. Since we are clearing
5430 * bits we basically do no harm when this race occurs.
5432 if (bit_index != PG_RW_IDX) {
5433 vm_page_spin_lock(m);
5434 TAILQ_FOREACH(pv, &m->md.pv_list, pv_list) {
5435 #if defined(PMAP_DIAGNOSTIC)
5436 if (pv->pv_pmap == NULL) {
5437 kprintf("Null pmap (cb) at pindex: %"PRIu64"\n",
5443 pte = pmap_pte_quick(pv->pv_pmap,
5444 pv->pv_pindex << PAGE_SHIFT);
5446 if (pbits & pmap->pmap_bits[bit_index])
5447 atomic_clear_long(pte, pmap->pmap_bits[bit_index]);
5449 vm_page_spin_unlock(m);
5454 * Clear PG_RW. Also clears PG_M and marks the page dirty if PG_M
5458 vm_page_spin_lock(m);
5459 TAILQ_FOREACH(pv, &m->md.pv_list, pv_list) {
5461 * don't write protect pager mappings
5463 if (!pmap_track_modified(pv->pv_pindex))
5466 #if defined(PMAP_DIAGNOSTIC)
5467 if (pv->pv_pmap == NULL) {
5468 kprintf("Null pmap (cb) at pindex: %"PRIu64"\n",
5476 * Skip pages which do not have PG_RW set.
5478 pte = pmap_pte_quick(pv->pv_pmap, pv->pv_pindex << PAGE_SHIFT);
5479 if ((*pte & pmap->pmap_bits[PG_RW_IDX]) == 0)
5483 * We must lock the PV to be able to safely test the pte.
5485 if (pv_hold_try(pv)) {
5486 vm_page_spin_unlock(m);
5488 vm_page_spin_unlock(m);
5489 pv_lock(pv); /* held, now do a blocking lock */
5495 * Reload pte after acquiring pv.
5497 pte = pmap_pte_quick(pv->pv_pmap, pv->pv_pindex << PAGE_SHIFT);
5499 if ((*pte & pmap->pmap_bits[PG_RW_IDX]) == 0) {
5505 KKASSERT(pv->pv_pmap == pmap && pv->pv_m == m);
5511 nbits = pbits & ~(pmap->pmap_bits[PG_RW_IDX] |
5512 pmap->pmap_bits[PG_M_IDX]);
5513 if (pmap_inval_smp_cmpset(pmap,
5514 ((vm_offset_t)pv->pv_pindex << PAGE_SHIFT),
5515 pte, pbits, nbits)) {
5522 * If PG_M was found to be set while we were clearing PG_RW
5523 * we also clear PG_M (done above) and mark the page dirty.
5524 * Callers expect this behavior.
5526 * we lost pv so it cannot be used as an iterator. In fact,
5527 * because we couldn't necessarily lock it atomically it may
5528 * have moved within the list and ALSO cannot be used as an
5531 vm_page_spin_lock(m);
5532 if (pbits & pmap->pmap_bits[PG_M_IDX])
5534 vm_page_spin_unlock(m);
5538 if (bit_index == PG_RW_IDX)
5539 vm_page_flag_clear(m, PG_WRITEABLE);
5540 vm_page_spin_unlock(m);
5544 * Lower the permission for all mappings to a given page.
5546 * Page must be busied by caller. Because page is busied by caller this
5547 * should not be able to race a pmap_enter().
5550 pmap_page_protect(vm_page_t m, vm_prot_t prot)
5552 /* JG NX support? */
5553 if ((prot & VM_PROT_WRITE) == 0) {
5554 if (prot & (VM_PROT_READ | VM_PROT_EXECUTE)) {
5556 * NOTE: pmap_clearbit(.. PG_RW) also clears
5557 * the PG_WRITEABLE flag in (m).
5559 pmap_clearbit(m, PG_RW_IDX);
5567 pmap_phys_address(vm_pindex_t ppn)
5569 return (x86_64_ptob(ppn));
5573 * Return a count of reference bits for a page, clearing those bits.
5574 * It is not necessary for every reference bit to be cleared, but it
5575 * is necessary that 0 only be returned when there are truly no
5576 * reference bits set.
5578 * XXX: The exact number of bits to check and clear is a matter that
5579 * should be tested and standardized at some point in the future for
5580 * optimal aging of shared pages.
5582 * This routine may not block.
5585 pmap_ts_referenced(vm_page_t m)
5592 if (!pmap_initialized || (m->flags & PG_FICTITIOUS))
5595 vm_page_spin_lock(m);
5596 TAILQ_FOREACH(pv, &m->md.pv_list, pv_list) {
5597 if (!pmap_track_modified(pv->pv_pindex))
5600 pte = pmap_pte_quick(pv->pv_pmap, pv->pv_pindex << PAGE_SHIFT);
5601 if (pte && (*pte & pmap->pmap_bits[PG_A_IDX])) {
5602 atomic_clear_long(pte, pmap->pmap_bits[PG_A_IDX]);
5608 vm_page_spin_unlock(m);
5615 * Return whether or not the specified physical page was modified
5616 * in any physical maps.
5619 pmap_is_modified(vm_page_t m)
5623 res = pmap_testbit(m, PG_M_IDX);
5628 * Clear the modify bits on the specified physical page.
5631 pmap_clear_modify(vm_page_t m)
5633 pmap_clearbit(m, PG_M_IDX);
5637 * pmap_clear_reference:
5639 * Clear the reference bit on the specified physical page.
5642 pmap_clear_reference(vm_page_t m)
5644 pmap_clearbit(m, PG_A_IDX);
5648 * Miscellaneous support routines follow
5653 i386_protection_init(void)
5657 /* JG NX support may go here; No VM_PROT_EXECUTE ==> set NX bit */
5658 kp = protection_codes;
5659 for (prot = 0; prot < PROTECTION_CODES_SIZE; prot++) {
5661 case VM_PROT_NONE | VM_PROT_NONE | VM_PROT_NONE:
5663 * Read access is also 0. There isn't any execute bit,
5664 * so just make it readable.
5666 case VM_PROT_READ | VM_PROT_NONE | VM_PROT_NONE:
5667 case VM_PROT_READ | VM_PROT_NONE | VM_PROT_EXECUTE:
5668 case VM_PROT_NONE | VM_PROT_NONE | VM_PROT_EXECUTE:
5671 case VM_PROT_NONE | VM_PROT_WRITE | VM_PROT_NONE:
5672 case VM_PROT_NONE | VM_PROT_WRITE | VM_PROT_EXECUTE:
5673 case VM_PROT_READ | VM_PROT_WRITE | VM_PROT_NONE:
5674 case VM_PROT_READ | VM_PROT_WRITE | VM_PROT_EXECUTE:
5675 *kp++ = pmap_bits_default[PG_RW_IDX];
5682 * Map a set of physical memory pages into the kernel virtual
5683 * address space. Return a pointer to where it is mapped. This
5684 * routine is intended to be used for mapping device memory,
5687 * NOTE: We can't use pgeflag unless we invalidate the pages one at
5690 * NOTE: The PAT attributes {WRITE_BACK, WRITE_THROUGH, UNCACHED, UNCACHEABLE}
5691 * work whether the cpu supports PAT or not. The remaining PAT
5692 * attributes {WRITE_PROTECTED, WRITE_COMBINING} only work if the cpu
5696 pmap_mapdev(vm_paddr_t pa, vm_size_t size)
5698 return(pmap_mapdev_attr(pa, size, PAT_WRITE_BACK));
5702 pmap_mapdev_uncacheable(vm_paddr_t pa, vm_size_t size)
5704 return(pmap_mapdev_attr(pa, size, PAT_UNCACHEABLE));
5708 pmap_mapbios(vm_paddr_t pa, vm_size_t size)
5710 return (pmap_mapdev_attr(pa, size, PAT_WRITE_BACK));
5714 * Map a set of physical memory pages into the kernel virtual
5715 * address space. Return a pointer to where it is mapped. This
5716 * routine is intended to be used for mapping device memory,
5720 pmap_mapdev_attr(vm_paddr_t pa, vm_size_t size, int mode)
5722 vm_offset_t va, tmpva, offset;
5726 offset = pa & PAGE_MASK;
5727 size = roundup(offset + size, PAGE_SIZE);
5729 va = kmem_alloc_nofault(&kernel_map, size, VM_SUBSYS_MAPDEV, PAGE_SIZE);
5731 panic("pmap_mapdev: Couldn't alloc kernel virtual memory");
5733 pa = pa & ~PAGE_MASK;
5734 for (tmpva = va, tmpsize = size; tmpsize > 0;) {
5735 pte = vtopte(tmpva);
5737 kernel_pmap.pmap_bits[PG_RW_IDX] |
5738 kernel_pmap.pmap_bits[PG_V_IDX] | /* pgeflag | */
5739 kernel_pmap.pmap_cache_bits[mode];
5740 tmpsize -= PAGE_SIZE;
5744 pmap_invalidate_range(&kernel_pmap, va, va + size);
5745 pmap_invalidate_cache_range(va, va + size);
5747 return ((void *)(va + offset));
5751 pmap_unmapdev(vm_offset_t va, vm_size_t size)
5753 vm_offset_t base, offset;
5755 base = va & ~PAGE_MASK;
5756 offset = va & PAGE_MASK;
5757 size = roundup(offset + size, PAGE_SIZE);
5758 pmap_qremove(va, size >> PAGE_SHIFT);
5759 kmem_free(&kernel_map, base, size);
5763 * Sets the memory attribute for the specified page.
5766 pmap_page_set_memattr(vm_page_t m, vm_memattr_t ma)
5772 * If "m" is a normal page, update its direct mapping. This update
5773 * can be relied upon to perform any cache operations that are
5774 * required for data coherence.
5776 if ((m->flags & PG_FICTITIOUS) == 0)
5777 pmap_change_attr(PHYS_TO_DMAP(VM_PAGE_TO_PHYS(m)), 1, m->pat_mode);
5781 * Change the PAT attribute on an existing kernel memory map. Caller
5782 * must ensure that the virtual memory in question is not accessed
5783 * during the adjustment.
5786 pmap_change_attr(vm_offset_t va, vm_size_t count, int mode)
5793 panic("pmap_change_attr: va is NULL");
5794 base = trunc_page(va);
5798 *pte = (*pte & ~(pt_entry_t)(kernel_pmap.pmap_cache_mask)) |
5799 kernel_pmap.pmap_cache_bits[mode];
5804 changed = 1; /* XXX: not optimal */
5807 * Flush CPU caches if required to make sure any data isn't cached that
5808 * shouldn't be, etc.
5811 pmap_invalidate_range(&kernel_pmap, base, va);
5812 pmap_invalidate_cache_range(base, va);
5817 * perform the pmap work for mincore
5820 pmap_mincore(pmap_t pmap, vm_offset_t addr)
5822 pt_entry_t *ptep, pte;
5826 ptep = pmap_pte(pmap, addr);
5828 if (ptep && (pte = *ptep) != 0) {
5831 val = MINCORE_INCORE;
5832 if ((pte & pmap->pmap_bits[PG_MANAGED_IDX]) == 0)
5835 pa = pte & PG_FRAME;
5837 if (pte & pmap->pmap_bits[PG_DEVICE_IDX])
5840 m = PHYS_TO_VM_PAGE(pa);
5845 if (pte & pmap->pmap_bits[PG_M_IDX])
5846 val |= MINCORE_MODIFIED|MINCORE_MODIFIED_OTHER;
5848 * Modified by someone
5850 else if (m && (m->dirty || pmap_is_modified(m)))
5851 val |= MINCORE_MODIFIED_OTHER;
5855 if (pte & pmap->pmap_bits[PG_A_IDX])
5856 val |= MINCORE_REFERENCED|MINCORE_REFERENCED_OTHER;
5859 * Referenced by someone
5861 else if (m && ((m->flags & PG_REFERENCED) ||
5862 pmap_ts_referenced(m))) {
5863 val |= MINCORE_REFERENCED_OTHER;
5864 vm_page_flag_set(m, PG_REFERENCED);
5873 * Replace p->p_vmspace with a new one. If adjrefs is non-zero the new
5874 * vmspace will be ref'd and the old one will be deref'd.
5876 * The vmspace for all lwps associated with the process will be adjusted
5877 * and cr3 will be reloaded if any lwp is the current lwp.
5879 * The process must hold the vmspace->vm_map.token for oldvm and newvm
5882 pmap_replacevm(struct proc *p, struct vmspace *newvm, int adjrefs)
5884 struct vmspace *oldvm;
5887 oldvm = p->p_vmspace;
5888 if (oldvm != newvm) {
5891 p->p_vmspace = newvm;
5892 KKASSERT(p->p_nthreads == 1);
5893 lp = RB_ROOT(&p->p_lwp_tree);
5894 pmap_setlwpvm(lp, newvm);
5901 * Set the vmspace for a LWP. The vmspace is almost universally set the
5902 * same as the process vmspace, but virtual kernels need to swap out contexts
5903 * on a per-lwp basis.
5905 * Caller does not necessarily hold any vmspace tokens. Caller must control
5906 * the lwp (typically be in the context of the lwp). We use a critical
5907 * section to protect against statclock and hardclock (statistics collection).
5910 pmap_setlwpvm(struct lwp *lp, struct vmspace *newvm)
5912 struct vmspace *oldvm;
5915 oldvm = lp->lwp_vmspace;
5917 if (oldvm != newvm) {
5919 KKASSERT((newvm->vm_refcnt & VM_REF_DELETED) == 0);
5920 lp->lwp_vmspace = newvm;
5921 if (curthread->td_lwp == lp) {
5922 pmap = vmspace_pmap(newvm);
5923 ATOMIC_CPUMASK_ORBIT(pmap->pm_active, mycpu->gd_cpuid);
5924 if (pmap->pm_active_lock & CPULOCK_EXCL)
5925 pmap_interlock_wait(newvm);
5926 #if defined(SWTCH_OPTIM_STATS)
5929 if (pmap->pmap_bits[TYPE_IDX] == REGULAR_PMAP) {
5930 curthread->td_pcb->pcb_cr3 = vtophys(pmap->pm_pml4);
5931 } else if (pmap->pmap_bits[TYPE_IDX] == EPT_PMAP) {
5932 curthread->td_pcb->pcb_cr3 = KPML4phys;
5934 panic("pmap_setlwpvm: unknown pmap type\n");
5936 load_cr3(curthread->td_pcb->pcb_cr3);
5937 pmap = vmspace_pmap(oldvm);
5938 ATOMIC_CPUMASK_NANDBIT(pmap->pm_active,
5946 * Called when switching to a locked pmap, used to interlock against pmaps
5947 * undergoing modifications to prevent us from activating the MMU for the
5948 * target pmap until all such modifications have completed. We have to do
5949 * this because the thread making the modifications has already set up its
5950 * SMP synchronization mask.
5952 * This function cannot sleep!
5957 pmap_interlock_wait(struct vmspace *vm)
5959 struct pmap *pmap = &vm->vm_pmap;
5961 if (pmap->pm_active_lock & CPULOCK_EXCL) {
5963 KKASSERT(curthread->td_critcount >= 2);
5964 DEBUG_PUSH_INFO("pmap_interlock_wait");
5965 while (pmap->pm_active_lock & CPULOCK_EXCL) {
5967 lwkt_process_ipiq();
5975 pmap_addr_hint(vm_object_t obj, vm_offset_t addr, vm_size_t size)
5978 if ((obj == NULL) || (size < NBPDR) ||
5979 ((obj->type != OBJT_DEVICE) && (obj->type != OBJT_MGTDEVICE))) {
5983 addr = roundup2(addr, NBPDR);
5988 * Used by kmalloc/kfree, page already exists at va
5991 pmap_kvtom(vm_offset_t va)
5993 pt_entry_t *ptep = vtopte(va);
5995 KKASSERT((*ptep & kernel_pmap.pmap_bits[PG_DEVICE_IDX]) == 0);
5996 return(PHYS_TO_VM_PAGE(*ptep & PG_FRAME));
6000 * Initialize machine-specific shared page directory support. This
6001 * is executed when a VM object is created.
6004 pmap_object_init(vm_object_t object)
6006 object->md.pmap_rw = NULL;
6007 object->md.pmap_ro = NULL;
6011 * Clean up machine-specific shared page directory support. This
6012 * is executed when a VM object is destroyed.
6015 pmap_object_free(vm_object_t object)
6019 if ((pmap = object->md.pmap_rw) != NULL) {
6020 object->md.pmap_rw = NULL;
6021 pmap_remove_noinval(pmap,
6022 VM_MIN_USER_ADDRESS, VM_MAX_USER_ADDRESS);
6023 CPUMASK_ASSZERO(pmap->pm_active);
6026 kfree(pmap, M_OBJPMAP);
6028 if ((pmap = object->md.pmap_ro) != NULL) {
6029 object->md.pmap_ro = NULL;
6030 pmap_remove_noinval(pmap,
6031 VM_MIN_USER_ADDRESS, VM_MAX_USER_ADDRESS);
6032 CPUMASK_ASSZERO(pmap->pm_active);
6035 kfree(pmap, M_OBJPMAP);
6040 * pmap_pgscan_callback - Used by pmap_pgscan to acquire the related
6041 * VM page and issue a pginfo->callback.
6043 * We are expected to dispose of any non-NULL pte_pv.
6047 pmap_pgscan_callback(pmap_t pmap, struct pmap_scan_info *info,
6048 pv_entry_t pte_pv, vm_pindex_t *pte_placemark,
6049 pv_entry_t pt_pv, int sharept,
6050 vm_offset_t va, pt_entry_t *ptep, void *arg)
6052 struct pmap_pgscan_info *pginfo = arg;
6057 * Try to busy the page while we hold the pte_pv locked.
6059 KKASSERT(pte_pv->pv_m);
6060 m = PHYS_TO_VM_PAGE(*ptep & PG_FRAME);
6061 if (vm_page_busy_try(m, TRUE) == 0) {
6062 if (m == PHYS_TO_VM_PAGE(*ptep & PG_FRAME)) {
6064 * The callback is issued with the pte_pv
6065 * unlocked and put away, and the pt_pv
6070 vm_page_wire_quick(pt_pv->pv_m);
6073 if (pginfo->callback(pginfo, va, m) < 0)
6077 vm_page_unwire_quick(pt_pv->pv_m);
6084 ++pginfo->busycount;
6089 * Shared page table or unmanaged page (sharept or !sharept)
6091 pv_placemarker_wakeup(pmap, pte_placemark);
6096 pmap_pgscan(struct pmap_pgscan_info *pginfo)
6098 struct pmap_scan_info info;
6100 pginfo->offset = pginfo->beg_addr;
6101 info.pmap = pginfo->pmap;
6102 info.sva = pginfo->beg_addr;
6103 info.eva = pginfo->end_addr;
6104 info.func = pmap_pgscan_callback;
6106 pmap_scan(&info, 0);
6108 pginfo->offset = pginfo->end_addr;
6112 * Wait for a placemarker that we do not own to clear. The placemarker
6113 * in question is not necessary set to the pindex we want, we may have
6114 * to wait on the element because we want to reserve it ourselves.
6118 pv_placemarker_wait(pmap_t pmap, vm_pindex_t *pmark)
6120 spin_lock(&pmap->pm_spin);
6121 if (*pmark != PM_NOPLACEMARK) {
6122 atomic_set_long(pmark, PM_PLACEMARK_WAKEUP);
6123 ssleep(pmark, &pmap->pm_spin, 0, "pvplw", 0);
6125 spin_unlock(&pmap->pm_spin);
6129 * Wakeup a placemarker that we own. Replace the entry with
6130 * PM_NOPLACEMARK and issue a wakeup() if necessary.
6134 pv_placemarker_wakeup(pmap_t pmap, vm_pindex_t *pmark)
6138 spin_lock(&pmap->pm_spin);
6139 pindex = atomic_swap_long(pmark, PM_NOPLACEMARK);
6140 spin_unlock(&pmap->pm_spin);
6141 KKASSERT(pindex != PM_NOPLACEMARK);
6142 if (pindex & PM_PLACEMARK_WAKEUP)