pmap.h revision 1.55
1/* $NetBSD: pmap.h,v 1.55 2018/08/20 15:04:51 maxv Exp $ */ 2 3/* 4 * Copyright (c) 1997 Charles D. Cranor and Washington University. 5 * All rights reserved. 6 * 7 * Redistribution and use in source and binary forms, with or without 8 * modification, are permitted provided that the following conditions 9 * are met: 10 * 1. Redistributions of source code must retain the above copyright 11 * notice, this list of conditions and the following disclaimer. 12 * 2. Redistributions in binary form must reproduce the above copyright 13 * notice, this list of conditions and the following disclaimer in the 14 * documentation and/or other materials provided with the distribution. 15 * 16 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 17 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 18 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 19 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 20 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 21 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 22 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 23 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 24 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 25 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 26 */ 27 28/* 29 * Copyright (c) 2001 Wasabi Systems, Inc. 30 * All rights reserved. 31 * 32 * Written by Frank van der Linden for Wasabi Systems, Inc. 33 * 34 * Redistribution and use in source and binary forms, with or without 35 * modification, are permitted provided that the following conditions 36 * are met: 37 * 1. Redistributions of source code must retain the above copyright 38 * notice, this list of conditions and the following disclaimer. 39 * 2. Redistributions in binary form must reproduce the above copyright 40 * notice, this list of conditions and the following disclaimer in the 41 * documentation and/or other materials provided with the distribution. 42 * 3. All advertising materials mentioning features or use of this software 43 * must display the following acknowledgement: 44 * This product includes software developed for the NetBSD Project by 45 * Wasabi Systems, Inc. 46 * 4. The name of Wasabi Systems, Inc. may not be used to endorse 47 * or promote products derived from this software without specific prior 48 * written permission. 49 * 50 * THIS SOFTWARE IS PROVIDED BY WASABI SYSTEMS, INC. ``AS IS'' AND 51 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED 52 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 53 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL WASABI SYSTEMS, INC 54 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 55 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 56 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 57 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 58 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 59 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 60 * POSSIBILITY OF SUCH DAMAGE. 61 */ 62 63#ifndef _AMD64_PMAP_H_ 64#define _AMD64_PMAP_H_ 65 66#ifdef __x86_64__ 67 68#if defined(_KERNEL_OPT) 69#include "opt_xen.h" 70#include "opt_kasan.h" 71#endif 72 73#include <sys/atomic.h> 74 75#include <machine/pte.h> 76#include <machine/segments.h> 77#ifdef _KERNEL 78#include <machine/cpufunc.h> 79#endif 80 81#include <uvm/uvm_object.h> 82#ifdef XEN 83#include <xen/xenfunc.h> 84#include <xen/xenpmap.h> 85#endif 86 87/* 88 * Mask to get rid of the sign-extended part of addresses. 89 */ 90#define VA_SIGN_MASK 0xffff000000000000 91#define VA_SIGN_NEG(va) ((va) | VA_SIGN_MASK) 92/* XXXfvdl this one's not right. */ 93#define VA_SIGN_POS(va) ((va) & ~VA_SIGN_MASK) 94 95#ifdef KASAN 96#define L4_SLOT_KASAN 256 97#define NL4_SLOT_KASAN 32 98#endif 99 100#ifndef XEN 101#define L4_SLOT_PTE slotspace.area[SLAREA_PTE].sslot 102#else 103#define L4_SLOT_PTE 509 104#endif 105#define L4_SLOT_KERN slotspace.area[SLAREA_MAIN].sslot 106#define L4_SLOT_KERNBASE 511 /* pl4_i(KERNBASE) */ 107 108#define PDIR_SLOT_USERLIM 255 109#define PDIR_SLOT_KERN L4_SLOT_KERN 110#define PDIR_SLOT_PTE L4_SLOT_PTE 111 112/* 113 * The following defines give the virtual addresses of various MMU 114 * data structures: 115 * PTE_BASE: the base VA of the linear PTE mappings 116 * PDP_BASE: the base VA of the recursive mapping of the PTD 117 */ 118 119#ifndef XEN 120extern pt_entry_t *pte_base; 121#define PTE_BASE pte_base 122#else 123#define PTE_BASE ((pt_entry_t *)VA_SIGN_NEG((L4_SLOT_PTE * NBPD_L4))) 124#endif 125 126#define L1_BASE PTE_BASE 127#define L2_BASE ((pd_entry_t *)((char *)L1_BASE + L4_SLOT_PTE * NBPD_L3)) 128#define L3_BASE ((pd_entry_t *)((char *)L2_BASE + L4_SLOT_PTE * NBPD_L2)) 129#define L4_BASE ((pd_entry_t *)((char *)L3_BASE + L4_SLOT_PTE * NBPD_L1)) 130 131#define PDP_BASE L4_BASE 132 133#define NKL4_MAX_ENTRIES (unsigned long)64 134#define NKL3_MAX_ENTRIES (unsigned long)(NKL4_MAX_ENTRIES * 512) 135#define NKL2_MAX_ENTRIES (unsigned long)(NKL3_MAX_ENTRIES * 512) 136#define NKL1_MAX_ENTRIES (unsigned long)(NKL2_MAX_ENTRIES * 512) 137 138#define NKL4_KIMG_ENTRIES 1 139#define NKL3_KIMG_ENTRIES 1 140#define NKL2_KIMG_ENTRIES 48 141 142/* 143 * Since kva space is below the kernel in its entirety, we start off 144 * with zero entries on each level. 145 */ 146#define NKL4_START_ENTRIES 0 147#define NKL3_START_ENTRIES 0 148#define NKL2_START_ENTRIES 0 149#define NKL1_START_ENTRIES 0 150 151#define PTP_MASK_INITIALIZER { L1_FRAME, L2_FRAME, L3_FRAME, L4_FRAME } 152#define PTP_SHIFT_INITIALIZER { L1_SHIFT, L2_SHIFT, L3_SHIFT, L4_SHIFT } 153#define NKPTP_INITIALIZER { NKL1_START_ENTRIES, NKL2_START_ENTRIES, \ 154 NKL3_START_ENTRIES, NKL4_START_ENTRIES } 155#define NKPTPMAX_INITIALIZER { NKL1_MAX_ENTRIES, NKL2_MAX_ENTRIES, \ 156 NKL3_MAX_ENTRIES, NKL4_MAX_ENTRIES } 157#define NBPD_INITIALIZER { NBPD_L1, NBPD_L2, NBPD_L3, NBPD_L4 } 158#define PDES_INITIALIZER { L2_BASE, L3_BASE, L4_BASE } 159 160#define PTP_LEVELS 4 161 162/* 163 * PG_AVAIL usage: we make use of the ignored bits of the PTE 164 */ 165 166#define PG_W PG_AVAIL1 /* "wired" mapping */ 167#define PG_PVLIST PG_AVAIL2 /* mapping has entry on pvlist */ 168/* PG_AVAIL3 not used */ 169 170#define PG_X 0 /* XXX dummy */ 171 172void svs_pmap_sync(struct pmap *, int); 173void svs_lwp_switch(struct lwp *, struct lwp *); 174void svs_pdir_switch(struct pmap *); 175void svs_init(void); 176extern bool svs_enabled; 177 178#include <x86/pmap.h> 179 180#ifndef XEN 181#define pmap_pa2pte(a) (a) 182#define pmap_pte2pa(a) ((a) & PG_FRAME) 183#define pmap_pte_set(p, n) do { *(p) = (n); } while (0) 184#define pmap_pte_cas(p, o, n) atomic_cas_64((p), (o), (n)) 185#define pmap_pte_testset(p, n) \ 186 atomic_swap_ulong((volatile unsigned long *)p, n) 187#define pmap_pte_setbits(p, b) \ 188 atomic_or_ulong((volatile unsigned long *)p, b) 189#define pmap_pte_clearbits(p, b) \ 190 atomic_and_ulong((volatile unsigned long *)p, ~(b)) 191#define pmap_pte_flush() /* nothing */ 192#else 193extern kmutex_t pte_lock; 194 195static __inline pt_entry_t 196pmap_pa2pte(paddr_t pa) 197{ 198 return (pt_entry_t)xpmap_ptom_masked(pa); 199} 200 201static __inline paddr_t 202pmap_pte2pa(pt_entry_t pte) 203{ 204 return xpmap_mtop_masked(pte & PG_FRAME); 205} 206 207static __inline void 208pmap_pte_set(pt_entry_t *pte, pt_entry_t npte) 209{ 210 int s = splvm(); 211 xpq_queue_pte_update(xpmap_ptetomach(pte), npte); 212 splx(s); 213} 214 215static __inline pt_entry_t 216pmap_pte_cas(volatile pt_entry_t *ptep, pt_entry_t o, pt_entry_t n) 217{ 218 pt_entry_t opte; 219 220 mutex_enter(&pte_lock); 221 opte = *ptep; 222 if (opte == o) { 223 xpq_queue_pte_update(xpmap_ptetomach(__UNVOLATILE(ptep)), n); 224 xpq_flush_queue(); 225 } 226 227 mutex_exit(&pte_lock); 228 return opte; 229} 230 231static __inline pt_entry_t 232pmap_pte_testset(volatile pt_entry_t *pte, pt_entry_t npte) 233{ 234 pt_entry_t opte; 235 236 mutex_enter(&pte_lock); 237 opte = *pte; 238 xpq_queue_pte_update(xpmap_ptetomach(__UNVOLATILE(pte)), npte); 239 xpq_flush_queue(); 240 mutex_exit(&pte_lock); 241 return opte; 242} 243 244static __inline void 245pmap_pte_setbits(volatile pt_entry_t *pte, pt_entry_t bits) 246{ 247 mutex_enter(&pte_lock); 248 xpq_queue_pte_update(xpmap_ptetomach(__UNVOLATILE(pte)), (*pte) | bits); 249 xpq_flush_queue(); 250 mutex_exit(&pte_lock); 251} 252 253static __inline void 254pmap_pte_clearbits(volatile pt_entry_t *pte, pt_entry_t bits) 255{ 256 mutex_enter(&pte_lock); 257 xpq_queue_pte_update(xpmap_ptetomach(__UNVOLATILE(pte)), 258 (*pte) & ~bits); 259 xpq_flush_queue(); 260 mutex_exit(&pte_lock); 261} 262 263static __inline void 264pmap_pte_flush(void) 265{ 266 int s = splvm(); 267 xpq_flush_queue(); 268 splx(s); 269} 270#endif 271 272#ifdef __HAVE_DIRECT_MAP 273#define PMAP_DIRECT 274 275static __inline int 276pmap_direct_process(paddr_t pa, voff_t pgoff, size_t len, 277 int (*process)(void *, size_t, void *), void *arg) 278{ 279 vaddr_t va = PMAP_DIRECT_MAP(pa); 280 281 return process((void *)(va + pgoff), len, arg); 282} 283 284#endif /* __HAVE_DIRECT_MAP */ 285 286void pmap_changeprot_local(vaddr_t, vm_prot_t); 287 288#include <x86/pmap_pv.h> 289 290#define __HAVE_VM_PAGE_MD 291#define VM_MDPAGE_INIT(pg) \ 292 memset(&(pg)->mdpage, 0, sizeof((pg)->mdpage)); \ 293 PMAP_PAGE_INIT(&(pg)->mdpage.mp_pp) 294 295struct vm_page_md { 296 struct pmap_page mp_pp; 297}; 298 299#else /* !__x86_64__ */ 300 301#include <i386/pmap.h> 302 303#endif /* __x86_64__ */ 304 305#endif /* _AMD64_PMAP_H_ */ 306