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 * 4. Neither the name of the University nor the names of its contributors
22 * may be used to endorse or promote products derived from this software
23 * without specific prior written permission.
25 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
26 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
28 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
29 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
30 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
31 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
32 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
33 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
34 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
37 * from: @(#)pmap.c 7.7 (Berkeley) 5/12/91
38 * from: src/sys/i386/i386/pmap.c,v 1.250.2.8 2000/11/21 00:09:14 ps
39 * JNPR: pmap.c,v 1.11.2.1 2007/08/16 11:51:06 girish
43 * Manages physical address maps.
45 * In addition to hardware address maps, this
46 * module is called upon to provide software-use-only
47 * maps which may or may not be stored in the same
48 * form as hardware maps. These pseudo-maps are
49 * used to store intermediate results from copy
50 * operations to and from address spaces.
52 * Since the information managed by this module is
53 * also stored by the logical address mapping module,
54 * this module may throw away valid virtual-to-physical
55 * mappings at almost any time. However, invalidations
56 * of virtual-to-physical mappings must be done as
59 * In order to cope with hardware architectures which
60 * make virtual-to-physical map invalidates expensive,
61 * this module may delay invalidate or reduced protection
62 * operations until such time as they are actually
63 * necessary. This module is given full information as
64 * to which processors are currently using which maps,
65 * and to when physical maps must be made correct.
68 #include <sys/cdefs.h>
69 __FBSDID("$FreeBSD$");
74 #include <sys/param.h>
75 #include <sys/systm.h>
77 #include <sys/msgbuf.h>
78 #include <sys/vmmeter.h>
81 #include <sys/sysctl.h>
87 #include <vm/vm_param.h>
88 #include <vm/vm_phys.h>
90 #include <sys/mutex.h>
91 #include <vm/vm_kern.h>
92 #include <vm/vm_page.h>
93 #include <vm/vm_map.h>
94 #include <vm/vm_object.h>
95 #include <vm/vm_extern.h>
96 #include <vm/vm_pageout.h>
97 #include <vm/vm_pager.h>
100 #include <sys/sched.h>
105 #include <machine/cache.h>
106 #include <machine/md_var.h>
107 #include <machine/tlb.h>
111 #ifndef PMAP_SHPGPERPROC
112 #define PMAP_SHPGPERPROC 200
115 #if !defined(DIAGNOSTIC)
116 #define PMAP_INLINE __inline
122 #define PV_STAT(x) do { x ; } while (0)
124 #define PV_STAT(x) do { } while (0)
128 * Get PDEs and PTEs for user/kernel address space
130 #define pmap_seg_index(v) (((v) >> SEGSHIFT) & (NPDEPG - 1))
131 #define pmap_pde_index(v) (((v) >> PDRSHIFT) & (NPDEPG - 1))
132 #define pmap_pte_index(v) (((v) >> PAGE_SHIFT) & (NPTEPG - 1))
133 #define pmap_pde_pindex(v) ((v) >> PDRSHIFT)
136 #define NUPDE (NPDEPG * NPDEPG)
137 #define NUSERPGTBLS (NUPDE + NPDEPG)
139 #define NUPDE (NPDEPG)
140 #define NUSERPGTBLS (NUPDE)
143 #define is_kernel_pmap(x) ((x) == kernel_pmap)
145 struct pmap kernel_pmap_store;
146 pd_entry_t *kernel_segmap;
148 vm_offset_t virtual_avail; /* VA of first avail page (after kernel bss) */
149 vm_offset_t virtual_end; /* VA of last avail page (end of kernel AS) */
152 unsigned pmap_max_asid; /* max ASID supported by the system */
154 #define PMAP_ASID_RESERVED 0
156 vm_offset_t kernel_vm_end = VM_MIN_KERNEL_ADDRESS;
158 static void pmap_asid_alloc(pmap_t pmap);
161 * Data for the pv entry allocation mechanism
163 static TAILQ_HEAD(pch, pv_chunk) pv_chunks = TAILQ_HEAD_INITIALIZER(pv_chunks);
164 static int pv_entry_count;
166 static void free_pv_chunk(struct pv_chunk *pc);
167 static void free_pv_entry(pmap_t pmap, pv_entry_t pv);
168 static pv_entry_t get_pv_entry(pmap_t pmap, boolean_t try);
169 static vm_page_t pmap_pv_reclaim(pmap_t locked_pmap);
170 static void pmap_pvh_free(struct md_page *pvh, pmap_t pmap, vm_offset_t va);
171 static pv_entry_t pmap_pvh_remove(struct md_page *pvh, pmap_t pmap,
173 static __inline void pmap_changebit(vm_page_t m, int bit, boolean_t setem);
174 static vm_page_t pmap_enter_quick_locked(pmap_t pmap, vm_offset_t va,
175 vm_page_t m, vm_prot_t prot, vm_page_t mpte);
176 static int pmap_remove_pte(struct pmap *pmap, pt_entry_t *ptq, vm_offset_t va,
178 static void pmap_remove_page(struct pmap *pmap, vm_offset_t va);
179 static void pmap_remove_entry(struct pmap *pmap, vm_page_t m, vm_offset_t va);
180 static boolean_t pmap_try_insert_pv_entry(pmap_t pmap, vm_page_t mpte,
181 vm_offset_t va, vm_page_t m);
182 static void pmap_update_page(pmap_t pmap, vm_offset_t va, pt_entry_t pte);
183 static void pmap_invalidate_all(pmap_t pmap);
184 static void pmap_invalidate_page(pmap_t pmap, vm_offset_t va);
185 static int _pmap_unwire_pte_hold(pmap_t pmap, vm_offset_t va, vm_page_t m);
187 static vm_page_t pmap_allocpte(pmap_t pmap, vm_offset_t va, int flags);
188 static vm_page_t _pmap_allocpte(pmap_t pmap, unsigned ptepindex, int flags);
189 static int pmap_unuse_pt(pmap_t, vm_offset_t, pd_entry_t);
190 static pt_entry_t init_pte_prot(vm_offset_t va, vm_page_t m, vm_prot_t prot);
193 static void pmap_invalidate_page_action(void *arg);
194 static void pmap_update_page_action(void *arg);
199 * This structure is for high memory (memory above 512Meg in 32 bit) support.
200 * The highmem area does not have a KSEG0 mapping, and we need a mechanism to
201 * do temporary per-CPU mappings for pmap_zero_page, pmap_copy_page etc.
203 * At bootup, we reserve 2 virtual pages per CPU for mapping highmem pages. To
204 * access a highmem physical address on a CPU, we map the physical address to
205 * the reserved virtual address for the CPU in the kernel pagetable. This is
206 * done with interrupts disabled(although a spinlock and sched_pin would be
209 struct local_sysmaps {
212 uint16_t valid1, valid2;
214 static struct local_sysmaps sysmap_lmem[MAXCPU];
217 pmap_alloc_lmem_map(void)
221 for (i = 0; i < MAXCPU; i++) {
222 sysmap_lmem[i].base = virtual_avail;
223 virtual_avail += PAGE_SIZE * 2;
224 sysmap_lmem[i].valid1 = sysmap_lmem[i].valid2 = 0;
228 static __inline vm_offset_t
229 pmap_lmem_map1(vm_paddr_t phys)
231 struct local_sysmaps *sysm;
232 pt_entry_t *pte, npte;
237 intr = intr_disable();
238 cpu = PCPU_GET(cpuid);
239 sysm = &sysmap_lmem[cpu];
240 sysm->saved_intr = intr;
242 npte = TLBLO_PA_TO_PFN(phys) |
243 PTE_D | PTE_V | PTE_G | PTE_W | PTE_C_CACHE;
244 pte = pmap_pte(kernel_pmap, va);
250 static __inline vm_offset_t
251 pmap_lmem_map2(vm_paddr_t phys1, vm_paddr_t phys2)
253 struct local_sysmaps *sysm;
254 pt_entry_t *pte, npte;
255 vm_offset_t va1, va2;
259 intr = intr_disable();
260 cpu = PCPU_GET(cpuid);
261 sysm = &sysmap_lmem[cpu];
262 sysm->saved_intr = intr;
264 va2 = sysm->base + PAGE_SIZE;
265 npte = TLBLO_PA_TO_PFN(phys1) |
266 PTE_D | PTE_V | PTE_G | PTE_W | PTE_C_CACHE;
267 pte = pmap_pte(kernel_pmap, va1);
269 npte = TLBLO_PA_TO_PFN(phys2) |
270 PTE_D | PTE_V | PTE_G | PTE_W | PTE_C_CACHE;
271 pte = pmap_pte(kernel_pmap, va2);
279 pmap_lmem_unmap(void)
281 struct local_sysmaps *sysm;
285 cpu = PCPU_GET(cpuid);
286 sysm = &sysmap_lmem[cpu];
287 pte = pmap_pte(kernel_pmap, sysm->base);
289 tlb_invalidate_address(kernel_pmap, sysm->base);
292 pte = pmap_pte(kernel_pmap, sysm->base + PAGE_SIZE);
294 tlb_invalidate_address(kernel_pmap, sysm->base + PAGE_SIZE);
297 intr_restore(sysm->saved_intr);
299 #else /* __mips_n64 */
302 pmap_alloc_lmem_map(void)
306 static __inline vm_offset_t
307 pmap_lmem_map1(vm_paddr_t phys)
313 static __inline vm_offset_t
314 pmap_lmem_map2(vm_paddr_t phys1, vm_paddr_t phys2)
320 static __inline vm_offset_t
321 pmap_lmem_unmap(void)
326 #endif /* !__mips_n64 */
329 * Page table entry lookup routines.
331 static __inline pd_entry_t *
332 pmap_segmap(pmap_t pmap, vm_offset_t va)
335 return (&pmap->pm_segtab[pmap_seg_index(va)]);
339 static __inline pd_entry_t *
340 pmap_pdpe_to_pde(pd_entry_t *pdpe, vm_offset_t va)
344 pde = (pd_entry_t *)*pdpe;
345 return (&pde[pmap_pde_index(va)]);
348 static __inline pd_entry_t *
349 pmap_pde(pmap_t pmap, vm_offset_t va)
353 pdpe = pmap_segmap(pmap, va);
354 if (pdpe == NULL || *pdpe == NULL)
357 return (pmap_pdpe_to_pde(pdpe, va));
360 static __inline pd_entry_t *
361 pmap_pdpe_to_pde(pd_entry_t *pdpe, vm_offset_t va)
368 pd_entry_t *pmap_pde(pmap_t pmap, vm_offset_t va)
371 return (pmap_segmap(pmap, va));
375 static __inline pt_entry_t *
376 pmap_pde_to_pte(pd_entry_t *pde, vm_offset_t va)
380 pte = (pt_entry_t *)*pde;
381 return (&pte[pmap_pte_index(va)]);
385 pmap_pte(pmap_t pmap, vm_offset_t va)
389 pde = pmap_pde(pmap, va);
390 if (pde == NULL || *pde == NULL)
393 return (pmap_pde_to_pte(pde, va));
397 pmap_steal_memory(vm_size_t size)
399 vm_paddr_t bank_size, pa;
402 size = round_page(size);
403 bank_size = phys_avail[1] - phys_avail[0];
404 while (size > bank_size) {
407 for (i = 0; phys_avail[i + 2]; i += 2) {
408 phys_avail[i] = phys_avail[i + 2];
409 phys_avail[i + 1] = phys_avail[i + 3];
412 phys_avail[i + 1] = 0;
414 panic("pmap_steal_memory: out of memory");
415 bank_size = phys_avail[1] - phys_avail[0];
419 phys_avail[0] += size;
420 if (MIPS_DIRECT_MAPPABLE(pa) == 0)
421 panic("Out of memory below 512Meg?");
422 va = MIPS_PHYS_TO_DIRECT(pa);
423 bzero((caddr_t)va, size);
428 * Bootstrap the system enough to run with virtual memory. This
429 * assumes that the phys_avail array has been initialized.
432 pmap_create_kernel_pagetable(void)
444 * Allocate segment table for the kernel
446 kernel_segmap = (pd_entry_t *)pmap_steal_memory(PAGE_SIZE);
449 * Allocate second level page tables for the kernel
452 npde = howmany(NKPT, NPDEPG);
453 pdaddr = pmap_steal_memory(PAGE_SIZE * npde);
456 ptaddr = pmap_steal_memory(PAGE_SIZE * nkpt);
459 * The R[4-7]?00 stores only one copy of the Global bit in the
460 * translation lookaside buffer for each 2 page entry. Thus invalid
461 * entrys must have the Global bit set so when Entry LO and Entry HI
462 * G bits are anded together they will produce a global bit to store
465 for (i = 0, pte = (pt_entry_t *)ptaddr; i < (nkpt * NPTEPG); i++, pte++)
469 for (i = 0, npt = nkpt; npt > 0; i++) {
470 kernel_segmap[i] = (pd_entry_t)(pdaddr + i * PAGE_SIZE);
471 pde = (pd_entry_t *)kernel_segmap[i];
473 for (j = 0; j < NPDEPG && npt > 0; j++, npt--)
474 pde[j] = (pd_entry_t)(ptaddr + (i * NPDEPG + j) * PAGE_SIZE);
477 for (i = 0, j = pmap_seg_index(VM_MIN_KERNEL_ADDRESS); i < nkpt; i++, j++)
478 kernel_segmap[j] = (pd_entry_t)(ptaddr + (i * PAGE_SIZE));
481 PMAP_LOCK_INIT(kernel_pmap);
482 kernel_pmap->pm_segtab = kernel_segmap;
483 CPU_FILL(&kernel_pmap->pm_active);
484 TAILQ_INIT(&kernel_pmap->pm_pvchunk);
485 kernel_pmap->pm_asid[0].asid = PMAP_ASID_RESERVED;
486 kernel_pmap->pm_asid[0].gen = 0;
487 kernel_vm_end += nkpt * NPTEPG * PAGE_SIZE;
494 int need_local_mappings = 0;
498 for (i = 0; phys_avail[i + 1] != 0; i += 2) {
500 * Keep the memory aligned on page boundary.
502 phys_avail[i] = round_page(phys_avail[i]);
503 phys_avail[i + 1] = trunc_page(phys_avail[i + 1]);
507 if (phys_avail[i - 2] > phys_avail[i]) {
510 ptemp[0] = phys_avail[i + 0];
511 ptemp[1] = phys_avail[i + 1];
513 phys_avail[i + 0] = phys_avail[i - 2];
514 phys_avail[i + 1] = phys_avail[i - 1];
516 phys_avail[i - 2] = ptemp[0];
517 phys_avail[i - 1] = ptemp[1];
523 * In 32 bit, we may have memory which cannot be mapped directly.
524 * This memory will need temporary mapping before it can be
527 if (!MIPS_DIRECT_MAPPABLE(phys_avail[i - 1] - 1))
528 need_local_mappings = 1;
531 * Copy the phys_avail[] array before we start stealing memory from it.
533 for (i = 0; phys_avail[i + 1] != 0; i += 2) {
534 physmem_desc[i] = phys_avail[i];
535 physmem_desc[i + 1] = phys_avail[i + 1];
538 Maxmem = atop(phys_avail[i - 1]);
541 printf("Physical memory chunk(s):\n");
542 for (i = 0; phys_avail[i + 1] != 0; i += 2) {
545 size = phys_avail[i + 1] - phys_avail[i];
546 printf("%#08jx - %#08jx, %ju bytes (%ju pages)\n",
547 (uintmax_t) phys_avail[i],
548 (uintmax_t) phys_avail[i + 1] - 1,
549 (uintmax_t) size, (uintmax_t) size / PAGE_SIZE);
551 printf("Maxmem is 0x%0jx\n", ptoa((uintmax_t)Maxmem));
554 * Steal the message buffer from the beginning of memory.
556 msgbufp = (struct msgbuf *)pmap_steal_memory(msgbufsize);
557 msgbufinit(msgbufp, msgbufsize);
560 * Steal thread0 kstack.
562 kstack0 = pmap_steal_memory(KSTACK_PAGES << PAGE_SHIFT);
564 virtual_avail = VM_MIN_KERNEL_ADDRESS;
565 virtual_end = VM_MAX_KERNEL_ADDRESS;
569 * Steal some virtual address space to map the pcpu area.
571 virtual_avail = roundup2(virtual_avail, PAGE_SIZE * 2);
572 pcpup = (struct pcpu *)virtual_avail;
573 virtual_avail += PAGE_SIZE * 2;
576 * Initialize the wired TLB entry mapping the pcpu region for
577 * the BSP at 'pcpup'. Up until this point we were operating
578 * with the 'pcpup' for the BSP pointing to a virtual address
579 * in KSEG0 so there was no need for a TLB mapping.
581 mips_pcpu_tlb_init(PCPU_ADDR(0));
584 printf("pcpu is available at virtual address %p.\n", pcpup);
587 if (need_local_mappings)
588 pmap_alloc_lmem_map();
589 pmap_create_kernel_pagetable();
590 pmap_max_asid = VMNUM_PIDS;
596 * Initialize a vm_page's machine-dependent fields.
599 pmap_page_init(vm_page_t m)
602 TAILQ_INIT(&m->md.pv_list);
607 * Initialize the pmap module.
608 * Called by vm_init, to initialize any structures that the pmap
609 * system needs to map virtual memory.
616 /***************************************************
617 * Low level helper routines.....
618 ***************************************************/
622 pmap_call_on_active_cpus(pmap_t pmap, void (*fn)(void *), void *arg)
624 int cpuid, cpu, self;
625 cpuset_t active_cpus;
628 if (is_kernel_pmap(pmap)) {
629 smp_rendezvous(NULL, fn, NULL, arg);
632 /* Force ASID update on inactive CPUs */
634 if (!CPU_ISSET(cpu, &pmap->pm_active))
635 pmap->pm_asid[cpu].gen = 0;
637 cpuid = PCPU_GET(cpuid);
639 * XXX: barrier/locking for active?
641 * Take a snapshot of active here, any further changes are ignored.
642 * tlb update/invalidate should be harmless on inactive CPUs
644 active_cpus = pmap->pm_active;
645 self = CPU_ISSET(cpuid, &active_cpus);
646 CPU_CLR(cpuid, &active_cpus);
647 /* Optimize for the case where this cpu is the only active one */
648 if (CPU_EMPTY(&active_cpus)) {
653 CPU_SET(cpuid, &active_cpus);
654 smp_rendezvous_cpus(active_cpus, NULL, fn, NULL, arg);
661 pmap_call_on_active_cpus(pmap_t pmap, void (*fn)(void *), void *arg)
665 if (is_kernel_pmap(pmap)) {
669 cpuid = PCPU_GET(cpuid);
670 if (!CPU_ISSET(cpuid, &pmap->pm_active))
671 pmap->pm_asid[cpuid].gen = 0;
678 pmap_invalidate_all(pmap_t pmap)
681 pmap_call_on_active_cpus(pmap,
682 (void (*)(void *))tlb_invalidate_all_user, pmap);
685 struct pmap_invalidate_page_arg {
691 pmap_invalidate_page_action(void *arg)
693 struct pmap_invalidate_page_arg *p = arg;
695 tlb_invalidate_address(p->pmap, p->va);
699 pmap_invalidate_page(pmap_t pmap, vm_offset_t va)
701 struct pmap_invalidate_page_arg arg;
705 pmap_call_on_active_cpus(pmap, pmap_invalidate_page_action, &arg);
708 struct pmap_update_page_arg {
715 pmap_update_page_action(void *arg)
717 struct pmap_update_page_arg *p = arg;
719 tlb_update(p->pmap, p->va, p->pte);
723 pmap_update_page(pmap_t pmap, vm_offset_t va, pt_entry_t pte)
725 struct pmap_update_page_arg arg;
730 pmap_call_on_active_cpus(pmap, pmap_update_page_action, &arg);
734 * Routine: pmap_extract
736 * Extract the physical page address associated
737 * with the given map/virtual_address pair.
740 pmap_extract(pmap_t pmap, vm_offset_t va)
743 vm_offset_t retval = 0;
746 pte = pmap_pte(pmap, va);
748 retval = TLBLO_PTE_TO_PA(*pte) | (va & PAGE_MASK);
755 * Routine: pmap_extract_and_hold
757 * Atomically extract and hold the physical page
758 * with the given pmap and virtual address pair
759 * if that mapping permits the given protection.
762 pmap_extract_and_hold(pmap_t pmap, vm_offset_t va, vm_prot_t prot)
773 ptep = pmap_pte(pmap, va);
774 if ((ptep != NULL) && ((pte = *ptep) != 0) &&
775 pte_test(&pte, PTE_V) &&
776 (pte_test(&pte, PTE_D) || (prot & VM_PROT_WRITE) == 0)) {
777 if (vm_page_pa_tryrelock(pmap, TLBLO_PTE_TO_PA(pte), &pa))
780 m = PHYS_TO_VM_PAGE(TLBLO_PTE_TO_PA(pte));
788 /***************************************************
789 * Low level mapping routines.....
790 ***************************************************/
793 * add a wired page to the kva
796 pmap_kenter_attr(vm_offset_t va, vm_paddr_t pa, int attr)
799 pt_entry_t opte, npte;
802 printf("pmap_kenter: va: %p -> pa: %p\n", (void *)va, (void *)pa);
804 npte = TLBLO_PA_TO_PFN(pa) | PTE_D | PTE_V | PTE_G | PTE_W | attr;
806 pte = pmap_pte(kernel_pmap, va);
809 if (pte_test(&opte, PTE_V) && opte != npte)
810 pmap_update_page(kernel_pmap, va, npte);
814 pmap_kenter(vm_offset_t va, vm_paddr_t pa)
817 KASSERT(is_cacheable_mem(pa),
818 ("pmap_kenter: memory at 0x%lx is not cacheable", (u_long)pa));
820 pmap_kenter_attr(va, pa, PTE_C_CACHE);
824 * remove a page from the kernel pagetables
826 /* PMAP_INLINE */ void
827 pmap_kremove(vm_offset_t va)
832 * Write back all caches from the page being destroyed
834 mips_dcache_wbinv_range_index(va, PAGE_SIZE);
836 pte = pmap_pte(kernel_pmap, va);
838 pmap_invalidate_page(kernel_pmap, va);
842 * Used to map a range of physical addresses into kernel
843 * virtual address space.
845 * The value passed in '*virt' is a suggested virtual address for
846 * the mapping. Architectures which can support a direct-mapped
847 * physical to virtual region can return the appropriate address
848 * within that region, leaving '*virt' unchanged. Other
849 * architectures should map the pages starting at '*virt' and
850 * update '*virt' with the first usable address after the mapped
853 * Use XKPHYS for 64 bit, and KSEG0 where possible for 32 bit.
856 pmap_map(vm_offset_t *virt, vm_paddr_t start, vm_paddr_t end, int prot)
860 if (MIPS_DIRECT_MAPPABLE(end - 1))
861 return (MIPS_PHYS_TO_DIRECT(start));
864 while (start < end) {
865 pmap_kenter(va, start);
874 * Add a list of wired pages to the kva
875 * this routine is only used for temporary
876 * kernel mappings that do not need to have
877 * page modification or references recorded.
878 * Note that old mappings are simply written
879 * over. The page *must* be wired.
882 pmap_qenter(vm_offset_t va, vm_page_t *m, int count)
885 vm_offset_t origva = va;
887 for (i = 0; i < count; i++) {
888 pmap_flush_pvcache(m[i]);
889 pmap_kenter(va, VM_PAGE_TO_PHYS(m[i]));
893 mips_dcache_wbinv_range_index(origva, PAGE_SIZE*count);
897 * this routine jerks page mappings from the
898 * kernel -- it is meant only for temporary mappings.
901 pmap_qremove(vm_offset_t va, int count)
904 * No need to wb/inv caches here,
905 * pmap_kremove will do it for us
908 while (count-- > 0) {
914 /***************************************************
915 * Page table page management routines.....
916 ***************************************************/
920 * Simplify the reference counting of page table pages. Specifically, use
921 * the page table page's wired count rather than its hold count to contain
922 * the reference count.
926 * This routine unholds page table pages, and if the hold count
927 * drops to zero, then it decrements the wire count.
929 static PMAP_INLINE int
930 pmap_unwire_pte_hold(pmap_t pmap, vm_offset_t va, vm_page_t m)
933 if (m->wire_count == 0)
934 return (_pmap_unwire_pte_hold(pmap, va, m));
940 _pmap_unwire_pte_hold(pmap_t pmap, vm_offset_t va, vm_page_t m)
944 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
946 * unmap the page table page
949 if (m->pindex < NUPDE)
950 pde = pmap_pde(pmap, va);
952 pde = pmap_segmap(pmap, va);
954 pde = pmap_pde(pmap, va);
957 pmap->pm_stats.resident_count--;
960 if (m->pindex < NUPDE) {
965 * Recursively decrement next level pagetable refcount
967 pdp = (pd_entry_t *)*pmap_segmap(pmap, va);
968 pdpg = PHYS_TO_VM_PAGE(MIPS_DIRECT_TO_PHYS(pdp));
969 pmap_unwire_pte_hold(pmap, va, pdpg);
974 * If the page is finally unwired, simply free it.
976 vm_page_free_zero(m);
977 atomic_subtract_int(&cnt.v_wire_count, 1);
982 * After removing a page table entry, this routine is used to
983 * conditionally free the page, and manage the hold/wire counts.
986 pmap_unuse_pt(pmap_t pmap, vm_offset_t va, pd_entry_t pde)
990 if (va >= VM_MAXUSER_ADDRESS)
992 KASSERT(pde != 0, ("pmap_unuse_pt: pde != 0"));
993 mpte = PHYS_TO_VM_PAGE(MIPS_DIRECT_TO_PHYS(pde));
994 return (pmap_unwire_pte_hold(pmap, va, mpte));
998 pmap_pinit0(pmap_t pmap)
1002 PMAP_LOCK_INIT(pmap);
1003 pmap->pm_segtab = kernel_segmap;
1004 CPU_ZERO(&pmap->pm_active);
1005 for (i = 0; i < MAXCPU; i++) {
1006 pmap->pm_asid[i].asid = PMAP_ASID_RESERVED;
1007 pmap->pm_asid[i].gen = 0;
1009 PCPU_SET(curpmap, pmap);
1010 TAILQ_INIT(&pmap->pm_pvchunk);
1011 bzero(&pmap->pm_stats, sizeof pmap->pm_stats);
1015 pmap_grow_direct_page_cache()
1019 vm_pageout_grow_cache(3, 0, MIPS_XKPHYS_LARGEST_PHYS);
1021 vm_pageout_grow_cache(3, 0, MIPS_KSEG0_LARGEST_PHYS);
1026 pmap_alloc_direct_page(unsigned int index, int req)
1030 m = vm_page_alloc_freelist(VM_FREELIST_DIRECT, req | VM_ALLOC_WIRED |
1035 if ((m->flags & PG_ZERO) == 0)
1043 * Initialize a preallocated and zeroed pmap structure,
1044 * such as one in a vmspace structure.
1047 pmap_pinit(pmap_t pmap)
1053 PMAP_LOCK_INIT(pmap);
1056 * allocate the page directory page
1058 while ((ptdpg = pmap_alloc_direct_page(NUSERPGTBLS, VM_ALLOC_NORMAL)) == NULL)
1059 pmap_grow_direct_page_cache();
1061 ptdva = MIPS_PHYS_TO_DIRECT(VM_PAGE_TO_PHYS(ptdpg));
1062 pmap->pm_segtab = (pd_entry_t *)ptdva;
1063 CPU_ZERO(&pmap->pm_active);
1064 for (i = 0; i < MAXCPU; i++) {
1065 pmap->pm_asid[i].asid = PMAP_ASID_RESERVED;
1066 pmap->pm_asid[i].gen = 0;
1068 TAILQ_INIT(&pmap->pm_pvchunk);
1069 bzero(&pmap->pm_stats, sizeof pmap->pm_stats);
1075 * this routine is called if the page table page is not
1079 _pmap_allocpte(pmap_t pmap, unsigned ptepindex, int flags)
1084 KASSERT((flags & (M_NOWAIT | M_WAITOK)) == M_NOWAIT ||
1085 (flags & (M_NOWAIT | M_WAITOK)) == M_WAITOK,
1086 ("_pmap_allocpte: flags is neither M_NOWAIT nor M_WAITOK"));
1089 * Find or fabricate a new pagetable page
1091 if ((m = pmap_alloc_direct_page(ptepindex, VM_ALLOC_NORMAL)) == NULL) {
1092 if (flags & M_WAITOK) {
1094 vm_page_unlock_queues();
1095 pmap_grow_direct_page_cache();
1096 vm_page_lock_queues();
1101 * Indicate the need to retry. While waiting, the page
1102 * table page may have been allocated.
1108 * Map the pagetable page into the process address space, if it
1109 * isn't already there.
1111 pageva = MIPS_PHYS_TO_DIRECT(VM_PAGE_TO_PHYS(m));
1114 if (ptepindex >= NUPDE) {
1115 pmap->pm_segtab[ptepindex - NUPDE] = (pd_entry_t)pageva;
1117 pd_entry_t *pdep, *pde;
1118 int segindex = ptepindex >> (SEGSHIFT - PDRSHIFT);
1119 int pdeindex = ptepindex & (NPDEPG - 1);
1122 pdep = &pmap->pm_segtab[segindex];
1123 if (*pdep == NULL) {
1124 /* recurse for allocating page dir */
1125 if (_pmap_allocpte(pmap, NUPDE + segindex,
1127 /* alloc failed, release current */
1129 atomic_subtract_int(&cnt.v_wire_count, 1);
1130 vm_page_free_zero(m);
1134 pg = PHYS_TO_VM_PAGE(MIPS_DIRECT_TO_PHYS(*pdep));
1137 /* Next level entry */
1138 pde = (pd_entry_t *)*pdep;
1139 pde[pdeindex] = (pd_entry_t)pageva;
1142 pmap->pm_segtab[ptepindex] = (pd_entry_t)pageva;
1144 pmap->pm_stats.resident_count++;
1149 pmap_allocpte(pmap_t pmap, vm_offset_t va, int flags)
1155 KASSERT((flags & (M_NOWAIT | M_WAITOK)) == M_NOWAIT ||
1156 (flags & (M_NOWAIT | M_WAITOK)) == M_WAITOK,
1157 ("pmap_allocpte: flags is neither M_NOWAIT nor M_WAITOK"));
1160 * Calculate pagetable page index
1162 ptepindex = pmap_pde_pindex(va);
1165 * Get the page directory entry
1167 pde = pmap_pde(pmap, va);
1170 * If the page table page is mapped, we just increment the hold
1171 * count, and activate it.
1173 if (pde != NULL && *pde != NULL) {
1174 m = PHYS_TO_VM_PAGE(MIPS_DIRECT_TO_PHYS(*pde));
1178 * Here if the pte page isn't mapped, or if it has been
1181 m = _pmap_allocpte(pmap, ptepindex, flags);
1182 if (m == NULL && (flags & M_WAITOK))
1189 /***************************************************
1190 * Pmap allocation/deallocation routines.
1191 ***************************************************/
1194 * - Merged pmap_release and pmap_release_free_page. When pmap_release is
1195 * called only the page directory page(s) can be left in the pmap pte
1196 * object, since all page table pages will have been freed by
1197 * pmap_remove_pages and pmap_remove. In addition, there can only be one
1198 * reference to the pmap and the page directory is wired, so the page(s)
1199 * can never be busy. So all there is to do is clear the magic mappings
1200 * from the page directory and free the page(s).
1205 * Release any resources held by the given physical map.
1206 * Called when a pmap initialized by pmap_pinit is being released.
1207 * Should only be called if the map contains no valid mappings.
1210 pmap_release(pmap_t pmap)
1215 KASSERT(pmap->pm_stats.resident_count == 0,
1216 ("pmap_release: pmap resident count %ld != 0",
1217 pmap->pm_stats.resident_count));
1219 ptdva = (vm_offset_t)pmap->pm_segtab;
1220 ptdpg = PHYS_TO_VM_PAGE(MIPS_DIRECT_TO_PHYS(ptdva));
1222 ptdpg->wire_count--;
1223 atomic_subtract_int(&cnt.v_wire_count, 1);
1224 vm_page_free_zero(ptdpg);
1225 PMAP_LOCK_DESTROY(pmap);
1229 * grow the number of kernel page table entries, if needed
1232 pmap_growkernel(vm_offset_t addr)
1235 pd_entry_t *pde, *pdpe;
1239 mtx_assert(&kernel_map->system_mtx, MA_OWNED);
1240 addr = roundup2(addr, NBSEG);
1241 if (addr - 1 >= kernel_map->max_offset)
1242 addr = kernel_map->max_offset;
1243 while (kernel_vm_end < addr) {
1244 pdpe = pmap_segmap(kernel_pmap, kernel_vm_end);
1247 /* new intermediate page table entry */
1248 nkpg = pmap_alloc_direct_page(nkpt, VM_ALLOC_INTERRUPT);
1250 panic("pmap_growkernel: no memory to grow kernel");
1251 *pdpe = (pd_entry_t)MIPS_PHYS_TO_DIRECT(VM_PAGE_TO_PHYS(nkpg));
1252 continue; /* try again */
1255 pde = pmap_pdpe_to_pde(pdpe, kernel_vm_end);
1257 kernel_vm_end = (kernel_vm_end + NBPDR) & ~PDRMASK;
1258 if (kernel_vm_end - 1 >= kernel_map->max_offset) {
1259 kernel_vm_end = kernel_map->max_offset;
1266 * This index is bogus, but out of the way
1268 nkpg = pmap_alloc_direct_page(nkpt, VM_ALLOC_INTERRUPT);
1270 panic("pmap_growkernel: no memory to grow kernel");
1272 *pde = (pd_entry_t)MIPS_PHYS_TO_DIRECT(VM_PAGE_TO_PHYS(nkpg));
1275 * The R[4-7]?00 stores only one copy of the Global bit in
1276 * the translation lookaside buffer for each 2 page entry.
1277 * Thus invalid entrys must have the Global bit set so when
1278 * Entry LO and Entry HI G bits are anded together they will
1279 * produce a global bit to store in the tlb.
1281 pte = (pt_entry_t *)*pde;
1282 for (i = 0; i < NPTEPG; i++)
1285 kernel_vm_end = (kernel_vm_end + NBPDR) & ~PDRMASK;
1286 if (kernel_vm_end - 1 >= kernel_map->max_offset) {
1287 kernel_vm_end = kernel_map->max_offset;
1293 /***************************************************
1294 * page management routines.
1295 ***************************************************/
1297 CTASSERT(sizeof(struct pv_chunk) == PAGE_SIZE);
1299 CTASSERT(_NPCM == 3);
1300 CTASSERT(_NPCPV == 168);
1302 CTASSERT(_NPCM == 11);
1303 CTASSERT(_NPCPV == 336);
1306 static __inline struct pv_chunk *
1307 pv_to_chunk(pv_entry_t pv)
1310 return ((struct pv_chunk *)((uintptr_t)pv & ~(uintptr_t)PAGE_MASK));
1313 #define PV_PMAP(pv) (pv_to_chunk(pv)->pc_pmap)
1316 #define PC_FREE0_1 0xfffffffffffffffful
1317 #define PC_FREE2 0x000000fffffffffful
1319 #define PC_FREE0_9 0xfffffffful /* Free values for index 0 through 9 */
1320 #define PC_FREE10 0x0000fffful /* Free values for index 10 */
1323 static const u_long pc_freemask[_NPCM] = {
1325 PC_FREE0_1, PC_FREE0_1, PC_FREE2
1327 PC_FREE0_9, PC_FREE0_9, PC_FREE0_9,
1328 PC_FREE0_9, PC_FREE0_9, PC_FREE0_9,
1329 PC_FREE0_9, PC_FREE0_9, PC_FREE0_9,
1330 PC_FREE0_9, PC_FREE10
1334 static SYSCTL_NODE(_vm, OID_AUTO, pmap, CTLFLAG_RD, 0, "VM/pmap parameters");
1336 SYSCTL_INT(_vm_pmap, OID_AUTO, pv_entry_count, CTLFLAG_RD, &pv_entry_count, 0,
1337 "Current number of pv entries");
1340 static int pc_chunk_count, pc_chunk_allocs, pc_chunk_frees, pc_chunk_tryfail;
1342 SYSCTL_INT(_vm_pmap, OID_AUTO, pc_chunk_count, CTLFLAG_RD, &pc_chunk_count, 0,
1343 "Current number of pv entry chunks");
1344 SYSCTL_INT(_vm_pmap, OID_AUTO, pc_chunk_allocs, CTLFLAG_RD, &pc_chunk_allocs, 0,
1345 "Current number of pv entry chunks allocated");
1346 SYSCTL_INT(_vm_pmap, OID_AUTO, pc_chunk_frees, CTLFLAG_RD, &pc_chunk_frees, 0,
1347 "Current number of pv entry chunks frees");
1348 SYSCTL_INT(_vm_pmap, OID_AUTO, pc_chunk_tryfail, CTLFLAG_RD, &pc_chunk_tryfail, 0,
1349 "Number of times tried to get a chunk page but failed.");
1351 static long pv_entry_frees, pv_entry_allocs;
1352 static int pv_entry_spare;
1354 SYSCTL_LONG(_vm_pmap, OID_AUTO, pv_entry_frees, CTLFLAG_RD, &pv_entry_frees, 0,
1355 "Current number of pv entry frees");
1356 SYSCTL_LONG(_vm_pmap, OID_AUTO, pv_entry_allocs, CTLFLAG_RD, &pv_entry_allocs, 0,
1357 "Current number of pv entry allocs");
1358 SYSCTL_INT(_vm_pmap, OID_AUTO, pv_entry_spare, CTLFLAG_RD, &pv_entry_spare, 0,
1359 "Current number of spare pv entries");
1363 * We are in a serious low memory condition. Resort to
1364 * drastic measures to free some pages so we can allocate
1365 * another pv entry chunk.
1368 pmap_pv_reclaim(pmap_t locked_pmap)
1371 struct pv_chunk *pc;
1374 pt_entry_t *pte, oldpte;
1379 int bit, field, freed, idx;
1381 PMAP_LOCK_ASSERT(locked_pmap, MA_OWNED);
1384 TAILQ_INIT(&newtail);
1385 while ((pc = TAILQ_FIRST(&pv_chunks)) != NULL) {
1386 TAILQ_REMOVE(&pv_chunks, pc, pc_lru);
1387 if (pmap != pc->pc_pmap) {
1389 pmap_invalidate_all(pmap);
1390 if (pmap != locked_pmap)
1394 /* Avoid deadlock and lock recursion. */
1395 if (pmap > locked_pmap)
1397 else if (pmap != locked_pmap && !PMAP_TRYLOCK(pmap)) {
1399 TAILQ_INSERT_TAIL(&newtail, pc, pc_lru);
1405 * Destroy every non-wired, 4 KB page mapping in the chunk.
1408 for (field = 0; field < _NPCM; field++) {
1409 for (inuse = ~pc->pc_map[field] & pc_freemask[field];
1410 inuse != 0; inuse &= ~(1UL << bit)) {
1411 bit = ffsl(inuse) - 1;
1412 idx = field * sizeof(inuse) * NBBY + bit;
1413 pv = &pc->pc_pventry[idx];
1415 pde = pmap_pde(pmap, va);
1416 KASSERT(pde != NULL && *pde != 0,
1417 ("pmap_pv_reclaim: pde"));
1418 pte = pmap_pde_to_pte(pde, va);
1420 KASSERT(!pte_test(&oldpte, PTE_W),
1421 ("wired pte for unwired page"));
1422 if (is_kernel_pmap(pmap))
1426 pmap_invalidate_page(pmap, va);
1427 m = PHYS_TO_VM_PAGE(TLBLO_PTE_TO_PA(oldpte));
1428 if (pte_test(&oldpte, PTE_D))
1430 if (m->md.pv_flags & PV_TABLE_REF)
1431 vm_page_aflag_set(m, PGA_REFERENCED);
1432 TAILQ_REMOVE(&m->md.pv_list, pv, pv_list);
1433 if (TAILQ_EMPTY(&m->md.pv_list)) {
1434 vm_page_aflag_clear(m, PGA_WRITEABLE);
1435 m->md.pv_flags &= ~(PV_TABLE_REF |
1438 pc->pc_map[field] |= 1UL << bit;
1439 pmap_unuse_pt(pmap, va, *pde);
1444 TAILQ_INSERT_TAIL(&newtail, pc, pc_lru);
1447 /* Every freed mapping is for a 4 KB page. */
1448 pmap->pm_stats.resident_count -= freed;
1449 PV_STAT(pv_entry_frees += freed);
1450 PV_STAT(pv_entry_spare += freed);
1451 pv_entry_count -= freed;
1452 TAILQ_REMOVE(&pmap->pm_pvchunk, pc, pc_list);
1453 for (field = 0; field < _NPCM; field++)
1454 if (pc->pc_map[field] != pc_freemask[field]) {
1455 TAILQ_INSERT_HEAD(&pmap->pm_pvchunk, pc,
1457 TAILQ_INSERT_TAIL(&newtail, pc, pc_lru);
1460 * One freed pv entry in locked_pmap is
1463 if (pmap == locked_pmap)
1467 if (field == _NPCM) {
1468 PV_STAT(pv_entry_spare -= _NPCPV);
1469 PV_STAT(pc_chunk_count--);
1470 PV_STAT(pc_chunk_frees++);
1471 /* Entire chunk is free; return it. */
1472 m_pc = PHYS_TO_VM_PAGE(MIPS_DIRECT_TO_PHYS(
1478 TAILQ_CONCAT(&pv_chunks, &newtail, pc_lru);
1480 pmap_invalidate_all(pmap);
1481 if (pmap != locked_pmap)
1488 * free the pv_entry back to the free list
1491 free_pv_entry(pmap_t pmap, pv_entry_t pv)
1493 struct pv_chunk *pc;
1494 int bit, field, idx;
1496 mtx_assert(&vm_page_queue_mtx, MA_OWNED);
1497 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
1498 PV_STAT(pv_entry_frees++);
1499 PV_STAT(pv_entry_spare++);
1501 pc = pv_to_chunk(pv);
1502 idx = pv - &pc->pc_pventry[0];
1503 field = idx / (sizeof(u_long) * NBBY);
1504 bit = idx % (sizeof(u_long) * NBBY);
1505 pc->pc_map[field] |= 1ul << bit;
1506 for (idx = 0; idx < _NPCM; idx++)
1507 if (pc->pc_map[idx] != pc_freemask[idx]) {
1509 * 98% of the time, pc is already at the head of the
1510 * list. If it isn't already, move it to the head.
1512 if (__predict_false(TAILQ_FIRST(&pmap->pm_pvchunk) !=
1514 TAILQ_REMOVE(&pmap->pm_pvchunk, pc, pc_list);
1515 TAILQ_INSERT_HEAD(&pmap->pm_pvchunk, pc,
1520 TAILQ_REMOVE(&pmap->pm_pvchunk, pc, pc_list);
1525 free_pv_chunk(struct pv_chunk *pc)
1529 TAILQ_REMOVE(&pv_chunks, pc, pc_lru);
1530 PV_STAT(pv_entry_spare -= _NPCPV);
1531 PV_STAT(pc_chunk_count--);
1532 PV_STAT(pc_chunk_frees++);
1533 /* entire chunk is free, return it */
1534 m = PHYS_TO_VM_PAGE(MIPS_DIRECT_TO_PHYS((vm_offset_t)pc));
1535 vm_page_unwire(m, 0);
1540 * get a new pv_entry, allocating a block from the system
1544 get_pv_entry(pmap_t pmap, boolean_t try)
1546 struct pv_chunk *pc;
1549 int bit, field, idx;
1551 mtx_assert(&vm_page_queue_mtx, MA_OWNED);
1552 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
1553 PV_STAT(pv_entry_allocs++);
1556 pc = TAILQ_FIRST(&pmap->pm_pvchunk);
1558 for (field = 0; field < _NPCM; field++) {
1559 if (pc->pc_map[field]) {
1560 bit = ffsl(pc->pc_map[field]) - 1;
1564 if (field < _NPCM) {
1565 idx = field * sizeof(pc->pc_map[field]) * NBBY + bit;
1566 pv = &pc->pc_pventry[idx];
1567 pc->pc_map[field] &= ~(1ul << bit);
1568 /* If this was the last item, move it to tail */
1569 for (field = 0; field < _NPCM; field++)
1570 if (pc->pc_map[field] != 0) {
1571 PV_STAT(pv_entry_spare--);
1572 return (pv); /* not full, return */
1574 TAILQ_REMOVE(&pmap->pm_pvchunk, pc, pc_list);
1575 TAILQ_INSERT_TAIL(&pmap->pm_pvchunk, pc, pc_list);
1576 PV_STAT(pv_entry_spare--);
1580 /* No free items, allocate another chunk */
1581 m = vm_page_alloc_freelist(VM_FREELIST_DIRECT, VM_ALLOC_NORMAL |
1586 PV_STAT(pc_chunk_tryfail++);
1589 m = pmap_pv_reclaim(pmap);
1593 PV_STAT(pc_chunk_count++);
1594 PV_STAT(pc_chunk_allocs++);
1595 pc = (struct pv_chunk *)MIPS_PHYS_TO_DIRECT(VM_PAGE_TO_PHYS(m));
1597 pc->pc_map[0] = pc_freemask[0] & ~1ul; /* preallocated bit 0 */
1598 for (field = 1; field < _NPCM; field++)
1599 pc->pc_map[field] = pc_freemask[field];
1600 TAILQ_INSERT_TAIL(&pv_chunks, pc, pc_lru);
1601 pv = &pc->pc_pventry[0];
1602 TAILQ_INSERT_HEAD(&pmap->pm_pvchunk, pc, pc_list);
1603 PV_STAT(pv_entry_spare += _NPCPV - 1);
1608 * If it is the first entry on the list, it is actually
1609 * in the header and we must copy the following entry up
1610 * to the header. Otherwise we must search the list for
1611 * the entry. In either case we free the now unused entry.
1615 pmap_pvh_remove(struct md_page *pvh, pmap_t pmap, vm_offset_t va)
1619 mtx_assert(&vm_page_queue_mtx, MA_OWNED);
1620 TAILQ_FOREACH(pv, &pvh->pv_list, pv_list) {
1621 if (pmap == PV_PMAP(pv) && va == pv->pv_va) {
1622 TAILQ_REMOVE(&pvh->pv_list, pv, pv_list);
1630 pmap_pvh_free(struct md_page *pvh, pmap_t pmap, vm_offset_t va)
1634 pv = pmap_pvh_remove(pvh, pmap, va);
1635 KASSERT(pv != NULL, ("pmap_pvh_free: pv not found, pa %lx va %lx",
1636 (u_long)VM_PAGE_TO_PHYS(member2struct(vm_page, md, pvh)),
1638 free_pv_entry(pmap, pv);
1642 pmap_remove_entry(pmap_t pmap, vm_page_t m, vm_offset_t va)
1645 mtx_assert(&vm_page_queue_mtx, MA_OWNED);
1646 pmap_pvh_free(&m->md, pmap, va);
1647 if (TAILQ_EMPTY(&m->md.pv_list))
1648 vm_page_aflag_clear(m, PGA_WRITEABLE);
1652 * Conditionally create a pv entry.
1655 pmap_try_insert_pv_entry(pmap_t pmap, vm_page_t mpte, vm_offset_t va,
1660 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
1661 mtx_assert(&vm_page_queue_mtx, MA_OWNED);
1662 if ((pv = get_pv_entry(pmap, TRUE)) != NULL) {
1664 TAILQ_INSERT_TAIL(&m->md.pv_list, pv, pv_list);
1671 * pmap_remove_pte: do the things to unmap a page in a process
1674 pmap_remove_pte(struct pmap *pmap, pt_entry_t *ptq, vm_offset_t va,
1681 mtx_assert(&vm_page_queue_mtx, MA_OWNED);
1682 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
1685 if (is_kernel_pmap(pmap))
1690 if (pte_test(&oldpte, PTE_W))
1691 pmap->pm_stats.wired_count -= 1;
1693 pmap->pm_stats.resident_count -= 1;
1694 pa = TLBLO_PTE_TO_PA(oldpte);
1696 if (page_is_managed(pa)) {
1697 m = PHYS_TO_VM_PAGE(pa);
1698 if (pte_test(&oldpte, PTE_D)) {
1699 KASSERT(!pte_test(&oldpte, PTE_RO),
1700 ("%s: modified page not writable: va: %p, pte: %#jx",
1701 __func__, (void *)va, (uintmax_t)oldpte));
1704 if (m->md.pv_flags & PV_TABLE_REF)
1705 vm_page_aflag_set(m, PGA_REFERENCED);
1706 m->md.pv_flags &= ~(PV_TABLE_REF | PV_TABLE_MOD);
1708 pmap_remove_entry(pmap, m, va);
1710 return (pmap_unuse_pt(pmap, va, pde));
1714 * Remove a single page from a process address space
1717 pmap_remove_page(struct pmap *pmap, vm_offset_t va)
1722 mtx_assert(&vm_page_queue_mtx, MA_OWNED);
1723 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
1724 pde = pmap_pde(pmap, va);
1725 if (pde == NULL || *pde == 0)
1727 ptq = pmap_pde_to_pte(pde, va);
1730 * if there is no pte for this address, just skip it!!!
1732 if (!pte_test(ptq, PTE_V)) {
1737 * Write back all caches from the page being destroyed
1739 mips_dcache_wbinv_range_index(va, PAGE_SIZE);
1742 * get a local va for mappings for this pmap.
1744 (void)pmap_remove_pte(pmap, ptq, va, *pde);
1745 pmap_invalidate_page(pmap, va);
1751 * Remove the given range of addresses from the specified map.
1753 * It is assumed that the start and end are properly
1754 * rounded to the page size.
1757 pmap_remove(struct pmap *pmap, vm_offset_t sva, vm_offset_t eva)
1759 vm_offset_t va_next;
1760 pd_entry_t *pde, *pdpe;
1763 if (pmap->pm_stats.resident_count == 0)
1766 vm_page_lock_queues();
1770 * special handling of removing one page. a very common operation
1771 * and easy to short circuit some code.
1773 if ((sva + PAGE_SIZE) == eva) {
1774 pmap_remove_page(pmap, sva);
1777 for (; sva < eva; sva = va_next) {
1778 pdpe = pmap_segmap(pmap, sva);
1781 va_next = (sva + NBSEG) & ~SEGMASK;
1787 va_next = (sva + NBPDR) & ~PDRMASK;
1791 pde = pmap_pdpe_to_pde(pdpe, sva);
1796 for (pte = pmap_pde_to_pte(pde, sva); sva != va_next;
1797 pte++, sva += PAGE_SIZE) {
1798 pmap_remove_page(pmap, sva);
1802 vm_page_unlock_queues();
1807 * Routine: pmap_remove_all
1809 * Removes this physical page from
1810 * all physical maps in which it resides.
1811 * Reflects back modify bits to the pager.
1814 * Original versions of this routine were very
1815 * inefficient because they iteratively called
1816 * pmap_remove (slow...)
1820 pmap_remove_all(vm_page_t m)
1825 pt_entry_t *pte, tpte;
1827 KASSERT((m->oflags & VPO_UNMANAGED) == 0,
1828 ("pmap_remove_all: page %p is not managed", m));
1829 vm_page_lock_queues();
1831 if (m->md.pv_flags & PV_TABLE_REF)
1832 vm_page_aflag_set(m, PGA_REFERENCED);
1834 while ((pv = TAILQ_FIRST(&m->md.pv_list)) != NULL) {
1839 * If it's last mapping writeback all caches from
1840 * the page being destroyed
1842 if (TAILQ_NEXT(pv, pv_list) == NULL)
1843 mips_dcache_wbinv_range_index(pv->pv_va, PAGE_SIZE);
1845 pmap->pm_stats.resident_count--;
1847 pde = pmap_pde(pmap, pv->pv_va);
1848 KASSERT(pde != NULL && *pde != 0, ("pmap_remove_all: pde"));
1849 pte = pmap_pde_to_pte(pde, pv->pv_va);
1852 if (is_kernel_pmap(pmap))
1857 if (pte_test(&tpte, PTE_W))
1858 pmap->pm_stats.wired_count--;
1861 * Update the vm_page_t clean and reference bits.
1863 if (pte_test(&tpte, PTE_D)) {
1864 KASSERT(!pte_test(&tpte, PTE_RO),
1865 ("%s: modified page not writable: va: %p, pte: %#jx",
1866 __func__, (void *)pv->pv_va, (uintmax_t)tpte));
1869 pmap_invalidate_page(pmap, pv->pv_va);
1871 TAILQ_REMOVE(&m->md.pv_list, pv, pv_list);
1872 pmap_unuse_pt(pmap, pv->pv_va, *pde);
1873 free_pv_entry(pmap, pv);
1877 vm_page_aflag_clear(m, PGA_WRITEABLE);
1878 m->md.pv_flags &= ~(PV_TABLE_REF | PV_TABLE_MOD);
1879 vm_page_unlock_queues();
1883 * Set the physical protection on the
1884 * specified range of this map as requested.
1887 pmap_protect(pmap_t pmap, vm_offset_t sva, vm_offset_t eva, vm_prot_t prot)
1890 pd_entry_t *pde, *pdpe;
1891 vm_offset_t va_next;
1893 if ((prot & VM_PROT_READ) == VM_PROT_NONE) {
1894 pmap_remove(pmap, sva, eva);
1897 if (prot & VM_PROT_WRITE)
1900 vm_page_lock_queues();
1902 for (; sva < eva; sva = va_next) {
1907 pdpe = pmap_segmap(pmap, sva);
1910 va_next = (sva + NBSEG) & ~SEGMASK;
1916 va_next = (sva + NBPDR) & ~PDRMASK;
1920 pde = pmap_pdpe_to_pde(pdpe, sva);
1921 if (pde == NULL || *pde == NULL)
1926 for (pte = pmap_pde_to_pte(pde, sva); sva != va_next; pte++,
1929 /* Skip invalid PTEs */
1930 if (!pte_test(pte, PTE_V))
1933 pa = TLBLO_PTE_TO_PA(pbits);
1934 if (page_is_managed(pa) && pte_test(&pbits, PTE_D)) {
1935 m = PHYS_TO_VM_PAGE(pa);
1937 m->md.pv_flags &= ~PV_TABLE_MOD;
1939 pte_clear(&pbits, PTE_D);
1940 pte_set(&pbits, PTE_RO);
1942 if (pbits != *pte) {
1944 pmap_update_page(pmap, sva, pbits);
1948 vm_page_unlock_queues();
1953 * Insert the given physical page (p) at
1954 * the specified virtual address (v) in the
1955 * target physical map with the protection requested.
1957 * If specified, the page will be wired down, meaning
1958 * that the related pte can not be reclaimed.
1960 * NB: This is the only routine which MAY NOT lazy-evaluate
1961 * or lose information. That is, this routine must actually
1962 * insert this page into the given map NOW.
1965 pmap_enter(pmap_t pmap, vm_offset_t va, vm_prot_t access, vm_page_t m,
1966 vm_prot_t prot, boolean_t wired)
1970 pt_entry_t origpte, newpte;
1976 KASSERT(va <= VM_MAX_KERNEL_ADDRESS, ("pmap_enter: toobig"));
1977 KASSERT((m->oflags & (VPO_UNMANAGED | VPO_BUSY)) != 0,
1978 ("pmap_enter: page %p is not busy", m));
1982 vm_page_lock_queues();
1986 * In the case that a page table page is not resident, we are
1989 if (va < VM_MAXUSER_ADDRESS) {
1990 mpte = pmap_allocpte(pmap, va, M_WAITOK);
1992 pte = pmap_pte(pmap, va);
1995 * Page Directory table entry not valid, we need a new PT page
1998 panic("pmap_enter: invalid page directory, pdir=%p, va=%p",
1999 (void *)pmap->pm_segtab, (void *)va);
2001 pa = VM_PAGE_TO_PHYS(m);
2004 opa = TLBLO_PTE_TO_PA(origpte);
2007 * Mapping has not changed, must be protection or wiring change.
2009 if (pte_test(&origpte, PTE_V) && opa == pa) {
2011 * Wiring change, just update stats. We don't worry about
2012 * wiring PT pages as they remain resident as long as there
2013 * are valid mappings in them. Hence, if a user page is
2014 * wired, the PT page will be also.
2016 if (wired && !pte_test(&origpte, PTE_W))
2017 pmap->pm_stats.wired_count++;
2018 else if (!wired && pte_test(&origpte, PTE_W))
2019 pmap->pm_stats.wired_count--;
2021 KASSERT(!pte_test(&origpte, PTE_D | PTE_RO),
2022 ("%s: modified page not writable: va: %p, pte: %#jx",
2023 __func__, (void *)va, (uintmax_t)origpte));
2026 * Remove extra pte reference
2031 if (page_is_managed(opa)) {
2040 * Mapping has changed, invalidate old range and fall through to
2041 * handle validating new mapping.
2044 if (pte_test(&origpte, PTE_W))
2045 pmap->pm_stats.wired_count--;
2047 if (page_is_managed(opa)) {
2048 om = PHYS_TO_VM_PAGE(opa);
2049 pv = pmap_pvh_remove(&om->md, pmap, va);
2053 KASSERT(mpte->wire_count > 0,
2054 ("pmap_enter: missing reference to page table page,"
2055 " va: %p", (void *)va));
2058 pmap->pm_stats.resident_count++;
2061 * Enter on the PV list if part of our managed memory. Note that we
2062 * raise IPL while manipulating pv_table since pmap_enter can be
2063 * called at interrupt time.
2065 if ((m->oflags & VPO_UNMANAGED) == 0) {
2066 KASSERT(va < kmi.clean_sva || va >= kmi.clean_eva,
2067 ("pmap_enter: managed mapping within the clean submap"));
2069 pv = get_pv_entry(pmap, FALSE);
2071 TAILQ_INSERT_TAIL(&m->md.pv_list, pv, pv_list);
2072 } else if (pv != NULL)
2073 free_pv_entry(pmap, pv);
2076 * Increment counters
2079 pmap->pm_stats.wired_count++;
2082 if ((access & VM_PROT_WRITE) != 0)
2083 m->md.pv_flags |= PV_TABLE_MOD | PV_TABLE_REF;
2084 rw = init_pte_prot(va, m, prot);
2087 printf("pmap_enter: va: %p -> pa: %p\n", (void *)va, (void *)pa);
2090 * Now validate mapping with desired protection/wiring.
2092 newpte = TLBLO_PA_TO_PFN(pa) | rw | PTE_V;
2094 if (is_cacheable_mem(pa))
2095 newpte |= PTE_C_CACHE;
2097 newpte |= PTE_C_UNCACHED;
2102 if (is_kernel_pmap(pmap))
2106 * if the mapping or permission bits are different, we need to
2109 if (origpte != newpte) {
2110 if (pte_test(&origpte, PTE_V)) {
2112 if (page_is_managed(opa) && (opa != pa)) {
2113 if (om->md.pv_flags & PV_TABLE_REF)
2114 vm_page_aflag_set(om, PGA_REFERENCED);
2116 ~(PV_TABLE_REF | PV_TABLE_MOD);
2118 if (pte_test(&origpte, PTE_D)) {
2119 KASSERT(!pte_test(&origpte, PTE_RO),
2120 ("pmap_enter: modified page not writable:"
2121 " va: %p, pte: %#jx", (void *)va, (uintmax_t)origpte));
2122 if (page_is_managed(opa))
2125 if (page_is_managed(opa) &&
2126 TAILQ_EMPTY(&om->md.pv_list))
2127 vm_page_aflag_clear(om, PGA_WRITEABLE);
2132 pmap_update_page(pmap, va, newpte);
2135 * Sync I & D caches for executable pages. Do this only if the
2136 * target pmap belongs to the current process. Otherwise, an
2137 * unresolvable TLB miss may occur.
2139 if (!is_kernel_pmap(pmap) && (pmap == &curproc->p_vmspace->vm_pmap) &&
2140 (prot & VM_PROT_EXECUTE)) {
2141 mips_icache_sync_range(va, PAGE_SIZE);
2142 mips_dcache_wbinv_range(va, PAGE_SIZE);
2144 vm_page_unlock_queues();
2149 * this code makes some *MAJOR* assumptions:
2150 * 1. Current pmap & pmap exists.
2153 * 4. No page table pages.
2154 * but is *MUCH* faster than pmap_enter...
2158 pmap_enter_quick(pmap_t pmap, vm_offset_t va, vm_page_t m, vm_prot_t prot)
2161 vm_page_lock_queues();
2163 (void)pmap_enter_quick_locked(pmap, va, m, prot, NULL);
2164 vm_page_unlock_queues();
2169 pmap_enter_quick_locked(pmap_t pmap, vm_offset_t va, vm_page_t m,
2170 vm_prot_t prot, vm_page_t mpte)
2175 KASSERT(va < kmi.clean_sva || va >= kmi.clean_eva ||
2176 (m->oflags & VPO_UNMANAGED) != 0,
2177 ("pmap_enter_quick_locked: managed mapping within the clean submap"));
2178 mtx_assert(&vm_page_queue_mtx, MA_OWNED);
2179 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
2182 * In the case that a page table page is not resident, we are
2185 if (va < VM_MAXUSER_ADDRESS) {
2190 * Calculate pagetable page index
2192 ptepindex = pmap_pde_pindex(va);
2193 if (mpte && (mpte->pindex == ptepindex)) {
2197 * Get the page directory entry
2199 pde = pmap_pde(pmap, va);
2202 * If the page table page is mapped, we just
2203 * increment the hold count, and activate it.
2205 if (pde && *pde != 0) {
2206 mpte = PHYS_TO_VM_PAGE(
2207 MIPS_DIRECT_TO_PHYS(*pde));
2210 mpte = _pmap_allocpte(pmap, ptepindex,
2220 pte = pmap_pte(pmap, va);
2221 if (pte_test(pte, PTE_V)) {
2230 * Enter on the PV list if part of our managed memory.
2232 if ((m->oflags & VPO_UNMANAGED) == 0 &&
2233 !pmap_try_insert_pv_entry(pmap, mpte, va, m)) {
2235 pmap_unwire_pte_hold(pmap, va, mpte);
2242 * Increment counters
2244 pmap->pm_stats.resident_count++;
2246 pa = VM_PAGE_TO_PHYS(m);
2249 * Now validate mapping with RO protection
2251 *pte = TLBLO_PA_TO_PFN(pa) | PTE_V;
2253 if (is_cacheable_mem(pa))
2254 *pte |= PTE_C_CACHE;
2256 *pte |= PTE_C_UNCACHED;
2258 if (is_kernel_pmap(pmap))
2263 * Sync I & D caches. Do this only if the target pmap
2264 * belongs to the current process. Otherwise, an
2265 * unresolvable TLB miss may occur. */
2266 if (pmap == &curproc->p_vmspace->vm_pmap) {
2268 mips_icache_sync_range(va, PAGE_SIZE);
2269 mips_dcache_wbinv_range(va, PAGE_SIZE);
2276 * Make a temporary mapping for a physical address. This is only intended
2277 * to be used for panic dumps.
2279 * Use XKPHYS for 64 bit, and KSEG0 where possible for 32 bit.
2282 pmap_kenter_temporary(vm_paddr_t pa, int i)
2287 printf("%s: ERROR!!! More than one page of virtual address mapping not supported\n",
2290 if (MIPS_DIRECT_MAPPABLE(pa)) {
2291 va = MIPS_PHYS_TO_DIRECT(pa);
2293 #ifndef __mips_n64 /* XXX : to be converted to new style */
2296 struct local_sysmaps *sysm;
2297 pt_entry_t *pte, npte;
2299 /* If this is used other than for dumps, we may need to leave
2300 * interrupts disasbled on return. If crash dumps don't work when
2301 * we get to this point, we might want to consider this (leaving things
2302 * disabled as a starting point ;-)
2304 intr = intr_disable();
2305 cpu = PCPU_GET(cpuid);
2306 sysm = &sysmap_lmem[cpu];
2307 /* Since this is for the debugger, no locks or any other fun */
2308 npte = TLBLO_PA_TO_PFN(pa) | PTE_D | PTE_V | PTE_G | PTE_W | PTE_C_CACHE;
2309 pte = pmap_pte(kernel_pmap, sysm->base);
2312 pmap_update_page(kernel_pmap, sysm->base, npte);
2317 return ((void *)va);
2321 pmap_kenter_temporary_free(vm_paddr_t pa)
2323 #ifndef __mips_n64 /* XXX : to be converted to new style */
2326 struct local_sysmaps *sysm;
2329 if (MIPS_DIRECT_MAPPABLE(pa)) {
2330 /* nothing to do for this case */
2333 #ifndef __mips_n64 /* XXX : to be converted to new style */
2334 cpu = PCPU_GET(cpuid);
2335 sysm = &sysmap_lmem[cpu];
2339 intr = intr_disable();
2340 pte = pmap_pte(kernel_pmap, sysm->base);
2342 pmap_invalidate_page(kernel_pmap, sysm->base);
2350 * Moved the code to Machine Independent
2351 * vm_map_pmap_enter()
2355 * Maps a sequence of resident pages belonging to the same object.
2356 * The sequence begins with the given page m_start. This page is
2357 * mapped at the given virtual address start. Each subsequent page is
2358 * mapped at a virtual address that is offset from start by the same
2359 * amount as the page is offset from m_start within the object. The
2360 * last page in the sequence is the page with the largest offset from
2361 * m_start that can be mapped at a virtual address less than the given
2362 * virtual address end. Not every virtual page between start and end
2363 * is mapped; only those for which a resident page exists with the
2364 * corresponding offset from m_start are mapped.
2367 pmap_enter_object(pmap_t pmap, vm_offset_t start, vm_offset_t end,
2368 vm_page_t m_start, vm_prot_t prot)
2371 vm_pindex_t diff, psize;
2373 VM_OBJECT_LOCK_ASSERT(m_start->object, MA_OWNED);
2374 psize = atop(end - start);
2377 vm_page_lock_queues();
2379 while (m != NULL && (diff = m->pindex - m_start->pindex) < psize) {
2380 mpte = pmap_enter_quick_locked(pmap, start + ptoa(diff), m,
2382 m = TAILQ_NEXT(m, listq);
2384 vm_page_unlock_queues();
2389 * pmap_object_init_pt preloads the ptes for a given object
2390 * into the specified pmap. This eliminates the blast of soft
2391 * faults on process startup and immediately after an mmap.
2394 pmap_object_init_pt(pmap_t pmap, vm_offset_t addr,
2395 vm_object_t object, vm_pindex_t pindex, vm_size_t size)
2397 VM_OBJECT_LOCK_ASSERT(object, MA_OWNED);
2398 KASSERT(object->type == OBJT_DEVICE || object->type == OBJT_SG,
2399 ("pmap_object_init_pt: non-device object"));
2403 * Routine: pmap_change_wiring
2404 * Function: Change the wiring attribute for a map/virtual-address
2406 * In/out conditions:
2407 * The mapping must already exist in the pmap.
2410 pmap_change_wiring(pmap_t pmap, vm_offset_t va, boolean_t wired)
2415 pte = pmap_pte(pmap, va);
2417 if (wired && !pte_test(pte, PTE_W))
2418 pmap->pm_stats.wired_count++;
2419 else if (!wired && pte_test(pte, PTE_W))
2420 pmap->pm_stats.wired_count--;
2423 * Wiring is not a hardware characteristic so there is no need to
2427 pte_set(pte, PTE_W);
2429 pte_clear(pte, PTE_W);
2434 * Copy the range specified by src_addr/len
2435 * from the source map to the range dst_addr/len
2436 * in the destination map.
2438 * This routine is only advisory and need not do anything.
2442 pmap_copy(pmap_t dst_pmap, pmap_t src_pmap, vm_offset_t dst_addr,
2443 vm_size_t len, vm_offset_t src_addr)
2448 * pmap_zero_page zeros the specified hardware page by mapping
2449 * the page into KVM and using bzero to clear its contents.
2451 * Use XKPHYS for 64 bit, and KSEG0 where possible for 32 bit.
2454 pmap_zero_page(vm_page_t m)
2457 vm_paddr_t phys = VM_PAGE_TO_PHYS(m);
2459 if (MIPS_DIRECT_MAPPABLE(phys)) {
2460 va = MIPS_PHYS_TO_DIRECT(phys);
2461 bzero((caddr_t)va, PAGE_SIZE);
2462 mips_dcache_wbinv_range(va, PAGE_SIZE);
2464 va = pmap_lmem_map1(phys);
2465 bzero((caddr_t)va, PAGE_SIZE);
2466 mips_dcache_wbinv_range(va, PAGE_SIZE);
2472 * pmap_zero_page_area zeros the specified hardware page by mapping
2473 * the page into KVM and using bzero to clear its contents.
2475 * off and size may not cover an area beyond a single hardware page.
2478 pmap_zero_page_area(vm_page_t m, int off, int size)
2481 vm_paddr_t phys = VM_PAGE_TO_PHYS(m);
2483 if (MIPS_DIRECT_MAPPABLE(phys)) {
2484 va = MIPS_PHYS_TO_DIRECT(phys);
2485 bzero((char *)(caddr_t)va + off, size);
2486 mips_dcache_wbinv_range(va + off, size);
2488 va = pmap_lmem_map1(phys);
2489 bzero((char *)va + off, size);
2490 mips_dcache_wbinv_range(va + off, size);
2496 pmap_zero_page_idle(vm_page_t m)
2499 vm_paddr_t phys = VM_PAGE_TO_PHYS(m);
2501 if (MIPS_DIRECT_MAPPABLE(phys)) {
2502 va = MIPS_PHYS_TO_DIRECT(phys);
2503 bzero((caddr_t)va, PAGE_SIZE);
2504 mips_dcache_wbinv_range(va, PAGE_SIZE);
2506 va = pmap_lmem_map1(phys);
2507 bzero((caddr_t)va, PAGE_SIZE);
2508 mips_dcache_wbinv_range(va, PAGE_SIZE);
2514 * pmap_copy_page copies the specified (machine independent)
2515 * page by mapping the page into virtual memory and using
2516 * bcopy to copy the page, one machine dependent page at a
2519 * Use XKPHYS for 64 bit, and KSEG0 where possible for 32 bit.
2522 pmap_copy_page(vm_page_t src, vm_page_t dst)
2524 vm_offset_t va_src, va_dst;
2525 vm_paddr_t phys_src = VM_PAGE_TO_PHYS(src);
2526 vm_paddr_t phys_dst = VM_PAGE_TO_PHYS(dst);
2528 if (MIPS_DIRECT_MAPPABLE(phys_src) && MIPS_DIRECT_MAPPABLE(phys_dst)) {
2529 /* easy case, all can be accessed via KSEG0 */
2531 * Flush all caches for VA that are mapped to this page
2532 * to make sure that data in SDRAM is up to date
2534 pmap_flush_pvcache(src);
2535 mips_dcache_wbinv_range_index(
2536 MIPS_PHYS_TO_DIRECT(phys_dst), PAGE_SIZE);
2537 va_src = MIPS_PHYS_TO_DIRECT(phys_src);
2538 va_dst = MIPS_PHYS_TO_DIRECT(phys_dst);
2539 bcopy((caddr_t)va_src, (caddr_t)va_dst, PAGE_SIZE);
2540 mips_dcache_wbinv_range(va_dst, PAGE_SIZE);
2542 va_src = pmap_lmem_map2(phys_src, phys_dst);
2543 va_dst = va_src + PAGE_SIZE;
2544 bcopy((void *)va_src, (void *)va_dst, PAGE_SIZE);
2545 mips_dcache_wbinv_range(va_dst, PAGE_SIZE);
2551 * Returns true if the pmap's pv is one of the first
2552 * 16 pvs linked to from this page. This count may
2553 * be changed upwards or downwards in the future; it
2554 * is only necessary that true be returned for a small
2555 * subset of pmaps for proper page aging.
2558 pmap_page_exists_quick(pmap_t pmap, vm_page_t m)
2564 KASSERT((m->oflags & VPO_UNMANAGED) == 0,
2565 ("pmap_page_exists_quick: page %p is not managed", m));
2567 vm_page_lock_queues();
2568 TAILQ_FOREACH(pv, &m->md.pv_list, pv_list) {
2569 if (PV_PMAP(pv) == pmap) {
2577 vm_page_unlock_queues();
2582 * Remove all pages from specified address space
2583 * this aids process exit speeds. Also, this code
2584 * is special cased for current process only, but
2585 * can have the more generic (and slightly slower)
2586 * mode enabled. This is much faster than pmap_remove
2587 * in the case of running down an entire address space.
2590 pmap_remove_pages(pmap_t pmap)
2593 pt_entry_t *pte, tpte;
2596 struct pv_chunk *pc, *npc;
2597 u_long inuse, bitmask;
2598 int allfree, bit, field, idx;
2600 if (pmap != vmspace_pmap(curthread->td_proc->p_vmspace)) {
2601 printf("warning: pmap_remove_pages called with non-current pmap\n");
2604 vm_page_lock_queues();
2606 TAILQ_FOREACH_SAFE(pc, &pmap->pm_pvchunk, pc_list, npc) {
2608 for (field = 0; field < _NPCM; field++) {
2609 inuse = ~pc->pc_map[field] & pc_freemask[field];
2610 while (inuse != 0) {
2611 bit = ffsl(inuse) - 1;
2612 bitmask = 1UL << bit;
2613 idx = field * sizeof(inuse) * NBBY + bit;
2614 pv = &pc->pc_pventry[idx];
2617 pde = pmap_pde(pmap, pv->pv_va);
2618 KASSERT(pde != NULL && *pde != 0,
2619 ("pmap_remove_pages: pde"));
2620 pte = pmap_pde_to_pte(pde, pv->pv_va);
2621 if (!pte_test(pte, PTE_V))
2622 panic("pmap_remove_pages: bad pte");
2626 * We cannot remove wired pages from a process' mapping at this time
2628 if (pte_test(&tpte, PTE_W)) {
2632 *pte = is_kernel_pmap(pmap) ? PTE_G : 0;
2634 m = PHYS_TO_VM_PAGE(TLBLO_PTE_TO_PA(tpte));
2636 ("pmap_remove_pages: bad tpte %#jx",
2640 * Update the vm_page_t clean and reference bits.
2642 if (pte_test(&tpte, PTE_D))
2646 PV_STAT(pv_entry_frees++);
2647 PV_STAT(pv_entry_spare++);
2649 pc->pc_map[field] |= bitmask;
2650 pmap->pm_stats.resident_count--;
2651 TAILQ_REMOVE(&m->md.pv_list, pv, pv_list);
2652 if (TAILQ_EMPTY(&m->md.pv_list))
2653 vm_page_aflag_clear(m, PGA_WRITEABLE);
2654 pmap_unuse_pt(pmap, pv->pv_va, *pde);
2658 TAILQ_REMOVE(&pmap->pm_pvchunk, pc, pc_list);
2662 pmap_invalidate_all(pmap);
2664 vm_page_unlock_queues();
2668 * pmap_testbit tests bits in pte's
2669 * note that the testbit/changebit routines are inline,
2670 * and a lot of things compile-time evaluate.
2673 pmap_testbit(vm_page_t m, int bit)
2678 boolean_t rv = FALSE;
2680 if (m->oflags & VPO_UNMANAGED)
2683 mtx_assert(&vm_page_queue_mtx, MA_OWNED);
2684 TAILQ_FOREACH(pv, &m->md.pv_list, pv_list) {
2687 pte = pmap_pte(pmap, pv->pv_va);
2688 rv = pte_test(pte, bit);
2697 * this routine is used to clear dirty bits in ptes
2699 static __inline void
2700 pmap_changebit(vm_page_t m, int bit, boolean_t setem)
2706 if (m->oflags & VPO_UNMANAGED)
2709 mtx_assert(&vm_page_queue_mtx, MA_OWNED);
2711 * Loop over all current mappings setting/clearing as appropos If
2712 * setting RO do we need to clear the VAC?
2714 TAILQ_FOREACH(pv, &m->md.pv_list, pv_list) {
2717 pte = pmap_pte(pmap, pv->pv_va);
2720 pmap_update_page(pmap, pv->pv_va, *pte);
2722 pt_entry_t pbits = *pte;
2728 *pte = (pbits & ~PTE_D) | PTE_RO;
2730 *pte = pbits & ~bit;
2732 pmap_update_page(pmap, pv->pv_va, *pte);
2737 if (!setem && bit == PTE_D)
2738 vm_page_aflag_clear(m, PGA_WRITEABLE);
2742 * pmap_page_wired_mappings:
2744 * Return the number of managed mappings to the given physical page
2748 pmap_page_wired_mappings(vm_page_t m)
2756 if ((m->oflags & VPO_UNMANAGED) != 0)
2758 vm_page_lock_queues();
2759 TAILQ_FOREACH(pv, &m->md.pv_list, pv_list) {
2762 pte = pmap_pte(pmap, pv->pv_va);
2763 if (pte_test(pte, PTE_W))
2767 vm_page_unlock_queues();
2772 * Clear the write and modified bits in each of the given page's mappings.
2775 pmap_remove_write(vm_page_t m)
2778 pt_entry_t pbits, *pte;
2781 KASSERT((m->oflags & VPO_UNMANAGED) == 0,
2782 ("pmap_remove_write: page %p is not managed", m));
2785 * If the page is not VPO_BUSY, then PGA_WRITEABLE cannot be set by
2786 * another thread while the object is locked. Thus, if PGA_WRITEABLE
2787 * is clear, no page table entries need updating.
2789 VM_OBJECT_LOCK_ASSERT(m->object, MA_OWNED);
2790 if ((m->oflags & VPO_BUSY) == 0 &&
2791 (m->aflags & PGA_WRITEABLE) == 0)
2793 vm_page_lock_queues();
2794 TAILQ_FOREACH(pv, &m->md.pv_list, pv_list) {
2797 pte = pmap_pte(pmap, pv->pv_va);
2798 KASSERT(pte != NULL && pte_test(pte, PTE_V),
2799 ("page on pv_list has no pte"));
2801 if (pte_test(&pbits, PTE_D)) {
2802 pte_clear(&pbits, PTE_D);
2804 m->md.pv_flags &= ~PV_TABLE_MOD;
2806 pte_set(&pbits, PTE_RO);
2807 if (pbits != *pte) {
2809 pmap_update_page(pmap, pv->pv_va, pbits);
2813 vm_page_aflag_clear(m, PGA_WRITEABLE);
2814 vm_page_unlock_queues();
2818 * pmap_ts_referenced:
2820 * Return the count of reference bits for a page, clearing all of them.
2823 pmap_ts_referenced(vm_page_t m)
2826 KASSERT((m->oflags & VPO_UNMANAGED) == 0,
2827 ("pmap_ts_referenced: page %p is not managed", m));
2828 if (m->md.pv_flags & PV_TABLE_REF) {
2829 vm_page_lock_queues();
2830 m->md.pv_flags &= ~PV_TABLE_REF;
2831 vm_page_unlock_queues();
2840 * Return whether or not the specified physical page was modified
2841 * in any physical maps.
2844 pmap_is_modified(vm_page_t m)
2848 KASSERT((m->oflags & VPO_UNMANAGED) == 0,
2849 ("pmap_is_modified: page %p is not managed", m));
2852 * If the page is not VPO_BUSY, then PGA_WRITEABLE cannot be
2853 * concurrently set while the object is locked. Thus, if PGA_WRITEABLE
2854 * is clear, no PTEs can have PTE_D set.
2856 VM_OBJECT_LOCK_ASSERT(m->object, MA_OWNED);
2857 if ((m->oflags & VPO_BUSY) == 0 &&
2858 (m->aflags & PGA_WRITEABLE) == 0)
2860 vm_page_lock_queues();
2861 if (m->md.pv_flags & PV_TABLE_MOD)
2864 rv = pmap_testbit(m, PTE_D);
2865 vm_page_unlock_queues();
2872 * pmap_is_prefaultable:
2874 * Return whether or not the specified virtual address is elgible
2878 pmap_is_prefaultable(pmap_t pmap, vm_offset_t addr)
2886 pde = pmap_pde(pmap, addr);
2887 if (pde != NULL && *pde != 0) {
2888 pte = pmap_pde_to_pte(pde, addr);
2896 * Clear the modify bits on the specified physical page.
2899 pmap_clear_modify(vm_page_t m)
2902 KASSERT((m->oflags & VPO_UNMANAGED) == 0,
2903 ("pmap_clear_modify: page %p is not managed", m));
2904 VM_OBJECT_LOCK_ASSERT(m->object, MA_OWNED);
2905 KASSERT((m->oflags & VPO_BUSY) == 0,
2906 ("pmap_clear_modify: page %p is busy", m));
2909 * If the page is not PGA_WRITEABLE, then no PTEs can have PTE_D set.
2910 * If the object containing the page is locked and the page is not
2911 * VPO_BUSY, then PGA_WRITEABLE cannot be concurrently set.
2913 if ((m->aflags & PGA_WRITEABLE) == 0)
2915 vm_page_lock_queues();
2916 if (m->md.pv_flags & PV_TABLE_MOD) {
2917 pmap_changebit(m, PTE_D, FALSE);
2918 m->md.pv_flags &= ~PV_TABLE_MOD;
2920 vm_page_unlock_queues();
2924 * pmap_is_referenced:
2926 * Return whether or not the specified physical page was referenced
2927 * in any physical maps.
2930 pmap_is_referenced(vm_page_t m)
2933 KASSERT((m->oflags & VPO_UNMANAGED) == 0,
2934 ("pmap_is_referenced: page %p is not managed", m));
2935 return ((m->md.pv_flags & PV_TABLE_REF) != 0);
2939 * pmap_clear_reference:
2941 * Clear the reference bit on the specified physical page.
2944 pmap_clear_reference(vm_page_t m)
2947 KASSERT((m->oflags & VPO_UNMANAGED) == 0,
2948 ("pmap_clear_reference: page %p is not managed", m));
2949 vm_page_lock_queues();
2950 if (m->md.pv_flags & PV_TABLE_REF) {
2951 m->md.pv_flags &= ~PV_TABLE_REF;
2953 vm_page_unlock_queues();
2957 * Miscellaneous support routines follow
2961 * Map a set of physical memory pages into the kernel virtual
2962 * address space. Return a pointer to where it is mapped. This
2963 * routine is intended to be used for mapping device memory,
2968 * Map a set of physical memory pages into the kernel virtual
2969 * address space. Return a pointer to where it is mapped. This
2970 * routine is intended to be used for mapping device memory,
2973 * Use XKPHYS uncached for 64 bit, and KSEG1 where possible for 32 bit.
2976 pmap_mapdev(vm_paddr_t pa, vm_size_t size)
2978 vm_offset_t va, tmpva, offset;
2981 * KSEG1 maps only first 512M of phys address space. For
2982 * pa > 0x20000000 we should make proper mapping * using pmap_kenter.
2984 if (MIPS_DIRECT_MAPPABLE(pa + size - 1))
2985 return ((void *)MIPS_PHYS_TO_DIRECT_UNCACHED(pa));
2987 offset = pa & PAGE_MASK;
2988 size = roundup(size + offset, PAGE_SIZE);
2990 va = kmem_alloc_nofault(kernel_map, size);
2992 panic("pmap_mapdev: Couldn't alloc kernel virtual memory");
2993 pa = trunc_page(pa);
2994 for (tmpva = va; size > 0;) {
2995 pmap_kenter_attr(tmpva, pa, PTE_C_UNCACHED);
3002 return ((void *)(va + offset));
3006 pmap_unmapdev(vm_offset_t va, vm_size_t size)
3009 vm_offset_t base, offset, tmpva;
3011 /* If the address is within KSEG1 then there is nothing to do */
3012 if (va >= MIPS_KSEG1_START && va <= MIPS_KSEG1_END)
3015 base = trunc_page(va);
3016 offset = va & PAGE_MASK;
3017 size = roundup(size + offset, PAGE_SIZE);
3018 for (tmpva = base; tmpva < base + size; tmpva += PAGE_SIZE)
3019 pmap_kremove(tmpva);
3020 kmem_free(kernel_map, base, size);
3025 * perform the pmap work for mincore
3028 pmap_mincore(pmap_t pmap, vm_offset_t addr, vm_paddr_t *locked_pa)
3030 pt_entry_t *ptep, pte;
3038 ptep = pmap_pte(pmap, addr);
3039 pte = (ptep != NULL) ? *ptep : 0;
3040 if (!pte_test(&pte, PTE_V)) {
3044 val = MINCORE_INCORE;
3045 if (pte_test(&pte, PTE_D))
3046 val |= MINCORE_MODIFIED | MINCORE_MODIFIED_OTHER;
3047 pa = TLBLO_PTE_TO_PA(pte);
3048 managed = page_is_managed(pa);
3051 * This may falsely report the given address as
3052 * MINCORE_REFERENCED. Unfortunately, due to the lack of
3053 * per-PTE reference information, it is impossible to
3054 * determine if the address is MINCORE_REFERENCED.
3056 m = PHYS_TO_VM_PAGE(pa);
3057 if ((m->aflags & PGA_REFERENCED) != 0)
3058 val |= MINCORE_REFERENCED | MINCORE_REFERENCED_OTHER;
3060 if ((val & (MINCORE_MODIFIED_OTHER | MINCORE_REFERENCED_OTHER)) !=
3061 (MINCORE_MODIFIED_OTHER | MINCORE_REFERENCED_OTHER) && managed) {
3062 /* Ensure that "PHYS_TO_VM_PAGE(pa)->object" doesn't change. */
3063 if (vm_page_pa_tryrelock(pmap, pa, locked_pa))
3067 PA_UNLOCK_COND(*locked_pa);
3073 pmap_activate(struct thread *td)
3075 pmap_t pmap, oldpmap;
3076 struct proc *p = td->td_proc;
3081 pmap = vmspace_pmap(p->p_vmspace);
3082 oldpmap = PCPU_GET(curpmap);
3083 cpuid = PCPU_GET(cpuid);
3086 CPU_CLR_ATOMIC(cpuid, &oldpmap->pm_active);
3087 CPU_SET_ATOMIC(cpuid, &pmap->pm_active);
3088 pmap_asid_alloc(pmap);
3089 if (td == curthread) {
3090 PCPU_SET(segbase, pmap->pm_segtab);
3091 mips_wr_entryhi(pmap->pm_asid[cpuid].asid);
3094 PCPU_SET(curpmap, pmap);
3099 pmap_sync_icache(pmap_t pm, vm_offset_t va, vm_size_t sz)
3104 * Increase the starting virtual address of the given mapping if a
3105 * different alignment might result in more superpage mappings.
3108 pmap_align_superpage(vm_object_t object, vm_ooffset_t offset,
3109 vm_offset_t *addr, vm_size_t size)
3111 vm_offset_t superpage_offset;
3115 if (object != NULL && (object->flags & OBJ_COLORED) != 0)
3116 offset += ptoa(object->pg_color);
3117 superpage_offset = offset & SEGMASK;
3118 if (size - ((NBSEG - superpage_offset) & SEGMASK) < NBSEG ||
3119 (*addr & SEGMASK) == superpage_offset)
3121 if ((*addr & SEGMASK) < superpage_offset)
3122 *addr = (*addr & ~SEGMASK) + superpage_offset;
3124 *addr = ((*addr + SEGMASK) & ~SEGMASK) + superpage_offset;
3128 * Increase the starting virtual address of the given mapping so
3129 * that it is aligned to not be the second page in a TLB entry.
3130 * This routine assumes that the length is appropriately-sized so
3131 * that the allocation does not share a TLB entry at all if required.
3134 pmap_align_tlb(vm_offset_t *addr)
3136 if ((*addr & PAGE_SIZE) == 0)
3143 DB_SHOW_COMMAND(ptable, ddb_pid_dump)
3146 struct thread *td = NULL;
3153 td = db_lookup_thread(addr, TRUE);
3155 db_printf("Invalid pid or tid");
3159 if (p->p_vmspace == NULL) {
3160 db_printf("No vmspace for process");
3163 pmap = vmspace_pmap(p->p_vmspace);
3167 db_printf("pmap:%p segtab:%p asid:%x generation:%x\n",
3168 pmap, pmap->pm_segtab, pmap->pm_asid[0].asid,
3169 pmap->pm_asid[0].gen);
3170 for (i = 0; i < NPDEPG; i++) {
3175 pdpe = (pd_entry_t *)pmap->pm_segtab[i];
3178 db_printf("[%4d] %p\n", i, pdpe);
3180 for (j = 0; j < NPDEPG; j++) {
3181 pde = (pt_entry_t *)pdpe[j];
3184 db_printf("\t[%4d] %p\n", j, pde);
3188 pde = (pt_entry_t *)pdpe;
3190 for (k = 0; k < NPTEPG; k++) {
3192 if (pte == 0 || !pte_test(&pte, PTE_V))
3194 pa = TLBLO_PTE_TO_PA(pte);
3195 va = ((u_long)i << SEGSHIFT) | (j << PDRSHIFT) | (k << PAGE_SHIFT);
3196 db_printf("\t\t[%04d] va: %p pte: %8jx pa:%jx\n",
3197 k, (void *)va, (uintmax_t)pte, (uintmax_t)pa);
3206 static void pads(pmap_t pm);
3207 void pmap_pvdump(vm_offset_t pa);
3209 /* print address space of pmap*/
3216 if (pm == kernel_pmap)
3218 for (i = 0; i < NPTEPG; i++)
3219 if (pm->pm_segtab[i])
3220 for (j = 0; j < NPTEPG; j++) {
3221 va = (i << SEGSHIFT) + (j << PAGE_SHIFT);
3222 if (pm == kernel_pmap && va < KERNBASE)
3224 if (pm != kernel_pmap &&
3225 va >= VM_MAXUSER_ADDRESS)
3227 ptep = pmap_pte(pm, va);
3228 if (pte_test(ptep, PTE_V))
3229 printf("%x:%x ", va, *(int *)ptep);
3235 pmap_pvdump(vm_offset_t pa)
3237 register pv_entry_t pv;
3240 printf("pa %x", pa);
3241 m = PHYS_TO_VM_PAGE(pa);
3242 for (pv = TAILQ_FIRST(&m->md.pv_list); pv;
3243 pv = TAILQ_NEXT(pv, pv_list)) {
3244 printf(" -> pmap %p, va %x", (void *)pv->pv_pmap, pv->pv_va);
3255 * Allocate TLB address space tag (called ASID or TLBPID) and return it.
3256 * It takes almost as much or more time to search the TLB for a
3257 * specific ASID and flush those entries as it does to flush the entire TLB.
3258 * Therefore, when we allocate a new ASID, we just take the next number. When
3259 * we run out of numbers, we flush the TLB, increment the generation count
3260 * and start over. ASID zero is reserved for kernel use.
3263 pmap_asid_alloc(pmap)
3266 if (pmap->pm_asid[PCPU_GET(cpuid)].asid != PMAP_ASID_RESERVED &&
3267 pmap->pm_asid[PCPU_GET(cpuid)].gen == PCPU_GET(asid_generation));
3269 if (PCPU_GET(next_asid) == pmap_max_asid) {
3270 tlb_invalidate_all_user(NULL);
3271 PCPU_SET(asid_generation,
3272 (PCPU_GET(asid_generation) + 1) & ASIDGEN_MASK);
3273 if (PCPU_GET(asid_generation) == 0) {
3274 PCPU_SET(asid_generation, 1);
3276 PCPU_SET(next_asid, 1); /* 0 means invalid */
3278 pmap->pm_asid[PCPU_GET(cpuid)].asid = PCPU_GET(next_asid);
3279 pmap->pm_asid[PCPU_GET(cpuid)].gen = PCPU_GET(asid_generation);
3280 PCPU_SET(next_asid, PCPU_GET(next_asid) + 1);
3285 page_is_managed(vm_paddr_t pa)
3287 vm_offset_t pgnum = atop(pa);
3289 if (pgnum >= first_page) {
3292 m = PHYS_TO_VM_PAGE(pa);
3295 if ((m->oflags & VPO_UNMANAGED) == 0)
3302 init_pte_prot(vm_offset_t va, vm_page_t m, vm_prot_t prot)
3306 if (!(prot & VM_PROT_WRITE))
3307 rw = PTE_V | PTE_RO;
3308 else if ((m->oflags & VPO_UNMANAGED) == 0) {
3309 if ((m->md.pv_flags & PV_TABLE_MOD) != 0)
3313 vm_page_aflag_set(m, PGA_WRITEABLE);
3315 /* Needn't emulate a modified bit for unmanaged pages. */
3321 * pmap_emulate_modified : do dirty bit emulation
3323 * On SMP, update just the local TLB, other CPUs will update their
3324 * TLBs from PTE lazily, if they get the exception.
3325 * Returns 0 in case of sucess, 1 if the page is read only and we
3329 pmap_emulate_modified(pmap_t pmap, vm_offset_t va)
3336 pte = pmap_pte(pmap, va);
3338 panic("pmap_emulate_modified: can't find PTE");
3340 /* It is possible that some other CPU changed m-bit */
3341 if (!pte_test(pte, PTE_V) || pte_test(pte, PTE_D)) {
3342 tlb_update(pmap, va, *pte);
3347 if (!pte_test(pte, PTE_V) || pte_test(pte, PTE_D))
3348 panic("pmap_emulate_modified: invalid pte");
3350 if (pte_test(pte, PTE_RO)) {
3351 /* write to read only page in the kernel */
3355 pte_set(pte, PTE_D);
3356 tlb_update(pmap, va, *pte);
3357 pa = TLBLO_PTE_TO_PA(*pte);
3358 if (!page_is_managed(pa))
3359 panic("pmap_emulate_modified: unmanaged page");
3360 m = PHYS_TO_VM_PAGE(pa);
3361 m->md.pv_flags |= (PV_TABLE_REF | PV_TABLE_MOD);
3367 * Routine: pmap_kextract
3369 * Extract the physical page address associated
3373 pmap_kextract(vm_offset_t va)
3378 * First, the direct-mapped regions.
3380 #if defined(__mips_n64)
3381 if (va >= MIPS_XKPHYS_START && va < MIPS_XKPHYS_END)
3382 return (MIPS_XKPHYS_TO_PHYS(va));
3384 if (va >= MIPS_KSEG0_START && va < MIPS_KSEG0_END)
3385 return (MIPS_KSEG0_TO_PHYS(va));
3387 if (va >= MIPS_KSEG1_START && va < MIPS_KSEG1_END)
3388 return (MIPS_KSEG1_TO_PHYS(va));
3391 * User virtual addresses.
3393 if (va < VM_MAXUSER_ADDRESS) {
3396 if (curproc && curproc->p_vmspace) {
3397 ptep = pmap_pte(&curproc->p_vmspace->vm_pmap, va);
3399 return (TLBLO_PTE_TO_PA(*ptep) |
3407 * Should be kernel virtual here, otherwise fail
3409 mapped = (va >= MIPS_KSEG2_START || va < MIPS_KSEG2_END);
3410 #if defined(__mips_n64)
3411 mapped = mapped || (va >= MIPS_XKSEG_START || va < MIPS_XKSEG_END);
3420 /* Is the kernel pmap initialized? */
3421 if (!CPU_EMPTY(&kernel_pmap->pm_active)) {
3422 /* It's inside the virtual address range */
3423 ptep = pmap_pte(kernel_pmap, va);
3425 return (TLBLO_PTE_TO_PA(*ptep) |
3432 panic("%s for unknown address space %p.", __func__, (void *)va);
3437 pmap_flush_pvcache(vm_page_t m)
3442 for (pv = TAILQ_FIRST(&m->md.pv_list); pv;
3443 pv = TAILQ_NEXT(pv, pv_list)) {
3444 mips_dcache_wbinv_range_index(pv->pv_va, PAGE_SIZE);