2 * Copyright (c) 1991 Regents of the University of California.
5 * This code is derived from software contributed to Berkeley by
6 * the Systems Programming Group of the University of Utah Computer
7 * Science Department and William Jolitz of UUNET Technologies Inc.
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions
12 * 1. Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
14 * 2. Redistributions in binary form must reproduce the above copyright
15 * notice, this list of conditions and the following disclaimer in the
16 * documentation and/or other materials provided with the distribution.
17 * 3. All advertising materials mentioning features or use of this software
18 * must display the following acknowledgement:
19 * This product includes software developed by the University of
20 * California, Berkeley and its contributors.
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 * Derived from hp300 version by Mike Hibler, this version by William
38 * Jolitz uses a recursive map [a pde points to the page directory] to
39 * map the page tables using the pagetables themselves. This is done to
40 * reduce the impact on kernel virtual memory for lots of sparse address
41 * space, and to reduce the cost of memory to each process.
43 * from: hp300: @(#)pmap.h 7.2 (Berkeley) 12/16/90
44 * from: @(#)pmap.h 7.4 (Berkeley) 5/12/91
45 * $FreeBSD: src/sys/i386/include/pmap.h,v 1.65.2.3 2001/10/03 07:15:37 peter Exp $
46 * $DragonFly: src/sys/cpu/i386/include/pmap.h,v 1.6 2003/11/03 22:50:15 dillon Exp $
49 #ifndef _MACHINE_PMAP_H_
50 #define _MACHINE_PMAP_H_
53 * Page-directory and page-table entires follow this format, with a few
54 * of the fields not present here and there, depending on a lot of things.
56 /* ---- Intel Nomenclature ---- */
57 #define PG_V 0x001 /* P Valid */
58 #define PG_RW 0x002 /* R/W Read/Write */
59 #define PG_U 0x004 /* U/S User/Supervisor */
60 #define PG_NC_PWT 0x008 /* PWT Write through */
61 #define PG_NC_PCD 0x010 /* PCD Cache disable */
62 #define PG_A 0x020 /* A Accessed */
63 #define PG_M 0x040 /* D Dirty */
64 #define PG_PS 0x080 /* PS Page size (0=4k,1=4M) */
65 #define PG_G 0x100 /* G Global */
66 #define PG_AVAIL1 0x200 /* / Available for system */
67 #define PG_AVAIL2 0x400 /* < programmers use */
68 #define PG_AVAIL3 0x800 /* \ */
71 /* Our various interpretations of the above */
72 #define PG_W PG_AVAIL1 /* "Wired" pseudoflag */
73 #define PG_MANAGED PG_AVAIL2
74 #define PG_FRAME (~((vm_paddr_t)PAGE_MASK))
75 #define PG_PROT (PG_RW|PG_U) /* all protection bits . */
76 #define PG_N (PG_NC_PWT|PG_NC_PCD) /* Non-cacheable */
79 * Page Protection Exception bits
82 #define PGEX_P 0x01 /* Protection violation vs. not present */
83 #define PGEX_W 0x02 /* during a Write cycle */
84 #define PGEX_U 0x04 /* access from User mode (UPL) */
87 * Size of Kernel address space. This is the number of page table pages
88 * (4MB each) to use for the kernel. 256 pages == 1 Gigabyte.
89 * This **MUST** be a multiple of 4 (eg: 252, 256, 260, etc).
98 #define VADDR(pdi, pti) ((vm_offset_t)(((pdi)<<PDRSHIFT)|((pti)<<PAGE_SHIFT)))
101 #define NKPT 30 /* actual number of kernel page tables */
104 #define NKPDE (KVA_PAGES - 2) /* addressable number of page tables/pde's */
106 #if NKPDE > KVA_PAGES - 2
107 #error "Maximum NKPDE is KVA_PAGES - 2"
111 * The *PTDI values control the layout of virtual memory
113 * XXX This works for now, but I am not real happy with it, I'll fix it
114 * right after I fix locore.s and the magic 28K hole
116 * SMP_PRIVPAGES: The per-cpu address space is 0xff80000 -> 0xffbfffff
118 #define APTDPTDI (NPDEPG-1) /* alt ptd entry that points to APTD */
119 #define MPPTDI (APTDPTDI-1) /* per cpu ptd entry */
120 #define KPTDI (MPPTDI-NKPDE) /* start of kernel virtual pde's */
121 #define PTDPTDI (KPTDI-1) /* ptd entry that points to ptd! */
122 #define UMAXPTDI (PTDPTDI-1) /* ptd entry for user space end */
123 #define UMAXPTEOFF (NPTEPG) /* pte entry for user space end */
126 * XXX doesn't really belong here I guess...
128 #define ISA_HOLE_START 0xa0000
129 #define ISA_HOLE_LENGTH (0x100000-ISA_HOLE_START)
133 #include <sys/queue.h>
136 * Address of current and alternate address space page table maps
140 extern pt_entry_t PTmap[], APTmap[], Upte;
141 extern pd_entry_t PTD[], APTD[], PTDpde, APTDpde, Upde;
143 extern pd_entry_t IdlePTD; /* physical address of "Idle" state directory */
148 * virtual address to page table entry and
149 * to physical address. Likewise for alternate address space.
150 * Note: these work recursively, thus vtopte of a pte will give
151 * the corresponding pde that in turn maps it.
153 #define vtopte(va) (PTmap + i386_btop(va))
155 #define avtopte(va) (APTmap + i386_btop(va))
158 * Routine: pmap_kextract
160 * Extract the physical page address associated
161 * kernel virtual address.
163 static __inline vm_paddr_t
164 pmap_kextract(vm_offset_t va)
168 if ((pa = (vm_offset_t) PTD[va >> PDRSHIFT]) & PG_PS) {
169 pa = (pa & ~(NBPDR - 1)) | (va & (NBPDR - 1));
171 pa = *(vm_offset_t *)vtopte(va);
172 pa = (pa & PG_FRAME) | (va & PAGE_MASK);
180 #define vtophys(va) pmap_kextract(((vm_offset_t)(va)))
181 #define vtophys_pte(va) ((pt_entry_t)pmap_kextract(((vm_offset_t)(va))))
183 #define avtophys(va) (((vm_offset_t) (*avtopte(va))&PG_FRAME) | ((vm_offset_t)(va) & PAGE_MASK))
194 TAILQ_HEAD(,pv_entry) pv_list;
198 pd_entry_t *pm_pdir; /* KVA of page directory */
199 vm_object_t pm_pteobj; /* Container for pte's */
200 TAILQ_HEAD(,pv_entry) pm_pvlist; /* list of mappings in pmap */
201 int pm_count; /* reference count */
202 int pm_active; /* active on cpus */
203 struct pmap_statistics pm_stats; /* pmap statistics */
204 struct vm_page *pm_ptphint; /* pmap ptp hint */
207 #define pmap_resident_count(pmap) (pmap)->pm_stats.resident_count
209 typedef struct pmap *pmap_t;
212 extern pmap_t kernel_pmap;
216 * For each vm_page_t, there is a list of all currently valid virtual
217 * mappings of that page. An entry is a pv_entry_t, the list is pv_table.
219 typedef struct pv_entry {
220 pmap_t pv_pmap; /* pmap where mapping lies */
221 vm_offset_t pv_va; /* virtual address for mapping */
222 TAILQ_ENTRY(pv_entry) pv_list;
223 TAILQ_ENTRY(pv_entry) pv_plist;
224 vm_page_t pv_ptem; /* VM page for pte */
227 #define PV_ENTRY_NULL ((pv_entry_t) 0)
229 #define PV_CI 0x01 /* all entries must be cache inhibited */
230 #define PV_PTPAGE 0x02 /* entry maps a page table page */
235 #define PPRO_VMTRRphysBase0 0x200
236 #define PPRO_VMTRRphysMask0 0x201
238 u_int64_t base, mask;
240 extern struct ppro_vmtrr PPro_vmtrr[NPPROVMTRR];
242 extern caddr_t CADDR1;
243 extern pt_entry_t *CMAP1;
244 extern vm_paddr_t avail_end;
245 extern vm_paddr_t avail_start;
246 extern vm_offset_t clean_eva;
247 extern vm_offset_t clean_sva;
248 extern vm_paddr_t phys_avail[];
249 extern char *ptvmmap; /* poor name! */
250 extern vm_offset_t virtual_avail;
251 extern vm_offset_t virtual_end;
253 void pmap_bootstrap ( vm_paddr_t, vm_paddr_t);
254 pmap_t pmap_kernel (void);
255 void *pmap_mapdev (vm_paddr_t, vm_size_t);
256 void pmap_unmapdev (vm_offset_t, vm_size_t);
257 unsigned *pmap_pte (pmap_t, vm_offset_t) __pure2;
258 vm_page_t pmap_use_pt (pmap_t, vm_offset_t);
260 void pmap_set_opt (void);
267 #endif /* !_MACHINE_PMAP_H_ */