2 * Copyright (c) 1991 Regents of the University of California.
4 * Copyright (c) 1994 John S. Dyson
6 * Copyright (c) 1994 David Greenman
8 * Copyright (c) 2005-2010 Alan L. Cox <alc@cs.rice.edu>
11 * This code is derived from software contributed to Berkeley by
12 * the Systems Programming Group of the University of Utah Computer
13 * Science Department and William Jolitz of UUNET Technologies Inc.
15 * Redistribution and use in source and binary forms, with or without
16 * modification, are permitted provided that the following conditions
18 * 1. Redistributions of source code must retain the above copyright
19 * notice, this list of conditions and the following disclaimer.
20 * 2. Redistributions in binary form must reproduce the above copyright
21 * notice, this list of conditions and the following disclaimer in the
22 * documentation and/or other materials provided with the distribution.
23 * 3. All advertising materials mentioning features or use of this software
24 * must display the following acknowledgement:
25 * This product includes software developed by the University of
26 * California, Berkeley and its contributors.
27 * 4. Neither the name of the University nor the names of its contributors
28 * may be used to endorse or promote products derived from this software
29 * without specific prior written permission.
31 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
32 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
33 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
34 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
35 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
36 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
37 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
38 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
39 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
40 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
43 * from: @(#)pmap.c 7.7 (Berkeley) 5/12/91
46 * Copyright (c) 2003 Networks Associates Technology, Inc.
47 * All rights reserved.
49 * This software was developed for the FreeBSD Project by Jake Burkholder,
50 * Safeport Network Services, and Network Associates Laboratories, the
51 * Security Research Division of Network Associates, Inc. under
52 * DARPA/SPAWAR contract N66001-01-C-8035 ("CBOSS"), as part of the DARPA
53 * CHATS research program.
55 * Redistribution and use in source and binary forms, with or without
56 * modification, are permitted provided that the following conditions
58 * 1. Redistributions of source code must retain the above copyright
59 * notice, this list of conditions and the following disclaimer.
60 * 2. Redistributions in binary form must reproduce the above copyright
61 * notice, this list of conditions and the following disclaimer in the
62 * documentation and/or other materials provided with the distribution.
64 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
65 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
66 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
67 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
68 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
69 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
70 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
71 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
72 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
73 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
77 #include <sys/cdefs.h>
78 __FBSDID("$FreeBSD$");
81 * Manages physical address maps.
83 * Since the information managed by this module is
84 * also stored by the logical address mapping module,
85 * this module may throw away valid virtual-to-physical
86 * mappings at almost any time. However, invalidations
87 * of virtual-to-physical mappings must be done as
90 * In order to cope with hardware architectures which
91 * make virtual-to-physical map invalidates expensive,
92 * this module may delay invalidate or reduced protection
93 * operations until such time as they are actually
94 * necessary. This module is given full information as
95 * to which processors are currently using which maps,
96 * and to when physical maps must be made correct.
101 #include "opt_pmap.h"
103 #include "opt_xbox.h"
105 #include <sys/param.h>
106 #include <sys/systm.h>
107 #include <sys/kernel.h>
109 #include <sys/lock.h>
110 #include <sys/malloc.h>
111 #include <sys/mman.h>
112 #include <sys/msgbuf.h>
113 #include <sys/mutex.h>
114 #include <sys/proc.h>
115 #include <sys/rwlock.h>
116 #include <sys/sf_buf.h>
118 #include <sys/vmmeter.h>
119 #include <sys/sched.h>
120 #include <sys/sysctl.h>
124 #include <vm/vm_param.h>
125 #include <vm/vm_kern.h>
126 #include <vm/vm_page.h>
127 #include <vm/vm_map.h>
128 #include <vm/vm_object.h>
129 #include <vm/vm_extern.h>
130 #include <vm/vm_pageout.h>
131 #include <vm/vm_pager.h>
132 #include <vm/vm_phys.h>
133 #include <vm/vm_radix.h>
134 #include <vm/vm_reserv.h>
139 #include <machine/intr_machdep.h>
140 #include <x86/apicvar.h>
142 #include <machine/cpu.h>
143 #include <machine/cputypes.h>
144 #include <machine/md_var.h>
145 #include <machine/pcb.h>
146 #include <machine/specialreg.h>
148 #include <machine/smp.h>
152 #include <machine/xbox.h>
155 #ifndef PMAP_SHPGPERPROC
156 #define PMAP_SHPGPERPROC 200
159 #if !defined(DIAGNOSTIC)
160 #ifdef __GNUC_GNU_INLINE__
161 #define PMAP_INLINE __attribute__((__gnu_inline__)) inline
163 #define PMAP_INLINE extern inline
170 #define PV_STAT(x) do { x ; } while (0)
172 #define PV_STAT(x) do { } while (0)
175 #define pa_index(pa) ((pa) >> PDRSHIFT)
176 #define pa_to_pvh(pa) (&pv_table[pa_index(pa)])
179 * Get PDEs and PTEs for user/kernel address space
181 #define pmap_pde(m, v) (&((m)->pm_pdir[(vm_offset_t)(v) >> PDRSHIFT]))
182 #define pdir_pde(m, v) (m[(vm_offset_t)(v) >> PDRSHIFT])
184 #define pmap_pde_v(pte) ((*(int *)pte & PG_V) != 0)
185 #define pmap_pte_w(pte) ((*(int *)pte & PG_W) != 0)
186 #define pmap_pte_m(pte) ((*(int *)pte & PG_M) != 0)
187 #define pmap_pte_u(pte) ((*(int *)pte & PG_A) != 0)
188 #define pmap_pte_v(pte) ((*(int *)pte & PG_V) != 0)
190 #define pmap_pte_set_w(pte, v) ((v) ? atomic_set_int((u_int *)(pte), PG_W) : \
191 atomic_clear_int((u_int *)(pte), PG_W))
192 #define pmap_pte_set_prot(pte, v) ((*(int *)pte &= ~PG_PROT), (*(int *)pte |= (v)))
194 struct pmap kernel_pmap_store;
195 LIST_HEAD(pmaplist, pmap);
196 static struct pmaplist allpmaps;
197 static struct mtx allpmaps_lock;
199 vm_offset_t virtual_avail; /* VA of first avail page (after kernel bss) */
200 vm_offset_t virtual_end; /* VA of last avail page (end of kernel AS) */
201 int pgeflag = 0; /* PG_G or-in */
202 int pseflag = 0; /* PG_PS or-in */
204 static int nkpt = NKPT;
205 vm_offset_t kernel_vm_end = KERNBASE + NKPT * NBPDR;
206 extern u_int32_t KERNend;
207 extern u_int32_t KPTphys;
209 #if defined(PAE) || defined(PAE_TABLES)
211 static uma_zone_t pdptzone;
214 static SYSCTL_NODE(_vm, OID_AUTO, pmap, CTLFLAG_RD, 0, "VM/pmap parameters");
216 static int pat_works = 1;
217 SYSCTL_INT(_vm_pmap, OID_AUTO, pat_works, CTLFLAG_RD, &pat_works, 1,
218 "Is page attribute table fully functional?");
220 static int pg_ps_enabled = 1;
221 SYSCTL_INT(_vm_pmap, OID_AUTO, pg_ps_enabled, CTLFLAG_RDTUN | CTLFLAG_NOFETCH,
222 &pg_ps_enabled, 0, "Are large page mappings enabled?");
224 #define PAT_INDEX_SIZE 8
225 static int pat_index[PAT_INDEX_SIZE]; /* cache mode to PAT index conversion */
228 * pmap_mapdev support pre initialization (i.e. console)
230 #define PMAP_PREINIT_MAPPING_COUNT 8
231 static struct pmap_preinit_mapping {
236 } pmap_preinit_mapping[PMAP_PREINIT_MAPPING_COUNT];
237 static int pmap_initialized;
239 static struct rwlock_padalign pvh_global_lock;
242 * Data for the pv entry allocation mechanism
244 static TAILQ_HEAD(pch, pv_chunk) pv_chunks = TAILQ_HEAD_INITIALIZER(pv_chunks);
245 static int pv_entry_count = 0, pv_entry_max = 0, pv_entry_high_water = 0;
246 static struct md_page *pv_table;
247 static int shpgperproc = PMAP_SHPGPERPROC;
249 struct pv_chunk *pv_chunkbase; /* KVA block for pv_chunks */
250 int pv_maxchunks; /* How many chunks we have KVA for */
251 vm_offset_t pv_vafree; /* freelist stored in the PTE */
254 * All those kernel PT submaps that BSD is so fond of
257 static pd_entry_t *KPTD;
260 struct msgbuf *msgbufp = NULL;
265 static caddr_t crashdumpmap;
267 static pt_entry_t *PMAP1 = NULL, *PMAP2;
268 static pt_entry_t *PADDR1 = NULL, *PADDR2;
271 static int PMAP1changedcpu;
272 SYSCTL_INT(_debug, OID_AUTO, PMAP1changedcpu, CTLFLAG_RD,
274 "Number of times pmap_pte_quick changed CPU with same PMAP1");
276 static int PMAP1changed;
277 SYSCTL_INT(_debug, OID_AUTO, PMAP1changed, CTLFLAG_RD,
279 "Number of times pmap_pte_quick changed PMAP1");
280 static int PMAP1unchanged;
281 SYSCTL_INT(_debug, OID_AUTO, PMAP1unchanged, CTLFLAG_RD,
283 "Number of times pmap_pte_quick didn't change PMAP1");
284 static struct mtx PMAP2mutex;
286 static void free_pv_chunk(struct pv_chunk *pc);
287 static void free_pv_entry(pmap_t pmap, pv_entry_t pv);
288 static pv_entry_t get_pv_entry(pmap_t pmap, boolean_t try);
289 static void pmap_pv_demote_pde(pmap_t pmap, vm_offset_t va, vm_paddr_t pa);
290 static boolean_t pmap_pv_insert_pde(pmap_t pmap, vm_offset_t va, vm_paddr_t pa);
291 static void pmap_pv_promote_pde(pmap_t pmap, vm_offset_t va, vm_paddr_t pa);
292 static void pmap_pvh_free(struct md_page *pvh, pmap_t pmap, vm_offset_t va);
293 static pv_entry_t pmap_pvh_remove(struct md_page *pvh, pmap_t pmap,
295 static int pmap_pvh_wired_mappings(struct md_page *pvh, int count);
297 static boolean_t pmap_demote_pde(pmap_t pmap, pd_entry_t *pde, vm_offset_t va);
298 static boolean_t pmap_enter_pde(pmap_t pmap, vm_offset_t va, vm_page_t m,
300 static vm_page_t pmap_enter_quick_locked(pmap_t pmap, vm_offset_t va,
301 vm_page_t m, vm_prot_t prot, vm_page_t mpte);
302 static void pmap_flush_page(vm_page_t m);
303 static int pmap_insert_pt_page(pmap_t pmap, vm_page_t mpte);
304 static void pmap_invalidate_pde_page(pmap_t pmap, vm_offset_t va,
306 static void pmap_fill_ptp(pt_entry_t *firstpte, pt_entry_t newpte);
307 static boolean_t pmap_is_modified_pvh(struct md_page *pvh);
308 static boolean_t pmap_is_referenced_pvh(struct md_page *pvh);
309 static void pmap_kenter_attr(vm_offset_t va, vm_paddr_t pa, int mode);
310 static void pmap_kenter_pde(vm_offset_t va, pd_entry_t newpde);
311 static void pmap_pde_attr(pd_entry_t *pde, int cache_bits);
312 static void pmap_promote_pde(pmap_t pmap, pd_entry_t *pde, vm_offset_t va);
313 static boolean_t pmap_protect_pde(pmap_t pmap, pd_entry_t *pde, vm_offset_t sva,
315 static void pmap_pte_attr(pt_entry_t *pte, int cache_bits);
316 static void pmap_remove_pde(pmap_t pmap, pd_entry_t *pdq, vm_offset_t sva,
317 struct spglist *free);
318 static int pmap_remove_pte(pmap_t pmap, pt_entry_t *ptq, vm_offset_t sva,
319 struct spglist *free);
320 static vm_page_t pmap_remove_pt_page(pmap_t pmap, vm_offset_t va);
321 static void pmap_remove_page(struct pmap *pmap, vm_offset_t va,
322 struct spglist *free);
323 static void pmap_remove_entry(struct pmap *pmap, vm_page_t m,
325 static void pmap_insert_entry(pmap_t pmap, vm_offset_t va, vm_page_t m);
326 static boolean_t pmap_try_insert_pv_entry(pmap_t pmap, vm_offset_t va,
328 static void pmap_update_pde(pmap_t pmap, vm_offset_t va, pd_entry_t *pde,
330 static void pmap_update_pde_invalidate(vm_offset_t va, pd_entry_t newpde);
332 static vm_page_t pmap_allocpte(pmap_t pmap, vm_offset_t va, u_int flags);
334 static vm_page_t _pmap_allocpte(pmap_t pmap, u_int ptepindex, u_int flags);
335 static void _pmap_unwire_ptp(pmap_t pmap, vm_page_t m, struct spglist *free);
336 static pt_entry_t *pmap_pte_quick(pmap_t pmap, vm_offset_t va);
337 static void pmap_pte_release(pt_entry_t *pte);
338 static int pmap_unuse_pt(pmap_t, vm_offset_t, struct spglist *);
339 #if defined(PAE) || defined(PAE_TABLES)
340 static void *pmap_pdpt_allocf(uma_zone_t zone, vm_size_t bytes, uint8_t *flags,
343 static void pmap_set_pg(void);
345 static __inline void pagezero(void *page);
347 CTASSERT(1 << PDESHIFT == sizeof(pd_entry_t));
348 CTASSERT(1 << PTESHIFT == sizeof(pt_entry_t));
351 * If you get an error here, then you set KVA_PAGES wrong! See the
352 * description of KVA_PAGES in sys/i386/include/pmap.h. It must be
353 * multiple of 4 for a normal kernel, or a multiple of 8 for a PAE.
355 CTASSERT(KERNBASE % (1 << 24) == 0);
358 * Bootstrap the system enough to run with virtual memory.
360 * On the i386 this is called after mapping has already been enabled
361 * and just syncs the pmap module with what has already been done.
362 * [We can't call it easily with mapping off since the kernel is not
363 * mapped with PA == VA, hence we would have to relocate every address
364 * from the linked base (virtual) address "KERNBASE" to the actual
365 * (physical) address starting relative to 0]
368 pmap_bootstrap(vm_paddr_t firstaddr)
371 pt_entry_t *pte, *unused;
376 * Add a physical memory segment (vm_phys_seg) corresponding to the
377 * preallocated kernel page table pages so that vm_page structures
378 * representing these pages will be created. The vm_page structures
379 * are required for promotion of the corresponding kernel virtual
380 * addresses to superpage mappings.
382 vm_phys_add_seg(KPTphys, KPTphys + ptoa(nkpt));
385 * Initialize the first available kernel virtual address. However,
386 * using "firstaddr" may waste a few pages of the kernel virtual
387 * address space, because locore may not have mapped every physical
388 * page that it allocated. Preferably, locore would provide a first
389 * unused virtual address in addition to "firstaddr".
391 virtual_avail = (vm_offset_t) KERNBASE + firstaddr;
393 virtual_end = VM_MAX_KERNEL_ADDRESS;
396 * Initialize the kernel pmap (which is statically allocated).
398 PMAP_LOCK_INIT(kernel_pmap);
399 kernel_pmap->pm_pdir = (pd_entry_t *) (KERNBASE + (u_int)IdlePTD);
400 #if defined(PAE) || defined(PAE_TABLES)
401 kernel_pmap->pm_pdpt = (pdpt_entry_t *) (KERNBASE + (u_int)IdlePDPT);
403 CPU_FILL(&kernel_pmap->pm_active); /* don't allow deactivation */
404 TAILQ_INIT(&kernel_pmap->pm_pvchunk);
407 * Initialize the global pv list lock.
409 rw_init(&pvh_global_lock, "pmap pv global");
411 LIST_INIT(&allpmaps);
414 * Request a spin mutex so that changes to allpmaps cannot be
415 * preempted by smp_rendezvous_cpus(). Otherwise,
416 * pmap_update_pde_kernel() could access allpmaps while it is
419 mtx_init(&allpmaps_lock, "allpmaps", NULL, MTX_SPIN);
420 mtx_lock_spin(&allpmaps_lock);
421 LIST_INSERT_HEAD(&allpmaps, kernel_pmap, pm_list);
422 mtx_unlock_spin(&allpmaps_lock);
425 * Reserve some special page table entries/VA space for temporary
428 #define SYSMAP(c, p, v, n) \
429 v = (c)va; va += ((n)*PAGE_SIZE); p = pte; pte += (n);
436 * Initialize temporary map objects on the current CPU for use
438 * CMAP1/CMAP2 are used for zeroing and copying pages.
439 * CMAP3 is used for the boot-time memory test.
442 mtx_init(&pc->pc_cmap_lock, "SYSMAPS", NULL, MTX_DEF);
443 SYSMAP(caddr_t, pc->pc_cmap_pte1, pc->pc_cmap_addr1, 1)
444 SYSMAP(caddr_t, pc->pc_cmap_pte2, pc->pc_cmap_addr2, 1)
445 SYSMAP(vm_offset_t, pte, pc->pc_qmap_addr, 1)
447 SYSMAP(caddr_t, CMAP3, CADDR3, 1);
452 SYSMAP(caddr_t, unused, crashdumpmap, MAXDUMPPGS)
455 * ptvmmap is used for reading arbitrary physical pages via /dev/mem.
457 SYSMAP(caddr_t, unused, ptvmmap, 1)
460 * msgbufp is used to map the system message buffer.
462 SYSMAP(struct msgbuf *, unused, msgbufp, atop(round_page(msgbufsize)))
465 * KPTmap is used by pmap_kextract().
467 * KPTmap is first initialized by locore. However, that initial
468 * KPTmap can only support NKPT page table pages. Here, a larger
469 * KPTmap is created that can support KVA_PAGES page table pages.
471 SYSMAP(pt_entry_t *, KPTD, KPTmap, KVA_PAGES)
473 for (i = 0; i < NKPT; i++)
474 KPTD[i] = (KPTphys + (i << PAGE_SHIFT)) | pgeflag | PG_RW | PG_V;
477 * Adjust the start of the KPTD and KPTmap so that the implementation
478 * of pmap_kextract() and pmap_growkernel() can be made simpler.
481 KPTmap -= i386_btop(KPTDI << PDRSHIFT);
484 * PADDR1 and PADDR2 are used by pmap_pte_quick() and pmap_pte(),
487 SYSMAP(pt_entry_t *, PMAP1, PADDR1, 1)
488 SYSMAP(pt_entry_t *, PMAP2, PADDR2, 1)
490 mtx_init(&PMAP2mutex, "PMAP2", NULL, MTX_DEF);
495 * Leave in place an identity mapping (virt == phys) for the low 1 MB
496 * physical memory region that is used by the ACPI wakeup code. This
497 * mapping must not have PG_G set.
500 /* FIXME: This is gross, but needed for the XBOX. Since we are in such
501 * an early stadium, we cannot yet neatly map video memory ... :-(
502 * Better fixes are very welcome! */
503 if (!arch_i386_is_xbox)
505 for (i = 1; i < NKPT; i++)
509 * Initialize the PAT MSR if present.
510 * pmap_init_pat() clears and sets CR4_PGE, which, as a
511 * side-effect, invalidates stale PG_G TLB entries that might
512 * have been created in our pre-boot environment. We assume
513 * that PAT support implies PGE and in reverse, PGE presence
514 * comes with PAT. Both features were added for Pentium Pro.
518 /* Turn on PG_G on kernel page(s) */
523 pmap_init_reserved_pages(void)
532 * Skip if the mapping has already been initialized,
533 * i.e. this is the BSP.
535 if (pc->pc_cmap_addr1 != 0)
537 mtx_init(&pc->pc_cmap_lock, "SYSMAPS", NULL, MTX_DEF);
538 pages = kva_alloc(PAGE_SIZE * 3);
540 panic("%s: unable to allocate KVA", __func__);
541 pc->pc_cmap_pte1 = vtopte(pages);
542 pc->pc_cmap_pte2 = vtopte(pages + PAGE_SIZE);
543 pc->pc_cmap_addr1 = (caddr_t)pages;
544 pc->pc_cmap_addr2 = (caddr_t)(pages + PAGE_SIZE);
545 pc->pc_qmap_addr = pages + (PAGE_SIZE * 2);
549 SYSINIT(rpages_init, SI_SUB_CPU, SI_ORDER_ANY, pmap_init_reserved_pages, NULL);
557 int pat_table[PAT_INDEX_SIZE];
562 /* Set default PAT index table. */
563 for (i = 0; i < PAT_INDEX_SIZE; i++)
565 pat_table[PAT_WRITE_BACK] = 0;
566 pat_table[PAT_WRITE_THROUGH] = 1;
567 pat_table[PAT_UNCACHEABLE] = 3;
568 pat_table[PAT_WRITE_COMBINING] = 3;
569 pat_table[PAT_WRITE_PROTECTED] = 3;
570 pat_table[PAT_UNCACHED] = 3;
573 * Bail if this CPU doesn't implement PAT.
574 * We assume that PAT support implies PGE.
576 if ((cpu_feature & CPUID_PAT) == 0) {
577 for (i = 0; i < PAT_INDEX_SIZE; i++)
578 pat_index[i] = pat_table[i];
584 * Due to some Intel errata, we can only safely use the lower 4
587 * Intel Pentium III Processor Specification Update
588 * Errata E.27 (Upper Four PAT Entries Not Usable With Mode B
591 * Intel Pentium IV Processor Specification Update
592 * Errata N46 (PAT Index MSB May Be Calculated Incorrectly)
594 if (cpu_vendor_id == CPU_VENDOR_INTEL &&
595 !(CPUID_TO_FAMILY(cpu_id) == 6 && CPUID_TO_MODEL(cpu_id) >= 0xe))
598 /* Initialize default PAT entries. */
599 pat_msr = PAT_VALUE(0, PAT_WRITE_BACK) |
600 PAT_VALUE(1, PAT_WRITE_THROUGH) |
601 PAT_VALUE(2, PAT_UNCACHED) |
602 PAT_VALUE(3, PAT_UNCACHEABLE) |
603 PAT_VALUE(4, PAT_WRITE_BACK) |
604 PAT_VALUE(5, PAT_WRITE_THROUGH) |
605 PAT_VALUE(6, PAT_UNCACHED) |
606 PAT_VALUE(7, PAT_UNCACHEABLE);
610 * Leave the indices 0-3 at the default of WB, WT, UC-, and UC.
611 * Program 5 and 6 as WP and WC.
612 * Leave 4 and 7 as WB and UC.
614 pat_msr &= ~(PAT_MASK(5) | PAT_MASK(6));
615 pat_msr |= PAT_VALUE(5, PAT_WRITE_PROTECTED) |
616 PAT_VALUE(6, PAT_WRITE_COMBINING);
617 pat_table[PAT_UNCACHED] = 2;
618 pat_table[PAT_WRITE_PROTECTED] = 5;
619 pat_table[PAT_WRITE_COMBINING] = 6;
622 * Just replace PAT Index 2 with WC instead of UC-.
624 pat_msr &= ~PAT_MASK(2);
625 pat_msr |= PAT_VALUE(2, PAT_WRITE_COMBINING);
626 pat_table[PAT_WRITE_COMBINING] = 2;
631 load_cr4(cr4 & ~CR4_PGE);
633 /* Disable caches (CD = 1, NW = 0). */
635 load_cr0((cr0 & ~CR0_NW) | CR0_CD);
637 /* Flushes caches and TLBs. */
641 /* Update PAT and index table. */
642 wrmsr(MSR_PAT, pat_msr);
643 for (i = 0; i < PAT_INDEX_SIZE; i++)
644 pat_index[i] = pat_table[i];
646 /* Flush caches and TLBs again. */
650 /* Restore caches and PGE. */
656 * Set PG_G on kernel pages. Only the BSP calls this when SMP is turned on.
662 vm_offset_t va, endva;
667 endva = KERNBASE + KERNend;
670 va = KERNBASE + KERNLOAD;
672 pdir_pde(PTD, va) |= pgeflag;
673 invltlb(); /* Flush non-PG_G entries. */
677 va = (vm_offset_t)btext;
682 invltlb(); /* Flush non-PG_G entries. */
689 * Initialize a vm_page's machine-dependent fields.
692 pmap_page_init(vm_page_t m)
695 TAILQ_INIT(&m->md.pv_list);
696 m->md.pat_mode = PAT_WRITE_BACK;
699 #if defined(PAE) || defined(PAE_TABLES)
701 pmap_pdpt_allocf(uma_zone_t zone, vm_size_t bytes, uint8_t *flags, int wait)
704 /* Inform UMA that this allocator uses kernel_map/object. */
705 *flags = UMA_SLAB_KERNEL;
706 return ((void *)kmem_alloc_contig(kernel_arena, bytes, wait, 0x0ULL,
707 0xffffffffULL, 1, 0, VM_MEMATTR_DEFAULT));
712 * Abuse the pte nodes for unmapped kva to thread a kva freelist through.
714 * - Must deal with pages in order to ensure that none of the PG_* bits
715 * are ever set, PG_V in particular.
716 * - Assumes we can write to ptes without pte_store() atomic ops, even
717 * on PAE systems. This should be ok.
718 * - Assumes nothing will ever test these addresses for 0 to indicate
719 * no mapping instead of correctly checking PG_V.
720 * - Assumes a vm_offset_t will fit in a pte (true for i386).
721 * Because PG_V is never set, there can be no mappings to invalidate.
724 pmap_ptelist_alloc(vm_offset_t *head)
731 panic("pmap_ptelist_alloc: exhausted ptelist KVA");
735 panic("pmap_ptelist_alloc: va with PG_V set!");
741 pmap_ptelist_free(vm_offset_t *head, vm_offset_t va)
746 panic("pmap_ptelist_free: freeing va with PG_V set!");
748 *pte = *head; /* virtual! PG_V is 0 though */
753 pmap_ptelist_init(vm_offset_t *head, void *base, int npages)
759 for (i = npages - 1; i >= 0; i--) {
760 va = (vm_offset_t)base + i * PAGE_SIZE;
761 pmap_ptelist_free(head, va);
767 * Initialize the pmap module.
768 * Called by vm_init, to initialize any structures that the pmap
769 * system needs to map virtual memory.
774 struct pmap_preinit_mapping *ppim;
780 * Initialize the vm page array entries for the kernel pmap's
783 for (i = 0; i < NKPT; i++) {
784 mpte = PHYS_TO_VM_PAGE(KPTphys + (i << PAGE_SHIFT));
785 KASSERT(mpte >= vm_page_array &&
786 mpte < &vm_page_array[vm_page_array_size],
787 ("pmap_init: page table page is out of range"));
788 mpte->pindex = i + KPTDI;
789 mpte->phys_addr = KPTphys + (i << PAGE_SHIFT);
793 * Initialize the address space (zone) for the pv entries. Set a
794 * high water mark so that the system can recover from excessive
795 * numbers of pv entries.
797 TUNABLE_INT_FETCH("vm.pmap.shpgperproc", &shpgperproc);
798 pv_entry_max = shpgperproc * maxproc + vm_cnt.v_page_count;
799 TUNABLE_INT_FETCH("vm.pmap.pv_entries", &pv_entry_max);
800 pv_entry_max = roundup(pv_entry_max, _NPCPV);
801 pv_entry_high_water = 9 * (pv_entry_max / 10);
804 * If the kernel is running on a virtual machine, then it must assume
805 * that MCA is enabled by the hypervisor. Moreover, the kernel must
806 * be prepared for the hypervisor changing the vendor and family that
807 * are reported by CPUID. Consequently, the workaround for AMD Family
808 * 10h Erratum 383 is enabled if the processor's feature set does not
809 * include at least one feature that is only supported by older Intel
810 * or newer AMD processors.
812 if (vm_guest != VM_GUEST_NO && (cpu_feature & CPUID_SS) == 0 &&
813 (cpu_feature2 & (CPUID2_SSSE3 | CPUID2_SSE41 | CPUID2_AESNI |
814 CPUID2_AVX | CPUID2_XSAVE)) == 0 && (amd_feature2 & (AMDID2_XOP |
816 workaround_erratum383 = 1;
819 * Are large page mappings supported and enabled?
821 TUNABLE_INT_FETCH("vm.pmap.pg_ps_enabled", &pg_ps_enabled);
824 else if (pg_ps_enabled) {
825 KASSERT(MAXPAGESIZES > 1 && pagesizes[1] == 0,
826 ("pmap_init: can't assign to pagesizes[1]"));
827 pagesizes[1] = NBPDR;
831 * Calculate the size of the pv head table for superpages.
832 * Handle the possibility that "vm_phys_segs[...].end" is zero.
834 pv_npg = trunc_4mpage(vm_phys_segs[vm_phys_nsegs - 1].end -
835 PAGE_SIZE) / NBPDR + 1;
838 * Allocate memory for the pv head table for superpages.
840 s = (vm_size_t)(pv_npg * sizeof(struct md_page));
842 pv_table = (struct md_page *)kmem_malloc(kernel_arena, s,
844 for (i = 0; i < pv_npg; i++)
845 TAILQ_INIT(&pv_table[i].pv_list);
847 pv_maxchunks = MAX(pv_entry_max / _NPCPV, maxproc);
848 pv_chunkbase = (struct pv_chunk *)kva_alloc(PAGE_SIZE * pv_maxchunks);
849 if (pv_chunkbase == NULL)
850 panic("pmap_init: not enough kvm for pv chunks");
851 pmap_ptelist_init(&pv_vafree, pv_chunkbase, pv_maxchunks);
852 #if defined(PAE) || defined(PAE_TABLES)
853 pdptzone = uma_zcreate("PDPT", NPGPTD * sizeof(pdpt_entry_t), NULL,
854 NULL, NULL, NULL, (NPGPTD * sizeof(pdpt_entry_t)) - 1,
855 UMA_ZONE_VM | UMA_ZONE_NOFREE);
856 uma_zone_set_allocf(pdptzone, pmap_pdpt_allocf);
859 pmap_initialized = 1;
862 for (i = 0; i < PMAP_PREINIT_MAPPING_COUNT; i++) {
863 ppim = pmap_preinit_mapping + i;
866 printf("PPIM %u: PA=%#jx, VA=%#x, size=%#x, mode=%#x\n", i,
867 (uintmax_t)ppim->pa, ppim->va, ppim->sz, ppim->mode);
872 SYSCTL_INT(_vm_pmap, OID_AUTO, pv_entry_max, CTLFLAG_RD, &pv_entry_max, 0,
873 "Max number of PV entries");
874 SYSCTL_INT(_vm_pmap, OID_AUTO, shpgperproc, CTLFLAG_RD, &shpgperproc, 0,
875 "Page share factor per proc");
877 static SYSCTL_NODE(_vm_pmap, OID_AUTO, pde, CTLFLAG_RD, 0,
878 "2/4MB page mapping counters");
880 static u_long pmap_pde_demotions;
881 SYSCTL_ULONG(_vm_pmap_pde, OID_AUTO, demotions, CTLFLAG_RD,
882 &pmap_pde_demotions, 0, "2/4MB page demotions");
884 static u_long pmap_pde_mappings;
885 SYSCTL_ULONG(_vm_pmap_pde, OID_AUTO, mappings, CTLFLAG_RD,
886 &pmap_pde_mappings, 0, "2/4MB page mappings");
888 static u_long pmap_pde_p_failures;
889 SYSCTL_ULONG(_vm_pmap_pde, OID_AUTO, p_failures, CTLFLAG_RD,
890 &pmap_pde_p_failures, 0, "2/4MB page promotion failures");
892 static u_long pmap_pde_promotions;
893 SYSCTL_ULONG(_vm_pmap_pde, OID_AUTO, promotions, CTLFLAG_RD,
894 &pmap_pde_promotions, 0, "2/4MB page promotions");
896 /***************************************************
897 * Low level helper routines.....
898 ***************************************************/
901 * Determine the appropriate bits to set in a PTE or PDE for a specified
905 pmap_cache_bits(int mode, boolean_t is_pde)
907 int cache_bits, pat_flag, pat_idx;
909 if (mode < 0 || mode >= PAT_INDEX_SIZE || pat_index[mode] < 0)
910 panic("Unknown caching mode %d\n", mode);
912 /* The PAT bit is different for PTE's and PDE's. */
913 pat_flag = is_pde ? PG_PDE_PAT : PG_PTE_PAT;
915 /* Map the caching mode to a PAT index. */
916 pat_idx = pat_index[mode];
918 /* Map the 3-bit index value into the PAT, PCD, and PWT bits. */
921 cache_bits |= pat_flag;
923 cache_bits |= PG_NC_PCD;
925 cache_bits |= PG_NC_PWT;
930 * The caller is responsible for maintaining TLB consistency.
933 pmap_kenter_pde(vm_offset_t va, pd_entry_t newpde)
937 boolean_t PTD_updated;
940 mtx_lock_spin(&allpmaps_lock);
941 LIST_FOREACH(pmap, &allpmaps, pm_list) {
942 if ((pmap->pm_pdir[PTDPTDI] & PG_FRAME) == (PTDpde[0] &
945 pde = pmap_pde(pmap, va);
946 pde_store(pde, newpde);
948 mtx_unlock_spin(&allpmaps_lock);
950 ("pmap_kenter_pde: current page table is not in allpmaps"));
954 * After changing the page size for the specified virtual address in the page
955 * table, flush the corresponding entries from the processor's TLB. Only the
956 * calling processor's TLB is affected.
958 * The calling thread must be pinned to a processor.
961 pmap_update_pde_invalidate(vm_offset_t va, pd_entry_t newpde)
965 if ((newpde & PG_PS) == 0)
966 /* Demotion: flush a specific 2MB page mapping. */
968 else if ((newpde & PG_G) == 0)
970 * Promotion: flush every 4KB page mapping from the TLB
971 * because there are too many to flush individually.
976 * Promotion: flush every 4KB page mapping from the TLB,
977 * including any global (PG_G) mappings.
980 load_cr4(cr4 & ~CR4_PGE);
982 * Although preemption at this point could be detrimental to
983 * performance, it would not lead to an error. PG_G is simply
984 * ignored if CR4.PGE is clear. Moreover, in case this block
985 * is re-entered, the load_cr4() either above or below will
986 * modify CR4.PGE flushing the TLB.
988 load_cr4(cr4 | CR4_PGE);
1001 load_cr4(cr4 & ~CR4_PGE);
1002 load_cr4(cr4 | CR4_PGE);
1009 * For SMP, these functions have to use the IPI mechanism for coherence.
1011 * N.B.: Before calling any of the following TLB invalidation functions,
1012 * the calling processor must ensure that all stores updating a non-
1013 * kernel page table are globally performed. Otherwise, another
1014 * processor could cache an old, pre-update entry without being
1015 * invalidated. This can happen one of two ways: (1) The pmap becomes
1016 * active on another processor after its pm_active field is checked by
1017 * one of the following functions but before a store updating the page
1018 * table is globally performed. (2) The pmap becomes active on another
1019 * processor before its pm_active field is checked but due to
1020 * speculative loads one of the following functions stills reads the
1021 * pmap as inactive on the other processor.
1023 * The kernel page table is exempt because its pm_active field is
1024 * immutable. The kernel page table is always active on every
1028 pmap_invalidate_page(pmap_t pmap, vm_offset_t va)
1030 cpuset_t *mask, other_cpus;
1034 if (pmap == kernel_pmap || !CPU_CMP(&pmap->pm_active, &all_cpus)) {
1038 cpuid = PCPU_GET(cpuid);
1039 other_cpus = all_cpus;
1040 CPU_CLR(cpuid, &other_cpus);
1041 if (CPU_ISSET(cpuid, &pmap->pm_active))
1043 CPU_AND(&other_cpus, &pmap->pm_active);
1046 smp_masked_invlpg(*mask, va);
1050 /* 4k PTEs -- Chosen to exceed the total size of Broadwell L2 TLB */
1051 #define PMAP_INVLPG_THRESHOLD (4 * 1024 * PAGE_SIZE)
1054 pmap_invalidate_range(pmap_t pmap, vm_offset_t sva, vm_offset_t eva)
1056 cpuset_t *mask, other_cpus;
1060 if (eva - sva >= PMAP_INVLPG_THRESHOLD) {
1061 pmap_invalidate_all(pmap);
1066 if (pmap == kernel_pmap || !CPU_CMP(&pmap->pm_active, &all_cpus)) {
1067 for (addr = sva; addr < eva; addr += PAGE_SIZE)
1071 cpuid = PCPU_GET(cpuid);
1072 other_cpus = all_cpus;
1073 CPU_CLR(cpuid, &other_cpus);
1074 if (CPU_ISSET(cpuid, &pmap->pm_active))
1075 for (addr = sva; addr < eva; addr += PAGE_SIZE)
1077 CPU_AND(&other_cpus, &pmap->pm_active);
1080 smp_masked_invlpg_range(*mask, sva, eva);
1085 pmap_invalidate_all(pmap_t pmap)
1087 cpuset_t *mask, other_cpus;
1091 if (pmap == kernel_pmap) {
1094 } else if (!CPU_CMP(&pmap->pm_active, &all_cpus)) {
1098 cpuid = PCPU_GET(cpuid);
1099 other_cpus = all_cpus;
1100 CPU_CLR(cpuid, &other_cpus);
1101 if (CPU_ISSET(cpuid, &pmap->pm_active))
1103 CPU_AND(&other_cpus, &pmap->pm_active);
1106 smp_masked_invltlb(*mask, pmap);
1111 pmap_invalidate_cache(void)
1121 cpuset_t invalidate; /* processors that invalidate their TLB */
1125 u_int store; /* processor that updates the PDE */
1129 pmap_update_pde_kernel(void *arg)
1131 struct pde_action *act = arg;
1135 if (act->store == PCPU_GET(cpuid)) {
1138 * Elsewhere, this operation requires allpmaps_lock for
1139 * synchronization. Here, it does not because it is being
1140 * performed in the context of an all_cpus rendezvous.
1142 LIST_FOREACH(pmap, &allpmaps, pm_list) {
1143 pde = pmap_pde(pmap, act->va);
1144 pde_store(pde, act->newpde);
1150 pmap_update_pde_user(void *arg)
1152 struct pde_action *act = arg;
1154 if (act->store == PCPU_GET(cpuid))
1155 pde_store(act->pde, act->newpde);
1159 pmap_update_pde_teardown(void *arg)
1161 struct pde_action *act = arg;
1163 if (CPU_ISSET(PCPU_GET(cpuid), &act->invalidate))
1164 pmap_update_pde_invalidate(act->va, act->newpde);
1168 * Change the page size for the specified virtual address in a way that
1169 * prevents any possibility of the TLB ever having two entries that map the
1170 * same virtual address using different page sizes. This is the recommended
1171 * workaround for Erratum 383 on AMD Family 10h processors. It prevents a
1172 * machine check exception for a TLB state that is improperly diagnosed as a
1176 pmap_update_pde(pmap_t pmap, vm_offset_t va, pd_entry_t *pde, pd_entry_t newpde)
1178 struct pde_action act;
1179 cpuset_t active, other_cpus;
1183 cpuid = PCPU_GET(cpuid);
1184 other_cpus = all_cpus;
1185 CPU_CLR(cpuid, &other_cpus);
1186 if (pmap == kernel_pmap)
1189 active = pmap->pm_active;
1190 if (CPU_OVERLAP(&active, &other_cpus)) {
1192 act.invalidate = active;
1195 act.newpde = newpde;
1196 CPU_SET(cpuid, &active);
1197 smp_rendezvous_cpus(active,
1198 smp_no_rendevous_barrier, pmap == kernel_pmap ?
1199 pmap_update_pde_kernel : pmap_update_pde_user,
1200 pmap_update_pde_teardown, &act);
1202 if (pmap == kernel_pmap)
1203 pmap_kenter_pde(va, newpde);
1205 pde_store(pde, newpde);
1206 if (CPU_ISSET(cpuid, &active))
1207 pmap_update_pde_invalidate(va, newpde);
1213 * Normal, non-SMP, 486+ invalidation functions.
1214 * We inline these within pmap.c for speed.
1217 pmap_invalidate_page(pmap_t pmap, vm_offset_t va)
1220 if (pmap == kernel_pmap || !CPU_EMPTY(&pmap->pm_active))
1225 pmap_invalidate_range(pmap_t pmap, vm_offset_t sva, vm_offset_t eva)
1229 if (pmap == kernel_pmap || !CPU_EMPTY(&pmap->pm_active))
1230 for (addr = sva; addr < eva; addr += PAGE_SIZE)
1235 pmap_invalidate_all(pmap_t pmap)
1238 if (pmap == kernel_pmap)
1240 else if (!CPU_EMPTY(&pmap->pm_active))
1245 pmap_invalidate_cache(void)
1252 pmap_update_pde(pmap_t pmap, vm_offset_t va, pd_entry_t *pde, pd_entry_t newpde)
1255 if (pmap == kernel_pmap)
1256 pmap_kenter_pde(va, newpde);
1258 pde_store(pde, newpde);
1259 if (pmap == kernel_pmap || !CPU_EMPTY(&pmap->pm_active))
1260 pmap_update_pde_invalidate(va, newpde);
1265 pmap_invalidate_pde_page(pmap_t pmap, vm_offset_t va, pd_entry_t pde)
1269 * When the PDE has PG_PROMOTED set, the 2- or 4MB page mapping was
1270 * created by a promotion that did not invalidate the 512 or 1024 4KB
1271 * page mappings that might exist in the TLB. Consequently, at this
1272 * point, the TLB may hold both 4KB and 2- or 4MB page mappings for
1273 * the address range [va, va + NBPDR). Therefore, the entire range
1274 * must be invalidated here. In contrast, when PG_PROMOTED is clear,
1275 * the TLB will not hold any 4KB page mappings for the address range
1276 * [va, va + NBPDR), and so a single INVLPG suffices to invalidate the
1277 * 2- or 4MB page mapping from the TLB.
1279 if ((pde & PG_PROMOTED) != 0)
1280 pmap_invalidate_range(pmap, va, va + NBPDR - 1);
1282 pmap_invalidate_page(pmap, va);
1285 #define PMAP_CLFLUSH_THRESHOLD (2 * 1024 * 1024)
1288 pmap_invalidate_cache_range(vm_offset_t sva, vm_offset_t eva, boolean_t force)
1292 sva &= ~(vm_offset_t)cpu_clflush_line_size;
1294 KASSERT((sva & PAGE_MASK) == 0,
1295 ("pmap_invalidate_cache_range: sva not page-aligned"));
1296 KASSERT((eva & PAGE_MASK) == 0,
1297 ("pmap_invalidate_cache_range: eva not page-aligned"));
1300 if ((cpu_feature & CPUID_SS) != 0 && !force)
1301 ; /* If "Self Snoop" is supported and allowed, do nothing. */
1302 else if ((cpu_stdext_feature & CPUID_STDEXT_CLFLUSHOPT) != 0 &&
1303 eva - sva < PMAP_CLFLUSH_THRESHOLD) {
1306 * XXX: Some CPUs fault, hang, or trash the local APIC
1307 * registers if we use CLFLUSH on the local APIC
1308 * range. The local APIC is always uncached, so we
1309 * don't need to flush for that range anyway.
1311 if (pmap_kextract(sva) == lapic_paddr)
1315 * Otherwise, do per-cache line flush. Use the sfence
1316 * instruction to insure that previous stores are
1317 * included in the write-back. The processor
1318 * propagates flush to other processors in the cache
1322 for (; sva < eva; sva += cpu_clflush_line_size)
1325 } else if ((cpu_feature & CPUID_CLFSH) != 0 &&
1326 eva - sva < PMAP_CLFLUSH_THRESHOLD) {
1328 if (pmap_kextract(sva) == lapic_paddr)
1332 * Writes are ordered by CLFLUSH on Intel CPUs.
1334 if (cpu_vendor_id != CPU_VENDOR_INTEL)
1336 for (; sva < eva; sva += cpu_clflush_line_size)
1338 if (cpu_vendor_id != CPU_VENDOR_INTEL)
1343 * No targeted cache flush methods are supported by CPU,
1344 * or the supplied range is bigger than 2MB.
1345 * Globally invalidate cache.
1347 pmap_invalidate_cache();
1352 pmap_invalidate_cache_pages(vm_page_t *pages, int count)
1356 if (count >= PMAP_CLFLUSH_THRESHOLD / PAGE_SIZE ||
1357 (cpu_feature & CPUID_CLFSH) == 0) {
1358 pmap_invalidate_cache();
1360 for (i = 0; i < count; i++)
1361 pmap_flush_page(pages[i]);
1366 * Are we current address space or kernel?
1369 pmap_is_current(pmap_t pmap)
1372 return (pmap == kernel_pmap || pmap ==
1373 vmspace_pmap(curthread->td_proc->p_vmspace));
1377 * If the given pmap is not the current or kernel pmap, the returned pte must
1378 * be released by passing it to pmap_pte_release().
1381 pmap_pte(pmap_t pmap, vm_offset_t va)
1386 pde = pmap_pde(pmap, va);
1390 /* are we current address space or kernel? */
1391 if (pmap_is_current(pmap))
1392 return (vtopte(va));
1393 mtx_lock(&PMAP2mutex);
1394 newpf = *pde & PG_FRAME;
1395 if ((*PMAP2 & PG_FRAME) != newpf) {
1396 *PMAP2 = newpf | PG_RW | PG_V | PG_A | PG_M;
1397 pmap_invalidate_page(kernel_pmap, (vm_offset_t)PADDR2);
1399 return (PADDR2 + (i386_btop(va) & (NPTEPG - 1)));
1405 * Releases a pte that was obtained from pmap_pte(). Be prepared for the pte
1408 static __inline void
1409 pmap_pte_release(pt_entry_t *pte)
1412 if ((pt_entry_t *)((vm_offset_t)pte & ~PAGE_MASK) == PADDR2)
1413 mtx_unlock(&PMAP2mutex);
1417 * NB: The sequence of updating a page table followed by accesses to the
1418 * corresponding pages is subject to the situation described in the "AMD64
1419 * Architecture Programmer's Manual Volume 2: System Programming" rev. 3.23,
1420 * "7.3.1 Special Coherency Considerations". Therefore, issuing the INVLPG
1421 * right after modifying the PTE bits is crucial.
1423 static __inline void
1424 invlcaddr(void *caddr)
1427 invlpg((u_int)caddr);
1431 * Super fast pmap_pte routine best used when scanning
1432 * the pv lists. This eliminates many coarse-grained
1433 * invltlb calls. Note that many of the pv list
1434 * scans are across different pmaps. It is very wasteful
1435 * to do an entire invltlb for checking a single mapping.
1437 * If the given pmap is not the current pmap, pvh_global_lock
1438 * must be held and curthread pinned to a CPU.
1441 pmap_pte_quick(pmap_t pmap, vm_offset_t va)
1446 pde = pmap_pde(pmap, va);
1450 /* are we current address space or kernel? */
1451 if (pmap_is_current(pmap))
1452 return (vtopte(va));
1453 rw_assert(&pvh_global_lock, RA_WLOCKED);
1454 KASSERT(curthread->td_pinned > 0, ("curthread not pinned"));
1455 newpf = *pde & PG_FRAME;
1456 if ((*PMAP1 & PG_FRAME) != newpf) {
1457 *PMAP1 = newpf | PG_RW | PG_V | PG_A | PG_M;
1459 PMAP1cpu = PCPU_GET(cpuid);
1465 if (PMAP1cpu != PCPU_GET(cpuid)) {
1466 PMAP1cpu = PCPU_GET(cpuid);
1472 return (PADDR1 + (i386_btop(va) & (NPTEPG - 1)));
1478 * Routine: pmap_extract
1480 * Extract the physical page address associated
1481 * with the given map/virtual_address pair.
1484 pmap_extract(pmap_t pmap, vm_offset_t va)
1492 pde = pmap->pm_pdir[va >> PDRSHIFT];
1494 if ((pde & PG_PS) != 0)
1495 rtval = (pde & PG_PS_FRAME) | (va & PDRMASK);
1497 pte = pmap_pte(pmap, va);
1498 rtval = (*pte & PG_FRAME) | (va & PAGE_MASK);
1499 pmap_pte_release(pte);
1507 * Routine: pmap_extract_and_hold
1509 * Atomically extract and hold the physical page
1510 * with the given pmap and virtual address pair
1511 * if that mapping permits the given protection.
1514 pmap_extract_and_hold(pmap_t pmap, vm_offset_t va, vm_prot_t prot)
1517 pt_entry_t pte, *ptep;
1525 pde = *pmap_pde(pmap, va);
1528 if ((pde & PG_RW) || (prot & VM_PROT_WRITE) == 0) {
1529 if (vm_page_pa_tryrelock(pmap, (pde &
1530 PG_PS_FRAME) | (va & PDRMASK), &pa))
1532 m = PHYS_TO_VM_PAGE((pde & PG_PS_FRAME) |
1537 ptep = pmap_pte(pmap, va);
1539 pmap_pte_release(ptep);
1541 ((pte & PG_RW) || (prot & VM_PROT_WRITE) == 0)) {
1542 if (vm_page_pa_tryrelock(pmap, pte & PG_FRAME,
1545 m = PHYS_TO_VM_PAGE(pte & PG_FRAME);
1555 /***************************************************
1556 * Low level mapping routines.....
1557 ***************************************************/
1560 * Add a wired page to the kva.
1561 * Note: not SMP coherent.
1563 * This function may be used before pmap_bootstrap() is called.
1566 pmap_kenter(vm_offset_t va, vm_paddr_t pa)
1571 pte_store(pte, pa | PG_RW | PG_V | pgeflag);
1574 static __inline void
1575 pmap_kenter_attr(vm_offset_t va, vm_paddr_t pa, int mode)
1580 pte_store(pte, pa | PG_RW | PG_V | pgeflag | pmap_cache_bits(mode, 0));
1584 * Remove a page from the kernel pagetables.
1585 * Note: not SMP coherent.
1587 * This function may be used before pmap_bootstrap() is called.
1590 pmap_kremove(vm_offset_t va)
1599 * Used to map a range of physical addresses into kernel
1600 * virtual address space.
1602 * The value passed in '*virt' is a suggested virtual address for
1603 * the mapping. Architectures which can support a direct-mapped
1604 * physical to virtual region can return the appropriate address
1605 * within that region, leaving '*virt' unchanged. Other
1606 * architectures should map the pages starting at '*virt' and
1607 * update '*virt' with the first usable address after the mapped
1611 pmap_map(vm_offset_t *virt, vm_paddr_t start, vm_paddr_t end, int prot)
1613 vm_offset_t va, sva;
1614 vm_paddr_t superpage_offset;
1619 * Does the physical address range's size and alignment permit at
1620 * least one superpage mapping to be created?
1622 superpage_offset = start & PDRMASK;
1623 if ((end - start) - ((NBPDR - superpage_offset) & PDRMASK) >= NBPDR) {
1625 * Increase the starting virtual address so that its alignment
1626 * does not preclude the use of superpage mappings.
1628 if ((va & PDRMASK) < superpage_offset)
1629 va = (va & ~PDRMASK) + superpage_offset;
1630 else if ((va & PDRMASK) > superpage_offset)
1631 va = ((va + PDRMASK) & ~PDRMASK) + superpage_offset;
1634 while (start < end) {
1635 if ((start & PDRMASK) == 0 && end - start >= NBPDR &&
1637 KASSERT((va & PDRMASK) == 0,
1638 ("pmap_map: misaligned va %#x", va));
1639 newpde = start | PG_PS | pgeflag | PG_RW | PG_V;
1640 pmap_kenter_pde(va, newpde);
1644 pmap_kenter(va, start);
1649 pmap_invalidate_range(kernel_pmap, sva, va);
1656 * Add a list of wired pages to the kva
1657 * this routine is only used for temporary
1658 * kernel mappings that do not need to have
1659 * page modification or references recorded.
1660 * Note that old mappings are simply written
1661 * over. The page *must* be wired.
1662 * Note: SMP coherent. Uses a ranged shootdown IPI.
1665 pmap_qenter(vm_offset_t sva, vm_page_t *ma, int count)
1667 pt_entry_t *endpte, oldpte, pa, *pte;
1672 endpte = pte + count;
1673 while (pte < endpte) {
1675 pa = VM_PAGE_TO_PHYS(m) | pmap_cache_bits(m->md.pat_mode, 0);
1676 if ((*pte & (PG_FRAME | PG_PTE_CACHE)) != pa) {
1678 pte_store(pte, pa | pgeflag | PG_RW | PG_V);
1682 if (__predict_false((oldpte & PG_V) != 0))
1683 pmap_invalidate_range(kernel_pmap, sva, sva + count *
1688 * This routine tears out page mappings from the
1689 * kernel -- it is meant only for temporary mappings.
1690 * Note: SMP coherent. Uses a ranged shootdown IPI.
1693 pmap_qremove(vm_offset_t sva, int count)
1698 while (count-- > 0) {
1702 pmap_invalidate_range(kernel_pmap, sva, va);
1705 /***************************************************
1706 * Page table page management routines.....
1707 ***************************************************/
1708 static __inline void
1709 pmap_free_zero_pages(struct spglist *free)
1713 while ((m = SLIST_FIRST(free)) != NULL) {
1714 SLIST_REMOVE_HEAD(free, plinks.s.ss);
1715 /* Preserve the page's PG_ZERO setting. */
1716 vm_page_free_toq(m);
1721 * Schedule the specified unused page table page to be freed. Specifically,
1722 * add the page to the specified list of pages that will be released to the
1723 * physical memory manager after the TLB has been updated.
1725 static __inline void
1726 pmap_add_delayed_free_list(vm_page_t m, struct spglist *free,
1727 boolean_t set_PG_ZERO)
1731 m->flags |= PG_ZERO;
1733 m->flags &= ~PG_ZERO;
1734 SLIST_INSERT_HEAD(free, m, plinks.s.ss);
1738 * Inserts the specified page table page into the specified pmap's collection
1739 * of idle page table pages. Each of a pmap's page table pages is responsible
1740 * for mapping a distinct range of virtual addresses. The pmap's collection is
1741 * ordered by this virtual address range.
1744 pmap_insert_pt_page(pmap_t pmap, vm_page_t mpte)
1747 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
1748 return (vm_radix_insert(&pmap->pm_root, mpte));
1752 * Removes the page table page mapping the specified virtual address from the
1753 * specified pmap's collection of idle page table pages, and returns it.
1754 * Otherwise, returns NULL if there is no page table page corresponding to the
1755 * specified virtual address.
1757 static __inline vm_page_t
1758 pmap_remove_pt_page(pmap_t pmap, vm_offset_t va)
1761 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
1762 return (vm_radix_remove(&pmap->pm_root, va >> PDRSHIFT));
1766 * Decrements a page table page's wire count, which is used to record the
1767 * number of valid page table entries within the page. If the wire count
1768 * drops to zero, then the page table page is unmapped. Returns TRUE if the
1769 * page table page was unmapped and FALSE otherwise.
1771 static inline boolean_t
1772 pmap_unwire_ptp(pmap_t pmap, vm_page_t m, struct spglist *free)
1776 if (m->wire_count == 0) {
1777 _pmap_unwire_ptp(pmap, m, free);
1784 _pmap_unwire_ptp(pmap_t pmap, vm_page_t m, struct spglist *free)
1789 * unmap the page table page
1791 pmap->pm_pdir[m->pindex] = 0;
1792 --pmap->pm_stats.resident_count;
1795 * This is a release store so that the ordinary store unmapping
1796 * the page table page is globally performed before TLB shoot-
1799 atomic_subtract_rel_int(&vm_cnt.v_wire_count, 1);
1802 * Do an invltlb to make the invalidated mapping
1803 * take effect immediately.
1805 pteva = VM_MAXUSER_ADDRESS + i386_ptob(m->pindex);
1806 pmap_invalidate_page(pmap, pteva);
1809 * Put page on a list so that it is released after
1810 * *ALL* TLB shootdown is done
1812 pmap_add_delayed_free_list(m, free, TRUE);
1816 * After removing a page table entry, this routine is used to
1817 * conditionally free the page, and manage the hold/wire counts.
1820 pmap_unuse_pt(pmap_t pmap, vm_offset_t va, struct spglist *free)
1825 if (va >= VM_MAXUSER_ADDRESS)
1827 ptepde = *pmap_pde(pmap, va);
1828 mpte = PHYS_TO_VM_PAGE(ptepde & PG_FRAME);
1829 return (pmap_unwire_ptp(pmap, mpte, free));
1833 * Initialize the pmap for the swapper process.
1836 pmap_pinit0(pmap_t pmap)
1839 PMAP_LOCK_INIT(pmap);
1841 * Since the page table directory is shared with the kernel pmap,
1842 * which is already included in the list "allpmaps", this pmap does
1843 * not need to be inserted into that list.
1845 pmap->pm_pdir = (pd_entry_t *)(KERNBASE + (vm_offset_t)IdlePTD);
1846 #if defined(PAE) || defined(PAE_TABLES)
1847 pmap->pm_pdpt = (pdpt_entry_t *)(KERNBASE + (vm_offset_t)IdlePDPT);
1849 pmap->pm_root.rt_root = 0;
1850 CPU_ZERO(&pmap->pm_active);
1851 PCPU_SET(curpmap, pmap);
1852 TAILQ_INIT(&pmap->pm_pvchunk);
1853 bzero(&pmap->pm_stats, sizeof pmap->pm_stats);
1857 * Initialize a preallocated and zeroed pmap structure,
1858 * such as one in a vmspace structure.
1861 pmap_pinit(pmap_t pmap)
1863 vm_page_t m, ptdpg[NPGPTD];
1868 * No need to allocate page table space yet but we do need a valid
1869 * page directory table.
1871 if (pmap->pm_pdir == NULL) {
1872 pmap->pm_pdir = (pd_entry_t *)kva_alloc(NBPTD);
1873 if (pmap->pm_pdir == NULL)
1875 #if defined(PAE) || defined(PAE_TABLES)
1876 pmap->pm_pdpt = uma_zalloc(pdptzone, M_WAITOK | M_ZERO);
1877 KASSERT(((vm_offset_t)pmap->pm_pdpt &
1878 ((NPGPTD * sizeof(pdpt_entry_t)) - 1)) == 0,
1879 ("pmap_pinit: pdpt misaligned"));
1880 KASSERT(pmap_kextract((vm_offset_t)pmap->pm_pdpt) < (4ULL<<30),
1881 ("pmap_pinit: pdpt above 4g"));
1883 pmap->pm_root.rt_root = 0;
1885 KASSERT(vm_radix_is_empty(&pmap->pm_root),
1886 ("pmap_pinit: pmap has reserved page table page(s)"));
1889 * allocate the page directory page(s)
1891 for (i = 0; i < NPGPTD;) {
1892 m = vm_page_alloc(NULL, 0, VM_ALLOC_NORMAL | VM_ALLOC_NOOBJ |
1893 VM_ALLOC_WIRED | VM_ALLOC_ZERO);
1901 pmap_qenter((vm_offset_t)pmap->pm_pdir, ptdpg, NPGPTD);
1903 for (i = 0; i < NPGPTD; i++)
1904 if ((ptdpg[i]->flags & PG_ZERO) == 0)
1905 pagezero(pmap->pm_pdir + (i * NPDEPG));
1907 mtx_lock_spin(&allpmaps_lock);
1908 LIST_INSERT_HEAD(&allpmaps, pmap, pm_list);
1909 /* Copy the kernel page table directory entries. */
1910 bcopy(PTD + KPTDI, pmap->pm_pdir + KPTDI, nkpt * sizeof(pd_entry_t));
1911 mtx_unlock_spin(&allpmaps_lock);
1913 /* install self-referential address mapping entry(s) */
1914 for (i = 0; i < NPGPTD; i++) {
1915 pa = VM_PAGE_TO_PHYS(ptdpg[i]);
1916 pmap->pm_pdir[PTDPTDI + i] = pa | PG_V | PG_RW | PG_A | PG_M;
1917 #if defined(PAE) || defined(PAE_TABLES)
1918 pmap->pm_pdpt[i] = pa | PG_V;
1922 CPU_ZERO(&pmap->pm_active);
1923 TAILQ_INIT(&pmap->pm_pvchunk);
1924 bzero(&pmap->pm_stats, sizeof pmap->pm_stats);
1930 * this routine is called if the page table page is not
1934 _pmap_allocpte(pmap_t pmap, u_int ptepindex, u_int flags)
1940 * Allocate a page table page.
1942 if ((m = vm_page_alloc(NULL, ptepindex, VM_ALLOC_NOOBJ |
1943 VM_ALLOC_WIRED | VM_ALLOC_ZERO)) == NULL) {
1944 if ((flags & PMAP_ENTER_NOSLEEP) == 0) {
1946 rw_wunlock(&pvh_global_lock);
1948 rw_wlock(&pvh_global_lock);
1953 * Indicate the need to retry. While waiting, the page table
1954 * page may have been allocated.
1958 if ((m->flags & PG_ZERO) == 0)
1962 * Map the pagetable page into the process address space, if
1963 * it isn't already there.
1966 pmap->pm_stats.resident_count++;
1968 ptepa = VM_PAGE_TO_PHYS(m);
1969 pmap->pm_pdir[ptepindex] =
1970 (pd_entry_t) (ptepa | PG_U | PG_RW | PG_V | PG_A | PG_M);
1976 pmap_allocpte(pmap_t pmap, vm_offset_t va, u_int flags)
1983 * Calculate pagetable page index
1985 ptepindex = va >> PDRSHIFT;
1988 * Get the page directory entry
1990 ptepa = pmap->pm_pdir[ptepindex];
1993 * This supports switching from a 4MB page to a
1996 if (ptepa & PG_PS) {
1997 (void)pmap_demote_pde(pmap, &pmap->pm_pdir[ptepindex], va);
1998 ptepa = pmap->pm_pdir[ptepindex];
2002 * If the page table page is mapped, we just increment the
2003 * hold count, and activate it.
2006 m = PHYS_TO_VM_PAGE(ptepa & PG_FRAME);
2010 * Here if the pte page isn't mapped, or if it has
2013 m = _pmap_allocpte(pmap, ptepindex, flags);
2014 if (m == NULL && (flags & PMAP_ENTER_NOSLEEP) == 0)
2021 /***************************************************
2022 * Pmap allocation/deallocation routines.
2023 ***************************************************/
2026 * Release any resources held by the given physical map.
2027 * Called when a pmap initialized by pmap_pinit is being released.
2028 * Should only be called if the map contains no valid mappings.
2031 pmap_release(pmap_t pmap)
2033 vm_page_t m, ptdpg[NPGPTD];
2036 KASSERT(pmap->pm_stats.resident_count == 0,
2037 ("pmap_release: pmap resident count %ld != 0",
2038 pmap->pm_stats.resident_count));
2039 KASSERT(vm_radix_is_empty(&pmap->pm_root),
2040 ("pmap_release: pmap has reserved page table page(s)"));
2041 KASSERT(CPU_EMPTY(&pmap->pm_active),
2042 ("releasing active pmap %p", pmap));
2044 mtx_lock_spin(&allpmaps_lock);
2045 LIST_REMOVE(pmap, pm_list);
2046 mtx_unlock_spin(&allpmaps_lock);
2048 for (i = 0; i < NPGPTD; i++)
2049 ptdpg[i] = PHYS_TO_VM_PAGE(pmap->pm_pdir[PTDPTDI + i] &
2052 bzero(pmap->pm_pdir + PTDPTDI, (nkpt + NPGPTD) *
2053 sizeof(*pmap->pm_pdir));
2055 pmap_qremove((vm_offset_t)pmap->pm_pdir, NPGPTD);
2057 for (i = 0; i < NPGPTD; i++) {
2059 #if defined(PAE) || defined(PAE_TABLES)
2060 KASSERT(VM_PAGE_TO_PHYS(m) == (pmap->pm_pdpt[i] & PG_FRAME),
2061 ("pmap_release: got wrong ptd page"));
2064 atomic_subtract_int(&vm_cnt.v_wire_count, 1);
2065 vm_page_free_zero(m);
2070 kvm_size(SYSCTL_HANDLER_ARGS)
2072 unsigned long ksize = VM_MAX_KERNEL_ADDRESS - KERNBASE;
2074 return (sysctl_handle_long(oidp, &ksize, 0, req));
2076 SYSCTL_PROC(_vm, OID_AUTO, kvm_size, CTLTYPE_LONG|CTLFLAG_RD,
2077 0, 0, kvm_size, "IU", "Size of KVM");
2080 kvm_free(SYSCTL_HANDLER_ARGS)
2082 unsigned long kfree = VM_MAX_KERNEL_ADDRESS - kernel_vm_end;
2084 return (sysctl_handle_long(oidp, &kfree, 0, req));
2086 SYSCTL_PROC(_vm, OID_AUTO, kvm_free, CTLTYPE_LONG|CTLFLAG_RD,
2087 0, 0, kvm_free, "IU", "Amount of KVM free");
2090 * grow the number of kernel page table entries, if needed
2093 pmap_growkernel(vm_offset_t addr)
2095 vm_paddr_t ptppaddr;
2099 mtx_assert(&kernel_map->system_mtx, MA_OWNED);
2100 addr = roundup2(addr, NBPDR);
2101 if (addr - 1 >= kernel_map->max_offset)
2102 addr = kernel_map->max_offset;
2103 while (kernel_vm_end < addr) {
2104 if (pdir_pde(PTD, kernel_vm_end)) {
2105 kernel_vm_end = (kernel_vm_end + NBPDR) & ~PDRMASK;
2106 if (kernel_vm_end - 1 >= kernel_map->max_offset) {
2107 kernel_vm_end = kernel_map->max_offset;
2113 nkpg = vm_page_alloc(NULL, kernel_vm_end >> PDRSHIFT,
2114 VM_ALLOC_INTERRUPT | VM_ALLOC_NOOBJ | VM_ALLOC_WIRED |
2117 panic("pmap_growkernel: no memory to grow kernel");
2121 if ((nkpg->flags & PG_ZERO) == 0)
2122 pmap_zero_page(nkpg);
2123 ptppaddr = VM_PAGE_TO_PHYS(nkpg);
2124 newpdir = (pd_entry_t) (ptppaddr | PG_V | PG_RW | PG_A | PG_M);
2125 pdir_pde(KPTD, kernel_vm_end) = pgeflag | newpdir;
2127 pmap_kenter_pde(kernel_vm_end, newpdir);
2128 kernel_vm_end = (kernel_vm_end + NBPDR) & ~PDRMASK;
2129 if (kernel_vm_end - 1 >= kernel_map->max_offset) {
2130 kernel_vm_end = kernel_map->max_offset;
2137 /***************************************************
2138 * page management routines.
2139 ***************************************************/
2141 CTASSERT(sizeof(struct pv_chunk) == PAGE_SIZE);
2142 CTASSERT(_NPCM == 11);
2143 CTASSERT(_NPCPV == 336);
2145 static __inline struct pv_chunk *
2146 pv_to_chunk(pv_entry_t pv)
2149 return ((struct pv_chunk *)((uintptr_t)pv & ~(uintptr_t)PAGE_MASK));
2152 #define PV_PMAP(pv) (pv_to_chunk(pv)->pc_pmap)
2154 #define PC_FREE0_9 0xfffffffful /* Free values for index 0 through 9 */
2155 #define PC_FREE10 0x0000fffful /* Free values for index 10 */
2157 static const uint32_t pc_freemask[_NPCM] = {
2158 PC_FREE0_9, PC_FREE0_9, PC_FREE0_9,
2159 PC_FREE0_9, PC_FREE0_9, PC_FREE0_9,
2160 PC_FREE0_9, PC_FREE0_9, PC_FREE0_9,
2161 PC_FREE0_9, PC_FREE10
2164 SYSCTL_INT(_vm_pmap, OID_AUTO, pv_entry_count, CTLFLAG_RD, &pv_entry_count, 0,
2165 "Current number of pv entries");
2168 static int pc_chunk_count, pc_chunk_allocs, pc_chunk_frees, pc_chunk_tryfail;
2170 SYSCTL_INT(_vm_pmap, OID_AUTO, pc_chunk_count, CTLFLAG_RD, &pc_chunk_count, 0,
2171 "Current number of pv entry chunks");
2172 SYSCTL_INT(_vm_pmap, OID_AUTO, pc_chunk_allocs, CTLFLAG_RD, &pc_chunk_allocs, 0,
2173 "Current number of pv entry chunks allocated");
2174 SYSCTL_INT(_vm_pmap, OID_AUTO, pc_chunk_frees, CTLFLAG_RD, &pc_chunk_frees, 0,
2175 "Current number of pv entry chunks frees");
2176 SYSCTL_INT(_vm_pmap, OID_AUTO, pc_chunk_tryfail, CTLFLAG_RD, &pc_chunk_tryfail, 0,
2177 "Number of times tried to get a chunk page but failed.");
2179 static long pv_entry_frees, pv_entry_allocs;
2180 static int pv_entry_spare;
2182 SYSCTL_LONG(_vm_pmap, OID_AUTO, pv_entry_frees, CTLFLAG_RD, &pv_entry_frees, 0,
2183 "Current number of pv entry frees");
2184 SYSCTL_LONG(_vm_pmap, OID_AUTO, pv_entry_allocs, CTLFLAG_RD, &pv_entry_allocs, 0,
2185 "Current number of pv entry allocs");
2186 SYSCTL_INT(_vm_pmap, OID_AUTO, pv_entry_spare, CTLFLAG_RD, &pv_entry_spare, 0,
2187 "Current number of spare pv entries");
2191 * We are in a serious low memory condition. Resort to
2192 * drastic measures to free some pages so we can allocate
2193 * another pv entry chunk.
2196 pmap_pv_reclaim(pmap_t locked_pmap)
2199 struct pv_chunk *pc;
2200 struct md_page *pvh;
2203 pt_entry_t *pte, tpte;
2207 struct spglist free;
2209 int bit, field, freed;
2211 PMAP_LOCK_ASSERT(locked_pmap, MA_OWNED);
2215 TAILQ_INIT(&newtail);
2216 while ((pc = TAILQ_FIRST(&pv_chunks)) != NULL && (pv_vafree == 0 ||
2217 SLIST_EMPTY(&free))) {
2218 TAILQ_REMOVE(&pv_chunks, pc, pc_lru);
2219 if (pmap != pc->pc_pmap) {
2221 pmap_invalidate_all(pmap);
2222 if (pmap != locked_pmap)
2226 /* Avoid deadlock and lock recursion. */
2227 if (pmap > locked_pmap)
2229 else if (pmap != locked_pmap && !PMAP_TRYLOCK(pmap)) {
2231 TAILQ_INSERT_TAIL(&newtail, pc, pc_lru);
2237 * Destroy every non-wired, 4 KB page mapping in the chunk.
2240 for (field = 0; field < _NPCM; field++) {
2241 for (inuse = ~pc->pc_map[field] & pc_freemask[field];
2242 inuse != 0; inuse &= ~(1UL << bit)) {
2244 pv = &pc->pc_pventry[field * 32 + bit];
2246 pde = pmap_pde(pmap, va);
2247 if ((*pde & PG_PS) != 0)
2249 pte = pmap_pte(pmap, va);
2251 if ((tpte & PG_W) == 0)
2252 tpte = pte_load_clear(pte);
2253 pmap_pte_release(pte);
2254 if ((tpte & PG_W) != 0)
2257 ("pmap_pv_reclaim: pmap %p va %x zero pte",
2259 if ((tpte & PG_G) != 0)
2260 pmap_invalidate_page(pmap, va);
2261 m = PHYS_TO_VM_PAGE(tpte & PG_FRAME);
2262 if ((tpte & (PG_M | PG_RW)) == (PG_M | PG_RW))
2264 if ((tpte & PG_A) != 0)
2265 vm_page_aflag_set(m, PGA_REFERENCED);
2266 TAILQ_REMOVE(&m->md.pv_list, pv, pv_next);
2267 if (TAILQ_EMPTY(&m->md.pv_list) &&
2268 (m->flags & PG_FICTITIOUS) == 0) {
2269 pvh = pa_to_pvh(VM_PAGE_TO_PHYS(m));
2270 if (TAILQ_EMPTY(&pvh->pv_list)) {
2271 vm_page_aflag_clear(m,
2275 pc->pc_map[field] |= 1UL << bit;
2276 pmap_unuse_pt(pmap, va, &free);
2281 TAILQ_INSERT_TAIL(&newtail, pc, pc_lru);
2284 /* Every freed mapping is for a 4 KB page. */
2285 pmap->pm_stats.resident_count -= freed;
2286 PV_STAT(pv_entry_frees += freed);
2287 PV_STAT(pv_entry_spare += freed);
2288 pv_entry_count -= freed;
2289 TAILQ_REMOVE(&pmap->pm_pvchunk, pc, pc_list);
2290 for (field = 0; field < _NPCM; field++)
2291 if (pc->pc_map[field] != pc_freemask[field]) {
2292 TAILQ_INSERT_HEAD(&pmap->pm_pvchunk, pc,
2294 TAILQ_INSERT_TAIL(&newtail, pc, pc_lru);
2297 * One freed pv entry in locked_pmap is
2300 if (pmap == locked_pmap)
2304 if (field == _NPCM) {
2305 PV_STAT(pv_entry_spare -= _NPCPV);
2306 PV_STAT(pc_chunk_count--);
2307 PV_STAT(pc_chunk_frees++);
2308 /* Entire chunk is free; return it. */
2309 m_pc = PHYS_TO_VM_PAGE(pmap_kextract((vm_offset_t)pc));
2310 pmap_qremove((vm_offset_t)pc, 1);
2311 pmap_ptelist_free(&pv_vafree, (vm_offset_t)pc);
2316 TAILQ_CONCAT(&pv_chunks, &newtail, pc_lru);
2318 pmap_invalidate_all(pmap);
2319 if (pmap != locked_pmap)
2322 if (m_pc == NULL && pv_vafree != 0 && SLIST_EMPTY(&free)) {
2323 m_pc = SLIST_FIRST(&free);
2324 SLIST_REMOVE_HEAD(&free, plinks.s.ss);
2325 /* Recycle a freed page table page. */
2326 m_pc->wire_count = 1;
2327 atomic_add_int(&vm_cnt.v_wire_count, 1);
2329 pmap_free_zero_pages(&free);
2334 * free the pv_entry back to the free list
2337 free_pv_entry(pmap_t pmap, pv_entry_t pv)
2339 struct pv_chunk *pc;
2340 int idx, field, bit;
2342 rw_assert(&pvh_global_lock, RA_WLOCKED);
2343 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
2344 PV_STAT(pv_entry_frees++);
2345 PV_STAT(pv_entry_spare++);
2347 pc = pv_to_chunk(pv);
2348 idx = pv - &pc->pc_pventry[0];
2351 pc->pc_map[field] |= 1ul << bit;
2352 for (idx = 0; idx < _NPCM; idx++)
2353 if (pc->pc_map[idx] != pc_freemask[idx]) {
2355 * 98% of the time, pc is already at the head of the
2356 * list. If it isn't already, move it to the head.
2358 if (__predict_false(TAILQ_FIRST(&pmap->pm_pvchunk) !=
2360 TAILQ_REMOVE(&pmap->pm_pvchunk, pc, pc_list);
2361 TAILQ_INSERT_HEAD(&pmap->pm_pvchunk, pc,
2366 TAILQ_REMOVE(&pmap->pm_pvchunk, pc, pc_list);
2371 free_pv_chunk(struct pv_chunk *pc)
2375 TAILQ_REMOVE(&pv_chunks, pc, pc_lru);
2376 PV_STAT(pv_entry_spare -= _NPCPV);
2377 PV_STAT(pc_chunk_count--);
2378 PV_STAT(pc_chunk_frees++);
2379 /* entire chunk is free, return it */
2380 m = PHYS_TO_VM_PAGE(pmap_kextract((vm_offset_t)pc));
2381 pmap_qremove((vm_offset_t)pc, 1);
2382 vm_page_unwire(m, PQ_NONE);
2384 pmap_ptelist_free(&pv_vafree, (vm_offset_t)pc);
2388 * get a new pv_entry, allocating a block from the system
2392 get_pv_entry(pmap_t pmap, boolean_t try)
2394 static const struct timeval printinterval = { 60, 0 };
2395 static struct timeval lastprint;
2398 struct pv_chunk *pc;
2401 rw_assert(&pvh_global_lock, RA_WLOCKED);
2402 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
2403 PV_STAT(pv_entry_allocs++);
2405 if (pv_entry_count > pv_entry_high_water)
2406 if (ratecheck(&lastprint, &printinterval))
2407 printf("Approaching the limit on PV entries, consider "
2408 "increasing either the vm.pmap.shpgperproc or the "
2409 "vm.pmap.pv_entry_max tunable.\n");
2411 pc = TAILQ_FIRST(&pmap->pm_pvchunk);
2413 for (field = 0; field < _NPCM; field++) {
2414 if (pc->pc_map[field]) {
2415 bit = bsfl(pc->pc_map[field]);
2419 if (field < _NPCM) {
2420 pv = &pc->pc_pventry[field * 32 + bit];
2421 pc->pc_map[field] &= ~(1ul << bit);
2422 /* If this was the last item, move it to tail */
2423 for (field = 0; field < _NPCM; field++)
2424 if (pc->pc_map[field] != 0) {
2425 PV_STAT(pv_entry_spare--);
2426 return (pv); /* not full, return */
2428 TAILQ_REMOVE(&pmap->pm_pvchunk, pc, pc_list);
2429 TAILQ_INSERT_TAIL(&pmap->pm_pvchunk, pc, pc_list);
2430 PV_STAT(pv_entry_spare--);
2435 * Access to the ptelist "pv_vafree" is synchronized by the pvh
2436 * global lock. If "pv_vafree" is currently non-empty, it will
2437 * remain non-empty until pmap_ptelist_alloc() completes.
2439 if (pv_vafree == 0 || (m = vm_page_alloc(NULL, 0, VM_ALLOC_NORMAL |
2440 VM_ALLOC_NOOBJ | VM_ALLOC_WIRED)) == NULL) {
2443 PV_STAT(pc_chunk_tryfail++);
2446 m = pmap_pv_reclaim(pmap);
2450 PV_STAT(pc_chunk_count++);
2451 PV_STAT(pc_chunk_allocs++);
2452 pc = (struct pv_chunk *)pmap_ptelist_alloc(&pv_vafree);
2453 pmap_qenter((vm_offset_t)pc, &m, 1);
2455 pc->pc_map[0] = pc_freemask[0] & ~1ul; /* preallocated bit 0 */
2456 for (field = 1; field < _NPCM; field++)
2457 pc->pc_map[field] = pc_freemask[field];
2458 TAILQ_INSERT_TAIL(&pv_chunks, pc, pc_lru);
2459 pv = &pc->pc_pventry[0];
2460 TAILQ_INSERT_HEAD(&pmap->pm_pvchunk, pc, pc_list);
2461 PV_STAT(pv_entry_spare += _NPCPV - 1);
2465 static __inline pv_entry_t
2466 pmap_pvh_remove(struct md_page *pvh, pmap_t pmap, vm_offset_t va)
2470 rw_assert(&pvh_global_lock, RA_WLOCKED);
2471 TAILQ_FOREACH(pv, &pvh->pv_list, pv_next) {
2472 if (pmap == PV_PMAP(pv) && va == pv->pv_va) {
2473 TAILQ_REMOVE(&pvh->pv_list, pv, pv_next);
2481 pmap_pv_demote_pde(pmap_t pmap, vm_offset_t va, vm_paddr_t pa)
2483 struct md_page *pvh;
2485 vm_offset_t va_last;
2488 rw_assert(&pvh_global_lock, RA_WLOCKED);
2489 KASSERT((pa & PDRMASK) == 0,
2490 ("pmap_pv_demote_pde: pa is not 4mpage aligned"));
2493 * Transfer the 4mpage's pv entry for this mapping to the first
2496 pvh = pa_to_pvh(pa);
2497 va = trunc_4mpage(va);
2498 pv = pmap_pvh_remove(pvh, pmap, va);
2499 KASSERT(pv != NULL, ("pmap_pv_demote_pde: pv not found"));
2500 m = PHYS_TO_VM_PAGE(pa);
2501 TAILQ_INSERT_TAIL(&m->md.pv_list, pv, pv_next);
2502 /* Instantiate the remaining NPTEPG - 1 pv entries. */
2503 va_last = va + NBPDR - PAGE_SIZE;
2506 KASSERT((m->oflags & VPO_UNMANAGED) == 0,
2507 ("pmap_pv_demote_pde: page %p is not managed", m));
2509 pmap_insert_entry(pmap, va, m);
2510 } while (va < va_last);
2514 pmap_pv_promote_pde(pmap_t pmap, vm_offset_t va, vm_paddr_t pa)
2516 struct md_page *pvh;
2518 vm_offset_t va_last;
2521 rw_assert(&pvh_global_lock, RA_WLOCKED);
2522 KASSERT((pa & PDRMASK) == 0,
2523 ("pmap_pv_promote_pde: pa is not 4mpage aligned"));
2526 * Transfer the first page's pv entry for this mapping to the
2527 * 4mpage's pv list. Aside from avoiding the cost of a call
2528 * to get_pv_entry(), a transfer avoids the possibility that
2529 * get_pv_entry() calls pmap_collect() and that pmap_collect()
2530 * removes one of the mappings that is being promoted.
2532 m = PHYS_TO_VM_PAGE(pa);
2533 va = trunc_4mpage(va);
2534 pv = pmap_pvh_remove(&m->md, pmap, va);
2535 KASSERT(pv != NULL, ("pmap_pv_promote_pde: pv not found"));
2536 pvh = pa_to_pvh(pa);
2537 TAILQ_INSERT_TAIL(&pvh->pv_list, pv, pv_next);
2538 /* Free the remaining NPTEPG - 1 pv entries. */
2539 va_last = va + NBPDR - PAGE_SIZE;
2543 pmap_pvh_free(&m->md, pmap, va);
2544 } while (va < va_last);
2548 pmap_pvh_free(struct md_page *pvh, pmap_t pmap, vm_offset_t va)
2552 pv = pmap_pvh_remove(pvh, pmap, va);
2553 KASSERT(pv != NULL, ("pmap_pvh_free: pv not found"));
2554 free_pv_entry(pmap, pv);
2558 pmap_remove_entry(pmap_t pmap, vm_page_t m, vm_offset_t va)
2560 struct md_page *pvh;
2562 rw_assert(&pvh_global_lock, RA_WLOCKED);
2563 pmap_pvh_free(&m->md, pmap, va);
2564 if (TAILQ_EMPTY(&m->md.pv_list) && (m->flags & PG_FICTITIOUS) == 0) {
2565 pvh = pa_to_pvh(VM_PAGE_TO_PHYS(m));
2566 if (TAILQ_EMPTY(&pvh->pv_list))
2567 vm_page_aflag_clear(m, PGA_WRITEABLE);
2572 * Create a pv entry for page at pa for
2576 pmap_insert_entry(pmap_t pmap, vm_offset_t va, vm_page_t m)
2580 rw_assert(&pvh_global_lock, RA_WLOCKED);
2581 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
2582 pv = get_pv_entry(pmap, FALSE);
2584 TAILQ_INSERT_TAIL(&m->md.pv_list, pv, pv_next);
2588 * Conditionally create a pv entry.
2591 pmap_try_insert_pv_entry(pmap_t pmap, vm_offset_t va, vm_page_t m)
2595 rw_assert(&pvh_global_lock, RA_WLOCKED);
2596 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
2597 if (pv_entry_count < pv_entry_high_water &&
2598 (pv = get_pv_entry(pmap, TRUE)) != NULL) {
2600 TAILQ_INSERT_TAIL(&m->md.pv_list, pv, pv_next);
2607 * Create the pv entries for each of the pages within a superpage.
2610 pmap_pv_insert_pde(pmap_t pmap, vm_offset_t va, vm_paddr_t pa)
2612 struct md_page *pvh;
2615 rw_assert(&pvh_global_lock, RA_WLOCKED);
2616 if (pv_entry_count < pv_entry_high_water &&
2617 (pv = get_pv_entry(pmap, TRUE)) != NULL) {
2619 pvh = pa_to_pvh(pa);
2620 TAILQ_INSERT_TAIL(&pvh->pv_list, pv, pv_next);
2627 * Fills a page table page with mappings to consecutive physical pages.
2630 pmap_fill_ptp(pt_entry_t *firstpte, pt_entry_t newpte)
2634 for (pte = firstpte; pte < firstpte + NPTEPG; pte++) {
2636 newpte += PAGE_SIZE;
2641 * Tries to demote a 2- or 4MB page mapping. If demotion fails, the
2642 * 2- or 4MB page mapping is invalidated.
2645 pmap_demote_pde(pmap_t pmap, pd_entry_t *pde, vm_offset_t va)
2647 pd_entry_t newpde, oldpde;
2648 pt_entry_t *firstpte, newpte;
2651 struct spglist free;
2654 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
2656 KASSERT((oldpde & (PG_PS | PG_V)) == (PG_PS | PG_V),
2657 ("pmap_demote_pde: oldpde is missing PG_PS and/or PG_V"));
2658 if ((oldpde & PG_A) == 0 || (mpte = pmap_remove_pt_page(pmap, va)) ==
2660 KASSERT((oldpde & PG_W) == 0,
2661 ("pmap_demote_pde: page table page for a wired mapping"
2665 * Invalidate the 2- or 4MB page mapping and return
2666 * "failure" if the mapping was never accessed or the
2667 * allocation of the new page table page fails.
2669 if ((oldpde & PG_A) == 0 || (mpte = vm_page_alloc(NULL,
2670 va >> PDRSHIFT, VM_ALLOC_NOOBJ | VM_ALLOC_NORMAL |
2671 VM_ALLOC_WIRED)) == NULL) {
2673 sva = trunc_4mpage(va);
2674 pmap_remove_pde(pmap, pde, sva, &free);
2675 if ((oldpde & PG_G) == 0)
2676 pmap_invalidate_pde_page(pmap, sva, oldpde);
2677 pmap_free_zero_pages(&free);
2678 CTR2(KTR_PMAP, "pmap_demote_pde: failure for va %#x"
2679 " in pmap %p", va, pmap);
2682 if (va < VM_MAXUSER_ADDRESS)
2683 pmap->pm_stats.resident_count++;
2685 mptepa = VM_PAGE_TO_PHYS(mpte);
2688 * If the page mapping is in the kernel's address space, then the
2689 * KPTmap can provide access to the page table page. Otherwise,
2690 * temporarily map the page table page (mpte) into the kernel's
2691 * address space at either PADDR1 or PADDR2.
2694 firstpte = &KPTmap[i386_btop(trunc_4mpage(va))];
2695 else if (curthread->td_pinned > 0 && rw_wowned(&pvh_global_lock)) {
2696 if ((*PMAP1 & PG_FRAME) != mptepa) {
2697 *PMAP1 = mptepa | PG_RW | PG_V | PG_A | PG_M;
2699 PMAP1cpu = PCPU_GET(cpuid);
2705 if (PMAP1cpu != PCPU_GET(cpuid)) {
2706 PMAP1cpu = PCPU_GET(cpuid);
2714 mtx_lock(&PMAP2mutex);
2715 if ((*PMAP2 & PG_FRAME) != mptepa) {
2716 *PMAP2 = mptepa | PG_RW | PG_V | PG_A | PG_M;
2717 pmap_invalidate_page(kernel_pmap, (vm_offset_t)PADDR2);
2721 newpde = mptepa | PG_M | PG_A | (oldpde & PG_U) | PG_RW | PG_V;
2722 KASSERT((oldpde & PG_A) != 0,
2723 ("pmap_demote_pde: oldpde is missing PG_A"));
2724 KASSERT((oldpde & (PG_M | PG_RW)) != PG_RW,
2725 ("pmap_demote_pde: oldpde is missing PG_M"));
2726 newpte = oldpde & ~PG_PS;
2727 if ((newpte & PG_PDE_PAT) != 0)
2728 newpte ^= PG_PDE_PAT | PG_PTE_PAT;
2731 * If the page table page is new, initialize it.
2733 if (mpte->wire_count == 1) {
2734 mpte->wire_count = NPTEPG;
2735 pmap_fill_ptp(firstpte, newpte);
2737 KASSERT((*firstpte & PG_FRAME) == (newpte & PG_FRAME),
2738 ("pmap_demote_pde: firstpte and newpte map different physical"
2742 * If the mapping has changed attributes, update the page table
2745 if ((*firstpte & PG_PTE_PROMOTE) != (newpte & PG_PTE_PROMOTE))
2746 pmap_fill_ptp(firstpte, newpte);
2749 * Demote the mapping. This pmap is locked. The old PDE has
2750 * PG_A set. If the old PDE has PG_RW set, it also has PG_M
2751 * set. Thus, there is no danger of a race with another
2752 * processor changing the setting of PG_A and/or PG_M between
2753 * the read above and the store below.
2755 if (workaround_erratum383)
2756 pmap_update_pde(pmap, va, pde, newpde);
2757 else if (pmap == kernel_pmap)
2758 pmap_kenter_pde(va, newpde);
2760 pde_store(pde, newpde);
2761 if (firstpte == PADDR2)
2762 mtx_unlock(&PMAP2mutex);
2765 * Invalidate the recursive mapping of the page table page.
2767 pmap_invalidate_page(pmap, (vm_offset_t)vtopte(va));
2770 * Demote the pv entry. This depends on the earlier demotion
2771 * of the mapping. Specifically, the (re)creation of a per-
2772 * page pv entry might trigger the execution of pmap_collect(),
2773 * which might reclaim a newly (re)created per-page pv entry
2774 * and destroy the associated mapping. In order to destroy
2775 * the mapping, the PDE must have already changed from mapping
2776 * the 2mpage to referencing the page table page.
2778 if ((oldpde & PG_MANAGED) != 0)
2779 pmap_pv_demote_pde(pmap, va, oldpde & PG_PS_FRAME);
2781 pmap_pde_demotions++;
2782 CTR2(KTR_PMAP, "pmap_demote_pde: success for va %#x"
2783 " in pmap %p", va, pmap);
2788 * Removes a 2- or 4MB page mapping from the kernel pmap.
2791 pmap_remove_kernel_pde(pmap_t pmap, pd_entry_t *pde, vm_offset_t va)
2797 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
2798 mpte = pmap_remove_pt_page(pmap, va);
2800 panic("pmap_remove_kernel_pde: Missing pt page.");
2802 mptepa = VM_PAGE_TO_PHYS(mpte);
2803 newpde = mptepa | PG_M | PG_A | PG_RW | PG_V;
2806 * Initialize the page table page.
2808 pagezero((void *)&KPTmap[i386_btop(trunc_4mpage(va))]);
2811 * Remove the mapping.
2813 if (workaround_erratum383)
2814 pmap_update_pde(pmap, va, pde, newpde);
2816 pmap_kenter_pde(va, newpde);
2819 * Invalidate the recursive mapping of the page table page.
2821 pmap_invalidate_page(pmap, (vm_offset_t)vtopte(va));
2825 * pmap_remove_pde: do the things to unmap a superpage in a process
2828 pmap_remove_pde(pmap_t pmap, pd_entry_t *pdq, vm_offset_t sva,
2829 struct spglist *free)
2831 struct md_page *pvh;
2833 vm_offset_t eva, va;
2836 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
2837 KASSERT((sva & PDRMASK) == 0,
2838 ("pmap_remove_pde: sva is not 4mpage aligned"));
2839 oldpde = pte_load_clear(pdq);
2841 pmap->pm_stats.wired_count -= NBPDR / PAGE_SIZE;
2844 * Machines that don't support invlpg, also don't support
2847 if ((oldpde & PG_G) != 0)
2848 pmap_invalidate_pde_page(kernel_pmap, sva, oldpde);
2850 pmap->pm_stats.resident_count -= NBPDR / PAGE_SIZE;
2851 if (oldpde & PG_MANAGED) {
2852 pvh = pa_to_pvh(oldpde & PG_PS_FRAME);
2853 pmap_pvh_free(pvh, pmap, sva);
2855 for (va = sva, m = PHYS_TO_VM_PAGE(oldpde & PG_PS_FRAME);
2856 va < eva; va += PAGE_SIZE, m++) {
2857 if ((oldpde & (PG_M | PG_RW)) == (PG_M | PG_RW))
2860 vm_page_aflag_set(m, PGA_REFERENCED);
2861 if (TAILQ_EMPTY(&m->md.pv_list) &&
2862 TAILQ_EMPTY(&pvh->pv_list))
2863 vm_page_aflag_clear(m, PGA_WRITEABLE);
2866 if (pmap == kernel_pmap) {
2867 pmap_remove_kernel_pde(pmap, pdq, sva);
2869 mpte = pmap_remove_pt_page(pmap, sva);
2871 pmap->pm_stats.resident_count--;
2872 KASSERT(mpte->wire_count == NPTEPG,
2873 ("pmap_remove_pde: pte page wire count error"));
2874 mpte->wire_count = 0;
2875 pmap_add_delayed_free_list(mpte, free, FALSE);
2876 atomic_subtract_int(&vm_cnt.v_wire_count, 1);
2882 * pmap_remove_pte: do the things to unmap a page in a process
2885 pmap_remove_pte(pmap_t pmap, pt_entry_t *ptq, vm_offset_t va,
2886 struct spglist *free)
2891 rw_assert(&pvh_global_lock, RA_WLOCKED);
2892 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
2893 oldpte = pte_load_clear(ptq);
2894 KASSERT(oldpte != 0,
2895 ("pmap_remove_pte: pmap %p va %x zero pte", pmap, va));
2897 pmap->pm_stats.wired_count -= 1;
2899 * Machines that don't support invlpg, also don't support
2903 pmap_invalidate_page(kernel_pmap, va);
2904 pmap->pm_stats.resident_count -= 1;
2905 if (oldpte & PG_MANAGED) {
2906 m = PHYS_TO_VM_PAGE(oldpte & PG_FRAME);
2907 if ((oldpte & (PG_M | PG_RW)) == (PG_M | PG_RW))
2910 vm_page_aflag_set(m, PGA_REFERENCED);
2911 pmap_remove_entry(pmap, m, va);
2913 return (pmap_unuse_pt(pmap, va, free));
2917 * Remove a single page from a process address space
2920 pmap_remove_page(pmap_t pmap, vm_offset_t va, struct spglist *free)
2924 rw_assert(&pvh_global_lock, RA_WLOCKED);
2925 KASSERT(curthread->td_pinned > 0, ("curthread not pinned"));
2926 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
2927 if ((pte = pmap_pte_quick(pmap, va)) == NULL || *pte == 0)
2929 pmap_remove_pte(pmap, pte, va, free);
2930 pmap_invalidate_page(pmap, va);
2934 * Remove the given range of addresses from the specified map.
2936 * It is assumed that the start and end are properly
2937 * rounded to the page size.
2940 pmap_remove(pmap_t pmap, vm_offset_t sva, vm_offset_t eva)
2945 struct spglist free;
2949 * Perform an unsynchronized read. This is, however, safe.
2951 if (pmap->pm_stats.resident_count == 0)
2957 rw_wlock(&pvh_global_lock);
2962 * special handling of removing one page. a very
2963 * common operation and easy to short circuit some
2966 if ((sva + PAGE_SIZE == eva) &&
2967 ((pmap->pm_pdir[(sva >> PDRSHIFT)] & PG_PS) == 0)) {
2968 pmap_remove_page(pmap, sva, &free);
2972 for (; sva < eva; sva = pdnxt) {
2976 * Calculate index for next page table.
2978 pdnxt = (sva + NBPDR) & ~PDRMASK;
2981 if (pmap->pm_stats.resident_count == 0)
2984 pdirindex = sva >> PDRSHIFT;
2985 ptpaddr = pmap->pm_pdir[pdirindex];
2988 * Weed out invalid mappings. Note: we assume that the page
2989 * directory table is always allocated, and in kernel virtual.
2995 * Check for large page.
2997 if ((ptpaddr & PG_PS) != 0) {
2999 * Are we removing the entire large page? If not,
3000 * demote the mapping and fall through.
3002 if (sva + NBPDR == pdnxt && eva >= pdnxt) {
3004 * The TLB entry for a PG_G mapping is
3005 * invalidated by pmap_remove_pde().
3007 if ((ptpaddr & PG_G) == 0)
3009 pmap_remove_pde(pmap,
3010 &pmap->pm_pdir[pdirindex], sva, &free);
3012 } else if (!pmap_demote_pde(pmap,
3013 &pmap->pm_pdir[pdirindex], sva)) {
3014 /* The large page mapping was destroyed. */
3020 * Limit our scan to either the end of the va represented
3021 * by the current page table page, or to the end of the
3022 * range being removed.
3027 for (pte = pmap_pte_quick(pmap, sva); sva != pdnxt; pte++,
3033 * The TLB entry for a PG_G mapping is invalidated
3034 * by pmap_remove_pte().
3036 if ((*pte & PG_G) == 0)
3038 if (pmap_remove_pte(pmap, pte, sva, &free))
3045 pmap_invalidate_all(pmap);
3046 rw_wunlock(&pvh_global_lock);
3048 pmap_free_zero_pages(&free);
3052 * Routine: pmap_remove_all
3054 * Removes this physical page from
3055 * all physical maps in which it resides.
3056 * Reflects back modify bits to the pager.
3059 * Original versions of this routine were very
3060 * inefficient because they iteratively called
3061 * pmap_remove (slow...)
3065 pmap_remove_all(vm_page_t m)
3067 struct md_page *pvh;
3070 pt_entry_t *pte, tpte;
3073 struct spglist free;
3075 KASSERT((m->oflags & VPO_UNMANAGED) == 0,
3076 ("pmap_remove_all: page %p is not managed", m));
3078 rw_wlock(&pvh_global_lock);
3080 if ((m->flags & PG_FICTITIOUS) != 0)
3081 goto small_mappings;
3082 pvh = pa_to_pvh(VM_PAGE_TO_PHYS(m));
3083 while ((pv = TAILQ_FIRST(&pvh->pv_list)) != NULL) {
3087 pde = pmap_pde(pmap, va);
3088 (void)pmap_demote_pde(pmap, pde, va);
3092 while ((pv = TAILQ_FIRST(&m->md.pv_list)) != NULL) {
3095 pmap->pm_stats.resident_count--;
3096 pde = pmap_pde(pmap, pv->pv_va);
3097 KASSERT((*pde & PG_PS) == 0, ("pmap_remove_all: found"
3098 " a 4mpage in page %p's pv list", m));
3099 pte = pmap_pte_quick(pmap, pv->pv_va);
3100 tpte = pte_load_clear(pte);
3101 KASSERT(tpte != 0, ("pmap_remove_all: pmap %p va %x zero pte",
3104 pmap->pm_stats.wired_count--;
3106 vm_page_aflag_set(m, PGA_REFERENCED);
3109 * Update the vm_page_t clean and reference bits.
3111 if ((tpte & (PG_M | PG_RW)) == (PG_M | PG_RW))
3113 pmap_unuse_pt(pmap, pv->pv_va, &free);
3114 pmap_invalidate_page(pmap, pv->pv_va);
3115 TAILQ_REMOVE(&m->md.pv_list, pv, pv_next);
3116 free_pv_entry(pmap, pv);
3119 vm_page_aflag_clear(m, PGA_WRITEABLE);
3121 rw_wunlock(&pvh_global_lock);
3122 pmap_free_zero_pages(&free);
3126 * pmap_protect_pde: do the things to protect a 4mpage in a process
3129 pmap_protect_pde(pmap_t pmap, pd_entry_t *pde, vm_offset_t sva, vm_prot_t prot)
3131 pd_entry_t newpde, oldpde;
3132 vm_offset_t eva, va;
3134 boolean_t anychanged;
3136 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
3137 KASSERT((sva & PDRMASK) == 0,
3138 ("pmap_protect_pde: sva is not 4mpage aligned"));
3141 oldpde = newpde = *pde;
3142 if ((oldpde & (PG_MANAGED | PG_M | PG_RW)) ==
3143 (PG_MANAGED | PG_M | PG_RW)) {
3145 for (va = sva, m = PHYS_TO_VM_PAGE(oldpde & PG_PS_FRAME);
3146 va < eva; va += PAGE_SIZE, m++)
3149 if ((prot & VM_PROT_WRITE) == 0)
3150 newpde &= ~(PG_RW | PG_M);
3151 #if defined(PAE) || defined(PAE_TABLES)
3152 if ((prot & VM_PROT_EXECUTE) == 0)
3155 if (newpde != oldpde) {
3157 * As an optimization to future operations on this PDE, clear
3158 * PG_PROMOTED. The impending invalidation will remove any
3159 * lingering 4KB page mappings from the TLB.
3161 if (!pde_cmpset(pde, oldpde, newpde & ~PG_PROMOTED))
3163 if ((oldpde & PG_G) != 0)
3164 pmap_invalidate_pde_page(kernel_pmap, sva, oldpde);
3168 return (anychanged);
3172 * Set the physical protection on the
3173 * specified range of this map as requested.
3176 pmap_protect(pmap_t pmap, vm_offset_t sva, vm_offset_t eva, vm_prot_t prot)
3181 boolean_t anychanged, pv_lists_locked;
3183 KASSERT((prot & ~VM_PROT_ALL) == 0, ("invalid prot %x", prot));
3184 if (prot == VM_PROT_NONE) {
3185 pmap_remove(pmap, sva, eva);
3189 #if defined(PAE) || defined(PAE_TABLES)
3190 if ((prot & (VM_PROT_WRITE|VM_PROT_EXECUTE)) ==
3191 (VM_PROT_WRITE|VM_PROT_EXECUTE))
3194 if (prot & VM_PROT_WRITE)
3198 if (pmap_is_current(pmap))
3199 pv_lists_locked = FALSE;
3201 pv_lists_locked = TRUE;
3203 rw_wlock(&pvh_global_lock);
3209 for (; sva < eva; sva = pdnxt) {
3210 pt_entry_t obits, pbits;
3213 pdnxt = (sva + NBPDR) & ~PDRMASK;
3217 pdirindex = sva >> PDRSHIFT;
3218 ptpaddr = pmap->pm_pdir[pdirindex];
3221 * Weed out invalid mappings. Note: we assume that the page
3222 * directory table is always allocated, and in kernel virtual.
3228 * Check for large page.
3230 if ((ptpaddr & PG_PS) != 0) {
3232 * Are we protecting the entire large page? If not,
3233 * demote the mapping and fall through.
3235 if (sva + NBPDR == pdnxt && eva >= pdnxt) {
3237 * The TLB entry for a PG_G mapping is
3238 * invalidated by pmap_protect_pde().
3240 if (pmap_protect_pde(pmap,
3241 &pmap->pm_pdir[pdirindex], sva, prot))
3245 if (!pv_lists_locked) {
3246 pv_lists_locked = TRUE;
3247 if (!rw_try_wlock(&pvh_global_lock)) {
3249 pmap_invalidate_all(
3256 if (!pmap_demote_pde(pmap,
3257 &pmap->pm_pdir[pdirindex], sva)) {
3259 * The large page mapping was
3270 for (pte = pmap_pte_quick(pmap, sva); sva != pdnxt; pte++,
3276 * Regardless of whether a pte is 32 or 64 bits in
3277 * size, PG_RW, PG_A, and PG_M are among the least
3278 * significant 32 bits.
3280 obits = pbits = *pte;
3281 if ((pbits & PG_V) == 0)
3284 if ((prot & VM_PROT_WRITE) == 0) {
3285 if ((pbits & (PG_MANAGED | PG_M | PG_RW)) ==
3286 (PG_MANAGED | PG_M | PG_RW)) {
3287 m = PHYS_TO_VM_PAGE(pbits & PG_FRAME);
3290 pbits &= ~(PG_RW | PG_M);
3292 #if defined(PAE) || defined(PAE_TABLES)
3293 if ((prot & VM_PROT_EXECUTE) == 0)
3297 if (pbits != obits) {
3298 #if defined(PAE) || defined(PAE_TABLES)
3299 if (!atomic_cmpset_64(pte, obits, pbits))
3302 if (!atomic_cmpset_int((u_int *)pte, obits,
3307 pmap_invalidate_page(pmap, sva);
3314 pmap_invalidate_all(pmap);
3315 if (pv_lists_locked) {
3317 rw_wunlock(&pvh_global_lock);
3323 * Tries to promote the 512 or 1024, contiguous 4KB page mappings that are
3324 * within a single page table page (PTP) to a single 2- or 4MB page mapping.
3325 * For promotion to occur, two conditions must be met: (1) the 4KB page
3326 * mappings must map aligned, contiguous physical memory and (2) the 4KB page
3327 * mappings must have identical characteristics.
3329 * Managed (PG_MANAGED) mappings within the kernel address space are not
3330 * promoted. The reason is that kernel PDEs are replicated in each pmap but
3331 * pmap_clear_ptes() and pmap_ts_referenced() only read the PDE from the kernel
3335 pmap_promote_pde(pmap_t pmap, pd_entry_t *pde, vm_offset_t va)
3338 pt_entry_t *firstpte, oldpte, pa, *pte;
3339 vm_offset_t oldpteva;
3342 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
3345 * Examine the first PTE in the specified PTP. Abort if this PTE is
3346 * either invalid, unused, or does not map the first 4KB physical page
3347 * within a 2- or 4MB page.
3349 firstpte = pmap_pte_quick(pmap, trunc_4mpage(va));
3352 if ((newpde & ((PG_FRAME & PDRMASK) | PG_A | PG_V)) != (PG_A | PG_V)) {
3353 pmap_pde_p_failures++;
3354 CTR2(KTR_PMAP, "pmap_promote_pde: failure for va %#x"
3355 " in pmap %p", va, pmap);
3358 if ((*firstpte & PG_MANAGED) != 0 && pmap == kernel_pmap) {
3359 pmap_pde_p_failures++;
3360 CTR2(KTR_PMAP, "pmap_promote_pde: failure for va %#x"
3361 " in pmap %p", va, pmap);
3364 if ((newpde & (PG_M | PG_RW)) == PG_RW) {
3366 * When PG_M is already clear, PG_RW can be cleared without
3367 * a TLB invalidation.
3369 if (!atomic_cmpset_int((u_int *)firstpte, newpde, newpde &
3376 * Examine each of the other PTEs in the specified PTP. Abort if this
3377 * PTE maps an unexpected 4KB physical page or does not have identical
3378 * characteristics to the first PTE.
3380 pa = (newpde & (PG_PS_FRAME | PG_A | PG_V)) + NBPDR - PAGE_SIZE;
3381 for (pte = firstpte + NPTEPG - 1; pte > firstpte; pte--) {
3384 if ((oldpte & (PG_FRAME | PG_A | PG_V)) != pa) {
3385 pmap_pde_p_failures++;
3386 CTR2(KTR_PMAP, "pmap_promote_pde: failure for va %#x"
3387 " in pmap %p", va, pmap);
3390 if ((oldpte & (PG_M | PG_RW)) == PG_RW) {
3392 * When PG_M is already clear, PG_RW can be cleared
3393 * without a TLB invalidation.
3395 if (!atomic_cmpset_int((u_int *)pte, oldpte,
3399 oldpteva = (oldpte & PG_FRAME & PDRMASK) |
3401 CTR2(KTR_PMAP, "pmap_promote_pde: protect for va %#x"
3402 " in pmap %p", oldpteva, pmap);
3404 if ((oldpte & PG_PTE_PROMOTE) != (newpde & PG_PTE_PROMOTE)) {
3405 pmap_pde_p_failures++;
3406 CTR2(KTR_PMAP, "pmap_promote_pde: failure for va %#x"
3407 " in pmap %p", va, pmap);
3414 * Save the page table page in its current state until the PDE
3415 * mapping the superpage is demoted by pmap_demote_pde() or
3416 * destroyed by pmap_remove_pde().
3418 mpte = PHYS_TO_VM_PAGE(*pde & PG_FRAME);
3419 KASSERT(mpte >= vm_page_array &&
3420 mpte < &vm_page_array[vm_page_array_size],
3421 ("pmap_promote_pde: page table page is out of range"));
3422 KASSERT(mpte->pindex == va >> PDRSHIFT,
3423 ("pmap_promote_pde: page table page's pindex is wrong"));
3424 if (pmap_insert_pt_page(pmap, mpte)) {
3425 pmap_pde_p_failures++;
3427 "pmap_promote_pde: failure for va %#x in pmap %p", va,
3433 * Promote the pv entries.
3435 if ((newpde & PG_MANAGED) != 0)
3436 pmap_pv_promote_pde(pmap, va, newpde & PG_PS_FRAME);
3439 * Propagate the PAT index to its proper position.
3441 if ((newpde & PG_PTE_PAT) != 0)
3442 newpde ^= PG_PDE_PAT | PG_PTE_PAT;
3445 * Map the superpage.
3447 if (workaround_erratum383)
3448 pmap_update_pde(pmap, va, pde, PG_PS | newpde);
3449 else if (pmap == kernel_pmap)
3450 pmap_kenter_pde(va, PG_PROMOTED | PG_PS | newpde);
3452 pde_store(pde, PG_PROMOTED | PG_PS | newpde);
3454 pmap_pde_promotions++;
3455 CTR2(KTR_PMAP, "pmap_promote_pde: success for va %#x"
3456 " in pmap %p", va, pmap);
3460 * Insert the given physical page (p) at
3461 * the specified virtual address (v) in the
3462 * target physical map with the protection requested.
3464 * If specified, the page will be wired down, meaning
3465 * that the related pte can not be reclaimed.
3467 * NB: This is the only routine which MAY NOT lazy-evaluate
3468 * or lose information. That is, this routine must actually
3469 * insert this page into the given map NOW.
3472 pmap_enter(pmap_t pmap, vm_offset_t va, vm_page_t m, vm_prot_t prot,
3473 u_int flags, int8_t psind)
3477 pt_entry_t newpte, origpte;
3481 boolean_t invlva, wired;
3483 va = trunc_page(va);
3485 wired = (flags & PMAP_ENTER_WIRED) != 0;
3487 KASSERT(va <= VM_MAX_KERNEL_ADDRESS, ("pmap_enter: toobig"));
3488 KASSERT(va < UPT_MIN_ADDRESS || va >= UPT_MAX_ADDRESS,
3489 ("pmap_enter: invalid to pmap_enter page table pages (va: 0x%x)",
3491 if ((m->oflags & VPO_UNMANAGED) == 0 && !vm_page_xbusied(m))
3492 VM_OBJECT_ASSERT_LOCKED(m->object);
3494 rw_wlock(&pvh_global_lock);
3498 pde = pmap_pde(pmap, va);
3499 if (va < VM_MAXUSER_ADDRESS) {
3502 * In the case that a page table page is not resident,
3503 * we are creating it here. pmap_allocpte() handles
3506 mpte = pmap_allocpte(pmap, va, flags);
3508 KASSERT((flags & PMAP_ENTER_NOSLEEP) != 0,
3509 ("pmap_allocpte failed with sleep allowed"));
3511 rw_wunlock(&pvh_global_lock);
3513 return (KERN_RESOURCE_SHORTAGE);
3517 * va is for KVA, so pmap_demote_pde() will never fail
3518 * to install a page table page. PG_V is also
3519 * asserted by pmap_demote_pde().
3521 KASSERT(pde != NULL && (*pde & PG_V) != 0,
3522 ("KVA %#x invalid pde pdir %#jx", va,
3523 (uintmax_t)pmap->pm_pdir[PTDPTDI]));
3524 if ((*pde & PG_PS) != 0)
3525 pmap_demote_pde(pmap, pde, va);
3527 pte = pmap_pte_quick(pmap, va);
3530 * Page Directory table entry is not valid, which should not
3531 * happen. We should have either allocated the page table
3532 * page or demoted the existing mapping above.
3535 panic("pmap_enter: invalid page directory pdir=%#jx, va=%#x",
3536 (uintmax_t)pmap->pm_pdir[PTDPTDI], va);
3539 pa = VM_PAGE_TO_PHYS(m);
3542 opa = origpte & PG_FRAME;
3545 * Mapping has not changed, must be protection or wiring change.
3547 if (origpte && (opa == pa)) {
3549 * Wiring change, just update stats. We don't worry about
3550 * wiring PT pages as they remain resident as long as there
3551 * are valid mappings in them. Hence, if a user page is wired,
3552 * the PT page will be also.
3554 if (wired && ((origpte & PG_W) == 0))
3555 pmap->pm_stats.wired_count++;
3556 else if (!wired && (origpte & PG_W))
3557 pmap->pm_stats.wired_count--;
3560 * Remove extra pte reference
3565 if (origpte & PG_MANAGED) {
3575 * Mapping has changed, invalidate old range and fall through to
3576 * handle validating new mapping.
3580 pmap->pm_stats.wired_count--;
3581 if (origpte & PG_MANAGED) {
3582 om = PHYS_TO_VM_PAGE(opa);
3583 pv = pmap_pvh_remove(&om->md, pmap, va);
3587 KASSERT(mpte->wire_count > 0,
3588 ("pmap_enter: missing reference to page table page,"
3592 pmap->pm_stats.resident_count++;
3595 * Enter on the PV list if part of our managed memory.
3597 if ((m->oflags & VPO_UNMANAGED) == 0) {
3598 KASSERT(va < kmi.clean_sva || va >= kmi.clean_eva,
3599 ("pmap_enter: managed mapping within the clean submap"));
3601 pv = get_pv_entry(pmap, FALSE);
3603 TAILQ_INSERT_TAIL(&m->md.pv_list, pv, pv_next);
3605 } else if (pv != NULL)
3606 free_pv_entry(pmap, pv);
3609 * Increment counters
3612 pmap->pm_stats.wired_count++;
3616 * Now validate mapping with desired protection/wiring.
3618 newpte = (pt_entry_t)(pa | pmap_cache_bits(m->md.pat_mode, 0) | PG_V);
3619 if ((prot & VM_PROT_WRITE) != 0) {
3621 if ((newpte & PG_MANAGED) != 0)
3622 vm_page_aflag_set(m, PGA_WRITEABLE);
3624 #if defined(PAE) || defined(PAE_TABLES)
3625 if ((prot & VM_PROT_EXECUTE) == 0)
3630 if (va < VM_MAXUSER_ADDRESS)
3632 if (pmap == kernel_pmap)
3636 * if the mapping or permission bits are different, we need
3637 * to update the pte.
3639 if ((origpte & ~(PG_M|PG_A)) != newpte) {
3641 if ((flags & VM_PROT_WRITE) != 0)
3643 if (origpte & PG_V) {
3645 origpte = pte_load_store(pte, newpte);
3646 if (origpte & PG_A) {
3647 if (origpte & PG_MANAGED)
3648 vm_page_aflag_set(om, PGA_REFERENCED);
3649 if (opa != VM_PAGE_TO_PHYS(m))
3651 #if defined(PAE) || defined(PAE_TABLES)
3652 if ((origpte & PG_NX) == 0 &&
3653 (newpte & PG_NX) != 0)
3657 if ((origpte & (PG_M | PG_RW)) == (PG_M | PG_RW)) {
3658 if ((origpte & PG_MANAGED) != 0)
3660 if ((prot & VM_PROT_WRITE) == 0)
3663 if ((origpte & PG_MANAGED) != 0 &&
3664 TAILQ_EMPTY(&om->md.pv_list) &&
3665 ((om->flags & PG_FICTITIOUS) != 0 ||
3666 TAILQ_EMPTY(&pa_to_pvh(opa)->pv_list)))
3667 vm_page_aflag_clear(om, PGA_WRITEABLE);
3669 pmap_invalidate_page(pmap, va);
3671 pte_store(pte, newpte);
3675 * If both the page table page and the reservation are fully
3676 * populated, then attempt promotion.
3678 if ((mpte == NULL || mpte->wire_count == NPTEPG) &&
3679 pg_ps_enabled && (m->flags & PG_FICTITIOUS) == 0 &&
3680 vm_reserv_level_iffullpop(m) == 0)
3681 pmap_promote_pde(pmap, pde, va);
3684 rw_wunlock(&pvh_global_lock);
3686 return (KERN_SUCCESS);
3690 * Tries to create a 2- or 4MB page mapping. Returns TRUE if successful and
3691 * FALSE otherwise. Fails if (1) a page table page cannot be allocated without
3692 * blocking, (2) a mapping already exists at the specified virtual address, or
3693 * (3) a pv entry cannot be allocated without reclaiming another pv entry.
3696 pmap_enter_pde(pmap_t pmap, vm_offset_t va, vm_page_t m, vm_prot_t prot)
3698 pd_entry_t *pde, newpde;
3700 rw_assert(&pvh_global_lock, RA_WLOCKED);
3701 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
3702 pde = pmap_pde(pmap, va);
3704 CTR2(KTR_PMAP, "pmap_enter_pde: failure for va %#lx"
3705 " in pmap %p", va, pmap);
3708 newpde = VM_PAGE_TO_PHYS(m) | pmap_cache_bits(m->md.pat_mode, 1) |
3710 if ((m->oflags & VPO_UNMANAGED) == 0) {
3711 newpde |= PG_MANAGED;
3714 * Abort this mapping if its PV entry could not be created.
3716 if (!pmap_pv_insert_pde(pmap, va, VM_PAGE_TO_PHYS(m))) {
3717 CTR2(KTR_PMAP, "pmap_enter_pde: failure for va %#lx"
3718 " in pmap %p", va, pmap);
3722 #if defined(PAE) || defined(PAE_TABLES)
3723 if ((prot & VM_PROT_EXECUTE) == 0)
3726 if (va < VM_MAXUSER_ADDRESS)
3730 * Increment counters.
3732 pmap->pm_stats.resident_count += NBPDR / PAGE_SIZE;
3735 * Map the superpage. (This is not a promoted mapping; there will not
3736 * be any lingering 4KB page mappings in the TLB.)
3738 pde_store(pde, newpde);
3740 pmap_pde_mappings++;
3741 CTR2(KTR_PMAP, "pmap_enter_pde: success for va %#lx"
3742 " in pmap %p", va, pmap);
3747 * Maps a sequence of resident pages belonging to the same object.
3748 * The sequence begins with the given page m_start. This page is
3749 * mapped at the given virtual address start. Each subsequent page is
3750 * mapped at a virtual address that is offset from start by the same
3751 * amount as the page is offset from m_start within the object. The
3752 * last page in the sequence is the page with the largest offset from
3753 * m_start that can be mapped at a virtual address less than the given
3754 * virtual address end. Not every virtual page between start and end
3755 * is mapped; only those for which a resident page exists with the
3756 * corresponding offset from m_start are mapped.
3759 pmap_enter_object(pmap_t pmap, vm_offset_t start, vm_offset_t end,
3760 vm_page_t m_start, vm_prot_t prot)
3764 vm_pindex_t diff, psize;
3766 VM_OBJECT_ASSERT_LOCKED(m_start->object);
3768 psize = atop(end - start);
3771 rw_wlock(&pvh_global_lock);
3773 while (m != NULL && (diff = m->pindex - m_start->pindex) < psize) {
3774 va = start + ptoa(diff);
3775 if ((va & PDRMASK) == 0 && va + NBPDR <= end &&
3776 m->psind == 1 && pg_ps_enabled &&
3777 pmap_enter_pde(pmap, va, m, prot))
3778 m = &m[NBPDR / PAGE_SIZE - 1];
3780 mpte = pmap_enter_quick_locked(pmap, va, m, prot,
3782 m = TAILQ_NEXT(m, listq);
3784 rw_wunlock(&pvh_global_lock);
3789 * this code makes some *MAJOR* assumptions:
3790 * 1. Current pmap & pmap exists.
3793 * 4. No page table pages.
3794 * but is *MUCH* faster than pmap_enter...
3798 pmap_enter_quick(pmap_t pmap, vm_offset_t va, vm_page_t m, vm_prot_t prot)
3801 rw_wlock(&pvh_global_lock);
3803 (void)pmap_enter_quick_locked(pmap, va, m, prot, NULL);
3804 rw_wunlock(&pvh_global_lock);
3809 pmap_enter_quick_locked(pmap_t pmap, vm_offset_t va, vm_page_t m,
3810 vm_prot_t prot, vm_page_t mpte)
3814 struct spglist free;
3816 KASSERT(va < kmi.clean_sva || va >= kmi.clean_eva ||
3817 (m->oflags & VPO_UNMANAGED) != 0,
3818 ("pmap_enter_quick_locked: managed mapping within the clean submap"));
3819 rw_assert(&pvh_global_lock, RA_WLOCKED);
3820 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
3823 * In the case that a page table page is not
3824 * resident, we are creating it here.
3826 if (va < VM_MAXUSER_ADDRESS) {
3831 * Calculate pagetable page index
3833 ptepindex = va >> PDRSHIFT;
3834 if (mpte && (mpte->pindex == ptepindex)) {
3838 * Get the page directory entry
3840 ptepa = pmap->pm_pdir[ptepindex];
3843 * If the page table page is mapped, we just increment
3844 * the hold count, and activate it.
3849 mpte = PHYS_TO_VM_PAGE(ptepa & PG_FRAME);
3852 mpte = _pmap_allocpte(pmap, ptepindex,
3853 PMAP_ENTER_NOSLEEP);
3863 * This call to vtopte makes the assumption that we are
3864 * entering the page into the current pmap. In order to support
3865 * quick entry into any pmap, one would likely use pmap_pte_quick.
3866 * But that isn't as quick as vtopte.
3878 * Enter on the PV list if part of our managed memory.
3880 if ((m->oflags & VPO_UNMANAGED) == 0 &&
3881 !pmap_try_insert_pv_entry(pmap, va, m)) {
3884 if (pmap_unwire_ptp(pmap, mpte, &free)) {
3885 pmap_invalidate_page(pmap, va);
3886 pmap_free_zero_pages(&free);
3895 * Increment counters
3897 pmap->pm_stats.resident_count++;
3899 pa = VM_PAGE_TO_PHYS(m) | pmap_cache_bits(m->md.pat_mode, 0);
3900 #if defined(PAE) || defined(PAE_TABLES)
3901 if ((prot & VM_PROT_EXECUTE) == 0)
3906 * Now validate mapping with RO protection
3908 if ((m->oflags & VPO_UNMANAGED) != 0)
3909 pte_store(pte, pa | PG_V | PG_U);
3911 pte_store(pte, pa | PG_V | PG_U | PG_MANAGED);
3916 * Make a temporary mapping for a physical address. This is only intended
3917 * to be used for panic dumps.
3920 pmap_kenter_temporary(vm_paddr_t pa, int i)
3924 va = (vm_offset_t)crashdumpmap + (i * PAGE_SIZE);
3925 pmap_kenter(va, pa);
3927 return ((void *)crashdumpmap);
3931 * This code maps large physical mmap regions into the
3932 * processor address space. Note that some shortcuts
3933 * are taken, but the code works.
3936 pmap_object_init_pt(pmap_t pmap, vm_offset_t addr, vm_object_t object,
3937 vm_pindex_t pindex, vm_size_t size)
3940 vm_paddr_t pa, ptepa;
3944 VM_OBJECT_ASSERT_WLOCKED(object);
3945 KASSERT(object->type == OBJT_DEVICE || object->type == OBJT_SG,
3946 ("pmap_object_init_pt: non-device object"));
3948 (addr & (NBPDR - 1)) == 0 && (size & (NBPDR - 1)) == 0) {
3949 if (!vm_object_populate(object, pindex, pindex + atop(size)))
3951 p = vm_page_lookup(object, pindex);
3952 KASSERT(p->valid == VM_PAGE_BITS_ALL,
3953 ("pmap_object_init_pt: invalid page %p", p));
3954 pat_mode = p->md.pat_mode;
3957 * Abort the mapping if the first page is not physically
3958 * aligned to a 2/4MB page boundary.
3960 ptepa = VM_PAGE_TO_PHYS(p);
3961 if (ptepa & (NBPDR - 1))
3965 * Skip the first page. Abort the mapping if the rest of
3966 * the pages are not physically contiguous or have differing
3967 * memory attributes.
3969 p = TAILQ_NEXT(p, listq);
3970 for (pa = ptepa + PAGE_SIZE; pa < ptepa + size;
3972 KASSERT(p->valid == VM_PAGE_BITS_ALL,
3973 ("pmap_object_init_pt: invalid page %p", p));
3974 if (pa != VM_PAGE_TO_PHYS(p) ||
3975 pat_mode != p->md.pat_mode)
3977 p = TAILQ_NEXT(p, listq);
3981 * Map using 2/4MB pages. Since "ptepa" is 2/4M aligned and
3982 * "size" is a multiple of 2/4M, adding the PAT setting to
3983 * "pa" will not affect the termination of this loop.
3986 for (pa = ptepa | pmap_cache_bits(pat_mode, 1); pa < ptepa +
3987 size; pa += NBPDR) {
3988 pde = pmap_pde(pmap, addr);
3990 pde_store(pde, pa | PG_PS | PG_M | PG_A |
3991 PG_U | PG_RW | PG_V);
3992 pmap->pm_stats.resident_count += NBPDR /
3994 pmap_pde_mappings++;
3996 /* Else continue on if the PDE is already valid. */
4004 * Clear the wired attribute from the mappings for the specified range of
4005 * addresses in the given pmap. Every valid mapping within that range
4006 * must have the wired attribute set. In contrast, invalid mappings
4007 * cannot have the wired attribute set, so they are ignored.
4009 * The wired attribute of the page table entry is not a hardware feature,
4010 * so there is no need to invalidate any TLB entries.
4013 pmap_unwire(pmap_t pmap, vm_offset_t sva, vm_offset_t eva)
4018 boolean_t pv_lists_locked;
4020 if (pmap_is_current(pmap))
4021 pv_lists_locked = FALSE;
4023 pv_lists_locked = TRUE;
4025 rw_wlock(&pvh_global_lock);
4029 for (; sva < eva; sva = pdnxt) {
4030 pdnxt = (sva + NBPDR) & ~PDRMASK;
4033 pde = pmap_pde(pmap, sva);
4034 if ((*pde & PG_V) == 0)
4036 if ((*pde & PG_PS) != 0) {
4037 if ((*pde & PG_W) == 0)
4038 panic("pmap_unwire: pde %#jx is missing PG_W",
4042 * Are we unwiring the entire large page? If not,
4043 * demote the mapping and fall through.
4045 if (sva + NBPDR == pdnxt && eva >= pdnxt) {
4047 * Regardless of whether a pde (or pte) is 32
4048 * or 64 bits in size, PG_W is among the least
4049 * significant 32 bits.
4051 atomic_clear_int((u_int *)pde, PG_W);
4052 pmap->pm_stats.wired_count -= NBPDR /
4056 if (!pv_lists_locked) {
4057 pv_lists_locked = TRUE;
4058 if (!rw_try_wlock(&pvh_global_lock)) {
4065 if (!pmap_demote_pde(pmap, pde, sva))
4066 panic("pmap_unwire: demotion failed");
4071 for (pte = pmap_pte_quick(pmap, sva); sva != pdnxt; pte++,
4073 if ((*pte & PG_V) == 0)
4075 if ((*pte & PG_W) == 0)
4076 panic("pmap_unwire: pte %#jx is missing PG_W",
4080 * PG_W must be cleared atomically. Although the pmap
4081 * lock synchronizes access to PG_W, another processor
4082 * could be setting PG_M and/or PG_A concurrently.
4084 * PG_W is among the least significant 32 bits.
4086 atomic_clear_int((u_int *)pte, PG_W);
4087 pmap->pm_stats.wired_count--;
4090 if (pv_lists_locked) {
4092 rw_wunlock(&pvh_global_lock);
4099 * Copy the range specified by src_addr/len
4100 * from the source map to the range dst_addr/len
4101 * in the destination map.
4103 * This routine is only advisory and need not do anything.
4107 pmap_copy(pmap_t dst_pmap, pmap_t src_pmap, vm_offset_t dst_addr, vm_size_t len,
4108 vm_offset_t src_addr)
4110 struct spglist free;
4112 vm_offset_t end_addr = src_addr + len;
4115 if (dst_addr != src_addr)
4118 if (!pmap_is_current(src_pmap))
4121 rw_wlock(&pvh_global_lock);
4122 if (dst_pmap < src_pmap) {
4123 PMAP_LOCK(dst_pmap);
4124 PMAP_LOCK(src_pmap);
4126 PMAP_LOCK(src_pmap);
4127 PMAP_LOCK(dst_pmap);
4130 for (addr = src_addr; addr < end_addr; addr = pdnxt) {
4131 pt_entry_t *src_pte, *dst_pte;
4132 vm_page_t dstmpte, srcmpte;
4133 pd_entry_t srcptepaddr;
4136 KASSERT(addr < UPT_MIN_ADDRESS,
4137 ("pmap_copy: invalid to pmap_copy page tables"));
4139 pdnxt = (addr + NBPDR) & ~PDRMASK;
4142 ptepindex = addr >> PDRSHIFT;
4144 srcptepaddr = src_pmap->pm_pdir[ptepindex];
4145 if (srcptepaddr == 0)
4148 if (srcptepaddr & PG_PS) {
4149 if ((addr & PDRMASK) != 0 || addr + NBPDR > end_addr)
4151 if (dst_pmap->pm_pdir[ptepindex] == 0 &&
4152 ((srcptepaddr & PG_MANAGED) == 0 ||
4153 pmap_pv_insert_pde(dst_pmap, addr, srcptepaddr &
4155 dst_pmap->pm_pdir[ptepindex] = srcptepaddr &
4157 dst_pmap->pm_stats.resident_count +=
4159 pmap_pde_mappings++;
4164 srcmpte = PHYS_TO_VM_PAGE(srcptepaddr & PG_FRAME);
4165 KASSERT(srcmpte->wire_count > 0,
4166 ("pmap_copy: source page table page is unused"));
4168 if (pdnxt > end_addr)
4171 src_pte = vtopte(addr);
4172 while (addr < pdnxt) {
4176 * we only virtual copy managed pages
4178 if ((ptetemp & PG_MANAGED) != 0) {
4179 dstmpte = pmap_allocpte(dst_pmap, addr,
4180 PMAP_ENTER_NOSLEEP);
4181 if (dstmpte == NULL)
4183 dst_pte = pmap_pte_quick(dst_pmap, addr);
4184 if (*dst_pte == 0 &&
4185 pmap_try_insert_pv_entry(dst_pmap, addr,
4186 PHYS_TO_VM_PAGE(ptetemp & PG_FRAME))) {
4188 * Clear the wired, modified, and
4189 * accessed (referenced) bits
4192 *dst_pte = ptetemp & ~(PG_W | PG_M |
4194 dst_pmap->pm_stats.resident_count++;
4197 if (pmap_unwire_ptp(dst_pmap, dstmpte,
4199 pmap_invalidate_page(dst_pmap,
4201 pmap_free_zero_pages(&free);
4205 if (dstmpte->wire_count >= srcmpte->wire_count)
4214 rw_wunlock(&pvh_global_lock);
4215 PMAP_UNLOCK(src_pmap);
4216 PMAP_UNLOCK(dst_pmap);
4220 * Zero 1 page of virtual memory mapped from a hardware page by the caller.
4222 static __inline void
4223 pagezero(void *page)
4225 #if defined(I686_CPU)
4226 if (cpu_class == CPUCLASS_686) {
4227 if (cpu_feature & CPUID_SSE2)
4228 sse2_pagezero(page);
4230 i686_pagezero(page);
4233 bzero(page, PAGE_SIZE);
4237 * Zero the specified hardware page.
4240 pmap_zero_page(vm_page_t m)
4242 pt_entry_t *cmap_pte2;
4247 cmap_pte2 = pc->pc_cmap_pte2;
4248 mtx_lock(&pc->pc_cmap_lock);
4250 panic("pmap_zero_page: CMAP2 busy");
4251 *cmap_pte2 = PG_V | PG_RW | VM_PAGE_TO_PHYS(m) | PG_A | PG_M |
4252 pmap_cache_bits(m->md.pat_mode, 0);
4253 invlcaddr(pc->pc_cmap_addr2);
4254 pagezero(pc->pc_cmap_addr2);
4258 * Unpin the thread before releasing the lock. Otherwise the thread
4259 * could be rescheduled while still bound to the current CPU, only
4260 * to unpin itself immediately upon resuming execution.
4263 mtx_unlock(&pc->pc_cmap_lock);
4267 * Zero an an area within a single hardware page. off and size must not
4268 * cover an area beyond a single hardware page.
4271 pmap_zero_page_area(vm_page_t m, int off, int size)
4273 pt_entry_t *cmap_pte2;
4278 cmap_pte2 = pc->pc_cmap_pte2;
4279 mtx_lock(&pc->pc_cmap_lock);
4281 panic("pmap_zero_page_area: CMAP2 busy");
4282 *cmap_pte2 = PG_V | PG_RW | VM_PAGE_TO_PHYS(m) | PG_A | PG_M |
4283 pmap_cache_bits(m->md.pat_mode, 0);
4284 invlcaddr(pc->pc_cmap_addr2);
4285 if (off == 0 && size == PAGE_SIZE)
4286 pagezero(pc->pc_cmap_addr2);
4288 bzero(pc->pc_cmap_addr2 + off, size);
4291 mtx_unlock(&pc->pc_cmap_lock);
4295 * Copy 1 specified hardware page to another.
4298 pmap_copy_page(vm_page_t src, vm_page_t dst)
4300 pt_entry_t *cmap_pte1, *cmap_pte2;
4305 cmap_pte1 = pc->pc_cmap_pte1;
4306 cmap_pte2 = pc->pc_cmap_pte2;
4307 mtx_lock(&pc->pc_cmap_lock);
4309 panic("pmap_copy_page: CMAP1 busy");
4311 panic("pmap_copy_page: CMAP2 busy");
4312 *cmap_pte1 = PG_V | VM_PAGE_TO_PHYS(src) | PG_A |
4313 pmap_cache_bits(src->md.pat_mode, 0);
4314 invlcaddr(pc->pc_cmap_addr1);
4315 *cmap_pte2 = PG_V | PG_RW | VM_PAGE_TO_PHYS(dst) | PG_A | PG_M |
4316 pmap_cache_bits(dst->md.pat_mode, 0);
4317 invlcaddr(pc->pc_cmap_addr2);
4318 bcopy(pc->pc_cmap_addr1, pc->pc_cmap_addr2, PAGE_SIZE);
4322 mtx_unlock(&pc->pc_cmap_lock);
4325 int unmapped_buf_allowed = 1;
4328 pmap_copy_pages(vm_page_t ma[], vm_offset_t a_offset, vm_page_t mb[],
4329 vm_offset_t b_offset, int xfersize)
4331 vm_page_t a_pg, b_pg;
4333 vm_offset_t a_pg_offset, b_pg_offset;
4334 pt_entry_t *cmap_pte1, *cmap_pte2;
4340 cmap_pte1 = pc->pc_cmap_pte1;
4341 cmap_pte2 = pc->pc_cmap_pte2;
4342 mtx_lock(&pc->pc_cmap_lock);
4343 if (*cmap_pte1 != 0)
4344 panic("pmap_copy_pages: CMAP1 busy");
4345 if (*cmap_pte2 != 0)
4346 panic("pmap_copy_pages: CMAP2 busy");
4347 while (xfersize > 0) {
4348 a_pg = ma[a_offset >> PAGE_SHIFT];
4349 a_pg_offset = a_offset & PAGE_MASK;
4350 cnt = min(xfersize, PAGE_SIZE - a_pg_offset);
4351 b_pg = mb[b_offset >> PAGE_SHIFT];
4352 b_pg_offset = b_offset & PAGE_MASK;
4353 cnt = min(cnt, PAGE_SIZE - b_pg_offset);
4354 *cmap_pte1 = PG_V | VM_PAGE_TO_PHYS(a_pg) | PG_A |
4355 pmap_cache_bits(a_pg->md.pat_mode, 0);
4356 invlcaddr(pc->pc_cmap_addr1);
4357 *cmap_pte2 = PG_V | PG_RW | VM_PAGE_TO_PHYS(b_pg) | PG_A |
4358 PG_M | pmap_cache_bits(b_pg->md.pat_mode, 0);
4359 invlcaddr(pc->pc_cmap_addr2);
4360 a_cp = pc->pc_cmap_addr1 + a_pg_offset;
4361 b_cp = pc->pc_cmap_addr2 + b_pg_offset;
4362 bcopy(a_cp, b_cp, cnt);
4370 mtx_unlock(&pc->pc_cmap_lock);
4374 * Returns true if the pmap's pv is one of the first
4375 * 16 pvs linked to from this page. This count may
4376 * be changed upwards or downwards in the future; it
4377 * is only necessary that true be returned for a small
4378 * subset of pmaps for proper page aging.
4381 pmap_page_exists_quick(pmap_t pmap, vm_page_t m)
4383 struct md_page *pvh;
4388 KASSERT((m->oflags & VPO_UNMANAGED) == 0,
4389 ("pmap_page_exists_quick: page %p is not managed", m));
4391 rw_wlock(&pvh_global_lock);
4392 TAILQ_FOREACH(pv, &m->md.pv_list, pv_next) {
4393 if (PV_PMAP(pv) == pmap) {
4401 if (!rv && loops < 16 && (m->flags & PG_FICTITIOUS) == 0) {
4402 pvh = pa_to_pvh(VM_PAGE_TO_PHYS(m));
4403 TAILQ_FOREACH(pv, &pvh->pv_list, pv_next) {
4404 if (PV_PMAP(pv) == pmap) {
4413 rw_wunlock(&pvh_global_lock);
4418 * pmap_page_wired_mappings:
4420 * Return the number of managed mappings to the given physical page
4424 pmap_page_wired_mappings(vm_page_t m)
4429 if ((m->oflags & VPO_UNMANAGED) != 0)
4431 rw_wlock(&pvh_global_lock);
4432 count = pmap_pvh_wired_mappings(&m->md, count);
4433 if ((m->flags & PG_FICTITIOUS) == 0) {
4434 count = pmap_pvh_wired_mappings(pa_to_pvh(VM_PAGE_TO_PHYS(m)),
4437 rw_wunlock(&pvh_global_lock);
4442 * pmap_pvh_wired_mappings:
4444 * Return the updated number "count" of managed mappings that are wired.
4447 pmap_pvh_wired_mappings(struct md_page *pvh, int count)
4453 rw_assert(&pvh_global_lock, RA_WLOCKED);
4455 TAILQ_FOREACH(pv, &pvh->pv_list, pv_next) {
4458 pte = pmap_pte_quick(pmap, pv->pv_va);
4459 if ((*pte & PG_W) != 0)
4468 * Returns TRUE if the given page is mapped individually or as part of
4469 * a 4mpage. Otherwise, returns FALSE.
4472 pmap_page_is_mapped(vm_page_t m)
4476 if ((m->oflags & VPO_UNMANAGED) != 0)
4478 rw_wlock(&pvh_global_lock);
4479 rv = !TAILQ_EMPTY(&m->md.pv_list) ||
4480 ((m->flags & PG_FICTITIOUS) == 0 &&
4481 !TAILQ_EMPTY(&pa_to_pvh(VM_PAGE_TO_PHYS(m))->pv_list));
4482 rw_wunlock(&pvh_global_lock);
4487 * Remove all pages from specified address space
4488 * this aids process exit speeds. Also, this code
4489 * is special cased for current process only, but
4490 * can have the more generic (and slightly slower)
4491 * mode enabled. This is much faster than pmap_remove
4492 * in the case of running down an entire address space.
4495 pmap_remove_pages(pmap_t pmap)
4497 pt_entry_t *pte, tpte;
4498 vm_page_t m, mpte, mt;
4500 struct md_page *pvh;
4501 struct pv_chunk *pc, *npc;
4502 struct spglist free;
4505 uint32_t inuse, bitmask;
4508 if (pmap != PCPU_GET(curpmap)) {
4509 printf("warning: pmap_remove_pages called with non-current pmap\n");
4513 rw_wlock(&pvh_global_lock);
4516 TAILQ_FOREACH_SAFE(pc, &pmap->pm_pvchunk, pc_list, npc) {
4517 KASSERT(pc->pc_pmap == pmap, ("Wrong pmap %p %p", pmap,
4520 for (field = 0; field < _NPCM; field++) {
4521 inuse = ~pc->pc_map[field] & pc_freemask[field];
4522 while (inuse != 0) {
4524 bitmask = 1UL << bit;
4525 idx = field * 32 + bit;
4526 pv = &pc->pc_pventry[idx];
4529 pte = pmap_pde(pmap, pv->pv_va);
4531 if ((tpte & PG_PS) == 0) {
4532 pte = vtopte(pv->pv_va);
4533 tpte = *pte & ~PG_PTE_PAT;
4538 "TPTE at %p IS ZERO @ VA %08x\n",
4544 * We cannot remove wired pages from a process' mapping at this time
4551 m = PHYS_TO_VM_PAGE(tpte & PG_FRAME);
4552 KASSERT(m->phys_addr == (tpte & PG_FRAME),
4553 ("vm_page_t %p phys_addr mismatch %016jx %016jx",
4554 m, (uintmax_t)m->phys_addr,
4557 KASSERT((m->flags & PG_FICTITIOUS) != 0 ||
4558 m < &vm_page_array[vm_page_array_size],
4559 ("pmap_remove_pages: bad tpte %#jx",
4565 * Update the vm_page_t clean/reference bits.
4567 if ((tpte & (PG_M | PG_RW)) == (PG_M | PG_RW)) {
4568 if ((tpte & PG_PS) != 0) {
4569 for (mt = m; mt < &m[NBPDR / PAGE_SIZE]; mt++)
4576 PV_STAT(pv_entry_frees++);
4577 PV_STAT(pv_entry_spare++);
4579 pc->pc_map[field] |= bitmask;
4580 if ((tpte & PG_PS) != 0) {
4581 pmap->pm_stats.resident_count -= NBPDR / PAGE_SIZE;
4582 pvh = pa_to_pvh(tpte & PG_PS_FRAME);
4583 TAILQ_REMOVE(&pvh->pv_list, pv, pv_next);
4584 if (TAILQ_EMPTY(&pvh->pv_list)) {
4585 for (mt = m; mt < &m[NBPDR / PAGE_SIZE]; mt++)
4586 if (TAILQ_EMPTY(&mt->md.pv_list))
4587 vm_page_aflag_clear(mt, PGA_WRITEABLE);
4589 mpte = pmap_remove_pt_page(pmap, pv->pv_va);
4591 pmap->pm_stats.resident_count--;
4592 KASSERT(mpte->wire_count == NPTEPG,
4593 ("pmap_remove_pages: pte page wire count error"));
4594 mpte->wire_count = 0;
4595 pmap_add_delayed_free_list(mpte, &free, FALSE);
4596 atomic_subtract_int(&vm_cnt.v_wire_count, 1);
4599 pmap->pm_stats.resident_count--;
4600 TAILQ_REMOVE(&m->md.pv_list, pv, pv_next);
4601 if (TAILQ_EMPTY(&m->md.pv_list) &&
4602 (m->flags & PG_FICTITIOUS) == 0) {
4603 pvh = pa_to_pvh(VM_PAGE_TO_PHYS(m));
4604 if (TAILQ_EMPTY(&pvh->pv_list))
4605 vm_page_aflag_clear(m, PGA_WRITEABLE);
4607 pmap_unuse_pt(pmap, pv->pv_va, &free);
4612 TAILQ_REMOVE(&pmap->pm_pvchunk, pc, pc_list);
4617 pmap_invalidate_all(pmap);
4618 rw_wunlock(&pvh_global_lock);
4620 pmap_free_zero_pages(&free);
4626 * Return whether or not the specified physical page was modified
4627 * in any physical maps.
4630 pmap_is_modified(vm_page_t m)
4634 KASSERT((m->oflags & VPO_UNMANAGED) == 0,
4635 ("pmap_is_modified: page %p is not managed", m));
4638 * If the page is not exclusive busied, then PGA_WRITEABLE cannot be
4639 * concurrently set while the object is locked. Thus, if PGA_WRITEABLE
4640 * is clear, no PTEs can have PG_M set.
4642 VM_OBJECT_ASSERT_WLOCKED(m->object);
4643 if (!vm_page_xbusied(m) && (m->aflags & PGA_WRITEABLE) == 0)
4645 rw_wlock(&pvh_global_lock);
4646 rv = pmap_is_modified_pvh(&m->md) ||
4647 ((m->flags & PG_FICTITIOUS) == 0 &&
4648 pmap_is_modified_pvh(pa_to_pvh(VM_PAGE_TO_PHYS(m))));
4649 rw_wunlock(&pvh_global_lock);
4654 * Returns TRUE if any of the given mappings were used to modify
4655 * physical memory. Otherwise, returns FALSE. Both page and 2mpage
4656 * mappings are supported.
4659 pmap_is_modified_pvh(struct md_page *pvh)
4666 rw_assert(&pvh_global_lock, RA_WLOCKED);
4669 TAILQ_FOREACH(pv, &pvh->pv_list, pv_next) {
4672 pte = pmap_pte_quick(pmap, pv->pv_va);
4673 rv = (*pte & (PG_M | PG_RW)) == (PG_M | PG_RW);
4683 * pmap_is_prefaultable:
4685 * Return whether or not the specified virtual address is elgible
4689 pmap_is_prefaultable(pmap_t pmap, vm_offset_t addr)
4697 pde = pmap_pde(pmap, addr);
4698 if (*pde != 0 && (*pde & PG_PS) == 0) {
4707 * pmap_is_referenced:
4709 * Return whether or not the specified physical page was referenced
4710 * in any physical maps.
4713 pmap_is_referenced(vm_page_t m)
4717 KASSERT((m->oflags & VPO_UNMANAGED) == 0,
4718 ("pmap_is_referenced: page %p is not managed", m));
4719 rw_wlock(&pvh_global_lock);
4720 rv = pmap_is_referenced_pvh(&m->md) ||
4721 ((m->flags & PG_FICTITIOUS) == 0 &&
4722 pmap_is_referenced_pvh(pa_to_pvh(VM_PAGE_TO_PHYS(m))));
4723 rw_wunlock(&pvh_global_lock);
4728 * Returns TRUE if any of the given mappings were referenced and FALSE
4729 * otherwise. Both page and 4mpage mappings are supported.
4732 pmap_is_referenced_pvh(struct md_page *pvh)
4739 rw_assert(&pvh_global_lock, RA_WLOCKED);
4742 TAILQ_FOREACH(pv, &pvh->pv_list, pv_next) {
4745 pte = pmap_pte_quick(pmap, pv->pv_va);
4746 rv = (*pte & (PG_A | PG_V)) == (PG_A | PG_V);
4756 * Clear the write and modified bits in each of the given page's mappings.
4759 pmap_remove_write(vm_page_t m)
4761 struct md_page *pvh;
4762 pv_entry_t next_pv, pv;
4765 pt_entry_t oldpte, *pte;
4768 KASSERT((m->oflags & VPO_UNMANAGED) == 0,
4769 ("pmap_remove_write: page %p is not managed", m));
4772 * If the page is not exclusive busied, then PGA_WRITEABLE cannot be
4773 * set by another thread while the object is locked. Thus,
4774 * if PGA_WRITEABLE is clear, no page table entries need updating.
4776 VM_OBJECT_ASSERT_WLOCKED(m->object);
4777 if (!vm_page_xbusied(m) && (m->aflags & PGA_WRITEABLE) == 0)
4779 rw_wlock(&pvh_global_lock);
4781 if ((m->flags & PG_FICTITIOUS) != 0)
4782 goto small_mappings;
4783 pvh = pa_to_pvh(VM_PAGE_TO_PHYS(m));
4784 TAILQ_FOREACH_SAFE(pv, &pvh->pv_list, pv_next, next_pv) {
4788 pde = pmap_pde(pmap, va);
4789 if ((*pde & PG_RW) != 0)
4790 (void)pmap_demote_pde(pmap, pde, va);
4794 TAILQ_FOREACH(pv, &m->md.pv_list, pv_next) {
4797 pde = pmap_pde(pmap, pv->pv_va);
4798 KASSERT((*pde & PG_PS) == 0, ("pmap_clear_write: found"
4799 " a 4mpage in page %p's pv list", m));
4800 pte = pmap_pte_quick(pmap, pv->pv_va);
4803 if ((oldpte & PG_RW) != 0) {
4805 * Regardless of whether a pte is 32 or 64 bits
4806 * in size, PG_RW and PG_M are among the least
4807 * significant 32 bits.
4809 if (!atomic_cmpset_int((u_int *)pte, oldpte,
4810 oldpte & ~(PG_RW | PG_M)))
4812 if ((oldpte & PG_M) != 0)
4814 pmap_invalidate_page(pmap, pv->pv_va);
4818 vm_page_aflag_clear(m, PGA_WRITEABLE);
4820 rw_wunlock(&pvh_global_lock);
4824 * pmap_ts_referenced:
4826 * Return a count of reference bits for a page, clearing those bits.
4827 * It is not necessary for every reference bit to be cleared, but it
4828 * is necessary that 0 only be returned when there are truly no
4829 * reference bits set.
4831 * As an optimization, update the page's dirty field if a modified bit is
4832 * found while counting reference bits. This opportunistic update can be
4833 * performed at low cost and can eliminate the need for some future calls
4834 * to pmap_is_modified(). However, since this function stops after
4835 * finding PMAP_TS_REFERENCED_MAX reference bits, it may not detect some
4836 * dirty pages. Those dirty pages will only be detected by a future call
4837 * to pmap_is_modified().
4840 pmap_ts_referenced(vm_page_t m)
4842 struct md_page *pvh;
4850 KASSERT((m->oflags & VPO_UNMANAGED) == 0,
4851 ("pmap_ts_referenced: page %p is not managed", m));
4852 pa = VM_PAGE_TO_PHYS(m);
4853 pvh = pa_to_pvh(pa);
4854 rw_wlock(&pvh_global_lock);
4856 if ((m->flags & PG_FICTITIOUS) != 0 ||
4857 (pvf = TAILQ_FIRST(&pvh->pv_list)) == NULL)
4858 goto small_mappings;
4863 pde = pmap_pde(pmap, pv->pv_va);
4864 if ((*pde & (PG_M | PG_RW)) == (PG_M | PG_RW)) {
4866 * Although "*pde" is mapping a 2/4MB page, because
4867 * this function is called at a 4KB page granularity,
4868 * we only update the 4KB page under test.
4872 if ((*pde & PG_A) != 0) {
4874 * Since this reference bit is shared by either 1024
4875 * or 512 4KB pages, it should not be cleared every
4876 * time it is tested. Apply a simple "hash" function
4877 * on the physical page number, the virtual superpage
4878 * number, and the pmap address to select one 4KB page
4879 * out of the 1024 or 512 on which testing the
4880 * reference bit will result in clearing that bit.
4881 * This function is designed to avoid the selection of
4882 * the same 4KB page for every 2- or 4MB page mapping.
4884 * On demotion, a mapping that hasn't been referenced
4885 * is simply destroyed. To avoid the possibility of a
4886 * subsequent page fault on a demoted wired mapping,
4887 * always leave its reference bit set. Moreover,
4888 * since the superpage is wired, the current state of
4889 * its reference bit won't affect page replacement.
4891 if ((((pa >> PAGE_SHIFT) ^ (pv->pv_va >> PDRSHIFT) ^
4892 (uintptr_t)pmap) & (NPTEPG - 1)) == 0 &&
4893 (*pde & PG_W) == 0) {
4894 atomic_clear_int((u_int *)pde, PG_A);
4895 pmap_invalidate_page(pmap, pv->pv_va);
4900 /* Rotate the PV list if it has more than one entry. */
4901 if (TAILQ_NEXT(pv, pv_next) != NULL) {
4902 TAILQ_REMOVE(&pvh->pv_list, pv, pv_next);
4903 TAILQ_INSERT_TAIL(&pvh->pv_list, pv, pv_next);
4905 if (rtval >= PMAP_TS_REFERENCED_MAX)
4907 } while ((pv = TAILQ_FIRST(&pvh->pv_list)) != pvf);
4909 if ((pvf = TAILQ_FIRST(&m->md.pv_list)) == NULL)
4915 pde = pmap_pde(pmap, pv->pv_va);
4916 KASSERT((*pde & PG_PS) == 0,
4917 ("pmap_ts_referenced: found a 4mpage in page %p's pv list",
4919 pte = pmap_pte_quick(pmap, pv->pv_va);
4920 if ((*pte & (PG_M | PG_RW)) == (PG_M | PG_RW))
4922 if ((*pte & PG_A) != 0) {
4923 atomic_clear_int((u_int *)pte, PG_A);
4924 pmap_invalidate_page(pmap, pv->pv_va);
4928 /* Rotate the PV list if it has more than one entry. */
4929 if (TAILQ_NEXT(pv, pv_next) != NULL) {
4930 TAILQ_REMOVE(&m->md.pv_list, pv, pv_next);
4931 TAILQ_INSERT_TAIL(&m->md.pv_list, pv, pv_next);
4933 } while ((pv = TAILQ_FIRST(&m->md.pv_list)) != pvf && rtval <
4934 PMAP_TS_REFERENCED_MAX);
4937 rw_wunlock(&pvh_global_lock);
4942 * Apply the given advice to the specified range of addresses within the
4943 * given pmap. Depending on the advice, clear the referenced and/or
4944 * modified flags in each mapping and set the mapped page's dirty field.
4947 pmap_advise(pmap_t pmap, vm_offset_t sva, vm_offset_t eva, int advice)
4949 pd_entry_t oldpde, *pde;
4951 vm_offset_t va, pdnxt;
4953 boolean_t anychanged, pv_lists_locked;
4955 if (advice != MADV_DONTNEED && advice != MADV_FREE)
4957 if (pmap_is_current(pmap))
4958 pv_lists_locked = FALSE;
4960 pv_lists_locked = TRUE;
4962 rw_wlock(&pvh_global_lock);
4967 for (; sva < eva; sva = pdnxt) {
4968 pdnxt = (sva + NBPDR) & ~PDRMASK;
4971 pde = pmap_pde(pmap, sva);
4973 if ((oldpde & PG_V) == 0)
4975 else if ((oldpde & PG_PS) != 0) {
4976 if ((oldpde & PG_MANAGED) == 0)
4978 if (!pv_lists_locked) {
4979 pv_lists_locked = TRUE;
4980 if (!rw_try_wlock(&pvh_global_lock)) {
4982 pmap_invalidate_all(pmap);
4988 if (!pmap_demote_pde(pmap, pde, sva)) {
4990 * The large page mapping was destroyed.
4996 * Unless the page mappings are wired, remove the
4997 * mapping to a single page so that a subsequent
4998 * access may repromote. Since the underlying page
4999 * table page is fully populated, this removal never
5000 * frees a page table page.
5002 if ((oldpde & PG_W) == 0) {
5003 pte = pmap_pte_quick(pmap, sva);
5004 KASSERT((*pte & PG_V) != 0,
5005 ("pmap_advise: invalid PTE"));
5006 pmap_remove_pte(pmap, pte, sva, NULL);
5013 for (pte = pmap_pte_quick(pmap, sva); sva != pdnxt; pte++,
5015 if ((*pte & (PG_MANAGED | PG_V)) != (PG_MANAGED | PG_V))
5017 else if ((*pte & (PG_M | PG_RW)) == (PG_M | PG_RW)) {
5018 if (advice == MADV_DONTNEED) {
5020 * Future calls to pmap_is_modified()
5021 * can be avoided by making the page
5024 m = PHYS_TO_VM_PAGE(*pte & PG_FRAME);
5027 atomic_clear_int((u_int *)pte, PG_M | PG_A);
5028 } else if ((*pte & PG_A) != 0)
5029 atomic_clear_int((u_int *)pte, PG_A);
5032 if ((*pte & PG_G) != 0) {
5040 pmap_invalidate_range(pmap, va, sva);
5045 pmap_invalidate_range(pmap, va, sva);
5048 pmap_invalidate_all(pmap);
5049 if (pv_lists_locked) {
5051 rw_wunlock(&pvh_global_lock);
5057 * Clear the modify bits on the specified physical page.
5060 pmap_clear_modify(vm_page_t m)
5062 struct md_page *pvh;
5063 pv_entry_t next_pv, pv;
5065 pd_entry_t oldpde, *pde;
5066 pt_entry_t oldpte, *pte;
5069 KASSERT((m->oflags & VPO_UNMANAGED) == 0,
5070 ("pmap_clear_modify: page %p is not managed", m));
5071 VM_OBJECT_ASSERT_WLOCKED(m->object);
5072 KASSERT(!vm_page_xbusied(m),
5073 ("pmap_clear_modify: page %p is exclusive busied", m));
5076 * If the page is not PGA_WRITEABLE, then no PTEs can have PG_M set.
5077 * If the object containing the page is locked and the page is not
5078 * exclusive busied, then PGA_WRITEABLE cannot be concurrently set.
5080 if ((m->aflags & PGA_WRITEABLE) == 0)
5082 rw_wlock(&pvh_global_lock);
5084 if ((m->flags & PG_FICTITIOUS) != 0)
5085 goto small_mappings;
5086 pvh = pa_to_pvh(VM_PAGE_TO_PHYS(m));
5087 TAILQ_FOREACH_SAFE(pv, &pvh->pv_list, pv_next, next_pv) {
5091 pde = pmap_pde(pmap, va);
5093 if ((oldpde & PG_RW) != 0) {
5094 if (pmap_demote_pde(pmap, pde, va)) {
5095 if ((oldpde & PG_W) == 0) {
5097 * Write protect the mapping to a
5098 * single page so that a subsequent
5099 * write access may repromote.
5101 va += VM_PAGE_TO_PHYS(m) - (oldpde &
5103 pte = pmap_pte_quick(pmap, va);
5105 if ((oldpte & PG_V) != 0) {
5107 * Regardless of whether a pte is 32 or 64 bits
5108 * in size, PG_RW and PG_M are among the least
5109 * significant 32 bits.
5111 while (!atomic_cmpset_int((u_int *)pte,
5113 oldpte & ~(PG_M | PG_RW)))
5116 pmap_invalidate_page(pmap, va);
5124 TAILQ_FOREACH(pv, &m->md.pv_list, pv_next) {
5127 pde = pmap_pde(pmap, pv->pv_va);
5128 KASSERT((*pde & PG_PS) == 0, ("pmap_clear_modify: found"
5129 " a 4mpage in page %p's pv list", m));
5130 pte = pmap_pte_quick(pmap, pv->pv_va);
5131 if ((*pte & (PG_M | PG_RW)) == (PG_M | PG_RW)) {
5133 * Regardless of whether a pte is 32 or 64 bits
5134 * in size, PG_M is among the least significant
5137 atomic_clear_int((u_int *)pte, PG_M);
5138 pmap_invalidate_page(pmap, pv->pv_va);
5143 rw_wunlock(&pvh_global_lock);
5147 * Miscellaneous support routines follow
5150 /* Adjust the cache mode for a 4KB page mapped via a PTE. */
5151 static __inline void
5152 pmap_pte_attr(pt_entry_t *pte, int cache_bits)
5157 * The cache mode bits are all in the low 32-bits of the
5158 * PTE, so we can just spin on updating the low 32-bits.
5161 opte = *(u_int *)pte;
5162 npte = opte & ~PG_PTE_CACHE;
5164 } while (npte != opte && !atomic_cmpset_int((u_int *)pte, opte, npte));
5167 /* Adjust the cache mode for a 2/4MB page mapped via a PDE. */
5168 static __inline void
5169 pmap_pde_attr(pd_entry_t *pde, int cache_bits)
5174 * The cache mode bits are all in the low 32-bits of the
5175 * PDE, so we can just spin on updating the low 32-bits.
5178 opde = *(u_int *)pde;
5179 npde = opde & ~PG_PDE_CACHE;
5181 } while (npde != opde && !atomic_cmpset_int((u_int *)pde, opde, npde));
5185 * Map a set of physical memory pages into the kernel virtual
5186 * address space. Return a pointer to where it is mapped. This
5187 * routine is intended to be used for mapping device memory,
5191 pmap_mapdev_attr(vm_paddr_t pa, vm_size_t size, int mode)
5193 struct pmap_preinit_mapping *ppim;
5194 vm_offset_t va, offset;
5198 offset = pa & PAGE_MASK;
5199 size = round_page(offset + size);
5202 if (pa < KERNLOAD && pa + size <= KERNLOAD)
5204 else if (!pmap_initialized) {
5206 for (i = 0; i < PMAP_PREINIT_MAPPING_COUNT; i++) {
5207 ppim = pmap_preinit_mapping + i;
5208 if (ppim->va == 0) {
5212 ppim->va = virtual_avail;
5213 virtual_avail += size;
5219 panic("%s: too many preinit mappings", __func__);
5222 * If we have a preinit mapping, re-use it.
5224 for (i = 0; i < PMAP_PREINIT_MAPPING_COUNT; i++) {
5225 ppim = pmap_preinit_mapping + i;
5226 if (ppim->pa == pa && ppim->sz == size &&
5228 return ((void *)(ppim->va + offset));
5230 va = kva_alloc(size);
5232 panic("%s: Couldn't allocate KVA", __func__);
5234 for (tmpsize = 0; tmpsize < size; tmpsize += PAGE_SIZE)
5235 pmap_kenter_attr(va + tmpsize, pa + tmpsize, mode);
5236 pmap_invalidate_range(kernel_pmap, va, va + tmpsize);
5237 pmap_invalidate_cache_range(va, va + size, FALSE);
5238 return ((void *)(va + offset));
5242 pmap_mapdev(vm_paddr_t pa, vm_size_t size)
5245 return (pmap_mapdev_attr(pa, size, PAT_UNCACHEABLE));
5249 pmap_mapbios(vm_paddr_t pa, vm_size_t size)
5252 return (pmap_mapdev_attr(pa, size, PAT_WRITE_BACK));
5256 pmap_unmapdev(vm_offset_t va, vm_size_t size)
5258 struct pmap_preinit_mapping *ppim;
5262 if (va >= KERNBASE && va + size <= KERNBASE + KERNLOAD)
5264 offset = va & PAGE_MASK;
5265 size = round_page(offset + size);
5266 va = trunc_page(va);
5267 for (i = 0; i < PMAP_PREINIT_MAPPING_COUNT; i++) {
5268 ppim = pmap_preinit_mapping + i;
5269 if (ppim->va == va && ppim->sz == size) {
5270 if (pmap_initialized)
5276 if (va + size == virtual_avail)
5281 if (pmap_initialized)
5286 * Sets the memory attribute for the specified page.
5289 pmap_page_set_memattr(vm_page_t m, vm_memattr_t ma)
5292 m->md.pat_mode = ma;
5293 if ((m->flags & PG_FICTITIOUS) != 0)
5297 * If "m" is a normal page, flush it from the cache.
5298 * See pmap_invalidate_cache_range().
5300 * First, try to find an existing mapping of the page by sf
5301 * buffer. sf_buf_invalidate_cache() modifies mapping and
5302 * flushes the cache.
5304 if (sf_buf_invalidate_cache(m))
5308 * If page is not mapped by sf buffer, but CPU does not
5309 * support self snoop, map the page transient and do
5310 * invalidation. In the worst case, whole cache is flushed by
5311 * pmap_invalidate_cache_range().
5313 if ((cpu_feature & CPUID_SS) == 0)
5318 pmap_flush_page(vm_page_t m)
5320 pt_entry_t *cmap_pte2;
5322 vm_offset_t sva, eva;
5325 useclflushopt = (cpu_stdext_feature & CPUID_STDEXT_CLFLUSHOPT) != 0;
5326 if (useclflushopt || (cpu_feature & CPUID_CLFSH) != 0) {
5329 cmap_pte2 = pc->pc_cmap_pte2;
5330 mtx_lock(&pc->pc_cmap_lock);
5332 panic("pmap_flush_page: CMAP2 busy");
5333 *cmap_pte2 = PG_V | PG_RW | VM_PAGE_TO_PHYS(m) |
5334 PG_A | PG_M | pmap_cache_bits(m->md.pat_mode, 0);
5335 invlcaddr(pc->pc_cmap_addr2);
5336 sva = (vm_offset_t)pc->pc_cmap_addr2;
5337 eva = sva + PAGE_SIZE;
5340 * Use mfence or sfence despite the ordering implied by
5341 * mtx_{un,}lock() because clflush on non-Intel CPUs
5342 * and clflushopt are not guaranteed to be ordered by
5343 * any other instruction.
5347 else if (cpu_vendor_id != CPU_VENDOR_INTEL)
5349 for (; sva < eva; sva += cpu_clflush_line_size) {
5357 else if (cpu_vendor_id != CPU_VENDOR_INTEL)
5361 mtx_unlock(&pc->pc_cmap_lock);
5363 pmap_invalidate_cache();
5367 * Changes the specified virtual address range's memory type to that given by
5368 * the parameter "mode". The specified virtual address range must be
5369 * completely contained within either the kernel map.
5371 * Returns zero if the change completed successfully, and either EINVAL or
5372 * ENOMEM if the change failed. Specifically, EINVAL is returned if some part
5373 * of the virtual address range was not mapped, and ENOMEM is returned if
5374 * there was insufficient memory available to complete the change.
5377 pmap_change_attr(vm_offset_t va, vm_size_t size, int mode)
5379 vm_offset_t base, offset, tmpva;
5382 int cache_bits_pte, cache_bits_pde;
5385 base = trunc_page(va);
5386 offset = va & PAGE_MASK;
5387 size = round_page(offset + size);
5390 * Only supported on kernel virtual addresses above the recursive map.
5392 if (base < VM_MIN_KERNEL_ADDRESS)
5395 cache_bits_pde = pmap_cache_bits(mode, 1);
5396 cache_bits_pte = pmap_cache_bits(mode, 0);
5400 * Pages that aren't mapped aren't supported. Also break down
5401 * 2/4MB pages into 4KB pages if required.
5403 PMAP_LOCK(kernel_pmap);
5404 for (tmpva = base; tmpva < base + size; ) {
5405 pde = pmap_pde(kernel_pmap, tmpva);
5407 PMAP_UNLOCK(kernel_pmap);
5412 * If the current 2/4MB page already has
5413 * the required memory type, then we need not
5414 * demote this page. Just increment tmpva to
5415 * the next 2/4MB page frame.
5417 if ((*pde & PG_PDE_CACHE) == cache_bits_pde) {
5418 tmpva = trunc_4mpage(tmpva) + NBPDR;
5423 * If the current offset aligns with a 2/4MB
5424 * page frame and there is at least 2/4MB left
5425 * within the range, then we need not break
5426 * down this page into 4KB pages.
5428 if ((tmpva & PDRMASK) == 0 &&
5429 tmpva + PDRMASK < base + size) {
5433 if (!pmap_demote_pde(kernel_pmap, pde, tmpva)) {
5434 PMAP_UNLOCK(kernel_pmap);
5438 pte = vtopte(tmpva);
5440 PMAP_UNLOCK(kernel_pmap);
5445 PMAP_UNLOCK(kernel_pmap);
5448 * Ok, all the pages exist, so run through them updating their
5449 * cache mode if required.
5451 for (tmpva = base; tmpva < base + size; ) {
5452 pde = pmap_pde(kernel_pmap, tmpva);
5454 if ((*pde & PG_PDE_CACHE) != cache_bits_pde) {
5455 pmap_pde_attr(pde, cache_bits_pde);
5458 tmpva = trunc_4mpage(tmpva) + NBPDR;
5460 pte = vtopte(tmpva);
5461 if ((*pte & PG_PTE_CACHE) != cache_bits_pte) {
5462 pmap_pte_attr(pte, cache_bits_pte);
5470 * Flush CPU caches to make sure any data isn't cached that
5471 * shouldn't be, etc.
5474 pmap_invalidate_range(kernel_pmap, base, tmpva);
5475 pmap_invalidate_cache_range(base, tmpva, FALSE);
5481 * perform the pmap work for mincore
5484 pmap_mincore(pmap_t pmap, vm_offset_t addr, vm_paddr_t *locked_pa)
5487 pt_entry_t *ptep, pte;
5493 pdep = pmap_pde(pmap, addr);
5495 if (*pdep & PG_PS) {
5497 /* Compute the physical address of the 4KB page. */
5498 pa = ((*pdep & PG_PS_FRAME) | (addr & PDRMASK)) &
5500 val = MINCORE_SUPER;
5502 ptep = pmap_pte(pmap, addr);
5504 pmap_pte_release(ptep);
5505 pa = pte & PG_FRAME;
5513 if ((pte & PG_V) != 0) {
5514 val |= MINCORE_INCORE;
5515 if ((pte & (PG_M | PG_RW)) == (PG_M | PG_RW))
5516 val |= MINCORE_MODIFIED | MINCORE_MODIFIED_OTHER;
5517 if ((pte & PG_A) != 0)
5518 val |= MINCORE_REFERENCED | MINCORE_REFERENCED_OTHER;
5520 if ((val & (MINCORE_MODIFIED_OTHER | MINCORE_REFERENCED_OTHER)) !=
5521 (MINCORE_MODIFIED_OTHER | MINCORE_REFERENCED_OTHER) &&
5522 (pte & (PG_MANAGED | PG_V)) == (PG_MANAGED | PG_V)) {
5523 /* Ensure that "PHYS_TO_VM_PAGE(pa)->object" doesn't change. */
5524 if (vm_page_pa_tryrelock(pmap, pa, locked_pa))
5527 PA_UNLOCK_COND(*locked_pa);
5533 pmap_activate(struct thread *td)
5535 pmap_t pmap, oldpmap;
5540 pmap = vmspace_pmap(td->td_proc->p_vmspace);
5541 oldpmap = PCPU_GET(curpmap);
5542 cpuid = PCPU_GET(cpuid);
5544 CPU_CLR_ATOMIC(cpuid, &oldpmap->pm_active);
5545 CPU_SET_ATOMIC(cpuid, &pmap->pm_active);
5547 CPU_CLR(cpuid, &oldpmap->pm_active);
5548 CPU_SET(cpuid, &pmap->pm_active);
5550 #if defined(PAE) || defined(PAE_TABLES)
5551 cr3 = vtophys(pmap->pm_pdpt);
5553 cr3 = vtophys(pmap->pm_pdir);
5556 * pmap_activate is for the current thread on the current cpu
5558 td->td_pcb->pcb_cr3 = cr3;
5560 PCPU_SET(curpmap, pmap);
5565 pmap_sync_icache(pmap_t pm, vm_offset_t va, vm_size_t sz)
5570 * Increase the starting virtual address of the given mapping if a
5571 * different alignment might result in more superpage mappings.
5574 pmap_align_superpage(vm_object_t object, vm_ooffset_t offset,
5575 vm_offset_t *addr, vm_size_t size)
5577 vm_offset_t superpage_offset;
5581 if (object != NULL && (object->flags & OBJ_COLORED) != 0)
5582 offset += ptoa(object->pg_color);
5583 superpage_offset = offset & PDRMASK;
5584 if (size - ((NBPDR - superpage_offset) & PDRMASK) < NBPDR ||
5585 (*addr & PDRMASK) == superpage_offset)
5587 if ((*addr & PDRMASK) < superpage_offset)
5588 *addr = (*addr & ~PDRMASK) + superpage_offset;
5590 *addr = ((*addr + PDRMASK) & ~PDRMASK) + superpage_offset;
5594 pmap_quick_enter_page(vm_page_t m)
5600 qaddr = PCPU_GET(qmap_addr);
5601 pte = vtopte(qaddr);
5603 KASSERT(*pte == 0, ("pmap_quick_enter_page: PTE busy"));
5604 *pte = PG_V | PG_RW | VM_PAGE_TO_PHYS(m) | PG_A | PG_M |
5605 pmap_cache_bits(pmap_page_get_memattr(m), 0);
5612 pmap_quick_remove_page(vm_offset_t addr)
5617 qaddr = PCPU_GET(qmap_addr);
5618 pte = vtopte(qaddr);
5620 KASSERT(*pte != 0, ("pmap_quick_remove_page: PTE not in use"));
5621 KASSERT(addr == qaddr, ("pmap_quick_remove_page: invalid address"));
5627 #if defined(PMAP_DEBUG)
5628 pmap_pid_dump(int pid)
5635 sx_slock(&allproc_lock);
5636 FOREACH_PROC_IN_SYSTEM(p) {
5637 if (p->p_pid != pid)
5643 pmap = vmspace_pmap(p->p_vmspace);
5644 for (i = 0; i < NPDEPTD; i++) {
5647 vm_offset_t base = i << PDRSHIFT;
5649 pde = &pmap->pm_pdir[i];
5650 if (pde && pmap_pde_v(pde)) {
5651 for (j = 0; j < NPTEPG; j++) {
5652 vm_offset_t va = base + (j << PAGE_SHIFT);
5653 if (va >= (vm_offset_t) VM_MIN_KERNEL_ADDRESS) {
5658 sx_sunlock(&allproc_lock);
5661 pte = pmap_pte(pmap, va);
5662 if (pte && pmap_pte_v(pte)) {
5666 m = PHYS_TO_VM_PAGE(pa & PG_FRAME);
5667 printf("va: 0x%x, pt: 0x%x, h: %d, w: %d, f: 0x%x",
5668 va, pa, m->hold_count, m->wire_count, m->flags);
5683 sx_sunlock(&allproc_lock);