+++ /dev/null
-/*-\r
- * Copyright (c) 1998, 1999, 2000, 2001 The NetBSD Foundation, Inc.\r
- * All rights reserved.\r
- *\r
- * This code is derived from software contributed to The NetBSD Foundation\r
- * by Jason R. Thorpe of the Numerical Aerospace Simulation Facility,\r
- * NASA Ames Research Center and by Chris G. Demetriou.\r
- *\r
- * Redistribution and use in source and binary forms, with or without\r
- * modification, are permitted provided that the following conditions\r
- * are met:\r
- * 1. Redistributions of source code must retain the above copyright\r
- * notice, this list of conditions and the following disclaimer.\r
- * 2. Redistributions in binary form must reproduce the above copyright\r
- * notice, this list of conditions and the following disclaimer in the\r
- * documentation and/or other materials provided with the distribution.\r
- * 3. All advertising materials mentioning features or use of this software\r
- * must display the following acknowledgement:\r
- * This product includes software developed by the NetBSD\r
- * Foundation, Inc. and its contributors.\r
- * 4. Neither the name of The NetBSD Foundation nor the names of its\r
- * contributors may be used to endorse or promote products derived\r
- * from this software without specific prior written permission.\r
- *\r
- * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS\r
- * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED\r
- * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR\r
- * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS\r
- * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\r
- * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\r
- * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\r
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\r
- * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\r
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\r
- * POSSIBILITY OF SUCH DAMAGE.\r
- */\r
-\r
-/*-\r
- * Copyright (c) 1991 Regents of the University of California.\r
- * All rights reserved.\r
- *\r
- * This code is derived from software contributed to Berkeley by\r
- * the Systems Programming Group of the University of Utah Computer\r
- * Science Department and William Jolitz of UUNET Technologies Inc.\r
- *\r
- * Redistribution and use in source and binary forms, with or without\r
- * modification, are permitted provided that the following conditions\r
- * are met:\r
- * 1. Redistributions of source code must retain the above copyright\r
- * notice, this list of conditions and the following disclaimer.\r
- * 2. Redistributions in binary form must reproduce the above copyright\r
- * notice, this list of conditions and the following disclaimer in the\r
- * documentation and/or other materials provided with the distribution.\r
- * 4. Neither the name of the University nor the names of its contributors\r
- * may be used to endorse or promote products derived from this software\r
- * without specific prior written permission.\r
- *\r
- * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND\r
- * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\r
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\r
- * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE\r
- * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\r
- * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS\r
- * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\r
- * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\r
- * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY\r
- * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\r
- * SUCH DAMAGE.\r
- *\r
- * Derived from hp300 version by Mike Hibler, this version by William\r
- * Jolitz uses a recursive map [a pde points to the page directory] to\r
- * map the page tables using the pagetables themselves. This is done to\r
- * reduce the impact on kernel virtual memory for lots of sparse address\r
- * space, and to reduce the cost of memory to each process.\r
- *\r
- * from: hp300: @(#)pmap.h 7.2 (Berkeley) 12/16/90\r
- * from: @(#)pmap.h 7.4 (Berkeley) 5/12/91\r
- * from: i386 pmap.h,v 1.54 1997/11/20 19:30:35 bde Exp\r
- * $FreeBSD: src/sys/ia64/include/pmap.h,v 1.25 2005/09/03 23:53:50 marcel Exp $\r
- */\r
-\r
-#ifndef _PMAP_MACHINE_\r
-#define _PMAP_MACHINE_\r
-\r
-#include <sys/lock.h>\r
-\r
-paddr_t vtophys(vaddr_t);\r
-\r
-struct pv_entry; /* Forward declaration. */\r
-\r
-struct pmap {\r
- TAILQ_ENTRY(pmap) pm_list; /* list of all pmaps */\r
- TAILQ_HEAD(,pv_entry) pm_pvlist; /* list of mappings in pmap */\r
- int pm_count; /* pmap reference count */\r
- struct simplelock pm_slock; /* lock on pmap */\r
- u_int32_t pm_rid[5]; /* base RID for pmap */\r
- int pm_active; /* active flag */\r
- struct pmap_statistics pm_stats; /* pmap statistics */\r
- unsigned long pm_cpus; /* mask of CPUs using pmap */\r
-\r
-};\r
-\r
-typedef struct pmap *pmap_t;\r
-\r
-/*\r
- * For each vm_page_t, there is a list of all currently valid virtual\r
- * mappings of that page. An entry is a pv_entry_t, the list is pv_pvlist.\r
- */\r
-typedef struct pv_entry {\r
- pmap_t pv_pmap; /* pmap where mapping lies */\r
- vaddr_t pv_va; /* virtual address for mapping */\r
- TAILQ_ENTRY(pv_entry) pv_list;\r
- TAILQ_ENTRY(pv_entry) pv_plist;\r
-} *pv_entry_t;\r
-\r
-/* pvh_attrs */\r
-#define PGA_MODIFIED 0x01 /* modified */\r
-#define PGA_REFERENCED 0x02 /* referenced */\r
-\r
-\r
-extern struct pmap kernel_pmap_store;\r
-\r
-#define pmap_kernel() (&kernel_pmap_store)\r
-\r
-#define pmap_resident_count(pmap) ((pmap)->pm_stats.resident_count)\r
-#define pmap_wired_count(pmap) ((pmap)->pm_stats.wired_count)\r
-\r
-#define pmap_copy(dp, sp, da, l, sa) /* nothing */\r
-#define pmap_update(pmap) /* nothing (yet) */\r
-\r
-void pmap_bootstrap(void);\r
-\r
-#define pmap_is_referenced(pg) \\r
- (((pg)->mdpage.pvh_attrs & PGA_REFERENCED) != 0)\r
-#define pmap_is_modified(pg) \\r
- (((pg)->mdpage.pvh_attrs & PGA_MODIFIED) != 0)\r
-\r
-\r
-#define PMAP_STEAL_MEMORY /* enable pmap_steal_memory() */\r
-\r
-/*\r
- * Alternate mapping hooks for pool pages. Avoids thrashing the TLB.\r
- */\r
-#define PMAP_MAP_POOLPAGE(pa) IA64_PHYS_TO_RR7((pa))\r
-#define PMAP_UNMAP_POOLPAGE(va) IA64_RR_MASK((va))\r
-\r
-/*\r
- * Macros for locking pmap structures.\r
- *\r
- * Note that we if we access the kernel pmap in interrupt context, it\r
- * is only to update statistics. Since stats are updated using atomic\r
- * operations, locking the kernel pmap is not necessary. Therefore,\r
- * it is not necessary to block interrupts when locking pmap strucutres.\r
- */\r
-#define PMAP_LOCK(pmap) simple_lock(&(pmap)->pm_slock)\r
-#define PMAP_UNLOCK(pmap) simple_unlock(&(pmap)->pm_slock)\r
-\r
-\r
-#define PMAP_VHPT_LOG2SIZE 16 \r
-\r
-\r
-#endif /* _PMAP_MACHINE_ */\r
projects / mirror_edk2.git / blobdiff