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