pmap.h revision 1.15
1 /* $NetBSD: pmap.h,v 1.15 1997/05/20 03:25:08 scottr 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/cpu.h> 81 #include <machine/pte.h> 82 83 #if defined(M68040) 84 #define MAC_SEG_SIZE (mmutype == MMU_68040 ? 0x40000 : NBSEG) 85 #else 86 #define MAC_SEG_SIZE NBSEG 87 #endif 88 89 #define mac68k_trunc_seg(x) (((unsigned)(x)) & ~(MAC_SEG_SIZE-1)) 90 #define mac68k_round_seg(x) mac68k_trunc_seg((unsigned)(x)+MAC_SEG_SIZE-1) 91 92 /* 93 * Pmap stuff 94 */ 95 struct pmap { 96 pt_entry_t *pm_ptab; /* KVA of page table */ 97 st_entry_t *pm_stab; /* KVA of segment table */ 98 int pm_stchanged; /* ST changed */ 99 int pm_stfree; /* 040: free lev2 blocks */ 100 st_entry_t *pm_stpa; /* 040: ST phys addr */ 101 short pm_sref; /* segment table ref count */ 102 short pm_count; /* pmap reference count */ 103 simple_lock_data_t pm_lock; /* lock on pmap */ 104 struct pmap_statistics pm_stats; /* pmap statistics */ 105 long pm_ptpages; /* more stats: PT pages */ 106 }; 107 108 typedef struct pmap *pmap_t; 109 110 /* 111 * On the 040, we keep track of which level 2 blocks are already in use 112 * with the pm_stfree mask. Bits are arranged from LSB (block 0) to MSB 113 * (block 31). For convenience, the level 1 table is considered to be 114 * block 0. 115 * 116 * MAX[KU]L2SIZE control how many pages of level 2 descriptors are allowed 117 * for the kernel and users. 8 implies only the initial "segment table" 118 * page is used. WARNING: don't change MAXUL2SIZE unless you can allocate 119 * physically contiguous pages for the ST in pmap.c! 120 */ 121 #define MAXKL2SIZE 32 122 #define MAXUL2SIZE 8 123 #define l2tobm(n) (1 << (n)) 124 #define bmtol2(n) (ffs(n) - 1) 125 126 /* 127 * Macros for speed 128 */ 129 #define PMAP_ACTIVATE(pmapp, pcbp, iscurproc) \ 130 if ((pmapp)->pm_stchanged) { \ 131 (pcbp)->pcb_ustp = mac68k_btop((vm_offset_t)(pmapp)->pm_stpa); \ 132 if (iscurproc) \ 133 loadustp((pcbp)->pcb_ustp); \ 134 (pmapp)->pm_stchanged = FALSE; \ 135 } 136 #define PMAP_DEACTIVATE(pmapp, pcbp) 137 138 /* 139 * For each vm_page_t, there is a list of all currently valid virtual 140 * mappings of that page. An entry is a pv_entry_t, the list is pv_table. 141 */ 142 typedef struct pv_entry { 143 struct pv_entry *pv_next; /* next pv_entry */ 144 struct pmap *pv_pmap; /* pmap where mapping lies */ 145 vm_offset_t pv_va; /* virtual address for mapping */ 146 st_entry_t *pv_ptste; /* non-zero if VA maps a PT page */ 147 struct pmap *pv_ptpmap; /* if pv_ptste, pmap for PT page */ 148 int pv_flags; /* flags */ 149 } *pv_entry_t; 150 151 #define PV_CI 0x01 /* all entries must be cache inhibited */ 152 #define PV_PTPAGE 0x02 /* entry maps a page table page */ 153 154 struct pv_page; 155 156 struct pv_page_info { 157 TAILQ_ENTRY(pv_page) pgi_list; 158 struct pv_entry *pgi_freelist; 159 int pgi_nfree; 160 }; 161 162 /* 163 * This is basically: 164 * ((NBPG - sizeof(struct pv_page_info)) / sizeof(struct pv_entry)) 165 */ 166 #define NPVPPG 170 167 168 struct pv_page { 169 struct pv_page_info pvp_pgi; 170 struct pv_entry pvp_pv[NPVPPG]; 171 }; 172 173 #ifdef _KERNEL 174 struct pmap kernel_pmap_store; 175 176 #define pmap_kernel() (&kernel_pmap_store) 177 #define active_pmap(pm) \ 178 ((pm) == pmap_kernel() || (pm) == curproc->p_vmspace->vm_map.pmap) 179 180 extern struct pv_entry *pv_table; /* array of entries, one per page */ 181 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 190 __BEGIN_DECLS 191 /* pmap.c */ 192 void mac68k_set_pte __P((vm_offset_t va, vm_offset_t pge)); 193 void pmap_remove_mapping __P((pmap_t, vm_offset_t, pt_entry_t *, int)); 194 boolean_t pmap_testbit __P((vm_offset_t, int)); 195 void pmap_changebit __P((vm_offset_t, int, boolean_t)); 196 void pmap_enter_ptpage __P((pmap_t, vm_offset_t)); 197 void pmap_pvdump __P((vm_offset_t)); 198 void pmap_check_wiring __P((char *, vm_offset_t)); 199 void pmap_collect_pv __P((void)); 200 void pmap_activate __P((register pmap_t, struct pcb *)); 201 void pmap_deactivate __P((register pmap_t, struct pcb *)); 202 203 /* pmap_bootstrap.c */ 204 void pmap_bootstrap __P((vm_offset_t, register vm_offset_t)); 205 void bootstrap_mac68k __P((int)); 206 207 /* locore.s */ 208 void loadustp __P((vm_offset_t)); 209 void TBIA __P((void)); 210 void TBIS __P((vm_offset_t)); 211 void DCFP __P((vm_offset_t)); 212 void ICPP __P((vm_offset_t)); 213 __END_DECLS 214 215 #endif /* _KERNEL */ 216 217 #endif /* _PMAP_MACHINE_ */ 218
Indexes created Sat Oct 18 23:09:54 GMT 2025