pmap.h revision 1.5
1 /* 2 * Copyright (c) 1987 Carnegie-Mellon University 3 * Copyright (c) 1991, 1993 4 * The Regents of the University of California. All rights reserved. 5 * 6 * This code is derived from software contributed to Berkeley by 7 * the Systems Programming Group of the University of Utah Computer 8 * Science Department. 9 * 10 * Redistribution and use in source and binary forms, with or without 11 * modification, are permitted provided that the following conditions 12 * are met: 13 * 1. Redistributions of source code must retain the above copyright 14 * notice, this list of conditions and the following disclaimer. 15 * 2. Redistributions in binary form must reproduce the above copyright 16 * notice, this list of conditions and the following disclaimer in the 17 * documentation and/or other materials provided with the distribution. 18 * 3. All advertising materials mentioning features or use of this software 19 * must display the following acknowledgement: 20 * This product includes software developed by the University of 21 * California, Berkeley and its contributors. 22 * 4. Neither the name of the University nor the names of its contributors 23 * may be used to endorse or promote products derived from this software 24 * without specific prior written permission. 25 * 26 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 27 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 28 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 29 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 30 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 31 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 32 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 33 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 34 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 35 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 36 * SUCH DAMAGE. 37 * 38 * from: @(#)pmap.h 8.1 (Berkeley) 6/10/93 39 * $Id: pmap.h,v 1.5 1994/09/09 23:56:16 mycroft Exp $ 40 */ 41 42 #ifndef _HP300_PMAP_H_ 43 #define _HP300_PMAP_H_ 44 45 #include <machine/pte.h> 46 47 #if defined(HP380) 48 #define HP_SEG_SIZE (mmutype == MMU_68040 ? 0x40000 : NBSEG) 49 #else 50 #define HP_SEG_SIZE NBSEG 51 #endif 52 53 #define hp300_trunc_seg(x) (((unsigned)(x)) & ~(HP_SEG_SIZE-1)) 54 #define hp300_round_seg(x) hp300_trunc_seg((unsigned)(x) + HP_SEG_SIZE-1) 55 56 /* 57 * Pmap stuff 58 */ 59 struct pmap { 60 pt_entry_t *pm_ptab; /* KVA of page table */ 61 st_entry_t *pm_stab; /* KVA of segment table */ 62 int pm_stchanged; /* ST changed */ 63 int pm_stfree; /* 040: free lev2 blocks */ 64 st_entry_t *pm_stpa; /* 040: ST phys addr */ 65 short pm_sref; /* segment table ref count */ 66 short pm_count; /* pmap reference count */ 67 simple_lock_data_t pm_lock; /* lock on pmap */ 68 struct pmap_statistics pm_stats; /* pmap statistics */ 69 long pm_ptpages; /* more stats: PT pages */ 70 }; 71 72 typedef struct pmap *pmap_t; 73 74 /* 75 * On the 040 we keep track of which level 2 blocks are already in use 76 * with the pm_stfree mask. Bits are arranged from LSB (block 0) to MSB 77 * (block 31). For convenience, the level 1 table is considered to be 78 * block 0. 79 * 80 * MAX[KU]L2SIZE control how many pages of level 2 descriptors are allowed. 81 * for the kernel and users. 8 implies only the initial "segment table" 82 * page is used. WARNING: don't change MAXUL2SIZE unless you can allocate 83 * physically contiguous pages for the ST in pmap.c! 84 */ 85 #define MAXKL2SIZE 32 86 #define MAXUL2SIZE 8 87 #define l2tobm(n) (1 << (n)) 88 #define bmtol2(n) (ffs(n) - 1) 89 90 /* 91 * Macros for speed 92 */ 93 #define PMAP_ACTIVATE(pmapp, pcbp, iscurproc) \ 94 if ((pmapp)->pm_stchanged) { \ 95 (pcbp)->pcb_ustp = hp300_btop((vm_offset_t)(pmapp)->pm_stpa); \ 96 if (iscurproc) \ 97 loadustp((pcbp)->pcb_ustp); \ 98 (pmapp)->pm_stchanged = FALSE; \ 99 } 100 #define PMAP_DEACTIVATE(pmapp, pcbp) 101 102 /* 103 * For each vm_page_t, there is a list of all currently valid virtual 104 * mappings of that page. An entry is a pv_entry, the list is pv_table. 105 */ 106 struct pv_entry { 107 struct pv_entry *pv_next; /* next pv_entry */ 108 struct pmap *pv_pmap; /* pmap where mapping lies */ 109 vm_offset_t pv_va; /* virtual address for mapping */ 110 st_entry_t *pv_ptste; /* non-zero if VA maps a PT page */ 111 struct pmap *pv_ptpmap; /* if pv_ptste, pmap for PT page */ 112 int pv_flags; /* flags */ 113 }; 114 115 #define PV_CI 0x01 /* header: all entries are cache inhibited */ 116 #define PV_PTPAGE 0x02 /* header: entry maps a page table page */ 117 118 struct pv_page; 119 120 struct pv_page_info { 121 TAILQ_ENTRY(pv_page) pgi_list; 122 struct pv_entry *pgi_freelist; 123 int pgi_nfree; 124 }; 125 126 /* 127 * This is basically: 128 * ((NBPG - sizeof(struct pv_page_info)) / sizeof(struct pv_entry)) 129 */ 130 #define NPVPPG 170 131 132 struct pv_page { 133 struct pv_page_info pvp_pgi; 134 struct pv_entry pvp_pv[NPVPPG]; 135 }; 136 137 #ifdef KERNEL 138 #if defined(HP320) || defined(HP350) 139 #define HAVEVAC /* include cheezy VAC support */ 140 #endif 141 142 extern struct pmap kernel_pmap_store; 143 144 #define kernel_pmap (&kernel_pmap_store) 145 #define active_pmap(pm) \ 146 ((pm) == kernel_pmap || (pm) == curproc->p_vmspace->vm_map.pmap) 147 148 extern struct pv_entry *pv_table; /* array of entries, one per page */ 149 150 #define pmap_page_index(pa) atop(pa - vm_first_phys) 151 #define pa_to_pvh(pa) (&pv_table[pmap_page_index(pa)]) 152 153 #define pmap_resident_count(pmap) ((pmap)->pm_stats.resident_count) 154 #define pmap_wired_count(pmap) ((pmap)->pm_stats.wired_count) 155 156 extern pt_entry_t *Sysmap; 157 extern char *vmmap; /* map for mem, dumps, etc. */ 158 #endif /* KERNEL */ 159 160 #endif /* !_HP300_PMAP_H_ */ 161
Indexes created Fri Sep 26 08:10:20 GMT 2025