1 /* $NetBSD: pmap.h,v 1.16 2001/04/22 23:19:30 thorpej Exp $ */ 2 3 /*- 4 * Copyright (C) 1995, 1996 Wolfgang Solfrank. 5 * Copyright (C) 1995, 1996 TooLs GmbH. 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 acknowledgement: 18 * This product includes software developed by TooLs GmbH. 19 * 4. The name of TooLs GmbH may not be used to endorse or promote products 20 * derived from this software without specific prior written permission. 21 * 22 * THIS SOFTWARE IS PROVIDED BY TOOLS GMBH ``AS IS'' AND ANY EXPRESS OR 23 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 24 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 25 * IN NO EVENT SHALL TOOLS GMBH BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 26 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, 27 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; 28 * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, 29 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR 30 * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF 31 * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 32 */ 33 34 #ifndef _MACHINE_PMAP_H_ 35 #define _MACHINE_PMAP_H_ 36 37 #ifndef _LOCORE 38 #ifdef _KERNEL 39 #include <sys/queue.h> 40 #endif 41 #include <sys/mutex.h> 42 #endif 43 44 /* 45 * This scheme uses 2-level page tables. 46 * 47 * While we're still in 32-bit mode we do the following: 48 * 49 * offset: 13 bits 50 * 1st level: 1024 64-bit TTEs in an 8K page for 10 bits 51 * 2nd level: 512 32-bit pointers in the pmap for 9 bits 52 * ------- 53 * total: 32 bits 54 * 55 * In 64-bit mode the Spitfire and Blackbird CPUs support only 56 * 44-bit virtual addresses. All addresses between 57 * 0x0000 07ff ffff ffff and 0xffff f800 0000 0000 are in the 58 * "VA hole" and trap, so we don't have to track them. However, 59 * we do need to keep them in mind during PT walking. If they 60 * ever change the size of the address "hole" we need to rework 61 * all the page table handling. 62 * 63 * offset: 13 bits 64 * 1st level: 1024 64-bit TTEs in an 8K page for 10 bits 65 * 2nd level: 1024 64-bit pointers in an 8K page for 10 bits 66 * 3rd level: 1024 64-bit pointers in the segmap for 10 bits 67 * ------- 68 * total: 43 bits 69 * 70 * Of course, this means for 32-bit spaces we always have a (practically) 71 * wasted page for the segmap (only one entry used) and half a page wasted 72 * for the page directory. We still have need of one extra bit 8^(. 73 */ 74 75 #define HOLESHIFT (43) 76 77 #define PTSZ (PAGE_SIZE/8) 78 #define PDSZ (PTSZ) 79 #define STSZ (PTSZ) 80 81 #define PTSHIFT (13) 82 #define PDSHIFT (10+PTSHIFT) 83 #define STSHIFT (10+PDSHIFT) 84 85 #define PTMASK (PTSZ-1) 86 #define PDMASK (PDSZ-1) 87 #define STMASK (STSZ-1) 88 89 #ifndef _LOCORE 90 91 #define va_to_seg(v) (int)((((paddr_t)(v))>>STSHIFT)&STMASK) 92 #define va_to_dir(v) (int)((((paddr_t)(v))>>PDSHIFT)&PDMASK) 93 #define va_to_pte(v) (int)((((paddr_t)(v))>>PTSHIFT)&PTMASK) 94 95 #ifdef _KERNEL 96 97 /* 98 * Support for big page sizes. This maps the page size to the 99 * page bits. 100 */ 101 struct page_size_map { 102 u_int64_t mask; 103 u_int64_t code; 104 #ifdef DEBUG 105 u_int64_t use; 106 #endif 107 }; 108 extern const struct page_size_map page_size_map[]; 109 110 struct pmap { 111 struct mutex pm_mtx; 112 int pm_ctx; /* Current context */ 113 int pm_refs; /* ref count */ 114 /* 115 * This contains 64-bit pointers to pages that contain 116 * 1024 64-bit pointers to page tables. All addresses 117 * are physical. 118 * 119 * !!! Only touch this through pseg_get() and pseg_set() !!! 120 */ 121 paddr_t pm_physaddr; /* physical address of pm_segs */ 122 int64_t *pm_segs; 123 124 struct pmap_statistics pm_stats; 125 }; 126 127 /* 128 * This comes from the PROM and is used to map prom entries. 129 */ 130 struct prom_map { 131 u_int64_t vstart; 132 u_int64_t vsize; 133 u_int64_t tte; 134 }; 135 136 #define PMAP_NC 0x001 /* Set the E bit in the page */ 137 #define PMAP_NVC 0x002 /* Don't enable the virtual cache */ 138 #define PMAP_NOCACHE PMAP_NC 139 #define PMAP_LITTLE 0x004 /* Map in little endian mode */ 140 /* Large page size hints -- we really should use another param to pmap_enter() */ 141 #define PMAP_8K 0x000 142 #define PMAP_64K 0x008 /* Use 64K page */ 143 #define PMAP_512K 0x010 144 #define PMAP_4M 0x018 145 #define PMAP_SZ_TO_TTE(x) (((x)&0x018)<<58) 146 /* If these bits are different in va's to the same PA then there is an aliasing in the d$ */ 147 #define VA_ALIAS_ALIGN (1<<14) 148 #define VA_ALIAS_MASK (VA_ALIAS_ALIGN - 1) 149 150 typedef struct pmap *pmap_t; 151 152 extern struct pmap kernel_pmap_; 153 #define pmap_kernel() (&kernel_pmap_) 154 155 /* int pmap_change_wiring(pmap_t pm, vaddr_t va, boolean_t wired); */ 156 #define pmap_resident_count(pm) ((pm)->pm_stats.resident_count) 157 #define pmap_update(pm) /* nothing (yet) */ 158 159 #define pmap_proc_iflush(p,va,len) /* nothing */ 160 #define pmap_init_percpu() do { /* nothing */ } while (0) 161 162 void pmap_bootstrap(u_long, u_long, u_int, u_int); 163 int pmap_copyinsn(pmap_t, vaddr_t, uint32_t *); 164 165 /* make sure all page mappings are modulo 16K to prevent d$ aliasing */ 166 #define PMAP_PREFER 167 /* pmap prefer alignment */ 168 #define PMAP_PREFER_ALIGN() (VA_ALIAS_ALIGN) 169 /* pmap prefer offset in alignment */ 170 #define PMAP_PREFER_OFFSET(of) ((of) & VA_ALIAS_MASK) 171 172 #define PMAP_CHECK_COPYIN CPU_ISSUN4V 173 174 #define PMAP_GROWKERNEL /* turn on pmap_growkernel interface */ 175 176 #define __HAVE_PMAP_COLLECT 177 178 /* SPARC specific? */ 179 int pmap_dumpsize(void); 180 int pmap_dumpmmu(int (*)(dev_t, daddr_t, caddr_t, size_t), daddr_t); 181 int pmap_pa_exists(paddr_t); 182 183 /* SPARC64 specific */ 184 int ctx_alloc(struct pmap*); 185 void ctx_free(struct pmap*); 186 187 #endif /* _KERNEL */ 188 189 /* 190 * For each struct vm_page, there is a list of all currently valid virtual 191 * mappings of that page. 192 */ 193 typedef struct pv_entry { 194 struct pv_entry *pv_next; /* next pv_entry */ 195 struct pmap *pv_pmap; /* pmap where mapping lies */ 196 vaddr_t pv_va; /* virtual address for mapping */ 197 } *pv_entry_t; 198 /* PV flags encoded in the low bits of the VA of the first pv_entry */ 199 200 struct vm_page_md { 201 struct mutex pvmtx; 202 struct pv_entry pvent; 203 }; 204 205 #define VM_MDPAGE_INIT(pg) do { \ 206 mtx_init(&(pg)->mdpage.pvmtx, IPL_VM); \ 207 (pg)->mdpage.pvent.pv_next = NULL; \ 208 (pg)->mdpage.pvent.pv_pmap = NULL; \ 209 (pg)->mdpage.pvent.pv_va = 0; \ 210 } while (0) 211 212 #endif /* _LOCORE */ 213 #endif /* _MACHINE_PMAP_H_ */ 214