497 lines
16 KiB
C
497 lines
16 KiB
C
/* $NetBSD: pmap.new.h,v 1.2 1998/04/25 19:55:47 matthias Exp $ */
|
|
|
|
/*
|
|
*
|
|
* Copyright (c) 1997 Charles D. Cranor and Washington University.
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 3. All advertising materials mentioning features or use of this software
|
|
* must display the following acknowledgment:
|
|
* This product includes software developed by Charles D. Cranor and
|
|
* Washington University.
|
|
* 4. The name of the author may not be used to endorse or promote products
|
|
* derived from this software without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
|
|
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
|
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
|
|
* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
|
|
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
|
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
|
|
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
*/
|
|
|
|
/*
|
|
* pmap.h: see pmap.c for the history of this pmap module.
|
|
*/
|
|
|
|
#ifndef _NS532_PMAP_H_
|
|
#define _NS532_PMAP_H_
|
|
|
|
#include <machine/cpufunc.h>
|
|
#include <machine/pte.h>
|
|
#include <uvm/uvm_object.h>
|
|
|
|
/*
|
|
* See pte.h for a description of ns32k MMU terminology and hardware
|
|
* interface.
|
|
*
|
|
* A pmap describes a processes' 4GB virtual address space. This
|
|
* virtual address space can be broken up into 1024 4MB regions which
|
|
* are described by PDEs in the PDP. The PDEs are defined as follows:
|
|
*
|
|
* (ranges are inclusive -> exclusive, just like vm_map_entry start/end)
|
|
* (the following assumes that KERNBASE is 0xf8000000)
|
|
*
|
|
* PDE#s VA range usage
|
|
* 0->991 0x0 -> 0xf7c00000 user address space
|
|
* 991 0xf7c00000-> recursive mapping of PDP (used for
|
|
* 0xf8000000 linear mapping of PTPs)
|
|
* 992->1022 0xf8000000-> kernel address space (constant
|
|
* 0xff800000 across all pmap's/processes)
|
|
* 1022 0xff800000-> "alternate" recursive PDP mapping
|
|
* 0xffc00000 (for other pmaps)
|
|
* 1023 0xffc00000-> memory mapped i/o
|
|
* <end>
|
|
*
|
|
*
|
|
* Note: A recursive PDP mapping provides a way to map all the PTEs for
|
|
* a 4GB address space into a linear chunk of virtual memory. In other
|
|
* words, the PTE for page 0 is the first int mapped into the 4MB recursive
|
|
* area. The PTE for page 1 is the second int. The very last int in the
|
|
* 4MB range is the PTE that maps VA 0xffffe000 (the last page in a 4GB
|
|
* address).
|
|
*
|
|
* All pmap's PD's must have the same values in slots 991->1023 so that
|
|
* the kernel and the i/o is always mapped in every process. These values
|
|
* are loaded into the PD at pmap creation time.
|
|
*
|
|
* At any one time only one pmap can be active on a processor. This is
|
|
* the pmap whose PDP is pointed to by processor register ptb0. This pmap
|
|
* will have all its PTEs mapped into memory at the recursive mapping
|
|
* point (slot #991 as show above). When the pmap code wants to find the
|
|
* PTE for a virtual address, all it has to do is the following:
|
|
*
|
|
* address of PTE = (991 * 4MB) + (VA / NBPG) * sizeof(pt_entry_t)
|
|
* = 0xf7c00000 + (VA / 4096) * 4
|
|
*
|
|
* What happens if the pmap layer is asked to perform an operation
|
|
* on a pmap that is not the one which is currently active? In that
|
|
* case we take the PA of the PDP of non-active pmap and put it in
|
|
* slot 1022 of the active pmap. This causes the non-active pmap's
|
|
* PTEs to get mapped in the 4MB just before the last 4MB of the
|
|
* 4GB address space (e.g. starting at 0xff800000).
|
|
*
|
|
* The following figure shows the effects of the recursive PDP mapping:
|
|
*
|
|
* PDP (ptb0)
|
|
* +----+
|
|
* | 0| -> PTP#0 that maps VA 0x0 -> 0x400000
|
|
* | |
|
|
* | |
|
|
* | 991| -> points back to PDP (ptb0) mapping VA 0xf7c00000 -> 0xf8000000
|
|
* | 992| -> first kernel PTP (maps 0xf8000000 -> 0xf8400000)
|
|
* | |
|
|
* |1022| -> points to alternate pmap's PDP (maps 0xff800000 -> 0xffc00000)
|
|
* +----+
|
|
*
|
|
* Note that the PDE#991 VA (0xf7c00000) is defined as "PTE_BASE"
|
|
* Note that the PDE#1022 VA (0xff800000) is defined as "APTE_BASE"
|
|
*
|
|
* starting at VA 0xf7c00000 the current active PDP (ptb0) acts as a
|
|
* PTP:
|
|
*
|
|
* PTP#991 == PDP(ptb0) => maps VA 0xf7c00000 -> 0xf8000000
|
|
* +----+
|
|
* | 0| -> maps the contents of PTP#0 at VA 0xf7c00000->0xf7c01000
|
|
* | |
|
|
* | |
|
|
* | 991| -> maps contents of PTP#991 (the PDP) at VA 0xf7fdf000
|
|
* | 992| -> maps contents of first kernel PTP
|
|
* | |
|
|
* |1023|
|
|
* +----+
|
|
*
|
|
* Note that mapping of the PDP at PTP#991's VA (0xf7fdf000) is
|
|
* defined as "PDP_BASE".... within that mapping there are two
|
|
* defines:
|
|
* "PDP_PDE" (0xf7fdff7c) is the VA of the PDE in the PDP
|
|
* which points back to itself.
|
|
* "APDP_PDE" (0xf7fdfff8) is the VA of the PDE in the PDP which
|
|
* establishes the recursive mapping of the alternate pmap.
|
|
* To set the alternate PDP, one just has to put the correct
|
|
* PA info in *APDP_PDE.
|
|
*
|
|
* Note that in the APTE_BASE space, the APDP appears at VA
|
|
* "APDP_BASE" (0xffbfe000).
|
|
*/
|
|
|
|
/*
|
|
* the following defines identify the slots used as described above.
|
|
*/
|
|
|
|
#define PDSLOT_PTE ((KERNBASE/NBPD)-1) /* 991: for recursive PDP map */
|
|
#define PDSLOT_KERN (KERNBASE/NBPD) /* 992: start of kernel space */
|
|
#define PDSLOT_APTE ((unsigned)1022) /* 1022: alternative recursive slot */
|
|
|
|
/*
|
|
* the following defines give the virtual addresses of various MMU
|
|
* data structures:
|
|
* PTE_BASE and APTE_BASE: the base VA of the linear PTE mappings
|
|
* PTD_BASE and APTD_BASE: the base VA of the recursive mapping of the PTD
|
|
* PDP_PDE and APDP_PDE: the VA of the PDE that points back to the PDP/APDP
|
|
*/
|
|
|
|
#define PTE_BASE ((pt_entry_t *) (PDSLOT_PTE * NBPD) )
|
|
#define APTE_BASE ((pt_entry_t *) (PDSLOT_APTE * NBPD) )
|
|
#define PDP_BASE ((pd_entry_t *) (((char *)PTE_BASE) + (PDSLOT_PTE * NBPG)) )
|
|
#define APDP_BASE ((pd_entry_t *) (((char *)APTE_BASE) + (PDSLOT_APTE * NBPG)) )
|
|
#define PDP_PDE (PDP_BASE + PDSLOT_PTE)
|
|
#define APDP_PDE (PDP_BASE + PDSLOT_APTE)
|
|
|
|
/*
|
|
* XXXCDC: tmp xlate from old names:
|
|
* PTDPTDI -> PDSLOT_PTE
|
|
* KPTDI -> PDSLOT_KERN
|
|
* APTDPTDI -> PDSLOT_APTE
|
|
*/
|
|
|
|
/*
|
|
* the follow define determines how many PTPs should be set up for the
|
|
* kernel by locore.s at boot time. this should be large enough to
|
|
* get the VM system running. once the VM system is running, the
|
|
* pmap module can add more PTPs to the kernel area on demand.
|
|
*/
|
|
|
|
#ifndef NKPTP
|
|
#define NKPTP 4 /* 16MB to start */
|
|
#endif
|
|
#define NKPTP_MIN 4 /* smallest value we allow */
|
|
#define NKPTP_MAX (1024 - (KERNBASE/NBPD) - 2)
|
|
/* largest value (-2 for APTP and i/o space) */
|
|
|
|
/*
|
|
* various address macros
|
|
*
|
|
* vtopte: return a pointer to the PTE mapping a VA
|
|
* kvtopte: same as above (takes a KVA, but doesn't matter with this pmap)
|
|
* ptetov: given a pointer to a PTE, return the VA that it maps
|
|
* vtophys: translate a VA to the PA mapped to it
|
|
*
|
|
* plus alternative versions of the above
|
|
*/
|
|
|
|
#define vtopte(VA) (PTE_BASE + ns532_btop(VA))
|
|
#define kvtopte(VA) vtopte(VA)
|
|
#define ptetov(PT) (ns532_ptob(PT - PTE_BASE))
|
|
#define vtophys(VA) ((*vtopte(VA) & PG_FRAME) | ((unsigned)(VA) & ~PG_FRAME))
|
|
#define avtopte(VA) (APTE_BASE + ns532_btop(VA))
|
|
#define ptetoav(PT) (ns532_ptob(PT - APTE_BASE))
|
|
#define avtophys(VA) ((*avtopte(VA) & PG_FRAME) | ((unsigned)(VA) & ~PG_FRAME))
|
|
|
|
/*
|
|
* pdei/ptei: generate index into PDP/PTP from a VA
|
|
*/
|
|
#define pdei(VA) (((VA) & PD_MASK) >> PDSHIFT)
|
|
#define ptei(VA) (((VA) & PT_MASK) >> PGSHIFT)
|
|
|
|
/*
|
|
* PTP macros:
|
|
* a PTP's index is the PD index of the PDE that points to it
|
|
* a PTP's offset is the byte-offset in the PTE space that this PTP is at
|
|
* a PTP's VA is the first VA mapped by that PTP
|
|
*
|
|
* note that NBPG == number of bytes in a PTP (4096 bytes == 1024 entries)
|
|
* NBPD == number of bytes a PTP can map (4MB)
|
|
*/
|
|
|
|
#define ptp_i2o(I) ((I) * NBPG) /* index => offset */
|
|
#define ptp_o2i(O) ((O) / NBPG) /* offset => index */
|
|
#define ptp_i2v(I) ((I) * NBPD) /* index => VA */
|
|
#define ptp_v2i(V) ((V) / NBPD) /* VA => index (same as pdei) */
|
|
|
|
/*
|
|
* PG_AVAIL usage: we make use of the ignored bits of the PTE
|
|
*/
|
|
|
|
#define PG_W PG_AVAIL1 /* "wired" mapping */
|
|
#define PG_PVLIST PG_AVAIL2 /* mapping has entry on pvlist */
|
|
/* PG_AVAIL3 not used */
|
|
|
|
#ifdef _KERNEL
|
|
/*
|
|
* pmap data structures: see pmap.c for details of locking.
|
|
*/
|
|
|
|
struct pmap;
|
|
typedef struct pmap *pmap_t;
|
|
|
|
/*
|
|
* we maintain a list of all non-kernel pmaps
|
|
*/
|
|
|
|
LIST_HEAD(pmap_head, pmap); /* struct pmap_head: head of a pmap list */
|
|
|
|
/*
|
|
* the pmap structure
|
|
*
|
|
* note that the pm_obj contains the simple_lock, the reference count,
|
|
* page list, and number of PTPs within the pmap.
|
|
*/
|
|
|
|
struct pmap {
|
|
struct uvm_object pm_obj; /* object (lck by object lock) */
|
|
LIST_ENTRY(pmap) pm_list; /* list (lck by pm_list lock) */
|
|
pd_entry_t *pm_pdir; /* VA of PD (lck by object lock) */
|
|
u_int32_t pm_pdirpa; /* PA of PD (read-only after create) */
|
|
struct vm_page *pm_ptphint; /* pointer to a random PTP in our pmap */
|
|
struct pmap_statistics pm_stats; /* pmap stats (lck by object lock) */
|
|
};
|
|
|
|
/*
|
|
* for each managed physical page we maintain a list of <PMAP,VA>'s
|
|
* which it is mapped at. the list is headed by a pv_head structure.
|
|
* there is one pv_head per managed phys page (allocated at boot time).
|
|
* the pv_head structure points to a list of pv_entry structures (each
|
|
* describes one mapping).
|
|
*/
|
|
|
|
struct pv_entry;
|
|
|
|
struct pv_head {
|
|
simple_lock_data_t pvh_lock; /* locks every pv on this list */
|
|
struct pv_entry *pvh_list; /* head of list (locked by pvh_lock) */
|
|
};
|
|
|
|
struct pv_entry { /* all fields locked by their pvh_lock */
|
|
struct pv_entry *pv_next; /* next entry */
|
|
struct pmap *pv_pmap; /* the pmap */
|
|
vm_offset_t pv_va; /* the virtual address */
|
|
struct vm_page *pv_ptp; /* the vm_page of the PTP */
|
|
};
|
|
|
|
/*
|
|
* pv_entrys are dynamically allocated in chunks from a single page.
|
|
* we keep track of how many pv_entrys are in use for each page and
|
|
* we can free pv_entry pages if needed. there is one lock for the
|
|
* entire allocation system.
|
|
*/
|
|
|
|
struct pv_page_info {
|
|
TAILQ_ENTRY(pv_page) pvpi_list;
|
|
struct pv_entry *pvpi_pvfree;
|
|
int pvpi_nfree;
|
|
};
|
|
|
|
/*
|
|
* number of pv_entry's in a pv_page
|
|
* (note: won't work on systems where NPBG isn't a constant)
|
|
*/
|
|
|
|
#define PVE_PER_PVPAGE ( (NBPG - sizeof(struct pv_page_info)) / \
|
|
sizeof(struct pv_entry) )
|
|
|
|
/*
|
|
* a pv_page: where pv_entrys are allocated from
|
|
*/
|
|
|
|
struct pv_page {
|
|
struct pv_page_info pvinfo;
|
|
struct pv_entry pvents[PVE_PER_PVPAGE];
|
|
};
|
|
|
|
/*
|
|
* pmap_remove_record: a record of VAs that have been unmapped, used to
|
|
* flush TLB. if we have more than PMAP_RR_MAX then we stop recording.
|
|
*/
|
|
|
|
#define PMAP_RR_MAX 16 /* max of 16 pages (64K) */
|
|
|
|
struct pmap_remove_record {
|
|
int prr_npages;
|
|
vm_offset_t prr_vas[PMAP_RR_MAX];
|
|
};
|
|
|
|
/*
|
|
* pmap_transfer_location: used to pass the current location in the
|
|
* pmap between pmap_transfer and pmap_transfer_ptes [e.g. during
|
|
* a pmap_copy].
|
|
*/
|
|
|
|
struct pmap_transfer_location {
|
|
vm_offset_t addr; /* the address (page-aligned) */
|
|
pt_entry_t *pte; /* the PTE that maps address */
|
|
struct vm_page *ptp; /* the PTP that the PTE lives in */
|
|
};
|
|
|
|
/*
|
|
* global kernel variables
|
|
*/
|
|
|
|
/* PTDpaddr: is the physical address of the kernel's PDP */
|
|
extern u_long PTDpaddr;
|
|
|
|
extern struct pmap kernel_pmap_store; /* kernel pmap */
|
|
extern int nkpde; /* current # of PDEs for kernel */
|
|
|
|
/*
|
|
* macros
|
|
*/
|
|
|
|
#define pmap_kernel() (&kernel_pmap_store)
|
|
#define pmap_resident_count(pmap) ((pmap)->pm_stats.resident_count)
|
|
#define pmap_update() tlbflush()
|
|
|
|
#define pmap_clear_modify(pg) pmap_change_attrs(pg, 0, PG_M)
|
|
#define pmap_clear_reference(pg) pmap_change_attrs(pg, 0, PG_U)
|
|
#define pmap_copy(DP,SP,D,L,S) pmap_transfer(DP,SP,D,L,S, FALSE)
|
|
#define pmap_is_modified(pg) pmap_test_attrs(pg, PG_M)
|
|
#define pmap_is_referenced(pg) pmap_test_attrs(pg, PG_U)
|
|
#define pmap_move(DP,SP,D,L,S) pmap_transfer(DP,SP,D,L,S, TRUE)
|
|
#define pmap_phys_address(ppn) ns532_ptob(ppn)
|
|
#define pmap_valid_entry(E) ((E) & PG_V) /* is PDE or PTE valid? */
|
|
|
|
|
|
/*
|
|
* prototypes
|
|
*/
|
|
|
|
void pmap_activate __P((struct proc *));
|
|
void pmap_bootstrap __P((vm_offset_t));
|
|
boolean_t pmap_change_attrs __P((struct vm_page *, int, int));
|
|
void pmap_deactivate __P((struct proc *));
|
|
static void pmap_kenter_pa __P((vm_offset_t, vm_offset_t, vm_prot_t));
|
|
static void pmap_page_protect __P((struct vm_page *, vm_prot_t));
|
|
void pmap_page_remove __P((struct vm_page *));
|
|
static void pmap_protect __P((struct pmap *, vm_offset_t,
|
|
vm_offset_t, vm_prot_t));
|
|
void pmap_remove __P((struct pmap *, vm_offset_t, vm_offset_t));
|
|
boolean_t pmap_test_attrs __P((struct vm_page *, int));
|
|
void pmap_transfer __P((struct pmap *, struct pmap *, vm_offset_t,
|
|
vm_size_t, vm_offset_t, boolean_t));
|
|
static void pmap_update_pg __P((vm_offset_t));
|
|
static void pmap_update_2pg __P((vm_offset_t,vm_offset_t));
|
|
void pmap_write_protect __P((struct pmap *, vm_offset_t,
|
|
vm_offset_t, vm_prot_t));
|
|
|
|
vm_offset_t reserve_dumppages __P((vm_offset_t)); /* XXX: not a pmap fn */
|
|
|
|
#define PMAP_GROWKERNEL /* turn on pmap_growkernel interface */
|
|
|
|
/*
|
|
* inline functions
|
|
*/
|
|
|
|
/*
|
|
* pmap_update_pg: flush one page from the TLB (or flush the whole thing
|
|
* if hardware doesn't support one-page flushing)
|
|
*/
|
|
|
|
__inline static void pmap_update_pg(va)
|
|
|
|
vm_offset_t va;
|
|
|
|
{
|
|
tlbflush_entry((u_int) va);
|
|
}
|
|
|
|
/*
|
|
* pmap_update_2pg: flush two pages from the TLB
|
|
*/
|
|
|
|
__inline static void pmap_update_2pg(va, vb)
|
|
|
|
vm_offset_t va, vb;
|
|
|
|
{
|
|
tlbflush_entry((u_int) va);
|
|
tlbflush_entry((u_int) vb);
|
|
}
|
|
|
|
/*
|
|
* pmap_page_protect: change the protection of all recorded mappings
|
|
* of a managed page
|
|
*
|
|
* => this function is a frontend for pmap_page_remove/pmap_change_attrs
|
|
* => we only have to worry about making the page more protected.
|
|
* unprotecting a page is done on-demand at fault time.
|
|
*/
|
|
|
|
__inline static void pmap_page_protect(pg, prot)
|
|
|
|
struct vm_page *pg;
|
|
vm_prot_t prot;
|
|
|
|
{
|
|
if ((prot & VM_PROT_WRITE) == 0) {
|
|
if (prot & (VM_PROT_READ|VM_PROT_EXECUTE)) {
|
|
(void) pmap_change_attrs(pg, PG_RO, PG_RW);
|
|
} else {
|
|
pmap_page_remove(pg);
|
|
}
|
|
}
|
|
}
|
|
|
|
/*
|
|
* pmap_protect: change the protection of pages in a pmap
|
|
*
|
|
* => this function is a frontend for pmap_remove/pmap_write_protect
|
|
* => we only have to worry about making the page more protected.
|
|
* unprotecting a page is done on-demand at fault time.
|
|
*/
|
|
|
|
__inline static void pmap_protect(pmap, sva, eva, prot)
|
|
|
|
struct pmap *pmap;
|
|
vm_offset_t sva, eva;
|
|
vm_prot_t prot;
|
|
|
|
{
|
|
if ((prot & VM_PROT_WRITE) == 0) {
|
|
if (prot & (VM_PROT_READ|VM_PROT_EXECUTE)) {
|
|
pmap_write_protect(pmap, sva, eva, prot);
|
|
} else {
|
|
pmap_remove(pmap, sva, eva);
|
|
}
|
|
}
|
|
}
|
|
|
|
/*
|
|
* pmap_kenter_pa: enter a kernel mapping without R/M (pv_entry) tracking
|
|
*
|
|
* => no need to lock anything, assume va is already allocated
|
|
* => should be faster than normal pmap enter function
|
|
*/
|
|
|
|
__inline static void pmap_kenter_pa(va, pa, prot)
|
|
|
|
vm_offset_t va, pa;
|
|
vm_prot_t prot;
|
|
|
|
{
|
|
pt_entry_t *pte, opte;
|
|
|
|
pte = vtopte(va);
|
|
opte = *pte;
|
|
*pte = pa | ((prot & VM_PROT_WRITE)? PG_RW : PG_RO) |
|
|
PG_V; /* zap! */
|
|
if (pmap_valid_entry(opte))
|
|
pmap_update_pg(va);
|
|
}
|
|
|
|
vm_offset_t pmap_map __P((vm_offset_t, vm_offset_t, vm_offset_t, int));
|
|
|
|
#endif /* _KERNEL */
|
|
#endif /* _NS532_PMAP_H_ */
|