pmap.h revision 1.35.34.1
1 /* $NetBSD: pmap.h,v 1.35.34.1 2008/01/11 19:19:08 bouyer Exp $ */ 2 3 /* 4 * Copyright (c) 1991 Regents of the University of California. 5 * 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 7.6 (Berkeley) 5/10/91 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 7.6 (Berkeley) 5/10/91 74 */ 75 76 #ifndef _MACHINE_PMAP_H_ 77 #define _MACHINE_PMAP_H_ 78 79 #include <sys/simplelock.h> 80 81 /* 82 * Pmap stuff 83 */ 84 struct pmap { 85 pt_entry_t *pm_ptab; /* KVA of page table */ 86 st_entry_t *pm_stab; /* KVA of segment table */ 87 int pm_stfree; /* 040: free lev2 blocks */ 88 u_int *pm_stpa; /* 040: ST phys. address */ 89 short pm_sref; /* segment table ref count */ 90 short pm_count; /* pmap reference count */ 91 long pm_ptpages; /* more stats: PT pages */ 92 struct simplelock pm_lock; /* lock on pmap */ 93 struct pmap_statistics pm_stats; /* pmap statistics */ 94 }; 95 96 typedef struct pmap *pmap_t; 97 98 /* 99 * On the 040 we keep track of which level 2 blocks are already in use 100 * with the pm_stfree mask. Bits are arranged from LSB (block 0) to MSB 101 * (block 31). For convenience, the level 1 table is considered to be 102 * block 0. 103 * 104 * MAX[KU]L2SIZE control how many pages of level 2 descriptors are allowed. 105 * for the kernel and users. 16 implies only the initial "segment table" 106 * page is used. WARNING: don't change MAXUL2SIZE unless you can allocate 107 * physically contiguous pages for the ST in pmap.c! 108 */ 109 #define MAXKL2SIZE 32 110 #define MAXUL2SIZE 16 111 #define l2tobm(n) (1 << (n)) 112 #define bmtol2(n) (ffs(n) - 1) 113 114 /* 115 * Macros for speed 116 */ 117 #define PMAP_ACTIVATE(pmap, loadhw) \ 118 { \ 119 if ((loadhw)) \ 120 loadustp(m68k_btop((pmap)->pm_stpa)); \ 121 } 122 123 /* 124 * Description of the memory segments. Build in atari_init/start_c(). 125 * This gives a better separation between machine dependent stuff and 126 * the pmap-module. 127 */ 128 #define NMEM_SEGS 8 129 struct memseg { 130 paddr_t start; /* PA of first page in segment */ 131 paddr_t end; /* PA of last page in segment */ 132 int first_page; /* relative page# of 'start' */ 133 }; 134 135 /* 136 * For each struct vm_page, there is a list of all currently valid virtual 137 * mappings of that page. An entry is a pv_entry_t, the list is pv_table. 138 */ 139 typedef struct pv_entry { 140 struct pv_entry *pv_next; /* next pv_entry */ 141 struct pmap *pv_pmap; /* pmap where mapping lies */ 142 vaddr_t pv_va; /* virtual address for mapping */ 143 u_int *pv_ptste; /* non-zero if VA maps a PT page */ 144 struct pmap *pv_ptpmap; /* if pv_ptste, pmap for PT page */ 145 int pv_flags; /* flags */ 146 } *pv_entry_t; 147 148 #define PV_CI 0x01 /* all entries must be cache inhibited */ 149 #define PV_PTPAGE 0x02 /* entry maps a page table page */ 150 151 struct pv_page; 152 153 struct pv_page_info { 154 TAILQ_ENTRY(pv_page) pgi_list; 155 struct pv_entry *pgi_freelist; 156 int pgi_nfree; 157 }; 158 159 /* 160 * This is basically: 161 * ((PAGE_SIZE - sizeof(struct pv_page_info)) / sizeof(struct pv_entry)) 162 */ 163 #define NPVPPG 340 164 165 struct pv_page { 166 struct pv_page_info pvp_pgi; 167 struct pv_entry pvp_pv[NPVPPG]; 168 }; 169 170 #ifdef _KERNEL 171 /* 172 * Memory segment descriptors. 173 * - boot_segs 174 * describes the segments obtainted from the bootcode. 175 * - usable_segs 176 * describes the segments available after system requirements are 177 * substracted (reserved pages, etc...). 178 */ 179 struct memseg boot_segs[NMEM_SEGS]; 180 struct memseg usable_segs[NMEM_SEGS]; 181 182 pv_entry_t pv_table; /* array of entries, one per page */ 183 u_int *Sysmap; 184 char *vmmap; /* map for mem, dumps, etc. */ 185 struct pmap kernel_pmap_store; 186 187 #define pmap_kernel() (&kernel_pmap_store) 188 #define pmap_resident_count(pmap) ((pmap)->pm_stats.resident_count) 189 #define pmap_wired_count(pmap) ((pmap)->pm_stats.wired_count) 190 191 #define pmap_update(pmap) /* nothing (yet) */ 192 193 static __inline void 194 pmap_remove_all(struct pmap *pmap) 195 { 196 /* Nothing. */ 197 } 198 199 #define active_user_pmap(pm) \ 200 (curproc && \ 201 (pm) != pmap_kernel() && (pm) == curproc->p_vmspace->vm_map.pmap) 202 203 void pmap_bootstrap __P((psize_t, u_int, u_int)); 204 void pmap_changebit __P((paddr_t, int, bool)); 205 206 vaddr_t pmap_map __P((vaddr_t, paddr_t, paddr_t, int)); 207 void pmap_procwr __P((struct proc *, vaddr_t, u_long)); 208 #define PMAP_NEED_PROCWR 209 210 #endif /* _KERNEL */ 211 212 #endif /* !_MACHINE_PMAP_H_ */ 213
Indexes created Sun Oct 19 02:09:48 GMT 2025