1 /* $NetBSD: pmap.h,v 1.2 1997/06/21 11:05:34 scw 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 _MACHINE_PMAP_H_ 44 #define _MACHINE_PMAP_H_ 45 46 #include <machine/pte.h> 47 48 #if defined(M68040) 49 #define HP_SEG_SIZE (mmutype == MMU_68040 ? 0x40000 : NBSEG) 50 #else 51 #define HP_SEG_SIZE NBSEG 52 #endif 53 54 /* 55 * Pmap stuff 56 */ 57 struct pmap { 58 pt_entry_t *pm_ptab; /* KVA of page table */ 59 st_entry_t *pm_stab; /* KVA of segment table */ 60 int pm_stchanged; /* ST changed */ 61 int pm_stfree; /* 040: free lev2 blocks */ 62 st_entry_t *pm_stpa; /* 040: ST phys addr */ 63 short pm_sref; /* segment table ref count */ 64 short pm_count; /* pmap reference count */ 65 simple_lock_data_t pm_lock; /* lock on pmap */ 66 struct pmap_statistics pm_stats; /* pmap statistics */ 67 long pm_ptpages; /* more stats: PT pages */ 68 }; 69 70 typedef struct pmap *pmap_t; 71 72 /* 73 * On the 040 we keep track of which level 2 blocks are already in use 74 * with the pm_stfree mask. Bits are arranged from LSB (block 0) to MSB 75 * (block 31). For convenience, the level 1 table is considered to be 76 * block 0. 77 * 78 * MAX[KU]L2SIZE control how many pages of level 2 descriptors are allowed. 79 * for the kernel and users. 8 implies only the initial "segment table" 80 * page is used. WARNING: don't change MAXUL2SIZE unless you can allocate 81 * physically contiguous pages for the ST in pmap.c! 82 */ 83 #define MAXKL2SIZE 32 84 #define MAXUL2SIZE 8 85 #define l2tobm(n) (1 << (n)) 86 #define bmtol2(n) (ffs(n) - 1) 87 88 /* 89 * Macros for speed 90 */ 91 #define PMAP_ACTIVATE(pmapp, pcbp, iscurproc) \ 92 if ((pmapp)->pm_stchanged) { \ 93 (pcbp)->pcb_ustp = m68k_btop((vm_offset_t)(pmapp)->pm_stpa); \ 94 if (iscurproc) \ 95 loadustp((pcbp)->pcb_ustp); \ 96 (pmapp)->pm_stchanged = FALSE; \ 97 } 98 #define PMAP_DEACTIVATE(pmapp, pcbp) 99 100 /* 101 * For each vm_page_t, 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 vm_offset_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 extern vm_offset_t vm_first_phys, vm_num_phys; 139 140 #define pmap_kernel() (&kernel_pmap_store) 141 #define active_pmap(pm) \ 142 ((pm) == pmap_kernel() || (pm) == curproc->p_vmspace->vm_map.pmap) 143 144 extern struct pv_entry *pv_table; /* array of entries, one per page */ 145 146 #define pmap_page_index(pa) atop(pa - vm_first_phys) 147 #define pa_to_pvh(pa) (&pv_table[pmap_page_index(pa)]) 148 149 #define pmap_resident_count(pmap) ((pmap)->pm_stats.resident_count) 150 #define pmap_wired_count(pmap) ((pmap)->pm_stats.wired_count) 151 152 extern pt_entry_t *Sysmap; 153 extern char *vmmap; /* map for mem, dumps, etc. */ 154 #endif /* _KERNEL */ 155 156 #endif /* !_MACHINE_PMAP_H_ */ 157