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