433b5dde02
#include the <i386/foo.h> in the #else clause, making these files largely bit-size independant.
353 lines
11 KiB
C
353 lines
11 KiB
C
/* $NetBSD: pmap.h,v 1.22 2008/10/26 00:08:15 mrg 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.
|
|
*/
|
|
|
|
/*
|
|
* Copyright (c) 2001 Wasabi Systems, Inc.
|
|
* All rights reserved.
|
|
*
|
|
* Written by Frank van der Linden for Wasabi Systems, Inc.
|
|
*
|
|
* 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 acknowledgement:
|
|
* This product includes software developed for the NetBSD Project by
|
|
* Wasabi Systems, Inc.
|
|
* 4. The name of Wasabi Systems, Inc. may not be used to endorse
|
|
* or promote products derived from this software without specific prior
|
|
* written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY WASABI SYSTEMS, INC. ``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 WASABI SYSTEMS, INC
|
|
* 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.
|
|
*/
|
|
|
|
#ifndef _AMD64_PMAP_H_
|
|
#define _AMD64_PMAP_H_
|
|
|
|
#ifdef __x86_64__
|
|
|
|
#if defined(_KERNEL_OPT)
|
|
#include "opt_xen.h"
|
|
#endif
|
|
|
|
#include <sys/atomic.h>
|
|
|
|
#include <machine/pte.h>
|
|
#include <machine/segments.h>
|
|
#ifdef _KERNEL
|
|
#include <machine/cpufunc.h>
|
|
#endif
|
|
|
|
#include <uvm/uvm_object.h>
|
|
#ifdef XEN
|
|
#include <xen/xenfunc.h>
|
|
#include <xen/xenpmap.h>
|
|
#endif /* XEN */
|
|
|
|
/*
|
|
* The x86_64 pmap module closely resembles the i386 one. It uses
|
|
* the same recursive entry scheme, and the same alternate area
|
|
* trick for accessing non-current pmaps. See the i386 pmap.h
|
|
* for a description. The obvious difference is that 3 extra
|
|
* levels of page table need to be dealt with. The level 1 page
|
|
* table pages are at:
|
|
*
|
|
* l1: 0x00007f8000000000 - 0x00007fffffffffff (39 bits, needs PML4 entry)
|
|
*
|
|
* The alternate space is at:
|
|
*
|
|
* l1: 0xffffff8000000000 - 0xffffffffffffffff (39 bits, needs PML4 entry)
|
|
*
|
|
* The rest is kept as physical pages in 3 UVM objects, and is
|
|
* temporarily mapped for virtual access when needed.
|
|
*
|
|
* Note that address space is signed, so the layout for 48 bits is:
|
|
*
|
|
* +---------------------------------+ 0xffffffffffffffff
|
|
* | |
|
|
* | alt.L1 table (PTE pages) |
|
|
* | |
|
|
* +---------------------------------+ 0xffffff8000000000
|
|
* ~ ~
|
|
* | |
|
|
* | Kernel Space |
|
|
* | |
|
|
* | |
|
|
* +---------------------------------+ 0xffff800000000000 = 0x0000800000000000
|
|
* | |
|
|
* | alt.L1 table (PTE pages) |
|
|
* | |
|
|
* +---------------------------------+ 0x00007f8000000000
|
|
* ~ ~
|
|
* | |
|
|
* | User Space |
|
|
* | |
|
|
* | |
|
|
* +---------------------------------+ 0x0000000000000000
|
|
*
|
|
* In other words, there is a 'VA hole' at 0x0000800000000000 -
|
|
* 0xffff800000000000 which will trap, just as on, for example,
|
|
* sparcv9.
|
|
*
|
|
* The unused space can be used if needed, but it adds a little more
|
|
* complexity to the calculations.
|
|
*/
|
|
|
|
/*
|
|
* The first generation of Hammer processors can use 48 bits of
|
|
* virtual memory, and 40 bits of physical memory. This will be
|
|
* more for later generations. These defines can be changed to
|
|
* variable names containing the # of bits, extracted from an
|
|
* extended cpuid instruction (variables are harder to use during
|
|
* bootstrap, though)
|
|
*/
|
|
#define VIRT_BITS 48
|
|
#define PHYS_BITS 40
|
|
|
|
/*
|
|
* Mask to get rid of the sign-extended part of addresses.
|
|
*/
|
|
#define VA_SIGN_MASK 0xffff000000000000
|
|
#define VA_SIGN_NEG(va) ((va) | VA_SIGN_MASK)
|
|
/*
|
|
* XXXfvdl this one's not right.
|
|
*/
|
|
#define VA_SIGN_POS(va) ((va) & ~VA_SIGN_MASK)
|
|
|
|
#define L4_SLOT_PTE 255
|
|
#ifndef XEN
|
|
#define L4_SLOT_KERN 256
|
|
#else
|
|
/* Xen use slots 256-272, let's move farther */
|
|
#define L4_SLOT_KERN 320
|
|
#endif
|
|
#define L4_SLOT_KERNBASE 511
|
|
#define L4_SLOT_APTE 510
|
|
|
|
#define PDIR_SLOT_KERN L4_SLOT_KERN
|
|
#define PDIR_SLOT_PTE L4_SLOT_PTE
|
|
#define PDIR_SLOT_APTE L4_SLOT_APTE
|
|
|
|
/*
|
|
* 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 *) (L4_SLOT_PTE * NBPD_L4))
|
|
#define APTE_BASE ((pt_entry_t *) (VA_SIGN_NEG((L4_SLOT_APTE * NBPD_L4))))
|
|
|
|
#define L1_BASE PTE_BASE
|
|
#define AL1_BASE APTE_BASE
|
|
|
|
#define L2_BASE ((pd_entry_t *)((char *)L1_BASE + L4_SLOT_PTE * NBPD_L3))
|
|
#define L3_BASE ((pd_entry_t *)((char *)L2_BASE + L4_SLOT_PTE * NBPD_L2))
|
|
#define L4_BASE ((pd_entry_t *)((char *)L3_BASE + L4_SLOT_PTE * NBPD_L1))
|
|
|
|
#define AL2_BASE ((pd_entry_t *)((char *)AL1_BASE + L4_SLOT_PTE * NBPD_L3))
|
|
#define AL3_BASE ((pd_entry_t *)((char *)AL2_BASE + L4_SLOT_PTE * NBPD_L2))
|
|
#define AL4_BASE ((pd_entry_t *)((char *)AL3_BASE + L4_SLOT_PTE * NBPD_L1))
|
|
|
|
#define PDP_PDE (L4_BASE + PDIR_SLOT_PTE)
|
|
#define APDP_PDE (L4_BASE + PDIR_SLOT_APTE)
|
|
|
|
#define PDP_BASE L4_BASE
|
|
#define APDP_BASE AL4_BASE
|
|
|
|
#define NKL4_MAX_ENTRIES (unsigned long)1
|
|
#define NKL3_MAX_ENTRIES (unsigned long)(NKL4_MAX_ENTRIES * 512)
|
|
#define NKL2_MAX_ENTRIES (unsigned long)(NKL3_MAX_ENTRIES * 512)
|
|
#define NKL1_MAX_ENTRIES (unsigned long)(NKL2_MAX_ENTRIES * 512)
|
|
|
|
#define NKL4_KIMG_ENTRIES 1
|
|
#define NKL3_KIMG_ENTRIES 1
|
|
#define NKL2_KIMG_ENTRIES 10
|
|
|
|
/*
|
|
* Since kva space is below the kernel in its entirety, we start off
|
|
* with zero entries on each level.
|
|
*/
|
|
#define NKL4_START_ENTRIES 0
|
|
#define NKL3_START_ENTRIES 0
|
|
#define NKL2_START_ENTRIES 0
|
|
#define NKL1_START_ENTRIES 0 /* XXX */
|
|
|
|
#define NTOPLEVEL_PDES (PAGE_SIZE / (sizeof (pd_entry_t)))
|
|
|
|
#define NPDPG (PAGE_SIZE / sizeof (pd_entry_t))
|
|
|
|
#define PTP_MASK_INITIALIZER { L1_FRAME, L2_FRAME, L3_FRAME, L4_FRAME }
|
|
#define PTP_SHIFT_INITIALIZER { L1_SHIFT, L2_SHIFT, L3_SHIFT, L4_SHIFT }
|
|
#define NKPTP_INITIALIZER { NKL1_START_ENTRIES, NKL2_START_ENTRIES, \
|
|
NKL3_START_ENTRIES, NKL4_START_ENTRIES }
|
|
#define NKPTPMAX_INITIALIZER { NKL1_MAX_ENTRIES, NKL2_MAX_ENTRIES, \
|
|
NKL3_MAX_ENTRIES, NKL4_MAX_ENTRIES }
|
|
#define NBPD_INITIALIZER { NBPD_L1, NBPD_L2, NBPD_L3, NBPD_L4 }
|
|
#define PDES_INITIALIZER { L2_BASE, L3_BASE, L4_BASE }
|
|
#define APDES_INITIALIZER { AL2_BASE, AL3_BASE, AL4_BASE }
|
|
|
|
#define PTP_LEVELS 4
|
|
|
|
/*
|
|
* 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 */
|
|
|
|
#define PG_X 0 /* XXX dummy */
|
|
|
|
/*
|
|
* Number of PTE's per cache line. 8 byte pte, 64-byte cache line
|
|
* Used to avoid false sharing of cache lines.
|
|
*/
|
|
#define NPTECL 8
|
|
|
|
#include <x86/pmap.h>
|
|
|
|
#ifndef XEN
|
|
#define pmap_pa2pte(a) (a)
|
|
#define pmap_pte2pa(a) ((a) & PG_FRAME)
|
|
#define pmap_pte_set(p, n) do { *(p) = (n); } while (0)
|
|
#define pmap_pte_cas(p, o, n) atomic_cas_64((p), (o), (n))
|
|
#define pmap_pte_testset(p, n) \
|
|
atomic_swap_ulong((volatile unsigned long *)p, n)
|
|
#define pmap_pte_setbits(p, b) \
|
|
atomic_or_ulong((volatile unsigned long *)p, b)
|
|
#define pmap_pte_clearbits(p, b) \
|
|
atomic_and_ulong((volatile unsigned long *)p, ~(b))
|
|
#define pmap_pte_flush() /* nothing */
|
|
#else
|
|
static __inline pt_entry_t
|
|
pmap_pa2pte(paddr_t pa)
|
|
{
|
|
return (pt_entry_t)xpmap_ptom_masked(pa);
|
|
}
|
|
|
|
static __inline paddr_t
|
|
pmap_pte2pa(pt_entry_t pte)
|
|
{
|
|
return xpmap_mtop_masked(pte & PG_FRAME);
|
|
}
|
|
static __inline void
|
|
pmap_pte_set(pt_entry_t *pte, pt_entry_t npte)
|
|
{
|
|
int s = splvm();
|
|
xpq_queue_pte_update(xpmap_ptetomach(pte), npte);
|
|
splx(s);
|
|
}
|
|
|
|
static __inline pt_entry_t
|
|
pmap_pte_cas(volatile pt_entry_t *ptep, pt_entry_t o, pt_entry_t n)
|
|
{
|
|
int s = splvm();
|
|
pt_entry_t opte = *ptep;
|
|
|
|
if (opte == o) {
|
|
xpq_queue_pte_update(xpmap_ptetomach(__UNVOLATILE(ptep)), n);
|
|
xpq_flush_queue();
|
|
}
|
|
splx(s);
|
|
return opte;
|
|
}
|
|
|
|
static __inline pt_entry_t
|
|
pmap_pte_testset(volatile pt_entry_t *pte, pt_entry_t npte)
|
|
{
|
|
int s = splvm();
|
|
pt_entry_t opte = *pte;
|
|
xpq_queue_pte_update(xpmap_ptetomach(__UNVOLATILE(pte)), npte);
|
|
xpq_flush_queue();
|
|
splx(s);
|
|
return opte;
|
|
}
|
|
|
|
static __inline void
|
|
pmap_pte_setbits(volatile pt_entry_t *pte, pt_entry_t bits)
|
|
{
|
|
int s = splvm();
|
|
xpq_queue_pte_update(xpmap_ptetomach(__UNVOLATILE(pte)), (*pte) | bits);
|
|
xpq_flush_queue();
|
|
splx(s);
|
|
}
|
|
|
|
static __inline void
|
|
pmap_pte_clearbits(volatile pt_entry_t *pte, pt_entry_t bits)
|
|
{
|
|
int s = splvm();
|
|
xpq_queue_pte_update(xpmap_ptetomach(__UNVOLATILE(pte)),
|
|
(*pte) & ~bits);
|
|
xpq_flush_queue();
|
|
splx(s);
|
|
}
|
|
|
|
static __inline void
|
|
pmap_pte_flush(void)
|
|
{
|
|
int s = splvm();
|
|
xpq_flush_queue();
|
|
splx(s);
|
|
}
|
|
#endif
|
|
|
|
void pmap_prealloc_lowmem_ptps(void);
|
|
void pmap_changeprot_local(vaddr_t, vm_prot_t);
|
|
|
|
#else /* __x86_64__ */
|
|
|
|
#include <i386/pmap.h>
|
|
|
|
#endif /* __x86_64__ */
|
|
|
|
#endif /* _AMD64_PMAP_H_ */
|