1 1.36 riastrad /* $NetBSD: pte.h,v 1.36 2022/08/21 09:12:43 riastradh Exp $ */ 2 1.16 yamt 3 1.16 yamt /* 4 1.16 yamt * Copyright (c) 2001 Wasabi Systems, Inc. 5 1.16 yamt * All rights reserved. 6 1.16 yamt * 7 1.16 yamt * Written by Frank van der Linden for Wasabi Systems, Inc. 8 1.16 yamt * 9 1.16 yamt * Redistribution and use in source and binary forms, with or without 10 1.16 yamt * modification, are permitted provided that the following conditions 11 1.16 yamt * are met: 12 1.16 yamt * 1. Redistributions of source code must retain the above copyright 13 1.16 yamt * notice, this list of conditions and the following disclaimer. 14 1.16 yamt * 2. Redistributions in binary form must reproduce the above copyright 15 1.16 yamt * notice, this list of conditions and the following disclaimer in the 16 1.16 yamt * documentation and/or other materials provided with the distribution. 17 1.16 yamt * 3. All advertising materials mentioning features or use of this software 18 1.16 yamt * must display the following acknowledgement: 19 1.16 yamt * This product includes software developed for the NetBSD Project by 20 1.16 yamt * Wasabi Systems, Inc. 21 1.16 yamt * 4. The name of Wasabi Systems, Inc. may not be used to endorse 22 1.16 yamt * or promote products derived from this software without specific prior 23 1.16 yamt * written permission. 24 1.16 yamt * 25 1.16 yamt * THIS SOFTWARE IS PROVIDED BY WASABI SYSTEMS, INC. ``AS IS'' AND 26 1.16 yamt * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED 27 1.16 yamt * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 28 1.16 yamt * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL WASABI SYSTEMS, INC 29 1.16 yamt * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 30 1.16 yamt * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 31 1.16 yamt * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 32 1.16 yamt * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 33 1.16 yamt * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 34 1.16 yamt * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 35 1.16 yamt * POSSIBILITY OF SUCH DAMAGE. 36 1.16 yamt */ 37 1.11 thorpej 38 1.10 mrg /* 39 1.10 mrg * Copyright (c) 1997 Charles D. Cranor and Washington University. 40 1.1 cgd * All rights reserved. 41 1.1 cgd * 42 1.1 cgd * Redistribution and use in source and binary forms, with or without 43 1.1 cgd * modification, are permitted provided that the following conditions 44 1.1 cgd * are met: 45 1.1 cgd * 1. Redistributions of source code must retain the above copyright 46 1.1 cgd * notice, this list of conditions and the following disclaimer. 47 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright 48 1.1 cgd * notice, this list of conditions and the following disclaimer in the 49 1.1 cgd * documentation and/or other materials provided with the distribution. 50 1.10 mrg * 51 1.10 mrg * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 52 1.10 mrg * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 53 1.10 mrg * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 54 1.10 mrg * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 55 1.10 mrg * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 56 1.10 mrg * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 57 1.10 mrg * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 58 1.10 mrg * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 59 1.10 mrg * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 60 1.10 mrg * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 61 1.1 cgd */ 62 1.1 cgd 63 1.3 andrew #ifndef _I386_PTE_H_ 64 1.3 andrew #define _I386_PTE_H_ 65 1.17 bouyer #ifdef _KERNEL_OPT 66 1.17 bouyer #include "opt_xen.h" 67 1.17 bouyer #endif 68 1.3 andrew 69 1.10 mrg /* 70 1.20 dyoung * The PAE extension extends the size of the PTE to 64 bits (52bits physical 71 1.17 bouyer * address) and is compatible with the amd64 PTE format. The first level 72 1.22 jld * maps 2M, the second 1G, so a third level page table is introduced to 73 1.17 bouyer * map the 4GB virtual address space. This PD has only 4 entries. 74 1.22 jld * We can't use recursive mapping at level 3 to map the PD pages, as this 75 1.22 jld * would eat one GB of address space. In addition, Xen imposes restrictions 76 1.17 bouyer * on the entries we put in the L3 page (for example, the page pointed to by 77 1.28 maxv * the last slot can't be shared among different L3 pages), which makes 78 1.17 bouyer * handling this L3 page in the same way we do for L2 on i386 (or L4 on amd64) 79 1.17 bouyer * difficult. For most things we'll just pretend to have only 2 levels, 80 1.17 bouyer * with the 2 high bits of the L2 index being in fact the index in the 81 1.17 bouyer * L3. 82 1.10 mrg */ 83 1.10 mrg 84 1.11 thorpej #if !defined(_LOCORE) 85 1.10 mrg 86 1.10 mrg /* 87 1.10 mrg * here we define the data types for PDEs and PTEs 88 1.10 mrg */ 89 1.34 riastrad #include <sys/stdint.h> 90 1.17 bouyer #ifdef PAE 91 1.17 bouyer typedef uint64_t pd_entry_t; /* PDE */ 92 1.17 bouyer typedef uint64_t pt_entry_t; /* PTE */ 93 1.17 bouyer #else 94 1.15 perry typedef uint32_t pd_entry_t; /* PDE */ 95 1.15 perry typedef uint32_t pt_entry_t; /* PTE */ 96 1.17 bouyer #endif 97 1.10 mrg 98 1.1 cgd #endif 99 1.1 cgd 100 1.36 riastrad /* 101 1.36 riastrad * Mask to get rid of the sign-extended part of addresses. 102 1.36 riastrad */ 103 1.36 riastrad #define VA_SIGN_MASK 0 104 1.36 riastrad #define VA_SIGN_NEG(va) ((va) | VA_SIGN_MASK) 105 1.36 riastrad /* 106 1.36 riastrad * XXXfvdl this one's not right. 107 1.36 riastrad */ 108 1.36 riastrad #define VA_SIGN_POS(va) ((va) & ~VA_SIGN_MASK) 109 1.36 riastrad 110 1.17 bouyer #ifdef PAE 111 1.28 maxv #define L1_SHIFT 12 112 1.28 maxv #define L2_SHIFT 21 113 1.28 maxv #define L3_SHIFT 30 114 1.28 maxv #define NBPD_L1 (1ULL << L1_SHIFT) /* # bytes mapped by L1 ent (4K) */ 115 1.28 maxv #define NBPD_L2 (1ULL << L2_SHIFT) /* # bytes mapped by L2 ent (2MB) */ 116 1.28 maxv #define NBPD_L3 (1ULL << L3_SHIFT) /* # bytes mapped by L3 ent (1GB) */ 117 1.28 maxv 118 1.28 maxv #define L3_MASK 0xc0000000 119 1.28 maxv #define L2_REALMASK 0x3fe00000 120 1.28 maxv #define L2_MASK (L2_REALMASK | L3_MASK) 121 1.28 maxv #define L1_MASK 0x001ff000 122 1.28 maxv 123 1.28 maxv #define L3_FRAME (L3_MASK) 124 1.28 maxv #define L2_FRAME (L3_FRAME | L2_MASK) 125 1.28 maxv #define L1_FRAME (L2_FRAME|L1_MASK) 126 1.17 bouyer 127 1.30 maxv #define PTE_4KFRAME 0x000ffffffffff000ULL 128 1.30 maxv #define PTE_2MFRAME 0x000fffffffe00000ULL 129 1.30 maxv 130 1.30 maxv #define PTE_FRAME PTE_4KFRAME 131 1.30 maxv #define PTE_LGFRAME PTE_2MFRAME 132 1.30 maxv 133 1.17 bouyer /* macros to get real L2 and L3 index, from our "extended" L2 index */ 134 1.17 bouyer #define l2tol3(idx) ((idx) >> (L3_SHIFT - L2_SHIFT)) 135 1.17 bouyer #define l2tol2(idx) ((idx) & (L2_REALMASK >> L2_SHIFT)) 136 1.24 cegger 137 1.17 bouyer #else /* PAE */ 138 1.24 cegger 139 1.28 maxv #define L1_SHIFT 12 140 1.28 maxv #define L2_SHIFT 22 141 1.28 maxv #define NBPD_L1 (1UL << L1_SHIFT) /* # bytes mapped by L1 ent (4K) */ 142 1.28 maxv #define NBPD_L2 (1UL << L2_SHIFT) /* # bytes mapped by L2 ent (4MB) */ 143 1.16 yamt 144 1.16 yamt #define L2_MASK 0xffc00000 145 1.16 yamt #define L1_MASK 0x003ff000 146 1.16 yamt 147 1.16 yamt #define L2_FRAME (L2_MASK) 148 1.16 yamt #define L1_FRAME (L2_FRAME|L1_MASK) 149 1.1 cgd 150 1.30 maxv #define PTE_4KFRAME 0xfffff000 151 1.30 maxv #define PTE_4MFRAME 0xffc00000 152 1.30 maxv 153 1.30 maxv #define PTE_FRAME PTE_4KFRAME 154 1.30 maxv #define PTE_LGFRAME PTE_4MFRAME 155 1.30 maxv 156 1.17 bouyer #endif /* PAE */ 157 1.28 maxv 158 1.10 mrg /* 159 1.30 maxv * x86 PTE/PDE bits. 160 1.30 maxv */ 161 1.30 maxv #define PTE_P 0x00000001 /* Present */ 162 1.30 maxv #define PTE_W 0x00000002 /* Write */ 163 1.30 maxv #define PTE_U 0x00000004 /* User */ 164 1.30 maxv #define PTE_PWT 0x00000008 /* Write-Through */ 165 1.30 maxv #define PTE_PCD 0x00000010 /* Cache-Disable */ 166 1.30 maxv #define PTE_A 0x00000020 /* Accessed */ 167 1.30 maxv #define PTE_D 0x00000040 /* Dirty */ 168 1.30 maxv #define PTE_PAT 0x00000080 /* PAT on 4KB Pages */ 169 1.30 maxv #define PTE_PS 0x00000080 /* Large Page Size */ 170 1.30 maxv #define PTE_G 0x00000100 /* Global Translation */ 171 1.30 maxv #define PTE_AVL1 0x00000200 /* Ignored by Hardware */ 172 1.30 maxv #define PTE_AVL2 0x00000400 /* Ignored by Hardware */ 173 1.30 maxv #define PTE_AVL3 0x00000800 /* Ignored by Hardware */ 174 1.30 maxv #define PTE_LGPAT 0x00001000 /* PAT on Large Pages */ 175 1.30 maxv #ifdef PAE 176 1.30 maxv #define PTE_NX 0x8000000000000000ULL /* No Execute */ 177 1.30 maxv #else 178 1.30 maxv #define PTE_NX 0 /* Dummy */ 179 1.30 maxv #endif 180 1.30 maxv 181 1.35 riastrad #define _MACHINE_PTE_H_X86 182 1.24 cegger #include <x86/pte.h> 183 1.35 riastrad #undef _MACHINE_PTE_H_X86 184 1.3 andrew 185 1.3 andrew #endif /* _I386_PTE_H_ */ 186