Home | History | Annotate | Line # | Download | only in include
pmap.h revision 1.20 
      1 /*	$NetBSD: pmap.h,v 1.20 1999/02/25 22:47:18 is Exp $	*/
      2 
      3 /*
      4  * Copyright (c) 1987 Carnegie-Mellon University
      5  * Copyright (c) 1991 Regents of the University of California.
      6  * 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	7.6 (Berkeley) 5/10/91
     41  */
     42 
     43 #ifndef	_MACHINE_PMAP_H_
     44 #define	_MACHINE_PMAP_H_
     45 
     46 /*
     47  * Pmap stuff
     48  */
     49 struct pmap {
     50 	pt_entry_t 		*pm_ptab;	/* KVA of page table */
     51 	st_entry_t		*pm_stab;	/* KVA of segment table */
     52 	int			pm_stfree;	/* 040: free lev2 blocks */
     53 	u_int			*pm_stpa;	/* 040: ST phys. address */
     54 	short			pm_sref;	/* segment table ref count */
     55 	short			pm_count;	/* pmap reference count */
     56 	long			pm_ptpages;	/* more stats: PT pages */
     57 	simple_lock_data_t	pm_lock;	/* lock on pmap */
     58 	struct pmap_statistics	pm_stats;	/* pmap statistics */
     59 };
     60 
     61 typedef struct pmap *pmap_t;
     62 
     63 /*
     64  * On the 040 we keep track of which level 2 blocks are already in use
     65  * with the pm_stfree mask.  Bits are arranged from LSB (block 0) to MSB
     66  * (block 31).  For convenience, the level 1 table is considered to be
     67  * block 0.
     68  *
     69  * MAX[KU]L2SIZE control how many pages of level 2 descriptors are allowed.
     70  * for the kernel and users.  16 implies only the initial "segment table"
     71  * page is used.  WARNING: don't change MAXUL2SIZE unless you can allocate
     72  * physically contiguous pages for the ST in pmap.c!
     73  */
     74 #define	MAXKL2SIZE	32
     75 #define MAXUL2SIZE	16
     76 #define l2tobm(n)	(1 << (n))
     77 #define	bmtol2(n)	(ffs(n) - 1)
     78 
     79 /*
     80  * Macros for speed
     81  */
     82 #define	PMAP_ACTIVATE(pmap, loadhw)					\
     83 {									\
     84 	if ((loadhw))							\
     85 		loadustp(m68k_btop((pmap)->pm_stpa));	\
     86 }
     87 
     88 /*
     89  * Description of the memory segments. Build in atari_init/start_c().
     90  * This gives a better separation between machine dependent stuff and
     91  * the pmap-module.
     92  */
     93 #define	NMEM_SEGS	8
     94 struct memseg {
     95 	paddr_t	start;		/* PA of first page in segment	*/
     96 	paddr_t	end;		/* PA of last  page in segment	*/
     97 	int	first_page;	/* relative page# of 'start'	*/
     98 };
     99 
    100 /*
    101  * For each vm_page_t, there is a list of all currently valid virtual
    102  * mappings of that page.  An entry is a pv_entry_t, the list is pv_table.
    103  */
    104 typedef struct pv_entry {
    105 	struct pv_entry	*pv_next;	/* next pv_entry */
    106 	struct pmap	*pv_pmap;	/* pmap where mapping lies */
    107 	vaddr_t		pv_va;		/* virtual address for mapping */
    108 	u_int		*pv_ptste;	/* non-zero if VA maps a PT page */
    109 	struct pmap	*pv_ptpmap;	/* if pv_ptste, pmap for PT page */
    110 	int		pv_flags;	/* flags */
    111 } *pv_entry_t;
    112 
    113 #define	PV_CI		0x01	/* all entries must be cache inhibited */
    114 #define PV_PTPAGE	0x02	/* entry maps a page table page */
    115 
    116 struct pv_page;
    117 
    118 struct pv_page_info {
    119 	TAILQ_ENTRY(pv_page) pgi_list;
    120 	struct pv_entry *pgi_freelist;
    121 	int pgi_nfree;
    122 };
    123 
    124 /*
    125  * This is basically:
    126  * ((NBPG - sizeof(struct pv_page_info)) / sizeof(struct pv_entry))
    127  */
    128 #define	NPVPPG	340
    129 
    130 struct pv_page {
    131 	struct pv_page_info pvp_pgi;
    132 	struct pv_entry pvp_pv[NPVPPG];
    133 };
    134 
    135 #ifdef	_KERNEL
    136 /*
    137  * Memory segment descriptors.
    138  *  - boot_segs
    139  *	describes the segments obtainted from the bootcode.
    140  *  - usable_segs
    141  *	describes the segments available after system requirements are
    142  *	substracted (reserved pages, etc...).
    143  */
    144 struct memseg	boot_segs[NMEM_SEGS];
    145 struct memseg	usable_segs[NMEM_SEGS];
    146 
    147 pv_entry_t	pv_table;	/* array of entries, one per page */
    148 u_int		*Sysmap;
    149 char		*vmmap;		/* map for mem, dumps, etc. */
    150 struct pmap	kernel_pmap_store;
    151 
    152 #define	pmap_kernel()			(&kernel_pmap_store)
    153 #define	pmap_resident_count(pmap)	((pmap)->pm_stats.resident_count)
    154 
    155 #define	active_user_pmap(pm) \
    156 	(curproc && \
    157 	 (pm) != pmap_kernel() && (pm) == curproc->p_vmspace->vm_map.pmap)
    158 
    159 void	pmap_bootstrap __P((psize_t, u_int, u_int));
    160 void	pmap_changebit __P((paddr_t, int, boolean_t));
    161 
    162 vaddr_t	pmap_map __P((vaddr_t, paddr_t, paddr_t, int));
    163 void	pmap_procwr __P((struct proc *, vaddr_t, u_long));
    164 #define PMAP_NEED_PROCWR
    165 
    166 #endif	/* _KERNEL */
    167 
    168 #endif	/* !_MACHINE_PMAP_H_ */
    169