1 /*
2 * Copyright (c) 1991 Regents of the University of California.
3 * All rights reserved.
4 *
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.
8 *
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions
11 * are met:
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.
24 *
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
35 * SUCH DAMAGE.
36 *
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.
42 *
43 * from: hp300: @(#)pmap.h 7.2 (Berkeley) 12/16/90
44 * from: @(#)pmap.h 7.4 (Berkeley) 5/12/91
45 * $FreeBSD$
46 */
47
48 #ifndef _MACHINE_PMAP_H_
49 #define _MACHINE_PMAP_H_
50
51 /*
52 * Page-directory and page-table entires follow this format, with a few
53 * of the fields not present here and there, depending on a lot of things.
54 */
55 /* ---- Intel Nomenclature ---- */
56 #define PG_V 0x001 /* P Valid */
57 #define PG_RW 0x002 /* R/W Read/Write */
58 #define PG_U 0x004 /* U/S User/Supervisor */
59 #define PG_NC_PWT 0x008 /* PWT Write through */
60 #define PG_NC_PCD 0x010 /* PCD Cache disable */
61 #define PG_A 0x020 /* A Accessed */
62 #define PG_M 0x040 /* D Dirty */
63 #define PG_PS 0x080 /* PS Page size (0=4k,1=4M) */
64 #define PG_G 0x100 /* G Global */
65 #define PG_AVAIL1 0x200 /* / Available for system */
66 #define PG_AVAIL2 0x400 /* < programmers use */
67 #define PG_AVAIL3 0x800 /* \ */
68
69
70 /* Our various interpretations of the above */
71 #define PG_W PG_AVAIL1 /* "Wired" pseudoflag */
72 #define PG_MANAGED PG_AVAIL2
73 #define PG_FRAME (~((vm_paddr_t)PAGE_MASK))
74 #define PG_PROT (PG_RW|PG_U) /* all protection bits . */
75 #define PG_N (PG_NC_PWT|PG_NC_PCD) /* Non-cacheable */
76
77 /*
78 * Page Protection Exception bits
79 */
80
81 #define PGEX_P 0x01 /* Protection violation vs. not present */
82 #define PGEX_W 0x02 /* during a Write cycle */
83 #define PGEX_U 0x04 /* access from User mode (UPL) */
84
85 /*
86 * Size of Kernel address space. This is the number of page table pages
87 * (4MB each) to use for the kernel. 256 pages == 1 Gigabyte.
88 * This **MUST** be a multiple of 4 (eg: 252, 256, 260, etc).
89 */
90 #ifndef KVA_PAGES
91 #define KVA_PAGES (1 << (30 - PDRSHIFT))
92 #endif
93
94 /*
95 * Pte related macros
96 */
97 #define VADDR(pdi, pti) ((vm_offset_t)(((pdi)<<PDRSHIFT)|((pti)<<PAGE_SHIFT)))
98
99 #ifndef NKPT
100 #ifdef PAE
101 #define NKPT 120 /* actual number of kernel page tables */
102 #else
103 #define NKPT 30 /* actual number of kernel page tables */
104 #endif
105 #endif
106 #ifndef NKPDE
107 #ifdef SMP
108 #define NKPDE (KVA_PAGES - 1) /* addressable number of page tables/pde's */
109 #else
110 #define NKPDE (KVA_PAGES) /* addressable number of page tables/pde's */
111 #endif
112 #endif
113
114 /*
115 * The *PTDI values control the layout of virtual memory
116 *
117 * XXX This works for now, but I am not real happy with it, I'll fix it
118 * right after I fix locore.s and the magic 28K hole
119 *
120 * SMP_PRIVPAGES: The per-cpu address space is 0xff80000 -> 0xffbfffff
121 */
122 #ifdef SMP
123 #define MPPTDI (NPDEPTD-1) /* per cpu ptd entry */
124 #define KPTDI (MPPTDI-NKPDE) /* start of kernel virtual pde's */
125 #else
126 #define KPTDI (NPDEPTD-NKPDE) /* start of kernel virtual pde's */
127 #endif /* SMP */
128 #define PTDPTDI (KPTDI-NPGPTD) /* ptd entry that points to ptd! */
129
130 /*
131 * XXX doesn't really belong here I guess...
132 */
133 #define ISA_HOLE_START 0xa0000
134 #define ISA_HOLE_LENGTH (0x100000-ISA_HOLE_START)
135
136 #ifndef LOCORE
137
138 #include <sys/queue.h>
139
140 #ifdef PAE
141 typedef u_int64_t pdpt_entry_t;
142 typedef u_int64_t pd_entry_t;
143 typedef u_int64_t pt_entry_t;
144 #define PTESHIFT 3
145 #define PDESHIFT 3
146 #else
147 typedef u_int32_t pd_entry_t;
148 typedef u_int32_t pt_entry_t;
149 #define PTESHIFT 2
150 #define PDESHIFT 2
151 #endif
152
153 #define PDESIZE sizeof(pd_entry_t) /* for assembly files */
154 #define PTESIZE sizeof(pt_entry_t) /* for assembly files */
155
156 /*
157 * Address of current and alternate address space page table maps
158 * and directories.
159 */
160 #ifdef _KERNEL
161 extern pt_entry_t PTmap[];
162 extern pd_entry_t PTD[], PTDpde[];
163
164 extern u_int32_t IdlePTD; /* physical address of "Idle" state directory */
165 #ifdef PAE
166 extern pdpt_entry_t IdlePDPT[];
167 #endif
168 #endif
169
170 #ifdef _KERNEL
171 /*
172 * virtual address to page table entry and
173 * to physical address. Likewise for alternate address space.
174 * Note: these work recursively, thus vtopte of a pte will give
175 * the corresponding pde that in turn maps it.
176 */
177 #define vtopte(va) (PTmap + i386_btop(va))
178
179 /*
180 * Routine: pmap_kextract
181 * Function:
182 * Extract the physical page address associated
183 * kernel virtual address.
184 */
185 static __inline vm_paddr_t
186 pmap_kextract(vm_offset_t va)
187 {
188 vm_paddr_t pa;
189
190 if ((pa = PTD[va >> PDRSHIFT]) & PG_PS) {
191 pa = (pa & ~(NBPDR - 1)) | (va & (NBPDR - 1));
192 } else {
193 pa = *vtopte(va);
194 pa = (pa & PG_FRAME) | (va & PAGE_MASK);
195 }
196 return pa;
197 }
198
199 #define vtophys(va) pmap_kextract((vm_offset_t) (va))
200
201 #endif
202
203 /*
204 * Pmap stuff
205 */
206 struct pv_entry;
207
208 struct md_page {
209 int pv_list_count;
210 TAILQ_HEAD(,pv_entry) pv_list;
211 };
212
213 struct pmap {
214 pd_entry_t *pm_pdir; /* KVA of page directory */
215 vm_object_t pm_pteobj; /* Container for pte's */
216 TAILQ_HEAD(,pv_entry) pm_pvlist; /* list of mappings in pmap */
217 int pm_active; /* active on cpus */
218 struct pmap_statistics pm_stats; /* pmap statistics */
219 struct vm_page *pm_ptphint; /* pmap ptp hint */
220 #ifdef PAE
221 pdpt_entry_t *pm_pdpt; /* KVA of page dir ptr table */
222 #else
223 void *pm_pdpt_dontuse;
224 #endif
225 };
226
227 #define pmap_resident_count(pmap) (pmap)->pm_stats.resident_count
228
229 typedef struct pmap *pmap_t;
230
231 #ifdef _KERNEL
232 extern pmap_t kernel_pmap;
233 #endif
234
235 /*
236 * For each vm_page_t, there is a list of all currently valid virtual
237 * mappings of that page. An entry is a pv_entry_t, the list is pv_table.
238 */
239 typedef struct pv_entry {
240 pmap_t pv_pmap; /* pmap where mapping lies */
241 vm_offset_t pv_va; /* virtual address for mapping */
242 TAILQ_ENTRY(pv_entry) pv_list;
243 TAILQ_ENTRY(pv_entry) pv_plist;
244 vm_page_t pv_ptem; /* VM page for pte */
245 } *pv_entry_t;
246
247 #ifdef _KERNEL
248
249 #define NPPROVMTRR 8
250 #define PPRO_VMTRRphysBase0 0x200
251 #define PPRO_VMTRRphysMask0 0x201
252 struct ppro_vmtrr {
253 u_int64_t base, mask;
254 };
255 extern struct ppro_vmtrr PPro_vmtrr[NPPROVMTRR];
256
257 extern vm_paddr_t avail_end;
258 extern vm_paddr_t avail_start;
259 extern vm_offset_t clean_eva;
260 extern vm_offset_t clean_sva;
261 extern vm_paddr_t phys_avail[];
262 extern char *ptvmmap; /* poor name! */
263 extern vm_offset_t virtual_avail;
264 extern vm_offset_t virtual_end;
265
266 void pmap_bootstrap __P((vm_paddr_t, vm_paddr_t));
267 pmap_t pmap_kernel __P((void));
268 void *pmap_mapdev __P((vm_paddr_t, vm_size_t));
269 void pmap_unmapdev __P((vm_offset_t, vm_size_t));
270 pt_entry_t *pmap_pte __P((pmap_t, vm_offset_t));
271 #ifdef SMP
272 void pmap_set_opt __P((void));
273 #endif
274
275 #endif /* _KERNEL */
276
277 #endif /* !LOCORE */
278
279 #endif /* !_MACHINE_PMAP_H_ */
Cache object: 735f6aa8b426504ea290799c3122651b
|