pmap.h revision 1.10
1 /* $NetBSD: pmap.h,v 1.10 1995/06/21 03:14:06 briggs Exp $ */ 2 3 /* 4 * Copyright (c) 1987 Carnegie-Mellon University 5 * Copyright (c) 1991 Regents of the University of California. 6 * All rights reserved. 7 * 8 * This code is derived from software contributed to Berkeley by 9 * the Systems Programming Group of the University of Utah Computer 10 * Science Department. 11 * 12 * Redistribution and use in source and binary forms, with or without 13 * modification, are permitted provided that the following conditions 14 * are met: 15 * 1. Redistributions of source code must retain the above copyright 16 * notice, this list of conditions and the following disclaimer. 17 * 2. Redistributions in binary form must reproduce the above copyright 18 * notice, this list of conditions and the following disclaimer in the 19 * documentation and/or other materials provided with the distribution. 20 * 3. All advertising materials mentioning features or use of this software 21 * must display the following acknowledgement: 22 * This product includes software developed by the University of 23 * California, Berkeley and its contributors. 24 * 4. Neither the name of the University nor the names of its contributors 25 * may be used to endorse or promote products derived from this software 26 * without specific prior written permission. 27 * 28 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 29 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 30 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 31 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 32 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 33 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 34 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 35 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 36 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 37 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 38 * SUCH DAMAGE. 39 */ 40 /*- 41 * Copyright (C) 1993 Allen K. Briggs, Chris P. Caputo, 42 * Michael L. Finch, Bradley A. Grantham, and 43 * Lawrence A. Kesteloot 44 * All rights reserved. 45 * 46 * Redistribution and use in source and binary forms, with or without 47 * modification, are permitted provided that the following conditions 48 * are met: 49 * 1. Redistributions of source code must retain the above copyright 50 * notice, this list of conditions and the following disclaimer. 51 * 2. Redistributions in binary form must reproduce the above copyright 52 * notice, this list of conditions and the following disclaimer in the 53 * documentation and/or other materials provided with the distribution. 54 * 3. All advertising materials mentioning features or use of this software 55 * must display the following acknowledgement: 56 * This product includes software developed by the Alice Group. 57 * 4. The names of the Alice Group or any of its members may not be used 58 * to endorse or promote products derived from this software without 59 * specific prior written permission. 60 * 61 * THIS SOFTWARE IS PROVIDED BY THE ALICE GROUP ``AS IS'' AND ANY EXPRESS OR 62 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 63 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 64 * IN NO EVENT SHALL THE ALICE GROUP BE LIABLE FOR ANY DIRECT, INDIRECT, 65 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 66 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 67 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 68 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 69 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 70 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 71 * 72 */ 73 74 /* 75 * @(#)pmap.h 7.6 (Berkeley) 5/10/91 76 */ 77 #ifndef _PMAP_MACHINE_ 78 #define _PMAP_MACHINE_ 79 80 #include <machine/pte.h> 81 82 #if defined(M68040) 83 #define MAC_SEG_SIZE (mmutype == MMU_68040 ? 0x40000 : NBSEG) 84 #else 85 #define MAC_SEG_SIZE NBSEG 86 #endif 87 88 #define mac68k_trunc_seg(x) (((unsigned)(x)) & ~(MAC_SEG_SIZE-1)) 89 #define mac68k_round_seg(x) mac68k_trunc_seg((unsigned)(x)+MAC_SEG_SIZE-1) 90 91 /* 92 * Pmap stuff 93 */ 94 struct pmap { 95 pt_entry_t *pm_ptab; /* KVA of page table */ 96 st_entry_t *pm_stab; /* KVA of segment table */ 97 int pm_stchanged; /* ST changed */ 98 int pm_stfree; /* 040: free lev2 blocks */ 99 st_entry_t *pm_stpa; /* 040: ST phys addr */ 100 short pm_sref; /* segment table ref count */ 101 short pm_count; /* pmap reference count */ 102 simple_lock_data_t pm_lock; /* lock on pmap */ 103 struct pmap_statistics pm_stats; /* pmap statistics */ 104 long pm_ptpages; /* more stats: PT pages */ 105 }; 106 107 typedef struct pmap *pmap_t; 108 109 /* 110 * On the 040, we keep track of which level 2 blocks are already in use 111 * with the pm_stfree mask. Bits are arranged from LSB (block 0) to MSB 112 * (block 31). For convenience, the level 1 table is considered to be 113 * block 0. 114 * 115 * MAX[KU]L2SIZE control how many pages of level 2 descriptors are allowed 116 * for the kernel and users. 8 implies only the initial "segment table" 117 * page is used. WARNING: don't change MAXUL2SIZE unless you can allocate 118 * physically contiguous pages for the ST in pmap.c! 119 */ 120 #define MAXKL2SIZE 32 121 #define MAXUL2SIZE 8 122 #define l2tobm(n) (1 << (n)) 123 #define bmtol2(n) (ffs(n) - 1) 124 125 /* 126 * Macros for speed 127 */ 128 #define PMAP_ACTIVATE(pmapp, pcbp, iscurproc) \ 129 if ((pmapp)->pm_stchanged) { \ 130 (pcbp)->pcb_ustp = mac68k_btop((vm_offset_t)(pmapp)->pm_stpa); \ 131 if (iscurproc) \ 132 loadustp((pcbp)->pcb_ustp); \ 133 (pmapp)->pm_stchanged = FALSE; \ 134 } 135 #define PMAP_DEACTIVATE(pmapp, pcbp) 136 137 /* 138 * For each vm_page_t, there is a list of all currently valid virtual 139 * mappings of that page. An entry is a pv_entry_t, the list is pv_table. 140 */ 141 typedef struct pv_entry { 142 struct pv_entry *pv_next; /* next pv_entry */ 143 struct pmap *pv_pmap; /* pmap where mapping lies */ 144 vm_offset_t pv_va; /* virtual address for mapping */ 145 st_entry_t *pv_ptste; /* non-zero if VA maps a PT page */ 146 struct pmap *pv_ptpmap; /* if pv_ptste, pmap for PT page */ 147 int pv_flags; /* flags */ 148 } *pv_entry_t; 149 150 #define PV_CI 0x01 /* all entries must be cache inhibited */ 151 #define PV_PTPAGE 0x02 /* entry maps a page table page */ 152 153 struct pv_page; 154 155 struct pv_page_info { 156 TAILQ_ENTRY(pv_page) pgi_list; 157 struct pv_entry *pgi_freelist; 158 int pgi_nfree; 159 }; 160 161 /* 162 * This is basically: 163 * ((NBPG - sizeof(struct pv_page_info)) / sizeof(struct pv_entry)) 164 */ 165 #define NPVPPG 170 166 167 struct pv_page { 168 struct pv_page_info pvp_pgi; 169 struct pv_entry pvp_pv[NPVPPG]; 170 }; 171 172 #ifdef _KERNEL 173 struct pmap kernel_pmap_store; 174 175 #define pmap_kernel() (&kernel_pmap_store) 176 #define active_pmap(pm) \ 177 ((pm) == pmap_kernel() || (pm) == curproc->p_vmspace->vm_map.pmap) 178 179 extern struct pv_entry *pv_table; /* array of entries, one per page */ 180 181 #define pmap_page_index(pa) pmap_page_index(pa) 182 #define pa_to_pvh(pa) (&pv_table[pmap_page_index(pa)]) 183 184 #define pmap_resident_count(pmap) ((pmap)->pm_stats.resident_count) 185 #define pmap_wired_count(pmap) ((pmap)->pm_stats.wired_count) 186 187 extern pt_entry_t *Sysmap; 188 extern char *vmmap; /* map for mem, dumps, etc. */ 189 #endif /* _KERNEL */ 190 191 #endif _PMAP_MACHINE_ 192
Indexes created Sat Oct 18 17:09:52 GMT 2025