4c2e4320bd
- Accept bootinfo structure passed down from ofwboot v1.9 - Drop kernel re-mapping code - Use permanent 4MB mappings provided by the loader instead - Change kernel entry address to point directly at the code instead of pointing at the trap table's first slot. This allows the bootloader to detect those kernels which are aware of the new boot scheme - Due to the changes in kernel mapping code, alter secondary CPU bootstrap code to use trampoline just like FreeBSD does (some FreeBSD code is used here as well)
209 lines
6.0 KiB
C
209 lines
6.0 KiB
C
/* $NetBSD: vmparam.h,v 1.29 2006/01/27 18:37:49 cdi Exp $ */
|
|
|
|
/*
|
|
* Copyright (c) 1992, 1993
|
|
* The Regents of the University of California. All rights reserved.
|
|
*
|
|
* This software was developed by the Computer Systems Engineering group
|
|
* at Lawrence Berkeley Laboratory under DARPA contract BG 91-66 and
|
|
* contributed to Berkeley.
|
|
*
|
|
* All advertising materials mentioning features or use of this software
|
|
* must display the following acknowledgement:
|
|
* This product includes software developed by the University of
|
|
* California, Lawrence Berkeley Laboratory.
|
|
*
|
|
* 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. Neither the name of the University nor the names of its contributors
|
|
* may be used to endorse or promote products derived from this software
|
|
* without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``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 REGENTS OR CONTRIBUTORS 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.
|
|
*
|
|
* @(#)vmparam.h 8.1 (Berkeley) 6/11/93
|
|
*/
|
|
|
|
/*
|
|
* Machine dependent constants for Sun-4c SPARC
|
|
*/
|
|
|
|
#ifndef VMPARAM_H
|
|
#define VMPARAM_H
|
|
|
|
/*
|
|
* We use 8K VM pages on the Sun4U. Override the PAGE_* definitions
|
|
* to be compile-time constants.
|
|
*/
|
|
#define PAGE_SHIFT 13
|
|
#define PAGE_SIZE (1 << PAGE_SHIFT)
|
|
#define PAGE_MASK (PAGE_SIZE - 1)
|
|
|
|
/*
|
|
* The kernel itself is mapped by the boot loader with 4Mb locked VM pages,
|
|
* so let's keep 4Mb definitions here as well.
|
|
*/
|
|
#define PAGE_SHIFT_4M 22
|
|
#define PAGE_SIZE_4M (1UL<<PAGE_SHIFT_4M)
|
|
#define PAGE_MASK_4M (PAGE_SIZE_4M-1)
|
|
|
|
/*
|
|
* USRSTACK is the top (end) of the user stack.
|
|
*/
|
|
#define USRSTACK32 0xffffe000L
|
|
#ifdef __arch64__
|
|
#define USRSTACK 0xffffffffffffe000L
|
|
#else
|
|
#define USRSTACK USRSTACK32
|
|
#endif
|
|
|
|
/*
|
|
* Virtual memory related constants, all in bytes
|
|
*/
|
|
/* #ifdef __arch64__ */
|
|
#if 0
|
|
/*
|
|
* 64-bit limits:
|
|
*
|
|
* Since the compiler generates `call' instructions we can't
|
|
* have more than 4GB in a single text segment.
|
|
*
|
|
* And since we only have a 40-bit adderss space, allow half
|
|
* of that for data and the other half for stack.
|
|
*/
|
|
#ifndef MAXTSIZ
|
|
#define MAXTSIZ (4L*1024*1024*1024) /* max text size */
|
|
#endif
|
|
#ifndef DFLDSIZ
|
|
#define DFLDSIZ (128L*1024*1024) /* initial data size limit */
|
|
#endif
|
|
#ifndef MAXDSIZ
|
|
#define MAXDSIZ (1L<<39) /* max data size */
|
|
#endif
|
|
#ifndef DFLSSIZ
|
|
#define DFLSSIZ (2*1024*1024) /* initial stack size limit */
|
|
#endif
|
|
#ifndef MAXSSIZ
|
|
#define MAXSSIZ MAXDSIZ /* max stack size */
|
|
#endif
|
|
#else
|
|
/*
|
|
* 32-bit limits:
|
|
*
|
|
* We only have 4GB to play with. Limit stack, data, and text
|
|
* each to half of that.
|
|
*
|
|
* This is silly. Apparently if we go above these numbers
|
|
* integer overflows in other parts of the kernel cause hangs.
|
|
*/
|
|
#ifndef MAXTSIZ
|
|
#define MAXTSIZ (1*1024*1024*1024) /* max text size */
|
|
#endif
|
|
#ifndef DFLDSIZ
|
|
#define DFLDSIZ (128*1024*1024) /* initial data size limit */
|
|
#endif
|
|
#ifndef MAXDSIZ
|
|
#define MAXDSIZ (1*1024*1024*1024) /* max data size */
|
|
#endif
|
|
#ifndef DFLSSIZ
|
|
#define DFLSSIZ (2*1024*1024) /* initial stack size limit */
|
|
#endif
|
|
#ifndef MAXSSIZ
|
|
#define MAXSSIZ (8*1024*1024) /* max stack size */
|
|
#endif
|
|
#endif
|
|
|
|
/*
|
|
* 32-bit emulation limits.
|
|
*/
|
|
#ifndef MAXTSIZ32
|
|
#define MAXTSIZ32 (1*1024*1024*1024) /* max text size */
|
|
#endif
|
|
#ifndef DFLDSIZ32
|
|
#define DFLDSIZ32 (128*1024*1024) /* initial data size limit */
|
|
#endif
|
|
#ifndef MAXDSIZ32
|
|
#define MAXDSIZ32 (1*1024*1024*1024) /* max data size */
|
|
#endif
|
|
#ifndef DFLSSIZ32
|
|
#define DFLSSIZ32 (2*1024*1024) /* initial stack size limit */
|
|
#endif
|
|
#ifndef MAXSSIZ32
|
|
#define MAXSSIZ32 (8*1024*1024) /* max stack size */
|
|
#endif
|
|
|
|
/*
|
|
* Size of shared memory map
|
|
*/
|
|
#ifndef SHMMAXPGS
|
|
#define SHMMAXPGS 1024
|
|
#endif
|
|
|
|
/*
|
|
* Mach derived constants
|
|
*/
|
|
|
|
/*
|
|
* User/kernel map constants.
|
|
*/
|
|
#define VM_MIN_ADDRESS ((vaddr_t)0)
|
|
#define VM_MAX_ADDRESS ((vaddr_t)-1)
|
|
#define VM_MAXUSER_ADDRESS ((vaddr_t)-1)
|
|
#define VM_MAXUSER_ADDRESS32 ((vaddr_t)(0x00000000ffffffffL&~PGOFSET))
|
|
|
|
#define VM_MIN_KERNEL_ADDRESS ((vaddr_t)KERNBASE)
|
|
#define VM_MAX_KERNEL_ADDRESS ((vaddr_t)KERNEND)
|
|
|
|
#define VM_PHYSSEG_MAX 32 /* up to 32 segments */
|
|
#define VM_PHYSSEG_STRAT VM_PSTRAT_BSEARCH
|
|
#define VM_PHYSSEG_NOADD /* can't add RAM after vm_mem_init */
|
|
|
|
#define VM_NFREELIST 1
|
|
#define VM_FREELIST_DEFAULT 0
|
|
|
|
#ifdef _KERNEL
|
|
|
|
#define __HAVE_VM_PAGE_MD
|
|
|
|
/*
|
|
* For each struct vm_page, there is a list of all currently valid virtual
|
|
* mappings of that page. An entry is a pv_entry_t.
|
|
*/
|
|
struct pmap;
|
|
typedef struct pv_entry {
|
|
struct pv_entry *pv_next; /* next pv_entry */
|
|
struct pmap *pv_pmap; /* pmap where mapping lies */
|
|
vaddr_t pv_va; /* virtual address for mapping */
|
|
} *pv_entry_t;
|
|
/* PV flags encoded in the low bits of the VA of the first pv_entry */
|
|
|
|
struct vm_page_md {
|
|
struct pv_entry mdpg_pvh;
|
|
};
|
|
#define VM_MDPAGE_INIT(pg) \
|
|
do { \
|
|
(pg)->mdpage.mdpg_pvh.pv_next = NULL; \
|
|
(pg)->mdpage.mdpg_pvh.pv_pmap = NULL; \
|
|
(pg)->mdpage.mdpg_pvh.pv_va = 0; \
|
|
} while (/*CONSTCOND*/0)
|
|
|
|
#endif /* _KERNEL */
|
|
|
|
#endif
|