pmap.h revision 164250
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 * 4. Neither the name of the University nor the names of its contributors 18 * may be used to endorse or promote products derived from this software 19 * without specific prior written permission. 20 * 21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 31 * SUCH DAMAGE. 32 * 33 * Derived from hp300 version by Mike Hibler, this version by William 34 * Jolitz uses a recursive map [a pde points to the page directory] to 35 * map the page tables using the pagetables themselves. This is done to 36 * reduce the impact on kernel virtual memory for lots of sparse address 37 * space, and to reduce the cost of memory to each process. 38 * 39 * from: hp300: @(#)pmap.h 7.2 (Berkeley) 12/16/90 40 * from: @(#)pmap.h 7.4 (Berkeley) 5/12/91 41 * from: i386 pmap.h,v 1.54 1997/11/20 19:30:35 bde Exp 42 * $FreeBSD: head/sys/ia64/include/pmap.h 164250 2006-11-13 06:26:57Z ru $ 43 */ 44 45#ifndef _MACHINE_PMAP_H_ 46#define _MACHINE_PMAP_H_ 47 48#include <sys/queue.h> 49#include <sys/_lock.h> 50#include <sys/_mutex.h> 51#include <machine/atomic.h> 52#include <machine/pte.h> 53 54#ifdef _KERNEL 55 56#ifndef NKPT 57#define NKPT 30 /* initial number of kernel page tables */ 58#endif 59#define MAXKPT (PAGE_SIZE/sizeof(vm_offset_t)) 60 61#define vtophys(va) pmap_kextract((vm_offset_t)(va)) 62 63#endif /* _KERNEL */ 64 65/* 66 * Pmap stuff 67 */ 68struct pv_entry; 69 70struct md_page { 71 int pv_list_count; 72 TAILQ_HEAD(,pv_entry) pv_list; 73}; 74 75struct pmap { 76 struct mtx pm_mtx; 77 TAILQ_HEAD(,pv_entry) pm_pvlist; /* list of mappings in pmap */ 78 u_int32_t pm_rid[5]; /* base RID for pmap */ 79 int pm_active; /* active flag */ 80 struct pmap_statistics pm_stats; /* pmap statistics */ 81}; 82 83typedef struct pmap *pmap_t; 84 85#ifdef _KERNEL 86extern struct pmap kernel_pmap_store; 87#define kernel_pmap (&kernel_pmap_store) 88 89#define PMAP_LOCK(pmap) mtx_lock(&(pmap)->pm_mtx) 90#define PMAP_LOCK_ASSERT(pmap, type) \ 91 mtx_assert(&(pmap)->pm_mtx, (type)) 92#define PMAP_LOCK_DESTROY(pmap) mtx_destroy(&(pmap)->pm_mtx) 93#define PMAP_LOCK_INIT(pmap) mtx_init(&(pmap)->pm_mtx, "pmap", \ 94 NULL, MTX_DEF) 95#define PMAP_LOCKED(pmap) mtx_owned(&(pmap)->pm_mtx) 96#define PMAP_MTX(pmap) (&(pmap)->pm_mtx) 97#define PMAP_TRYLOCK(pmap) mtx_trylock(&(pmap)->pm_mtx) 98#define PMAP_UNLOCK(pmap) mtx_unlock(&(pmap)->pm_mtx) 99#endif 100 101/* 102 * For each vm_page_t, there is a list of all currently valid virtual 103 * mappings of that page. An entry is a pv_entry_t, the list is pv_list. 104 */ 105typedef struct pv_entry { 106 pmap_t pv_pmap; /* pmap where mapping lies */ 107 vm_offset_t pv_va; /* virtual address for mapping */ 108 TAILQ_ENTRY(pv_entry) pv_list; 109 TAILQ_ENTRY(pv_entry) pv_plist; 110} *pv_entry_t; 111 112#ifdef _KERNEL 113 114extern vm_offset_t phys_avail[]; 115extern vm_offset_t virtual_avail; 116extern vm_offset_t virtual_end; 117 118extern uint64_t pmap_vhpt_base[]; 119extern int pmap_vhpt_log2size; 120 121#define pmap_page_is_mapped(m) (!TAILQ_EMPTY(&(m)->md.pv_list)) 122#define pmap_mapbios(pa, sz) pmap_mapdev(pa, sz) 123#define pmap_unmapbios(va, sz) pmap_unmapdev(va, sz) 124 125vm_offset_t pmap_steal_memory(vm_size_t); 126void pmap_bootstrap(void); 127void pmap_kenter(vm_offset_t va, vm_offset_t pa); 128vm_paddr_t pmap_kextract(vm_offset_t va); 129void pmap_kremove(vm_offset_t); 130void pmap_setdevram(unsigned long long basea, vm_offset_t sizea); 131int pmap_uses_prom_console(void); 132void *pmap_mapdev(vm_offset_t, vm_size_t); 133void pmap_unmapdev(vm_offset_t, vm_size_t); 134unsigned *pmap_pte(pmap_t, vm_offset_t) __pure2; 135void pmap_set_opt (unsigned *); 136void pmap_set_opt_bsp (void); 137struct pmap *pmap_switch(struct pmap *pmap); 138 139#endif /* _KERNEL */ 140 141#endif /* !_MACHINE_PMAP_H_ */ 142