pmap.h revision 1.32.2.3
1 1.32.2.3 jdolecek /* $NetBSD: pmap.h,v 1.32.2.3 2002/10/10 18:31:34 jdolecek Exp $ */ 2 1.10 cgd 3 1.1 mw /* 4 1.1 mw * Copyright (c) 1987 Carnegie-Mellon University 5 1.1 mw * Copyright (c) 1991 Regents of the University of California. 6 1.1 mw * All rights reserved. 7 1.1 mw * 8 1.1 mw * This code is derived from software contributed to Berkeley by 9 1.1 mw * the Systems Programming Group of the University of Utah Computer 10 1.1 mw * Science Department. 11 1.1 mw * 12 1.1 mw * Redistribution and use in source and binary forms, with or without 13 1.1 mw * modification, are permitted provided that the following conditions 14 1.1 mw * are met: 15 1.1 mw * 1. Redistributions of source code must retain the above copyright 16 1.1 mw * notice, this list of conditions and the following disclaimer. 17 1.1 mw * 2. Redistributions in binary form must reproduce the above copyright 18 1.1 mw * notice, this list of conditions and the following disclaimer in the 19 1.1 mw * documentation and/or other materials provided with the distribution. 20 1.1 mw * 3. All advertising materials mentioning features or use of this software 21 1.1 mw * must display the following acknowledgement: 22 1.1 mw * This product includes software developed by the University of 23 1.1 mw * California, Berkeley and its contributors. 24 1.1 mw * 4. Neither the name of the University nor the names of its contributors 25 1.1 mw * may be used to endorse or promote products derived from this software 26 1.1 mw * without specific prior written permission. 27 1.1 mw * 28 1.1 mw * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 29 1.1 mw * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 30 1.1 mw * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 31 1.1 mw * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 32 1.1 mw * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 33 1.1 mw * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 34 1.1 mw * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 35 1.1 mw * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 36 1.1 mw * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 37 1.1 mw * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 38 1.1 mw * SUCH DAMAGE. 39 1.1 mw * 40 1.3 mw * @(#)pmap.h 7.6 (Berkeley) 5/10/91 41 1.1 mw */ 42 1.7 chopps #ifndef _MACHINE_PMAP_H_ 43 1.7 chopps #define _MACHINE_PMAP_H_ 44 1.1 mw 45 1.1 mw /* 46 1.15 chopps * Pmap stuff 47 1.1 mw */ 48 1.1 mw struct pmap { 49 1.16 chopps pt_entry_t *pm_ptab; /* KVA of page table */ 50 1.16 chopps st_entry_t *pm_stab; /* KVA of segment table */ 51 1.16 chopps int pm_stfree; /* 040: free lev2 blocks */ 52 1.16 chopps u_int *pm_stpa; /* 040: ST phys addr */ 53 1.16 chopps short pm_sref; /* segment table ref count */ 54 1.16 chopps short pm_count; /* pmap reference count */ 55 1.16 chopps long pm_ptpages; /* more stats: PT pages */ 56 1.31 chs struct simplelock pm_lock; /* lock on pmap */ 57 1.1 mw struct pmap_statistics pm_stats; /* pmap statistics */ 58 1.1 mw }; 59 1.1 mw 60 1.16 chopps typedef struct pmap *pmap_t; 61 1.16 chopps 62 1.16 chopps /* 63 1.16 chopps * On the 040 we keep track of which level 2 blocks are already in use 64 1.16 chopps * with the pm_stfree mask. Bits are arranged from LSB (block 0) to MSB 65 1.16 chopps * (block 31). For convenience, the level 1 table is considered to be 66 1.16 chopps * block 0. 67 1.16 chopps * 68 1.16 chopps * MAX[KU]L2SIZE control how many pages of level 2 descriptors are allowed. 69 1.16 chopps * for the kernel and users. 16 implies only the initial "segment table" 70 1.16 chopps * page is used. WARNING: don't change MAXUL2SIZE unless you can allocate 71 1.16 chopps * physically contiguous pages for the ST in pmap.c! 72 1.16 chopps */ 73 1.16 chopps #define MAXKL2SIZE 32 74 1.16 chopps #define MAXUL2SIZE 16 75 1.16 chopps #define l2tobm(n) (1 << (n)) 76 1.16 chopps #define bmtol2(n) (ffs(n) - 1) 77 1.1 mw 78 1.1 mw /* 79 1.1 mw * Macros for speed 80 1.1 mw */ 81 1.21 thorpej #define PMAP_ACTIVATE(pmap, loadhw) \ 82 1.18 thorpej { \ 83 1.21 thorpej if ((loadhw)) \ 84 1.27 is loadustp(m68k_btop((paddr_t)(pmap)->pm_stpa)); \ 85 1.18 thorpej } 86 1.1 mw 87 1.1 mw /* 88 1.32 chs * For each struct vm_page, there is a list of all currently valid virtual 89 1.1 mw * mappings of that page. An entry is a pv_entry_t, the list is pv_table. 90 1.1 mw */ 91 1.1 mw typedef struct pv_entry { 92 1.1 mw struct pv_entry *pv_next; /* next pv_entry */ 93 1.1 mw struct pmap *pv_pmap; /* pmap where mapping lies */ 94 1.27 is vaddr_t pv_va; /* virtual address for mapping */ 95 1.9 chopps u_int *pv_ptste; /* non-zero if VA maps a PT page */ 96 1.1 mw struct pmap *pv_ptpmap; /* if pv_ptste, pmap for PT page */ 97 1.1 mw int pv_flags; /* flags */ 98 1.1 mw } *pv_entry_t; 99 1.1 mw 100 1.1 mw #define PV_CI 0x01 /* all entries must be cache inhibited */ 101 1.1 mw #define PV_PTPAGE 0x02 /* entry maps a page table page */ 102 1.1 mw 103 1.16 chopps struct pv_page; 104 1.16 chopps 105 1.16 chopps struct pv_page_info { 106 1.16 chopps TAILQ_ENTRY(pv_page) pgi_list; 107 1.16 chopps struct pv_entry *pgi_freelist; 108 1.16 chopps int pgi_nfree; 109 1.16 chopps }; 110 1.16 chopps 111 1.16 chopps /* 112 1.16 chopps * This is basically: 113 1.16 chopps * ((NBPG - sizeof(struct pv_page_info)) / sizeof(struct pv_entry)) 114 1.16 chopps */ 115 1.16 chopps #define NPVPPG 340 116 1.16 chopps 117 1.16 chopps struct pv_page { 118 1.16 chopps struct pv_page_info pvp_pgi; 119 1.16 chopps struct pv_entry pvp_pv[NPVPPG]; 120 1.16 chopps }; 121 1.16 chopps 122 1.13 jtc #ifdef _KERNEL 123 1.32.2.2 jdolecek extern u_int *Sysmap; 124 1.32.2.2 jdolecek extern caddr_t vmmap; /* map for mem, dumps, etc. */ 125 1.32.2.2 jdolecek extern struct pmap kernel_pmap_store; 126 1.18 thorpej 127 1.12 mycroft #define pmap_kernel() (&kernel_pmap_store) 128 1.18 thorpej 129 1.16 chopps #define active_pmap(pm) \ 130 1.16 chopps ((pm) == pmap_kernel() || (pm) == curproc->p_vmspace->vm_map.pmap) 131 1.18 thorpej #define active_user_pmap(pm) \ 132 1.18 thorpej (curproc && \ 133 1.18 thorpej (pm) != pmap_kernel() && (pm) == curproc->p_vmspace->vm_map.pmap) 134 1.18 thorpej 135 1.1 mw #define pmap_resident_count(pmap) ((pmap)->pm_stats.resident_count) 136 1.16 chopps #define pmap_wired_count(pmap) ((pmap)->pm_stats.wired_count) 137 1.28 thorpej 138 1.32.2.1 thorpej #define pmap_update(pmap) /* nothing (yet) */ 139 1.32.2.3 jdolecek 140 1.32.2.3 jdolecek static __inline void 141 1.32.2.3 jdolecek pmap_remove_all(struct pmap *pmap) 142 1.32.2.3 jdolecek { 143 1.32.2.3 jdolecek /* Nothing. */ 144 1.32.2.3 jdolecek } 145 1.23 cgd 146 1.27 is vaddr_t pmap_map __P((vaddr_t, paddr_t, paddr_t, int)); 147 1.27 is void pmap_procwr __P((struct proc *, vaddr_t, u_long)); 148 1.26 is #define PMAP_NEED_PROCWR 149 1.18 thorpej 150 1.13 jtc #endif /* _KERNEL */ 151 1.1 mw 152 1.7 chopps #endif /* !_MACHINE_PMAP_H_ */ 153
Indexes created Wed Oct 22 00:09:40 GMT 2025