Home | History | Annotate | Line # | Download | only in include
vmparam3x.h revision 1.1
      1 /*	$NetBSD: vmparam3x.h,v 1.1 1997/01/14 20:57:07 gwr Exp $	*/
      2 
      3 /*
      4  * Copyright (c) 1988 University of Utah.
      5  * Copyright (c) 1982, 1986, 1990 The Regents of the University of California.
      6  * All rights reserved.
      7  *
      8  * This code is derived from software contributed to Berkeley by
      9  * the Systems Programming Group of the University of Utah Computer
     10  * Science Department.
     11  *
     12  * Redistribution and use in source and binary forms, with or without
     13  * modification, are permitted provided that the following conditions
     14  * are met:
     15  * 1. Redistributions of source code must retain the above copyright
     16  *    notice, this list of conditions and the following disclaimer.
     17  * 2. Redistributions in binary form must reproduce the above copyright
     18  *    notice, this list of conditions and the following disclaimer in the
     19  *    documentation and/or other materials provided with the distribution.
     20  * 3. All advertising materials mentioning features or use of this software
     21  *    must display the following acknowledgement:
     22  *	This product includes software developed by the University of
     23  *	California, Berkeley and its contributors.
     24  * 4. 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  *	from: Utah $Hdr: vmparam.h 1.16 91/01/18$
     41  *	from: @(#)vmparam.h	7.3 (Berkeley) 5/7/91
     42  *	vmparam.h,v 1.2 1993/05/22 07:58:38 cgd Exp
     43  */
     44 
     45 /*
     46  * Machine dependent constants for Sun3x
     47  */
     48 
     49 /*
     50  * USRTEXT is the start of the user text/data space, while
     51  * USRSTACK is the top (end) of the user stack.
     52  */
     53 #define	USRTEXT 	NBPG		/* Start of user text */
     54 #define	USRSTACK	KERNBASE	/* High end of user stack */
     55 
     56 /*
     57  * Virtual memory related constants, all in bytes
     58  */
     59 #ifndef MAXTSIZ
     60 #define	MAXTSIZ		(8*1024*1024)		/* max text size */
     61 #endif
     62 #ifndef DFLDSIZ
     63 #define	DFLDSIZ		(32*1024*1024)		/* initial data size limit */
     64 #endif
     65 #ifndef MAXDSIZ
     66 #define	MAXDSIZ		(128*1024*1024)		/* max data size */
     67 #endif
     68 #ifndef	DFLSSIZ
     69 #define	DFLSSIZ		(2*1024*1024)		/* initial stack size limit */
     70 #endif
     71 #ifndef	MAXSSIZ
     72 #define	MAXSSIZ		(32*1024*1024)		/* max stack size */
     73 #endif
     74 
     75 /*
     76  * Default sizes of swap allocation chunks (see dmap.h).
     77  * The actual values may be changed in vminit() based on MAXDSIZ.
     78  * With MAXDSIZ of 16Mb and NDMAP of 38, dmmax will be 1024.
     79  * DMMIN should be at least ctod(1) so that vtod() works.
     80  * vminit() insures this.
     81  */
     82 #define	DMMIN	32			/* smallest swap allocation */
     83 #define	DMMAX	4096			/* largest potential swap allocation */
     84 
     85 /*
     86  * PTEs for mapping user space into the kernel for phyio operations.
     87  * The actual limitation for physio requests will be the DVMA space,
     88  * and that is fixed by hardware design at 16MB.  We could make the
     89  * physio map larger than that, but it would not buy us much.
     90  */
     91 #ifndef USRIOSIZE
     92 #define USRIOSIZE	2048	/* 16 MB */
     93 #endif
     94 
     95 /*
     96  * PTEs for system V style shared memory.
     97  * This is basically slop for kmempt which we actually allocate (malloc) from.
     98  */
     99 #ifndef SHMMAXPGS
    100 #define SHMMAXPGS	2048 	/* 16 MB */
    101 #endif
    102 
    103 /*
    104  * The time for a process to be blocked before being very swappable.
    105  * This is a number of seconds which the system takes as being a non-trivial
    106  * amount of real time.  You probably shouldn't change this;
    107  * it is used in subtle ways (fractions and multiples of it are, that is, like
    108  * half of a ``long time'', almost a long time, etc.)
    109  * It is related to human patience and other factors which don't really
    110  * change over time.
    111  */
    112 #define	MAXSLP 		20
    113 
    114 /*
    115  * A swapped in process is given a small amount of core without being bothered
    116  * by the page replacement algorithm.  Basically this says that if you are
    117  * swapped in you deserve some resources.  We protect the last SAFERSS
    118  * pages against paging and will just swap you out rather than paging you.
    119  * Note that each process has at least UPAGES+CLSIZE pages which are not
    120  * paged anyways (this is currently 8+2=10 pages or 5k bytes), so this
    121  * number just means a swapped in process is given around 25k bytes.
    122  * Just for fun: current memory prices are 4600$ a megabyte on VAX (4/22/81),
    123  * so we loan each swapped in process memory worth 100$, or just admit
    124  * that we don't consider it worthwhile and swap it out to disk which costs
    125  * $30/mb or about $0.75.
    126  */
    127 #define	SAFERSS		4		/* nominal ``small'' resident set size
    128 					   protected against replacement */
    129 
    130 /*
    131  * Mach-derived constants, virtual memory map:
    132  *
    133  * 0000.0000  user space
    134  * F800.0000  kernel space
    135  * FE00.0000  monitor map (devices)
    136  * FF00.0000  DVMA space
    137  */
    138 
    139 /* user/kernel map constants */
    140 #define VM_MIN_ADDRESS		((vm_offset_t)0)
    141 #define VM_MAX_ADDRESS		((vm_offset_t)KERNBASE)
    142 #define VM_MAXUSER_ADDRESS	((vm_offset_t)KERNBASE)
    143 #define VM_MIN_KERNEL_ADDRESS	((vm_offset_t)KERNBASE)
    144 #define VM_MAX_KERNEL_ADDRESS	((vm_offset_t)KERN_END)
    145 
    146 /* virtual sizes (bytes) for various kernel submaps */
    147 #define VM_MBUF_SIZE		(NMBCLUSTERS*MCLBYTES)
    148 #define VM_KMEM_SIZE		(NKMEMCLUSTERS*CLBYTES)
    149 #define VM_PHYS_SIZE		(USRIOSIZE*CLBYTES)
    150 
    151 #define MACHINE_NONCONTIG	/* VM <=> pmap interface modifier */
    152