vmparam.h revision 1.1 1 /* $NetBSD: vmparam.h,v 1.1 1995/02/13 23:08:01 cgd Exp $ */
2
3 /*
4 * Copyright (c) 1988 University of Utah.
5 * Copyright (c) 1992, 1993
6 * The Regents of the University of California. 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 and Ralph Campbell.
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 8.2 (Berkeley) 4/22/94
43 */
44
45 /*
46 * Machine dependent constants for Alpha.
47 */
48 /*
49 * USRTEXT is the start of the user text/data space, while USRSTACK
50 * is the top (end) of the user stack. Immediately above the user stack
51 * resides the user structure, which is UPAGES long and contains the
52 * kernel stack.
53 */
54 #define USRTEXT CLBYTES
55 #define USRSTACK VM_MAXUSER_ADDRESS
56
57 /*
58 * Virtual memory related constants, all in bytes
59 */
60 #ifndef MAXTSIZ
61 #define MAXTSIZ (1<<30) /* max text size (1G) */
62 #endif
63 #ifndef DFLDSIZ
64 #define DFLDSIZ (1<<27) /* initial data size (128M) */
65 #endif
66 #ifndef MAXDSIZ
67 #define MAXDSIZ (1<<30) /* max data size (1G) */
68 #endif
69 #ifndef DFLSSIZ
70 #define DFLSSIZ (1<<21) /* initial stack size (2M) */
71 #endif
72 #ifndef MAXSSIZ
73 #define MAXSSIZ (1<<25) /* max stack size (32M) */
74 #endif
75
76 /*
77 * Default sizes of swap allocation chunks (see dmap.h).
78 * The actual values may be changed in vminit() based on MAXDSIZ.
79 * With MAXDSIZ of 16Mb and NDMAP of 38, dmmax will be 1024.
80 * DMMIN should be at least ctod(1) so that vtod() works.
81 * vminit() insures this.
82 */
83 #define DMMIN 32 /* smallest swap allocation */
84 #define DMMAX 4096 /* largest potential swap allocation */
85
86 #ifdef THESE_ARE_WRONG
87 /*
88 * Sizes of the system and user portions of the system page table.
89 */
90 /* SYSPTSIZE IS SILLY; (really number of buffers for I/O) */
91 #define SYSPTSIZE 1228
92 #define USRPTSIZE 1024
93 #endif /* WRONG */
94
95 /*
96 * PTEs for mapping user space into the kernel for phyio operations.
97 * 64 pte's are enough to cover 8 disks * MAXBSIZE.
98 */
99 #ifndef USRIOSIZE
100 #define USRIOSIZE 64
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 1024 /* 8mb */
109 #endif
110
111 /*
112 * Boundary at which to place first MAPMEM segment if not explicitly
113 * specified. Should be a power of two. This allows some slop for
114 * the data segment to grow underneath the first mapped segment.
115 */
116 #define MMSEG 0x200000
117
118 /*
119 * The size of the clock loop.
120 */
121 #define LOOPPAGES (maxfree - firstfree)
122
123 /*
124 * The time for a process to be blocked before being very swappable.
125 * This is a number of seconds which the system takes as being a non-trivial
126 * amount of real time. You probably shouldn't change this;
127 * it is used in subtle ways (fractions and multiples of it are, that is, like
128 * half of a ``long time'', almost a long time, etc.)
129 * It is related to human patience and other factors which don't really
130 * change over time.
131 */
132 #define MAXSLP 20
133
134 /*
135 * A swapped in process is given a small amount of core without being bothered
136 * by the page replacement algorithm. Basically this says that if you are
137 * swapped in you deserve some resources. We protect the last SAFERSS
138 * pages against paging and will just swap you out rather than paging you.
139 * Note that each process has at least UPAGES+CLSIZE pages which are not
140 * paged anyways (this is currently 8+2=10 pages or 5k bytes), so this
141 * number just means a swapped in process is given around 25k bytes.
142 * Just for fun: current memory prices are 4600$ a megabyte on VAX (4/22/81),
143 * so we loan each swapped in process memory worth 100$, or just admit
144 * that we don't consider it worthwhile and swap it out to disk which costs
145 * $30/mb or about $0.75.
146 */
147 #define SAFERSS 4 /* nominal ``small'' resident set size
148 protected against replacement */
149
150 #ifdef THESE_ARE_WRONG
151 #define mapin(pte, v, pfnum, prot) \
152 (*(int *)(pte) = ((pfnum) << PG_SHIFT) | (prot), MachTLBFlushAddr(v))
153 #endif /* WRONG */
154
155 /*
156 * Mach derived constants
157 */
158
159 /* user/kernel map constants */
160 #define VM_MIN_ADDRESS ((vm_offset_t)0x0000000000000000) /* 0 */
161 #define VM_MAXUSER_ADDRESS ((vm_offset_t)0x0000000200000000) /* 8G */
162 #define VM_MAX_ADDRESS VM_MAXUSER_ADDRESS
163 #define VM_MIN_KERNEL_ADDRESS ((vm_offset_t)0xfffffe0000000000)
164 #define VM_MAX_KERNEL_ADDRESS ((vm_offset_t)0xffffffffffffffff)
165
166 /* virtual sizes (bytes) for various kernel submaps */
167 #define VM_MBUF_SIZE (NMBCLUSTERS*MCLBYTES)
168 #define VM_KMEM_SIZE (NKMEMCLUSTERS*CLBYTES)
169 #define VM_PHYS_SIZE (USRIOSIZE*CLBYTES)
170
171 /* some Alpha-specific constants */
172 #define VM_MAX_PHYSADDR ((vm_offset_t)0x0000000080000000) /* max phys addr */
173 #define VPTBASE ((vm_offset_t)0xfffffffc00000000) /* Virt. pg table */
174
175 #ifdef THESE_ARE_WRONG
176 /* pcb base */
177 #define pcbb(p) ((u_int)(p)->p_addr)
178 #endif /* WRONG */
179