pmap_motorola.h revision 1.21
1 /* $NetBSD: pmap_motorola.h,v 1.21 2009/08/26 00:30:02 thorpej 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 <sys/simplelock.h> 80 #include <machine/cpu.h> 81 #include <machine/pte.h> 82 83 #define M68K_SEG_SIZE NBSEG 84 85 /* 86 * Pmap stuff 87 */ 88 struct pmap { 89 pt_entry_t *pm_ptab; /* KVA of page table */ 90 st_entry_t *pm_stab; /* KVA of segment table */ 91 int pm_stfree; /* 040: free lev2 blocks */ 92 st_entry_t *pm_stpa; /* 040: ST phys addr */ 93 uint16_t pm_sref; /* segment table ref count */ 94 uint16_t pm_count; /* pmap reference count */ 95 struct simplelock pm_lock; /* lock on pmap */ 96 struct pmap_statistics pm_stats; /* pmap statistics */ 97 int pm_ptpages; /* more stats: PT pages */ 98 }; 99 100 /* 101 * On the 040, we keep track of which level 2 blocks are already in use 102 * with the pm_stfree mask. Bits are arranged from LSB (block 0) to MSB 103 * (block 31). For convenience, the level 1 table is considered to be 104 * block 0. 105 * 106 * MAX[KU]L2SIZE control how many pages of level 2 descriptors are allowed. 107 * for the kernel and users. 8 implies only the initial "segment table" 108 * page is used. WARNING: don't change MAXUL2SIZE unless you can allocate 109 * physically contiguous pages for the ST in pmap.c! 110 */ 111 #define MAXKL2SIZE 32 112 #if PAGE_SIZE == 8192 113 #define MAXUL2SIZE 16 114 #else 115 #define MAXUL2SIZE 8 116 #endif 117 #define l2tobm(n) (1 << (n)) 118 #define bmtol2(n) (ffs(n) - 1) 119 120 /* 121 * Macros for speed 122 */ 123 #define PMAP_ACTIVATE(pmap, loadhw) \ 124 { \ 125 if ((loadhw)) \ 126 loadustp(m68k_btop((paddr_t)(pmap)->pm_stpa)); \ 127 } 128 129 /* 130 * For each struct vm_page, there is a list of all currently valid virtual 131 * mappings of that page. An entry is a pv_entry, the list is pv_table. 132 */ 133 struct pv_entry { 134 struct pv_entry *pv_next; /* next pv_entry */ 135 struct pmap *pv_pmap; /* pmap where mapping lies */ 136 vaddr_t pv_va; /* virtual address for mapping */ 137 st_entry_t *pv_ptste; /* non-zero if VA maps a PT page */ 138 struct pmap *pv_ptpmap; /* if pv_ptste, pmap for PT page */ 139 }; 140 141 struct pv_page; 142 143 struct pv_page_info { 144 TAILQ_ENTRY(pv_page) pgi_list; 145 struct pv_entry *pgi_freelist; 146 int pgi_nfree; 147 }; 148 149 /* 150 * This is basically: 151 * ((PAGE_SIZE - sizeof(struct pv_page_info)) / sizeof(struct pv_entry)) 152 */ 153 #if PAGE_SIZE == 8192 154 #define NPVPPG 340 155 #else 156 #define NPVPPG 170 157 #endif 158 159 struct pv_page { 160 struct pv_page_info pvp_pgi; 161 struct pv_entry pvp_pv[NPVPPG]; 162 }; 163 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_header *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 st_entry_t *Sysseg; 184 extern pt_entry_t *Sysmap, *Sysptmap; 185 extern vsize_t Sysptsize; 186 extern vsize_t mem_size; 187 extern vaddr_t virtual_avail, virtual_end; 188 extern u_int protection_codes[]; 189 190 extern char *vmmap; /* map for mem, dumps, etc. */ 191 extern void *CADDR1, *CADDR2; 192 extern void *msgbufaddr; 193 194 vaddr_t pmap_map(vaddr_t, paddr_t, paddr_t, int); 195 void pmap_procwr(struct proc *, vaddr_t, size_t); 196 #define PMAP_NEED_PROCWR 197 198 #ifdef CACHE_HAVE_VAC 199 void pmap_prefer(vaddr_t, vaddr_t *); 200 #define PMAP_PREFER(foff, vap, sz, td) pmap_prefer((foff), (vap)) 201 #endif 202 203 void _pmap_set_page_cacheable(struct pmap *, vaddr_t); 204 void _pmap_set_page_cacheinhibit(struct pmap *, vaddr_t); 205 int _pmap_page_is_cacheable(struct pmap *, vaddr_t); 206 207 #endif /* !_M68K_PMAP_MOTOROLA_H_ */ 208
Indexes created Wed Sep 24 05:09:52 GMT 2025