vmparam.h revision 1.14 1 1.14 scottr /* $NetBSD: vmparam.h,v 1.14 1998/04/26 20:06:26 scottr Exp $ */
2 1.6 cgd
3 1.1 briggs /*
4 1.1 briggs * Copyright (c) 1988 University of Utah.
5 1.1 briggs * Copyright (c) 1982, 1990 The Regents of the University of California.
6 1.1 briggs * All rights reserved.
7 1.1 briggs *
8 1.1 briggs * This code is derived from software contributed to Berkeley by
9 1.1 briggs * the Systems Programming Group of the University of Utah Computer
10 1.1 briggs * Science Department.
11 1.1 briggs *
12 1.1 briggs * Redistribution and use in source and binary forms, with or without
13 1.1 briggs * modification, are permitted provided that the following conditions
14 1.1 briggs * are met:
15 1.1 briggs * 1. Redistributions of source code must retain the above copyright
16 1.1 briggs * notice, this list of conditions and the following disclaimer.
17 1.1 briggs * 2. Redistributions in binary form must reproduce the above copyright
18 1.1 briggs * notice, this list of conditions and the following disclaimer in the
19 1.1 briggs * documentation and/or other materials provided with the distribution.
20 1.1 briggs * 3. All advertising materials mentioning features or use of this software
21 1.1 briggs * must display the following acknowledgement:
22 1.1 briggs * This product includes software developed by the University of
23 1.1 briggs * California, Berkeley and its contributors.
24 1.1 briggs * 4. Neither the name of the University nor the names of its contributors
25 1.1 briggs * may be used to endorse or promote products derived from this software
26 1.1 briggs * without specific prior written permission.
27 1.1 briggs *
28 1.1 briggs * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
29 1.1 briggs * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
30 1.1 briggs * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
31 1.1 briggs * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
32 1.1 briggs * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
33 1.1 briggs * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
34 1.1 briggs * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
35 1.1 briggs * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
36 1.1 briggs * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
37 1.1 briggs * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
38 1.1 briggs * SUCH DAMAGE.
39 1.1 briggs */
40 1.1 briggs /*-
41 1.1 briggs * Copyright (C) 1993 Allen K. Briggs, Chris P. Caputo,
42 1.1 briggs * Michael L. Finch, Bradley A. Grantham, and
43 1.1 briggs * Lawrence A. Kesteloot
44 1.1 briggs * All rights reserved.
45 1.1 briggs *
46 1.1 briggs * Redistribution and use in source and binary forms, with or without
47 1.1 briggs * modification, are permitted provided that the following conditions
48 1.1 briggs * are met:
49 1.1 briggs * 1. Redistributions of source code must retain the above copyright
50 1.1 briggs * notice, this list of conditions and the following disclaimer.
51 1.1 briggs * 2. Redistributions in binary form must reproduce the above copyright
52 1.1 briggs * notice, this list of conditions and the following disclaimer in the
53 1.1 briggs * documentation and/or other materials provided with the distribution.
54 1.1 briggs * 3. All advertising materials mentioning features or use of this software
55 1.1 briggs * must display the following acknowledgement:
56 1.1 briggs * This product includes software developed by the Alice Group.
57 1.1 briggs * 4. The names of the Alice Group or any of its members may not be used
58 1.1 briggs * to endorse or promote products derived from this software without
59 1.1 briggs * specific prior written permission.
60 1.1 briggs *
61 1.1 briggs * THIS SOFTWARE IS PROVIDED BY THE ALICE GROUP ``AS IS'' AND ANY EXPRESS OR
62 1.1 briggs * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
63 1.1 briggs * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
64 1.1 briggs * IN NO EVENT SHALL THE ALICE GROUP BE LIABLE FOR ANY DIRECT, INDIRECT,
65 1.1 briggs * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
66 1.1 briggs * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
67 1.1 briggs * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
68 1.1 briggs * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
69 1.1 briggs * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
70 1.1 briggs * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
71 1.1 briggs *
72 1.1 briggs */
73 1.1 briggs /*
74 1.1 briggs * from: Utah $Hdr: vmparam.h 1.16 91/01/18$
75 1.1 briggs *
76 1.6 cgd * @(#)vmparam.h 7.3 (Berkeley) 5/7/91
77 1.1 briggs */
78 1.1 briggs
79 1.12 scottr #ifndef _MAC68K_VMPARAM_H_
80 1.12 scottr #define _MAC68K_VMPARAM_H_
81 1.12 scottr
82 1.1 briggs /*
83 1.7 briggs * Machine dependent constants for mac68k -- mostly derived from hp300.
84 1.1 briggs */
85 1.1 briggs
86 1.1 briggs /*
87 1.1 briggs * USRTEXT is the start of the user text/data space, while USRSTACK
88 1.1 briggs * is the top (end) of the user stack. LOWPAGES and HIGHPAGES are
89 1.1 briggs * the number of pages from the beginning of the P0 region to the
90 1.1 briggs * beginning of the text and from the beginning of the P1 region to the
91 1.1 briggs * beginning of the stack respectively.
92 1.1 briggs *
93 1.7 briggs * NOTE: HP300 uses HIGHPAGES == (0x100000/NBPG) for HP/UX compatibility.
94 1.7 briggs * Do we care? Obviously not at the moment.
95 1.1 briggs */
96 1.3 briggs #define USRTEXT 8192
97 1.1 briggs #define USRSTACK (-HIGHPAGES*NBPG) /* Start of user stack */
98 1.1 briggs #define BTOPUSRSTACK (0x100000-HIGHPAGES) /* btop(USRSTACK) */
99 1.1 briggs #define P1PAGES 0x100000
100 1.1 briggs #define LOWPAGES 0
101 1.7 briggs #define HIGHPAGES 3 /* UPAGES */
102 1.1 briggs
103 1.1 briggs /*
104 1.1 briggs * Virtual memory related constants, all in bytes
105 1.1 briggs */
106 1.1 briggs #ifndef MAXTSIZ
107 1.7 briggs #define MAXTSIZ (8*1024*1024) /* max text size */
108 1.1 briggs #endif
109 1.1 briggs #ifndef DFLDSIZ
110 1.7 briggs #define DFLDSIZ (16*1024*1024) /* initial data size limit */
111 1.1 briggs #endif
112 1.1 briggs #ifndef MAXDSIZ
113 1.7 briggs #define MAXDSIZ (64*1024*1024) /* max data size */
114 1.1 briggs #endif
115 1.1 briggs #ifndef DFLSSIZ
116 1.1 briggs #define DFLSSIZ (512*1024) /* initial stack size limit */
117 1.1 briggs #endif
118 1.1 briggs #ifndef MAXSSIZ
119 1.1 briggs #define MAXSSIZ MAXDSIZ /* max stack size */
120 1.1 briggs #endif
121 1.1 briggs
122 1.1 briggs /*
123 1.1 briggs * Sizes of the system and user portions of the system page table.
124 1.1 briggs */
125 1.1 briggs /* SYSPTSIZE IS SILLY; IT SHOULD BE COMPUTED AT BOOT TIME */
126 1.1 briggs #define SYSPTSIZE (2 * NPTEPG) /* 8mb */
127 1.7 briggs #define USRPTSIZE (1 * NPTEPG) /* 4mb */
128 1.1 briggs
129 1.1 briggs /*
130 1.1 briggs * PTEs for mapping user space into the kernel for phyio operations.
131 1.1 briggs * One page is enough to handle 4Mb of simultaneous raw IO operations.
132 1.1 briggs */
133 1.1 briggs #ifndef USRIOSIZE
134 1.1 briggs #define USRIOSIZE (1 * NPTEPG) /* 4mb */
135 1.1 briggs #endif
136 1.1 briggs
137 1.1 briggs /*
138 1.1 briggs * PTEs for system V style shared memory.
139 1.1 briggs * This is basically slop for kmempt which we actually allocate (malloc) from.
140 1.1 briggs */
141 1.1 briggs #ifndef SHMMAXPGS
142 1.1 briggs #define SHMMAXPGS 1024 /* 4mb */
143 1.1 briggs #endif
144 1.1 briggs
145 1.1 briggs /*
146 1.1 briggs * The size of the clock loop.
147 1.1 briggs */
148 1.1 briggs #define LOOPPAGES (maxfree - firstfree)
149 1.1 briggs
150 1.1 briggs /*
151 1.1 briggs * The time for a process to be blocked before being very swappable.
152 1.1 briggs * This is a number of seconds which the system takes as being a non-trivial
153 1.1 briggs * amount of real time. You probably shouldn't change this;
154 1.1 briggs * it is used in subtle ways (fractions and multiples of it are, that is, like
155 1.1 briggs * half of a ``long time'', almost a long time, etc.)
156 1.1 briggs * It is related to human patience and other factors which don't really
157 1.1 briggs * change over time.
158 1.1 briggs */
159 1.1 briggs #define MAXSLP 20
160 1.1 briggs
161 1.1 briggs /*
162 1.1 briggs * A swapped in process is given a small amount of core without being bothered
163 1.1 briggs * by the page replacement algorithm. Basically this says that if you are
164 1.1 briggs * swapped in you deserve some resources. We protect the last SAFERSS
165 1.1 briggs * pages against paging and will just swap you out rather than paging you.
166 1.1 briggs * Note that each process has at least UPAGES+CLSIZE pages which are not
167 1.1 briggs * paged anyways (this is currently 8+2=10 pages or 5k bytes), so this
168 1.1 briggs * number just means a swapped in process is given around 25k bytes.
169 1.1 briggs * Just for fun: current memory prices are 4600$ a megabyte on VAX (4/22/81),
170 1.1 briggs * so we loan each swapped in process memory worth 100$, or just admit
171 1.1 briggs * that we don't consider it worthwhile and swap it out to disk which costs
172 1.1 briggs * $30/mb or about $0.75.
173 1.10 perry * Update: memory prices have changed recently (9/96). At the current
174 1.10 perry * value of $6 per megabyte, we lend each swapped in process memory worth
175 1.10 perry * $0.15, or just admit that we don't consider it worthwhile and swap it out
176 1.10 perry * to disk which costs $0.20/MB, or just under half a cent.
177 1.1 briggs */
178 1.1 briggs #define SAFERSS 4 /* nominal ``small'' resident set size
179 1.1 briggs protected against replacement */
180 1.1 briggs
181 1.1 briggs /*
182 1.1 briggs * DISKRPM is used to estimate the number of paging i/o operations
183 1.1 briggs * which one can expect from a single disk controller.
184 1.1 briggs */
185 1.1 briggs #define DISKRPM 3600
186 1.1 briggs
187 1.1 briggs /*
188 1.1 briggs * Klustering constants. Klustering is the gathering
189 1.1 briggs * of pages together for pagein/pageout, while clustering
190 1.1 briggs * is the treatment of hardware page size as though it were
191 1.1 briggs * larger than it really is.
192 1.1 briggs *
193 1.1 briggs * KLMAX gives maximum cluster size in CLSIZE page (cluster-page)
194 1.1 briggs * units. Note that ctod(KLMAX*CLSIZE) must be <= DMMIN in dmap.h.
195 1.1 briggs * ctob(KLMAX) should also be less than MAXPHYS (in vm_swp.c)
196 1.1 briggs * unless you like "big push" panics.
197 1.1 briggs */
198 1.1 briggs
199 1.1 briggs #define KLMAX (4/CLSIZE)
200 1.1 briggs #define KLSEQL (2/CLSIZE) /* in klust if vadvise(VA_SEQL) */
201 1.1 briggs #define KLIN (4/CLSIZE) /* default data/stack in klust */
202 1.1 briggs #define KLTXT (4/CLSIZE) /* default text in klust */
203 1.1 briggs #define KLOUT (4/CLSIZE)
204 1.1 briggs
205 1.1 briggs /*
206 1.1 briggs * KLSDIST is the advance or retard of the fifo reclaim for sequential
207 1.1 briggs * processes data space.
208 1.1 briggs */
209 1.1 briggs #define KLSDIST 3 /* klusters advance/retard for seq. fifo */
210 1.1 briggs
211 1.1 briggs /*
212 1.1 briggs * Paging thresholds (see vm_sched.c).
213 1.1 briggs * Strategy of 1/19/85:
214 1.1 briggs * lotsfree is 512k bytes, but at most 1/4 of memory
215 1.1 briggs * desfree is 200k bytes, but at most 1/8 of memory
216 1.7 briggs * Are these still valid in 1995?
217 1.1 briggs */
218 1.5 briggs #define LOTSFREE (512 * 1024)
219 1.1 briggs #define LOTSFREEFRACT 4
220 1.5 briggs #define DESFREE (200 * 1024)
221 1.1 briggs #define DESFREEFRACT 8
222 1.1 briggs
223 1.1 briggs /*
224 1.1 briggs * There are two clock hands, initially separated by HANDSPREAD bytes
225 1.1 briggs * (but at most all of user memory). The amount of time to reclaim
226 1.1 briggs * a page once the pageout process examines it increases with this
227 1.1 briggs * distance and decreases as the scan rate rises.
228 1.1 briggs */
229 1.1 briggs #define HANDSPREAD (2 * 1024 * 1024)
230 1.1 briggs
231 1.1 briggs /*
232 1.1 briggs * The number of times per second to recompute the desired paging rate
233 1.1 briggs * and poke the pagedaemon.
234 1.1 briggs */
235 1.1 briggs #define RATETOSCHEDPAGING 4
236 1.1 briggs
237 1.1 briggs /*
238 1.1 briggs * Believed threshold (in megabytes) for which interleaved
239 1.1 briggs * swapping area is desirable.
240 1.1 briggs */
241 1.1 briggs #define LOTSOFMEM 2
242 1.1 briggs
243 1.1 briggs /*
244 1.1 briggs * Mach derived constants
245 1.1 briggs */
246 1.1 briggs
247 1.1 briggs /* user/kernel map constants */
248 1.1 briggs #define VM_MIN_ADDRESS ((vm_offset_t)0)
249 1.7 briggs #define VM_MAXUSER_ADDRESS ((vm_offset_t)(USRSTACK))
250 1.7 briggs #define VM_MAX_ADDRESS ((vm_offset_t)(0-(UPAGES*NBPG)))
251 1.1 briggs #define VM_MIN_KERNEL_ADDRESS ((vm_offset_t)0)
252 1.7 briggs #define VM_MAX_KERNEL_ADDRESS ((vm_offset_t)(0-NBPG))
253 1.1 briggs
254 1.1 briggs /* virtual sizes (bytes) for various kernel submaps */
255 1.1 briggs #define VM_MBUF_SIZE (NMBCLUSTERS*MCLBYTES)
256 1.1 briggs #define VM_KMEM_SIZE (NKMEMCLUSTERS*CLBYTES)
257 1.1 briggs #define VM_PHYS_SIZE (USRIOSIZE*CLBYTES)
258 1.1 briggs
259 1.1 briggs /* # of kernel PT pages (initial only, can grow dynamically) */
260 1.1 briggs #define VM_KERNEL_PT_PAGES ((vm_size_t)2) /* XXX: SYSPTSIZE */
261 1.1 briggs
262 1.1 briggs /* pcb base */
263 1.1 briggs #define pcbb(p) ((u_int)(p)->p_addr)
264 1.12 scottr
265 1.12 scottr /* Use new VM page bootstrap interface. */
266 1.12 scottr #define MACHINE_NEW_NONCONTIG
267 1.12 scottr
268 1.12 scottr #if defined(MACHINE_NEW_NONCONTIG)
269 1.12 scottr /*
270 1.12 scottr * Constants which control the way the VM system deals with memory segments.
271 1.12 scottr * Most mac68k systems have only 1 physical memory segment, but some have 2.
272 1.14 scottr *
273 1.14 scottr * On the systems that have multiple segments, specifically the IIsi and
274 1.14 scottr * IIci, the optimal configuration is to put the higher-density SIMMs in
275 1.14 scottr * bank B. This is because the on-board video uses main memory in bank A
276 1.14 scottr * for the framebuffer, and a memory controller prevents access during
277 1.14 scottr * video refresh cycles. Even if both banks contain the same amount of
278 1.14 scottr * RAM, a minimum of ~320KB will be subtracted from the amount in bank A
279 1.14 scottr * for the framebuffer (if on-board video is in use).
280 1.12 scottr */
281 1.12 scottr #define VM_PHYSSEG_MAX 2
282 1.14 scottr #define VM_PHYSSEG_STRAT VM_PSTRAT_BIGFIRST
283 1.12 scottr #define VM_PHYSSEG_NOADD
284 1.12 scottr
285 1.12 scottr /*
286 1.12 scottr * pmap-specific data stored in the vm_physmem[] array.
287 1.12 scottr */
288 1.12 scottr struct pmap_physseg {
289 1.12 scottr struct pv_entry *pvent; /* pv table for this seg */
290 1.12 scottr char *attrs; /* page attributes for this seg */
291 1.12 scottr };
292 1.12 scottr #endif /* MACHINE_NEW_NONCONTIG */
293 1.12 scottr
294 1.12 scottr #endif /* _MAC68K_VMPARAM_H_ */
295