Home | History | Annotate | Line # | Download | only in include
pmap.h revision 1.11
      1 /*	$NetBSD: pmap.h,v 1.11 2008/01/20 13:43:37 yamt Exp $	*/
      2 
      3 /*
      4  *
      5  * Copyright (c) 1997 Charles D. Cranor and Washington University.
      6  * All rights reserved.
      7  *
      8  * Redistribution and use in source and binary forms, with or without
      9  * modification, are permitted provided that the following conditions
     10  * are met:
     11  * 1. Redistributions of source code must retain the above copyright
     12  *    notice, this list of conditions and the following disclaimer.
     13  * 2. Redistributions in binary form must reproduce the above copyright
     14  *    notice, this list of conditions and the following disclaimer in the
     15  *    documentation and/or other materials provided with the distribution.
     16  * 3. All advertising materials mentioning features or use of this software
     17  *    must display the following acknowledgment:
     18  *      This product includes software developed by Charles D. Cranor and
     19  *      Washington University.
     20  * 4. The name of the author may not be used to endorse or promote products
     21  *    derived from this software without specific prior written permission.
     22  *
     23  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
     24  * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
     25  * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
     26  * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
     27  * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
     28  * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
     29  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
     30  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
     31  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
     32  * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
     33  */
     34 
     35 /*
     36  * Copyright (c) 2001 Wasabi Systems, Inc.
     37  * All rights reserved.
     38  *
     39  * Written by Frank van der Linden for Wasabi Systems, Inc.
     40  *
     41  * Redistribution and use in source and binary forms, with or without
     42  * modification, are permitted provided that the following conditions
     43  * are met:
     44  * 1. Redistributions of source code must retain the above copyright
     45  *    notice, this list of conditions and the following disclaimer.
     46  * 2. Redistributions in binary form must reproduce the above copyright
     47  *    notice, this list of conditions and the following disclaimer in the
     48  *    documentation and/or other materials provided with the distribution.
     49  * 3. All advertising materials mentioning features or use of this software
     50  *    must display the following acknowledgement:
     51  *      This product includes software developed for the NetBSD Project by
     52  *      Wasabi Systems, Inc.
     53  * 4. The name of Wasabi Systems, Inc. may not be used to endorse
     54  *    or promote products derived from this software without specific prior
     55  *    written permission.
     56  *
     57  * THIS SOFTWARE IS PROVIDED BY WASABI SYSTEMS, INC. ``AS IS'' AND
     58  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
     59  * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
     60  * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL WASABI SYSTEMS, INC
     61  * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
     62  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
     63  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
     64  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
     65  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
     66  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
     67  * POSSIBILITY OF SUCH DAMAGE.
     68  */
     69 
     70 /*
     71  * pmap.h: see pmap.c for the history of this pmap module.
     72  */
     73 
     74 #ifndef _X86_PMAP_H_
     75 #define	_X86_PMAP_H_
     76 
     77 #define ptei(VA)	(((VA_SIGN_POS(VA)) & L1_MASK) >> L1_SHIFT)
     78 
     79 /*
     80  * pl*_pi: index in the ptp page for a pde mapping a VA.
     81  * (pl*_i below is the index in the virtual array of all pdes per level)
     82  */
     83 #define pl1_pi(VA)	(((VA_SIGN_POS(VA)) & L1_MASK) >> L1_SHIFT)
     84 #define pl2_pi(VA)	(((VA_SIGN_POS(VA)) & L2_MASK) >> L2_SHIFT)
     85 #define pl3_pi(VA)	(((VA_SIGN_POS(VA)) & L3_MASK) >> L3_SHIFT)
     86 #define pl4_pi(VA)	(((VA_SIGN_POS(VA)) & L4_MASK) >> L4_SHIFT)
     87 
     88 /*
     89  * pl*_i: generate index into pde/pte arrays in virtual space
     90  */
     91 #define pl1_i(VA)	(((VA_SIGN_POS(VA)) & L1_FRAME) >> L1_SHIFT)
     92 #define pl2_i(VA)	(((VA_SIGN_POS(VA)) & L2_FRAME) >> L2_SHIFT)
     93 #define pl3_i(VA)	(((VA_SIGN_POS(VA)) & L3_FRAME) >> L3_SHIFT)
     94 #define pl4_i(VA)	(((VA_SIGN_POS(VA)) & L4_FRAME) >> L4_SHIFT)
     95 #define pl_i(va, lvl) \
     96         (((VA_SIGN_POS(va)) & ptp_masks[(lvl)-1]) >> ptp_shifts[(lvl)-1])
     97 
     98 #define	pl_i_roundup(va, lvl)	pl_i((va)+ ~ptp_masks[(lvl)-1], (lvl))
     99 
    100 /*
    101  * PTP macros:
    102  *   a PTP's index is the PD index of the PDE that points to it
    103  *   a PTP's offset is the byte-offset in the PTE space that this PTP is at
    104  *   a PTP's VA is the first VA mapped by that PTP
    105  */
    106 
    107 #define ptp_va2o(va, lvl)	(pl_i(va, (lvl)+1) * PAGE_SIZE)
    108 
    109 #if defined(_KERNEL)
    110 /*
    111  * pmap data structures: see pmap.c for details of locking.
    112  */
    113 
    114 struct pmap;
    115 typedef struct pmap *pmap_t;
    116 
    117 /*
    118  * we maintain a list of all non-kernel pmaps
    119  */
    120 
    121 LIST_HEAD(pmap_head, pmap); /* struct pmap_head: head of a pmap list */
    122 
    123 /*
    124  * the pmap structure
    125  *
    126  * note that the pm_obj contains the simple_lock, the reference count,
    127  * page list, and number of PTPs within the pmap.
    128  *
    129  * pm_lock is the same as the spinlock for vm object 0. Changes to
    130  * the other objects may only be made if that lock has been taken
    131  * (the other object locks are only used when uvm_pagealloc is called)
    132  *
    133  * XXX If we ever support processor numbers higher than 31, we'll have
    134  * XXX to rethink the CPU mask.
    135  */
    136 
    137 struct pmap {
    138 	struct uvm_object pm_obj[PTP_LEVELS-1]; /* objects for lvl >= 1) */
    139 #define	pm_lock	pm_obj[0].vmobjlock
    140 	LIST_ENTRY(pmap) pm_list;	/* list (lck by pm_list lock) */
    141 	pd_entry_t *pm_pdir;		/* VA of PD (lck by object lock) */
    142 	paddr_t pm_pdirpa;		/* PA of PD (read-only after create) */
    143 	struct vm_page *pm_ptphint[PTP_LEVELS-1];
    144 					/* pointer to a PTP in our pmap */
    145 	struct pmap_statistics pm_stats;  /* pmap stats (lck by object lock) */
    146 
    147 #if !defined(__x86_64__)
    148 	vaddr_t pm_hiexec;		/* highest executable mapping */
    149 #endif /* !defined(__x86_64__) */
    150 	int pm_flags;			/* see below */
    151 
    152 	union descriptor *pm_ldt;	/* user-set LDT */
    153 	int pm_ldt_len;			/* number of LDT entries */
    154 	int pm_ldt_sel;			/* LDT selector */
    155 	uint32_t pm_cpus;		/* mask of CPUs using pmap */
    156 	uint32_t pm_kernel_cpus;	/* mask of CPUs using kernel part
    157 					 of pmap */
    158 };
    159 
    160 /* pm_flags */
    161 #define	PMF_USER_LDT	0x01	/* pmap has user-set LDT */
    162 
    163 /*
    164  * global kernel variables
    165  */
    166 
    167 /* PDPpaddr: is the physical address of the kernel's PDP */
    168 extern u_long PDPpaddr;
    169 
    170 extern struct pmap kernel_pmap_store;	/* kernel pmap */
    171 extern int pmap_pg_g;			/* do we support PG_G? */
    172 extern long nkptp[PTP_LEVELS];
    173 
    174 /*
    175  * macros
    176  */
    177 
    178 #define	pmap_kernel()			(&kernel_pmap_store)
    179 #define	pmap_resident_count(pmap)	((pmap)->pm_stats.resident_count)
    180 #define	pmap_wired_count(pmap)		((pmap)->pm_stats.wired_count)
    181 
    182 #define pmap_clear_modify(pg)		pmap_clear_attrs(pg, PG_M)
    183 #define pmap_clear_reference(pg)	pmap_clear_attrs(pg, PG_U)
    184 #define pmap_copy(DP,SP,D,L,S)
    185 #define pmap_is_modified(pg)		pmap_test_attrs(pg, PG_M)
    186 #define pmap_is_referenced(pg)		pmap_test_attrs(pg, PG_U)
    187 #define pmap_move(DP,SP,D,L,S)
    188 #define pmap_phys_address(ppn)		x86_ptob(ppn)
    189 #define pmap_valid_entry(E) 		((E) & PG_V) /* is PDE or PTE valid? */
    190 
    191 
    192 /*
    193  * prototypes
    194  */
    195 
    196 void		pmap_activate(struct lwp *);
    197 void		pmap_bootstrap(vaddr_t);
    198 bool		pmap_clear_attrs(struct vm_page *, unsigned);
    199 void		pmap_deactivate(struct lwp *);
    200 void		pmap_page_remove (struct vm_page *);
    201 void		pmap_remove(struct pmap *, vaddr_t, vaddr_t);
    202 bool		pmap_test_attrs(struct vm_page *, unsigned);
    203 void		pmap_write_protect(struct pmap *, vaddr_t, vaddr_t, vm_prot_t);
    204 void		pmap_load(void);
    205 paddr_t		pmap_init_tmp_pgtbl(paddr_t);
    206 
    207 vaddr_t reserve_dumppages(vaddr_t); /* XXX: not a pmap fn */
    208 
    209 void	pmap_tlb_shootdown(pmap_t, vaddr_t, vaddr_t, pt_entry_t);
    210 void	pmap_tlb_shootwait(void);
    211 
    212 #define PMAP_GROWKERNEL		/* turn on pmap_growkernel interface */
    213 
    214 /*
    215  * Do idle page zero'ing uncached to avoid polluting the cache.
    216  */
    217 bool	pmap_pageidlezero(paddr_t);
    218 #define	PMAP_PAGEIDLEZERO(pa)	pmap_pageidlezero((pa))
    219 
    220 /*
    221  * inline functions
    222  */
    223 
    224 /*ARGSUSED*/
    225 static __inline void
    226 pmap_remove_all(struct pmap *pmap)
    227 {
    228 	/* Nothing. */
    229 }
    230 
    231 /*
    232  * pmap_update_pg: flush one page from the TLB (or flush the whole thing
    233  *	if hardware doesn't support one-page flushing)
    234  */
    235 
    236 __inline static void __unused
    237 pmap_update_pg(vaddr_t va)
    238 {
    239 	invlpg(va);
    240 }
    241 
    242 /*
    243  * pmap_update_2pg: flush two pages from the TLB
    244  */
    245 
    246 __inline static void __unused
    247 pmap_update_2pg(vaddr_t va, vaddr_t vb)
    248 {
    249 	invlpg(va);
    250 	invlpg(vb);
    251 }
    252 
    253 /*
    254  * pmap_page_protect: change the protection of all recorded mappings
    255  *	of a managed page
    256  *
    257  * => this function is a frontend for pmap_page_remove/pmap_clear_attrs
    258  * => we only have to worry about making the page more protected.
    259  *	unprotecting a page is done on-demand at fault time.
    260  */
    261 
    262 __inline static void __unused
    263 pmap_page_protect(struct vm_page *pg, vm_prot_t prot)
    264 {
    265 	if ((prot & VM_PROT_WRITE) == 0) {
    266 		if (prot & (VM_PROT_READ|VM_PROT_EXECUTE)) {
    267 			(void) pmap_clear_attrs(pg, PG_RW);
    268 		} else {
    269 			pmap_page_remove(pg);
    270 		}
    271 	}
    272 }
    273 
    274 /*
    275  * pmap_protect: change the protection of pages in a pmap
    276  *
    277  * => this function is a frontend for pmap_remove/pmap_write_protect
    278  * => we only have to worry about making the page more protected.
    279  *	unprotecting a page is done on-demand at fault time.
    280  */
    281 
    282 __inline static void __unused
    283 pmap_protect(struct pmap *pmap, vaddr_t sva, vaddr_t eva, vm_prot_t prot)
    284 {
    285 	if ((prot & VM_PROT_WRITE) == 0) {
    286 		if (prot & (VM_PROT_READ|VM_PROT_EXECUTE)) {
    287 			pmap_write_protect(pmap, sva, eva, prot);
    288 		} else {
    289 			pmap_remove(pmap, sva, eva);
    290 		}
    291 	}
    292 }
    293 
    294 /*
    295  * various address inlines
    296  *
    297  *  vtopte: return a pointer to the PTE mapping a VA, works only for
    298  *  user and PT addresses
    299  *
    300  *  kvtopte: return a pointer to the PTE mapping a kernel VA
    301  */
    302 
    303 #include <lib/libkern/libkern.h>
    304 
    305 static __inline pt_entry_t * __unused
    306 vtopte(vaddr_t va)
    307 {
    308 
    309 	KASSERT(va < VM_MIN_KERNEL_ADDRESS);
    310 
    311 	return (PTE_BASE + pl1_i(va));
    312 }
    313 
    314 static __inline pt_entry_t * __unused
    315 kvtopte(vaddr_t va)
    316 {
    317 	pd_entry_t *pde;
    318 
    319 	KASSERT(va >= VM_MIN_KERNEL_ADDRESS);
    320 
    321 	pde = L2_BASE + pl2_i(va);
    322 	if (*pde & PG_PS)
    323 		return ((pt_entry_t *)pde);
    324 
    325 	return (PTE_BASE + pl1_i(va));
    326 }
    327 
    328 paddr_t vtophys(vaddr_t);
    329 vaddr_t	pmap_map(vaddr_t, paddr_t, paddr_t, vm_prot_t);
    330 void	pmap_cpu_init_early(struct cpu_info *);
    331 void	pmap_cpu_init_late(struct cpu_info *);
    332 void	sse2_zero_page(void *);
    333 void	sse2_copy_page(void *, void *);
    334 
    335 
    336 #ifdef XEN
    337 
    338 #define XPTE_MASK	L1_FRAME
    339 /* XPTE_SHIFT = L1_SHIFT - log2(sizeof(pt_entry_t)) */
    340 #ifdef __x86_64__
    341 #define XPTE_SHIFT	9
    342 #else
    343 #define XPTE_SHIFT	10
    344 #endif
    345 
    346 /* PTE access inline fuctions */
    347 
    348 /*
    349  * Get the machine address of the pointed pte
    350  * We use hardware MMU to get value so works only for levels 1-3
    351  */
    352 
    353 static __inline paddr_t
    354 xpmap_ptetomach(pt_entry_t *pte)
    355 {
    356 	pt_entry_t *up_pte;
    357 	vaddr_t va = (vaddr_t) pte;
    358 
    359 	va = ((va & XPTE_MASK) >> XPTE_SHIFT) | (vaddr_t) PTE_BASE;
    360 	up_pte = (pt_entry_t *) va;
    361 
    362 	return (paddr_t) (((*up_pte) & PG_FRAME) + (((vaddr_t) pte) & (~PG_FRAME & ~VA_SIGN_MASK)));
    363 }
    364 
    365 /*
    366  * xpmap_update()
    367  * Update an active pt entry with Xen
    368  * Equivalent to *pte = npte
    369  */
    370 
    371 static __inline void
    372 xpmap_update (pt_entry_t *pte, pt_entry_t npte)
    373 {
    374         int s = splvm();
    375 
    376         xpq_queue_pte_update((pt_entry_t *) xpmap_ptetomach(pte), npte);
    377         xpq_flush_queue();
    378         splx(s);
    379 }
    380 
    381 
    382 /* Xen helpers to change bits of a pte */
    383 #define XPMAP_UPDATE_DIRECT	1	/* Update direct map entry flags too */
    384 
    385 /* pmap functions with machine addresses */
    386 void	pmap_kenter_ma(vaddr_t, paddr_t, vm_prot_t);
    387 int	pmap_enter_ma(struct pmap *, vaddr_t, paddr_t, paddr_t,
    388 	    vm_prot_t, int, int);
    389 bool	pmap_extract_ma(pmap_t, vaddr_t, paddr_t *);
    390 paddr_t	vtomach(vaddr_t);
    391 
    392 #endif	/* XEN */
    393 
    394 /*
    395  * Hooks for the pool allocator.
    396  */
    397 #define	POOL_VTOPHYS(va)	vtophys((vaddr_t) (va))
    398 
    399 /*
    400  * TLB shootdown mailbox.
    401  */
    402 
    403 struct pmap_mbox {
    404 	volatile void		*mb_pointer;
    405 	volatile uintptr_t	mb_addr1;
    406 	volatile uintptr_t	mb_addr2;
    407 	volatile uintptr_t	mb_head;
    408 	volatile uintptr_t	mb_tail;
    409 	volatile uintptr_t	mb_global;
    410 };
    411 
    412 #endif /* _KERNEL */
    413 
    414 #endif /* _X86_PMAP_H_ */
    415