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