Home | History | Annotate | Line # | Download | only in include
vmparam.h revision 1.29 
      1 /*	$NetBSD: vmparam.h,v 1.29 2006/01/27 18:37:49 cdi Exp $ */
      2 
      3 /*
      4  * Copyright (c) 1992, 1993
      5  *	The Regents of the University of California.  All rights reserved.
      6  *
      7  * This software was developed by the Computer Systems Engineering group
      8  * at Lawrence Berkeley Laboratory under DARPA contract BG 91-66 and
      9  * contributed to Berkeley.
     10  *
     11  * All advertising materials mentioning features or use of this software
     12  * must display the following acknowledgement:
     13  *	This product includes software developed by the University of
     14  *	California, Lawrence Berkeley Laboratory.
     15  *
     16  * Redistribution and use in source and binary forms, with or without
     17  * modification, are permitted provided that the following conditions
     18  * are met:
     19  * 1. Redistributions of source code must retain the above copyright
     20  *    notice, this list of conditions and the following disclaimer.
     21  * 2. Redistributions in binary form must reproduce the above copyright
     22  *    notice, this list of conditions and the following disclaimer in the
     23  *    documentation and/or other materials provided with the distribution.
     24  * 3. Neither the name of the University nor the names of its contributors
     25  *    may be used to endorse or promote products derived from this software
     26  *    without specific prior written permission.
     27  *
     28  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     29  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     30  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     31  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     32  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     33  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     34  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     35  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     36  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     37  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     38  * SUCH DAMAGE.
     39  *
     40  *	@(#)vmparam.h	8.1 (Berkeley) 6/11/93
     41  */
     42 
     43 /*
     44  * Machine dependent constants for Sun-4c SPARC
     45  */
     46 
     47 #ifndef VMPARAM_H
     48 #define VMPARAM_H
     49 
     50 /*
     51  * We use 8K VM pages on the Sun4U.  Override the PAGE_* definitions
     52  * to be compile-time constants.
     53  */
     54 #define	PAGE_SHIFT	13
     55 #define	PAGE_SIZE	(1 << PAGE_SHIFT)
     56 #define	PAGE_MASK	(PAGE_SIZE - 1)
     57 
     58 /*
     59  * The kernel itself is mapped by the boot loader with 4Mb locked VM pages,
     60  * so let's keep 4Mb definitions here as well.
     61  */
     62 #define PAGE_SHIFT_4M	22
     63 #define PAGE_SIZE_4M	(1UL<<PAGE_SHIFT_4M)
     64 #define PAGE_MASK_4M	(PAGE_SIZE_4M-1)
     65 
     66 /*
     67  * USRSTACK is the top (end) of the user stack.
     68  */
     69 #define USRSTACK32	0xffffe000L
     70 #ifdef __arch64__
     71 #define USRSTACK	0xffffffffffffe000L
     72 #else
     73 #define USRSTACK	USRSTACK32
     74 #endif
     75 
     76 /*
     77  * Virtual memory related constants, all in bytes
     78  */
     79 /* #ifdef __arch64__ */
     80 #if 0
     81 /*
     82  * 64-bit limits:
     83  *
     84  * Since the compiler generates `call' instructions we can't
     85  * have more than 4GB in a single text segment.
     86  *
     87  * And since we only have a 40-bit adderss space, allow half
     88  * of that for data and the other half for stack.
     89  */
     90 #ifndef MAXTSIZ
     91 #define	MAXTSIZ		(4L*1024*1024*1024)	/* max text size */
     92 #endif
     93 #ifndef DFLDSIZ
     94 #define	DFLDSIZ		(128L*1024*1024)	/* initial data size limit */
     95 #endif
     96 #ifndef MAXDSIZ
     97 #define	MAXDSIZ		(1L<<39)		/* max data size */
     98 #endif
     99 #ifndef	DFLSSIZ
    100 #define	DFLSSIZ		(2*1024*1024)		/* initial stack size limit */
    101 #endif
    102 #ifndef	MAXSSIZ
    103 #define	MAXSSIZ		MAXDSIZ			/* max stack size */
    104 #endif
    105 #else
    106 /*
    107  * 32-bit limits:
    108  *
    109  * We only have 4GB to play with.  Limit stack, data, and text
    110  * each to half of that.
    111  *
    112  * This is silly.  Apparently if we go above these numbers
    113  * integer overflows in other parts of the kernel cause hangs.
    114  */
    115 #ifndef MAXTSIZ
    116 #define	MAXTSIZ		(1*1024*1024*1024)	/* max text size */
    117 #endif
    118 #ifndef DFLDSIZ
    119 #define	DFLDSIZ		(128*1024*1024)		/* initial data size limit */
    120 #endif
    121 #ifndef MAXDSIZ
    122 #define	MAXDSIZ		(1*1024*1024*1024)	/* max data size */
    123 #endif
    124 #ifndef	DFLSSIZ
    125 #define	DFLSSIZ		(2*1024*1024)		/* initial stack size limit */
    126 #endif
    127 #ifndef	MAXSSIZ
    128 #define	MAXSSIZ		(8*1024*1024)			/* max stack size */
    129 #endif
    130 #endif
    131 
    132 /*
    133  * 32-bit emulation limits.
    134  */
    135 #ifndef MAXTSIZ32
    136 #define	MAXTSIZ32	(1*1024*1024*1024)	/* max text size */
    137 #endif
    138 #ifndef DFLDSIZ32
    139 #define	DFLDSIZ32	(128*1024*1024)		/* initial data size limit */
    140 #endif
    141 #ifndef MAXDSIZ32
    142 #define	MAXDSIZ32	(1*1024*1024*1024)	/* max data size */
    143 #endif
    144 #ifndef	DFLSSIZ32
    145 #define	DFLSSIZ32	(2*1024*1024)		/* initial stack size limit */
    146 #endif
    147 #ifndef	MAXSSIZ32
    148 #define	MAXSSIZ32	(8*1024*1024)			/* max stack size */
    149 #endif
    150 
    151 /*
    152  * Size of shared memory map
    153  */
    154 #ifndef SHMMAXPGS
    155 #define SHMMAXPGS	1024
    156 #endif
    157 
    158 /*
    159  * Mach derived constants
    160  */
    161 
    162 /*
    163  * User/kernel map constants.
    164  */
    165 #define VM_MIN_ADDRESS		((vaddr_t)0)
    166 #define VM_MAX_ADDRESS		((vaddr_t)-1)
    167 #define VM_MAXUSER_ADDRESS	((vaddr_t)-1)
    168 #define VM_MAXUSER_ADDRESS32	((vaddr_t)(0x00000000ffffffffL&~PGOFSET))
    169 
    170 #define VM_MIN_KERNEL_ADDRESS	((vaddr_t)KERNBASE)
    171 #define VM_MAX_KERNEL_ADDRESS	((vaddr_t)KERNEND)
    172 
    173 #define VM_PHYSSEG_MAX          32       /* up to 32 segments */
    174 #define VM_PHYSSEG_STRAT        VM_PSTRAT_BSEARCH
    175 #define VM_PHYSSEG_NOADD                /* can't add RAM after vm_mem_init */
    176 
    177 #define	VM_NFREELIST		1
    178 #define	VM_FREELIST_DEFAULT	0
    179 
    180 #ifdef _KERNEL
    181 
    182 #define	__HAVE_VM_PAGE_MD
    183 
    184 /*
    185  * For each struct vm_page, there is a list of all currently valid virtual
    186  * mappings of that page.  An entry is a pv_entry_t.
    187  */
    188 struct pmap;
    189 typedef struct pv_entry {
    190 	struct pv_entry	*pv_next;	/* next pv_entry */
    191 	struct pmap	*pv_pmap;	/* pmap where mapping lies */
    192 	vaddr_t		pv_va;		/* virtual address for mapping */
    193 } *pv_entry_t;
    194 /* PV flags encoded in the low bits of the VA of the first pv_entry */
    195 
    196 struct vm_page_md {
    197 	struct pv_entry mdpg_pvh;
    198 };
    199 #define	VM_MDPAGE_INIT(pg)						\
    200 do {									\
    201 	(pg)->mdpage.mdpg_pvh.pv_next = NULL;				\
    202 	(pg)->mdpage.mdpg_pvh.pv_pmap = NULL;				\
    203 	(pg)->mdpage.mdpg_pvh.pv_va = 0;				\
    204 } while (/*CONSTCOND*/0)
    205 
    206 #endif	/* _KERNEL */
    207 
    208 #endif
    209