pmap.h revision 15472
1/* 2 * Copyright (c) 1991 Regents of the University of California. 3 * All rights reserved. 4 * 5 * This code is derived from software contributed to Berkeley by 6 * the Systems Programming Group of the University of Utah Computer 7 * Science Department and William Jolitz of UUNET Technologies Inc. 8 * 9 * Redistribution and use in source and binary forms, with or without 10 * modification, are permitted provided that the following conditions 11 * are met: 12 * 1. Redistributions of source code must retain the above copyright 13 * notice, this list of conditions and the following disclaimer. 14 * 2. Redistributions in binary form must reproduce the above copyright 15 * notice, this list of conditions and the following disclaimer in the 16 * documentation and/or other materials provided with the distribution. 17 * 3. All advertising materials mentioning features or use of this software 18 * must display the following acknowledgement: 19 * This product includes software developed by the University of 20 * California, Berkeley and its contributors. 21 * 4. Neither the name of the University nor the names of its contributors 22 * may be used to endorse or promote products derived from this software 23 * without specific prior written permission. 24 * 25 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 26 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 27 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 28 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 29 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 30 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 31 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 32 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 33 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 34 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 35 * SUCH DAMAGE. 36 * 37 * Derived from hp300 version by Mike Hibler, this version by William 38 * Jolitz uses a recursive map [a pde points to the page directory] to 39 * map the page tables using the pagetables themselves. This is done to 40 * reduce the impact on kernel virtual memory for lots of sparse address 41 * space, and to reduce the cost of memory to each process. 42 * 43 * from: hp300: @(#)pmap.h 7.2 (Berkeley) 12/16/90 44 * from: @(#)pmap.h 7.4 (Berkeley) 5/12/91 45 * $Id: pmap.h,v 1.35 1996/04/03 05:23:44 dyson Exp $ 46 */ 47 48#ifndef _MACHINE_PMAP_H_ 49#define _MACHINE_PMAP_H_ 50 51#include <machine/pte.h> 52 53typedef unsigned int *pd_entry_t; 54typedef unsigned int *pt_entry_t; 55struct vm_map; 56 57/* 58 * NKPDE controls the virtual space of the kernel, what ever is left, minus 59 * the alternate page table area is given to the user (NUPDE) 60 */ 61/* 62 * NKPDE controls the virtual space of the kernel, what ever is left is 63 * given to the user (NUPDE) 64 */ 65#ifndef NKPT 66#if 0 67#define NKPT 26 /* actual number of kernel page tables */ 68#else 69#define NKPT 9 /* actual number of kernel page tables */ 70#endif 71#endif 72#ifndef NKPDE 73#define NKPDE 63 /* addressable number of page tables/pde's */ 74#endif 75 76/* 77 * The *PTDI values control the layout of virtual memory 78 * 79 * XXX This works for now, but I am not real happy with it, I'll fix it 80 * right after I fix locore.s and the magic 28K hole 81 */ 82#define APTDPTDI (NPTEPG-1) /* alt ptd entry that points to APTD */ 83#define KPTDI (APTDPTDI-NKPDE)/* start of kernel virtual pde's */ 84#define PTDPTDI (KPTDI-1) /* ptd entry that points to ptd! */ 85#define KSTKPTDI (PTDPTDI-1) /* ptd entry for u./kernel&user stack */ 86#define KSTKPTEOFF (NPTEPG-UPAGES) /* pte entry for kernel stack */ 87 88#define PDESIZE sizeof(pd_entry_t) /* for assembly files */ 89#define PTESIZE sizeof(pt_entry_t) /* for assembly files */ 90 91/* 92 * Address of current and alternate address space page table maps 93 * and directories. 94 */ 95#ifdef KERNEL 96extern pt_entry_t PTmap[], APTmap[], Upte; 97extern pd_entry_t PTD[], APTD[], PTDpde, APTDpde, Upde; 98 99extern int IdlePTD; /* physical address of "Idle" state directory */ 100#endif 101 102/* 103 * virtual address to page table entry and 104 * to physical address. Likewise for alternate address space. 105 * Note: these work recursively, thus vtopte of a pte will give 106 * the corresponding pde that in turn maps it. 107 */ 108#define vtopte(va) (PTmap + i386_btop(va)) 109#define kvtopte(va) vtopte(va) 110#define ptetov(pt) (i386_ptob(pt - PTmap)) 111#define vtophys(va) (((int) (*vtopte(va))&PG_FRAME) | ((int)(va) & PGOFSET)) 112#define ispt(va) ((va) >= UPT_MIN_ADDRESS && (va) <= KPT_MAX_ADDRESS) 113 114#define avtopte(va) (APTmap + i386_btop(va)) 115#define ptetoav(pt) (i386_ptob(pt - APTmap)) 116#define avtophys(va) (((int) (*avtopte(va))&PG_FRAME) | ((int)(va) & PGOFSET)) 117 118#ifdef KERNEL 119/* 120 * Routine: pmap_kextract 121 * Function: 122 * Extract the physical page address associated 123 * kernel virtual address. 124 */ 125static __inline vm_offset_t 126pmap_kextract(vm_offset_t va) 127{ 128 vm_offset_t pa = *(int *)vtopte(va); 129 pa = (pa & PG_FRAME) | (va & ~PG_FRAME); 130 return pa; 131} 132#endif 133 134/* 135 * macros to generate page directory/table indices 136 */ 137 138#define pdei(va) (((va)&PD_MASK)>>PD_SHIFT) 139#define ptei(va) (((va)&PT_MASK)>>PG_SHIFT) 140 141/* 142 * Pmap stuff 143 */ 144 145struct pmap { 146 pd_entry_t *pm_pdir; /* KVA of page directory */ 147 short pm_dref; /* page directory ref count */ 148 short pm_count; /* pmap reference count */ 149 struct pmap_statistics pm_stats; /* pmap statistics */ 150 struct vm_map *pm_map; /* map that owns this pmap */ 151}; 152 153typedef struct pmap *pmap_t; 154 155#ifdef KERNEL 156extern pmap_t kernel_pmap; 157#endif 158 159/* 160 * For each vm_page_t, there is a list of all currently valid virtual 161 * mappings of that page. An entry is a pv_entry_t, the list is pv_table. 162 */ 163typedef struct pv_entry { 164 struct pv_entry *pv_next; /* next pv_entry */ 165 pmap_t pv_pmap; /* pmap where mapping lies */ 166 vm_offset_t pv_va; /* virtual address for mapping */ 167 vm_page_t pv_ptem; /* VM page for pte */ 168} *pv_entry_t; 169 170#define PV_ENTRY_NULL ((pv_entry_t) 0) 171 172#define PV_CI 0x01 /* all entries must be cache inhibited */ 173#define PV_PTPAGE 0x02 /* entry maps a page table page */ 174 175#ifdef KERNEL 176 177extern caddr_t CADDR1; 178extern pt_entry_t *CMAP1; 179extern vm_offset_t avail_end; 180extern vm_offset_t avail_start; 181extern vm_offset_t phys_avail[]; 182extern pv_entry_t pv_table; /* array of entries, one per page */ 183extern vm_offset_t virtual_avail; 184extern vm_offset_t virtual_end; 185 186#define pa_index(pa) atop(pa - vm_first_phys) 187#define pa_to_pvh(pa) (&pv_table[pa_index(pa)]) 188 189#define pmap_resident_count(pmap) ((pmap)->pm_stats.resident_count) 190 191struct pcb; 192 193void pmap_bootstrap __P(( vm_offset_t, vm_offset_t)); 194pmap_t pmap_kernel __P((void)); 195void *pmap_mapdev __P((vm_offset_t, vm_size_t)); 196pt_entry_t * __pure pmap_pte __P((pmap_t, vm_offset_t)) __pure2; 197void pmap_unuse_pt __P((pmap_t, vm_offset_t, vm_page_t)); 198vm_page_t pmap_use_pt __P((pmap_t, vm_offset_t)); 199 200#endif /* KERNEL */ 201 202#endif /* !_MACHINE_PMAP_H_ */ 203