1 /* $NetBSD: pmap.h,v 1.36 2002/09/22 07:53:40 chs 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 * @(#)pmap.h 7.6 (Berkeley) 5/10/91 41 */ 42 #ifndef _MACHINE_PMAP_H_ 43 #define _MACHINE_PMAP_H_ 44 45 /* 46 * Pmap stuff 47 */ 48 struct pmap { 49 pt_entry_t *pm_ptab; /* KVA of page table */ 50 st_entry_t *pm_stab; /* KVA of segment table */ 51 int pm_stfree; /* 040: free lev2 blocks */ 52 u_int *pm_stpa; /* 040: ST phys addr */ 53 short pm_sref; /* segment table ref count */ 54 short pm_count; /* pmap reference count */ 55 long pm_ptpages; /* more stats: PT pages */ 56 struct simplelock pm_lock; /* lock on pmap */ 57 struct pmap_statistics pm_stats; /* pmap statistics */ 58 }; 59 60 typedef struct pmap *pmap_t; 61 62 /* 63 * On the 040 we keep track of which level 2 blocks are already in use 64 * with the pm_stfree mask. Bits are arranged from LSB (block 0) to MSB 65 * (block 31). For convenience, the level 1 table is considered to be 66 * block 0. 67 * 68 * MAX[KU]L2SIZE control how many pages of level 2 descriptors are allowed. 69 * for the kernel and users. 16 implies only the initial "segment table" 70 * page is used. WARNING: don't change MAXUL2SIZE unless you can allocate 71 * physically contiguous pages for the ST in pmap.c! 72 */ 73 #define MAXKL2SIZE 32 74 #define MAXUL2SIZE 16 75 #define l2tobm(n) (1 << (n)) 76 #define bmtol2(n) (ffs(n) - 1) 77 78 /* 79 * Macros for speed 80 */ 81 #define PMAP_ACTIVATE(pmap, loadhw) \ 82 { \ 83 if ((loadhw)) \ 84 loadustp(m68k_btop((paddr_t)(pmap)->pm_stpa)); \ 85 } 86 87 /* 88 * For each struct vm_page, there is a list of all currently valid virtual 89 * mappings of that page. An entry is a pv_entry_t, the list is pv_table. 90 */ 91 typedef struct pv_entry { 92 struct pv_entry *pv_next; /* next pv_entry */ 93 struct pmap *pv_pmap; /* pmap where mapping lies */ 94 vaddr_t pv_va; /* virtual address for mapping */ 95 u_int *pv_ptste; /* non-zero if VA maps a PT page */ 96 struct pmap *pv_ptpmap; /* if pv_ptste, pmap for PT page */ 97 int pv_flags; /* flags */ 98 } *pv_entry_t; 99 100 #define PV_CI 0x01 /* all entries must be cache inhibited */ 101 #define PV_PTPAGE 0x02 /* entry maps a page table page */ 102 103 struct pv_page; 104 105 struct pv_page_info { 106 TAILQ_ENTRY(pv_page) pgi_list; 107 struct pv_entry *pgi_freelist; 108 int pgi_nfree; 109 }; 110 111 /* 112 * This is basically: 113 * ((NBPG - sizeof(struct pv_page_info)) / sizeof(struct pv_entry)) 114 */ 115 #define NPVPPG 340 116 117 struct pv_page { 118 struct pv_page_info pvp_pgi; 119 struct pv_entry pvp_pv[NPVPPG]; 120 }; 121 122 #ifdef _KERNEL 123 extern u_int *Sysmap; 124 extern caddr_t vmmap; /* map for mem, dumps, etc. */ 125 extern struct pmap kernel_pmap_store; 126 127 #define pmap_kernel() (&kernel_pmap_store) 128 129 #define active_pmap(pm) \ 130 ((pm) == pmap_kernel() || (pm) == curproc->p_vmspace->vm_map.pmap) 131 #define active_user_pmap(pm) \ 132 (curproc && \ 133 (pm) != pmap_kernel() && (pm) == curproc->p_vmspace->vm_map.pmap) 134 135 #define pmap_resident_count(pmap) ((pmap)->pm_stats.resident_count) 136 #define pmap_wired_count(pmap) ((pmap)->pm_stats.wired_count) 137 138 #define pmap_update(pmap) /* nothing (yet) */ 139 140 static __inline void 141 pmap_remove_all(struct pmap *pmap) 142 { 143 /* Nothing. */ 144 } 145 146 vaddr_t pmap_map __P((vaddr_t, paddr_t, paddr_t, int)); 147 void pmap_procwr __P((struct proc *, vaddr_t, u_long)); 148 #define PMAP_NEED_PROCWR 149 150 #endif /* _KERNEL */ 151 152 #endif /* !_MACHINE_PMAP_H_ */ 153