pmap.h revision 1.25
1/* $NetBSD: pmap.h,v 1.25 1999/02/04 19:48:21 thorpej Exp $ */ 2 3/*- 4 * Copyright (c) 1998 The NetBSD Foundation, Inc. 5 * All rights reserved. 6 * 7 * This code is derived from software contributed to The NetBSD Foundation 8 * by Jason R. Thorpe of the Numerical Aerospace Simulation Facility, 9 * NASA Ames Research Center and by Chris G. Demetriou. 10 * 11 * Redistribution and use in source and binary forms, with or without 12 * modification, are permitted provided that the following conditions 13 * are met: 14 * 1. Redistributions of source code must retain the above copyright 15 * notice, this list of conditions and the following disclaimer. 16 * 2. Redistributions in binary form must reproduce the above copyright 17 * notice, this list of conditions and the following disclaimer in the 18 * documentation and/or other materials provided with the distribution. 19 * 3. All advertising materials mentioning features or use of this software 20 * must display the following acknowledgement: 21 * This product includes software developed by the NetBSD 22 * Foundation, Inc. and its contributors. 23 * 4. Neither the name of The NetBSD Foundation nor the names of its 24 * contributors may be used to endorse or promote products derived 25 * from this software without specific prior written permission. 26 * 27 * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS 28 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED 29 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 30 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS 31 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 32 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 33 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 34 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 35 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 36 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 37 * POSSIBILITY OF SUCH DAMAGE. 38 */ 39 40/* 41 * Copyright (c) 1987 Carnegie-Mellon University 42 * Copyright (c) 1991, 1993 43 * The Regents of the University of California. All rights reserved. 44 * 45 * This code is derived from software contributed to Berkeley by 46 * the Systems Programming Group of the University of Utah Computer 47 * Science Department. 48 * 49 * Redistribution and use in source and binary forms, with or without 50 * modification, are permitted provided that the following conditions 51 * are met: 52 * 1. Redistributions of source code must retain the above copyright 53 * notice, this list of conditions and the following disclaimer. 54 * 2. Redistributions in binary form must reproduce the above copyright 55 * notice, this list of conditions and the following disclaimer in the 56 * documentation and/or other materials provided with the distribution. 57 * 3. All advertising materials mentioning features or use of this software 58 * must display the following acknowledgement: 59 * This product includes software developed by the University of 60 * California, Berkeley and its contributors. 61 * 4. Neither the name of the University nor the names of its contributors 62 * may be used to endorse or promote products derived from this software 63 * without specific prior written permission. 64 * 65 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 66 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 67 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 68 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 69 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 70 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 71 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 72 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 73 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 74 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 75 * SUCH DAMAGE. 76 * 77 * @(#)pmap.h 8.1 (Berkeley) 6/10/93 78 */ 79 80#ifndef _PMAP_MACHINE_ 81#define _PMAP_MACHINE_ 82 83#include <sys/lock.h> 84#include <sys/queue.h> 85 86#include <machine/pte.h> 87 88/* 89 * Machine-dependent virtual memory state. 90 * 91 * If we ever support processor numbers higher than 63, we'll have to 92 * rethink the CPU mask. 93 * 94 * Note pm_asn and pm_asngen are arrays allocated in pmap_create(). 95 * Their size is based on the PCS count from the HWRPB, and indexed 96 * by processor ID (from `whami'). 97 * 98 * The kernel pmap is a special case; it gets statically-allocated 99 * arrays which hold enough for ALPHA_MAXPROCS. 100 */ 101struct pmap { 102 LIST_ENTRY(pmap) pm_list; /* list of all pmaps */ 103 pt_entry_t *pm_lev1map; /* level 1 map */ 104 int pm_count; /* pmap reference count */ 105 struct simplelock pm_slock; /* lock on pmap */ 106 struct pmap_statistics pm_stats; /* pmap statistics */ 107 long pm_nlev2; /* level 2 pt page count */ 108 long pm_nlev3; /* level 3 pt page count */ 109 unsigned int *pm_asn; /* address space number */ 110 unsigned long *pm_asngen; /* ASN generation number */ 111 unsigned long pm_cpus; /* mask of CPUs using pmap */ 112}; 113 114typedef struct pmap *pmap_t; 115 116#define PMAP_ASN_RESERVED 0 /* reserved for Lev1map users */ 117 118extern struct pmap kernel_pmap_store; 119 120#define pmap_kernel() (&kernel_pmap_store) 121 122/* 123 * For each vm_page_t, there is a list of all currently valid virtual 124 * mappings of that page. An entry is a pv_entry_t, the list is pv_table. 125 */ 126typedef struct pv_entry { 127 LIST_ENTRY(pv_entry) pv_list; /* pv_entry list */ 128 struct pmap *pv_pmap; /* pmap where mapping lies */ 129 vaddr_t pv_va; /* virtual address for mapping */ 130} *pv_entry_t; 131 132/* 133 * The head of the list of pv_entry_t's, also contains page attributes. 134 */ 135struct pv_head { 136 LIST_HEAD(, pv_entry) pvh_list; /* pv_entry list */ 137 struct simplelock pvh_slock; /* lock on this head */ 138 int pvh_attrs; /* page attributes */ 139 int pvh_usage; /* page usage */ 140 int pvh_refcnt; /* special use ref count */ 141}; 142 143/* pvh_attrs */ 144#define PGA_MODIFIED 0x01 /* modified */ 145#define PGA_REFERENCED 0x02 /* referenced */ 146 147/* pvh_usage */ 148#define PGU_NORMAL 0 /* free or normal use */ 149#define PGU_PVENT 1 /* PV entries */ 150#define PGU_L1PT 2 /* level 1 page table */ 151#define PGU_L2PT 3 /* level 2 page table */ 152#define PGU_L3PT 4 /* level 3 page table */ 153 154#define PGU_ISPTPAGE(pgu) ((pgu) >= PGU_L1PT) 155 156#define PGU_STRINGS \ 157{ \ 158 "normal", \ 159 "pvent", \ 160 "l1pt", \ 161 "l2pt", \ 162 "l3pt", \ 163} 164 165struct pv_page_info { 166 TAILQ_ENTRY(pv_page) pgi_list; 167 LIST_HEAD(, pv_entry) pgi_freelist; 168 int pgi_nfree; 169}; 170 171struct pv_page { 172 struct pv_page_info pvp_pgi; 173 struct pv_entry pvp_pv[1]; /* variable length */ 174}; 175 176#ifdef _KERNEL 177 178#ifndef _LKM 179#include "opt_new_scc_driver.h" 180#include "opt_dec_3000_300.h" /* XXX */ 181#include "opt_dec_3000_500.h" /* XXX */ 182#include "opt_dec_kn8ae.h" /* XXX */ 183#include "opt_dec_kn300.h" /* XXX */ 184 185#if defined(NEW_SCC_DRIVER) 186#if defined(DEC_KN8AE) || defined(DEC_KN300) 187#define _PMAP_MAY_USE_PROM_CONSOLE 188#endif 189#else /* ! NEW_SCC_DRIVER */ 190#if defined(DEC_3000_300) \ 191 || defined(DEC_3000_500) \ 192 || defined(DEC_KN300) \ 193 || defined(DEC_KN8AE) /* XXX */ 194#define _PMAP_MAY_USE_PROM_CONSOLE /* XXX */ 195#endif /* XXX */ 196#endif /* NEW_SCC_DRIVER */ 197#endif /* _LKM */ 198 199#define pmap_resident_count(pmap) ((pmap)->pm_stats.resident_count) 200#define pmap_wired_count(pmap) ((pmap)->pm_stats.wired_count) 201 202extern pt_entry_t *VPT; /* Virtual Page Table */ 203 204#define PMAP_STEAL_MEMORY /* enable pmap_steal_memory() */ 205 206/* 207 * Alternate mapping hooks for pool pages. Avoids thrashing the TLB. 208 */ 209#define PMAP_MAP_POOLPAGE(pa) ALPHA_PHYS_TO_K0SEG((pa)) 210#define PMAP_UNMAP_POOLPAGE(va) ALPHA_K0SEG_TO_PHYS((va)) 211 212paddr_t vtophys __P((vaddr_t)); 213 214/* Machine-specific functions. */ 215void pmap_bootstrap __P((paddr_t ptaddr, u_int maxasn, u_long ncpuids)); 216void pmap_emulate_reference __P((struct proc *p, vaddr_t v, 217 int user, int write)); 218#ifdef _PMAP_MAY_USE_PROM_CONSOLE 219int pmap_uses_prom_console __P((void)); 220#endif 221 222#define pmap_pte_pa(pte) (PG_PFNUM(*(pte)) << PGSHIFT) 223#define pmap_pte_prot(pte) (*(pte) & PG_PROT) 224#define pmap_pte_w(pte) (*(pte) & PG_WIRED) 225#define pmap_pte_v(pte) (*(pte) & PG_V) 226#define pmap_pte_pv(pte) (*(pte) & PG_PVLIST) 227#define pmap_pte_asm(pte) (*(pte) & PG_ASM) 228#define pmap_pte_exec(pte) (*(pte) & PG_EXEC) 229 230#define pmap_pte_set_w(pte, v) \ 231do { \ 232 if (v) \ 233 *(pte) |= PG_WIRED; \ 234 else \ 235 *(pte) &= ~PG_WIRED; \ 236} while (0) 237 238#define pmap_pte_w_chg(pte, nw) ((nw) ^ pmap_pte_w(pte)) 239 240#define pmap_pte_set_prot(pte, np) \ 241do { \ 242 *(pte) &= ~PG_PROT; \ 243 *(pte) |= (np); \ 244} while (0) 245 246#define pmap_pte_prot_chg(pte, np) ((np) ^ pmap_pte_prot(pte)) 247 248static __inline pt_entry_t *pmap_l2pte __P((pmap_t, vaddr_t, pt_entry_t *)); 249static __inline pt_entry_t *pmap_l3pte __P((pmap_t, vaddr_t, pt_entry_t *)); 250 251#define pmap_l1pte(pmap, v) \ 252 (&(pmap)->pm_lev1map[l1pte_index((vaddr_t)(v))]) 253 254static __inline pt_entry_t * 255pmap_l2pte(pmap, v, l1pte) 256 pmap_t pmap; 257 vaddr_t v; 258 pt_entry_t *l1pte; 259{ 260 pt_entry_t *lev2map; 261 262 if (l1pte == NULL) { 263 l1pte = pmap_l1pte(pmap, v); 264 if (pmap_pte_v(l1pte) == 0) 265 return (NULL); 266 } 267 268 lev2map = (pt_entry_t *)ALPHA_PHYS_TO_K0SEG(pmap_pte_pa(l1pte)); 269 return (&lev2map[l2pte_index(v)]); 270} 271 272static __inline pt_entry_t * 273pmap_l3pte(pmap, v, l2pte) 274 pmap_t pmap; 275 vaddr_t v; 276 pt_entry_t *l2pte; 277{ 278 pt_entry_t *l1pte, *lev2map, *lev3map; 279 280 if (l2pte == NULL) { 281 l1pte = pmap_l1pte(pmap, v); 282 if (pmap_pte_v(l1pte) == 0) 283 return (NULL); 284 285 lev2map = (pt_entry_t *)ALPHA_PHYS_TO_K0SEG(pmap_pte_pa(l1pte)); 286 l2pte = &lev2map[l2pte_index(v)]; 287 if (pmap_pte_v(l2pte) == 0) 288 return (NULL); 289 } 290 291 lev3map = (pt_entry_t *)ALPHA_PHYS_TO_K0SEG(pmap_pte_pa(l2pte)); 292 return (&lev3map[l3pte_index(v)]); 293} 294 295#endif /* _KERNEL */ 296 297#endif /* _PMAP_MACHINE_ */ 298