vmparam.h revision 1.7 
1/*	$NetBSD: vmparam.h,v 1.7 1995/12/06 22:35:56 pk 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/*
52 * USRTEXT is the start of the user text/data space, while USRSTACK
53 * is the top (end) of the user stack.
54 */
55#define	USRTEXT		0x2000			/* Start of user text */
56#define	USRSTACK	KERNBASE		/* Start of user stack */
57
58/*
59 * Virtual memory related constants, all in bytes
60 */
61#ifndef MAXTSIZ
62#define	MAXTSIZ		(8*1024*1024)		/* max text size */
63#endif
64#ifndef DFLDSIZ
65#define	DFLDSIZ		(16*1024*1024)		/* initial data size limit */
66#endif
67#ifndef MAXDSIZ
68#define	MAXDSIZ		(64*1024*1024)		/* max data size */
69#endif
70#ifndef	DFLSSIZ
71#define	DFLSSIZ		(512*1024)		/* initial stack size limit */
72#endif
73#ifndef	MAXSSIZ
74#define	MAXSSIZ		MAXDSIZ			/* max stack size */
75#endif
76
77/*
78 * Default sizes of swap allocation chunks (see dmap.h).
79 * The actual values may be changed in vminit() based on MAXDSIZ.
80 * With MAXDSIZ of 16Mb and NDMAP of 38, dmmax will be 1024.
81 * DMMIN should be at least ctod(1) so that vtod() works.
82 * vminit() insures this.
83 */
84#define	DMMIN	32			/* smallest swap allocation */
85#define	DMMAX	NBPG			/* largest potential swap allocation */
86#define	DMTEXT	1024			/* swap allocation for text */
87
88/*
89 * Size of shared memory map
90 */
91#ifndef SHMMAXPGS
92#define SHMMAXPGS	1024
93#endif
94
95/*
96 * The time for a process to be blocked before being very swappable.
97 * This is a number of seconds which the system takes as being a non-trivial
98 * amount of real time.  You probably shouldn't change this;
99 * it is used in subtle ways (fractions and multiples of it are, that is, like
100 * half of a ``long time'', almost a long time, etc.)
101 * It is related to human patience and other factors which don't really
102 * change over time.
103 */
104#define	MAXSLP 		20
105
106/*
107 * A swapped in process is given a small amount of core without being bothered
108 * by the page replacement algorithm.  Basically this says that if you are
109 * swapped in you deserve some resources.  We protect the last SAFERSS
110 * pages against paging and will just swap you out rather than paging you.
111 * Note that each process has at least UPAGES+CLSIZE pages which are not
112 * paged anyways (this is currently 8+2=10 pages or 5k bytes), so this
113 * number just means a swapped in process is given around 25k bytes.
114 * Just for fun: current memory prices are 4600$ a megabyte on VAX (4/22/81),
115 * so we loan each swapped in process memory worth 100$, or just admit
116 * that we don't consider it worthwhile and swap it out to disk which costs
117 * $30/mb or about $0.75.
118 */
119#define	SAFERSS		4		/* nominal ``small'' resident set size
120					   protected against replacement */
121
122/*
123 * Mach derived constants
124 */
125
126/*
127 * User/kernel map constants.  Note that sparc/vaddrs.h defines the
128 * IO space virtual base, which must be the same as VM_MAX_KERNEL_ADDRESS:
129 * tread with care.
130 */
131#define VM_MIN_ADDRESS		((vm_offset_t)0)
132#define VM_MAX_ADDRESS		((vm_offset_t)KERNBASE)
133#define VM_MAXUSER_ADDRESS	((vm_offset_t)KERNBASE)
134#define VM_MIN_KERNEL_ADDRESS	((vm_offset_t)KERNBASE)
135#define VM_MAX_KERNEL_ADDRESS	((vm_offset_t)0xfe000000)
136
137/* virtual sizes (bytes) for various kernel submaps */
138#define VM_MBUF_SIZE		(NMBCLUSTERS*MCLBYTES)
139#define VM_KMEM_SIZE		(NKMEMCLUSTERS*CLBYTES)
140
141#define MACHINE_NONCONTIG	/* VM <=> pmap interface modifier */
142
143#if defined (_KERNEL) && !defined(LOCORE)
144vm_offset_t	dvma_mapin __P((struct vm_map *, vm_offset_t, int, int));
145int		dvma_mapout __P((vm_offset_t, vm_offset_t, int));
146#endif
147