* Copyright (c) 1987 Carnegie-Mellon University
* Copyright (c) 1992 OMRON Corporation.
* Copyright (c) 1991, 1992 Regents of the University of California.
* This code is derived from software contributed to Berkeley by
* the Systems Programming Group of the University of Utah Computer
* %sccs.include.redist.c%
* OMRON: $Id: pmap.h,v 1.2 92/06/14 06:29:43 moti Exp $
* @(#)pmap.h 7.2 (Berkeley) %G%
#define LUNA_PAGE_SIZE NBPG
#define LUNA_SEG_SIZE NBSEG
#define luna_trunc_seg(x) (((unsigned)(x)) & ~(LUNA_SEG_SIZE-1))
#define luna_round_seg(x) luna_trunc_seg((unsigned)(x) + LUNA_SEG_SIZE-1)
struct pte
*pm_ptab
; /* KVA of page table */
struct ste
*pm_stab
; /* KVA of segment table */
int pm_stchanged
; /* ST changed */
int pm_stfree
; /* 040: free lev2 blocks */
struct ste
*pm_stpa
; /* 040: ST phys addr */
short pm_sref
; /* segment table ref count */
short pm_count
; /* pmap reference count */
simple_lock_data_t pm_lock
; /* lock on pmap */
struct pmap_statistics pm_stats
; /* pmap statistics */
long pm_ptpages
; /* more stats: PT pages */
typedef struct pmap
*pmap_t
;
extern struct pmap kernel_pmap_store
;
#define kernel_pmap (&kernel_pmap_store)
* On the 040 we keep track of which level 2 blocks are already in use
* with the pm_stfree mask. Bits are arranged from LSB (block 0) to MSB
* (block 31). For convenience, the level 1 table is considered to be
* MAX[KU]L2SIZE control how many pages of level 2 descriptors are allowed.
* for the kernel and users. 8 implies only the initial "segment table"
* page is used. WARNING: don't change MAXUL2SIZE unless you can allocate
* physically contiguous pages for the ST in pmap.c!
#define l2tobm(n) (1 << (n))
#define bmtol2(n) (ffs(n) - 1)
#define PMAP_ACTIVATE(pmapp, pcbp, iscurproc) \
if ((pmapp) != NULL && (pmapp)->pm_stchanged) { \
(pcbp)->pcb_ustp = luna_btop((vm_offset_t)(pmapp)->pm_stpa); \
loadustp((pcbp)->pcb_ustp); \
(pmapp)->pm_stchanged = FALSE; \
#define PMAP_DEACTIVATE(pmapp, pcbp)
* For each vm_page_t, there is a list of all currently valid virtual
* mappings of that page. An entry is a pv_entry_t, the list is pv_table.
typedef struct pv_entry
{
struct pv_entry
*pv_next
; /* next pv_entry */
struct pmap
*pv_pmap
; /* pmap where mapping lies */
vm_offset_t pv_va
; /* virtual address for mapping */
struct ste
*pv_ptste
; /* non-zero if VA maps a PT page */
struct pmap
*pv_ptpmap
; /* if pv_ptste, pmap for PT page */
int pv_flags
; /* flags */
#define PV_CI 0x01 /* all entries must be cache inhibited */
#define PV_PTPAGE 0x02 /* entry maps a page table page */
pv_entry_t pv_table
; /* array of entries, one per page */
#define pa_index(pa) atop(pa - vm_first_phys)
#define pa_to_pvh(pa) (&pv_table[pa_index(pa)])
#define pmap_resident_count(pmap) ((pmap)->pm_stats.resident_count)
extern struct pte
*Sysmap
;
extern char *vmmap
; /* map for mem, dumps, etc. */
* definitions LUNA IO space mapping