1 /* $NetBSD: pmap.h,v 1.17 1997/06/10 18:34:52 veego 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_stchanged; /* ST changed */ 52 int pm_stfree; /* 040: free lev2 blocks */ 53 u_int *pm_stpa; /* 040: ST phys addr */ 54 short pm_sref; /* segment table ref count */ 55 short pm_count; /* pmap reference count */ 56 long pm_ptpages; /* more stats: PT pages */ 57 simple_lock_data_t pm_lock; /* lock on pmap */ 58 struct pmap_statistics pm_stats; /* pmap statistics */ 59 }; 60 61 typedef struct pmap *pmap_t; 62 63 /* 64 * On the 040 we keep track of which level 2 blocks are already in use 65 * with the pm_stfree mask. Bits are arranged from LSB (block 0) to MSB 66 * (block 31). For convenience, the level 1 table is considered to be 67 * block 0. 68 * 69 * MAX[KU]L2SIZE control how many pages of level 2 descriptors are allowed. 70 * for the kernel and users. 16 implies only the initial "segment table" 71 * page is used. WARNING: don't change MAXUL2SIZE unless you can allocate 72 * physically contiguous pages for the ST in pmap.c! 73 */ 74 #define MAXKL2SIZE 32 75 #define MAXUL2SIZE 16 76 #define l2tobm(n) (1 << (n)) 77 #define bmtol2(n) (ffs(n) - 1) 78 79 /* 80 * Macros for speed 81 */ 82 #define PMAP_ACTIVATE(pmapp, pcbp, iscurproc) \ 83 if ((pmapp) != NULL && (pmapp)->pm_stchanged) { \ 84 (pcbp)->pcb_ustp = \ 85 m68k_btop((vm_offset_t)(pmapp)->pm_stpa); \ 86 if (iscurproc) \ 87 loadustp((pcbp)->pcb_ustp); \ 88 (pmapp)->pm_stchanged = FALSE; \ 89 } 90 #define PMAP_DEACTIVATE(pmapp, pcbp) 91 92 /* 93 * For each vm_page_t, there is a list of all currently valid virtual 94 * mappings of that page. An entry is a pv_entry_t, the list is pv_table. 95 */ 96 typedef struct pv_entry { 97 struct pv_entry *pv_next; /* next pv_entry */ 98 struct pmap *pv_pmap; /* pmap where mapping lies */ 99 vm_offset_t pv_va; /* virtual address for mapping */ 100 u_int *pv_ptste; /* non-zero if VA maps a PT page */ 101 struct pmap *pv_ptpmap; /* if pv_ptste, pmap for PT page */ 102 int pv_flags; /* flags */ 103 } *pv_entry_t; 104 105 #define PV_CI 0x01 /* all entries must be cache inhibited */ 106 #define PV_PTPAGE 0x02 /* entry maps a page table page */ 107 108 struct pv_page; 109 110 struct pv_page_info { 111 TAILQ_ENTRY(pv_page) pgi_list; 112 struct pv_entry *pgi_freelist; 113 int pgi_nfree; 114 }; 115 116 /* 117 * This is basically: 118 * ((NBPG - sizeof(struct pv_page_info)) / sizeof(struct pv_entry)) 119 */ 120 #define NPVPPG 340 121 122 struct pv_page { 123 struct pv_page_info pvp_pgi; 124 struct pv_entry pvp_pv[NPVPPG]; 125 }; 126 127 #ifdef _KERNEL 128 pv_entry_t pv_table; /* array of entries, one per page */ 129 u_int *Sysmap; 130 char *vmmap; /* map for mem, dumps, etc. */ 131 struct pmap kernel_pmap_store; 132 133 #ifdef MACHINE_NONCONTIG 134 #define pa_index(pa) pmap_page_index(pa) 135 #else 136 #define pa_index(pa) atop(pa - vm_first_phys) 137 #endif 138 #define pa_to_pvh(pa) (&pv_table[pa_index(pa)]) 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 pmap_resident_count(pmap) ((pmap)->pm_stats.resident_count) 143 #define pmap_wired_count(pmap) ((pmap)->pm_stats.wired_count) 144 #endif /* _KERNEL */ 145 146 #endif /* !_MACHINE_PMAP_H_ */ 147