2 * Copyright (c) 1991 Regents of the University of California.
4 * Copyright (c) 1994 John S. Dyson
6 * Copyright (c) 1994 David Greenman
9 * This code is derived from software contributed to Berkeley by
10 * the Systems Programming Group of the University of Utah Computer
11 * Science Department and William Jolitz of UUNET Technologies Inc.
13 * Redistribution and use in source and binary forms, with or without
14 * modification, are permitted provided that the following conditions
16 * 1. Redistributions of source code must retain the above copyright
17 * notice, this list of conditions and the following disclaimer.
18 * 2. Redistributions in binary form must reproduce the above copyright
19 * notice, this list of conditions and the following disclaimer in the
20 * documentation and/or other materials provided with the distribution.
21 * 3. All advertising materials mentioning features or use of this software
22 * must display the following acknowledgement:
23 * This product includes software developed by the University of
24 * California, Berkeley and its contributors.
25 * 4. Neither the name of the University nor the names of its contributors
26 * may be used to endorse or promote products derived from this software
27 * without specific prior written permission.
29 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
30 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
31 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
32 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
33 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
34 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
35 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
36 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
37 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
38 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
41 * from: @(#)pmap.c 7.7 (Berkeley) 5/12/91
42 * $FreeBSD: src/sys/i386/i386/pmap.c,v 1.250.2.18 2002/03/06 22:48:53 silby Exp $
43 * $DragonFly: src/sys/platform/pc32/i386/pmap.c,v 1.72 2007/01/15 09:28:36 dillon Exp $
47 * Manages physical address maps.
49 * In addition to hardware address maps, this
50 * module is called upon to provide software-use-only
51 * maps which may or may not be stored in the same
52 * form as hardware maps. These pseudo-maps are
53 * used to store intermediate results from copy
54 * operations to and from address spaces.
56 * Since the information managed by this module is
57 * also stored by the logical address mapping module,
58 * this module may throw away valid virtual-to-physical
59 * mappings at almost any time. However, invalidations
60 * of virtual-to-physical mappings must be done as
63 * In order to cope with hardware architectures which
64 * make virtual-to-physical map invalidates expensive,
65 * this module may delay invalidate or reduced protection
66 * operations until such time as they are actually
67 * necessary. This module is given full information as
68 * to which processors are currently using which maps,
69 * and to when physical maps must be made correct.
72 #include "opt_disable_pse.h"
74 #include "opt_msgbuf.h"
76 #include <sys/param.h>
77 #include <sys/systm.h>
78 #include <sys/kernel.h>
80 #include <sys/msgbuf.h>
81 #include <sys/vmmeter.h>
85 #include <vm/vm_param.h>
86 #include <sys/sysctl.h>
88 #include <vm/vm_kern.h>
89 #include <vm/vm_page.h>
90 #include <vm/vm_map.h>
91 #include <vm/vm_object.h>
92 #include <vm/vm_extern.h>
93 #include <vm/vm_pageout.h>
94 #include <vm/vm_pager.h>
95 #include <vm/vm_zone.h>
98 #include <sys/thread2.h>
100 #include <machine/cputypes.h>
101 #include <machine/md_var.h>
102 #include <machine/specialreg.h>
103 #include <machine/smp.h>
104 #include <machine_base/apic/apicreg.h>
105 #include <machine/globaldata.h>
106 #include <machine/pmap.h>
107 #include <machine/pmap_inval.h>
111 #define PMAP_KEEP_PDIRS
112 #ifndef PMAP_SHPGPERPROC
113 #define PMAP_SHPGPERPROC 200
116 #if defined(DIAGNOSTIC)
117 #define PMAP_DIAGNOSTIC
122 #if !defined(PMAP_DIAGNOSTIC)
123 #define PMAP_INLINE __inline
129 * Get PDEs and PTEs for user/kernel address space
131 #define pmap_pde(m, v) (&((m)->pm_pdir[(vm_offset_t)(v) >> PDRSHIFT]))
132 #define pdir_pde(m, v) (m[(vm_offset_t)(v) >> PDRSHIFT])
134 #define pmap_pde_v(pte) ((*(int *)pte & PG_V) != 0)
135 #define pmap_pte_w(pte) ((*(int *)pte & PG_W) != 0)
136 #define pmap_pte_m(pte) ((*(int *)pte & PG_M) != 0)
137 #define pmap_pte_u(pte) ((*(int *)pte & PG_A) != 0)
138 #define pmap_pte_v(pte) ((*(int *)pte & PG_V) != 0)
142 * Given a map and a machine independent protection code,
143 * convert to a vax protection code.
145 #define pte_prot(m, p) \
146 (protection_codes[p & (VM_PROT_READ|VM_PROT_WRITE|VM_PROT_EXECUTE)])
147 static int protection_codes[8];
149 struct pmap kernel_pmap;
150 static TAILQ_HEAD(,pmap) pmap_list = TAILQ_HEAD_INITIALIZER(pmap_list);
152 vm_paddr_t avail_start; /* PA of first available physical page */
153 vm_paddr_t avail_end; /* PA of last available physical page */
154 vm_offset_t virtual_start; /* VA of first avail page (after kernel bss) */
155 vm_offset_t virtual_end; /* VA of last avail page (end of kernel AS) */
156 vm_offset_t KvaStart; /* VA start of KVA space */
157 vm_offset_t KvaEnd; /* VA end of KVA space (non-inclusive) */
158 vm_offset_t KvaSize; /* max size of kernel virtual address space */
159 static boolean_t pmap_initialized = FALSE; /* Has pmap_init completed? */
160 static int pgeflag; /* PG_G or-in */
161 static int pseflag; /* PG_PS or-in */
163 static vm_object_t kptobj;
166 vm_offset_t kernel_vm_end;
169 * Data for the pv entry allocation mechanism
171 static vm_zone_t pvzone;
172 static struct vm_zone pvzone_store;
173 static struct vm_object pvzone_obj;
174 static int pv_entry_count=0, pv_entry_max=0, pv_entry_high_water=0;
175 static int pmap_pagedaemon_waken = 0;
176 static struct pv_entry *pvinit;
179 * All those kernel PT submaps that BSD is so fond of
181 pt_entry_t *CMAP1 = 0, *ptmmap;
182 caddr_t CADDR1 = 0, ptvmmap = 0;
183 static pt_entry_t *msgbufmap;
184 struct msgbuf *msgbufp=0;
189 static pt_entry_t *pt_crashdumpmap;
190 static caddr_t crashdumpmap;
192 extern pt_entry_t *SMPpt;
194 static PMAP_INLINE void free_pv_entry (pv_entry_t pv);
195 static unsigned * get_ptbase (pmap_t pmap);
196 static pv_entry_t get_pv_entry (void);
197 static void i386_protection_init (void);
198 static __inline void pmap_clearbit (vm_page_t m, int bit);
200 static void pmap_remove_all (vm_page_t m);
201 static vm_page_t pmap_enter_quick (pmap_t pmap, vm_offset_t va,
202 vm_page_t m, vm_page_t mpte);
203 static int pmap_remove_pte (struct pmap *pmap, unsigned *ptq,
204 vm_offset_t sva, pmap_inval_info_t info);
205 static void pmap_remove_page (struct pmap *pmap,
206 vm_offset_t va, pmap_inval_info_t info);
207 static int pmap_remove_entry (struct pmap *pmap, vm_page_t m,
208 vm_offset_t va, pmap_inval_info_t info);
209 static boolean_t pmap_testbit (vm_page_t m, int bit);
210 static void pmap_insert_entry (pmap_t pmap, vm_offset_t va,
211 vm_page_t mpte, vm_page_t m);
213 static vm_page_t pmap_allocpte (pmap_t pmap, vm_offset_t va);
215 static int pmap_release_free_page (pmap_t pmap, vm_page_t p);
216 static vm_page_t _pmap_allocpte (pmap_t pmap, unsigned ptepindex);
217 static unsigned * pmap_pte_quick (pmap_t pmap, vm_offset_t va);
218 static vm_page_t pmap_page_lookup (vm_object_t object, vm_pindex_t pindex);
219 static int pmap_unuse_pt (pmap_t, vm_offset_t, vm_page_t, pmap_inval_info_t);
220 static vm_offset_t pmap_kmem_choose(vm_offset_t addr);
222 static unsigned pdir4mb;
225 * Move the kernel virtual free pointer to the next
226 * 4MB. This is used to help improve performance
227 * by using a large (4MB) page for much of the kernel
228 * (.text, .data, .bss)
231 pmap_kmem_choose(vm_offset_t addr)
233 vm_offset_t newaddr = addr;
235 if (cpu_feature & CPUID_PSE) {
236 newaddr = (addr + (NBPDR - 1)) & ~(NBPDR - 1);
245 * Extract the page table entry associated with the given map/virtual
248 * This function may NOT be called from an interrupt.
250 PMAP_INLINE unsigned *
251 pmap_pte(pmap_t pmap, vm_offset_t va)
256 pdeaddr = (unsigned *) pmap_pde(pmap, va);
257 if (*pdeaddr & PG_PS)
260 return get_ptbase(pmap) + i386_btop(va);
269 * Super fast pmap_pte routine best used when scanning the pv lists.
270 * This eliminates many course-grained invltlb calls. Note that many of
271 * the pv list scans are across different pmaps and it is very wasteful
272 * to do an entire invltlb when checking a single mapping.
274 * Should only be called while in a critical section.
277 pmap_pte_quick(pmap_t pmap, vm_offset_t va)
279 struct mdglobaldata *gd = mdcpu;
282 if ((pde = (unsigned) pmap->pm_pdir[va >> PDRSHIFT]) != 0) {
283 unsigned frame = (unsigned) pmap->pm_pdir[PTDPTDI] & PG_FRAME;
284 unsigned index = i386_btop(va);
285 /* are we current address space or kernel? */
286 if ((pmap == &kernel_pmap) ||
287 (frame == (((unsigned) PTDpde) & PG_FRAME))) {
288 return (unsigned *) PTmap + index;
290 newpf = pde & PG_FRAME;
291 if ( ((* (unsigned *) gd->gd_PMAP1) & PG_FRAME) != newpf) {
292 * (unsigned *) gd->gd_PMAP1 = newpf | PG_RW | PG_V;
293 cpu_invlpg(gd->gd_PADDR1);
295 return gd->gd_PADDR1 + ((unsigned) index & (NPTEPG - 1));
302 * Bootstrap the system enough to run with virtual memory.
304 * On the i386 this is called after mapping has already been enabled
305 * and just syncs the pmap module with what has already been done.
306 * [We can't call it easily with mapping off since the kernel is not
307 * mapped with PA == VA, hence we would have to relocate every address
308 * from the linked base (virtual) address "KERNBASE" to the actual
309 * (physical) address starting relative to 0]
312 pmap_bootstrap(vm_paddr_t firstaddr, vm_paddr_t loadaddr)
316 struct mdglobaldata *gd;
320 KvaStart = (vm_offset_t)VADDR(PTDPTDI, 0);
321 KvaSize = (vm_offset_t)VADDR(APTDPTDI, 0) - KvaStart;
322 KvaEnd = KvaStart + KvaSize;
324 avail_start = firstaddr;
327 * XXX The calculation of virtual_start is wrong. It's NKPT*PAGE_SIZE
328 * too large. It should instead be correctly calculated in locore.s and
329 * not based on 'first' (which is a physical address, not a virtual
330 * address, for the start of unused physical memory). The kernel
331 * page tables are NOT double mapped and thus should not be included
332 * in this calculation.
334 virtual_start = (vm_offset_t) KERNBASE + firstaddr;
335 virtual_start = pmap_kmem_choose(virtual_start);
336 virtual_end = VADDR(KPTDI+NKPDE-1, NPTEPG-1);
339 * Initialize protection array.
341 i386_protection_init();
344 * The kernel's pmap is statically allocated so we don't have to use
345 * pmap_create, which is unlikely to work correctly at this part of
346 * the boot sequence (XXX and which no longer exists).
348 kernel_pmap.pm_pdir = (pd_entry_t *)(KERNBASE + (u_int)IdlePTD);
349 kernel_pmap.pm_count = 1;
350 kernel_pmap.pm_active = (cpumask_t)-1; /* don't allow deactivation */
351 TAILQ_INIT(&kernel_pmap.pm_pvlist);
355 * Reserve some special page table entries/VA space for temporary
358 #define SYSMAP(c, p, v, n) \
359 v = (c)va; va += ((n)*PAGE_SIZE); p = pte; pte += (n);
362 pte = (pt_entry_t *) pmap_pte(&kernel_pmap, va);
365 * CMAP1/CMAP2 are used for zeroing and copying pages.
367 SYSMAP(caddr_t, CMAP1, CADDR1, 1)
372 SYSMAP(caddr_t, pt_crashdumpmap, crashdumpmap, MAXDUMPPGS);
375 * ptvmmap is used for reading arbitrary physical pages via
378 SYSMAP(caddr_t, ptmmap, ptvmmap, 1)
381 * msgbufp is used to map the system message buffer.
382 * XXX msgbufmap is not used.
384 SYSMAP(struct msgbuf *, msgbufmap, msgbufp,
385 atop(round_page(MSGBUF_SIZE)))
390 for (i = 0; i < NKPT; i++)
394 * PG_G is terribly broken on SMP because we IPI invltlb's in some
395 * cases rather then invl1pg. Actually, I don't even know why it
396 * works under UP because self-referential page table mappings
401 if (cpu_feature & CPUID_PGE)
406 * Initialize the 4MB page size flag
410 * The 4MB page version of the initial
411 * kernel page mapping.
415 #if !defined(DISABLE_PSE)
416 if (cpu_feature & CPUID_PSE) {
419 * Note that we have enabled PSE mode
422 ptditmp = *((unsigned *)PTmap + i386_btop(KERNBASE));
423 ptditmp &= ~(NBPDR - 1);
424 ptditmp |= PG_V | PG_RW | PG_PS | PG_U | pgeflag;
429 * Enable the PSE mode. If we are SMP we can't do this
430 * now because the APs will not be able to use it when
433 load_cr4(rcr4() | CR4_PSE);
436 * We can do the mapping here for the single processor
437 * case. We simply ignore the old page table page from
441 * For SMP, we still need 4K pages to bootstrap APs,
442 * PSE will be enabled as soon as all APs are up.
444 PTD[KPTDI] = (pd_entry_t)ptditmp;
445 kernel_pmap.pm_pdir[KPTDI] = (pd_entry_t)ptditmp;
451 if (cpu_apic_address == 0)
452 panic("pmap_bootstrap: no local apic!");
454 /* local apic is mapped on last page */
455 SMPpt[NPTEPG - 1] = (pt_entry_t)(PG_V | PG_RW | PG_N | pgeflag |
456 (cpu_apic_address & PG_FRAME));
460 * We need to finish setting up the globaldata page for the BSP.
461 * locore has already populated the page table for the mdglobaldata
464 pg = MDGLOBALDATA_BASEALLOC_PAGES;
465 gd = &CPU_prvspace[0].mdglobaldata;
466 gd->gd_CMAP1 = &SMPpt[pg + 0];
467 gd->gd_CMAP2 = &SMPpt[pg + 1];
468 gd->gd_CMAP3 = &SMPpt[pg + 2];
469 gd->gd_PMAP1 = &SMPpt[pg + 3];
470 gd->gd_CADDR1 = CPU_prvspace[0].CPAGE1;
471 gd->gd_CADDR2 = CPU_prvspace[0].CPAGE2;
472 gd->gd_CADDR3 = CPU_prvspace[0].CPAGE3;
473 gd->gd_PADDR1 = (unsigned *)CPU_prvspace[0].PPAGE1;
480 * Set 4mb pdir for mp startup
485 if (pseflag && (cpu_feature & CPUID_PSE)) {
486 load_cr4(rcr4() | CR4_PSE);
487 if (pdir4mb && mycpu->gd_cpuid == 0) { /* only on BSP */
488 kernel_pmap.pm_pdir[KPTDI] =
489 PTD[KPTDI] = (pd_entry_t)pdir4mb;
497 * Initialize the pmap module.
498 * Called by vm_init, to initialize any structures that the pmap
499 * system needs to map virtual memory.
500 * pmap_init has been enhanced to support in a fairly consistant
501 * way, discontiguous physical memory.
510 * object for kernel page table pages
512 kptobj = vm_object_allocate(OBJT_DEFAULT, NKPDE);
515 * Allocate memory for random pmap data structures. Includes the
519 for(i = 0; i < vm_page_array_size; i++) {
522 m = &vm_page_array[i];
523 TAILQ_INIT(&m->md.pv_list);
524 m->md.pv_list_count = 0;
528 * init the pv free list
530 initial_pvs = vm_page_array_size;
531 if (initial_pvs < MINPV)
533 pvzone = &pvzone_store;
534 pvinit = (struct pv_entry *) kmem_alloc(&kernel_map,
535 initial_pvs * sizeof (struct pv_entry));
536 zbootinit(pvzone, "PV ENTRY", sizeof (struct pv_entry), pvinit,
540 * Now it is safe to enable pv_table recording.
542 pmap_initialized = TRUE;
546 * Initialize the address space (zone) for the pv_entries. Set a
547 * high water mark so that the system can recover from excessive
548 * numbers of pv entries.
553 int shpgperproc = PMAP_SHPGPERPROC;
555 TUNABLE_INT_FETCH("vm.pmap.shpgperproc", &shpgperproc);
556 pv_entry_max = shpgperproc * maxproc + vm_page_array_size;
557 TUNABLE_INT_FETCH("vm.pmap.pv_entries", &pv_entry_max);
558 pv_entry_high_water = 9 * (pv_entry_max / 10);
559 zinitna(pvzone, &pvzone_obj, NULL, 0, pv_entry_max, ZONE_INTERRUPT, 1);
563 /***************************************************
564 * Low level helper routines.....
565 ***************************************************/
567 #if defined(PMAP_DIAGNOSTIC)
570 * This code checks for non-writeable/modified pages.
571 * This should be an invalid condition.
574 pmap_nw_modified(pt_entry_t ptea)
580 if ((pte & (PG_M|PG_RW)) == PG_M)
589 * this routine defines the region(s) of memory that should
590 * not be tested for the modified bit.
592 static PMAP_INLINE int
593 pmap_track_modified(vm_offset_t va)
595 if ((va < clean_sva) || (va >= clean_eva))
602 get_ptbase(pmap_t pmap)
604 unsigned frame = (unsigned) pmap->pm_pdir[PTDPTDI] & PG_FRAME;
605 struct globaldata *gd = mycpu;
607 /* are we current address space or kernel? */
608 if (pmap == &kernel_pmap || frame == (((unsigned) PTDpde) & PG_FRAME)) {
609 return (unsigned *) PTmap;
612 /* otherwise, we are alternate address space */
613 KKASSERT(gd->gd_intr_nesting_level == 0 &&
614 (gd->gd_curthread->td_flags & TDF_INTTHREAD) == 0);
616 if (frame != (((unsigned) APTDpde) & PG_FRAME)) {
617 APTDpde = (pd_entry_t)(frame | PG_RW | PG_V);
618 /* The page directory is not shared between CPUs */
621 return (unsigned *) APTmap;
627 * Extract the physical page address associated with the map/VA pair.
629 * This function may not be called from an interrupt if the pmap is
633 pmap_extract(pmap_t pmap, vm_offset_t va)
636 vm_offset_t pdirindex;
638 pdirindex = va >> PDRSHIFT;
639 if (pmap && (rtval = (unsigned) pmap->pm_pdir[pdirindex])) {
641 if ((rtval & PG_PS) != 0) {
642 rtval &= ~(NBPDR - 1);
643 rtval |= va & (NBPDR - 1);
646 pte = get_ptbase(pmap) + i386_btop(va);
647 rtval = ((*pte & PG_FRAME) | (va & PAGE_MASK));
653 /***************************************************
654 * Low level mapping routines.....
655 ***************************************************/
658 * Routine: pmap_kenter
660 * Add a wired page to the KVA
661 * NOTE! note that in order for the mapping to take effect -- you
662 * should do an invltlb after doing the pmap_kenter().
665 pmap_kenter(vm_offset_t va, vm_paddr_t pa)
669 pmap_inval_info info;
671 pmap_inval_init(&info);
672 pmap_inval_add(&info, &kernel_pmap, va);
673 npte = pa | PG_RW | PG_V | pgeflag;
674 pte = (unsigned *)vtopte(va);
676 pmap_inval_flush(&info);
680 * Routine: pmap_kenter_quick
682 * Similar to pmap_kenter(), except we only invalidate the
683 * mapping on the current CPU.
686 pmap_kenter_quick(vm_offset_t va, vm_paddr_t pa)
691 npte = pa | PG_RW | PG_V | pgeflag;
692 pte = (unsigned *)vtopte(va);
694 cpu_invlpg((void *)va);
698 pmap_kenter_sync(vm_offset_t va)
700 pmap_inval_info info;
702 pmap_inval_init(&info);
703 pmap_inval_add(&info, &kernel_pmap, va);
704 pmap_inval_flush(&info);
708 pmap_kenter_sync_quick(vm_offset_t va)
710 cpu_invlpg((void *)va);
714 * remove a page from the kernel pagetables
717 pmap_kremove(vm_offset_t va)
720 pmap_inval_info info;
722 pmap_inval_init(&info);
723 pmap_inval_add(&info, &kernel_pmap, va);
724 pte = (unsigned *)vtopte(va);
726 pmap_inval_flush(&info);
730 pmap_kremove_quick(vm_offset_t va)
733 pte = (unsigned *)vtopte(va);
735 cpu_invlpg((void *)va);
739 * XXX these need to be recoded. They are not used in any critical path.
742 pmap_kmodify_rw(vm_offset_t va)
744 *vtopte(va) |= PG_RW;
745 cpu_invlpg((void *)va);
749 pmap_kmodify_nc(vm_offset_t va)
752 cpu_invlpg((void *)va);
756 * Used to map a range of physical addresses into kernel
757 * virtual address space.
759 * For now, VM is already on, we only need to map the
763 pmap_map(vm_offset_t virt, vm_paddr_t start, vm_paddr_t end, int prot)
765 while (start < end) {
766 pmap_kenter(virt, start);
775 * Add a list of wired pages to the kva
776 * this routine is only used for temporary
777 * kernel mappings that do not need to have
778 * page modification or references recorded.
779 * Note that old mappings are simply written
780 * over. The page *must* be wired.
783 pmap_qenter(vm_offset_t va, vm_page_t *m, int count)
787 end_va = va + count * PAGE_SIZE;
789 while (va < end_va) {
792 pte = (unsigned *)vtopte(va);
793 *pte = VM_PAGE_TO_PHYS(*m) | PG_RW | PG_V | pgeflag;
794 cpu_invlpg((void *)va);
799 smp_invltlb(); /* XXX */
804 pmap_qenter2(vm_offset_t va, vm_page_t *m, int count, cpumask_t *mask)
807 cpumask_t cmask = mycpu->gd_cpumask;
809 end_va = va + count * PAGE_SIZE;
811 while (va < end_va) {
816 * Install the new PTE. If the pte changed from the prior
817 * mapping we must reset the cpu mask and invalidate the page.
818 * If the pte is the same but we have not seen it on the
819 * current cpu, invlpg the existing mapping. Otherwise the
820 * entry is optimal and no invalidation is required.
822 pte = (unsigned *)vtopte(va);
823 pteval = VM_PAGE_TO_PHYS(*m) | PG_A | PG_RW | PG_V | pgeflag;
824 if (*pte != pteval) {
827 cpu_invlpg((void *)va);
828 } else if ((*mask & cmask) == 0) {
829 cpu_invlpg((void *)va);
838 * this routine jerks page mappings from the
839 * kernel -- it is meant only for temporary mappings.
842 pmap_qremove(vm_offset_t va, int count)
846 end_va = va + count*PAGE_SIZE;
848 while (va < end_va) {
851 pte = (unsigned *)vtopte(va);
853 cpu_invlpg((void *)va);
862 * This routine works like vm_page_lookup() but also blocks as long as the
863 * page is busy. This routine does not busy the page it returns.
865 * Unless the caller is managing objects whos pages are in a known state,
866 * the call should be made with a critical section held so the page's object
867 * association remains valid on return.
870 pmap_page_lookup(vm_object_t object, vm_pindex_t pindex)
875 m = vm_page_lookup(object, pindex);
876 if (m && vm_page_sleep_busy(m, FALSE, "pplookp"))
882 * Create a new thread and optionally associate it with a (new) process.
883 * NOTE! the new thread's cpu may not equal the current cpu.
886 pmap_init_thread(thread_t td)
888 /* enforce pcb placement */
889 td->td_pcb = (struct pcb *)(td->td_kstack + td->td_kstack_size) - 1;
890 td->td_savefpu = &td->td_pcb->pcb_save;
891 td->td_sp = (char *)td->td_pcb - 16;
895 * Create the UPAGES for a new process.
896 * This routine directly affects the fork perf for a process.
899 pmap_init_proc(struct proc *p, struct thread *td)
901 p->p_addr = (void *)td->td_kstack;
904 td->td_lwp = &p->p_lwp;
905 td->td_switch = cpu_heavy_switch;
907 KKASSERT(td->td_mpcount == 1);
909 bzero(p->p_addr, sizeof(*p->p_addr));
913 * Dispose the UPAGES for a process that has exited.
914 * This routine directly impacts the exit perf of a process.
917 pmap_dispose_proc(struct proc *p)
921 KASSERT(p->p_lock == 0, ("attempt to dispose referenced proc! %p", p));
923 if ((td = p->p_thread) != NULL) {
931 /***************************************************
932 * Page table page management routines.....
933 ***************************************************/
936 * This routine unholds page table pages, and if the hold count
937 * drops to zero, then it decrements the wire count.
940 _pmap_unwire_pte_hold(pmap_t pmap, vm_page_t m, pmap_inval_info_t info)
942 pmap_inval_flush(info);
943 while (vm_page_sleep_busy(m, FALSE, "pmuwpt"))
946 if (m->hold_count == 0) {
948 * unmap the page table page
950 pmap_inval_add(info, pmap, -1);
951 pmap->pm_pdir[m->pindex] = 0;
952 --pmap->pm_stats.resident_count;
954 if (pmap->pm_ptphint == m)
955 pmap->pm_ptphint = NULL;
958 * If the page is finally unwired, simply free it.
961 if (m->wire_count == 0) {
964 vm_page_free_zero(m);
965 --vmstats.v_wire_count;
972 static PMAP_INLINE int
973 pmap_unwire_pte_hold(pmap_t pmap, vm_page_t m, pmap_inval_info_t info)
976 if (m->hold_count == 0)
977 return _pmap_unwire_pte_hold(pmap, m, info);
983 * After removing a page table entry, this routine is used to
984 * conditionally free the page, and manage the hold/wire counts.
987 pmap_unuse_pt(pmap_t pmap, vm_offset_t va, vm_page_t mpte,
988 pmap_inval_info_t info)
991 if (va >= UPT_MIN_ADDRESS)
995 ptepindex = (va >> PDRSHIFT);
996 if (pmap->pm_ptphint &&
997 (pmap->pm_ptphint->pindex == ptepindex)) {
998 mpte = pmap->pm_ptphint;
1000 pmap_inval_flush(info);
1001 mpte = pmap_page_lookup( pmap->pm_pteobj, ptepindex);
1002 pmap->pm_ptphint = mpte;
1006 return pmap_unwire_pte_hold(pmap, mpte, info);
1010 * Initialize pmap0/vmspace0. This pmap is not added to pmap_list because
1011 * it, and IdlePTD, represents the template used to update all other pmaps.
1013 * On architectures where the kernel pmap is not integrated into the user
1014 * process pmap, this pmap represents the process pmap, not the kernel pmap.
1015 * kernel_pmap should be used to directly access the kernel_pmap.
1018 pmap_pinit0(struct pmap *pmap)
1021 (pd_entry_t *)kmem_alloc_pageable(&kernel_map, PAGE_SIZE);
1022 pmap_kenter((vm_offset_t)pmap->pm_pdir, (vm_offset_t) IdlePTD);
1024 pmap->pm_active = 0;
1025 pmap->pm_ptphint = NULL;
1026 TAILQ_INIT(&pmap->pm_pvlist);
1027 bzero(&pmap->pm_stats, sizeof pmap->pm_stats);
1031 * Initialize a preallocated and zeroed pmap structure,
1032 * such as one in a vmspace structure.
1035 pmap_pinit(struct pmap *pmap)
1040 * No need to allocate page table space yet but we do need a valid
1041 * page directory table.
1043 if (pmap->pm_pdir == NULL) {
1045 (pd_entry_t *)kmem_alloc_pageable(&kernel_map, PAGE_SIZE);
1049 * allocate object for the ptes
1051 if (pmap->pm_pteobj == NULL)
1052 pmap->pm_pteobj = vm_object_allocate( OBJT_DEFAULT, PTDPTDI + 1);
1055 * allocate the page directory page
1057 ptdpg = vm_page_grab( pmap->pm_pteobj, PTDPTDI,
1058 VM_ALLOC_NORMAL | VM_ALLOC_RETRY);
1060 ptdpg->wire_count = 1;
1061 ++vmstats.v_wire_count;
1064 vm_page_flag_clear(ptdpg, PG_MAPPED | PG_BUSY); /* not usually mapped*/
1065 ptdpg->valid = VM_PAGE_BITS_ALL;
1067 pmap_kenter((vm_offset_t)pmap->pm_pdir, VM_PAGE_TO_PHYS(ptdpg));
1068 if ((ptdpg->flags & PG_ZERO) == 0)
1069 bzero(pmap->pm_pdir, PAGE_SIZE);
1071 pmap->pm_pdir[MPPTDI] = PTD[MPPTDI];
1073 /* install self-referential address mapping entry */
1074 *(unsigned *) (pmap->pm_pdir + PTDPTDI) =
1075 VM_PAGE_TO_PHYS(ptdpg) | PG_V | PG_RW | PG_A | PG_M;
1078 pmap->pm_active = 0;
1079 pmap->pm_ptphint = NULL;
1080 TAILQ_INIT(&pmap->pm_pvlist);
1081 bzero(&pmap->pm_stats, sizeof pmap->pm_stats);
1085 * Wire in kernel global address entries. To avoid a race condition
1086 * between pmap initialization and pmap_growkernel, this procedure
1087 * adds the pmap to the master list (which growkernel scans to update),
1088 * then copies the template.
1091 pmap_pinit2(struct pmap *pmap)
1094 TAILQ_INSERT_TAIL(&pmap_list, pmap, pm_pmnode);
1095 /* XXX copies current process, does not fill in MPPTDI */
1096 bcopy(PTD + KPTDI, pmap->pm_pdir + KPTDI, nkpt * PTESIZE);
1101 * Attempt to release and free and vm_page in a pmap. Returns 1 on success,
1102 * 0 on failure (if the procedure had to sleep).
1105 pmap_release_free_page(struct pmap *pmap, vm_page_t p)
1107 unsigned *pde = (unsigned *) pmap->pm_pdir;
1109 * This code optimizes the case of freeing non-busy
1110 * page-table pages. Those pages are zero now, and
1111 * might as well be placed directly into the zero queue.
1113 if (vm_page_sleep_busy(p, FALSE, "pmaprl"))
1119 * Remove the page table page from the processes address space.
1122 pmap->pm_stats.resident_count--;
1124 if (p->hold_count) {
1125 panic("pmap_release: freeing held page table page");
1128 * Page directory pages need to have the kernel
1129 * stuff cleared, so they can go into the zero queue also.
1131 if (p->pindex == PTDPTDI) {
1132 bzero(pde + KPTDI, nkpt * PTESIZE);
1135 pmap_kremove((vm_offset_t)pmap->pm_pdir);
1138 if (pmap->pm_ptphint && (pmap->pm_ptphint->pindex == p->pindex))
1139 pmap->pm_ptphint = NULL;
1142 vmstats.v_wire_count--;
1143 vm_page_free_zero(p);
1148 * this routine is called if the page table page is not
1152 _pmap_allocpte(pmap_t pmap, unsigned ptepindex)
1154 vm_offset_t pteva, ptepa;
1158 * Find or fabricate a new pagetable page
1160 m = vm_page_grab(pmap->pm_pteobj, ptepindex,
1161 VM_ALLOC_NORMAL | VM_ALLOC_ZERO | VM_ALLOC_RETRY);
1163 KASSERT(m->queue == PQ_NONE,
1164 ("_pmap_allocpte: %p->queue != PQ_NONE", m));
1166 if (m->wire_count == 0)
1167 vmstats.v_wire_count++;
1171 * Increment the hold count for the page table page
1172 * (denoting a new mapping.)
1177 * Map the pagetable page into the process address space, if
1178 * it isn't already there.
1181 pmap->pm_stats.resident_count++;
1183 ptepa = VM_PAGE_TO_PHYS(m);
1184 pmap->pm_pdir[ptepindex] =
1185 (pd_entry_t) (ptepa | PG_U | PG_RW | PG_V | PG_A | PG_M);
1188 * Set the page table hint
1190 pmap->pm_ptphint = m;
1193 * Try to use the new mapping, but if we cannot, then
1194 * do it with the routine that maps the page explicitly.
1196 if ((m->flags & PG_ZERO) == 0) {
1197 if ((((unsigned)pmap->pm_pdir[PTDPTDI]) & PG_FRAME) ==
1198 (((unsigned) PTDpde) & PG_FRAME)) {
1199 pteva = UPT_MIN_ADDRESS + i386_ptob(ptepindex);
1200 bzero((caddr_t) pteva, PAGE_SIZE);
1202 pmap_zero_page(ptepa);
1206 m->valid = VM_PAGE_BITS_ALL;
1207 vm_page_flag_clear(m, PG_ZERO);
1208 vm_page_flag_set(m, PG_MAPPED);
1215 pmap_allocpte(pmap_t pmap, vm_offset_t va)
1222 * Calculate pagetable page index
1224 ptepindex = va >> PDRSHIFT;
1227 * Get the page directory entry
1229 ptepa = (vm_offset_t) pmap->pm_pdir[ptepindex];
1232 * This supports switching from a 4MB page to a
1235 if (ptepa & PG_PS) {
1236 pmap->pm_pdir[ptepindex] = 0;
1243 * If the page table page is mapped, we just increment the
1244 * hold count, and activate it.
1248 * In order to get the page table page, try the
1251 if (pmap->pm_ptphint &&
1252 (pmap->pm_ptphint->pindex == ptepindex)) {
1253 m = pmap->pm_ptphint;
1255 m = pmap_page_lookup( pmap->pm_pteobj, ptepindex);
1256 pmap->pm_ptphint = m;
1262 * Here if the pte page isn't mapped, or if it has been deallocated.
1264 return _pmap_allocpte(pmap, ptepindex);
1268 /***************************************************
1269 * Pmap allocation/deallocation routines.
1270 ***************************************************/
1273 * Release any resources held by the given physical map.
1274 * Called when a pmap initialized by pmap_pinit is being released.
1275 * Should only be called if the map contains no valid mappings.
1277 static int pmap_release_callback(struct vm_page *p, void *data);
1280 pmap_release(struct pmap *pmap)
1282 vm_object_t object = pmap->pm_pteobj;
1283 struct rb_vm_page_scan_info info;
1285 #if defined(DIAGNOSTIC)
1286 if (object->ref_count != 1)
1287 panic("pmap_release: pteobj reference count != 1");
1291 info.object = object;
1293 TAILQ_REMOVE(&pmap_list, pmap, pm_pmnode);
1300 info.limit = object->generation;
1302 vm_page_rb_tree_RB_SCAN(&object->rb_memq, NULL,
1303 pmap_release_callback, &info);
1304 if (info.error == 0 && info.mpte) {
1305 if (!pmap_release_free_page(pmap, info.mpte))
1309 } while (info.error);
1313 pmap_release_callback(struct vm_page *p, void *data)
1315 struct rb_vm_page_scan_info *info = data;
1317 if (p->pindex == PTDPTDI) {
1321 if (!pmap_release_free_page(info->pmap, p)) {
1325 if (info->object->generation != info->limit) {
1333 * Grow the number of kernel page table entries, if needed.
1337 pmap_growkernel(vm_offset_t addr)
1340 vm_offset_t ptppaddr;
1345 if (kernel_vm_end == 0) {
1346 kernel_vm_end = KERNBASE;
1348 while (pdir_pde(PTD, kernel_vm_end)) {
1349 kernel_vm_end = (kernel_vm_end + PAGE_SIZE * NPTEPG) & ~(PAGE_SIZE * NPTEPG - 1);
1353 addr = (addr + PAGE_SIZE * NPTEPG) & ~(PAGE_SIZE * NPTEPG - 1);
1354 while (kernel_vm_end < addr) {
1355 if (pdir_pde(PTD, kernel_vm_end)) {
1356 kernel_vm_end = (kernel_vm_end + PAGE_SIZE * NPTEPG) & ~(PAGE_SIZE * NPTEPG - 1);
1361 * This index is bogus, but out of the way
1363 nkpg = vm_page_alloc(kptobj, nkpt,
1364 VM_ALLOC_NORMAL | VM_ALLOC_SYSTEM | VM_ALLOC_INTERRUPT);
1366 panic("pmap_growkernel: no memory to grow kernel");
1369 ptppaddr = VM_PAGE_TO_PHYS(nkpg);
1370 pmap_zero_page(ptppaddr);
1371 newpdir = (pd_entry_t) (ptppaddr | PG_V | PG_RW | PG_A | PG_M);
1372 pdir_pde(PTD, kernel_vm_end) = newpdir;
1373 *pmap_pde(&kernel_pmap, kernel_vm_end) = newpdir;
1377 * This update must be interlocked with pmap_pinit2.
1379 TAILQ_FOREACH(pmap, &pmap_list, pm_pmnode) {
1380 *pmap_pde(pmap, kernel_vm_end) = newpdir;
1382 kernel_vm_end = (kernel_vm_end + PAGE_SIZE * NPTEPG) &
1383 ~(PAGE_SIZE * NPTEPG - 1);
1389 * Retire the given physical map from service.
1390 * Should only be called if the map contains
1391 * no valid mappings.
1394 pmap_destroy(pmap_t pmap)
1401 count = --pmap->pm_count;
1404 panic("destroying a pmap is not yet implemented");
1409 * Add a reference to the specified pmap.
1412 pmap_reference(pmap_t pmap)
1419 /***************************************************
1420 * page management routines.
1421 ***************************************************/
1424 * free the pv_entry back to the free list. This function may be
1425 * called from an interrupt.
1427 static PMAP_INLINE void
1428 free_pv_entry(pv_entry_t pv)
1435 * get a new pv_entry, allocating a block from the system
1436 * when needed. This function may be called from an interrupt.
1442 if (pv_entry_high_water &&
1443 (pv_entry_count > pv_entry_high_water) &&
1444 (pmap_pagedaemon_waken == 0)) {
1445 pmap_pagedaemon_waken = 1;
1446 wakeup (&vm_pages_needed);
1448 return zalloc(pvzone);
1452 * This routine is very drastic, but can save the system
1460 static int warningdone=0;
1462 if (pmap_pagedaemon_waken == 0)
1465 if (warningdone < 5) {
1466 kprintf("pmap_collect: collecting pv entries -- suggest increasing PMAP_SHPGPERPROC\n");
1470 for(i = 0; i < vm_page_array_size; i++) {
1471 m = &vm_page_array[i];
1472 if (m->wire_count || m->hold_count || m->busy ||
1473 (m->flags & PG_BUSY))
1477 pmap_pagedaemon_waken = 0;
1482 * If it is the first entry on the list, it is actually
1483 * in the header and we must copy the following entry up
1484 * to the header. Otherwise we must search the list for
1485 * the entry. In either case we free the now unused entry.
1488 pmap_remove_entry(struct pmap *pmap, vm_page_t m,
1489 vm_offset_t va, pmap_inval_info_t info)
1495 if (m->md.pv_list_count < pmap->pm_stats.resident_count) {
1496 TAILQ_FOREACH(pv, &m->md.pv_list, pv_list) {
1497 if (pmap == pv->pv_pmap && va == pv->pv_va)
1501 TAILQ_FOREACH(pv, &pmap->pm_pvlist, pv_plist) {
1502 if (va == pv->pv_va)
1509 TAILQ_REMOVE(&m->md.pv_list, pv, pv_list);
1510 m->md.pv_list_count--;
1511 if (TAILQ_FIRST(&m->md.pv_list) == NULL)
1512 vm_page_flag_clear(m, PG_MAPPED | PG_WRITEABLE);
1513 TAILQ_REMOVE(&pmap->pm_pvlist, pv, pv_plist);
1514 ++pmap->pm_generation;
1515 rtval = pmap_unuse_pt(pmap, va, pv->pv_ptem, info);
1523 * Create a pv entry for page at pa for
1527 pmap_insert_entry(pmap_t pmap, vm_offset_t va, vm_page_t mpte, vm_page_t m)
1532 pv = get_pv_entry();
1537 TAILQ_INSERT_TAIL(&pmap->pm_pvlist, pv, pv_plist);
1538 TAILQ_INSERT_TAIL(&m->md.pv_list, pv, pv_list);
1539 m->md.pv_list_count++;
1545 * pmap_remove_pte: do the things to unmap a page in a process
1548 pmap_remove_pte(struct pmap *pmap, unsigned *ptq, vm_offset_t va,
1549 pmap_inval_info_t info)
1554 pmap_inval_add(info, pmap, va);
1555 oldpte = loadandclear(ptq);
1557 pmap->pm_stats.wired_count -= 1;
1559 * Machines that don't support invlpg, also don't support
1560 * PG_G. XXX PG_G is disabled for SMP so don't worry about
1564 cpu_invlpg((void *)va);
1565 pmap->pm_stats.resident_count -= 1;
1566 if (oldpte & PG_MANAGED) {
1567 m = PHYS_TO_VM_PAGE(oldpte);
1568 if (oldpte & PG_M) {
1569 #if defined(PMAP_DIAGNOSTIC)
1570 if (pmap_nw_modified((pt_entry_t) oldpte)) {
1572 "pmap_remove: modified page not writable: va: 0x%x, pte: 0x%x\n",
1576 if (pmap_track_modified(va))
1580 vm_page_flag_set(m, PG_REFERENCED);
1581 return pmap_remove_entry(pmap, m, va, info);
1583 return pmap_unuse_pt(pmap, va, NULL, info);
1592 * Remove a single page from a process address space.
1594 * This function may not be called from an interrupt if the pmap is
1598 pmap_remove_page(struct pmap *pmap, vm_offset_t va, pmap_inval_info_t info)
1603 * if there is no pte for this address, just skip it!!! Otherwise
1604 * get a local va for mappings for this pmap and remove the entry.
1606 if (*pmap_pde(pmap, va) != 0) {
1607 ptq = get_ptbase(pmap) + i386_btop(va);
1609 pmap_remove_pte(pmap, ptq, va, info);
1617 * Remove the given range of addresses from the specified map.
1619 * It is assumed that the start and end are properly
1620 * rounded to the page size.
1622 * This function may not be called from an interrupt if the pmap is
1626 pmap_remove(struct pmap *pmap, vm_offset_t sva, vm_offset_t eva)
1630 vm_offset_t ptpaddr;
1631 vm_offset_t sindex, eindex;
1632 struct pmap_inval_info info;
1637 if (pmap->pm_stats.resident_count == 0)
1640 pmap_inval_init(&info);
1643 * special handling of removing one page. a very
1644 * common operation and easy to short circuit some
1647 if (((sva + PAGE_SIZE) == eva) &&
1648 (((unsigned) pmap->pm_pdir[(sva >> PDRSHIFT)] & PG_PS) == 0)) {
1649 pmap_remove_page(pmap, sva, &info);
1650 pmap_inval_flush(&info);
1655 * Get a local virtual address for the mappings that are being
1658 sindex = i386_btop(sva);
1659 eindex = i386_btop(eva);
1661 for (; sindex < eindex; sindex = pdnxt) {
1665 * Calculate index for next page table.
1667 pdnxt = ((sindex + NPTEPG) & ~(NPTEPG - 1));
1668 if (pmap->pm_stats.resident_count == 0)
1671 pdirindex = sindex / NPDEPG;
1672 if (((ptpaddr = (unsigned) pmap->pm_pdir[pdirindex]) & PG_PS) != 0) {
1673 pmap_inval_add(&info, pmap, -1);
1674 pmap->pm_pdir[pdirindex] = 0;
1675 pmap->pm_stats.resident_count -= NBPDR / PAGE_SIZE;
1680 * Weed out invalid mappings. Note: we assume that the page
1681 * directory table is always allocated, and in kernel virtual.
1687 * Limit our scan to either the end of the va represented
1688 * by the current page table page, or to the end of the
1689 * range being removed.
1691 if (pdnxt > eindex) {
1696 * NOTE: pmap_remove_pte() can block.
1698 for (; sindex != pdnxt; sindex++) {
1701 ptbase = get_ptbase(pmap);
1702 if (ptbase[sindex] == 0)
1704 va = i386_ptob(sindex);
1705 if (pmap_remove_pte(pmap, ptbase + sindex, va, &info))
1709 pmap_inval_flush(&info);
1715 * Removes this physical page from all physical maps in which it resides.
1716 * Reflects back modify bits to the pager.
1718 * This routine may not be called from an interrupt.
1722 pmap_remove_all(vm_page_t m)
1724 struct pmap_inval_info info;
1725 unsigned *pte, tpte;
1728 #if defined(PMAP_DIAGNOSTIC)
1730 * XXX this makes pmap_page_protect(NONE) illegal for non-managed
1733 if (!pmap_initialized || (m->flags & PG_FICTITIOUS)) {
1734 panic("pmap_page_protect: illegal for unmanaged page, va: 0x%08llx", (long long)VM_PAGE_TO_PHYS(m));
1738 pmap_inval_init(&info);
1740 while ((pv = TAILQ_FIRST(&m->md.pv_list)) != NULL) {
1741 pv->pv_pmap->pm_stats.resident_count--;
1743 pte = pmap_pte_quick(pv->pv_pmap, pv->pv_va);
1744 pmap_inval_add(&info, pv->pv_pmap, pv->pv_va);
1746 tpte = loadandclear(pte);
1748 pv->pv_pmap->pm_stats.wired_count--;
1751 vm_page_flag_set(m, PG_REFERENCED);
1754 * Update the vm_page_t clean and reference bits.
1757 #if defined(PMAP_DIAGNOSTIC)
1758 if (pmap_nw_modified((pt_entry_t) tpte)) {
1760 "pmap_remove_all: modified page not writable: va: 0x%x, pte: 0x%x\n",
1764 if (pmap_track_modified(pv->pv_va))
1767 TAILQ_REMOVE(&m->md.pv_list, pv, pv_list);
1768 TAILQ_REMOVE(&pv->pv_pmap->pm_pvlist, pv, pv_plist);
1769 ++pv->pv_pmap->pm_generation;
1770 m->md.pv_list_count--;
1771 pmap_unuse_pt(pv->pv_pmap, pv->pv_va, pv->pv_ptem, &info);
1775 vm_page_flag_clear(m, PG_MAPPED | PG_WRITEABLE);
1777 pmap_inval_flush(&info);
1783 * Set the physical protection on the specified range of this map
1786 * This function may not be called from an interrupt if the map is
1787 * not the kernel_pmap.
1790 pmap_protect(pmap_t pmap, vm_offset_t sva, vm_offset_t eva, vm_prot_t prot)
1793 vm_offset_t pdnxt, ptpaddr;
1794 vm_pindex_t sindex, eindex;
1795 pmap_inval_info info;
1800 if ((prot & VM_PROT_READ) == VM_PROT_NONE) {
1801 pmap_remove(pmap, sva, eva);
1805 if (prot & VM_PROT_WRITE)
1808 pmap_inval_init(&info);
1810 ptbase = get_ptbase(pmap);
1812 sindex = i386_btop(sva);
1813 eindex = i386_btop(eva);
1815 for (; sindex < eindex; sindex = pdnxt) {
1819 pdnxt = ((sindex + NPTEPG) & ~(NPTEPG - 1));
1821 pdirindex = sindex / NPDEPG;
1822 if (((ptpaddr = (unsigned) pmap->pm_pdir[pdirindex]) & PG_PS) != 0) {
1823 pmap_inval_add(&info, pmap, -1);
1824 pmap->pm_pdir[pdirindex] &= ~(PG_M|PG_RW);
1825 pmap->pm_stats.resident_count -= NBPDR / PAGE_SIZE;
1830 * Weed out invalid mappings. Note: we assume that the page
1831 * directory table is always allocated, and in kernel virtual.
1836 if (pdnxt > eindex) {
1840 for (; sindex != pdnxt; sindex++) {
1845 /* XXX this isn't optimal */
1846 pmap_inval_add(&info, pmap, i386_ptob(sindex));
1847 pbits = ptbase[sindex];
1849 if (pbits & PG_MANAGED) {
1852 m = PHYS_TO_VM_PAGE(pbits);
1853 vm_page_flag_set(m, PG_REFERENCED);
1857 if (pmap_track_modified(i386_ptob(sindex))) {
1859 m = PHYS_TO_VM_PAGE(pbits);
1868 if (pbits != ptbase[sindex]) {
1869 ptbase[sindex] = pbits;
1873 pmap_inval_flush(&info);
1877 * Insert the given physical page (p) at
1878 * the specified virtual address (v) in the
1879 * target physical map with the protection requested.
1881 * If specified, the page will be wired down, meaning
1882 * that the related pte can not be reclaimed.
1884 * NB: This is the only routine which MAY NOT lazy-evaluate
1885 * or lose information. That is, this routine must actually
1886 * insert this page into the given map NOW.
1889 pmap_enter(pmap_t pmap, vm_offset_t va, vm_page_t m, vm_prot_t prot,
1895 vm_offset_t origpte, newpte;
1897 pmap_inval_info info;
1903 #ifdef PMAP_DIAGNOSTIC
1905 panic("pmap_enter: toobig");
1906 if ((va >= UPT_MIN_ADDRESS) && (va < UPT_MAX_ADDRESS))
1907 panic("pmap_enter: invalid to pmap_enter page table pages (va: 0x%x)", va);
1909 if (va < UPT_MAX_ADDRESS && pmap == &kernel_pmap) {
1910 kprintf("Warning: pmap_enter called on UVA with kernel_pmap\n");
1912 db_print_backtrace();
1915 if (va >= UPT_MAX_ADDRESS && pmap != &kernel_pmap) {
1916 kprintf("Warning: pmap_enter called on KVA without kernel_pmap\n");
1918 db_print_backtrace();
1924 * In the case that a page table page is not
1925 * resident, we are creating it here.
1927 if (va < UPT_MIN_ADDRESS) {
1928 mpte = pmap_allocpte(pmap, va);
1931 pmap_inval_init(&info);
1932 pte = pmap_pte(pmap, va);
1935 * Page Directory table entry not valid, we need a new PT page
1938 panic("pmap_enter: invalid page directory pdir=%x, va=0x%x\n",
1939 (unsigned) pmap->pm_pdir[PTDPTDI], va);
1942 pa = VM_PAGE_TO_PHYS(m) & PG_FRAME;
1943 pmap_inval_add(&info, pmap, va); /* XXX non-optimal */
1944 origpte = *(vm_offset_t *)pte;
1945 opa = origpte & PG_FRAME;
1947 if (origpte & PG_PS)
1948 panic("pmap_enter: attempted pmap_enter on 4MB page");
1951 * Mapping has not changed, must be protection or wiring change.
1953 if (origpte && (opa == pa)) {
1955 * Wiring change, just update stats. We don't worry about
1956 * wiring PT pages as they remain resident as long as there
1957 * are valid mappings in them. Hence, if a user page is wired,
1958 * the PT page will be also.
1960 if (wired && ((origpte & PG_W) == 0))
1961 pmap->pm_stats.wired_count++;
1962 else if (!wired && (origpte & PG_W))
1963 pmap->pm_stats.wired_count--;
1965 #if defined(PMAP_DIAGNOSTIC)
1966 if (pmap_nw_modified((pt_entry_t) origpte)) {
1968 "pmap_enter: modified page not writable: va: 0x%x, pte: 0x%x\n",
1974 * Remove the extra pte reference. Note that we cannot
1975 * optimize the RO->RW case because we have adjusted the
1976 * wiring count above and may need to adjust the wiring
1983 * We might be turning off write access to the page,
1984 * so we go ahead and sense modify status.
1986 if (origpte & PG_MANAGED) {
1987 if ((origpte & PG_M) && pmap_track_modified(va)) {
1989 om = PHYS_TO_VM_PAGE(opa);
1997 * Mapping has changed, invalidate old range and fall through to
1998 * handle validating new mapping.
2002 err = pmap_remove_pte(pmap, pte, va, &info);
2004 panic("pmap_enter: pte vanished, va: 0x%x", va);
2008 * Enter on the PV list if part of our managed memory. Note that we
2009 * raise IPL while manipulating pv_table since pmap_enter can be
2010 * called at interrupt time.
2012 if (pmap_initialized &&
2013 (m->flags & (PG_FICTITIOUS|PG_UNMANAGED)) == 0) {
2014 pmap_insert_entry(pmap, va, mpte, m);
2019 * Increment counters
2021 pmap->pm_stats.resident_count++;
2023 pmap->pm_stats.wired_count++;
2027 * Now validate mapping with desired protection/wiring.
2029 newpte = (vm_offset_t) (pa | pte_prot(pmap, prot) | PG_V);
2033 if (va < UPT_MIN_ADDRESS)
2035 if (pmap == &kernel_pmap)
2039 * if the mapping or permission bits are different, we need
2040 * to update the pte.
2042 if ((origpte & ~(PG_M|PG_A)) != newpte) {
2043 *pte = newpte | PG_A;
2045 pmap_inval_flush(&info);
2049 * this code makes some *MAJOR* assumptions:
2050 * 1. Current pmap & pmap exists.
2053 * 4. No page table pages.
2054 * 5. Tlbflush is deferred to calling procedure.
2055 * 6. Page IS managed.
2056 * but is *MUCH* faster than pmap_enter...
2060 pmap_enter_quick(pmap_t pmap, vm_offset_t va, vm_page_t m, vm_page_t mpte)
2064 pmap_inval_info info;
2066 pmap_inval_init(&info);
2068 if (va < UPT_MAX_ADDRESS && pmap == &kernel_pmap) {
2069 kprintf("Warning: pmap_enter_quick called on UVA with kernel_pmap\n");
2071 db_print_backtrace();
2074 if (va >= UPT_MAX_ADDRESS && pmap != &kernel_pmap) {
2075 kprintf("Warning: pmap_enter_quick called on KVA without kernel_pmap\n");
2077 db_print_backtrace();
2082 * In the case that a page table page is not
2083 * resident, we are creating it here.
2085 if (va < UPT_MIN_ADDRESS) {
2090 * Calculate pagetable page index
2092 ptepindex = va >> PDRSHIFT;
2093 if (mpte && (mpte->pindex == ptepindex)) {
2098 * Get the page directory entry
2100 ptepa = (vm_offset_t) pmap->pm_pdir[ptepindex];
2103 * If the page table page is mapped, we just increment
2104 * the hold count, and activate it.
2108 panic("pmap_enter_quick: unexpected mapping into 4MB page");
2109 if (pmap->pm_ptphint &&
2110 (pmap->pm_ptphint->pindex == ptepindex)) {
2111 mpte = pmap->pm_ptphint;
2113 mpte = pmap_page_lookup( pmap->pm_pteobj, ptepindex);
2114 pmap->pm_ptphint = mpte;
2120 mpte = _pmap_allocpte(pmap, ptepindex);
2128 * This call to vtopte makes the assumption that we are
2129 * entering the page into the current pmap. In order to support
2130 * quick entry into any pmap, one would likely use pmap_pte_quick.
2131 * But that isn't as quick as vtopte.
2133 pte = (unsigned *)vtopte(va);
2136 pmap_unwire_pte_hold(pmap, mpte, &info);
2141 * Enter on the PV list if part of our managed memory. Note that we
2142 * raise IPL while manipulating pv_table since pmap_enter can be
2143 * called at interrupt time.
2145 if ((m->flags & (PG_FICTITIOUS|PG_UNMANAGED)) == 0)
2146 pmap_insert_entry(pmap, va, mpte, m);
2149 * Increment counters
2151 pmap->pm_stats.resident_count++;
2153 pa = VM_PAGE_TO_PHYS(m);
2156 * Now validate mapping with RO protection
2158 if (m->flags & (PG_FICTITIOUS|PG_UNMANAGED))
2159 *pte = pa | PG_V | PG_U;
2161 *pte = pa | PG_V | PG_U | PG_MANAGED;
2167 * Make a temporary mapping for a physical address. This is only intended
2168 * to be used for panic dumps.
2171 pmap_kenter_temporary(vm_paddr_t pa, int i)
2173 pmap_kenter((vm_offset_t)crashdumpmap + (i * PAGE_SIZE), pa);
2174 return ((void *)crashdumpmap);
2177 #define MAX_INIT_PT (96)
2180 * This routine preloads the ptes for a given object into the specified pmap.
2181 * This eliminates the blast of soft faults on process startup and
2182 * immediately after an mmap.
2184 static int pmap_object_init_pt_callback(vm_page_t p, void *data);
2187 pmap_object_init_pt(pmap_t pmap, vm_offset_t addr, vm_prot_t prot,
2188 vm_object_t object, vm_pindex_t pindex,
2189 vm_size_t size, int limit)
2191 struct rb_vm_page_scan_info info;
2195 * We can't preinit if read access isn't set or there is no pmap
2198 if ((prot & VM_PROT_READ) == 0 || pmap == NULL || object == NULL)
2202 * We can't preinit if the pmap is not the current pmap
2204 if (curproc == NULL || pmap != vmspace_pmap(curproc->p_vmspace))
2207 psize = i386_btop(size);
2209 if ((object->type != OBJT_VNODE) ||
2210 ((limit & MAP_PREFAULT_PARTIAL) && (psize > MAX_INIT_PT) &&
2211 (object->resident_page_count > MAX_INIT_PT))) {
2215 if (psize + pindex > object->size) {
2216 if (object->size < pindex)
2218 psize = object->size - pindex;
2225 * Use a red-black scan to traverse the requested range and load
2226 * any valid pages found into the pmap.
2228 * We cannot safely scan the object's memq unless we are in a
2229 * critical section since interrupts can remove pages from objects.
2231 info.start_pindex = pindex;
2232 info.end_pindex = pindex + psize - 1;
2239 vm_page_rb_tree_RB_SCAN(&object->rb_memq, rb_vm_page_scancmp,
2240 pmap_object_init_pt_callback, &info);
2246 pmap_object_init_pt_callback(vm_page_t p, void *data)
2248 struct rb_vm_page_scan_info *info = data;
2249 vm_pindex_t rel_index;
2251 * don't allow an madvise to blow away our really
2252 * free pages allocating pv entries.
2254 if ((info->limit & MAP_PREFAULT_MADVISE) &&
2255 vmstats.v_free_count < vmstats.v_free_reserved) {
2258 if (((p->valid & VM_PAGE_BITS_ALL) == VM_PAGE_BITS_ALL) &&
2259 (p->busy == 0) && (p->flags & (PG_BUSY | PG_FICTITIOUS)) == 0) {
2260 if ((p->queue - p->pc) == PQ_CACHE)
2261 vm_page_deactivate(p);
2263 rel_index = p->pindex - info->start_pindex;
2264 info->mpte = pmap_enter_quick(info->pmap,
2265 info->addr + i386_ptob(rel_index),
2267 vm_page_flag_set(p, PG_MAPPED);
2274 * pmap_prefault provides a quick way of clustering pagefaults into a
2275 * processes address space. It is a "cousin" of pmap_object_init_pt,
2276 * except it runs at page fault time instead of mmap time.
2280 #define PAGEORDER_SIZE (PFBAK+PFFOR)
2282 static int pmap_prefault_pageorder[] = {
2283 -PAGE_SIZE, PAGE_SIZE,
2284 -2 * PAGE_SIZE, 2 * PAGE_SIZE,
2285 -3 * PAGE_SIZE, 3 * PAGE_SIZE,
2286 -4 * PAGE_SIZE, 4 * PAGE_SIZE
2290 pmap_prefault(pmap_t pmap, vm_offset_t addra, vm_map_entry_t entry)
2300 * We do not currently prefault mappings that use virtual page
2301 * tables. We do not prefault foreign pmaps.
2303 if (entry->maptype == VM_MAPTYPE_VPAGETABLE)
2305 if (curproc == NULL || (pmap != vmspace_pmap(curproc->p_vmspace)))
2308 object = entry->object.vm_object;
2310 starta = addra - PFBAK * PAGE_SIZE;
2311 if (starta < entry->start)
2312 starta = entry->start;
2313 else if (starta > addra)
2317 * critical section protection is required to maintain the
2318 * page/object association, interrupts can free pages and remove
2319 * them from their objects.
2323 for (i = 0; i < PAGEORDER_SIZE; i++) {
2324 vm_object_t lobject;
2327 addr = addra + pmap_prefault_pageorder[i];
2328 if (addr > addra + (PFFOR * PAGE_SIZE))
2331 if (addr < starta || addr >= entry->end)
2334 if ((*pmap_pde(pmap, addr)) == NULL)
2337 pte = (unsigned *) vtopte(addr);
2341 pindex = ((addr - entry->start) + entry->offset) >> PAGE_SHIFT;
2344 for (m = vm_page_lookup(lobject, pindex);
2345 (!m && (lobject->type == OBJT_DEFAULT) &&
2346 (lobject->backing_object));
2347 lobject = lobject->backing_object
2349 if (lobject->backing_object_offset & PAGE_MASK)
2351 pindex += (lobject->backing_object_offset >> PAGE_SHIFT);
2352 m = vm_page_lookup(lobject->backing_object, pindex);
2356 * give-up when a page is not in memory
2361 if (((m->valid & VM_PAGE_BITS_ALL) == VM_PAGE_BITS_ALL) &&
2363 (m->flags & (PG_BUSY | PG_FICTITIOUS)) == 0) {
2365 if ((m->queue - m->pc) == PQ_CACHE) {
2366 vm_page_deactivate(m);
2369 mpte = pmap_enter_quick(pmap, addr, m, mpte);
2370 vm_page_flag_set(m, PG_MAPPED);
2378 * Routine: pmap_change_wiring
2379 * Function: Change the wiring attribute for a map/virtual-address
2381 * In/out conditions:
2382 * The mapping must already exist in the pmap.
2385 pmap_change_wiring(pmap_t pmap, vm_offset_t va, boolean_t wired)
2392 pte = pmap_pte(pmap, va);
2394 if (wired && !pmap_pte_w(pte))
2395 pmap->pm_stats.wired_count++;
2396 else if (!wired && pmap_pte_w(pte))
2397 pmap->pm_stats.wired_count--;
2400 * Wiring is not a hardware characteristic so there is no need to
2401 * invalidate TLB. However, in an SMP environment we must use
2402 * a locked bus cycle to update the pte (if we are not using
2403 * the pmap_inval_*() API that is)... it's ok to do this for simple
2408 atomic_set_int(pte, PG_W);
2410 atomic_clear_int(pte, PG_W);
2413 atomic_set_int_nonlocked(pte, PG_W);
2415 atomic_clear_int_nonlocked(pte, PG_W);
2422 * Copy the range specified by src_addr/len
2423 * from the source map to the range dst_addr/len
2424 * in the destination map.
2426 * This routine is only advisory and need not do anything.
2429 pmap_copy(pmap_t dst_pmap, pmap_t src_pmap, vm_offset_t dst_addr,
2430 vm_size_t len, vm_offset_t src_addr)
2432 pmap_inval_info info;
2434 vm_offset_t end_addr = src_addr + len;
2436 unsigned src_frame, dst_frame;
2439 if (dst_addr != src_addr)
2442 src_frame = ((unsigned) src_pmap->pm_pdir[PTDPTDI]) & PG_FRAME;
2443 if (src_frame != (((unsigned) PTDpde) & PG_FRAME)) {
2447 dst_frame = ((unsigned) dst_pmap->pm_pdir[PTDPTDI]) & PG_FRAME;
2448 if (dst_frame != (((unsigned) APTDpde) & PG_FRAME)) {
2449 APTDpde = (pd_entry_t) (dst_frame | PG_RW | PG_V);
2450 /* The page directory is not shared between CPUs */
2453 pmap_inval_init(&info);
2454 pmap_inval_add(&info, dst_pmap, -1);
2455 pmap_inval_add(&info, src_pmap, -1);
2458 * critical section protection is required to maintain the page/object
2459 * association, interrupts can free pages and remove them from
2463 for (addr = src_addr; addr < end_addr; addr = pdnxt) {
2464 unsigned *src_pte, *dst_pte;
2465 vm_page_t dstmpte, srcmpte;
2466 vm_offset_t srcptepaddr;
2469 if (addr >= UPT_MIN_ADDRESS)
2470 panic("pmap_copy: invalid to pmap_copy page tables\n");
2473 * Don't let optional prefaulting of pages make us go
2474 * way below the low water mark of free pages or way
2475 * above high water mark of used pv entries.
2477 if (vmstats.v_free_count < vmstats.v_free_reserved ||
2478 pv_entry_count > pv_entry_high_water)
2481 pdnxt = ((addr + PAGE_SIZE*NPTEPG) & ~(PAGE_SIZE*NPTEPG - 1));
2482 ptepindex = addr >> PDRSHIFT;
2484 srcptepaddr = (vm_offset_t) src_pmap->pm_pdir[ptepindex];
2485 if (srcptepaddr == 0)
2488 if (srcptepaddr & PG_PS) {
2489 if (dst_pmap->pm_pdir[ptepindex] == 0) {
2490 dst_pmap->pm_pdir[ptepindex] = (pd_entry_t) srcptepaddr;
2491 dst_pmap->pm_stats.resident_count += NBPDR / PAGE_SIZE;
2496 srcmpte = vm_page_lookup(src_pmap->pm_pteobj, ptepindex);
2497 if ((srcmpte == NULL) ||
2498 (srcmpte->hold_count == 0) || (srcmpte->flags & PG_BUSY))
2501 if (pdnxt > end_addr)
2504 src_pte = (unsigned *) vtopte(addr);
2505 dst_pte = (unsigned *) avtopte(addr);
2506 while (addr < pdnxt) {
2511 * we only virtual copy managed pages
2513 if ((ptetemp & PG_MANAGED) != 0) {
2515 * We have to check after allocpte for the
2516 * pte still being around... allocpte can
2519 dstmpte = pmap_allocpte(dst_pmap, addr);
2520 if ((*dst_pte == 0) && (ptetemp = *src_pte)) {
2522 * Clear the modified and
2523 * accessed (referenced) bits
2526 m = PHYS_TO_VM_PAGE(ptetemp);
2527 *dst_pte = ptetemp & ~(PG_M | PG_A);
2528 dst_pmap->pm_stats.resident_count++;
2529 pmap_insert_entry(dst_pmap, addr,
2532 pmap_unwire_pte_hold(dst_pmap, dstmpte, &info);
2534 if (dstmpte->hold_count >= srcmpte->hold_count)
2543 pmap_inval_flush(&info);
2549 * Zero the specified PA by mapping the page into KVM and clearing its
2552 * This function may be called from an interrupt and no locking is
2556 pmap_zero_page(vm_paddr_t phys)
2558 struct mdglobaldata *gd = mdcpu;
2561 if (*(int *)gd->gd_CMAP3)
2562 panic("pmap_zero_page: CMAP3 busy");
2563 *(int *)gd->gd_CMAP3 =
2564 PG_V | PG_RW | (phys & PG_FRAME) | PG_A | PG_M;
2565 cpu_invlpg(gd->gd_CADDR3);
2567 #if defined(I686_CPU)
2568 if (cpu_class == CPUCLASS_686)
2569 i686_pagezero(gd->gd_CADDR3);
2572 bzero(gd->gd_CADDR3, PAGE_SIZE);
2573 *(int *) gd->gd_CMAP3 = 0;
2578 * pmap_page_assertzero:
2580 * Assert that a page is empty, panic if it isn't.
2583 pmap_page_assertzero(vm_paddr_t phys)
2585 struct mdglobaldata *gd = mdcpu;
2589 if (*(int *)gd->gd_CMAP3)
2590 panic("pmap_zero_page: CMAP3 busy");
2591 *(int *)gd->gd_CMAP3 =
2592 PG_V | PG_RW | (phys & PG_FRAME) | PG_A | PG_M;
2593 cpu_invlpg(gd->gd_CADDR3);
2594 for (i = 0; i < PAGE_SIZE; i += 4) {
2595 if (*(int *)((char *)gd->gd_CADDR3 + i) != 0) {
2596 panic("pmap_page_assertzero() @ %p not zero!\n",
2597 (void *)gd->gd_CADDR3);
2600 *(int *) gd->gd_CMAP3 = 0;
2607 * Zero part of a physical page by mapping it into memory and clearing
2608 * its contents with bzero.
2610 * off and size may not cover an area beyond a single hardware page.
2613 pmap_zero_page_area(vm_paddr_t phys, int off, int size)
2615 struct mdglobaldata *gd = mdcpu;
2618 if (*(int *) gd->gd_CMAP3)
2619 panic("pmap_zero_page: CMAP3 busy");
2620 *(int *) gd->gd_CMAP3 = PG_V | PG_RW | (phys & PG_FRAME) | PG_A | PG_M;
2621 cpu_invlpg(gd->gd_CADDR3);
2623 #if defined(I686_CPU)
2624 if (cpu_class == CPUCLASS_686 && off == 0 && size == PAGE_SIZE)
2625 i686_pagezero(gd->gd_CADDR3);
2628 bzero((char *)gd->gd_CADDR3 + off, size);
2629 *(int *) gd->gd_CMAP3 = 0;
2636 * Copy the physical page from the source PA to the target PA.
2637 * This function may be called from an interrupt. No locking
2641 pmap_copy_page(vm_paddr_t src, vm_paddr_t dst)
2643 struct mdglobaldata *gd = mdcpu;
2646 if (*(int *) gd->gd_CMAP1)
2647 panic("pmap_copy_page: CMAP1 busy");
2648 if (*(int *) gd->gd_CMAP2)
2649 panic("pmap_copy_page: CMAP2 busy");
2651 *(int *) gd->gd_CMAP1 = PG_V | (src & PG_FRAME) | PG_A;
2652 *(int *) gd->gd_CMAP2 = PG_V | PG_RW | (dst & PG_FRAME) | PG_A | PG_M;
2654 cpu_invlpg(gd->gd_CADDR1);
2655 cpu_invlpg(gd->gd_CADDR2);
2657 bcopy(gd->gd_CADDR1, gd->gd_CADDR2, PAGE_SIZE);
2659 *(int *) gd->gd_CMAP1 = 0;
2660 *(int *) gd->gd_CMAP2 = 0;
2665 * pmap_copy_page_frag:
2667 * Copy the physical page from the source PA to the target PA.
2668 * This function may be called from an interrupt. No locking
2672 pmap_copy_page_frag(vm_paddr_t src, vm_paddr_t dst, size_t bytes)
2674 struct mdglobaldata *gd = mdcpu;
2677 if (*(int *) gd->gd_CMAP1)
2678 panic("pmap_copy_page: CMAP1 busy");
2679 if (*(int *) gd->gd_CMAP2)
2680 panic("pmap_copy_page: CMAP2 busy");
2682 *(int *) gd->gd_CMAP1 = PG_V | (src & PG_FRAME) | PG_A;
2683 *(int *) gd->gd_CMAP2 = PG_V | PG_RW | (dst & PG_FRAME) | PG_A | PG_M;
2685 cpu_invlpg(gd->gd_CADDR1);
2686 cpu_invlpg(gd->gd_CADDR2);
2688 bcopy((char *)gd->gd_CADDR1 + (src & PAGE_MASK),
2689 (char *)gd->gd_CADDR2 + (dst & PAGE_MASK),
2692 *(int *) gd->gd_CMAP1 = 0;
2693 *(int *) gd->gd_CMAP2 = 0;
2698 * Returns true if the pmap's pv is one of the first
2699 * 16 pvs linked to from this page. This count may
2700 * be changed upwards or downwards in the future; it
2701 * is only necessary that true be returned for a small
2702 * subset of pmaps for proper page aging.
2705 pmap_page_exists_quick(pmap_t pmap, vm_page_t m)
2710 if (!pmap_initialized || (m->flags & PG_FICTITIOUS))
2715 TAILQ_FOREACH(pv, &m->md.pv_list, pv_list) {
2716 if (pv->pv_pmap == pmap) {
2729 * Remove all pages from specified address space
2730 * this aids process exit speeds. Also, this code
2731 * is special cased for current process only, but
2732 * can have the more generic (and slightly slower)
2733 * mode enabled. This is much faster than pmap_remove
2734 * in the case of running down an entire address space.
2737 pmap_remove_pages(pmap_t pmap, vm_offset_t sva, vm_offset_t eva)
2739 unsigned *pte, tpte;
2742 pmap_inval_info info;
2744 int32_t save_generation;
2746 if (curproc && pmap == vmspace_pmap(curproc->p_vmspace))
2751 pmap_inval_init(&info);
2753 for (pv = TAILQ_FIRST(&pmap->pm_pvlist); pv; pv = npv) {
2754 if (pv->pv_va >= eva || pv->pv_va < sva) {
2755 npv = TAILQ_NEXT(pv, pv_plist);
2759 KKASSERT(pmap == pv->pv_pmap);
2762 pte = (unsigned *)vtopte(pv->pv_va);
2764 pte = pmap_pte_quick(pmap, pv->pv_va);
2765 if (pmap->pm_active)
2766 pmap_inval_add(&info, pmap, pv->pv_va);
2770 * We cannot remove wired pages from a process' mapping
2774 npv = TAILQ_NEXT(pv, pv_plist);
2779 m = PHYS_TO_VM_PAGE(tpte);
2781 KASSERT(m < &vm_page_array[vm_page_array_size],
2782 ("pmap_remove_pages: bad tpte %x", tpte));
2784 pmap->pm_stats.resident_count--;
2787 * Update the vm_page_t clean and reference bits.
2793 npv = TAILQ_NEXT(pv, pv_plist);
2794 TAILQ_REMOVE(&pmap->pm_pvlist, pv, pv_plist);
2795 save_generation = ++pmap->pm_generation;
2797 m->md.pv_list_count--;
2798 TAILQ_REMOVE(&m->md.pv_list, pv, pv_list);
2799 if (TAILQ_FIRST(&m->md.pv_list) == NULL) {
2800 vm_page_flag_clear(m, PG_MAPPED | PG_WRITEABLE);
2803 pmap_unuse_pt(pmap, pv->pv_va, pv->pv_ptem, &info);
2807 * Restart the scan if we blocked during the unuse or free
2808 * calls and other removals were made.
2810 if (save_generation != pmap->pm_generation) {
2811 kprintf("Warning: pmap_remove_pages race-A avoided\n");
2812 pv = TAILQ_FIRST(&pmap->pm_pvlist);
2815 pmap_inval_flush(&info);
2820 * pmap_testbit tests bits in pte's
2821 * note that the testbit/clearbit routines are inline,
2822 * and a lot of things compile-time evaluate.
2825 pmap_testbit(vm_page_t m, int bit)
2830 if (!pmap_initialized || (m->flags & PG_FICTITIOUS))
2833 if (TAILQ_FIRST(&m->md.pv_list) == NULL)
2838 TAILQ_FOREACH(pv, &m->md.pv_list, pv_list) {
2840 * if the bit being tested is the modified bit, then
2841 * mark clean_map and ptes as never
2844 if (bit & (PG_A|PG_M)) {
2845 if (!pmap_track_modified(pv->pv_va))
2849 #if defined(PMAP_DIAGNOSTIC)
2851 kprintf("Null pmap (tb) at va: 0x%x\n", pv->pv_va);
2855 pte = pmap_pte_quick(pv->pv_pmap, pv->pv_va);
2866 * this routine is used to modify bits in ptes
2868 static __inline void
2869 pmap_clearbit(vm_page_t m, int bit)
2871 struct pmap_inval_info info;
2876 if (!pmap_initialized || (m->flags & PG_FICTITIOUS))
2879 pmap_inval_init(&info);
2883 * Loop over all current mappings setting/clearing as appropos If
2884 * setting RO do we need to clear the VAC?
2886 TAILQ_FOREACH(pv, &m->md.pv_list, pv_list) {
2888 * don't write protect pager mappings
2891 if (!pmap_track_modified(pv->pv_va))
2895 #if defined(PMAP_DIAGNOSTIC)
2897 kprintf("Null pmap (cb) at va: 0x%x\n", pv->pv_va);
2903 * Careful here. We can use a locked bus instruction to
2904 * clear PG_A or PG_M safely but we need to synchronize
2905 * with the target cpus when we mess with PG_RW.
2907 * We do not have to force synchronization when clearing
2908 * PG_M even for PTEs generated via virtual memory maps,
2909 * because the virtual kernel will invalidate the pmap
2910 * entry when/if it needs to resynchronize the Modify bit.
2912 pte = pmap_pte_quick(pv->pv_pmap, pv->pv_va);
2914 pmap_inval_add(&info, pv->pv_pmap, pv->pv_va);
2921 atomic_clear_int(pte, PG_M|PG_RW);
2922 } else if (bit == PG_M) {
2924 * We could also clear PG_RW here to force
2925 * a fault on write to redetect PG_M for
2926 * virtual kernels, but it isn't necessary
2927 * since virtual kernels invalidate the pte
2928 * when they clear the VPTE_M bit in their
2929 * virtual page tables.
2931 atomic_clear_int(pte, PG_M);
2933 atomic_clear_int(pte, bit);
2937 pmap_inval_flush(&info);
2942 * pmap_page_protect:
2944 * Lower the permission for all mappings to a given page.
2947 pmap_page_protect(vm_page_t m, vm_prot_t prot)
2949 if ((prot & VM_PROT_WRITE) == 0) {
2950 if (prot & (VM_PROT_READ | VM_PROT_EXECUTE)) {
2951 pmap_clearbit(m, PG_RW);
2959 pmap_phys_address(int ppn)
2961 return (i386_ptob(ppn));
2965 * pmap_ts_referenced:
2967 * Return a count of reference bits for a page, clearing those bits.
2968 * It is not necessary for every reference bit to be cleared, but it
2969 * is necessary that 0 only be returned when there are truly no
2970 * reference bits set.
2972 * XXX: The exact number of bits to check and clear is a matter that
2973 * should be tested and standardized at some point in the future for
2974 * optimal aging of shared pages.
2977 pmap_ts_referenced(vm_page_t m)
2979 pv_entry_t pv, pvf, pvn;
2983 if (!pmap_initialized || (m->flags & PG_FICTITIOUS))
2988 if ((pv = TAILQ_FIRST(&m->md.pv_list)) != NULL) {
2993 pvn = TAILQ_NEXT(pv, pv_list);
2995 TAILQ_REMOVE(&m->md.pv_list, pv, pv_list);
2997 TAILQ_INSERT_TAIL(&m->md.pv_list, pv, pv_list);
2999 if (!pmap_track_modified(pv->pv_va))
3002 pte = pmap_pte_quick(pv->pv_pmap, pv->pv_va);
3004 if (pte && (*pte & PG_A)) {
3006 atomic_clear_int(pte, PG_A);
3008 atomic_clear_int_nonlocked(pte, PG_A);
3015 } while ((pv = pvn) != NULL && pv != pvf);
3025 * Return whether or not the specified physical page was modified
3026 * in any physical maps.
3029 pmap_is_modified(vm_page_t m)
3031 return pmap_testbit(m, PG_M);
3035 * Clear the modify bits on the specified physical page.
3038 pmap_clear_modify(vm_page_t m)
3040 pmap_clearbit(m, PG_M);
3044 * pmap_clear_reference:
3046 * Clear the reference bit on the specified physical page.
3049 pmap_clear_reference(vm_page_t m)
3051 pmap_clearbit(m, PG_A);
3055 * Miscellaneous support routines follow
3059 i386_protection_init(void)
3063 kp = protection_codes;
3064 for (prot = 0; prot < 8; prot++) {
3066 case VM_PROT_NONE | VM_PROT_NONE | VM_PROT_NONE:
3068 * Read access is also 0. There isn't any execute bit,
3069 * so just make it readable.
3071 case VM_PROT_READ | VM_PROT_NONE | VM_PROT_NONE:
3072 case VM_PROT_READ | VM_PROT_NONE | VM_PROT_EXECUTE:
3073 case VM_PROT_NONE | VM_PROT_NONE | VM_PROT_EXECUTE:
3076 case VM_PROT_NONE | VM_PROT_WRITE | VM_PROT_NONE:
3077 case VM_PROT_NONE | VM_PROT_WRITE | VM_PROT_EXECUTE:
3078 case VM_PROT_READ | VM_PROT_WRITE | VM_PROT_NONE:
3079 case VM_PROT_READ | VM_PROT_WRITE | VM_PROT_EXECUTE:
3087 * Map a set of physical memory pages into the kernel virtual
3088 * address space. Return a pointer to where it is mapped. This
3089 * routine is intended to be used for mapping device memory,
3092 * NOTE: we can't use pgeflag unless we invalidate the pages one at
3096 pmap_mapdev(vm_paddr_t pa, vm_size_t size)
3098 vm_offset_t va, tmpva, offset;
3101 offset = pa & PAGE_MASK;
3102 size = roundup(offset + size, PAGE_SIZE);
3104 va = kmem_alloc_nofault(&kernel_map, size);
3106 panic("pmap_mapdev: Couldn't alloc kernel virtual memory");
3109 for (tmpva = va; size > 0;) {
3110 pte = (unsigned *)vtopte(tmpva);
3111 *pte = pa | PG_RW | PG_V; /* | pgeflag; */
3119 return ((void *)(va + offset));
3123 pmap_unmapdev(vm_offset_t va, vm_size_t size)
3125 vm_offset_t base, offset;
3127 base = va & PG_FRAME;
3128 offset = va & PAGE_MASK;
3129 size = roundup(offset + size, PAGE_SIZE);
3130 pmap_qremove(va, size >> PAGE_SHIFT);
3131 kmem_free(&kernel_map, base, size);
3135 * perform the pmap work for mincore
3138 pmap_mincore(pmap_t pmap, vm_offset_t addr)
3140 unsigned *ptep, pte;
3144 ptep = pmap_pte(pmap, addr);
3149 if ((pte = *ptep) != 0) {
3152 val = MINCORE_INCORE;
3153 if ((pte & PG_MANAGED) == 0)
3156 pa = pte & PG_FRAME;
3158 m = PHYS_TO_VM_PAGE(pa);
3164 val |= MINCORE_MODIFIED|MINCORE_MODIFIED_OTHER;
3166 * Modified by someone
3168 else if (m->dirty || pmap_is_modified(m))
3169 val |= MINCORE_MODIFIED_OTHER;
3174 val |= MINCORE_REFERENCED|MINCORE_REFERENCED_OTHER;
3177 * Referenced by someone
3179 else if ((m->flags & PG_REFERENCED) || pmap_ts_referenced(m)) {
3180 val |= MINCORE_REFERENCED_OTHER;
3181 vm_page_flag_set(m, PG_REFERENCED);
3188 pmap_activate(struct proc *p)
3192 pmap = vmspace_pmap(p->p_vmspace);
3194 atomic_set_int(&pmap->pm_active, 1 << mycpu->gd_cpuid);
3196 pmap->pm_active |= 1;
3198 #if defined(SWTCH_OPTIM_STATS)
3201 p->p_thread->td_pcb->pcb_cr3 = vtophys(pmap->pm_pdir);
3202 load_cr3(p->p_thread->td_pcb->pcb_cr3);
3206 pmap_deactivate(struct proc *p)
3210 pmap = vmspace_pmap(p->p_vmspace);
3212 atomic_clear_int(&pmap->pm_active, 1 << mycpu->gd_cpuid);
3214 pmap->pm_active &= ~1;
3217 * XXX - note we do not adjust %cr3. The caller is expected to
3218 * activate a new pmap or do a thread-exit.
3223 pmap_addr_hint(vm_object_t obj, vm_offset_t addr, vm_size_t size)
3226 if ((obj == NULL) || (size < NBPDR) || (obj->type != OBJT_DEVICE)) {
3230 addr = (addr + (NBPDR - 1)) & ~(NBPDR - 1);
3237 static void pads (pmap_t pm);
3238 void pmap_pvdump (vm_paddr_t pa);
3240 /* print address space of pmap*/
3247 if (pm == &kernel_pmap)
3249 for (i = 0; i < 1024; i++)
3251 for (j = 0; j < 1024; j++) {
3252 va = (i << PDRSHIFT) + (j << PAGE_SHIFT);
3253 if (pm == &kernel_pmap && va < KERNBASE)
3255 if (pm != &kernel_pmap && va > UPT_MAX_ADDRESS)
3257 ptep = pmap_pte_quick(pm, va);
3258 if (pmap_pte_v(ptep))
3259 kprintf("%x:%x ", va, *(int *) ptep);
3265 pmap_pvdump(vm_paddr_t pa)
3270 kprintf("pa %08llx", (long long)pa);
3271 m = PHYS_TO_VM_PAGE(pa);
3272 TAILQ_FOREACH(pv, &m->md.pv_list, pv_list) {
3274 kprintf(" -> pmap %p, va %x, flags %x",
3275 (void *)pv->pv_pmap, pv->pv_va, pv->pv_flags);
3277 kprintf(" -> pmap %p, va %x", (void *)pv->pv_pmap, pv->pv_va);