1 /* $NetBSD: pmap.h,v 1.23 2001/09/10 21:19:30 chris Exp $ */ 2 3 /* 4 * Copyright (c) 1987 Carnegie-Mellon University 5 * Copyright (c) 1991, 1993 6 * The Regents of the University of California. 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 * @(#)pmap.h 8.1 (Berkeley) 6/10/93 41 */ 42 43 #ifndef _X68K_PMAP_H_ 44 #define _X68K_PMAP_H_ 45 46 #include <machine/cpu.h> 47 #include <machine/pte.h> 48 49 #if defined(M68040) || defined(M68060) 50 #define X68K_SEG_SIZE (mmutype == MMU_68040 ? 0x40000 : NBSEG) 51 #else 52 #define X68K_SEG_SIZE NBSEG 53 #endif 54 55 #define x68k_trunc_seg(x) (((unsigned)(x)) & ~(X68K_SEG_SIZE-1)) 56 #define x68k_round_seg(x) x68k_trunc_seg((unsigned)(x) + X68K_SEG_SIZE-1) 57 58 /* 59 * Pmap stuff 60 */ 61 struct pmap { 62 pt_entry_t *pm_ptab; /* KVA of page table */ 63 st_entry_t *pm_stab; /* KVA of segment table */ 64 int pm_stfree; /* 040: free lev2 blocks */ 65 st_entry_t *pm_stpa; /* 040: ST phys addr */ 66 short pm_sref; /* segment table ref count */ 67 short pm_count; /* pmap reference count */ 68 struct simplelock pm_lock; /* lock on pmap */ 69 struct pmap_statistics pm_stats; /* pmap statistics */ 70 long pm_ptpages; /* more stats: PT pages */ 71 }; 72 73 typedef struct pmap *pmap_t; 74 75 /* 76 * On the 040 we keep track of which level 2 blocks are already in use 77 * with the pm_stfree mask. Bits are arranged from LSB (block 0) to MSB 78 * (block 31). For convenience, the level 1 table is considered to be 79 * block 0. 80 * 81 * MAX[KU]L2SIZE control how many pages of level 2 descriptors are allowed. 82 * for the kernel and users. 8 implies only the initial "segment table" 83 * page is used. WARNING: don't change MAXUL2SIZE unless you can allocate 84 * physically contiguous pages for the ST in pmap.c! 85 */ 86 #define MAXKL2SIZE 32 87 #define MAXUL2SIZE 8 88 #define l2tobm(n) (1 << (n)) 89 #define bmtol2(n) (ffs(n) - 1) 90 91 /* 92 * Macros for speed 93 */ 94 #define PMAP_ACTIVATE(pmap, loadhw) \ 95 { \ 96 if ((loadhw)) \ 97 loadustp(m68k_btop((paddr_t)(pmap)->pm_stpa)); \ 98 } 99 100 /* 101 * For each struct vm_page, there is a list of all currently valid virtual 102 * mappings of that page. An entry is a pv_entry, the list is pv_table. 103 */ 104 struct pv_entry { 105 struct pv_entry *pv_next; /* next pv_entry */ 106 struct pmap *pv_pmap; /* pmap where mapping lies */ 107 vaddr_t pv_va; /* virtual address for mapping */ 108 st_entry_t *pv_ptste; /* non-zero if VA maps a PT page */ 109 struct pmap *pv_ptpmap; /* if pv_ptste, pmap for PT page */ 110 int pv_flags; /* flags */ 111 }; 112 113 #define PV_CI 0x01 /* header: all entries are cache inhibited */ 114 #define PV_PTPAGE 0x02 /* header: entry maps a page table page */ 115 116 struct pv_page; 117 118 struct pv_page_info { 119 TAILQ_ENTRY(pv_page) pgi_list; 120 struct pv_entry *pgi_freelist; 121 int pgi_nfree; 122 }; 123 124 /* 125 * This is basically: 126 * ((NBPG - sizeof(struct pv_page_info)) / sizeof(struct pv_entry)) 127 */ 128 #define NPVPPG 170 129 130 struct pv_page { 131 struct pv_page_info pvp_pgi; 132 struct pv_entry pvp_pv[NPVPPG]; 133 }; 134 135 #ifdef _KERNEL 136 137 extern struct pmap kernel_pmap_store; 138 139 #define pmap_kernel() (&kernel_pmap_store) 140 #define active_pmap(pm) \ 141 ((pm) == pmap_kernel() || (pm) == curproc->p_vmspace->vm_map.pmap) 142 #define active_user_pmap(pm) \ 143 (curproc && \ 144 (pm) != pmap_kernel() && (pm) == curproc->p_vmspace->vm_map.pmap) 145 146 extern struct pv_entry *pv_table; /* array of entries, one per page */ 147 148 #define pmap_resident_count(pmap) ((pmap)->pm_stats.resident_count) 149 #define pmap_wired_count(pmap) ((pmap)->pm_stats.wired_count) 150 151 #define pmap_update(pmap) /* nothing (yet) */ 152 153 extern pt_entry_t *Sysmap; 154 extern char *vmmap; /* map for mem, dumps, etc. */ 155 156 vaddr_t pmap_map __P((vaddr_t, paddr_t, paddr_t, int)); 157 void pmap_procwr __P((struct proc *, vaddr_t, size_t)); 158 #define PMAP_NEED_PROCWR 159 160 /* 161 * Do idle page zero'ing uncached to avoid polluting the cache. 162 */ 163 boolean_t pmap_zero_page_uncached __P((paddr_t)); 164 #define PMAP_PAGEIDLEZERO(pa) pmap_zero_page_uncached((pa)) 165 166 #endif /* _KERNEL */ 167 168 #endif /* !_X68K_PMAP_H_ */ 169