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