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