Home | History | Annotate | Line # | Download | only in include
pmap.h revision 1.54.26.2
      1 /*	$NetBSD: pmap.h,v 1.54.26.2 2009/12/30 04:51:26 matt Exp $	*/
      2 
      3 /*
      4  * Copyright (c) 1992, 1993
      5  *	The Regents of the University of California.  All rights reserved.
      6  *
      7  * This code is derived from software contributed to Berkeley by
      8  * Ralph Campbell.
      9  *
     10  * Redistribution and use in source and binary forms, with or without
     11  * modification, are permitted provided that the following conditions
     12  * are met:
     13  * 1. Redistributions of source code must retain the above copyright
     14  *    notice, this list of conditions and the following disclaimer.
     15  * 2. Redistributions in binary form must reproduce the above copyright
     16  *    notice, this list of conditions and the following disclaimer in the
     17  *    documentation and/or other materials provided with the distribution.
     18  * 3. Neither the name of the University nor the names of its contributors
     19  *    may be used to endorse or promote products derived from this software
     20  *    without specific prior written permission.
     21  *
     22  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     23  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     24  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     25  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     26  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     27  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     28  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     29  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     30  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     31  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     32  * SUCH DAMAGE.
     33  *
     34  *	@(#)pmap.h	8.1 (Berkeley) 6/10/93
     35  */
     36 
     37 /*
     38  * Copyright (c) 1987 Carnegie-Mellon University
     39  *
     40  * This code is derived from software contributed to Berkeley by
     41  * Ralph Campbell.
     42  *
     43  * Redistribution and use in source and binary forms, with or without
     44  * modification, are permitted provided that the following conditions
     45  * are met:
     46  * 1. Redistributions of source code must retain the above copyright
     47  *    notice, this list of conditions and the following disclaimer.
     48  * 2. Redistributions in binary form must reproduce the above copyright
     49  *    notice, this list of conditions and the following disclaimer in the
     50  *    documentation and/or other materials provided with the distribution.
     51  * 3. All advertising materials mentioning features or use of this software
     52  *    must display the following acknowledgement:
     53  *	This product includes software developed by the University of
     54  *	California, Berkeley and its contributors.
     55  * 4. Neither the name of the University nor the names of its contributors
     56  *    may be used to endorse or promote products derived from this software
     57  *    without specific prior written permission.
     58  *
     59  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     60  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     61  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     62  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     63  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     64  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     65  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     66  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     67  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     68  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     69  * SUCH DAMAGE.
     70  *
     71  *	@(#)pmap.h	8.1 (Berkeley) 6/10/93
     72  */
     73 
     74 #ifndef	_MIPS_PMAP_H_
     75 #define	_MIPS_PMAP_H_
     76 
     77 #include <mips/cpuregs.h>	/* for KSEG0 below */
     78 #include <mips/pte.h>
     79 
     80 /*
     81  * The user address space is 2Gb (0x0 - 0x80000000).
     82  * User programs are laid out in memory as follows:
     83  *			address
     84  *	USRTEXT		0x00001000
     85  *	USRDATA		USRTEXT + text_size
     86  *	USRSTACK	0x7FFFFFFF
     87  *
     88  * The user address space is mapped using a two level structure where
     89  * virtual address bits 30..22 are used to index into a segment table which
     90  * points to a page worth of PTEs (4096 page can hold 1024 PTEs).
     91  * Bits 21..12 are then used to index a PTE which describes a page within
     92  * a segment.
     93  *
     94  * The wired entries in the TLB will contain the following:
     95  *	0-1	(UPAGES)	for curproc user struct and kernel stack.
     96  *
     97  * Note: The kernel doesn't use the same data structures as user programs.
     98  * All the PTE entries are stored in a single array in Sysmap which is
     99  * dynamically allocated at boot time.
    100  */
    101 
    102 #define mips_trunc_seg(x)	((vaddr_t)(x) & ~SEGOFSET)
    103 #define mips_round_seg(x)	(((vaddr_t)(x) + SEGOFSET) & ~SEGOFSET)
    104 
    105 #define PMAP_SEGTABSIZE		(1 << (31 - SEGSHIFT))
    106 
    107 union pt_entry;
    108 
    109 struct segtab {
    110 	union pt_entry	*seg_tab[PMAP_SEGTABSIZE];
    111 };
    112 
    113 struct pmap;
    114 typedef bool (*pte_callback_t)(struct pmap *, vaddr_t, vaddr_t, pt_entry_t *,
    115 	uintptr_t);
    116 pt_entry_t *pmap_pte_lookup(struct pmap *, vaddr_t);
    117 pt_entry_t *pmap_pte_reserve(struct pmap *, vaddr_t, int);
    118 void pmap_pte_process(struct pmap *, vaddr_t, vaddr_t, pte_callback_t,
    119 	uintptr_t);
    120 void pmap_segtab_activate(struct lwp *);
    121 void pmap_segtab_alloc(struct pmap *);
    122 void pmap_segtab_free(struct pmap *);
    123 
    124 /*
    125  * Machine dependent pmap structure.
    126  */
    127 typedef struct pmap {
    128 	kmutex_t		pm_lock;	/* lock on pmap */
    129 	struct segtab		*pm_segtab;	/* pointers to pages of PTEs */
    130 	int			pm_count;	/* pmap reference count */
    131 	unsigned int		pm_asid;	/* TLB address space tag */
    132 	unsigned int		pm_asidgen;	/* its generation number */
    133 	struct pmap_statistics	pm_stats;	/* pmap statistics */
    134 } *pmap_t;
    135 
    136 /*
    137  * For each struct vm_page, there is a list of all currently valid virtual
    138  * mappings of that page.  An entry is a pv_entry_t, the list is pv_table.
    139  * XXX really should do this as a part of the higher level code.
    140  */
    141 typedef struct pv_entry {
    142 	struct pv_entry	*pv_next;	/* next pv_entry */
    143 	struct pmap	*pv_pmap;	/* pmap where mapping lies */
    144 	vaddr_t		pv_va;		/* virtual address for mapping */
    145 	int		pv_flags;	/* some flags for the mapping */
    146 } *pv_entry_t;
    147 
    148 #define	PV_UNCACHED	0x0001		/* page is mapped uncached */
    149 #define	PV_MODIFIED	0x0002		/* page has been modified */
    150 #define	PV_REFERENCED	0x0004		/* page has been recently referenced */
    151 
    152 
    153 #ifdef	_KERNEL
    154 
    155 extern char *pmap_attributes;		/* reference and modify bits */
    156 extern struct pmap kernel_pmap_store;
    157 
    158 #define pmap_kernel()		(&kernel_pmap_store)
    159 #define	pmap_wired_count(pmap) 	((pmap)->pm_stats.wired_count)
    160 #define pmap_resident_count(pmap) ((pmap)->pm_stats.resident_count)
    161 
    162 #define	pmap_update(pmap)	/* nothing (yet) */
    163 #define pmap_phys_address(x)	mips_ptob(x)
    164 
    165 static __inline void
    166 pmap_remove_all(struct pmap *pmap)
    167 {
    168 	/* Nothing. */
    169 }
    170 
    171 /*
    172  *	Bootstrap the system enough to run with virtual memory.
    173  */
    174 void	pmap_bootstrap(void);
    175 
    176 void	pmap_set_modified(paddr_t);
    177 
    178 void	pmap_procwr(struct proc *, vaddr_t, size_t);
    179 #define	PMAP_NEED_PROCWR
    180 
    181 /*
    182  * pmap_prefer() helps reduce virtual-coherency exceptions in
    183  * the virtually-indexed cache on mips3 CPUs.
    184  */
    185 #ifdef MIPS3_PLUS
    186 #define PMAP_PREFER(pa, va, sz, td)	pmap_prefer((pa), (va), (td))
    187 void	pmap_prefer(vaddr_t, vaddr_t *, int);
    188 #endif /* MIPS3_PLUS */
    189 
    190 #define	PMAP_STEAL_MEMORY	/* enable pmap_steal_memory() */
    191 
    192 /*
    193  * Alternate mapping hooks for pool pages.  Avoids thrashing the TLB.
    194  */
    195 vaddr_t mips_pmap_map_poolpage(paddr_t);
    196 paddr_t mips_pmap_unmap_poolpage(vaddr_t);
    197 struct vm_page *mips_pmap_alloc_poolpage(int);
    198 #define	PMAP_ALLOC_POOLPAGE(flags)	mips_pmap_alloc_poolpage(flags)
    199 #define	PMAP_MAP_POOLPAGE(pa)		mips_pmap_map_poolpage(pa)
    200 #define	PMAP_UNMAP_POOLPAGE(va)		mips_pmap_unmap_poolpage(va)
    201 
    202 /*
    203  * Other hooks for the pool allocator.
    204  */
    205 #ifdef _LP64
    206 #define	POOL_VTOPHYS(va)	(MIPS_KSEG0_P(va) \
    207 				    ? MIPS_KSEG0_TO_PHYS(va) \
    208 				    : MIPS_XKPHYS_TO_PHYS(va))
    209 #else
    210 #define	POOL_VTOPHYS(va)	MIPS_KSEG0_TO_PHYS((vaddr_t)(va))
    211 #endif
    212 
    213 /*
    214  * Select CCA to use for unmanaged pages.
    215  */
    216 #define	PMAP_CCA_FOR_PA(pa)	CCA_UNCACHED		/* uncached */
    217 
    218 #if defined(_MIPS_PADDR_T_64BIT) || defined(_LP64)
    219 #define PMAP_NOCACHE	0x4000000000000000ULL
    220 #endif
    221 
    222 #endif	/* _KERNEL */
    223 #endif	/* _MIPS_PMAP_H_ */
    224