Home | History | Annotate | Line # | Download | only in include
pmap.h revision 1.7
      1  1.1    cherry /*-
      2  1.1    cherry  * Copyright (c) 1998, 1999, 2000, 2001 The NetBSD Foundation, Inc.
      3  1.1    cherry  * All rights reserved.
      4  1.1    cherry  *
      5  1.1    cherry  * This code is derived from software contributed to The NetBSD Foundation
      6  1.1    cherry  * by Jason R. Thorpe of the Numerical Aerospace Simulation Facility,
      7  1.1    cherry  * NASA Ames Research Center and by Chris G. Demetriou.
      8  1.1    cherry  *
      9  1.1    cherry  * Redistribution and use in source and binary forms, with or without
     10  1.1    cherry  * modification, are permitted provided that the following conditions
     11  1.1    cherry  * are met:
     12  1.1    cherry  * 1. Redistributions of source code must retain the above copyright
     13  1.1    cherry  *    notice, this list of conditions and the following disclaimer.
     14  1.1    cherry  * 2. Redistributions in binary form must reproduce the above copyright
     15  1.1    cherry  *    notice, this list of conditions and the following disclaimer in the
     16  1.1    cherry  *    documentation and/or other materials provided with the distribution.
     17  1.1    cherry  *
     18  1.1    cherry  * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
     19  1.1    cherry  * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
     20  1.1    cherry  * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
     21  1.1    cherry  * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
     22  1.1    cherry  * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
     23  1.1    cherry  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
     24  1.1    cherry  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
     25  1.1    cherry  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
     26  1.1    cherry  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
     27  1.1    cherry  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
     28  1.1    cherry  * POSSIBILITY OF SUCH DAMAGE.
     29  1.1    cherry  */
     30  1.1    cherry 
     31  1.1    cherry /*-
     32  1.1    cherry  * Copyright (c) 1991 Regents of the University of California.
     33  1.1    cherry  * All rights reserved.
     34  1.1    cherry  *
     35  1.1    cherry  * This code is derived from software contributed to Berkeley by
     36  1.1    cherry  * the Systems Programming Group of the University of Utah Computer
     37  1.1    cherry  * Science Department and William Jolitz of UUNET Technologies Inc.
     38  1.1    cherry  *
     39  1.1    cherry  * Redistribution and use in source and binary forms, with or without
     40  1.1    cherry  * modification, are permitted provided that the following conditions
     41  1.1    cherry  * are met:
     42  1.1    cherry  * 1. Redistributions of source code must retain the above copyright
     43  1.1    cherry  *    notice, this list of conditions and the following disclaimer.
     44  1.1    cherry  * 2. Redistributions in binary form must reproduce the above copyright
     45  1.1    cherry  *    notice, this list of conditions and the following disclaimer in the
     46  1.1    cherry  *    documentation and/or other materials provided with the distribution.
     47  1.1    cherry  * 4. Neither the name of the University nor the names of its contributors
     48  1.1    cherry  *    may be used to endorse or promote products derived from this software
     49  1.1    cherry  *    without specific prior written permission.
     50  1.1    cherry  *
     51  1.1    cherry  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     52  1.1    cherry  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     53  1.1    cherry  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     54  1.1    cherry  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     55  1.1    cherry  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     56  1.1    cherry  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     57  1.1    cherry  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     58  1.1    cherry  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     59  1.1    cherry  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     60  1.1    cherry  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     61  1.1    cherry  * SUCH DAMAGE.
     62  1.1    cherry  *
     63  1.1    cherry  * Derived from hp300 version by Mike Hibler, this version by William
     64  1.1    cherry  * Jolitz uses a recursive map [a pde points to the page directory] to
     65  1.1    cherry  * map the page tables using the pagetables themselves. This is done to
     66  1.1    cherry  * reduce the impact on kernel virtual memory for lots of sparse address
     67  1.1    cherry  * space, and to reduce the cost of memory to each process.
     68  1.1    cherry  *
     69  1.1    cherry  *	from: hp300: @(#)pmap.h	7.2 (Berkeley) 12/16/90
     70  1.1    cherry  *	from: @(#)pmap.h	7.4 (Berkeley) 5/12/91
     71  1.1    cherry  *	from: i386 pmap.h,v 1.54 1997/11/20 19:30:35 bde Exp
     72  1.1    cherry  * $FreeBSD: src/sys/ia64/include/pmap.h,v 1.25 2005/09/03 23:53:50 marcel Exp $
     73  1.1    cherry  */
     74  1.1    cherry 
     75  1.1    cherry #ifndef _PMAP_MACHINE_
     76  1.1    cherry #define _PMAP_MACHINE_
     77  1.1    cherry 
     78  1.2    cherry #include <sys/lock.h>
     79  1.2    cherry 
     80  1.1    cherry paddr_t vtophys(vaddr_t);
     81  1.1    cherry 
     82  1.1    cherry struct pv_entry;	/* Forward declaration. */
     83  1.1    cherry 
     84  1.1    cherry struct pmap {
     85  1.1    cherry 	TAILQ_ENTRY(pmap)	pm_list;	/* list of all pmaps */
     86  1.1    cherry 	TAILQ_HEAD(,pv_entry)	pm_pvlist;	/* list of mappings in pmap */
     87  1.1    cherry 	int			pm_count;	/* pmap reference count */
     88  1.3     kochi 	kmutex_t		pm_slock;	/* lock on pmap */
     89  1.6  kiyohara 	uint32_t		pm_rid[5];	/* base RID for pmap */
     90  1.1    cherry 	int			pm_active;	/* active flag */
     91  1.1    cherry 	struct pmap_statistics	pm_stats;	/* pmap statistics */
     92  1.1    cherry 	unsigned long		pm_cpus;	/* mask of CPUs using pmap */
     93  1.1    cherry 
     94  1.1    cherry };
     95  1.1    cherry 
     96  1.1    cherry /*
     97  1.1    cherry  * For each vm_page_t, there is a list of all currently valid virtual
     98  1.1    cherry  * mappings of that page.  An entry is a pv_entry_t, the list is pv_pvlist.
     99  1.1    cherry  */
    100  1.1    cherry typedef struct pv_entry {
    101  1.1    cherry 	pmap_t		pv_pmap;	/* pmap where mapping lies */
    102  1.1    cherry 	vaddr_t		pv_va;		/* virtual address for mapping */
    103  1.1    cherry 	TAILQ_ENTRY(pv_entry)	pv_list;
    104  1.1    cherry 	TAILQ_ENTRY(pv_entry)	pv_plist;
    105  1.1    cherry } *pv_entry_t;
    106  1.1    cherry 
    107  1.1    cherry /* pvh_attrs */
    108  1.1    cherry #define	PGA_MODIFIED		0x01		/* modified */
    109  1.1    cherry #define	PGA_REFERENCED		0x02		/* referenced */
    110  1.1    cherry 
    111  1.1    cherry 
    112  1.1    cherry #define	pmap_resident_count(pmap)	((pmap)->pm_stats.resident_count)
    113  1.1    cherry #define	pmap_wired_count(pmap)		((pmap)->pm_stats.wired_count)
    114  1.1    cherry 
    115  1.1    cherry #define	pmap_copy(dp, sp, da, l, sa)	/* nothing */
    116  1.1    cherry #define	pmap_update(pmap)		/* nothing (yet) */
    117  1.1    cherry 
    118  1.1    cherry void pmap_bootstrap(void);
    119  1.1    cherry 
    120  1.1    cherry #define	pmap_is_referenced(pg)						\
    121  1.1    cherry 	(((pg)->mdpage.pvh_attrs & PGA_REFERENCED) != 0)
    122  1.1    cherry #define	pmap_is_modified(pg)						\
    123  1.1    cherry 	(((pg)->mdpage.pvh_attrs & PGA_MODIFIED) != 0)
    124  1.1    cherry 
    125  1.1    cherry 
    126  1.1    cherry #define PMAP_STEAL_MEMORY		/* enable pmap_steal_memory() */
    127  1.1    cherry 
    128  1.1    cherry /*
    129  1.1    cherry  * Alternate mapping hooks for pool pages.  Avoids thrashing the TLB.
    130  1.1    cherry  */
    131  1.1    cherry #define	PMAP_MAP_POOLPAGE(pa)		IA64_PHYS_TO_RR7((pa))
    132  1.1    cherry #define	PMAP_UNMAP_POOLPAGE(va)		IA64_RR_MASK((va))
    133  1.1    cherry 
    134  1.1    cherry /*
    135  1.1    cherry  * Macros for locking pmap structures.
    136  1.1    cherry  *
    137  1.1    cherry  * Note that we if we access the kernel pmap in interrupt context, it
    138  1.1    cherry  * is only to update statistics.  Since stats are updated using atomic
    139  1.1    cherry  * operations, locking the kernel pmap is not necessary.  Therefore,
    140  1.1    cherry  * it is not necessary to block interrupts when locking pmap strucutres.
    141  1.1    cherry  */
    142  1.3     kochi #define	PMAP_LOCK(pmap)		mutex_enter(&(pmap)->pm_slock)
    143  1.3     kochi #define	PMAP_UNLOCK(pmap)	mutex_exit(&(pmap)->pm_slock)
    144  1.1    cherry 
    145  1.1    cherry 
    146  1.1    cherry #define PMAP_VHPT_LOG2SIZE 16
    147  1.1    cherry 
    148  1.1    cherry 
    149  1.7  uebayasi #include <sys/queue.h>
    150  1.7  uebayasi #include <sys/mutex.h>
    151  1.7  uebayasi /*
    152  1.7  uebayasi  * pmap-specific data store in the vm_page structure.
    153  1.7  uebayasi  */
    154  1.7  uebayasi #define	__HAVE_VM_PAGE_MD
    155  1.7  uebayasi struct vm_page_md {
    156  1.7  uebayasi 	TAILQ_HEAD(,pv_entry) pv_list;	/* pv_entry list */
    157  1.7  uebayasi 	int pv_list_count;
    158  1.7  uebayasi 	kmutex_t pv_mutex;		/* lock on this head */
    159  1.7  uebayasi 	int pvh_attrs;			/* page attributes */
    160  1.7  uebayasi };
    161  1.7  uebayasi 
    162  1.7  uebayasi #define	VM_MDPAGE_INIT(pg)						\
    163  1.7  uebayasi do {									\
    164  1.7  uebayasi 	TAILQ_INIT(&(pg)->mdpage.pv_list);				\
    165  1.7  uebayasi 	mutex_init(&(pg)->mdpage.pv_mutex, MUTEX_DEFAULT, IPL_NONE);	\
    166  1.7  uebayasi } while (/*CONSTCOND*/0)
    167  1.7  uebayasi 
    168  1.1    cherry #endif /* _PMAP_MACHINE_ */
    169