pmap.h revision 1.4.2.1       1  1.4.2.1  nathanw /*	$NetBSD: pmap.h,v 1.4.2.1 2001/06/21 19:19:00 nathanw Exp $	*/
      2      1.1  reinoud 
      3      1.1  reinoud /*
      4      1.1  reinoud  * Copyright (c) 1994,1995 Mark Brinicombe.
      5      1.1  reinoud  * All rights reserved.
      6      1.1  reinoud  *
      7      1.1  reinoud  * Redistribution and use in source and binary forms, with or without
      8      1.1  reinoud  * modification, are permitted provided that the following conditions
      9      1.1  reinoud  * are met:
     10      1.1  reinoud  * 1. Redistributions of source code must retain the above copyright
     11      1.1  reinoud  *    notice, this list of conditions and the following disclaimer.
     12      1.1  reinoud  * 2. Redistributions in binary form must reproduce the above copyright
     13      1.1  reinoud  *    notice, this list of conditions and the following disclaimer in the
     14      1.1  reinoud  *    documentation and/or other materials provided with the distribution.
     15      1.1  reinoud  * 3. All advertising materials mentioning features or use of this software
     16      1.1  reinoud  *    must display the following acknowledgement:
     17      1.1  reinoud  *	This product includes software developed by Mark Brinicombe
     18      1.1  reinoud  * 4. The name of the author may not be used to endorse or promote products
     19      1.1  reinoud  *    derived from this software without specific prior written permission.
     20      1.1  reinoud  *
     21      1.1  reinoud  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
     22      1.1  reinoud  * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
     23      1.1  reinoud  * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
     24      1.1  reinoud  * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
     25      1.1  reinoud  * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
     26      1.1  reinoud  * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
     27      1.1  reinoud  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
     28      1.1  reinoud  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
     29      1.1  reinoud  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
     30      1.1  reinoud  * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
     31      1.1  reinoud  */
     32      1.1  reinoud 
     33      1.1  reinoud #ifndef	_ARM32_PMAP_H_
     34      1.1  reinoud #define	_ARM32_PMAP_H_
     35      1.1  reinoud 
     36      1.1  reinoud #include <machine/cpufunc.h>
     37      1.1  reinoud #include <machine/pte.h>
     38      1.1  reinoud 
     39      1.1  reinoud /*
     40      1.1  reinoud  * Data structures used by pmap
     41      1.1  reinoud  */
     42      1.1  reinoud 
     43      1.1  reinoud /*
     44      1.1  reinoud  * Structure that describes a Level 1 page table and the flags
     45      1.1  reinoud  * associated with it.
     46      1.1  reinoud  */
     47      1.1  reinoud struct l1pt {
     48      1.1  reinoud 	SIMPLEQ_ENTRY(l1pt)	pt_queue;	/* Queue pointers */
     49      1.1  reinoud 	struct pglist		pt_plist;	/* Allocated page list */
     50      1.2     matt 	vaddr_t			pt_va;		/* Allocated virtual address */
     51      1.1  reinoud 	int	                pt_flags;	/* Flags */
     52      1.1  reinoud };
     53      1.1  reinoud #define	PTFLAG_STATIC		1		/* Statically allocated */
     54      1.1  reinoud #define PTFLAG_KPT		2		/* Kernel pt's are mapped */
     55      1.1  reinoud #define PTFLAG_CLEAN		4		/* L1 is clean */
     56      1.1  reinoud 
     57      1.1  reinoud /*
     58      1.1  reinoud  * The pmap structure itself.
     59      1.1  reinoud  */
     60      1.1  reinoud struct pmap {
     61      1.1  reinoud 	pd_entry_t		*pm_pdir;	/* KVA of page directory */
     62      1.1  reinoud 	struct l1pt		*pm_l1pt;	/* L1 descriptor */
     63      1.1  reinoud 	void			*pm_unused1;	/* Reserved for l2 map */
     64      1.3     matt 	paddr_t			pm_pptpt;	/* PA of pt's page table */
     65      1.2     matt 	vaddr_t			pm_vptpt;	/* VA of pt's page table */
     66      1.1  reinoud 	short			pm_dref;	/* page directory ref count */
     67      1.1  reinoud 	short			pm_count;	/* pmap reference count */
     68  1.4.2.1  nathanw 	struct simplelock	pm_lock;	/* lock on pmap */
     69      1.1  reinoud 	struct pmap_statistics	pm_stats;	/* pmap statistics */
     70      1.1  reinoud };
     71      1.1  reinoud 
     72      1.1  reinoud typedef struct pmap *pmap_t;
     73      1.1  reinoud 
     74      1.1  reinoud /*
     75  1.4.2.1  nathanw  * For each struct vm_page, there is a list of all currently valid virtual
     76      1.1  reinoud  * mappings of that page.  An entry is a pv_entry_t, the list is pv_table.
     77      1.1  reinoud  */
     78      1.1  reinoud typedef struct pv_entry {
     79      1.1  reinoud 	struct pv_entry *pv_next;       /* next pv_entry */
     80      1.1  reinoud 	pmap_t          pv_pmap;        /* pmap where mapping lies */
     81      1.2     matt 	vaddr_t         pv_va;          /* virtual address for mapping */
     82      1.1  reinoud 	int             pv_flags;       /* flags */
     83      1.1  reinoud } *pv_entry_t;
     84      1.1  reinoud 
     85      1.1  reinoud /*
     86      1.1  reinoud  * A pv_page_info struture looks like this. It is used to contain status
     87      1.1  reinoud  * information for pv_entry freelists.
     88      1.1  reinoud  */
     89      1.1  reinoud struct pv_page;
     90      1.1  reinoud 
     91      1.1  reinoud struct pv_page_info {
     92      1.1  reinoud 	TAILQ_ENTRY(pv_page) pgi_list;
     93      1.1  reinoud 	struct pv_entry *pgi_freelist;
     94      1.1  reinoud 	int pgi_nfree;
     95      1.1  reinoud };
     96      1.1  reinoud 
     97      1.1  reinoud /*
     98      1.1  reinoud  * A pv_page itself looks like this. pv_entries are requested from the VM a
     99      1.1  reinoud  * pv_page at a time.
    100      1.1  reinoud  *
    101      1.1  reinoud  * We also define a macro that states the number of pv_entries per page
    102      1.1  reinoud  * allocated.
    103      1.1  reinoud  */
    104      1.1  reinoud #define NPVPPG	((NBPG - sizeof(struct pv_page_info)) / sizeof(struct pv_entry))
    105      1.1  reinoud 
    106      1.1  reinoud struct pv_page {
    107      1.1  reinoud 	struct pv_page_info pvp_pgi;
    108      1.1  reinoud 	struct pv_entry pvp_pv[NPVPPG];
    109      1.1  reinoud };
    110      1.1  reinoud 
    111      1.1  reinoud /*
    112      1.1  reinoud  * Page hooks. I'll eliminate these sometime soon :-)
    113      1.1  reinoud  *
    114      1.1  reinoud  * For speed we store the both the virtual address and the page table
    115      1.1  reinoud  * entry address for each page hook.
    116      1.1  reinoud  */
    117      1.1  reinoud typedef struct {
    118      1.2     matt         vaddr_t va;
    119      1.1  reinoud         pt_entry_t *pte;
    120      1.1  reinoud } pagehook_t;
    121      1.1  reinoud 
    122      1.1  reinoud /*
    123      1.1  reinoud  * Physical / virtual address structure. In a number of places (particularly
    124      1.1  reinoud  * during bootstrapping) we need to keep track of the physical and virtual
    125      1.1  reinoud  * addresses of various pages
    126      1.1  reinoud  */
    127      1.1  reinoud typedef struct {
    128      1.3     matt 	paddr_t pv_pa;
    129      1.2     matt 	vaddr_t pv_va;
    130      1.1  reinoud } pv_addr_t;
    131      1.1  reinoud 
    132      1.1  reinoud /*
    133      1.1  reinoud  * _KERNEL specific macros, functions and prototypes
    134      1.1  reinoud  */
    135      1.1  reinoud 
    136      1.1  reinoud #ifdef  _KERNEL
    137      1.1  reinoud 
    138      1.1  reinoud /*
    139      1.1  reinoud  * Commonly referenced structures
    140      1.1  reinoud  */
    141      1.1  reinoud extern pv_entry_t	pv_table;	/* Phys to virt mappings, per page. */
    142      1.1  reinoud extern pmap_t		kernel_pmap;	/* pmap pointer used for the kernel */
    143      1.1  reinoud extern struct pmap	kernel_pmap_store;  /* kernel_pmap points to this */
    144      1.4     matt extern int		pmap_debug_level; /* Only exists if PMAP_DEBUG */
    145      1.1  reinoud 
    146      1.1  reinoud /*
    147      1.1  reinoud  * Macros that we need to export
    148      1.1  reinoud  */
    149      1.1  reinoud #define pmap_kernel()			(&kernel_pmap_store)
    150  1.4.2.1  nathanw #define pmap_update()			/* nothing (yet) */
    151      1.1  reinoud #define	pmap_resident_count(pmap)	((pmap)->pm_stats.resident_count)
    152      1.1  reinoud #define	pmap_wired_count(pmap)		((pmap)->pm_stats.wired_count)
    153      1.1  reinoud 
    154      1.1  reinoud #define pmap_phys_address(ppn)		(arm_page_to_byte((ppn)))
    155      1.1  reinoud 
    156      1.1  reinoud /*
    157      1.1  reinoud  * Functions that we need to export
    158      1.1  reinoud  */
    159      1.3     matt extern boolean_t pmap_testbit __P((paddr_t, int));
    160      1.3     matt extern void pmap_changebit __P((paddr_t, int, int));
    161      1.2     matt extern vaddr_t pmap_map __P((vaddr_t, vaddr_t, vaddr_t, int));
    162      1.4     matt extern void pmap_procwr __P((struct proc *, vaddr_t, int));
    163      1.1  reinoud #define	PMAP_NEED_PROCWR
    164      1.4     matt 
    165      1.4     matt /*
    166      1.4     matt  * Functions we use internally
    167      1.4     matt  */
    168      1.4     matt extern void pmap_bootstrap __P((pd_entry_t *, pv_addr_t));
    169      1.4     matt extern void pmap_debug	__P((int));
    170      1.4     matt extern int pmap_handled_emulation __P((pmap_t, vaddr_t));
    171      1.4     matt extern int pmap_modified_emulation __P((pmap_t, vaddr_t));
    172      1.4     matt extern void pmap_postinit __P((void));
    173      1.4     matt extern pt_entry_t *pmap_pte __P((pmap_t, vaddr_t));
    174      1.1  reinoud 
    175      1.1  reinoud #endif	/* _KERNEL */
    176      1.1  reinoud 
    177      1.1  reinoud /*
    178      1.1  reinoud  * Useful macros and constants
    179      1.1  reinoud  */
    180      1.1  reinoud 
    181      1.1  reinoud /* Virtual address to page table entry */
    182      1.1  reinoud #define vtopte(va) \
    183      1.1  reinoud 	((pt_entry_t *)(PROCESS_PAGE_TBLS_BASE + \
    184      1.1  reinoud 	(arm_byte_to_page((unsigned int)(va)) << 2)))
    185      1.1  reinoud 
    186      1.1  reinoud /* Virtual address to physical address */
    187      1.1  reinoud #define vtophys(va) \
    188      1.1  reinoud 	((*vtopte(va) & PG_FRAME) | ((unsigned int)(va) & ~PG_FRAME))
    189      1.1  reinoud 
    190      1.1  reinoud /* L1 and L2 page table macros */
    191      1.2     matt #define pmap_pde(m, v) (&((m)->pm_pdir[((vaddr_t)(v) >> PDSHIFT)&4095]))
    192      1.1  reinoud #define pmap_pte_pa(pte)	(*(pte) & PG_FRAME)
    193      1.1  reinoud #define pmap_pde_v(pde)		(*(pde) != 0)
    194      1.1  reinoud #define pmap_pte_v(pte)		(*(pte) != 0)
    195      1.1  reinoud 
    196      1.1  reinoud /* Size of the kernel part of the L1 page table */
    197      1.1  reinoud #define KERNEL_PD_SIZE	\
    198      1.1  reinoud 	(PD_SIZE - (KERNEL_SPACE_START >> PDSHIFT) * sizeof(pd_entry_t))
    199      1.1  reinoud 
    200      1.1  reinoud #endif	/* _ARM32_PMAP_H_ */
    201