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