vmparam3.h revision 1.9 
1/*	$NetBSD: vmparam3.h,v 1.9 1994/10/26 09:11:29 cgd Exp $	*/
2
3/*
4 * Copyright (c) 1993 Adam Glass
5 * Copyright (c) 1988 University of Utah.
6 * Copyright (c) 1982, 1986, 1990 The Regents of the University of California.
7 * All rights reserved.
8 *
9 * This code is derived from software contributed to Berkeley by
10 * the Systems Programming Group of the University of Utah Computer
11 * Science Department.
12 *
13 * Redistribution and use in source and binary forms, with or without
14 * modification, are permitted provided that the following conditions
15 * are met:
16 * 1. Redistributions of source code must retain the above copyright
17 *    notice, this list of conditions and the following disclaimer.
18 * 2. Redistributions in binary form must reproduce the above copyright
19 *    notice, this list of conditions and the following disclaimer in the
20 *    documentation and/or other materials provided with the distribution.
21 * 3. All advertising materials mentioning features or use of this software
22 *    must display the following acknowledgement:
23 *	This product includes software developed by the University of
24 *	California, Berkeley and its contributors.
25 * 4. Neither the name of the University nor the names of its contributors
26 *    may be used to endorse or promote products derived from this software
27 *    without specific prior written permission.
28 *
29 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
30 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
31 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
32 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
33 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
34 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
35 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
36 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
37 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
38 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
39 * SUCH DAMAGE.
40 *
41 * from: Utah $Hdr: vmparam.h 1.16 91/01/18$
42 *
43 *	@(#)vmparam.h	7.3 (Berkeley) 5/7/91
44 */
45
46#define USRTEXT         NBPG
47#define USRSTACK        0x0E000000
48
49/*
50 * Virtual memory related constants, all in bytes
51 */
52#ifndef MAXTSIZ
53#define	MAXTSIZ		(8*1024*1024)		/* max text size */
54#endif
55#ifndef DFLDSIZ
56#define	DFLDSIZ		(8*1024*1024)		/* initial data size limit */
57#endif
58#ifndef MAXDSIZ
59#define	MAXDSIZ		(32*1024*1024)		/* max data size */
60#endif
61#ifndef	DFLSSIZ
62#define	DFLSSIZ		(512*1024)		/* initial stack size limit */
63#endif
64#ifndef	MAXSSIZ
65#define	MAXSSIZ		(MAXDSIZ)		/* max stack size */
66#endif
67
68/*
69 * Default sizes of swap allocation chunks (see dmap.h).
70 * The actual values may be changed in vminit() based on MAXDSIZ.
71 * With MAXDSIZ of 16Mb and NDMAP of 38, dmmax will be 1024.
72 * DMMIN should be at least ctod(1) so that vtod() works.
73 * vminit() insures this.
74 */
75#define	DMMIN	32			/* smallest swap allocation */
76#define	DMMAX	4096			/* largest potential swap allocation */
77
78/*
79 * PTEs for mapping user space into the kernel for phyio operations.
80 * [this figure is based on the assumption that you can put ptes in real
81 *  memory.  this is a false assumption on a sun3]
82 *
83 */
84#ifndef USRIOSIZE
85#define USRIOSIZE	1
86#endif
87
88/*
89 * The time for a process to be blocked before being very swappable.
90 * This is a number of seconds which the system takes as being a non-trivial
91 * amount of real time.  You probably shouldn't change this;
92 * it is used in subtle ways (fractions and multiples of it are, that is, like
93 * half of a ``long time'', almost a long time, etc.)
94 * It is related to human patience and other factors which don't really
95 * change over time.
96 */
97#define	MAXSLP 		20
98
99/*
100 * A swapped in process is given a small amount of core without being bothered
101 * by the page replacement algorithm.  Basically this says that if you are
102 * swapped in you deserve some resources.  We protect the last SAFERSS
103 * pages against paging and will just swap you out rather than paging you.
104 * Note that each process has at least UPAGES+CLSIZE pages which are not
105 * paged anyways (this is currently 8+2=10 pages or 5k bytes), so this
106 * number just means a swapped in process is given around 25k bytes.
107 * Just for fun: current memory prices are 4600$ a megabyte on VAX (4/22/81),
108 * so we loan each swapped in process memory worth 100$, or just admit
109 * that we don't consider it worthwhile and swap it out to disk which costs
110 * $30/mb or about $0.75.
111 */
112#define	SAFERSS		4		/* nominal ``small'' resident set size
113					   protected against replacement */
114
115#define DVMA_SPACE_SIZE  0x00100000
116#define DVMA_SPACE_START 0x0FD00000
117#define DVMA_SPACE_END   0x0FE00000 /* mon start */
118
119/*
120 * Mach derived constants
121 */
122
123/* user/kernel map constants */
124#define VM_MIN_ADDRESS		((vm_offset_t)0)
125#define VM_MAXUSER_ADDRESS	((vm_offset_t)0x0E000000)
126#define VM_MAX_ADDRESS		((vm_offset_t)0x0FFF00000)
127#define VM_MIN_KERNEL_ADDRESS	((vm_offset_t)0x0E000000)
128#define VM_MAX_KERNEL_ADDRESS	((vm_offset_t)0x0FD00000) /* dvma start */
129
130/* virtual sizes (bytes) for various kernel submaps */
131#define VM_MBUF_SIZE		(NMBCLUSTERS*MCLBYTES)
132#define VM_KMEM_SIZE		(NKMEMCLUSTERS*CLBYTES)
133#define VM_PHYS_SIZE		(USRIOSIZE*CLBYTES)
134