Home | History | Annotate | Line # | Download | only in include
vmparam.h revision 1.24
      1 /*	$NetBSD: vmparam.h,v 1.24 1998/01/15 22:20:15 thorpej Exp $	*/
      2 
      3 /*-
      4  * Copyright (c) 1990 The Regents of the University of California.
      5  * All rights reserved.
      6  *
      7  * This code is derived from software contributed to Berkeley by
      8  * William Jolitz.
      9  *
     10  * Redistribution and use in source and binary forms, with or without
     11  * modification, are permitted provided that the following conditions
     12  * are met:
     13  * 1. Redistributions of source code must retain the above copyright
     14  *    notice, this list of conditions and the following disclaimer.
     15  * 2. Redistributions in binary form must reproduce the above copyright
     16  *    notice, this list of conditions and the following disclaimer in the
     17  *    documentation and/or other materials provided with the distribution.
     18  * 3. All advertising materials mentioning features or use of this software
     19  *    must display the following acknowledgement:
     20  *	This product includes software developed by the University of
     21  *	California, Berkeley and its contributors.
     22  * 4. Neither the name of the University nor the names of its contributors
     23  *    may be used to endorse or promote products derived from this software
     24  *    without specific prior written permission.
     25  *
     26  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     27  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     28  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     29  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     30  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     31  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     32  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     33  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     34  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     35  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     36  * SUCH DAMAGE.
     37  *
     38  *	@(#)vmparam.h	5.9 (Berkeley) 5/12/91
     39  */
     40 
     41 #ifndef _VMPARAM_H_
     42 #define _VMPARAM_H_
     43 
     44 
     45 /*
     46  * Machine dependent constants for 386.
     47  */
     48 
     49 /*
     50  * Virtual address space arrangement. On 386, both user and kernel
     51  * share the address space, not unlike the vax.
     52  * USRTEXT is the start of the user text/data space, while USRSTACK
     53  * is the top (end) of the user stack. Immediately above the user stack
     54  * resides the user structure, which is UPAGES long and contains the
     55  * kernel stack.
     56  *
     57  * Immediately after the user structure is the page table map, and then
     58  * kernal address space.
     59  */
     60 #define	USRTEXT		CLBYTES
     61 #define	USRSTACK	VM_MAXUSER_ADDRESS
     62 
     63 /*
     64  * Virtual memory related constants, all in bytes
     65  */
     66 #define	MAXTSIZ		(64*1024*1024)		/* max text size */
     67 #ifndef DFLDSIZ
     68 #define	DFLDSIZ		(128*1024*1024)		/* initial data size limit */
     69 #endif
     70 #ifndef MAXDSIZ
     71 #define	MAXDSIZ		(1*1024*1024*1024)	/* max data size */
     72 #endif
     73 #ifndef	DFLSSIZ
     74 #define	DFLSSIZ		(2*1024*1024)		/* initial stack size limit */
     75 #endif
     76 #ifndef	MAXSSIZ
     77 #define	MAXSSIZ		(32*1024*1024)		/* max stack size */
     78 #endif
     79 
     80 /*
     81  * Size of shared memory map
     82  */
     83 #ifndef SHMMAXPGS
     84 #define SHMMAXPGS	1024
     85 #endif
     86 
     87 /*
     88  * Size of User Raw I/O map
     89  */
     90 #define	USRIOSIZE 	300
     91 
     92 /*
     93  * The time for a process to be blocked before being very swappable.
     94  * This is a number of seconds which the system takes as being a non-trivial
     95  * amount of real time.  You probably shouldn't change this;
     96  * it is used in subtle ways (fractions and multiples of it are, that is, like
     97  * half of a ``long time'', almost a long time, etc.)
     98  * It is related to human patience and other factors which don't really
     99  * change over time.
    100  */
    101 #define	MAXSLP 		20
    102 
    103 /*
    104  * A swapped in process is given a small amount of core without being bothered
    105  * by the page replacement algorithm.  Basically this says that if you are
    106  * swapped in you deserve some resources.  We protect the last SAFERSS
    107  * pages against paging and will just swap you out rather than paging you.
    108  * Note that each process has at least UPAGES+CLSIZE pages which are not
    109  * paged anyways (this is currently 8+2=10 pages or 5k bytes), so this
    110  * number just means a swapped in process is given around 25k bytes.
    111  * Just for fun: current memory prices are 4600$ a megabyte on VAX (4/22/81),
    112  * so we loan each swapped in process memory worth 100$, or just admit
    113  * that we don't consider it worthwhile and swap it out to disk which costs
    114  * $30/mb or about $0.75.
    115  * { wfj 6/16/89: Retail AT memory expansion $800/megabyte, loan of $17
    116  *   on disk costing $7/mb or $0.18 (in memory still 100:1 in cost!) }
    117  * Update: memory prices have changed recently (9/96). At the current
    118  * value of $6 per megabyte, we lend each swapped in process memory worth
    119  * $0.15, or just admit that we don't consider it worthwhile and swap it out
    120  * to disk which costs $0.20/MB, or just under half a cent.
    121  */
    122 #define	SAFERSS		8		/* nominal ``small'' resident set size
    123 					   protected against replacement */
    124 
    125 /*
    126  * Mach derived constants
    127  */
    128 
    129 /* user/kernel map constants */
    130 #define VM_MIN_ADDRESS		((vm_offset_t)0)
    131 /* PTDPTDI<<PDSHIFT - UPAGES*NBPG */
    132 #define VM_MAXUSER_ADDRESS	((vm_offset_t)0xefbfe000)
    133 /* PTDPTDI<<PDSHIFT + PTDPTDI<<PGSHIFT */
    134 #define VM_MAX_ADDRESS		((vm_offset_t)0xeffbf000)
    135 /* KPTDI<<PDSHIFT */
    136 #define VM_MIN_KERNEL_ADDRESS	((vm_offset_t)0xf0000000)
    137 /* APTDPTDI<<PDSHIFT */
    138 #define VM_MAX_KERNEL_ADDRESS	((vm_offset_t)0xffc00000)
    139 
    140 /* XXX max. amount of KVM to be used by buffers. */
    141 #ifndef VM_MAX_KERNEL_BUF
    142 #define VM_MAX_KERNEL_BUF \
    143 	((VM_MAX_KERNEL_ADDRESS - VM_MIN_KERNEL_ADDRESS) * 7 / 10)
    144 #endif
    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_NEW_NONCONTIG	/* VM <=> pmap interface modifier */
    152 
    153 #define VM_PHYSSEG_MAX		2	/* we only have one "hole" */
    154 #define VM_PHYSSEG_STRAT	VM_PSTRAT_BIGFIRST
    155 #define VM_PHYSSEG_NOADD		/* can't add RAM after vm_mem_init */
    156 
    157 /*
    158  * pmap specific data stored in the vm_physmem[] array
    159  */
    160 struct pmap_physseg {
    161 	struct pv_entry *pvent;		/* pv_entry array */
    162 	char *attrs;			/* attrs array */
    163 };
    164 
    165 #endif /* _VMPARAM_H_ */
    166