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-2019 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.
48 * - The 'M'odified bit is only applicable to terminal PTEs.
50 * - The 'U'ser access bit can be set for higher-level PTEs as
51 * long as it isn't set for terminal PTEs for pages we don't
52 * want user access to.
56 #include "opt_msgbuf.h"
58 #include <sys/param.h>
59 #include <sys/kernel.h>
61 #include <sys/msgbuf.h>
62 #include <sys/vmmeter.h>
64 #include <sys/systm.h>
67 #include <vm/vm_param.h>
68 #include <sys/sysctl.h>
70 #include <vm/vm_kern.h>
71 #include <vm/vm_page.h>
72 #include <vm/vm_map.h>
73 #include <vm/vm_object.h>
74 #include <vm/vm_extern.h>
75 #include <vm/vm_pageout.h>
76 #include <vm/vm_pager.h>
77 #include <vm/vm_zone.h>
79 #include <sys/thread2.h>
80 #include <sys/spinlock2.h>
81 #include <vm/vm_page2.h>
83 #include <machine/cputypes.h>
84 #include <machine/cpu.h>
85 #include <machine/md_var.h>
86 #include <machine/specialreg.h>
87 #include <machine/smp.h>
88 #include <machine_base/apic/apicreg.h>
89 #include <machine/globaldata.h>
90 #include <machine/pmap.h>
91 #include <machine/pmap_inval.h>
95 #define PMAP_KEEP_PDIRS
97 #if defined(DIAGNOSTIC)
98 #define PMAP_DIAGNOSTIC
104 * pmap debugging will report who owns a pv lock when blocking.
108 #define PMAP_DEBUG_DECL , const char *func, int lineno
109 #define PMAP_DEBUG_ARGS , __func__, __LINE__
110 #define PMAP_DEBUG_COPY , func, lineno
112 #define pv_get(pmap, pindex, pmarkp) _pv_get(pmap, pindex, pmarkp \
114 #define pv_lock(pv) _pv_lock(pv \
116 #define pv_hold_try(pv) _pv_hold_try(pv \
118 #define pv_alloc(pmap, pindex, isnewp) _pv_alloc(pmap, pindex, isnewp \
121 #define pv_free(pv, pvp) _pv_free(pv, pvp PMAP_DEBUG_ARGS)
125 #define PMAP_DEBUG_DECL
126 #define PMAP_DEBUG_ARGS
127 #define PMAP_DEBUG_COPY
129 #define pv_get(pmap, pindex, pmarkp) _pv_get(pmap, pindex, pmarkp)
130 #define pv_lock(pv) _pv_lock(pv)
131 #define pv_hold_try(pv) _pv_hold_try(pv)
132 #define pv_alloc(pmap, pindex, isnewp) _pv_alloc(pmap, pindex, isnewp)
133 #define pv_free(pv, pvp) _pv_free(pv, pvp)
138 * Get PDEs and PTEs for user/kernel address space
140 #define pdir_pde(m, v) (m[(vm_offset_t)(v) >> PDRSHIFT])
142 #define pmap_pde_v(pmap, pde) \
143 ((*(pd_entry_t *)pde & pmap->pmap_bits[PG_V_IDX]) != 0)
144 #define pmap_pte_w(pmap, pte) \
145 ((*(pt_entry_t *)pte & pmap->pmap_bits[PG_W_IDX]) != 0)
146 #define pmap_pte_m(pmap, pte) \
147 ((*(pt_entry_t *)pte & pmap->pmap_bits[PG_M_IDX]) != 0)
148 #define pmap_pte_u(pmap, pte) \
149 ((*(pt_entry_t *)pte & pmap->pmap_bits[PG_U_IDX]) != 0)
150 #define pmap_pte_v(pmap, pte) \
151 ((*(pt_entry_t *)pte & pmap->pmap_bits[PG_V_IDX]) != 0)
154 * Given a map and a machine independent protection code,
155 * convert to a vax protection code.
157 #define pte_prot(m, p) \
158 (m->protection_codes[p & (VM_PROT_READ|VM_PROT_WRITE|VM_PROT_EXECUTE)])
159 static uint64_t protection_codes
[PROTECTION_CODES_SIZE
];
162 * Backing scan macros. Note that in the use case 'ipte' is only a tentitive
163 * value and must be validated by a pmap_inval_smp_cmpset*() or equivalent
166 * NOTE: cpu_ccfence() is required to prevent excessive optmization of
167 * of the (ipte) variable.
169 * NOTE: We don't bother locking the backing object if it isn't mapped
170 * to anything (backing_list is empty).
172 * NOTE: For now guarantee an interlock via iobj->backing_lk if the
173 * object exists and do not shortcut the lock by checking to see
174 * if the list is empty first.
176 #define PMAP_PAGE_BACKING_SCAN(m, match_pmap, ipmap, iptep, ipte, iva) \
178 vm_object_t iobj = m->object; \
179 vm_map_backing_t iba, next_ba; \
180 struct pmap *ipmap; \
184 vm_pindex_t ipindex_start; \
185 vm_pindex_t ipindex_end; \
187 lockmgr(&iobj->backing_lk, LK_SHARED); \
188 next_ba = TAILQ_FIRST(&iobj->backing_list); \
189 while ((iba = next_ba) != NULL) { \
190 next_ba = TAILQ_NEXT(iba, entry); \
192 if (match_pmap && ipmap != match_pmap) \
194 ipindex_start = iba->offset >> PAGE_SHIFT; \
195 ipindex_end = ipindex_start + \
196 ((iba->end - iba->start) >> PAGE_SHIFT); \
197 if (m->pindex < ipindex_start || \
198 m->pindex >= ipindex_end) { \
202 ((m->pindex - ipindex_start) << PAGE_SHIFT); \
203 iptep = pmap_pte(ipmap, iva); \
208 if (m->phys_addr != (ipte & PG_FRAME)) \
211 #define PMAP_PAGE_BACKING_RETRY \
217 #define PMAP_PAGE_BACKING_DONE \
219 lockmgr(&iobj->backing_lk, LK_RELEASE); \
222 static struct pmap iso_pmap;
223 static struct pmap kernel_pmap_store
;
224 struct pmap
*kernel_pmap
= &kernel_pmap_store
;
226 vm_paddr_t avail_start
; /* PA of first available physical page */
227 vm_paddr_t avail_end
; /* PA of last available physical page */
228 vm_offset_t virtual2_start
; /* cutout free area prior to kernel start */
229 vm_offset_t virtual2_end
;
230 vm_offset_t virtual_start
; /* VA of first avail page (after kernel BSS) */
231 vm_offset_t virtual_end
; /* VA of last avail page (end of kernel AS) */
232 vm_offset_t KvaStart
; /* VA start of KVA space */
233 vm_offset_t KvaEnd
; /* VA end of KVA space (non-inclusive) */
234 vm_offset_t KvaSize
; /* max size of KVA space */
235 vm_offset_t DMapMaxAddress
;
237 /* Has pmap_init completed? */
238 __read_frequently
static boolean_t pmap_initialized
= FALSE
;
239 //static int pgeflag; /* PG_G or-in */
240 static uint64_t PatMsr
; /* value of MSR_PAT */
243 static vm_paddr_t dmaplimit
;
244 vm_offset_t kernel_vm_end
= VM_MIN_KERNEL_ADDRESS
;
246 static pt_entry_t pat_pte_index
[PAT_INDEX_SIZE
]; /* PAT -> PG_ bits */
247 static pt_entry_t pat_pde_index
[PAT_INDEX_SIZE
]; /* PAT -> PG_ bits */
249 static uint64_t KPTbase
;
250 static uint64_t KPTphys
;
251 static uint64_t KPDphys
; /* phys addr of kernel level 2 */
252 static uint64_t KPDbase
; /* phys addr of kernel level 2 @ KERNBASE */
253 uint64_t KPDPphys
; /* phys addr of kernel level 3 */
254 uint64_t KPML4phys
; /* phys addr of kernel level 4 */
256 static uint64_t DMPDphys
; /* phys addr of direct mapped level 2 */
257 static uint64_t DMPDPphys
; /* phys addr of direct mapped level 3 */
260 * Data for the pv entry allocation mechanism
262 __read_mostly
static vm_zone_t pvzone
;
263 __read_mostly
static int pmap_pagedaemon_waken
= 0;
264 static struct vm_zone pvzone_store
;
265 static struct pv_entry
*pvinit
;
268 * All those kernel PT submaps that BSD is so fond of
270 pt_entry_t
*CMAP1
= NULL
;
271 caddr_t CADDR1
= NULL
, ptvmmap
= NULL
;
272 static pt_entry_t
*msgbufmap
, *ptmmap
;
273 struct msgbuf
*msgbufp
= NULL
;
276 * PG_* bits for regular (x86) pmap.
278 __read_frequently
static uint64_t pmap_bits_default
[PG_BITS_SIZE
] = {
279 [TYPE_IDX
] = REGULAR_PMAP
,
280 [PG_V_IDX
] = X86_PG_V
,
281 [PG_RW_IDX
] = X86_PG_RW
,
282 [PG_U_IDX
] = X86_PG_U
,
283 [PG_A_IDX
] = X86_PG_A
,
284 [PG_M_IDX
] = X86_PG_M
,
285 [PG_PS_IDX
] = X86_PG_PS
,
286 [PG_G_IDX
] = X86_PG_G
,
287 [PG_W_IDX
] = X86_PG_AVAIL1
,
288 [PG_MANAGED_IDX
] = X86_PG_AVAIL2
,
289 [PG_N_IDX
] = X86_PG_NC_PWT
| X86_PG_NC_PCD
,
290 [PG_NX_IDX
] = X86_PG_NX
,
296 static pt_entry_t
*pt_crashdumpmap
;
297 static caddr_t crashdumpmap
;
299 static int pmap_debug
= 0;
300 SYSCTL_INT(_machdep
, OID_AUTO
, pmap_debug
, CTLFLAG_RW
,
301 &pmap_debug
, 0, "Debug pmap's");
303 static int pmap_enter_debug
= 0;
304 SYSCTL_INT(_machdep
, OID_AUTO
, pmap_enter_debug
, CTLFLAG_RW
,
305 &pmap_enter_debug
, 0, "Debug pmap_enter's");
307 static int pmap_yield_count
= 64;
308 SYSCTL_INT(_machdep
, OID_AUTO
, pmap_yield_count
, CTLFLAG_RW
,
309 &pmap_yield_count
, 0, "Yield during init_pt/release");
310 static int pmap_fast_kernel_cpusync
= 0;
311 SYSCTL_INT(_machdep
, OID_AUTO
, pmap_fast_kernel_cpusync
, CTLFLAG_RW
,
312 &pmap_fast_kernel_cpusync
, 0, "Share page table pages when possible");
313 static int pmap_dynamic_delete
= 0;
314 SYSCTL_INT(_machdep
, OID_AUTO
, pmap_dynamic_delete
, CTLFLAG_RW
,
315 &pmap_dynamic_delete
, 0, "Dynamically delete PT/PD/PDPs");
316 static int pmap_lock_delay
= 100;
317 SYSCTL_INT(_machdep
, OID_AUTO
, pmap_lock_delay
, CTLFLAG_RW
,
318 &pmap_lock_delay
, 0, "Spin loops");
319 static int meltdown_mitigation
= -1;
320 TUNABLE_INT("machdep.meltdown_mitigation", &meltdown_mitigation
);
321 SYSCTL_INT(_machdep
, OID_AUTO
, meltdown_mitigation
, CTLFLAG_RW
,
322 &meltdown_mitigation
, 0, "Userland pmap isolation");
324 static int pmap_nx_enable
= -1; /* -1 = auto */
325 /* needs manual TUNABLE in early probe, see below */
326 SYSCTL_INT(_machdep
, OID_AUTO
, pmap_nx_enable
, CTLFLAG_RD
,
328 "no-execute support (0=disabled, 1=w/READ, 2=w/READ & WRITE)");
330 static int pmap_pv_debug
= 50;
331 SYSCTL_INT(_machdep
, OID_AUTO
, pmap_pv_debug
, CTLFLAG_RW
,
332 &pmap_pv_debug
, 0, "");
334 static long vm_pmap_pv_entries
;
335 SYSCTL_LONG(_vm
, OID_AUTO
, pmap_pv_entries
, CTLFLAG_RD
,
336 &vm_pmap_pv_entries
, 0, "");
338 /* Standard user access funtions */
339 extern int std_copyinstr (const void *udaddr
, void *kaddr
, size_t len
,
341 extern int std_copyin (const void *udaddr
, void *kaddr
, size_t len
);
342 extern int std_copyout (const void *kaddr
, void *udaddr
, size_t len
);
343 extern int std_fubyte (const uint8_t *base
);
344 extern int std_subyte (uint8_t *base
, uint8_t byte
);
345 extern int32_t std_fuword32 (const uint32_t *base
);
346 extern int64_t std_fuword64 (const uint64_t *base
);
347 extern int std_suword64 (uint64_t *base
, uint64_t word
);
348 extern int std_suword32 (uint32_t *base
, int word
);
349 extern uint32_t std_swapu32 (volatile uint32_t *base
, uint32_t v
);
350 extern uint64_t std_swapu64 (volatile uint64_t *base
, uint64_t v
);
351 extern uint32_t std_fuwordadd32 (volatile uint32_t *base
, uint32_t v
);
352 extern uint64_t std_fuwordadd64 (volatile uint64_t *base
, uint64_t v
);
355 static void pv_hold(pv_entry_t pv
);
357 static int _pv_hold_try(pv_entry_t pv
359 static void pv_drop(pv_entry_t pv
);
360 static void _pv_lock(pv_entry_t pv
362 static void pv_unlock(pv_entry_t pv
);
363 static pv_entry_t
_pv_alloc(pmap_t pmap
, vm_pindex_t pindex
, int *isnew
365 static pv_entry_t
_pv_get(pmap_t pmap
, vm_pindex_t pindex
, vm_pindex_t
**pmarkp
367 static void _pv_free(pv_entry_t pv
, pv_entry_t pvp PMAP_DEBUG_DECL
);
368 static pv_entry_t
pv_get_try(pmap_t pmap
, vm_pindex_t pindex
,
369 vm_pindex_t
**pmarkp
, int *errorp
);
370 static void pv_put(pv_entry_t pv
);
371 static void *pv_pte_lookup(pv_entry_t pv
, vm_pindex_t pindex
);
372 static pv_entry_t
pmap_allocpte(pmap_t pmap
, vm_pindex_t ptepindex
,
374 static void pmap_remove_pv_pte(pv_entry_t pv
, pv_entry_t pvp
,
375 pmap_inval_bulk_t
*bulk
, int destroy
);
376 static vm_page_t
pmap_remove_pv_page(pv_entry_t pv
, int clrpgbits
);
377 static int pmap_release_pv(pv_entry_t pv
, pv_entry_t pvp
,
378 pmap_inval_bulk_t
*bulk
);
380 struct pmap_scan_info
;
381 static void pmap_remove_callback(pmap_t pmap
, struct pmap_scan_info
*info
,
382 vm_pindex_t
*pte_placemark
, pv_entry_t pt_pv
,
383 vm_offset_t va
, pt_entry_t
*ptep
, void *arg __unused
);
384 static void pmap_protect_callback(pmap_t pmap
, struct pmap_scan_info
*info
,
385 vm_pindex_t
*pte_placemark
, pv_entry_t pt_pv
,
386 vm_offset_t va
, pt_entry_t
*ptep
, void *arg __unused
);
388 static void x86_64_protection_init (void);
389 static void create_pagetables(vm_paddr_t
*firstaddr
);
390 static void pmap_remove_all (vm_page_t m
);
391 static boolean_t
pmap_testbit (vm_page_t m
, int bit
);
393 static pt_entry_t
*pmap_pte_quick (pmap_t pmap
, vm_offset_t va
);
394 static vm_offset_t
pmap_kmem_choose(vm_offset_t addr
);
396 static void pmap_pinit_defaults(struct pmap
*pmap
);
397 static void pv_placemarker_wait(pmap_t pmap
, vm_pindex_t
*pmark
);
398 static void pv_placemarker_wakeup(pmap_t pmap
, vm_pindex_t
*pmark
);
401 pv_entry_compare(pv_entry_t pv1
, pv_entry_t pv2
)
403 if (pv1
->pv_pindex
< pv2
->pv_pindex
)
405 if (pv1
->pv_pindex
> pv2
->pv_pindex
)
410 RB_GENERATE2(pv_entry_rb_tree
, pv_entry
, pv_entry
,
411 pv_entry_compare
, vm_pindex_t
, pv_pindex
);
414 * We have removed a managed pte. The page might not be hard or soft-busied
415 * at this point so we have to be careful.
417 * If advanced mode is enabled we can clear PG_MAPPED/WRITEABLE only if
418 * MAPPEDMULTI is not set. This must be done atomically against possible
419 * concurrent pmap_enter()s occurring at the same time. If MULTI is set
420 * then the kernel may have to call vm_page_protect() later on to clean
421 * the bits up. This is particularly important for kernel_map/kernel_object
422 * mappings due to the expense of scanning the kernel_object's vm_backing's.
424 * If advanced mode is not enabled we update our tracking counts and
425 * synchronize PG_MAPPED/WRITEABLE later on in pmap_mapped_sync().
429 pmap_removed_pte(vm_page_t m
, pt_entry_t pte
)
436 while ((flags
& PG_MAPPEDMULTI
) == 0) {
437 nflags
= flags
& ~(PG_MAPPED
| PG_WRITEABLE
);
438 if (atomic_fcmpset_int(&m
->flags
, &flags
, nflags
))
444 * Move the kernel virtual free pointer to the next
445 * 2MB. This is used to help improve performance
446 * by using a large (2MB) page for much of the kernel
447 * (.text, .data, .bss)
451 pmap_kmem_choose(vm_offset_t addr
)
453 vm_offset_t newaddr
= addr
;
455 newaddr
= roundup2(addr
, NBPDR
);
460 * Returns the pindex of a page table entry (representing a terminal page).
461 * There are NUPTE_TOTAL page table entries possible (a huge number)
463 * x86-64 has a 48-bit address space, where bit 47 is sign-extended out.
464 * We want to properly translate negative KVAs.
468 pmap_pte_pindex(vm_offset_t va
)
470 return ((va
>> PAGE_SHIFT
) & (NUPTE_TOTAL
- 1));
474 * Returns the pindex of a page table.
478 pmap_pt_pindex(vm_offset_t va
)
480 return (NUPTE_TOTAL
+ ((va
>> PDRSHIFT
) & (NUPT_TOTAL
- 1)));
484 * Returns the pindex of a page directory.
488 pmap_pd_pindex(vm_offset_t va
)
490 return (NUPTE_TOTAL
+ NUPT_TOTAL
+
491 ((va
>> PDPSHIFT
) & (NUPD_TOTAL
- 1)));
496 pmap_pdp_pindex(vm_offset_t va
)
498 return (NUPTE_TOTAL
+ NUPT_TOTAL
+ NUPD_TOTAL
+
499 ((va
>> PML4SHIFT
) & (NUPDP_TOTAL
- 1)));
504 pmap_pml4_pindex(void)
506 return (NUPTE_TOTAL
+ NUPT_TOTAL
+ NUPD_TOTAL
+ NUPDP_TOTAL
);
510 * Return various *clipped* indexes for a given VA.
512 * Returns the index of a PTE in a page table (PT), representing
517 pmap_pte_index(vm_offset_t va
)
519 return ((va
>> PAGE_SHIFT
) & ((1UL << NPTEPGSHIFT
) - 1));
523 * Returns the index of a PDE in a page directory (PD) table, representing
528 pmap_pt_index(vm_offset_t va
)
530 return ((va
>> PDRSHIFT
) & ((1UL << NPDEPGSHIFT
) - 1));
534 * Returns the index of a PDPE in a page directory pointer (PDP) table,
535 * representing a page directory (PD) table.
539 pmap_pd_index(vm_offset_t va
)
541 return ((va
>> PDPSHIFT
) & ((1UL << NPDPEPGSHIFT
) - 1));
545 * Returns the index of a PML4E in the PML4 table, representing a page
546 * directory pointer (PDP) table.
550 pmap_pdp_index(vm_offset_t va
)
552 return ((va
>> PML4SHIFT
) & ((1UL << NPML4EPGSHIFT
) - 1));
556 * Of all the layers (PT, PD, PDP, PML4) the best one to cache is
557 * the PT layer. This will speed up core pmap operations considerably.
559 * NOTE: The pmap spinlock does not need to be held but the passed-in pv
560 * must be in a known associated state (typically by being locked when
561 * the pmap spinlock isn't held). We allow the race for that case.
563 * NOTE: pm_pvhint* is only accessed (read) with the spin-lock held, using
564 * cpu_ccfence() to prevent compiler optimizations from reloading the
569 pv_cache(pmap_t pmap
, pv_entry_t pv
, vm_pindex_t pindex
)
571 if (pindex
< pmap_pt_pindex(0)) {
573 } else if (pindex
< pmap_pd_pindex(0)) {
574 pmap
->pm_pvhint_pt
= pv
;
579 * Locate the requested pt_entry
583 pv_entry_lookup(pmap_t pmap
, vm_pindex_t pindex
)
587 if (pindex
< pmap_pt_pindex(0))
590 if (pindex
< pmap_pd_pindex(0))
591 pv
= pmap
->pm_pvhint_pt
;
595 if (pv
== NULL
|| pv
->pv_pmap
!= pmap
) {
596 pv
= pv_entry_rb_tree_RB_LOOKUP(&pmap
->pm_pvroot
, pindex
);
598 pv_cache(pmap
, pv
, pindex
);
599 } else if (pv
->pv_pindex
!= pindex
) {
600 pv
= pv_entry_rb_tree_RB_LOOKUP_REL(&pmap
->pm_pvroot
,
603 pv_cache(pmap
, pv
, pindex
);
606 pv
= pv_entry_rb_tree_RB_LOOKUP(&pmap
->pm_pvroot
, pindex
);
614 * Super fast pmap_pte routine best used when scanning the pv lists.
615 * This eliminates many course-grained invltlb calls. Note that many of
616 * the pv list scans are across different pmaps and it is very wasteful
617 * to do an entire invltlb when checking a single mapping.
619 static __inline pt_entry_t
*pmap_pte(pmap_t pmap
, vm_offset_t va
);
623 pmap_pte_quick(pmap_t pmap
, vm_offset_t va
)
625 return pmap_pte(pmap
, va
);
629 * The placemarker hash must be broken up into four zones so lock
630 * ordering semantics continue to work (e.g. pte, pt, pd, then pdp).
632 * Placemarkers are used to 'lock' page table indices that do not have
633 * a pv_entry. This allows the pmap to support managed and unmanaged
634 * pages and shared page tables.
636 #define PM_PLACE_BASE (PM_PLACEMARKS >> 2)
640 pmap_placemarker_hash(pmap_t pmap
, vm_pindex_t pindex
)
644 if (pindex
< pmap_pt_pindex(0)) /* zone 0 - PTE */
646 else if (pindex
< pmap_pd_pindex(0)) /* zone 1 - PT */
648 else if (pindex
< pmap_pdp_pindex(0)) /* zone 2 - PD */
649 hi
= PM_PLACE_BASE
<< 1;
650 else /* zone 3 - PDP (and PML4E) */
651 hi
= PM_PLACE_BASE
| (PM_PLACE_BASE
<< 1);
652 hi
+= pindex
& (PM_PLACE_BASE
- 1);
654 return (&pmap
->pm_placemarks
[hi
]);
659 * Generic procedure to index a pte from a pt, pd, or pdp.
661 * NOTE: Normally passed pindex as pmap_xx_index(). pmap_xx_pindex() is NOT
662 * a page table page index but is instead of PV lookup index.
666 pv_pte_lookup(pv_entry_t pv
, vm_pindex_t pindex
)
670 pte
= (pt_entry_t
*)PHYS_TO_DMAP(VM_PAGE_TO_PHYS(pv
->pv_m
));
671 return(&pte
[pindex
]);
675 * Return pointer to PDP slot in the PML4
679 pmap_pdp(pmap_t pmap
, vm_offset_t va
)
681 return (&pmap
->pm_pml4
[pmap_pdp_index(va
)]);
685 * Return pointer to PD slot in the PDP given a pointer to the PDP
689 pmap_pdp_to_pd(pml4_entry_t pdp_pte
, vm_offset_t va
)
693 pd
= (pdp_entry_t
*)PHYS_TO_DMAP(pdp_pte
& PG_FRAME
);
694 return (&pd
[pmap_pd_index(va
)]);
698 * Return pointer to PD slot in the PDP.
702 pmap_pd(pmap_t pmap
, vm_offset_t va
)
706 pdp
= pmap_pdp(pmap
, va
);
707 if ((*pdp
& pmap
->pmap_bits
[PG_V_IDX
]) == 0)
709 return (pmap_pdp_to_pd(*pdp
, va
));
713 * Return pointer to PT slot in the PD given a pointer to the PD
717 pmap_pd_to_pt(pdp_entry_t pd_pte
, vm_offset_t va
)
721 pt
= (pd_entry_t
*)PHYS_TO_DMAP(pd_pte
& PG_FRAME
);
722 return (&pt
[pmap_pt_index(va
)]);
726 * Return pointer to PT slot in the PD
728 * SIMPLE PMAP NOTE: Simple pmaps (embedded in objects) do not have PDPs,
729 * so we cannot lookup the PD via the PDP. Instead we
730 * must look it up via the pmap.
734 pmap_pt(pmap_t pmap
, vm_offset_t va
)
738 vm_pindex_t pd_pindex
;
741 if (pmap
->pm_flags
& PMAP_FLAG_SIMPLE
) {
742 pd_pindex
= pmap_pd_pindex(va
);
743 spin_lock_shared(&pmap
->pm_spin
);
744 pv
= pv_entry_rb_tree_RB_LOOKUP(&pmap
->pm_pvroot
, pd_pindex
);
745 if (pv
== NULL
|| pv
->pv_m
== NULL
) {
746 spin_unlock_shared(&pmap
->pm_spin
);
749 phys
= VM_PAGE_TO_PHYS(pv
->pv_m
);
750 spin_unlock_shared(&pmap
->pm_spin
);
751 return (pmap_pd_to_pt(phys
, va
));
753 pd
= pmap_pd(pmap
, va
);
754 if (pd
== NULL
|| (*pd
& pmap
->pmap_bits
[PG_V_IDX
]) == 0)
756 return (pmap_pd_to_pt(*pd
, va
));
761 * Return pointer to PTE slot in the PT given a pointer to the PT
765 pmap_pt_to_pte(pd_entry_t pt_pte
, vm_offset_t va
)
769 pte
= (pt_entry_t
*)PHYS_TO_DMAP(pt_pte
& PG_FRAME
);
770 return (&pte
[pmap_pte_index(va
)]);
774 * Return pointer to PTE slot in the PT
778 pmap_pte(pmap_t pmap
, vm_offset_t va
)
782 pt
= pmap_pt(pmap
, va
);
783 if (pt
== NULL
|| (*pt
& pmap
->pmap_bits
[PG_V_IDX
]) == 0)
785 if ((*pt
& pmap
->pmap_bits
[PG_PS_IDX
]) != 0)
786 return ((pt_entry_t
*)pt
);
787 return (pmap_pt_to_pte(*pt
, va
));
791 * Return address of PT slot in PD (KVM only)
793 * Cannot be used for user page tables because it might interfere with
794 * the shared page-table-page optimization (pmap_mmu_optimize).
798 vtopt(vm_offset_t va
)
800 uint64_t mask
= ((1ul << (NPDEPGSHIFT
+ NPDPEPGSHIFT
+
801 NPML4EPGSHIFT
)) - 1);
803 return (PDmap
+ ((va
>> PDRSHIFT
) & mask
));
807 * KVM - return address of PTE slot in PT
811 vtopte(vm_offset_t va
)
813 uint64_t mask
= ((1ul << (NPTEPGSHIFT
+ NPDEPGSHIFT
+
814 NPDPEPGSHIFT
+ NPML4EPGSHIFT
)) - 1);
816 return (PTmap
+ ((va
>> PAGE_SHIFT
) & mask
));
820 * Returns the physical address translation from va for a user address.
821 * (vm_paddr_t)-1 is returned on failure.
824 uservtophys(vm_offset_t va
)
826 uint64_t mask
= ((1ul << (NPTEPGSHIFT
+ NPDEPGSHIFT
+
827 NPDPEPGSHIFT
+ NPML4EPGSHIFT
)) - 1);
832 pmap
= vmspace_pmap(mycpu
->gd_curthread
->td_lwp
->lwp_vmspace
);
834 if (va
< VM_MAX_USER_ADDRESS
) {
835 pte
= kreadmem64(PTmap
+ ((va
>> PAGE_SHIFT
) & mask
));
836 if (pte
& pmap
->pmap_bits
[PG_V_IDX
])
837 pa
= (pte
& PG_FRAME
) | (va
& PAGE_MASK
);
843 allocpages(vm_paddr_t
*firstaddr
, long n
)
848 bzero((void *)ret
, n
* PAGE_SIZE
);
849 *firstaddr
+= n
* PAGE_SIZE
;
855 create_pagetables(vm_paddr_t
*firstaddr
)
857 long i
; /* must be 64 bits */
864 * We are running (mostly) V=P at this point
866 * Calculate how many 1GB PD entries in our PDP pages are needed
867 * for the DMAP. This is only allocated if the system does not
868 * support 1GB pages. Otherwise ndmpdp is simply a count of
869 * the number of 1G terminal entries in our PDP pages are needed.
871 * NOTE: Maxmem is in pages
873 ndmpdp
= (ptoa(Maxmem
) + NBPDP
- 1) >> PDPSHIFT
;
874 if (ndmpdp
< 4) /* Minimum 4GB of DMAP */
879 * HACK XXX fix me - Some laptops map the EFI framebuffer in
880 * very high physical addresses and the DMAP winds up being too
881 * small. The EFI framebuffer has to be mapped for the console
882 * very early and the DMAP is how it does it.
884 if (ndmpdp
< 512) /* Minimum 512GB of DMAP */
888 KKASSERT(ndmpdp
<= NDMPML4E
* NPML4EPG
);
889 DMapMaxAddress
= DMAP_MIN_ADDRESS
+
890 ((ndmpdp
* NPDEPG
) << PDRSHIFT
);
893 * Starting at KERNBASE - map all 2G worth of page table pages.
894 * KERNBASE is offset -2G from the end of kvm. This will accomodate
895 * all KVM allocations above KERNBASE, including the SYSMAPs below.
897 * We do this by allocating 2*512 PT pages. Each PT page can map
898 * 2MB, for 2GB total.
900 nkpt_base
= (NPDPEPG
- KPDPI
) * NPTEPG
; /* typically 2 x 512 */
903 * Starting at the beginning of kvm (VM_MIN_KERNEL_ADDRESS),
904 * Calculate how many page table pages we need to preallocate
905 * for early vm_map allocations.
907 * A few extra won't hurt, they will get used up in the running
913 nkpt_phys
= howmany(Maxmem
* sizeof(struct vm_page
), NBPDR
);
914 nkpt_phys
+= howmany(Maxmem
* sizeof(struct pv_entry
), NBPDR
);
915 nkpt_phys
+= 128; /* a few extra */
918 * The highest value nkpd_phys can be set to is
919 * NKPDPE - (NPDPEPG - KPDPI) (i.e. NKPDPE - 2).
921 * Doing so would cause all PD pages to be pre-populated for
922 * a maximal KVM space (approximately 16*512 pages, or 32MB.
923 * We can save memory by not doing this.
925 nkpd_phys
= (nkpt_phys
+ NPDPEPG
- 1) / NPDPEPG
;
930 * Normally NKPML4E=1-16 (1-16 kernel PDP page)
931 * Normally NKPDPE= NKPML4E*512-1 (511 min kernel PD pages)
933 * Only allocate enough PD pages
934 * NOTE: We allocate all kernel PD pages up-front, typically
935 * ~511G of KVM, requiring 511 PD pages.
937 KPTbase
= allocpages(firstaddr
, nkpt_base
); /* KERNBASE to end */
938 KPTphys
= allocpages(firstaddr
, nkpt_phys
); /* KVA start */
939 KPML4phys
= allocpages(firstaddr
, 1); /* recursive PML4 map */
940 KPDPphys
= allocpages(firstaddr
, NKPML4E
); /* kernel PDP pages */
941 KPDphys
= allocpages(firstaddr
, nkpd_phys
); /* kernel PD pages */
944 * Alloc PD pages for the area starting at KERNBASE.
946 KPDbase
= allocpages(firstaddr
, NPDPEPG
- KPDPI
);
949 * Stuff for our DMAP. Use 2MB pages even when 1GB pages
950 * are available in order to allow APU code to adjust page
951 * attributes on a fixed grain (see pmap_change_attr()).
953 DMPDPphys
= allocpages(firstaddr
, NDMPML4E
);
955 DMPDphys
= allocpages(firstaddr
, ndmpdp
);
957 if ((amd_feature
& AMDID_PAGE1GB
) == 0)
958 DMPDphys
= allocpages(firstaddr
, ndmpdp
);
960 dmaplimit
= (vm_paddr_t
)ndmpdp
<< PDPSHIFT
;
963 * Fill in the underlying page table pages for the area around
964 * KERNBASE. This remaps low physical memory to KERNBASE.
966 * Read-only from zero to physfree
967 * XXX not fully used, underneath 2M pages
969 for (i
= 0; (i
<< PAGE_SHIFT
) < *firstaddr
; i
++) {
970 ((pt_entry_t
*)KPTbase
)[i
] = i
<< PAGE_SHIFT
;
971 ((pt_entry_t
*)KPTbase
)[i
] |=
972 pmap_bits_default
[PG_RW_IDX
] |
973 pmap_bits_default
[PG_V_IDX
] |
974 pmap_bits_default
[PG_G_IDX
];
978 * Now map the initial kernel page tables. One block of page
979 * tables is placed at the beginning of kernel virtual memory,
980 * and another block is placed at KERNBASE to map the kernel binary,
981 * data, bss, and initial pre-allocations.
983 for (i
= 0; i
< nkpt_base
; i
++) {
984 ((pd_entry_t
*)KPDbase
)[i
] = KPTbase
+ (i
<< PAGE_SHIFT
);
985 ((pd_entry_t
*)KPDbase
)[i
] |=
986 pmap_bits_default
[PG_RW_IDX
] |
987 pmap_bits_default
[PG_V_IDX
];
989 for (i
= 0; i
< nkpt_phys
; i
++) {
990 ((pd_entry_t
*)KPDphys
)[i
] = KPTphys
+ (i
<< PAGE_SHIFT
);
991 ((pd_entry_t
*)KPDphys
)[i
] |=
992 pmap_bits_default
[PG_RW_IDX
] |
993 pmap_bits_default
[PG_V_IDX
];
997 * Map from zero to end of allocations using 2M pages as an
998 * optimization. This will bypass some of the KPTBase pages
999 * above in the KERNBASE area.
1001 for (i
= 0; (i
<< PDRSHIFT
) < *firstaddr
; i
++) {
1002 ((pd_entry_t
*)KPDbase
)[i
] = i
<< PDRSHIFT
;
1003 ((pd_entry_t
*)KPDbase
)[i
] |=
1004 pmap_bits_default
[PG_RW_IDX
] |
1005 pmap_bits_default
[PG_V_IDX
] |
1006 pmap_bits_default
[PG_PS_IDX
] |
1007 pmap_bits_default
[PG_G_IDX
];
1011 * Load PD addresses into the PDP pages for primary KVA space to
1012 * cover existing page tables. PD's for KERNBASE are handled in
1015 * expected to pre-populate all of its PDs. See NKPDPE in vmparam.h.
1017 for (i
= 0; i
< nkpd_phys
; i
++) {
1018 ((pdp_entry_t
*)KPDPphys
)[NKPML4E
* NPDPEPG
- NKPDPE
+ i
] =
1019 KPDphys
+ (i
<< PAGE_SHIFT
);
1020 ((pdp_entry_t
*)KPDPphys
)[NKPML4E
* NPDPEPG
- NKPDPE
+ i
] |=
1021 pmap_bits_default
[PG_RW_IDX
] |
1022 pmap_bits_default
[PG_V_IDX
] |
1023 pmap_bits_default
[PG_A_IDX
];
1027 * Load PDs for KERNBASE to the end
1029 i
= (NKPML4E
- 1) * NPDPEPG
+ KPDPI
;
1030 for (j
= 0; j
< NPDPEPG
- KPDPI
; ++j
) {
1031 ((pdp_entry_t
*)KPDPphys
)[i
+ j
] =
1032 KPDbase
+ (j
<< PAGE_SHIFT
);
1033 ((pdp_entry_t
*)KPDPphys
)[i
+ j
] |=
1034 pmap_bits_default
[PG_RW_IDX
] |
1035 pmap_bits_default
[PG_V_IDX
] |
1036 pmap_bits_default
[PG_A_IDX
];
1040 * Now set up the direct map space using either 2MB or 1GB pages
1041 * Preset PG_M and PG_A because demotion expects it.
1043 * When filling in entries in the PD pages make sure any excess
1044 * entries are set to zero as we allocated enough PD pages
1046 * Stuff for our DMAP. Use 2MB pages even when 1GB pages
1047 * are available in order to allow APU code to adjust page
1048 * attributes on a fixed grain (see pmap_change_attr()).
1051 if ((amd_feature
& AMDID_PAGE1GB
) == 0)
1057 for (i
= 0; i
< NPDEPG
* ndmpdp
; i
++) {
1058 ((pd_entry_t
*)DMPDphys
)[i
] = i
<< PDRSHIFT
;
1059 ((pd_entry_t
*)DMPDphys
)[i
] |=
1060 pmap_bits_default
[PG_RW_IDX
] |
1061 pmap_bits_default
[PG_V_IDX
] |
1062 pmap_bits_default
[PG_PS_IDX
] |
1063 pmap_bits_default
[PG_G_IDX
] |
1064 pmap_bits_default
[PG_M_IDX
] |
1065 pmap_bits_default
[PG_A_IDX
];
1069 * And the direct map space's PDP
1071 for (i
= 0; i
< ndmpdp
; i
++) {
1072 ((pdp_entry_t
*)DMPDPphys
)[i
] = DMPDphys
+
1074 ((pdp_entry_t
*)DMPDPphys
)[i
] |=
1075 pmap_bits_default
[PG_RW_IDX
] |
1076 pmap_bits_default
[PG_V_IDX
] |
1077 pmap_bits_default
[PG_A_IDX
];
1085 for (i
= 0; i
< ndmpdp
; i
++) {
1086 ((pdp_entry_t
*)DMPDPphys
)[i
] =
1087 (vm_paddr_t
)i
<< PDPSHIFT
;
1088 ((pdp_entry_t
*)DMPDPphys
)[i
] |=
1089 pmap_bits_default
[PG_RW_IDX
] |
1090 pmap_bits_default
[PG_V_IDX
] |
1091 pmap_bits_default
[PG_PS_IDX
] |
1092 pmap_bits_default
[PG_G_IDX
] |
1093 pmap_bits_default
[PG_M_IDX
] |
1094 pmap_bits_default
[PG_A_IDX
];
1099 /* And recursively map PML4 to itself in order to get PTmap */
1100 ((pdp_entry_t
*)KPML4phys
)[PML4PML4I
] = KPML4phys
;
1101 ((pdp_entry_t
*)KPML4phys
)[PML4PML4I
] |=
1102 pmap_bits_default
[PG_RW_IDX
] |
1103 pmap_bits_default
[PG_V_IDX
] |
1104 pmap_bits_default
[PG_A_IDX
];
1107 * Connect the Direct Map slots up to the PML4
1109 for (j
= 0; j
< NDMPML4E
; ++j
) {
1110 ((pdp_entry_t
*)KPML4phys
)[DMPML4I
+ j
] =
1111 (DMPDPphys
+ ((vm_paddr_t
)j
<< PAGE_SHIFT
)) |
1112 pmap_bits_default
[PG_RW_IDX
] |
1113 pmap_bits_default
[PG_V_IDX
] |
1114 pmap_bits_default
[PG_A_IDX
];
1118 * Connect the KVA slot up to the PML4
1120 for (j
= 0; j
< NKPML4E
; ++j
) {
1121 ((pdp_entry_t
*)KPML4phys
)[KPML4I
+ j
] =
1122 KPDPphys
+ ((vm_paddr_t
)j
<< PAGE_SHIFT
);
1123 ((pdp_entry_t
*)KPML4phys
)[KPML4I
+ j
] |=
1124 pmap_bits_default
[PG_RW_IDX
] |
1125 pmap_bits_default
[PG_V_IDX
] |
1126 pmap_bits_default
[PG_A_IDX
];
1133 * Bootstrap the system enough to run with virtual memory.
1135 * On x86_64 this is called after mapping has already been enabled
1136 * and just syncs the pmap module with what has already been done.
1137 * [We can't call it easily with mapping off since the kernel is not
1138 * mapped with PA == VA, hence we would have to relocate every address
1139 * from the linked base (virtual) address "KERNBASE" to the actual
1140 * (physical) address starting relative to 0]
1143 pmap_bootstrap(vm_paddr_t
*firstaddr
)
1149 KvaStart
= VM_MIN_KERNEL_ADDRESS
;
1150 KvaEnd
= VM_MAX_KERNEL_ADDRESS
;
1151 KvaSize
= KvaEnd
- KvaStart
;
1153 avail_start
= *firstaddr
;
1156 * Create an initial set of page tables to run the kernel in.
1158 create_pagetables(firstaddr
);
1160 virtual2_start
= KvaStart
;
1161 virtual2_end
= PTOV_OFFSET
;
1163 virtual_start
= (vm_offset_t
) PTOV_OFFSET
+ *firstaddr
;
1164 virtual_start
= pmap_kmem_choose(virtual_start
);
1166 virtual_end
= VM_MAX_KERNEL_ADDRESS
;
1168 /* XXX do %cr0 as well */
1169 load_cr4(rcr4() | CR4_PGE
| CR4_PSE
);
1170 load_cr3(KPML4phys
);
1173 * Initialize protection array.
1175 x86_64_protection_init();
1178 * The kernel's pmap is statically allocated so we don't have to use
1179 * pmap_create, which is unlikely to work correctly at this part of
1180 * the boot sequence (XXX and which no longer exists).
1182 kernel_pmap
->pm_pml4
= (pdp_entry_t
*) (PTOV_OFFSET
+ KPML4phys
);
1183 kernel_pmap
->pm_count
= 1;
1184 CPUMASK_ASSALLONES(kernel_pmap
->pm_active
);
1185 RB_INIT(&kernel_pmap
->pm_pvroot
);
1186 spin_init(&kernel_pmap
->pm_spin
, "pmapbootstrap");
1187 for (i
= 0; i
< PM_PLACEMARKS
; ++i
)
1188 kernel_pmap
->pm_placemarks
[i
] = PM_NOPLACEMARK
;
1191 * Reserve some special page table entries/VA space for temporary
1194 #define SYSMAP(c, p, v, n) \
1195 v = (c)va; va += ((n)*PAGE_SIZE); p = pte; pte += (n);
1201 * CMAP1/CMAP2 are used for zeroing and copying pages.
1203 SYSMAP(caddr_t
, CMAP1
, CADDR1
, 1)
1208 SYSMAP(caddr_t
, pt_crashdumpmap
, crashdumpmap
, MAXDUMPPGS
);
1211 * ptvmmap is used for reading arbitrary physical pages via
1214 SYSMAP(caddr_t
, ptmmap
, ptvmmap
, 1)
1217 * msgbufp is used to map the system message buffer.
1218 * XXX msgbufmap is not used.
1220 SYSMAP(struct msgbuf
*, msgbufmap
, msgbufp
,
1221 atop(round_page(MSGBUF_SIZE
)))
1224 virtual_start
= pmap_kmem_choose(virtual_start
);
1229 * PG_G is terribly broken on SMP because we IPI invltlb's in some
1230 * cases rather then invl1pg. Actually, I don't even know why it
1231 * works under UP because self-referential page table mappings
1237 /* Initialize the PAT MSR */
1239 pmap_pinit_defaults(kernel_pmap
);
1241 TUNABLE_INT_FETCH("machdep.pmap_fast_kernel_cpusync",
1242 &pmap_fast_kernel_cpusync
);
1247 * Setup the PAT MSR.
1257 * Default values mapping PATi,PCD,PWT bits at system reset.
1258 * The default values effectively ignore the PATi bit by
1259 * repeating the encodings for 0-3 in 4-7, and map the PCD
1260 * and PWT bit combinations to the expected PAT types.
1262 pat_msr
= PAT_VALUE(0, PAT_WRITE_BACK
) | /* 000 */
1263 PAT_VALUE(1, PAT_WRITE_THROUGH
) | /* 001 */
1264 PAT_VALUE(2, PAT_UNCACHED
) | /* 010 */
1265 PAT_VALUE(3, PAT_UNCACHEABLE
) | /* 011 */
1266 PAT_VALUE(4, PAT_WRITE_BACK
) | /* 100 */
1267 PAT_VALUE(5, PAT_WRITE_THROUGH
) | /* 101 */
1268 PAT_VALUE(6, PAT_UNCACHED
) | /* 110 */
1269 PAT_VALUE(7, PAT_UNCACHEABLE
); /* 111 */
1270 pat_pte_index
[PAT_WRITE_BACK
] = 0;
1271 pat_pte_index
[PAT_WRITE_THROUGH
]= 0 | X86_PG_NC_PWT
;
1272 pat_pte_index
[PAT_UNCACHED
] = X86_PG_NC_PCD
;
1273 pat_pte_index
[PAT_UNCACHEABLE
] = X86_PG_NC_PCD
| X86_PG_NC_PWT
;
1274 pat_pte_index
[PAT_WRITE_PROTECTED
] = pat_pte_index
[PAT_UNCACHEABLE
];
1275 pat_pte_index
[PAT_WRITE_COMBINING
] = pat_pte_index
[PAT_UNCACHEABLE
];
1277 if (cpu_feature
& CPUID_PAT
) {
1279 * If we support the PAT then set-up entries for
1280 * WRITE_PROTECTED and WRITE_COMBINING using bit patterns
1283 pat_msr
= (pat_msr
& ~PAT_MASK(5)) |
1284 PAT_VALUE(5, PAT_WRITE_PROTECTED
);
1285 pat_msr
= (pat_msr
& ~PAT_MASK(6)) |
1286 PAT_VALUE(6, PAT_WRITE_COMBINING
);
1287 pat_pte_index
[PAT_WRITE_PROTECTED
] = X86_PG_PTE_PAT
| X86_PG_NC_PWT
;
1288 pat_pte_index
[PAT_WRITE_COMBINING
] = X86_PG_PTE_PAT
| X86_PG_NC_PCD
;
1291 * Then enable the PAT
1296 load_cr4(cr4
& ~CR4_PGE
);
1298 /* Disable caches (CD = 1, NW = 0). */
1300 load_cr0((cr0
& ~CR0_NW
) | CR0_CD
);
1302 /* Flushes caches and TLBs. */
1306 /* Update PAT and index table. */
1307 wrmsr(MSR_PAT
, pat_msr
);
1309 /* Flush caches and TLBs again. */
1313 /* Restore caches and PGE. */
1319 for (i
= 0; i
< 8; ++i
) {
1322 pte
= pat_pte_index
[i
];
1323 if (pte
& X86_PG_PTE_PAT
) {
1324 pte
&= ~X86_PG_PTE_PAT
;
1325 pte
|= X86_PG_PDE_PAT
;
1327 pat_pde_index
[i
] = pte
;
1332 * Set 4mb pdir for mp startup
1337 if (cpu_feature
& CPUID_PSE
) {
1338 load_cr4(rcr4() | CR4_PSE
);
1339 if (mycpu
->gd_cpuid
== 0) /* only on BSP */
1344 * Check for SMAP support and enable if available. Must be done
1345 * after cr3 is loaded, and on all cores.
1347 if (cpu_stdext_feature
& CPUID_STDEXT_SMAP
) {
1348 load_cr4(rcr4() | CR4_SMAP
);
1350 if (cpu_stdext_feature
& CPUID_STDEXT_SMEP
) {
1351 load_cr4(rcr4() | CR4_SMEP
);
1356 * SMAP is just a processor flag, but SMEP can only be enabled
1357 * and disabled via CR4. We still use the processor flag to
1358 * disable SMAP because the page-fault/trap code checks it, in
1359 * order to allow a page-fault to actually occur.
1362 smap_smep_disable(void)
1365 * disable SMAP. This also bypasses a software failsafe check
1366 * in the trap() code.
1371 * Also needed to bypass a software failsafe check in the trap()
1372 * code and allow the userspace address fault from kernel mode
1375 * Note that This will not reload %rip because pcb_onfault_rsp will
1376 * not match. Just setting it to non-NULL is sufficient to bypass
1379 curthread
->td_pcb
->pcb_onfault
= (void *)1;
1382 * Disable SMEP (requires modifying cr4)
1384 if (cpu_stdext_feature
& CPUID_STDEXT_SMEP
)
1385 load_cr4(rcr4() & ~CR4_SMEP
);
1389 smap_smep_enable(void)
1391 if (cpu_stdext_feature
& CPUID_STDEXT_SMEP
)
1392 load_cr4(rcr4() | CR4_SMEP
);
1393 curthread
->td_pcb
->pcb_onfault
= NULL
;
1398 * Early initialization of the pmap module.
1400 * Called by vm_init, to initialize any structures that the pmap
1401 * system needs to map virtual memory. pmap_init has been enhanced to
1402 * support in a fairly consistant way, discontiguous physical memory.
1407 vm_pindex_t initial_pvs
;
1411 * Allocate memory for random pmap data structures. Includes the
1414 for (i
= 0; i
< vm_page_array_size
; i
++) {
1417 m
= &vm_page_array
[i
];
1418 m
->md
.interlock_count
= 0;
1422 * init the pv free list
1424 initial_pvs
= vm_page_array_size
;
1425 if (initial_pvs
< MINPV
)
1426 initial_pvs
= MINPV
;
1427 pvzone
= &pvzone_store
;
1428 pvinit
= (void *)kmem_alloc(kernel_map
,
1429 initial_pvs
* sizeof (struct pv_entry
),
1431 zbootinit(pvzone
, "PV ENTRY", sizeof (struct pv_entry
),
1432 pvinit
, initial_pvs
);
1435 * Now it is safe to enable pv_table recording.
1437 pmap_initialized
= TRUE
;
1441 * Initialize the address space (zone) for the pv_entries. Set a
1442 * high water mark so that the system can recover from excessive
1443 * numbers of pv entries.
1445 * Also create the kernel page table template for isolated user
1448 static void pmap_init_iso_range(vm_offset_t base
, size_t bytes
);
1449 static void pmap_init2_iso_pmap(void);
1451 static void dump_pmap(pmap_t pmap
, pt_entry_t pte
, int level
, vm_offset_t base
);
1457 vm_pindex_t entry_max
;
1460 * We can significantly reduce pv_entry_max from historical
1461 * levels because pv_entry's are no longer use for PTEs at the
1462 * leafs. This prevents excessive pcpu caching on many-core
1463 * boxes (even with the further '/ 16' done in zinitna().
1465 * Remember, however, that processes can share physical pages
1466 * with each process still needing the pdp/pd/pt infrstructure
1467 * (which still use pv_entry's). And don't just assume that
1468 * every PT will be completely filled up. So don't make it
1471 entry_max
= maxproc
* 32 + vm_page_array_size
/ 16;
1472 TUNABLE_LONG_FETCH("vm.pmap.pv_entries", &entry_max
);
1473 vm_pmap_pv_entries
= entry_max
;
1476 * Subtract out pages already installed in the zone (hack)
1478 if (entry_max
<= MINPV
)
1481 zinitna(pvzone
, NULL
, 0, entry_max
, ZONE_INTERRUPT
);
1484 * Enable dynamic deletion of empty higher-level page table pages
1485 * by default only if system memory is < 8GB (use 7GB for slop).
1486 * This can save a little memory, but imposes significant
1487 * performance overhead for things like bulk builds, and for programs
1488 * which do a lot of memory mapping and memory unmapping.
1491 if (pmap_dynamic_delete
< 0) {
1492 if (vmstats
.v_page_count
< 7LL * 1024 * 1024 * 1024 / PAGE_SIZE
)
1493 pmap_dynamic_delete
= 1;
1495 pmap_dynamic_delete
= 0;
1499 * Disable so vm_map_backing iterations do not race
1501 pmap_dynamic_delete
= 0;
1504 * Automatic detection of Intel meltdown bug requiring user/kernel
1507 * Currently there are so many Intel cpu's impacted that its better
1508 * to whitelist future Intel CPUs. Most? AMD cpus are not impacted
1509 * so the default is off for AMD.
1511 if (meltdown_mitigation
< 0) {
1512 if (cpu_vendor_id
== CPU_VENDOR_INTEL
) {
1513 meltdown_mitigation
= 1;
1514 if (cpu_ia32_arch_caps
& IA32_ARCH_CAP_RDCL_NO
)
1515 meltdown_mitigation
= 0;
1517 meltdown_mitigation
= 0;
1520 if (meltdown_mitigation
) {
1521 kprintf("machdep.meltdown_mitigation enabled to "
1522 "protect against (mostly Intel) meltdown bug\n");
1523 kprintf("system call performance will be impacted\n");
1526 pmap_init2_iso_pmap();
1530 * Create the isolation pmap template. Once created, the template
1531 * is static and its PML4e entries are used to populate the
1532 * kernel portion of any isolated user pmaps.
1534 * Our isolation pmap must contain:
1535 * (1) trampoline area for all cpus
1536 * (2) common_tss area for all cpus (its part of the trampoline area now)
1537 * (3) IDT for all cpus
1538 * (4) GDT for all cpus
1541 pmap_init2_iso_pmap(void)
1546 kprintf("Initialize isolation pmap\n");
1549 * Try to use our normal API calls to make this easier. We have
1550 * to scrap the shadowed kernel PDPs pmap_pinit() creates for our
1553 pmap_pinit(&iso_pmap
);
1554 bzero(iso_pmap
.pm_pml4
, PAGE_SIZE
);
1557 * Install areas needed by the cpu and trampoline.
1559 for (n
= 0; n
< ncpus
; ++n
) {
1560 struct privatespace
*ps
;
1562 ps
= CPU_prvspace
[n
];
1563 pmap_init_iso_range((vm_offset_t
)&ps
->trampoline
,
1564 sizeof(ps
->trampoline
));
1565 pmap_init_iso_range((vm_offset_t
)&ps
->dblstack
,
1566 sizeof(ps
->dblstack
));
1567 pmap_init_iso_range((vm_offset_t
)&ps
->dbgstack
,
1568 sizeof(ps
->dbgstack
));
1569 pmap_init_iso_range((vm_offset_t
)&ps
->common_tss
,
1570 sizeof(ps
->common_tss
));
1571 pmap_init_iso_range(r_idt_arr
[n
].rd_base
,
1572 r_idt_arr
[n
].rd_limit
+ 1);
1573 pmap_init_iso_range((register_t
)ps
->mdglobaldata
.gd_gdt
,
1576 pmap_init_iso_range((vm_offset_t
)(int *)btext
,
1577 (vm_offset_t
)(int *)etext
-
1578 (vm_offset_t
)(int *)btext
);
1581 kprintf("Dump iso_pmap:\n");
1582 dump_pmap(&iso_pmap
, vtophys(iso_pmap
.pm_pml4
), 0, 0);
1583 kprintf("\nDump kernel_pmap:\n");
1584 dump_pmap(kernel_pmap
, vtophys(kernel_pmap
->pm_pml4
), 0, 0);
1589 * This adds a kernel virtual address range to the isolation pmap.
1592 pmap_init_iso_range(vm_offset_t base
, size_t bytes
)
1601 kprintf("isolate %016jx-%016jx (%zd)\n",
1602 base
, base
+ bytes
, bytes
);
1604 va
= base
& ~(vm_offset_t
)PAGE_MASK
;
1605 while (va
< base
+ bytes
) {
1606 if ((va
& PDRMASK
) == 0 && va
+ NBPDR
<= base
+ bytes
&&
1607 (ptep
= pmap_pt(kernel_pmap
, va
)) != NULL
&&
1608 (*ptep
& kernel_pmap
->pmap_bits
[PG_V_IDX
]) &&
1609 (*ptep
& kernel_pmap
->pmap_bits
[PG_PS_IDX
])) {
1611 * Use 2MB pages if possible
1614 pv
= pmap_allocpte(&iso_pmap
, pmap_pd_pindex(va
), &pvp
);
1615 ptep
= pv_pte_lookup(pv
, (va
>> PDRSHIFT
) & 511);
1620 * Otherwise use 4KB pages
1622 pv
= pmap_allocpte(&iso_pmap
, pmap_pt_pindex(va
), &pvp
);
1623 ptep
= pv_pte_lookup(pv
, (va
>> PAGE_SHIFT
) & 511);
1624 *ptep
= vtophys(va
) | kernel_pmap
->pmap_bits
[PG_RW_IDX
] |
1625 kernel_pmap
->pmap_bits
[PG_V_IDX
] |
1626 kernel_pmap
->pmap_bits
[PG_A_IDX
] |
1627 kernel_pmap
->pmap_bits
[PG_M_IDX
];
1638 * Useful debugging pmap dumper, do not remove (#if 0 when not in use)
1642 dump_pmap(pmap_t pmap
, pt_entry_t pte
, int level
, vm_offset_t base
)
1649 case 0: /* PML4e page, 512G entries */
1650 incr
= (1LL << 48) / 512;
1652 case 1: /* PDP page, 1G entries */
1653 incr
= (1LL << 39) / 512;
1655 case 2: /* PD page, 2MB entries */
1656 incr
= (1LL << 30) / 512;
1658 case 3: /* PT page, 4KB entries */
1659 incr
= (1LL << 21) / 512;
1667 kprintf("cr3 %016jx @ va=%016jx\n", pte
, base
);
1668 ptp
= (void *)PHYS_TO_DMAP(pte
& ~(pt_entry_t
)PAGE_MASK
);
1669 for (i
= 0; i
< 512; ++i
) {
1670 if (level
== 0 && i
== 128)
1671 base
+= 0xFFFF000000000000LLU
;
1673 kprintf("%*.*s ", level
* 4, level
* 4, "");
1674 if (level
== 1 && (ptp
[i
] & 0x180) == 0x180) {
1675 kprintf("va=%016jx %3d term %016jx (1GB)\n",
1677 } else if (level
== 2 && (ptp
[i
] & 0x180) == 0x180) {
1678 kprintf("va=%016jx %3d term %016jx (2MB)\n",
1680 } else if (level
== 3) {
1681 kprintf("va=%016jx %3d term %016jx\n",
1684 kprintf("va=%016jx %3d deep %016jx\n",
1686 dump_pmap(pmap
, ptp
[i
], level
+ 1, base
);
1696 * Typically used to initialize a fictitious page by vm/device_pager.c
1699 pmap_page_init(struct vm_page
*m
)
1702 m
->md
.interlock_count
= 0;
1705 /***************************************************
1706 * Low level helper routines.....
1707 ***************************************************/
1710 * Extract the physical page address associated with the map/VA pair.
1711 * The page must be wired for this to work reliably.
1714 pmap_extract(pmap_t pmap
, vm_offset_t va
, void **handlep
)
1721 if (va
>= VM_MAX_USER_ADDRESS
) {
1723 * Kernel page directories might be direct-mapped and
1724 * there is typically no PV tracking of pte's
1728 pt
= pmap_pt(pmap
, va
);
1729 if (pt
&& (*pt
& pmap
->pmap_bits
[PG_V_IDX
])) {
1730 if (*pt
& pmap
->pmap_bits
[PG_PS_IDX
]) {
1731 rtval
= *pt
& PG_PS_FRAME
;
1732 rtval
|= va
& PDRMASK
;
1734 ptep
= pmap_pt_to_pte(*pt
, va
);
1735 if (*pt
& pmap
->pmap_bits
[PG_V_IDX
]) {
1736 rtval
= *ptep
& PG_FRAME
;
1737 rtval
|= va
& PAGE_MASK
;
1745 * User pages currently do not direct-map the page directory
1746 * and some pages might not used managed PVs. But all PT's
1749 pt_pv
= pv_get(pmap
, pmap_pt_pindex(va
), NULL
);
1751 ptep
= pv_pte_lookup(pt_pv
, pmap_pte_index(va
));
1752 if (*ptep
& pmap
->pmap_bits
[PG_V_IDX
]) {
1753 rtval
= *ptep
& PG_FRAME
;
1754 rtval
|= va
& PAGE_MASK
;
1757 *handlep
= pt_pv
; /* locked until done */
1760 } else if (handlep
) {
1768 pmap_extract_done(void *handle
)
1771 pv_put((pv_entry_t
)handle
);
1775 * Similar to extract but checks protections, SMP-friendly short-cut for
1776 * vm_fault_page[_quick](). Can return NULL to cause the caller to
1777 * fall-through to the real fault code. Does not work with HVM page
1780 * if busyp is NULL the returned page, if not NULL, is held (and not busied).
1782 * If busyp is not NULL and this function sets *busyp non-zero, the returned
1783 * page is busied (and not held).
1785 * If busyp is not NULL and this function sets *busyp to zero, the returned
1786 * page is held (and not busied).
1788 * If VM_PROT_WRITE is set in prot, and the pte is already writable, the
1789 * returned page will be dirtied. If the pte is not already writable NULL
1790 * is returned. In otherwords, if the bit is set and a vm_page_t is returned,
1791 * any COW will already have happened and that page can be written by the
1794 * WARNING! THE RETURNED PAGE IS ONLY HELD AND NOT SUITABLE FOR READING
1798 pmap_fault_page_quick(pmap_t pmap
, vm_offset_t va
, vm_prot_t prot
, int *busyp
)
1801 va
< VM_MAX_USER_ADDRESS
&&
1802 (pmap
->pm_flags
& PMAP_HVM
) == 0) {
1810 req
= pmap
->pmap_bits
[PG_V_IDX
] |
1811 pmap
->pmap_bits
[PG_U_IDX
];
1812 if (prot
& VM_PROT_WRITE
)
1813 req
|= pmap
->pmap_bits
[PG_RW_IDX
];
1815 pt_pv
= pv_get(pmap
, pmap_pt_pindex(va
), NULL
);
1818 ptep
= pv_pte_lookup(pt_pv
, pmap_pte_index(va
));
1819 if ((*ptep
& req
) != req
) {
1823 pte_pv
= pv_get_try(pmap
, pmap_pte_pindex(va
), NULL
, &error
);
1824 if (pte_pv
&& error
== 0) {
1826 if (prot
& VM_PROT_WRITE
) {
1827 /* interlocked by presence of pv_entry */
1831 if (prot
& VM_PROT_WRITE
) {
1832 if (vm_page_busy_try(m
, TRUE
))
1843 } else if (pte_pv
) {
1847 /* error, since we didn't request a placemarker */
1858 * Extract the physical page address associated kernel virtual address.
1861 pmap_kextract(vm_offset_t va
)
1863 pd_entry_t pt
; /* pt entry in pd */
1866 if (va
>= DMAP_MIN_ADDRESS
&& va
< DMAP_MAX_ADDRESS
) {
1867 pa
= DMAP_TO_PHYS(va
);
1870 if (pt
& kernel_pmap
->pmap_bits
[PG_PS_IDX
]) {
1871 pa
= (pt
& PG_PS_FRAME
) | (va
& PDRMASK
);
1874 * Beware of a concurrent promotion that changes the
1875 * PDE at this point! For example, vtopte() must not
1876 * be used to access the PTE because it would use the
1877 * new PDE. It is, however, safe to use the old PDE
1878 * because the page table page is preserved by the
1881 pa
= *pmap_pt_to_pte(pt
, va
);
1882 pa
= (pa
& PG_FRAME
) | (va
& PAGE_MASK
);
1888 /***************************************************
1889 * Low level mapping routines.....
1890 ***************************************************/
1893 * Add a wired page to the KVA and invalidate the mapping on all CPUs.
1896 pmap_kenter(vm_offset_t va
, vm_paddr_t pa
)
1902 kernel_pmap
->pmap_bits
[PG_RW_IDX
] |
1903 kernel_pmap
->pmap_bits
[PG_V_IDX
];
1907 pmap_inval_smp(kernel_pmap
, va
, 1, ptep
, npte
);
1911 pmap_inval_smp(kernel_pmap
, va
, ptep
, npte
);
1918 * Similar to pmap_kenter(), except we only invalidate the mapping on the
1919 * current CPU. Returns 0 if the previous pte was 0, 1 if it wasn't
1920 * (caller can conditionalize calling smp_invltlb()).
1923 pmap_kenter_quick(vm_offset_t va
, vm_paddr_t pa
)
1929 npte
= pa
| kernel_pmap
->pmap_bits
[PG_RW_IDX
] |
1930 kernel_pmap
->pmap_bits
[PG_V_IDX
];
1939 atomic_swap_long(ptep
, npte
);
1940 cpu_invlpg((void *)va
);
1946 * Enter addresses into the kernel pmap but don't bother
1947 * doing any tlb invalidations. Caller will do a rollup
1948 * invalidation via pmap_rollup_inval().
1951 pmap_kenter_noinval(vm_offset_t va
, vm_paddr_t pa
)
1958 kernel_pmap
->pmap_bits
[PG_RW_IDX
] |
1959 kernel_pmap
->pmap_bits
[PG_V_IDX
];
1968 atomic_swap_long(ptep
, npte
);
1969 cpu_invlpg((void *)va
);
1975 * remove a page from the kernel pagetables
1978 pmap_kremove(vm_offset_t va
)
1983 pmap_inval_smp(kernel_pmap
, va
, 1, ptep
, 0);
1987 pmap_kremove_quick(vm_offset_t va
)
1992 atomic_readandclear_long(ptep
);
1993 cpu_invlpg((void *)va
);
1997 * Remove addresses from the kernel pmap but don't bother
1998 * doing any tlb invalidations. Caller will do a rollup
1999 * invalidation via pmap_rollup_inval().
2002 pmap_kremove_noinval(vm_offset_t va
)
2007 atomic_readandclear_long(ptep
);
2011 * XXX these need to be recoded. They are not used in any critical path.
2014 pmap_kmodify_rw(vm_offset_t va
)
2016 atomic_set_long(vtopte(va
), kernel_pmap
->pmap_bits
[PG_RW_IDX
]);
2017 cpu_invlpg((void *)va
);
2022 pmap_kmodify_nc(vm_offset_t va)
2024 atomic_set_long(vtopte(va), PG_N);
2025 cpu_invlpg((void *)va);
2030 * Used to map a range of physical addresses into kernel virtual
2031 * address space during the low level boot, typically to map the
2032 * dump bitmap, message buffer, and vm_page_array.
2034 * These mappings are typically made at some pointer after the end of the
2037 * We could return PHYS_TO_DMAP(start) here and not allocate any
2038 * via (*virtp), but then kmem from userland and kernel dumps won't
2039 * have access to the related pointers.
2042 pmap_map(vm_offset_t
*virtp
, vm_paddr_t start
, vm_paddr_t end
, int prot
)
2045 vm_offset_t va_start
;
2047 /*return PHYS_TO_DMAP(start);*/
2052 while (start
< end
) {
2053 pmap_kenter_quick(va
, start
);
2061 #define PMAP_CLFLUSH_THRESHOLD (2 * 1024 * 1024)
2064 * Remove the specified set of pages from the data and instruction caches.
2066 * In contrast to pmap_invalidate_cache_range(), this function does not
2067 * rely on the CPU's self-snoop feature, because it is intended for use
2068 * when moving pages into a different cache domain.
2071 pmap_invalidate_cache_pages(vm_page_t
*pages
, int count
)
2073 vm_offset_t daddr
, eva
;
2076 if (count
>= PMAP_CLFLUSH_THRESHOLD
/ PAGE_SIZE
||
2077 (cpu_feature
& CPUID_CLFSH
) == 0)
2081 for (i
= 0; i
< count
; i
++) {
2082 daddr
= PHYS_TO_DMAP(VM_PAGE_TO_PHYS(pages
[i
]));
2083 eva
= daddr
+ PAGE_SIZE
;
2084 for (; daddr
< eva
; daddr
+= cpu_clflush_line_size
)
2092 pmap_invalidate_cache_range(vm_offset_t sva
, vm_offset_t eva
)
2094 KASSERT((sva
& PAGE_MASK
) == 0,
2095 ("pmap_invalidate_cache_range: sva not page-aligned"));
2096 KASSERT((eva
& PAGE_MASK
) == 0,
2097 ("pmap_invalidate_cache_range: eva not page-aligned"));
2099 if (cpu_feature
& CPUID_SS
) {
2100 ; /* If "Self Snoop" is supported, do nothing. */
2102 /* Globally invalidate caches */
2103 cpu_wbinvd_on_all_cpus();
2108 * Invalidate the specified range of virtual memory on all cpus associated
2112 pmap_invalidate_range(pmap_t pmap
, vm_offset_t sva
, vm_offset_t eva
)
2114 pmap_inval_smp(pmap
, sva
, (eva
- sva
) >> PAGE_SHIFT
, NULL
, 0);
2118 * Add a list of wired pages to the kva. This routine is used for temporary
2119 * kernel mappings such as those found in buffer cache buffer. Page
2120 * modifications and accesses are not tracked or recorded.
2122 * NOTE! Old mappings are simply overwritten, and we cannot assume relaxed
2123 * semantics as previous mappings may have been zerod without any
2126 * The page *must* be wired.
2128 static __inline
void
2129 _pmap_qenter(vm_offset_t beg_va
, vm_page_t
*m
, int count
, int doinval
)
2134 end_va
= beg_va
+ count
* PAGE_SIZE
;
2136 for (va
= beg_va
; va
< end_va
; va
+= PAGE_SIZE
) {
2141 pte
= VM_PAGE_TO_PHYS(*m
) |
2142 kernel_pmap
->pmap_bits
[PG_RW_IDX
] |
2143 kernel_pmap
->pmap_bits
[PG_V_IDX
] |
2144 kernel_pmap
->pmap_cache_bits_pte
[(*m
)->pat_mode
];
2146 atomic_swap_long(ptep
, pte
);
2150 pmap_invalidate_range(kernel_pmap
, beg_va
, end_va
);
2154 pmap_qenter(vm_offset_t beg_va
, vm_page_t
*m
, int count
)
2156 _pmap_qenter(beg_va
, m
, count
, 1);
2160 pmap_qenter_noinval(vm_offset_t beg_va
, vm_page_t
*m
, int count
)
2162 _pmap_qenter(beg_va
, m
, count
, 0);
2166 * This routine jerks page mappings from the kernel -- it is meant only
2167 * for temporary mappings such as those found in buffer cache buffers.
2168 * No recording modified or access status occurs.
2170 * MPSAFE, INTERRUPT SAFE (cluster callback)
2173 pmap_qremove(vm_offset_t beg_va
, int count
)
2178 end_va
= beg_va
+ count
* PAGE_SIZE
;
2180 for (va
= beg_va
; va
< end_va
; va
+= PAGE_SIZE
) {
2184 atomic_readandclear_long(pte
);
2185 cpu_invlpg((void *)va
);
2187 pmap_invalidate_range(kernel_pmap
, beg_va
, end_va
);
2191 * This routine removes temporary kernel mappings, only invalidating them
2192 * on the current cpu. It should only be used under carefully controlled
2196 pmap_qremove_quick(vm_offset_t beg_va
, int count
)
2201 end_va
= beg_va
+ count
* PAGE_SIZE
;
2203 for (va
= beg_va
; va
< end_va
; va
+= PAGE_SIZE
) {
2207 atomic_readandclear_long(pte
);
2208 cpu_invlpg((void *)va
);
2213 * This routine removes temporary kernel mappings *without* invalidating
2214 * the TLB. It can only be used on permanent kva reservations such as those
2215 * found in buffer cache buffers, under carefully controlled circumstances.
2217 * NOTE: Repopulating these KVAs requires unconditional invalidation.
2218 * (pmap_qenter() does unconditional invalidation).
2221 pmap_qremove_noinval(vm_offset_t beg_va
, int count
)
2226 end_va
= beg_va
+ count
* PAGE_SIZE
;
2228 for (va
= beg_va
; va
< end_va
; va
+= PAGE_SIZE
) {
2232 atomic_readandclear_long(pte
);
2237 * Create a new thread and optionally associate it with a (new) process.
2238 * NOTE! the new thread's cpu may not equal the current cpu.
2241 pmap_init_thread(thread_t td
)
2243 /* enforce pcb placement & alignment */
2244 td
->td_pcb
= (struct pcb
*)(td
->td_kstack
+ td
->td_kstack_size
) - 1;
2245 td
->td_pcb
= (struct pcb
*)((intptr_t)td
->td_pcb
& ~(intptr_t)0xF);
2246 td
->td_savefpu
= &td
->td_pcb
->pcb_save
;
2247 td
->td_sp
= (char *)td
->td_pcb
; /* no -16 */
2251 * This routine directly affects the fork perf for a process.
2254 pmap_init_proc(struct proc
*p
)
2259 pmap_pinit_defaults(struct pmap
*pmap
)
2261 bcopy(pmap_bits_default
, pmap
->pmap_bits
,
2262 sizeof(pmap_bits_default
));
2263 bcopy(protection_codes
, pmap
->protection_codes
,
2264 sizeof(protection_codes
));
2265 bcopy(pat_pte_index
, pmap
->pmap_cache_bits_pte
,
2266 sizeof(pat_pte_index
));
2267 bcopy(pat_pde_index
, pmap
->pmap_cache_bits_pde
,
2268 sizeof(pat_pte_index
));
2269 pmap
->pmap_cache_mask_pte
= X86_PG_NC_PWT
| X86_PG_NC_PCD
| X86_PG_PTE_PAT
;
2270 pmap
->pmap_cache_mask_pde
= X86_PG_NC_PWT
| X86_PG_NC_PCD
| X86_PG_PDE_PAT
;
2271 pmap
->copyinstr
= std_copyinstr
;
2272 pmap
->copyin
= std_copyin
;
2273 pmap
->copyout
= std_copyout
;
2274 pmap
->fubyte
= std_fubyte
;
2275 pmap
->subyte
= std_subyte
;
2276 pmap
->fuword32
= std_fuword32
;
2277 pmap
->fuword64
= std_fuword64
;
2278 pmap
->suword32
= std_suword32
;
2279 pmap
->suword64
= std_suword64
;
2280 pmap
->swapu32
= std_swapu32
;
2281 pmap
->swapu64
= std_swapu64
;
2282 pmap
->fuwordadd32
= std_fuwordadd32
;
2283 pmap
->fuwordadd64
= std_fuwordadd64
;
2287 * Initialize pmap0/vmspace0.
2289 * On architectures where the kernel pmap is not integrated into the user
2290 * process pmap, this pmap represents the process pmap, not the kernel pmap.
2291 * kernel_pmap should be used to directly access the kernel_pmap.
2294 pmap_pinit0(struct pmap
*pmap
)
2298 pmap
->pm_pml4
= (pml4_entry_t
*)(PTOV_OFFSET
+ KPML4phys
);
2300 CPUMASK_ASSZERO(pmap
->pm_active
);
2301 pmap
->pm_pvhint_pt
= NULL
;
2302 pmap
->pm_pvhint_unused
= NULL
;
2303 RB_INIT(&pmap
->pm_pvroot
);
2304 spin_init(&pmap
->pm_spin
, "pmapinit0");
2305 for (i
= 0; i
< PM_PLACEMARKS
; ++i
)
2306 pmap
->pm_placemarks
[i
] = PM_NOPLACEMARK
;
2307 bzero(&pmap
->pm_stats
, sizeof pmap
->pm_stats
);
2308 pmap_pinit_defaults(pmap
);
2312 * Initialize a preallocated and zeroed pmap structure,
2313 * such as one in a vmspace structure.
2316 pmap_pinit_simple(struct pmap
*pmap
)
2321 * Misc initialization
2324 CPUMASK_ASSZERO(pmap
->pm_active
);
2325 pmap
->pm_pvhint_pt
= NULL
;
2326 pmap
->pm_pvhint_unused
= NULL
;
2327 pmap
->pm_flags
= PMAP_FLAG_SIMPLE
;
2329 pmap_pinit_defaults(pmap
);
2332 * Don't blow up locks/tokens on re-use (XXX fix/use drop code
2335 if (pmap
->pm_pmlpv
== NULL
) {
2336 RB_INIT(&pmap
->pm_pvroot
);
2337 bzero(&pmap
->pm_stats
, sizeof pmap
->pm_stats
);
2338 spin_init(&pmap
->pm_spin
, "pmapinitsimple");
2339 for (i
= 0; i
< PM_PLACEMARKS
; ++i
)
2340 pmap
->pm_placemarks
[i
] = PM_NOPLACEMARK
;
2345 pmap_pinit(struct pmap
*pmap
)
2350 if (pmap
->pm_pmlpv
) {
2351 /* Completely clear the cached pmap if not REGULAR_PMAP. */
2352 if (pmap
->pmap_bits
[TYPE_IDX
] != REGULAR_PMAP
) {
2357 pmap_pinit_simple(pmap
);
2358 pmap
->pm_flags
&= ~PMAP_FLAG_SIMPLE
;
2361 * No need to allocate page table space yet but we do need a valid
2362 * page directory table.
2364 if (pmap
->pm_pml4
== NULL
) {
2366 (pml4_entry_t
*)kmem_alloc_pageable(kernel_map
,
2369 pmap
->pm_pml4_iso
= (void *)((char *)pmap
->pm_pml4
+ PAGE_SIZE
);
2373 * Allocate the PML4e table, which wires it even though it isn't
2374 * being entered into some higher level page table (it being the
2375 * highest level). If one is already cached we don't have to do
2378 if ((pv
= pmap
->pm_pmlpv
) == NULL
) {
2379 pv
= pmap_allocpte(pmap
, pmap_pml4_pindex(), NULL
);
2380 pmap
->pm_pmlpv
= pv
;
2381 pmap_kenter((vm_offset_t
)pmap
->pm_pml4
,
2382 VM_PAGE_TO_PHYS(pv
->pv_m
));
2386 * Install DMAP and KMAP.
2388 for (j
= 0; j
< NDMPML4E
; ++j
) {
2389 pmap
->pm_pml4
[DMPML4I
+ j
] =
2390 (DMPDPphys
+ ((vm_paddr_t
)j
<< PAGE_SHIFT
)) |
2391 pmap
->pmap_bits
[PG_RW_IDX
] |
2392 pmap
->pmap_bits
[PG_V_IDX
] |
2393 pmap
->pmap_bits
[PG_A_IDX
];
2395 for (j
= 0; j
< NKPML4E
; ++j
) {
2396 pmap
->pm_pml4
[KPML4I
+ j
] =
2397 (KPDPphys
+ ((vm_paddr_t
)j
<< PAGE_SHIFT
)) |
2398 pmap
->pmap_bits
[PG_RW_IDX
] |
2399 pmap
->pmap_bits
[PG_V_IDX
] |
2400 pmap
->pmap_bits
[PG_A_IDX
];
2404 * install self-referential address mapping entry
2406 pmap
->pm_pml4
[PML4PML4I
] = VM_PAGE_TO_PHYS(pv
->pv_m
) |
2407 pmap
->pmap_bits
[PG_V_IDX
] |
2408 pmap
->pmap_bits
[PG_RW_IDX
] |
2409 pmap
->pmap_bits
[PG_A_IDX
];
2411 KKASSERT(pv
->pv_m
->flags
& PG_MAPPED
);
2412 KKASSERT(pv
->pv_m
->flags
& PG_WRITEABLE
);
2414 KKASSERT(pmap
->pm_pml4
[255] == 0);
2417 * When implementing an isolated userland pmap, a second PML4e table
2418 * is needed. We use pmap_pml4_pindex() + 1 for convenience, but
2419 * note that we do not operate on this table using our API functions
2420 * so handling of the + 1 case is mostly just to prevent implosions.
2422 * We install an isolated version of the kernel PDPs into this
2423 * second PML4e table. The pmap code will mirror all user PDPs
2424 * between the primary and secondary PML4e table.
2426 if ((pv
= pmap
->pm_pmlpv_iso
) == NULL
&& meltdown_mitigation
&&
2427 pmap
!= &iso_pmap
) {
2428 pv
= pmap_allocpte(pmap
, pmap_pml4_pindex() + 1, NULL
);
2429 pmap
->pm_pmlpv_iso
= pv
;
2430 pmap_kenter((vm_offset_t
)pmap
->pm_pml4_iso
,
2431 VM_PAGE_TO_PHYS(pv
->pv_m
));
2435 * Install an isolated version of the kernel pmap for
2436 * user consumption, using PDPs constructed in iso_pmap.
2438 for (j
= 0; j
< NKPML4E
; ++j
) {
2439 pmap
->pm_pml4_iso
[KPML4I
+ j
] =
2440 iso_pmap
.pm_pml4
[KPML4I
+ j
];
2443 KKASSERT(pv
->pv_m
->flags
& PG_MAPPED
);
2444 KKASSERT(pv
->pv_m
->flags
& PG_WRITEABLE
);
2449 * Clean up a pmap structure so it can be physically freed. This routine
2450 * is called by the vmspace dtor function. A great deal of pmap data is
2451 * left passively mapped to improve vmspace management so we have a bit
2452 * of cleanup work to do here.
2455 pmap_puninit(pmap_t pmap
)
2460 KKASSERT(CPUMASK_TESTZERO(pmap
->pm_active
));
2461 if ((pv
= pmap
->pm_pmlpv
) != NULL
) {
2462 if (pv_hold_try(pv
) == 0)
2464 KKASSERT(pv
== pmap
->pm_pmlpv
);
2465 p
= pmap_remove_pv_page(pv
, 1);
2467 pv
= NULL
; /* safety */
2468 pmap_kremove((vm_offset_t
)pmap
->pm_pml4
);
2469 vm_page_busy_wait(p
, FALSE
, "pgpun");
2470 KKASSERT(p
->flags
& PG_UNQUEUED
);
2471 vm_page_unwire(p
, 0);
2472 vm_page_flag_clear(p
, PG_MAPPED
| PG_WRITEABLE
);
2474 pmap
->pm_pmlpv
= NULL
;
2476 if ((pv
= pmap
->pm_pmlpv_iso
) != NULL
) {
2477 if (pv_hold_try(pv
) == 0)
2479 KKASSERT(pv
== pmap
->pm_pmlpv_iso
);
2480 p
= pmap_remove_pv_page(pv
, 1);
2482 pv
= NULL
; /* safety */
2483 pmap_kremove((vm_offset_t
)pmap
->pm_pml4_iso
);
2484 vm_page_busy_wait(p
, FALSE
, "pgpun");
2485 KKASSERT(p
->flags
& PG_UNQUEUED
);
2486 vm_page_unwire(p
, 0);
2487 vm_page_flag_clear(p
, PG_MAPPED
| PG_WRITEABLE
);
2489 pmap
->pm_pmlpv_iso
= NULL
;
2491 if (pmap
->pm_pml4
) {
2492 KKASSERT(pmap
->pm_pml4
!= (void *)(PTOV_OFFSET
+ KPML4phys
));
2493 kmem_free(kernel_map
,
2494 (vm_offset_t
)pmap
->pm_pml4
, PAGE_SIZE
* 2);
2495 pmap
->pm_pml4
= NULL
;
2496 pmap
->pm_pml4_iso
= NULL
;
2498 KKASSERT(pmap
->pm_stats
.resident_count
== 0);
2499 KKASSERT(pmap
->pm_stats
.wired_count
== 0);
2503 * This function is now unused (used to add the pmap to the pmap_list)
2506 pmap_pinit2(struct pmap
*pmap
)
2511 * Transform an initialized pmap for Intel EPT.
2514 pmap_ept_transform(pmap_t pmap
, int flags
)
2516 uint64_t pmap_bits_ept
[PG_BITS_SIZE
] = {
2517 [TYPE_IDX
] = EPT_PMAP
,
2518 [PG_V_IDX
] = EPT_PG_READ
| EPT_PG_EXECUTE
,
2519 [PG_RW_IDX
] = EPT_PG_WRITE
,
2520 [PG_U_IDX
] = 0, /* no support in EPT */
2521 [PG_A_IDX
] = EPT_PG_A
,
2522 [PG_M_IDX
] = EPT_PG_M
,
2523 [PG_PS_IDX
] = EPT_PG_PS
,
2524 [PG_G_IDX
] = 0, /* no support in EPT */
2525 [PG_W_IDX
] = EPT_PG_AVAIL1
,
2526 [PG_MANAGED_IDX
] = EPT_PG_AVAIL2
,
2527 [PG_N_IDX
] = EPT_PG_IGNORE_PAT
| EPT_MEM_TYPE_UC
,
2528 [PG_NX_IDX
] = 0, /* no support in EPT */
2530 uint64_t protection_codes_ept
[PROTECTION_CODES_SIZE
] = {
2531 [VM_PROT_NONE
| VM_PROT_NONE
| VM_PROT_NONE
] = 0,
2532 [VM_PROT_READ
| VM_PROT_NONE
| VM_PROT_NONE
] = 0,
2533 [VM_PROT_READ
| VM_PROT_NONE
| VM_PROT_EXECUTE
] = 0,
2534 [VM_PROT_NONE
| VM_PROT_NONE
| VM_PROT_EXECUTE
] = 0,
2535 [VM_PROT_NONE
| VM_PROT_WRITE
| VM_PROT_NONE
] =
2536 pmap_bits_ept
[PG_RW_IDX
],
2537 [VM_PROT_NONE
| VM_PROT_WRITE
| VM_PROT_EXECUTE
] =
2538 pmap_bits_ept
[PG_RW_IDX
],
2539 [VM_PROT_READ
| VM_PROT_WRITE
| VM_PROT_NONE
] =
2540 pmap_bits_ept
[PG_RW_IDX
],
2541 [VM_PROT_READ
| VM_PROT_WRITE
| VM_PROT_EXECUTE
] =
2542 pmap_bits_ept
[PG_RW_IDX
],
2544 pt_entry_t pmap_cache_bits_ept
[PAT_INDEX_SIZE
] = {
2545 [PAT_UNCACHEABLE
] = EPT_PG_IGNORE_PAT
| EPT_MEM_TYPE_UC
,
2546 [PAT_WRITE_COMBINING
] = EPT_PG_IGNORE_PAT
| EPT_MEM_TYPE_WC
,
2547 [PAT_WRITE_THROUGH
] = EPT_PG_IGNORE_PAT
| EPT_MEM_TYPE_WT
,
2548 [PAT_WRITE_PROTECTED
] = EPT_PG_IGNORE_PAT
| EPT_MEM_TYPE_WP
,
2549 [PAT_WRITE_BACK
] = EPT_PG_IGNORE_PAT
| EPT_MEM_TYPE_WB
,
2550 [PAT_UNCACHED
] = EPT_PG_IGNORE_PAT
| EPT_MEM_TYPE_UC
,
2552 pt_entry_t pmap_cache_mask_ept
= EPT_PG_IGNORE_PAT
| EPT_MEM_TYPE_MASK
;
2554 pmap
->pm_flags
|= (flags
| PMAP_HVM
);
2555 bcopy(pmap_bits_ept
, pmap
->pmap_bits
, sizeof(pmap_bits_ept
));
2556 bcopy(protection_codes_ept
, pmap
->protection_codes
,
2557 sizeof(protection_codes_ept
));
2558 bcopy(pmap_cache_bits_ept
, pmap
->pmap_cache_bits_pte
,
2559 sizeof(pmap_cache_bits_ept
));
2560 bcopy(pmap_cache_bits_ept
, pmap
->pmap_cache_bits_pde
,
2561 sizeof(pmap_cache_bits_ept
));
2562 pmap
->pmap_cache_mask_pte
= pmap_cache_mask_ept
;
2563 pmap
->pmap_cache_mask_pde
= pmap_cache_mask_ept
;
2566 * Zero out page directories. These are only used by the VM. Note
2567 * that the valid area is two pages if there is a pm_pmlpv_iso PTE
2568 * installed, otherwise it is only one page. The ISO page isn't used
2569 * either way but clean it out anyway if it exists.
2571 if (pmap
->pm_pmlpv_iso
!= NULL
)
2572 bzero(pmap
->pm_pml4
, PAGE_SIZE
* 2);
2574 bzero(pmap
->pm_pml4
, PAGE_SIZE
);
2578 * Transform an initialized pmap for AMD NPT/RVI.
2581 pmap_npt_transform(pmap_t pmap
, int flags
)
2583 uint64_t protection_codes_npt
[PROTECTION_CODES_SIZE
] = {
2584 [VM_PROT_NONE
| VM_PROT_NONE
| VM_PROT_NONE
] = 0,
2585 [VM_PROT_READ
| VM_PROT_NONE
| VM_PROT_NONE
] = 0,
2586 [VM_PROT_READ
| VM_PROT_NONE
| VM_PROT_EXECUTE
] = 0,
2587 [VM_PROT_NONE
| VM_PROT_NONE
| VM_PROT_EXECUTE
] = 0,
2588 [VM_PROT_NONE
| VM_PROT_WRITE
| VM_PROT_NONE
] =
2589 pmap_bits_default
[PG_RW_IDX
],
2590 [VM_PROT_NONE
| VM_PROT_WRITE
| VM_PROT_EXECUTE
] =
2591 pmap_bits_default
[PG_RW_IDX
],
2592 [VM_PROT_READ
| VM_PROT_WRITE
| VM_PROT_NONE
] =
2593 pmap_bits_default
[PG_RW_IDX
],
2594 [VM_PROT_READ
| VM_PROT_WRITE
| VM_PROT_EXECUTE
] =
2595 pmap_bits_default
[PG_RW_IDX
],
2598 pmap
->pm_flags
|= (flags
| PMAP_HVM
);
2599 pmap
->pmap_bits
[TYPE_IDX
] = NPT_PMAP
;
2600 /* Set PG_G and PG_NX bits to 0, similar to the EPT case above. */
2601 pmap
->pmap_bits
[PG_G_IDX
] = 0;
2602 pmap
->pmap_bits
[PG_NX_IDX
] = 0;
2604 bcopy(protection_codes_npt
, pmap
->protection_codes
,
2605 sizeof(protection_codes_npt
));
2607 if (pmap
->pm_pmlpv_iso
!= NULL
)
2608 bzero(pmap
->pm_pml4
, PAGE_SIZE
* 2);
2610 bzero(pmap
->pm_pml4
, PAGE_SIZE
);
2614 * This routine is called when various levels in the page table need to
2615 * be populated. This routine cannot fail.
2617 * This function returns two locked pv_entry's, one representing the
2618 * requested pv and one representing the requested pv's parent pv. If
2619 * an intermediate page table does not exist it will be created, mapped,
2620 * wired, and the parent page table will be given an additional hold
2621 * count representing the presence of the child pv_entry.
2625 pmap_allocpte(pmap_t pmap
, vm_pindex_t ptepindex
, pv_entry_t
*pvpp
)
2628 pt_entry_t
*ptep_iso
;
2637 * If the pv already exists and we aren't being asked for the
2638 * parent page table page we can just return it. A locked+held pv
2639 * is returned. The pv will also have a second hold related to the
2640 * pmap association that we don't have to worry about.
2643 pv
= pv_alloc(pmap
, ptepindex
, &isnew
);
2644 if (isnew
== 0 && pvpp
== NULL
)
2648 * DragonFly doesn't use PV's to represent terminal PTEs any more.
2649 * The index range is still used for placemarkers, but not for
2650 * actual pv_entry's.
2652 KKASSERT(ptepindex
>= pmap_pt_pindex(0));
2655 * Note that pt_pv's are only returned for user VAs. We assert that
2656 * a pt_pv is not being requested for kernel VAs. The kernel
2657 * pre-wires all higher-level page tables so don't overload managed
2658 * higher-level page tables on top of it!
2660 * However, its convenient for us to allow the case when creating
2661 * iso_pmap. This is a bit of a hack but it simplifies iso_pmap
2666 * The kernel never uses managed PT/PD/PDP pages.
2668 KKASSERT(pmap
!= kernel_pmap
);
2671 * Non-terminal PVs allocate a VM page to represent the page table,
2672 * so we have to resolve pvp and calculate ptepindex for the pvp
2673 * and then for the page table entry index in the pvp for
2676 if (ptepindex
< pmap_pd_pindex(0)) {
2678 * pv is PT, pvp is PD
2680 ptepindex
= (ptepindex
- pmap_pt_pindex(0)) >> NPDEPGSHIFT
;
2681 ptepindex
+= NUPTE_TOTAL
+ NUPT_TOTAL
;
2682 pvp
= pmap_allocpte(pmap
, ptepindex
, NULL
);
2687 ptepindex
= pv
->pv_pindex
- pmap_pt_pindex(0);
2688 ptepindex
&= ((1ul << NPDEPGSHIFT
) - 1);
2690 } else if (ptepindex
< pmap_pdp_pindex(0)) {
2692 * pv is PD, pvp is PDP
2694 * SIMPLE PMAP NOTE: Simple pmaps do not allocate above
2697 ptepindex
= (ptepindex
- pmap_pd_pindex(0)) >> NPDPEPGSHIFT
;
2698 ptepindex
+= NUPTE_TOTAL
+ NUPT_TOTAL
+ NUPD_TOTAL
;
2700 if (pmap
->pm_flags
& PMAP_FLAG_SIMPLE
) {
2701 KKASSERT(pvpp
== NULL
);
2704 pvp
= pmap_allocpte(pmap
, ptepindex
, NULL
);
2710 ptepindex
= pv
->pv_pindex
- pmap_pd_pindex(0);
2711 ptepindex
&= ((1ul << NPDPEPGSHIFT
) - 1);
2712 } else if (ptepindex
< pmap_pml4_pindex()) {
2714 * pv is PDP, pvp is the root pml4 table
2716 pvp
= pmap_allocpte(pmap
, pmap_pml4_pindex(), NULL
);
2721 ptepindex
= pv
->pv_pindex
- pmap_pdp_pindex(0);
2722 ptepindex
&= ((1ul << NPML4EPGSHIFT
) - 1);
2725 * pv represents the top-level PML4, there is no parent.
2736 * (1) Add a wire count to the parent page table (pvp).
2737 * (2) Allocate a VM page for the page table.
2738 * (3) Enter the VM page into the parent page table.
2740 * page table pages are marked PG_WRITEABLE and PG_MAPPED.
2743 vm_page_wire_quick(pvp
->pv_m
);
2746 m
= vm_page_alloc(NULL
, pv
->pv_pindex
,
2747 VM_ALLOC_NORMAL
| VM_ALLOC_SYSTEM
|
2748 VM_ALLOC_INTERRUPT
);
2753 vm_page_wire(m
); /* wire for mapping in parent */
2754 pmap_zero_page(VM_PAGE_TO_PHYS(m
));
2755 m
->valid
= VM_PAGE_BITS_ALL
;
2756 vm_page_flag_set(m
, PG_MAPPED
| PG_WRITEABLE
| PG_UNQUEUED
);
2757 KKASSERT(m
->queue
== PQ_NONE
);
2764 * Wire the page into pvp. Bump the resident_count for the pmap.
2765 * There is no pvp for the top level, address the pm_pml4[] array
2768 * If the caller wants the parent we return it, otherwise
2769 * we just put it away.
2771 * No interlock is needed for pte 0 -> non-zero.
2773 * In the situation where *ptep is valid we might have an unmanaged
2774 * page table page shared from another page table which we need to
2775 * unshare before installing our private page table page.
2778 v
= VM_PAGE_TO_PHYS(m
) |
2779 (pmap
->pmap_bits
[PG_RW_IDX
] |
2780 pmap
->pmap_bits
[PG_V_IDX
] |
2781 pmap
->pmap_bits
[PG_A_IDX
]);
2782 if (ptepindex
< NUPTE_USER
)
2783 v
|= pmap
->pmap_bits
[PG_U_IDX
];
2784 if (ptepindex
< pmap_pt_pindex(0))
2785 v
|= pmap
->pmap_bits
[PG_M_IDX
];
2787 ptep
= pv_pte_lookup(pvp
, ptepindex
);
2788 if (pvp
== pmap
->pm_pmlpv
&& pmap
->pm_pmlpv_iso
)
2789 ptep_iso
= pv_pte_lookup(pmap
->pm_pmlpv_iso
, ptepindex
);
2792 if (*ptep
& pmap
->pmap_bits
[PG_V_IDX
]) {
2793 panic("pmap_allocpte: ptpte present without pv_entry!");
2797 pte
= atomic_swap_long(ptep
, v
);
2799 atomic_swap_long(ptep_iso
, v
);
2801 kprintf("install pgtbl mixup 0x%016jx "
2802 "old/new 0x%016jx/0x%016jx\n",
2803 (intmax_t)ptepindex
, pte
, v
);
2811 * (isnew) may be TRUE or FALSE.
2814 KKASSERT(pvp
->pv_m
!= NULL
);
2815 ptep
= pv_pte_lookup(pvp
, ptepindex
);
2816 v
= VM_PAGE_TO_PHYS(pv
->pv_m
) |
2817 (pmap
->pmap_bits
[PG_RW_IDX
] |
2818 pmap
->pmap_bits
[PG_V_IDX
] |
2819 pmap
->pmap_bits
[PG_A_IDX
]);
2820 if (ptepindex
< NUPTE_USER
)
2821 v
|= pmap
->pmap_bits
[PG_U_IDX
];
2822 if (ptepindex
< pmap_pt_pindex(0))
2823 v
|= pmap
->pmap_bits
[PG_M_IDX
];
2825 kprintf("mismatched upper level pt %016jx/%016jx\n",
2837 * Release any resources held by the given physical map.
2839 * Called when a pmap initialized by pmap_pinit is being released. Should
2840 * only be called if the map contains no valid mappings.
2842 struct pmap_release_info
{
2848 static int pmap_release_callback(pv_entry_t pv
, void *data
);
2851 pmap_release(struct pmap
*pmap
)
2853 struct pmap_release_info info
;
2855 KASSERT(CPUMASK_TESTZERO(pmap
->pm_active
),
2856 ("pmap still active! %016jx",
2857 (uintmax_t)CPUMASK_LOWMASK(pmap
->pm_active
)));
2860 * There is no longer a pmap_list, if there were we would remove the
2861 * pmap from it here.
2865 * Pull pv's off the RB tree in order from low to high and release
2873 spin_lock(&pmap
->pm_spin
);
2874 RB_SCAN(pv_entry_rb_tree
, &pmap
->pm_pvroot
, NULL
,
2875 pmap_release_callback
, &info
);
2876 spin_unlock(&pmap
->pm_spin
);
2880 } while (info
.retry
);
2884 * One resident page (the pml4 page) should remain. Two if
2885 * the pmap has implemented an isolated userland PML4E table.
2886 * No wired pages should remain.
2888 int expected_res
= 0;
2890 if ((pmap
->pm_flags
& PMAP_FLAG_SIMPLE
) == 0)
2892 if (pmap
->pm_pmlpv_iso
)
2896 if (pmap
->pm_stats
.resident_count
!= expected_res
||
2897 pmap
->pm_stats
.wired_count
!= 0) {
2898 kprintf("fatal pmap problem - pmap %p flags %08x "
2899 "rescnt=%jd wirecnt=%jd\n",
2902 pmap
->pm_stats
.resident_count
,
2903 pmap
->pm_stats
.wired_count
);
2904 tsleep(pmap
, 0, "DEAD", 0);
2907 KKASSERT(pmap
->pm_stats
.resident_count
== expected_res
);
2908 KKASSERT(pmap
->pm_stats
.wired_count
== 0);
2913 * Called from low to high. We must cache the proper parent pv so we
2914 * can adjust its wired count.
2917 pmap_release_callback(pv_entry_t pv
, void *data
)
2919 struct pmap_release_info
*info
= data
;
2920 pmap_t pmap
= info
->pmap
;
2925 * Acquire a held and locked pv, check for release race
2927 pindex
= pv
->pv_pindex
;
2928 if (info
->pvp
== pv
) {
2929 spin_unlock(&pmap
->pm_spin
);
2931 } else if (pv_hold_try(pv
)) {
2932 spin_unlock(&pmap
->pm_spin
);
2934 spin_unlock(&pmap
->pm_spin
);
2938 spin_lock(&pmap
->pm_spin
);
2942 KKASSERT(pv
->pv_pmap
== pmap
&& pindex
== pv
->pv_pindex
);
2944 if (pv
->pv_pindex
< pmap_pt_pindex(0)) {
2946 * I am PTE, parent is PT
2948 pindex
= pv
->pv_pindex
>> NPTEPGSHIFT
;
2949 pindex
+= NUPTE_TOTAL
;
2950 } else if (pv
->pv_pindex
< pmap_pd_pindex(0)) {
2952 * I am PT, parent is PD
2954 pindex
= (pv
->pv_pindex
- NUPTE_TOTAL
) >> NPDEPGSHIFT
;
2955 pindex
+= NUPTE_TOTAL
+ NUPT_TOTAL
;
2956 } else if (pv
->pv_pindex
< pmap_pdp_pindex(0)) {
2958 * I am PD, parent is PDP
2960 pindex
= (pv
->pv_pindex
- NUPTE_TOTAL
- NUPT_TOTAL
) >>
2962 pindex
+= NUPTE_TOTAL
+ NUPT_TOTAL
+ NUPD_TOTAL
;
2963 } else if (pv
->pv_pindex
< pmap_pml4_pindex()) {
2965 * I am PDP, parent is PML4. We always calculate the
2966 * normal PML4 here, not the isolated PML4.
2968 pindex
= pmap_pml4_pindex();
2980 if (info
->pvp
&& info
->pvp
->pv_pindex
!= pindex
) {
2984 if (info
->pvp
== NULL
)
2985 info
->pvp
= pv_get(pmap
, pindex
, NULL
);
2992 r
= pmap_release_pv(pv
, info
->pvp
, NULL
);
2993 spin_lock(&pmap
->pm_spin
);
2999 * Called with held (i.e. also locked) pv. This function will dispose of
3000 * the lock along with the pv.
3002 * If the caller already holds the locked parent page table for pv it
3003 * must pass it as pvp, allowing us to avoid a deadlock, else it can
3004 * pass NULL for pvp.
3007 pmap_release_pv(pv_entry_t pv
, pv_entry_t pvp
, pmap_inval_bulk_t
*bulk
)
3012 * The pmap is currently not spinlocked, pv is held+locked.
3013 * Remove the pv's page from its parent's page table. The
3014 * parent's page table page's wire_count will be decremented.
3016 * This will clean out the pte at any level of the page table.
3017 * If smp != 0 all cpus are affected.
3019 * Do not tear-down recursively, its faster to just let the
3020 * release run its course.
3022 pmap_remove_pv_pte(pv
, pvp
, bulk
, 0);
3025 * Terminal pvs are unhooked from their vm_pages. Because
3026 * terminal pages aren't page table pages they aren't wired
3027 * by us, so we have to be sure not to unwire them either.
3029 * XXX It is unclear if this code ever gets called because we
3030 * no longer use pv's to track terminal pages.
3032 if (pv
->pv_pindex
< pmap_pt_pindex(0)) {
3033 pmap_remove_pv_page(pv
, 0);
3038 * We leave the top-level page table page cached, wired, and
3039 * mapped in the pmap until the dtor function (pmap_puninit())
3042 * Since we are leaving the top-level pv intact we need
3043 * to break out of what would otherwise be an infinite loop.
3045 * This covers both the normal and the isolated PML4 page.
3047 if (pv
->pv_pindex
>= pmap_pml4_pindex()) {
3053 * For page table pages (other than the top-level page),
3054 * remove and free the vm_page. The representitive mapping
3055 * removed above by pmap_remove_pv_pte() did not undo the
3056 * last wire_count so we have to do that as well.
3058 p
= pmap_remove_pv_page(pv
, 1);
3059 vm_page_busy_wait(p
, FALSE
, "pmaprl");
3060 if (p
->wire_count
!= 1) {
3063 if (pv
->pv_pindex
>= pmap_pdp_pindex(0))
3065 else if (pv
->pv_pindex
>= pmap_pd_pindex(0))
3067 else if (pv
->pv_pindex
>= pmap_pt_pindex(0))
3072 kprintf("p(%s) p->wire_count was %016lx %d\n",
3073 tstr
, pv
->pv_pindex
, p
->wire_count
);
3075 KKASSERT(p
->wire_count
== 1);
3076 KKASSERT(p
->flags
& PG_UNQUEUED
);
3078 vm_page_unwire(p
, 0);
3079 KKASSERT(p
->wire_count
== 0);
3089 * This function will remove the pte associated with a pv from its parent.
3090 * Terminal pv's are supported. All cpus specified by (bulk) are properly
3093 * The wire count will be dropped on the parent page table. The wire
3094 * count on the page being removed (pv->pv_m) from the parent page table
3095 * is NOT touched. Note that terminal pages will not have any additional
3096 * wire counts while page table pages will have at least one representing
3097 * the mapping, plus others representing sub-mappings.
3099 * NOTE: Cannot be called on kernel page table pages, only KVM terminal
3100 * pages and user page table and terminal pages.
3102 * NOTE: The pte being removed might be unmanaged, and the pv supplied might
3103 * be freshly allocated and not imply that the pte is managed. In this
3104 * case pv->pv_m should be NULL.
3106 * The pv must be locked. The pvp, if supplied, must be locked. All
3107 * supplied pv's will remain locked on return.
3109 * XXX must lock parent pv's if they exist to remove pte XXX
3113 pmap_remove_pv_pte(pv_entry_t pv
, pv_entry_t pvp
, pmap_inval_bulk_t
*bulk
,
3116 vm_pindex_t ptepindex
= pv
->pv_pindex
;
3117 pmap_t pmap
= pv
->pv_pmap
;
3123 if (ptepindex
>= pmap_pml4_pindex()) {
3125 * We are the top level PML4E table, there is no parent.
3127 * This is either the normal or isolated PML4E table.
3128 * Only the normal is used in regular operation, the isolated
3129 * is only passed in when breaking down the whole pmap.
3131 p
= pmap
->pm_pmlpv
->pv_m
;
3132 KKASSERT(pv
->pv_m
== p
); /* debugging */
3133 } else if (ptepindex
>= pmap_pdp_pindex(0)) {
3135 * Remove a PDP page from the PML4E. This can only occur
3136 * with user page tables. We do not have to lock the
3137 * pml4 PV so just ignore pvp.
3139 vm_pindex_t pml4_pindex
;
3140 vm_pindex_t pdp_index
;
3142 pml4_entry_t
*pdp_iso
;
3144 pdp_index
= ptepindex
- pmap_pdp_pindex(0);
3146 pml4_pindex
= pmap_pml4_pindex();
3147 pvp
= pv_get(pv
->pv_pmap
, pml4_pindex
, NULL
);
3152 pdp
= &pmap
->pm_pml4
[pdp_index
& ((1ul << NPML4EPGSHIFT
) - 1)];
3153 KKASSERT((*pdp
& pmap
->pmap_bits
[PG_V_IDX
]) != 0);
3154 p
= PHYS_TO_VM_PAGE(*pdp
& PG_FRAME
);
3155 pmap_inval_bulk(bulk
, (vm_offset_t
)-1, pdp
, 0);
3158 * Also remove the PDP from the isolated PML4E if the
3161 if (pvp
== pmap
->pm_pmlpv
&& pmap
->pm_pmlpv_iso
) {
3162 pdp_iso
= &pmap
->pm_pml4_iso
[pdp_index
&
3163 ((1ul << NPML4EPGSHIFT
) - 1)];
3164 pmap_inval_bulk(bulk
, (vm_offset_t
)-1, pdp_iso
, 0);
3166 KKASSERT(pv
->pv_m
== p
); /* debugging */
3167 } else if (ptepindex
>= pmap_pd_pindex(0)) {
3169 * Remove a PD page from the PDP
3171 * SIMPLE PMAP NOTE: Non-existant pvp's are ok in the case
3172 * of a simple pmap because it stops at
3175 vm_pindex_t pdp_pindex
;
3176 vm_pindex_t pd_index
;
3179 pd_index
= ptepindex
- pmap_pd_pindex(0);
3182 pdp_pindex
= NUPTE_TOTAL
+ NUPT_TOTAL
+ NUPD_TOTAL
+
3183 (pd_index
>> NPML4EPGSHIFT
);
3184 pvp
= pv_get(pv
->pv_pmap
, pdp_pindex
, NULL
);
3189 pd
= pv_pte_lookup(pvp
, pd_index
&
3190 ((1ul << NPDPEPGSHIFT
) - 1));
3191 KKASSERT((*pd
& pmap
->pmap_bits
[PG_V_IDX
]) != 0);
3192 p
= PHYS_TO_VM_PAGE(*pd
& PG_FRAME
);
3193 pmap_inval_bulk(bulk
, (vm_offset_t
)-1, pd
, 0);
3195 KKASSERT(pmap
->pm_flags
& PMAP_FLAG_SIMPLE
);
3196 p
= pv
->pv_m
; /* degenerate test later */
3198 KKASSERT(pv
->pv_m
== p
); /* debugging */
3199 } else if (ptepindex
>= pmap_pt_pindex(0)) {
3201 * Remove a PT page from the PD
3203 vm_pindex_t pd_pindex
;
3204 vm_pindex_t pt_index
;
3207 pt_index
= ptepindex
- pmap_pt_pindex(0);
3210 pd_pindex
= NUPTE_TOTAL
+ NUPT_TOTAL
+
3211 (pt_index
>> NPDPEPGSHIFT
);
3212 pvp
= pv_get(pv
->pv_pmap
, pd_pindex
, NULL
);
3217 pt
= pv_pte_lookup(pvp
, pt_index
& ((1ul << NPDPEPGSHIFT
) - 1));
3219 KASSERT((*pt
& pmap
->pmap_bits
[PG_V_IDX
]) != 0,
3220 ("*pt unexpectedly invalid %016jx "
3221 "gotpvp=%d ptepindex=%ld ptindex=%ld pv=%p pvp=%p",
3222 *pt
, gotpvp
, ptepindex
, pt_index
, pv
, pvp
));
3223 p
= PHYS_TO_VM_PAGE(*pt
& PG_FRAME
);
3225 if ((*pt
& pmap
->pmap_bits
[PG_V_IDX
]) == 0) {
3226 kprintf("*pt unexpectedly invalid %016jx "
3227 "gotpvp=%d ptepindex=%ld ptindex=%ld "
3229 *pt
, gotpvp
, ptepindex
, pt_index
, pv
, pvp
);
3230 tsleep(pt
, 0, "DEAD", 0);
3233 p
= PHYS_TO_VM_PAGE(*pt
& PG_FRAME
);
3236 pmap_inval_bulk(bulk
, (vm_offset_t
)-1, pt
, 0);
3237 KKASSERT(pv
->pv_m
== p
); /* debugging */
3243 * If requested, scrap the underlying pv->pv_m and the underlying
3244 * pv. If this is a page-table-page we must also free the page.
3246 * pvp must be returned locked.
3250 * page table page (PT, PD, PDP, PML4), caller was responsible
3251 * for testing wired_count.
3253 KKASSERT(pv
->pv_m
->wire_count
== 1);
3254 p
= pmap_remove_pv_page(pv
, 1);
3258 vm_page_busy_wait(p
, FALSE
, "pgpun");
3259 vm_page_unwire(p
, 0);
3260 vm_page_flag_clear(p
, PG_MAPPED
| PG_WRITEABLE
);
3265 * If we acquired pvp ourselves then we are responsible for
3266 * recursively deleting it.
3268 if (pvp
&& gotpvp
) {
3270 * Recursively destroy higher-level page tables.
3272 * This is optional. If we do not, they will still
3273 * be destroyed when the process exits.
3275 * NOTE: Do not destroy pv_entry's with extra hold refs,
3276 * a caller may have unlocked it and intends to
3277 * continue to use it.
3279 if (pmap_dynamic_delete
&&
3281 pvp
->pv_m
->wire_count
== 1 &&
3282 (pvp
->pv_hold
& PV_HOLD_MASK
) == 2 &&
3283 pvp
->pv_pindex
< pmap_pml4_pindex()) {
3284 if (pmap
!= kernel_pmap
) {
3285 pmap_remove_pv_pte(pvp
, NULL
, bulk
, 1);
3286 pvp
= NULL
; /* safety */
3288 kprintf("Attempt to remove kernel_pmap pindex "
3289 "%jd\n", pvp
->pv_pindex
);
3299 * Remove the vm_page association to a pv. The pv must be locked.
3303 pmap_remove_pv_page(pv_entry_t pv
, int clrpgbits
)
3310 vm_page_flag_clear(m
, PG_MAPPED
| PG_WRITEABLE
);
3316 * Grow the number of kernel page table entries, if needed.
3318 * This routine is always called to validate any address space
3319 * beyond KERNBASE (for kldloads). kernel_vm_end only governs the address
3320 * space below KERNBASE.
3322 * kernel_map must be locked exclusively by the caller.
3325 pmap_growkernel(vm_offset_t kstart
, vm_offset_t kend
)
3328 vm_offset_t ptppaddr
;
3330 pd_entry_t
*pt
, newpt
;
3331 pdp_entry_t
*pd
, newpd
;
3332 int update_kernel_vm_end
;
3335 * bootstrap kernel_vm_end on first real VM use
3337 if (kernel_vm_end
== 0) {
3338 kernel_vm_end
= VM_MIN_KERNEL_ADDRESS
;
3341 pt
= pmap_pt(kernel_pmap
, kernel_vm_end
);
3344 if ((*pt
& kernel_pmap
->pmap_bits
[PG_V_IDX
]) == 0)
3346 kernel_vm_end
= (kernel_vm_end
+ PAGE_SIZE
* NPTEPG
) &
3347 ~(vm_offset_t
)(PAGE_SIZE
* NPTEPG
- 1);
3348 if (kernel_vm_end
- 1 >= vm_map_max(kernel_map
)) {
3349 kernel_vm_end
= vm_map_max(kernel_map
);
3356 * Fill in the gaps. kernel_vm_end is only adjusted for ranges
3357 * below KERNBASE. Ranges above KERNBASE are kldloaded and we
3358 * do not want to force-fill 128G worth of page tables.
3360 if (kstart
< KERNBASE
) {
3361 if (kstart
> kernel_vm_end
)
3362 kstart
= kernel_vm_end
;
3363 KKASSERT(kend
<= KERNBASE
);
3364 update_kernel_vm_end
= 1;
3366 update_kernel_vm_end
= 0;
3369 kstart
= rounddown2(kstart
, (vm_offset_t
)(PAGE_SIZE
* NPTEPG
));
3370 kend
= roundup2(kend
, (vm_offset_t
)(PAGE_SIZE
* NPTEPG
));
3372 if (kend
- 1 >= vm_map_max(kernel_map
))
3373 kend
= vm_map_max(kernel_map
);
3375 while (kstart
< kend
) {
3376 pt
= pmap_pt(kernel_pmap
, kstart
);
3379 * We need a new PD entry
3381 nkpg
= vm_page_alloc(NULL
, mycpu
->gd_rand_incr
++,
3384 VM_ALLOC_INTERRUPT
);
3386 panic("pmap_growkernel: no memory to grow "
3389 paddr
= VM_PAGE_TO_PHYS(nkpg
);
3390 pmap_zero_page(paddr
);
3391 pd
= pmap_pd(kernel_pmap
, kstart
);
3393 newpd
= (pdp_entry_t
)
3395 kernel_pmap
->pmap_bits
[PG_V_IDX
] |
3396 kernel_pmap
->pmap_bits
[PG_RW_IDX
] |
3397 kernel_pmap
->pmap_bits
[PG_A_IDX
]);
3398 atomic_swap_long(pd
, newpd
);
3401 kprintf("NEWPD pd=%p pde=%016jx phys=%016jx\n",
3405 continue; /* try again */
3408 if ((*pt
& kernel_pmap
->pmap_bits
[PG_V_IDX
]) != 0) {
3409 kstart
= (kstart
+ PAGE_SIZE
* NPTEPG
) &
3410 ~(vm_offset_t
)(PAGE_SIZE
* NPTEPG
- 1);
3411 if (kstart
- 1 >= vm_map_max(kernel_map
)) {
3412 kstart
= vm_map_max(kernel_map
);
3421 * This index is bogus, but out of the way
3423 nkpg
= vm_page_alloc(NULL
, mycpu
->gd_rand_incr
++,
3426 VM_ALLOC_INTERRUPT
);
3428 panic("pmap_growkernel: no memory to grow kernel");
3431 ptppaddr
= VM_PAGE_TO_PHYS(nkpg
);
3432 pmap_zero_page(ptppaddr
);
3433 newpt
= (pd_entry_t
)(ptppaddr
|
3434 kernel_pmap
->pmap_bits
[PG_V_IDX
] |
3435 kernel_pmap
->pmap_bits
[PG_RW_IDX
] |
3436 kernel_pmap
->pmap_bits
[PG_A_IDX
]);
3437 atomic_swap_long(pt
, newpt
);
3439 kstart
= (kstart
+ PAGE_SIZE
* NPTEPG
) &
3440 ~(vm_offset_t
)(PAGE_SIZE
* NPTEPG
- 1);
3442 if (kstart
- 1 >= vm_map_max(kernel_map
)) {
3443 kstart
= vm_map_max(kernel_map
);
3449 * Only update kernel_vm_end for areas below KERNBASE.
3451 if (update_kernel_vm_end
&& kernel_vm_end
< kstart
)
3452 kernel_vm_end
= kstart
;
3456 * Add a reference to the specified pmap.
3459 pmap_reference(pmap_t pmap
)
3462 atomic_add_int(&pmap
->pm_count
, 1);
3466 pmap_maybethreaded(pmap_t pmap
)
3468 atomic_set_int(&pmap
->pm_flags
, PMAP_MULTI
);
3472 * Called while page is hard-busied to clear the PG_MAPPED and PG_WRITEABLE
3473 * flags if able. This can happen when the pmap code is unable to clear
3474 * the bits in prior actions due to not holding the page hard-busied at
3477 * The clearing of PG_MAPPED/WRITEABLE is an optional optimization done
3478 * when the pte is removed and only if the pte has not been multiply-mapped.
3479 * The caller may have to call vm_page_protect() if the bits are still set
3482 * This function is expected to be quick.
3485 pmap_mapped_sync(vm_page_t m
)
3490 /***************************************************
3491 * page management routines.
3492 ***************************************************/
3495 * Hold a pv without locking it
3499 pv_hold(pv_entry_t pv
)
3501 atomic_add_int(&pv
->pv_hold
, 1);
3506 * Hold a pv_entry, preventing its destruction. TRUE is returned if the pv
3507 * was successfully locked, FALSE if it wasn't. The caller must dispose of
3510 * Either the pmap->pm_spin or the related vm_page_spin (if traversing a
3511 * pv list via its page) must be held by the caller in order to stabilize
3515 _pv_hold_try(pv_entry_t pv PMAP_DEBUG_DECL
)
3520 * Critical path shortcut expects pv to already have one ref
3521 * (for the pv->pv_pmap).
3523 count
= pv
->pv_hold
;
3526 if ((count
& PV_HOLD_LOCKED
) == 0) {
3527 if (atomic_fcmpset_int(&pv
->pv_hold
, &count
,
3528 (count
+ 1) | PV_HOLD_LOCKED
)) {
3531 pv
->pv_line
= lineno
;
3536 if (atomic_fcmpset_int(&pv
->pv_hold
, &count
, count
+ 1))
3544 * Drop a previously held pv_entry which could not be locked, allowing its
3547 * Must not be called with a spinlock held as we might zfree() the pv if it
3548 * is no longer associated with a pmap and this was the last hold count.
3551 pv_drop(pv_entry_t pv
)
3556 count
= pv
->pv_hold
;
3558 KKASSERT((count
& PV_HOLD_MASK
) > 0);
3559 KKASSERT((count
& (PV_HOLD_LOCKED
| PV_HOLD_MASK
)) !=
3560 (PV_HOLD_LOCKED
| 1));
3561 if (atomic_cmpset_int(&pv
->pv_hold
, count
, count
- 1)) {
3562 if ((count
& PV_HOLD_MASK
) == 1) {
3564 if (pmap_enter_debug
> 0) {
3566 kprintf("pv_drop: free pv %p\n", pv
);
3569 KKASSERT(count
== 1);
3570 KKASSERT(pv
->pv_pmap
== NULL
);
3580 * Find or allocate the requested PV entry, returning a locked, held pv.
3582 * If (*isnew) is non-zero, the returned pv will have two hold counts, one
3583 * for the caller and one representing the pmap and vm_page association.
3585 * If (*isnew) is zero, the returned pv will have only one hold count.
3587 * Since both associations can only be adjusted while the pv is locked,
3588 * together they represent just one additional hold.
3592 _pv_alloc(pmap_t pmap
, vm_pindex_t pindex
, int *isnew PMAP_DEBUG_DECL
)
3594 struct mdglobaldata
*md
= mdcpu
;
3602 pnew
= atomic_swap_ptr((void *)&md
->gd_newpv
, NULL
);
3605 pnew
= md
->gd_newpv
; /* might race NULL */
3606 md
->gd_newpv
= NULL
;
3611 pnew
= zalloc(pvzone
);
3613 spin_lock_shared(&pmap
->pm_spin
);
3618 pv
= pv_entry_lookup(pmap
, pindex
);
3623 * Requires exclusive pmap spinlock
3625 if (pmap_excl
== 0) {
3627 if (!spin_lock_upgrade_try(&pmap
->pm_spin
)) {
3628 spin_unlock_shared(&pmap
->pm_spin
);
3629 spin_lock(&pmap
->pm_spin
);
3635 * We need to block if someone is holding our
3636 * placemarker. As long as we determine the
3637 * placemarker has not been aquired we do not
3638 * need to get it as acquision also requires
3639 * the pmap spin lock.
3641 * However, we can race the wakeup.
3643 pmark
= pmap_placemarker_hash(pmap
, pindex
);
3645 if (((*pmark
^ pindex
) & ~PM_PLACEMARK_WAKEUP
) == 0) {
3646 tsleep_interlock(pmark
, 0);
3647 atomic_set_long(pmark
, PM_PLACEMARK_WAKEUP
);
3648 if (((*pmark
^ pindex
) &
3649 ~PM_PLACEMARK_WAKEUP
) == 0) {
3650 spin_unlock(&pmap
->pm_spin
);
3651 tsleep(pmark
, PINTERLOCKED
, "pvplc", 0);
3652 spin_lock(&pmap
->pm_spin
);
3658 * Setup the new entry
3660 pnew
->pv_pmap
= pmap
;
3661 pnew
->pv_pindex
= pindex
;
3662 pnew
->pv_hold
= PV_HOLD_LOCKED
| 2;
3665 pnew
->pv_func
= func
;
3666 pnew
->pv_line
= lineno
;
3667 if (pnew
->pv_line_lastfree
> 0) {
3668 pnew
->pv_line_lastfree
=
3669 -pnew
->pv_line_lastfree
;
3672 pv
= pv_entry_rb_tree_RB_INSERT(&pmap
->pm_pvroot
, pnew
);
3673 atomic_add_long(&pmap
->pm_stats
.resident_count
, 1);
3674 spin_unlock(&pmap
->pm_spin
);
3677 KASSERT(pv
== NULL
, ("pv insert failed %p->%p", pnew
, pv
));
3682 * We already have an entry, cleanup the staged pnew if
3683 * we can get the lock, otherwise block and retry.
3685 if (__predict_true(_pv_hold_try(pv PMAP_DEBUG_COPY
))) {
3687 spin_unlock(&pmap
->pm_spin
);
3689 spin_unlock_shared(&pmap
->pm_spin
);
3691 pnew
= atomic_swap_ptr((void *)&md
->gd_newpv
, pnew
);
3693 zfree(pvzone
, pnew
);
3696 if (md
->gd_newpv
== NULL
)
3697 md
->gd_newpv
= pnew
;
3699 zfree(pvzone
, pnew
);
3702 KKASSERT(pv
->pv_pmap
== pmap
&&
3703 pv
->pv_pindex
== pindex
);
3708 spin_unlock(&pmap
->pm_spin
);
3709 _pv_lock(pv PMAP_DEBUG_COPY
);
3711 spin_lock(&pmap
->pm_spin
);
3713 spin_unlock_shared(&pmap
->pm_spin
);
3714 _pv_lock(pv PMAP_DEBUG_COPY
);
3716 spin_lock_shared(&pmap
->pm_spin
);
3723 * Find the requested PV entry, returning a locked+held pv or NULL
3727 _pv_get(pmap_t pmap
, vm_pindex_t pindex
, vm_pindex_t
**pmarkp PMAP_DEBUG_DECL
)
3732 spin_lock_shared(&pmap
->pm_spin
);
3737 pv
= pv_entry_lookup(pmap
, pindex
);
3740 * Block if there is ANY placemarker. If we are to
3741 * return it, we must also aquire the spot, so we
3742 * have to block even if the placemarker is held on
3743 * a different address.
3745 * OPTIMIZATION: If pmarkp is passed as NULL the
3746 * caller is just probing (or looking for a real
3747 * pv_entry), and in this case we only need to check
3748 * to see if the placemarker matches pindex.
3753 * Requires exclusive pmap spinlock
3755 if (pmap_excl
== 0) {
3757 if (!spin_lock_upgrade_try(&pmap
->pm_spin
)) {
3758 spin_unlock_shared(&pmap
->pm_spin
);
3759 spin_lock(&pmap
->pm_spin
);
3764 pmark
= pmap_placemarker_hash(pmap
, pindex
);
3766 if ((pmarkp
&& *pmark
!= PM_NOPLACEMARK
) ||
3767 ((*pmark
^ pindex
) & ~PM_PLACEMARK_WAKEUP
) == 0) {
3768 tsleep_interlock(pmark
, 0);
3769 atomic_set_long(pmark
, PM_PLACEMARK_WAKEUP
);
3770 if ((pmarkp
&& *pmark
!= PM_NOPLACEMARK
) ||
3771 ((*pmark
^ pindex
) &
3772 ~PM_PLACEMARK_WAKEUP
) == 0) {
3773 spin_unlock(&pmap
->pm_spin
);
3774 tsleep(pmark
, PINTERLOCKED
, "pvpld", 0);
3775 spin_lock(&pmap
->pm_spin
);
3780 if (atomic_swap_long(pmark
, pindex
) !=
3782 panic("_pv_get: pmark race");
3786 spin_unlock(&pmap
->pm_spin
);
3789 if (_pv_hold_try(pv PMAP_DEBUG_COPY
)) {
3791 spin_unlock(&pmap
->pm_spin
);
3793 spin_unlock_shared(&pmap
->pm_spin
);
3794 KKASSERT(pv
->pv_pmap
== pmap
&&
3795 pv
->pv_pindex
== pindex
);
3799 spin_unlock(&pmap
->pm_spin
);
3800 _pv_lock(pv PMAP_DEBUG_COPY
);
3802 spin_lock(&pmap
->pm_spin
);
3804 spin_unlock_shared(&pmap
->pm_spin
);
3805 _pv_lock(pv PMAP_DEBUG_COPY
);
3807 spin_lock_shared(&pmap
->pm_spin
);
3813 * Lookup, hold, and attempt to lock (pmap,pindex).
3815 * If the entry does not exist NULL is returned and *errorp is set to 0
3817 * If the entry exists and could be successfully locked it is returned and
3818 * errorp is set to 0.
3820 * If the entry exists but could NOT be successfully locked it is returned
3821 * held and *errorp is set to 1.
3823 * If the entry is placemarked by someone else NULL is returned and *errorp
3828 pv_get_try(pmap_t pmap
, vm_pindex_t pindex
, vm_pindex_t
**pmarkp
, int *errorp
)
3832 spin_lock_shared(&pmap
->pm_spin
);
3834 pv
= pv_entry_lookup(pmap
, pindex
);
3838 pmark
= pmap_placemarker_hash(pmap
, pindex
);
3840 if (((*pmark
^ pindex
) & ~PM_PLACEMARK_WAKEUP
) == 0) {
3842 } else if (pmarkp
&&
3843 atomic_cmpset_long(pmark
, PM_NOPLACEMARK
, pindex
)) {
3847 * Can't set a placemark with a NULL pmarkp, or if
3848 * pmarkp is non-NULL but we failed to set our
3855 spin_unlock_shared(&pmap
->pm_spin
);
3861 * XXX This has problems if the lock is shared, why?
3863 if (pv_hold_try(pv
)) {
3864 spin_unlock_shared(&pmap
->pm_spin
);
3866 KKASSERT(pv
->pv_pmap
== pmap
&& pv
->pv_pindex
== pindex
);
3867 return(pv
); /* lock succeeded */
3869 spin_unlock_shared(&pmap
->pm_spin
);
3872 return (pv
); /* lock failed */
3876 * Lock a held pv, keeping the hold count
3880 _pv_lock(pv_entry_t pv PMAP_DEBUG_DECL
)
3885 count
= pv
->pv_hold
;
3887 if ((count
& PV_HOLD_LOCKED
) == 0) {
3888 if (atomic_cmpset_int(&pv
->pv_hold
, count
,
3889 count
| PV_HOLD_LOCKED
)) {
3892 pv
->pv_line
= lineno
;
3898 tsleep_interlock(pv
, 0);
3899 if (atomic_cmpset_int(&pv
->pv_hold
, count
,
3900 count
| PV_HOLD_WAITING
)) {
3902 if (pmap_enter_debug
> 0) {
3904 kprintf("pv waiting on %s:%d\n",
3905 pv
->pv_func
, pv
->pv_line
);
3908 tsleep(pv
, PINTERLOCKED
, "pvwait", hz
);
3915 * Unlock a held and locked pv, keeping the hold count.
3919 pv_unlock(pv_entry_t pv
)
3924 count
= pv
->pv_hold
;
3926 KKASSERT((count
& (PV_HOLD_LOCKED
| PV_HOLD_MASK
)) >=
3927 (PV_HOLD_LOCKED
| 1));
3928 if (atomic_cmpset_int(&pv
->pv_hold
, count
,
3930 ~(PV_HOLD_LOCKED
| PV_HOLD_WAITING
))) {
3931 if (count
& PV_HOLD_WAITING
)
3939 * Unlock and drop a pv. If the pv is no longer associated with a pmap
3940 * and the hold count drops to zero we will free it.
3942 * Caller should not hold any spin locks. We are protected from hold races
3943 * by virtue of holds only occuring only with a pmap_spin or vm_page_spin
3944 * lock held. A pv cannot be located otherwise.
3948 pv_put(pv_entry_t pv
)
3951 if (pmap_enter_debug
> 0) {
3953 kprintf("pv_put pv=%p hold=%08x\n", pv
, pv
->pv_hold
);
3958 * Normal put-aways must have a pv_m associated with the pv,
3959 * but allow the case where the pv has been destructed due
3960 * to pmap_dynamic_delete.
3962 KKASSERT(pv
->pv_pmap
== NULL
|| pv
->pv_m
!= NULL
);
3965 * Fast - shortcut most common condition
3967 if (atomic_cmpset_int(&pv
->pv_hold
, PV_HOLD_LOCKED
| 2, 1))
3978 * Remove the pmap association from a pv, require that pv_m already be removed,
3979 * then unlock and drop the pv. Any pte operations must have already been
3980 * completed. This call may result in a last-drop which will physically free
3983 * Removing the pmap association entails an additional drop.
3985 * pv must be exclusively locked on call and will be disposed of on return.
3989 _pv_free(pv_entry_t pv
, pv_entry_t pvp PMAP_DEBUG_DECL
)
3994 pv
->pv_func_lastfree
= func
;
3995 pv
->pv_line_lastfree
= lineno
;
3997 KKASSERT(pv
->pv_m
== NULL
);
3998 KKASSERT((pv
->pv_hold
& (PV_HOLD_LOCKED
|PV_HOLD_MASK
)) >=
3999 (PV_HOLD_LOCKED
|1));
4000 if ((pmap
= pv
->pv_pmap
) != NULL
) {
4001 spin_lock(&pmap
->pm_spin
);
4002 KKASSERT(pv
->pv_pmap
== pmap
);
4003 if (pmap
->pm_pvhint_pt
== pv
)
4004 pmap
->pm_pvhint_pt
= NULL
;
4005 if (pmap
->pm_pvhint_unused
== pv
)
4006 pmap
->pm_pvhint_unused
= NULL
;
4007 pv_entry_rb_tree_RB_REMOVE(&pmap
->pm_pvroot
, pv
);
4008 atomic_add_long(&pmap
->pm_stats
.resident_count
, -1);
4011 spin_unlock(&pmap
->pm_spin
);
4014 * Try to shortcut three atomic ops, otherwise fall through
4015 * and do it normally. Drop two refs and the lock all in
4019 if (vm_page_unwire_quick(pvp
->pv_m
))
4020 panic("_pv_free: bad wirecount on pvp");
4022 if (atomic_cmpset_int(&pv
->pv_hold
, PV_HOLD_LOCKED
| 2, 0)) {
4024 if (pmap_enter_debug
> 0) {
4026 kprintf("pv_free: free pv %p\n", pv
);
4032 pv_drop(pv
); /* ref for pv_pmap */
4039 * This routine is very drastic, but can save the system
4047 static int warningdone
=0;
4049 if (pmap_pagedaemon_waken
== 0)
4051 pmap_pagedaemon_waken
= 0;
4052 if (warningdone
< 5) {
4053 kprintf("pmap_collect: pv_entries exhausted -- "
4054 "suggest increasing vm.pmap_pv_entries above %ld\n",
4055 vm_pmap_pv_entries
);
4059 for (i
= 0; i
< vm_page_array_size
; i
++) {
4060 m
= &vm_page_array
[i
];
4061 if (m
->wire_count
|| m
->hold_count
)
4063 if (vm_page_busy_try(m
, TRUE
) == 0) {
4064 if (m
->wire_count
== 0 && m
->hold_count
== 0) {
4073 * Scan the pmap for active page table entries and issue a callback.
4074 * The callback must dispose of pte_pv, whos PTE entry is at *ptep in
4075 * its parent page table.
4077 * pte_pv will be NULL if the page or page table is unmanaged.
4078 * pt_pv will point to the page table page containing the pte for the page.
4080 * NOTE! If we come across an unmanaged page TABLE (verses an unmanaged page),
4081 * we pass a NULL pte_pv and we pass a pt_pv pointing to the passed
4082 * process pmap's PD and page to the callback function. This can be
4083 * confusing because the pt_pv is really a pd_pv, and the target page
4084 * table page is simply aliased by the pmap and not owned by it.
4086 * It is assumed that the start and end are properly rounded to the page size.
4088 * It is assumed that PD pages and above are managed and thus in the RB tree,
4089 * allowing us to use RB_SCAN from the PD pages down for ranged scans.
4091 struct pmap_scan_info
{
4095 vm_pindex_t sva_pd_pindex
;
4096 vm_pindex_t eva_pd_pindex
;
4097 void (*func
)(pmap_t
, struct pmap_scan_info
*,
4098 vm_pindex_t
*, pv_entry_t
, vm_offset_t
,
4099 pt_entry_t
*, void *);
4101 pmap_inval_bulk_t bulk_core
;
4102 pmap_inval_bulk_t
*bulk
;
4107 static int pmap_scan_cmp(pv_entry_t pv
, void *data
);
4108 static int pmap_scan_callback(pv_entry_t pv
, void *data
);
4111 pmap_scan(struct pmap_scan_info
*info
, int smp_inval
)
4113 struct pmap
*pmap
= info
->pmap
;
4114 pv_entry_t pt_pv
; /* A page table PV */
4115 pv_entry_t pte_pv
; /* A page table entry PV */
4116 vm_pindex_t
*pte_placemark
;
4117 vm_pindex_t
*pt_placemark
;
4120 struct pv_entry dummy_pv
;
4125 if (info
->sva
== info
->eva
)
4128 info
->bulk
= &info
->bulk_core
;
4129 pmap_inval_bulk_init(&info
->bulk_core
, pmap
);
4135 * Hold the token for stability; if the pmap is empty we have nothing
4139 if (pmap
->pm_stats
.resident_count
== 0) {
4147 * Special handling for scanning one page, which is a very common
4148 * operation (it is?).
4150 * NOTE: Locks must be ordered bottom-up. pte,pt,pd,pdp,pml4
4152 if (info
->sva
+ PAGE_SIZE
== info
->eva
) {
4153 if (info
->sva
>= VM_MAX_USER_ADDRESS
) {
4155 * Kernel mappings do not track wire counts on
4156 * page table pages and only maintain pd_pv and
4157 * pte_pv levels so pmap_scan() works.
4160 pte_pv
= pv_get(pmap
, pmap_pte_pindex(info
->sva
),
4162 KKASSERT(pte_pv
== NULL
);
4163 ptep
= vtopte(info
->sva
);
4166 * We hold pte_placemark across the operation for
4169 * WARNING! We must hold pt_placemark across the
4170 * *ptep test to prevent misintepreting
4171 * a non-zero *ptep as a shared page
4172 * table page. Hold it across the function
4173 * callback as well for SMP safety.
4175 pte_pv
= pv_get(pmap
, pmap_pte_pindex(info
->sva
),
4177 KKASSERT(pte_pv
== NULL
);
4178 pt_pv
= pv_get(pmap
, pmap_pt_pindex(info
->sva
),
4180 if (pt_pv
== NULL
) {
4183 pd_pv
= pv_get(pmap
,
4184 pmap_pd_pindex(info
->sva
),
4187 ptep
= pv_pte_lookup(pd_pv
,
4188 pmap_pt_index(info
->sva
));
4190 info
->func(pmap
, info
,
4191 pt_placemark
, pd_pv
,
4195 pv_placemarker_wakeup(pmap
,
4200 pv_placemarker_wakeup(pmap
,
4204 pv_placemarker_wakeup(pmap
, pt_placemark
);
4206 pv_placemarker_wakeup(pmap
, pte_placemark
);
4209 ptep
= pv_pte_lookup(pt_pv
, pmap_pte_index(info
->sva
));
4213 * NOTE: *ptep can't be ripped out from under us if we hold
4214 * pte_pv (or pte_placemark) locked, but bits can
4220 KKASSERT(pte_pv
== NULL
);
4221 pv_placemarker_wakeup(pmap
, pte_placemark
);
4223 KASSERT((oldpte
& pmap
->pmap_bits
[PG_V_IDX
]) ==
4224 pmap
->pmap_bits
[PG_V_IDX
],
4225 ("badB *ptep %016lx/%016lx sva %016lx pte_pv NULL",
4226 *ptep
, oldpte
, info
->sva
));
4227 info
->func(pmap
, info
, pte_placemark
, pt_pv
,
4228 info
->sva
, ptep
, info
->arg
);
4233 pmap_inval_bulk_flush(info
->bulk
);
4238 * Nominal scan case, RB_SCAN() for PD pages and iterate from
4241 * WARNING! eva can overflow our standard ((N + mask) >> bits)
4242 * bounds, resulting in a pd_pindex of 0. To solve the
4243 * problem we use an inclusive range.
4245 info
->sva_pd_pindex
= pmap_pd_pindex(info
->sva
);
4246 info
->eva_pd_pindex
= pmap_pd_pindex(info
->eva
- PAGE_SIZE
);
4248 if (info
->sva
>= VM_MAX_USER_ADDRESS
) {
4250 * The kernel does not currently maintain any pv_entry's for
4251 * higher-level page tables.
4253 bzero(&dummy_pv
, sizeof(dummy_pv
));
4254 dummy_pv
.pv_pindex
= info
->sva_pd_pindex
;
4255 spin_lock(&pmap
->pm_spin
);
4256 while (dummy_pv
.pv_pindex
<= info
->eva_pd_pindex
) {
4257 pmap_scan_callback(&dummy_pv
, info
);
4258 ++dummy_pv
.pv_pindex
;
4259 if (dummy_pv
.pv_pindex
< info
->sva_pd_pindex
) /*wrap*/
4262 spin_unlock(&pmap
->pm_spin
);
4265 * User page tables maintain local PML4, PDP, PD, and PT
4266 * pv_entry's. pv_entry's are not used for PTEs.
4268 spin_lock(&pmap
->pm_spin
);
4269 pv_entry_rb_tree_RB_SCAN(&pmap
->pm_pvroot
, pmap_scan_cmp
,
4270 pmap_scan_callback
, info
);
4271 spin_unlock(&pmap
->pm_spin
);
4273 pmap_inval_bulk_flush(info
->bulk
);
4277 * WARNING! pmap->pm_spin held
4279 * WARNING! eva can overflow our standard ((N + mask) >> bits)
4280 * bounds, resulting in a pd_pindex of 0. To solve the
4281 * problem we use an inclusive range.
4284 pmap_scan_cmp(pv_entry_t pv
, void *data
)
4286 struct pmap_scan_info
*info
= data
;
4287 if (pv
->pv_pindex
< info
->sva_pd_pindex
)
4289 if (pv
->pv_pindex
> info
->eva_pd_pindex
)
4295 * pmap_scan() by PDs
4297 * WARNING! pmap->pm_spin held
4300 pmap_scan_callback(pv_entry_t pv
, void *data
)
4302 struct pmap_scan_info
*info
= data
;
4303 struct pmap
*pmap
= info
->pmap
;
4304 pv_entry_t pd_pv
; /* A page directory PV */
4305 pv_entry_t pt_pv
; /* A page table PV */
4306 vm_pindex_t
*pt_placemark
;
4311 vm_offset_t va_next
;
4312 vm_pindex_t pd_pindex
;
4322 * Pull the PD pindex from the pv before releasing the spinlock.
4324 * WARNING: pv is faked for kernel pmap scans.
4326 pd_pindex
= pv
->pv_pindex
;
4327 spin_unlock(&pmap
->pm_spin
);
4328 pv
= NULL
; /* invalid after spinlock unlocked */
4331 * Calculate the page range within the PD. SIMPLE pmaps are
4332 * direct-mapped for the entire 2^64 address space. Normal pmaps
4333 * reflect the user and kernel address space which requires
4334 * cannonicalization w/regards to converting pd_pindex's back
4337 sva
= (pd_pindex
- pmap_pd_pindex(0)) << PDPSHIFT
;
4338 if ((pmap
->pm_flags
& PMAP_FLAG_SIMPLE
) == 0 &&
4339 (sva
& PML4_SIGNMASK
)) {
4340 sva
|= PML4_SIGNMASK
;
4342 eva
= sva
+ NBPDP
; /* can overflow */
4343 if (sva
< info
->sva
)
4345 if (eva
< info
->sva
|| eva
> info
->eva
)
4349 * NOTE: kernel mappings do not track page table pages, only
4352 * NOTE: Locks must be ordered bottom-up. pte,pt,pd,pdp,pml4.
4353 * However, for the scan to be efficient we try to
4354 * cache items top-down.
4359 for (; sva
< eva
; sva
= va_next
) {
4362 if (sva
>= VM_MAX_USER_ADDRESS
) {
4371 * PD cache, scan shortcut if it doesn't exist.
4373 if (pd_pv
== NULL
) {
4374 pd_pv
= pv_get(pmap
, pmap_pd_pindex(sva
), NULL
);
4375 } else if (pd_pv
->pv_pmap
!= pmap
||
4376 pd_pv
->pv_pindex
!= pmap_pd_pindex(sva
)) {
4378 pd_pv
= pv_get(pmap
, pmap_pd_pindex(sva
), NULL
);
4380 if (pd_pv
== NULL
) {
4381 va_next
= (sva
+ NBPDP
) & ~PDPMASK
;
4390 * NOTE: The cached pt_pv can be removed from the pmap when
4391 * pmap_dynamic_delete is enabled.
4393 if (pt_pv
&& (pt_pv
->pv_pmap
!= pmap
||
4394 pt_pv
->pv_pindex
!= pmap_pt_pindex(sva
))) {
4398 if (pt_pv
== NULL
) {
4399 pt_pv
= pv_get_try(pmap
, pmap_pt_pindex(sva
),
4400 &pt_placemark
, &error
);
4402 pv_put(pd_pv
); /* lock order */
4409 pv_placemarker_wait(pmap
, pt_placemark
);
4414 /* may have to re-check later if pt_pv is NULL here */
4418 * If pt_pv is NULL we either have a shared page table
4419 * page (NOT IMPLEMENTED XXX) and must issue a callback
4420 * specific to that case, or there is no page table page.
4422 * Either way we can skip the page table page.
4424 * WARNING! pt_pv can also be NULL due to a pv creation
4425 * race where we find it to be NULL and then
4426 * later see a pte_pv. But its possible the pt_pv
4427 * got created inbetween the two operations, so
4430 * XXX This should no longer be the case because
4431 * we have pt_placemark.
4433 if (pt_pv
== NULL
) {
4437 * Possible unmanaged (shared from another pmap)
4440 * WARNING! We must hold pt_placemark across the
4441 * *ptep test to prevent misintepreting
4442 * a non-zero *ptep as a shared page
4443 * table page. Hold it across the function
4444 * callback as well for SMP safety.
4447 ptep
= pv_pte_lookup(pd_pv
, pmap_pt_index(sva
));
4448 if (*ptep
& pmap
->pmap_bits
[PG_V_IDX
]) {
4449 info
->func(pmap
, info
, pt_placemark
, pd_pv
,
4450 sva
, ptep
, info
->arg
);
4452 pv_placemarker_wakeup(pmap
, pt_placemark
);
4455 pv_placemarker_wakeup(pmap
, pt_placemark
);
4459 * Done, move to next page table page.
4461 va_next
= (sva
+ NBPDR
) & ~PDRMASK
;
4468 * From this point in the loop testing pt_pv for non-NULL
4469 * means we are in UVM, else if it is NULL we are in KVM.
4471 * Limit our scan to either the end of the va represented
4472 * by the current page table page, or to the end of the
4473 * range being removed.
4476 va_next
= (sva
+ NBPDR
) & ~PDRMASK
;
4483 * Scan the page table for pages. Some pages may not be
4484 * managed (might not have a pv_entry).
4486 * There is no page table management for kernel pages so
4487 * pt_pv will be NULL in that case, but otherwise pt_pv
4488 * is non-NULL, locked, and referenced.
4492 * At this point a non-NULL pt_pv means a UVA, and a NULL
4493 * pt_pv means a KVA.
4496 ptep
= pv_pte_lookup(pt_pv
, pmap_pte_index(sva
));
4500 while (sva
< va_next
) {
4501 vm_pindex_t
*pte_placemark
;
4505 * Yield every 64 pages, stop if requested.
4507 if ((++info
->count
& 63) == 0)
4513 * We can shortcut our scan if *ptep == 0. This is
4514 * an unlocked check.
4524 * Acquire the pte_placemark. pte_pv's won't exist
4527 * A multitude of races are possible here so if we
4528 * cannot lock definite state we clean out our cache
4529 * and break the inner while() loop to force a loop
4530 * up to the top of the for().
4532 * XXX unlock/relock pd_pv, pt_pv, and re-test their
4533 * validity instead of looping up?
4535 pte_pv
= pv_get_try(pmap
, pmap_pte_pindex(sva
),
4536 &pte_placemark
, &error
);
4537 KKASSERT(pte_pv
== NULL
);
4540 pv_put(pd_pv
); /* lock order */
4544 pv_put(pt_pv
); /* lock order */
4547 pv_placemarker_wait(pmap
, pte_placemark
);
4548 va_next
= sva
; /* retry */
4553 * Reload *ptep after successfully locking the
4559 pv_placemarker_wakeup(pmap
, pte_placemark
);
4566 * We can't hold pd_pv across the callback (because
4567 * we don't pass it to the callback and the callback
4571 vm_page_wire_quick(pd_pv
->pv_m
);
4576 * Ready for the callback. The locked placemarker
4577 * is consumed by the callback.
4579 if (oldpte
& pmap
->pmap_bits
[PG_MANAGED_IDX
]) {
4583 KASSERT((oldpte
& pmap
->pmap_bits
[PG_V_IDX
]),
4584 ("badC *ptep %016lx/%016lx sva %016lx",
4585 *ptep
, oldpte
, sva
));
4587 * We must unlock pd_pv across the callback
4588 * to avoid deadlocks on any recursive
4589 * disposal. Re-check that it still exists
4592 * Call target disposes of pte_placemark
4593 * and may destroy but will not dispose
4596 info
->func(pmap
, info
, pte_placemark
, pt_pv
,
4597 sva
, ptep
, info
->arg
);
4602 * We must unlock pd_pv across the callback
4603 * to avoid deadlocks on any recursive
4604 * disposal. Re-check that it still exists
4607 * Call target disposes of pte_placemark
4608 * and may destroy but will not dispose
4611 KASSERT((oldpte
& pmap
->pmap_bits
[PG_V_IDX
]),
4612 ("badD *ptep %016lx/%016lx sva %016lx ",
4613 *ptep
, oldpte
, sva
));
4614 info
->func(pmap
, info
, pte_placemark
, pt_pv
,
4615 sva
, ptep
, info
->arg
);
4619 if (vm_page_unwire_quick(pd_pv
->pv_m
)) {
4620 panic("pmap_scan_callback: "
4621 "bad wirecount on pd_pv");
4623 if (pd_pv
->pv_pmap
== NULL
) {
4624 va_next
= sva
; /* retry */
4630 * NOTE: The cached pt_pv can be removed from the
4631 * pmap when pmap_dynamic_delete is enabled,
4632 * which will cause ptep to become stale.
4634 * This also means that no pages remain under
4635 * the PT, so we can just break out of the inner
4636 * loop and let the outer loop clean everything
4639 if (pt_pv
&& pt_pv
->pv_pmap
!= pmap
)
4653 if ((++info
->count
& 7) == 0)
4657 * Relock before returning.
4659 spin_lock(&pmap
->pm_spin
);
4664 pmap_remove(struct pmap
*pmap
, vm_offset_t sva
, vm_offset_t eva
)
4666 struct pmap_scan_info info
;
4671 info
.func
= pmap_remove_callback
;
4673 pmap_scan(&info
, 1);
4676 if (eva
- sva
< 1024*1024) {
4678 cpu_invlpg((void *)sva
);
4686 pmap_remove_noinval(struct pmap
*pmap
, vm_offset_t sva
, vm_offset_t eva
)
4688 struct pmap_scan_info info
;
4693 info
.func
= pmap_remove_callback
;
4695 pmap_scan(&info
, 0);
4699 pmap_remove_callback(pmap_t pmap
, struct pmap_scan_info
*info
,
4700 vm_pindex_t
*pte_placemark
, pv_entry_t pt_pv
,
4701 vm_offset_t va
, pt_entry_t
*ptep
, void *arg __unused
)
4707 * Managed or unmanaged pte (pte_placemark is non-NULL)
4709 * pt_pv's wire_count is still bumped by unmanaged pages
4710 * so we must decrement it manually.
4712 * We have to unwire the target page table page.
4715 if (pte
& pmap
->pmap_bits
[PG_MANAGED_IDX
]) {
4716 oldm
= PHYS_TO_VM_PAGE(pte
& PG_FRAME
);
4717 atomic_add_long(&oldm
->md
.interlock_count
, 1);
4722 pte
= pmap_inval_bulk(info
->bulk
, va
, ptep
, 0);
4723 if (pte
& pmap
->pmap_bits
[PG_MANAGED_IDX
]) {
4726 p
= PHYS_TO_VM_PAGE(pte
& PG_FRAME
);
4727 KKASSERT(pte
& pmap
->pmap_bits
[PG_V_IDX
]);
4728 if (pte
& pmap
->pmap_bits
[PG_M_IDX
])
4730 if (pte
& pmap
->pmap_bits
[PG_A_IDX
])
4731 vm_page_flag_set(p
, PG_REFERENCED
);
4734 * (p) is not hard-busied.
4736 * We can safely clear PG_MAPPED and PG_WRITEABLE only
4737 * if PG_MAPPEDMULTI is not set, atomically.
4739 pmap_removed_pte(p
, pte
);
4741 if (pte
& pmap
->pmap_bits
[PG_V_IDX
]) {
4742 atomic_add_long(&pmap
->pm_stats
.resident_count
, -1);
4743 if (pt_pv
&& vm_page_unwire_quick(pt_pv
->pv_m
))
4744 panic("pmap_remove: insufficient wirecount");
4746 if (pte
& pmap
->pmap_bits
[PG_W_IDX
])
4747 atomic_add_long(&pmap
->pm_stats
.wired_count
, -1);
4748 if (pte
& pmap
->pmap_bits
[PG_G_IDX
])
4749 cpu_invlpg((void *)va
);
4750 pv_placemarker_wakeup(pmap
, pte_placemark
);
4752 if ((atomic_fetchadd_long(&oldm
->md
.interlock_count
, -1) &
4753 0x7FFFFFFFFFFFFFFFLU
) == 0x4000000000000001LU
) {
4754 atomic_clear_long(&oldm
->md
.interlock_count
,
4755 0x4000000000000000LU
);
4756 wakeup(&oldm
->md
.interlock_count
);
4762 * Removes this physical page from all physical maps in which it resides.
4763 * Reflects back modify bits to the pager.
4765 * This routine may not be called from an interrupt.
4767 * The page must be busied by its caller, preventing new ptes from being
4768 * installed. This allows us to assert that pmap_count is zero and safely
4769 * clear the MAPPED and WRITEABLE bits upon completion.
4773 pmap_remove_all(vm_page_t m
)
4778 if (__predict_false(!pmap_initialized
))
4782 * pmap_count doesn't cover fictitious pages, but PG_MAPPED does
4783 * (albeit without certain race protections).
4786 if (m
->md
.pmap_count
== 0)
4789 if ((m
->flags
& PG_MAPPED
) == 0)
4792 retry
= ticks
+ hz
* 60;
4794 PMAP_PAGE_BACKING_SCAN(m
, NULL
, ipmap
, iptep
, ipte
, iva
) {
4795 if (!pmap_inval_smp_cmpset(ipmap
, iva
, iptep
, ipte
, 0))
4796 PMAP_PAGE_BACKING_RETRY
;
4797 if (ipte
& ipmap
->pmap_bits
[PG_MANAGED_IDX
]) {
4798 if (ipte
& ipmap
->pmap_bits
[PG_M_IDX
])
4800 if (ipte
& ipmap
->pmap_bits
[PG_A_IDX
])
4801 vm_page_flag_set(m
, PG_REFERENCED
);
4804 * NOTE: m is not hard-busied so it is not safe to
4805 * clear PG_MAPPED and PG_WRITEABLE on the 1->0
4806 * transition against them being set in
4809 pmap_removed_pte(m
, ipte
);
4813 * Cleanup various tracking counters. pt_pv can't go away
4814 * due to our wired ref.
4816 if (ipmap
!= kernel_pmap
) {
4819 spin_lock_shared(&ipmap
->pm_spin
);
4820 pt_pv
= pv_entry_lookup(ipmap
, pmap_pt_pindex(iva
));
4821 spin_unlock_shared(&ipmap
->pm_spin
);
4824 if (vm_page_unwire_quick(pt_pv
->pv_m
)) {
4825 panic("pmap_remove_all: bad "
4826 "wire_count on pt_pv");
4829 &ipmap
->pm_stats
.resident_count
, -1);
4832 if (ipte
& ipmap
->pmap_bits
[PG_W_IDX
])
4833 atomic_add_long(&ipmap
->pm_stats
.wired_count
, -1);
4834 if (ipte
& ipmap
->pmap_bits
[PG_G_IDX
])
4835 cpu_invlpg((void *)iva
);
4836 } PMAP_PAGE_BACKING_DONE
;
4839 * If our scan lost a pte swap race oldm->md.interlock_count might
4840 * be set from the pmap_enter() code. If so sleep a little and try
4843 icount
= atomic_fetchadd_long(&m
->md
.interlock_count
,
4844 0x8000000000000000LU
) +
4845 0x8000000000000000LU
;
4847 while (icount
& 0x3FFFFFFFFFFFFFFFLU
) {
4848 tsleep_interlock(&m
->md
.interlock_count
, 0);
4849 if (atomic_fcmpset_long(&m
->md
.interlock_count
, &icount
,
4850 icount
| 0x4000000000000000LU
)) {
4851 tsleep(&m
->md
.interlock_count
, PINTERLOCKED
,
4853 icount
= m
->md
.interlock_count
;
4854 if (retry
- ticks
> 0)
4856 panic("pmap_remove_all: cannot return interlock_count "
4858 m
, m
->md
.interlock_count
);
4861 vm_page_flag_clear(m
, PG_MAPPED
| PG_MAPPEDMULTI
| PG_WRITEABLE
);
4865 * Removes the page from a particular pmap.
4867 * The page must be busied by the caller.
4870 pmap_remove_specific(pmap_t pmap_match
, vm_page_t m
)
4872 if (__predict_false(!pmap_initialized
))
4876 * PG_MAPPED test works for both non-fictitious and fictitious pages.
4878 if ((m
->flags
& PG_MAPPED
) == 0)
4881 PMAP_PAGE_BACKING_SCAN(m
, pmap_match
, ipmap
, iptep
, ipte
, iva
) {
4882 if (!pmap_inval_smp_cmpset(ipmap
, iva
, iptep
, ipte
, 0))
4883 PMAP_PAGE_BACKING_RETRY
;
4884 if (ipte
& ipmap
->pmap_bits
[PG_MANAGED_IDX
]) {
4885 if (ipte
& ipmap
->pmap_bits
[PG_M_IDX
])
4887 if (ipte
& ipmap
->pmap_bits
[PG_A_IDX
])
4888 vm_page_flag_set(m
, PG_REFERENCED
);
4891 * NOTE: m is not hard-busied so it is not safe to
4892 * clear PG_MAPPED and PG_WRITEABLE on the 1->0
4893 * transition against them being set in
4896 pmap_removed_pte(m
, ipte
);
4900 * Cleanup various tracking counters. pt_pv can't go away
4901 * due to our wired ref.
4903 if (ipmap
!= kernel_pmap
) {
4906 spin_lock_shared(&ipmap
->pm_spin
);
4907 pt_pv
= pv_entry_lookup(ipmap
, pmap_pt_pindex(iva
));
4908 spin_unlock_shared(&ipmap
->pm_spin
);
4912 &ipmap
->pm_stats
.resident_count
, -1);
4913 if (vm_page_unwire_quick(pt_pv
->pv_m
)) {
4914 panic("pmap_remove_specific: bad "
4915 "wire_count on pt_pv");
4919 if (ipte
& ipmap
->pmap_bits
[PG_W_IDX
])
4920 atomic_add_long(&ipmap
->pm_stats
.wired_count
, -1);
4921 if (ipte
& ipmap
->pmap_bits
[PG_G_IDX
])
4922 cpu_invlpg((void *)iva
);
4923 } PMAP_PAGE_BACKING_DONE
;
4927 * Set the physical protection on the specified range of this map
4928 * as requested. This function is typically only used for debug watchpoints
4931 * This function may not be called from an interrupt if the map is
4932 * not the kernel_pmap.
4934 * NOTE! For shared page table pages we just unmap the page.
4937 pmap_protect(pmap_t pmap
, vm_offset_t sva
, vm_offset_t eva
, vm_prot_t prot
)
4939 struct pmap_scan_info info
;
4940 /* JG review for NX */
4944 if ((prot
& (VM_PROT_READ
| VM_PROT_EXECUTE
)) == VM_PROT_NONE
) {
4945 pmap_remove(pmap
, sva
, eva
);
4948 if (prot
& VM_PROT_WRITE
)
4953 info
.func
= pmap_protect_callback
;
4955 pmap_scan(&info
, 1);
4960 pmap_protect_callback(pmap_t pmap
, struct pmap_scan_info
*info
,
4961 vm_pindex_t
*pte_placemark
,
4962 pv_entry_t pt_pv
, vm_offset_t va
,
4963 pt_entry_t
*ptep
, void *arg __unused
)
4973 if (pbits
& pmap
->pmap_bits
[PG_MANAGED_IDX
]) {
4974 cbits
&= ~pmap
->pmap_bits
[PG_A_IDX
];
4975 cbits
&= ~pmap
->pmap_bits
[PG_M_IDX
];
4977 /* else unmanaged page, adjust bits, no wire changes */
4980 cbits
&= ~pmap
->pmap_bits
[PG_RW_IDX
];
4982 if (pmap_enter_debug
> 0) {
4984 kprintf("pmap_protect va=%lx ptep=%p "
4985 "pt_pv=%p cbits=%08lx\n",
4986 va
, ptep
, pt_pv
, cbits
4990 if (pbits
!= cbits
) {
4991 if (!pmap_inval_smp_cmpset(pmap
, va
,
4992 ptep
, pbits
, cbits
)) {
4996 if (pbits
& pmap
->pmap_bits
[PG_MANAGED_IDX
]) {
4997 m
= PHYS_TO_VM_PAGE(pbits
& PG_FRAME
);
4998 if (pbits
& pmap
->pmap_bits
[PG_A_IDX
])
4999 vm_page_flag_set(m
, PG_REFERENCED
);
5000 if (pbits
& pmap
->pmap_bits
[PG_M_IDX
])
5004 pv_placemarker_wakeup(pmap
, pte_placemark
);
5008 * Insert the vm_page (m) at the virtual address (va), replacing any prior
5009 * mapping at that address. Set protection and wiring as requested.
5011 * If entry is non-NULL we check to see if the SEG_SIZE optimization is
5012 * possible. If it is we enter the page into the appropriate shared pmap
5013 * hanging off the related VM object instead of the passed pmap, then we
5014 * share the page table page from the VM object's pmap into the current pmap.
5016 * NOTE: This routine MUST insert the page into the pmap now, it cannot
5020 pmap_enter(pmap_t pmap
, vm_offset_t va
, vm_page_t m
, vm_prot_t prot
,
5021 boolean_t wired
, vm_map_entry_t entry
)
5023 pv_entry_t pt_pv
; /* page table */
5024 pv_entry_t pte_pv
; /* page table entry */
5025 vm_pindex_t
*pte_placemark
;
5037 va
= trunc_page(va
);
5038 #ifdef PMAP_DIAGNOSTIC
5040 panic("pmap_enter: toobig");
5041 if ((va
>= UPT_MIN_ADDRESS
) && (va
< UPT_MAX_ADDRESS
))
5042 panic("pmap_enter: invalid to pmap_enter page table "
5043 "pages (va: 0x%lx)", va
);
5045 if (va
< UPT_MAX_ADDRESS
&& pmap
== kernel_pmap
) {
5046 kprintf("Warning: pmap_enter called on UVA with "
5049 print_backtrace(-1);
5052 if (va
>= UPT_MAX_ADDRESS
&& pmap
!= kernel_pmap
) {
5053 kprintf("Warning: pmap_enter called on KVA without"
5056 print_backtrace(-1);
5061 * Get the locked page table page (pt_pv) for our new page table
5062 * entry, allocating it if necessary.
5064 * There is no pte_pv for a terminal pte so the terminal pte will
5065 * be locked via pte_placemark.
5067 * Only MMU actions by the CPU itself can modify the ptep out from
5070 * If the pmap is still being initialized we assume existing
5073 * NOTE: Kernel mapppings do not track page table pages
5074 * (i.e. there is no pt_pv pt_pv structure).
5076 * NOTE: origpte here is 'tentative', used only to check for
5077 * the degenerate case where the entry already exists and
5080 if (__predict_false(pmap_initialized
== FALSE
)) {
5083 pte_placemark
= NULL
;
5087 pte_pv
= pv_get(pmap
, pmap_pte_pindex(va
), &pte_placemark
);
5088 KKASSERT(pte_pv
== NULL
);
5089 if (va
>= VM_MAX_USER_ADDRESS
) {
5093 pt_pv
= pmap_allocpte(pmap
, pmap_pt_pindex(va
), NULL
);
5094 ptep
= pv_pte_lookup(pt_pv
, pmap_pte_index(va
));
5100 pa
= VM_PAGE_TO_PHYS(m
);
5103 * Calculate the new PTE.
5105 newpte
= (pt_entry_t
)(pa
| pte_prot(pmap
, prot
) |
5106 pmap
->pmap_bits
[PG_V_IDX
] | pmap
->pmap_bits
[PG_A_IDX
]);
5108 newpte
|= pmap
->pmap_bits
[PG_W_IDX
];
5109 if (va
< VM_MAX_USER_ADDRESS
)
5110 newpte
|= pmap
->pmap_bits
[PG_U_IDX
];
5111 if ((m
->flags
& PG_FICTITIOUS
) == 0)
5112 newpte
|= pmap
->pmap_bits
[PG_MANAGED_IDX
];
5113 // if (pmap == kernel_pmap)
5114 // newpte |= pgeflag;
5115 newpte
|= pmap
->pmap_cache_bits_pte
[m
->pat_mode
];
5118 * It is possible for multiple faults to occur in threaded
5119 * environments, the existing pte might be correct.
5121 if (((origpte
^ newpte
) &
5122 ~(pt_entry_t
)(pmap
->pmap_bits
[PG_M_IDX
] |
5123 pmap
->pmap_bits
[PG_A_IDX
])) == 0) {
5128 * Adjust page flags. The page is soft-busied or hard-busied, we
5129 * should be able to safely set PG_* flag bits even with the (shared)
5132 * The pmap_count and writeable_count is only tracked for
5133 * non-fictitious pages. As a bit of a safety, bump pmap_count
5134 * and set the PG_* bits before mapping the page. If another part
5135 * of the system does not properly hard-busy the page (against our
5136 * soft-busy or hard-busy) in order to remove mappings it might not
5137 * see the pte that we are about to add and thus will not be able to
5138 * drop pmap_count to 0.
5140 * The PG_MAPPED and PG_WRITEABLE flags are set for any type of page.
5142 * NOTE! PG_MAPPED and PG_WRITEABLE can only be cleared when
5143 * the page is hard-busied AND pmap_count is 0. This
5144 * interlocks our setting of the flags here.
5146 /*vm_page_spin_lock(m);*/
5149 * In advanced mode we keep track of single mappings verses
5150 * multiple mappings in order to avoid unnecessary vm_page_protect()
5151 * calls (particularly on the kernel_map).
5153 * If non-advanced mode we track the mapping count for similar effect.
5155 * Avoid modifying the vm_page as much as possible, conditionalize
5156 * updates to reduce cache line ping-ponging.
5162 if (newpte
& pmap
->pmap_bits
[PG_RW_IDX
])
5163 nflags
|= PG_WRITEABLE
;
5164 if (flags
& PG_MAPPED
)
5165 nflags
|= PG_MAPPEDMULTI
;
5166 if (flags
== (flags
| nflags
))
5168 if (atomic_fcmpset_int(&m
->flags
, &flags
, flags
| nflags
))
5171 /*vm_page_spin_unlock(m);*/
5174 * A race can develop when replacing an existing mapping. The new
5175 * page has been busied and the pte is placemark-locked, but the
5176 * old page could be ripped out from under us at any time by
5179 * If we do nothing, a concurrent backing scan may clear
5180 * PG_WRITEABLE and PG_MAPPED before we can act on oldm.
5182 opa
= origpte
& PG_FRAME
;
5183 if (opa
&& (origpte
& pmap
->pmap_bits
[PG_MANAGED_IDX
])) {
5184 oldm
= PHYS_TO_VM_PAGE(opa
);
5185 KKASSERT(opa
== oldm
->phys_addr
);
5186 KKASSERT(entry
!= NULL
);
5187 atomic_add_long(&oldm
->md
.interlock_count
, 1);
5193 * Swap the new and old PTEs and perform any necessary SMP
5196 if ((prot
& VM_PROT_NOSYNC
) || (opa
== 0 && pt_pv
!= NULL
)) {
5198 * Explicitly permitted to avoid pmap cpu mask synchronization
5199 * or the prior content of a non-kernel-related pmap was
5202 origpte
= atomic_swap_long(ptep
, newpte
);
5204 cpu_invlpg((void *)va
);
5207 * Not permitted to avoid pmap cpu mask synchronization
5208 * or there prior content being replaced or this is a kernel
5211 * Due to other kernel optimizations, we cannot assume a
5212 * 0->non_zero transition of *ptep can be done with a swap.
5214 origpte
= pmap_inval_smp(pmap
, va
, 1, ptep
, newpte
);
5216 opa
= origpte
& PG_FRAME
;
5219 if (pmap_enter_debug
> 0) {
5221 kprintf("pmap_enter: va=%lx m=%p origpte=%lx newpte=%lx ptep=%p"
5222 " pte_pv=%p pt_pv=%p opa=%lx prot=%02x\n",
5224 origpte
, newpte
, ptep
,
5225 pte_pv
, pt_pv
, opa
, prot
);
5230 * Account for the changes in the pt_pv and pmap.
5232 * Retain the same wiring count due to replacing an existing page,
5233 * or bump the wiring count for a new page.
5235 if (pt_pv
&& opa
== 0) {
5236 vm_page_wire_quick(pt_pv
->pv_m
);
5237 atomic_add_long(&pt_pv
->pv_pmap
->pm_stats
.resident_count
, 1);
5239 if (wired
&& (origpte
& pmap
->pmap_bits
[PG_W_IDX
]) == 0)
5240 atomic_add_long(&pmap
->pm_stats
.wired_count
, 1);
5243 * Account for the removal of the old page. pmap and pt_pv stats
5244 * have already been fully adjusted for both.
5246 * WARNING! oldm is not soft or hard-busied. The pte at worst can
5247 * only be removed out from under us since we hold the
5248 * placemarker. So if it is still there, it must not have
5251 * WARNING! A backing scan can clear PG_WRITEABLE and/or PG_MAPPED
5252 * and rip oldm away from us, possibly even freeing or
5253 * paging it, and not setting our dirtying below.
5255 * To deal with this, oldm->md.interlock_count is bumped
5256 * to indicate that we might (only might) have won the pte
5257 * swap race, and then released below.
5259 if (opa
&& (origpte
& pmap
->pmap_bits
[PG_MANAGED_IDX
])) {
5260 KKASSERT(oldm
== PHYS_TO_VM_PAGE(opa
));
5261 if (origpte
& pmap
->pmap_bits
[PG_M_IDX
])
5262 vm_page_dirty(oldm
);
5263 if (origpte
& pmap
->pmap_bits
[PG_A_IDX
])
5264 vm_page_flag_set(oldm
, PG_REFERENCED
);
5267 * NOTE: oldm is not hard-busied so it is not safe to
5268 * clear PG_MAPPED and PG_WRITEABLE on the 1->0
5269 * transition against them being set in
5272 pmap_removed_pte(oldm
, origpte
);
5275 if ((atomic_fetchadd_long(&oldm
->md
.interlock_count
, -1) &
5276 0x7FFFFFFFFFFFFFFFLU
) == 0x4000000000000001LU
) {
5277 atomic_clear_long(&oldm
->md
.interlock_count
,
5278 0x4000000000000000LU
);
5279 wakeup(&oldm
->md
.interlock_count
);
5284 KKASSERT((newpte
& pmap
->pmap_bits
[PG_MANAGED_IDX
]) == 0 ||
5285 (m
->flags
& PG_MAPPED
));
5288 * Cleanup the pv entry, allowing other accessors. If the new page
5289 * is not managed but we have a pte_pv (which was locking our
5290 * operation), we can free it now. pte_pv->pv_m should be NULL.
5293 pv_placemarker_wakeup(pmap
, pte_placemark
);
5299 * Make a temporary mapping for a physical address. This is only intended
5300 * to be used for panic dumps.
5302 * The caller is responsible for calling smp_invltlb().
5305 pmap_kenter_temporary(vm_paddr_t pa
, long i
)
5307 pmap_kenter_quick((vm_offset_t
)crashdumpmap
+ (i
* PAGE_SIZE
), pa
);
5308 return ((void *)crashdumpmap
);
5312 #define MAX_INIT_PT (96)
5315 * This routine preloads the ptes for a given object into the specified pmap.
5316 * This eliminates the blast of soft faults on process startup and
5317 * immediately after an mmap.
5319 static int pmap_object_init_pt_callback(vm_page_t p
, void *data
);
5323 pmap_object_init_pt(pmap_t pmap
, vm_map_entry_t entry
,
5324 vm_offset_t addr
, vm_size_t size
, int limit
)
5327 vm_prot_t prot
= entry
->protection
;
5328 vm_object_t object
= entry
->ba
.object
;
5329 vm_pindex_t pindex
= atop(entry
->ba
.offset
+ (addr
- entry
->ba
.start
));
5330 struct rb_vm_page_scan_info info
;
5335 * We can't preinit if read access isn't set or there is no pmap
5338 if ((prot
& VM_PROT_READ
) == 0 || pmap
== NULL
|| object
== NULL
)
5342 * We can't preinit if the pmap is not the current pmap
5344 lp
= curthread
->td_lwp
;
5345 if (lp
== NULL
|| pmap
!= vmspace_pmap(lp
->lwp_vmspace
))
5349 * Misc additional checks
5351 psize
= x86_64_btop(size
);
5353 if ((object
->type
!= OBJT_VNODE
) ||
5354 ((limit
& MAP_PREFAULT_PARTIAL
) && (psize
> MAX_INIT_PT
) &&
5355 (object
->resident_page_count
> MAX_INIT_PT
))) {
5359 if (pindex
+ psize
> object
->size
) {
5360 if (object
->size
< pindex
)
5362 psize
= object
->size
- pindex
;
5369 * If everything is segment-aligned do not pre-init here. Instead
5370 * allow the normal vm_fault path to pass a segment hint to
5371 * pmap_enter() which will then use an object-referenced shared
5374 if ((addr
& SEG_MASK
) == 0 &&
5375 (ctob(psize
) & SEG_MASK
) == 0 &&
5376 (ctob(pindex
) & SEG_MASK
) == 0) {
5381 * Use a red-black scan to traverse the requested range and load
5382 * any valid pages found into the pmap.
5384 * We cannot safely scan the object's memq without holding the
5387 info
.start_pindex
= pindex
;
5388 info
.end_pindex
= pindex
+ psize
- 1;
5393 info
.object
= object
;
5397 * By using the NOLK scan, the callback function must be sure
5398 * to return -1 if the VM page falls out of the object.
5400 vm_object_hold_shared(object
);
5401 vm_page_rb_tree_RB_SCAN_NOLK(&object
->rb_memq
, rb_vm_page_scancmp
,
5402 pmap_object_init_pt_callback
, &info
);
5403 vm_object_drop(object
);
5411 pmap_object_init_pt_callback(vm_page_t p
, void *data
)
5413 struct rb_vm_page_scan_info
*info
= data
;
5414 vm_pindex_t rel_index
;
5418 * don't allow an madvise to blow away our really
5419 * free pages allocating pv entries.
5421 if ((info
->limit
& MAP_PREFAULT_MADVISE
) &&
5422 vmstats
.v_free_count
< vmstats
.v_free_reserved
) {
5427 * Ignore list markers and ignore pages we cannot instantly
5428 * busy (while holding the object token).
5430 if (p
->flags
& PG_MARKER
)
5435 if (vm_page_busy_try(p
, TRUE
))
5438 if (vm_page_sbusy_try(p
))
5441 if (((p
->valid
& VM_PAGE_BITS_ALL
) == VM_PAGE_BITS_ALL
) &&
5442 (p
->flags
& PG_FICTITIOUS
) == 0) {
5443 if ((p
->queue
- p
->pc
) == PQ_CACHE
) {
5444 if (hard_busy
== 0) {
5445 vm_page_sbusy_drop(p
);
5449 vm_page_deactivate(p
);
5451 rel_index
= p
->pindex
- info
->start_pindex
;
5452 pmap_enter(info
->pmap
, info
->addr
+ x86_64_ptob(rel_index
), p
,
5453 VM_PROT_READ
, FALSE
, info
->entry
);
5458 vm_page_sbusy_drop(p
);
5461 * We are using an unlocked scan (that is, the scan expects its
5462 * current element to remain in the tree on return). So we have
5463 * to check here and abort the scan if it isn't.
5465 if (p
->object
!= info
->object
)
5474 * Return TRUE if the pmap is in shape to trivially pre-fault the specified
5477 * Returns FALSE if it would be non-trivial or if a pte is already loaded
5480 * The address must reside within a vm_map mapped range to ensure that the
5481 * page table doesn't get ripped out from under us.
5483 * XXX This is safe only because page table pages are not freed.
5486 pmap_prefault_ok(pmap_t pmap
, vm_offset_t addr
)
5490 /*spin_lock(&pmap->pm_spin);*/
5491 if ((pte
= pmap_pte(pmap
, addr
)) != NULL
) {
5492 if (*pte
& pmap
->pmap_bits
[PG_V_IDX
]) {
5493 /*spin_unlock(&pmap->pm_spin);*/
5497 /*spin_unlock(&pmap->pm_spin);*/
5502 * Change the wiring attribute for a pmap/va pair. The mapping must already
5503 * exist in the pmap. The mapping may or may not be managed. The wiring in
5504 * the page is not changed, the page is returned so the caller can adjust
5505 * its wiring (the page is not locked in any way).
5507 * Wiring is not a hardware characteristic so there is no need to invalidate
5508 * TLB. However, in an SMP environment we must use a locked bus cycle to
5509 * update the pte (if we are not using the pmap_inval_*() API that is)...
5510 * it's ok to do this for simple wiring changes.
5513 pmap_unwire(pmap_t pmap
, vm_offset_t va
)
5524 * Assume elements in the kernel pmap are stable
5526 if (pmap
== kernel_pmap
) {
5527 if (pmap_pt(pmap
, va
) == 0)
5529 ptep
= pmap_pte_quick(pmap
, va
);
5530 if (pmap_pte_v(pmap
, ptep
)) {
5531 if (pmap_pte_w(pmap
, ptep
))
5532 atomic_add_long(&pmap
->pm_stats
.wired_count
,-1);
5533 atomic_clear_long(ptep
, pmap
->pmap_bits
[PG_W_IDX
]);
5534 pa
= *ptep
& PG_FRAME
;
5535 m
= PHYS_TO_VM_PAGE(pa
);
5541 * We can only [un]wire pmap-local pages (we cannot wire
5544 pt_pv
= pv_get(pmap
, pmap_pt_pindex(va
), NULL
);
5548 ptep
= pv_pte_lookup(pt_pv
, pmap_pte_index(va
));
5549 if ((*ptep
& pmap
->pmap_bits
[PG_V_IDX
]) == 0) {
5554 if (pmap_pte_w(pmap
, ptep
)) {
5555 atomic_add_long(&pt_pv
->pv_pmap
->pm_stats
.wired_count
,
5558 /* XXX else return NULL so caller doesn't unwire m ? */
5560 atomic_clear_long(ptep
, pmap
->pmap_bits
[PG_W_IDX
]);
5562 pa
= *ptep
& PG_FRAME
;
5563 m
= PHYS_TO_VM_PAGE(pa
); /* held by wired count */
5570 * Copy the range specified by src_addr/len from the source map to
5571 * the range dst_addr/len in the destination map.
5573 * This routine is only advisory and need not do anything.
5576 pmap_copy(pmap_t dst_pmap
, pmap_t src_pmap
, vm_offset_t dst_addr
,
5577 vm_size_t len
, vm_offset_t src_addr
)
5584 * Zero the specified physical page.
5586 * This function may be called from an interrupt and no locking is
5590 pmap_zero_page(vm_paddr_t phys
)
5592 vm_offset_t va
= PHYS_TO_DMAP(phys
);
5594 pagezero((void *)va
);
5600 * Zero part of a physical page by mapping it into memory and clearing
5601 * its contents with bzero.
5603 * off and size may not cover an area beyond a single hardware page.
5606 pmap_zero_page_area(vm_paddr_t phys
, int off
, int size
)
5608 vm_offset_t virt
= PHYS_TO_DMAP(phys
);
5610 bzero((char *)virt
+ off
, size
);
5616 * Copy the physical page from the source PA to the target PA.
5617 * This function may be called from an interrupt. No locking
5621 pmap_copy_page(vm_paddr_t src
, vm_paddr_t dst
)
5623 vm_offset_t src_virt
, dst_virt
;
5625 src_virt
= PHYS_TO_DMAP(src
);
5626 dst_virt
= PHYS_TO_DMAP(dst
);
5627 bcopy((void *)src_virt
, (void *)dst_virt
, PAGE_SIZE
);
5631 * pmap_copy_page_frag:
5633 * Copy the physical page from the source PA to the target PA.
5634 * This function may be called from an interrupt. No locking
5638 pmap_copy_page_frag(vm_paddr_t src
, vm_paddr_t dst
, size_t bytes
)
5640 vm_offset_t src_virt
, dst_virt
;
5642 src_virt
= PHYS_TO_DMAP(src
);
5643 dst_virt
= PHYS_TO_DMAP(dst
);
5645 bcopy((char *)src_virt
+ (src
& PAGE_MASK
),
5646 (char *)dst_virt
+ (dst
& PAGE_MASK
),
5651 * Remove all pages from specified address space this aids process exit
5652 * speeds. Also, this code may be special cased for the current process
5656 pmap_remove_pages(pmap_t pmap
, vm_offset_t sva
, vm_offset_t eva
)
5658 pmap_remove_noinval(pmap
, sva
, eva
);
5663 * pmap_testbit tests bits in pte's note that the testbit/clearbit
5664 * routines are inline, and a lot of things compile-time evaluate.
5666 * Currently only used to test the 'M'odified bit. If the page
5667 * is not PG_WRITEABLE, the 'M'odified bit cannot be set and we
5668 * return immediately. Fictitious pages do not track this bit.
5672 pmap_testbit(vm_page_t m
, int bit
)
5676 if (__predict_false(!pmap_initialized
|| (m
->flags
& PG_FICTITIOUS
)))
5679 * Nothing to do if all the mappings are already read-only.
5680 * The page's [M]odify bits have already been synchronized
5681 * to the vm_page_t and cleaned out.
5683 if (bit
== PG_M_IDX
&& (m
->flags
& PG_WRITEABLE
) == 0)
5687 * Iterate the mapping
5689 PMAP_PAGE_BACKING_SCAN(m
, NULL
, ipmap
, iptep
, ipte
, iva
) {
5690 if (ipte
& ipmap
->pmap_bits
[bit
]) {
5694 } PMAP_PAGE_BACKING_DONE
;
5699 * This routine is used to modify bits in ptes. Only one bit should be
5700 * specified. PG_RW requires special handling. This call works with
5701 * any sort of mapped page. PG_FICTITIOUS pages might not be optimal.
5703 * Caller must NOT hold any spin locks
5704 * Caller must hold (m) hard-busied
5706 * NOTE: When clearing PG_M we could also (not implemented) drop
5707 * through to the PG_RW code and clear PG_RW too, forcing
5708 * a fault on write to redetect PG_M for virtual kernels, but
5709 * it isn't necessary since virtual kernels invalidate the
5710 * pte when they clear the VPTE_M bit in their virtual page
5713 * NOTE: Does not re-dirty the page when clearing only PG_M.
5715 * NOTE: Because we do not lock the pv, *pte can be in a state of
5716 * flux. Despite this the value of *pte is still somewhat
5717 * related while we hold the vm_page spin lock.
5719 * *pte can be zero due to this race. Since we are clearing
5720 * bits we basically do no harm when this race occurs.
5724 pmap_clearbit(vm_page_t m
, int bit_index
)
5731 * Too early in the boot
5733 if (__predict_false(!pmap_initialized
)) {
5734 if (bit_index
== PG_RW_IDX
)
5735 vm_page_flag_clear(m
, PG_WRITEABLE
);
5738 if ((m
->flags
& (PG_MAPPED
| PG_WRITEABLE
)) == 0)
5742 * Being asked to clear other random bits, we don't track them
5743 * so we have to iterate.
5745 * pmap_clear_reference() is called (into here) with the page
5746 * hard-busied to check whether the page is still mapped and
5747 * will clear PG_MAPPED and PG_WRITEABLE if it isn't.
5749 if (bit_index
!= PG_RW_IDX
) {
5755 PMAP_PAGE_BACKING_SCAN(m
, NULL
, ipmap
, iptep
, ipte
, iva
) {
5759 if (ipte
& ipmap
->pmap_bits
[bit_index
]) {
5760 atomic_clear_long(iptep
,
5761 ipmap
->pmap_bits
[bit_index
]);
5763 } PMAP_PAGE_BACKING_DONE
;
5766 icount
= atomic_fetchadd_long(&m
->md
.interlock_count
,
5767 0x8000000000000000LU
);
5768 if ((icount
& 0x3FFFFFFFFFFFFFFFLU
) == 0) {
5769 vm_page_flag_clear(m
, PG_MAPPED
|
5779 * Being asked to clear the RW bit.
5781 * Nothing to do if all the mappings are already read-only
5783 if ((m
->flags
& PG_WRITEABLE
) == 0)
5787 * Iterate the mappings and check.
5789 retry
= ticks
+ hz
* 60;
5792 * Clear PG_RW. This also clears PG_M and marks the page dirty if
5795 * Since the caller holds the page hard-busied we can safely clear
5796 * PG_WRITEABLE, and callers expect us to for the PG_RW_IDX path.
5798 PMAP_PAGE_BACKING_SCAN(m
, NULL
, ipmap
, iptep
, ipte
, iva
) {
5800 if ((ipte
& ipmap
->pmap_bits
[PG_MANAGED_IDX
]) == 0)
5803 if ((ipte
& ipmap
->pmap_bits
[PG_RW_IDX
]) == 0)
5805 npte
= ipte
& ~(ipmap
->pmap_bits
[PG_RW_IDX
] |
5806 ipmap
->pmap_bits
[PG_M_IDX
]);
5807 if (!pmap_inval_smp_cmpset(ipmap
, iva
, iptep
, ipte
, npte
))
5808 PMAP_PAGE_BACKING_RETRY
;
5809 if (ipte
& ipmap
->pmap_bits
[PG_M_IDX
])
5813 * NOTE: m is not hard-busied so it is not safe to
5814 * clear PG_WRITEABLE on the 1->0 transition
5815 * against it being set in pmap_enter().
5817 * pmap_count and writeable_count are only applicable
5818 * to non-fictitious pages (PG_MANAGED_IDX from pte)
5820 } PMAP_PAGE_BACKING_DONE
;
5823 * If our scan lost a pte swap race oldm->md.interlock_count might
5824 * be set from the pmap_enter() code. If so sleep a little and try
5827 * Use an atomic op to access interlock_count to ensure ordering.
5829 icount
= atomic_fetchadd_long(&m
->md
.interlock_count
,
5830 0x8000000000000000LU
) +
5831 0x8000000000000000LU
;
5833 while (icount
& 0x3FFFFFFFFFFFFFFFLU
) {
5834 tsleep_interlock(&m
->md
.interlock_count
, 0);
5835 if (atomic_fcmpset_long(&m
->md
.interlock_count
, &icount
,
5836 icount
| 0x4000000000000000LU
)) {
5837 tsleep(&m
->md
.interlock_count
, PINTERLOCKED
,
5839 icount
= m
->md
.interlock_count
;
5840 if (retry
- ticks
> 0)
5842 panic("pmap_clearbit: cannot return interlock_count "
5844 m
, m
->md
.interlock_count
);
5847 vm_page_flag_clear(m
, PG_WRITEABLE
);
5851 * Lower the permission for all mappings to a given page.
5853 * Page must be hard-busied by caller. Because the page is busied by the
5854 * caller, this should not be able to race a pmap_enter().
5857 pmap_page_protect(vm_page_t m
, vm_prot_t prot
)
5859 /* JG NX support? */
5860 if ((prot
& VM_PROT_WRITE
) == 0) {
5861 if (prot
& (VM_PROT_READ
| VM_PROT_EXECUTE
)) {
5863 * NOTE: pmap_clearbit(.. PG_RW) also clears
5864 * the PG_WRITEABLE flag in (m).
5866 pmap_clearbit(m
, PG_RW_IDX
);
5874 pmap_phys_address(vm_pindex_t ppn
)
5876 return (x86_64_ptob(ppn
));
5880 * Return a count of reference bits for a page, clearing those bits.
5881 * It is not necessary for every reference bit to be cleared, but it
5882 * is necessary that 0 only be returned when there are truly no
5883 * reference bits set.
5885 * XXX: The exact number of bits to check and clear is a matter that
5886 * should be tested and standardized at some point in the future for
5887 * optimal aging of shared pages.
5889 * This routine may not block.
5892 pmap_ts_referenced(vm_page_t m
)
5897 if (__predict_false(!pmap_initialized
|| (m
->flags
& PG_FICTITIOUS
)))
5899 PMAP_PAGE_BACKING_SCAN(m
, NULL
, ipmap
, iptep
, ipte
, iva
) {
5900 if (ipte
& ipmap
->pmap_bits
[PG_A_IDX
]) {
5901 npte
= ipte
& ~ipmap
->pmap_bits
[PG_A_IDX
];
5902 if (!atomic_cmpset_long(iptep
, ipte
, npte
))
5903 PMAP_PAGE_BACKING_RETRY
;
5908 } PMAP_PAGE_BACKING_DONE
;
5915 * Return whether or not the specified physical page was modified
5916 * in any physical maps.
5919 pmap_is_modified(vm_page_t m
)
5923 res
= pmap_testbit(m
, PG_M_IDX
);
5928 * Clear the modify bit on the vm_page.
5930 * The page must be hard-busied.
5933 pmap_clear_modify(vm_page_t m
)
5935 pmap_clearbit(m
, PG_M_IDX
);
5939 * pmap_clear_reference:
5941 * Clear the reference bit on the specified physical page.
5944 pmap_clear_reference(vm_page_t m
)
5946 pmap_clearbit(m
, PG_A_IDX
);
5950 * Miscellaneous support routines follow
5955 x86_64_protection_init(void)
5961 * NX supported? (boot time loader.conf override only)
5963 * -1 Automatic (sets mode 1)
5965 * 1 NX implemented, differentiates PROT_READ vs PROT_READ|PROT_EXEC
5966 * 2 NX implemented for all cases
5968 TUNABLE_INT_FETCH("machdep.pmap_nx_enable", &pmap_nx_enable
);
5969 if ((amd_feature
& AMDID_NX
) == 0) {
5970 pmap_bits_default
[PG_NX_IDX
] = 0;
5972 } else if (pmap_nx_enable
< 0) {
5973 pmap_nx_enable
= 1; /* default to mode 1 (READ) */
5977 * 0 is basically read-only access, but also set the NX (no-execute)
5978 * bit when VM_PROT_EXECUTE is not specified.
5980 kp
= protection_codes
;
5981 for (prot
= 0; prot
< PROTECTION_CODES_SIZE
; prot
++) {
5983 case VM_PROT_NONE
| VM_PROT_NONE
| VM_PROT_NONE
:
5985 * This case handled elsewhere
5989 case VM_PROT_READ
| VM_PROT_NONE
| VM_PROT_NONE
:
5991 * Read-only is 0|NX (pmap_nx_enable mode >= 1)
5993 if (pmap_nx_enable
>= 1)
5994 *kp
= pmap_bits_default
[PG_NX_IDX
];
5996 case VM_PROT_READ
| VM_PROT_NONE
| VM_PROT_EXECUTE
:
5997 case VM_PROT_NONE
| VM_PROT_NONE
| VM_PROT_EXECUTE
:
5999 * Execute requires read access
6003 case VM_PROT_NONE
| VM_PROT_WRITE
| VM_PROT_NONE
:
6004 case VM_PROT_READ
| VM_PROT_WRITE
| VM_PROT_NONE
:
6006 * Write without execute is RW|NX
6007 * (pmap_nx_enable mode >= 2)
6009 *kp
= pmap_bits_default
[PG_RW_IDX
];
6010 if (pmap_nx_enable
>= 2)
6011 *kp
|= pmap_bits_default
[PG_NX_IDX
];
6013 case VM_PROT_READ
| VM_PROT_WRITE
| VM_PROT_EXECUTE
:
6014 case VM_PROT_NONE
| VM_PROT_WRITE
| VM_PROT_EXECUTE
:
6016 * Write with execute is RW
6018 *kp
= pmap_bits_default
[PG_RW_IDX
];
6026 * Map a set of physical memory pages into the kernel virtual
6027 * address space. Return a pointer to where it is mapped. This
6028 * routine is intended to be used for mapping device memory,
6031 * NOTE: We can't use pgeflag unless we invalidate the pages one at
6034 * NOTE: The PAT attributes {WRITE_BACK, WRITE_THROUGH, UNCACHED, UNCACHEABLE}
6035 * work whether the cpu supports PAT or not. The remaining PAT
6036 * attributes {WRITE_PROTECTED, WRITE_COMBINING} only work if the cpu
6040 pmap_mapdev(vm_paddr_t pa
, vm_size_t size
)
6042 return(pmap_mapdev_attr(pa
, size
, PAT_WRITE_BACK
));
6046 pmap_mapdev_uncacheable(vm_paddr_t pa
, vm_size_t size
)
6048 return(pmap_mapdev_attr(pa
, size
, PAT_UNCACHEABLE
));
6052 pmap_mapbios(vm_paddr_t pa
, vm_size_t size
)
6054 return (pmap_mapdev_attr(pa
, size
, PAT_WRITE_BACK
));
6058 * Map a set of physical memory pages into the kernel virtual
6059 * address space. Return a pointer to where it is mapped. This
6060 * routine is intended to be used for mapping device memory,
6064 pmap_mapdev_attr(vm_paddr_t pa
, vm_size_t size
, int mode
)
6066 vm_offset_t va
, tmpva
, offset
;
6070 offset
= pa
& PAGE_MASK
;
6071 size
= roundup(offset
+ size
, PAGE_SIZE
);
6073 va
= kmem_alloc_nofault(kernel_map
, size
, VM_SUBSYS_MAPDEV
, PAGE_SIZE
);
6075 panic("pmap_mapdev: Couldn't alloc kernel virtual memory");
6077 pa
= pa
& ~PAGE_MASK
;
6078 for (tmpva
= va
, tmpsize
= size
; tmpsize
> 0;) {
6079 pte
= vtopte(tmpva
);
6081 kernel_pmap
->pmap_bits
[PG_RW_IDX
] |
6082 kernel_pmap
->pmap_bits
[PG_V_IDX
] | /* pgeflag | */
6083 kernel_pmap
->pmap_cache_bits_pte
[mode
];
6084 tmpsize
-= PAGE_SIZE
;
6088 pmap_invalidate_range(kernel_pmap
, va
, va
+ size
);
6089 pmap_invalidate_cache_range(va
, va
+ size
);
6091 return ((void *)(va
+ offset
));
6095 pmap_unmapdev(vm_offset_t va
, vm_size_t size
)
6097 vm_offset_t base
, offset
;
6099 base
= va
& ~PAGE_MASK
;
6100 offset
= va
& PAGE_MASK
;
6101 size
= roundup(offset
+ size
, PAGE_SIZE
);
6102 pmap_qremove(va
, size
>> PAGE_SHIFT
);
6103 kmem_free(kernel_map
, base
, size
);
6107 * Sets the memory attribute for the specified page.
6110 pmap_page_set_memattr(vm_page_t m
, vm_memattr_t ma
)
6116 * If "m" is a normal page, update its direct mapping. This update
6117 * can be relied upon to perform any cache operations that are
6118 * required for data coherence.
6120 if ((m
->flags
& PG_FICTITIOUS
) == 0)
6121 pmap_change_attr(PHYS_TO_DMAP(VM_PAGE_TO_PHYS(m
)), 1, m
->pat_mode
);
6125 * Change the PAT attribute on an existing kernel memory map. Caller
6126 * must ensure that the virtual memory in question is not accessed
6127 * during the adjustment.
6129 * If the va is within the DMAP we cannot use vtopte() because the DMAP
6130 * utilizes 2MB or 1GB pages. 2MB is forced atm so calculate the pd_entry
6131 * pointer based on that.
6134 pmap_change_attr(vm_offset_t va
, vm_size_t count
, int mode
)
6141 panic("pmap_change_attr: va is NULL");
6142 base
= trunc_page(va
);
6144 if (va
>= DMAP_MIN_ADDRESS
&& va
< DMAP_MAX_ADDRESS
) {
6147 KKASSERT(va
< DMapMaxAddress
);
6148 pd
= (pd_entry_t
*)PHYS_TO_DMAP(DMPDphys
);
6149 pd
+= (va
- DMAP_MIN_ADDRESS
) >> PDRSHIFT
;
6151 while ((long)count
> 0) {
6153 (*pd
& ~(pd_entry_t
)(kernel_pmap
->pmap_cache_mask_pde
)) |
6154 kernel_pmap
->pmap_cache_bits_pde
[mode
];
6155 count
-= NBPDR
/ PAGE_SIZE
;
6163 (*pte
& ~(pt_entry_t
)(kernel_pmap
->pmap_cache_mask_pte
)) |
6164 kernel_pmap
->pmap_cache_bits_pte
[mode
];
6170 changed
= 1; /* XXX: not optimal */
6173 * Flush CPU caches if required to make sure any data isn't cached that
6174 * shouldn't be, etc.
6177 pmap_invalidate_range(kernel_pmap
, base
, va
);
6178 pmap_invalidate_cache_range(base
, va
);
6183 * perform the pmap work for mincore
6186 pmap_mincore(pmap_t pmap
, vm_offset_t addr
)
6188 pt_entry_t
*ptep
, pte
;
6192 ptep
= pmap_pte(pmap
, addr
);
6194 if (ptep
&& (pte
= *ptep
) != 0) {
6197 val
= MINCORE_INCORE
;
6198 pa
= pte
& PG_FRAME
;
6199 if (pte
& pmap
->pmap_bits
[PG_MANAGED_IDX
])
6200 m
= PHYS_TO_VM_PAGE(pa
);
6207 if (pte
& pmap
->pmap_bits
[PG_M_IDX
])
6208 val
|= MINCORE_MODIFIED
|MINCORE_MODIFIED_OTHER
;
6211 * Modified by someone
6213 else if (m
&& (m
->dirty
|| pmap_is_modified(m
)))
6214 val
|= MINCORE_MODIFIED_OTHER
;
6217 * Referenced by us, or someone else.
6219 if (pte
& pmap
->pmap_bits
[PG_A_IDX
]) {
6220 val
|= MINCORE_REFERENCED
|MINCORE_REFERENCED_OTHER
;
6221 } else if (m
&& ((m
->flags
& PG_REFERENCED
) ||
6222 pmap_ts_referenced(m
))) {
6223 val
|= MINCORE_REFERENCED_OTHER
;
6224 vm_page_flag_set(m
, PG_REFERENCED
);
6231 * Replace p->p_vmspace with a new one. If adjrefs is non-zero the new
6232 * vmspace will be ref'd and the old one will be deref'd.
6234 * The vmspace for all lwps associated with the process will be adjusted
6235 * and cr3 will be reloaded if any lwp is the current lwp.
6237 * The process must hold the vmspace->vm_map.token for oldvm and newvm
6240 pmap_replacevm(struct proc
*p
, struct vmspace
*newvm
, int adjrefs
)
6242 struct vmspace
*oldvm
;
6245 oldvm
= p
->p_vmspace
;
6246 if (oldvm
!= newvm
) {
6249 p
->p_vmspace
= newvm
;
6250 KKASSERT(p
->p_nthreads
== 1);
6251 lp
= RB_ROOT(&p
->p_lwp_tree
);
6252 pmap_setlwpvm(lp
, newvm
);
6259 * Set the vmspace for a LWP. The vmspace is almost universally set the
6260 * same as the process vmspace, but virtual kernels need to swap out contexts
6261 * on a per-lwp basis.
6263 * Caller does not necessarily hold any vmspace tokens. Caller must control
6264 * the lwp (typically be in the context of the lwp). We use a critical
6265 * section to protect against statclock and hardclock (statistics collection).
6268 pmap_setlwpvm(struct lwp
*lp
, struct vmspace
*newvm
)
6270 struct vmspace
*oldvm
;
6274 oldvm
= lp
->lwp_vmspace
;
6276 if (oldvm
!= newvm
) {
6279 KKASSERT((newvm
->vm_refcnt
& VM_REF_DELETED
) == 0);
6280 lp
->lwp_vmspace
= newvm
;
6281 if (td
->td_lwp
== lp
) {
6282 pmap
= vmspace_pmap(newvm
);
6283 ATOMIC_CPUMASK_ORBIT(pmap
->pm_active
, mycpu
->gd_cpuid
);
6284 if (pmap
->pm_active_lock
& CPULOCK_EXCL
)
6285 pmap_interlock_wait(newvm
);
6286 #if defined(SWTCH_OPTIM_STATS)
6289 if (pmap
->pmap_bits
[TYPE_IDX
] == REGULAR_PMAP
) {
6290 td
->td_pcb
->pcb_cr3
= vtophys(pmap
->pm_pml4
);
6291 if (meltdown_mitigation
&& pmap
->pm_pmlpv_iso
) {
6292 td
->td_pcb
->pcb_cr3_iso
=
6293 vtophys(pmap
->pm_pml4_iso
);
6294 td
->td_pcb
->pcb_flags
|= PCB_ISOMMU
;
6296 td
->td_pcb
->pcb_cr3_iso
= 0;
6297 td
->td_pcb
->pcb_flags
&= ~PCB_ISOMMU
;
6299 } else if (pmap
->pmap_bits
[TYPE_IDX
] == EPT_PMAP
) {
6300 td
->td_pcb
->pcb_cr3
= KPML4phys
;
6301 td
->td_pcb
->pcb_cr3_iso
= 0;
6302 td
->td_pcb
->pcb_flags
&= ~PCB_ISOMMU
;
6304 panic("pmap_setlwpvm: unknown pmap type\n");
6308 * The MMU separation fields needs to be updated.
6309 * (it can't access the pcb directly from the
6310 * restricted user pmap).
6313 struct trampframe
*tramp
;
6315 tramp
= &pscpu
->trampoline
;
6316 tramp
->tr_pcb_cr3
= td
->td_pcb
->pcb_cr3
;
6317 tramp
->tr_pcb_cr3_iso
= td
->td_pcb
->pcb_cr3_iso
;
6318 tramp
->tr_pcb_flags
= td
->td_pcb
->pcb_flags
;
6319 tramp
->tr_pcb_rsp
= (register_t
)td
->td_pcb
;
6320 /* tr_pcb_rsp doesn't change */
6324 * In kernel-land we always use the normal PML4E
6325 * so the kernel is fully mapped and can also access
6328 load_cr3(td
->td_pcb
->pcb_cr3
);
6329 pmap
= vmspace_pmap(oldvm
);
6330 ATOMIC_CPUMASK_NANDBIT(pmap
->pm_active
,
6338 * Used to control the backing vmspace on the host for a guest VM.
6339 * The cpumask is needed by the host pager to properly invalidate the
6340 * host TLB when paging out the backing memory of a guest VM.
6342 * NOTE: The scheduler might somtimes overload multiple vCPUs on the
6343 * same physical cpu, so operating is not quite as simple as
6344 * calling add_cpu/del_cpu in the core vmrun routines.
6347 pmap_add_cpu(struct vmspace
*vm
, int cpuid
)
6349 ATOMIC_CPUMASK_ORBIT(vm
->vm_pmap
.pm_active
, mycpu
->gd_cpuid
);
6351 pmap_interlock_wait(vm
);
6356 pmap_del_cpu(struct vmspace
*vm
, int cpuid
)
6358 ATOMIC_CPUMASK_NANDBIT(vm
->vm_pmap
.pm_active
, mycpu
->gd_cpuid
);
6362 pmap_del_all_cpus(struct vmspace
*vm
)
6364 CPUMASK_ASSZERO(vm
->vm_pmap
.pm_active
);
6368 * Called when switching to a locked pmap, used to interlock against pmaps
6369 * undergoing modifications to prevent us from activating the MMU for the
6370 * target pmap until all such modifications have completed. We have to do
6371 * this because the thread making the modifications has already set up its
6372 * SMP synchronization mask.
6374 * This function cannot sleep!
6379 pmap_interlock_wait(struct vmspace
*vm
)
6381 struct pmap
*pmap
= &vm
->vm_pmap
;
6383 if (pmap
->pm_active_lock
& CPULOCK_EXCL
) {
6385 KKASSERT(curthread
->td_critcount
>= 2);
6386 DEBUG_PUSH_INFO("pmap_interlock_wait");
6387 while (pmap
->pm_active_lock
& CPULOCK_EXCL
) {
6389 lwkt_process_ipiq();
6397 pmap_addr_hint(vm_object_t obj
, vm_offset_t addr
, vm_size_t size
)
6400 if ((obj
== NULL
) || (size
< NBPDR
) ||
6401 ((obj
->type
!= OBJT_DEVICE
) && (obj
->type
!= OBJT_MGTDEVICE
))) {
6405 addr
= roundup2(addr
, NBPDR
);
6410 * Used by kmalloc/kfree, page already exists at va
6413 pmap_kvtom(vm_offset_t va
)
6415 pt_entry_t
*ptep
= vtopte(va
);
6417 return(PHYS_TO_VM_PAGE(*ptep
& PG_FRAME
));
6421 * Initialize machine-specific shared page directory support. This
6422 * is executed when a VM object is created.
6425 pmap_object_init(vm_object_t object
)
6430 * Clean up machine-specific shared page directory support. This
6431 * is executed when a VM object is destroyed.
6434 pmap_object_free(vm_object_t object
)
6439 * pmap_pgscan_callback - Used by pmap_pgscan to acquire the related
6440 * VM page and issue a pginfo->callback.
6444 pmap_pgscan_callback(pmap_t pmap
, struct pmap_scan_info
*info
,
6445 vm_pindex_t
*pte_placemark
,
6446 pv_entry_t pt_pv
, vm_offset_t va
,
6447 pt_entry_t
*ptep
, void *arg
)
6449 struct pmap_pgscan_info
*pginfo
= arg
;
6456 if (pte
& pmap
->pmap_bits
[PG_MANAGED_IDX
]) {
6458 * Try to busy the page while we hold the pte_placemark locked.
6460 m
= PHYS_TO_VM_PAGE(*ptep
& PG_FRAME
);
6461 if (vm_page_busy_try(m
, TRUE
) == 0) {
6462 if (m
== PHYS_TO_VM_PAGE(*ptep
& PG_FRAME
)) {
6464 * The callback is issued with the pt_pv
6467 pv_placemarker_wakeup(pmap
, pte_placemark
);
6469 vm_page_wire_quick(pt_pv
->pv_m
);
6472 if (pginfo
->callback(pginfo
, va
, m
) < 0)
6476 if (vm_page_unwire_quick(pt_pv
->pv_m
)) {
6477 panic("pmap_pgscan: bad wire_"
6483 pv_placemarker_wakeup(pmap
, pte_placemark
);
6486 ++pginfo
->busycount
;
6487 pv_placemarker_wakeup(pmap
, pte_placemark
);
6491 * Shared page table or unmanaged page (sharept or !sharept)
6493 pv_placemarker_wakeup(pmap
, pte_placemark
);
6498 pmap_pgscan(struct pmap_pgscan_info
*pginfo
)
6500 struct pmap_scan_info info
;
6502 pginfo
->offset
= pginfo
->beg_addr
;
6503 info
.pmap
= pginfo
->pmap
;
6504 info
.sva
= pginfo
->beg_addr
;
6505 info
.eva
= pginfo
->end_addr
;
6506 info
.func
= pmap_pgscan_callback
;
6508 pmap_scan(&info
, 0);
6510 pginfo
->offset
= pginfo
->end_addr
;
6514 * Wait for a placemarker that we do not own to clear. The placemarker
6515 * in question is not necessarily set to the pindex we want, we may have
6516 * to wait on the element because we want to reserve it ourselves.
6518 * NOTE: PM_PLACEMARK_WAKEUP sets a bit which is already set in
6519 * PM_NOPLACEMARK, so it does not interfere with placemarks
6520 * which have already been woken up.
6522 * NOTE: This routine is called without the pmap spin-lock and so can
6523 * race changes to *pmark. Due to the sensitivity of the routine
6524 * to possible MULTIPLE interactions from other cpus, and the
6525 * overloading of the WAKEUP bit on PM_NOPLACEMARK, we have to
6526 * use a cmpset loop to avoid a race that might cause the WAKEUP
6529 * Caller is expected to retry its operation upon return.
6533 pv_placemarker_wait(pmap_t pmap
, vm_pindex_t
*pmark
)
6539 while (mark
!= PM_NOPLACEMARK
) {
6540 tsleep_interlock(pmark
, 0);
6541 if (atomic_fcmpset_long(pmark
, &mark
,
6542 mark
| PM_PLACEMARK_WAKEUP
)) {
6543 tsleep(pmark
, PINTERLOCKED
, "pvplw", 0);
6550 * Wakeup a placemarker that we own. Replace the entry with
6551 * PM_NOPLACEMARK and issue a wakeup() if necessary.
6555 pv_placemarker_wakeup(pmap_t pmap
, vm_pindex_t
*pmark
)
6559 pindex
= atomic_swap_long(pmark
, PM_NOPLACEMARK
);
6560 KKASSERT(pindex
!= PM_NOPLACEMARK
);
6561 if (pindex
& PM_PLACEMARK_WAKEUP
)