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 * 4. Neither the name of the University nor the names of its contributors 18 * may be used to endorse or promote products derived from this software 19 * without specific prior written permission. 20 * 21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 31 * SUCH DAMAGE. 32 * 33 * Derived from hp300 version by Mike Hibler, this version by William 34 * Jolitz uses a recursive map [a pde points to the page directory] to 35 * map the page tables using the pagetables themselves. This is done to 36 * reduce the impact on kernel virtual memory for lots of sparse address 37 * space, and to reduce the cost of memory to each process. 38 * 39 * from: hp300: @(#)pmap.h 7.2 (Berkeley) 12/16/90 40 * from: @(#)pmap.h 7.4 (Berkeley) 5/12/91 41 * $FreeBSD$ 42 */ 43 44 #ifndef _MACHINE_PMAP_H_ 45 #define _MACHINE_PMAP_H_ 46 47 /* 48 * Page-directory and page-table entires follow this format, with a few 49 * of the fields not present here and there, depending on a lot of things. 50 */ 51 /* ---- Intel Nomenclature ---- */ 52 #define PG_V 0x001 /* P Valid */ 53 #define PG_RW 0x002 /* R/W Read/Write */ 54 #define PG_U 0x004 /* U/S User/Supervisor */ 55 #define PG_NC_PWT 0x008 /* PWT Write through */ 56 #define PG_NC_PCD 0x010 /* PCD Cache disable */ 57 #define PG_A 0x020 /* A Accessed */ 58 #define PG_M 0x040 /* D Dirty */ 59 #define PG_PS 0x080 /* PS Page size (0=4k,1=4M) */ 60 #define PG_G 0x100 /* G Global */ 61 #define PG_AVAIL1 0x200 /* / Available for system */ 62 #define PG_AVAIL2 0x400 /* < programmers use */ 63 #define PG_AVAIL3 0x800 /* \ */ 64 65 66 /* Our various interpretations of the above */ 67 #define PG_W PG_AVAIL1 /* "Wired" pseudoflag */ 68 #define PG_MANAGED PG_AVAIL2 69 #define PG_FRAME (~((vm_paddr_t)PAGE_MASK)) 70 #define PG_PROT (PG_RW|PG_U) /* all protection bits . */ 71 #define PG_N (PG_NC_PWT|PG_NC_PCD) /* Non-cacheable */ 72 73 /* 74 * Page Protection Exception bits 75 */ 76 77 #define PGEX_P 0x01 /* Protection violation vs. not present */ 78 #define PGEX_W 0x02 /* during a Write cycle */ 79 #define PGEX_U 0x04 /* access from User mode (UPL) */ 80 81 /* 82 * Size of Kernel address space. This is the number of page table pages 83 * (4MB each) to use for the kernel. 256 pages == 1 Gigabyte. 84 * This **MUST** be a multiple of 4 (eg: 252, 256, 260, etc). 85 */ 86 #ifndef KVA_PAGES 87 #ifdef PAE 88 #define KVA_PAGES 512 89 #else 90 #define KVA_PAGES 256 91 #endif 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) /* number of page tables/pde's */ 109 #else 110 #define NKPDE (KVA_PAGES) /* 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 142 typedef uint64_t pdpt_entry_t; 143 typedef uint64_t pd_entry_t; 144 typedef uint64_t pt_entry_t; 145 146 #define PTESHIFT (3) 147 #define PDESHIFT (3) 148 149 #else 150 151 typedef uint32_t pd_entry_t; 152 typedef uint32_t pt_entry_t; 153 154 #define PTESHIFT (2) 155 #define PDESHIFT (2) 156 157 #endif 158 159 /* 160 * Address of current and alternate address space page table maps 161 * and directories. 162 */ 163 #ifdef _KERNEL 164 extern pt_entry_t PTmap[]; 165 extern pd_entry_t PTD[]; 166 extern pd_entry_t PTDpde[]; 167 168 #ifdef PAE 169 extern pdpt_entry_t *IdlePDPT; 170 #endif 171 extern pd_entry_t *IdlePTD; /* physical address of "Idle" state directory */ 172 #endif 173 174 #ifdef _KERNEL 175 /* 176 * virtual address to page table entry and 177 * to physical address. Likewise for alternate address space. 178 * Note: these work recursively, thus vtopte of a pte will give 179 * the corresponding pde that in turn maps it. 180 */ 181 #define vtopte(va) (PTmap + i386_btop(va)) 182 183 /* 184 * Routine: pmap_kextract 185 * Function: 186 * Extract the physical page address associated 187 * kernel virtual address. 188 */ 189 static __inline vm_paddr_t 190 pmap_kextract(vm_offset_t va) 191 { 192 vm_paddr_t pa; 193 194 if ((pa = PTD[va >> PDRSHIFT]) & PG_PS) { 195 pa = (pa & ~(NBPDR - 1)) | (va & (NBPDR - 1)); 196 } else { 197 pa = *vtopte(va); 198 pa = (pa & PG_FRAME) | (va & PAGE_MASK); 199 } 200 return pa; 201 } 202 203 #define vtophys(va) pmap_kextract(((vm_offset_t) (va))) 204 205 #ifdef PAE 206 207 static __inline pt_entry_t 208 pte_load(pt_entry_t *ptep) 209 { 210 pt_entry_t r; 211 212 __asm __volatile( 213 "lock; cmpxchg8b %1" 214 : "=A" (r) 215 : "m" (*ptep), "a" (0), "d" (0), "b" (0), "c" (0)); 216 return (r); 217 } 218 219 static __inline pt_entry_t 220 pte_load_store(pt_entry_t *ptep, pt_entry_t v) 221 { 222 pt_entry_t r; 223 224 r = *ptep; 225 __asm __volatile( 226 "1:\n" 227 "\tlock; cmpxchg8b %1\n" 228 "\tjnz 1b" 229 : "+A" (r) 230 : "m" (*ptep), "b" ((uint32_t)v), "c" ((uint32_t)(v >> 32))); 231 return (r); 232 } 233 234 #define pte_load_clear(ptep) pte_load_store((ptep), (pt_entry_t)0ULL) 235 236 #else /* PAE */ 237 238 static __inline pt_entry_t 239 pte_load(pt_entry_t *ptep) 240 { 241 pt_entry_t r; 242 243 r = *ptep; 244 return (r); 245 } 246 247 static __inline pt_entry_t 248 pte_load_store(pt_entry_t *ptep, pt_entry_t pte) 249 { 250 pt_entry_t r; 251 252 r = *ptep; 253 *ptep = pte; 254 return (r); 255 } 256 257 #define pte_load_clear(pte) atomic_readandclear_int(pte) 258 259 #endif /* PAE */ 260 261 #define pte_clear(ptep) pte_load_store((ptep), (pt_entry_t)0ULL) 262 #define pte_store(ptep, pte) pte_load_store((ptep), (pt_entry_t)pte) 263 264 #define pde_store(pdep, pde) pte_store((pdep), (pde)) 265 266 #endif /* _KERNEL */ 267 268 /* 269 * Pmap stuff 270 */ 271 struct pv_entry; 272 273 struct md_page { 274 int pv_list_count; 275 TAILQ_HEAD(,pv_entry) pv_list; 276 }; 277 278 struct pmap { 279 pd_entry_t *pm_pdir; /* KVA of page directory */ 280 TAILQ_HEAD(,pv_entry) pm_pvlist; /* list of mappings in pmap */ 281 u_int pm_active; /* active on cpus */ 282 struct pmap_statistics pm_stats; /* pmap statistics */ 283 LIST_ENTRY(pmap) pm_list; /* List of all pmaps */ 284 #ifdef PAE 285 pdpt_entry_t *pm_pdpt; /* KVA of page director pointer 286 table */ 287 #endif 288 }; 289 290 #define pmap_page_is_mapped(m) (!TAILQ_EMPTY(&(m)->md.pv_list)) 291 292 typedef struct pmap *pmap_t; 293 294 #ifdef _KERNEL 295 extern struct pmap kernel_pmap_store; 296 #define kernel_pmap (&kernel_pmap_store) 297 #endif 298 299 /* 300 * For each vm_page_t, there is a list of all currently valid virtual 301 * mappings of that page. An entry is a pv_entry_t, the list is pv_table. 302 */ 303 typedef struct pv_entry { 304 pmap_t pv_pmap; /* pmap where mapping lies */ 305 vm_offset_t pv_va; /* virtual address for mapping */ 306 TAILQ_ENTRY(pv_entry) pv_list; 307 TAILQ_ENTRY(pv_entry) pv_plist; 308 vm_page_t pv_ptem; /* VM page for pte */ 309 } *pv_entry_t; 310 311 #ifdef _KERNEL 312 313 #define NPPROVMTRR 8 314 #define PPRO_VMTRRphysBase0 0x200 315 #define PPRO_VMTRRphysMask0 0x201 316 struct ppro_vmtrr { 317 u_int64_t base, mask; 318 }; 319 extern struct ppro_vmtrr PPro_vmtrr[NPPROVMTRR]; 320 321 extern caddr_t CADDR1; 322 extern pt_entry_t *CMAP1; 323 extern vm_paddr_t avail_end; 324 extern vm_paddr_t phys_avail[]; 325 extern int pseflag; 326 extern int pgeflag; 327 extern char *ptvmmap; /* poor name! */ 328 extern vm_offset_t virtual_avail; 329 extern vm_offset_t virtual_end; 330 331 void pmap_bootstrap(vm_paddr_t, vm_paddr_t); 332 void pmap_kenter(vm_offset_t va, vm_paddr_t pa); 333 void *pmap_kenter_temporary(vm_paddr_t pa, int i); 334 void pmap_kremove(vm_offset_t); 335 void *pmap_mapdev(vm_paddr_t, vm_size_t); 336 void pmap_unmapdev(vm_offset_t, vm_size_t); 337 pt_entry_t *pmap_pte(pmap_t, vm_offset_t) __pure2; 338 void pmap_set_pg(void); 339 void pmap_invalidate_page(pmap_t, vm_offset_t); 340 void pmap_invalidate_range(pmap_t, vm_offset_t, vm_offset_t); 341 void pmap_invalidate_all(pmap_t); 342 343 #endif /* _KERNEL */ 344 345 #endif /* !LOCORE */ 346 347 #endif /* !_MACHINE_PMAP_H_ */ 348