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 /* Actual number of kernel page tables */ 100 #ifndef NKPT 101 #ifdef PAE 102 #define NKPT 240 /* Enough for 16GB (2MB page tables) */ 103 #else 104 #define NKPT 30 /* Enough for 4GB (4MB page tables) */ 105 #endif 106 #endif 107 #ifndef NKPDE 108 #ifdef SMP 109 #define NKPDE (KVA_PAGES - 1) /* number of page tables/pde's */ 110 #else 111 #define NKPDE (KVA_PAGES) /* number of page tables/pde's */ 112 #endif 113 #endif 114 115 /* 116 * The *PTDI values control the layout of virtual memory 117 * 118 * XXX This works for now, but I am not real happy with it, I'll fix it 119 * right after I fix locore.s and the magic 28K hole 120 * 121 * SMP_PRIVPAGES: The per-cpu address space is 0xff80000 -> 0xffbfffff 122 */ 123 #ifdef SMP 124 #define MPPTDI (NPDEPTD-1) /* per cpu ptd entry */ 125 #define KPTDI (MPPTDI-NKPDE) /* start of kernel virtual pde's */ 126 #else 127 #define KPTDI (NPDEPTD-NKPDE)/* start of kernel virtual pde's */ 128 #endif /* SMP */ 129 #define PTDPTDI (KPTDI-NPGPTD) /* ptd entry that points to ptd! */ 130 131 /* 132 * XXX doesn't really belong here I guess... 133 */ 134 #define ISA_HOLE_START 0xa0000 135 #define ISA_HOLE_LENGTH (0x100000-ISA_HOLE_START) 136 137 #ifndef LOCORE 138 139 #include <sys/queue.h> 140 #include <sys/_lock.h> 141 #include <sys/_mutex.h> 142 143 #ifdef PAE 144 145 typedef uint64_t pdpt_entry_t; 146 typedef uint64_t pd_entry_t; 147 typedef uint64_t pt_entry_t; 148 149 #define PTESHIFT (3) 150 #define PDESHIFT (3) 151 152 #else 153 154 typedef uint32_t pd_entry_t; 155 typedef uint32_t pt_entry_t; 156 157 #define PTESHIFT (2) 158 #define PDESHIFT (2) 159 160 #endif 161 162 /* 163 * Address of current and alternate address space page table maps 164 * and directories. 165 */ 166 #ifdef _KERNEL 167 extern pt_entry_t PTmap[]; 168 extern pd_entry_t PTD[]; 169 extern pd_entry_t PTDpde[]; 170 171 #ifdef PAE 172 extern pdpt_entry_t *IdlePDPT; 173 #endif 174 extern pd_entry_t *IdlePTD; /* physical address of "Idle" state directory */ 175 #endif 176 177 #ifdef _KERNEL 178 /* 179 * virtual address to page table entry and 180 * to physical address. Likewise for alternate address space. 181 * Note: these work recursively, thus vtopte of a pte will give 182 * the corresponding pde that in turn maps it. 183 */ 184 #define vtopte(va) (PTmap + i386_btop(va)) 185 186 /* 187 * Routine: pmap_kextract 188 * Function: 189 * Extract the physical page address associated 190 * kernel virtual address. 191 */ 192 static __inline vm_paddr_t 193 pmap_kextract(vm_offset_t va) 194 { 195 vm_paddr_t pa; 196 197 if ((pa = PTD[va >> PDRSHIFT]) & PG_PS) { 198 pa = (pa & ~(NBPDR - 1)) | (va & (NBPDR - 1)); 199 } else { 200 pa = *vtopte(va); 201 pa = (pa & PG_FRAME) | (va & PAGE_MASK); 202 } 203 return pa; 204 } 205 206 #define vtophys(va) pmap_kextract(((vm_offset_t) (va))) 207 208 #ifdef PAE 209 210 static __inline pt_entry_t 211 pte_load(pt_entry_t *ptep) 212 { 213 pt_entry_t r; 214 215 __asm __volatile( 216 "lock; cmpxchg8b %1" 217 : "=A" (r) 218 : "m" (*ptep), "a" (0), "d" (0), "b" (0), "c" (0)); 219 return (r); 220 } 221 222 static __inline pt_entry_t 223 pte_load_store(pt_entry_t *ptep, pt_entry_t v) 224 { 225 pt_entry_t r; 226 227 r = *ptep; 228 __asm __volatile( 229 "1:\n" 230 "\tlock; cmpxchg8b %1\n" 231 "\tjnz 1b" 232 : "+A" (r) 233 : "m" (*ptep), "b" ((uint32_t)v), "c" ((uint32_t)(v >> 32))); 234 return (r); 235 } 236 237 #define pte_load_clear(ptep) pte_load_store((ptep), (pt_entry_t)0ULL) 238 239 #else /* PAE */ 240 241 static __inline pt_entry_t 242 pte_load(pt_entry_t *ptep) 243 { 244 pt_entry_t r; 245 246 r = *ptep; 247 return (r); 248 } 249 250 static __inline pt_entry_t 251 pte_load_store(pt_entry_t *ptep, pt_entry_t pte) 252 { 253 pt_entry_t r; 254 255 r = *ptep; 256 *ptep = pte; 257 return (r); 258 } 259 260 #define pte_load_clear(pte) atomic_readandclear_int(pte) 261 262 #endif /* PAE */ 263 264 #define pte_clear(ptep) pte_load_store((ptep), (pt_entry_t)0ULL) 265 #define pte_store(ptep, pte) pte_load_store((ptep), (pt_entry_t)pte) 266 267 #define pde_store(pdep, pde) pte_store((pdep), (pde)) 268 269 #endif /* _KERNEL */ 270 271 /* 272 * Pmap stuff 273 */ 274 struct pv_entry; 275 276 struct md_page { 277 int pv_list_count; 278 TAILQ_HEAD(,pv_entry) pv_list; 279 }; 280 281 struct pmap { 282 struct mtx pm_mtx; 283 pd_entry_t *pm_pdir; /* KVA of page directory */ 284 TAILQ_HEAD(,pv_entry) pm_pvlist; /* list of mappings in pmap */ 285 u_int pm_active; /* active on cpus */ 286 struct pmap_statistics pm_stats; /* pmap statistics */ 287 LIST_ENTRY(pmap) pm_list; /* List of all pmaps */ 288 #ifdef PAE 289 pdpt_entry_t *pm_pdpt; /* KVA of page director pointer 290 table */ 291 #endif 292 }; 293 294 typedef struct pmap *pmap_t; 295 296 #ifdef _KERNEL 297 extern struct pmap kernel_pmap_store; 298 #define kernel_pmap (&kernel_pmap_store) 299 300 #define PMAP_LOCK(pmap) mtx_lock(&(pmap)->pm_mtx) 301 #define PMAP_LOCK_ASSERT(pmap, type) \ 302 mtx_assert(&(pmap)->pm_mtx, (type)) 303 #define PMAP_LOCK_DESTROY(pmap) mtx_destroy(&(pmap)->pm_mtx) 304 #define PMAP_LOCK_INIT(pmap) mtx_init(&(pmap)->pm_mtx, "pmap", \ 305 NULL, MTX_DEF) 306 #define PMAP_LOCKED(pmap) mtx_owned(&(pmap)->pm_mtx) 307 #define PMAP_MTX(pmap) (&(pmap)->pm_mtx) 308 #define PMAP_TRYLOCK(pmap) mtx_trylock(&(pmap)->pm_mtx) 309 #define PMAP_UNLOCK(pmap) mtx_unlock(&(pmap)->pm_mtx) 310 #endif 311 312 /* 313 * For each vm_page_t, there is a list of all currently valid virtual 314 * mappings of that page. An entry is a pv_entry_t, the list is pv_table. 315 */ 316 typedef struct pv_entry { 317 pmap_t pv_pmap; /* pmap where mapping lies */ 318 vm_offset_t pv_va; /* virtual address for mapping */ 319 TAILQ_ENTRY(pv_entry) pv_list; 320 TAILQ_ENTRY(pv_entry) pv_plist; 321 } *pv_entry_t; 322 323 #ifdef _KERNEL 324 325 #define NPPROVMTRR 8 326 #define PPRO_VMTRRphysBase0 0x200 327 #define PPRO_VMTRRphysMask0 0x201 328 struct ppro_vmtrr { 329 u_int64_t base, mask; 330 }; 331 extern struct ppro_vmtrr PPro_vmtrr[NPPROVMTRR]; 332 333 extern caddr_t CADDR1; 334 extern pt_entry_t *CMAP1; 335 extern vm_paddr_t avail_end; 336 extern vm_paddr_t phys_avail[]; 337 extern int pseflag; 338 extern int pgeflag; 339 extern char *ptvmmap; /* poor name! */ 340 extern vm_offset_t virtual_avail; 341 extern vm_offset_t virtual_end; 342 343 #define pmap_page_is_mapped(m) (!TAILQ_EMPTY(&(m)->md.pv_list)) 344 345 void pmap_bootstrap(vm_paddr_t, vm_paddr_t); 346 void pmap_kenter(vm_offset_t va, vm_paddr_t pa); 347 void *pmap_kenter_temporary(vm_paddr_t pa, int i); 348 void pmap_kremove(vm_offset_t); 349 void *pmap_mapdev(vm_paddr_t, vm_size_t); 350 void pmap_unmapdev(vm_offset_t, vm_size_t); 351 pt_entry_t *pmap_pte(pmap_t, vm_offset_t) __pure2; 352 void pmap_set_pg(void); 353 void pmap_invalidate_page(pmap_t, vm_offset_t); 354 void pmap_invalidate_range(pmap_t, vm_offset_t, vm_offset_t); 355 void pmap_invalidate_all(pmap_t); 356 357 #endif /* _KERNEL */ 358 359 #endif /* !LOCORE */ 360 361 #endif /* !_MACHINE_PMAP_H_ */ 362