pmap.h revision 1.2.10.4 1 /* $NetBSD: pmap.h,v 1.2.10.4 2008/01/09 01:49:48 matt Exp $ */
2
3 /*
4 *
5 * Copyright (c) 1997 Charles D. Cranor and Washington University.
6 * All rights reserved.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
10 * are met:
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. All advertising materials mentioning features or use of this software
17 * must display the following acknowledgment:
18 * This product includes software developed by Charles D. Cranor and
19 * Washington University.
20 * 4. The name of the author may not be used to endorse or promote products
21 * derived from this software without specific prior written permission.
22 *
23 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
24 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
25 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
26 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
27 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
28 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
29 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
30 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
31 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
32 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
33 */
34
35 /*
36 * Copyright (c) 2001 Wasabi Systems, Inc.
37 * All rights reserved.
38 *
39 * Written by Frank van der Linden for Wasabi Systems, Inc.
40 *
41 * Redistribution and use in source and binary forms, with or without
42 * modification, are permitted provided that the following conditions
43 * are met:
44 * 1. Redistributions of source code must retain the above copyright
45 * notice, this list of conditions and the following disclaimer.
46 * 2. Redistributions in binary form must reproduce the above copyright
47 * notice, this list of conditions and the following disclaimer in the
48 * documentation and/or other materials provided with the distribution.
49 * 3. All advertising materials mentioning features or use of this software
50 * must display the following acknowledgement:
51 * This product includes software developed for the NetBSD Project by
52 * Wasabi Systems, Inc.
53 * 4. The name of Wasabi Systems, Inc. may not be used to endorse
54 * or promote products derived from this software without specific prior
55 * written permission.
56 *
57 * THIS SOFTWARE IS PROVIDED BY WASABI SYSTEMS, INC. ``AS IS'' AND
58 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
59 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
60 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL WASABI SYSTEMS, INC
61 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
62 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
63 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
64 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
65 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
66 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
67 * POSSIBILITY OF SUCH DAMAGE.
68 */
69
70 /*
71 * pmap.h: see pmap.c for the history of this pmap module.
72 */
73
74 #ifndef _X86_PMAP_H_
75 #define _X86_PMAP_H_
76
77 #define ptei(VA) (((VA_SIGN_POS(VA)) & L1_MASK) >> L1_SHIFT)
78
79 /*
80 * pl*_pi: index in the ptp page for a pde mapping a VA.
81 * (pl*_i below is the index in the virtual array of all pdes per level)
82 */
83 #define pl1_pi(VA) (((VA_SIGN_POS(VA)) & L1_MASK) >> L1_SHIFT)
84 #define pl2_pi(VA) (((VA_SIGN_POS(VA)) & L2_MASK) >> L2_SHIFT)
85 #define pl3_pi(VA) (((VA_SIGN_POS(VA)) & L3_MASK) >> L3_SHIFT)
86 #define pl4_pi(VA) (((VA_SIGN_POS(VA)) & L4_MASK) >> L4_SHIFT)
87
88 /*
89 * pl*_i: generate index into pde/pte arrays in virtual space
90 */
91 #define pl1_i(VA) (((VA_SIGN_POS(VA)) & L1_FRAME) >> L1_SHIFT)
92 #define pl2_i(VA) (((VA_SIGN_POS(VA)) & L2_FRAME) >> L2_SHIFT)
93 #define pl3_i(VA) (((VA_SIGN_POS(VA)) & L3_FRAME) >> L3_SHIFT)
94 #define pl4_i(VA) (((VA_SIGN_POS(VA)) & L4_FRAME) >> L4_SHIFT)
95 #define pl_i(va, lvl) \
96 (((VA_SIGN_POS(va)) & ptp_masks[(lvl)-1]) >> ptp_shifts[(lvl)-1])
97
98 #define pl_i_roundup(va, lvl) pl_i((va)+ ~ptp_masks[(lvl)-1], (lvl))
99
100 /*
101 * PTP macros:
102 * a PTP's index is the PD index of the PDE that points to it
103 * a PTP's offset is the byte-offset in the PTE space that this PTP is at
104 * a PTP's VA is the first VA mapped by that PTP
105 */
106
107 #define ptp_va2o(va, lvl) (pl_i(va, (lvl)+1) * PAGE_SIZE)
108
109 #if defined(_KERNEL)
110 /*
111 * pmap data structures: see pmap.c for details of locking.
112 */
113
114 struct pmap;
115 typedef struct pmap *pmap_t;
116
117 /*
118 * we maintain a list of all non-kernel pmaps
119 */
120
121 LIST_HEAD(pmap_head, pmap); /* struct pmap_head: head of a pmap list */
122
123 /*
124 * the pmap structure
125 *
126 * note that the pm_obj contains the simple_lock, the reference count,
127 * page list, and number of PTPs within the pmap.
128 *
129 * pm_lock is the same as the spinlock for vm object 0. Changes to
130 * the other objects may only be made if that lock has been taken
131 * (the other object locks are only used when uvm_pagealloc is called)
132 *
133 * XXX If we ever support processor numbers higher than 31, we'll have
134 * XXX to rethink the CPU mask.
135 */
136
137 struct pmap {
138 struct uvm_object pm_obj[PTP_LEVELS-1]; /* objects for lvl >= 1) */
139 #define pm_lock pm_obj[0].vmobjlock
140 LIST_ENTRY(pmap) pm_list; /* list (lck by pm_list lock) */
141 pd_entry_t *pm_pdir; /* VA of PD (lck by object lock) */
142 paddr_t pm_pdirpa; /* PA of PD (read-only after create) */
143 struct vm_page *pm_ptphint[PTP_LEVELS-1];
144 /* pointer to a PTP in our pmap */
145 struct pmap_statistics pm_stats; /* pmap stats (lck by object lock) */
146
147 #if !defined(__x86_64__)
148 vaddr_t pm_hiexec; /* highest executable mapping */
149 #endif /* !defined(__x86_64__) */
150 int pm_flags; /* see below */
151
152 union descriptor *pm_ldt; /* user-set LDT */
153 int pm_ldt_len; /* number of LDT entries */
154 int pm_ldt_sel; /* LDT selector */
155 uint32_t pm_cpus; /* mask of CPUs using pmap */
156 uint32_t pm_kernel_cpus; /* mask of CPUs using kernel part
157 of pmap */
158 };
159
160 /* pm_flags */
161 #define PMF_USER_LDT 0x01 /* pmap has user-set LDT */
162 #define PMF_USER_XPIN 0x02 /* pmap pdirpa is pinned (Xen) */
163 #define PMF_USER_RELOAD 0x04 /* reload user pmap on PTE unmap (Xen) */
164
165
166 /*
167 * for each managed physical page we maintain a list of <PMAP,VA>'s
168 * which it is mapped at. the list is headed by a pv_head structure.
169 * there is one pv_head per managed phys page (allocated at boot time).
170 * the pv_head structure points to a list of pv_entry structures (each
171 * describes one mapping).
172 */
173
174 struct pv_entry { /* locked by its list's pvh_lock */
175 SPLAY_ENTRY(pv_entry) pv_node; /* splay-tree node */
176 struct pmap *pv_pmap; /* the pmap */
177 vaddr_t pv_va; /* the virtual address */
178 struct vm_page *pv_ptp; /* the vm_page of the PTP */
179 };
180
181 /*
182 * global kernel variables
183 */
184
185 /* PDPpaddr: is the physical address of the kernel's PDP */
186 extern u_long PDPpaddr;
187
188 extern struct pmap kernel_pmap_store; /* kernel pmap */
189 extern int pmap_pg_g; /* do we support PG_G? */
190 extern long nkptp[PTP_LEVELS];
191
192 /*
193 * macros
194 */
195
196 #define pmap_kernel() (&kernel_pmap_store)
197 #define pmap_resident_count(pmap) ((pmap)->pm_stats.resident_count)
198 #define pmap_wired_count(pmap) ((pmap)->pm_stats.wired_count)
199
200 #define pmap_clear_modify(pg) pmap_clear_attrs(pg, PG_M)
201 #define pmap_clear_reference(pg) pmap_clear_attrs(pg, PG_U)
202 #define pmap_copy(DP,SP,D,L,S)
203 #define pmap_is_modified(pg) pmap_test_attrs(pg, PG_M)
204 #define pmap_is_referenced(pg) pmap_test_attrs(pg, PG_U)
205 #define pmap_move(DP,SP,D,L,S)
206 #define pmap_phys_address(ppn) x86_ptob(ppn)
207 #define pmap_valid_entry(E) ((E) & PG_V) /* is PDE or PTE valid? */
208
209
210 /*
211 * prototypes
212 */
213
214 void pmap_activate(struct lwp *);
215 void pmap_bootstrap(vaddr_t);
216 bool pmap_clear_attrs(struct vm_page *, unsigned);
217 void pmap_deactivate(struct lwp *);
218 void pmap_page_remove (struct vm_page *);
219 void pmap_remove(struct pmap *, vaddr_t, vaddr_t);
220 bool pmap_test_attrs(struct vm_page *, unsigned);
221 void pmap_write_protect(struct pmap *, vaddr_t, vaddr_t, vm_prot_t);
222 void pmap_load(void);
223 paddr_t pmap_init_tmp_pgtbl(paddr_t);
224
225 vaddr_t reserve_dumppages(vaddr_t); /* XXX: not a pmap fn */
226
227 void pmap_tlb_shootdown(pmap_t, vaddr_t, vaddr_t, pt_entry_t);
228 void pmap_tlb_shootwait(void);
229
230 #define PMAP_GROWKERNEL /* turn on pmap_growkernel interface */
231
232 /*
233 * Do idle page zero'ing uncached to avoid polluting the cache.
234 */
235 bool pmap_pageidlezero(paddr_t);
236 #define PMAP_PAGEIDLEZERO(pa) pmap_pageidlezero((pa))
237
238 /*
239 * inline functions
240 */
241
242 /*ARGSUSED*/
243 static __inline void
244 pmap_remove_all(struct pmap *pmap)
245 {
246 /* Nothing. */
247 }
248
249 /*
250 * pmap_update_pg: flush one page from the TLB (or flush the whole thing
251 * if hardware doesn't support one-page flushing)
252 */
253
254 __inline static void __unused
255 pmap_update_pg(vaddr_t va)
256 {
257 invlpg(va);
258 }
259
260 /*
261 * pmap_update_2pg: flush two pages from the TLB
262 */
263
264 __inline static void __unused
265 pmap_update_2pg(vaddr_t va, vaddr_t vb)
266 {
267 invlpg(va);
268 invlpg(vb);
269 }
270
271 /*
272 * pmap_page_protect: change the protection of all recorded mappings
273 * of a managed page
274 *
275 * => this function is a frontend for pmap_page_remove/pmap_clear_attrs
276 * => we only have to worry about making the page more protected.
277 * unprotecting a page is done on-demand at fault time.
278 */
279
280 __inline static void __unused
281 pmap_page_protect(struct vm_page *pg, vm_prot_t prot)
282 {
283 if ((prot & VM_PROT_WRITE) == 0) {
284 if (prot & (VM_PROT_READ|VM_PROT_EXECUTE)) {
285 (void) pmap_clear_attrs(pg, PG_RW);
286 } else {
287 pmap_page_remove(pg);
288 }
289 }
290 }
291
292 /*
293 * pmap_protect: change the protection of pages in a pmap
294 *
295 * => this function is a frontend for pmap_remove/pmap_write_protect
296 * => we only have to worry about making the page more protected.
297 * unprotecting a page is done on-demand at fault time.
298 */
299
300 __inline static void __unused
301 pmap_protect(struct pmap *pmap, vaddr_t sva, vaddr_t eva, vm_prot_t prot)
302 {
303 if ((prot & VM_PROT_WRITE) == 0) {
304 if (prot & (VM_PROT_READ|VM_PROT_EXECUTE)) {
305 pmap_write_protect(pmap, sva, eva, prot);
306 } else {
307 pmap_remove(pmap, sva, eva);
308 }
309 }
310 }
311
312 /*
313 * various address inlines
314 *
315 * vtopte: return a pointer to the PTE mapping a VA, works only for
316 * user and PT addresses
317 *
318 * kvtopte: return a pointer to the PTE mapping a kernel VA
319 */
320
321 #include <lib/libkern/libkern.h>
322
323 static __inline pt_entry_t * __unused
324 vtopte(vaddr_t va)
325 {
326
327 KASSERT(va < VM_MIN_KERNEL_ADDRESS);
328
329 return (PTE_BASE + pl1_i(va));
330 }
331
332 static __inline pt_entry_t * __unused
333 kvtopte(vaddr_t va)
334 {
335 pd_entry_t *pde;
336
337 KASSERT(va >= VM_MIN_KERNEL_ADDRESS);
338
339 pde = L2_BASE + pl2_i(va);
340 if (*pde & PG_PS)
341 return ((pt_entry_t *)pde);
342
343 return (PTE_BASE + pl1_i(va));
344 }
345
346 paddr_t vtophys(vaddr_t);
347 vaddr_t pmap_map(vaddr_t, paddr_t, paddr_t, vm_prot_t);
348 void pmap_cpu_init_early(struct cpu_info *);
349 void pmap_cpu_init_late(struct cpu_info *);
350 void sse2_zero_page(void *);
351 void sse2_copy_page(void *, void *);
352
353
354 #ifdef XEN
355
356 #define XPTE_MASK L1_FRAME
357 #define XPTE_SHIFT 9
358
359 /* PTE access inline fuctions */
360
361 /*
362 * Get the machine address of the pointed pte
363 * We use hardware MMU to get value so works only for levels 1-3
364 */
365
366 static __inline paddr_t
367 xpmap_ptetomach(pt_entry_t *pte)
368 {
369 pt_entry_t *up_pte;
370 vaddr_t va = (vaddr_t) pte;
371
372 va = ((va & XPTE_MASK) >> XPTE_SHIFT) | (vaddr_t) PTE_BASE;
373 up_pte = (pt_entry_t *) va;
374
375 return (paddr_t) (((*up_pte) & PG_FRAME) + (((vaddr_t) pte) & (~PG_FRAME & ~VA_SIGN_MASK)));
376 }
377
378 /*
379 * xpmap_update()
380 * Update an active pt entry with Xen
381 * Equivalent to *pte = npte
382 */
383
384 static __inline void
385 xpmap_update (pt_entry_t *pte, pt_entry_t npte)
386 {
387 int s = splvm();
388
389 xpq_queue_pte_update((pt_entry_t *) xpmap_ptetomach(pte), npte);
390 xpq_flush_queue();
391 splx(s);
392 }
393
394
395 /* Xen helpers to change bits of a pte */
396 #define XPMAP_UPDATE_DIRECT 1 /* Update direct map entry flags too */
397
398 /* pmap functions with machine addresses */
399 void pmap_kenter_ma(vaddr_t, paddr_t, vm_prot_t);
400 int pmap_enter_ma(struct pmap *, vaddr_t, paddr_t, paddr_t,
401 vm_prot_t, int, int);
402 bool pmap_extract_ma(pmap_t, vaddr_t, paddr_t *);
403 paddr_t vtomach(vaddr_t);
404
405 #endif /* XEN */
406
407 /*
408 * Hooks for the pool allocator.
409 */
410 #define POOL_VTOPHYS(va) vtophys((vaddr_t) (va))
411
412 /*
413 * TLB shootdown mailbox.
414 */
415
416 struct pmap_mbox {
417 volatile void *mb_pointer;
418 volatile uintptr_t mb_addr1;
419 volatile uintptr_t mb_addr2;
420 volatile uintptr_t mb_head;
421 volatile uintptr_t mb_tail;
422 volatile uintptr_t mb_global;
423 };
424
425 #endif /* _KERNEL */
426
427 #endif /* _X86_PMAP_H_ */
428