2 * Copyright (c) 1991 Regents of the University of California.
3 * Copyright (c) 1994 John S. Dyson
4 * Copyright (c) 1994 David Greenman
5 * Copyright (c) 2003 Peter Wemm
6 * Copyright (c) 2005-2008 Alan L. Cox <alc@cs.rice.edu>
7 * Copyright (c) 2008, 2009 The DragonFly Project.
8 * Copyright (c) 2008, 2009 Jordan Gordeev.
11 * This code is derived from software contributed to Berkeley by
12 * the Systems Programming Group of the University of Utah Computer
13 * Science Department and William Jolitz of UUNET Technologies Inc.
15 * Redistribution and use in source and binary forms, with or without
16 * modification, are permitted provided that the following conditions
18 * 1. Redistributions of source code must retain the above copyright
19 * notice, this list of conditions and the following disclaimer.
20 * 2. Redistributions in binary form must reproduce the above copyright
21 * notice, this list of conditions and the following disclaimer in the
22 * documentation and/or other materials provided with the distribution.
23 * 3. All advertising materials mentioning features or use of this software
24 * must display the following acknowledgement:
25 * This product includes software developed by the University of
26 * California, Berkeley and its contributors.
27 * 4. Neither the name of the University nor the names of its contributors
28 * may be used to endorse or promote products derived from this software
29 * without specific prior written permission.
31 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
32 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
33 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
34 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
35 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
36 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
37 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
38 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
39 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
40 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
43 * from: @(#)pmap.c 7.7 (Berkeley) 5/12/91
44 * $FreeBSD: src/sys/i386/i386/pmap.c,v 1.250.2.18 2002/03/06 22:48:53 silby Exp $
48 * Manages physical address maps.
51 #include "opt_msgbuf.h"
53 #include <sys/param.h>
54 #include <sys/systm.h>
55 #include <sys/kernel.h>
57 #include <sys/msgbuf.h>
58 #include <sys/vmmeter.h>
60 #include <sys/vmspace.h>
63 #include <vm/vm_param.h>
64 #include <sys/sysctl.h>
66 #include <vm/vm_kern.h>
67 #include <vm/vm_page.h>
68 #include <vm/vm_map.h>
69 #include <vm/vm_object.h>
70 #include <vm/vm_extern.h>
71 #include <vm/vm_pageout.h>
72 #include <vm/vm_pager.h>
73 #include <vm/vm_zone.h>
76 #include <sys/thread2.h>
77 #include <sys/sysref2.h>
78 #include <sys/spinlock2.h>
79 #include <vm/vm_page2.h>
81 #include <machine/cputypes.h>
82 #include <machine/md_var.h>
83 #include <machine/specialreg.h>
84 #include <machine/smp.h>
85 #include <machine/globaldata.h>
86 #include <machine/pmap.h>
87 #include <machine/pmap_inval.h>
96 #define PMAP_KEEP_PDIRS
97 #ifndef PMAP_SHPGPERPROC
98 #define PMAP_SHPGPERPROC 1000
101 #if defined(DIAGNOSTIC)
102 #define PMAP_DIAGNOSTIC
107 #if !defined(PMAP_DIAGNOSTIC)
108 #define PMAP_INLINE __inline
114 * Get PDEs and PTEs for user/kernel address space
116 static pd_entry_t
*pmap_pde(pmap_t pmap
, vm_offset_t va
);
117 #define pdir_pde(m, v) (m[(vm_offset_t)(v) >> PDRSHIFT])
119 #define pmap_pde_v(pte) ((*(pd_entry_t *)pte & VPTE_V) != 0)
120 #define pmap_pte_w(pte) ((*(pt_entry_t *)pte & VPTE_WIRED) != 0)
121 #define pmap_pte_m(pte) ((*(pt_entry_t *)pte & VPTE_M) != 0)
122 #define pmap_pte_u(pte) ((*(pt_entry_t *)pte & VPTE_A) != 0)
123 #define pmap_pte_v(pte) ((*(pt_entry_t *)pte & VPTE_V) != 0)
126 * Given a map and a machine independent protection code,
127 * convert to a vax protection code.
129 #define pte_prot(m, p) \
130 (protection_codes[p & (VM_PROT_READ|VM_PROT_WRITE|VM_PROT_EXECUTE)])
131 static int protection_codes
[8];
133 struct pmap kernel_pmap
;
135 static boolean_t pmap_initialized
= FALSE
; /* Has pmap_init completed? */
137 static struct vm_object kptobj
;
140 static uint64_t KPDphys
; /* phys addr of kernel level 2 */
141 uint64_t KPDPphys
; /* phys addr of kernel level 3 */
142 uint64_t KPML4phys
; /* phys addr of kernel level 4 */
144 extern int vmm_enabled
;
145 extern void *vkernel_stack
;
148 * Data for the pv entry allocation mechanism
150 static vm_zone_t pvzone
;
151 static struct vm_zone pvzone_store
;
152 static struct vm_object pvzone_obj
;
153 static int pv_entry_count
= 0;
154 static int pv_entry_max
= 0;
155 static int pv_entry_high_water
= 0;
156 static int pmap_pagedaemon_waken
= 0;
157 static struct pv_entry
*pvinit
;
160 * All those kernel PT submaps that BSD is so fond of
162 pt_entry_t
*CMAP1
= NULL
, *ptmmap
;
163 caddr_t CADDR1
= NULL
;
164 static pt_entry_t
*msgbufmap
;
168 static PMAP_INLINE
void free_pv_entry (pv_entry_t pv
);
169 static pv_entry_t
get_pv_entry (void);
170 static void i386_protection_init (void);
171 static __inline
void pmap_clearbit (vm_page_t m
, int bit
);
173 static void pmap_remove_all (vm_page_t m
);
174 static int pmap_remove_pte (struct pmap
*pmap
, pt_entry_t
*ptq
,
175 pt_entry_t oldpte
, vm_offset_t sva
);
176 static void pmap_remove_page (struct pmap
*pmap
, vm_offset_t va
);
177 static int pmap_remove_entry (struct pmap
*pmap
, vm_page_t m
,
179 static boolean_t
pmap_testbit (vm_page_t m
, int bit
);
180 static void pmap_insert_entry (pmap_t pmap
, vm_offset_t va
,
181 vm_page_t mpte
, vm_page_t m
, pv_entry_t
);
183 static vm_page_t
pmap_allocpte (pmap_t pmap
, vm_offset_t va
);
185 static int pmap_release_free_page (pmap_t pmap
, vm_page_t p
);
186 static vm_page_t
_pmap_allocpte (pmap_t pmap
, vm_pindex_t ptepindex
);
187 static vm_page_t
pmap_page_lookup (vm_object_t object
, vm_pindex_t pindex
);
188 static int pmap_unuse_pt (pmap_t
, vm_offset_t
, vm_page_t
);
191 pv_entry_compare(pv_entry_t pv1
, pv_entry_t pv2
)
193 if (pv1
->pv_va
< pv2
->pv_va
)
195 if (pv1
->pv_va
> pv2
->pv_va
)
200 RB_GENERATE2(pv_entry_rb_tree
, pv_entry
, pv_entry
,
201 pv_entry_compare
, vm_offset_t
, pv_va
);
203 static __inline vm_pindex_t
204 pmap_pt_pindex(vm_offset_t va
)
206 return va
>> PDRSHIFT
;
209 static __inline vm_pindex_t
210 pmap_pte_index(vm_offset_t va
)
212 return ((va
>> PAGE_SHIFT
) & ((1ul << NPTEPGSHIFT
) - 1));
215 static __inline vm_pindex_t
216 pmap_pde_index(vm_offset_t va
)
218 return ((va
>> PDRSHIFT
) & ((1ul << NPDEPGSHIFT
) - 1));
221 static __inline vm_pindex_t
222 pmap_pdpe_index(vm_offset_t va
)
224 return ((va
>> PDPSHIFT
) & ((1ul << NPDPEPGSHIFT
) - 1));
227 static __inline vm_pindex_t
228 pmap_pml4e_index(vm_offset_t va
)
230 return ((va
>> PML4SHIFT
) & ((1ul << NPML4EPGSHIFT
) - 1));
233 /* Return a pointer to the PML4 slot that corresponds to a VA */
234 static __inline pml4_entry_t
*
235 pmap_pml4e(pmap_t pmap
, vm_offset_t va
)
237 return (&pmap
->pm_pml4
[pmap_pml4e_index(va
)]);
240 /* Return a pointer to the PDP slot that corresponds to a VA */
241 static __inline pdp_entry_t
*
242 pmap_pml4e_to_pdpe(pml4_entry_t
*pml4e
, vm_offset_t va
)
246 pdpe
= (pdp_entry_t
*)PHYS_TO_DMAP(*pml4e
& VPTE_FRAME
);
247 return (&pdpe
[pmap_pdpe_index(va
)]);
250 /* Return a pointer to the PDP slot that corresponds to a VA */
251 static __inline pdp_entry_t
*
252 pmap_pdpe(pmap_t pmap
, vm_offset_t va
)
256 pml4e
= pmap_pml4e(pmap
, va
);
257 if ((*pml4e
& VPTE_V
) == 0)
259 return (pmap_pml4e_to_pdpe(pml4e
, va
));
262 /* Return a pointer to the PD slot that corresponds to a VA */
263 static __inline pd_entry_t
*
264 pmap_pdpe_to_pde(pdp_entry_t
*pdpe
, vm_offset_t va
)
268 pde
= (pd_entry_t
*)PHYS_TO_DMAP(*pdpe
& VPTE_FRAME
);
269 return (&pde
[pmap_pde_index(va
)]);
272 /* Return a pointer to the PD slot that corresponds to a VA */
273 static __inline pd_entry_t
*
274 pmap_pde(pmap_t pmap
, vm_offset_t va
)
278 pdpe
= pmap_pdpe(pmap
, va
);
279 if (pdpe
== NULL
|| (*pdpe
& VPTE_V
) == 0)
281 return (pmap_pdpe_to_pde(pdpe
, va
));
284 /* Return a pointer to the PT slot that corresponds to a VA */
285 static __inline pt_entry_t
*
286 pmap_pde_to_pte(pd_entry_t
*pde
, vm_offset_t va
)
290 pte
= (pt_entry_t
*)PHYS_TO_DMAP(*pde
& VPTE_FRAME
);
291 return (&pte
[pmap_pte_index(va
)]);
295 * Hold pt_m for page table scans to prevent it from getting reused out
296 * from under us across blocking conditions in the body of the loop.
300 pmap_hold_pt_page(pd_entry_t
*pde
, vm_offset_t va
)
305 pte
= (pt_entry_t
)*pde
;
307 pt_m
= PHYS_TO_VM_PAGE(pte
& VPTE_FRAME
);
313 /* Return a pointer to the PT slot that corresponds to a VA */
314 static __inline pt_entry_t
*
315 pmap_pte(pmap_t pmap
, vm_offset_t va
)
319 pde
= pmap_pde(pmap
, va
);
320 if (pde
== NULL
|| (*pde
& VPTE_V
) == 0)
322 if ((*pde
& VPTE_PS
) != 0) /* compat with i386 pmap_pte() */
323 return ((pt_entry_t
*)pde
);
324 return (pmap_pde_to_pte(pde
, va
));
327 static PMAP_INLINE pt_entry_t
*
328 vtopte(vm_offset_t va
)
331 x
= pmap_pte(&kernel_pmap
, va
);
336 static __inline pd_entry_t
*
337 vtopde(vm_offset_t va
)
340 x
= pmap_pde(&kernel_pmap
, va
);
346 allocpages(vm_paddr_t
*firstaddr
, int n
)
351 /*bzero((void *)ret, n * PAGE_SIZE); not mapped yet */
352 *firstaddr
+= n
* PAGE_SIZE
;
357 create_dmap_vmm(vm_paddr_t
*firstaddr
)
360 int pml4_stack_index
;
367 uint64_t KPDP_DMAP_phys
= allocpages(firstaddr
, NDMPML4E
);
368 uint64_t KPDP_VSTACK_phys
= allocpages(firstaddr
, 1);
369 uint64_t KPD_VSTACK_phys
= allocpages(firstaddr
, 1);
371 pml4_entry_t
*KPML4virt
= (pml4_entry_t
*)PHYS_TO_DMAP(KPML4phys
);
372 pdp_entry_t
*KPDP_DMAP_virt
= (pdp_entry_t
*)PHYS_TO_DMAP(KPDP_DMAP_phys
);
373 pdp_entry_t
*KPDP_VSTACK_virt
= (pdp_entry_t
*)PHYS_TO_DMAP(KPDP_VSTACK_phys
);
374 pd_entry_t
*KPD_VSTACK_virt
= (pd_entry_t
*)PHYS_TO_DMAP(KPD_VSTACK_phys
);
376 bzero(KPDP_DMAP_virt
, NDMPML4E
* PAGE_SIZE
);
377 bzero(KPDP_VSTACK_virt
, 1 * PAGE_SIZE
);
378 bzero(KPD_VSTACK_virt
, 1 * PAGE_SIZE
);
380 do_cpuid(0x80000001, regs
);
381 amd_feature
= regs
[3];
383 /* Build the mappings for the first 512GB */
384 if (amd_feature
& AMDID_PAGE1GB
) {
385 /* In pages of 1 GB, if supported */
386 for (i
= 0; i
< NPDPEPG
; i
++) {
387 KPDP_DMAP_virt
[i
] = ((uint64_t)i
<< PDPSHIFT
);
388 KPDP_DMAP_virt
[i
] |= VPTE_RW
| VPTE_V
| VPTE_PS
| VPTE_U
;
391 /* In page of 2MB, otherwise */
392 for (i
= 0; i
< NPDPEPG
; i
++) {
393 uint64_t KPD_DMAP_phys
;
394 pd_entry_t
*KPD_DMAP_virt
;
396 KPD_DMAP_phys
= allocpages(firstaddr
, 1);
398 (pd_entry_t
*)PHYS_TO_DMAP(KPD_DMAP_phys
);
400 bzero(KPD_DMAP_virt
, PAGE_SIZE
);
402 KPDP_DMAP_virt
[i
] = KPD_DMAP_phys
;
403 KPDP_DMAP_virt
[i
] |= VPTE_RW
| VPTE_V
| VPTE_U
;
405 /* For each PD, we have to allocate NPTEPG PT */
406 for (j
= 0; j
< NPTEPG
; j
++) {
407 KPD_DMAP_virt
[j
] = (i
<< PDPSHIFT
) |
409 KPD_DMAP_virt
[j
] |= VPTE_RW
| VPTE_V
|
415 /* DMAP for the first 512G */
416 KPML4virt
[0] = KPDP_DMAP_phys
;
417 KPML4virt
[0] |= VPTE_RW
| VPTE_V
| VPTE_U
;
419 /* create a 2 MB map of the new stack */
420 pml4_stack_index
= (uint64_t)&stack_addr
>> PML4SHIFT
;
421 KPML4virt
[pml4_stack_index
] = KPDP_VSTACK_phys
;
422 KPML4virt
[pml4_stack_index
] |= VPTE_RW
| VPTE_V
| VPTE_U
;
424 pdp_stack_index
= ((uint64_t)&stack_addr
& PML4MASK
) >> PDPSHIFT
;
425 KPDP_VSTACK_virt
[pdp_stack_index
] = KPD_VSTACK_phys
;
426 KPDP_VSTACK_virt
[pdp_stack_index
] |= VPTE_RW
| VPTE_V
| VPTE_U
;
428 pd_stack_index
= ((uint64_t)&stack_addr
& PDPMASK
) >> PDRSHIFT
;
429 KPD_VSTACK_virt
[pd_stack_index
] = (uint64_t) vkernel_stack
;
430 KPD_VSTACK_virt
[pd_stack_index
] |= VPTE_RW
| VPTE_V
| VPTE_U
| VPTE_PS
;
434 create_pagetables(vm_paddr_t
*firstaddr
, int64_t ptov_offset
)
437 pml4_entry_t
*KPML4virt
;
438 pdp_entry_t
*KPDPvirt
;
441 int kpml4i
= pmap_pml4e_index(ptov_offset
);
442 int kpdpi
= pmap_pdpe_index(ptov_offset
);
443 int kpdi
= pmap_pde_index(ptov_offset
);
446 * Calculate NKPT - number of kernel page tables. We have to
447 * accomodoate prealloction of the vm_page_array, dump bitmap,
448 * MSGBUF_SIZE, and other stuff. Be generous.
450 * Maxmem is in pages.
452 nkpt
= (Maxmem
* (sizeof(struct vm_page
) * 2) + MSGBUF_SIZE
) / NBPDR
;
456 KPML4phys
= allocpages(firstaddr
, 1);
457 KPDPphys
= allocpages(firstaddr
, NKPML4E
);
458 KPDphys
= allocpages(firstaddr
, NKPDPE
);
459 KPTphys
= allocpages(firstaddr
, nkpt
);
461 KPML4virt
= (pml4_entry_t
*)PHYS_TO_DMAP(KPML4phys
);
462 KPDPvirt
= (pdp_entry_t
*)PHYS_TO_DMAP(KPDPphys
);
463 KPDvirt
= (pd_entry_t
*)PHYS_TO_DMAP(KPDphys
);
464 KPTvirt
= (pt_entry_t
*)PHYS_TO_DMAP(KPTphys
);
466 bzero(KPML4virt
, 1 * PAGE_SIZE
);
467 bzero(KPDPvirt
, NKPML4E
* PAGE_SIZE
);
468 bzero(KPDvirt
, NKPDPE
* PAGE_SIZE
);
469 bzero(KPTvirt
, nkpt
* PAGE_SIZE
);
471 /* Now map the page tables at their location within PTmap */
472 for (i
= 0; i
< nkpt
; i
++) {
473 KPDvirt
[i
+ kpdi
] = KPTphys
+ (i
<< PAGE_SHIFT
);
474 KPDvirt
[i
+ kpdi
] |= VPTE_RW
| VPTE_V
| VPTE_U
;
477 /* And connect up the PD to the PDP */
478 for (i
= 0; i
< NKPDPE
; i
++) {
479 KPDPvirt
[i
+ kpdpi
] = KPDphys
+ (i
<< PAGE_SHIFT
);
480 KPDPvirt
[i
+ kpdpi
] |= VPTE_RW
| VPTE_V
| VPTE_U
;
483 /* And recursively map PML4 to itself in order to get PTmap */
484 KPML4virt
[PML4PML4I
] = KPML4phys
;
485 KPML4virt
[PML4PML4I
] |= VPTE_RW
| VPTE_V
| VPTE_U
;
487 /* Connect the KVA slot up to the PML4 */
488 KPML4virt
[kpml4i
] = KPDPphys
;
489 KPML4virt
[kpml4i
] |= VPTE_RW
| VPTE_V
| VPTE_U
;
493 * Typically used to initialize a fictitious page by vm/device_pager.c
496 pmap_page_init(struct vm_page
*m
)
499 TAILQ_INIT(&m
->md
.pv_list
);
503 * Bootstrap the system enough to run with virtual memory.
505 * On the i386 this is called after mapping has already been enabled
506 * and just syncs the pmap module with what has already been done.
507 * [We can't call it easily with mapping off since the kernel is not
508 * mapped with PA == VA, hence we would have to relocate every address
509 * from the linked base (virtual) address "KERNBASE" to the actual
510 * (physical) address starting relative to 0]
513 pmap_bootstrap(vm_paddr_t
*firstaddr
, int64_t ptov_offset
)
519 * Create an initial set of page tables to run the kernel in.
521 create_pagetables(firstaddr
, ptov_offset
);
523 /* Create the DMAP for the VMM */
525 create_dmap_vmm(firstaddr
);
528 virtual_start
= KvaStart
;
529 virtual_end
= KvaEnd
;
532 * Initialize protection array.
534 i386_protection_init();
537 * The kernel's pmap is statically allocated so we don't have to use
538 * pmap_create, which is unlikely to work correctly at this part of
539 * the boot sequence (XXX and which no longer exists).
541 * The kernel_pmap's pm_pteobj is used only for locking and not
544 kernel_pmap
.pm_pml4
= (pml4_entry_t
*)PHYS_TO_DMAP(KPML4phys
);
545 kernel_pmap
.pm_count
= 1;
546 /* don't allow deactivation */
547 CPUMASK_ASSALLONES(kernel_pmap
.pm_active
);
548 kernel_pmap
.pm_pteobj
= NULL
; /* see pmap_init */
549 RB_INIT(&kernel_pmap
.pm_pvroot
);
550 spin_init(&kernel_pmap
.pm_spin
, "pmapbootstrap");
553 * Reserve some special page table entries/VA space for temporary
556 #define SYSMAP(c, p, v, n) \
557 v = (c)va; va += ((n)*PAGE_SIZE); p = pte; pte += (n);
560 pte
= pmap_pte(&kernel_pmap
, va
);
562 * CMAP1/CMAP2 are used for zeroing and copying pages.
564 SYSMAP(caddr_t
, CMAP1
, CADDR1
, 1)
570 SYSMAP(caddr_t
, pt_crashdumpmap
, crashdumpmap
, MAXDUMPPGS
);
574 * ptvmmap is used for reading arbitrary physical pages via
577 SYSMAP(caddr_t
, ptmmap
, ptvmmap
, 1)
580 * msgbufp is used to map the system message buffer.
581 * XXX msgbufmap is not used.
583 SYSMAP(struct msgbuf
*, msgbufmap
, msgbufp
,
584 atop(round_page(MSGBUF_SIZE
)))
589 /* Not ready to do an invltlb yet for VMM*/
596 * Initialize the pmap module.
597 * Called by vm_init, to initialize any structures that the pmap
598 * system needs to map virtual memory.
599 * pmap_init has been enhanced to support in a fairly consistant
600 * way, discontiguous physical memory.
609 * object for kernel page table pages
611 /* JG I think the number can be arbitrary */
612 vm_object_init(&kptobj
, 5);
613 kernel_pmap
.pm_pteobj
= &kptobj
;
616 * Allocate memory for random pmap data structures. Includes the
619 for(i
= 0; i
< vm_page_array_size
; i
++) {
622 m
= &vm_page_array
[i
];
623 TAILQ_INIT(&m
->md
.pv_list
);
624 m
->md
.pv_list_count
= 0;
628 * init the pv free list
630 initial_pvs
= vm_page_array_size
;
631 if (initial_pvs
< MINPV
)
633 pvzone
= &pvzone_store
;
634 pvinit
= (struct pv_entry
*)
635 kmem_alloc(&kernel_map
,
636 initial_pvs
* sizeof (struct pv_entry
),
638 zbootinit(pvzone
, "PV ENTRY", sizeof (struct pv_entry
), pvinit
,
642 * Now it is safe to enable pv_table recording.
644 pmap_initialized
= TRUE
;
648 * Initialize the address space (zone) for the pv_entries. Set a
649 * high water mark so that the system can recover from excessive
650 * numbers of pv entries.
655 int shpgperproc
= PMAP_SHPGPERPROC
;
657 TUNABLE_INT_FETCH("vm.pmap.shpgperproc", &shpgperproc
);
658 pv_entry_max
= shpgperproc
* maxproc
+ vm_page_array_size
;
659 TUNABLE_INT_FETCH("vm.pmap.pv_entries", &pv_entry_max
);
660 pv_entry_high_water
= 9 * (pv_entry_max
/ 10);
661 zinitna(pvzone
, &pvzone_obj
, NULL
, 0, pv_entry_max
, ZONE_INTERRUPT
);
665 /***************************************************
666 * Low level helper routines.....
667 ***************************************************/
670 * The modification bit is not tracked for any pages in this range. XXX
671 * such pages in this maps should always use pmap_k*() functions and not
674 * XXX User and kernel address spaces are independant for virtual kernels,
675 * this function only applies to the kernel pmap.
678 pmap_track_modified(pmap_t pmap
, vm_offset_t va
)
680 if (pmap
!= &kernel_pmap
)
682 if ((va
< clean_sva
) || (va
>= clean_eva
))
689 * Extract the physical page address associated with the map/VA pair.
694 pmap_extract(pmap_t pmap
, vm_offset_t va
, void **handlep
)
698 pd_entry_t pde
, *pdep
;
700 vm_object_hold(pmap
->pm_pteobj
);
702 pdep
= pmap_pde(pmap
, va
);
706 if ((pde
& VPTE_PS
) != 0) {
708 rtval
= (pde
& PG_PS_FRAME
) | (va
& PDRMASK
);
710 pte
= pmap_pde_to_pte(pdep
, va
);
711 rtval
= (*pte
& VPTE_FRAME
) | (va
& PAGE_MASK
);
716 *handlep
= NULL
; /* XXX */
717 vm_object_drop(pmap
->pm_pteobj
);
723 pmap_extract_done(void *handle
)
729 vm_object_drop(pmap
->pm_pteobj
);
734 * Similar to extract but checks protections, SMP-friendly short-cut for
735 * vm_fault_page[_quick]().
737 * WARNING! THE RETURNED PAGE IS ONLY HELD AND NEITHER IT NOR ITS TARGET
738 * DATA IS SUITABLE FOR WRITING. Writing can interfere with
739 * pageouts flushes, msync, etc. The hold_count is not enough
740 * to avoid races against pageouts and other flush code doesn't
741 * care about hold_count.
744 pmap_fault_page_quick(pmap_t pmap __unused
, vm_offset_t vaddr __unused
,
745 vm_prot_t prot __unused
, int *busyp __unused
)
751 * Routine: pmap_kextract
753 * Extract the physical page address associated
754 * kernel virtual address.
757 pmap_kextract(vm_offset_t va
)
762 KKASSERT(va
>= KvaStart
&& va
< KvaEnd
);
765 * The DMAP region is not included in [KvaStart, KvaEnd)
768 if (va
>= DMAP_MIN_ADDRESS
&& va
< DMAP_MAX_ADDRESS
) {
769 pa
= DMAP_TO_PHYS(va
);
775 pa
= (pde
& PG_PS_FRAME
) | (va
& PDRMASK
);
778 * Beware of a concurrent promotion that changes the
779 * PDE at this point! For example, vtopte() must not
780 * be used to access the PTE because it would use the
781 * new PDE. It is, however, safe to use the old PDE
782 * because the page table page is preserved by the
785 pa
= *pmap_pde_to_pte(&pde
, va
);
786 pa
= (pa
& VPTE_FRAME
) | (va
& PAGE_MASK
);
794 /***************************************************
795 * Low level mapping routines.....
796 ***************************************************/
799 * Enter a mapping into kernel_pmap. Mappings created in this fashion
800 * are not managed. Mappings must be immediately accessible on all cpus.
802 * Call pmap_inval_pte() to invalidate the virtual pte and clean out the
803 * real pmap and handle related races before storing the new vpte. The
804 * new semantics for kenter require use to do an UNCONDITIONAL invalidation,
805 * because the entry may have previously been cleared without an invalidation.
808 pmap_kenter(vm_offset_t va
, vm_paddr_t pa
)
813 KKASSERT(va
>= KvaStart
&& va
< KvaEnd
);
814 npte
= pa
| VPTE_RW
| VPTE_V
| VPTE_U
;
818 pmap_inval_pte(ptep
, &kernel_pmap
, va
);
821 pmap_inval_pte(ptep
, &kernel_pmap
, va
);
823 atomic_swap_long(ptep
, npte
);
827 * Enter an unmanaged KVA mapping for the private use of the current
830 * It is illegal for the mapping to be accessed by other cpus without
831 * proper invalidation.
834 pmap_kenter_quick(vm_offset_t va
, vm_paddr_t pa
)
840 KKASSERT(va
>= KvaStart
&& va
< KvaEnd
);
842 npte
= (vpte_t
)pa
| VPTE_RW
| VPTE_V
| VPTE_U
;
846 pmap_inval_pte_quick(ptep
, &kernel_pmap
, va
);
852 pmap_inval_pte(pte
, &kernel_pmap
, va
);
854 atomic_swap_long(ptep
, npte
);
860 * Invalidation will occur later, ok to be lazy here.
863 pmap_kenter_noinval(vm_offset_t va
, vm_paddr_t pa
)
869 KKASSERT(va
>= KvaStart
&& va
< KvaEnd
);
871 npte
= (vpte_t
)pa
| VPTE_RW
| VPTE_V
| VPTE_U
;
879 atomic_swap_long(ptep
, npte
);
885 * Remove an unmanaged mapping created with pmap_kenter*().
888 pmap_kremove(vm_offset_t va
)
892 KKASSERT(va
>= KvaStart
&& va
< KvaEnd
);
895 atomic_swap_long(ptep
, 0);
896 pmap_inval_pte(ptep
, &kernel_pmap
, va
);
900 * Remove an unmanaged mapping created with pmap_kenter*() but synchronize
901 * only with this cpu.
903 * Unfortunately because we optimize new entries by testing VPTE_V later
904 * on, we actually still have to synchronize with all the cpus. XXX maybe
905 * store a junk value and test against 0 in the other places instead?
908 pmap_kremove_quick(vm_offset_t va
)
912 KKASSERT(va
>= KvaStart
&& va
< KvaEnd
);
915 atomic_swap_long(ptep
, 0);
916 pmap_inval_pte(ptep
, &kernel_pmap
, va
); /* NOT _quick */
920 * Invalidation will occur later, ok to be lazy here.
923 pmap_kremove_noinval(vm_offset_t va
)
927 KKASSERT(va
>= KvaStart
&& va
< KvaEnd
);
930 atomic_swap_long(ptep
, 0);
934 * Used to map a range of physical addresses into kernel
935 * virtual address space.
937 * For now, VM is already on, we only need to map the
941 pmap_map(vm_offset_t
*virtp
, vm_paddr_t start
, vm_paddr_t end
, int prot
)
943 return PHYS_TO_DMAP(start
);
947 * Map a set of unmanaged VM pages into KVM.
950 pmap_qenter(vm_offset_t beg_va
, vm_page_t
*m
, int count
)
955 end_va
= beg_va
+ count
* PAGE_SIZE
;
956 KKASSERT(beg_va
>= KvaStart
&& end_va
< KvaEnd
);
958 for (va
= beg_va
; va
< end_va
; va
+= PAGE_SIZE
) {
962 atomic_swap_long(ptep
, VM_PAGE_TO_PHYS(*m
) |
963 VPTE_RW
| VPTE_V
| VPTE_U
);
966 pmap_invalidate_range(&kernel_pmap
, beg_va
, end_va
);
967 /* pmap_inval_pte(pte, &kernel_pmap, va); */
971 * Undo the effects of pmap_qenter*().
974 pmap_qremove(vm_offset_t beg_va
, int count
)
979 end_va
= beg_va
+ count
* PAGE_SIZE
;
980 KKASSERT(beg_va
>= KvaStart
&& end_va
< KvaEnd
);
982 for (va
= beg_va
; va
< end_va
; va
+= PAGE_SIZE
) {
986 atomic_swap_long(ptep
, 0);
988 pmap_invalidate_range(&kernel_pmap
, beg_va
, end_va
);
992 * Unlike the real pmap code, we can't avoid calling the real-kernel.
995 pmap_qremove_quick(vm_offset_t va
, int count
)
997 pmap_qremove(va
, count
);
1001 pmap_qremove_noinval(vm_offset_t va
, int count
)
1003 pmap_qremove(va
, count
);
1007 * This routine works like vm_page_lookup() but also blocks as long as the
1008 * page is busy. This routine does not busy the page it returns.
1010 * Unless the caller is managing objects whos pages are in a known state,
1011 * the call should be made with a critical section held so the page's object
1012 * association remains valid on return.
1015 pmap_page_lookup(vm_object_t object
, vm_pindex_t pindex
)
1019 ASSERT_LWKT_TOKEN_HELD(vm_object_token(object
));
1020 m
= vm_page_lookup_busy_wait(object
, pindex
, FALSE
, "pplookp");
1026 * Create a new thread and optionally associate it with a (new) process.
1027 * NOTE! the new thread's cpu may not equal the current cpu.
1030 pmap_init_thread(thread_t td
)
1032 /* enforce pcb placement */
1033 td
->td_pcb
= (struct pcb
*)(td
->td_kstack
+ td
->td_kstack_size
) - 1;
1034 td
->td_savefpu
= &td
->td_pcb
->pcb_save
;
1035 td
->td_sp
= (char *)td
->td_pcb
- 16; /* JG is -16 needed on x86_64? */
1039 * This routine directly affects the fork perf for a process.
1042 pmap_init_proc(struct proc
*p
)
1047 * Unwire a page table which has been removed from the pmap. We own the
1048 * wire_count, so the page cannot go away. The page representing the page
1049 * table is passed in unbusied and must be busied if we cannot trivially
1054 pmap_unwire_pgtable(pmap_t pmap
, vm_offset_t va
, vm_page_t m
)
1057 * Try to unwire optimally. If non-zero is returned the wire_count
1058 * is 1 and we must busy the page to unwire it.
1060 if (vm_page_unwire_quick(m
) == 0)
1063 vm_page_busy_wait(m
, FALSE
, "pmuwpt");
1064 KASSERT(m
->queue
== PQ_NONE
,
1065 ("_pmap_unwire_pgtable: %p->queue != PQ_NONE", m
));
1067 if (m
->wire_count
== 1) {
1069 * Unmap the page table page.
1071 /* pmap_inval_add(info, pmap, -1); */
1073 if (m
->pindex
>= (NUPT_TOTAL
+ NUPD_TOTAL
)) {
1076 pml4
= pmap_pml4e(pmap
, va
);
1078 } else if (m
->pindex
>= NUPT_TOTAL
) {
1081 pdp
= pmap_pdpe(pmap
, va
);
1086 pd
= pmap_pde(pmap
, va
);
1090 KKASSERT(pmap
->pm_stats
.resident_count
> 0);
1091 atomic_add_long(&pmap
->pm_stats
.resident_count
, -1);
1093 if (pmap
->pm_ptphint
== m
)
1094 pmap
->pm_ptphint
= NULL
;
1096 if (m
->pindex
< NUPT_TOTAL
) {
1097 /* We just released a PT, unhold the matching PD */
1100 pdpg
= PHYS_TO_VM_PAGE(*pmap_pdpe(pmap
, va
) &
1102 pmap_unwire_pgtable(pmap
, va
, pdpg
);
1104 if (m
->pindex
>= NUPT_TOTAL
&&
1105 m
->pindex
< (NUPT_TOTAL
+ NUPD_TOTAL
)) {
1106 /* We just released a PD, unhold the matching PDP */
1109 pdppg
= PHYS_TO_VM_PAGE(*pmap_pml4e(pmap
, va
) &
1111 pmap_unwire_pgtable(pmap
, va
, pdppg
);
1115 * This was our last wire, the page had better be unwired
1116 * after we decrement wire_count.
1118 * FUTURE NOTE: shared page directory page could result in
1119 * multiple wire counts.
1121 vm_page_unwire(m
, 0);
1122 KKASSERT(m
->wire_count
== 0);
1123 vm_page_flag_clear(m
, PG_MAPPED
| PG_WRITEABLE
);
1125 vm_page_free_zero(m
);
1128 /* XXX SMP race to 1 if not holding vmobj */
1129 vm_page_unwire(m
, 0);
1136 * After removing a page table entry, this routine is used to
1137 * conditionally free the page, and manage the hold/wire counts.
1139 * If not NULL the caller owns a wire_count on mpte, so it can't disappear.
1140 * If NULL the caller owns a wire_count on what would be the mpte, we must
1144 pmap_unuse_pt(pmap_t pmap
, vm_offset_t va
, vm_page_t mpte
)
1146 vm_pindex_t ptepindex
;
1148 ASSERT_LWKT_TOKEN_HELD(vm_object_token(pmap
->pm_pteobj
));
1152 * page table pages in the kernel_pmap are not managed.
1154 if (pmap
== &kernel_pmap
)
1156 ptepindex
= pmap_pt_pindex(va
);
1157 if (pmap
->pm_ptphint
&&
1158 (pmap
->pm_ptphint
->pindex
== ptepindex
)) {
1159 mpte
= pmap
->pm_ptphint
;
1161 mpte
= pmap_page_lookup(pmap
->pm_pteobj
, ptepindex
);
1162 pmap
->pm_ptphint
= mpte
;
1163 vm_page_wakeup(mpte
);
1166 return pmap_unwire_pgtable(pmap
, va
, mpte
);
1170 * Initialize pmap0/vmspace0 . Since process 0 never enters user mode we
1171 * just dummy it up so it works well enough for fork().
1173 * In DragonFly, process pmaps may only be used to manipulate user address
1174 * space, never kernel address space.
1177 pmap_pinit0(struct pmap
*pmap
)
1183 * Initialize a preallocated and zeroed pmap structure,
1184 * such as one in a vmspace structure.
1187 pmap_pinit(struct pmap
*pmap
)
1192 * No need to allocate page table space yet but we do need a valid
1193 * page directory table.
1195 if (pmap
->pm_pml4
== NULL
) {
1196 pmap
->pm_pml4
= (pml4_entry_t
*)
1197 kmem_alloc_pageable(&kernel_map
, PAGE_SIZE
,
1202 * Allocate an object for the ptes
1204 if (pmap
->pm_pteobj
== NULL
)
1205 pmap
->pm_pteobj
= vm_object_allocate(OBJT_DEFAULT
, NUPT_TOTAL
+ NUPD_TOTAL
+ NUPDP_TOTAL
+ 1);
1208 * Allocate the page directory page, unless we already have
1209 * one cached. If we used the cached page the wire_count will
1210 * already be set appropriately.
1212 if ((ptdpg
= pmap
->pm_pdirm
) == NULL
) {
1213 ptdpg
= vm_page_grab(pmap
->pm_pteobj
,
1214 NUPT_TOTAL
+ NUPD_TOTAL
+ NUPDP_TOTAL
,
1215 VM_ALLOC_NORMAL
| VM_ALLOC_RETRY
|
1217 pmap
->pm_pdirm
= ptdpg
;
1218 vm_page_flag_clear(ptdpg
, PG_MAPPED
);
1219 vm_page_wire(ptdpg
);
1220 vm_page_wakeup(ptdpg
);
1221 pmap_kenter((vm_offset_t
)pmap
->pm_pml4
, VM_PAGE_TO_PHYS(ptdpg
));
1224 CPUMASK_ASSZERO(pmap
->pm_active
);
1225 pmap
->pm_ptphint
= NULL
;
1226 RB_INIT(&pmap
->pm_pvroot
);
1227 spin_init(&pmap
->pm_spin
, "pmapinit");
1228 bzero(&pmap
->pm_stats
, sizeof pmap
->pm_stats
);
1229 pmap
->pm_stats
.resident_count
= 1;
1230 pmap
->pm_stats
.wired_count
= 1;
1234 * Clean up a pmap structure so it can be physically freed. This routine
1235 * is called by the vmspace dtor function. A great deal of pmap data is
1236 * left passively mapped to improve vmspace management so we have a bit
1237 * of cleanup work to do here.
1242 pmap_puninit(pmap_t pmap
)
1246 KKASSERT(CPUMASK_TESTZERO(pmap
->pm_active
));
1247 if ((p
= pmap
->pm_pdirm
) != NULL
) {
1248 KKASSERT(pmap
->pm_pml4
!= NULL
);
1249 pmap_kremove((vm_offset_t
)pmap
->pm_pml4
);
1250 vm_page_busy_wait(p
, FALSE
, "pgpun");
1251 atomic_add_int(&p
->wire_count
, -1);
1252 atomic_add_int(&vmstats
.v_wire_count
, -1);
1253 vm_page_free_zero(p
);
1254 pmap
->pm_pdirm
= NULL
;
1255 atomic_add_long(&pmap
->pm_stats
.wired_count
, -1);
1256 KKASSERT(pmap
->pm_stats
.wired_count
== 0);
1258 if (pmap
->pm_pml4
) {
1259 kmem_free(&kernel_map
, (vm_offset_t
)pmap
->pm_pml4
, PAGE_SIZE
);
1260 pmap
->pm_pml4
= NULL
;
1262 if (pmap
->pm_pteobj
) {
1263 vm_object_deallocate(pmap
->pm_pteobj
);
1264 pmap
->pm_pteobj
= NULL
;
1269 * This function is now unused (used to add the pmap to the pmap_list)
1272 pmap_pinit2(struct pmap
*pmap
)
1277 * Attempt to release and free a vm_page in a pmap. Returns 1 on success,
1278 * 0 on failure (if the procedure had to sleep).
1280 * When asked to remove the page directory page itself, we actually just
1281 * leave it cached so we do not have to incur the SMP inval overhead of
1282 * removing the kernel mapping. pmap_puninit() will take care of it.
1285 pmap_release_free_page(struct pmap
*pmap
, vm_page_t p
)
1288 * This code optimizes the case of freeing non-busy
1289 * page-table pages. Those pages are zero now, and
1290 * might as well be placed directly into the zero queue.
1292 if (vm_page_busy_try(p
, FALSE
)) {
1293 vm_page_sleep_busy(p
, FALSE
, "pmaprl");
1298 * Remove the page table page from the processes address space.
1300 if (p
->pindex
== NUPT_TOTAL
+ NUPD_TOTAL
+ NUPDP_TOTAL
) {
1302 * We are the pml4 table itself.
1304 /* XXX anything to do here? */
1305 } else if (p
->pindex
>= (NUPT_TOTAL
+ NUPD_TOTAL
)) {
1307 * We are a PDP page.
1308 * We look for the PML4 entry that points to us.
1314 m4
= vm_page_lookup(pmap
->pm_pteobj
,
1315 NUPT_TOTAL
+ NUPD_TOTAL
+ NUPDP_TOTAL
);
1316 KKASSERT(m4
!= NULL
);
1317 pml4
= (pml4_entry_t
*)PHYS_TO_DMAP(VM_PAGE_TO_PHYS(m4
));
1318 idx
= (p
->pindex
- (NUPT_TOTAL
+ NUPD_TOTAL
)) % NPML4EPG
;
1319 KKASSERT(pml4
[idx
] != 0);
1321 kprintf("pmap_release: Unmapped PML4\n");
1323 vm_page_unwire_quick(m4
);
1324 } else if (p
->pindex
>= NUPT_TOTAL
) {
1327 * We look for the PDP entry that points to us.
1333 m3
= vm_page_lookup(pmap
->pm_pteobj
,
1334 NUPT_TOTAL
+ NUPD_TOTAL
+
1335 (p
->pindex
- NUPT_TOTAL
) / NPDPEPG
);
1336 KKASSERT(m3
!= NULL
);
1337 pdp
= (pdp_entry_t
*)PHYS_TO_DMAP(VM_PAGE_TO_PHYS(m3
));
1338 idx
= (p
->pindex
- NUPT_TOTAL
) % NPDPEPG
;
1339 KKASSERT(pdp
[idx
] != 0);
1341 kprintf("pmap_release: Unmapped PDP %d\n", idx
);
1343 vm_page_unwire_quick(m3
);
1345 /* We are a PT page.
1346 * We look for the PD entry that points to us.
1352 m2
= vm_page_lookup(pmap
->pm_pteobj
,
1353 NUPT_TOTAL
+ p
->pindex
/ NPDEPG
);
1354 KKASSERT(m2
!= NULL
);
1355 pd
= (pd_entry_t
*)PHYS_TO_DMAP(VM_PAGE_TO_PHYS(m2
));
1356 idx
= p
->pindex
% NPDEPG
;
1358 kprintf("pmap_release: Unmapped PD %d\n", idx
);
1360 vm_page_unwire_quick(m2
);
1362 KKASSERT(pmap
->pm_stats
.resident_count
> 0);
1363 atomic_add_long(&pmap
->pm_stats
.resident_count
, -1);
1365 if (p
->wire_count
> 1) {
1366 panic("pmap_release: freeing held pt page "
1367 "pmap=%p pg=%p dmap=%p pi=%ld {%ld,%ld,%ld}",
1368 pmap
, p
, (void *)PHYS_TO_DMAP(VM_PAGE_TO_PHYS(p
)),
1369 p
->pindex
, NUPT_TOTAL
, NUPD_TOTAL
, NUPDP_TOTAL
);
1371 if (pmap
->pm_ptphint
&& (pmap
->pm_ptphint
->pindex
== p
->pindex
))
1372 pmap
->pm_ptphint
= NULL
;
1375 * We leave the top-level page table page cached, wired, and mapped in
1376 * the pmap until the dtor function (pmap_puninit()) gets called.
1377 * However, still clean it up.
1379 if (p
->pindex
== NUPT_TOTAL
+ NUPD_TOTAL
+ NUPDP_TOTAL
) {
1380 bzero(pmap
->pm_pml4
, PAGE_SIZE
);
1383 vm_page_unwire(p
, 0);
1384 vm_page_flag_clear(p
, PG_MAPPED
| PG_WRITEABLE
);
1386 atomic_add_long(&pmap
->pm_stats
.wired_count
, -1);
1392 * Locate the requested PT, PD, or PDP page table page.
1394 * Returns a busied page, caller must vm_page_wakeup() when done.
1397 _pmap_allocpte(pmap_t pmap
, vm_pindex_t ptepindex
)
1406 * Find or fabricate a new pagetable page. A non-zero wire_count
1407 * indicates that the page has already been mapped into its parent.
1409 m
= vm_page_grab(pmap
->pm_pteobj
, ptepindex
,
1410 VM_ALLOC_NORMAL
| VM_ALLOC_ZERO
| VM_ALLOC_RETRY
);
1411 if (m
->wire_count
!= 0)
1415 * Map the page table page into its parent, giving it 1 wire count.
1418 atomic_add_long(&pmap
->pm_stats
.resident_count
, 1);
1419 vm_page_flag_set(m
, PG_MAPPED
| PG_WRITEABLE
);
1421 data
= VM_PAGE_TO_PHYS(m
) |
1422 VPTE_RW
| VPTE_V
| VPTE_U
| VPTE_A
| VPTE_M
| VPTE_WIRED
;
1423 atomic_add_long(&pmap
->pm_stats
.wired_count
, 1);
1425 if (ptepindex
>= (NUPT_TOTAL
+ NUPD_TOTAL
)) {
1427 * Map PDP into the PML4
1429 pindex
= ptepindex
- (NUPT_TOTAL
+ NUPD_TOTAL
);
1430 pindex
&= (NUPDP_TOTAL
- 1);
1431 ptep
= (pt_entry_t
*)pmap
->pm_pml4
;
1433 } else if (ptepindex
>= NUPT_TOTAL
) {
1435 * Map PD into its PDP
1437 pindex
= (ptepindex
- NUPT_TOTAL
) >> NPDPEPGSHIFT
;
1438 pindex
+= NUPT_TOTAL
+ NUPD_TOTAL
;
1439 pm
= _pmap_allocpte(pmap
, pindex
);
1440 pindex
= (ptepindex
- NUPT_TOTAL
) & (NPDPEPG
- 1);
1441 ptep
= (void *)PHYS_TO_DMAP(pm
->phys_addr
);
1444 * Map PT into its PD
1446 pindex
= ptepindex
>> NPDPEPGSHIFT
;
1447 pindex
+= NUPT_TOTAL
;
1448 pm
= _pmap_allocpte(pmap
, pindex
);
1449 pindex
= ptepindex
& (NPTEPG
- 1);
1450 ptep
= (void *)PHYS_TO_DMAP(pm
->phys_addr
);
1454 * Install the pte in (pm). (m) prevents races.
1457 data
= atomic_swap_long(ptep
, data
);
1459 vm_page_wire_quick(pm
);
1462 pmap
->pm_ptphint
= pm
;
1468 * Determine the page table page required to access the VA in the pmap
1469 * and allocate it if necessary. Return a held vm_page_t for the page.
1471 * Only used with user pmaps.
1474 pmap_allocpte(pmap_t pmap
, vm_offset_t va
)
1476 vm_pindex_t ptepindex
;
1479 ASSERT_LWKT_TOKEN_HELD(vm_object_token(pmap
->pm_pteobj
));
1482 * Calculate pagetable page index, and return the PT page to
1485 ptepindex
= pmap_pt_pindex(va
);
1486 m
= _pmap_allocpte(pmap
, ptepindex
);
1491 /***************************************************
1492 * Pmap allocation/deallocation routines.
1493 ***************************************************/
1496 * Release any resources held by the given physical map.
1497 * Called when a pmap initialized by pmap_pinit is being released.
1498 * Should only be called if the map contains no valid mappings.
1500 static int pmap_release_callback(struct vm_page
*p
, void *data
);
1503 pmap_release(struct pmap
*pmap
)
1505 vm_object_t object
= pmap
->pm_pteobj
;
1506 struct rb_vm_page_scan_info info
;
1508 KKASSERT(pmap
!= &kernel_pmap
);
1510 #if defined(DIAGNOSTIC)
1511 if (object
->ref_count
!= 1)
1512 panic("pmap_release: pteobj reference count != 1");
1516 info
.object
= object
;
1518 KASSERT(CPUMASK_TESTZERO(pmap
->pm_active
),
1519 ("pmap %p still active! %016jx",
1521 (uintmax_t)CPUMASK_LOWMASK(pmap
->pm_active
)));
1523 vm_object_hold(object
);
1527 info
.limit
= object
->generation
;
1529 vm_page_rb_tree_RB_SCAN(&object
->rb_memq
, NULL
,
1530 pmap_release_callback
, &info
);
1531 if (info
.error
== 0 && info
.mpte
) {
1532 if (pmap_release_free_page(pmap
, info
.mpte
))
1535 } while (info
.error
);
1537 KASSERT((pmap
->pm_stats
.wired_count
== (pmap
->pm_pdirm
!= NULL
)),
1538 ("pmap_release: dangling count %p %ld",
1539 pmap
, pmap
->pm_stats
.wired_count
));
1541 vm_object_drop(object
);
1545 pmap_release_callback(struct vm_page
*p
, void *data
)
1547 struct rb_vm_page_scan_info
*info
= data
;
1549 if (p
->pindex
== NUPT_TOTAL
+ NUPD_TOTAL
+ NUPDP_TOTAL
) {
1553 if (pmap_release_free_page(info
->pmap
, p
)) {
1557 if (info
->object
->generation
!= info
->limit
) {
1565 * Grow the number of kernel page table entries, if needed.
1567 * kernel_map must be locked exclusively by the caller.
1570 pmap_growkernel(vm_offset_t kstart
, vm_offset_t kend
)
1574 vm_offset_t ptppaddr
;
1576 pd_entry_t
*pde
, newpdir
;
1581 vm_object_hold(&kptobj
);
1582 if (kernel_vm_end
== 0) {
1583 kernel_vm_end
= KvaStart
;
1585 while ((*pmap_pde(&kernel_pmap
, kernel_vm_end
) & VPTE_V
) != 0) {
1586 kernel_vm_end
= (kernel_vm_end
+ PAGE_SIZE
* NPTEPG
) & ~(PAGE_SIZE
* NPTEPG
- 1);
1588 if (kernel_vm_end
- 1 >= kernel_map
.max_offset
) {
1589 kernel_vm_end
= kernel_map
.max_offset
;
1594 addr
= roundup2(addr
, PAGE_SIZE
* NPTEPG
);
1595 if (addr
- 1 >= kernel_map
.max_offset
)
1596 addr
= kernel_map
.max_offset
;
1597 while (kernel_vm_end
< addr
) {
1598 pde
= pmap_pde(&kernel_pmap
, kernel_vm_end
);
1600 /* We need a new PDP entry */
1601 nkpg
= vm_page_alloc(&kptobj
, nkpt
,
1604 VM_ALLOC_INTERRUPT
);
1606 panic("pmap_growkernel: no memory to "
1609 paddr
= VM_PAGE_TO_PHYS(nkpg
);
1610 pmap_zero_page(paddr
);
1611 newpdp
= (pdp_entry_t
)(paddr
|
1612 VPTE_V
| VPTE_RW
| VPTE_U
|
1613 VPTE_A
| VPTE_M
| VPTE_WIRED
);
1614 *pmap_pdpe(&kernel_pmap
, kernel_vm_end
) = newpdp
;
1615 atomic_add_long(&kernel_pmap
.pm_stats
.wired_count
, 1);
1617 continue; /* try again */
1619 if ((*pde
& VPTE_V
) != 0) {
1620 kernel_vm_end
= (kernel_vm_end
+ PAGE_SIZE
* NPTEPG
) &
1621 ~(PAGE_SIZE
* NPTEPG
- 1);
1622 if (kernel_vm_end
- 1 >= kernel_map
.max_offset
) {
1623 kernel_vm_end
= kernel_map
.max_offset
;
1630 * This index is bogus, but out of the way
1632 nkpg
= vm_page_alloc(&kptobj
, nkpt
,
1635 VM_ALLOC_INTERRUPT
);
1637 panic("pmap_growkernel: no memory to grow kernel");
1640 ptppaddr
= VM_PAGE_TO_PHYS(nkpg
);
1641 pmap_zero_page(ptppaddr
);
1642 newpdir
= (pd_entry_t
)(ptppaddr
|
1643 VPTE_V
| VPTE_RW
| VPTE_U
|
1644 VPTE_A
| VPTE_M
| VPTE_WIRED
);
1645 *pmap_pde(&kernel_pmap
, kernel_vm_end
) = newpdir
;
1646 atomic_add_long(&kernel_pmap
.pm_stats
.wired_count
, 1);
1649 kernel_vm_end
= (kernel_vm_end
+ PAGE_SIZE
* NPTEPG
) &
1650 ~(PAGE_SIZE
* NPTEPG
- 1);
1651 if (kernel_vm_end
- 1 >= kernel_map
.max_offset
) {
1652 kernel_vm_end
= kernel_map
.max_offset
;
1656 vm_object_drop(&kptobj
);
1660 * Add a reference to the specified pmap.
1665 pmap_reference(pmap_t pmap
)
1668 atomic_add_int(&pmap
->pm_count
, 1);
1671 /************************************************************************
1672 * VMSPACE MANAGEMENT *
1673 ************************************************************************
1675 * The VMSPACE management we do in our virtual kernel must be reflected
1676 * in the real kernel. This is accomplished by making vmspace system
1677 * calls to the real kernel.
1680 cpu_vmspace_alloc(struct vmspace
*vm
)
1687 * If VMM enable, don't do nothing, we
1688 * are able to use real page tables
1693 #define USER_SIZE (VM_MAX_USER_ADDRESS - VM_MIN_USER_ADDRESS)
1695 if (vmspace_create(&vm
->vm_pmap
, 0, NULL
) < 0)
1696 panic("vmspace_create() failed");
1698 rp
= vmspace_mmap(&vm
->vm_pmap
, VM_MIN_USER_ADDRESS
, USER_SIZE
,
1699 PROT_READ
|PROT_WRITE
,
1700 MAP_FILE
|MAP_SHARED
|MAP_VPAGETABLE
|MAP_FIXED
,
1702 if (rp
== MAP_FAILED
)
1703 panic("vmspace_mmap: failed");
1704 vmspace_mcontrol(&vm
->vm_pmap
, VM_MIN_USER_ADDRESS
, USER_SIZE
,
1706 vpte
= VM_PAGE_TO_PHYS(vmspace_pmap(vm
)->pm_pdirm
) |
1707 VPTE_RW
| VPTE_V
| VPTE_U
;
1708 r
= vmspace_mcontrol(&vm
->vm_pmap
, VM_MIN_USER_ADDRESS
, USER_SIZE
,
1711 panic("vmspace_mcontrol: failed");
1715 cpu_vmspace_free(struct vmspace
*vm
)
1718 * If VMM enable, don't do nothing, we
1719 * are able to use real page tables
1724 if (vmspace_destroy(&vm
->vm_pmap
) < 0)
1725 panic("vmspace_destroy() failed");
1728 /***************************************************
1729 * page management routines.
1730 ***************************************************/
1733 * free the pv_entry back to the free list. This function may be
1734 * called from an interrupt.
1736 static __inline
void
1737 free_pv_entry(pv_entry_t pv
)
1739 atomic_add_int(&pv_entry_count
, -1);
1740 KKASSERT(pv_entry_count
>= 0);
1745 * get a new pv_entry, allocating a block from the system
1746 * when needed. This function may be called from an interrupt.
1751 atomic_add_int(&pv_entry_count
, 1);
1752 if (pv_entry_high_water
&&
1753 (pv_entry_count
> pv_entry_high_water
) &&
1754 atomic_swap_int(&pmap_pagedaemon_waken
, 1) == 0) {
1755 wakeup(&vm_pages_needed
);
1757 return zalloc(pvzone
);
1761 * This routine is very drastic, but can save the system
1771 static int warningdone
=0;
1773 if (pmap_pagedaemon_waken
== 0)
1775 pmap_pagedaemon_waken
= 0;
1777 if (warningdone
< 5) {
1778 kprintf("pmap_collect: collecting pv entries -- "
1779 "suggest increasing PMAP_SHPGPERPROC\n");
1783 for (i
= 0; i
< vm_page_array_size
; i
++) {
1784 m
= &vm_page_array
[i
];
1785 if (m
->wire_count
|| m
->hold_count
)
1787 if (vm_page_busy_try(m
, TRUE
) == 0) {
1788 if (m
->wire_count
== 0 && m
->hold_count
== 0) {
1798 * If it is the first entry on the list, it is actually
1799 * in the header and we must copy the following entry up
1800 * to the header. Otherwise we must search the list for
1801 * the entry. In either case we free the now unused entry.
1803 * pmap->pm_pteobj must be held and (m) must be spin-locked by the caller.
1806 pmap_remove_entry(struct pmap
*pmap
, vm_page_t m
, vm_offset_t va
)
1811 vm_page_spin_lock(m
);
1812 pv
= pv_entry_rb_tree_RB_LOOKUP(&pmap
->pm_pvroot
, va
);
1815 * Note that pv_ptem is NULL if the page table page itself is not
1816 * managed, even if the page being removed IS managed.
1820 TAILQ_REMOVE(&m
->md
.pv_list
, pv
, pv_list
);
1821 m
->md
.pv_list_count
--;
1822 KKASSERT(m
->md
.pv_list_count
>= 0);
1823 if (TAILQ_EMPTY(&m
->md
.pv_list
))
1824 vm_page_flag_clear(m
, PG_MAPPED
| PG_WRITEABLE
);
1825 pv_entry_rb_tree_RB_REMOVE(&pmap
->pm_pvroot
, pv
);
1826 atomic_add_int(&pmap
->pm_generation
, 1);
1827 vm_page_spin_unlock(m
);
1828 rtval
= pmap_unuse_pt(pmap
, va
, pv
->pv_ptem
);
1831 vm_page_spin_unlock(m
);
1832 kprintf("pmap_remove_entry: could not find "
1833 "pmap=%p m=%p va=%016jx\n",
1840 * Create a pv entry for page at pa for (pmap, va). If the page table page
1841 * holding the VA is managed, mpte will be non-NULL.
1843 * pmap->pm_pteobj must be held and (m) must be spin-locked by the caller.
1846 pmap_insert_entry(pmap_t pmap
, vm_offset_t va
, vm_page_t mpte
, vm_page_t m
,
1853 m
->md
.pv_list_count
++;
1854 TAILQ_INSERT_TAIL(&m
->md
.pv_list
, pv
, pv_list
);
1855 pv
= pv_entry_rb_tree_RB_INSERT(&pmap
->pm_pvroot
, pv
);
1856 KKASSERT(pv
== NULL
);
1860 * pmap_remove_pte: do the things to unmap a page in a process
1862 * Caller holds pmap->pm_pteobj and holds the associated page table
1863 * page busy to prevent races.
1866 pmap_remove_pte(struct pmap
*pmap
, pt_entry_t
*ptq
, pt_entry_t oldpte
,
1873 oldpte
= pmap_inval_loadandclear(ptq
, pmap
, va
);
1875 if (oldpte
& VPTE_WIRED
)
1876 atomic_add_long(&pmap
->pm_stats
.wired_count
, -1);
1877 KKASSERT(pmap
->pm_stats
.wired_count
>= 0);
1881 * Machines that don't support invlpg, also don't support
1882 * PG_G. XXX PG_G is disabled for SMP so don't worry about
1886 cpu_invlpg((void *)va
);
1888 KKASSERT(pmap
->pm_stats
.resident_count
> 0);
1889 atomic_add_long(&pmap
->pm_stats
.resident_count
, -1);
1890 if (oldpte
& VPTE_MANAGED
) {
1891 m
= PHYS_TO_VM_PAGE(oldpte
);
1894 * NOTE: pmap_remove_entry() will spin-lock the page
1896 if (oldpte
& VPTE_M
) {
1897 #if defined(PMAP_DIAGNOSTIC)
1898 if (pmap_nw_modified(oldpte
)) {
1899 kprintf("pmap_remove: modified page not "
1900 "writable: va: 0x%lx, pte: 0x%lx\n",
1904 if (pmap_track_modified(pmap
, va
))
1907 if (oldpte
& VPTE_A
)
1908 vm_page_flag_set(m
, PG_REFERENCED
);
1909 error
= pmap_remove_entry(pmap
, m
, va
);
1911 error
= pmap_unuse_pt(pmap
, va
, NULL
);
1919 * Remove a single page from a process address space.
1921 * This function may not be called from an interrupt if the pmap is
1924 * Caller holds pmap->pm_pteobj
1927 pmap_remove_page(struct pmap
*pmap
, vm_offset_t va
)
1931 pte
= pmap_pte(pmap
, va
);
1934 if ((*pte
& VPTE_V
) == 0)
1936 pmap_remove_pte(pmap
, pte
, 0, va
);
1940 * Remove the given range of addresses from the specified map.
1942 * It is assumed that the start and end are properly rounded to
1945 * This function may not be called from an interrupt if the pmap is
1951 pmap_remove(struct pmap
*pmap
, vm_offset_t sva
, vm_offset_t eva
)
1953 vm_offset_t va_next
;
1954 pml4_entry_t
*pml4e
;
1956 pd_entry_t ptpaddr
, *pde
;
1963 vm_object_hold(pmap
->pm_pteobj
);
1964 KKASSERT(pmap
->pm_stats
.resident_count
>= 0);
1965 if (pmap
->pm_stats
.resident_count
== 0) {
1966 vm_object_drop(pmap
->pm_pteobj
);
1971 * special handling of removing one page. a very
1972 * common operation and easy to short circuit some
1975 if (sva
+ PAGE_SIZE
== eva
) {
1976 pde
= pmap_pde(pmap
, sva
);
1977 if (pde
&& (*pde
& VPTE_PS
) == 0) {
1978 pmap_remove_page(pmap
, sva
);
1979 vm_object_drop(pmap
->pm_pteobj
);
1984 for (; sva
< eva
; sva
= va_next
) {
1985 pml4e
= pmap_pml4e(pmap
, sva
);
1986 if ((*pml4e
& VPTE_V
) == 0) {
1987 va_next
= (sva
+ NBPML4
) & ~PML4MASK
;
1993 pdpe
= pmap_pml4e_to_pdpe(pml4e
, sva
);
1994 if ((*pdpe
& VPTE_V
) == 0) {
1995 va_next
= (sva
+ NBPDP
) & ~PDPMASK
;
2002 * Calculate index for next page table.
2004 va_next
= (sva
+ NBPDR
) & ~PDRMASK
;
2008 pde
= pmap_pdpe_to_pde(pdpe
, sva
);
2012 * Weed out invalid mappings.
2018 * Check for large page.
2020 if ((ptpaddr
& VPTE_PS
) != 0) {
2021 /* JG FreeBSD has more complex treatment here */
2022 KKASSERT(*pde
!= 0);
2023 pmap_inval_pde(pde
, pmap
, sva
);
2024 atomic_add_long(&pmap
->pm_stats
.resident_count
,
2025 -NBPDR
/ PAGE_SIZE
);
2030 * Limit our scan to either the end of the va represented
2031 * by the current page table page, or to the end of the
2032 * range being removed.
2038 * NOTE: pmap_remove_pte() can block.
2040 pt_m
= pmap_hold_pt_page(pde
, sva
);
2041 for (pte
= pmap_pde_to_pte(pde
, sva
); sva
!= va_next
; pte
++,
2044 if (pmap_remove_pte(pmap
, pte
, 0, sva
))
2048 vm_page_unhold(pt_m
);
2050 vm_object_drop(pmap
->pm_pteobj
);
2054 * Removes this physical page from all physical maps in which it resides.
2055 * Reflects back modify bits to the pager.
2057 * This routine may not be called from an interrupt.
2062 pmap_remove_all(vm_page_t m
)
2064 pt_entry_t
*pte
, tpte
;
2069 #if defined(PMAP_DIAGNOSTIC)
2071 * XXX this makes pmap_page_protect(NONE) illegal for non-managed
2074 if (!pmap_initialized
|| (m
->flags
& PG_FICTITIOUS
)) {
2075 panic("pmap_page_protect: illegal for unmanaged page, va: 0x%08llx", (long long)VM_PAGE_TO_PHYS(m
));
2080 vm_page_spin_lock(m
);
2081 while ((pv
= TAILQ_FIRST(&m
->md
.pv_list
)) != NULL
) {
2083 pmobj
= pmap
->pm_pteobj
;
2086 * Handle reversed lock ordering
2088 if (vm_object_hold_try(pmobj
) == 0) {
2089 refcount_acquire(&pmobj
->hold_count
);
2090 vm_page_spin_unlock(m
);
2091 vm_object_lock(pmobj
);
2092 vm_page_spin_lock(m
);
2093 if (pv
!= TAILQ_FIRST(&m
->md
.pv_list
) ||
2094 pmap
!= pv
->pv_pmap
||
2095 pmobj
!= pmap
->pm_pteobj
) {
2096 vm_page_spin_unlock(m
);
2097 vm_object_drop(pmobj
);
2102 KKASSERT(pmap
->pm_stats
.resident_count
> 0);
2103 atomic_add_long(&pmap
->pm_stats
.resident_count
, -1);
2105 pte
= pmap_pte(pmap
, pv
->pv_va
);
2106 KKASSERT(pte
!= NULL
);
2108 tpte
= pmap_inval_loadandclear(pte
, pmap
, pv
->pv_va
);
2109 if (tpte
& VPTE_WIRED
)
2110 atomic_add_long(&pmap
->pm_stats
.wired_count
, -1);
2111 KKASSERT(pmap
->pm_stats
.wired_count
>= 0);
2114 vm_page_flag_set(m
, PG_REFERENCED
);
2117 * Update the vm_page_t clean and reference bits.
2119 if (tpte
& VPTE_M
) {
2120 #if defined(PMAP_DIAGNOSTIC)
2121 if (pmap_nw_modified(tpte
)) {
2123 "pmap_remove_all: modified page not writable: va: 0x%lx, pte: 0x%lx\n",
2127 if (pmap_track_modified(pmap
, pv
->pv_va
))
2130 TAILQ_REMOVE(&m
->md
.pv_list
, pv
, pv_list
);
2131 pv_entry_rb_tree_RB_REMOVE(&pmap
->pm_pvroot
, pv
);
2132 atomic_add_int(&pmap
->pm_generation
, 1);
2133 m
->md
.pv_list_count
--;
2134 KKASSERT(m
->md
.pv_list_count
>= 0);
2135 if (TAILQ_EMPTY(&m
->md
.pv_list
))
2136 vm_page_flag_clear(m
, PG_MAPPED
| PG_WRITEABLE
);
2137 vm_page_spin_unlock(m
);
2138 pmap_unuse_pt(pmap
, pv
->pv_va
, pv
->pv_ptem
);
2139 vm_object_drop(pmobj
);
2141 vm_page_spin_lock(m
);
2143 KKASSERT((m
->flags
& (PG_MAPPED
|PG_WRITEABLE
)) == 0);
2144 vm_page_spin_unlock(m
);
2148 * Removes the page from a particular pmap
2151 pmap_remove_specific(pmap_t pmap
, vm_page_t m
)
2153 pt_entry_t
*pte
, tpte
;
2156 vm_object_hold(pmap
->pm_pteobj
);
2158 vm_page_spin_lock(m
);
2159 TAILQ_FOREACH(pv
, &m
->md
.pv_list
, pv_list
) {
2160 if (pv
->pv_pmap
!= pmap
)
2163 KKASSERT(pmap
->pm_stats
.resident_count
> 0);
2164 atomic_add_long(&pmap
->pm_stats
.resident_count
, -1);
2166 pte
= pmap_pte(pmap
, pv
->pv_va
);
2167 KKASSERT(pte
!= NULL
);
2169 tpte
= pmap_inval_loadandclear(pte
, pmap
, pv
->pv_va
);
2170 if (tpte
& VPTE_WIRED
)
2171 atomic_add_long(&pmap
->pm_stats
.wired_count
, -1);
2172 KKASSERT(pmap
->pm_stats
.wired_count
>= 0);
2175 vm_page_flag_set(m
, PG_REFERENCED
);
2178 * Update the vm_page_t clean and reference bits.
2180 if (tpte
& VPTE_M
) {
2181 if (pmap_track_modified(pmap
, pv
->pv_va
))
2184 TAILQ_REMOVE(&m
->md
.pv_list
, pv
, pv_list
);
2185 pv_entry_rb_tree_RB_REMOVE(&pmap
->pm_pvroot
, pv
);
2186 atomic_add_int(&pmap
->pm_generation
, 1);
2187 m
->md
.pv_list_count
--;
2188 KKASSERT(m
->md
.pv_list_count
>= 0);
2189 if (TAILQ_EMPTY(&m
->md
.pv_list
))
2190 vm_page_flag_clear(m
, PG_MAPPED
| PG_WRITEABLE
);
2191 pmap_unuse_pt(pmap
, pv
->pv_va
, pv
->pv_ptem
);
2192 vm_page_spin_unlock(m
);
2196 vm_page_spin_unlock(m
);
2197 vm_object_drop(pmap
->pm_pteobj
);
2201 * Set the physical protection on the specified range of this map
2204 * This function may not be called from an interrupt if the map is
2205 * not the kernel_pmap.
2210 pmap_protect(pmap_t pmap
, vm_offset_t sva
, vm_offset_t eva
, vm_prot_t prot
)
2212 vm_offset_t va_next
;
2213 pml4_entry_t
*pml4e
;
2215 pd_entry_t ptpaddr
, *pde
;
2222 if ((prot
& VM_PROT_READ
) == VM_PROT_NONE
) {
2223 pmap_remove(pmap
, sva
, eva
);
2227 if (prot
& VM_PROT_WRITE
)
2230 vm_object_hold(pmap
->pm_pteobj
);
2232 for (; sva
< eva
; sva
= va_next
) {
2233 pml4e
= pmap_pml4e(pmap
, sva
);
2234 if ((*pml4e
& VPTE_V
) == 0) {
2235 va_next
= (sva
+ NBPML4
) & ~PML4MASK
;
2241 pdpe
= pmap_pml4e_to_pdpe(pml4e
, sva
);
2242 if ((*pdpe
& VPTE_V
) == 0) {
2243 va_next
= (sva
+ NBPDP
) & ~PDPMASK
;
2249 va_next
= (sva
+ NBPDR
) & ~PDRMASK
;
2253 pde
= pmap_pdpe_to_pde(pdpe
, sva
);
2258 * Check for large page.
2260 if ((ptpaddr
& VPTE_PS
) != 0) {
2262 pmap_clean_pde(pde
, pmap
, sva
);
2263 atomic_add_long(&pmap
->pm_stats
.resident_count
,
2264 -NBPDR
/ PAGE_SIZE
);
2270 * Weed out invalid mappings. Note: we assume that the page
2271 * directory table is always allocated, and in kernel virtual.
2279 pt_m
= pmap_hold_pt_page(pde
, sva
);
2280 for (pte
= pmap_pde_to_pte(pde
, sva
); sva
!= va_next
; pte
++,
2286 * Clean managed pages and also check the accessed
2287 * bit. Just remove write perms for unmanaged
2288 * pages. Be careful of races, turning off write
2289 * access will force a fault rather then setting
2290 * the modified bit at an unexpected time.
2292 if (*pte
& VPTE_MANAGED
) {
2293 pbits
= pmap_clean_pte(pte
, pmap
, sva
);
2295 if (pbits
& VPTE_A
) {
2296 m
= PHYS_TO_VM_PAGE(pbits
& VPTE_FRAME
);
2297 vm_page_flag_set(m
, PG_REFERENCED
);
2298 atomic_clear_long(pte
, VPTE_A
);
2300 if (pbits
& VPTE_M
) {
2301 if (pmap_track_modified(pmap
, sva
)) {
2303 m
= PHYS_TO_VM_PAGE(pbits
& VPTE_FRAME
);
2308 pbits
= pmap_setro_pte(pte
, pmap
, sva
);
2311 vm_page_unhold(pt_m
);
2313 vm_object_drop(pmap
->pm_pteobj
);
2317 * Enter a managed page into a pmap. If the page is not wired related pmap
2318 * data can be destroyed at any time for later demand-operation.
2320 * Insert the vm_page (m) at virtual address (v) in (pmap), with the
2321 * specified protection, and wire the mapping if requested.
2323 * NOTE: This routine may not lazy-evaluate or lose information. The
2324 * page must actually be inserted into the given map NOW.
2326 * NOTE: When entering a page at a KVA address, the pmap must be the
2332 pmap_enter(pmap_t pmap
, vm_offset_t va
, vm_page_t m
, vm_prot_t prot
,
2333 boolean_t wired
, vm_map_entry_t entry __unused
)
2338 pt_entry_t origpte
, newpte
;
2345 va
= trunc_page(va
);
2347 vm_object_hold(pmap
->pm_pteobj
);
2350 * Get the page table page. The kernel_pmap's page table pages
2351 * are preallocated and have no associated vm_page_t.
2353 * If not NULL, mpte will be busied and we must vm_page_wakeup()
2354 * to cleanup. There will already be at least one wire count from
2355 * it being mapped into its parent.
2357 if (pmap
== &kernel_pmap
) {
2361 mpte
= pmap_allocpte(pmap
, va
);
2362 pte
= (void *)PHYS_TO_DMAP(mpte
->phys_addr
);
2363 pte
+= pmap_pte_index(va
);
2367 * Deal with races against the kernel's real MMU by cleaning the
2368 * page, even if we are re-entering the same page.
2370 pa
= VM_PAGE_TO_PHYS(m
);
2371 origpte
= pmap_inval_loadandclear(pte
, pmap
, va
);
2372 /*origpte = pmap_clean_pte(pte, pmap, va);*/
2373 opa
= origpte
& VPTE_FRAME
;
2375 if (origpte
& VPTE_PS
)
2376 panic("pmap_enter: attempted pmap_enter on 2MB page");
2378 if ((origpte
& (VPTE_MANAGED
|VPTE_M
)) == (VPTE_MANAGED
|VPTE_M
)) {
2379 if (pmap_track_modified(pmap
, va
)) {
2380 vm_page_t om
= PHYS_TO_VM_PAGE(opa
);
2386 * Mapping has not changed, must be protection or wiring change.
2388 if (origpte
&& (opa
== pa
)) {
2390 * Wiring change, just update stats. We don't worry about
2391 * wiring PT pages as they remain resident as long as there
2392 * are valid mappings in them. Hence, if a user page is wired,
2393 * the PT page will be also.
2395 if (wired
&& ((origpte
& VPTE_WIRED
) == 0))
2396 atomic_add_long(&pmap
->pm_stats
.wired_count
, 1);
2397 else if (!wired
&& (origpte
& VPTE_WIRED
))
2398 atomic_add_long(&pmap
->pm_stats
.wired_count
, -1);
2400 if (origpte
& VPTE_MANAGED
) {
2402 KKASSERT(m
->flags
& PG_MAPPED
);
2403 KKASSERT(!(m
->flags
& (PG_FICTITIOUS
|PG_UNMANAGED
)));
2405 KKASSERT((m
->flags
& (PG_FICTITIOUS
|PG_UNMANAGED
)));
2411 * Bump the wire_count for the page table page.
2414 vm_page_wire_quick(mpte
);
2417 * Mapping has changed, invalidate old range and fall through to
2418 * handle validating new mapping.
2422 err
= pmap_remove_pte(pmap
, NULL
, origpte
, va
);
2424 panic("pmap_enter: pte vanished, va: 0x%lx", va
);
2428 * Enter on the PV list if part of our managed memory. Note that we
2429 * raise IPL while manipulating pv_table since pmap_enter can be
2430 * called at interrupt time.
2432 if (pmap_initialized
) {
2433 if ((m
->flags
& (PG_FICTITIOUS
|PG_UNMANAGED
)) == 0) {
2434 pv
= get_pv_entry();
2435 vm_page_spin_lock(m
);
2436 pmap_insert_entry(pmap
, va
, mpte
, m
, pv
);
2438 vm_page_flag_set(m
, PG_MAPPED
);
2439 vm_page_spin_unlock(m
);
2444 * Increment counters
2446 atomic_add_long(&pmap
->pm_stats
.resident_count
, 1);
2448 atomic_add_long(&pmap
->pm_stats
.wired_count
, 1);
2452 * Now validate mapping with desired protection/wiring.
2454 newpte
= (pt_entry_t
)(pa
| pte_prot(pmap
, prot
) | VPTE_V
| VPTE_U
);
2458 newpte
|= VPTE_WIRED
;
2459 // if (pmap != &kernel_pmap)
2462 if (newpte
& VPTE_RW
)
2463 vm_page_flag_set(m
, PG_WRITEABLE
);
2464 KKASSERT((newpte
& VPTE_MANAGED
) == 0 || (m
->flags
& PG_MAPPED
));
2466 origpte
= atomic_swap_long(pte
, newpte
);
2467 if (origpte
& VPTE_M
) {
2468 kprintf("pmap [M] race @ %016jx\n", va
);
2469 atomic_set_long(pte
, VPTE_M
);
2473 vm_page_wakeup(mpte
);
2474 vm_object_drop(pmap
->pm_pteobj
);
2478 * This code works like pmap_enter() but assumes VM_PROT_READ and not-wired.
2480 * Currently this routine may only be used on user pmaps, not kernel_pmap.
2485 pmap_enter_quick(pmap_t pmap
, vm_offset_t va
, vm_page_t m
)
2487 pmap_enter(pmap
, va
, m
, VM_PROT_READ
, 0, NULL
);
2491 * Make a temporary mapping for a physical address. This is only intended
2492 * to be used for panic dumps.
2494 * The caller is responsible for calling smp_invltlb().
2497 pmap_kenter_temporary(vm_paddr_t pa
, long i
)
2499 pmap_kenter_quick(crashdumpmap
+ (i
* PAGE_SIZE
), pa
);
2500 return ((void *)crashdumpmap
);
2503 #define MAX_INIT_PT (96)
2506 * This routine preloads the ptes for a given object into the specified pmap.
2507 * This eliminates the blast of soft faults on process startup and
2508 * immediately after an mmap.
2512 static int pmap_object_init_pt_callback(vm_page_t p
, void *data
);
2515 pmap_object_init_pt(pmap_t pmap
, vm_offset_t addr
, vm_prot_t prot
,
2516 vm_object_t object
, vm_pindex_t pindex
,
2517 vm_size_t size
, int limit
)
2519 struct rb_vm_page_scan_info info
;
2524 * We can't preinit if read access isn't set or there is no pmap
2527 if ((prot
& VM_PROT_READ
) == 0 || pmap
== NULL
|| object
== NULL
)
2531 * We can't preinit if the pmap is not the current pmap
2533 lp
= curthread
->td_lwp
;
2534 if (lp
== NULL
|| pmap
!= vmspace_pmap(lp
->lwp_vmspace
))
2538 * Misc additional checks
2540 psize
= x86_64_btop(size
);
2542 if ((object
->type
!= OBJT_VNODE
) ||
2543 ((limit
& MAP_PREFAULT_PARTIAL
) && (psize
> MAX_INIT_PT
) &&
2544 (object
->resident_page_count
> MAX_INIT_PT
))) {
2548 if (psize
+ pindex
> object
->size
) {
2549 if (object
->size
< pindex
)
2551 psize
= object
->size
- pindex
;
2558 * Use a red-black scan to traverse the requested range and load
2559 * any valid pages found into the pmap.
2561 * We cannot safely scan the object's memq unless we are in a
2562 * critical section since interrupts can remove pages from objects.
2564 info
.start_pindex
= pindex
;
2565 info
.end_pindex
= pindex
+ psize
- 1;
2571 vm_object_hold_shared(object
);
2572 vm_page_rb_tree_RB_SCAN(&object
->rb_memq
, rb_vm_page_scancmp
,
2573 pmap_object_init_pt_callback
, &info
);
2574 vm_object_drop(object
);
2579 pmap_object_init_pt_callback(vm_page_t p
, void *data
)
2581 struct rb_vm_page_scan_info
*info
= data
;
2582 vm_pindex_t rel_index
;
2584 * don't allow an madvise to blow away our really
2585 * free pages allocating pv entries.
2587 if ((info
->limit
& MAP_PREFAULT_MADVISE
) &&
2588 vmstats
.v_free_count
< vmstats
.v_free_reserved
) {
2593 * Ignore list markers and ignore pages we cannot instantly
2594 * busy (while holding the object token).
2596 if (p
->flags
& PG_MARKER
)
2598 if (vm_page_busy_try(p
, TRUE
))
2600 if (((p
->valid
& VM_PAGE_BITS_ALL
) == VM_PAGE_BITS_ALL
) &&
2601 (p
->flags
& PG_FICTITIOUS
) == 0) {
2602 if ((p
->queue
- p
->pc
) == PQ_CACHE
)
2603 vm_page_deactivate(p
);
2604 rel_index
= p
->pindex
- info
->start_pindex
;
2605 pmap_enter_quick(info
->pmap
,
2606 info
->addr
+ x86_64_ptob(rel_index
), p
);
2613 * Return TRUE if the pmap is in shape to trivially
2614 * pre-fault the specified address.
2616 * Returns FALSE if it would be non-trivial or if a
2617 * pte is already loaded into the slot.
2622 pmap_prefault_ok(pmap_t pmap
, vm_offset_t addr
)
2628 vm_object_hold(pmap
->pm_pteobj
);
2629 pde
= pmap_pde(pmap
, addr
);
2630 if (pde
== NULL
|| *pde
== 0) {
2633 pte
= pmap_pde_to_pte(pde
, addr
);
2634 ret
= (*pte
) ? 0 : 1;
2636 vm_object_drop(pmap
->pm_pteobj
);
2642 * Change the wiring attribute for a map/virtual-address pair.
2644 * The mapping must already exist in the pmap.
2645 * No other requirements.
2648 pmap_unwire(pmap_t pmap
, vm_offset_t va
)
2657 vm_object_hold(pmap
->pm_pteobj
);
2658 pte
= pmap_pte(pmap
, va
);
2660 if (pte
== NULL
|| (*pte
& VPTE_V
) == 0) {
2661 vm_object_drop(pmap
->pm_pteobj
);
2666 * Wiring is not a hardware characteristic so there is no need to
2667 * invalidate TLB. However, in an SMP environment we must use
2668 * a locked bus cycle to update the pte (if we are not using
2669 * the pmap_inval_*() API that is)... it's ok to do this for simple
2672 if (pmap_pte_w(pte
))
2673 atomic_add_long(&pmap
->pm_stats
.wired_count
, -1);
2674 /* XXX else return NULL so caller doesn't unwire m ? */
2675 atomic_clear_long(pte
, VPTE_WIRED
);
2677 pa
= *pte
& VPTE_FRAME
;
2678 m
= PHYS_TO_VM_PAGE(pa
); /* held by wired count */
2680 vm_object_drop(pmap
->pm_pteobj
);
2686 * Copy the range specified by src_addr/len
2687 * from the source map to the range dst_addr/len
2688 * in the destination map.
2690 * This routine is only advisory and need not do anything.
2693 pmap_copy(pmap_t dst_pmap
, pmap_t src_pmap
, vm_offset_t dst_addr
,
2694 vm_size_t len
, vm_offset_t src_addr
)
2697 * XXX BUGGY. Amoung other things srcmpte is assumed to remain
2698 * valid through blocking calls, and that's just not going to
2709 * Zero the specified physical page.
2711 * This function may be called from an interrupt and no locking is
2715 pmap_zero_page(vm_paddr_t phys
)
2717 vm_offset_t va
= PHYS_TO_DMAP(phys
);
2719 bzero((void *)va
, PAGE_SIZE
);
2725 * Zero part of a physical page by mapping it into memory and clearing
2726 * its contents with bzero.
2728 * off and size may not cover an area beyond a single hardware page.
2731 pmap_zero_page_area(vm_paddr_t phys
, int off
, int size
)
2733 vm_offset_t virt
= PHYS_TO_DMAP(phys
);
2735 bzero((char *)virt
+ off
, size
);
2741 * Copy the physical page from the source PA to the target PA.
2742 * This function may be called from an interrupt. No locking
2746 pmap_copy_page(vm_paddr_t src
, vm_paddr_t dst
)
2748 vm_offset_t src_virt
, dst_virt
;
2750 src_virt
= PHYS_TO_DMAP(src
);
2751 dst_virt
= PHYS_TO_DMAP(dst
);
2752 bcopy((void *)src_virt
, (void *)dst_virt
, PAGE_SIZE
);
2756 * pmap_copy_page_frag:
2758 * Copy the physical page from the source PA to the target PA.
2759 * This function may be called from an interrupt. No locking
2763 pmap_copy_page_frag(vm_paddr_t src
, vm_paddr_t dst
, size_t bytes
)
2765 vm_offset_t src_virt
, dst_virt
;
2767 src_virt
= PHYS_TO_DMAP(src
);
2768 dst_virt
= PHYS_TO_DMAP(dst
);
2769 bcopy((char *)src_virt
+ (src
& PAGE_MASK
),
2770 (char *)dst_virt
+ (dst
& PAGE_MASK
),
2775 * Returns true if the pmap's pv is one of the first 16 pvs linked to
2776 * from this page. This count may be changed upwards or downwards
2777 * in the future; it is only necessary that true be returned for a small
2778 * subset of pmaps for proper page aging.
2780 * No other requirements.
2783 pmap_page_exists_quick(pmap_t pmap
, vm_page_t m
)
2788 if (!pmap_initialized
|| (m
->flags
& PG_FICTITIOUS
))
2791 vm_page_spin_lock(m
);
2792 TAILQ_FOREACH(pv
, &m
->md
.pv_list
, pv_list
) {
2793 if (pv
->pv_pmap
== pmap
) {
2794 vm_page_spin_unlock(m
);
2801 vm_page_spin_unlock(m
);
2807 * Remove all pages from specified address space this aids process
2808 * exit speeds. Also, this code is special cased for current
2809 * process only, but can have the more generic (and slightly slower)
2810 * mode enabled. This is much faster than pmap_remove in the case
2811 * of running down an entire address space.
2813 * No other requirements.
2816 pmap_remove_pages(pmap_t pmap
, vm_offset_t sva
, vm_offset_t eva
)
2818 pmap_remove(pmap
, sva
, eva
);
2820 pt_entry_t
*pte
, tpte
;
2823 int save_generation
;
2825 if (pmap
->pm_pteobj
)
2826 vm_object_hold(pmap
->pm_pteobj
);
2828 pmap_invalidate_range(pmap
, sva
, eva
);
2830 for (pv
= TAILQ_FIRST(&pmap
->pm_pvlist
); pv
; pv
= npv
) {
2831 if (pv
->pv_va
>= eva
|| pv
->pv_va
< sva
) {
2832 npv
= TAILQ_NEXT(pv
, pv_plist
);
2836 KKASSERT(pmap
== pv
->pv_pmap
);
2838 pte
= pmap_pte(pmap
, pv
->pv_va
);
2841 * We cannot remove wired pages from a process' mapping
2844 if (*pte
& VPTE_WIRED
) {
2845 npv
= TAILQ_NEXT(pv
, pv_plist
);
2848 tpte
= pmap_inval_loadandclear(pte
, pmap
, pv
->pv_va
);
2850 m
= PHYS_TO_VM_PAGE(tpte
& VPTE_FRAME
);
2851 vm_page_spin_lock(m
);
2853 KASSERT(m
< &vm_page_array
[vm_page_array_size
],
2854 ("pmap_remove_pages: bad tpte %lx", tpte
));
2856 KKASSERT(pmap
->pm_stats
.resident_count
> 0);
2857 atomic_add_long(&pmap
->pm_stats
.resident_count
, -1);
2860 * Update the vm_page_t clean and reference bits.
2862 if (tpte
& VPTE_M
) {
2866 npv
= TAILQ_NEXT(pv
, pv_plist
);
2867 TAILQ_REMOVE(&pmap
->pm_pvlist
, pv
, pv_plist
);
2868 atomic_add_int(&pmap
->pm_generation
, 1);
2869 save_generation
= pmap
->pm_generation
;
2871 m
->md
.pv_list_count
--;
2872 TAILQ_REMOVE(&m
->md
.pv_list
, pv
, pv_list
);
2873 if (TAILQ_EMPTY(&m
->md
.pv_list
))
2874 vm_page_flag_clear(m
, PG_MAPPED
| PG_WRITEABLE
);
2875 vm_page_spin_unlock(m
);
2877 pmap_unuse_pt(pmap
, pv
->pv_va
, pv
->pv_ptem
);
2881 * Restart the scan if we blocked during the unuse or free
2882 * calls and other removals were made.
2884 if (save_generation
!= pmap
->pm_generation
) {
2885 kprintf("Warning: pmap_remove_pages race-A avoided\n");
2886 npv
= TAILQ_FIRST(&pmap
->pm_pvlist
);
2889 if (pmap
->pm_pteobj
)
2890 vm_object_drop(pmap
->pm_pteobj
);
2891 pmap_remove(pmap
, sva
, eva
);
2896 * pmap_testbit tests bits in active mappings of a VM page.
2899 pmap_testbit(vm_page_t m
, int bit
)
2904 if (!pmap_initialized
|| (m
->flags
& PG_FICTITIOUS
))
2907 if (TAILQ_FIRST(&m
->md
.pv_list
) == NULL
)
2910 vm_page_spin_lock(m
);
2911 TAILQ_FOREACH(pv
, &m
->md
.pv_list
, pv_list
) {
2913 * if the bit being tested is the modified bit, then
2914 * mark clean_map and ptes as never
2917 if (bit
& (VPTE_A
|VPTE_M
)) {
2918 if (!pmap_track_modified(pv
->pv_pmap
, pv
->pv_va
))
2922 #if defined(PMAP_DIAGNOSTIC)
2923 if (pv
->pv_pmap
== NULL
) {
2924 kprintf("Null pmap (tb) at va: 0x%lx\n", pv
->pv_va
);
2928 pte
= pmap_pte(pv
->pv_pmap
, pv
->pv_va
);
2930 vm_page_spin_unlock(m
);
2934 vm_page_spin_unlock(m
);
2939 * This routine is used to clear bits in ptes. Certain bits require special
2940 * handling, in particular (on virtual kernels) the VPTE_M (modify) bit.
2942 * This routine is only called with certain VPTE_* bit combinations.
2944 static __inline
void
2945 pmap_clearbit(vm_page_t m
, int bit
)
2952 vm_page_flag_clear(m
, PG_WRITEABLE
);
2953 if (!pmap_initialized
|| (m
->flags
& PG_FICTITIOUS
))
2957 * Loop over all current mappings setting/clearing as appropos If
2958 * setting RO do we need to clear the VAC?
2960 vm_page_spin_lock(m
);
2962 TAILQ_FOREACH(pv
, &m
->md
.pv_list
, pv_list
) {
2964 * don't write protect pager mappings
2966 if (bit
== VPTE_RW
) {
2967 if (!pmap_track_modified(pv
->pv_pmap
, pv
->pv_va
))
2971 #if defined(PMAP_DIAGNOSTIC)
2972 if (pv
->pv_pmap
== NULL
) {
2973 kprintf("Null pmap (cb) at va: 0x%lx\n", pv
->pv_va
);
2979 * Careful here. We can use a locked bus instruction to
2980 * clear VPTE_A or VPTE_M safely but we need to synchronize
2981 * with the target cpus when we mess with VPTE_RW.
2983 * On virtual kernels we must force a new fault-on-write
2984 * in the real kernel if we clear the Modify bit ourselves,
2985 * otherwise the real kernel will not get a new fault and
2986 * will never set our Modify bit again.
2988 pte
= pmap_pte(pv
->pv_pmap
, pv
->pv_va
);
2990 if (bit
== VPTE_RW
) {
2992 * We must also clear VPTE_M when clearing
2993 * VPTE_RW and synchronize its state to
2996 pbits
= pmap_clean_pte(pte
, pv
->pv_pmap
,
2998 if (pbits
& VPTE_M
) {
2999 if (pmap_track_modified(pv
->pv_pmap
,
3005 } else if (bit
== VPTE_M
) {
3007 * We must invalidate the real-kernel pte
3008 * when clearing VPTE_M bit to force the
3009 * real-kernel to take a new fault to re-set
3012 atomic_clear_long(pte
, VPTE_M
);
3013 if (*pte
& VPTE_RW
) {
3014 pmap_invalidate_range(pv
->pv_pmap
,
3016 pv
->pv_va
+ PAGE_SIZE
);
3018 } else if ((bit
& (VPTE_RW
|VPTE_M
)) ==
3021 * We've been asked to clear W & M, I guess
3022 * the caller doesn't want us to update
3023 * the dirty status of the VM page.
3025 pmap_clean_pte(pte
, pv
->pv_pmap
, pv
->pv_va
);
3026 panic("shouldn't be called");
3029 * We've been asked to clear bits that do
3030 * not interact with hardware.
3032 atomic_clear_long(pte
, bit
);
3036 vm_page_spin_unlock(m
);
3040 * Lower the permission for all mappings to a given page.
3042 * No other requirements.
3045 pmap_page_protect(vm_page_t m
, vm_prot_t prot
)
3047 /* JG NX support? */
3048 if ((prot
& VM_PROT_WRITE
) == 0) {
3049 if (prot
& (VM_PROT_READ
| VM_PROT_EXECUTE
)) {
3050 pmap_clearbit(m
, VPTE_RW
);
3058 pmap_phys_address(vm_pindex_t ppn
)
3060 return (x86_64_ptob(ppn
));
3064 * Return a count of reference bits for a page, clearing those bits.
3065 * It is not necessary for every reference bit to be cleared, but it
3066 * is necessary that 0 only be returned when there are truly no
3067 * reference bits set.
3069 * XXX: The exact number of bits to check and clear is a matter that
3070 * should be tested and standardized at some point in the future for
3071 * optimal aging of shared pages.
3073 * No other requirements.
3076 pmap_ts_referenced(vm_page_t m
)
3078 pv_entry_t pv
, pvf
, pvn
;
3082 if (!pmap_initialized
|| (m
->flags
& PG_FICTITIOUS
))
3085 vm_page_spin_lock(m
);
3086 if ((pv
= TAILQ_FIRST(&m
->md
.pv_list
)) != NULL
) {
3089 pvn
= TAILQ_NEXT(pv
, pv_list
);
3090 TAILQ_REMOVE(&m
->md
.pv_list
, pv
, pv_list
);
3091 TAILQ_INSERT_TAIL(&m
->md
.pv_list
, pv
, pv_list
);
3093 if (!pmap_track_modified(pv
->pv_pmap
, pv
->pv_va
))
3096 pte
= pmap_pte(pv
->pv_pmap
, pv
->pv_va
);
3098 if (pte
&& (*pte
& VPTE_A
)) {
3099 atomic_clear_long(pte
, VPTE_A
);
3105 } while ((pv
= pvn
) != NULL
&& pv
!= pvf
);
3107 vm_page_spin_unlock(m
);
3113 * Return whether or not the specified physical page was modified
3114 * in any physical maps.
3116 * No other requirements.
3119 pmap_is_modified(vm_page_t m
)
3123 res
= pmap_testbit(m
, VPTE_M
);
3129 * Clear the modify bits on the specified physical page.
3131 * No other requirements.
3134 pmap_clear_modify(vm_page_t m
)
3136 pmap_clearbit(m
, VPTE_M
);
3140 * Clear the reference bit on the specified physical page.
3142 * No other requirements.
3145 pmap_clear_reference(vm_page_t m
)
3147 pmap_clearbit(m
, VPTE_A
);
3151 * Miscellaneous support routines follow
3155 i386_protection_init(void)
3159 kp
= protection_codes
;
3160 for (prot
= 0; prot
< 8; prot
++) {
3161 if (prot
& VM_PROT_READ
)
3162 *kp
|= 0; /* if it's VALID is readeable */
3163 if (prot
& VM_PROT_WRITE
)
3165 if (prot
& VM_PROT_EXECUTE
)
3166 *kp
|= 0; /* if it's VALID is executable */
3172 * Sets the memory attribute for the specified page.
3175 pmap_page_set_memattr(vm_page_t m
, vm_memattr_t ma
)
3177 /* This is a vkernel, do nothing */
3181 * Change the PAT attribute on an existing kernel memory map. Caller
3182 * must ensure that the virtual memory in question is not accessed
3183 * during the adjustment.
3186 pmap_change_attr(vm_offset_t va
, vm_size_t count
, int mode
)
3188 /* This is a vkernel, do nothing */
3192 * Perform the pmap work for mincore
3194 * No other requirements.
3197 pmap_mincore(pmap_t pmap
, vm_offset_t addr
)
3199 pt_entry_t
*ptep
, pte
;
3203 vm_object_hold(pmap
->pm_pteobj
);
3204 ptep
= pmap_pte(pmap
, addr
);
3206 if (ptep
&& (pte
= *ptep
) != 0) {
3209 val
= MINCORE_INCORE
;
3210 if ((pte
& VPTE_MANAGED
) == 0)
3213 pa
= pte
& VPTE_FRAME
;
3215 m
= PHYS_TO_VM_PAGE(pa
);
3221 val
|= MINCORE_MODIFIED
|MINCORE_MODIFIED_OTHER
;
3223 * Modified by someone
3225 else if (m
->dirty
|| pmap_is_modified(m
))
3226 val
|= MINCORE_MODIFIED_OTHER
;
3231 val
|= MINCORE_REFERENCED
|MINCORE_REFERENCED_OTHER
;
3234 * Referenced by someone
3236 else if ((m
->flags
& PG_REFERENCED
) || pmap_ts_referenced(m
)) {
3237 val
|= MINCORE_REFERENCED_OTHER
;
3238 vm_page_flag_set(m
, PG_REFERENCED
);
3242 vm_object_drop(pmap
->pm_pteobj
);
3248 * Replace p->p_vmspace with a new one. If adjrefs is non-zero the new
3249 * vmspace will be ref'd and the old one will be deref'd.
3251 * Caller must hold vmspace->vm_map.token for oldvm and newvm
3254 pmap_replacevm(struct proc
*p
, struct vmspace
*newvm
, int adjrefs
)
3256 struct vmspace
*oldvm
;
3260 oldvm
= p
->p_vmspace
;
3261 if (oldvm
!= newvm
) {
3264 p
->p_vmspace
= newvm
;
3265 KKASSERT(p
->p_nthreads
== 1);
3266 lp
= RB_ROOT(&p
->p_lwp_tree
);
3267 pmap_setlwpvm(lp
, newvm
);
3275 * Set the vmspace for a LWP. The vmspace is almost universally set the
3276 * same as the process vmspace, but virtual kernels need to swap out contexts
3277 * on a per-lwp basis.
3280 pmap_setlwpvm(struct lwp
*lp
, struct vmspace
*newvm
)
3282 struct vmspace
*oldvm
;
3285 oldvm
= lp
->lwp_vmspace
;
3286 if (oldvm
!= newvm
) {
3288 lp
->lwp_vmspace
= newvm
;
3289 if (curthread
->td_lwp
== lp
) {
3290 pmap
= vmspace_pmap(newvm
);
3291 ATOMIC_CPUMASK_ORBIT(pmap
->pm_active
, mycpu
->gd_cpuid
);
3292 if (pmap
->pm_active_lock
& CPULOCK_EXCL
)
3293 pmap_interlock_wait(newvm
);
3294 #if defined(SWTCH_OPTIM_STATS)
3297 pmap
= vmspace_pmap(oldvm
);
3298 ATOMIC_CPUMASK_NANDBIT(pmap
->pm_active
,
3306 * The swtch code tried to switch in a heavy weight process whos pmap
3307 * is locked by another cpu. We have to wait for the lock to clear before
3308 * the pmap can be used.
3311 pmap_interlock_wait (struct vmspace
*vm
)
3313 pmap_t pmap
= vmspace_pmap(vm
);
3315 if (pmap
->pm_active_lock
& CPULOCK_EXCL
) {
3317 while (pmap
->pm_active_lock
& CPULOCK_EXCL
) {
3326 pmap_addr_hint(vm_object_t obj
, vm_offset_t addr
, vm_size_t size
)
3329 if ((obj
== NULL
) || (size
< NBPDR
) || (obj
->type
!= OBJT_DEVICE
)) {
3333 addr
= roundup2(addr
, NBPDR
);
3338 * Used by kmalloc/kfree, page already exists at va
3341 pmap_kvtom(vm_offset_t va
)
3345 KKASSERT(va
>= KvaStart
&& va
< KvaEnd
);
3347 return(PHYS_TO_VM_PAGE(*ptep
& PG_FRAME
));
3351 pmap_object_init(vm_object_t object
)
3357 pmap_object_free(vm_object_t object
)
3363 pmap_pgscan(struct pmap_pgscan_info
*pginfo
)
3365 pmap_t pmap
= pginfo
->pmap
;
3366 vm_offset_t sva
= pginfo
->beg_addr
;
3367 vm_offset_t eva
= pginfo
->end_addr
;
3368 vm_offset_t va_next
;
3369 pml4_entry_t
*pml4e
;
3371 pd_entry_t ptpaddr
, *pde
;
3376 vm_object_hold(pmap
->pm_pteobj
);
3378 for (; sva
< eva
; sva
= va_next
) {
3382 pml4e
= pmap_pml4e(pmap
, sva
);
3383 if ((*pml4e
& VPTE_V
) == 0) {
3384 va_next
= (sva
+ NBPML4
) & ~PML4MASK
;
3390 pdpe
= pmap_pml4e_to_pdpe(pml4e
, sva
);
3391 if ((*pdpe
& VPTE_V
) == 0) {
3392 va_next
= (sva
+ NBPDP
) & ~PDPMASK
;
3398 va_next
= (sva
+ NBPDR
) & ~PDRMASK
;
3402 pde
= pmap_pdpe_to_pde(pdpe
, sva
);
3407 * Check for large page (ignore).
3409 if ((ptpaddr
& VPTE_PS
) != 0) {
3411 pmap_clean_pde(pde
, pmap
, sva
);
3412 pmap
->pm_stats
.resident_count
-= NBPDR
/ PAGE_SIZE
;
3419 * Weed out invalid mappings. Note: we assume that the page
3420 * directory table is always allocated, and in kernel virtual.
3428 pt_m
= pmap_hold_pt_page(pde
, sva
);
3429 for (pte
= pmap_pde_to_pte(pde
, sva
); sva
!= va_next
; pte
++,
3435 if ((*pte
& VPTE_MANAGED
) == 0)
3438 m
= PHYS_TO_VM_PAGE(*pte
& VPTE_FRAME
);
3439 if (vm_page_busy_try(m
, TRUE
) == 0) {
3440 if (pginfo
->callback(pginfo
, sva
, m
) < 0)
3444 vm_page_unhold(pt_m
);
3446 vm_object_drop(pmap
->pm_pteobj
);