pmap.h revision 1.20
1/* $NetBSD: pmap.h,v 1.20 1998/05/20 04:05:51 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 * XXX When we support multiple processors, pm_asn and pm_asngen need 95 * XXX to be per-processor. 96 */ 97struct pmap { 98 LIST_ENTRY(pmap) pm_list; /* list of all pmaps */ 99 pt_entry_t *pm_lev1map; /* level 1 map */ 100 int pm_count; /* pmap reference count */ 101 struct simplelock pm_slock; /* lock on pmap */ 102 struct pmap_statistics pm_stats; /* pmap statistics */ 103 long pm_nlev2; /* level 2 pt page count */ 104 long pm_nlev3; /* level 3 pt page count */ 105 unsigned int pm_asn; /* address space number */ 106 unsigned long pm_asngen; /* ASN generation number */ 107 unsigned long pm_cpus; /* mask of CPUs using pmap */ 108}; 109 110typedef struct pmap *pmap_t; 111 112#define PMAP_ASN_RESERVED 0 /* reserved for Lev1map users */ 113 114extern struct pmap kernel_pmap_store; 115 116#define pmap_kernel() (&kernel_pmap_store) 117 118/* 119 * For each vm_page_t, there is a list of all currently valid virtual 120 * mappings of that page. An entry is a pv_entry_t, the list is pv_table. 121 */ 122typedef struct pv_entry { 123 LIST_ENTRY(pv_entry) pv_list; /* pv_entry list */ 124 struct pmap *pv_pmap; /* pmap where mapping lies */ 125 vm_offset_t pv_va; /* virtual address for mapping */ 126} *pv_entry_t; 127 128/* 129 * The head of the list of pv_entry_t's, also contains page attributes. 130 */ 131struct pv_head { 132 LIST_HEAD(, pv_entry) pvh_list; /* pv_entry list */ 133 struct simplelock pvh_slock; /* lock on this head */ 134 int pvh_attrs; /* page attributes */ 135 int pvh_usage; /* page usage */ 136 int pvh_refcnt; /* special use ref count */ 137}; 138 139/* pvh_attrs */ 140#define PGA_MODIFIED 0x01 /* modified */ 141#define PGA_REFERENCED 0x02 /* referenced */ 142 143/* pvh_usage */ 144#define PGU_NORMAL 0 /* free or normal use */ 145#define PGU_PVENT 1 /* PV entries */ 146#define PGU_L1PT 2 /* level 1 page table */ 147#define PGU_L2PT 3 /* level 2 page table */ 148#define PGU_L3PT 4 /* level 3 page table */ 149 150#define PGU_ISPTPAGE(pgu) ((pgu) >= PGU_L1PT) 151 152struct pv_page_info { 153 TAILQ_ENTRY(pv_page) pgi_list; 154 LIST_HEAD(, pv_entry) pgi_freelist; 155 int pgi_nfree; 156}; 157 158struct pv_page { 159 struct pv_page_info pvp_pgi; 160 struct pv_entry pvp_pv[1]; /* variable length */ 161}; 162 163#ifdef _KERNEL 164 165#ifndef _LKM 166#include "opt_new_scc_driver.h" 167#include "opt_dec_3000_300.h" /* XXX */ 168#include "opt_dec_3000_500.h" /* XXX */ 169#include "opt_dec_kn8ae.h" /* XXX */ 170#include "opt_dec_kn300.h" /* XXX */ 171 172#if defined(NEW_SCC_DRIVER) 173#if defined(DEC_KN8AE) || defined(DEC_KN300) 174#define _PMAP_MAY_USE_PROM_CONSOLE 175#endif 176#else /* ! NEW_SCC_DRIVER */ 177#if defined(DEC_3000_300) \ 178 || defined(DEC_3000_500) \ 179 || defined(DEC_KN300) \ 180 || defined(DEC_KN8AE) /* XXX */ 181#define _PMAP_MAY_USE_PROM_CONSOLE /* XXX */ 182#endif /* XXX */ 183#endif /* NEW_SCC_DRIVER */ 184#endif /* _LKM */ 185 186#define pmap_resident_count(pmap) ((pmap)->pm_stats.resident_count) 187#define pmap_wired_count(pmap) ((pmap)->pm_stats.wired_count) 188 189extern pt_entry_t *VPT; /* Virtual Page Table */ 190 191#define PMAP_STEAL_MEMORY /* enable pmap_steal_memory() */ 192 193vm_offset_t vtophys __P((vm_offset_t)); 194 195/* Machine-specific functions. */ 196void pmap_bootstrap __P((vm_offset_t ptaddr, u_int maxasn)); 197void pmap_emulate_reference __P((struct proc *p, vm_offset_t v, 198 int user, int write)); 199#ifdef _PMAP_MAY_USE_PROM_CONSOLE 200int pmap_uses_prom_console __P((void)); 201#endif 202 203#define pmap_pte_pa(pte) (PG_PFNUM(*(pte)) << PGSHIFT) 204#define pmap_pte_prot(pte) (*(pte) & PG_PROT) 205#define pmap_pte_w(pte) (*(pte) & PG_WIRED) 206#define pmap_pte_v(pte) (*(pte) & PG_V) 207#define pmap_pte_pv(pte) (*(pte) & PG_PVLIST) 208#define pmap_pte_asm(pte) (*(pte) & PG_ASM) 209 210#define pmap_pte_set_w(pte, v) \ 211do { \ 212 if (v) \ 213 *(pte) |= PG_WIRED; \ 214 else \ 215 *(pte) &= ~PG_WIRED; \ 216} while (0) 217 218#define pmap_pte_w_chg(pte, nw) ((nw) ^ pmap_pte_w(pte)) 219 220#define pmap_pte_set_prot(pte, np) \ 221do { \ 222 *(pte) &= ~PG_PROT; \ 223 *(pte) |= (np); \ 224} while (0) 225 226#define pmap_pte_prot_chg(pte, np) ((np) ^ pmap_pte_prot(pte)) 227 228static __inline pt_entry_t *pmap_l2pte __P((pmap_t, vm_offset_t, pt_entry_t *)); 229static __inline pt_entry_t *pmap_l3pte __P((pmap_t, vm_offset_t, pt_entry_t *)); 230 231#define pmap_l1pte(pmap, v) \ 232 (&(pmap)->pm_lev1map[l1pte_index((vm_offset_t)(v))]) 233 234static __inline pt_entry_t * 235pmap_l2pte(pmap, v, l1pte) 236 pmap_t pmap; 237 vm_offset_t v; 238 pt_entry_t *l1pte; 239{ 240 pt_entry_t *lev2map; 241 242 if (l1pte == NULL) { 243 l1pte = pmap_l1pte(pmap, v); 244 if (pmap_pte_v(l1pte) == 0) 245 return (NULL); 246 } 247 248 lev2map = (pt_entry_t *)ALPHA_PHYS_TO_K0SEG(pmap_pte_pa(l1pte)); 249 return (&lev2map[l2pte_index(v)]); 250} 251 252static __inline pt_entry_t * 253pmap_l3pte(pmap, v, l2pte) 254 pmap_t pmap; 255 vm_offset_t v; 256 pt_entry_t *l2pte; 257{ 258 pt_entry_t *l1pte, *lev2map, *lev3map; 259 260 if (l2pte == NULL) { 261 l1pte = pmap_l1pte(pmap, v); 262 if (pmap_pte_v(l1pte) == 0) 263 return (NULL); 264 265 lev2map = (pt_entry_t *)ALPHA_PHYS_TO_K0SEG(pmap_pte_pa(l1pte)); 266 l2pte = &lev2map[l2pte_index(v)]; 267 if (pmap_pte_v(l2pte) == 0) 268 return (NULL); 269 } 270 271 lev3map = (pt_entry_t *)ALPHA_PHYS_TO_K0SEG(pmap_pte_pa(l2pte)); 272 return (&lev3map[l3pte_index(v)]); 273} 274 275#endif /* _KERNEL */ 276 277#endif /* _PMAP_MACHINE_ */ 278