Home | History | Annotate | Line # | Download | only in include
vmparam.h revision 1.15
      1  1.15    perry /*	$NetBSD: vmparam.h,v 1.15 1997/07/12 16:20:38 perry Exp $	*/
      2   1.4      cgd 
      3   1.1    ragge /*-
      4   1.1    ragge  * Copyright (c) 1990 The Regents of the University of California.
      5   1.1    ragge  * All rights reserved.
      6   1.1    ragge  *
      7   1.1    ragge  * This code is derived from software contributed to Berkeley by
      8   1.1    ragge  * William Jolitz.
      9   1.1    ragge  *
     10   1.1    ragge  * Slightly modified for the VAX port /IC
     11   1.1    ragge  *
     12   1.1    ragge  * Redistribution and use in source and binary forms, with or without
     13   1.1    ragge  * modification, are permitted provided that the following conditions
     14   1.1    ragge  * are met:
     15   1.1    ragge  * 1. Redistributions of source code must retain the above copyright
     16   1.1    ragge  *    notice, this list of conditions and the following disclaimer.
     17   1.1    ragge  * 2. Redistributions in binary form must reproduce the above copyright
     18   1.1    ragge  *    notice, this list of conditions and the following disclaimer in the
     19   1.1    ragge  *    documentation and/or other materials provided with the distribution.
     20   1.1    ragge  * 3. All advertising materials mentioning features or use of this software
     21   1.1    ragge  *    must display the following acknowledgement:
     22   1.1    ragge  *	This product includes software developed by the University of
     23   1.1    ragge  *	California, Berkeley and its contributors.
     24   1.1    ragge  * 4. Neither the name of the University nor the names of its contributors
     25   1.1    ragge  *    may be used to endorse or promote products derived from this software
     26   1.1    ragge  *    without specific prior written permission.
     27   1.1    ragge  *
     28   1.1    ragge  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     29   1.1    ragge  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     30   1.1    ragge  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     31   1.1    ragge  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     32   1.1    ragge  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     33   1.1    ragge  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     34   1.1    ragge  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     35   1.1    ragge  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     36   1.1    ragge  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     37   1.1    ragge  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     38   1.1    ragge  * SUCH DAMAGE.
     39   1.1    ragge  *
     40   1.4      cgd  *	@(#)vmparam.h	5.9 (Berkeley) 5/12/91
     41   1.1    ragge  */
     42  1.11  mycroft #ifndef _LOCORE
     43   1.1    ragge #include <vm/vm_param.h>
     44   1.1    ragge #endif
     45   1.1    ragge 
     46   1.1    ragge /*
     47   1.1    ragge  * Machine dependent constants for VAX.
     48   1.1    ragge  */
     49   1.1    ragge 
     50   1.1    ragge /*
     51   1.1    ragge  * Virtual address space arrangement. On 386, both user and kernel
     52   1.1    ragge  * share the address space, not unlike the vax.
     53   1.1    ragge  * USRTEXT is the start of the user text/data space, while USRSTACK
     54   1.1    ragge  * is the top (end) of the user stack. Immediately above the user stack
     55   1.1    ragge  * resides the user structure, which is UPAGES long and contains the
     56   1.1    ragge  * kernel stack.
     57   1.1    ragge  *
     58   1.1    ragge  */
     59   1.1    ragge 
     60   1.8    ragge #define	USRTEXT		0x400
     61   1.8    ragge #define	USRSTACK	0x7fffe000 /* XXX */
     62   1.1    ragge 
     63   1.1    ragge /*
     64   1.1    ragge  * Virtual memory related constants, all in bytes
     65   1.1    ragge  */
     66   1.1    ragge 
     67   1.1    ragge #ifndef MAXTSIZ
     68  1.13    ragge #define	MAXTSIZ		(8*1024*1024)		/* max text size */
     69   1.1    ragge #endif
     70   1.1    ragge #ifndef MAXDSIZ
     71  1.13    ragge #define	MAXDSIZ		(24*1024*1024)		/* max data size */
     72   1.1    ragge #endif
     73   1.1    ragge #ifndef	MAXSSIZ
     74  1.13    ragge #define	MAXSSIZ		(8*1024*1024)		/* max stack size */
     75   1.1    ragge #endif
     76   1.1    ragge #ifndef DFLDSIZ
     77  1.13    ragge #define	DFLDSIZ		(16*1024*1024)		/* initial data size limit */
     78   1.1    ragge #endif
     79   1.1    ragge #ifndef	DFLSSIZ
     80   1.1    ragge #define	DFLSSIZ		(512*1024)		/* initial stack size limit */
     81   1.1    ragge #endif
     82   1.1    ragge 
     83   1.1    ragge /*
     84  1.13    ragge  * All mmap()'ed data will be mapped above MAXDSIZ. This means that
     85  1.13    ragge  * pte space must be allocated for (possible) mmap()'ed data.
     86  1.13    ragge  * Note: This is just a hint, if we mmap() more than this the page
     87  1.13    ragge  * table will be expanded. (at the cost of speed).
     88  1.13    ragge  */
     89  1.13    ragge #define	MMAPSPACE	(24*1024*1024)
     90   1.1    ragge 
     91   1.1    ragge /*
     92   1.1    ragge  * Size of shared memory map
     93   1.1    ragge  */
     94   1.1    ragge 
     95   1.1    ragge #ifndef SHMMAXPGS
     96   1.1    ragge #define SHMMAXPGS	64		/* XXXX should be 1024 */
     97   1.1    ragge #endif
     98  1.12    ragge 
     99  1.12    ragge /*
    100  1.12    ragge  * Size of User Raw I/O map
    101  1.12    ragge  */
    102  1.12    ragge #define	USRIOSIZE	300
    103   1.1    ragge 
    104   1.1    ragge /*
    105   1.1    ragge  * The time for a process to be blocked before being very swappable.
    106   1.1    ragge  * This is a number of seconds which the system takes as being a non-trivial
    107   1.1    ragge  * amount of real time.  You probably shouldn't change this;
    108   1.1    ragge  * it is used in subtle ways (fractions and multiples of it are, that is, like
    109   1.1    ragge  * half of a ``long time'', almost a long time, etc.)
    110   1.1    ragge  * It is related to human patience and other factors which don't really
    111   1.1    ragge  * change over time.
    112   1.1    ragge  */
    113   1.1    ragge 
    114   1.1    ragge #define	MAXSLP 		20
    115   1.1    ragge 
    116   1.1    ragge /*
    117   1.1    ragge  * A swapped in process is given a small amount of core without being bothered
    118   1.1    ragge  * by the page replacement algorithm.  Basically this says that if you are
    119   1.1    ragge  * swapped in you deserve some resources.  We protect the last SAFERSS
    120   1.1    ragge  * pages against paging and will just swap you out rather than paging you.
    121   1.1    ragge  * Note that each process has at least UPAGES+CLSIZE pages which are not
    122   1.1    ragge  * paged anyways (this is currently 8+2=10 pages or 5k bytes), so this
    123   1.1    ragge  * number just means a swapped in process is given around 25k bytes.
    124   1.1    ragge  * Just for fun: current memory prices are 4600$ a megabyte on VAX (4/22/81),
    125   1.1    ragge  * so we loan each swapped in process memory worth 100$, or just admit
    126   1.1    ragge  * that we don't consider it worthwhile and swap it out to disk which costs
    127   1.1    ragge  * $30/mb or about $0.75.
    128  1.15    perry  * Update: memory prices have changed recently (9/96). At the current
    129  1.15    perry  * value of $6 per megabyte, we lend each swapped in process memory worth
    130  1.15    perry  * $0.15, or just admit that we don't consider it worthwhile and swap it out
    131  1.15    perry  * to disk which costs $0.20/MB, or just under half a cent.
    132   1.1    ragge  */
    133   1.1    ragge 
    134   1.1    ragge #define	SAFERSS		8		/* nominal ``small'' resident set size
    135   1.1    ragge 					   protected against replacement */
    136   1.1    ragge 
    137   1.1    ragge #define	mapin(pte, v, pfnum, prot) \
    138   1.1    ragge 	{(*(int *)(pte) = ((pfnum)<<PGSHIFT) | (prot)) ; }
    139   1.1    ragge 
    140   1.1    ragge /*
    141   1.1    ragge  * Mach derived constants
    142   1.1    ragge  */
    143   1.1    ragge 
    144   1.1    ragge /* user/kernel map constants */
    145   1.1    ragge #define VM_MIN_ADDRESS		((vm_offset_t)0)
    146   1.5    ragge #define VM_MAXUSER_ADDRESS	((vm_offset_t)0x7FFFE000)
    147   1.2    ragge #define VM_MAX_ADDRESS		((vm_offset_t)0xC0000000)
    148   1.1    ragge #define VM_MIN_KERNEL_ADDRESS	((vm_offset_t)0x80000000)
    149   1.1    ragge #define VM_MAX_KERNEL_ADDRESS	((vm_offset_t)(VM_MIN_KERNEL_ADDRESS+\
    150   1.1    ragge 				 (VM_KERNEL_PT_PAGES*0x10000)))
    151   1.1    ragge 
    152   1.1    ragge /* virtual sizes (bytes) for various kernel submaps */
    153   1.1    ragge #define VM_MBUF_SIZE		(NMBCLUSTERS*MCLBYTES)
    154   1.1    ragge #define VM_KMEM_SIZE		(NKMEMCLUSTERS*CLBYTES)
    155   1.1    ragge #define VM_PHYS_SIZE		(USRIOSIZE*CLBYTES)
    156   1.1    ragge 
    157   1.1    ragge /* pcb base */
    158   1.1    ragge #define	pcbb(p)		((u_int)(p)->p_addr)
    159   1.1    ragge 
    160